一个电话本中联系人名字搜索高亮的实现

一个电话本中联系人名字搜索高亮的实现


需求:实现电话本名字搜索功能的高亮实现,其中搜索支持中文、简拼、全拼搜索,对搜索匹配到的名字部分高亮显示。




例如:


名字:张向东


全拼:zhangxiangdong


简拼:zxd


搜索匹配优先规则:中文(直接匹配)、简拼匹配、全拼匹配


关键在全拼匹配上面,比方用户输入gd,则匹配向东两个字,同xiangdong的匹配项




搜索功能通过数据库的搜索匹配实现,也就是输入是搜索的输入字符串mInputStr和搜索的名字结果列表List<User> 


SearchHighLightUtil的构造函数


上代码:


第一版:PinyinUtil为使用开源的汉字转拼音的Jar包

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
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
  
import java.util.HashMap;
import java.util.List;
import java.util.Map;
  
  
public class SearchHighLightUtil { 
    /*
    * 输入的搜索字符串
    */
    private String mInputStr;
     
    /*
    * 输入的搜索结果
    */
    private List<User> mListResult;
     
    /*
    * 用名字作为关键字,得到匹配名字的起始位置和结束位置
    */
    private Map<String, SearchKeyPosition> mAnalyzeResult;
     
    /*
    * 构造方法
    */ 
    public SearchHighLightUtil(String inputStr, List<User> listResult){
        this.mInputStr = inputStr;
        this.mListResult = listResult;
         
        /*
        分析输入的字符串和搜索匹配的结果,将分析的结果存储在mAnalyzeResult中,用名字作为关键字,得到匹配名字的起始位置和结束位置
        */
        this.analyze();
    }
  
    public  Map<String, SearchKeyPosition> getAnalyzeResult(){
        return mAnalyzeResult;
    }
     
