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 5 months ago
- C++17 implementation of memory-efficient dynamic tries☆58Feb 15, 2022Updated 4 years ago
- Automatically exported from code.google.com/p/esaxx☆17Jun 23, 2015Updated 10 years ago
- STRIPS benchmarks for classical planning☆14Mar 29, 2022Updated 3 years ago
- ☆39Jun 20, 2020Updated 5 years ago
- A Japanese law parser☆25Jan 25, 2024Updated 2 years ago
- Sample usage of the System.Net.Http.Json library☆15Dec 8, 2022Updated 3 years ago
- A Planning Domain Definition Language (PDDL 3.1) parser written in Rust☆18Jun 24, 2025Updated 8 months ago
- ☆21Mar 10, 2026Updated last week
- A lightweight framework for the efficient parsing and manipulation of PDDL in lifted form.☆19Dec 17, 2025Updated 3 months ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆36Jan 8, 2023Updated 3 years ago
- Control the value of the localsinit flag on methods.☆17Nov 28, 2020Updated 5 years ago
- An extension of the Fast Downward planning system with state-of-the-art algorithms☆20Mar 4, 2026Updated 2 weeks ago
- A comparative, extendable benchmarking suite for C and C++ hash-table libraries.☆44Jun 1, 2024Updated last year
- ☆10Oct 2, 2021Updated 4 years ago
- Detailed experiments over simdjson for VLDB article (2019) and future work☆20Oct 3, 2020Updated 5 years ago
- RLU resizable hash-table☆17Aug 24, 2015Updated 10 years ago
- Hyperoctree construction and manipulation☆11Jan 4, 2021Updated 5 years ago
- TU DOrtmund lossless COMPression framework☆19Sep 7, 2024Updated last year
- ☆23Jun 11, 2024Updated last year
- Implementation of the algorithms from "Scalable Lock-Free Dynamic Memory Allocation"☆17Sep 22, 2014Updated 11 years ago
- ☆30Sep 25, 2024Updated last year
- Yada is a yet another double-array trie library aiming for fast search and compact data representation.☆46Feb 25, 2024Updated 2 years ago
- ☆11Dec 28, 2023Updated 2 years ago
- A minimal hierarchal state machine for Javascript.☆12May 9, 2015Updated 10 years ago
- Simple language collation for Go☆13Nov 3, 2020Updated 5 years ago
- Homework Template for Typst☆13Apr 5, 2023Updated 2 years ago
- Shared memory allocator☆21Jun 27, 2016Updated 9 years ago
- A multi-language segmenter using high-order CRF.☆17Feb 27, 2020Updated 6 years ago
- Symk is a state-of-the-art classical optimal and top-k planner.☆43Dec 16, 2025Updated 3 months ago
- Streamlining Solution, Architecture, and Requirements for perfect Alignment.☆35Updated this week
- Hatena Notation (はてな記法) Parser written in Go☆17Aug 3, 2017Updated 8 years ago
- ☆25Jan 18, 2019Updated 7 years ago
- ☆12Jul 10, 2020Updated 5 years ago
- Annotator that adds scope information to an ast☆26Jun 23, 2025Updated 8 months ago
- A lock-free malloc(3) implementation☆20Jun 15, 2025Updated 9 months ago
- An implementation of "Subspace Representations for Soft Set Operations and Sentence Similarities" (NAACL 2024)☆10May 31, 2024Updated last year
- BLEU Score in Rust☆12Mar 1, 2026Updated 2 weeks ago
- Lock-free (Non-blocking) Data Structures in Java☆13Dec 30, 2015Updated 10 years ago