Skip to content

A BTreeMap implementation for Rust allowing for indexing by Key and Position

License

Notifications You must be signed in to change notification settings

d-tietjen/indextreemap_rust

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

17 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

indextreemap

IndexTreeMap is an ordered tree map based on the rust standard library BTreeMap, that allows for items to be accessed by key, value, or position in the tree.

This library is meant to serve niche use cases where the deterministic ordering of key-value items is required, with the ability to index items by position or key in logarithmic time.

When compared to the standard library BTreeMap (std::collections::BTreeMap), for operations that require changes in memory allocation (insert, remove, etc...) the IndexTreeMap is slower. However, when referencing data already allocated in memory, the IndexTreeMap is equivalent or faster.

About

A BTreeMap implementation for Rust allowing for indexing by Key and Position

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages