pub struct Local<'a, V> { /* private fields */ }Expand description
Vertices in a tile’s local frame — v − origin, computed as they are read — every position checked
to fit i32 before the slice is handed out.
A line run is lent from the caller’s input, and skips consecutive duplicate positions (the first
of each is kept). A polygon ring has no consecutive duplicates, and is closed: its first vertex
repeated at the end, which a ring lent open has iter append (drop it for an MVT
ClosePath). It is lent from the input when the polygon lies inside one tile, else built in the
slicer’s working memory, clipped and with synthetic corners.
Implementations§
Source§impl<'a, V: Vertex> Local<'a, V>
impl<'a, V: Vertex> Local<'a, V>
Sourcepub fn global(&self) -> &'a [V]
pub fn global(&self) -> &'a [V]
The vertices in the global frame: each local vertex plus origin,
consecutive duplicates included. For a line run this is a subslice of the input line, so its
position in the line tells which vertices the run covers; for a clipped polygon ring it is the
slicer’s built ring. For a ring lent open this is without the repeated first vertex.