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
A more specific, familiar hash table in C, that
A linked-list with possibly different order permutations.
A hash table where a function specifies the key.
Random words are useful in testing.
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.
A simple generic Stack when you don't need the complexity
of a pool keeping track of the deleted elements.
A wrapper around the standard C89
string library functions
with a dynamic array. Using Modified
. Text is currently undergoing splitting into Text
to not be a monolithic array that has
performance for large strings. Sorry for the renaming
everything; this will probably not work.