Struct map_model::Perimeter

pub struct Perimeter {
    pub roads: Vec<RoadSideID>,
}

A sequence of roads in order, beginning and ending at the same place. No “crossings” – tracing along this sequence should geometrically yield a simple polygon.

Fields

roads: Vec<RoadSideID>

Implementations

impl Perimeter

pub fn single_block(map: &Map, start: LaneID) -> Result<Perimeter>

Starting at any lane, snap to the nearest side of that road, then begin tracing a single block, with no interior roads. This will fail if a map boundary is reached. The results are unusual when crossing the entrance to a tunnel or bridge.

pub fn find_all_single_blocks(map: &Map) -> Vec<Perimeter>

This calculates all single block perimeters for the entire map. The resulting list does not cover roads near the map boundary.

pub fn merge(&mut self, other: Perimeter, common_road: RoadID)

Merges two perimeters using a road in common. Mutates the current perimeter. Panics if they don’t have that road in common. Doesn’t handle blocks that have multiple roads in common.

fn find_common_road(&self, other: &Perimeter) -> Option<RoadID>

Find an arbitrary road that two perimeters have in common.

pub fn partition_by_predicate<F: Fn(RoadID) -> bool>(
    input: Vec<Perimeter>,
    predicate: F
) -> Vec<Vec<Perimeter>>

Consider the perimeters as a graph, with adjacency determined by sharing any road in common. Partition adjacent perimeters, subject to the predicate. Each partition should produce a single result with merge_all.

pub fn calculate_coloring(
    input: Vec<&Perimeter>,
    num_colors: usize
) -> Option<Vec<usize>>

Assign each perimeter one of num_colors, such that no two adjacent perimeters share the same color. May fail. The resulting colors are expressed as [0, num_colors).

pub fn to_block(self, map: &Map) -> Result<Block>

Trait Implementations

impl Clone for Perimeter

fn clone(&self) -> Perimeter

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.