google / hashing-demoLinks
Sample implementation of a proposed C++ hashing framework
☆29Updated 9 years ago
Alternatives and similar repositories for hashing-demo
Users that are interested in hashing-demo are comparing it to the libraries listed below
Sorting:
- A benchmark of some prominent C/C++ hash table implementations☆105Updated 6 years ago
- Memory-mapped storage library☆76Updated 9 years ago
- ☆18Updated 8 years ago
- Library containing high-performance datastructures and utilities for C++☆74Updated 8 years ago
- A dependency-based coroutine scheduler☆45Updated 8 years ago
- Iterator library.☆79Updated 5 years ago
- Compiler intermediate language for static analysis.☆107Updated 6 years ago
- Linear vs binary search benchmark☆40Updated 5 years ago
- C++ implementation of concurrent Binary Search Trees☆72Updated 9 years ago
- Lock-free framework for loggers, tracers, and mockers in multithreaded C++ programs.☆100Updated 7 years ago
- Distributed search engine in C++14, using nanomsg for communication, bond for serialization.☆67Updated 10 years ago
- ☆21Updated 6 years ago
- Demonstrate how to construct an Event-driven system in a way that is intuitive and easier to understand.☆18Updated 2 years ago
- Algorithms to compress sorted arrays of integers☆17Updated 11 years ago
- ☆19Updated 8 years ago
- Infomation about C++ Coroutines TS v1 software and content☆9Updated 6 years ago
- Intel(R) Concurrent Collections for C++☆115Updated 2 years ago
- Jekyll site for C++Now!☆9Updated 7 years ago
- ☆32Updated 7 years ago
- snippets of what's new in the c++14 standard☆30Updated 10 years ago
- Provides a lightweight interpreter and factory for dynamically creating C++ objects at runtime.☆74Updated 3 years ago
- Implementation of Alexander A. Stepanov inverted Index Compression algorithms☆21Updated 9 years ago
- Lock-free multithreaded memory allocation☆106Updated 8 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- Feed-forward Bloom filters☆52Updated 14 years ago
- Benchmarks for lockfree datastructures.☆120Updated 11 years ago
- Generic SIMD intrinsic to allow for portable SIMD intrinsic programming☆42Updated 11 years ago
- C++ implementation of Concise and WAH compressed bitsets☆20Updated 8 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- Papers for the C++ Standards Committee, WG21☆56Updated 2 months ago