1
0
Fork 0
Commit Graph

11 Commits (c26dfad78d35793047b11ac435b1f8e40e072f94)

Author SHA1 Message Date
Michael Raitza c26dfad78d Fix byte sequence difference algorithm 2021-01-31 22:56:09 +01:00
Michael Raitza 1f66561cdc WIP Fix difference algorithm 2020-12-05 13:15:50 +01:00
Michael Raitza 642aaf718c Fix alist implementation
Missed the general object case (notably `f`) for root node.
2020-02-24 16:26:43 +01:00
Michael Raitza 7c61cdf984 Change literal syntax to CB{ 2020-02-24 16:26:17 +01:00
Michael Raitza 921f1ca979 Add documentation 2020-02-24 15:52:57 +01:00
Michael Raitza 79b67e1ab3 Add a simpler and faster key serializer
Serialization of numeric keys and strings is faster but keys can no longer be
 freely mixed between object types as several serializations of different keys
 now coincide. Serializations of keys of a single type are guaranteed to be
 unique.
2020-02-24 15:47:10 +01:00
Michael Raitza e3f4600c85 Use `left` and `right` constants from trees vocabulary 2020-02-24 15:44:26 +01:00
Michael Raitza 00e9b54b22 Implement Assoc Protocol and pretty printing 2020-02-17 11:32:01 +01:00
Michael Raitza ea07711f17 Implement insert 2020-02-14 20:57:58 +01:00
Michael Raitza f06eda5f16 WIP Deactivate broken insert code and rewrite
Split into:
 - walk for best fit
 - updating leaf / creating new split node and leaf node
 - insert new split node if necessary (WIP)
2020-02-11 22:30:10 +01:00
Michael Raitza 8400602c06 Implement deletion; break insertion as it is still wrong 2020-02-10 23:24:56 +01:00