thomasmoelhave / tpieLinks
Templated Portable I/O Environment
☆115Updated 9 months ago
Alternatives and similar repositories for tpie
Users that are interested in tpie are comparing it to the libraries listed below
Sorting:
- C++ implementations of indexing mechanisms, including a Hilbert-curve geohash based spatial index and a linear hashing table, for disk or…☆78Updated 5 years ago
- OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -☆215Updated 2 years ago
- C++ implementation of concurrent Binary Search Trees☆72Updated 10 years ago
- This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…☆118Updated last year
- A C++ library to compress and intersect sorted lists of integers using SIMD instructions☆443Updated 7 months ago
- STXXL: Standard Template Library for Extra Large Data Sets☆496Updated 2 years ago
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference☆54Updated last year
- Experimental C++11 version of sparsehash☆294Updated 3 years ago
- Simple non-academic performance comparison of available open source implementations of R-tree spatial index using linear, quadratic and R…☆49Updated 6 years ago
- A fully concurrent lock-free cuckoo hash table implementation☆56Updated 8 years ago
- High-performance multicore-scalable data structures and benchmarks☆144Updated 6 years ago
- CMake module collection☆31Updated 10 years ago
- A STL allocator that mmaps files☆255Updated 4 years ago
- C++ STL-like Fibonacci heap and queue for fast priority queues with mutable keys.☆68Updated 3 years ago
- A library of inverted index data structures☆151Updated 3 years ago
- A C++ library for integer array compression☆30Updated 3 years ago
- Git mirror of the official (mercurial) repository of cpp-btree☆80Updated 11 years ago
- A clone of Google C++ B-tree code https://code.google.com/p/cpp-btree/☆87Updated 11 years ago
- Execution primitives for C++☆155Updated 5 years ago
- Intel(R) Concurrent Collections for C++☆116Updated 3 years ago
- Lock-free parallel disjoint set data structure (aka UNION-FIND) with path compression and union by rank☆67Updated 10 years ago
- A C++ template class providing a thread-safe LRU cache☆77Updated 3 years ago
- SIMD (SSE) population count --- http://0x80.pl/articles/sse-popcount.html☆354Updated last year
- Automatically exported from code.google.com/p/google-concurrency-library☆35Updated 10 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 6 years ago
- STL-based caches for C++☆116Updated 2 years ago
- stl compatible hashtable☆29Updated 8 years ago
- A well-documented C++ implementation of the cover tree datastructure for quick k-nearest-neighbor search. Allows single-point insertion a…☆64Updated 7 years ago
- An intrusive C++17 implementation of a Red-Black-Tree, a Weight Balanced Tree, a Dynamic Segment Tree and much more!☆132Updated 2 years ago
- An open addressing linear probing hash table, tuned for delete heavy workloads☆214Updated 2 years ago