def test_bitmap_xor(self, n_xs_ys):
n, xs, ys = n_xs_ys
x, y = Bitmap.from_indices(n, xs), Bitmap.from_indices(n, ys)
# tests __xor__
z = x ^ y
assert(z == Bitmap.from_indices(n, xs ^ ys))
# tests __ixor__
x ^= y
assert(x == z)
def test_bitmap_intersection(self, n_xs_ys):
n, xs, ys = n_xs_ys
x, y = Bitmap.from_indices(n, xs), Bitmap.from_indices(n, ys)
# tests __and__
z = x & y
assert(z == Bitmap.from_indices(n, xs & ys))
# tests __iand__
x &= y
assert(x == z)
def test_bitmap_union(self, n_xs_ys):
n, xs, ys = n_xs_ys
x, y = Bitmap.from_indices(n, xs), Bitmap.from_indices(n, ys)
# tests __or__
z = x | y
assert(z == Bitmap.from_indices(n, xs | ys))
# tests __ior__
x |= y
assert(x == z)
def test_bitmap_find_first_zero(self, n_xs):
n, xs = n_xs
x = Bitmap.from_indices(n, xs)
expected = -1 if x.full() else min(set(range(0, n)) - xs)
first = x.find_first_zero()
assert(first == expected)
def test_bitmap_find_first_bit(self, n_xs):
n, xs = n_xs
x = Bitmap.from_indices(n, xs)
expected = -1 if x.empty() else min(xs)
first = x.find_first_bit()
assert(first == expected)
def test_bitmap_negation(self, n_xs):
n, xs = n_xs
x = Bitmap.from_indices(n, xs)
y = -x
for idx in xs:
assert(idx not in y)
assert(x != y)
assert(x == -y)