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:
- compile time assembly interpreter☆86Updated 7 years ago
- Fast Hash Functions Using AES Intrinsics☆85Updated 6 years ago
- A small DFA for under 16 states☆54Updated 7 years ago
- Markup source code showing optimizations☆36Updated 6 years ago
- Quick sort code using AVX2 instructions☆69Updated 8 years ago
- Linear vs binary search benchmark☆41Updated 6 years ago
- Shuffle-based predicate matcher and all-round branch free swiss army chainsaw☆17Updated 7 years ago
- Fastest CPU SIMD (SSE4) sorting networks for small integer arrays (2-6 elements), also optimal amd64 assembly and notes on getting compil…☆52Updated 4 years ago
- Random Number Generator based on hardware-accelerated AES instructions☆61Updated 6 years ago
- fast SIMD-able JIT regular expression compiler☆197Updated 10 years ago
- Restartable Sequences: a userspace implementation of cheap per-cpu atomic operations☆38Updated 7 years ago
- Improved NetBSD's Perfect Hash Generation Tool v3☆22Updated last year
- Vectorized version of the PCG random number generator☆87Updated 3 weeks ago
- A performant, parallel, probabilistic, random acyclic-graph, low-latency, perfect hash generation library.☆86Updated this week
- LLVM-jitted bitmaps☆27Updated 5 years ago
- A feature-incomplete peekahole (pahole) clone that doesn't rely on libdwarves (and doesn't choke on Clang output)☆23Updated 8 years ago
- a fast fixed size block allocator☆20Updated 10 years ago
- ☆29Updated 6 years ago
- Experiments with array layouts for comparison-based searching☆86Updated 2 years ago
- A Wait-Free Universal Construct for Large Objects☆96Updated 6 years ago
- Bloom filter alternative (C++)☆18Updated 7 years ago
- Lock-free multithreaded memory allocation☆110Updated 9 years ago
- C library to remove white space from strings as fast as possible☆157Updated last year
- multi-way atomic compare-and-swap with x64/TSX☆85Updated 9 years ago
- Terminating is exciting☆22Updated 9 years ago
- Fast and Reliable (but not Secure) Hash☆55Updated 7 years ago
- ☆55Updated last year
- Library for generating ABI-compliant LLVM IR☆64Updated 6 years ago
- Counting the collisions with perl hash tables per function☆12Updated 6 years ago
- Support for ternary logic in SSE, XOP, AVX2 and x86 programs☆31Updated last year