2 * Navit, a modular navigation system.
3 * Copyright (C) 2005-2008 Navit Team
5 * This program is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU General Public License
7 * version 2 as published by the Free Software Foundation.
9 * This program is distributed in the hope that it will be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 * GNU General Public License for more details.
14 * You should have received a copy of the GNU General Public License
15 * along with this program; if not, write to the
16 * Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
17 * Boston, MA 02110-1301, USA.
23 #include "projection.h"
30 struct search_list_level {
32 struct search_list_common *parent;
36 struct mapset_search *search;
38 GList *list,*curr,*last;
44 struct search_list_level levels[4];
45 struct search_list_result result;
46 struct search_list_result last_result;
47 int last_result_valid;
51 search_item_hash_hash(gconstpointer key)
53 const struct item *itm=key;
54 gconstpointer hashkey=(gconstpointer)GINT_TO_POINTER(itm->id_hi^itm->id_lo);
55 return g_direct_hash(hashkey);
59 search_item_hash_equal(gconstpointer a, gconstpointer b)
61 const struct item *itm_a=a;
62 const struct item *itm_b=b;
63 if (item_is_equal_id(*itm_a, *itm_b))
69 search_list_new(struct mapset *ms)
71 struct search_list *ret;
73 ret=g_new0(struct search_list, 1);
79 static void search_list_search_free(struct search_list *sl, int level);
82 search_list_level(enum attr_type attr_type)
85 case attr_country_all:
87 case attr_country_iso2:
88 case attr_country_iso3:
89 case attr_country_car:
90 case attr_country_name:
92 case attr_town_postal:
95 case attr_district_name:
96 case attr_town_or_district_name:
98 case attr_street_name:
100 case attr_house_number:
103 dbg(0,"unknown search '%s'\n",attr_to_name(attr_type));
109 search_list_search(struct search_list *this_, struct attr *search_attr, int partial)
111 struct search_list_level *le;
112 int level=search_list_level(search_attr->type);
113 dbg(1,"level=%d\n", level);
117 le=&this_->levels[level];
118 search_list_search_free(this_, level);
119 le->attr=attr_dup(search_attr);
122 le=&this_->levels[level-1];
125 dbg(1,"le=%p partial=%d\n", le, partial);
129 struct search_list_common *
130 search_list_select(struct search_list *this_, enum attr_type attr_type, int id, int mode)
132 int level=search_list_level(attr_type);
134 struct search_list_level *le;
135 struct search_list_common *slc;
137 le=&this_->levels[level];
141 dbg(1,"enter level=%d %d %d %p\n", level, id, mode, curr);
144 if (! id || num == id) {
152 curr=g_list_next(curr);
154 dbg(1,"not found\n");
158 static struct search_list_country *
159 search_list_country_new(struct item *item)
161 struct search_list_country *ret=g_new0(struct search_list_country, 1);
164 ret->common.item=ret->common.unique=*item;
165 if (item_attr_get(item, attr_country_car, &attr))
166 ret->car=g_strdup(attr.u.str);
167 if (item_attr_get(item, attr_country_iso2, &attr)) {
168 ret->iso2=g_strdup(attr.u.str);
169 ret->flag=g_strdup_printf("country_%s", ret->iso2);
171 if (item_attr_get(item, attr_country_iso3, &attr))
172 ret->iso3=g_strdup(attr.u.str);
173 if (item_attr_get(item, attr_country_name, &attr))
174 ret->name=g_strdup(attr.u.str);
179 search_list_country_destroy(struct search_list_country *this_)
189 static struct search_list_town *
190 search_list_town_new(struct item *item)
192 struct search_list_town *ret=g_new0(struct search_list_town, 1);
197 ret->common.item=ret->common.unique=*item;
198 if (item_attr_get(item, attr_town_streets_item, &attr)) {
199 dbg(1,"town_assoc 0x%x 0x%x\n", attr.u.item->id_hi, attr.u.item->id_lo);
200 ret->common.unique=*attr.u.item;
202 if (item_attr_get(item, attr_town_name, &attr))
203 ret->name=map_convert_string(item->map,attr.u.str);
206 if (item_attr_get(item, attr_town_postal, &attr))
207 ret->common.postal=map_convert_string(item->map,attr.u.str);
209 ret->common.postal=NULL;
210 if (item_attr_get(item, attr_district_name, &attr))
211 ret->district=map_convert_string(item->map,attr.u.str);
214 if (item_coord_get(item, &c, 1)) {
215 ret->common.c=g_new(struct pcoord, 1);
216 ret->common.c->x=c.x;
217 ret->common.c->y=c.y;
218 ret->common.c->pro = map_projection(item->map);
224 search_list_town_destroy(struct search_list_town *this_)
226 map_convert_free(this_->name);
227 map_convert_free(this_->common.postal);
229 g_free(this_->common.c);
234 search_list_common_new(struct item *item, struct search_list_common *common)
237 if (item_attr_get(item, attr_town_name, &attr))
238 common->town_name=map_convert_string(item->map, attr.u.str);
240 common->town_name=NULL;
241 if (item_attr_get(item, attr_district_name, &attr))
242 common->district_name=map_convert_string(item->map, attr.u.str);
244 common->district_name=NULL;
245 if (item_attr_get(item, attr_postal, &attr))
246 common->postal=map_convert_string(item->map, attr.u.str);
251 static struct search_list_street *
252 search_list_street_new(struct item *item)
254 struct search_list_street *ret=g_new0(struct search_list_street, 1);
258 ret->common.item=ret->common.unique=*item;
259 if (item_attr_get(item, attr_street_name, &attr))
260 ret->name=map_convert_string(item->map, attr.u.str);
263 search_list_common_new(item, &ret->common);
264 if (item_coord_get(item, &c, 1)) {
265 ret->common.c=g_new(struct pcoord, 1);
266 ret->common.c->x=c.x;
267 ret->common.c->y=c.y;
268 ret->common.c->pro = map_projection(item->map);
274 search_list_common_destroy(struct search_list_common *common)
276 map_convert_free(common->town_name);
277 map_convert_free(common->district_name);
278 map_convert_free(common->postal);
282 search_list_street_destroy(struct search_list_street *this_)
284 map_convert_free(this_->name);
285 search_list_common_destroy(&this_->common);
287 g_free(this_->common.c);
291 static struct search_list_house_number *
292 search_list_house_number_new(struct item *item)
294 struct search_list_house_number *ret=g_new0(struct search_list_house_number, 1);
298 ret->common.item=ret->common.unique=*item;
299 if (item_attr_get(item, attr_house_number, &attr))
300 ret->house_number=map_convert_string(item->map, attr.u.str);
301 search_list_common_new(item, &ret->common);
302 if (item_coord_get(item, &c, 1)) {
303 ret->common.c=g_new(struct pcoord, 1);
304 ret->common.c->x=c.x;
305 ret->common.c->y=c.y;
306 ret->common.c->pro = map_projection(item->map);
312 search_list_house_number_destroy(struct search_list_house_number *this_)
314 map_convert_free(this_->house_number);
315 search_list_common_destroy(&this_->common);
317 g_free(this_->common.c);
322 search_list_result_destroy(int level, void *p)
326 search_list_country_destroy(p);
329 search_list_town_destroy(p);
332 search_list_street_destroy(p);
335 search_list_house_number_destroy(p);
341 search_list_search_free(struct search_list *sl, int level)
343 struct search_list_level *le=&sl->levels[level];
346 mapset_search_destroy(le->search);
351 g_hash_table_destroy(le->hash);
357 search_list_result_destroy(level, curr->data);
358 next=g_list_next(curr);
362 g_list_free(le->list);
370 postal_merge(char *mask, char *new)
372 dbg(1,"enter %s %s\n", mask, new);
378 return g_strdup(new);
380 while (mask[i] && new[i]) {
381 if (mask[i] != '.' && mask[i] != new[i])
391 dbg(1,"merged %s with %s as %s\n", mask, new, ret);
396 search_add_result(struct search_list_level *le, struct search_list_common *slc)
398 struct search_list_common *slo;
400 slo=g_hash_table_lookup(le->hash, &slc->unique);
402 g_hash_table_insert(le->hash, &slc->unique, slc);
403 if (slc->postal && !slc->postal_mask) {
404 slc->postal_mask=g_strdup(slc->postal);
406 le->list=g_list_append(le->list, slc);
409 merged=postal_merge(slo->postal_mask, slc->postal);
411 g_free(slo->postal_mask);
412 slo->postal_mask=merged;
417 struct search_list_result *
418 search_list_get_result(struct search_list *this_)
420 struct search_list_level *le,*leu;
422 int level=this_->level;
425 le=&this_->levels[level];
426 dbg(1,"le=%p\n", le);
428 dbg(1,"le->search=%p\n", le->search);
430 dbg(1,"partial=%d level=%d\n", le->partial, level);
434 leu=&this_->levels[level-1];
435 dbg(1,"leu->curr=%p\n", leu->curr);
437 struct search_list_common *slc;
440 le->parent=leu->curr->data;
442 leu->curr=g_list_next(leu->curr);
443 slc=(struct search_list_common *)(le->parent);
446 if (slc->selected == leu->selected)
451 dbg(1,"mapset_search_new with item(%d,%d)\n", le->parent->item.id_hi, le->parent->item.id_lo);
452 dbg(1,"attr=%s\n", attr_to_name(le->attr->type));
453 le->search=mapset_search_new(this_->ms, &le->parent->item, le->attr, le->partial);
454 le->hash=g_hash_table_new(search_item_hash_hash, search_item_hash_equal);
456 dbg(1,"le->search=%p\n", le->search);
457 item=mapset_search_get_item(le->search);
458 dbg(1,"item=%p\n", item);
461 dbg(1,"id_hi=%d id_lo=%d\n", item->id_hi, item->id_lo);
462 this_->result.country=NULL;
463 this_->result.town=NULL;
464 this_->result.street=NULL;
465 this_->result.c=NULL;
468 p=search_list_country_new(item);
469 this_->result.country=p;
472 p=search_list_town_new(item);
473 this_->result.country=this_->levels[0].last->data;
474 this_->result.town=p;
475 this_->result.c=this_->result.town->common.c;
478 p=search_list_street_new(item);
479 this_->result.country=this_->levels[0].last->data;
480 this_->result.town=this_->levels[1].last->data;
481 this_->result.street=p;
482 this_->result.c=this_->result.street->common.c;
485 p=search_list_house_number_new(item);
486 this_->result.country=this_->levels[0].last->data;
487 this_->result.town=this_->levels[1].last->data;
488 this_->result.street=this_->levels[2].last->data;
489 this_->result.house_number=p;
490 this_->result.c=this_->result.street->common.c;
494 if (search_add_result(le, p)) {
496 return &this_->result;
498 search_list_result_destroy(level, p);
501 mapset_search_destroy(le->search);
503 g_hash_table_destroy(le->hash);
512 search_list_destroy(struct search_list *this_)
524 search_fix_spaces(char *str)
528 char c,*s,*d,*ret=g_strdup(str);
530 for (i = 0 ; i < len ; i++) {
531 if (ret[i] == ',' || ret[i] == ',' || ret[i] == '/')
539 if (c != ' ' || len != 0) {
543 while (c == ' ' && *s == ' ')
545 if (c == ' ' && *s == '\0') {
554 search_split_phrases(char *str)
562 ret=g_list_append(ret, g_strdup(s));
566 ret=g_list_append(ret, g_strdup(tmp));
577 } while (*s != '\0');
578 } while (*s != '\0');
583 search_address_housenumber(struct search_list *sl, GList *phrases, GList *exclude1, GList *exclude2, GList *exclude3)
585 struct search_list_result *slr;
589 attr.type=attr_street_name;
590 while (slr=search_list_get_result(sl)) {
592 dbg(0,"%p %p\n",slr->country,slr->town);
593 dbg(0,"%s %s %s %s %s\n",slr->country->car,slr->town->common.postal,slr->town->name,slr->town->district,slr->street->name);
598 dbg(0,"count %d\n",count);
600 if (tmp != exclude1 && tmp != exclude2 && tmp != exclude3) {
601 attr.type=attr_house_number;
602 attr.u.str=tmp->data;
603 search_list_search(sl, &attr, 0);
604 while (slr=search_list_get_result(sl)) {
605 dbg(0,"result %s %s(%s) %s %s\n",slr->house_number->common.postal,slr->house_number->common.town_name, slr->house_number->common.district_name,slr->street->name,slr->house_number->house_number);
609 tmp=g_list_next(tmp);
613 search_address_street(struct search_list *sl, GList *phrases, GList *exclude1, GList *exclude2)
615 struct search_list_result *slr;
619 attr.type=attr_street_name;
620 while (slr=search_list_get_result(sl)) {
622 dbg(0,"%s %s %s %s",slr->country->car,slr->town->name,slr->town->district,slr->street->name);
624 dbg(0,"%s %s %s %s\n",slr->country->car,slr->town->common.postal,slr->town->name,slr->town->district);
629 dbg(0,"count %d\n",count);
631 if (tmp != exclude1 && tmp != exclude2) {
632 attr.u.str=tmp->data;
633 search_list_search(sl, &attr, 0);
634 search_address_housenumber(sl, phrases, exclude1, exclude2, tmp);
636 tmp=g_list_next(tmp);
641 search_address_town(struct search_list *sl, GList *phrases, GList *exclude)
646 attr.type=attr_town_or_district_name;
647 while (search_list_get_result(sl))
651 dbg(0,"count %d\n",count);
653 if (tmp != exclude) {
654 attr.u.str=tmp->data;
655 search_list_search(sl, &attr, 0);
656 search_address_street(sl, phrases, exclude, tmp);
658 tmp=g_list_next(tmp);
663 search_by_address(struct mapset *ms, char *addr)
665 char *str=search_fix_spaces(addr);
666 GList *tmp,*phrases=search_split_phrases(str);
667 dbg(0,"enter %s\n",addr);
668 struct search_list *sl;
669 struct search_list_result *slr;
671 attr.type=attr_country_all;
673 sl=search_list_new(ms);
675 attr.u.str=tmp->data;
676 search_list_search(sl, &attr, 0);
677 search_address_town(sl, phrases, tmp);
678 tmp=g_list_next(tmp);
680 search_list_search(sl, country_default(), 0);
681 search_address_town(sl, phrases, NULL);