Generic Data Structures Library
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 C programmers access to 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.
| Tags | Software Development Libraries |
|---|---|
| Licenses | GPL |
| Operating Systems | OS Independent |
| Implementation | C |
Recent releases
- 22 Aug 2012 21:04
Release Notes: A new interval-heap module.
- 07 Jul 2006 02:36
Release Notes: A bug that was introduced in gdsl_hash_insert in the previous release was fixed. A missing include in gdsl.h was fixed.
- 28 Jun 2006 05:59
No changes have been submitted for this release.
- 05 Oct 2004 06:48
No changes have been submitted for this release.
ndarnis
30 Mar 2004 01:46
Heartbeat
- Popularity Score
- 112.96
- Vitality Score
- 7.04
- Subscriptions
- 21
