gdsl
1.7
|
This is the gdsl (Release 1.7) documentation.
The Generic Data Structures Library (GDSL) is a collection of routines for generic data structures manipulation. It is a portable and re-entrant library fully written from scratch in pure ANSI C. It is designed to offer for C programmers common data structures with powerful algorithms, and hidden implementation. Available structures are lists, queues, stacks, hash tables, binary trees, binary search trees, red-black trees, 2D arrays, permutations, heaps and interval heaps.
Nicolas Darnis <ndarnis@free.fr>: all GDSL modules excepted the ones listed below.
Peter Kerpedjiev <pkerpedjiev@gmail.com>: interval_heap module.
Nicolas Darnis <ndarnis@free.fr>.
This is the list of persons (in randomized order) the GDSL Team want to thanks for their direct and/or indirect help:
For his bug report in hash_insert method and into gdsl.h.
For his patch to compile GDSL under OSX.
For his bug report in gdsl_stack_insert().
For his bug report in gdsl_hash_search().
For his KazLib from wich the deletion algorithm for gdsl_rbtree.c is inspired.
For his bug report in gdsl_list_map_backward(), and for the problem of redefining bool type in gdsl_types.h.
For his gdsl.spec file to build GDSL's RPM package.
For his patch to compile GDSL under FreeBSD.
For his patch to compile GDSL under Android OS.
For his gdsl_interval_heap module.
The GDSL Team.