svn commit: r1476775 - /commons/proper/collections/trunk/src/main/java/org/apache/commons/collections4/comparators/sequence/package-info.java

[se...@apache.org]

Author: sebb
Date: Sun Apr 28 14:08:15 2013
New Revision: 1476775

URL: http://svn.apache.org/r1476775
Log:
Javadoc typos

Modified:
    commons/proper/collections/trunk/src/main/java/org/apache/commons/collections4/comparators/sequence/package-info.java

Modified: commons/proper/collections/trunk/src/main/java/org/apache/commons/collections4/comparators/sequence/package-info.java
URL: http://svn.apache.org/viewvc/commons/proper/collections/trunk/src/main/java/org/apache/commons/collections4/comparators/sequence/package-info.java?rev=1476775&r1=1476774&r2=1476775&view=diff
==============================================================================
--- commons/proper/collections/trunk/src/main/java/org/apache/commons/collections4/comparators/sequence/package-info.java (original)
+++ commons/proper/collections/trunk/src/main/java/org/apache/commons/collections4/comparators/sequence/package-info.java Sun Apr 28 14:08:15 2013
@@ -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