Diff::LCS README
================
Diff::LCS is a port of Algorithm::Diff[1] that uses the McIlroy-Hunt longest common subsequence (LCS) algorithm to compute intelligent differences between two sequenced enumerable containers[2]. The implementation is based on Mario I. Wolczko's[3] Smalltalk version (1.2, 1993)[4] and Ned Konz's[5] Perl version (Algorithm::Diff)[6].

This release is version 1.1.2, fixing an htmldiff bug in 1.1.1. 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.

Using this module is quite simple. By default, Diff::LCS does not extend objects with the Diff::LCS interface, but will be called as if it wer

Journal Entries

Avatar

Trying out diff-lcs for ohloh's code diffing (instead of gnu diff). Will need to test out against a bunch of test projects for comparison. jason — 8 months ago

See All Journal Entries


Ratings & Reviews

Community Rating
0.0/5.0

Based on 0 user ratings.

Your Rating

Click to rate this project.

Links

0 links submitted so far. Submit your own links.

Download Page
6 downloads

Who uses Diff-LCS?


Who contributes to Diff-LCS?

Anon32
I'm a contributor

Who manages Diff-LCS?

I'm a manager

Where in the world?



Project Cost

This calculator estimates how much it would cost to hire a team to write this project from scratch. More »
Include
Codebase 1,954
Effort (est.) 0 Person Years
Avg. Salary $ year
$ 22,226