diff --git a/rustdoc/fifteen_min/isochrone/index.html b/rustdoc/fifteen_min/isochrone/index.html index 5166d7bc3e..8859091eae 100644 --- a/rustdoc/fifteen_min/isochrone/index.html +++ b/rustdoc/fifteen_min/isochrone/index.html @@ -1,7 +1,7 @@ fifteen_min::isochrone - Rust

Module fifteen_min::isochrone[][src]

Structs

+ Change settings

Module fifteen_min::isochrone[][src]

Structs

Isochrone

Represents the area reachable from a single building.

Enums

Options

The constraints on how we're moving.

diff --git a/rustdoc/fifteen_min/isochrone/struct.Isochrone.html b/rustdoc/fifteen_min/isochrone/struct.Isochrone.html index af28d0e94a..7c5ae97b9e 100644 --- a/rustdoc/fifteen_min/isochrone/struct.Isochrone.html +++ b/rustdoc/fifteen_min/isochrone/struct.Isochrone.html @@ -19,7 +19,7 @@ population: usize

How many people live in the returned area, according to estimates included in the map (from city-specific parcel data, guesses from census, or a guess based on OSM tags)

onstreet_parking_spots: usize

How many sreet parking spots are on the same road as any buildings returned.

-

Implementations

impl Isochrone[src]

pub fn new(
    ctx: &mut EventCtx<'_>,
    app: &SimpleApp<()>,
    start: BuildingID,
    options: Options
) -> Isochrone
[src]

pub fn path_to(&self, map: &Map, to: BuildingID) -> Option<Path>[src]

pub fn draw_isochrone(&self, app: &SimpleApp<()>) -> GeomBatch[src]

Auto Trait Implementations

Blanket Implementations

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

Implementations

impl Isochrone[src]

pub fn new(
    ctx: &mut EventCtx<'_>,
    app: &SimpleApp<()>,
    start: BuildingID,
    options: Options
) -> Isochrone
[src]

pub fn path_to(&self, map: &Map, to: BuildingID) -> Option<Path>[src]

pub fn draw_isochrone(&self, app: &SimpleApp<()>) -> GeomBatch[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]

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

impl<T> Downcast for T where
    T: Any

Function geom::polygon::downsize[][src]

fn downsize(input: Vec<usize>) -> Vec<u16>
\ No newline at end of file diff --git a/rustdoc/geom/polygon/fn.from_multi.html b/rustdoc/geom/polygon/fn.from_multi.html index 7d26348a84..ef0e4a8edc 100644 --- a/rustdoc/geom/polygon/fn.from_multi.html +++ b/rustdoc/geom/polygon/fn.from_multi.html @@ -1,5 +1,5 @@ geom::polygon::from_multi - Rust

Function geom::polygon::from_multi[][src]

fn from_multi(multi: MultiPolygon<f64>) -> Vec<Polygon>
+ Change settings

Function geom::polygon::from_multi[][src]

fn from_multi(multi: MultiPolygon<f64>) -> Vec<Polygon>
\ No newline at end of file diff --git a/rustdoc/geom/polygon/fn.to_geo.html b/rustdoc/geom/polygon/fn.to_geo.html index e424d2a2bc..1196a270ec 100644 --- a/rustdoc/geom/polygon/fn.to_geo.html +++ b/rustdoc/geom/polygon/fn.to_geo.html @@ -1,5 +1,5 @@ geom::polygon::to_geo - Rust

Function geom::polygon::to_geo[][src]

fn to_geo(pts: &Vec<Pt2D>) -> Polygon<f64>
+ Change settings

Function geom::polygon::to_geo[][src]

fn to_geo(pts: &Vec<Pt2D>) -> Polygon<f64>
\ No newline at end of file diff --git a/rustdoc/geom/polygon/index.html b/rustdoc/geom/polygon/index.html index 866ba8c810..566799d5ae 100644 --- a/rustdoc/geom/polygon/index.html +++ b/rustdoc/geom/polygon/index.html @@ -1,7 +1,7 @@ geom::polygon - Rust

Module geom::polygon[][src]

Structs

+ Change settings

Module geom::polygon[][src]

Structs

Polygon
Triangle

Functions

downsize
from_multi
to_geo
\ No newline at end of file diff --git a/rustdoc/geom/polygon/struct.Polygon.html b/rustdoc/geom/polygon/struct.Polygon.html index bb3cf8815e..94862e850c 100644 --- a/rustdoc/geom/polygon/struct.Polygon.html +++ b/rustdoc/geom/polygon/struct.Polygon.html @@ -10,30 +10,30 @@
rings: Option<Vec<Ring>>

