Simon Tatham
4a2ea18a51
Deletion case 2c can shift the root; case 3b is not the only case that
...
can do that. The bad case happens when you have a root node containing
only one actual element, and its two child nodes have only one element
each, and you try to delete the element in the root.
[originally from svn r660]
2000-10-02 11:47:30 +00:00
Simon Tatham
8084172c18
Shiny new test harness for the 2-3-4 tree
...
[originally from svn r658]
2000-10-02 11:46:10 +00:00
Simon Tatham
aa203391c2
Keep parent pointers valid during deletion
...
[originally from svn r645]
2000-09-28 09:48:49 +00:00
Simon Tatham
c9557bfc40
Fix tree corruption in the "really easy" case on deletion
...
[originally from svn r632]
2000-09-26 11:16:33 +00:00
Simon Tatham
2c76bd5b3a
Fix a small bug in 2-3-4 tree enumeration
...
[originally from svn r630]
2000-09-26 10:05:48 +00:00
Simon Tatham
74a50d2d55
Delete should be void not void *; also use correct compare fn in find.
...
[originally from svn r594]
2000-09-15 10:48:42 +00:00
Simon Tatham
68ee8531fb
2-3-4 tree routines
...
[originally from svn r590]
2000-09-14 15:02:50 +00:00
