Struct TileEntry 

pub struct TileEntry {

    pub zoom: u8,
    pub x: u32,
    pub y: u32,
    pub time_start: i64,
    pub time_end: i64,
    pub pack_id: u32,
    pub offset: u64,
    pub length: u32,
    pub uncompressed_size: u32,
    pub feature_count: u32,
    pub hilbert: u64,
    pub crc32c: u32,
    pub temporal_bucket_ms: Option<u64>,
    pub cover_t_min: Option<i64>,
}

One directory entry: where a tile lives and what it covers.

Fields

zoom: u8

Zoom level.

x: u32

Tile X coordinate.

y: u32

Tile Y coordinate.

time_start: i64

Inclusive temporal start (Unix ms).

time_end: i64

Inclusive temporal end (Unix ms).

pack_id: u32

Index of the pack object holding this tile’s blob (packed format).

In the single-file v4 archive every tile lives in the one file, so this is always 0 and offset is whole-file relative. In the multi-object packed format this selects manifest.packs[pack_id] and offset becomes pack-relative. A per-blob (per-run) property, not a per-entry key — entries RLE-collapse only within one pack.

offset: u64

Byte offset of the compressed blob.

Whole-file relative for the v4 single-file archive; pack-relative (within packs[pack_id]) for the packed format.

length: u32

Compressed blob length in bytes.

uncompressed_size: u32

Uncompressed payload length in bytes.

feature_count: u32

Total feature count across the tile’s layers.

hilbert: u64

Hilbert index of (zoom, x, y) — directory sort key.

crc32c: u32

CRC32C integrity tag of the compressed blob.

temporal_bucket_ms: Option<u64>

Temporal bucket size in milliseconds this tile occupies.

Base tiles record the archive’s base bucket size; temporal-LOD tiles record their coarser bucket. None when the archive carries no LOD pyramid (readers fall back to Metadata::temporal_bucket_ms).

cover_t_min: Option<i64>

Tight lower covering bound — the minimum feature start time actually present in the tile. time_start is the addressable bucket boundary (kept loose so (z,x,y,bucket) lookup works); cover_t_min is the real earliest data, which a client uses to prune a tile whose features all lie after a query window (time_end already gives the tight upper bound). None when not computed — repacked/transcoded archives and pre-covering builds — in which case clients fall back to time_start.

Implementations

impl TileEntry

pub fn tile_id(&self) -> TileId

The tile’s identity.

Trait Implementations

impl Clone for TileEntry

fn clone(&self) -> TileEntry

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for TileEntry

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

Formats the value using the given formatter.

impl PartialEq for TileEntry

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