sl 0.3.4

sl is a memory-efficient generic linked list library. The project doesnt 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 cant fail because memory couldnt be allocated for the container node.
Enhancements:
- A slight documentation improvement was made.
- The "debian" directory was removed since sl has been packaged for Debian and so that directory is maintained by the Debian developers.
- Some internal build refactoring was done.