diff-lcs
Sequence diff library
A Ruby library for generating differences between sequences using the McIlroy-Hunt LCS algorithm
Generate difference sets between Ruby sequences.
289 stars
3 watching
57 forks
Language: Ruby
last commit: 5 months ago Related projects:
Repository | Description | Stars |
---|---|---|
| A pure Swift library for calculating differences between two sets of data. | 122 |
| Compares two sequences of characters using the Wu-Levenshtein distance algorithm to identify differences. | 17 |
| A Swift library for calculating differences and generating patches between collections. | 664 |
| A flexible and extensible machine learning library for Ruby | 385 |
| An implementation of the Jaro-Winkler distance algorithm to compare strings | 195 |
| A library that allows gradients to be propagated through sorting operations, enabling differentiable sorting networks. | 107 |
| Provides an easy-to-use interface for generating diffs from two strings or files using Unix diff. | 1,269 |
| Provides binary diff and patch capabilities in Go | 101 |
| A component library for displaying diffs of text | 29 |
| An implementation of the longest common subsequence algorithm in Swift. | 213 |
| A Ruby library for parsing natural language date and time ranges | 28 |
| Enables backpropagation in distributed settings and facilitates model parallelism using differentiable communication between processes | 62 |
| Provides an efficient implementation of the diff algorithm in Scala | 58 |
| A Pure OCaml implementation of a differential file diffing algorithm | 20 |
| A Ruby implementation of Threshold Secret Sharing as defined in the IETF Internet-Draft draft-mcgrew-tss-03.txt | 23 |