com.github.difflib.algorithm.myers

Class MeyersDiff<T>

java.lang.Object

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

All Implemented Interfaces:

DiffAlgorithmI<T>

public final class MeyersDiff<T>
extends java.lang.Object
implements DiffAlgorithmI<T>

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

Field Summary

Fields

Modifier and Type	Field and Description
private java.util.function.BiPredicate<T,T>	equalizer

Constructor Summary

Constructors

Constructor and Description
MeyersDiff()
MeyersDiff(java.util.function.BiPredicate<T,T> equalizer)

Method Summary

Modifier and Type	Method and Description
private PathNode	buildPath(java.util.List<T> orig, java.util.List<T> rev, DiffAlgorithmListener progress) Computes the minimum diffpath that expresses de differences between the original and revised sequences, according to Gene Myers differencing algorithm.
private java.util.List<Change>	buildRevision(PathNode actualPath, java.util.List<T> orig, java.util.List<T> rev) Constructs a Patch from a difference path.
java.util.List<Change>	computeDiff(java.util.List<T> source, java.util.List<T> target, DiffAlgorithmListener progress) Computes the changeset to patch the source list to the target list.
static DiffAlgorithmFactory	factory() Factory to create instances of this specific diff algorithm.

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.DiffAlgorithmI

computeDiff

Field Detail

equalizer

private final java.util.function.BiPredicate<T,T> equalizer

Constructor Detail

MeyersDiff

public MeyersDiff()

MeyersDiff

public MeyersDiff(java.util.function.BiPredicate<T,T> equalizer)

Method Detail

computeDiff

public java.util.List<Change> computeDiff(java.util.List<T> source,
                                          java.util.List<T> target,
                                          DiffAlgorithmListener progress)

Computes the changeset to patch the source list to the target list. Return empty diff if get the error while procession the difference.

Specified by:

computeDiff in interface DiffAlgorithmI<T>

Parameters:

source - source data

target - target data

progress - progress listener

Returns:

buildPath

private PathNode buildPath(java.util.List<T> orig,
                           java.util.List<T> rev,
                           DiffAlgorithmListener progress)

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

private java.util.List<Change> buildRevision(PathNode actualPath,
                                             java.util.List<T> orig,
                                             java.util.List<T> rev)

Constructs a Patch from a difference path.

Parameters:

actualPath - The path.

orig - The original sequence.

rev - The revised sequence.

Returns:

A Patch script corresponding to the path.

Throws:

DifferentiationFailedException - if a Patch could not be built from the given path.

factory

public static DiffAlgorithmFactory factory()

Factory to create instances of this specific diff algorithm.