A pure-Python memory-efficient packed representation for bit arrays
This class presents a pure-Python memory-efficient packed representation for bit arrays.
Version 2.1 includes enhanced support for folks who use this class for computer security and cryptography work. You can now call on the methods of the BitVector class to do Galois Field GF(2^n) arithmetic on bit arrays. This should save the users of this class the bother of having to write their own routines for finding multiplicative inverses in GF(2^n) finite fields.
Version 2.0.1 removes many typos and other errors in the documentation page. The implementation code remains the same as in Version 2.0
Version 2.0 provides much additional functionality that was requested by folks in the data mining community.
The class supports the following operators/methods:
__eq__, __ne__, __lt__, __le__, __gt__, __ge__
- for bitwise or
& for bitwise and
^ for bitwise xor
~ for bitwise inversion
<< for circular rotation to the left
>> for circular rotation to the right
+ for concatenation
count_bit_sparse faster for sparse bit vectors
gf_divide for divisions in GF(2^n)
gf_MI for multiplicative inverse in GF(2^n)
gf_multiply for multiplications in GF(2)
gf_multiply_modular for multiplications in GF(2^n)
intValue for returning the integer value
isPowerOf2_sparse faster for sparse bit vectors
shift_left for non-circular left shift
shift_right for non-circular right shift