(
&self,
node: GraphNode<NodeId>,
min_flag: EdgeFlags,
max_flag: EdgeFlags,
)
| 95 | } |
| 96 | |
| 97 | fn iter_adjacent( |
| 98 | &self, |
| 99 | node: GraphNode<NodeId>, |
| 100 | min_flag: EdgeFlags, |
| 101 | max_flag: EdgeFlags, |
| 102 | ) -> PristineResult<Self::Adj> { |
| 103 | let table = self.txn.open_multimap_table(GRAPH)?; |
| 104 | let key = encode_vertex(node.change.get(), node.start.get(), node.end.get()); |
| 105 | |
| 106 | let mut edges = Vec::new(); |
| 107 | for v in table.get(&key)?.filter_map(|r| r.ok()) { |
| 108 | let bytes: &[u8; 24] = v.value(); |
| 109 | let edge = deserialize_edge(bytes); |
| 110 | let flag = edge.flag(); |
| 111 | if flag >= min_flag && flag <= max_flag { |
| 112 | edges.push(edge); |
| 113 | } |
| 114 | } |
| 115 | |
| 116 | Ok(AdjIterator::new(edges)) |
| 117 | } |
| 118 | |
| 119 | fn find_block(&self, pos: Position<NodeId>) -> PristineResult<GraphNode<NodeId>> { |
| 120 | // Handle ROOT position specially - ROOT is a virtual span that doesn't |
nothing calls this directly
no test coverage detected