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
|
# Copyright (C) 2003 Andrey Lebedev <andrey@micro.lt>
#
# This program is free software; you can redistribute it and/or modify
# it under the terms of the GNU General Public License as published by
# the Free Software Foundation; either version 2 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 General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with this program; if not, write to the Free Software
# Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
#
# $Id: test_password_tree.py,v 1.10 2004/02/28 18:45:20 kedder Exp $
import unittest
from kedpm.password_tree import PasswordTree
from kedpm.password import Password
from kedpm.exceptions import RenameError
class PasswordTreeTestCase(unittest.TestCase):
def setUp(self):
# We will form such tree here:
# root
# +-pass1
# +-pass2
# +-subdir
# +-pass3
self.ptree = PasswordTree()
self.pass1 = Password(host = "host1", name = "name1", password = "password1")
self.pass2 = Password(host = "host2", name = "name2", password = "password2")
self.ptree.addNode(self.pass1)
self.ptree.addNode(self.pass2)
self.subdir = self.ptree.addBranch("subdir")
self.pass3 = Password(host = "host3", name = "name3", password = "password3")
self.subdir.addNode(self.pass3)
def test_create(self):
assert self.ptree
def test_nodes(self):
nodes = self.ptree.getNodes()
self.assertEqual(len(nodes), 2)
self.assertEqual(nodes, [self.pass1, self.pass2])
def test_branches(self):
branches = self.ptree.getBranches()
self.assertEqual(len(branches), 1)
self.assertRaises(AttributeError, self.ptree.addBranch, 'subdir')
subdir = self.ptree['subdir']
self.assertEqual(subdir.getNodes(), [self.pass3])
def test_rename(self):
cat1 = self.ptree.getTreeFromPath(['subdir'])
self.ptree.renameBranch(['subdir'], 'renamed')
cat2 = self.ptree.getTreeFromPath(['renamed'])
self.assertEqual(cat1, cat2)
self.assertRaises(RenameError, self.ptree.renameBranch, ['renamed'], 'renamed')
def test_locate(self):
found = self.ptree.locate('name')
self.assertEqual(found, [self.pass1, self.pass2])
found = self.ptree.locate('st1')
self.assertEqual(found, [self.pass1])
found = self.ptree.locate('sword')
self.assertEqual(found, [])
# try case insensitive searching
found = self.ptree.locate('NaMe')
self.assertEqual(found, [self.pass1, self.pass2])
# Try invalid regexp
found = self.ptree.locate('[NaMe')
self.assertEqual(found, [])
def test_normalizePath(self):
testpath1 = ['dir', 'subdir', 'subsubdir']
npath = self.ptree.normalizePath(testpath1)
self.assertEqual(npath, testpath1)
npath = self.ptree.normalizePath(['dir', 'subdir', 'subsubdir', '..'])
self.assertEqual(npath, ['dir', 'subdir'])
npath = self.ptree.normalizePath(['..', 'dir', 'subdir', 'subsubdir'])
self.assertEqual(npath, testpath1)
npath = self.ptree.normalizePath(['dir', '.', 'subdir', 'subsubdir', '.'])
self.assertEqual(npath, testpath1)
def test_getTreeFromPath(self):
root = self.ptree.getTreeFromPath(['.'])
self.assertEqual(root, self.ptree)
root = self.ptree.getTreeFromPath(['..'])
self.assertEqual(root, self.ptree)
root = self.ptree.getTreeFromPath(['subdir'])
self.assertEqual(root, self.subdir)
def test_removeNode(self):
found = self.ptree.locate('st1')[0]
self.ptree.removeNode(found)
found = self.ptree.locate('st1')
self.assertEqual(found, [])
# test deletion from subtree
self.ptree.removeNode(self.pass3)
self.assertEqual(self.ptree['subdir'].getNodes(), [])
def test_flatten(self):
flat_tree = self.ptree.flatten()
nodes = flat_tree.getNodes()
self.assertEqual(len(nodes), 3)
passwords = [self.pass3, self.pass1, self.pass2]
self.assertEqual(nodes, passwords)
def test_getBranchContainingNode(self):
self.assertEqual(self.ptree.getBranchContainingNode(self.pass3), self.subdir)
self.assertEqual(self.ptree.getBranchContainingNode(self.pass1), self.ptree)
class PasswordTreeIteratorTestCase(unittest.TestCase):
def setUp(self):
# We will form such tree here:
# root
# +-br1
# +-br1.1
# +-pw0
# +-pw1
# +-pw2
# +-pw3
# +-br2
# +-br2.1
# +-pw4
# +-br2.2
# +-pw5
# +-pw6
# +-pw7
# +-pw8
# +-pw9
#
self.pwds = []
for i in range(10):
pwd = Password(host = "host%d" % i, name = "name%d" % i , password = "password%d" % i)
self.pwds.append(pwd)
ptree = PasswordTree()
br1 = ptree.addBranch('br1')
br11 = br1.addBranch('br11')
br11.addNode(self.pwds[0])
br11.addNode(self.pwds[1])
br1.addNode(self.pwds[2])
br1.addNode(self.pwds[3])
br2 = ptree.addBranch('br2')
br2.addNode(self.pwds[7])
br21 = br2.addBranch('br21')
br22 = br2.addBranch('br22')
br21.addNode(self.pwds[4])
br22.addNode(self.pwds[5])
br22.addNode(self.pwds[6])
ptree.addNode(self.pwds[8])
ptree.addNode(self.pwds[9])
self.ptree = ptree
def test_getCurrentCategory(self):
iter = self.ptree.getIterator()
pwds = {}
pwd = iter.next()
while pwd:
pwds[pwd] = iter.getCurrentCategory()
pwd = iter.next()
self.assertEqual(pwds[self.pwds[1]], ['br1', 'br11'])
self.assertEqual(pwds[self.pwds[3]], ['br1'])
self.assertEqual(pwds[self.pwds[4]], ['br2', 'br21'])
self.assertEqual(pwds[self.pwds[9]], [])
def test_order(self):
iter = self.ptree.getIterator()
pwds = []
for i in range(10):
pwds.append(iter.next())
for i in range(10):
self.assertEqual(pwds.count(self.pwds[i]), 1)
pwd = iter.next()
self.assertEqual(pwd, None)
pwd = iter.next()
self.assertEqual(pwd, None)
def suite():
l = [
unittest.makeSuite(PasswordTreeTestCase, 'test'),
unittest.makeSuite(PasswordTreeIteratorTestCase, 'test')
]
return unittest.TestSuite(l)
if __name__ == "__main__":
unittest.main()
|
