1
0
Fork 0
Commit Graph

5 Commits (41c4a51d6473b0950c3cb27c1c78a0c394532918)

Author SHA1 Message Date
Michael Raitza 41c4a51d64 Complete insertion via set-at
Use MAGIC Algorithms log2 folding to calculate critical bit of the form
 yyyyxyyyy, where y bits are 1 and x is 0, denoting the critical bit (from the
 right).

 Idea from Adam Langley's C example implementation.
2020-02-09 23:05:08 +01:00
Michael Raitza 9de4680d39 Distinguish into internal and leaf nodes; Implement appending leaf node
No internal node splitting
2020-02-09 21:28:06 +01:00
Michael Raitza 3e2f2e7dac Implement set-at; cb-set for the empty tree 2020-02-09 15:54:27 +01:00
Michael Raitza 5a7d699b3b Introduce key-bytes symbol and with-key 2020-02-09 01:54:08 +01:00
Michael Raitza b5dd6e1065 Start implementation as a sub class to trees 2020-02-09 01:40:58 +01:00