Given a
Hash and a
Shift that indicates the level in the
tree, compute the bitmap that contains only the
index of the
hash at this level.
The result can be used for constructing one-element
BitmapIndexed nodes or to check whether a
BitmapIndexed
node may possibly contain the given
Hash.
>>> mask 0b0010_0010 0
0b0100