bobbyi / Fast-Bit-CountingLinks
Count how many bits are set (population count) in C++ using POPCNT via inline assembly and gcc intrinsics (with benchmarks)
☆16Updated 14 years ago
Alternatives and similar repositories for Fast-Bit-Counting
Users that are interested in Fast-Bit-Counting are comparing it to the libraries listed below
Sorting:
- Regionalized Value State Dependence Graph written in Rust☆11Updated 6 years ago
- A small DFA for under 16 states☆54Updated 7 years ago
- A distributed key-value cache with builtin materialized views.☆25Updated 11 years ago
- Implementation of the JSON semi-index described in the paper "Semi-Indexing Semi-Structured Data in Tiny Space"☆58Updated 13 years ago
- Experiments with array layouts for comparison-based searching☆86Updated 2 years ago
- A tool for testing C compilers automatically☆21Updated 10 years ago
- Test suite for implementations of Featherweight Generic Go☆35Updated 5 years ago
- Runtime support for LLVM's GC Statepoints☆42Updated 5 years ago
- Compact tries for fixed-width keys☆26Updated 7 years ago
- ☆11Updated 4 years ago
- Semi-naïve typed Datalog backend with runtime, transformations, and foreign predicate support☆16Updated 5 years ago
- Decompose source code into templates and fragments for any language.☆23Updated 3 years ago
- FNV hash collision generator☆12Updated 8 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Updated 7 years ago
- Compact Data Structures Library☆129Updated 11 years ago
- A lifetime inference algorithm for the Rust programming language written in Soufflé.☆25Updated 6 years ago
- 😇 Wholly Adaptive LLVM Optimizer☆28Updated 5 years ago
- Implementation of destination-driven code generation with control destinations. See [post.md](post.md)☆24Updated last year
- LVC verified compiler☆60Updated 7 years ago
- Buildsome: The awesome build system☆54Updated 3 years ago
- A tweaked version of Aha! ("A Hacker's Assistant") the superoptimiser by Henry S. Warren☆58Updated 3 years ago
- The Mickey Mouse of dynamic linkers☆16Updated 2 months ago
- Automatic inference of a formal specification of the x86_64 instruction set☆71Updated 9 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆58Updated 3 years ago
- A dynamically safe implementation of C, using your existing C compiler. Tolerates idiomatic C code pretty well. Not perfect... yet.☆107Updated last year
- BSD Licensed Bignum Library☆233Updated last year
- Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…☆50Updated last year
- Lock-free multithreaded memory allocation☆110Updated 9 years ago
- ☆55Updated last year
- A Haskell library implementing several Paxos-related algorithms☆25Updated 13 years ago