com.github.difflib.algorithm.myers

Class MyersDiff<T>

java.lang.Object

com.github.difflib.algorithm.myers.MyersDiff<T>

All Implemented Interfaces:

DiffAlgorithm<T>

public final class MyersDiff<T>
extends Object
implements DiffAlgorithm<T>

A clean-room implementation of Eugene Myers greedy differencing algorithm.

Constructor Summary

Constructors

Constructor and Description
MyersDiff()
MyersDiff(BiPredicate<T,T> equalizer)

Method Summary

Modifier and Type	Method and Description
List<Change>	diff(List<T> original, List<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

Methods inherited from interface com.github.difflib.algorithm.DiffAlgorithm

diff

Constructor Detail

MyersDiff

public MyersDiff()

MyersDiff

public MyersDiff(BiPredicate<T,T> equalizer)

Method Detail

diff

public List<Change> diff(List<T> original,
                         List<T> revised)
                  throws DiffException

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>

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.

Throws:

DiffException