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
|
/**
* Navit, a modular navigation system.
* Copyright (C) 2005-2008 Navit Team
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU Library General Public License
* version 2 as published by the Free Software Foundation.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Library General Public License for more details.
*
* You should have received a copy of the GNU Library General Public
* License along with this program; if not, write to the
* Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
* Boston, MA 02110-1301, USA.
*/
#ifndef NAVIT_MAP_H
#define NAVIT_MAP_H
struct map_priv;
struct attr;
#include "coord.h"
#include "point.h"
#include "layer.h"
struct map_selection {
struct map_selection *next;
union {
struct coord_rect c_rect;
struct point_rect p_rect;
} u;
int order[layer_end];
};
struct map_methods {
enum projection pro;
char *charset;
void (*map_destroy)(struct map_priv *priv);
struct map_rect_priv * (*map_rect_new)(struct map_priv *map, struct map_selection *sel);
void (*map_rect_destroy)(struct map_rect_priv *mr);
struct item * (*map_rect_get_item)(struct map_rect_priv *mr);
struct item * (*map_rect_get_item_byid)(struct map_rect_priv *mr, int id_hi, int id_lo);
struct map_search_priv *(*map_search_new)(struct map_priv *map, struct item *item, struct attr *search, int partial);
void (*map_search_destroy)(struct map_search_priv *ms);
struct item * (*map_search_get_item)(struct map_search_priv *ms);
};
static inline int
map_selection_contains_point(struct map_selection *sel, struct coord *c)
{
struct map_selection *curr=sel;
while (curr) {
struct coord_rect *r=&curr->u.c_rect;
if (c->x >= r->lu.x && c->x <= r->rl.x &&
c->y <= r->lu.y && c->y >= r->rl.y)
return 1;
curr=curr->next;
}
return sel ? 0:1;
}
static inline int
map_selection_contains_polyline(struct map_selection *sel, struct coord *c, int count)
{
int i,x_mi,x_ma,y_mi,y_ma;
struct map_selection *curr;
if (! sel)
return 1;
for (i = 0 ; i < count-1 ; i++) {
x_mi=c[i].x;
if (c[i+1].x < x_mi)
x_mi=c[i+1].x;
x_ma=c[i].x;
if (c[i+1].x > x_ma)
x_ma=c[i+1].x;
y_mi=c[i].y;
if (c[i+1].y < y_mi)
y_mi=c[i+1].y;
y_ma=c[i].y;
if (c[i+1].y > y_ma)
y_ma=c[i+1].y;
curr=sel;
while (curr) {
struct coord_rect *sr=&curr->u.c_rect;
if (x_mi <= sr->rl.x && x_ma >= sr->lu.x &&
y_ma >= sr->rl.y && y_mi <= sr->lu.y)
return 1;
curr=curr->next;
}
}
return 0;
}
static inline int
map_selection_contains_rect(struct map_selection *sel, struct coord_rect *r)
{
struct map_selection *curr;
g_assert(r->lu.x <= r->rl.x);
g_assert(r->lu.y >= r->rl.y);
if (! sel)
return 1;
curr=sel;
while (curr) {
struct coord_rect *sr=&curr->u.c_rect;
g_assert(sr->lu.x <= sr->rl.x);
g_assert(sr->lu.y >= sr->rl.y);
if (r->lu.x <= sr->rl.x && r->rl.x >= sr->lu.x &&
r->lu.y >= sr->rl.y && r->rl.y <= sr->lu.y)
return 1;
curr=curr->next;
}
return 0;
}
static inline int
map_selection_contains_polygon(struct map_selection *sel, struct coord *c, int count)
{
struct coord_rect r;
int i;
if (! sel)
return 1;
if (! count)
return 0;
r.lu=c[0];
r.rl=c[0];
for (i = 1 ; i < count ; i++) {
if (c[i].x < r.lu.x)
r.lu.x=c[i].x;
if (c[i].x > r.rl.x)
r.rl.x=c[i].x;
if (c[i].y < r.rl.y)
r.rl.y=c[i].y;
if (c[i].y > r.lu.y)
r.lu.y=c[i].y;
}
return map_selection_contains_rect(sel, &r);
}
/* prototypes */
enum attr_type;
enum projection;
struct attr;
struct attr_iter;
struct callback;
struct item;
struct map;
struct map_priv;
struct map_rect;
struct map_search;
struct map_selection;
struct map *map_new(const char *type, struct attr **attrs);
char *map_get_filename(struct map *this_);
char *map_get_type(struct map *this_);
int map_get_active(struct map *this_);
void map_set_active(struct map *this_, int active);
int map_get_attr(struct map *this_, enum attr_type type, struct attr *attr, struct attr_iter *iter);
int map_set_attr(struct map *this_, struct attr *attr);
void map_add_callback(struct map *this_, struct callback *cb);
void map_remove_callback(struct map *this_, struct callback *cb);
int map_requires_conversion(struct map *this_);
char *map_convert_string(struct map *this_, char *str);
void map_convert_free(char *str);
enum projection map_projection(struct map *this_);
void map_set_projection(struct map *this_, enum projection pro);
void map_destroy(struct map *m);
struct map_rect *map_rect_new(struct map *m, struct map_selection *sel);
struct item *map_rect_get_item(struct map_rect *mr);
struct item *map_rect_get_item_byid(struct map_rect *mr, int id_hi, int id_lo);
void map_rect_destroy(struct map_rect *mr);
struct map_search *map_search_new(struct map *m, struct item *item, struct attr *search_attr, int partial);
struct item *map_search_get_item(struct map_search *this_);
void map_search_destroy(struct map_search *this_);
struct map_selection *map_selection_dup(struct map_selection *sel);
void map_selection_destroy(struct map_selection *sel);
int map_selection_contains_item_rect(struct map_selection *sel, struct item *item);
int map_priv_is(struct map *map, struct map_priv *priv);
/* end of prototypes */
#endif
|
