diff --git a/rustdoc/game/pregame/built_info/constant.BUILT_TIME_UTC.html b/rustdoc/game/pregame/built_info/constant.BUILT_TIME_UTC.html index b960f34cfa..33ed5b19ed 100644 --- a/rustdoc/game/pregame/built_info/constant.BUILT_TIME_UTC.html +++ b/rustdoc/game/pregame/built_info/constant.BUILT_TIME_UTC.html @@ -1,6 +1,6 @@ game::pregame::built_info::BUILT_TIME_UTC - Rust

Constant game::pregame::built_info::BUILT_TIME_UTC[−][src]

pub const BUILT_TIME_UTC: &str = r"Wed, 26 May 2021 22:11:12 +0000";

The build time in RFC2822, UTC.

+ Change settings

Constant game::pregame::built_info::BUILT_TIME_UTC[−][src]

pub const BUILT_TIME_UTC: &str = r"Thu, 27 May 2021 05:43:55 +0000";

The build time in RFC2822, UTC.

\ No newline at end of file diff --git a/rustdoc/map_model/all.html b/rustdoc/map_model/all.html index 2ec68c015b..d6cb9212de 100644 --- a/rustdoc/map_model/all.html +++ b/rustdoc/map_model/all.html @@ -3,5 +3,5 @@

List of all items[−] -

Structs

Enums

Functions

Constants

+

Structs

Enums

Functions

Constants

\ No newline at end of file diff --git a/rustdoc/map_model/enum.PathConstraints.html b/rustdoc/map_model/enum.PathConstraints.html index dfc813acbe..9679c5c0a6 100644 --- a/rustdoc/map_model/enum.PathConstraints.html +++ b/rustdoc/map_model/enum.PathConstraints.html @@ -10,8 +10,10 @@ }

Who’s asking for a path?

Variants

-
Pedestrian
Car
Bike
Bus
Train

Implementations

impl PathConstraints[src]

pub fn all() -> Vec<PathConstraints>[src]

pub fn from_lt(lt: LaneType) -> PathConstraints[src]

Not bijective, but this is the best guess of user intent

-

pub fn can_use(self, l: &Lane, map: &Map) -> bool[src]

pub(crate) fn filter_lanes(self, choices: Vec<LaneID>, map: &Map) -> Vec<LaneID>[src]

Strict for bikes. If there are bike lanes, not allowed to use other lanes.

+
Pedestrian
Car
Bike
Bus
Train

Implementations

impl PathConstraints[src]

pub fn all() -> Vec<PathConstraints>[src]

pub fn from_lt(lt: LaneType) -> PathConstraints[src]

Not bijective, but this is the best guess of user intent

+

pub fn can_use(self, lane: &Lane, map: &Map) -> bool[src]

Can an agent use a lane? There are some subtle exceptions with using bus-only lanes for +turns.

+

pub(crate) fn filter_lanes(self, choices: Vec<LaneID>, map: &Map) -> Vec<LaneID>[src]

Strict for bikes. If there are bike lanes, not allowed to use other lanes.

Trait Implementations

impl<O: Into<EnumSet<PathConstraints>>> BitAnd<O> for PathConstraints[src]

type Output = EnumSet<PathConstraints>

The resulting type after applying the & operator.

impl<O: Into<EnumSet<PathConstraints>>> BitOr<O> for PathConstraints[src]

type Output = EnumSet<PathConstraints>

The resulting type after applying the | operator.

diff --git a/rustdoc/map_model/make/collapse_intersections/fn.collapse.html b/rustdoc/map_model/make/collapse_intersections/fn.collapse.html new file mode 100644 index 0000000000..8a15ea4a54 --- /dev/null +++ b/rustdoc/map_model/make/collapse_intersections/fn.collapse.html @@ -0,0 +1,6 @@ +map_model::make::collapse_intersections::collapse - Rust + +

Function map_model::make::collapse_intersections::collapse[−][src]

pub fn collapse(raw: &mut RawMap)

Collapse degenerate intersections between two cycleways.

