Here is a list of all modules:
Balanced Binary Trees | The module implements a balanced binary tree type, i.e. a container managing key/value pairs as elements. The container is optimized for lookup operations |
Double-ended queue. | The module implements a double-ended queue. This is a linear list which is optimized for insertions and deletions that are made at the ends of the list |
Doubly Linked Lists | The module implements a doubly linked list object which can be traversed in both directions, forward and backward, and methods to create, destroy and manipulate it |
File Utilities | The module provides a collection of useful file and file path related utility functions |
Maps | The module implements a map data type, i.e. a container managing key/value pairs as elements. Their elements are automatically sorted according to a sorting criterion used for the key. The container is optimized for lookup operations. Maps are restriced to unique keys, i.e. a key can only appear once in a map |
Memory Management Utilities | The module provides wrapper routines for the standard C memory management functions. The wrappers for the system memory allocators guarantee to always return valid pointer to the allocated memory block of memory. If the requested memory cannot be allocated the functions stop the program calling abort(), following the philosophy that it is better to terminate the application immediately when running out of resources. The memory deallocator is protected against* passing NULL |
Message Logging | The module implements a flexible logging facility. It can be customized to fit into the application environment. Log levels and functions can be defined and used in addition to or as replacement of the built in levels and log functions |
Miscellaneous Utilities | The module provides a portable implementation of a selection of miscellaneous utility functions |
Multi Maps | The module implements a map data type, i.e. a container managing key/value pairs as elements. Their elements are automatically sorted according to a sorting criterion used for the key. The container is optimized for lookup operations. Contrary to ordinary maps a multimap is not restricted to unique keys, but may contain multiple duplicate keys |
Singly Linked Lists | The module implements a linked list object restricted to iterations in just one direction and methods to create, destroy and manipulate it |
String Utility Functions | The module implements various string-related utility functions suitable for creating, searching and modifying C strings |
Strings | A cx_string is similar to a standard C string, except that it grows automatically as text is appended or inserted. The character data the string contains is '\0' terminated in order to guarantee full compatibility with string utility functions processing standard C strings. Together with the character data it also stores the length of the string |