kamping-site / kassertLinks
Powerful assertions made easy: Define assertion levels, get insights with expression decomposition, and switch between exceptions and assertions.
☆11Updated 5 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☆14Updated 2 years ago
- Karlsruhe Rapid Ridesharing (KaRRi) Dynamic Taxi Sharing Dispatcher.☆13Updated 2 weeks ago
- Dynamic Hashed Blocks (DHB) data structure for dynamic graphs☆12Updated 4 months ago
- REplicated STORagE☆13Updated 2 years ago
- Winning Solver of PACE Challenge 2019 Track A☆13Updated 4 years ago
- Shared-Memory and Distributed-Memory Parallel Graph Partitioning☆47Updated this week
- KaGen: Communication-free Massively Distributed Graph Generators☆41Updated this week
- KaPoCE is a framework for solving the cluster editing problem that asks to transform an input graph into a cluster graph (a disjoint unio…☆11Updated 3 years ago
- More Hierarchy in Route Planning Using Edge Hierarchies☆14Updated 5 years ago
- ☆17Updated 10 months ago
- KaMPIng: (Near) zero-overhead MPI wrapper for modern C++☆68Updated 2 weeks ago
- Implementation of the sacabench framework☆18Updated 4 years ago
- Generate pgfplots or gnuplots from embedded SQL statements☆30Updated 8 months ago
- Parallel Wavelet Tree and Wavelet Matrix Construction☆25Updated 2 years ago
- Parallel space-efficient minimal perfect hash function on SIMD and GPU☆15Updated 3 weeks ago
- Malleable Load Balancer. Massively Parallel Logic Backend. Award-winning SAT solving for the cloud.☆80Updated last week
- KaHIP -- Karlsruhe HIGH Quality Partitioning.☆470Updated this week
- Mt-KaHyPar (Multi-Threaded Karlsruhe Hypergraph Partitioner) is a shared-memory multilevel graph and hypergraph partitioner equipped with…☆169Updated this week
- Packed and Compressed Hash Tables☆15Updated 9 months ago
- This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…☆117Updated last year
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆34Updated 9 months ago
- The Ipe extensible drawing editor☆233Updated 5 months ago
- Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"☆27Updated last year
- GBBS: Graph Based Benchmark Suite☆215Updated last month
- Some near drop in stl compatible hash tables that are a lot more space efficient than any other options.☆23Updated 3 years ago
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.☆21Updated 3 months ago
- Parallel Weighted Random Sampling☆20Updated 5 years ago
- Maximum independent sets and vertex covers of large sparse graphs.☆79Updated 3 months ago
- ☆11Updated 2 years ago
- A Toolkit for Programming Parallel Algorithms on Shared-Memory Multicore Machines☆418Updated 2 months ago