Changeset 80bcaed in mainline for kernel/generic/include/adt/btree.h

Timestamp:

2007-02-03T13:22:24Z (18 years ago)

Author:

Jakub Jermar <jakub@…>

Branches:

lfn, master, serial, ticket/834-toolchain-update, topic/msim-upgrade, topic/simplify-dev-export

Children:

f619ec11

Parents:

fa8e7d2

Message:

Merge as_t structure into one and leave the differring parts in as_genarch_t.

Indentation and formatting changes in header files.

File:

• kernel/generic/include/adt/btree.h (modified) (3 diffs)

kernel/generic/include/adt/btree.h

@@ -49 +49 @@
         count_t keys;
 
-        /** Keys. We currently support only single keys. Additional room for one extra key is provided. */
+        /**
+         * Keys. We currently support only single keys. Additional room for one
+         * extra key is provided.
+         */
         btree_key_t key[BTREE_MAX_KEYS + 1];
 
         /** 
-         * Pointers to values. Sorted according to the key array. Defined only in leaf-level.
-         * There is room for storing value for the extra key.
+         * Pointers to values. Sorted according to the key array. Defined only in
+         * leaf-level. There is room for storing value for the extra key.
          */
         void *value[BTREE_MAX_KEYS + 1];
         
         /**
-         * Pointers to descendants of this node sorted according to the key array.
+         * Pointers to descendants of this node sorted according to the key
+         * array.
+         *
          * subtree[0] points to subtree with keys lesser than to key[0].
-         * subtree[1] points to subtree with keys greater than or equal to key[0] and lesser than key[1].
+         * subtree[1] points to subtree with keys greater than or equal to
+         *            key[0] and lesser than key[1].
          * ...
          * There is room for storing a subtree pointer for the extra key.
@@ -70 +76 @@
         struct btree_node *parent;
 
-        /** Link connecting leaf-level nodes. Defined only when this node is a leaf. */
+        /**
+         * Link connecting leaf-level nodes. Defined only when this node is a
+         * leaf. */
         link_t leaf_link;
 
-        /** Variables needed by btree_print(). */       
+        /* Variables needed by btree_print(). */        
         link_t bfs_link;
         int depth;
@@ -89 +97 @@
 extern void btree_destroy(btree_t *t);
 
-extern void btree_insert(btree_t *t, btree_key_t key, void *value, btree_node_t *leaf_node);
+extern void btree_insert(btree_t *t, btree_key_t key, void *value,
+    btree_node_t *leaf_node);
 extern void btree_remove(btree_t *t, btree_key_t key, btree_node_t *leaf_node);
 extern void *btree_search(btree_t *t, btree_key_t key, btree_node_t **leaf_node);
 
-extern btree_node_t *btree_leaf_node_left_neighbour(btree_t *t, btree_node_t *node);
-extern btree_node_t *btree_leaf_node_right_neighbour(btree_t *t, btree_node_t *node);
+extern btree_node_t *btree_leaf_node_left_neighbour(btree_t *t,
+    btree_node_t *node);
+extern btree_node_t *btree_leaf_node_right_neighbour(btree_t *t,
+    btree_node_t *node);
 
 extern void btree_print(btree_t *t);