[ Mælström ]

Very loose data structure library for C89, (and later.) Built on a paradigm of breaking the storage structures from the abstract data structures wherever possible. Actually a collection of independent sources, except as noted. There are no library dependancies; just pick and choose among the sources and include them in one's project. Distributed under the terms of the MIT License. Not to be confused with Cherenkov Telescope Array tools. See tests for examples.

[ Dir ]
Programming.
[ Dir ]
A more specific, familiar hash table in C, that subclasses Map.
[ Dir ]
A linked-list with possibly different order permutations.
[ Dir ]
A hash table where a function specifies the key.
[ Dir ]
Random words are useful in testing.
[ Dir ]
A storage element that supports deleting at any point. New elements in the array past the end cause a realloc. There is a linked-list of removed elements.
[ Dir ]
A simple generic Stack when you don't need the complexity of a pool keeping track of the deleted elements.
[ Dir ]
Multi-component examples.
[ Dir ]
A wrapper around the standard C89 string library functions with a dynamic array. Using Modified UTF-8. Text is currently undergoing splitting into Text and String to not be a monolithic array that has O(n) performance for large strings. Sorry for the renaming everything; this will probably not work.
[ File ]
update.sh (4 KB)
-- π

From http://neil.chaosnet.org/code/Ctools/.