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
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
|
/*
* Copyright (C) 2009 The Android Open Source Project
*
* Licensed 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 com.android.providers.contacts;
import java.util.Locale;
import java.text.Collator;
import java.text.CollationKey;
import java.text.RuleBasedCollator;
/**
* Converts a name to a normalized form by removing all non-letter characters and normalizing
* UNICODE according to http://unicode.org/unicode/reports/tr15
*/
public class NameNormalizer {
private static final RuleBasedCollator sCompressingCollator;
static {
sCompressingCollator = (RuleBasedCollator)Collator.getInstance(Locale.getDefault());
sCompressingCollator.setStrength(Collator.PRIMARY);
sCompressingCollator.setDecomposition(Collator.CANONICAL_DECOMPOSITION);
}
private static final RuleBasedCollator sComplexityCollator;
static {
sComplexityCollator = (RuleBasedCollator)Collator.getInstance(Locale.getDefault());
sComplexityCollator.setStrength(Collator.SECONDARY);
}
/**
* Converts the supplied name to a string that can be used to perform approximate matching
* of names. It ignores non-letter, non-digit characters, and removes accents.
*/
public static String normalize(String name) {
CollationKey key = sCompressingCollator.getCollationKey(lettersAndDigitsOnly(name));
return Hex.encodeHex(key.toByteArray(), true);
}
/**
* Compares "complexity" of two names, which is determined by the presence
* of mixed case characters, accents and, if all else is equal, length.
*/
public static int compareComplexity(String name1, String name2) {
String clean1 = lettersAndDigitsOnly(name1);
String clean2 = lettersAndDigitsOnly(name2);
int diff = sComplexityCollator.compare(clean1, clean2);
if (diff != 0) {
return diff;
}
// compareTo sorts uppercase first. We know that there are no non-case
// differences from the above test, so we can negate here to get the
// lowercase-first comparison we really want...
diff = -clean1.compareTo(clean2);
if (diff != 0) {
return diff;
}
return name1.length() - name2.length();
}
/**
* Returns a string containing just the letters and digits from the original string.
*/
private static String lettersAndDigitsOnly(String name) {
char[] letters = name.toCharArray();
int length = 0;
for (int i = 0; i < letters.length; i++) {
final char c = letters[i];
if (Character.isLetterOrDigit(c)) {
letters[length++] = c;
}
}
if (length != letters.length) {
return new String(letters, 0, length);
}
return name;
}
}
|
