/uspace/trunk/libc/include/libadt/hash_table.h |
---|
26,6 → 26,12 |
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
*/ |
/** @addtogroup libc |
* @{ |
*/ |
/** @file |
*/ |
#ifndef __HASH_TABLE_H__ |
#define __HASH_TABLE_H__ |
78,3 → 84,9 |
extern void hash_table_remove(hash_table_t *h, unsigned long key[], hash_count_t keys); |
#endif |
/** @} |
*/ |
/uspace/trunk/libc/include/libadt/list.h |
---|
26,6 → 26,12 |
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
*/ |
/** @addtogroup libc |
* @{ |
*/ |
/** @file |
*/ |
#ifndef __LIST_H__ |
#define __LIST_H__ |
183,3 → 189,9 |
extern void list_concat(link_t *head1, link_t *head2); |
#endif |
/** @} |
*/ |
/uspace/trunk/libc/include/libadt/fifo.h |
---|
26,6 → 26,12 |
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
*/ |
/** @addtogroup libc |
* @{ |
*/ |
/** @file |
*/ |
/* |
* This implementation of FIFO stores values in an array |
* (static or dynamic). As such, these FIFOs have upper bound |
116,3 → 122,9 |
name.fifo = malloc(sizeof(*name.fifo) * name.items) |
#endif |
/** @} |
*/ |