TEXT-32: Fixes to javadoc compilation errors
Project: http://git-wip-us.apache.org/repos/asf/commons-text/repo Commit: http://git-wip-us.apache.org/repos/asf/commons-text/commit/ecda7763 Tree: http://git-wip-us.apache.org/repos/asf/commons-text/tree/ecda7763 Diff: http://git-wip-us.apache.org/repos/asf/commons-text/diff/ecda7763 Branch: refs/heads/master Commit: ecda7763441660a4984f20a8f11a035591e28969 Parents: 4263ce3 Author: Rob Tompkins <[email protected]> Authored: Fri Dec 23 09:01:57 2016 -0500 Committer: Rob Tompkins <[email protected]> Committed: Fri Dec 23 09:01:57 2016 -0500 ---------------------------------------------------------------------- .../commons/text/similarity/LongestCommonSubsequence.java | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) ---------------------------------------------------------------------- http://git-wip-us.apache.org/repos/asf/commons-text/blob/ecda7763/src/main/java/org/apache/commons/text/similarity/LongestCommonSubsequence.java ---------------------------------------------------------------------- diff --git a/src/main/java/org/apache/commons/text/similarity/LongestCommonSubsequence.java b/src/main/java/org/apache/commons/text/similarity/LongestCommonSubsequence.java index 5c063bf..83bf46a 100644 --- a/src/main/java/org/apache/commons/text/similarity/LongestCommonSubsequence.java +++ b/src/main/java/org/apache/commons/text/similarity/LongestCommonSubsequence.java @@ -79,8 +79,8 @@ public class LongestCommonSubsequence implements SimilarityScore<Integer> { * derived from another sequence by deleting some elements without changing the order of the remaining elements. * </p> * - * @param left - * @param right + * @param left first character sequence + * @param right second character sequence * @return lcsLengthArray * @throws IllegalArgumentException * if either String input {@code null} @@ -116,8 +116,8 @@ public class LongestCommonSubsequence implements SimilarityScore<Integer> { * dynamic programming portion of the algorithm, and is the reason for the runtime complexity being * O(m*n), where m=left.length() and n=right.length(). * - * @param left - * @param right + * @param left first character sequence + * @param right second character sequence * @return lcsLengthArray */ public int[][] longestCommonSubstringLengthArray(final CharSequence left, final CharSequence right) {
