116
61
def has_id(self, file_id):
117
62
return self.inventory.has_id(file_id)
119
__contains__ = has_id
121
def has_or_had_id(self, file_id):
122
if file_id == self.inventory.root.file_id:
124
return self.inventory.has_id(file_id)
127
return iter(self.inventory)
65
"""Return set of all ids in this tree."""
66
return self.inventory.id_set()
129
68
def id2path(self, file_id):
130
69
return self.inventory.id2path(file_id)
132
def is_control_filename(self, filename):
133
"""True if filename is the name of a control file in this tree.
135
:param filename: A filename within the tree. This is a relative path
136
from the root of this tree.
138
This is true IF and ONLY IF the filename is part of the meta data
139
that bzr controls in this tree. I.E. a random .bzr directory placed
140
on disk will not be a control file for this tree.
142
return self.bzrdir.is_control_filename(filename)
144
def iter_entries_by_dir(self):
145
"""Walk the tree in 'by_dir' order.
147
This will yield each entry in the tree as a (path, entry) tuple. The
148
order that they are yielded is: the contents of a directory are
149
preceeded by the parent of a directory, and all the contents of a
150
directory are grouped together.
152
return self.inventory.iter_entries_by_dir()
154
def kind(self, file_id):
155
raise NotImplementedError("subclasses must implement kind")
157
def _comparison_data(self, entry, path):
158
"""Return a tuple of kind, executable, stat_value for a file.
160
entry may be None if there is no inventory entry for the file, but
161
path must always be supplied.
163
kind is None if there is no file present (even if an inventory id is
164
present). executable is False for non-file entries.
166
raise NotImplementedError(self._comparison_data)
168
def _file_size(entry, stat_value):
169
raise NotImplementedError(self._file_size)
171
71
def _get_inventory(self):
172
72
return self._inventory
174
def get_file(self, file_id):
175
"""Return a file object for the file file_id in the tree."""
176
raise NotImplementedError(self.get_file)
178
def get_file_by_path(self, path):
179
return self.get_file(self._inventory.path2id(path))
181
def annotate_iter(self, file_id):
182
"""Return an iterator of revision_id, line tuples
184
For working trees (and mutable trees in general), the special
185
revision_id 'current:' will be used for lines that are new in this
186
tree, e.g. uncommitted changes.
187
:param file_id: The file to produce an annotated version from
189
raise NotImplementedError(self.annotate_iter)
191
74
inventory = property(_get_inventory,
192
75
doc="Inventory of this Tree")
194
77
def _check_retrieved(self, ie, f):
197
78
fp = fingerprint_file(f)
200
if ie.text_size is not None:
81
if ie.text_size != None:
201
82
if ie.text_size != fp['size']:
202
raise BzrError("mismatched size for file %r in %r" % (ie.file_id, self._store),
83
bailout("mismatched size for file %r in %r" % (ie.file_id, self._store),
203
84
["inventory expects %d bytes" % ie.text_size,
204
85
"file is actually %d bytes" % fp['size'],
205
86
"store is probably damaged/corrupt"])
207
88
if ie.text_sha1 != fp['sha1']:
208
raise BzrError("wrong SHA-1 for file %r in %r" % (ie.file_id, self._store),
89
bailout("wrong SHA-1 for file %r in %r" % (ie.file_id, self._store),
209
90
["inventory expects %s" % ie.text_sha1,
210
91
"file is actually %s" % fp['sha1'],
211
92
"store is probably damaged/corrupt"])
213
def path2id(self, path):
214
"""Return the id for path in this tree."""
215
return self._inventory.path2id(path)
217
def print_file(self, file_id):
218
"""Print file with id `file_id` to stdout."""
95
def print_file(self, fileid):
96
"""Print file with id `fileid` to stdout."""
220
sys.stdout.write(self.get_file_text(file_id))
98
pumpfile(self.get_file(fileid), sys.stdout)
101
def export(self, dest):
102
"""Export this tree to a new directory.
104
`dest` should not exist, and will be created holding the
105
contents of this tree.
107
TODO: To handle subdirectories we need to create the
110
:note: If the export fails, the destination directory will be
111
left in a half-assed state.
114
mutter('export version %r' % self)
116
for dp, ie in inv.iter_entries():
118
fullpath = appendpath(dest, dp)
119
if kind == 'directory':
122
pumpfile(self.get_file(ie.file_id), file(fullpath, 'wb'))
124
bailout("don't know how to export {%s} of kind %r" % (fid, kind))
125
mutter(" export {%s} kind %s to %s" % (ie.file_id, kind, fullpath))
129
class WorkingTree(Tree):
130
"""Working copy tree.
132
The inventory is held in the `Branch` working-inventory, and the
133
files are in a directory on disk.
135
It is possible for a `WorkingTree` to have a filename which is
136
not listed in the Inventory and vice versa.
138
def __init__(self, basedir, inv):
139
self._inventory = inv
140
self.basedir = basedir
141
self.path2id = inv.path2id
144
return "<%s of %s>" % (self.__class__.__name__,
147
def abspath(self, filename):
148
return os.path.join(self.basedir, filename)
150
def has_filename(self, filename):
151
return os.path.exists(self.abspath(filename))
153
def get_file(self, file_id):
154
return self.get_file_byname(self.id2path(file_id))
156
def get_file_byname(self, filename):
157
return file(self.abspath(filename), 'rb')
159
def _get_store_filename(self, file_id):
160
## XXX: badly named; this isn't in the store at all
161
return self.abspath(self.id2path(file_id))
163
def has_id(self, file_id):
164
# files that have been deleted are excluded
165
if not self.inventory.has_id(file_id):
167
return os.access(self.abspath(self.inventory.id2path(file_id)), os.F_OK)
169
def get_file_size(self, file_id):
170
return os.stat(self._get_store_filename(file_id))[ST_SIZE]
172
def get_file_sha1(self, file_id):
173
f = self.get_file(file_id)
177
def file_class(self, filename):
178
if self.path2id(filename):
180
elif self.is_ignored(filename):
186
def list_files(self):
187
"""Recursively list all files as (path, class, kind, id).
189
Lists, but does not descend into unversioned directories.
191
This does not include files that have been deleted in this
194
Skips the control directory.
198
def descend(from_dir_relpath, from_dir_id, dp):
202
## TODO: If we find a subdirectory with its own .bzr
203
## directory, then that is a separate tree and we
204
## should exclude it.
205
if bzrlib.BZRDIR == f:
209
fp = appendpath(from_dir_relpath, f)
212
fap = appendpath(dp, f)
214
f_ie = inv.get_child(from_dir_id, f)
217
elif self.is_ignored(fp):
226
bailout("file %r entered as kind %r id %r, now of kind %r"
227
% (fap, f_ie.kind, f_ie.file_id, fk))
229
yield fp, c, fk, (f_ie and f_ie.file_id)
231
if fk != 'directory':
235
# don't descend unversioned directories
238
for ff in descend(fp, f_ie.file_id, fap):
241
for f in descend('', inv.root.file_id, self.basedir):
225
246
def unknowns(self):
226
"""What files are present in this tree and unknown.
228
:return: an iterator over the unknown files.
235
def filter_unversioned_files(self, paths):
236
"""Filter out paths that are not versioned.
238
:return: set of paths.
240
# NB: we specifically *don't* call self.has_filename, because for
241
# WorkingTrees that can indicate files that exist on disk but that
243
pred = self.inventory.has_filename
244
return set((p for p in paths if not pred(p)))
247
for subp in self.extras():
248
if not self.is_ignored(subp):
253
"""Yield all unknown files in this WorkingTree.
255
If there are any unknown directories then only the directory is
256
returned, not all its children. But if there are unknown files
257
under a versioned subdirectory, they are returned.
259
Currently returned depth-first, sorted by name within directories.
261
## TODO: Work from given directory downwards
263
for path, dir_entry in self.inventory.directories():
264
mutter("search for unknowns in %r" % path)
265
dirabs = self.abspath(path)
266
if not isdir(dirabs):
267
# e.g. directory deleted
271
for subf in os.listdir(dirabs):
273
and (subf not in dir_entry.children)):
278
subp = appendpath(path, subf)
282
def ignored_files(self):
283
"""Yield list of PATH, IGNORE_PATTERN"""
284
for subp in self.extras():
285
pat = self.is_ignored(subp)
290
def get_ignore_list(self):
291
"""Return list of ignore patterns.
293
Cached in the Tree object after the first call.
295
if hasattr(self, '_ignorelist'):
296
return self._ignorelist
298
l = bzrlib.DEFAULT_IGNORE[:]
299
if self.has_filename(bzrlib.IGNORE_FILENAME):
300
f = self.get_file_byname(bzrlib.IGNORE_FILENAME)
301
l.extend([line.rstrip("\n\r") for line in f.readlines()])
306
def is_ignored(self, filename):
307
r"""Check whether the filename matches an ignore pattern.
309
Patterns containing '/' or '\' need to match the whole path;
310
others match against only the last component.
312
If the file is ignored, returns the pattern which caused it to
313
be ignored, otherwise None. So this can simply be used as a
314
boolean if desired."""
316
# TODO: Use '**' to match directories, and other extended
317
# globbing stuff from cvs/rsync.
319
# XXX: fnmatch is actually not quite what we want: it's only
320
# approximately the same as real Unix fnmatch, and doesn't
321
# treat dotfiles correctly and allows * to match /.
322
# Eventually it should be replaced with something more
325
for pat in self.get_ignore_list():
326
if '/' in pat or '\\' in pat:
328
# as a special case, you can put ./ at the start of a
329
# pattern; this is good to match in the top-level
332
if (pat[:2] == './') or (pat[:2] == '.\\'):
336
if fnmatch.fnmatchcase(filename, newpat):
339
if fnmatch.fnmatchcase(splitpath(filename)[-1], pat):
347
class RevisionTree(Tree):
348
"""Tree viewing a previous revision.
350
File text can be retrieved from the text store.
352
TODO: Some kind of `__repr__` method, but a good one
353
probably means knowing the branch and revision number,
354
or at least passing a description to the constructor.
357
def __init__(self, store, inv):
359
self._inventory = inv
361
def get_file(self, file_id):
362
ie = self._inventory[file_id]
363
f = self._store[ie.text_id]
364
mutter(" get fileid{%s} from %r" % (file_id, self))
365
self._check_retrieved(ie, f)
368
def get_file_size(self, file_id):
369
return self._inventory[file_id].text_size
371
def get_file_sha1(self, file_id):
372
ie = self._inventory[file_id]
375
def has_filename(self, filename):
376
return bool(self.inventory.path2id(filename))
378
def list_files(self):
379
# The only files returned by this are those from the version
380
for path, entry in self.inventory.iter_entries():
381
yield path, 'V', entry.kind, entry.file_id
247
384
class EmptyTree(Tree):
249
385
def __init__(self):
250
self._inventory = Inventory(root_id=None)
251
symbol_versioning.warn('EmptyTree is deprecated as of bzr 0.9 please'
252
' use repository.revision_tree instead.',
253
DeprecationWarning, stacklevel=2)
255
def get_parent_ids(self):
258
def get_symlink_target(self, file_id):
386
self._inventory = Inventory()
261
388
def has_filename(self, filename):
264
def kind(self, file_id):
265
assert self._inventory[file_id].kind == "directory"
268
def list_files(self, include_root=False):
391
def list_files(self):
392
if False: # just to make it a generator
271
def __contains__(self, file_id):
272
return (file_id in self._inventory)
274
def get_file_sha1(self, file_id, path=None, stat_value=None):
278
397
######################################################################
339
458
if old_name != new_name:
340
459
yield (old_name, new_name)
343
def find_ids_across_trees(filenames, trees, require_versioned=True):
344
"""Find the ids corresponding to specified filenames.
346
All matches in all trees will be used, and all children of matched
347
directories will be used.
349
:param filenames: The filenames to find file_ids for
350
:param trees: The trees to find file_ids within
351
:param require_versioned: if true, all specified filenames must occur in
353
:return: a set of file ids for the specified filenames and their children.
357
specified_ids = _find_filename_ids_across_trees(filenames, trees,
359
return _find_children_across_trees(specified_ids, trees)
362
def _find_filename_ids_across_trees(filenames, trees, require_versioned):
363
"""Find the ids corresponding to specified filenames.
365
All matches in all trees will be used.
367
:param filenames: The filenames to find file_ids for
368
:param trees: The trees to find file_ids within
369
:param require_versioned: if true, all specified filenames must occur in
371
:return: a set of file ids for the specified filenames
374
interesting_ids = set()
375
for tree_path in filenames:
378
file_id = tree.inventory.path2id(tree_path)
379
if file_id is not None:
380
interesting_ids.add(file_id)
383
not_versioned.append(tree_path)
384
if len(not_versioned) > 0 and require_versioned:
385
raise errors.PathsNotVersionedError(not_versioned)
386
return interesting_ids
389
def _find_children_across_trees(specified_ids, trees):
390
"""Return a set including specified ids and their children
392
All matches in all trees will be used.
394
:param trees: The trees to find file_ids within
395
:return: a set containing all specified ids and their children
397
interesting_ids = set(specified_ids)
398
pending = interesting_ids
399
# now handle children of interesting ids
400
# we loop so that we handle all children of each id in both trees
401
while len(pending) > 0:
403
for file_id in pending:
405
if file_id not in tree:
407
entry = tree.inventory[file_id]
408
for child in getattr(entry, 'children', {}).itervalues():
409
if child.file_id not in interesting_ids:
410
new_pending.add(child.file_id)
411
interesting_ids.update(new_pending)
412
pending = new_pending
413
return interesting_ids
416
class InterTree(InterObject):
417
"""This class represents operations taking place between two Trees.
419
Its instances have methods like 'compare' and contain references to the
420
source and target trees these operations are to be carried out on.
422
clients of bzrlib should not need to use InterTree directly, rather they
423
should use the convenience methods on Tree such as 'Tree.compare()' which
424
will pass through to InterTree as appropriate.
430
def compare(self, want_unchanged=False, specific_files=None,
431
extra_trees=None, require_versioned=False, include_root=False):
432
"""Return the changes from source to target.
434
:return: A TreeDelta.
435
:param specific_files: An optional list of file paths to restrict the
436
comparison to. When mapping filenames to ids, all matches in all
437
trees (including optional extra_trees) are used, and all children of
438
matched directories are included.
439
:param want_unchanged: An optional boolean requesting the inclusion of
440
unchanged entries in the result.
441
:param extra_trees: An optional list of additional trees to use when
442
mapping the contents of specific_files (paths) to file_ids.
443
:param require_versioned: An optional boolean (defaults to False). When
444
supplied and True all the 'specific_files' must be versioned, or
445
a PathsNotVersionedError will be thrown.
447
# NB: show_status depends on being able to pass in non-versioned files and
448
# report them as unknown
449
trees = (self.source, self.target)
450
if extra_trees is not None:
451
trees = trees + tuple(extra_trees)
452
specific_file_ids = find_ids_across_trees(specific_files,
453
trees, require_versioned=require_versioned)
454
if specific_files and not specific_file_ids:
455
# All files are unversioned, so just return an empty delta
456
# _compare_trees would think we want a complete delta
457
return delta.TreeDelta()
458
return delta._compare_trees(self.source, self.target, want_unchanged,
459
specific_file_ids, include_root)
461
def _iter_changes(self, from_tree, to_tree, include_unchanged,
462
specific_file_ids, pb):
463
"""Generate an iterator of changes between trees.
466
(file_id, path, changed_content, versioned, parent, name, kind,
469
Path is relative to the to_tree. changed_content is True if the file's
470
content has changed. This includes changes to its kind, and to
473
versioned, parent, name, kind, executable are tuples of (from, to).
474
If a file is missing in a tree, its kind is None.
476
Iteration is done in parent-to-child order, relative to the to_tree.
479
from_entries_by_dir = list(from_tree.inventory.iter_entries_by_dir())
480
from_data = dict((e.file_id, (p, e)) for p, e in from_entries_by_dir)
481
to_entries_by_dir = list(to_tree.inventory.iter_entries_by_dir())
482
if specific_file_ids is not None:
483
specific_file_ids = set(specific_file_ids)
484
num_entries = len(specific_file_ids)
486
num_entries = len(from_entries_by_dir) + len(to_entries_by_dir)
488
for to_path, to_entry in to_entries_by_dir:
489
file_id = to_entry.file_id
490
to_paths[file_id] = to_path
491
if (specific_file_ids is not None and
492
file_id not in specific_file_ids):
495
changed_content = False
496
from_path, from_entry = from_data.get(file_id, (None, None))
497
from_versioned = (from_entry is not None)
498
if from_entry is not None:
499
from_versioned = True
500
from_name = from_entry.name
501
from_parent = from_entry.parent_id
502
from_kind, from_executable, from_stat = \
503
from_tree._comparison_data(from_entry, from_path)
504
if specific_file_ids is None:
507
from_versioned = False
511
from_executable = None
512
versioned = (from_versioned, True)
513
to_kind, to_executable, to_stat = \
514
to_tree._comparison_data(to_entry, to_path)
515
kind = (from_kind, to_kind)
516
if kind[0] != kind[1]:
517
changed_content = True
518
elif from_kind == 'file':
519
from_size = from_tree._file_size(from_entry, from_stat)
520
to_size = to_tree._file_size(to_entry, to_stat)
521
if from_size != to_size:
522
changed_content = True
523
elif (from_tree.get_file_sha1(file_id, from_path, from_stat) !=
524
to_tree.get_file_sha1(file_id, to_path, to_stat)):
525
changed_content = True
526
elif from_kind == 'symlink':
527
if (from_tree.get_symlink_target(file_id) !=
528
to_tree.get_symlink_target(file_id)):
529
changed_content = True
530
parent = (from_parent, to_entry.parent_id)
531
name = (from_name, to_entry.name)
532
executable = (from_executable, to_executable)
534
pb.update('comparing files', entry_count, num_entries)
535
if (changed_content is not False or versioned[0] != versioned[1]
536
or parent[0] != parent[1] or name[0] != name[1] or
537
executable[0] != executable[1] or include_unchanged):
538
yield (file_id, to_path, changed_content, versioned, parent,
539
name, kind, executable)
541
for path, from_entry in from_entries_by_dir:
542
file_id = from_entry.file_id
543
if file_id in to_paths:
545
if from_entry.parent_id is None:
548
to_path = osutils.pathjoin(to_paths[from_entry.parent_id],
550
to_paths[file_id] = to_path
551
if (specific_file_ids is not None and
552
file_id not in specific_file_ids):
556
pb.update('comparing files', entry_count, num_entries)
557
versioned = (True, False)
558
parent = (from_entry.parent_id, None)
559
name = (from_entry.name, None)
560
from_kind, from_executable, stat_value = \
561
from_tree._comparison_data(from_entry, path)
562
kind = (from_kind, None)
563
executable = (from_executable, None)
564
changed_content = True
565
# the parent's path is necessarily known at this point.
566
yield(file_id, to_path, changed_content, versioned, parent,
567
name, kind, executable)
570
# This was deprecated before 0.12, but did not have an official warning
571
@symbol_versioning.deprecated_function(symbol_versioning.zero_twelve)
572
def RevisionTree(*args, **kwargs):
573
"""RevisionTree has moved to bzrlib.revisiontree.RevisionTree()
575
Accessing it as bzrlib.tree.RevisionTree has been deprecated as of
578
from bzrlib.revisiontree import RevisionTree as _RevisionTree
579
return _RevisionTree(*args, **kwargs)
added
removed
bzrlib/tree.py
