A performance optimized infinite bit vector library
Toni, a simple and efficient bitmap implementation for positive integer sets (max 32 bits), with no element repetition, using bitwise operations and a Buffer. Modifying a single bit instead of an entire byte, obviously saves 87.5% of Buffer space, but it
A data-structures and algorithms library for node
Data structures for the web
Typescript version of infusion's BitSet.js [https://github.com/infusion/BitSet.js] Typings seem bugged for official
SculeJS data structure server
A compile time sized array of bits
bloom filter is a probabilistic filter which SPV clients provide so we can filter the transactions we send them -- this allows for significantly more efficient transaction and block downloads
Bit Array
B-field datastructure implementation in Rust
A zero-cost, hardware-aligned bitfield and enumeration generator.
컴퓨터 구조 학습을 위한 숫자 진법 변환 라이브러리
Collection utilities including generic range types with iteration, clamping, and overlap detection
A Rust library for arbitrary floating-point types with infinite exponent.
tools and context for hashing bytes
A const generics driven bit array specialized for hamming distance
A set of bits backed by bit-array
A dynamically sized bit array
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.