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:
- Quick sort code using AVX2 instructions☆69Updated 8 years ago
- Markup source code showing optimizations☆36Updated 5 years ago
- Counting the collisions with perl hash tables per function☆12Updated 6 years ago
- LLVM-jitted bitmaps☆27Updated 5 years ago
- Lock-free multithreaded memory allocation☆108Updated 8 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆49Updated 4 years ago
- SIMDized check which bytes are in a set☆28Updated 6 years ago
- compile time assembly interpreter☆85Updated 7 years ago
- Bloom filter alternative (C++)☆18Updated 6 years ago
- Fast Hash Functions Using AES Intrinsics☆82Updated 6 years ago
- A dynamically safe implementation of C, using your existing C compiler. Tolerates idiomatic C code pretty well. Not perfect... yet.☆105Updated 11 months ago
- a fast fixed size block allocator☆20Updated 9 years ago
- fast SIMD-able JIT regular expression compiler☆197Updated 10 years ago
- Fast and Reliable (but not Secure) Hash☆54Updated 7 years ago
- Restartable Sequences: a userspace implementation of cheap per-cpu atomic operations☆37Updated 6 years ago
- A performant, parallel, probabilistic, random acyclic-graph, low-latency, perfect hash generation library.☆83Updated 2 months ago
- Pruning elements in SIMD vectors (i.e., packing left elements)☆65Updated last year
- Random Number Generator based on hardware-accelerated AES instructions☆60Updated 6 years ago
- Support for ternary logic in SSE, XOP, AVX2 and x86 programs☆31Updated 7 months ago
- A program for automatically resolving #ifdef statements in C code.☆37Updated 9 months ago
- Benchmarks for our memory allocator☆69Updated last year
- Library for generating ABI-compliant LLVM IR☆62Updated 5 years ago
- A small DFA for under 16 states☆51Updated 7 years ago
- Experiments with array layouts for comparison-based searching☆84Updated last year
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆30Updated 2 years ago
- Create man pages from information used by Intel Intrinsics Guide and optionally uops.info☆45Updated 8 months ago
- Improved NetBSD's Perfect Hash Generation Tool v3☆20Updated last year
- Demonstration of LLVM's opt-viewer tool☆71Updated 8 years ago
- Comparing linear and binary searches☆41Updated 5 years ago
- C library to remove white space from strings as fast as possible☆154Updated 11 months ago