Crate btree_experiment

This crate implements a BTreeMap similar to std::collections::BTreeMap.

One difference is the walk and walk_mut methods, which can be slightly more efficient than using range and range_mut.

Re-exports

• pub use generic::Entry::Occupied;
• pub use generic::Entry::Vacant;
• pub use generic::UnorderedKeyError;

Modules

• generic
  Module with version of BTreeMap that allows B to specified as generic constant.

Constants

• DB
  Default node capacity = 41( B is usually defined as half this number ).

Type Aliases

• BTreeMap
  BTreeMap similar to std::collections::BTreeMap.
• Cursor
  Cursor returned by BTreeMap::lower_bound, BTreeMap::upper_bound.
• CursorMut
  Cursor returned by BTreeMap::lower_bound_mut, BTreeMap::upper_bound_mut.
• CursorMutKey
  Cursor returned by CursorMut::with_mutable_key.
• Entry
  Entry in BTreeMap, returned by BTreeMap::entry.
• ExtractIf
  Iterator returned by BTreeMap::extract_if.
• IntoIter
  Consuming iterator returned by BTreeMap::into_iter.
• IntoKeys
  Consuming iterator returned by BTreeMap::into_keys.
• IntoValues
  Consuming iterator returned by BTreeMap::into_values.
• Iter
  Iterator returned by BTreeMap::iter.
• IterMut
  Iterator returned by BTreeMap::iter_mut.
• Keys
  Iterator returned by BTreeMap::keys.
• OccupiedEntry
  Occupied Entry.
• OccupiedError
  Error returned by BTreeMap::try_insert.
• Range
  Iterator returned by BTreeMap::range.
• RangeMut
  Iterator returned by BTreeMap::range_mut.
• VacantEntry
  Vacant Entry.
• Values
  Iterator returned by BTreeMap::values.