///
/// Deletions go down the tree twice -- once to find the leaf and realize
/// that it needs to be deleted, and the second time to actually perform the deletion.
/// This method will re-create comparison results using directions in the proof and lastRightStep
/// variable. Each time it's called, it will give the next comparison result of
/// key and node.key, where node starts at the root and progresses down the tree
/// according to the comparison results.
///
/// @return - result of previous comparison of key and relevant node's key
///
Deletions go down the tree twice -- once to find the leaf and realize
that it needs to be deleted, and the second time to actually perform the deletion.
This method will re-create comparison results using directions in the proof and lastRightStep
variable. Each time it's called, it will give the next comparison result of
key and node.key, where node starts at the root and progresses down the tree
according to the comparison results.
Deletions go down the tree twice -- once to find the leaf and realize that it needs to be deleted and the second time to actually perform the deletion . This method will re - create comparison results using directions in the proof and lastRightStep variable . Each time it ' s called it will give the next comparison result of key and node . key where node starts at the root and progresses down the tree according to the comparison results .
fn replay_comparison(&mut self) -> i32 {
        let ret = if self.replay_index == self.last_right_step {
            0
        } else if (self.proof[self.replay_index >> 3] & (1 << (self.replay_index & 7))) == 0
            && self.replay_index < self.last_right_step
        {
            1
        } else {
            -1
        };
        self.replay_index += 1;
        ret
    }
fn replay_comparison ( & mut self ) -> i32 { let ret = if self . replay_index == self . last_right_step { 0 } else if ( self . proof [ self . replay_index >> 3 ] & ( 1 << ( self . replay_index & 7 ) ) ) == 0 && self . replay_index < self . last_right_step { 1 } else { - 1 } ; self . replay_index += 1 ; ret }
Deletions go down the tree twice -- once to find the leaf and realize
that it needs to be deleted, and the second time to actually perform the deletion.
Deletions go down the tree twice -- once to find the leaf and realize that it needs to be deleted and the second time to actually perform the deletion .
result of previous comparison of key and relevant node's key
result of previous comparison of key and relevant node ' s key
&mut self