def test_enum_count_agree():
pos1 = numpy.random.uniform(size=(1000, 3)).astype('f4')
pos2 = numpy.random.uniform(size=(1000, 3)).astype('f4')
tree1 = KDTree(pos1).root
tree2 = KDTree(pos2).root
N = [0]
def process1(r, i, j):
N[0] += len(r)
tree1.enum(tree2, rmax=1.0, process=process1)
c = tree1.count(tree2, r=1.0)
assert_equal(N[0], c)
def test_build():
numpy.random.seed(1000)
pos = numpy.random.uniform(size=(1000, 3))
tree = KDTree(pos).root
N = [0, 0]
def process1(r, i, j):
N[0] += len(r)
def process2(r, i, j):
N[1] += len(r)
tree.enum(tree, rmax=0.1, process=process1)
def test_build():
numpy.random.seed(1000)
pos = numpy.random.uniform(size=(1000, 3))
tree = KDTree(pos).root
N = [0, 0]
def process1(r, i, j):
N[0] += len(r)
def process2(r, i, j):
N[1] += len(r)
tree.enum(tree, rmax=0.1, process=process1)
def test_enum():
numpy.random.seed(1234)
pos1 = numpy.random.uniform(size=(1000, 3)).astype('f8')
pos2 = numpy.random.uniform(size=(1000, 3)).astype('f8')
dist = ((pos1[:, None, :] - pos2[None, :, :]) ** 2).sum(axis=-1)
truth = (dist < 1).sum()
tree1 = KDTree(pos1).root
tree2 = KDTree(pos2).root
N = [0]
def process1(r, i, j):
N[0] += (r < 1.0).sum()
tree1.enum(tree2, rmax=1.0, process=process1)
assert_equal(N[0], truth)
def test_enum():
numpy.random.seed(1234)
pos1 = numpy.random.uniform(size=(1000, 3)).astype('f8')
pos2 = numpy.random.uniform(size=(1000, 3)).astype('f8')
dist = ((pos1[:, None, :] - pos2[None, :, :])**2).sum(axis=-1)
truth = (dist < 1).sum()
tree1 = KDTree(pos1).root
tree2 = KDTree(pos2).root
N = [0]
def process1(r, i, j):
N[0] += (r < 1.0).sum()
tree1.enum(tree2, rmax=1.0, process=process1)
assert_equal(N[0], truth)
