vebtrees
| Crates.io | vebtrees |
| lib.rs | vebtrees |
| version | 0.1.4 |
| source | src |
| created_at | 2018-02-14 01:03:46.142402 |
| updated_at | 2019-09-24 07:18:09.108556 |
| description | A Rust implementation of Van Emde Boas trees |
| homepage | |
| repository | https://github.com/JMurph2015/rust-vebtrees |
| max_upload_size | |
| id | 51066 |
| size | 28,861 |
Joseph Murphy (JMurph2015)
documentation
README
vebtrees
A Rust Implementation of Van Emde Boas Trees
Introduction
Van Emde Boas trees are cool data strucutures because they can implement all associative array functions in O(loglog(M)) where M is the maximum capacity of the tree.
Acknowlegdements
Cormen, Thomas H., et al. Introduction to Algorithms, 3rd Edition. MIT Press, 2009.
“Van Emde Boas Tree.” Wikipedia, 2017, en.wikipedia.org/wiki/Van_Emde_Boas_tree.