Package generic.algorithms

package generic.algorithms
  • Classes
    Class
    Description
    CRC64
     
    Lcs<T>
    Abstract class for finding the Longest Common Subsequence (LCS) between two sequences of Matchable objects, x and y.
    ReducingLcs<I,T>
    Calculates the longest common subsequence (LCS) between two sequences of Matchable objects, x and y.
    ReducingListBasedLcs<T>
    An implementation of the ReducingLcs that takes as its input a list of <T>items, where the list is the 'sequence' being checked for the Longest Common Subsequence.
    StringReducingLcs
    A reducing LCS that works on Strings.
    WordDiffer
    Finds differences between two words (any two Strings).