Struct MemGraph 

pub struct MemGraph { /* private fields */ }

A simple in-memory temporal graph.

Stores edges as (source, label, target, interval) tuples. Queries are linear scans — fine for testing, not for production.

Implementations

impl MemGraph

pub fn new() -> Self

Create a new empty graph.

pub fn set_time(&mut self, t: i64)

Set the current time.

pub fn add_edge( &mut self, source: &str, label: &str, target: MemValue, start: i64, )

Add an edge with an open-ended interval starting at start.

pub fn add_edge_bounded( &mut self, source: &str, label: &str, target: MemValue, start: i64, end: i64, )

Add an edge with a bounded interval [start, end).

pub fn add_ref( &mut self, source: &str, label: &str, target_node: &str, start: i64, )

Convenience: add a node-to-node edge.

pub fn add_str(&mut self, source: &str, label: &str, value: &str, start: i64)

Convenience: add a node-to-string edge.

pub fn add_num(&mut self, source: &str, label: &str, value: f64, start: i64)

Convenience: add a node-to-number edge.

pub fn end_edge(&mut self, source: &str, label: &str, at: i64) -> bool

Close an open-ended interval on the first matching edge.

Finds the most recent open-ended edge from source with the given label and sets its end to at. Returns true if an edge was closed, false if no open-ended match was found.

pub fn upsert_edge( &mut self, source: &str, label: &str, value: MemValue, at: i64, )

End the current open-ended edge (if any) and insert a new one.

Equivalent to end_edge(source, label, at) followed by add_edge(source, label, value, at). Useful for updating state: close the old value and record the new one at the same timestamp.

pub fn edge_count(&self) -> usize

Total number of edges.

Trait Implementations

impl Clone for MemGraph

fn clone(&self) -> MemGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl DataSource for MemGraph

type N = String

Node identifier type.

type L = String

Edge label type.

type V = MemValue

Value type (edge targets — can be nodes, strings, numbers, booleans).

type T = i64

Time type.

fn edges_from( &self, node: &String, label: &String, at: &i64, ) -> Vec<Edge<String, MemValue, i64>>

Follow edges from node with label, active at time at.

fn scan( &self, label: &String, constraint: &ValueConstraint<MemValue>, at: &i64, ) -> Vec<Edge<String, MemValue, i64>>

Find all source nodes that have an edge with label matching constraint, active at time at.

fn edges_from_any_time( &self, node: &String, label: &String, ) -> Vec<Edge<String, MemValue, i64>>

Find all edges from node with label that were ever valid (regardless of time). Used for temporal constraint checking.

fn scan_any_time( &self, label: &String, constraint: &ValueConstraint<MemValue>, ) -> Vec<Edge<String, MemValue, i64>>

Scan for edges with label matching constraint at any time.

fn now(&self) -> i64

The current time in the graph’s time model.

fn value_as_node(&self, value: &MemValue) -> Option<String>

Check if a value represents a node reference (for traversal) vs. a literal (for comparison). This lets the pattern matcher know whether to follow a value as a node or compare it as data.

impl Default for MemGraph

fn default() -> Self

Returns the “default value” for a type.