From: simon Date: Mon, 2 Oct 2000 13:57:41 +0000 (+0000) Subject: Make the new test suite's comment more accurate :-) X-Git-Url: https://git.distorted.org.uk/u/mdw/putty/commitdiff_plain/7aa7c43a9c253577960f53c5e41d3e60ec8136d5 Make the new test suite's comment more accurate :-) git-svn-id: svn://svn.tartarus.org/sgt/putty@663 cda61777-01e9-0310-a592-d414129be87e --- diff --git a/tree234.c b/tree234.c index f97837a1..fafb3706 100644 --- a/tree234.c +++ b/tree234.c @@ -642,15 +642,17 @@ void *next234(enum234 *e) { * 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 * obvious and slow insert and delete functions). After each tree - * operation, the tree_valid() function is called, which ensures - * all the tree properties are preserved (node->child->parent - * always equals node; number of kids == number of elements + 1; - * all tree nodes are distinct; ordering property between elements - * of a node and elements of its children is preserved) and also - * ensures the list represented by the tree is the same list it - * should be. (This last check also verifies the ordering - * properties, because the `same list it should be' is by - * definition correctly ordered.) + * operation, the verify() function is called, which ensures all + * the tree properties are preserved (node->child->parent always + * equals node; number of kids == 0 or number of elements + 1; + * ordering property between elements of a node and elements of its + * children is preserved; tree has the same depth everywhere; every + * node has at least one element) and also ensures the list + * represented by the tree is the same list it should be. (This + * last check also verifies the ordering properties, because the + * `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