Changeset 1ab4aca in mainline
- Timestamp:
- 2011-09-24T11:54:09Z (13 years ago)
- Branches:
- lfn, master, serial, ticket/834-toolchain-update, topic/msim-upgrade, topic/simplify-dev-export
- Children:
- 925a21e, f1a9e87
- Parents:
- 286286c
- git-author:
- Maurizio Lombardi <m.lombardi85@…> (2011-09-24 11:54:09)
- git-committer:
- Jakub Jermar <jakub@…> (2011-09-24 11:54:09)
- Files:
-
- 4 edited
Legend:
- Unmodified
- Added
- Removed
-
kernel/generic/src/adt/btree.c
r286286c r1ab4aca 38 38 * 39 39 * The B+tree has the following properties: 40 * @li it is a bal lanced 3-4-5 tree (i.e. BTREE_M = 5)40 * @li it is a balanced 3-4-5 tree (i.e. BTREE_M = 5) 41 41 * @li values (i.e. pointers to values) are stored only in leaves 42 42 * @li leaves are linked in a list 43 43 * 44 * Be careful lwhen using these trees. They need to allocate44 * Be careful when using these trees. They need to allocate 45 45 * and deallocate memory for their index nodes and as such 46 46 * can sleep. … … 146 146 * also makes use of this feature. 147 147 * 148 * @param node B-tree node into w ich the new key is to be inserted.148 * @param node B-tree node into which the new key is to be inserted. 149 149 * @param key The key to be inserted. 150 150 * @param value Pointer to value to be inserted. … … 270 270 * This feature is used during insert by right rotation. 271 271 * 272 * @param node B-tree node into w ich the new key is to be inserted.272 * @param node B-tree node into which the new key is to be inserted. 273 273 * @param key The key to be inserted. 274 274 * @param value Pointer to value to be inserted. … … 463 463 if (rnode->keys < BTREE_MAX_KEYS) { 464 464 /* 465 * The rota ion can be done. The right sibling has free space.465 * The rotation can be done. The right sibling has free space. 466 466 */ 467 467 node_insert_key_and_rsubtree(node, inskey, insvalue, rsubtree); … … 484 484 * the median will be copied there. 485 485 * 486 * @param node B-tree node w ich is going to be split.486 * @param node B-tree node which is going to be split. 487 487 * @param key The key to be inserted. 488 488 * @param value Pointer to the value to be inserted. … … 562 562 if (node->keys < BTREE_MAX_KEYS) { 563 563 /* 564 * Node con atins enough space, the key can be stored immediately.564 * Node contains enough space, the key can be stored immediately. 565 565 */ 566 566 node_insert_key_and_rsubtree(node, key, value, rsubtree); … … 806 806 807 807 /* 808 * The key can be immediatel ly removed.808 * The key can be immediately removed. 809 809 * 810 810 * Note that the right subtree is removed because when -
kernel/generic/src/adt/list.c
r286286c r1ab4aca 33 33 /** 34 34 * @file 35 * @brief Functions completing doubly linked circular list implementa ion.35 * @brief Functions completing doubly linked circular list implementation. 36 36 * 37 37 * This file contains some of the functions implementing doubly linked circular lists. -
uspace/lib/c/generic/adt/hash_table.c
r286286c r1ab4aca 190 190 } 191 191 192 /** Apply fu cntion to all items in hash table.192 /** Apply function to all items in hash table. 193 193 * 194 194 * @param h Hash table. -
uspace/lib/c/generic/adt/list.c
r286286c r1ab4aca 33 33 /** 34 34 * @file 35 * @brief Functions completing doubly linked circular list implementa ion.35 * @brief Functions completing doubly linked circular list implementation. 36 36 * 37 37 * This file contains some of the functions implementing doubly linked circular lists.
Note:
See TracChangeset
for help on using the changeset viewer.