#tree #van #emde #boas #maximum #data

vebtrees

A Rust implementation of Van Emde Boas trees

5 releases

Uses old Rust 2015

0.1.4 Sep 24, 2019
0.1.3 Feb 16, 2018
0.1.2 Feb 15, 2018
0.1.1 Feb 15, 2018
0.1.0 Feb 14, 2018

#2 in #van

MIT license

29KB
637 lines

docs.rs Build Status Built with Spacemacs

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.

No runtime deps