+
+ \ No newline at end of file diff --git a/rustdoc/map_model/make/collapse_intersections/fn.collapse_intersection.html b/rustdoc/map_model/make/collapse_intersections/fn.collapse_intersection.html new file mode 100644 index 0000000000..7dd15a73fa --- /dev/null +++ b/rustdoc/map_model/make/collapse_intersections/fn.collapse_intersection.html @@ -0,0 +1,5 @@ +map_model::make::collapse_intersections::collapse_intersection - Rust + +

Function map_model::make::collapse_intersections::collapse_intersection[−][src]

fn collapse_intersection(raw: &mut RawMap, i: NodeID)
+ \ No newline at end of file diff --git a/rustdoc/map_model/make/collapse_intersections/fn.is_cycleway.html b/rustdoc/map_model/make/collapse_intersections/fn.is_cycleway.html new file mode 100644 index 0000000000..60b6e18452 --- /dev/null +++ b/rustdoc/map_model/make/collapse_intersections/fn.is_cycleway.html @@ -0,0 +1,5 @@ +map_model::make::collapse_intersections::is_cycleway - Rust + +

Function map_model::make::collapse_intersections::is_cycleway[−][src]

fn is_cycleway(road: &RawRoad, raw: &RawMap) -> bool
+ \ No newline at end of file diff --git a/rustdoc/map_model/make/collapse_intersections/index.html b/rustdoc/map_model/make/collapse_intersections/index.html new file mode 100644 index 0000000000..61842b16ea --- /dev/null +++ b/rustdoc/map_model/make/collapse_intersections/index.html @@ -0,0 +1,7 @@ +map_model::make::collapse_intersections - Rust + +

Module map_model::make::collapse_intersections[−][src]

Functions

+
collapse

Collapse degenerate intersections between two cycleways.

+
collapse_intersection
is_cycleway
+ \ No newline at end of file diff --git a/rustdoc/map_model/make/collapse_intersections/sidebar-items.js b/rustdoc/map_model/make/collapse_intersections/sidebar-items.js new file mode 100644 index 0000000000..51a5f4b55d --- /dev/null +++ b/rustdoc/map_model/make/collapse_intersections/sidebar-items.js @@ -0,0 +1 @@ +initSidebarItems({"fn":[["collapse","Collapse degenerate intersections between two cycleways."],["collapse_intersection",""],["is_cycleway",""]]}); \ No newline at end of file diff --git a/rustdoc/map_model/make/fn.match_points_to_lanes.html b/rustdoc/map_model/make/fn.match_points_to_lanes.html index 2bf5f5aaa2..a1fed4d341 100644 --- a/rustdoc/map_model/make/fn.match_points_to_lanes.html +++ b/rustdoc/map_model/make/fn.match_points_to_lanes.html @@ -1,7 +1,7 @@ map_model::make::match_points_to_lanes - Rust

Function map_model::make::match_points_to_lanes[−][src]

pub fn match_points_to_lanes<F: Fn(&Lane) -> bool>(
    bounds: &Bounds, 
    pts: HashSet<HashablePt2D>, 
    lanes: &BTreeMap<LaneID, Lane>, 
    filter: F, 
    buffer: Distance, 
    max_dist_away: Distance, 
    timer: &mut Timer<'_>
) -> HashMap<HashablePt2D, Position>

Snap points to an exact Position along the nearest lane. If the result doesn’t contain a + Change settings

Function map_model::make::match_points_to_lanes[−][src]

pub fn match_points_to_lanes<F: Fn(&Lane) -> bool>(
    bounds: &Bounds, 
    pts: HashSet<HashablePt2D>, 
    lanes: &BTreeMap<LaneID, Lane>, 
    filter: F, 
    buffer: Distance, 
    max_dist_away: Distance, 
    timer: &mut Timer<'_>
) -> HashMap<HashablePt2D, Position>

Snap points to an exact Position along the nearest lane. If the result doesn’t contain a requested point, then there was no matching lane close enough.

\ No newline at end of file diff --git a/rustdoc/map_model/make/fn.trim_path.html b/rustdoc/map_model/make/fn.trim_path.html index 9fedb716db..3ee2be7dc1 100644 --- a/rustdoc/map_model/make/fn.trim_path.html +++ b/rustdoc/map_model/make/fn.trim_path.html @@ -1,6 +1,6 @@ map_model::make::trim_path - Rust

Function map_model::make::trim_path[−][src]

pub fn trim_path(poly: &Polygon, path: Line) -> Line

