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

Method iter_adjacent

atomic-core/src/pristine/txn/read.rs:259–279  ·  view source on GitHub ↗
(
        &self,
        node: GraphNode<NodeId>,
        min_flag: EdgeFlags,
        max_flag: EdgeFlags,
    )

Source from the content-addressed store, hash-verified

257 }
258
259 fn iter_adjacent(
260 &self,
261 node: GraphNode<NodeId>,
262 min_flag: EdgeFlags,
263 max_flag: EdgeFlags,
264 ) -> PristineResult<Self::Adj> {
265 let table = self.txn.open_multimap_table(GRAPH)?;
266 let key = encode_vertex(node.change.get(), node.start.get(), node.end.get());
267
268 let mut edges = Vec::new();
269 for v in try_collect(table.get(&key)?)? {
270 let bytes: &[u8; 24] = v.value();
271 let edge = deserialize_edge(bytes);
272 let flag = edge.flag();
273 if flag >= min_flag && flag <= max_flag {
274 edges.push(edge);
275 }
276 }
277
278 Ok(AdjIterator::new(edges))
279 }
280
281 fn find_block(&self, pos: Position<NodeId>) -> PristineResult<GraphNode<NodeId>> {
282 // Handle ROOT position specially - ROOT is a virtual span that doesn't

Calls 9

encode_vertexFunction · 0.85
try_collectFunction · 0.85
valueMethod · 0.80
flagMethod · 0.80
deserialize_edgeFunction · 0.70
getMethod · 0.65
pushMethod · 0.45
collectMethod · 0.45
iterMethod · 0.45