← Back to branch summary

~bzr-pqm/bzr/bzr.dev

« back to all changes in this revision

Viewing changes to bzrlib/tree.py

  • Committer: John Arbash Meinel
  • Date: 2010-02-17 17:11:16 UTC
  • mfrom: (4797.2.17 2.1)
  • mto: (4797.2.18 2.1)
  • mto: This revision was merged to the branch mainline in revision 5055.
  • Revision ID: john@arbash-meinel.com-20100217171116-h7t9223ystbnx5h8
merge bzr.2.1 in preparation for NEWS entry.

Show diffs side-by-side

added added

removed removed

Lines of Context:
bzrlib/tree.py
1
 
# Copyright (C) 2005, 2009 Canonical Ltd
 
1
# Copyright (C) 2005-2010 Canonical Ltd
2
2
#
3
3
# This program is free software; you can redistribute it and/or modify
4
4
# it under the terms of the GNU General Public License as published by
404
404
            bit_iter = iter(path.split("/"))
405
405
            for elt in bit_iter:
406
406
                lelt = elt.lower()
 
407
                new_path = None
407
408
                for child in self.iter_children(cur_id):
408
409
                    try:
 
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
 
413
                        #
 
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
409
418
                        child_base = os.path.basename(self.id2path(child))
410
 
                        if child_base.lower() == lelt:
 
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
 
423
                            # later.  
411
424
                            cur_id = child
412
 
                            cur_path = osutils.pathjoin(cur_path, child_base)
 
425
                            new_path = osutils.pathjoin(cur_path, child_base)
413
426
                            break
 
427
                        elif child_base.lower() == lelt:
 
428
                            cur_id = child
 
429
                            new_path = osutils.pathjoin(cur_path, child_base)
414
430
                    except NoSuchId:
415
431
                        # before a change is committed we can see this error...
416
432
                        continue
 
433
                if new_path:
 
434
                    cur_path = new_path
417
435
                else:
418
436
                    # got to the end of this directory and no entries matched.
419
437
                    # Return what matched so far, plus the rest as specified.
697
715
                for path in path_names:
698
716
                    yield searcher.get_items(path)
699
717
 
700
 
    @needs_read_lock
701
718
    def _get_rules_searcher(self, default_searcher):
702
719
        """Get the RulesSearcher for this tree given the default one."""
703
720
        searcher = default_searcher
852
869
    will pass through to InterTree as appropriate.
853
870
    """
854
871
 
 
872
    # Formats that will be used to test this InterTree. If both are
 
873
    # None, this InterTree will not be tested (e.g. because a complex
 
874
    # setup is required)
 
875
    _matching_from_tree_format = None
 
876
    _matching_to_tree_format = None
 
877
 
855
878
    _optimisers = []
856
879
 
857
880
    def _changes_from_entries(self, source_entry, target_entry,
954
977
            a PathsNotVersionedError will be thrown.
955
978
        :param want_unversioned: Scan for unversioned paths.
956
979
        """
957
 
        # NB: show_status depends on being able to pass in non-versioned files
958
 
        # and report them as unknown
959
980
        trees = (self.source,)
960
981
        if extra_trees is not None:
961
982
            trees = trees + tuple(extra_trees)