Library for Storage and Lookup Data Structures - Summary
C Library that aims at providing a portable set of interfaces for common (and uncommon) storage and lookup data structures.
Key words: unit testing, no memory allocation, list, tree and hash tables implemented,
This library basically exists to provide a consistent set of those algorithms in C without relying on memory management abstractions, compiler or OS. It also aims at providing good quality code and that's why everything is unit tested and the code is fully documented with doxygen.
Registration Date: Wed 15 Oct 2008 10:13:47 AM UTC
License: GNU General Public License V3 or later
Development Status: 4 - Beta
posted by dhilus, Sat 01 Nov 2008 05:08:39 PM UTC - 0 replies
The first version of the libSLDS has been released!
It provides a simple and flexible support for:
- single, double, circular linked lists
- stacks
- queues
- binary trees
- nary trees (hierarchical trees)
- hashtables along with predefined hash functions.
Tutorials will be provided on this website soon. Stay tuned!
To download it, go to the website!
[Submit News]
[1 news in archive]
Mailing Lists (1 public mailing-list)
