1

NameAddress[] entries = (NameAddress[]) list.toArray(new NameAddress[list.size()]);

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33

    public Collection findAllDuplicates(List list, int threshold) {
    	List duplicates = new ArrayList();

        // removed iteration over list, thanks to Jeremy Weiskotten
        NameAddress[] entries = (NameAddress[]) list.toArray(new NameAddress[list.size()]);

    	
    	boolean dupes = false;
    	
    	// outer loop - for each NameAddress
    	for (int i = 0; i< entries.length; i++) {
    	    if (entries[i] != null) {
    			
    		for (int k = i+1; k < entries.length; k++) {
    		    if (entries[k] != null) {
    			
    			if (this.rateSimilarity(entries[i], entries[k]) >= threshold) {
    				dupes = true;
    				duplicates.add(entries[k]);
    				// remove this from further comparisons
    				entries[k] = null;
    			}
                    }

    		}
    		if (dupes == true) {
    			duplicates.add(entries[i]);
    		}
            }
    	}
    	
    	return duplicates;
    }

java

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16

    public Collection findAllDuplicates(List<NameAddress> list, int threshold) {
        Collection<NameAddress> duplicates = new HashSet<NameAddress>();
        boolean[] isDuplicate = new boolean[list.size()];
        
        for(int i = 0; i < list.size(); i++) {
            for(int k = i+1; k < list.size() && !isDuplicate[i]; k++) {
                if(!isDuplicate[k] && rateSimilarity(list.get(i), list.get(k)) >= threshold) {
                    duplicates.add(list.get(k));
                    isDuplicate[k] = true;
                }
            }
        }
        
        return duplicates;
    }

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15

    public Collection findAllDuplicates(List<NameAddress> list, int threshold) {
        Collection<NameAddress> duplicates = new HashSet<NameAddress>();
        
        for(int i = 0; i < list.size(); i++) {
            NameAddress baseEntry = list.get(i);
            for(int k = i+1; k < list.size(); k++) {
                NameAddress checkedEntry = list.get(k);
                if(!duplicates.contains(checkedEntry) && rateSimilarity(baseEntry, checkedEntry) >= threshold) {
                    duplicates.add(checkedEntry);
                }
            }
        }
        
        return duplicates;
    }

sort before

1
2
3
4
5
6
7
8

java.util.Arrays.sort(cArray);

for(int i = 0; i < cArray.length - 1; i++) {
	if(cArray[i].equals(cArray[i + 1])) {
		dupes.add(cArray[i]);
	}
}