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
commit 531f84596c3d3c397bdb3cd26292d54ea3fe217f Author: Gary Gregory <[email protected]> AuthorDate: Sun Nov 30 07:59:17 2025 -0500 Reduce vertical whitespace --- .../org/apache/commons/text/similarity/CosineSimilarity.java | 12 +++--------- 1 file changed, 3 insertions(+), 9 deletions(-) diff --git a/src/main/java/org/apache/commons/text/similarity/CosineSimilarity.java b/src/main/java/org/apache/commons/text/similarity/CosineSimilarity.java index c0dd5c2c..2c5a123b 100644 --- a/src/main/java/org/apache/commons/text/similarity/CosineSimilarity.java +++ b/src/main/java/org/apache/commons/text/similarity/CosineSimilarity.java @@ -52,14 +52,11 @@ public class CosineSimilarity { * @param rightVector right vector. * @return cosine similarity between the two vectors. */ - public Double cosineSimilarity(final Map<CharSequence, Integer> leftVector, - final Map<CharSequence, Integer> rightVector) { + public Double cosineSimilarity(final Map<CharSequence, Integer> leftVector, final Map<CharSequence, Integer> rightVector) { if (leftVector == null || rightVector == null) { throw new IllegalArgumentException("Vectors must not be null"); } - final Set<CharSequence> intersection = getIntersection(leftVector, rightVector); - final double dotProduct = dot(leftVector, rightVector, intersection); double d1 = 0.0d; for (final Integer value : leftVector.values()) { @@ -88,8 +85,7 @@ public class CosineSimilarity { * @param intersection common elements. * @return The dot product. */ - private double dot(final Map<CharSequence, Integer> leftVector, final Map<CharSequence, Integer> rightVector, - final Set<CharSequence> intersection) { + private double dot(final Map<CharSequence, Integer> leftVector, final Map<CharSequence, Integer> rightVector, final Set<CharSequence> intersection) { long dotProduct = 0; for (final CharSequence key : intersection) { dotProduct += leftVector.get(key) * (long) rightVector.get(key); @@ -104,11 +100,9 @@ public class CosineSimilarity { * @param rightVector right vector map. * @return common strings. */ - private Set<CharSequence> getIntersection(final Map<CharSequence, Integer> leftVector, - final Map<CharSequence, Integer> rightVector) { + private Set<CharSequence> getIntersection(final Map<CharSequence, Integer> leftVector, final Map<CharSequence, Integer> rightVector) { final Set<CharSequence> intersection = new HashSet<>(leftVector.keySet()); intersection.retainAll(rightVector.keySet()); return intersection; } - }
