Struct GraphModelAccess 

pub struct GraphModelAccess { /* private fields */ }

ModelAccess implementation built from a StaticGraph.

Indices are lazily built on first access via [ensure_built] and stored as Arc-wrapped maps for cheap cloning.

Construction

• GraphModelAccess::new — lazy, caches built on first ensure_built() call
• GraphModelAccess::new_eager — builds caches immediately
• GraphModelAccess::from_graph — backward-compat eager constructor

Implementations

impl GraphModelAccess

pub fn new(graph: Arc<StaticGraph>, default_allow: bool) -> Self

Create a new lazy GraphModelAccess. Caches are not built until [ensure_built] is called (or a mutable accessor triggers it).

pub fn new_eager(graph: Arc<StaticGraph>, default_allow: bool) -> Self

Create a GraphModelAccess with caches built immediately.

pub fn from_graph(graph: &StaticGraph) -> Self

Backward-compatible eager constructor from a borrowed StaticGraph.

pub fn ensure_built(&mut self) -> Result<(), String>

Ensure all caches are built. No-op if already built.

pub fn is_built(&self) -> bool

Returns true if caches have been built.

pub fn invalidate_caches(&mut self)

Clear all cached indices. The next call to [ensure_built] will rebuild.

pub fn get_nodes_internal(&self) -> Option<&HashMap<String, Arc<StaticNode>>>

Get nodes by ID (returns None if caches not built).

pub fn get_nodes_by_alias_internal( &self, ) -> Option<&HashMap<String, Arc<StaticNode>>>

Get nodes by alias (returns None if caches not built).

pub fn get_edges_internal(&self) -> Option<&HashMap<String, Vec<String>>>

Get edges (returns None if caches not built).

pub fn get_reverse_edges_internal( &self, ) -> Option<&HashMap<String, Vec<String>>>

Get reverse edges (returns None if caches not built).

pub fn get_nodes_by_nodegroup_internal( &self, ) -> Option<&HashMap<String, Vec<Arc<StaticNode>>>>

Get nodes grouped by nodegroup (returns None if caches not built).

pub fn get_nodegroups_internal( &self, ) -> Option<&HashMap<String, Arc<StaticNodegroup>>>

Get nodegroups by ID (returns None if caches not built).

pub fn get_nodes_arc(&self) -> Option<Arc<HashMap<String, Arc<StaticNode>>>>

pub fn get_nodes_by_alias_arc( &self, ) -> Option<Arc<HashMap<String, Arc<StaticNode>>>>

pub fn get_edges_arc(&self) -> Option<Arc<HashMap<String, Vec<String>>>>

pub fn get_reverse_edges_arc(&self) -> Option<Arc<HashMap<String, Vec<String>>>>

pub fn get_nodes_by_nodegroup_arc( &self, ) -> Option<Arc<HashMap<String, Vec<Arc<StaticNode>>>>>

pub fn get_nodegroups_arc( &self, ) -> Option<Arc<HashMap<String, Arc<StaticNodegroup>>>>

pub fn get_node_objects( &mut self, ) -> Result<&HashMap<String, Arc<StaticNode>>, String>

Get nodes, building caches if needed.

pub fn get_node_objects_by_alias( &mut self, ) -> Result<&HashMap<String, Arc<StaticNode>>, String>

Get nodes by alias, building caches if needed.

pub fn get_edges(&mut self) -> Result<&HashMap<String, Vec<String>>, String>

Get edges, building caches if needed.

pub fn get_nodegroup_objects( &mut self, ) -> Result<&HashMap<String, Arc<StaticNodegroup>>, String>

Get nodegroups, building caches if needed.

pub fn get_root_node_mut(&mut self) -> Result<Arc<StaticNode>, String>

Get root node, building caches if needed.

pub fn get_child_nodes_mut( &mut self, node_id: &str, ) -> Result<HashMap<String, Arc<StaticNode>>, String>

Get child nodes for a given node, building caches if needed.

pub fn get_child_nodes(&self, node_id: &str) -> HashMap<String, Arc<StaticNode>>

