Initial lib.rs and cargo fmt

src/btree/borrow.rs

@@ -28,7 +28,13 @@ impl<'a, T> DormantMutRef<'a, T> {
         // SAFETY: we hold the borrow throughout 'a via `_marker`, and we expose
         // only this reference, so it is unique.
         let new_ref = unsafe { &mut *ptr.as_ptr() };
-        (new_ref, Self { ptr, _marker: PhantomData })
+        (
+            new_ref,
+            Self {
+                ptr,
+                _marker: PhantomData,
+            },
+        )
     }
 
     /// Revert to the unique borrow initially captured.

src/btree/dedup_sorted_iter.rs

@@ -18,7 +18,9 @@ where
     I: Iterator<Item = (K, V)>,
 {
     pub fn new(iter: I) -> Self {
-        Self { iter: iter.peekable() }
+        Self {
+            iter: iter.peekable(),
+        }
     }
 }
 

src/btree/fix.rs

@@ -79,7 +79,9 @@ impl<K, V> Root<K, V> {
     pub fn fix_right_border<A: Allocator + Clone>(&mut self, alloc: A) {
         self.fix_top(alloc.clone());
         if self.len() > 0 {
-            self.borrow_mut().last_kv().fix_right_border_of_right_edge(alloc.clone());
+            self.borrow_mut()
+                .last_kv()
+                .fix_right_border_of_right_edge(alloc.clone());
             self.fix_top(alloc);
         }
     }
@@ -88,7 +90,9 @@ impl<K, V> Root<K, V> {
     pub fn fix_left_border<A: Allocator + Clone>(&mut self, alloc: A) {
         self.fix_top(alloc.clone());
         if self.len() > 0 {
-            self.borrow_mut().first_kv().fix_left_border_of_left_edge(alloc.clone());
+            self.borrow_mut()
+                .first_kv()
+                .fix_left_border_of_left_edge(alloc.clone());
             self.fix_top(alloc);
         }
     }