From 2803f385e6c41a22d7c791d3c184a59af79b7a07 Mon Sep 17 00:00:00 2001
From: Sebastian Bazley <sebb@apache.org>
Date: Sun, 28 Apr 2013 14:08:15 +0000
Subject: [PATCH] Javadoc typos

git-svn-id: https://svn.apache.org/repos/asf/commons/proper/collections/trunk@1476775 13f79535-47bb-0310-9956-ffa450edef68
---
 .../comparators/sequence/package-info.java         | 14 +++++++-------
 1 file changed, 7 insertions(+), 7 deletions(-)

diff --git a/src/main/java/org/apache/commons/collections4/comparators/sequence/package-info.java b/src/main/java/org/apache/commons/collections4/comparators/sequence/package-info.java
index 94dfb510f..42e1882e2 100644
--- a/src/main/java/org/apache/commons/collections4/comparators/sequence/package-info.java
+++ b/src/main/java/org/apache/commons/collections4/comparators/sequence/package-info.java
@@ -15,7 +15,7 @@
  * limitations under the License.
  */
 /**
- * This package provides classes to compare two objects sequences.
+ * This package provides classes to compare two sequences of objects.
  * <p>
  * The two sequences can hold any object type, as only the
  * <code>equals</code> method is used to compare the elements of the
@@ -44,11 +44,11 @@
  * Eugene W. Myers and described in his paper: <a
  * href="http://www.cis.upenn.edu/~bcpierce/courses/dd/papers/diff.ps">An O(ND)
  * Difference Algorithm and Its Variations</a>. This algorithm produces
- * the shortest possible {@link EditScript edit script} containing
- * all the {@link EditCommand commands} needed to transform the first sequence
+ * the shortest possible {@link #EditScript edit script} containing
+ * all the {@link #EditCommand commands} needed to transform the first sequence
  * into the second one.
  * The entry point for the user to this algorithm is the
- * {@link SequencesComparator} class.
+ * {@link #SequencesComparator} class.
  * <p>
  * As explained in Gene Myers paper, the edit script is equivalent to all
  * other representations and contains all the needed information either
@@ -57,14 +57,14 @@
  * <p>
  * If the user needs a very fine grained access to the comparison result,
  * he needs to go through this script by providing a visitor implementing
- * the {@link CommandVisitor} interface.
+ * the {@link #CommandVisitor} interface.
  * <p>
  * Sometimes however, a more synthetic approach is needed. If the user
  * prefers to see the differences between the two sequences as global
  * <code>replacement</code> operations acting on complete subsequences of
  * the original sequences, he will provide an object implementing the
- * simple {@link ReplacementsHandler} interface, using an instance of the
- * {@link ReplacementsFinder} class as a command converting layer between his
+ * simple {@link #ReplacementsHandler} interface, using an instance of the
+ * {@link #ReplacementsFinder} class as a command converting layer between his
  * object and the edit script. The number of objects which are common to
  * both initial arrays and hence are skipped between each call to the user
  * {@link ReplacementsHandler#handleReplacement handleReplacement} method is