pw.prok.kdiff.myers

Class MyersDiff<T,R extends PatchResult<T>>

java.lang.Object

pw.prok.kdiff.myers.MyersDiff<T,R>

Type Parameters:

T - The type of the compared elements in the 'lines'.

All Implemented Interfaces:

DiffAlgorithm<T,R>

public class MyersDiff<T,R extends PatchResult<T>>
extends java.lang.Object
implements DiffAlgorithm<T,R>

A clean-room implementation of Eugene Myers differencing algorithm.

See the paper at http://www.cs.arizona.edu/people/gene/PAPERS/diff.ps

Constructor Summary

Constructors

Constructor and Description
MyersDiff() Constructs an instance of the Myers differencing algorithm.
MyersDiff(Equalizer<T> equalizer) Constructs an instance of the Myers differencing algorithm.

Method Summary

Modifier and Type	Method and Description
PathNode	buildPath(java.util.List<T> orig, java.util.List<T> rev) Computes the minimum diffpath that expresses de differences between the original and revised sequences, according to Gene Myers differencing algorithm.
Patch<T,R>	buildRevision(PathNode path, java.util.List<T> orig, java.util.List<T> rev) Constructs a Patch from a difference path.
Patch<T,R>	diff(java.util.List<T> original, java.util.List<T> revised) Computes the difference between the original sequence and the revised sequence and returns it as a Patch object.
Patch<T,R>	diff(T[] original, T[] revised) Computes the difference between the original sequence and the revised sequence and returns it as a Patch object.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

MyersDiff

public MyersDiff()

Constructs an instance of the Myers differencing algorithm.

MyersDiff

public MyersDiff(Equalizer<T> equalizer)

Constructs an instance of the Myers differencing algorithm.

Parameters:

equalizer - Must not be null.

Method Detail

diff

public Patch<T,R> diff(T[] original,
                       T[] revised)

Computes the difference between the original sequence and the revised sequence and returns it as a Patch object.

Specified by:

diff in interface DiffAlgorithm<T,R extends PatchResult<T>>

Parameters:

original - The original sequence. Must not be null.

revised - The revised sequence. Must not be null.

Returns:

Returns an empty diff if get the error while procession the difference.

diff

public Patch<T,R> diff(java.util.List<T> original,
                       java.util.List<T> revised)

Computes the difference between the original sequence and the revised sequence and returns it as a Patch object.

Return empty diff if get the error while procession the difference.

Specified by:

diff in interface DiffAlgorithm<T,R extends PatchResult<T>>

Parameters:

original - The original sequence. Must not be null.

revised - The revised sequence. Must not be null.

Returns:

The patch representing the diff of the given sequences. Never null.

buildPath

public PathNode buildPath(java.util.List<T> orig,
                          java.util.List<T> rev)
                   throws DifferentiationFailedException

Computes the minimum diffpath that expresses de differences between the original and revised sequences, according to Gene Myers differencing algorithm.

Parameters:

orig - The original sequence.

rev - The revised sequence.

Returns:

A minimum Path accross the differences graph.

Throws:

DifferentiationFailedException - if a diff path could not be found.

buildRevision

public Patch<T,R> buildRevision(PathNode path,
                                java.util.List<T> orig,
                                java.util.List<T> rev)

Constructs a Patch from a difference path.

Parameters:

path - The path.

orig - The original sequence.

rev - The revised sequence.

Returns:

A Patch script corresponding to the path.