| Paketname | libsimplelist0 |
| Beschreibung | memory-efficient generic linked list library |
| Archiv/Repository | Offizielles Debian Archiv squeeze (main) |
| Version | 0.3.4-2 |
| Sektion | libs |
| Priorität | optional |
| Installierte Größe | 64 Byte |
| Hängt ab von | libc6 (>= 2.7-1) |
| Empfohlene Pakete | |
| Paketbetreuer | Kari Pahula |
| Quelle | simplelist |
| Paketgröße | 5416 Byte |
| Prüfsumme MD5 | 668846a560edc11284d02f5bf8f4d76d |
| Prüfsumme SHA1 | 36743cf064d61b14a64610c58a944f7fc0d5e276 |
| Prüfsumme SHA256 | e2d8fe96a2a968ea61ebb969517486141c0f11f101bdcb247cec85829f398718 |
| Link zum Herunterladen | libsimplelist0_0.3.4-2_i386.deb |
| Ausführliche Beschreibung | 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.
|