Rust data-structures. Just for fun.
Rust
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Failed to load latest commit information.
linear
test
trees
.gitignore
README.md
makefile
structures.rs

README.md

flaky data structures

an exploration into data structures with Mozilla Rust

Strong elements of Okasaki's Purely Functional Data Structures are be here.

Note:

Without apology, this library is flaky, both punny and practically. The API will change. Traits, which will formalize the interfaces for data structures here, are not implemented yet.


currently:

binary search trees

under construction:

linear data structures: list queue deque, along with intrusive variants of same.

planned:

red black trees, probably the left-leaning variant ( http://www.mew.org/~kazu/proj/red-black-tree/ )

doubly-linked trees

hazy future:

unsafe circular buffer

vector-based priority queue / heap

better standard rope

cuckoo hash table: https://en.wikipedia.org/wiki/Cuckoo_hashing

motivation:

Mozilla Rust is slightly unique and interesting in that it provides a controllable GC as well as a controllable mutability model. it's optionally impure. Kind of cool.

rust devs would like some refreshed data structures:

http://irclog.gr/#browse/irc.mozilla.org/rust/291715

I would be glad to take any contributions. Happy hacking to anyone who wants to throw a bone out; note the license.

License:

AGPL3 (http://www.gnu.org/licenses/agpl.txt)