proxy.golang.org : github.com/jba/bitset
Package bitset implements bitsets. A bitset is a set of non-negative integers represented using a bit for each integer. There are three implementations: Use Dense for the common case where you know the largest value that could be in the set, and you want to use a sequence of bits. Addition, removal and membership tests on a Dense bitset are very fast, and memory is proportional to the largest possible value (one bit per possible value). Use Sparse for bitsets whose values can come from a wide range. Sparse bitsets take more time per operation, but can use less memory than a Dense bitset if the set contains relatively few elements drawn from a large range. For example, A Dense bitset with the elements 1000, 2000, ...., 1_000_000 would occupy 122K, while a Sparse one would take about 57K. Set64 is a faster version of Dense when the largest possible value is 63.
Registry
-
Source
- Documentation
- JSON
- codemeta.json
purl: pkg:golang/github.com/jba/bitset
License: MIT
Latest release: over 5 years ago
First release: over 5 years ago
Namespace: github.com/jba
Stars: 11 on GitHub
Forks: 0 on GitHub
See more repository details: repos.ecosyste.ms
Last synced: 12 days ago