13
13
# You should have received a copy of the GNU General Public License
14
14
# along with this program; if not, write to the Free Software
15
# Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
15
# Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
17
17
"""RevisionTree - a Tree implementation backed by repository data for a revision."""
30
class RevisionTree(tree.Tree):
27
from bzrlib.tree import Tree
30
class RevisionTree(Tree):
31
31
"""Tree viewing a previous revision.
33
33
File text can be retrieved from the text store.
36
36
def __init__(self, branch, inv, revision_id):
37
# for compatability the 'branch' parameter has not been renamed to
37
# for compatability the 'branch' parameter has not been renamed to
38
38
# repository at this point. However, we should change RevisionTree's
39
# construction to always be via Repository and not via direct
39
# construction to always be via Repository and not via direct
40
40
# construction - this will mean that we can change the constructor
41
41
# with much less chance of breaking client code.
42
42
self._repository = branch
59
58
parent_ids = self._repository.get_revision(
60
59
self._revision_id).parent_ids
63
62
def get_revision_id(self):
64
63
"""Return the revision id associated with this tree."""
65
64
return self._revision_id
67
66
def get_file_text(self, file_id, path=None):
68
_, content = list(self.iter_files_bytes([(file_id, None)]))[0]
69
return ''.join(content)
67
return list(self.iter_files_bytes([(file_id, None)]))[0][1]
71
69
def get_file(self, file_id, path=None):
72
70
return StringIO(self.get_file_text(file_id))
87
85
default_revision=revision.CURRENT_REVISION):
88
86
"""See Tree.annotate_iter"""
89
87
text_key = (file_id, self.inventory[file_id].revision)
90
annotator = self._repository.texts.get_annotator()
91
annotations = annotator.annotate_flat(text_key)
88
annotations = self._repository.texts.annotate(text_key)
92
89
return [(key[-1], line) for key, line in annotations]
94
91
def get_file_size(self, file_id):
104
101
def get_file_mtime(self, file_id, path=None):
105
102
ie = self._inventory[file_id]
107
revision = self._repository.get_revision(ie.revision)
108
except errors.NoSuchRevision:
109
raise errors.FileTimestampUnavailable(self.id2path(file_id))
103
revision = self._repository.get_revision(ie.revision)
110
104
return revision.timestamp
112
106
def is_executable(self, file_id, path=None):
118
112
def has_filename(self, filename):
119
113
return bool(self.inventory.path2id(filename))
121
def list_files(self, include_root=False, from_dir=None, recursive=True):
115
def list_files(self, include_root=False):
122
116
# The only files returned by this are those from the version
127
from_dir_id = inv.path2id(from_dir)
128
if from_dir_id is None:
129
# Directory not versioned
131
entries = inv.iter_entries(from_dir=from_dir_id, recursive=recursive)
132
if inv.root is not None and not include_root and from_dir is None:
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:
133
120
# skip the root for compatability with the current apis.
135
122
for path, entry in entries:
221
207
self._rules_searcher = super(RevisionTree,
222
208
self)._get_rules_searcher(default_searcher)
223
209
return self._rules_searcher
226
class InterCHKRevisionTree(tree.InterTree):
227
"""Fast path optimiser for RevisionTrees with CHK inventories."""
230
def is_compatible(source, target):
231
if (isinstance(source, RevisionTree)
232
and isinstance(target, RevisionTree)):
234
# Only CHK inventories have id_to_entry attribute
235
source.inventory.id_to_entry
236
target.inventory.id_to_entry
238
except AttributeError:
242
def iter_changes(self, include_unchanged=False,
243
specific_files=None, pb=None, extra_trees=[],
244
require_versioned=True, want_unversioned=False):
245
lookup_trees = [self.source]
247
lookup_trees.extend(extra_trees)
248
# The ids of items we need to examine to insure delta consistency.
249
precise_file_ids = set()
250
discarded_changes = {}
251
if specific_files == []:
252
specific_file_ids = []
254
specific_file_ids = self.target.paths2ids(specific_files,
255
lookup_trees, require_versioned=require_versioned)
256
# FIXME: It should be possible to delegate include_unchanged handling
257
# to CHKInventory.iter_changes and do a better job there -- vila
259
changed_file_ids = set()
260
for result in self.target.inventory.iter_changes(self.source.inventory):
261
if specific_file_ids is not None:
263
if file_id not in specific_file_ids:
264
# A change from the whole tree that we don't want to show yet.
265
# We may find that we need to show it for delta consistency, so
267
discarded_changes[result[0]] = result
269
new_parent_id = result[4][1]
270
precise_file_ids.add(new_parent_id)
272
changed_file_ids.add(result[0])
273
if specific_file_ids is not None:
274
for result in self._handle_precise_ids(precise_file_ids,
275
changed_file_ids, discarded_changes=discarded_changes):
277
if include_unchanged:
278
# CHKMap avoid being O(tree), so we go to O(tree) only if
280
# Now walk the whole inventory, excluding the already yielded
282
changed_file_ids = set(changed_file_ids)
283
for relpath, entry in self.target.inventory.iter_entries():
284
if (specific_file_ids is not None
285
and not entry.file_id in specific_file_ids):
287
if not entry.file_id in changed_file_ids:
288
yield (entry.file_id,
289
(relpath, relpath), # Not renamed
290
False, # Not modified
291
(True, True), # Still versioned
292
(entry.parent_id, entry.parent_id),
293
(entry.name, entry.name),
294
(entry.kind, entry.kind),
295
(entry.executable, entry.executable))
298
tree.InterTree.register_optimiser(InterCHKRevisionTree)