7ae757583a
Naturaldocs isn't really that great but it seems easier to get something working than with doxygen, for which we would need to convert rust code to something C++ish. We probably want to just write a rustdoc utility at some point.
98 lines
1.9 KiB
Rust
98 lines
1.9 KiB
Rust
/*
|
|
Module: fun_treemap
|
|
|
|
A functional key,value store that works on anything.
|
|
|
|
This works using a binary search tree. In the first version, it's a
|
|
very naive algorithm, but it will probably be updated to be a
|
|
red-black tree or something else.
|
|
|
|
This is copied and modified from treemap right now. It's missing a lot
|
|
of features.
|
|
|
|
*/
|
|
|
|
import option::{some, none};
|
|
import option = option::t;
|
|
|
|
export treemap;
|
|
export init;
|
|
export insert;
|
|
export find;
|
|
export traverse;
|
|
|
|
/* Section: Types */
|
|
|
|
/*
|
|
Type: treemap
|
|
*/
|
|
type treemap<K, V> = @tree_node<K, V>;
|
|
|
|
/*
|
|
Tag: tree_node
|
|
*/
|
|
tag tree_node<K, V> {
|
|
empty;
|
|
node(@K, @V, @tree_node<K, V>, @tree_node<K, V>);
|
|
}
|
|
|
|
/* Section: Operations */
|
|
|
|
/*
|
|
Function: init
|
|
|
|
Create a treemap
|
|
*/
|
|
fn init<K, V>() -> treemap<K, V> { @empty }
|
|
|
|
/*
|
|
Function: insert
|
|
|
|
Insert a value into the map
|
|
*/
|
|
fn insert<K, V>(m: treemap<K, V>, k: K, v: V) -> treemap<K, V> {
|
|
@alt m {
|
|
@empty. { node(@k, @v, @empty, @empty) }
|
|
@node(@kk, vv, left, right) {
|
|
if k < kk {
|
|
node(@kk, vv, insert(left, k, v), right)
|
|
} else if k == kk {
|
|
node(@kk, @v, left, right)
|
|
} else { node(@kk, vv, left, insert(right, k, v)) }
|
|
}
|
|
}
|
|
}
|
|
|
|
/*
|
|
Function: find
|
|
|
|
Find a value based on the key
|
|
*/
|
|
fn find<K, V>(m: treemap<K, V>, k: K) -> option<V> {
|
|
alt *m {
|
|
empty. { none }
|
|
node(@kk, @v, left, right) {
|
|
if k == kk {
|
|
some(v)
|
|
} else if k < kk { find(left, k) } else { find(right, k) }
|
|
}
|
|
}
|
|
}
|
|
|
|
/*
|
|
Function: traverse
|
|
|
|
Visit all pairs in the map in order.
|
|
*/
|
|
fn traverse<K, V>(m: treemap<K, V>, f: fn(K, V)) {
|
|
alt *m {
|
|
empty. { }
|
|
node(@k, @v, _, _) {
|
|
// copy v to make aliases work out
|
|
let v1 = v;
|
|
alt *m { node(_, _, left, _) { traverse(left, f); } }
|
|
f(k, v1);
|
|
alt *m { node(_, _, _, right) { traverse(right, f); } }
|
|
}
|
|
}
|
|
}
|