Examples of com.topologi.diffx.event.DiffXEvent

com.topologi.diffx.event.DiffXEvent
Defines and event that can be processed by DiffX.
The main characteristics of a Diff-X event is that it can be compared for equality with another Diff-X event.
Events can be associated with a weight that can be used or ignored by an algorithm. The more weight the less likely an event will be considered to have been modified. The weight can change depending on the algorithm or configuration used.
For convenience, this interface extends the XMLWritable and XMLFormattable in order to turn an event into XML easily. This may change in the future, if the impact on performance is too heavy. @author Christophe Lauret @version 7 April 2005

   * 
   * @param i The X position.
   * @param j The Y position.
   */
  private void printLost(int i, int j) {
    DiffXEvent e1 = this.sequence1.getEvent(i);
    DiffXEvent e2 = this.sequence2.getEvent(j);
    System.err.println("(!) Ambiguous choice in ("+i+","+j+")");
    System.err.println(" ? +"+ShortStringFormatter.toShortString(e1));
    System.err.println(" ? -"+ShortStringFormatter.toShortString(e2));
    System.err.println(" current="+ShortStringFormatter.toShortString(this.estate.current()));
    System.err.println(" value in X+1="+this.matrix.get(i+1, j));

View Full Code Here

    if (this.length1 == 0 || this.length2 == 0) return;
    // calculate the LCS length to fill the matrix
    length();
    int i = 0;
    int j = 0;
    DiffXEvent e1 = this.sequence1.getEvent(i);
    DiffXEvent e2 = this.sequence2.getEvent(j);
    // start walking the matrix
    while (i < super.length1 && j < super.length2) {
      e1 = this.sequence1.getEvent(i);
      e2 = this.sequence2.getEvent(j);
      // both elements are considered equal

View Full Code Here

   * 
   * @param i The X position.
   * @param j The Y position.
   */
  private void printLost(int i, int j) {
    DiffXEvent e1 = this.sequence1.getEvent(i);
    DiffXEvent e2 = this.sequence2.getEvent(j);
    System.err.println("(!) Ambiguous choice in ("+i+","+j+")");
    System.err.println(" ? +"+ShortStringFormatter.toShortString(e1));
    System.err.println(" ? -"+ShortStringFormatter.toShortString(e2));
    System.err.println(" current="+ShortStringFormatter.toShortString(this.estate.current()));
    System.err.println(" value in X+1="+this.matrix.get(i+1, j));

View Full Code Here

    if (this.length1 == 0 || this.length2 == 0) return;
    // calculate the LCS length to fill the matrix
    length();
    int i = 0;
    int j = 0;
    DiffXEvent e1 = this.sequence1.getEvent(i);
    DiffXEvent e2 = this.sequence2.getEvent(j);
    // start walking the matrix
    while (i < this.length1 && j < this.length2) {
      e1 = this.sequence1.getEvent(i);
      e2 = this.sequence2.getEvent(j);
      // we can only insert or delete, priority to insert

View Full Code Here

   * 
   * @param i The X position.
   * @param j The Y position.
   */
  private void printLost(int i, int j) {
    DiffXEvent e1 = this.sequence1.getEvent(i);
    DiffXEvent e2 = this.sequence2.getEvent(j);
    System.err.println("(!) Ambiguous choice in ("+i+","+j+")");
    System.err.println(" ? +"+ShortStringFormatter.toShortString(e1));
    System.err.println(" ? -"+ShortStringFormatter.toShortString(e2));
    System.err.println(" current="+ShortStringFormatter.toShortString(this.estate.current()));
    System.err.println(" value in X+1="+this.matrix.get(i+1, j));

View Full Code Here

   * @throws NullPointerException
   * @throws IOException
   */
  public static void formatEventSequence(EventSequence eventSequence, DiffXFormatter formatter) throws NullPointerException, IOException {
  List<DiffXEvent> sequence = eventSequence.events();
    DiffXEvent x = null;
  for (int i = 0; i < sequence.size(); i++) {
      x = (DiffXEvent) sequence.get(i);
      formatter.format(x);
    }
  }

View Full Code Here

    if (this.length1 == 0 || this.length2 == 0) return;
    // calculate the LCS length to fill the matrix
    length();
    int i = 0;
    int j = 0;
    DiffXEvent e1 = this.sequence1.getEvent(i);
    DiffXEvent e2 = this.sequence2.getEvent(j);
    // start walking the matrix
    while (i < super.length1 && j < super.length2) {
      e1 = this.sequence1.getEvent(i);
      e2 = this.sequence2.getEvent(j);

View Full Code Here

0 1

TOP

Related Classes of com.topologi.diffx.event.DiffXEvent

com.topologi.diffx.algorithm.DiffXFitopsy

com.topologi.diffx.algorithm.DiffXFitsy

com.topologi.diffx.algorithm.DiffXFitWesyma

com.topologi.diffx.algorithm.GuanoAlgorithm

com.topologi.diffx.Docx4jDriver

com.topologi.diffx.sequence.EventSequence

com.topologi.diffx.sequence.EventSequenceUtils

com.topologi.diffx.sequence.NaiveSequenceSlicer

com.topologi.diffx.sequence.SequenceSlicer

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.