| /dports/games/abstreet/abstreet-0.2.9-49-g74aca40c0/map_model/src/pathfind/ |
| H A D | uber_turns.rs | 1 use crate::{DirectedRoadID, Direction, IntersectionID, LaneID, Map, TurnID};
18 pub path: Vec<TurnID>,
188 fn flood(start: TurnID, map: &Map, exits: &BTreeSet<TurnID>) -> Vec<UberTurn> { in flood() argument
194 let mut preds: BTreeMap<TurnID, TurnID> = BTreeMap::new(); in flood()
217 fn trace_back(end: TurnID, preds: &BTreeMap<TurnID, TurnID>) -> Vec<TurnID> { in trace_back() argument
|
| H A D | dijkstra.rs | 5 use crate::{LaneID, Map, Path, PathConstraints, PathRequest, PathStep, TurnID};
20 let mut graph: DiGraphMap<LaneID, TurnID> = DiGraphMap::new(); in pathfind()
40 steps.push(PathStep::Turn(TurnID { in pathfind()
|
| H A D | mod.rs | 13 osm, BusRouteID, BusStopID, Lane, LaneID, LaneType, Map, Position, Traversable, TurnID,
29 Turn(TurnID),
45 pub fn as_turn(&self) -> TurnID { in as_turn() argument
413 (PathStep::Lane(src), PathStep::Lane(dst)) => TurnID { in append()
|
| H A D | ch.rs | 6 BusRouteID, BusStopID, Intersection, Map, Path, PathConstraints, PathRequest, Position, TurnID,
170 .maybe_get_t(TurnID { in pathfind_from_zone()
253 .maybe_get_t(TurnID { in pathfind_to_zone()
|
| H A D | driving.rs | 3 use crate::{Lane, LaneID, Map, Path, PathConstraints, PathRequest, PathStep, Turn, TurnID};
90 steps.push(PathStep::Turn(TurnID { in pathfind()
|
| /dports/games/abstreet/abstreet-0.2.9-49-g74aca40c0/map_model/src/objects/ |
| H A D | turn.rs | 11 pub struct TurnID { struct
19 impl fmt::Display for TurnID { argument
68 pub id: TurnID,
75 pub other_crosswalk_ids: BTreeSet<TurnID>,
200 pub members: Vec<TurnID>,
212 let mut movements: MultiMap<(DirectedRoadID, DirectedRoadID), TurnID> = MultiMap::new(); in for_i()
255 let members: Vec<TurnID> = members.into_iter().collect(); in for_i()
|
| H A D | stop_signs.rs | 1 use crate::{osm, IntersectionID, LaneID, Map, RoadID, TurnID, TurnPriority, TurnType};
103 pub fn get_priority(&self, turn: TurnID, map: &Map) -> TurnPriority { in get_priority() argument
|
| H A D | zone.rs | 3 IntersectionID, LaneID, Map, Path, PathConstraints, PathRequest, PathStep, RoadID, TurnID,
62 let mut graph: DiGraphMap<LaneID, TurnID> = DiGraphMap::new(); in pathfind()
88 steps.push(PathStep::Turn(TurnID { in pathfind()
|
| H A D | traffic_signals.rs | 5 MovementID, TurnID, TurnPriority, TurnType,
165 pub fn turn_to_movement(&self, turn: TurnID) -> MovementID { in turn_to_movement()
186 pub fn compressed_id(&self, turn: TurnID) -> CompressedMovementID { in compressed_id()
225 pub fn get_priority_of_turn(&self, t: TurnID, parent: &ControlTrafficSignal) -> TurnPriority { in get_priority_of_turn() argument
|
| H A D | intersection.rs | 1 use crate::{osm, DirectedRoadID, LaneID, Map, PathConstraints, Road, RoadID, TurnID};
36 pub turns: BTreeSet<TurnID>,
|
| /dports/games/abstreet/abstreet-0.2.9-49-g74aca40c0/sim/src/ |
| H A D | render.rs | 3 use map_model::{BuildingID, Map, ParkingLotID, Traversable, TurnID};
11 pub waiting_for_turn: Option<TurnID>,
35 pub waiting_for_turn: Option<TurnID>,
|
| H A D | router.rs | 9 Position, Traversable, TurnID,
361 let t1 = TurnID { in opportunistically_lanechange()
368 if let Some(turn2) = map.maybe_get_t(TurnID { in opportunistically_lanechange()
|
| /dports/games/abstreet/abstreet-0.2.9-49-g74aca40c0/map_model/src/ |
| H A D | traversable.rs | 1 use crate::{LaneID, Map, TurnID};
120 Turn(TurnID),
144 pub fn as_turn(&self) -> TurnID { in as_turn() argument
151 pub fn maybe_turn(&self) -> Option<TurnID> { in maybe_turn() argument
|
| H A D | lib.rs | 31 CompressedMovementID, Movement, MovementID, Turn, TurnID, TurnPriority, TurnType,
57 turns: BTreeMap<TurnID, Turn>,
|
| H A D | map.rs | 6 PathConstraints, PathRequest, Pathfinder, Position, Road, RoadID, Turn, TurnID, TurnType, Zone,
164 pub fn all_turns(&self) -> &BTreeMap<TurnID, Turn> { in all_turns() argument
196 pub fn maybe_get_t(&self, id: TurnID) -> Option<&Turn> { in maybe_get_t()
240 pub fn get_t(&self, id: TurnID) -> &Turn { in get_t()
324 ) -> Option<TurnID> { in get_turn_between() argument
537 pub fn get_movement(&self, t: TurnID) -> Option<MovementID> { in get_movement()
|
| /dports/games/abstreet/abstreet-0.2.9-49-g74aca40c0/map_model/src/edits/ |
| H A D | mod.rs | 8 TurnID, Zone,
83 pub added_turns: BTreeSet<TurnID>,
84 pub deleted_turns: BTreeSet<TurnID>,
432 BTreeSet<TurnID>, in must_apply_edits() argument
433 BTreeSet<TurnID>, in must_apply_edits()
453 BTreeSet<TurnID>, in apply_edits() argument
454 BTreeSet<TurnID>, in apply_edits()
|
| /dports/games/abstreet/abstreet-0.2.9-49-g74aca40c0/sim/src/mechanics/ |
| H A D | intersection.rs | 8 Traversable, TurnID, TurnPriority, TurnType,
52 turn: TurnID,
121 turn: TurnID, in turn_finished() argument
139 pub fn cancel_request(&mut self, agent: AgentID, turn: TurnID) { in cancel_request() argument
287 turn: TurnID, in maybe_start_turn() argument
|
| H A D | parking.rs | 9 PathStep, Position, Traversable, TurnID,
415 let mut backrefs: HashMap<LaneID, TurnID> = HashMap::new(); in path_to_free_parking_spot()
|
| /dports/games/abstreet/abstreet-0.2.9-49-g74aca40c0/map_model/src/make/ |
| H A D | turns.rs | 2 use crate::{Intersection, Lane, LaneID, Map, Turn, TurnID, TurnType};
210 id: TurnID { in make_vehicle_turns()
|
| H A D | walking_turns.rs | 3 Direction, Intersection, IntersectionID, Lane, LaneID, LaneType, Map, Road, Turn, TurnID,
442 fn turn_id(parent: IntersectionID, src: LaneID, dst: LaneID) -> TurnID { in turn_id() argument
443 TurnID { parent, src, dst } in turn_id()
|
| /dports/science/mmdb2/mmdb2-2.0.20/mmdb2/ |
| H A D | mmdb_defs.h | 76 typedef char TurnID [20]; //!< turn ID typedef
|
| H A D | mmdb_model.h | 310 TurnID turnID; // turn ID
|
| /dports/games/abstreet/abstreet-0.2.9-49-g74aca40c0/game/src/render/ |
| H A D | lane.rs | 6 Direction, Lane, LaneID, LaneType, Map, Road, RoadID, TurnID, PARKING_SPOT_LENGTH,
321 .maybe_get_t(TurnID { in calculate_turn_markings()
|