A pure-Python memory-efficient packed representation for bit arrays
This class presents a pure-Python memory-efficient packed representation for bit arrays.
Version 3.3.2 has a bug fix for the case when you construct a bit vector from a text string that includes character escapes.
Version 3.3.1 is a minor upgrade to make the syntax of the API method declarations more uniform. Previously, while most of the method names used underscores to connect multiple words, some used camelcasing. Now all use underscores. For backward compatibility, the old calls will continue to work.
Version 3.3 includes one more constructor mode: You can now construct a bit vector from the bytes data type. This version also includes a couple of bug fixes.
The class is provided with the following operators/methods:
- __eq__, __ne__, __lt__, __le__, __gt__, __ge__
- count_bits_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))
- int_val (for returning the integer value)
- is_power_of_2_sparse (faster for sparse bit vectors)
- shift_left (for non-circular left shift)
- shift_right (for non-circular right shift)
- slice assignment