Enum SortStrategy 

pub enum SortStrategy {
    Unsorted,
    SpatialMorton,
    SpatialHilbert,
    Id,
}

Controls how features inside a layer are reordered before encoding.

Reordering features changes their position in every parallel column (geometry, ID, and all properties simultaneously), so the caller must opt in explicitly.

Variants

Unsorted

Preserve the original feature order — no reordering is applied.

This is the default.

SpatialMorton

Sort features by the Z-order (Morton) curve index of their first vertex.

Fast to compute. Spatially close features end up adjacent in the stream, improving RLE run lengths for location-correlated properties and CPU cache locality during client-side decoding.

Requires the sort-coords-iter feature.

SpatialHilbert

Sort features by the Hilbert curve index of their first vertex.

Slower to compute than Morton but achieves superior spatial locality.

Requires the sort-coords-iter feature.

Id

Sort features by their feature ID in ascending order.

Trait Implementations

impl Clone for SortStrategy

fn clone(&self) -> SortStrategy

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for SortStrategy

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

Formats the value using the given formatter.

impl Default for SortStrategy

fn default() -> SortStrategy

Returns the “default value” for a type.

impl EnumCount for SortStrategy

const COUNT: usize = 4usize

impl IntoEnumIterator for SortStrategy

type Iterator = SortStrategyIter

fn iter() -> SortStrategyIter

impl PartialEq for SortStrategy

fn eq(&self, other: &SortStrategy) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Copy for SortStrategy

impl Eq for SortStrategy

impl StructuralPartialEq for SortStrategy