Changeset 39 for trunk/src/helpers/tree.c

Timestamp:

Feb 23, 2001, 7:50:07 AM (24 years ago)

Author:

umoeller

Message:

Misc. fixes.

File:

• trunk/src/helpers/tree.c (modified) (9 diffs)

trunk/src/helpers/tree.c

@@ -922 +922 @@
  *      as a data pointer to some structure for whatever you like.
  *
+ *      WARNING: This function recurses and can use up a lot of
+ *      stack. For very deep trees, traverse the tree using
+ *      treeFirst and treeNext instead. See treeNext for a sample.
+ *
  *      "method" specifies in which order the nodes are traversed.
  *      This can be:
@@ -936 +940 @@
                   int method)               // in: traversal mode
 {
-    if ((!tree)
-    ||  (tree == TREE_NULL))
+    if (    (!tree)
+         || (tree == TREE_NULL))
         return;
 
@@ -963 +967 @@
  *@@ treeFirst:
  *      finds and returns the first node in a (sub-)tree.
+ *
+ *      See treeNext for a sample usage for traversing a tree.
  */
 
@@ -970 +976 @@
        *current;
 
-    if ((!tree)
-    ||  (tree == TREE_NULL))
+    if (    (!tree)
+         || (tree == TREE_NULL)
+       )
         return NULL;
 
@@ -991 +998 @@
        *current;
 
-    if ((!tree)
-    ||  (tree == TREE_NULL))
+    if (    (!tree)
+         || (tree == TREE_NULL))
         return NULL;
 
@@ -1005 +1012 @@
  *@@ treeNext:
  *      finds and returns the next node in a tree.
+ *
+ *      Example for traversing a whole tree if you don't
+ *      want to use treeTraverse:
+ *
+ +          TREE    *TreeRoot;
+ +          ...
+ +          TREE* pNode = treeFirst(TreeRoot);
+ +          while (pNode)
+ +          {
+ +              ...
+ +              pNode = treeNext(pNode);
+ +          }
+ *
+ *      This runs through the tree items in sorted order.
  */
 
@@ -1013 +1034 @@
        *child;
 
-    if ((!tree)
-    ||  (tree == TREE_NULL))
+    if (    (!tree)
+         || (tree == TREE_NULL)
+       )
         return NULL;
 
@@ -1024 +1046 @@
         current = tree;
         child   = TREE_NULL;
-        while ((current->parent)
-           &&  (current->right == child))
+        while (    (current->parent)
+                && (current->right == child)
+              )
         {
             child = current;
@@ -1048 +1071 @@
        *child;
 
-    if ((!tree)
-    ||  (tree == TREE_NULL))
+    if (    (!tree)
+         || (tree == TREE_NULL))
         return NULL;