A blend of the compact and sparse hash table implementations.
☆15Aug 20, 2021Updated 4 years ago
Alternatives and similar repositories for compact_sparse_hash
Users that are interested in compact_sparse_hash are comparing it to the libraries listed below
Sorting:
- A package for building customizable decision trees and random forests.☆10Oct 6, 2025Updated 4 months ago
- ☆39Jun 20, 2020Updated 5 years ago
- Implementation of the algorithms from "Scalable Lock-Free Dynamic Memory Allocation"☆17Sep 22, 2014Updated 11 years ago
- RLU resizable hash-table☆17Aug 24, 2015Updated 10 years ago
- STRIPS benchmarks for classical planning☆14Mar 29, 2022Updated 3 years ago
- ☆21Feb 16, 2026Updated last week
- Automatically exported from code.google.com/p/esaxx☆17Jun 23, 2015Updated 10 years ago
- A Planning Domain Definition Language (PDDL 3.1) parser written in Rust☆18Jun 24, 2025Updated 8 months ago
- A lightweight framework for the efficient parsing and manipulation of PDDL in lifted form.☆19Dec 17, 2025Updated 2 months ago
- A comparative, extendable benchmarking suite for C and C++ hash-table libraries.☆44Jun 1, 2024Updated last year
- A lock-free malloc(3) implementation☆20Jun 15, 2025Updated 8 months ago
- Shared memory allocator☆21Jun 27, 2016Updated 9 years ago
- An extension of the Fast Downward planning system with state-of-the-art algorithms☆20Feb 14, 2026Updated 2 weeks ago
- A Japanese law parser☆25Jan 25, 2024Updated 2 years ago
- TU DOrtmund lossless COMPression framework☆19Sep 7, 2024Updated last year
- C++17 implementation of memory-efficient dynamic tries☆58Feb 15, 2022Updated 4 years ago
- ☆22Jun 11, 2024Updated last year
- ☆27Oct 11, 2025Updated 4 months ago
- ☆29May 1, 2025Updated 10 months ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆36Jan 8, 2023Updated 3 years ago
- Annotator that adds scope information to an ast☆26Jun 23, 2025Updated 8 months ago
- Detailed experiments over simdjson for VLDB article (2019) and future work☆21Oct 3, 2020Updated 5 years ago
- An implementation of Split-Ordered List Extensible Hashtable in C☆41Mar 17, 2011Updated 14 years ago
- ☆30Sep 25, 2024Updated last year
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Jun 8, 2016Updated 9 years ago
- An Evaluation of Linear Probing Hashtable Algorithms☆39Nov 27, 2023Updated 2 years ago
- Markup source code showing optimizations☆36Jan 21, 2020Updated 6 years ago
- light ifconfig☆14Apr 13, 2019Updated 6 years ago
- Symk is a state-of-the-art classical optimal and top-k planner.☆43Dec 16, 2025Updated 2 months ago
- ☆13Nov 15, 2017Updated 8 years ago
- A more realistic demo of a buffer overflow cause by -ffast-math☆15Sep 10, 2022Updated 3 years ago
- Constraint solver based on abstract interpretation☆10Dec 20, 2024Updated last year
- Run ctest inside gdb with fixtures and environment☆11Jan 21, 2025Updated last year
- Parr(B)ot is a Telegram bot framework based on top of Echotron☆10Jan 15, 2023Updated 3 years ago
- Compressed Bloom Filters (Golomb-compressed sequences, with indices)☆17May 19, 2013Updated 12 years ago
- A toy LDAP server in C for illustrative purposes☆12Apr 6, 2011Updated 14 years ago
- ☆12Oct 13, 2022Updated 3 years ago
- Yada is a yet another double-array trie library aiming for fast search and compact data representation.☆45Feb 25, 2024Updated 2 years ago
- The dash shell as a linkable library. Tracks https://git.kernel.org/pub/scm/utils/dash/dash.git, with extended interfaces, bindings for P…☆47Jan 27, 2025Updated last year