kamping-site / kassert
Powerful assertions made easy: Define assertion levels, get insights with expression decomposition, and switch between exceptions and assertions.
☆11Updated last week
Related projects ⓘ
Alternatives and complementary repositories for kassert
- KaTric: scalable distributed-memory triangle counting made in Karlsruhe☆13Updated last year
- ☆13Updated 3 weeks ago
- KaMPIng: (Near) zero-overhead MPI wrapper for modern C++☆30Updated last week
- Dynamic Hashed Blocks (DHB) data structure for dynamic graphs☆12Updated 2 weeks ago
- Winning Solver of PACE Challenge 2019 Track A☆13Updated 3 years ago
- REplicated STORagE☆11Updated last year
- KaGen: Communication-free Massively Distributed Graph Generators☆35Updated this week
- A songbook about IT and computer science☆16Updated 5 years ago
- Parallel Wavelet Tree and Wavelet Matrix Construction☆26Updated last year
- More Hierarchy in Route Planning Using Edge Hierarchies☆15Updated 4 years ago
- Parallel space-efficient minimal perfect hash function on SIMD and GPU☆14Updated this week
- Shared-Memory and Distributed-Memory Parallel Graph Partitioning☆35Updated this week
- Packed and Compressed Hash Tables☆15Updated last year
- Generate pgfplots or gnuplots from embedded SQL statements☆25Updated 3 months ago
- Implementation of the sacabench framework☆15Updated 3 years ago
- Malleable Load Balancer. Massively Parallel Logic Backend. Award-winning SAT solving for the cloud.☆60Updated this week
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.☆15Updated last week
- Mt-KaHyPar (Multi-Threaded Karlsruhe Hypergraph Partitioner) is a shared-memory multilevel graph and hypergraph partitioner equipped with…☆126Updated this week
- Some near drop in stl compatible hash tables that are a lot more space efficient than any other options.☆20Updated 2 years ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆26Updated this week
- Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"☆18Updated 2 weeks ago
- In-place Parallel Super Scalar Samplesort (IPS⁴o)☆114Updated 6 months ago
- This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…☆107Updated 8 months ago
- Learned Monotone Minimal Perfect Hashing☆24Updated 2 months ago
- python module for running experiments☆9Updated 9 months ago
- In-place Parallel Super Scalar Samplesort (IPS⁴o)☆161Updated 4 years ago
- Maximum independent sets and vertex covers of large sparse graphs.☆72Updated 2 weeks ago
- Parallel Weighted Random Sampling☆19Updated 3 years ago
- In-place Parallel Super Scalar Radix Sort (IPS²Ra)☆30Updated 8 months ago
- Implementation of the HYPE hypergraph partitioner.☆17Updated 4 years ago