363
359
raise NotImplementedError(self.get_symlink_target)
365
def get_canonical_inventory_paths(self, paths):
366
"""Like get_canonical_inventory_path() but works on multiple items.
368
:param paths: A sequence of paths relative to the root of the tree.
369
:return: A list of paths, with each item the corresponding input path
370
adjusted to account for existing elements that match case
373
return list(self._yield_canonical_inventory_paths(paths))
375
def get_canonical_inventory_path(self, path):
376
"""Returns the first inventory item that case-insensitively matches path.
378
If a path matches exactly, it is returned. If no path matches exactly
379
but more than one path matches case-insensitively, it is implementation
380
defined which is returned.
382
If no path matches case-insensitively, the input path is returned, but
383
with as many path entries that do exist changed to their canonical
386
If you need to resolve many names from the same tree, you should
387
use get_canonical_inventory_paths() to avoid O(N) behaviour.
389
:param path: A paths relative to the root of the tree.
390
:return: The input path adjusted to account for existing elements
391
that match case insensitively.
393
return self._yield_canonical_inventory_paths([path]).next()
395
def _yield_canonical_inventory_paths(self, paths):
397
# First, if the path as specified exists exactly, just use it.
398
if self.path2id(path) is not None:
402
cur_id = self.get_root_id()
404
bit_iter = iter(path.split("/"))
408
for child in self.iter_children(cur_id):
410
# XXX: it seem like if the child is known to be in the
411
# tree, we shouldn't need to go from its id back to
412
# its path -- mbp 2010-02-11
414
# XXX: it seems like we could be more efficient
415
# by just directly looking up the original name and
416
# only then searching all children; also by not
417
# chopping paths so much. -- mbp 2010-02-11
418
child_base = os.path.basename(self.id2path(child))
419
if (child_base == elt):
420
# if we found an exact match, we can stop now; if
421
# we found an approximate match we need to keep
422
# searching because there might be an exact match
425
new_path = osutils.pathjoin(cur_path, child_base)
427
elif child_base.lower() == lelt:
429
new_path = osutils.pathjoin(cur_path, child_base)
431
# before a change is committed we can see this error...
436
# got to the end of this directory and no entries matched.
437
# Return what matched so far, plus the rest as specified.
438
cur_path = osutils.pathjoin(cur_path, elt, *list(bit_iter))
443
362
def get_root_id(self):
444
363
"""Return the file_id for the root of this tree."""
530
450
vf.fallback_versionedfiles.append(base_vf)
531
451
return last_revision
533
inventory = property(_get_inventory,
534
doc="Inventory of this Tree")
536
453
def _check_retrieved(self, ie, f):
537
454
if not __debug__:
539
fp = fingerprint_file(f)
456
fp = osutils.fingerprint_file(f)
542
459
if ie.text_size is not None:
543
460
if ie.text_size != fp['size']:
544
raise BzrError("mismatched size for file %r in %r" % (ie.file_id, self._store),
461
raise errors.BzrError(
462
"mismatched size for file %r in %r" %
463
(ie.file_id, self._store),
545
464
["inventory expects %d bytes" % ie.text_size,
546
465
"file is actually %d bytes" % fp['size'],
547
466
"store is probably damaged/corrupt"])
549
468
if ie.text_sha1 != fp['sha1']:
550
raise BzrError("wrong SHA-1 for file %r in %r" % (ie.file_id, self._store),
469
raise errors.BzrError("wrong SHA-1 for file %r in %r" %
470
(ie.file_id, self._store),
551
471
["inventory expects %s" % ie.text_sha1,
552
472
"file is actually %s" % fp['sha1'],
553
473
"store is probably damaged/corrupt"])
556
475
def path2id(self, path):
557
476
"""Return the id for path in this tree."""
558
return self._inventory.path2id(path)
477
raise NotImplementedError(self.path2id)
560
479
def paths2ids(self, paths, trees=[], require_versioned=True):
561
480
"""Return all the ids that can be reached by walking from paths.
643
class InventoryTree(Tree):
644
"""A tree that relies on an inventory for its metadata.
646
Trees contain an `Inventory` object, and also know how to retrieve
647
file texts mentioned in the inventory, either from a working
648
directory or from a store.
650
It is possible for trees to contain files that are not described
651
in their inventory or vice versa; for this use `filenames()`.
653
Subclasses should set the _inventory attribute, which is considered
654
private to external API users.
657
def get_canonical_inventory_paths(self, paths):
658
"""Like get_canonical_inventory_path() but works on multiple items.
660
:param paths: A sequence of paths relative to the root of the tree.
661
:return: A list of paths, with each item the corresponding input path
662
adjusted to account for existing elements that match case
665
return list(self._yield_canonical_inventory_paths(paths))
667
def get_canonical_inventory_path(self, path):
668
"""Returns the first inventory item that case-insensitively matches path.
670
If a path matches exactly, it is returned. If no path matches exactly
671
but more than one path matches case-insensitively, it is implementation
672
defined which is returned.
674
If no path matches case-insensitively, the input path is returned, but
675
with as many path entries that do exist changed to their canonical
678
If you need to resolve many names from the same tree, you should
679
use get_canonical_inventory_paths() to avoid O(N) behaviour.
681
:param path: A paths relative to the root of the tree.
682
:return: The input path adjusted to account for existing elements
683
that match case insensitively.
685
return self._yield_canonical_inventory_paths([path]).next()
687
def _yield_canonical_inventory_paths(self, paths):
689
# First, if the path as specified exists exactly, just use it.
690
if self.path2id(path) is not None:
694
cur_id = self.get_root_id()
696
bit_iter = iter(path.split("/"))
700
for child in self.iter_children(cur_id):
702
# XXX: it seem like if the child is known to be in the
703
# tree, we shouldn't need to go from its id back to
704
# its path -- mbp 2010-02-11
706
# XXX: it seems like we could be more efficient
707
# by just directly looking up the original name and
708
# only then searching all children; also by not
709
# chopping paths so much. -- mbp 2010-02-11
710
child_base = os.path.basename(self.id2path(child))
711
if (child_base == elt):
712
# if we found an exact match, we can stop now; if
713
# we found an approximate match we need to keep
714
# searching because there might be an exact match
717
new_path = osutils.pathjoin(cur_path, child_base)
719
elif child_base.lower() == lelt:
721
new_path = osutils.pathjoin(cur_path, child_base)
722
except errors.NoSuchId:
723
# before a change is committed we can see this error...
728
# got to the end of this directory and no entries matched.
729
# Return what matched so far, plus the rest as specified.
730
cur_path = osutils.pathjoin(cur_path, elt, *list(bit_iter))
735
def _get_inventory(self):
736
return self._inventory
738
inventory = property(_get_inventory,
739
doc="Inventory of this Tree")
742
def path2id(self, path):
743
"""Return the id for path in this tree."""
744
return self._inventory.path2id(path)
746
def id2path(self, file_id):
747
"""Return the path for a file id.
751
return self.inventory.id2path(file_id)
753
def has_id(self, file_id):
754
return self.inventory.has_id(file_id)
756
def has_or_had_id(self, file_id):
757
return self.inventory.has_id(file_id)
760
return iter(self.inventory)
762
def filter_unversioned_files(self, paths):
763
"""Filter out paths that are versioned.
765
:return: set of paths.
767
# NB: we specifically *don't* call self.has_filename, because for
768
# WorkingTrees that can indicate files that exist on disk but that
770
pred = self.inventory.has_filename
771
return set((p for p in paths if not pred(p)))
774
def iter_entries_by_dir(self, specific_file_ids=None, yield_parents=False):
775
"""Walk the tree in 'by_dir' order.
777
This will yield each entry in the tree as a (path, entry) tuple.
778
The order that they are yielded is:
780
See Tree.iter_entries_by_dir for details.
782
:param yield_parents: If True, yield the parents from the root leading
783
down to specific_file_ids that have been requested. This has no
784
impact if specific_file_ids is None.
786
return self.inventory.iter_entries_by_dir(
787
specific_file_ids=specific_file_ids, yield_parents=yield_parents)
789
def get_file_by_path(self, path):
790
return self.get_file(self._inventory.path2id(path), path)
728
793
######################################################################
added
removed
bzrlib/tree.py
