Changeset c47912f in mainline for generic/src/adt/btree.c
- Timestamp:
- 2006-04-04T09:04:15Z (19 years ago)
- Branches:
- lfn, master, serial, ticket/834-toolchain-update, topic/msim-upgrade, topic/simplify-dev-export
- Children:
- 448743f
- Parents:
- 2a1fa51
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
generic/src/adt/btree.c
r2a1fa51 rc47912f 341 341 } 342 342 343 /** Return pointer to B-tree node's left sibling.343 /** Return pointer to B-tree leaf node's left neighbour. 344 344 * 345 345 * @param t B-tree. 346 * @param node Node whose left siblingwill be returned.347 * 348 * @return Left sibling of the node or NULL if the node does not have the left sibling.349 */ 350 btree_node_t *btree_ node_left_sibling(btree_t *t, btree_node_t *node)346 * @param node Node whose left neighbour will be returned. 347 * 348 * @return Left neighbour of the node or NULL if the node does not have the left neighbour. 349 */ 350 btree_node_t *btree_leaf_node_left_neighbour(btree_t *t, btree_node_t *node) 351 351 { 352 352 ASSERT(LEAF_NODE(node)); … … 357 357 } 358 358 359 /** Return pointer to B-tree node's right sibling.359 /** Return pointer to B-tree leaf node's right neighbour. 360 360 * 361 361 * @param t B-tree. 362 * @param node Node whose right siblingwill be returned.363 * 364 * @return Right sibling of the node or NULL if the node does not have the right sibling.365 */ 366 btree_node_t *btree_ node_right_sibling(btree_t *t, btree_node_t *node)362 * @param node Node whose right neighbour will be returned. 363 * 364 * @return Right neighbour of the node or NULL if the node does not have the right neighbour. 365 */ 366 btree_node_t *btree_leaf_node_right_neighbour(btree_t *t, btree_node_t *node) 367 367 { 368 368 ASSERT(LEAF_NODE(node));
Note:
See TracChangeset
for help on using the changeset viewer.