nhyatt/putty-source
1
0
Fork 0
mirror of https://git.tartarus.org/simon/putty.git synced 2025-01-25 01:02:24 +00:00
Code Issues Projects Releases Wiki Activity

Make the new test suite's comment more accurate :-)

Browse Source 
[originally from svn r663]
This commit is contained in:
Simon Tatham 2000-10-02 13:57:41 +00:00
parent ab68fc8a96
commit c1e5815add
1 changed files with 11 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

20
tree234.c
View File

@ -642,15 +642,17 @@ void *next234(enum234 *e) {
* Test code for the 2-3-4 tree. This code maintains an alternative * Test code for the 2-3-4 tree. This code maintains an alternative
* representation of the data in the tree, in an array (using the * representation of the data in the tree, in an array (using the
* obvious and slow insert and delete functions). After each tree * obvious and slow insert and delete functions). After each tree
* operation, the tree_valid() function is called, which ensures * operation, the verify() function is called, which ensures all
* all the tree properties are preserved (node->child->parent * the tree properties are preserved (node->child->parent always
* always equals node; number of kids == number of elements + 1; * equals node; number of kids == 0 or number of elements + 1;
* all tree nodes are distinct; ordering property between elements * ordering property between elements of a node and elements of its
* of a node and elements of its children is preserved) and also * children is preserved; tree has the same depth everywhere; every
* ensures the list represented by the tree is the same list it * node has at least one element) and also ensures the list
* should be. (This last check also verifies the ordering * represented by the tree is the same list it should be. (This
* properties, because the `same list it should be' is by * last check also verifies the ordering properties, because the
* definition correctly ordered.) * `same list it should be' is by definition correctly ordered. It
* also ensures all nodes are distinct, because the enum functions
* would get caught in a loop if not.)
*/ */
#include <stdarg.h> #include <stdarg.h>