(
&self,
node: GraphNode<NodeId>,
min_flag: EdgeFlags,
max_flag: EdgeFlags,
)
| 178 | } |
| 179 | |
| 180 | fn iter_adjacent( |
| 181 | &self, |
| 182 | node: GraphNode<NodeId>, |
| 183 | min_flag: EdgeFlags, |
| 184 | max_flag: EdgeFlags, |
| 185 | ) -> PristineResult<Self::Adj> { |
| 186 | let key = encode_vertex(node.change.get(), node.start.get(), node.end.get()); |
| 187 | let mut edges = Vec::new(); |
| 188 | for result in self.graph.get(&key)? { |
| 189 | let value = result?; |
| 190 | let edge = deserialize_graph_edge(value.value()); |
| 191 | let flag = edge.flag(); |
| 192 | if flag >= min_flag && flag <= max_flag { |
| 193 | edges.push(edge); |
| 194 | } |
| 195 | } |
| 196 | Ok(AdjIterator::new(edges)) |
| 197 | } |
| 198 | |
| 199 | fn find_block(&self, pos: Position<NodeId>) -> PristineResult<GraphNode<NodeId>> { |
| 200 | if pos.change.is_root() { |
no test coverage detected