msrd0 / aatree Goto Github PK
View Code? Open in Web Editor NEWAATree implementation in Rust
License: Apache License 2.0
AATree implementation in Rust
License: Apache License 2.0
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.
Benchmark the AATree against rust's BTree (and possibly other languages)
maybe useful crate: https://docs.rs/criterion/0.3.3/criterion/
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.
It doesn't with BTreeMap from std so shouldn't be necessary here I'd assume?
BTreeMap
append
(#20)clear
contains_key
drain_filter
nightlyentry
(#27)first_entry
1.66 (#27)first_key_value
1.66get
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.66len
new
new_in
nightlypop_first
1.66pop_last
1.66range
range_mut
remove
remove_entry
retain
split_off
try_insert
nightlyvalues
values_mut
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
append
(#20)clear
(#21)contains
difference
drain_filter
nightlyfirst
1.66get
insert
intersection
is_disjoint
is_empty
is_subset
is_superset
iter
last
1.66len
new
new_in
nightlypop_first
1.66pop_last
1.66range
remove
replace
retain
split_off
symmetric_difference
take
union
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
and_modify
(#27)key
(#27)or_default
(#27)or_insert
(#27)or_insert_with
(#27)or_insert_with_key
(#27)Debug
(#27)OccupiedEntry
Debug
(#27)VacantEntry
Debug
(#27)A declarative, efficient, and flexible JavaScript library for building user interfaces.
๐ Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
An Open Source Machine Learning Framework for Everyone
The Web framework for perfectionists with deadlines.
A PHP framework for web artisans
Bring data to life with SVG, Canvas and HTML. ๐๐๐
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
Some thing interesting about web. New door for the world.
A server is a program made to process requests and deliver data to clients.
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
Some thing interesting about visualization, use data art
Some thing interesting about game, make everyone happy.
We are working to build community through open source technology. NB: members must have two-factor auth.
Open source projects and samples from Microsoft.
Google โค๏ธ Open Source for everyone.
Alibaba Open Source for everyone
Data-Driven Documents codes.
China tencent open source team.