chadaustin / Web-Benchmarks
☆19Updated 7 years ago
Related projects ⓘ
Alternatives and complementary repositories for Web-Benchmarks
- ☆13Updated 6 years ago
- Bloom filter alternative (C++)☆17Updated 6 years ago
- Batch Monitor - Gain performance by combining work from multiple threads into a single batch☆31Updated 9 years ago
- The well-formed build system.☆12Updated last year
- Constraing solving using functional methods in C++ and Haskell.☆20Updated 9 years ago
- Ragel State Machine Compiler - Official Mirror☆8Updated 8 years ago
- finding set bits in large bitmaps☆15Updated 8 years ago
- StateX - A cross platform native application architecture☆17Updated 8 years ago
- A dependency-based coroutine scheduler☆46Updated 8 years ago
- Container data structure for representing sequences by many fixed-capacity heap-allocated buffers (i.e., chunks).☆23Updated 6 years ago
- A library for Rapid {C|Concurrency|Correct} Development☆34Updated 9 years ago
- Sequence data structure with efficient random access insert and erase☆13Updated last year
- ☆30Updated 8 years ago
- Implementation of popular consensus protocols☆22Updated 4 years ago
- Fast cross-platform async network library☆15Updated 5 years ago
- Provide an idiomatic C++ interface to CPython's C API.☆27Updated 7 years ago
- Nanopipe: connecting the modern babel☆27Updated 8 years ago
- Fast 64 bit evolved hash.☆32Updated 7 years ago
- Very simple noSQL database, created as an example during a talk. See FineDB for a real high-performance noSQL database.☆13Updated 11 years ago
- A library for standard containers and their associated algorithms.☆12Updated 3 years ago
- A collection of CMake examples for demonstration purposes.☆19Updated 4 years ago
- bit & sketches data structures☆60Updated 6 years ago
- SQL query interface to C++ collections and C data structures. Also configurable as a loadable Linux kernel module and an extension to Val…☆14Updated 6 years ago
- Pruning of blanks from an ASCII stream - musings in AMD64 and ARM64☆9Updated 3 years ago
- Sorting algorithm quicker than MergeSort, and is adaptive and stable.☆40Updated 2 years ago
- Linear vs binary search benchmark☆41Updated 4 years ago
- Iterator library.☆79Updated 4 years ago
- A small DFA for under 16 states☆52Updated 6 years ago
- Popular hash table implementation benchmarks☆27Updated 7 years ago