    private void analyze(){
        if (mAnalyzeResult == null){
            mAnalyzeResult = new HashMap<String, SearchKeyPosition>();
        }
        if (mListResult == null || mInputStr == null){
            return;
        }
        for(int i=0; i<mListResult.size(); i++){
            String name = mListResult.get(i).getName();
            String jpName = mListResult.get(i).getJPName();
            String qpName = mListResult.get(i).getQPName(); 
             
            String []jpNameArr = jpName.split("#");
            if (jpNameArr.length > 1){
                if (jpNameArr[0].contains(mInputStr)){
                    jpName = jpNameArr[0];
                }else if (jpNameArr[1].contains(mInputStr)){
                    jpName = jpNameArr[1];
                }
            
             
            if (name.contains(mInputStr)){
                int start = name.indexOf(mInputStr);
                int end = start + mInputStr.length() - 1;
                mAnalyzeResult.put(name, new SearchKeyPosition(start, end));
            }else if (jpName.contains(mInputStr)){ 
                int start = jpName.indexOf(mInputStr);
                int end = start + mInputStr.length() - 1;
                mAnalyzeResult.put(name, new SearchKeyPosition(start, end));
            }else if (qpName.contains(mInputStr)){ 
                int start = qpName.indexOf(mInputStr);
                if (start == -1){
                    continue;
                }
                int end = mInputStr.length();  
                int nameLength = jpName.length() > name.length()?name.length():jpName.length();
                switch(nameLength){
                    case 2:
                    
                        String firstPinYin = PinyinUtil.getFullSpell(name.substring(0, 1)); 
                        int col = (start + mInputStr.length());
                        if (start <= (firstPinYin.length() - 1)){
                            if (col <= firstPinYin.length()){
                                start = 0;
                                end = 0;
                            }else{
                                start = 0;
                                end = 1;
                            }
                        }else {
                            start = 1;
                            end = 1;
                        }
                        break;
                    }
                    case 3:
                    {
                        String firstPinYin = PinyinUtil.getFullSpell(name.substring(0, 1));
                        String sencondPinYin = PinyinUtil.getFullSpell(name.substring(1,2));  
                        int col = (start + mInputStr.length());
                        if (start <= (firstPinYin.length() - 1)){
                            if (col <= firstPinYin.length()){
                                start = 0;
                                end = 0;
                            }else if (col <= (firstPinYin.length() + sencondPinYin.length())){
                                start = 0;
                                end = 1;
                            }else {
                                start = 0;
                                end = 2;
                            }
                        }else  if (start <= (firstPinYin.length() + sencondPinYin.length()- 1)){
                            if (col <= (firstPinYin.length() + sencondPinYin.length())){
                                start = 1;
                                end = 1;
                            else {
                                start = 1;
                                end = 2;
                            }
                        }else
                            start = 2;
                            end = 2;
                        }
                    }
                        break;
                    case 4:
                    
                        String firstPinYin = PinyinUtil.getFullSpell(name.substring(0, 1));
                        String sencondPinYin = PinyinUtil.getFullSpell(name.substring(1,2)); 
                        String thirdPinYin = PinyinUtil.getFullSpell(name.substring(2,3));  
                        int col = (start + mInputStr.length());
                        if (start <= (firstPinYin.length() - 1)){
                            if (col <= firstPinYin.length()){
                                start = 0;
                                end = 0;
                            }else if (col <= (firstPinYin.length() + sencondPinYin.length())){
                                start = 0;
                                end = 1;
                            }else if (col <= (firstPinYin.length() + sencondPinYin.length() + thirdPinYin.length())){
                                start = 0;
                                end = 2;
                            }else{
                                start = 0;
                                end = 3;
                            }
                        }else  if (start <= (firstPinYin.length() + sencondPinYin.length()- 1)){
                            if (col <= (firstPinYin.length() + sencondPinYin.length())){
                                start = 1;
                                end = 1;
                            else if (col <= (firstPinYin.length() + sencondPinYin.length() + thirdPinYin.length())){
                                start = 1;
                                end = 2;
                            }else{
                                start = 1;
                                end = 3;
                            
                        }else  if (start <= (firstPinYin.length() + sencondPinYin.length() + thirdPinYin.length()- 1)){
                            if (col <= (firstPinYin.length() + sencondPinYin.length() + thirdPinYin.length())){
                                start = 2;
                                end = 2;
                            else {
                                start = 2;
                                end = 3;
                            }
                        }else
                            start = 3;
                            end = 3;
                        }
                    }
                        break;
                    case 5:
                    
                        String firstPinYin = PinyinUtil.getFullSpell(name.substring(0, 1));
                        String sencondPinYin = PinyinUtil.getFullSpell(name.substring(1,2)); 
                        String thirdPinYin = PinyinUtil.getFullSpell(name.substring(2,3));  
                        String fourthPinYin = PinyinUtil.getFullSpell(name.substring(3,4));  
                        int col = (start + mInputStr.length());
                        if (start < (firstPinYin.length() - 1)){
                            if (col <= firstPinYin.length()){
                                start = 0;
                                end = 0;
                            }else if (col <= (firstPinYin.length() + sencondPinYin.length())){
                                start = 0;
                                end = 1;
                            }else if (col <= (firstPinYin.length() + sencondPinYin.length() + thirdPinYin.length())){
                                start = 0;
                                end = 2;
                            }else if (col <= (firstPinYin.length() + sencondPinYin.length() + thirdPinYin.length() + fourthPinYin.length())){
                                start = 0;
                                end = 3;
                            }else{
                                start = 0;
                                end = 4;
                            }
                        }else  if (start < (firstPinYin.length() + sencondPinYin.length()- 1)){
                            if (col <= (firstPinYin.length() + sencondPinYin.length())){
                                start = 1;
                                end = 1;
                            else if (col <= (firstPinYin.length() + sencondPinYin.length() + thirdPinYin.length())){
                                start = 1;
                                end = 2;
                            }else if (col <= (firstPinYin.length() + sencondPinYin.length() + thirdPinYin.length() + fourthPinYin.length())){
                                start = 1;
                                end = 3;
                            }else{
                                start = 1;
                                end = 4;
                            
                        }else  if (start < (firstPinYin.length() + sencondPinYin.length() + thirdPinYin.length()- 1)){
                            if (col <= (firstPinYin.length() + sencondPinYin.length() + thirdPinYin.length())){
                                start = 2;
                                end = 2;
                            }else if (col <= (firstPinYin.length() + sencondPinYin.length() + thirdPinYin.length() + fourthPinYin.length())){
                                start = 2;
                                end = 3;
                            else {
                                start = 2;
                                end = 4;
                            }
                        }else  if (start < (firstPinYin.length() + sencondPinYin.length() + thirdPinYin.length() + + fourthPinYin.length()- 1)){
                            if (col <= (firstPinYin.length() + sencondPinYin.length() + thirdPinYin.length() + fourthPinYin.length())){
                                start = 3;
                                end = 3; 
                            else {
                                start = 3;
                                end = 4;
                            }
                        }else 
                            start = 4;
                            end = 4;
                        }
                    }
                        break;
                    default:
                        start = -1;
                        end = -1;
                        break;
                
                mAnalyzeResult.put(name, new SearchKeyPosition(start, end));
            }
        }
    }
  
    public static class User{
        private String name;
        private String jpName;
        private String qpName;
         
        public String getName(){
            return name;
        }
        public String getJPName(){
            return jpName;
        }
        public String getQPName(){
            return qpName;
        }
    }
     
    public static class SearchKeyPosition{
        public int start = -1;
        public int end = -1;
        public SearchKeyPosition(int start, int end){
            this.start = start;
            this.end = end;
        }
    }
}
  
得到搜索的字符串在名字中匹配的开始位置和结束位置后,就可以设置高亮了:
    /**
     * 关键字高亮变色
     
     * @param color
     *            变化的色值
     * @param text
     *            文字
     * @param keyword
     *            文字中的关键字
     * @return
     */
    public static SpannableString matcherSearchTitle(int color, String text,
            String keyword) {
        SpannableString s = new SpannableString(text);
        Pattern p = Pattern.compile(keyword);
        Matcher m = p.matcher(s);
        while (m.find()) {
            int start = m.start();
            int end = m.end();
            s.setSpan(new ForegroundColorSpan(color), start, end,
                    Spanned.SPAN_EXCLUSIVE_EXCLUSIVE);
        }
        return s;
    }

第二版:

主要对于全拼匹配的部分做了一个优化,第一版本对有几个汉字有约束,并且最大支持5个汉字,扩展性不好,第二版本改进了这个问题,用循环的方式实现;这样的改进也算是对思路的一个梳理。 

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
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
  
import java.util.HashMap;
import java.util.List;
import java.util.Map;
  
  
public class SearchHighLightUtil { 
    /*
    * 输入的搜索字符串
    */
    private String mInputStr;
     
    /*
    * 输入的搜索结果
    */
    private List<User> mListResult;
     
    /*
    * 用名字作为关键字,得到匹配名字的起始位置和结束位置
    */
    private Map<String, SearchKeyPosition> mAnalyzeResult;
     
    /*
    * 构造方法
    */ 
    public SearchHighLightUtil(String inputStr, List<User> listResult){
        this.mInputStr = inputStr;
        this.mListResult = listResult;
         
        /*
        分析输入的字符串和搜索匹配的结果,将分析的结果存储在mAnalyzeResult中,用名字作为关键字,得到匹配名字的起始位置和结束位置
        */
        this.analyze();
    }
  
    public  Map<String, SearchKeyPosition> getAnalyzeResult(){
        return mAnalyzeResult;
    }
     
    private void analyze(){
        if (mAnalyzeResult == null){
            mAnalyzeResult = new HashMap<String, SearchKeyPosition>();
        }
        if (mListResult == null || mInputStr == null){
            return;
        }
        for(int i=0; i<mListResult.size(); i++){
            String name = mListResult.get(i).getName();
            String jpName = mListResult.get(i).getJPName();
            String qpName = mListResult.get(i).getQPName(); 
             
            String []jpNameArr = jpName.split("#");
            if (jpNameArr.length > 1){
                if (jpNameArr[0].contains(mInputStr)){
                    jpName = jpNameArr[0];
                }else if (jpNameArr[1].contains(mInputStr)){
                    jpName = jpNameArr[1];
                }
            
             
            if (name.contains(mInputStr)){
                int start = name.indexOf(mInputStr);
                int end = start + mInputStr.length() - 1;
                mAnalyzeResult.put(name, new SearchKeyPosition(start, end));
            }else if (jpName.contains(mInputStr)){ 
                int start = jpName.indexOf(mInputStr);
                int end = start + mInputStr.length() - 1;
                mAnalyzeResult.put(name, new SearchKeyPosition(start, end));
            }else if (qpName.contains(mInputStr)){ 
                int start = qpName.indexOf(inputStr);
                if (start == -1){
                    continue;
                }
                int end = -1;
                int lastLength = 0;
                int col = (start + inputStr.length());
                for (int j = 0; j<name.length(); j++){
                    String pinYin = PinyinUtil.getFullSpell(name.substring(j, j+1));
                    lastLength += pinYin.length();
                    if (start <= lastLength - 1){
                        start = j;
                        int lastEndLength = lastLength;
                        if (col <= lastEndLength){
                            end = j;
                            mAnalyzeResult.put(name, new TapPosition(start, end));
                        }else {
                            for (int k = j + 1; k < name.length(); k++) {
                                pinYin = PinyinUtil.getFullSpell(name.substring(k, k + 1));
                                lastEndLength += pinYin.length();
                                if (col <= lastEndLength) {
                                    end = k;
                                    mAnalyzeResult.put(name, new TapPosition(start, end));
                                    break;
                                }
                            }
                        }
                        break;
                    }
                
            }
        }
    }
  
    public static class User{
        private String name;
        private String jpName;
        private String qpName;
         
        public String getName(){
            return name;
        }
        public String getJPName(){
            return jpName;
        }
        public String getQPName(){
            return qpName;
        }
    }
     
    public static class SearchKeyPosition{
        public int start = -1;
        public int end = -1;
        public SearchKeyPosition(int start, int end){
            this.start = start;
            this.end = end;
        }
    }
}

白俊遥博客

-------------------广告线---------------
项目、合作,欢迎勾搭,邮箱:promall@qq.com


本文为呱牛笔记原创文章,转载无需和我联系,但请注明来自呱牛笔记 ,it3q.com

请先登录后发表评论
  • 最新评论
  • 总共0条评论