Package: libsimplelist0-dev (0.3.4-2)

[ Source: simplelist  ]

memory-efficient generic linked list library

sl 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.

This package has the development headers and static libraries.

Tags: Software Development: C Development, Libraries, Implemented in: C, Role: role::devel-lib, scope::utility

Other Packages Related to libsimplelist0-dev

• dep: libsimplelist0

  memory-efficient generic linked list library

Download libsimplelist0-dev

Download for all available architectures

Architecture	Package Size	Installed Size	Files
mips	9.2 kB	76.0 kB	[list of files]