summaryrefslogtreecommitdiff
path: root/src/ts.erl
Commit message (Collapse)AuthorAgeFilesLines
* Rewrite ts to use a list of lists and change its API.Linus Nordberg2014-09-161-61/+70
| | | | | | | | | | | 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.
* Add support for retrieving historical tree heads.Linus Nordberg2014-09-121-1/+8
|
* Add a few tests.Linus Nordberg2014-09-111-3/+8
|
* Another hashtree implementation, first cut.Linus Nordberg2014-09-111-23/+58
| | | | | This one stores the tree in arrays, one per layer in the tree. It's implemented as gen_server.
* Add size/1.Linus Nordberg2014-09-101-2/+5
|
* New hash tree implementation, using an ETS table for the hashes.Linus Nordberg2014-09-091-0/+34
Also, add an untested entry storage implementation, using multiple DETS tables.