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
|
# Copyright (C) 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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
"""Test that all trees support Tree.list_files()"""
from bzrlib.tests.per_tree import TestCaseWithTree
class TestListFiles(TestCaseWithTree):
def test_list_files_with_root(self):
work_tree = self.make_branch_and_tree('wt')
tree = self.get_tree_no_parents_abc_content(work_tree)
expected = [('', 'V', 'directory', 'root-id'),
('a', 'V', 'file', 'a-id'),
('b', 'V', 'directory', 'b-id'),
('b/c', 'V', 'file', 'c-id'),
]
tree.lock_read()
try:
actual = [(path, status, kind, file_id)
for path, status, kind, file_id, ie in
tree.list_files(include_root=True)]
finally:
tree.unlock()
self.assertEqual(expected, actual)
def test_list_files_no_root(self):
work_tree = self.make_branch_and_tree('wt')
tree = self.get_tree_no_parents_abc_content(work_tree)
expected = [('a', 'V', 'file', 'a-id'),
('b', 'V', 'directory', 'b-id'),
('b/c', 'V', 'file', 'c-id'),
]
tree.lock_read()
try:
actual = [(path, status, kind, file_id)
for path, status, kind, file_id, ie in
tree.list_files()]
finally:
tree.unlock()
self.assertEqual(expected, actual)
def test_list_files_with_root_no_recurse(self):
work_tree = self.make_branch_and_tree('wt')
tree = self.get_tree_no_parents_abc_content(work_tree)
expected = [('', 'V', 'directory', 'root-id'),
('a', 'V', 'file', 'a-id'),
('b', 'V', 'directory', 'b-id'),
]
tree.lock_read()
try:
actual = [(path, status, kind, file_id)
for path, status, kind, file_id, ie in
tree.list_files(include_root=True, recursive=False)]
finally:
tree.unlock()
self.assertEqual(expected, actual)
def test_list_files_no_root_no_recurse(self):
work_tree = self.make_branch_and_tree('wt')
tree = self.get_tree_no_parents_abc_content(work_tree)
expected = [('a', 'V', 'file', 'a-id'),
('b', 'V', 'directory', 'b-id'),
]
tree.lock_read()
try:
actual = [(path, status, kind, file_id)
for path, status, kind, file_id, ie in
tree.list_files(recursive=False)]
finally:
tree.unlock()
self.assertEqual(expected, actual)
def test_list_files_from_dir(self):
work_tree = self.make_branch_and_tree('wt')
tree = self.get_tree_no_parents_abc_content(work_tree)
expected = [('c', 'V', 'file', 'c-id'),
]
tree.lock_read()
try:
actual = [(path, status, kind, file_id)
for path, status, kind, file_id, ie in
tree.list_files(from_dir='b')]
finally:
tree.unlock()
self.assertEqual(expected, actual)
def test_list_files_from_dir_no_recurse(self):
# The test trees don't have much nesting so test with an explicit root
work_tree = self.make_branch_and_tree('wt')
tree = self.get_tree_no_parents_abc_content(work_tree)
expected = [('a', 'V', 'file', 'a-id'),
('b', 'V', 'directory', 'b-id'),
]
tree.lock_read()
try:
actual = [(path, status, kind, file_id)
for path, status, kind, file_id, ie in
tree.list_files(from_dir='', recursive=False)]
finally:
tree.unlock()
self.assertEqual(expected, actual)
|