/kernel/trunk/generic/src/adt/btree.c |
---|
26,6 → 26,10 |
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
*/ |
/** @addtogroup genericadt |
* @{ |
*/ |
/** |
* @file btree.c |
* @brief B+tree implementation. |
993,3 → 997,7 |
} |
printf("\n"); |
} |
/** @} |
*/ |
/kernel/trunk/generic/src/adt/hash_table.c |
---|
26,6 → 26,10 |
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
*/ |
/** @addtogroup genericadt |
* @{ |
*/ |
/** |
* @file hash_table.c |
* @brief Implementation of generic chained hash table. |
168,3 → 172,7 |
} |
} |
} |
/** @} |
*/ |
/kernel/trunk/generic/src/adt/list.c |
---|
26,6 → 26,10 |
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
*/ |
/** @addtogroup genericadt |
* @{ |
*/ |
/** |
* @file list.c |
* @brief Functions completing doubly linked circular list implementaion. |
85,3 → 89,7 |
head1->prev = head2->prev; |
list_initialize(head2); |
} |
/** @} |
*/ |
/kernel/trunk/generic/src/adt/bitmap.c |
---|
26,6 → 26,10 |
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
*/ |
/** @addtogroup genericadt ADT |
* @ingroup kernel |
* @{ |
*/ |
/** |
* @file bitmap.c |
* @brief Implementation of bitmap ADT. |
181,3 → 185,7 |
dst->map[i] |= src->map[i] & ((1 << (bits % 8)) - 1); |
} |
} |
/** @} |
*/ |