This allows the library to copy memory at near-C-speeds, rather than iterating bit-by-bit.
The hardest part of implementing a bitarray isn't setting a bit; it's slicing. bitarray-a2
A "deep post" on bitarrays is incomplete without discussing probabilistic data structures. The Bloom Filter is the quintessential use case where bitarray shines. This allows the library to copy memory at
Unlike a standard integer, a bit sequence has no standard "start" within a byte. bitarray-a2