det / segmented_treeLinks
Sequence data structure with efficient random access insert and erase
☆13Updated 2 years ago
Alternatives and similar repositories for segmented_tree
Users that are interested in segmented_tree are comparing it to the libraries listed below
Sorting:
- SIMD recipes, for various platforms (collection of code snippets)☆49Updated 4 years ago
- Lock-free multithreaded memory allocation☆108Updated 8 years ago
- Quick sort code using AVX2 instructions☆69Updated 8 years ago
- unrolled skip list library for C☆21Updated 6 years ago
- LLVM-jitted bitmaps☆27Updated 5 years ago
- Improved NetBSD's Perfect Hash Generation Tool v3☆20Updated last year
- Counting the collisions with perl hash tables per function☆12Updated 6 years ago
- Random Number Generator based on hardware-accelerated AES instructions☆60Updated 6 years ago
- compile time assembly interpreter☆86Updated 7 years ago
- Restartable Sequences: a userspace implementation of cheap per-cpu atomic operations☆38Updated 6 years ago
- A small DFA for under 16 states☆52Updated 7 years ago
- Fast differential coding functions (using SIMD instructions)☆55Updated 7 years ago
- SIMDized check which bytes are in a set☆28Updated 6 years ago
- Bloom filter alternative (C++)☆18Updated 6 years ago
- Experiments with array layouts for comparison-based searching☆84Updated last year
- Markup source code showing optimizations☆36Updated 5 years ago
- Pruning elements in SIMD vectors (i.e., packing left elements)☆65Updated last year
- Fast Hash Functions Using AES Intrinsics☆83Updated 6 years ago
- Implementation of the algorithms from "Scalable Lock-Free Dynamic Memory Allocation"☆17Updated 11 years ago
- Automatically exported from code.google.com/p/libhhash☆32Updated 9 years ago
- Fast and Reliable (but not Secure) Hash☆54Updated 7 years ago
- Support for ternary logic in SSE, XOP, AVX2 and x86 programs☆31Updated 9 months ago
- A dynamically safe implementation of C, using your existing C compiler. Tolerates idiomatic C code pretty well. Not perfect... yet.☆105Updated last year
- Fastest CPU SIMD (SSE4) sorting networks for small integer arrays (2-6 elements), also optimal amd64 assembly and notes on getting compil…☆50Updated 4 years ago
- A hash table implementation using Robin Hood Linear Probing☆51Updated 11 years ago
- The space of memory management research and systems produced by the PLASMA lab (https://plasma-umass.org).☆20Updated 4 years ago
- Popular hash table implementation benchmarks☆27Updated 8 years ago
- 8-bit Xor Filter in C99☆61Updated 5 years ago
- Demonstration of LLVM's opt-viewer tool☆71Updated 8 years ago
- Tiny Cooperative Process Management Library/Embedded Bounded Queue Actor Model (C11)☆40Updated 6 years ago