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
|
#include "defuns.h"
#include "tripstop.h"
#include <algorithm>
#include <stdio.h>
using namespace std;
using namespace tr1;
TripStop::TripStop(FILE *fp)
{
assert(fread(&id, sizeof(int32_t), 1, fp) == 1);
assert(fread(&type, sizeof(Type), 1, fp) == 1);
assert(fread(&lat, sizeof(float), 1, fp) == 1);
assert(fread(&lng, sizeof(float), 1, fp) == 1);
uint8_t have_triphops;
assert(fread(&have_triphops, sizeof(uint8_t), 1, fp) == 1);
if (have_triphops)
{
tdict = shared_ptr<ServiceDict>(new ServiceDict);
uint32_t num_service_periods;
assert(fread(&num_service_periods, sizeof(uint32_t), 1, fp) == 1);
for (uint32_t i=0; i<num_service_periods; i++)
{
int32_t sp_id;
assert(fread(&sp_id, sizeof(int32_t), 1, fp) == 1);
uint32_t num_route_ids;
assert(fread(&num_route_ids, sizeof(uint32_t), 1, fp) == 1);
for (uint32_t j=0; j<num_route_ids; j++)
{
int32_t route_id;
assert(fread(&route_id, sizeof(int32_t), 1, fp) == 1);
uint32_t num_triphops = 0;
assert(fread(&num_triphops, sizeof(uint32_t), 1, fp) == 1);
(*tdict)[sp_id][route_id].reserve(num_triphops);
for (uint32_t k=0; k<num_triphops; k++)
{
TripHop t;
assert(fread(&t, sizeof(TripHop), 1, fp) == 1);
assert(t.end_time >= t.start_time); // FIXME: should be >, no?
(*tdict)[sp_id][route_id].push_back(t);
}
}
}
}
uint32_t num_walkhops = 0;
assert(fread(&num_walkhops, sizeof(uint32_t), 1, fp) == 1);
for (int i=0; i<num_walkhops; i++)
{
int32_t dest_id;
float walktime;
assert(fread(&dest_id, sizeof(int32_t), 1, fp) == 1);
assert(fread(&walktime, sizeof(float), 1, fp) == 1);
assert(walktime >= 0.0f); // FIXME, should be >, no?
add_walkhop(dest_id, walktime);
}
}
TripStop::TripStop(int32_t _id, Type _type, float _lat, float _lng)
{
id = _id;
type = _type;
lat = _lat;
lng = _lng;
}
TripStop::TripStop()
{
}
void TripStop::write(FILE *fp)
{
assert(fwrite(&id, sizeof(int32_t), 1, fp) == 1);
assert(fwrite(&type, sizeof(Type), 1, fp) == 1);
assert(fwrite(&lat, sizeof(float), 1, fp) == 1);
assert(fwrite(&lng, sizeof(float), 1, fp) == 1);
uint8_t have_triphops = tdict ? 1 : 0;
assert(fwrite(&have_triphops, sizeof(uint8_t), 1, fp) == 1);
if (tdict)
{
uint32_t num_service_periods = tdict->size();
assert(fwrite(&num_service_periods, sizeof(uint32_t), 1, fp) == 1);
for (ServiceDict::iterator i = tdict->begin(); i != tdict->end(); i++)
{
assert(fwrite(&(i->first), sizeof(int32_t), 1, fp) == 1);
uint32_t num_route_ids = i->second.size();
assert(fwrite(&num_route_ids, sizeof(uint32_t), 1, fp) == 1);
for (TripHopDict::iterator j = i->second.begin();
j != i->second.end(); j++)
{
int32_t route_id = j->first;
assert(fwrite(&route_id, sizeof(int32_t), 1, fp) == 1);
uint32_t num_triphops = j->second.size();
assert(fwrite(&num_triphops, sizeof(uint32_t), 1, fp) == 1);
for (TripHopList::iterator k = j->second.begin();
k != j->second.end(); k++)
{
assert(fwrite(&(*k), sizeof(TripHop), 1, fp) == 1);
}
}
}
}
uint32_t num_walkhops = wlist.size();
assert(fwrite(&num_walkhops, sizeof(uint32_t), 1, fp) == 1);
for (WalkHopList::iterator i = wlist.begin(); i != wlist.end(); i++)
{
assert(fwrite(&(*i), sizeof(WalkHop), 1, fp) == 1);
}
}
static bool sort_triphops(const TripHop &x,
const TripHop &y)
{
return x.start_time < y.start_time;
}
void TripStop::add_triphop(int32_t start_time, int32_t end_time,
int32_t dest_id, int32_t route_id, int32_t trip_id,
int32_t service_id)
{
if (!tdict)
tdict = shared_ptr<ServiceDict>(new ServiceDict);
(*tdict)[service_id][route_id].push_back(TripHop(start_time, end_time,
dest_id, trip_id));
::sort((*tdict)[service_id][route_id].begin(),
(*tdict)[service_id][route_id].end(), sort_triphops);
}
void TripStop::add_walkhop(int32_t dest_id, float walktime)
{
wlist.push_front(WalkHop(dest_id, walktime));
}
const TripHop * TripStop::find_triphop(int time, int route_id,
int32_t service_id)
{
if (tdict)
{
for (TripHopList::iterator i = (*tdict)[service_id][route_id].begin();
i != (*tdict)[service_id][route_id].end(); i++)
{
if ((*i).start_time >= time)
return &(*i);
}
}
return NULL;
}
vector<TripHop> TripStop::find_triphops(int time, int route_id,
int32_t service_id,
int num)
{
vector<TripHop> tlist;
if (tdict)
{
for (TripHopList::iterator i = (*tdict)[service_id][route_id].begin();
(i != ((*tdict)[service_id][route_id].end()) && tlist.size() < num);
i++)
{
if ((*i).start_time >= time)
tlist.push_back(*i);
}
}
return tlist;
}
deque<int> TripStop::get_routes(int32_t service_id)
{
deque<int> routes;
if (tdict)
{
for (TripHopDict::iterator i = (*tdict)[service_id].begin();
i != (*tdict)[service_id].end(); i++)
{
routes.push_back(i->first);
}
}
return routes;
}
|