/
Requirements_test.py
251 lines (208 loc) · 8.87 KB
/
Requirements_test.py
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
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
import Requirements
import unittest
class TestRequirementNode(unittest.TestCase):
# def setUp(self):
# self.seq = range(10)
def test_new_node(self):
# make sure the shuffled sequence does not lose any elements
Idname = "idNodeTest"
content= {1:2,"2":3}
new = Requirements.node(Idname,content)
self.assertEqual(new.Id, Idname)
self.assertEqual(new.Content, content)
# Pointing and pointed arrays is empty
self.assertEqual(new.Pointing, set([]))
self.assertEqual(new.Pointed, set([]))
def test_addPointing(self):
Ids = "idNodeTest"
content= {1:2,"2":3}
new = Requirements.node(Ids,content)
new.addPointing(2)
self.assertEqual(new.Pointing, set([2]))
new.addPointing("test")
self.assertEqual(new.Pointing, set([2,"test"]))
new.addPointing(2)
self.assertEqual(new.Pointing, set([2,"test"]))
def test_addPointed(self):
Ids = "idNodeTest"
content= {1:2,"2":3}
new = Requirements.node(Ids,content)
new.addPointed(2)
self.assertEqual(new.Pointed, set([2]))
new.addPointed("test")
self.assertEqual(new.Pointed, set([2,"test"]))
new.addPointed(2)
self.assertEqual(new.Pointed, set([2,"test"]))
def test_removePointed(self):
Ids = "idNodeTest"
content= {1:2,"2":3}
new = Requirements.node(Ids,content)
new.addPointed(2)
self.assertEqual(new.Pointed, set([2]))
new.removePointed("test")
# Remove non existing node shall not do anything
self.assertEqual(new.Pointed, set([2]))
new.addPointed("test")
new.removePointed(2)
self.assertEqual(new.Pointed, set(["test"]))
def test_removePointing(self):
Ids = "idNodeTest"
content= {1:2,"2":3}
new = Requirements.node(Ids,content)
new.addPointing(2)
self.assertEqual(new.Pointing, set([2]))
new.removePointing("test")
# Remove non existing node shall not do anything
self.assertEqual(new.Pointing, set([2]))
new.addPointing("test")
new.removePointing(2)
self.assertEqual(new.Pointing, set(["test"]))
def test_Parents(self):
Ids = "idNodeTest"
content= {1:2,"2":3}
new = Requirements.node(Ids,content)
new.addParent(2)
self.assertEqual(new.Parents, set([2]))
new.removeParent("test")
# Remove non existing node shall not do anything
self.assertEqual(new.Parents, set([2]))
new.addParent("test")
new.removeParent(2)
self.assertEqual(new.Parents, set(["test"]))
def test_Childs(self):
Ids = "idNodeTest"
content= {1:2,"2":3}
new = Requirements.node(Ids,content)
new.addChild(2)
self.assertEqual(new.Childs, set([2]))
new.removeChild("test")
# Remove non existing node shall not do anything
self.assertEqual(new.Childs, set([2]))
new.addChild("test")
new.removeChild(2)
self.assertEqual(new.Childs, set(["test"]))
def test_string(self):
# make sure the shuffled sequence does not lose any elements
Idname = "idNodeTest"
content= {1:2,"2":3}
new = Requirements.node(Idname,content)
self.assertEqual(new.getDir(), "idNodeTest")
self.assertEqual(new.writeNode(), 'idNodeTest [1="2" 2="3" ];')
new.addParent(2)
self.assertEqual(new.getDir(), "2:idNodeTest")
self.assertEqual(new.writeNode(), "")
class TestNodesContainer(unittest.TestCase):
def setUp(self):
self.container = Requirements.nodesContainer()
def test_loadNodes(self):
dummyContent="Dummy"
for Id in range(100):
self.container.addNode(Id,dummyContent)
self.assertEqual(len(self.container.getNodesArray()), 100)
def test_loadRelations(self):
# node 0 pitns nobody, node pints node 0, node 2 point node 0 and 1 .....
for fromId in range(100):
for toID in range(fromId):
self.container.addRelation(fromId,toID)
self.assertEqual(self.container.getNode(50).Pointing, set(map(str,range(50))))
self.assertEqual(self.container.getNode(0).Pointed, set(map(str,range(1,100))))
def test_removeRelation(self):
for fromId in range(100):
for toID in range(fromId):
self.container.addRelation(fromId,toID)
self.container.removeRelation(50,0)
self.assertEqual(self.container.getNode(50).Pointing, set(map(str,range(1,50))))
final = range(1,100)
final.remove(50)
self.assertEqual(self.container.getNode(0).Pointed, set(map(str,final) ))
def test_parentship(self):
parent = 2
for fromId in range(100):
self.container.addParentship(fromId,parent)
self.assertEqual(self.container.getNode(2).Childs,set(map(str,range(100))))
def test_nodesfiltering(self):
dummyContent="Dummy"
for Id in range(100):
self.container.addNode(Id,dummyContent)
subset = self.container.getSetOfNodes("^11$")
self.assertEqual(subset, ["11"])
class TestRelationsParser(unittest.TestCase):
def setUp(self):
pass
def test_parseline(self):
# make sure the shuffled sequence does not lose any elements
filename = ""
Relations = Requirements.relationsParser(filename)
Relations.parseLine(" hola -> adios ")
self.assertEqual(Relations.relations , [["hola","adios"]])
Relations.parseLine(" hola <- adios ")
Relations.parseLine("")
self.assertEqual(Relations.relations , [["hola","adios"]])
Relations.parseLine(" a->b ")
self.assertEqual(Relations.relations , [["hola","adios"],["a","b"]])
def test_parseFile(self):
filename = "links.txt"
Relations = Requirements.relationsParser(filename)
Relations.parseFile()
self.assertEqual(Relations.relations , [["hola","adios"],["a","b"]])
def test_loadCOnatiner(self):
filename = "links.txt"
Relations = Requirements.relationsParser(filename)
Relations.parseFile()
container = Requirements.nodesContainer()
Relations.loadNodeContainer(container)
Nodes = container.getNodesArray()
self.assertEqual(Nodes , ["a","adios","b","hola"])
class TestNodesParser(unittest.TestCase):
def setUp(self):
pass
def test_parseline(self):
# make sure the shuffled sequence does not lose any elements
filename = ""
Relations = Requirements.nodesParser(filename)
Relations.parseLine(" # UR-20 : TO do something fine ")
self.assertEqual(Relations.Nodes , {"UR-20":"TO do something fine"})
Relations.parseLine(" hola <- adios ")
Relations.parseLine("")
self.assertEqual(Relations.Nodes , {"UR-20":"TO do something fine"})
def test_parseFile(self):
filename = "nodes.txt"
Relations = Requirements.nodesParser(filename)
Relations.parseFile()
self.assertEqual(Relations.Nodes , {"UR-10" : "Hello", "UR-20" : "TO do something fine"})
def test_loadCOnatiner(self):
pass
class TestdotGenerator(unittest.TestCase):
def setUp(self):
filenameNodes = "nodes_1.txt"
filenameLinks = "links_1.txt"
Nodes = Requirements.nodesParser(filenameNodes)
Nodes.parseFile()
Relations = Requirements.relationsParser(filenameLinks)
Relations.parseFile()
self.container = Requirements.nodesContainer()
Nodes.loadNodeContainer(self.container)
Relations.loadNodeContainer(self.container)
def test_load_File(self):
# make sure the shuffled sequence does not lose any elements
filename= "out.dot"
dot = Requirements.dotGenerator(self.container, filename)
dot.loadFile()
class TestTableGenerator(unittest.TestCase):
def setUp(self):
filenameNodes = "nodes_1.txt"
filenameLinks = "links_1.txt"
Nodes = Requirements.nodesParser(filenameNodes)
Nodes.parseFile()
Relations = Requirements.relationsParser(filenameLinks)
Relations.parseFile()
self.container = Requirements.nodesContainer()
Nodes.loadNodeContainer(self.container)
Relations.loadNodeContainer(self.container)
def test_load_File(self):
# make sure the shuffled sequence does not lose any elements
filename= "out.html"
dot = Requirements.tableGenerator(self.container, filename)
dot.loadFile()
if __name__ == '__main__':
unittest.main(verbosity=1)