Commit graph

8 commits

Author SHA1 Message Date
taca
f6218d72b4 Update ruby-diff-lcs to 1.2.5.
== 1.2.5 / 2013-11-08

* Bugs fixed:
  * Comparing arrays flattened them too far, especially with Diff::LCS.sdiff.
    https://github.com/halostatue/diff-lcs/pull/23
2014-03-14 18:08:39 +00:00
taca
e2083c9d77 Update ruby-diff-lcs to 1.2.4.
=== 1.2.4 / 2013-04-20

* Bugs fixed:
  * A bug was introduced after 1.1.3 when pruning common sequences at the start
    of comparison. Paul Kunysch (@pck) fixed this in pull request 18. Thanks!
    https://github.com/halostatue/diff-lcs/pull/18
* The Rubinius (1.9 mode) bug in rubinius/rubinius#2268 has been fixed by the
  Rubinius team two days after it was filed. Thanks for fixing this so quickly!
  https://github.com/rubinius/rubinius/issues/2268
* Switching to Raggi's hoe-gemspec2 for gemspec generation.

== 1.2.3 / 2013-04-11

* Bugs Fixed:
  * The new encoding detection for diff output generation (added in 1.2.2)
    introduced a bug if the left side of the comparison was the empty set.
    Originally found in rspec/rspec-expectations#238 and
    rspec/rspec-expectations#239. Jon Rowe developed a reasonable heuristic
    (left side, right side, empty string literal) to avoid this bug.
    https://github.com/rspec/rspec-expectations/pull/238
    https://github.com/rspec/rspec-expectations/pull/239
* There is a known issue with Rubinius in 1.9 mode reported in
  rubinius/rubinius#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.
  https://github.com/rubinius/rubinius/issues/2268
  https://travis-ci.org/halostatue/diff-lcs/jobs/6241195

== 1.2.2 / 2013-03-30

* Bugs Fixed:
  * Diff::LCS::Hunk could not properly generate a difference for comparison
    sets that are not US-ASCII-compatible because of the use of literal regular
    expressions and strings. Jon Rowe (JonRowe) found this in
    rspec/rspec-expectations#219 and provided a first pass implementation in
    diff-lcs#15. I've reworked it because of test failures in Rubinius when
    running in Ruby 1.9 mode. This coerces the added values to the encoding of
    the old dataset (as determined by the first piece of the old dataset).
    https://github.com/rspec/rspec-expectations/issues/219
    https://github.com/halostatue/diff-lcs/pull/15
* Adding Travis CI testing for Ruby 2.0.
2013-06-16 17:21:49 +00:00
taca
5ab0e43bd9 Update ruby-diff-lcs to 1.2.1.
== 1.2.1 / 2013-02-09

* Bugs Fixed:
  * As seen in https://github.com/rspec/rspec-expectations/pull/200, the
    release of Diff::LCS 1.2 introduced an unnecessary public API change to
    Diff::LCS::Hunk (see the change at
    https://github.com/rspec/rspec-expectations/commit/3d6fc82c for details).
    The new method name (and behaviour) is more correct, but I should not have
    renamed the function or should have at least provided an alias. This
    release restores Diff::LCS::Hunk#unshift as an alias to
    #merge. Note that the old #unshift behaviour was incorrect and will not be
    restored.

== 1.2.0 / 2013-01-21
* Minor Enhancements:
  * Added special case handling for Diff::LCS.patch so that it handles patches
    that are empty or contain no changes.
  * Added two new methods (#patch\_me and #unpatch\_me) to the includable
    module.
* Bugs Fixed:
  * Fixed issue #1 patch direction detection.
    https://github.com/halostatue/diff-lcs/issues/1
  * Resolved issue #2 by handling string[string.size, 1] properly (it returns
    "" not nil). https://github.com/halostatue/diff-lcs/issues/2
  * Michael Granger (ged) fixed an implementation error in Diff::LCS::Change
    and added specs in pull request #8. Thanks!
    https://github.com/halostatue/diff-lcs/issues/8
  * Made the code auto-testable.
  * Vít Ondruch (voxik) provided the latest version of the GPL2 license file in
    pull request #10. Thanks! https://github.com/halostatue/diff-lcs/issues/10
  * Fixed a documentation issue with the includable versions of #patch! and
    #unpatch! where they implied that they would replace the original value.
    Given that Diff::LCS.patch always returns a copy, the documentation was
    incorrect and has been corrected. To provide the behaviour that was
    originally documented, two new methods were added to provide this
    behaviour. Found by scooter-dangle in issue #12. Thanks!
    https://github.com/halostatue/diff-lcs/issues/12
* Code Style Changes:
  * Removed trailing spaces.
  * Calling class methods using '.' instead of '::'.
  * Vít Ondruch (voxik) removed unnecessary shebangs in pull request #9.
    Thanks! https://github.com/halostatue/diff-lcs/issues/9
  * Kenichi Kamiya (kachick) removed some warnings of an unused variable in
    lucky pull request #13. https://github.com/halostatue/diff-lcs/issues/13
    Thanks!
  * Embarked on a major refactoring to make the files a little more manageable
    and understand the code on a deeper level.
  * Adding to http://travis-ci.org.
2013-02-11 02:41:42 +00:00
taca
dab08f67f5 Update ruby-diff-lcs package to 1.1.3.
== 1.1.3 / 2011-08-27
* Converted to 'hoe' for release.
* Converted tests to RSpec 2.
* Extracted the body of htmldiff into a class available from
  diff/lcs/htmldiff.
* Migrated development and issue tracking to GitHub.
* Bugs fixed:
  - Eliminated the explicit use of RubyGems in both bin/htmldiff and bin/ldiff.
    Resolves issue 4 (https://github.com/halostatue/diff-lcs/issues/4).
  - Eliminated Ruby warnings. Resolves issue 3
    (https://github.com/halostatue/diff-lcs/issues/3).
2011-09-12 13:38:16 +00:00
taca
b4396f3951 * Use lang/ruby/gem.mk instead of misc/rubygems/rubygem.mk.
* Add LICENSE.
* Remove default value of GEM_BUILD.
2010-09-10 08:07:00 +00:00
joerg
73ae0afd90 Remove @dirrm entries from PLISTs 2009-06-14 18:17:11 +00:00
taca
a80c036431 Add HOMEPAGE. 2008-06-22 16:10:51 +00:00
jlam
8e2ff57f2c Initial import of ruby18-diff-lcs-1.1.2 as textproc/ruby-diff-lcs.
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.
2008-04-04 15:21:20 +00:00