Struct SnapshotGraphBuilder 

pub struct SnapshotGraphBuilder { /* private fields */ }

Builds an InMemoryGraph from snapshot records one at a time.

A decoder that streams a snapshot pushes each record as it decodes it, so the records are never all held at once beside the graph they fill. Push every node before the relationships that reference it, then call Self::finish with the catalogs, which registers the indexes and constraints over the loaded data.

Implementations

impl SnapshotGraphBuilder

pub fn new( next_node_id: NodeId, next_rel_id: RelationshipId, ) -> Result<Self, SnapshotError>

pub fn push_node(&mut self, node: NodeRecord) -> Result<(), SnapshotError>

pub fn push_relationship( &mut self, rel: RelationshipRecord, ) -> Result<(), SnapshotError>

pub fn finish( self, indexes: Vec<IndexDefinition>, constraints: Vec<ConstraintDefinition>, vector_indexes: Vec<VectorIndexSnapshot>, ) -> Result<InMemoryGraph, SnapshotError>

impl SnapshotGraphBuilder

pub fn prime( &mut self, names: &SnapshotNames, ) -> Result<SnapshotEncoder, SnapshotError>

Number the snapshot’s names in the graph being built, and return an encoder that turns records named by those numbers into the graph’s stored form on any thread. Call before pushing records.

pub fn push_nodes(&mut self, batch: NodeBatch) -> Result<(), SnapshotError>

Store nodes an encoder from Self::prime encoded.

pub fn push_relationships( &mut self, batch: RelationshipBatch, ) -> Result<(), SnapshotError>

Store relationships an encoder from Self::prime encoded. Their endpoints must already be pushed.

pub fn push_relationship_batches( &mut self, batches: Vec<RelationshipBatch>, ) -> Result<(), SnapshotError>

Self::push_relationships for several batches, in order: their adjacency is linked in one pass, on every core when the build allows.