Adjust the path to start on the polygon’s border, not center.

+ Change settings

Function map_model::make::trim_path[−][src]

pub fn trim_path(poly: &Polygon, path: Line) -> Line

Adjust the path to start on the polygon’s border, not center.

\ No newline at end of file diff --git a/rustdoc/map_model/make/index.html b/rustdoc/map_model/make/index.html index 6ac4c47087..30850f4b2c 100644 --- a/rustdoc/map_model/make/index.html +++ b/rustdoc/map_model/make/index.html @@ -1,11 +1,11 @@ map_model::make - Rust

Module map_model::make[−][src]

See https://a-b-street.github.io/docs/map/importing/index.html for an overview. This module + Change settings

Module map_model::make[−][src]

See https://a-b-street.github.io/docs/map/importing/index.html for an overview. This module covers the RawMap->Map stage.

Re-exports

pub use self::parking_lots::snap_driveway;

Modules

-
bridges
buildings
initial

Naming is confusing, but RawMap -> InitialMap -> Map. InitialMap is separate pretty much just +
bridges
buildings
collapse_intersections
initial

Naming is confusing, but RawMap -> InitialMap -> Map. InitialMap is separate pretty much just for the step of producing https://a-b-street.github.io/docs/map/importing/geometry.html.

medians
merge_intersections
parking_lots
remove_disconnected
traffic_signals

The various traffic signal generators live in the traffic signal module. Eventually, we might want to move to a trait. For now, there’s a single make_traffic_signal static method diff --git a/rustdoc/map_model/make/sidebar-items.js b/rustdoc/map_model/make/sidebar-items.js index 257809754b..97c0b47c69 100644 --- a/rustdoc/map_model/make/sidebar-items.js +++ b/rustdoc/map_model/make/sidebar-items.js @@ -1 +1 @@ -initSidebarItems({"fn":[["match_points_to_lanes","Snap points to an exact Position along the nearest lane. If the result doesn’t contain a requested point, then there was no matching lane close enough."],["trim_path","Adjust the path to start on the polygon’s border, not center."]],"mod":[["bridges",""],["buildings",""],["initial","Naming is confusing, but RawMap -> InitialMap -> Map. InitialMap is separate pretty much just for the step of producing https://a-b-street.github.io/docs/map/importing/geometry.html."],["medians",""],["merge_intersections",""],["parking_lots",""],["remove_disconnected",""],["traffic_signals","The various traffic signal generators live in the traffic signal module. Eventually, we might want to move to a trait. For now, there’s a single make_traffic_signal static method in each generator file, which is called to generate a traffic signal of a particular flavor."],["transit",""],["turns",""],["walking_turns",""]],"struct":[["RawToMapOptions","Options for converting RawMaps to Maps."]]}); \ No newline at end of file +initSidebarItems({"fn":[["match_points_to_lanes","Snap points to an exact Position along the nearest lane. If the result doesn’t contain a requested point, then there was no matching lane close enough."],["trim_path","Adjust the path to start on the polygon’s border, not center."]],"mod":[["bridges",""],["buildings",""],["collapse_intersections",""],["initial","Naming is confusing, but RawMap -> InitialMap -> Map. InitialMap is separate pretty much just for the step of producing https://a-b-street.github.io/docs/map/importing/geometry.html."],["medians",""],["merge_intersections",""],["parking_lots",""],["remove_disconnected",""],["traffic_signals","The various traffic signal generators live in the traffic signal module. Eventually, we might want to move to a trait. For now, there’s a single make_traffic_signal static method in each generator file, which is called to generate a traffic signal of a particular flavor."],["transit",""],["turns",""],["walking_turns",""]],"struct":[["RawToMapOptions","Options for converting RawMaps to Maps."]]}); \ No newline at end of file diff --git a/rustdoc/map_model/make/struct.RawToMapOptions.html b/rustdoc/map_model/make/struct.RawToMapOptions.html index 1a36baeaf3..8a88db4629 100644 --- a/rustdoc/map_model/make/struct.RawToMapOptions.html +++ b/rustdoc/map_model/make/struct.RawToMapOptions.html @@ -1,7 +1,7 @@ map_model::make::RawToMapOptions - Rust

Struct map_model::make::RawToMapOptions[−][src]

