From a75e7cf277f51385373d1a0e9df788ae12d49277 Mon Sep 17 00:00:00 2001 From: "dm.naumenko@gmail.com" Date: Fri, 15 Oct 2010 11:51:44 +0000 Subject: [PATCH] fix for issue 8: ArrayIndexOutOfBoundsException when both original and revision List is empty --- src/difflib/myers/MyersDiff.java | 4 +--- 1 file changed, 1 insertion(+), 3 deletions(-) diff --git a/src/difflib/myers/MyersDiff.java b/src/difflib/myers/MyersDiff.java index 31605ed..d37b13d 100644 --- a/src/difflib/myers/MyersDiff.java +++ b/src/difflib/myers/MyersDiff.java @@ -89,7 +89,6 @@ public class MyersDiff implements DiffAlgorithm { * * Return empty diff if get the error while procession the difference. */ - @Override public Patch diff(List original, List revised) { return diff(original.toArray(), revised.toArray()); } @@ -99,7 +98,6 @@ public class MyersDiff implements DiffAlgorithm { * * Return empty diff if get the error while procession the difference. */ - @Override public Patch diff(Object[] orig, Object[] rev) { PathNode path; try { @@ -134,7 +132,7 @@ public class MyersDiff implements DiffAlgorithm { final int MAX = N + M + 1; final int size = 1 + 2 * MAX; - final int middle = (size + 1) / 2; + final int middle = size / 2; final PathNode diagonal[] = new PathNode[size]; diagonal[middle + 1] = new Snake(0, -1, null);