mailund / hash
Various hash tables in C.
☆7Updated 6 years ago
Alternatives and similar repositories for hash:
Users that are interested in hash are comparing it to the libraries listed below
- A statically typed binary tree in Go without casts or reflection☆19Updated 11 years ago
- A splaytree ADT written in C with a BSD license☆17Updated 4 years ago
- libstrbuf: A powerful string library for C☆17Updated 8 years ago
- intelligent and automatic build system for C☆12Updated 3 years ago
- Combinators in C☆38Updated 12 years ago
- Fast time calls from user space.☆11Updated 9 years ago
- squint - Rob Pike's Newsqueak interpreter for Unix☆36Updated 12 years ago
- re1, the unbloated regexp engine by Russ Cox, elaborated to be useful for real-world applications☆42Updated 5 years ago
- A library to support streaming data applications☆24Updated 3 years ago
- A fast and memory efficient hashmap using sorting to resolve collisions☆43Updated 4 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆29Updated 2 years ago
- finding set bits in large bitmaps☆15Updated 9 years ago
- A benchmark for sorting algorithms☆59Updated 3 years ago
- A proof-of-concept for a fast regex matcher using lossy NFA matching on SIMD☆12Updated 5 years ago
- A command line interface tool to compute statistics from a file or the command line.☆40Updated 3 years ago
- Crit-bit tree (trie) library☆32Updated 10 years ago
- RLU resizable hash-table☆16Updated 9 years ago
- APL-like functions for use from Lua.☆18Updated 9 years ago
- Phase Fair and Standard Reader Writer Locks☆17Updated 5 years ago
- Yet Another Efficient Unification Algorithm☆26Updated 5 months ago
- AVX-2 vectorised 8-bit positional popcount for Go☆23Updated 4 years ago
- C library for parsing JSON config files☆34Updated 5 years ago
- mirror of Fabrice Bellard's libbf tar releases☆11Updated last year
- simple and efficient hashtable implementation for C, taken from musl's hsearch()☆21Updated last year
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆55Updated last year
- A C library for creating and accessing dynamic arrays with near O(log-base-256) scalability into the peta-element range☆31Updated 14 years ago
- arbitrary precision arithmetic library☆42Updated 6 years ago
- Sequence data structure with efficient random access insert and erase☆13Updated last year
- A collecton of generic reference counted data structures, tools to create compatible C style classes, and demo applications☆81Updated 9 years ago
- Forkscan Memory Reclamation☆11Updated 6 years ago