It doesn't with BTreeMap from std so shouldn't be necessary here I'd assume?

https://doc.rust-lang.org/std/collections/struct.BTreeSet.html#method.difference and similar

BTreeSet from the standard library has some methods like pop_first added in nightly. To match std's api, we should rename our methods from pop_smallest to pop_first, and probably also smallest_geq_than to first_after for consistency eventhough std still doesn't have these methods despite advertising them.

BTree in std has some logic to create itself from sorted values, and has From/FromIterator sort the items first and then use that. Would be nice if we had something like that as well.

BTreeMap

Functions

• append (#20)
• clear
• contains_key
• drain_filter nightly
• entry (#27)
• first_entry 1.66 (#27)
• first_key_value 1.66
• get
• get_key_value
• get_mut
• insert
• into_keys
• into_values
• is_empty
• iter
• iter_mut
• keys
• last_entry 1.66 (#27)
• last_key_value 1.66
• len
• new
• new_in nightly
• pop_first 1.66
• pop_last 1.66
• range
• range_mut
• remove
• remove_entry
• retain
• split_off
• try_insert nightly
• values
• values_mut

Traits

• Clone
• Debug
• Default
• Eq (#19)
• Extend<(&K, &V)> (#18)
• Extend<(K, V)> (#18)
• From<[(K, V); N]> (#16)
• FromIterator<(K, V)>
• Hash
• Index<&Q>
• IntoIterator for &Self
• IntoIterator for &mut Self
• IntoIterator for Self
• Ord (#19)
• PartialEq (#19)
• PartialOrd (#19)

BTreeSet

Functions

• append (#20)
• clear (#21)
• contains
• difference
• drain_filter nightly
• first 1.66
• get
• insert
• intersection
• is_disjoint
• is_empty
• is_subset
• is_superset
• iter
• last 1.66
• len
• new
• new_in nightly
• pop_first 1.66
• pop_last 1.66
• range
• remove
• replace
• retain
• split_off
• symmetric_difference
• take
• union

Traits

• BitAnd
• BitOr
• BitXor
• Clone
• Debug
• Default
• Eq (#19)
• Extend<&T> (#18)
• Extend<T> (#18)
• From<[T; N]> (#16)
• FromIterator<T>
• Hash
• IntoIterator for &Self
• IntoIterator for Self
• Ord (#19)
• PartialEq (#19)
• PartialOrd (#19)
• Sub

Entry

Functions

• and_modify (#27)
• key (#27)
• or_default (#27)
• or_insert (#27)
• or_insert_with (#27)
• or_insert_with_key (#27)

Traits

• Debug (#27)

OccupiedEntry

Functions

• get (#27)
• get_mut (#27)
• insert (#27)
• into_mut (#27)
• key (#27)
• remove
• remove_entry

Traits

• Debug (#27)

VacantEntry

Functions

• insert (#27)
• into_key (#27)
• key (#27)

Traits

• Debug (#27)

Benchmark the AATree against rust's BTree (and possibly other languages)

maybe useful crate: https://docs.rs/criterion/0.3.3/criterion/