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
94
95
96
97
98
99
100
|
#############################################################################
##
## Copyright (C) 2014 Digia Plc and/or its subsidiary(-ies).
## Contact: http://www.qt-project.org/legal
##
## This file is part of Qt Creator.
##
## Commercial License Usage
## Licensees holding valid commercial Qt licenses may use this file in
## accordance with the commercial license agreement provided with the
## Software or, alternatively, in accordance with the terms contained in
## a written agreement between you and Digia. For licensing terms and
## conditions see http://www.qt.io/licensing. For further information
## use the contact form at http://www.qt.io/contact-us.
##
## GNU Lesser General Public License Usage
## Alternatively, this file may be used under the terms of the GNU Lesser
## General Public License version 2.1 or version 3 as published by the Free
## Software Foundation and appearing in the file LICENSE.LGPLv21 and
## LICENSE.LGPLv3 included in the packaging of this file. Please review the
## following information to ensure the GNU Lesser General Public License
## requirements will be met: https://www.gnu.org/licenses/lgpl.html and
# http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
##
## In addition, as a special exception, Digia gives you certain additional
## rights. These rights are described in the Digia Qt LGPL Exception
## version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
##
#############################################################################
import os
# Helper class to create a tree structure
class Tree:
def __init__(self, name=None, value=None, children=None):
self.__name__ = name
self.__value__ = value
self.__children__ = children
# getter functions
def getChild(self, name, occurrence=1):
if self.__children__:
for ch in self.__children__:
if ch.__name__ == name:
if occurrence == 1:
return ch
occurrence -= 1
return None
def getChildren(self):
return self.__children__
def getName(self):
return self.__name__
def getValue(self):
return self.__value__
# setter function
def setChildren(self, children):
self.__children__ = children
def setName(self, name):
self.__name__ = name
def setValue(self, value):
self.__value__ = value
# other functions
def addChild(self, child):
if self.__children__ == None:
self.__children__ = []
self.__children__.append(child)
def childrenCount(self):
if self.__children__:
return len(self.__children__)
return 0
def countChildOccurrences(self, name):
if not self.__children__:
return 0
return map(lambda x: x.getName(), self.__children__).count(name)
# internal functions
def __repr__(self):
return self.__str__()
def __strIndented__(self, indent):
result = "%s%s (%s)" % (" " * indent, self.__name__, self.__value__)
if self.__children__:
for ch in self.__children__:
if isinstance(ch, Tree):
result += os.linesep + ch.__strIndented__(indent + 2)
else:
result += os.linesep + " " * (indent + 2) + str(ch)
return result
def __str__(self):
return self.__strIndented__(1)
|