If the polygon has holes, explicitly store all the rings (the one outer and all of the inner) so they can later be used to generate outlines and such. If the polygon has no holes, then this will just be None, since the points form a ring.

-

Implementations

impl Polygon[src]

pub fn buggy_new(orig_pts: Vec<Pt2D>) -> Polygon[src]

pub fn with_holes(outer: Ring, inner: Vec<Ring>) -> Polygon[src]

pub fn from_rings(rings: Vec<Ring>) -> Polygon[src]

pub fn from_geojson(raw: &Vec<Vec<Vec<f64>>>) -> Polygon[src]

pub fn precomputed(points: Vec<Pt2D>, indices: Vec<usize>) -> Polygon[src]

pub fn from_triangle(tri: &Triangle) -> Polygon[src]

pub fn triangles(&self) -> Vec<Triangle>[src]

pub fn raw_for_rendering(&self) -> (&Vec<Pt2D>, &Vec<u16>)[src]

pub fn contains_pt(&self, pt: Pt2D) -> bool[src]

pub fn get_bounds(&self) -> Bounds[src]

fn transform<F: Fn(&Pt2D) -> Pt2D>(&self, f: F) -> Polygon[src]

pub fn translate(&self, dx: f64, dy: f64) -> Polygon[src]

pub fn scale(&self, factor: f64) -> Polygon[src]

pub fn scale_xy(&self, x_factor: f64, y_factor: f64) -> Polygon[src]

pub fn rotate(&self, angle: Angle) -> Polygon[src]

pub fn rotate_around(&self, angle: Angle, pivot: Pt2D) -> Polygon[src]

pub fn points(&self) -> &Vec<Pt2D>[src]

The order of these points depends on the constructor! The first and last point may or may +

Implementations

impl Polygon[src]

pub fn buggy_new(orig_pts: Vec<Pt2D>) -> Polygon[src]

pub fn with_holes(outer: Ring, inner: Vec<Ring>) -> Polygon[src]

pub fn from_rings(rings: Vec<Ring>) -> Polygon[src]

pub fn from_geojson(raw: &Vec<Vec<Vec<f64>>>) -> Result<Polygon>[src]

pub fn precomputed(points: Vec<Pt2D>, indices: Vec<usize>) -> Polygon[src]

pub fn from_triangle(tri: &Triangle) -> Polygon[src]

pub fn triangles(&self) -> Vec<Triangle>[src]

pub fn raw_for_rendering(&self) -> (&Vec<Pt2D>, &Vec<u16>)[src]

pub fn contains_pt(&self, pt: Pt2D) -> bool[src]

pub fn get_bounds(&self) -> Bounds[src]

fn transform<F: Fn(&Pt2D) -> Pt2D>(&self, f: F) -> Polygon[src]

pub fn translate(&self, dx: f64, dy: f64) -> Polygon[src]

pub fn scale(&self, factor: f64) -> Polygon[src]

pub fn scale_xy(&self, x_factor: f64, y_factor: f64) -> Polygon[src]

pub fn rotate(&self, angle: Angle) -> Polygon[src]

pub fn rotate_around(&self, angle: Angle, pivot: Pt2D) -> Polygon[src]

pub fn points(&self) -> &Vec<Pt2D>[src]

The order of these points depends on the constructor! The first and last point may or may not match. Polygons constructed from PolyLines will have a very weird order.

-

pub fn into_points(self) -> Vec<Pt2D>[src]

pub fn into_ring(self) -> Ring[src]

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

pub fn rectangle(width: f64, height: f64) -> Polygon[src]

Top-left at the origin. Doesn't take Distance, because this is usually pixels, actually.

-

pub fn rectangle_centered(
    center: Pt2D,
    width: Distance,
    height: Distance
) -> Polygon
[src]

pub fn rectangle_two_corners(pt1: Pt2D, pt2: Pt2D) -> Option<Polygon>[src]

pub fn maybe_rounded_rectangle<R: Into<CornerRadii>>(
    w: f64,
    h: f64,
    r: R
) -> Option<Polygon>
[src]

Top-left at the origin. Doesn't take Distance, because this is usually pixels, actually.

-

pub fn pill(w: f64, h: f64) -> Polygon[src]

A rectangle, two sides of which are fully rounded half-circles.

-

pub fn rounded_rectangle<R: Into<CornerRadii>>(w: f64, h: f64, r: R) -> Polygon[src]

