///
/// Figures out whether to go left or right when from node r when searching for the key,
/// using the appropriate bit in the directions bit string from the proof
///
/// @param key
/// @param r
/// @return - true if to go left, false if to go right in the search
///
Figures out whether to go left or right when from node r when searching for the key,
using the appropriate bit in the directions bit string from the proof
Figures out whether to go left or right when from node r when searching for the key using the appropriate bit in the directions bit string from the proof
fn next_direction_is_left(&mut self, _key: &ADKey, _r: &InternalNode) -> bool {
        // Decode bits of the proof as Booleans
        let ret =
            if self.proof[self.directions_index >> 3] & (1 << (self.directions_index & 7)) != 0 {
                true
            } else {
                self.last_right_step = self.directions_index;
                false
            };
        self.directions_index += 1;
        ret
    }
fn next_direction_is_left ( & mut self , _key : & ADKey , _r : & InternalNode ) -> bool { // Decode bits of the proof as Booleans let ret = if self . proof [ self . directions_index >> 3 ] & ( 1 << ( self . directions_index & 7 ) ) != 0 { true } else { self . last_right_step = self . directions_index ; false } ; self . directions_index += 1 ; ret }
Figures out whether to go left or right when from node r when searching for the key,
using the appropriate bit in the directions bit string from the proof
Figures out whether to go left or right when from node r when searching for the key using the appropriate bit in the directions bit string from the proof
true if to go left, false if to go right in the search
true if to go left false if to go right in the search
&mut self
_key
&ADKey
_r
&InternalNode
key
None
r
None