-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathtest.py
More file actions
336 lines (261 loc) · 9.67 KB
/
test.py
File metadata and controls
336 lines (261 loc) · 9.67 KB
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
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
import unittest
import copy
import property_tree as ptree
class TestTree(unittest.TestCase):
def test_keyword_constructor(self):
pt = ptree.Tree(key1="data1",
key2="data2",
key3="data3",
key4="data4")
self.assertEqual(pt.key1, "data1")
self.assertEqual(pt.key2, "data2")
self.assertEqual(pt.key3, "data3")
self.assertEqual(pt.key4, "data4")
def test_insertions(self):
pt = ptree.Tree()
tmp1 = ptree.Tree("data1")
tmp2 = ptree.Tree("data2")
tmp3 = ptree.Tree("data3")
tmp4 = ptree.Tree("data4")
it1 = pt.add("key1", tmp1)
it2 = pt.insert(pt.index("key1"), "key2", tmp2)
it3 = it1.put("key3", tmp3)
it4 = it1.append("key4", tmp4)
it2 += it1
self.assertEqual(pt.get("key1", ""), "data1")
self.assertEqual(pt.get("key2", ""), "data2")
self.assertEqual(pt.get("key1.key3", ""), "data3")
self.assertEqual(pt.get("key1.key4", ""), "data4")
self.assertEqual(pt.get("key2.key3", ""), "data3")
self.assertEqual(pt.get("key2.key4", ""), "data4")
## __getattribute__
self.assertEqual(pt.key1, "data1")
self.assertEqual(pt.key2, "data2")
self.assertEqual(pt.key1.key3, "data3")
self.assertEqual(pt.key1.key4, "data4")
self.assertEqual(pt.key2.key3, "data3")
self.assertEqual(pt.key2.key4, "data4")
def test_erasing(self):
pt = ptree.Tree()
tmp1 = ptree.Tree("data1")
tmp2 = ptree.Tree("data2")
tmp3 = ptree.Tree("data3")
tmp4 = ptree.Tree("data4")
it1 = pt.add("key1", tmp1)
it2 = pt.insert(pt.index("key1"), "key2", tmp2)
it1.append("key", tmp3)
it1.insert(0, "key", tmp4)
it2.extend(it1.items())
# Test single erase
n = pt.erase("key1")
self.assertEqual(n, 1)
# Test multiple erase
n = it2.erase("key")
self.assertEqual(n, 2)
# Test one more erase
n = pt.erase("key2")
self.assertEqual(n, 1)
def test_clear(self):
# Do insertions
pt = ptree.Tree("data")
pt.append("key", ptree.Tree("data"))
# Test clear
pt.clear()
self.assertTrue(pt.empty())
self.assertEqual(pt.value, '')
def test_insert(self):
pt = ptree.Tree()
tmp1 = ptree.Tree("data1")
tmp2 = ptree.Tree("data2")
tmp3 = ptree.Tree("data3")
tmp4 = ptree.Tree("data4")
pt.insert(-1, "key3", tmp3)
pt.insert(0, "key2", tmp2)
pt.insert(-1, "key4", tmp4)
pt.insert(0, "key1", tmp1)
# Check sequence
keys = pt.keys()
self.assertEqual(keys[0], "key1")
self.assertEqual(keys[1], "key2")
self.assertEqual(keys[2], "key3")
self.assertEqual(keys[3], "key4")
# Test pops
pt.popitem()
self.assertEqual(pt[0], "data1")
self.assertEqual(pt[-1], "data3")
pt.popitem(0)
self.assertEqual(pt[0], "data2")
self.assertEqual(pt[-1], "data3")
pt.popitem(-1)
self.assertEqual(pt[0], "data2")
self.assertEqual(pt[-1], "data2")
pt.popitem(0)
self.assertTrue(pt.empty())
def test_comparison(self):
# Prepare original
pt_orig = ptree.Tree("data")
pt_orig.put("key1", "data1")
pt_orig.put("key1.key3", "data2")
pt_orig.put("key1.key4", "data3")
pt_orig.put("key2", "data4")
pt1 = ptree.Tree(pt_orig)
pt2 = ptree.Tree(pt_orig)
self.assertEqual(pt1, pt2)
self.assertEqual(pt2, pt1)
# Test originals with modified case
pt1 = ptree.Tree(pt_orig)
pt2 = ptree.Tree(pt_orig)
pt1.popitem()
pt1.put("KEY2", ptree.Tree("data4"))
self.assertNotEqual(pt1, pt2)
self.assertNotEqual(pt2, pt1)
# Test modified copies (both modified the same way)
pt1 = copy.copy(pt_orig)
pt2 = copy.copy(pt_orig)
pt1.setdefault("key1.key5")
pt2.setdefault("key1.key5", ptree.Tree("none"))
self.assertEqual(pt1, pt2)
self.assertEqual(pt2, pt1)
# Test modified copies (modified root data)
pt1 = copy.copy(pt_orig)
pt2 = copy.copy(pt_orig)
pt1.value = "a"
pt2.value = "b"
self.assertNotEqual(pt1, pt2)
self.assertNotEqual(pt2, pt1)
# Test modified copies (added subkeys with different data)
pt1 = copy.copy(pt_orig)
pt2 = copy.copy(pt_orig)
pt1.put("key1.key5", ptree.Tree("a"))
pt2.put("key1.key5", ptree.Tree("b"))
self.assertNotEqual(pt1, pt2)
self.assertNotEqual(pt2, pt1)
# Test modified copies (added subkeys with different keys)
pt1 = copy.copy(pt_orig)
pt2 = copy.copy(pt_orig)
pt1.put("key1.key5", ptree.Tree(""))
pt2.put("key1.key6", ptree.Tree(""))
self.assertNotEqual(pt1, pt2)
self.assertNotEqual(pt2, pt1)
# Test modified copies (added subkey to only one copy)
pt1 = copy.copy(pt_orig)
pt2 = copy.copy(pt_orig)
pt1.put("key1.key5", ptree.Tree(""))
self.assertNotEqual(pt1, pt2)
self.assertNotEqual(pt2, pt1)
def test_get_set(self):
# Do insertions
pt = ptree.Tree()
pt.put("k1", 1)
pt.put("k2.k", 2.5)
pt.put("k3.k.k", "ala ma kota")
pt.put("k5.k.k.f", False)
pt.put("k5.k.k.t", True)
pt.setdefault("k5.k.k.n")
# Do extractions via get
self.assertEqual(pt.get("k1"), 1)
self.assertEqual(pt.get("k2.k"), 2.5)
self.assertEqual(pt.get("k3.k.k"), "ala ma kota")
self.assertEqual(pt.get("k5.k.k.f"), False)
self.assertEqual(pt.get("k5.k.k.t"), True)
self.assertEqual(pt.get("k5.k.k.n"), None)
self.assertEqual(pt.get("k5.k.k.n"), ptree.Tree(None))
self.assertRaises(ptree.BadPathError, pt.get, "non.existent.path")
def test_get_set_attribute(self):
pt = ptree.Tree()
# __setattribute__
pt.k = 1
pt.k.k = 2.5
pt.k.k.k = "ala ma kota"
pt.k.k.k.f = False
pt.k.k.k.t = True
pt.k.k.k.n = None
# __getattribute__
self.assertEqual(pt.k, 1)
self.assertEqual(pt.k.k, 2.5)
self.assertEqual(pt.k.k.k, "ala ma kota")
self.assertEqual(pt.k.k.k.f, False)
self.assertEqual(pt.k.k.k.t, True)
self.assertEqual(pt.k.k.k.n, None)
self.assertEqual(pt.k.k.k.n, ptree.Tree(None))
with self.assertRaises(AttributeError):
pt.non.existent.path
def test_count(self):
pt = ptree.Tree()
pt.add("k1", ptree.Tree())
pt.add("k2", ptree.Tree())
pt.add("k1", ptree.Tree())
pt.add("k3", ptree.Tree())
pt.add("k1", ptree.Tree())
pt.add("k2", ptree.Tree())
self.assertEqual(pt.count("k1"), 3)
self.assertEqual(pt.count("k2"), 2)
self.assertEqual(pt.count("k3"), 1)
def test_search(self):
pt = ptree.Tree()
pt.add("k1", ptree.Tree())
pt.add("k2", ptree.Tree())
pt.add("k1", ptree.Tree())
pt.add("k3", ptree.Tree())
pt.add("k1", ptree.Tree())
pt.add("k2", ptree.Tree())
self.assertEqual(sum(1 for i in pt.search("k1")), 3)
self.assertEqual(sum(1 for i in pt.search("k2")), 2)
self.assertEqual(sum(1 for i in pt.search("k3")), 1)
def test_ptree_bad_data(self):
pt = ptree.Tree("non-convertible string")
self.assertRaises(ptree.BadDataError, int, pt)
self.assertRaises(ptree.BadDataError, float, pt)
self.assertRaises(ptree.BadDataError, bool, pt)
def test_bool(self):
pt = ptree.Tree()
pt.add("bool.false", "false")
pt.add("bool.false", False)
pt.add("bool.false", "0")
pt.add("bool.false", 0)
pt.add("bool.true", "true")
pt.add("bool.true", True)
pt.add("bool.true", "1")
pt.add("bool.true", 1)
pt.add("bool.invalid", "")
pt.add("bool.invalid", "tt")
pt.add("bool.invalid", "ff")
pt.add("bool.invalid", 2)
pt.add("bool.invalid", -1)
for k, v in pt.bool.search("false"):
self.assertEqual(v, False)
for k, v in pt.bool.search("true"):
self.assertEqual(v, True)
for k, v in pt.bool.search("invalid"):
with self.assertRaises(ptree.BadDataError):
v == True
with self.assertRaises(ptree.BadDataError):
v == False
def test_sort(self):
pt = ptree.Tree()
pt.put("one", "1")
pt.put("two", "2")
pt.put("three", "3")
pt.put("four", "4")
# sort by key
pt.sort()
self.assertEqual(pt.index("four"), 0)
self.assertEqual(pt[0], 4)
self.assertEqual(pt.index("one"), 1)
self.assertEqual(pt[1], 1)
self.assertEqual(pt.index("three"), 2)
self.assertEqual(pt[2], 3)
self.assertEqual(pt.index("two"), 3)
self.assertEqual(pt[3], 2)
# sort by value
pt.sort(lambda lhs, rhs: int(lhs[1]) < int(rhs[1]))
self.assertEqual(pt.index("one"), 0)
self.assertEqual(pt[0], 1)
self.assertEqual(pt.index("two"), 1)
self.assertEqual(pt[1], 2)
self.assertEqual(pt.index("three"), 2)
self.assertEqual(pt[2], 3)
self.assertEqual(pt.index("four"), 3)
self.assertEqual(pt[3], 4)
if __name__ == '__main__':
unittest.main()