363
341
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
344
def get_root_id(self):
444
345
"""Return the file_id for the root of this tree."""
530
432
vf.fallback_versionedfiles.append(base_vf)
531
433
return last_revision
533
inventory = property(_get_inventory,
534
doc="Inventory of this Tree")
536
435
def _check_retrieved(self, ie, f):
537
436
if not __debug__:
539
fp = fingerprint_file(f)
438
fp = osutils.fingerprint_file(f)
542
441
if ie.text_size is not None:
543
442
if ie.text_size != fp['size']:
544
raise BzrError("mismatched size for file %r in %r" % (ie.file_id, self._store),
443
raise errors.BzrError(
444
"mismatched size for file %r in %r" %
445
(ie.file_id, self._store),
545
446
["inventory expects %d bytes" % ie.text_size,
546
447
"file is actually %d bytes" % fp['size'],
547
448
"store is probably damaged/corrupt"])
549
450
if ie.text_sha1 != fp['sha1']:
550
raise BzrError("wrong SHA-1 for file %r in %r" % (ie.file_id, self._store),
451
raise errors.BzrError("wrong SHA-1 for file %r in %r" %
452
(ie.file_id, self._store),
551
453
["inventory expects %s" % ie.text_sha1,
552
454
"file is actually %s" % fp['sha1'],
553
455
"store is probably damaged/corrupt"])
556
457
def path2id(self, path):
557
458
"""Return the id for path in this tree."""
558
return self._inventory.path2id(path)
459
raise NotImplementedError(self.path2id)
560
461
def paths2ids(self, paths, trees=[], require_versioned=True):
561
462
"""Return all the ids that can be reached by walking from paths.
625
class InventoryTree(Tree):
626
"""A tree that relies on an inventory for its metadata.
628
Trees contain an `Inventory` object, and also know how to retrieve
629
file texts mentioned in the inventory, either from a working
630
directory or from a store.
632
It is possible for trees to contain files that are not described
633
in their inventory or vice versa; for this use `filenames()`.
635
Subclasses should set the _inventory attribute, which is considered
636
private to external API users.
639
def get_canonical_inventory_paths(self, paths):
640
"""Like get_canonical_inventory_path() but works on multiple items.
642
:param paths: A sequence of paths relative to the root of the tree.
643
:return: A list of paths, with each item the corresponding input path
644
adjusted to account for existing elements that match case
647
return list(self._yield_canonical_inventory_paths(paths))
649
def get_canonical_inventory_path(self, path):
650
"""Returns the first inventory item that case-insensitively matches path.
652
If a path matches exactly, it is returned. If no path matches exactly
653
but more than one path matches case-insensitively, it is implementation
654
defined which is returned.
656
If no path matches case-insensitively, the input path is returned, but
657
with as many path entries that do exist changed to their canonical
660
If you need to resolve many names from the same tree, you should
661
use get_canonical_inventory_paths() to avoid O(N) behaviour.
663
:param path: A paths relative to the root of the tree.
664
:return: The input path adjusted to account for existing elements
665
that match case insensitively.
667
return self._yield_canonical_inventory_paths([path]).next()
669
def _yield_canonical_inventory_paths(self, paths):
671
# First, if the path as specified exists exactly, just use it.
672
if self.path2id(path) is not None:
676
cur_id = self.get_root_id()
678
bit_iter = iter(path.split("/"))
682
for child in self.iter_children(cur_id):
684
# XXX: it seem like if the child is known to be in the
685
# tree, we shouldn't need to go from its id back to
686
# its path -- mbp 2010-02-11
688
# XXX: it seems like we could be more efficient
689
# by just directly looking up the original name and
690
# only then searching all children; also by not
691
# chopping paths so much. -- mbp 2010-02-11
692
child_base = os.path.basename(self.id2path(child))
693
if (child_base == elt):
694
# if we found an exact match, we can stop now; if
695
# we found an approximate match we need to keep
696
# searching because there might be an exact match
699
new_path = osutils.pathjoin(cur_path, child_base)
701
elif child_base.lower() == lelt:
703
new_path = osutils.pathjoin(cur_path, child_base)
704
except errors.NoSuchId:
705
# before a change is committed we can see this error...
710
# got to the end of this directory and no entries matched.
711
# Return what matched so far, plus the rest as specified.
712
cur_path = osutils.pathjoin(cur_path, elt, *list(bit_iter))
717
def _get_inventory(self):
718
return self._inventory
720
inventory = property(_get_inventory,
721
doc="Inventory of this Tree")
724
def path2id(self, path):
725
"""Return the id for path in this tree."""
726
return self._inventory.path2id(path)
728
def id2path(self, file_id):
729
"""Return the path for a file id.
733
return self.inventory.id2path(file_id)
735
def has_id(self, file_id):
736
return self.inventory.has_id(file_id)
738
def has_or_had_id(self, file_id):
739
return self.inventory.has_id(file_id)
742
return iter(self.inventory)
744
def filter_unversioned_files(self, paths):
745
"""Filter out paths that are versioned.
747
:return: set of paths.
749
# NB: we specifically *don't* call self.has_filename, because for
750
# WorkingTrees that can indicate files that exist on disk but that
752
pred = self.inventory.has_filename
753
return set((p for p in paths if not pred(p)))
756
def iter_entries_by_dir(self, specific_file_ids=None, yield_parents=False):
757
"""Walk the tree in 'by_dir' order.
759
This will yield each entry in the tree as a (path, entry) tuple.
760
The order that they are yielded is:
762
See Tree.iter_entries_by_dir for details.
764
:param yield_parents: If True, yield the parents from the root leading
765
down to specific_file_ids that have been requested. This has no
766
impact if specific_file_ids is None.
768
return self.inventory.iter_entries_by_dir(
769
specific_file_ids=specific_file_ids, yield_parents=yield_parents)
771
def get_file_by_path(self, path):
772
return self.get_file(self._inventory.path2id(path), path)
724
775
######################################################################
added
removed
bzrlib/tree.py
