Generic Data Structures Library 1.4-pl1 review
DownloadGeneric Data Structures Library (GDSL) is a collection of routines for generic data structures manipulation. Generic Data Structur
|
|
Generic Data Structures Library (GDSL) is a collection of routines for generic data structures manipulation.
Generic Data Structures Library 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, and permutations.
GDSL provides a modern Applications Programming Interface (API) for C programmers, while allowing wrappers to be written for very high level languages.
The library covers the following data structures:
Low-level doubly-linked nodes
Low-level doubly-linked low-level lists
Low level binary trees
Low level binary search trees
Binary search trees
Red-black trees
2D arrays
Hash tables
Lists
Queues
Stacks
Permutations
What's New in This Release:
A bug that was introduced in gdsl_hash_insert in the previous release was fixed.
A missing include in gdsl.h was fixed.
Generic Data Structures Library 1.4-pl1 search tags