Provide a list of changes between two sequenced collections
Diff::LCS computes the difference between two Enumerable sequences using the McIlroy-Hunt longest common subsequence (LCS) algorithm. It includes utilities to create a simple HTML diff output format and a standard diff-like tool.
Release | Stable | Testing |
---|---|---|
Fedora Rawhide | 1.3-11.fc35 | - |
Fedora 35 | 1.3-11.fc35 | - |
Fedora 34 | 1.3-10.fc34 | - |
EPEL 7 | 1.1.3-2.2.el7 | - |
You can contact the maintainers of this package via email at
rubygem-diff-lcs dash maintainers at fedoraproject dot org
.