| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | Resurrect changes in f06372d that got lost in the merge. | Linus Nordberg | 2014-10-29 | 1 | -9/+9 |
| | | |||||
| * | Merge remote-tracking branch 'refs/remotes/map/external-merge3' into ↵ | Linus Nordberg | 2014-10-29 | 1 | -9/+9 |
| |\ | | | | | | | | | | | | | | | | | | | | | | | merging-external-merge Conflicts: src/db.erl src/frontend.erl src/index.erl src/plop.erl src/storage.erl src/ts.erl | ||||
| | * | Optimize ts by storing tree in array of arrays. | Magnus Ahltorp | 2014-10-27 | 1 | -27/+24 |
| | | | |||||
| * | | Can't use array:array() in R16. | Linus Nordberg | 2014-10-28 | 1 | -5/+8 |
| | | | |||||
| * | | Change names with 'List' to names with 'Array'. | Linus Nordberg | 2014-10-28 | 1 | -14/+18 |
| | | | | | | | | | Also, split some long lines. | ||||
| * | | Optimize ts by storing tree in array of arrays. | Magnus Ahltorp | 2014-10-28 | 1 | -27/+24 |
| |/ | |||||
| * | Rewrite ts to use a list of lists and change its API. | Linus Nordberg | 2014-09-16 | 1 | -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 Nordberg | 2014-09-12 | 1 | -1/+8 |
| | | |||||
| * | Add a few tests. | Linus Nordberg | 2014-09-11 | 1 | -3/+8 |
| | | |||||
| * | Another hashtree implementation, first cut. | Linus Nordberg | 2014-09-11 | 1 | -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 Nordberg | 2014-09-10 | 1 | -2/+5 |
| | | |||||
| * | New hash tree implementation, using an ETS table for the hashes. | Linus Nordberg | 2014-09-09 | 1 | -0/+34 |
| Also, add an untested entry storage implementation, using multiple DETS tables. | |||||
 |
index : user/map/plop.git | |
| Magnus' plop repository | Magnus Ahltorp |
| summaryrefslogtreecommitdiff |