About:
sl is a yet another generic linked list library. Instead of container nodes with pointers to your data, it uses a pointer to the next item directly in the data structure you want to create lists (or stacks) of. In addition to significant memory savings, this allows for very fast push and pop operations since there is no need to allocate or free memory for the container nodes. It also means that a push can't fail because memory couldn't be allocated for the container node.

Author:
Stig Brautaset [contact developer]

Rating:	reset 1 2 3 4 5 6 7 8 9 10
(not rated)

Homepage:
http://code.brautaset.org/sl/
Changelog:
http://svn.brautaset.org/sl/trunk/ChangeLog
CVS tree (cvsweb):
http://svn.brautaset.org/sl/

Trove categories: [change]

[Development Status]		5 - Production/Stable
[Intended Audience]		Developers
[License]		OSI Approved :: GNU General Public License (GPL)
[Operating System]		OS Independent
[Programming Language]		C
[Topic]		Software Development :: Libraries

Dependencies: [change]
No dependencies filed