1
0
Fork 0

Docs and Tests fixups

master
Michael Raitza 2 years ago
parent b365f05b5d
commit 29f01bf3a2
  1. 2
      trees/cb/cb-docs.factor
  2. 6
      trees/cb/cb-tests.factor
  3. 3
      trees/cb/summary.txt

@ -18,6 +18,8 @@ $nl
"Crit-bit trees conform to the assoc protocol."
;
ABOUT: "trees.cb"
HELP: CB{
{ $syntax "CB{ { key value }... }" }
{ $values { "key" "a key" } { "value" "a value" } }

@ -53,14 +53,14 @@ IN: trees.cb.tests
! Collision
{
CB{ { B{ 110 } B{ 110 } } }
CB{ { B{ 110 } f } }
} [
CB{ { f f } }
B{ 110 } dup rot [ set-at ] keep
f B{ 110 } rot [ set-at ] keep
] unit-test
! Colliding trees are still not equal
{ f } [
CB{ { f f } }
CB{ { B{ 110 } B{ 110 } } } =
CB{ { B{ 110 } f } } =
] unit-test

@ -1,2 +1 @@
Critical bit trees as described in http://cr.yp.to/critbit.html.
They are implemented as subclasses of trees.
Critical bit trees as described in http://cr.yp.to/critbit.html

Loading…
Cancel
Save