Method iter_adjacent

atomic-core/src/pristine/traits/tests/graph_tests.rs:49–67

(
        &self,
        node: GraphNode<NodeId>,
        min_flag: EdgeFlags,
        max_flag: EdgeFlags,
    )

    }

    fn iter_adjacent(
        &self,
        node: GraphNode<NodeId>,
        min_flag: EdgeFlags,
        max_flag: EdgeFlags,
    ) -> Result<Self::Adj, PristineError> {
        let edges: Vec<Result<SerializedGraphEdge, PristineError>> = self
            .edges
            .iter()
            .filter(|(n, _)| *n == node)
            .map(|(_, e)| *e)
            .filter(|e| {
                let flag = e.flag();
                flag >= min_flag && flag <= max_flag
            })
            .map(Ok)
            .collect();
        Ok(edges.into_iter())
    }

    fn find_block(&self, _pos: Position<NodeId>) -> Result<GraphNode<NodeId>, PristineError> {
        Err(PristineError::BlockNotFound { change: 0, pos: 0 })