1
# Copyright (C) 2005, 2007 Canonical Ltd
3
# This program is free software; you can redistribute it and/or modify
4
# it under the terms of the GNU General Public License as published by
5
# the Free Software Foundation; either version 2 of the License, or
6
# (at your option) any later version.
8
# This program is distributed in the hope that it will be useful,
9
# but WITHOUT ANY WARRANTY; without even the implied warranty of
10
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
11
# GNU General Public License for more details.
13
# You should have received a copy of the GNU General Public License
14
# along with this program; if not, write to the Free Software
15
# Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
17
"""RevisionTree - a Tree implementation backed by repository data for a revision."""
19
from cStringIO import StringIO
27
from bzrlib.tree import Tree
30
class RevisionTree(Tree):
31
"""Tree viewing a previous revision.
33
File text can be retrieved from the text store.
36
def __init__(self, branch, inv, revision_id):
37
# for compatability the 'branch' parameter has not been renamed to
38
# repository at this point. However, we should change RevisionTree's
39
# construction to always be via Repository and not via direct
40
# construction - this will mean that we can change the constructor
41
# with much less chance of breaking client code.
42
self._repository = branch
44
self._revision_id = revision_id
45
self._rules_searcher = None
47
def supports_tree_reference(self):
50
def get_parent_ids(self):
51
"""See Tree.get_parent_ids.
53
A RevisionTree's parents match the revision graph.
55
if self._revision_id in (None, revision.NULL_REVISION):
58
parent_ids = self._repository.get_revision(
59
self._revision_id).parent_ids
62
def get_revision_id(self):
63
"""Return the revision id associated with this tree."""
64
return self._revision_id
66
def get_file_text(self, file_id, path=None):
67
return list(self.iter_files_bytes([(file_id, None)]))[0][1]
69
def get_file(self, file_id, path=None):
70
return StringIO(self.get_file_text(file_id))
72
def iter_files_bytes(self, desired_files):
73
"""See Tree.iter_files_bytes.
75
This version is implemented on top of Repository.extract_files_bytes"""
76
repo_desired_files = [(f, self.inventory[f].revision, i)
77
for f, i in desired_files]
79
for result in self._repository.iter_files_bytes(repo_desired_files):
81
except errors.RevisionNotPresent, e:
82
raise errors.NoSuchFile(e.revision_id)
84
def annotate_iter(self, file_id,
85
default_revision=revision.CURRENT_REVISION):
86
"""See Tree.annotate_iter"""
87
text_key = (file_id, self.inventory[file_id].revision)
88
annotations = self._repository.texts.annotate(text_key)
89
return [(key[-1], line) for key, line in annotations]
91
def get_file_size(self, file_id):
92
"""See Tree.get_file_size"""
93
return self._inventory[file_id].text_size
95
def get_file_sha1(self, file_id, path=None, stat_value=None):
96
ie = self._inventory[file_id]
101
def get_file_mtime(self, file_id, path=None):
102
ie = self._inventory[file_id]
103
revision = self._repository.get_revision(ie.revision)
104
return revision.timestamp
106
def is_executable(self, file_id, path=None):
107
ie = self._inventory[file_id]
108
if ie.kind != "file":
112
def has_filename(self, filename):
113
return bool(self.inventory.path2id(filename))
115
def list_files(self, include_root=False):
116
# The only files returned by this are those from the version
117
entries = self.inventory.iter_entries()
118
# skip the root for compatability with the current apis.
119
if self.inventory.root is not None and not include_root:
120
# skip the root for compatability with the current apis.
122
for path, entry in entries:
123
yield path, 'V', entry.kind, entry.file_id, entry
125
def get_symlink_target(self, file_id):
126
ie = self._inventory[file_id]
127
return ie.symlink_target;
129
def get_reference_revision(self, file_id, path=None):
130
return self.inventory[file_id].reference_revision
132
def get_root_id(self):
133
if self.inventory.root:
134
return self.inventory.root.file_id
136
def kind(self, file_id):
137
return self._inventory[file_id].kind
139
def path_content_summary(self, path):
140
"""See Tree.path_content_summary."""
141
id = self.inventory.path2id(path)
143
return ('missing', None, None, None)
144
entry = self._inventory[id]
147
return (kind, entry.text_size, entry.executable, entry.text_sha1)
148
elif kind == 'symlink':
149
return (kind, None, None, entry.symlink_target)
151
return (kind, None, None, None)
153
def _comparison_data(self, entry, path):
155
return None, False, None
156
return entry.kind, entry.executable, None
158
def _file_size(self, entry, stat_value):
159
return entry.text_size
161
def _get_ancestors(self, default_revision):
162
return set(self._repository.get_ancestry(self._revision_id,
166
self._repository.lock_read()
169
return '<%s instance at %x, rev_id=%r>' % (
170
self.__class__.__name__, id(self), self._revision_id)
173
self._repository.unlock()
175
def walkdirs(self, prefix=""):
176
_directory = 'directory'
178
top_id = inv.path2id(prefix)
182
pending = [(prefix, '', _directory, None, top_id, None)]
185
currentdir = pending.pop()
186
# 0 - relpath, 1- basename, 2- kind, 3- stat, id, v-kind
188
relroot = currentdir[0] + '/'
191
# FIXME: stash the node in pending
192
entry = inv[currentdir[4]]
193
for name, child in entry.sorted_children():
194
toppath = relroot + name
195
dirblock.append((toppath, name, child.kind, None,
196
child.file_id, child.kind
198
yield (currentdir[0], entry.file_id), dirblock
199
# push the user specified dirs from dirblock
200
for dir in reversed(dirblock):
201
if dir[2] == _directory:
204
def _get_rules_searcher(self, default_searcher):
205
"""See Tree._get_rules_searcher."""
206
if self._rules_searcher is None:
207
self._rules_searcher = super(RevisionTree,
208
self)._get_rules_searcher(default_searcher)
209
return self._rules_searcher
added
removed
bzrlib/revisiontree.py
