csnip
0.1
|
Dynamic arrays | Dynamically allocated resizable arrays |
C Extension Macros | Macros for C extensions |
▼Command line options parser | Convenient Command line options parser |
Argument parsers for clopts | |
Coroutines | Lightweight coroutines |
▼Error handling | Error handling mechanism |
Csnip error codes | |
Search functions | Binary search algorithm |
Heaps | Heaps (also known as priority queues) are data structures that allow efficient element insertion, removal, and removal of the smallest element |
Numeric limits | Type generic numeric limit macros |
▼Linked Lists | Macros to manipulate linked lists |
Doubly Linked Lists | Macros for doubly linked lists |
Singly Linked Lists with tail pointers | |
Logging | Logging utilities |
▼Hash tables | |
Linear probing hashing primitives | Primitives for linear probing hash tables |
Linear Probing Hash Table | Hash tables based on linear probing |
Memory Managment | Convenient and safe memory allocation macros |
Typedefs for PODs | Typedefs for plain old data types |
Preprocessor macros | Preprocessor macros |
Ring buffers | Ring buffer implementation |
Random Number Generation | Abstract base type for random number generation |
Mersenne Twister | Mersenne twister RNG implementation |
Sorting algorithms | Comparison based sorting algorithms |
Time utilities | Utilities to deal with time |
Utilities | Simple utilities that are frequently used |
Compatibility functions | Portable implementations of libc functions |
Hash functions | Hash functions |