/*
 * Licensed to the Apache Software Foundation (ASF) under one or more
 * contributor license agreements.  See the NOTICE file distributed with
 * this work for additional information regarding copyright ownership.
 * The ASF licenses this file to You under the Apache License, Version 2.0
 * (the "License"); you may not use this file except in compliance with
 * the License.  You may obtain a copy of the License at
 *
 *      http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */
package org.apache.commons.text.similarity;

import java.util.HashSet;
import java.util.Set;

/**
 * Measures the Jaccard similarity (aka Jaccard index) of two sets of character
 * sequence. Jaccard similarity is the size of the intersection divided by the
 * size of the union of the two sets.
 *
 * <p>
 * For further explanation about Jaccard Similarity, refer
 * https://en.wikipedia.org/wiki/Jaccard_index
 * </p>
 *
 * @since 1.0
 */
public class JaccardSimilarity implements SimilarityScore<Double> {

    /**
     * Calculates Jaccard Similarity of two set character sequence passed as
     * input.
     *
     * @param left first character sequence
     * @param right second character sequence
     * @return index
     * @throws IllegalArgumentException
     *             if either String input {@code null}
     */
    @Override
    public Double apply(final CharSequence left, final CharSequence right) {
        if (left == null || right == null) {
            throw new IllegalArgumentException("Input cannot be null");
        }
        return Math.round(calculateJaccardSimilarity(left, right) * 100d) / 100d;
    }

    /**
     * Calculates Jaccard Similarity of two character sequences passed as
     * input. Does the calculation by identifying the union (characters in at
     * least one of the two sets) of the two sets and intersection (characters
     * which are present in set one which are present in set two)
     *
     * @param left first character sequence
     * @param right second character sequence
     * @return index
     */
    private Double calculateJaccardSimilarity(final CharSequence left, final CharSequence right) {
        final Set<String> intersectionSet = new HashSet<>();
        final Set<String> unionSet = new HashSet<>();
        boolean unionFilled = false;
        final int leftLength = left.length();
        final int rightLength = right.length();
        if (leftLength == 0 || rightLength == 0) {
            return 0d;
        }

        for (int leftIndex = 0; leftIndex < leftLength; leftIndex++) {
            unionSet.add(String.valueOf(left.charAt(leftIndex)));
            for (int rightIndex = 0; rightIndex < rightLength; rightIndex++) {
                if (!unionFilled) {
                    unionSet.add(String.valueOf(right.charAt(rightIndex)));
                }
                if (left.charAt(leftIndex) == right.charAt(rightIndex)) {
                    intersectionSet.add(String.valueOf(left.charAt(leftIndex)));
                }
            }
            unionFilled = true;
        }
        return Double.valueOf(intersectionSet.size()) / Double.valueOf(unionSet.size());
    }
}

@@ -2466,160 +2466,8 @@
 ) %7B%0A
-        final Set%3CString%3E intersectionSet = new HashSet%3C%3E();%0A        final Set%3CString%3E unionSet = new HashSet%3C%3E();%0A        boolean unionFilled = false;%0A
     
@@ -2636,25 +2636,24 @@
 ;%0A        %7D%0A
-%0A
         for 
@@ -2653,40 +2653,80 @@
    f
-or (int leftIndex = 0; leftIndex
+inal Set%3CCharacter%3E leftSet = new HashSet%3C%3E();%0A        for (int i = 0; i
  %3C l
@@ -2736,25 +2736,17 @@
 Length; 
-leftIndex
+i
 ++) %7B%0A  
@@ -2751,37 +2751,36 @@
             
-union
+left
 Set.add(
 String.value
@@ -2763,39 +2763,24 @@
 leftSet.add(
-String.valueOf(
 left.charAt(
@@ -2775,34 +2775,25 @@
 left.charAt(
-leftIndex)
+i
 ));%0A        
@@ -2796,162 +2796,139 @@
     
+%7D%0A
     
-for (int rightIndex = 0; rightIndex %3C rightLength; rightIndex++) %7B%0A                if (!unionFilled) %7B%0A                    unionSet.add(String.valueOf
+    final Set%3CCharacter%3E rightSet = new HashSet%3C%3E();%0A        for (int i = 0; i %3C rightLength; i++) %7B%0A            rightSet.add
 (rig
@@ -2937,27 +2937,17 @@
 .charAt(
-rightIndex)
+i
 ));%0A    
@@ -2954,318 +2954,239 @@
     
-  
-      %7D%0A                if (left.charAt(leftIndex) == right.charAt(rightIndex)) %7B%0A                    intersectionSet.add(String.valueOf(left.charAt(leftIndex)));%0A                %7D%0A            %7D%0A            unionFilled = true;%0A        %7D%0A        return Double.valueOf(intersectionSet.size()) / Double.valueOf(
+%7D%0A        final Set%3CCharacter%3E unionSet = new HashSet%3C%3E(leftSet);%0A        unionSet.addAll(rightSet);%0A        final int intersectionSize = leftSet.size() + rightSet.size() - unionSet.size();%0A        return 1.0d * intersectionSize / 
 unio
@@ -3196,17 +3196,16 @@
 t.size()
-)
 ;%0A    %7D%0A

Improve JaccardSimilarity computational cost.