ULIB

ULIB is a lightweight library of useful toolkit for C/C++ programming. In contrast to STL, most components of ULIB provide better efficiency and are thereby reliable alternatives for high-performance applications.

Currently, it includes:

· A simple doubly linked list, this can also be used as queue and stack. · An efficient hashing scheme - alignhash, both hash_map and hash_set are provided. C macros & C++ templates. See performance comparison at AlignedHashingPerformance. · Binary trees, such as BST, splay tree, red-black tree and AVL tree. · A list sorting algorithm, this is faster than the qsort() in libc. · A binary search algorithm for text files. It works with line-sorted text files. · A heap and the corresponding sorting algorithm, this is faster than the STL version. · A partition algorithm, this partitions an array into three parts |= K|, O(1) complexity. · A collection of fast hash functions for various data types. · Primitives for random number generation. Especially useful for designing numerical algorithms. · A collection of bit operation hacks. Especially useful for numerical algorithms and cryptography. · Both a full featured bitmap and a bloom filter. · Several cryptographic algorithms, e.g., AES, RC4, SHA-x, MD5 and etc. · A collection of string utilities, including primitives for parallel file processing. · Timer, shell, combination enumerator and so on.