Implementation of the LCS using dynamic programming.
Wraps provided value together with its hashCode.
Speeds up LCS computations by pre-computing hashes for all objects.
Speeds up LCS computations by pre-computing hashes for all objects. Very useful for objects that recompute hashCodes on each invocation.
The interface to classes that computes the longest common subsequence between two sequences of elements
Implementation of the patience algorithm [1] to compute the longest common subsequence
Implementation of the patience algorithm [1] to compute the longest common subsequence
[1] http://alfedenzo.livejournal.com/170301.html
Wraps provided value together with its hashCode. Equals is overridden to first check hashCode and then delegate to the wrapped value.