B+Tree that totally from scratch written with Rust lang.

Basic operations common to BTreeMap in the Rust standard library

• get

  fn get<Q: ?Sized>(&self, key: &Q) -> Option<&V>
  where
      K: Borrow<Q> + Ord,
      Q: Ord, 
  

• insert

  fn insert(&mut self, key: K, value: V) -> Option<V>
  

• remove

  fn remove(&mut self, key: &K) -> Option<V>
  

• range

  fn range<T: ?Sized, R>(&self, range: R) -> Range<'_, K, V>
  where
      T: Ord,
      K: Ord + Borrow<T>,
      R: RangeBounds<T>,
  

• keys

  fn keys(&self) -> Keys<'_, K, V>
  

• values

  fn values(&self) -> Values<'_, K, V>
  

and there're other things.

MIT