(
&self,
node: GraphNode<NodeId>,
min_flag: EdgeFlags,
max_flag: EdgeFlags,
)
| 206 | } |
| 207 | |
| 208 | fn iter_adjacent( |
| 209 | &self, |
| 210 | node: GraphNode<NodeId>, |
| 211 | min_flag: EdgeFlags, |
| 212 | max_flag: EdgeFlags, |
| 213 | ) -> PristineResult<Self::Adj> { |
| 214 | let key = encode_vertex(node.change.get(), node.start.get(), node.end.get()); |
| 215 | let mut edges = Vec::new(); |
| 216 | for result in self.graph.get(&key)? { |
| 217 | let value = result?; |
| 218 | let edge = deserialize_graph_edge(value.value()); |
| 219 | let flag = edge.flag(); |
| 220 | if flag >= min_flag && flag <= max_flag { |
| 221 | edges.push(edge); |
| 222 | } |
| 223 | } |
| 224 | Ok(AdjIterator::new(edges)) |
| 225 | } |
| 226 | |
| 227 | fn find_block(&self, pos: Position<NodeId>) -> PristineResult<GraphNode<NodeId>> { |
| 228 | if pos.change.is_root() { |
no test coverage detected