Struct StorageId 

pub struct StorageId {
    pub idx: u32,
    pub gen: u32,
}

Index into the graph’s parallel storage arena (foundations §6.4). A stateful operator (Take/Cap/Exists, spec 07) is handed one of these at build time and reads/writes its scratch state via Graph::storage. The operator never owns its store: the indirection is what lets the client keep it in RAM (MemoryStorage) while the server later spills it to SQLite (10 §1.1) without touching operator code. Distinct newtype from NodeId so the two index spaces can’t be confused. Generational for the same reason (storage slots are freed + reused on teardown).

Fields

idx: u32

gen: u32

Trait Implementations

impl Clone for StorageId

fn clone(&self) -> StorageId

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for StorageId

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

Formats the value using the given formatter.

impl Hash for StorageId

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 StorageId

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

impl Eq for StorageId

impl StructuralPartialEq for StorageId