This is an automated email from the ASF dual-hosted git repository.
ggregory pushed a commit to branch master
in repository https://gitbox.apache.org/repos/asf/commons-text.git
The following commit(s) were added to refs/heads/master by this push:
new 70befe30 Use Javadoc @code
70befe30 is described below
commit 70befe30cb5b2d643a9b0510f06f8614cbad4a89
Author: Gary Gregory <[email protected]>
AuthorDate: Mon Jul 29 16:06:04 2024 -0400
Use Javadoc @code
---
src/main/java/org/apache/commons/text/Builder.java | 4 ++--
.../commons/text/similarity/LongestCommonSubsequence.java | 14 +++++++-------
2 files changed, 9 insertions(+), 9 deletions(-)
diff --git a/src/main/java/org/apache/commons/text/Builder.java
b/src/main/java/org/apache/commons/text/Builder.java
index 4007fe60..3d4a20f4 100644
--- a/src/main/java/org/apache/commons/text/Builder.java
+++ b/src/main/java/org/apache/commons/text/Builder.java
@@ -68,12 +68,12 @@ import java.util.function.Supplier;
* Example Builder Usage:
*
* <pre>
- * <code>
+ * {@code
* Font bold14ptSansSerifFont = new FontBuilder(Font.SANS_SERIF)
* .bold()
* .size(14.0f)
* .get();
- * </code>
+ * }
* </pre>
*
*
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 c5ba729c..5d51fcd3 100644
---
a/src/main/java/org/apache/commons/text/similarity/LongestCommonSubsequence.java
+++
b/src/main/java/org/apache/commons/text/similarity/LongestCommonSubsequence.java
@@ -58,14 +58,14 @@ public class LongestCommonSubsequence implements
SimilarityScore<Integer> {
/**
* An implementation of "ALG B" from Hirschberg's CACM '71 paper.
- * Assuming the first input sequence is of size <code>m</code> and the
second input sequence is of size
- * <code>n</code>, this method returns the last row of the dynamic
programming (DP) table when calculating
+ * Assuming the first input sequence is of size {@code m} and the second
input sequence is of size
+ * {@code n}, this method returns the last row of the dynamic programming
(DP) table when calculating
* the LCS of the two sequences in <em>O(m*n)</em> time and <em>O(n)</em>
space.
* The last element of the returned array, is the size of the LCS of the
two input sequences.
*
* @param left first input sequence.
* @param right second input sequence.
- * @return last row of the dynamic-programming (DP) table for calculating
the LCS of <code>left</code> and <code>right</code>
+ * @return last row of the dynamic-programming (DP) table for calculating
the LCS of {@code left} and {@code right}
* @since 1.10.0
*/
private static int[] algorithmB(final CharSequence left, final
CharSequence right) {
@@ -101,13 +101,13 @@ public class LongestCommonSubsequence implements
SimilarityScore<Integer> {
/**
* An implementation of "ALG C" from Hirschberg's CACM '71 paper.
- * Assuming the first input sequence is of size <code>m</code> and the
second input sequence is of size
- * <code>n</code>, this method returns the Longest Common Subsequence
(LCS) of the two sequences in
+ * Assuming the first input sequence is of size {@code m} and the second
input sequence is of size
+ * {@code n}, this method returns the Longest Common Subsequence (LCS) of
the two sequences in
* <em>O(m*n)</em> time and <em>O(m+n)</em> space.
*
* @param left first input sequence.
* @param right second input sequence.
- * @return the LCS of <code>left</code> and <code>right</code>
+ * @return the LCS of {@code left} and {@code right}
* @since 1.10.0
*/
private static String algorithmC(final CharSequence left, final
CharSequence right) {
@@ -174,7 +174,7 @@ public class LongestCommonSubsequence implements
SimilarityScore<Integer> {
*
* @param left first character sequence
* @param right second character sequence
- * @return length of the longest common subsequence of <code>left</code>
and <code>right</code>
+ * @return length of the longest common subsequence of {@code left} and
{@code right}
* @throws IllegalArgumentException if either String input {@code null}
*/
@Override
