thomasmoelhave / tpieLinks
Templated Portable I/O Environment
☆114Updated 8 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
- A C++ library to compress and intersect sorted lists of integers using SIMD instructions☆441Updated 5 months ago
- STXXL: Standard Template Library for Extra Large Data Sets☆496Updated 2 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…☆117Updated last year
- 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
- A C++ library for integer array compression☆30Updated 3 years ago
- A benchmark of some prominent C/C++ hash table implementations☆105Updated 6 years ago
- An encoder/decoder collection for a sequence of integers☆32Updated 12 years ago
- CMake module collection☆31Updated 10 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
- Execution primitives for C++☆155Updated 5 years ago
- Transpose: SIMD Integer+Floating Point Compression Filter☆63Updated 6 years ago
- A C++ header-only support for serialization of generic objects to be used when the type is known a-priori.☆52Updated 12 years ago
- A persistent hash array-mapped trie for C++☆91Updated 2 years ago
- A portable in-place bitwise binary Fredkin trie algorithm which allows for near constant time insertions, deletions, finds, closest fit f…☆276Updated 4 years ago
- An intrusive C++17 implementation of a Red-Black-Tree, a Weight Balanced Tree, a Dynamic Segment Tree and much more!☆130Updated 2 years ago
- Automatically exported from code.google.com/p/google-concurrency-library☆14Updated 10 years ago
- High-performance multicore-scalable data structures and benchmarks☆144Updated 6 years ago
- C++ implementation of a fast and memory efficient hash map and hash set specialized for strings☆184Updated last month
- C++ Library of Atomic and Lockless Data Structures☆38Updated 5 years ago
- Git mirror of the official (mercurial) repository of cpp-btree☆78Updated 11 years ago
- Lock-free parallel disjoint set data structure (aka UNION-FIND) with path compression and union by rank☆67Updated 10 years ago
- C++14 cache friendly B-heap priority queue☆109Updated 3 months ago
- A library of inverted index data structures☆151Updated 3 years ago
- C++ implementation of Concise and WAH compressed bitsets☆20Updated 8 years ago
- UME::SIMD A library for explicit simd vectorization.☆91Updated 7 years ago
- A clone of Google C++ B-tree code https://code.google.com/p/cpp-btree/☆87Updated 11 years ago