pub struct RawToMapOptions {
+                Change settings

Struct map_model::make::RawToMapOptions[−][src]

pub struct RawToMapOptions {
     pub build_ch: bool,
     pub consolidate_all_intersections: bool,
     pub keep_bldg_tags: bool,
@@ -11,7 +11,7 @@
 them, pathfinding on the map later will be very slow.
consolidate_all_intersections: bool

Try to consolidate all short roads. Will likely break.

keep_bldg_tags: bool

Preserve all OSM tags for buildings, increasing the final file size substantially.

-

Implementations

impl RawToMapOptions[src]

pub fn default() -> RawToMapOptions[src]

Trait Implementations

impl Clone for RawToMapOptions[src]

Implementations

impl RawToMapOptions[src]

pub fn default() -> RawToMapOptions[src]

Trait Implementations

impl Clone for RawToMapOptions[src]

Auto Trait Implementations

Blanket Implementations

impl<T> Any for T where
    T: 'static + ?Sized, [src]

impl<T> Borrow<T> for T where
    T: ?Sized, [src]

Function map_model::objects::lane::parse_turn_type_from_osm[−][src]

fn parse_turn_type_from_osm(x: &str) -> Vec<TurnType>
\ No newline at end of file diff --git a/rustdoc/map_model/objects/lane/index.html b/rustdoc/map_model/objects/lane/index.html index ecc0847b78..6c133a80c2 100644 --- a/rustdoc/map_model/objects/lane/index.html +++ b/rustdoc/map_model/objects/lane/index.html @@ -1,7 +1,7 @@ map_model::objects::lane - Rust

Module map_model::objects::lane[−][src]

Structs

+ Change settings

Module map_model::objects::lane[−][src]

Structs

Lane

A road segment is broken down into individual lanes, which have a LaneType.

LaneID
LaneSpec

Enums

LaneType

Constants

diff --git a/rustdoc/map_model/objects/lane/struct.Lane.html b/rustdoc/map_model/objects/lane/struct.Lane.html index 4aab9b260c..2bfda69a7d 100644 --- a/rustdoc/map_model/objects/lane/struct.Lane.html +++ b/rustdoc/map_model/objects/lane/struct.Lane.html @@ -18,10 +18,13 @@ Fieldsid: LaneIDparent: RoadIDlane_type: LaneTypelane_center_pts: PolyLinewidth: Distancedir: Directionsrc_i: IntersectionIDdst_i: IntersectionIDbus_stops: BTreeSet<BusStopID>

Meaningless order

driving_blackhole: bool

{Cars, bikes} trying to start or end here might not be able to reach most lanes in the graph, because this is near a border.

-
biking_blackhole: bool

Implementations

impl Lane[src]

pub fn first_pt(&self) -> Pt2D[src]

pub fn last_pt(&self) -> Pt2D[src]

pub fn first_line(&self) -> Line[src]

pub fn last_line(&self) -> Line[src]

pub fn endpoint(&self, i: IntersectionID) -> Pt2D[src]

pub fn end_line(&self, i: IntersectionID) -> Line[src]

pt2 will be endpoint

-

pub fn dist_along_of_point(&self, pt: Pt2D) -> Option<Distance>[src]

pub fn length(&self) -> Distance[src]

pub fn intersections(&self) -> Vec<IntersectionID>[src]

pub fn number_parking_spots(&self, cfg: &MapConfig) -> usize[src]

pub fn is_driving(&self) -> bool[src]

pub fn is_biking(&self) -> bool[src]

pub fn is_bus(&self) -> bool[src]

pub fn is_walkable(&self) -> bool[src]

pub fn is_sidewalk(&self) -> bool[src]

pub fn is_shoulder(&self) -> bool[src]

pub fn is_parking(&self) -> bool[src]

pub fn is_light_rail(&self) -> bool[src]

pub fn get_directed_parent(&self) -> DirectedRoadID[src]

pub fn get_lane_level_turn_restrictions(
    &self,
    road: &Road
) -> Option<BTreeSet<TurnType>>[src]

Returns the set of allowed turn types, based on individual turn lane restrictions. None +

biking_blackhole: bool

Implementations

impl Lane[src]

pub fn first_pt(&self) -> Pt2D[src]

pub fn last_pt(&self) -> Pt2D[src]

pub fn first_line(&self) -> Line[src]

pub fn last_line(&self) -> Line[src]

pub fn endpoint(&self, i: IntersectionID) -> Pt2D[src]

pub fn end_line(&self, i: IntersectionID) -> Line[src]

pt2 will be endpoint

+

pub fn dist_along_of_point(&self, pt: Pt2D) -> Option<Distance>[src]

pub fn length(&self) -> Distance[src]

pub fn intersections(&self) -> Vec<IntersectionID>[src]

pub fn number_parking_spots(&self, cfg: &MapConfig) -> usize[src]

pub fn is_driving(&self) -> bool[src]

pub fn is_biking(&self) -> bool[src]

pub fn is_bus(&self) -> bool[src]

pub fn is_walkable(&self) -> bool[src]

pub fn is_sidewalk(&self) -> bool[src]

pub fn is_shoulder(&self) -> bool[src]

pub fn is_parking(&self) -> bool[src]

pub fn is_light_rail(&self) -> bool[src]

pub fn get_directed_parent(&self) -> DirectedRoadID[src]

pub fn get_lane_level_turn_restrictions(
    &self,
    road: &Road,
    force_bus: bool
) -> Option<BTreeSet<TurnType>>[src]

Returns the set of allowed turn types, based on individual turn lane restrictions. None means all turn types are allowed.

-

pub fn trace_around_block(
    &self,
    map: &Map
) -> Option<(Polygon, BTreeSet<LaneID>)>[src]

Starting from this lane, follow the lane’s left edge to the intersection, continuing to +

This will return None for bus lanes, unless force_bus is true. OSM turn restrictions on +bus lanes usually apply to regular vehicles, not the buses. When generating the turns for +buses, we probably don’t want to use the restrictions.

+

pub fn trace_around_block(
    &self,
    map: &Map
) -> Option<(Polygon, BTreeSet<LaneID>)>[src]

Starting from this lane, follow the lane’s left edge to the intersection, continuing to “walk around the block” until we reach the starting point. This only makes sense for the outermost lanes on a road. Returns the polygon and all visited lanes.

TODO This process currently fails for some starting positions; orienting is weird.

diff --git a/rustdoc/map_model/objects/lane/struct.LaneSpec.html b/rustdoc/map_model/objects/lane/struct.LaneSpec.html index c6494b4a52..3c25c6f588 100644 --- a/rustdoc/map_model/objects/lane/struct.LaneSpec.html +++ b/rustdoc/map_model/objects/lane/struct.LaneSpec.html @@ -6,7 +6,7 @@ pub dir: Direction, pub width: Distance, }

- Fields

lt: LaneTypedir: Directionwidth: Distance

Implementations

impl LaneSpec[src]

pub fn typical_lane_widths(
    lt: LaneType,
    tags: &Tags
) -> Vec<(Distance, &'static str)>[src]

For a given lane type, returns some likely widths. This may depend on the type of the road, + Fieldslt: LaneTypedir: Directionwidth: Distance

Implementations

impl LaneSpec[src]

pub fn typical_lane_widths(
    lt: LaneType,
    tags: &Tags
) -> Vec<(Distance, &'static str)>[src]

For a given lane type, returns some likely widths. This may depend on the type of the road, so the OSM tags are also passed in. The first value returned will be used as a default.

Trait Implementations

impl Clone for LaneSpec[src]

Who’s asking for a path?

Variants

-
Pedestrian
Car
Bike
Bus
Train

Implementations

impl PathConstraints[src]

pub fn all() -> Vec<PathConstraints>[src]

pub fn from_lt(lt: LaneType) -> PathConstraints[src]

Not bijective, but this is the best guess of user intent

-

pub fn can_use(self, l: &Lane, map: &Map) -> bool[src]

pub(crate) fn filter_lanes(self, choices: Vec<LaneID>, map: &Map) -> Vec<LaneID>[src]

Strict for bikes. If there are bike lanes, not allowed to use other lanes.

+
Pedestrian
Car
Bike
Bus
Train

Implementations

impl PathConstraints[src]

pub fn all() -> Vec<PathConstraints>[src]

pub fn from_lt(lt: LaneType) -> PathConstraints[src]

Not bijective, but this is the best guess of user intent

+

pub fn can_use(self, lane: &Lane, map: &Map) -> bool[src]

Can an agent use a lane? There are some subtle exceptions with using bus-only lanes for +turns.

+

pub(crate) fn filter_lanes(self, choices: Vec<LaneID>, map: &Map) -> Vec<LaneID>[src]

Strict for bikes. If there are bike lanes, not allowed to use other lanes.

Trait Implementations

impl<O: Into<EnumSet<PathConstraints>>> BitAnd<O> for PathConstraints[src]

type Output = EnumSet<PathConstraints>

The resulting type after applying the & operator.

impl<O: Into<EnumSet<PathConstraints>>> BitOr<O> for PathConstraints[src]

type Output = EnumSet<PathConstraints>

The resulting type after applying the | operator.

diff --git a/rustdoc/map_model/pathfind/fn.zone_cost.html b/rustdoc/map_model/pathfind/fn.zone_cost.html index 5acd7246b6..166097d54c 100644 --- a/rustdoc/map_model/pathfind/fn.zone_cost.html +++ b/rustdoc/map_model/pathfind/fn.zone_cost.html @@ -1,6 +1,6 @@ map_model::pathfind::zone_cost - Rust

Function map_model::pathfind::zone_cost[−][src]

pub fn zone_cost(
    mvmnt: MovementID, 
    constraints: PathConstraints, 
    map: &Map
) -> Duration

Heavily penalize crossing into an access-restricted zone that doesn’t allow this mode.

+ Change settings

Function map_model::pathfind::zone_cost[−][src]

pub fn zone_cost(
    mvmnt: MovementID, 
    constraints: PathConstraints, 
    map: &Map
) -> Duration

Heavily penalize crossing into an access-restricted zone that doesn’t allow this mode.

\ No newline at end of file diff --git a/rustdoc/map_model/pathfind/index.html b/rustdoc/map_model/pathfind/index.html index adbc603ee1..157d485f1f 100644 --- a/rustdoc/map_model/pathfind/index.html +++ b/rustdoc/map_model/pathfind/index.html @@ -1,7 +1,7 @@ map_model::pathfind - Rust

Module map_model::pathfind[−][src]

Everything related to pathfinding through a map for different types of agents.

+ Change settings

Module map_model::pathfind[−][src]

Everything related to pathfinding through a map for different types of agents.

Re-exports

pub use self::ch::ContractionHierarchyPathfinder;
pub use self::dijkstra::build_graph_for_pedestrians;
pub use self::dijkstra::build_graph_for_vehicles;
pub use self::pathfinder::Pathfinder;
pub use self::v1::Path;
pub use self::v1::PathRequest;
pub use self::v1::PathStep;
pub use self::v2::PathStepV2;
pub use self::v2::PathV2;
pub use self::vehicles::vehicle_cost;
pub use self::walking::WalkingNode;

Modules

ch

Uses https://github.com/easbar/fast_paths. Slower creation during map importing, but very fast diff --git a/rustdoc/map_model/pathfind/struct.RoutingParams.html b/rustdoc/map_model/pathfind/struct.RoutingParams.html index 53d1e0b433..84d338b043 100644 --- a/rustdoc/map_model/pathfind/struct.RoutingParams.html +++ b/rustdoc/map_model/pathfind/struct.RoutingParams.html @@ -1,19 +1,19 @@ map_model::pathfind::RoutingParams - Rust

Struct map_model::pathfind::RoutingParams[−][src]

pub struct RoutingParams {
+                Change settings

Struct map_model::pathfind::RoutingParams[−][src]

pub struct RoutingParams {
     pub unprotected_turn_penalty: Duration,
     pub bike_lane_penalty: f64,
     pub bus_lane_penalty: f64,
     pub driving_lane_penalty: f64,
 }

Tuneable parameters for all types of routing.

- Fields

unprotected_turn_penalty: Durationbike_lane_penalty: f64bus_lane_penalty: f64driving_lane_penalty: f64

Implementations

impl RoutingParams[src]

pub const fn default() -> RoutingParams[src]

Trait Implementations

impl<'de> Deserialize<'de> for RoutingParams[src]

impl PartialEq<RoutingParams> for RoutingParams[src]