nodedb-array 0.2.1

Shared ND sparse array engine (coordinate-tuple indexed, tile-based) for NodeDB Origin and Lite
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60

// SPDX-License-Identifier: Apache-2.0

//! Tile identifier — `(hilbert_prefix, system_from_ms)`.
//!
//! The Hilbert prefix locates the tile in ND space; the system-time
//! suffix carries the bitemporal system-time version. Until bitemporal
//! tiles land, callers pass `system_from_ms = 0`.

use serde::{Deserialize, Serialize};

/// Composite tile key. Lexicographic ordering of `(hilbert_prefix,
/// system_from_ms)` keeps newer tile versions adjacent to their
/// spatial parents, so the Ceiling resolver can reverse-scan a single
/// Hilbert range.
#[derive(
    Debug,
    Clone,
    Copy,
    PartialEq,
    Eq,
    PartialOrd,
    Ord,
    Hash,
    Serialize,
    Deserialize,
    zerompk::ToMessagePack,
    zerompk::FromMessagePack,
)]
pub struct TileId {
    pub hilbert_prefix: u64,
    pub system_from_ms: i64,
}

impl TileId {
    pub fn new(hilbert_prefix: u64, system_from_ms: i64) -> Self {
        Self {
            hilbert_prefix,
            system_from_ms,
        }
    }

    /// Tile id for a non-bitemporal write (pass `system_from_ms = 0`).
    pub fn snapshot(hilbert_prefix: u64) -> Self {
        Self::new(hilbert_prefix, 0)
    }
}

#[cfg(test)]
mod tests {
    use super::*;

    #[test]
    fn tile_id_orders_by_prefix_then_time() {
        let a = TileId::new(10, 100);
        let b = TileId::new(10, 200);
        let c = TileId::new(11, 0);
        assert!(a < b);
        assert!(b < c);
    }
}