scandum / binary_cubeLinks
Is a linear data structure with O(log n) searches and O(cbrt n) insertions and index lookups.
☆28Updated 4 years ago
Alternatives and similar repositories for binary_cube
Users that are interested in binary_cube are comparing it to the libraries listed below
Sorting:
- A stable adaptive partitioning comparison sort.☆209Updated last year
- Wolfsort is a stable adaptive hybrid radix / merge sort.☆197Updated last year
- Assorted notes☆84Updated 2 years ago
- Code for paper "Base64 encoding and decoding at almost the speed of a memory copy"☆205Updated 6 years ago
- Bitset Sort, a faster std::sort replacement.☆79Updated 4 years ago
- A simple single header 64 and 32 bit hash function using only add, sub, ror, and xor.☆78Updated 4 years ago
- ☆332Updated 6 years ago
- Reproducible experimeents on UTF-8 validation using SIMD instructions☆41Updated last year
- In-place Parallel Super Scalar Samplesort (IPS⁴o)☆132Updated last year
- An-source C library developed and used at AppNexus.☆114Updated 6 years ago
- Non-preemptive Thread Hierarchy Manager☆56Updated last year
- A Wait-Free Universal Construct for Large Objects☆96Updated 6 years ago
- Fast Hash Functions Using AES Intrinsics☆85Updated 6 years ago
- A fast alternative to the modulo reduction☆317Updated 4 years ago
- A very fast library for validating UTF-8 using AVX2/SSE4 instructions☆219Updated 5 years ago
- Code that accompanies the article "Lomuto's Comeback"☆35Updated 5 years ago
- fundamental tools in the spirit of C☆58Updated 6 years ago
- Hashing functions and PRNGs based on them☆167Updated 2 months ago
- Integer Map Data Structure☆133Updated 2 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆31Updated 3 years ago
- A minimal viable programming language on top of liblgpp☆78Updated 5 years ago
- Fleur implements a Bloom Filter library in C that is fully compatible with DCSO's Go and python implementations.☆117Updated 2 years ago
- SIMD-enhanced word counter☆253Updated 6 years ago
- C++14: bringing in those expressions that you wish you had, Lazily evaluated, compossible generators, maps, filters, ranges and more...☆156Updated 6 years ago
- An Evaluation of Linear Probing Hashtable Algorithms☆39Updated 2 years ago
- UMASH: a fast enough hash and fingerprint with collision bounds☆159Updated 3 weeks ago
- C++14 high performance non-blocking network IO (based on epoll + boost.context)☆135Updated 7 years ago
- Linux system calls.☆217Updated 6 years ago
- ☆39Updated 5 years ago
- A collection of array rotation algorithms.☆166Updated 3 years ago