pub fn check_height_to_key_diff(&self) -> Vec<K> {
        let mut ret = HashMap::new();
        for nodes in self.nodes_by_height.values() {
            for b in nodes {
                ret.insert(*b, ());
            }
        }
        for key in self.nodes_by_key.keys() {
            ret.remove(key);
        }
        ret.keys().copied().collect::<Vec<K>>()
    }
/// Utility function that takes the lists of nodes stored by key and nodes stored
/// by their height, and checks for node that are only logged by height and not by key.
/// This should always only return the current root.
Utility function that takes the lists of nodes stored by key and nodes stored
by their height, and checks for node that are only logged by height and not by key.
This should always only return the current root.
Utility function that takes the lists of nodes stored by key and nodes stored by their height and checks for node that are only logged by height and not by key . This should always only return the current root .
pub fn check_height_to_key_diff(&self) -> Vec<K> {
        let mut ret = HashMap::new();
        for nodes in self.nodes_by_height.values() {
            for b in nodes {
                ret.insert(*b, ());
            }
        }
        for key in self.nodes_by_key.keys() {
            ret.remove(key);
        }
        ret.keys().copied().collect::<Vec<K>>()
    }
pub fn check_height_to_key_diff ( & self ) -> Vec < K > { let mut ret = HashMap :: new ( ) ; for nodes in self . nodes_by_height . values ( ) { for b in nodes { ret . insert ( * b , ( ) ) ; } } for key in self . nodes_by_key . keys ( ) { ret . remove ( key ) ; } ret . keys ( ) . copied ( ) . collect :: < Vec < K > > ( ) }
Utility function that takes the lists of nodes stored by key and nodes stored
by their height, and checks for node that are only logged by height and not by key.
Utility function that takes the lists of nodes stored by key and nodes stored by their height and checks for node that are only logged by height and not by key .
&self
&self