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
|
# Copyright (C) 2006, 2007 Canonical Ltd
#
# 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
"""Tests for the generic Tree.walkdirs interface."""
from bzrlib.tests.tree_implementations import TestCaseWithTree
class TestWalkdirs(TestCaseWithTree):
def get_all_subdirs_expected(self, tree):
return [
(('', tree.path2id('')),
[
('0file', '0file', 'file', None, '2file', 'file'),
('1top-dir', '1top-dir', 'directory', None, '1top-dir', 'directory'),
(u'2utf\u1234file', u'2utf\u1234file', 'file', None,
u'0utf\u1234file'.encode('utf8'), 'file'),
('symlink', 'symlink', 'symlink', None, 'symlink', 'symlink')
]),
(('1top-dir', '1top-dir'),
[('1top-dir/0file-in-1topdir', '0file-in-1topdir', 'file', None, '1file-in-1topdir', 'file'),
('1top-dir/1dir-in-1topdir', '1dir-in-1topdir', 'directory', None, '0dir-in-1topdir', 'directory'),
]),
(('1top-dir/1dir-in-1topdir', '0dir-in-1topdir'),
[
]),
]
def test_walkdir_root(self):
tree = self.get_tree_with_subdirs_and_all_content_types()
tree.lock_read()
expected_dirblocks = self.get_all_subdirs_expected(tree)
# test that its iterable by iterating
result = []
for dirinfo, block in tree.walkdirs():
newblock = []
for row in block:
if row[4] is not None:
newblock.append(row[0:3] + (None,) + row[4:])
else:
newblock.append(row)
result.append((dirinfo, newblock))
tree.unlock()
# check each return value for debugging ease.
for pos, item in enumerate(expected_dirblocks):
self.assertEqual(item, result[pos])
self.assertEqual(len(expected_dirblocks), len(result))
def test_walkdir_subtree(self):
tree = self.get_tree_with_subdirs_and_all_content_types()
# test that its iterable by iterating
result = []
tree.lock_read()
expected_dirblocks = self.get_all_subdirs_expected(tree)[1:]
for dirinfo, block in tree.walkdirs('1top-dir'):
newblock = []
for row in block:
if row[4] is not None:
newblock.append(row[0:3] + (None,) + row[4:])
else:
newblock.append(row)
result.append((dirinfo, newblock))
tree.unlock()
# check each return value for debugging ease.
for pos, item in enumerate(expected_dirblocks):
self.assertEqual(item, result[pos])
self.assertEqual(len(expected_dirblocks), len(result))
|