def test_entries_even(self):
data = np.arange(40).reshape(20, 2)
cover = Cover(nr_cubes=10)
cubes = cover.define_bins(data)
for cube in cubes:
entries = cover.find_entries(data, cube)
assert len(entries) >= 2
def test_entries_even(self):
data = np.arange(40).reshape(20, 2)
cover = Cover(n_cubes=10)
cubes = cover.define_bins(data)
for cube in cubes:
entries = cover.find_entries(data, cube)
assert len(entries) >= 2
def test_cubes_overlap(self):
data = np.arange(40).reshape(20, 2)
cover = Cover(nr_cubes=10)
cubes = cover.define_bins(data)
entries = []
for cube in cubes:
# turn singleton lists into individual elements
res = [i[0] for i in cover.find_entries(data, cube)]
entries.append(res)
for i, j in zip(range(9), range(1, 10)):
assert set(entries[i]).union(set(entries[j]))
def test_entries_in_correct_cubes(self):
# TODO: this test is a little hacky
data = np.arange(40).reshape(20, 2)
cover = Cover(nr_cubes=10)
cubes = cover.define_bins(data)
cubes = list(cubes)
entries = [cover.find_entries(data, cube) for cube in cubes]
# inside of each cube is there. Sometimes the edges don't line up.
for i in range(10):
assert data[2 * i] in entries[i]
assert data[2 * i + 1] in entries[i]
def test_entries_in_correct_cubes(self):
# TODO: this test is a little hacky
data = np.arange(40).reshape(20, 2)
cover = Cover(n_cubes=10)
cubes = cover.define_bins(data)
cubes = list(cubes)
entries = [cover.find_entries(data, cube) for cube in cubes]
# inside of each cube is there. Sometimes the edges don't line up.
for i in range(10):
assert data[2 * i] in entries[i]
assert data[2 * i + 1] in entries[i]
def test_cubes_overlap(self):
data = np.arange(40).reshape(20, 2)
cover = Cover(n_cubes=10)
cubes = cover.define_bins(data)
entries = []
for cube in cubes:
# turn singleton lists into individual elements
res = [i[0] for i in cover.find_entries(data, cube)]
entries.append(res)
for i, j in zip(range(9), range(1, 10)):
assert set(entries[i]).union(set(entries[j]))
def test_find_entries_runs_with_diff_bins(self):
data = np.arange(30).reshape(10, 3)
c = Cover(nr_cubes=[5, 10])
cubes = list(c.define_bins(data))
_ = c.find_entries(data, cubes[0])
def test_find_entries_runs_with_diff_bins(self):
data = np.arange(30).reshape(10, 3)
c = Cover(n_cubes=[5, 10])
cubes = list(c.define_bins(data))
_ = c.find_entries(data, cubes[0])