Function sled_search::max[−][src]

pub fn max(tree: &Tree) -> Result<Option<(Vec<u8>, Vec<u8>)>, ()>

Find the maximum entry within the given Tree using a binary search.

  1. Repeatedly appending 0xFF until scan next returns None.
  2. Binary search the final byte to find the greatest value that causes scan.next to return Some.
  3. GOTO 1.

The key has been found when the binary search in step 2. finds no keys that return Some.