Examples of com.topologi.diffx.algorithm.DiffXFitsy

com.topologi.diffx.algorithm.DiffXFitsy

Performs the diff comparison using the LCS algorithm.

Implementation note: this algorithm effectively detects the correct changes in the sequences, but will not necessarily return events that can be serialised as well-formed XML as they stand.

Known problem in this implementation: elements that contain themselves tend to generate events that are harder to serialise as XML.

This class is said 'fit' because it will adapt the matrix to the sequences that it is being given in order to improve performance.

Note: The name of this class comes from a contracted version of the features of this algorithm, as explained below:

Weighted, each token is has a given weight;
Symmetrical, when possible, the algorithm will try to choose a path that is symmetrical in regards to the arrangement of the tokens;
Matrix, this class uses a matrix for its internal representation;

This class is not synchronised. @author Christophe Lauret @version 8 April 2005

   * @return The algorithm to use.
   */
  private static DiffXAlgorithm getAlgorithm(String[] args, EventSequence seq1, EventSequence seq2) {
    String loaderArg = CommandLine.getParameter("-A", args);
    if (loaderArg == null || "fitsy".equals(loaderArg))
      return new DiffXFitsy(seq1, seq2);
    else if ("guano".equals(loaderArg))
      return new GuanoAlgorithm(seq1, seq2);
    else if ("fitopsy".equals(loaderArg))
      return new DiffXFitopsy(seq1, seq2);
    else if ("kumar".equals(loaderArg))

Examples of com.topologi.diffx.algorithm.DiffXFitsy

Related Classes of com.topologi.diffx.algorithm.DiffXFitsy