 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
|
0674a825b0
|
critbit: Make compiler happy NOFIX
|
2020-02-09 21:27:11 +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 |
|
Michael Raitza
|
b686040e7d
|
WIP: Some code updates...
|
2020-01-18 21:45:03 +01:00 |
|
Michael Raitza
|
c8d3ba4d59
|
WIP: Searching, node calculation, put into empty tree
Misses insertion of a node into the tree
|
2019-04-23 23:00:38 +02:00 |
|
Michael Raitza
|
99e724d0cd
|
Add critbit CWEB documentation
from https://github.com/agl/critbit
|
2019-04-23 15:35:26 +02:00 |
|
Michael Raitza
|
f2c44cae8d
|
WIP Initial code
|
2019-04-23 09:36:06 +02:00 |
|
Michael Raitza
|
0f4884bd8b
|
Add playground
|
2019-04-23 09:35:57 +02:00 |