Changeset c47912f in mainline for generic/src/adt/btree.c


Ignore:
Timestamp:
2006-04-04T09:04:15Z (19 years ago)
Author:
Jakub Jermar <jakub@…>
Branches:
lfn, master, serial, ticket/834-toolchain-update, topic/msim-upgrade, topic/simplify-dev-export
Children:
448743f
Parents:
2a1fa51
Message:

Rename btree_node_left_sibling() to btree_leaf_node_left_neighbour()
and btree_node_right_sibling() to btree_leaf_node_right_neighbour()
as the left and right neighbours of a node needn't be its siblings.

File:
1 edited

Legend:

Unmodified
Added
Removed
  • generic/src/adt/btree.c

    r2a1fa51 rc47912f  
    341341}
    342342
    343 /** Return pointer to B-tree node's left sibling.
     343/** Return pointer to B-tree leaf node's left neighbour.
    344344 *
    345345 * @param t B-tree.
    346  * @param node Node whose left sibling will 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 */
     350btree_node_t *btree_leaf_node_left_neighbour(btree_t *t, btree_node_t *node)
    351351{
    352352        ASSERT(LEAF_NODE(node));
     
    357357}
    358358
    359 /** Return pointer to B-tree node's right sibling.
     359/** Return pointer to B-tree leaf node's right neighbour.
    360360 *
    361361 * @param t B-tree.
    362  * @param node Node whose right sibling will 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 */
     366btree_node_t *btree_leaf_node_right_neighbour(btree_t *t, btree_node_t *node)
    367367{
    368368        ASSERT(LEAF_NODE(node));
Note: See TracChangeset for help on using the changeset viewer.