MCPcopy Create free account
hub / github.com/atomicdotdev/atomic / iter_adjacent

Method iter_adjacent

atomic-core/src/pristine/view_graph.rs:200–212  ·  view source on GitHub ↗

Iterate adjacent edges, filtering by visibility. Only edges whose `introduced_by` is ROOT or is in the visible set are yielded. All other edges are silently skipped.

(
        &self,
        node: GraphNode<NodeId>,
        min_flag: EdgeFlags,
        max_flag: EdgeFlags,
    )

Source from the content-addressed store, hash-verified

198 /// Only edges whose `introduced_by` is ROOT or is in the visible set
199 /// are yielded. All other edges are silently skipped.
200 fn iter_adjacent(
201 &self,
202 node: GraphNode<NodeId>,
203 min_flag: EdgeFlags,
204 max_flag: EdgeFlags,
205 ) -> Result<Self::Adj, PristineError> {
206 let inner_iter = self.inner.iter_adjacent(node, min_flag, max_flag)?;
207 Ok(FilteredAdj {
208 inner: inner_iter,
209 visibility: self.visibility.clone(),
210 exhausted: false,
211 })
212 }
213
214 /// Structural lookup — no filtering. Delegates to inner.
215 fn find_block(&self, pos: Position<NodeId>) -> Result<GraphNode<NodeId>, PristineError> {

Callers

nothing calls this directly

Calls 1

cloneMethod · 0.45

Tested by

no test coverage detected