Struct Morton 

pub struct Morton { /* private fields */ }

Metadata for Morton decoding

Implementations

impl Morton

pub fn from_vertices(vertices: &[i32]) -> MltResult<Self>

Compute ZOrderCurve parameters from the vertex value range.

Returns a Morton whose bits and shift match Java’s SpaceFillingCurve implementation.

pub fn encode_morton(self, x: i32, y: i32) -> MltResult<u32>

Encode a single (x, y) coordinate pair to its Z-order (Morton) code.

bits (≤ 16) bits are used per axis; shift is added to each component before interleaving so that negative coordinates map to non-negative values.

impl Morton

pub fn decode_codes( self, data: &[u32], dec: &mut Decoder, ) -> MltResult<Vec<i32>>

Decode Morton codes (no delta) to flat [x0, y0, x1, y1, ...], charging dec for the output.

Processes 8 codes at a time with wide::u32x8. Each lane extracts the compacted even-bit (x) and odd-bit (y) components in parallel, then applies the coordinate shift. A scalar tail handles any remaining codes.

pub fn decode_delta( self, data: &[u32], dec: &mut Decoder, ) -> MltResult<Vec<i32>>

Decode delta-encoded Morton codes to flat [x0, y0, x1, y1, ...], charging dec for the output.

Each input value is a signed delta (stored as u32 with wrapping arithmetic) relative to the previous Morton code. The sequential prefix sum is computed in chunks of 8 into a stack-allocated buffer, which is then SIMD-decoded. This keeps the working set in registers / L1 cache.

impl Morton

pub fn new(bits: u32, shift: u32) -> MltResult<Self>

Trait Implementations

impl Clone for Morton

fn clone(&self) -> Morton

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for Morton

impl Debug for Morton

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

Formats the value using the given formatter.

impl PartialEq for Morton

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for Morton