kamping-site / kassert
Powerful assertions made easy: Define assertion levels, get insights with expression decomposition, and switch between exceptions and assertions.
☆11Updated 2 months ago
Alternatives and similar repositories for kassert:
Users that are interested in kassert are comparing it to the libraries listed below
- KaTric: scalable distributed-memory triangle counting made in Karlsruhe☆13Updated last year
- Karlsruhe Rapid Ridesharing (KaRRi) Dynamic Taxi Sharing Dispatcher.☆12Updated this week
- Dynamic Hashed Blocks (DHB) data structure for dynamic graphs☆12Updated 2 months ago
- REplicated STORagE☆13Updated last year
- Winning Solver of PACE Challenge 2019 Track A☆13Updated 3 years ago
- ☆16Updated 2 months ago
- KaGen: Communication-free Massively Distributed Graph Generators☆35Updated last week
- More Hierarchy in Route Planning Using Edge Hierarchies☆15Updated 4 years ago
- KaMPIng: (Near) zero-overhead MPI wrapper for modern C++☆44Updated this week
- Parallel Wavelet Tree and Wavelet Matrix Construction☆26Updated last year
- Parallel space-efficient minimal perfect hash function on SIMD and GPU☆14Updated last month
- Generate pgfplots or gnuplots from embedded SQL statements☆26Updated 5 months ago
- A songbook about IT and computer science☆16Updated 5 years ago
- Packed and Compressed Hash Tables☆15Updated last year
- Shared-Memory and Distributed-Memory Parallel Graph Partitioning☆38Updated this week
- Implementation of the sacabench framework☆15Updated 3 years ago
- Malleable Load Balancer. Massively Parallel Logic Backend. Award-winning SAT solving for the cloud.☆63Updated 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
- Mt-KaHyPar (Multi-Threaded Karlsruhe Hypergraph Partitioner) is a shared-memory multilevel graph and hypergraph partitioner equipped with…☆134Updated this week
- Maximum independent sets and vertex covers of large sparse graphs.☆73Updated 2 months ago
- Learned Monotone Minimal Perfect Hashing☆25Updated last month
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆27Updated 2 months ago
- Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"☆23Updated 2 months ago
- Vienna Graph Clustering☆15Updated this week
- Succinct Data Structure Library 3.0☆93Updated 4 months ago
- In-place Parallel Super Scalar Samplesort (IPS⁴o)☆116Updated this week
- Parallel Weighted Random Sampling☆19Updated 4 years ago
- KaHIP -- Karlsruhe HIGH Quality Partitioning.☆413Updated this week
- This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…☆107Updated 2 weeks ago
- Super Scalar Sample Sort in modern C++☆20Updated 4 years ago