Struct PolygonMosaic 

pub struct PolygonMosaic<V: Vertex = Coord<i32>> { /* private fields */ }

Reassembles tiled polygon features back into whole rings as tiles are added — the accumulating inverse of the polygon slicer.

Generic over the Vertex type V (defaults to Coord<i32>). Needs the extent and buffer the tiles were sliced at, so it can re-derive each tile’s buffered box and recognise the synthetic clip-boundary corners the slicer injected (see the module docs). Reassembly is by directed edge, so each ring comes back with its original orientation; a payload-carrying vertex additionally makes payload Conflicts meaningful.

Implementations

impl<V: Vertex> PolygonMosaic<V>

pub fn new(extent: u32, buffer: u16) -> Result<Self, TileError>

Create an empty polygon mosaic for tiles sliced at extent with buffer.

Errors

• TileError::InvalidExtent if extent is 0, or extent + buffer exceeds i32::MAX.
• TileError::BufferTooLarge if buffer is not strictly less than half the extent.

pub fn extent(&self) -> u32

The extent every tile is sliced at.

pub fn buffer(&self) -> u16

The buffer every tile is sliced with.

pub fn add<L: AsRef<[V]>>( &mut self, tile: TileId, rings: &[L], ) -> Result<(), TileError>

Add tile’s rings (in its local frame) to the mosaic. rings is anything sliceable to [V] (e.g. &[&[V]] collected from a tile’s polygon features — exterior and hole rings alike, in any order). Each ring may be given open or closed. Re-adding a tile replaces its contents. A tile that contributes only synthetic geometry (a solid interior fill) records nothing.

The synthetic clip-boundary corners are dropped geometrically before anything is indexed, so they never enter the edge map and can raise no Conflict.

Errors

• TileError::Conflict if the tile disagrees with already-added tiles on a shared border edge. The mosaic is unchanged.
• TileError::Overflow if the tile’s box or a vertex overflows i32 in the global frame.

pub fn purge(&mut self, tile: TileId) -> bool

Remove tile and all geometry it contributed. Returns whether the tile was present.

pub fn iter_features(&self) -> impl Iterator<Item = Vec<V>>

Iterate every reassembled ring — geometry stitched across tile borders into maximal chains, in the global frame. A single iterator over the whole mosaic; deterministic order.

pub fn contains(&self, tile: TileId) -> bool

Whether tile is currently in the mosaic.

pub fn len(&self) -> usize

The number of tiles currently in the mosaic (all-synthetic fill tiles do not count).

pub fn is_empty(&self) -> bool

Whether no tile has contributed geometry yet.

pub fn clear(&mut self)

Discard every tile, keeping the extent and buffer.

Trait Implementations

impl<V: Clone + Vertex> Clone for PolygonMosaic<V>

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<V: Debug + Vertex> Debug for PolygonMosaic<V>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.