tlk00 / BitMagicLinks
BitMagic Library
β437Updated 4 months ago
Alternatives and similar repositories for BitMagic
Users that are interested in BitMagic are comparing it to the libraries listed below
Sorting:
- π Fast C/C++ bit population count libraryβ358Updated last year
- A C/C++ header file for fast 32-bit division remainders (and divisibility tests) on 64-bit hardware.β338Updated last year
- STXXL: Standard Template Library for Extra Large Data Setsβ496Updated 2 years ago
- Bloom-filter based minimal perfect hash function libraryβ270Updated 5 months ago
- C++ implementation of a memory efficient hash map and hash setβ366Updated last month
- Comprehensive benchmarks of C++ mapsβ316Updated 2 years ago
- C++ implementation of a fast and memory efficient hash map and hash set specialized for stringsβ184Updated last month
- C++ implementation of a fast hash map and hash set using hopscotch hashingβ765Updated last month
- Heap Layers: An Extensible Memory Allocation Infrastructureβ406Updated last week
- A C++ library to compress and intersect sorted lists of integers using SIMD instructionsβ441Updated 5 months ago
- SIMD (SWAR/SSE/SSE4/AVX2/AVX512F/ARM Neon) of Karp-Rabin algorithm's modificationβ261Updated 3 years ago
- In-place Parallel Super Scalar Samplesort (IPSβ΄o)β164Updated 11 months ago
- Greg's Template Library of useful classes.β243Updated 3 weeks ago
- TLX - A Collection of Sophisticated C++ Data Structures, Algorithms, and Miscellaneous Helpersβ440Updated 11 months ago
- High Performance Streams Based on Coroutine TS β‘β150Updated 6 years ago
- Provides a bit-vector, an optimized replacement of the infamous std::vector<ool>. In addition to the bit-vector, the library also proβ¦β73Updated last year
- A fast alternative to the modulo reductionβ314Updated 4 years ago
- Fast integer compression in C using the StreamVByte codecβ411Updated 10 months 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
- Simple Useful Libraries: C++17/20 header-only dynamic bitsetβ172Updated 10 months ago
- a minimal C++ interval tree implementationβ237Updated 4 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 11 months ago
- A STL allocator that mmaps filesβ254Updated 4 years ago
- A simple, extensible, portable, efficient and header-only SIMD library!β232Updated 4 years ago
- Fast Approximate Membership Filters (C++)β288Updated 3 months ago
- βοΈ PTHash is a fast and compact minimal perfect hash function.β249Updated last month
- LLVM Optimization to extract a function, embedded in its intermediate representation in the binary, and execute it using the LLVM Just-Inβ¦β527Updated 4 years ago
- Concurrent Deferred Reference Countingβ173Updated last year
- Succinct data structures in C/C++β92Updated last year
- An open addressing linear probing hash table, tuned for delete heavy workloadsβ211Updated 2 years ago