Get child nodes from already-built caches. Returns empty map if caches not built.

pub fn get_nodes_by_alias(&self) -> Option<&HashMap<String, Arc<StaticNode>>>

Get nodes indexed by alias (requires caches already built).

pub fn get_graph(&self) -> &StaticGraph

Get a reference to the underlying graph.

pub fn get_graph_arc(&self) -> Arc<StaticGraph>

Get an Arc clone of the underlying graph.

pub fn get_default_allow(&self) -> bool

Get the default_allow setting.

pub fn set_graph(&mut self, graph: Arc<StaticGraph>)

Replace the graph and invalidate all caches.

pub fn set_graph_nodes(&mut self, nodes: Vec<StaticNode>)

Replace graph nodes and invalidate caches.

pub fn set_graph_edges(&mut self, edges: Vec<StaticEdge>)

Replace graph edges and invalidate caches.

pub fn set_graph_nodegroups(&mut self, nodegroups: Vec<StaticNodegroup>)

Replace graph nodegroups and invalidate caches.

pub fn rebuild_from_graph(&mut self, graph: &StaticGraph)

Rebuild indices from a new graph, preserving permissions.

pub fn set_permitted_nodegroups_rules( &mut self, permissions: HashMap<String, PermissionRule>, )

Set permitted nodegroups with full PermissionRule support.

pub fn set_permitted_nodegroups_bool( &mut self, permissions: HashMap<String, bool>, )

Set permitted nodegroups from boolean map (backward compatibility).

pub fn set_default_allow(&mut self, default_allow: bool)

Set the default permission for nodegroups not explicitly listed.

pub fn is_nodegroup_permitted(&self, nodegroup_id: &str) -> bool

Check if a nodegroup is permitted. Conditional rules return true (nodegroup permitted, tiles filtered separately).

pub fn is_tile_permitted(&self, tile: &StaticTile) -> bool

Check if a specific tile is permitted by its nodegroup’s permission rule.

pub fn get_permission_rule(&self, nodegroup_id: &str) -> Option<&PermissionRule>

Get the permission rule for a nodegroup.

pub fn get_permitted_nodegroups_bool(&self) -> HashMap<String, bool>

Get permitted nodegroups as a boolean map (for backward compat).

pub fn get_permitted_nodegroups_rules(&self) -> &HashMap<String, PermissionRule>

Get all permission rules.

pub fn prune_graph( &mut self, keep_functions: Option<&[String]>, ) -> Result<(), String>

Prune graph to only include permitted nodegroups and their dependencies. Updates the graph and rebuilds caches.

Trait Implementations

impl Clone for GraphModelAccess

fn clone(&self) -> GraphModelAccess

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl ModelAccess for GraphModelAccess

fn get_nodes(&self) -> Option<&HashMap<String, Arc<StaticNode>>>

Get all nodes by ID

fn get_edges(&self) -> Option<&HashMap<String, Vec<String>>>

Get edges (parent_nodeid -> child_nodeids)

fn get_reverse_edges(&self) -> Option<&HashMap<String, Vec<String>>>

Get reverse edges (child_nodeid -> parent_nodeids)

fn get_nodes_by_nodegroup( &self, ) -> Option<&HashMap<String, Vec<Arc<StaticNode>>>>

Get nodes grouped by nodegroup

fn get_nodegroups(&self) -> Option<&HashMap<String, Arc<StaticNodegroup>>>

Get all nodegroups by ID

fn get_root_node(&self) -> Result<Arc<StaticNode>, String>

Get the root node of the graph. Default implementation prefers istopnode, with fallback to scanning for nodes with no nodegroup_id.

fn get_permitted_nodegroups(&self) -> HashMap<String, PermissionRule>

Get permitted nodegroups as permission rules. Each rule may be a simple boolean or a conditional (per-tile) filter.

fn get_child_nodes( &self, node_id: &str, ) -> Result<HashMap<String, Arc<StaticNode>>, String>

Get child nodes for a parent node, keyed by alias. Default implementation derives from get_edges() and get_nodes().