1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
|
import vtk
import inspect
def parseClassTree(classtree, tree, names, parentId):
"""
This function convertes a nested list generated by
inspect.getclasstree() to a vtkTree.
"""
childId = None
for i in classtree:
# element showing the parent
if type(i) == type(()):
child = None
for j in i:
if type(j) == type(()):
pass
else:
child = j.__name__
if tree.GetNumberOfVertices() == 0:
childId = tree.AddVertex()
else:
childId = tree.AddChild(parentId)
names.InsertValue(childId, child)
# element showing the children
elif type(i) == type([]):
parseClassTree(i, tree, names, childId)
# Get a list of all wrapped vtk classes
list = []
for cls in dir(vtk):
clsObj = vtk.__dict__[cls]
if type(clsObj) == type(vtk.vtkObject):
list.append(clsObj)
# The tree that will hold vtk class hierarchy
builder = vtk.vtkMutableDirectedGraph()
names = vtk.vtkStringArray()
names.SetName("name")
# Allocate 100 tuples to start with. I picked this number
# out of air.
names.SetNumberOfTuples(100)
# Use inspect to get the class tree
classtree = inspect.getclasstree(list, 1)
# Convert nested list to tree
parseClassTree(classtree, builder, names, None)
tree = vtk.vtkTree()
tree.CheckedShallowCopy(builder)
tree.GetVertexData().AddArray(names)
## Now iterate over the tree and print it
#iter = vtk.vtkTreeDFSIterator()
#iter.SetTree(tree)
#
#while iter.HasNext():
# id = iter.Next()
# mystr = tree.GetLevel(id) * " "
# print mystr + str(names.GetValue(id))
# Display the tree in the tree map viewer
viewer = vtk.vtkTreeMapViewer()
viewer.SetInput(tree);
win = vtk.vtkRenderWindow()
interact = vtk.vtkRenderWindowInteractor()
interact.SetRenderWindow(win)
viewer.SetRenderWindow(win)
win.Render()
win.GetInteractor().Initialize()
win.GetInteractor().Start();
|
