summaryrefslogtreecommitdiff
path: root/xmerge/source/xmerge/java/org/openoffice/xmerge/merger/diff/CharArrayLCSAlgorithm.java
diff options
context:
space:
mode:
Diffstat (limited to 'xmerge/source/xmerge/java/org/openoffice/xmerge/merger/diff/CharArrayLCSAlgorithm.java')
-rw-r--r--xmerge/source/xmerge/java/org/openoffice/xmerge/merger/diff/CharArrayLCSAlgorithm.java2
1 files changed, 0 insertions, 2 deletions
diff --git a/xmerge/source/xmerge/java/org/openoffice/xmerge/merger/diff/CharArrayLCSAlgorithm.java b/xmerge/source/xmerge/java/org/openoffice/xmerge/merger/diff/CharArrayLCSAlgorithm.java
index 77bc4732452e..6f558e00bf84 100644
--- a/xmerge/source/xmerge/java/org/openoffice/xmerge/merger/diff/CharArrayLCSAlgorithm.java
+++ b/xmerge/source/xmerge/java/org/openoffice/xmerge/merger/diff/CharArrayLCSAlgorithm.java
@@ -28,8 +28,6 @@ import org.openoffice.xmerge.merger.Difference;
* <p>It also use Longest Common Subsequence (LCS). The algorithm is based
* on the book "Introduction to Algorithms" by Thomas H.Cormen,
* Charles E.Leiserson, and Ronald L.Riverst (MIT Press 1990) page 314.</p>
- *
- * @author smak
*/
public class CharArrayLCSAlgorithm {