The source code for [Generalized 'parallel' popcnt](https://blog.devdroplets.com/generalized-hamming-weight/). A parallel popcnt implementation for tc39 bigints.
Calculate population count (popcnt) on a 32-bit number, branch free
A simple binding to Google's cpu_features library for obtaining information about installed CPU(s)
A tiny implementation of a bloomfilter using tc39, XXH64, enhanced double hashing, and parallel popcnt.
A simple binding to Google's cpu_features library for obtaining information about installed CPU(s)
TypeScript definitions for popcnt32
64-bit SimHash for text deduplication with Hamming distance calculations
A wrapper for libcpuid for node.js
Description of your package
64-bit SimHash for text deduplication with Hamming distance calculations (WASM)
A simple binding to Google's cpu_features library for obtaining information about installed CPU(s)
A simple binding to Google's cpu_features library for obtaining information about installed CPU(s)
Bit operation
count number of set bits in a byte slice
A fast B+ Tree implementation that uses integer keys
Attribute macros wrapping multiversion with predefined SIMD target presets
Low-level bindings for nauty and Traces
Blazing fast JSONPath CLI tool powered by SIMD
Blazing fast JSONPath query engine powered by SIMD. Core library of `rsonpath`.
A collection of succinct data structures supported by fast implementations of rank and select queries.
Safely invoke your intrinsic power, using the tokens granted to you by the CPU. Cast primitive magics faster than any mage alive.
A Hash Array Mapped Trie implementation based on the *Ideal Hash Trees* paper by Phil Bagwell.
ruLake — vector-native federation intermediary over heterogeneous backends (ADR-155)
Fast, compressed, 2-level bloom filter and bitmap
Mathematical analysis of Boolean functions