bit
Bitset
An efficient data structure for compactly storing and manipulating binary numbers using bit-level parallelism.
Bitset data structure
159 stars
10 watching
26 forks
Language: Go
last commit: over 3 years agoLinked from 2 awesome lists
bit-arraybit-twiddlingbitsetdata-structuresgo
Related projects:
| Repository | Description | Stars |
|---|---|---|
| A Go package implementing bitsets as a mapping between non-negative integers and boolean values | 1,363 | |
| A fast and space-efficient data structure for lookups using bit arrays in Elixir | 36 | |
| A data structure library for efficient bitset management | 770 | |
| A Go library providing efficient algorithms and data structures for graph manipulation | 712 | |
| An implementation of an infinite bit vector in JavaScript for efficient bit manipulation and storage. | 225 | |
| A C# library for efficient bit-level operations and manipulation of bit fields in various data types | 43 | |
| An implementation of crit-bit trees for efficient key/value storage and lookup in Haskell | 138 | |
| An efficient data structure for storing positive integers | 10 | |
| A data structure that represents a set of binary flags with unlimited bit capacity | 23 | |
| A C++ library for compact data structures and algorithms optimized for memory efficiency and high performance | 413 | |
| A JavaScript library for efficient binary array operations | 6 | |
| A formalization of bitset operations in Coq with extraction to OCaml native integers. | 22 | |
| Provides an optimized way to read and write bits in binary data | 246 | |
| A header-only dynamic bitset implementation with optional optimization and CMake integration | 155 | |
| A set of reusable components and utilities for C++ applications using micro:bit hardware | 1 |