Packages

package lcs

Ordering
  1. Alphabetic
Visibility
  1. Public
  2. Protected

Type Members

  1. class DynamicProgLcs[T] extends Lcs[T]

    Implementation of the LCS using dynamic programming.

  2. class Hashed[T] extends AnyRef

    Wraps provided value together with its hashCode.

    Wraps provided value together with its hashCode. Equals is overridden to first check hashCode and then delegate to the wrapped value.

  3. class HashedLcs[T] extends Lcs[T]

    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.

  4. abstract class Lcs[T] extends AnyRef

    The interface to classes that computes the longest common subsequence between two sequences of elements

  5. class Patience[T] extends Lcs[T]

    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

Value Members

  1. object Hashed

Ungrouped