Struct TileId 

pub struct TileId {
    pub z: u8,
    pub x: u32,
    pub y: u32,
    pub t: u64,
}

Unique identifier for a spatiotemporal tile

Fields

z: u8

Zoom level (0-22)

x: u32

X coordinate

y: u32

Y coordinate

t: u64

Timestamp (Unix milliseconds)

Implementations

impl TileId

pub fn new(z: u8, x: u32, y: u32, t: u64) -> Self

Create a new tile ID

pub fn validate(&self) -> Result<()>

Validate tile coordinates

pub fn hilbert_index(&self) -> u64

Calculate Hilbert curve index for spatial ordering.

Uses the integer (discrete) Hilbert curve at the tile’s own zoom order, so neighbouring tiles never collide on the directory sort key.

The previous implementation normalised (x, y) to f64 [0,1) and multiplied by u64::MAX. f64 has only a 52-bit mantissa, so at zoom ≥ 14 the per-axis precision was already at the mantissa limit and the post-multiply discarded trailing bits — neighbouring tiles could collide on the same hilbert_index, silently degrading the archive’s range-coalescing locality. The integer variant is also ~10× faster.

pub fn parent(&self) -> Option<TileId>

Get parent tile at zoom level z-1

pub fn children(&self) -> Vec<TileId>

Get child tiles at zoom level z+1

pub fn to_string(&self) -> String

Convert to string format: z/x/y/t

Trait Implementations

impl Clone for TileId

fn clone(&self) -> TileId

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for TileId

impl Debug for TileId

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

Formats the value using the given formatter.

impl Eq for TileId

impl Hash for TileId

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl Ord for TileId

fn cmp(&self, other: &Self) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl PartialEq for TileId

fn eq(&self, other: &TileId) -> 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 PartialOrd for TileId

fn partial_cmp(&self, other: &Self) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl StructuralPartialEq for TileId