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
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
use std::collections::{BTreeMap, HashSet};
use serde::{Deserialize, Serialize};
use abstutil::Timer;
use geom::{Circle, Distance, Duration, FindClosest, PolyLine};
use map_gui::tools::ChooseSomething;
use map_model::{Path, PathStep, NORMAL_LANE_THICKNESS};
use sim::{TripEndpoint, TripMode};
use widgetry::{
Choice, Color, Drawable, EventCtx, GeomBatch, GfxCtx, HorizontalAlignment, Key, Line, LinePlot,
Outcome, Panel, PlotOptions, Series, State, Text, VerticalAlignment, Widget,
};
use crate::app::{App, Transition};
use crate::common::InputWaypoints;
use crate::ungap::{Layers, Tab, TakeLayers};
pub struct RoutePlanner {
layers: Layers,
once: bool,
input_panel: Panel,
waypoints: InputWaypoints,
results: RouteResults,
files: RouteManagement,
}
impl TakeLayers for RoutePlanner {
fn take_layers(self) -> Layers {
self.layers
}
}
impl RoutePlanner {
pub fn new_state(ctx: &mut EventCtx, app: &App, layers: Layers) -> Box<dyn State<App>> {
let mut rp = RoutePlanner {
layers,
once: true,
input_panel: Panel::empty(ctx),
waypoints: InputWaypoints::new(ctx, app),
results: RouteResults::new(ctx, app, Vec::new()),
files: RouteManagement::new(app),
};
rp.update_input_panel(ctx, app);
Box::new(rp)
}
fn update_input_panel(&mut self, ctx: &mut EventCtx, app: &App) {
self.input_panel = Panel::new_builder(Widget::col(vec![
Tab::Route.make_header(ctx, app),
self.files.get_panel_widget(ctx),
self.waypoints.get_panel_widget(ctx),
]))
.aligned(HorizontalAlignment::Left, VerticalAlignment::Top)
.ignore_initial_events()
.build(ctx);
}
fn sync_from_file_management(&mut self, ctx: &mut EventCtx, app: &App) {
self.waypoints
.overwrite(ctx, app, self.files.current.waypoints.clone());
self.update_input_panel(ctx, app);
self.results = RouteResults::new(ctx, app, self.waypoints.get_waypoints());
}
}
impl State<App> for RoutePlanner {
fn event(&mut self, ctx: &mut EventCtx, app: &mut App) -> Transition {
if self.once {
self.once = false;
ctx.loading_screen("apply edits", |_, mut timer| {
app.primary
.map
.recalculate_pathfinding_after_edits(&mut timer);
});
}
let outcome = self.input_panel.event(ctx);
if let Outcome::Clicked(ref x) = outcome {
if let Some(t) = Tab::Route.handle_action::<RoutePlanner>(ctx, app, x) {
return t;
}
if let Some(t) = self.files.on_click(ctx, app, x) {
if matches!(t, Transition::Keep) {
self.sync_from_file_management(ctx, app);
}
return t;
}
}
if self.waypoints.event(ctx, app, outcome) {
self.files.current.waypoints = self.waypoints.get_waypoints();
self.update_input_panel(ctx, app);
self.results = RouteResults::new(ctx, app, self.waypoints.get_waypoints());
}
self.results.event(ctx, app);
if let Some(t) = self.layers.event(ctx, app) {
return t;
}
Transition::Keep
}
fn draw(&self, g: &mut GfxCtx, app: &App) {
self.layers.draw(g, app);
self.input_panel.draw(g);
self.waypoints.draw(g);
self.results.draw(g);
}
}
struct RouteResults {
paths: Vec<(Path, Option<PolyLine>)>,
closest_path_segment: FindClosest<usize>,
hover_on_line_plot: Option<(Distance, Drawable)>,
draw_route: Drawable,
panel: Panel,
}
impl RouteResults {
fn new(ctx: &mut EventCtx, app: &App, waypoints: Vec<TripEndpoint>) -> RouteResults {
let mut batch = GeomBatch::new();
let map = &app.primary.map;
let mut total_distance = Distance::ZERO;
let mut total_time = Duration::ZERO;
let mut dist_along_high_stress_roads = Distance::ZERO;
let mut num_traffic_signals = 0;
let mut num_unprotected_turns = 0;
let mut elevation_pts: Vec<(Distance, Distance)> = Vec::new();
let mut current_dist = Distance::ZERO;
let mut paths = Vec::new();
let mut closest_path_segment = FindClosest::new(map.get_bounds());
for pair in waypoints.windows(2) {
if let Some(path) = TripEndpoint::path_req(pair[0], pair[1], TripMode::Bike, map)
.and_then(|req| map.pathfind(req).ok())
{
total_distance += path.total_length();
total_time += path.estimate_duration(map, Some(map_model::MAX_BIKE_SPEED));
for step in path.get_steps() {
let this_dist = step.as_traversable().get_polyline(map).length();
match step {
PathStep::Lane(l) | PathStep::ContraflowLane(l) => {
if map.get_parent(*l).high_stress_for_bikes(map) {
dist_along_high_stress_roads += this_dist;
}
}
PathStep::Turn(t) => {
let i = map.get_i(t.parent);
elevation_pts.push((current_dist, i.elevation));
if i.is_traffic_signal() {
num_traffic_signals += 1;
}
if map.is_unprotected_turn(
map.get_l(t.src).parent,
map.get_l(t.dst).parent,
map.get_t(*t).turn_type,
) {
num_unprotected_turns += 1;
}
}
}
current_dist += this_dist;
}
let maybe_pl = path.trace(map);
if let Some(ref pl) = maybe_pl {
batch.push(Color::CYAN, pl.make_polygons(5.0 * NORMAL_LANE_THICKNESS));
closest_path_segment.add(paths.len(), pl.points());
}
paths.push((path, maybe_pl));
}
}
let draw_route = ctx.upload(batch);
let mut total_up = Distance::ZERO;
let mut total_down = Distance::ZERO;
for pair in elevation_pts.windows(2) {
let dy = pair[1].1 - pair[0].1;
if dy < Distance::ZERO {
total_down -= dy;
} else {
total_up += dy;
}
}
let pct_stressful = if total_distance == Distance::ZERO {
0.0
} else {
((dist_along_high_stress_roads / total_distance) * 100.0).round()
};
let mut txt = Text::from(Line("Your route").small_heading());
txt.add_appended(vec![
Line("Distance: ").secondary(),
Line(total_distance.to_string(&app.opts.units)),
]);
txt.add_appended(vec![
Line(format!(
" {} or {}%",
dist_along_high_stress_roads.to_string(&app.opts.units),
pct_stressful
)),
Line(" along high-stress roads").secondary(),
]);
txt.add_appended(vec![
Line("Estimated time: ").secondary(),
Line(total_time.to_string(&app.opts.units)),
]);
txt.add_appended(vec![
Line("Traffic signals crossed: ").secondary(),
Line(num_traffic_signals.to_string()),
]);
txt.add_appended(vec![
Line("Unprotected left turns onto busy roads: ").secondary(),
Line(num_unprotected_turns.to_string()),
]);
let panel = Panel::new_builder(Widget::col(vec![
txt.into_widget(ctx),
Text::from_all(vec![
Line("Elevation change: ").secondary(),
Line(format!(
"{}↑, {}↓",
total_up.to_string(&app.opts.units),
total_down.to_string(&app.opts.units)
)),
])
.into_widget(ctx),
LinePlot::new_widget(
ctx,
"elevation",
vec![Series {
label: "Elevation".to_string(),
color: Color::RED,
pts: elevation_pts,
}],
PlotOptions {
filterable: false,
max_x: Some(current_dist.round_up_for_axis()),
max_y: Some(map.max_elevation().round_up_for_axis()),
disabled: HashSet::new(),
},
),
]))
.aligned(HorizontalAlignment::Right, VerticalAlignment::Top)
.build(ctx);
RouteResults {
draw_route,
panel,
paths,
closest_path_segment,
hover_on_line_plot: None,
}
}
fn event(&mut self, ctx: &mut EventCtx, app: &App) {
self.panel.event(ctx);
let current_dist_along = self
.panel
.find::<LinePlot<Distance, Distance>>("elevation")
.get_hovering()
.get(0)
.map(|pair| pair.0);
if self.hover_on_line_plot.as_ref().map(|pair| pair.0) != current_dist_along {
self.hover_on_line_plot = current_dist_along.map(|mut dist| {
let mut batch = GeomBatch::new();
for (path, maybe_pl) in &self.paths {
if dist > path.total_length() {
dist -= path.total_length();
continue;
}
if let Some(ref pl) = maybe_pl {
if let Ok((pt, _)) = pl.dist_along(dist) {
batch.push(
Color::CYAN,
Circle::new(pt, Distance::meters(30.0)).to_polygon(),
);
}
}
break;
}
(dist, batch.upload(ctx))
});
}
if let Some(pt) = ctx.canvas.get_cursor_in_map_space() {
if let Some((idx, pt)) = self
.closest_path_segment
.closest_pt(pt, 10.0 * NORMAL_LANE_THICKNESS)
{
let mut dist = Distance::ZERO;
for (path, _) in &self.paths[0..idx] {
dist += path.total_length();
}
if let Some(ref pl) = self.paths[idx].1 {
if let Some((dist_here, _)) = pl.dist_along_of_point(pt) {
let map = &app.primary.map;
let elevation = match self.paths[idx]
.0
.get_step_at_dist_along(map, dist_here)
.unwrap_or(self.paths[idx].0.last_step())
{
PathStep::Lane(l) | PathStep::ContraflowLane(l) => {
map.get_i(map.get_l(l).src_i).elevation
}
PathStep::Turn(t) => map.get_i(t.parent).elevation,
};
self.panel
.find_mut::<LinePlot<Distance, Distance>>("elevation")
.set_hovering(ctx, dist + dist_here, elevation);
}
}
}
}
}
fn draw(&self, g: &mut GfxCtx) {
self.panel.draw(g);
g.redraw(&self.draw_route);
if let Some((_, ref draw)) = self.hover_on_line_plot {
g.redraw(draw);
}
}
}
struct RouteManagement {
current: NamedRoute,
all: SavedRoutes,
}
#[derive(Clone, PartialEq, Serialize, Deserialize)]
struct NamedRoute {
name: String,
waypoints: Vec<TripEndpoint>,
}
#[derive(Serialize, Deserialize)]
struct SavedRoutes {
routes: BTreeMap<String, NamedRoute>,
}
impl SavedRoutes {
fn load(app: &App) -> SavedRoutes {
abstio::maybe_read_json::<SavedRoutes>(
abstio::path_routes(app.primary.map.get_name()),
&mut Timer::throwaway(),
)
.unwrap_or_else(|_| SavedRoutes {
routes: BTreeMap::new(),
})
}
fn save(&self, app: &App) {
abstio::write_json(abstio::path_routes(app.primary.map.get_name()), self);
}
fn prev(&self, current: &str) -> Option<&NamedRoute> {
self.routes
.range(..current.to_string())
.next_back()
.map(|pair| pair.1)
}
fn next(&self, current: &str) -> Option<&NamedRoute> {
let mut iter = self.routes.range(current.to_string()..);
iter.next();
iter.next().map(|pair| pair.1)
}
fn new_name(&self) -> String {
let mut i = self.routes.len() + 1;
loop {
let name = format!("Route {}", i);
if self.routes.contains_key(&name) {
i += 1;
} else {
return name;
}
}
}
}
impl RouteManagement {
fn new(app: &App) -> RouteManagement {
let all = SavedRoutes::load(app);
let current = NamedRoute {
name: all.new_name(),
waypoints: Vec::new(),
};
RouteManagement { all, current }
}
fn get_panel_widget(&self, ctx: &mut EventCtx) -> Widget {
let current_name = &self.current.name;
let can_save = self.current.waypoints.len() >= 2
&& Some(&self.current) != self.all.routes.get(current_name);
Widget::row(vec![
Line(current_name).into_widget(ctx).centered_vert(),
ctx.style()
.btn_plain
.icon_text("system/assets/tools/save.svg", "Save")
.disabled(!can_save)
.build_def(ctx),
ctx.style()
.btn_plain_destructive
.icon_text("system/assets/tools/trash.svg", "Delete")
.build_def(ctx),
ctx.style()
.btn_outline
.text("Load another route")
.build_def(ctx),
ctx.style()
.btn_prev()
.hotkey(Key::LeftArrow)
.disabled(self.all.prev(current_name).is_none())
.build_widget(ctx, "previous route"),
ctx.style()
.btn_next()
.hotkey(Key::RightArrow)
.disabled(self.all.next(current_name).is_none())
.build_widget(ctx, "next route"),
ctx.style()
.btn_outline
.text("Start new route")
.build_def(ctx),
])
.section(ctx)
}
fn on_click(&mut self, ctx: &mut EventCtx, app: &App, action: &str) -> Option<Transition> {
match action {
"Save" => {
self.all
.routes
.insert(self.current.name.clone(), self.current.clone());
self.all.save(app);
Some(Transition::Keep)
}
"Delete" => {
if self.all.routes.remove(&self.current.name).is_some() {
self.all.save(app);
}
self.current = NamedRoute {
name: self.all.new_name(),
waypoints: Vec::new(),
};
Some(Transition::Keep)
}
"Start new route" => {
self.current = NamedRoute {
name: self.all.new_name(),
waypoints: Vec::new(),
};
Some(Transition::Keep)
}
"Load another route" => Some(Transition::Push(ChooseSomething::new_state(
ctx,
"Load another route",
self.all.routes.keys().map(|x| Choice::string(x)).collect(),
Box::new(move |choice, _, _| {
Transition::Multi(vec![
Transition::Pop,
Transition::ModifyState(Box::new(move |state, ctx, app| {
let state = state.downcast_mut::<RoutePlanner>().unwrap();
state.files.current = state.files.all.routes[&choice].clone();
state.sync_from_file_management(ctx, app);
})),
])
}),
))),
"previous route" => {
self.current = self.all.prev(&self.current.name).unwrap().clone();
Some(Transition::Keep)
}
"next route" => {
self.current = self.all.next(&self.current.name).unwrap().clone();
Some(Transition::Keep)
}
_ => None,
}
}
}