Rubygems | Latest Versions for diff-lcshttps://index.rubygems.org/gems2024-01-31T19:32:52Zdiff-lcs (1.5.1)https://index.rubygems.org/gems/diff-lcs/versions/1.5.12024-01-31T19:32:51ZAustin ZieglerDiff::LCS computes the difference between two Enumerable sequences using the McIlroy-Hunt longest common subsequence (LCS) algorithm
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.
This is release 1.4.3, providing a simple extension that allows for
Diff::LCS::Change objects to be treated implicitly as arrays and fixes a
number of formatting issues.
Ruby versions below 2.5 are soft-deprecated, which means that older versions
are no longer part of the CI test suite. If any changes have been introduced
that break those versions, bug reports and patches will be accepted, but it
will be up to the reporter to verify any fixes prior to release. The next
major release will completely break compatibility. diff-lcs (1.5.0)https://index.rubygems.org/gems/diff-lcs/versions/1.5.02021-12-23T06:02:16ZAustin ZieglerDiff::LCS computes the difference between two Enumerable sequences using the McIlroy-Hunt longest common subsequence (LCS) algorithm
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.
This is release 1.4.3, providing a simple extension that allows for
Diff::LCS::Change objects to be treated implicitly as arrays and fixes a
number of formatting issues.
Ruby versions below 2.5 are soft-deprecated, which means that older versions
are no longer part of the CI test suite. If any changes have been introduced
that break those versions, bug reports and patches will be accepted, but it
will be up to the reporter to verify any fixes prior to release. The next
major release will completely break compatibility. diff-lcs (1.4.4)https://index.rubygems.org/gems/diff-lcs/versions/1.4.42020-07-01T18:30:14ZAustin ZieglerDiff::LCS computes the difference between two Enumerable sequences using the McIlroy-Hunt longest common subsequence (LCS) algorithm
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.
This is release 1.4.3, providing a simple extension that allows for
Diff::LCS::Change objects to be treated implicitly as arrays and fixes a
number of formatting issues.
Ruby versions below 2.5 are soft-deprecated, which means that older versions
are no longer part of the CI test suite. If any changes have been introduced
that break those versions, bug reports and patches will be accepted, but it
will be up to the reporter to verify any fixes prior to release. The next
major release will completely break compatibility. diff-lcs (1.4.3)https://index.rubygems.org/gems/diff-lcs/versions/1.4.32020-06-29T13:04:28ZAustin ZieglerDiff::LCS computes the difference between two Enumerable sequences using the McIlroy-Hunt longest common subsequence (LCS) algorithm
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.
This is release 1.4.3, providing a simple extension that allows for
Diff::LCS::Change objects to be treated implicitly as arrays and fixes a
number of formatting issues.
Ruby versions below 2.5 are soft-deprecated, which means that older versions
are no longer part of the CI test suite. If any changes have been introduced
that break those versions, bug reports and patches will be accepted, but it
will be up to the reporter to verify any fixes prior to release. The next
major release will completely break compatibility. diff-lcs (1.4.2)https://index.rubygems.org/gems/diff-lcs/versions/1.4.22020-06-24T03:19:52ZAustin ZieglerDiff::LCS computes the difference between two Enumerable sequences using the McIlroy-Hunt longest common subsequence (LCS) algorithm
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.
This is release 1.4, providing a simple extension that allows for
Diff::LCS::Change objects to be treated implicitly as arrays. Ruby versions
below 2.5 are soft-deprecated.
This means that older versions are no longer part of the CI test suite. If any
changes have been introduced that break those versions, bug reports and patches
will be accepted, but it will be up to the reporter to verify any fixes prior
to release. A future release will completely break compatibility. diff-lcs (1.4.1)https://index.rubygems.org/gems/diff-lcs/versions/1.4.12020-06-23T15:53:54ZAustin ZieglerDiff::LCS computes the difference between two Enumerable sequences using the McIlroy-Hunt longest common subsequence (LCS) algorithm
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.
This is release 1.4, providing a simple extension that allows for
Diff::LCS::Change objects to be treated implicitly as arrays. Ruby versions
below 2.5 are soft-deprecated.
This means that older versions are no longer part of the CI test suite. If any
changes have been introduced that break those versions, bug reports and patches
will be accepted, but it will be up to the reporter to verify any fixes prior
to release. A future release will completely break compatibility. diff-lcs (1.4)https://index.rubygems.org/gems/diff-lcs/versions/1.42020-06-23T03:47:31ZAustin ZieglerDiff::LCS computes the difference between two Enumerable sequences using the McIlroy-Hunt longest common subsequence (LCS) algorithm
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.
This is release 1.4, providing a simple extension that allows for
Diff::LCS::Change objects to be treated implicitly as arrays. Ruby versions
below 2.5 are soft-deprecated.
This means that older versions are no longer part of the CI test suite. If any
changes have been introduced that break those versions, bug reports and patches
will be accepted, but it will be up to the reporter to verify any fixes prior
to release. A future release will completely break compatibility. diff-lcs (1.3)https://index.rubygems.org/gems/diff-lcs/versions/1.32017-01-18T23:44:17ZAustin ZieglerDiff::LCS computes the difference between two Enumerable sequences using the McIlroy-Hunt longest common subsequence (LCS) algorithm
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.
This is release 1.3, providing a tentative fix to a long-standing issue related
to incorrect detection of a patch direction. Also modernizes the gem
infrastructure, testing infrastructure, and provides a warning-free experience
to Ruby 2.4 users. diff-lcs (1.2.5)https://index.rubygems.org/gems/diff-lcs/versions/1.2.52013-11-08T03:40:51ZAustin ZieglerDiff::LCS computes the difference between two Enumerable sequences using the McIlroy-Hunt longest common subsequence (LCS) algorithm
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.
This is release 1.2.4, fixing a bug introduced after diff-lcs 1.1.3 that did
not properly prune common sequences at the beginning of a comparison set.
Thanks to Paul Kunysch for fixing this issue.
Coincident with the release of diff-lcs 1.2.3, we reported an issue with
Rubinius in 1.9 mode
({rubinius/rubinius#2268}[https://github.com/rubinius/rubinius/issues/2268]).
We are happy to report that this issue has been resolved. diff-lcs (1.2.4)https://index.rubygems.org/gems/diff-lcs/versions/1.2.42013-04-21T00:08:04ZAustin ZieglerDiff::LCS computes the difference between two Enumerable sequences using the McIlroy-Hunt longest common subsequence (LCS) algorithm
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.
This is release 1.2.4, fixing a bug introduced after diff-lcs 1.1.3 that did
not properly prune common sequences at the beginning of a comparison set.
Thanks to Paul Kunysch for fixing this issue.
Coincident with the release of diff-lcs 1.2.3, we reported an issue with
Rubinius in 1.9 mode
({rubinius/rubinius#2268}[https://github.com/rubinius/rubinius/issues/2268]).
We are happy to report that this issue has been resolved. diff-lcs (1.2.3)https://index.rubygems.org/gems/diff-lcs/versions/1.2.32013-04-12T02:30:55ZAustin ZieglerDiff::LCS computes the difference between two Enumerable sequences using the McIlroy-Hunt longest common subsequence (LCS) algorithm
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.
This is release 1.2.3, fixing a bug in value comparison where the left side of
the comparison was the empty set, preventing the detection of encoding. Thanks
to Jon Rowe for fixing this issue. This is a strongly recommended release.
*Note*: There is a known issue with Rubinius in 1.9 mode reported in
{rubinius/rubinius#2268}[https://github.com/rubinius/rubinius/issues/2268] and
demonstrated in the Travis CI builds. For all other tested platforms, diff-lcs
is considered stable. As soon as a suitably small test-case can be created for
the Rubinius team to examine, this will be added to the Rubinius issue around
this. diff-lcs (1.2.2)https://index.rubygems.org/gems/diff-lcs/versions/1.2.22013-03-30T21:32:40ZAustin ZieglerDiff::LCS computes the difference between two Enumerable sequences using the McIlroy-Hunt longest common subsequence (LCS) algorithm
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.
This is release 1.2.2, fixing a bug that prevented comparison of values that
are not US-ASCII-compatible. Thanks to Jon Rowe for finding and providing most
of the work behind this issue. This is a recommended release. diff-lcs (1.2.1)https://index.rubygems.org/gems/diff-lcs/versions/1.2.12013-02-09T16:28:10ZAustin ZieglerDiff::LCS computes the difference between two Enumerable sequences using the McIlroy-Hunt longest common subsequence (LCS) algorithm
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.
This is release 1.2.1, restoring the public API to what existed in Diff::LCS
1.1.x. Everyone is strongly encouraged to upgrade to this version as it fixes
all known outstanding issues. diff-lcs (1.2.0)https://index.rubygems.org/gems/diff-lcs/versions/1.2.02013-01-21T06:36:50ZAustin ZieglerDiff::LCS computes the difference between two Enumerable sequences using the McIlroy-Hunt longest common subsequence (LCS) algorithm
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.
This is release 1.2. Everyone is strongly encouraged to upgrade to this version
as it fixes all known outstanding issues. diff-lcs (1.1.3)https://index.rubygems.org/gems/diff-lcs/versions/1.1.32011-08-28T02:01:05ZAustin ZieglerDiff::LCS is a port of Perl's Algorithm::Diff that uses the McIlroy-Hunt longest common subsequence (LCS) algorithm to compute intelligent differences between two sequenced enumerable containers
Diff::LCS is a port of Perl's Algorithm::Diff that uses the McIlroy-Hunt
longest common subsequence (LCS) algorithm to compute intelligent differences
between two sequenced enumerable containers. The implementation is based on
Mario I. Wolczko's {Smalltalk version 1.2}[ftp://st.cs.uiuc.edu/pub/Smalltalk/MANCHESTER/manchester/4.0/diff.st]
(1993) and Ned Konz's Perl version
{Algorithm::Diff 1.15}[http://search.cpan.org/~nedkonz/Algorithm-Diff-1.15/].
This is release 1.1.3, fixing several small bugs found over the years. Version
1.1.0 added new features, including the ability to #patch and #unpatch changes
as well as a new contextual diff callback, Diff::LCS::ContextDiffCallbacks,
that should improve the context sensitivity of patching.
This library is called Diff::LCS because of an early version of Algorithm::Diff
which was restrictively licensed. This version has seen a minor license change:
instead of being under Ruby's license as an option, the third optional license
is the MIT license. diff-lcs (1.1.2)https://index.rubygems.org/gems/diff-lcs/versions/1.1.22009-07-25T18:27:02ZProvides a list of changes that represent the difference between two sequenced collections.
Diff::LCS is a port of Algorithm::Diff that uses the McIlroy-Hunt longest common subsequence (LCS) algorithm to compute intelligent differences between two sequenced enumerable containers. The implementation is based on Mario I. Wolczko's Smalltalk version (1.2, 1993) and Ned Konz's Perl version (Algorithm::Diff). diff-lcs (1.1.1)https://index.rubygems.org/gems/diff-lcs/versions/1.1.12009-07-25T18:27:02ZProvides a list of changes that represent the difference between two sequenced collections.
Diff::LCS is a port of Algorithm::Diff that uses the McIlroy-Hunt longest common subsequence (LCS) algorithm to compute intelligent differences between two sequenced enumerable containers. The implementation is based on Mario I. Wolczko's Smalltalk version (1.2, 1993) and Ned Konz's Perl version (Algorithm::Diff).