wumpz · wumpz · commit 22bd3472d74d · 2017-04-03T15:20:19.000+02:00
diff --git a/src/main/java/difflib/algorithm/myers/MyersDiff.java b/src/main/java/difflib/algorithm/myers/MyersDiff.java
@@ -161,7 +161,7 @@ public PathNode buildPath(final List<T> orig, final List<T> rev)
                 // orig and rev are zero-based
                 // but the algorithm is one-based
                 // that's why there's no +1 when indexing the sequences
-                while (i < N && j < M && equals(orig.get(i), rev.get(j))) {
+                while (i < N && j < M && equalizer.equals(orig.get(i), rev.get(j))) {
                     i++;
                     j++;
                 }
@@ -182,10 +182,6 @@ public PathNode buildPath(final List<T> orig, final List<T> rev)
         throw new DifferentiationFailedException("could not find a diff path");
     }
 
-    private boolean equals(T orig, T rev) {
-        return equalizer.equals(orig, rev);
-    }
-
     /**
      * Constructs a {@link Patch} from a difference path.
      *

Original file line number	Diff line number	Diff line change
`@@ -161,7 +161,7 @@ public PathNode buildPath(final List<T> orig, final List<T> rev)`
`161`	`161`	`// orig and rev are zero-based`
`162`	`162`	`// but the algorithm is one-based`
`163`	`163`	`// that's why there's no +1 when indexing the sequences`
`164`		`- while (i < N && j < M && equals(orig.get(i), rev.get(j))) {`
	`164`	`+ while (i < N && j < M && equalizer.equals(orig.get(i), rev.get(j))) {`
`165`	`165`	`i++;`
`166`	`166`	`j++;`
`167`	`167`	`}`
`@@ -182,10 +182,6 @@ public PathNode buildPath(final List<T> orig, final List<T> rev)`
`182`	`182`	`throw new DifferentiationFailedException("could not find a diff path");`
`183`	`183`	`}`
`184`	`184`
`185`		`- private boolean equals(T orig, T rev) {`
`186`		`- return equalizer.equals(orig, rev);`
`187`		`- }`
`188`		`-`
`189`	`185`	`/**`
`190`	`186`	`* Constructs a {@link Patch} from a difference path.`
`191`	`187`	`*`