Small format, remove unnecessary lifetimes

Author: spacejam

src/binary_search.rs

@@ -2,18 +2,15 @@ use std::cmp::Ordering::{Equal, Greater, Less};
 
 use crate::{fastcmp, IVec};
 
-pub(crate) fn binary_search_lub<'a>(
-    key: &[u8],
-    s: &'a [IVec],
-) -> Option<usize> {
+pub(crate) fn binary_search_lub(key: &[u8], s: &[IVec]) -> Option<usize> {
     match binary_search(key, s) {
         Ok(i) => Some(i),
         Err(i) if i == 0 => None,
         Err(i) => Some(i - 1),
     }
 }
 
-pub fn binary_search<'a>(key: &[u8], s: &'a [IVec]) -> Result<usize, usize> {
+pub fn binary_search(key: &[u8], s: &[IVec]) -> Result<usize, usize> {
     let mut size = s.len();
     if size == 0 || *key < *s[0] {
         return Err(0);
@@ -35,7 +32,11 @@ pub fn binary_search<'a>(key: &[u8], s: &'a [IVec]) -> Result<usize, usize> {
     #[allow(unsafe_code)]
     let l = unsafe { s.get_unchecked(base).as_ref() };
     let cmp = fastcmp(l, key);
-    if cmp == Equal { Ok(base) } else { Err(base + (cmp == Less) as usize) }
+    if cmp == Equal {
+        Ok(base)
+    } else {
+        Err(base + (cmp == Less) as usize)
+    }
 }
 
 #[test]

src/tree.rs

@@ -1517,12 +1517,12 @@ impl Tree {
         Ok(())
     }
 
-    fn root_hoist<'g>(
+    fn root_hoist(
         &self,
         from: PageId,
         to: PageId,
         at: IVec,
-        guard: &'g Guard,
+        guard: &Guard,
     ) -> Result<bool> {
         M.tree_root_split_attempt();
         // hoist new root, pointing to lhs & rhs