Enum Namespace 

#[non_exhaustive]
#[repr(u8)]
pub enum Namespace {
    Meta = 0,
    Vector = 1,
    Graph = 2,
    Crdt = 3,
    LoroState = 4,
    Spatial = 5,
    Strict = 6,
    Columnar = 7,
    Kv = 8,
    Array = 9,
    ArrayOpLog = 10,
    ArrayDelta = 11,
    Fts = 12,
    StrictHistory = 13,
    GraphHistory = 14,
    DocumentHistory = 15,
    LatestVersion = 16,
}

Storage namespace. Each engine writes to its own namespace in the blob KV store, preventing key collisions.

Variants (Non-exhaustive)

Non-exhaustive enums could have additional variants added in future. Therefore, when matching against variants of non-exhaustive enums, an extra wildcard arm must be added to account for any future variants.

Meta = 0

Database metadata: schema version, config, Shape subscriptions.

Vector = 1

Vector engine: HNSW graph layers, vector data.

Graph = 2

Graph engine: CSR arrays, node/label interning tables.

Crdt = 3

CRDT deltas: unsent mutations awaiting sync.

LoroState = 4

Loro state snapshots: compacted CRDT state for fast cold-start.

Spatial = 5

Spatial engine: R-tree checkpoints, geohash indexes.

Strict = 6

Strict document engine: Binary Tuple rows keyed by PK.

Columnar = 7

Columnar engine: compressed segments, delete bitmaps, segment metadata.

Kv = 8

KV engine: direct key-value storage (bypasses Loro CRDT). Used when sync is disabled or for the local-only KV fast path.

Array = 9

Array engine: ND sparse arrays, catalog, manifests, segment bytes.

ArrayOpLog = 10

Array CRDT op-log: append-only ops awaiting sync + GC.

ArrayDelta = 11

Array sync pending queue: ops waiting for transport delivery.

Fts = 12

Full-text search engine: posting lists, doc-length maps, BM25 stats, fieldnorm blobs, segment bytes, and surrogate maps.

StrictHistory = 13

Bitemporal history table for strict document collections.

Keys: {collection}:{system_from_ms_8be}:{pk_bytes} — value is the full Binary Tuple followed by an 8-byte big-endian system_to_ms (u64::MAX = open / still-current at time of supersession).

GraphHistory = 14

Bitemporal history table for graph edge collections.

Keys: {collection}:{edge_id_8be}:{system_from_ms_8be} — value is the MessagePack-encoded edge props followed by an 8-byte big-endian system_to_ms (u64::MAX = current / not yet deleted).

DocumentHistory = 15

Bitemporal history table for schemaless document collections.

Keys: {collection}:{doc_id}\x00{system_from_ms:020} — value is [tag:u8][valid_from_ms:i64 LE][valid_until_ms:i64 LE][body_msgpack...]. tag = 0x00 (live), 0xFF (tombstone), 0xFE (GDPR erased).

LatestVersion = 16

O(1) pointer to the currently-live DocumentHistory version.

Keys: {collection}:{doc_id} — value is the system_from_ms of the live row encoded as a 20-digit zero-padded ASCII decimal (matching the suffix used in DocumentHistory keys). Absent when no live version exists (document never written, tombstoned, or GDPR-erased).

Written atomically alongside every DocumentHistory mutation so that versioned_get_current can resolve the current version with one index lookup + one history fetch instead of a full prefix scan.

Implementations

impl Namespace

pub fn from_u8(v: u8) -> Option<Self>

Convert from raw u8 (for storage layer deserialization).

Trait Implementations

impl Archive for Namespace

type Archived = ArchivedNamespace

The archived representation of this type.

type Resolver = NamespaceResolver

The resolver for this type. It must contain all the additional information from serializing needed to make the archived type from the normal type.

fn resolve( &self, resolver: <Self as Archive>::Resolver, out: Place<<Self as Archive>::Archived>, )

Creates the archived version of this value at the given position and writes it to the given output.

const COPY_OPTIMIZATION: CopyOptimization<Self> = _

An optimization flag that allows the bytes of this type to be copied directly to a writer instead of calling serialize.

impl Clone for Namespace

fn clone(&self) -> Namespace

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for Namespace

impl Debug for Namespace

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for Namespace

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<__D: Fallible + ?Sized> Deserialize<Namespace, __D> for Archived<Namespace>

fn deserialize( &self, deserializer: &mut __D, ) -> Result<Namespace, <__D as Fallible>::Error>

Deserializes using the given deserializer

impl Eq for Namespace

impl Hash for Namespace

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 PartialEq for Namespace

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

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<__S: Fallible + ?Sized> Serialize<__S> for Namespace

fn serialize( &self, serializer: &mut __S, ) -> Result<<Self as Archive>::Resolver, <__S as Fallible>::Error>

Writes the dependencies for the object and returns a resolver that can create the archived type.

impl StructuralPartialEq for Namespace