Top-left at the origin. Doesn't take Distance, because this is usually pixels, actually. +

pub fn into_points(self) -> Vec<Pt2D>[src]

pub fn into_ring(self) -> Ring[src]

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

pub fn rectangle(width: f64, height: f64) -> Polygon[src]

Top-left at the origin. Doesn't take Distance, because this is usually pixels, actually.

+

pub fn rectangle_centered(
    center: Pt2D,
    width: Distance,
    height: Distance
) -> Polygon
[src]

pub fn rectangle_two_corners(pt1: Pt2D, pt2: Pt2D) -> Option<Polygon>[src]

pub fn maybe_rounded_rectangle<R: Into<CornerRadii>>(
    w: f64,
    h: f64,
    r: R
) -> Option<Polygon>
[src]

Top-left at the origin. Doesn't take Distance, because this is usually pixels, actually.

+

pub fn pill(w: f64, h: f64) -> Polygon[src]

A rectangle, two sides of which are fully rounded half-circles.

+

pub fn rounded_rectangle<R: Into<CornerRadii>>(w: f64, h: f64, r: R) -> Polygon[src]

Top-left at the origin. Doesn't take Distance, because this is usually pixels, actually. If radius is None, be as round as possible

-

pub fn union(self, other: Polygon) -> Polygon[src]

pub fn union_all(list: Vec<Polygon>) -> Polygon[src]

pub fn intersection(&self, other: &Polygon) -> Vec<Polygon>[src]

pub fn convex_hull(list: Vec<Polygon>) -> Polygon[src]

pub fn concave_hull(list: Vec<Polygon>, concavity: f64) -> Polygon[src]

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

pub fn intersects(&self, other: &Polygon) -> bool[src]

Do two polygons intersect at all?

-

pub fn to_outline(&self, thickness: Distance) -> Result<Polygon>[src]

Creates the outline around the polygon, with the thickness half straddling the polygon and +

pub fn union(self, other: Polygon) -> Polygon[src]

pub fn union_all(list: Vec<Polygon>) -> Polygon[src]

pub fn intersection(&self, other: &Polygon) -> Vec<Polygon>[src]

pub fn convex_hull(list: Vec<Polygon>) -> Polygon[src]

pub fn concave_hull(list: Vec<Polygon>, concavity: f64) -> Polygon[src]

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

pub fn intersects(&self, other: &Polygon) -> bool[src]

Do two polygons intersect at all?

+

pub fn to_outline(&self, thickness: Distance) -> Result<Polygon>[src]

Creates the outline around the polygon, with the thickness half straddling the polygon and half of it just outside. Only works for polygons that're formed from rings. Those made from PolyLines won't work, for example.

-

pub fn strip_rings(&self) -> Polygon[src]

Remove the internal rings used for to_outline. This is fine to do if the polygon is being +

pub fn strip_rings(&self) -> Polygon[src]

Remove the internal rings used for to_outline. This is fine to do if the polygon is being added to some larger piece of geometry that won't need an outline.

-

pub fn area(&self) -> f64[src]

Usually m^2, unless the polygon is in screen-space

-

pub fn clip_polyline(&self, input: &PolyLine) -> Option<Vec<Pt2D>>[src]

Doesn't handle multiple crossings in and out.

-

pub fn clip_ring(&self, input: &Ring) -> Option<Vec<Pt2D>>[src]

pub fn to_geojson(&self, gps: Option<&GPSBounds>) -> Geometry[src]

If the polygon is just a single outer ring, produces a GeoJSON polygon. Otherwise, produces +

pub fn area(&self) -> f64[src]

Usually m^2, unless the polygon is in screen-space

+

pub fn clip_polyline(&self, input: &PolyLine) -> Option<Vec<Pt2D>>[src]

Doesn't handle multiple crossings in and out.

+

pub fn clip_ring(&self, input: &Ring) -> Option<Vec<Pt2D>>[src]

pub fn to_geojson(&self, gps: Option<&GPSBounds>) -> Geometry[src]

If the polygon is just a single outer ring, produces a GeoJSON polygon. Otherwise, produces a GeoJSON multipolygon consisting of individual triangles. Optionally map the world-space points back to GPS.

Trait Implementations

impl Clone for Polygon[src]

impl Debug for Polygon[src]

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

impl Display for Polygon[src]

impl From<Polygon<f64>> for Polygon[src]

impl Display for Polygon[src]

impl From<Polygon<f64>> for Polygon[src]

impl PartialEq<Polygon> for Polygon[src]