kamping-site / kassertLinks
Powerful assertions made easy: Define assertion levels, get insights with expression decomposition, and switch between exceptions and assertions.
☆11Updated 4 months ago
Alternatives and similar repositories for kassert
Users that are interested in kassert are comparing it to the libraries listed below
Sorting:
- KaTric: scalable distributed-memory triangle counting made in Karlsruhe☆13Updated last year
- Karlsruhe Rapid Ridesharing (KaRRi) Dynamic Taxi Sharing Dispatcher.☆12Updated 3 weeks ago
- Dynamic Hashed Blocks (DHB) data structure for dynamic graphs☆12Updated 2 months ago
- REplicated STORagE☆13Updated 2 years ago
- ☆17Updated 3 months ago
- Winning Solver of PACE Challenge 2019 Track A☆13Updated 3 years ago
- KaMPIng: (Near) zero-overhead MPI wrapper for modern C++☆51Updated last month
- KaGen: Communication-free Massively Distributed Graph Generators☆39Updated last month
- KaPoCE is a framework for solving the cluster editing problem that asks to transform an input graph into a cluster graph (a disjoint unio…☆10Updated 2 years ago
- Shared-Memory and Distributed-Memory Parallel Graph Partitioning☆40Updated last week
- Parallel space-efficient minimal perfect hash function on SIMD and GPU☆14Updated 2 months ago
- Generate pgfplots or gnuplots from embedded SQL statements☆27Updated last month
- More Hierarchy in Route Planning Using Edge Hierarchies☆14Updated 5 years ago
- Packed and Compressed Hash Tables☆15Updated 2 months ago
- Malleable Load Balancer. Massively Parallel Logic Backend. Award-winning SAT solving for the cloud.☆66Updated this week
- Parallel Wavelet Tree and Wavelet Matrix Construction☆26Updated last year
- A songbook about IT and computer science☆17Updated 6 years ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆30Updated 2 months ago
- Parallel Weighted Random Sampling☆20Updated 4 years ago
- Implementation of the sacabench framework☆17Updated 4 years ago
- Some near drop in stl compatible hash tables that are a lot more space efficient than any other options.☆20Updated 2 years ago
- Maximum independent sets and vertex covers of large sparse graphs.☆77Updated 2 months ago
- Vienna Graph Clustering☆16Updated 5 months ago
- KaHIP -- Karlsruhe HIGH Quality Partitioning.☆439Updated 2 months ago
- vertex cover solver☆30Updated 5 years ago
- Paper, code, experiments and evaluation for ESA2020 paper "Space-efficient, Fast and Exact Routing in Time-dependent Road Networks"☆10Updated 4 years ago
- Learned Monotone Minimal Perfect Hashing☆27Updated 2 months ago
- ☆18Updated 6 months ago
- Management of Benchmark Instances and Instance Attributes☆20Updated last month
- Super Scalar Sample Sort in modern C++☆20Updated 4 years ago