Bug 25: Sparse Bit Vector A Bit Broken
- This code implements a bit vector that is able to compress long runs of zero bits.
- A binary tree is used. The depth of the tree is determined when the bit vector is created.
- Each leaf node of the tree explicitly represents 128 bits as a pair of uint64 slice elements.
- Each non-leaf node of the tree is a pair of uint64 indexes. A nonzero index points to another node.
- A zero index means that all the bits within the subtree are zero.
Fix The Tiny Bug In This Go Code: