Examples of MyersDiff

org.apache.commons.jrcs.diff.myers.MyersDiff
s.arizona.edu/people/gene/"> Eugene Myers differencing algorithm.
See the paper at http://www.cs.arizona.edu/people/gene/PAPERS/diff.ps @version $Revision: 1.7 $ $Date: 2003/10/13 08:00:24 $ @author Juanco Anez @see Delta @see Revision @see Diff
org.apache.wicket.util.diff.myers.MyersDiff
s.arizona.edu/people/gene/"> Eugene Myers differencing algorithm.
See the paper at http://www.cs.arizona.edu/people/gene/PAPERS/diff.ps @version $Revision: 1.1 $ $Date: 2006/03/12 00:24:21 $ @author Juanco Anez @see Delta @see Revision @see Diff
org.eclipse.jgit.diff.MyersDiff
Diff algorithm, based on "An O(ND) Difference Algorithm and its Variations", by Eugene Myers. The basic idea is to put the line numbers of text A as columns ("x") and the lines of text B as rows ("y"). Now you try to find the shortest "edit path" from the upper left corner to the lower right corner, where you can always go horizontally or vertically, but diagonally from (x,y) to (x+1,y+1) only if line x in text A is identical to line y in text B. Myers' fundamental concept is the "furthest reaching D-path on diagonal k": a D-path is an edit path starting at the upper left corner and containing exactly D non-diagonal elements ("differences"). The furthest reaching D-path on diagonal k is the one that contains the most (diagonal) elements which ends on diagonal k (where k = y - x). Example: H E L L O W O R L D ____ L \___ O \___ W \________ Since every D-path has exactly D horizontal or vertical elements, it can only end on the diagonals -D, -D+2, ..., D-2, D. Since every furthest reaching D-path contains at least one furthest reaching (D-1)-path (except for D=0), we can construct them recursively. Since we are really interested in the shortest edit path, we can start looking for a 0-path, then a 1-path, and so on, until we find a path that ends in the lower right corner. To save space, we do not need to store all paths (which has quadratic space requirements), but generate the D-paths simultaneously from both sides. When the ends meet, we will have found "the middle" of the path. From the end points of that diagonal part, we can generate the rest recursively. This only requires linear space. The overall (runtime) complexity is O(N * D^2 + 2 * N/2 * (D/2)^2 + 4 * N/4 * (D/4)^2 + ...) = O(N * D^2 * 5 / 4) = O(N * D^2), (With each step, we have to find the middle parts of twice as many regions as before, but the regions (as well as the D) are halved.) So the overall runtime complexity stays the same with linear space, albeit with a larger constant factor. @param < S> type of sequence.
org.suigeneris.jrcs.diff.myers.MyersDiff

Examples of org.apache.wicket.util.diff.myers.MyersDiff

    }
  }


  protected DiffAlgorithm defaultAlgorithm()
  {
    return new MyersDiff();
  }

View Full Code Here

Examples of org.apache.wicket.util.diff.myers.MyersDiff

    }
  }


  protected DiffAlgorithm defaultAlgorithm()
  {
    return new MyersDiff();
  }

View Full Code Here

Examples of org.apache.wicket.util.diff.myers.MyersDiff

    }
    }


    protected DiffAlgorithm defaultAlgorithm()
    {
        return new MyersDiff();
    }

View Full Code Here

Examples of org.eclipse.jgit.diff.MyersDiff

    List<Sequence> sequences = new ArrayList<Sequence>(3);
    sequences.add(base);
    sequences.add(ours);
    sequences.add(theirs);
    MergeResult result = new MergeResult(sequences);
    EditList oursEdits = new MyersDiff(base, ours).getEdits();
    Iterator<Edit> baseToOurs = oursEdits.iterator();
    EditList theirsEdits = new MyersDiff(base, theirs).getEdits();
    Iterator<Edit> baseToTheirs = theirsEdits.iterator();
    int current = 0; // points to the next line (first line is 0) of base
                     // which was not handled yet
    Edit oursEdit = nextEdit(baseToOurs);
    Edit theirsEdit = nextEdit(baseToTheirs);

View Full Code Here

Examples of org.eclipse.jgit.diff.MyersDiff

          if (tw.getFileMode(0).getObjectType() == Constants.OBJ_BLOB)
            oldImage = openBlob(0);
          else
            oldImage = new byte[0];


          EditList edits = new MyersDiff(new RawText(oldImage),
              new RawText(openBlob(1))).getEdits();
          for (Edit e : edits)
            addedLines += e.getEndB() - e.getBeginB();
        }

View Full Code Here

Examples of org.suigeneris.jrcs.diff.myers.MyersDiff

        try {
            String oldText = engine.getPureText( page.getName(), WikiProvider.LATEST_VERSION );


            String[] first  = Diff.stringToArray( oldText );
            String[] second = Diff.stringToArray( newText );
            Revision rev = Diff.diff( first, second, new MyersDiff() );


            if( rev == null || rev.size() == 0 ) {
                return ch;
            }

View Full Code Here

Examples of org.suigeneris.jrcs.diff.myers.MyersDiff

        String[] beta  = sequence( TextUtil.replaceEntities( wikiNew ) );


        Revision rev = null;
        try
        {
            rev = Diff.diff( alpha, beta, new MyersDiff() );
        }
        catch( DifferentiationFailedException dfe )
        {
            log.error( "Diff generation failed", dfe );
            return "Error while creating version diff.";

View Full Code Here

Examples of org.suigeneris.jrcs.diff.myers.MyersDiff


        try
        {
            String[] first  = Diff.stringToArray(TextUtil.replaceEntities(p1));
            String[] second = Diff.stringToArray(TextUtil.replaceEntities(p2));
            Revision rev = Diff.diff(first, second, new MyersDiff());


            if( rev == null || rev.size() == 0 )
            {
                // No difference

View Full Code Here

Examples of org.suigeneris.jrcs.diff.myers.MyersDiff

        {
            String oldText = engine.getPureText(page.getName(), WikiProvider.LATEST_VERSION);


            String[] first  = Diff.stringToArray(oldText);
            String[] second = Diff.stringToArray(newText);
            Revision rev = Diff.diff(first, second, new MyersDiff());


            if( rev == null || rev.size() == 0 )
            {
                return ch;
            }

View Full Code Here

Examples of org.suigeneris.jrcs.diff.myers.MyersDiff

        String[] beta  = sequence( TextUtil.replaceEntities( wikiNew ) );


        Revision rev = null;
        try
        {
            rev = Diff.diff( alpha, beta, new MyersDiff() );
        }
        catch( DifferentiationFailedException dfe )
        {
            log.error( "Diff generation failed", dfe );
            return "Error while creating version diff.";

View Full Code Here

0 1 2

TOP

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.