gdsl  1.8
gdsl

Introduction

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, search binary trees, red-black trees, 2D arrays, permutations, heaps and interval heaps.

About

This is the gdsl (Release 1.8) html-documentation.

Copyright

Copyright (C) 1998-2018 Nicolas Darnis <ndarnis@free.fr>.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.3 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts.

Project Manager

Nicolas Darnis <ndarnis@free.fr>.

Authors

Nicolas Darnis <ndarnis@free.fr>: all GDSL modules excepted the ones listed below.

Peter Kerpedjiev <pkerpedjiev@gmail.com>: interval_heap module.

Thanks

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.

  • Benny Pasternak <bennypk>

For his is bug report in gdsl_rbtree_map_infix function.

The GDSL Team.

GNU Free Documentation License