| /kernel/trunk/generic/src/adt/btree.c |
|---|
| 26,17 → 26,13 |
| * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| */ |
| /** |
| * @file btree.c |
| * @brief B+tree implementation. |
| /* |
| * This B-tree has the following properties: |
| * - it is a ballanced 3-4-5 tree (i.e. BTREE_M = 5) |
| * - values (i.e. pointers to values) are stored only in leaves |
| * - leaves are linked in a list |
| * - technically, it is a B+tree (because of the previous properties) |
| * |
| * This file implements B+tree type and operations. |
| * |
| * The B+tree has the following properties: |
| * @li it is a ballanced 3-4-5 tree (i.e. BTREE_M = 5) |
| * @li values (i.e. pointers to values) are stored only in leaves |
| * @li leaves are linked in a list |
| * |
| * Be carefull when using these trees. They need to allocate |
| * and deallocate memory for their index nodes and as such |
| * can sleep. |
| /kernel/trunk/generic/src/adt/bitmap.c |
|---|
| 26,14 → 26,6 |
| * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| */ |
| /** |
| * @file bitmap.c |
| * @brief Implementation of bitmap ADT. |
| * |
| * This file implements bitmap ADT and provides functions for |
| * setting and clearing ranges of bits. |
| */ |
| #include <adt/bitmap.h> |
| #include <typedefs.h> |
| #include <arch/types.h> |
| /kernel/trunk/generic/src/adt/hash_table.c |
|---|
| 26,11 → 26,8 |
| * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| */ |
| /** |
| * @file hash_table.c |
| * @brief Implementation of generic chained hash table. |
| * |
| * This file contains implementation of generic chained hash table. |
| /* |
| * This is an implementation of generic chained hash table. |
| */ |
| #include <adt/hash_table.h> |
| 128,7 → 125,7 |
| * |
| * @param h Hash table. |
| * @param key Array of keys that will be compared against items of the hash table. |
| * @param keys Number of keys in the key array. |
| * @param keys Number of keys in the 'key' array. |
| */ |
| void hash_table_remove(hash_table_t *h, __native key[], count_t keys) |
| { |
| /kernel/trunk/generic/src/adt/list.c |
|---|
| 26,16 → 26,9 |
| * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| */ |
| /** |
| * @file list.c |
| * @brief Functions completing doubly linked circular list implementaion. |
| * |
| * This file contains some of the functions implementing doubly linked circular lists. |
| * However, this ADT is mostly implemented in @ref list.h. |
| */ |
| #include <adt/list.h> |
| /** Check for membership |
| * |
| * Check whether link is contained in the list head. |