Bug#358657: ITP: libsl -- memory-efficient generic linked list library
Package: wnpp
Severity: wishlist
Owner: Kari Pahula <kaol@iki.fi>
* Package name : libsl
Version : 0.3.3
Upstream Author : Stig Brautaset <stig@brautaset.org>
* URL : http://brautaset.org/software/sl/
* License : GPLv2 or later
Description : memory-efficient generic linked list library
sl is a memory-efficient generic linked list library. It doesn't use
container nodes. Instead it requires a pointer to the next item
directly in the datastructure you want to create lists (or stacks)
of. This can give you significant memory savings when creating long
lists of small structures. It also allows for 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.
-- System Information:
Debian Release: testing/unstable
APT prefers unstable
APT policy: (500, 'unstable')
Architecture: i386 (i686)
Shell: /bin/sh linked to /bin/bash
Kernel: Linux 2.6.15.6
Locale: LANG=C, LC_CTYPE=fi_FI@euro (charmap=ISO-8859-15)
Reply to: