https://github.com/bits-and-blooms/bitset

bitset go

Last synced: about 2 months ago

Repository metadata:

Go package implementing bitsets


Owner metadata:


Committers metadata

Last synced: 2 months ago

Total Commits: 292
Total Committers: 48
Avg Commits per committer: 6.083
Development Distribution Score (DDS): 0.842

Commits in past year: 31
Committers in past year: 6
Avg Commits per committer in past year: 5.167
Development Distribution Score (DDS) in past year: 0.581

Name Email Commits
Daniel Lemire l****e@g****m 46
Will Fitzgerald w****d@g****m 45
Will Fitzgerald w****f@g****m 42
Daniel Lemire d****l@l****e 28
nicolaasuni i****o@t****m 24
nicolaasuni n****a@c****m 20
Will Fitzgerald w****d@p****m 11
Oleg Dyachenko D****g@g****m 10
Gabriela Gutierrez g****z@g****m 5
Mauro Stettler m****r@g****m 4
Bobby Powers b****s@g****m 3
Christian Stewart c****n@p****n 3
Klaus Post k****t@g****m 3
Thanh Pham Kieu t****k@l****m 3
Will Fitzgerald w****l@w****m 3
Ömer Faruk IRMAK o****k@g****m 3
dependabot[bot] 4****] 3
nemars 3****s 2
Michal Hruby m****r@g****m 2
Todd Vierling tv@d****g 2
Zellyn Hunter z****n@g****m 2
zhongxiguan z****n@t****m 2
Christopher Probst c****t@u****e 1
Cui Xin s****n@q****m 1
lennart6443 2****3 1
Simon Menke s****e@g****m 1
Seyi Ogunyemi m****t 1
Jason Wilder j****r@l****m 1
John Jannotti j****i@g****m 1
Joseph M. Sleiman j****n@p****m 1
and 18 more...

Issue and Pull Request metadata

Last synced: about 2 months ago


Package metadata

go: github.com/bits-and-blooms/bitset

Package bitset implements bitsets, a mapping between non-negative integers and boolean values. It should be more efficient than map[uint] bool. It provides methods for setting, clearing, flipping, and testing individual integers. But it also provides set intersection, union, difference, complement, and symmetric operations, as well as tests to check whether any, all, or no bits are set, and querying a bitset's current length and number of positive bits. BitSets are expanded to the size of the largest set bit; the memory allocation is approximately Max bits, where Max is the largest set bit. BitSets are never shrunk. On creation, a hint can be given for the number of bits that will be used. Many of the methods, including Set,Clear, and Flip, return a BitSet pointer, which allows for chaining. Example use: As an alternative to BitSets, one should check out the 'big' package, which provides a (less set-theoretical) view of bitsets.

  • Homepage: https://github.com/bits-and-blooms/bitset
  • Documentation: https://pkg.go.dev/github.com/bits-and-blooms/bitset#section-documentation
  • Licenses: BSD-3-Clause
  • Latest release: v1.13.0 (published about 1 year ago)
  • Last Synced: 2024-11-11T01:04:30.066Z (about 2 months ago)
  • Versions: 33
  • Dependent Packages: 3,734
  • Dependent Repositories: 13,930
  • Docker Downloads: 7,928,672,344
  • Rankings:
    • Docker downloads count: 0.04%
    • Dependent repos count: 0.064%
    • Dependent packages count: 0.101%
    • Average: 0.867%
    • Stargazers count: 1.965%
    • Forks count: 2.165%

Dependencies

.github/workflows/test.yml actions
  • actions/checkout master composite
  • actions/setup-go v2 composite