vebtrees 0.1.4

A Rust implementation of Van Emde Boas trees

Coverage
90.91%
10 out of 11 items documented0 out of 10 items with examples
Size
Source code size: 28.48 kB This is the summed size of all the files inside the crates.io package for this release.
Documentation size: 1.69 MB This is the summed size of all files generated by rustdoc for all configured targets
Ø build duration
this release: 9s Average build duration of successful builds.
all releases: 9s Average build duration of successful builds in releases after 2024-10-23.
Links
JMurph2015/rust-vebtrees
1 0 1
crates.io
Dependencies
Versions
Owners

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.