| 46 | } |
| 47 | |
| 48 | fn iter_adjacent( |
| 49 | &self, |
| 50 | node: GraphNode<NodeId>, |
| 51 | min_flag: EdgeFlags, |
| 52 | max_flag: EdgeFlags, |
| 53 | ) -> PristineResult<Self::Adj> { |
| 54 | let table = self.txn.open_multimap_table(GRAPH)?; |
| 55 | let key = encode_vertex(node.change.get(), node.start.get(), node.end.get()); |
| 56 | |
| 57 | let mut edges = Vec::new(); |
| 58 | for v in try_collect(table.get(&key)?)? { |
| 59 | let bytes: &[u8; 24] = v.value(); |
| 60 | let edge = deserialize_edge(bytes); |
| 61 | let flag = edge.flag(); |
| 62 | if flag >= min_flag && flag <= max_flag { |
| 63 | edges.push(edge); |
| 64 | } |
| 65 | } |
| 66 | |
| 67 | Ok(AdjIterator::new(edges)) |
| 68 | } |
| 69 | |
| 70 | fn find_block(&self, pos: Position<NodeId>) -> PristineResult<GraphNode<NodeId>> { |
| 71 | // Handle ROOT position specially - ROOT is a virtual span that doesn't |