def test_createAndLableTree(self):
''' Create new tree with new ids starting from 0'''
print "---------- test createAndLabelTree 1--------"
no1dN = []
points = numpy.array([[0.0, 0.0], [0.0, 1.0], [ 1.0, 0.0], [1.0, 1.0]])
util.splitN(points, 0, 0, 6, no1dN)
tree1 = kdtree.createNewTree(no1dN)
label=0
for n in kdtree.level_order(tree1):
self.assertIsNotNone(kdtree.getNode(tree1, label), "1: node with label: "+ str(label) + " not found in tree")
label+=1
kdtree.visualize(tree1)
print "---------- test createAndLabelTree 2--------"
no2dN = []
points = numpy.array([[0.0, 0.01], [0.0, 1.0], [ 1.0, 0.0], [1.0, 1.0]])
util.splitN(points, 0, 0, 6, no2dN)
tree2 = kdtree.createNewTree(no2dN)
kdtree.visualize(tree2)
label=0
for n in kdtree.level_order(tree2):
self.assertIsNotNone(kdtree.getNode(tree2, label), "2: node with label: "+ str(label) + " not found in tree")
label+=1
self.assertNotEqual(tree1, tree2, "trees have to be different")
def test_getNode(self):
print "---------- test getNode --------"
listSplitPoints = []
points = numpy.array([[0.0, 0.0],[0.0, 1.0], [ 1.0, 0.0], [1.0, 1.0]])
util.splitN(points, 0,0,6, listSplitPoints)
tree = kdtree.createNewTree(listSplitPoints)
util.activate(tree, 6)
kdtree.visualize(tree)
nodeLabel = 117
node = kdtree.getNode(tree, nodeLabel)
self.assertEqual( node.label, nodeLabel, "returned wrong node")
del tree
