///
/// check, that removedNodes contains all nodes, that are where removed, and do not contain nodes, that are still in the tree
///
check, that removedNodes contains all nodes, that are where removed, and do not contain nodes, that are still in the tree
check that removedNodes contains all nodes that are where removed and do not contain nodes that are still in the tree
pub fn check_tree(prover: &mut BatchAVLProver, old_top: &NodeId, removed_nodes: &Vec<NodeId>) {
    // check that there are no nodes in removedNodes, that are still in the tree
    for r in removed_nodes {
        assert!(!prover.contains(r));
    }
    let removed = check_removed(prover, old_top, removed_nodes);
    assert_eq!(removed, removed_nodes.len());
}
pub fn check_tree ( prover : & mut BatchAVLProver , old_top : & NodeId , removed_nodes : & Vec < NodeId > ) { // check that there are no nodes in removedNodes, that are still in the tree for r in removed_nodes { assert ! ( prover contains ( r ) ) ; } let removed = check_removed ( prover , old_top , removed_nodes ) ; assert_eq ! ( removed removed_nodes len ( ) ) ; }
check, that removedNodes contains all nodes, that are where removed, and do not contain nodes, that are still in the tree
check that removedNodes contains all nodes that are where removed and do not contain nodes that are still in the tree
prover
&mut BatchAVLProver
old_top
&NodeId
removed_nodes
&Vec<NodeId>