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
|
Index: navit/navit/search.c
===================================================================
--- navit/search.c (revision 5827)
+++ navit/search.c (working copy)
@@ -1048,3 +1048,138 @@
search_init(void)
{
}
+
+// The following code has been removed into the release 5549
+// It's used by the Spell function of location input
+// So a patch is necessary
+static char *
+search_list_get_unique_truncate(char *common, char *result)
+{
+ dbg(lvl_debug,"%s vs %s\n",common,result);
+ while (*common) {
+ if (g_utf8_get_char(common) != g_utf8_get_char(result)) {
+ dbg(lvl_debug,"truncating at %s vs %s\n",common,result);
+ return common;
+ }
+ result=g_utf8_next_char(result);
+ common=g_utf8_next_char(common);
+ }
+ return common;
+}
+
+static char *
+search_list_get_unique_append(char *list, char *append)
+{
+ char *c=list;
+ int llen=list?strlen(list):0;
+ int len=g_utf8_next_char(append)-append;
+ gunichar a=g_utf8_get_char(append);
+ while(c && *c) {
+ if (g_utf8_get_char(c) == a)
+ return list;
+ c=g_utf8_next_char(c);
+ }
+ list=g_renew(char, list, llen+len+1);
+ strncpy(list+llen,append,len);
+ list[llen+len]='\0';
+ return list;
+}
+
+char *
+search_list_get_unique(struct search_list *this_, char *unique)
+{
+ int level=this_->level;
+ struct search_list_level *le=&this_->levels[level];
+ struct search_list_country *slc;
+ struct search_list_town *slt;
+ struct search_list_street *sls;
+ struct search_list_house_number *slh;
+ char *retf=NULL,*ret=NULL;
+ char *strings[4]={NULL,};
+ char *search=g_utf8_casefold(unique?unique:le->attr->u.str,-1);
+ char *name,*max;
+ int search_len=strlen(search);
+ int i,count=sizeof(strings)/sizeof(char *);
+ GList *l;
+
+ //dbg(lvl_debug,"enter level=%d %s %s\n",level,search,unique);
+ l=le->list;
+ while (l) {
+ switch (level) {
+ case 0:
+ slc=l->data;
+ strings[0]=g_strdup(slc->name);
+ strings[1]=g_strdup(slc->car);
+ strings[2]=g_strdup(slc->iso2);
+ strings[3]=g_strdup(slc->iso3);
+ break;
+ case 1:
+ slt=l->data;
+ name=slt->common.town_name;
+ for (i = 0 ; i < 3 ; i++)
+ strings[i]=linguistics_expand_special(name, i);
+ break;
+ case 2:
+ sls=l->data;
+ name=sls->name;
+ for (i = 0 ; i < 3 ; i++)
+ strings[i]=linguistics_expand_special(name, i);
+ break;
+ case 3:
+ slh=l->data;
+ name=slh->house_number;
+ for (i = 0 ; i < 3 ; i++)
+ strings[i]=linguistics_expand_special(name, i);
+ break;
+ default:
+ dbg(lvl_warning,"entry\n");
+ }
+ dbg(lvl_debug,"entry %s %s %s %s\n",strings[0],strings[1],strings[2],strings[3]);
+ max=NULL;
+ for (i = 0 ; i < count ; i++) {
+ char *str=strings[i];
+ while (str) {
+ char *strf=g_utf8_casefold(str,-1);
+ dbg(lvl_debug,"word %s\n",strf);
+ if (!strncmp(strf, search, search_len)) {
+ dbg(lvl_debug,"match\n");
+ if (unique) {
+ dbg(lvl_debug,"possible next %s %s ret %s\n",strf+search_len,str+search_len,ret);
+ ret=search_list_get_unique_append(ret, strf+search_len);
+ ret=search_list_get_unique_append(ret, str+search_len);
+ dbg(lvl_debug,"ret now %s\n",ret);
+ } else {
+ if (!ret) {
+ ret=g_strdup(str);
+ retf=g_utf8_casefold(ret,-1);
+ dbg(lvl_debug,"ret now %s\n",ret);
+ } else {
+ char *end=search_list_get_unique_truncate(retf,strf);
+ dbg(lvl_debug,"%d characters\n",end-retf);
+ if (!max || max < end)
+ max=end;
+ }
+ }
+ }
+ g_free(strf);
+ str=linguistics_next_word(str);
+ }
+ g_free(strings[i]);
+ }
+ if (!unique) {
+ if (max) {
+ dbg(lvl_debug,"max %s (%d characters)\n",max,max-retf);
+ ret[max-retf]='\0';
+ } else {
+ dbg(lvl_debug,"new max\n");
+ }
+ }
+ dbg(lvl_debug,"common %s\n",ret);
+ l=g_list_next(l);
+ }
+ g_free(search);
+ g_free(retf);
+ //dbg(lvl_debug,"return %s\n",ret);
+ return ret;
+}
+
|
