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
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
|
# -*- coding: utf-8 -*-
# -----------------------------------------------------------------------------
# Liblarch - a library to handle directed acyclic graphs
# Copyright (c) 2011-2012 - Lionel Dricot & Izidor MatuĊĦov
#
# This program is free software: you can redistribute it and/or modify it under
# the terms of the GNU Lesser General Public License as published by the Free
# Software Foundation, either version 3 of the License, or (at your option) any
# later version.
#
# This program is distributed in the hope that it will be useful, but WITHOUT
# ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
# FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License for more
# details.
#
# You should have received a copy of the GNU Lesser General Public License
# along with this program. If not, see <http://www.gnu.org/licenses/>.
# -----------------------------------------------------------------------------
BIG_NUMBER = 2000
STAIRS = 200
from liblarch import Tree, TreeNode
from liblarch_gtk import TreeView
import time
from gi.repository import Gtk
#This is a dummy treenode that only have one properties: a color
class DummyNode(TreeNode):
def __init__(self,tid):
TreeNode.__init__(self, tid)
self.colors = []
tree = Tree()
view = tree.get_viewtree()
#view = tree.get_viewtree(refresh = False)
nodes_id = []
################now testing the GTK treeview ##################
#The columns description:
desc = {}
col = {}
col['title'] = "Node name"
render_text = Gtk.CellRendererText()
col['renderer'] = ['markup',render_text]
def get_node_name(node):
return node.get_id()
col['value'] = [str,get_node_name]
desc['titles'] = col
#treeview = TreeView(view,desc)
start = time.time()
previous_id = None
for index in range(BIG_NUMBER):
nid = "stress" + str(index)
node = DummyNode(nid)
nodes_id.append(node.get_id())
tree.add_node(node)
previous_id = nid
end = time.time()
print("\nADDING %d NODES: %f" % (BIG_NUMBER, end - start))
start = time.time()
for node_id in nodes_id:
tree.refresh_node(node_id)
end = time.time()
print("\nUPDATING %d NODES: %f" % (BIG_NUMBER, end - start))
start = time.time()
for node_id in nodes_id:
tree.del_node(node_id)
end = time.time()
print("\nDELETING %d NODES: %f" % (BIG_NUMBER, end - start))
start = time.time()
previous_id = None
for index in range(STAIRS):
nid = "stress" + str(index)
node = DummyNode(nid)
nodes_id.append(node.get_id())
tree.add_node(node,parent_id=previous_id)
previous_id = nid
end = time.time()
print("\nADDING %d NODES in stairs: %f" % (STAIRS, end - start))
start = time.time()
for node_id in nodes_id:
tree.refresh_node(node_id)
end = time.time()
print("\nUPDATING %d NODES in stairs: %f" % (STAIRS, end - start))
|
