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) 2005 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
"""RevisionTree - a Tree implementation backed by repository data for a revision."""
from cStringIO import StringIO
from bzrlib.tree import Tree
class RevisionTree(Tree):
"""Tree viewing a previous revision.
File text can be retrieved from the text store.
TODO: Some kind of `__repr__` method, but a good one
probably means knowing the branch and revision number,
or at least passing a description to the constructor.
"""
def __init__(self, branch, inv, revision_id):
# for compatability the 'branch' parameter has not been renamed to
# repository at this point. However, we should change RevisionTree's
# construction to always be via Repository and not via direct
# construction - this will mean that we can change the constructor
# with much less chance of breaking client code.
self._repository = branch
self._weave_store = branch.weave_store
self._inventory = inv
self._revision_id = revision_id
def get_parent_ids(self):
"""See Tree.get_parent_ids.
A RevisionTree's parents match the revision graph.
"""
parent_ids = self._repository.get_revision(self._revision_id).parent_ids
return parent_ids
def get_revision_id(self):
"""Return the revision id associated with this tree."""
return self._revision_id
def get_weave(self, file_id):
return self._weave_store.get_weave(file_id,
self._repository.get_transaction())
def get_file_lines(self, file_id):
ie = self._inventory[file_id]
weave = self.get_weave(file_id)
return weave.get_lines(ie.revision)
def get_file_text(self, file_id):
return ''.join(self.get_file_lines(file_id))
def get_file(self, file_id):
return StringIO(self.get_file_text(file_id))
def get_file_size(self, file_id):
return self._inventory[file_id].text_size
def get_file_sha1(self, file_id, path=None):
ie = self._inventory[file_id]
if ie.kind == "file":
return ie.text_sha1
return None
def get_file_mtime(self, file_id, path=None):
ie = self._inventory[file_id]
revision = self._repository.get_revision(ie.revision)
return revision.timestamp
def is_executable(self, file_id, path=None):
ie = self._inventory[file_id]
if ie.kind != "file":
return None
return self._inventory[file_id].executable
def has_filename(self, filename):
return bool(self.inventory.path2id(filename))
def list_files(self):
# The only files returned by this are those from the version
entries = self.inventory.iter_entries()
# skip the root for compatability with the current apis.
entries.next()
for path, entry in entries:
yield path, 'V', entry.kind, entry.file_id, entry
def get_symlink_target(self, file_id):
ie = self._inventory[file_id]
return ie.symlink_target;
def kind(self, file_id):
return self._inventory[file_id].kind
def lock_read(self):
self._repository.lock_read()
def unlock(self):
self._repository.unlock()
|