/kernel/trunk/generic/include/adt/hash_table.h |
---|
26,6 → 26,12 |
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
*/ |
/** @addtogroup genericadt |
* @{ |
*/ |
/** @file |
*/ |
#ifndef __HASH_TABLE_H__ |
#define __HASH_TABLE_H__ |
74,3 → 80,7 |
extern void hash_table_remove(hash_table_t *h, __native key[], count_t keys); |
#endif |
/** @} |
*/ |
/kernel/trunk/generic/include/adt/list.h |
---|
26,6 → 26,12 |
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
*/ |
/** @addtogroup genericadt |
* @{ |
*/ |
/** @file |
*/ |
#ifndef __LIST_H__ |
#define __LIST_H__ |
175,3 → 181,7 |
extern void list_concat(link_t *head1, link_t *head2); |
#endif |
/** @} |
*/ |
/kernel/trunk/generic/include/adt/bitmap.h |
---|
26,6 → 26,12 |
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
*/ |
/** @addtogroup genericadt |
* @{ |
*/ |
/** @file |
*/ |
#ifndef __BITMAP_H__ |
#define __BITMAP_H__ |
45,3 → 51,7 |
extern void bitmap_copy(bitmap_t *dst, bitmap_t *src, count_t bits); |
#endif |
/** @} |
*/ |
/kernel/trunk/generic/include/adt/btree.h |
---|
26,6 → 26,12 |
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
*/ |
/** @addtogroup genericadt |
* @{ |
*/ |
/** @file |
*/ |
#ifndef __BTREE_H__ |
#define __BTREE_H__ |
92,3 → 98,7 |
extern void btree_print(btree_t *t); |
#endif |
/** @} |
*/ |
/kernel/trunk/generic/include/adt/fifo.h |
---|
26,6 → 26,12 |
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
*/ |
/** @addtogroup genericadt |
* @{ |
*/ |
/** @file |
*/ |
/* |
* This implementation of FIFO stores values in an array |
* (static or dynamic). As such, these FIFOs have upper bound |
111,3 → 117,7 |
name.fifo = malloc(sizeof(*name.fifo) * name.items, 0) |
#endif |
/** @} |
*/ |