| /dports/games/abstreet/abstreet-0.2.9-49-g74aca40c0/convert_osm/src/ |
| H A D | split_ways.rs | 3 use geom::{Distance, HashablePt2D, Pt2D};
16 HashMap<HashablePt2D, OriginalRoad>, in split_up_roads() argument
20 let mut pt_to_intersection: HashMap<HashablePt2D, osm::NodeID> = HashMap::new(); in split_up_roads()
53 let mut pt_to_road: HashMap<HashablePt2D, OriginalRoad> = HashMap::new(); in split_up_roads()
174 let mut pt_to_road: HashMap<HashablePt2D, OriginalRoad> = HashMap::new(); in split_up_roads()
|
| H A D | transit.rs | 3 use geom::{HashablePt2D, Polygon, Pt2D};
200 pt_to_road: &HashMap<HashablePt2D, OriginalRoad>, in snap_bus_stops() argument
|
| H A D | extract.rs | 5 use geom::{HashablePt2D, PolyLine, Polygon, Pt2D, Ring};
16 pub traffic_signals: HashMap<HashablePt2D, bool>,
17 pub osm_node_ids: HashMap<HashablePt2D, NodeID>,
|
| /dports/games/abstreet/abstreet-0.2.9-49-g74aca40c0/geom/src/ |
| H A D | pt.rs | 165 pub fn to_hashable(self) -> HashablePt2D { in to_hashable() argument
166 HashablePt2D { in to_hashable()
182 pub struct HashablePt2D { struct
187 impl HashablePt2D { implementation
|
| H A D | lib.rs | 29 pub use crate::pt::{HashablePt2D, Pt2D};
|
| H A D | polyline.rs | 2 Angle, Bounds, Distance, HashablePt2D, InfiniteLine, Line, Polygon, Pt2D, Ring, EPSILON_DIST,
796 fn to_set(pts: &[Pt2D]) -> (HashSet<HashablePt2D>, HashSet<HashablePt2D>) { in to_set() argument
|
| H A D | polygon.rs | 1 use crate::{Angle, Bounds, Distance, HashablePt2D, PolyLine, Pt2D, Ring};
181 let mut pts: Vec<HashablePt2D> = self.points.iter().map(|pt| pt.to_hashable()).collect(); in center()
|
| /dports/games/abstreet/abstreet-0.2.9-49-g74aca40c0/map_model/src/make/ |
| H A D | buildings.rs | 7 use geom::{Distance, HashablePt2D, Line, Polygon};
18 let mut center_per_bldg: BTreeMap<osm::OsmID, HashablePt2D> = BTreeMap::new(); in make_all_buildings()
19 let mut query: HashSet<HashablePt2D> = HashSet::new(); in make_all_buildings()
|
| H A D | parking_lots.rs | 8 use geom::{Angle, Distance, FindClosest, HashablePt2D, Line, PolyLine, Polygon, Pt2D, Ring};
18 let mut center_per_lot: Vec<HashablePt2D> = Vec::new(); in make_all_parking_lots()
19 let mut query: HashSet<HashablePt2D> = HashSet::new(); in make_all_parking_lots()
|
| H A D | transit.rs | 7 use geom::{Distance, Duration, FindClosest, HashablePt2D, Time};
182 sidewalk_pts: HashMap<HashablePt2D, Position>,
183 light_rail_pts: HashMap<HashablePt2D, Position>,
|
| H A D | mod.rs | 19 use geom::{Bounds, Distance, FindClosest, HashablePt2D, Speed, EPSILON_DIST};
367 pts: HashSet<HashablePt2D>, in match_points_to_lanes() argument
373 ) -> HashMap<HashablePt2D, Position> { in match_points_to_lanes() argument
|