sdiff 0.1.1

Find the differences between two sequences
Documentation
  • Coverage
  • 100%
    20 out of 20 items documented0 out of 9 items with examples
  • Size
  • Source code size: 61.65 kB This is the summed size of all the files inside the crates.io package for this release.
  • Documentation size: 2.05 MB This is the summed size of all files generated by rustdoc for all configured targets
  • Ø build duration
  • this release: 17s Average build duration of successful builds.
  • all releases: 16s Average build duration of successful builds in releases after 2024-10-23.
  • Links
  • innoave/sdiff
    0 0 0
  • crates.io
  • Dependencies
  • Versions
  • Owners
  • haraldmaida

sdiff

crates.io docs.rs MSRV code coverage

Find the differences between two sequences.

A diffing function that finds the longest common subsequence (LCS) of two sequences. The found LCS can be easily transformed to a shortest edit script (SES). The implementation is based on the difference algorithm by Eugene W. Myers.

This crate is developed for being used in the asserting crate as none of the many existing similar crates fulfills all requirements.

The requirements are:

  • no-std: no dependency to the std-lib
  • dual licensed under MIT or Apache-2.0
  • simple to use
  • fast to compile
  • small binary size
  • minimal memory usage