| 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 |