| Commit message (Collapse) | Author | Age | Files | Lines |
| |
|
|
|
|
| |
Also, split some long lines.
|
| |
|
|
|
|
|
|
|
|
|
|
|
| |
We want to get rid of maps because they're a bit too new for some
distributions. Replacing the arrays with lists is not necessary and
arguably not even the right move -- they're about twice as costly RAM
wise and the CPU cost for accesses are O(n). This cleans up the
implementation though so let's keep it as a reference implementation.
Changes to ht include poping potential placeholders in parent layer
before adding and swapping IR -> RI all over, for consistency.
|
| |
|
| |
|
|
|
|
|
| |
This one stores the tree in arrays, one per layer in the tree.
It's implemented as gen_server.
|
| |
|
|
Also, add an untested entry storage implementation, using multiple
DETS tables.
|