/brz/remove-bazaar

To get this branch, use:
bzr branch http://gegoxaren.bato24.eu/bzr/brz/remove-bazaar

« back to all changes in this revision

Viewing changes to bzrlib/workingtree.py

  • Committer: Jelmer Vernooij
  • Date: 2017-02-05 22:51:57 UTC
  • mto: (6621.2.1 py3)
  • mto: This revision was merged to the branch mainline in revision 6624.
  • Revision ID: jelmer@jelmer.uk-20170205225157-jdk9ppega9c3my86
Run 2to3 idioms fixer.

Show diffs side-by-side

added added

removed removed

Lines of Context:
bzrlib/workingtree.py
2513
2513
            inv = self.root_inventory
2514
2514
            from_dir_id = inv.root.file_id
2515
2515
            from_dir_abspath = self.basedir
2516
 
        children = os.listdir(from_dir_abspath)
2517
 
        children.sort()
 
2516
        children = sorted(os.listdir(from_dir_abspath))
2518
2517
        # jam 20060527 The kernel sized tree seems equivalent whether we
2519
2518
        # use a deque and popleft to keep them sorted, or if we use a plain
2520
2519
        # list and just reverse() them.
2590
2589
 
2591
2590
                # But do this child first if recursing down
2592
2591
                if recursive:
2593
 
                    new_children = os.listdir(fap)
2594
 
                    new_children.sort()
 
2592
                    new_children = sorted(os.listdir(fap))
2595
2593
                    new_children = collections.deque(new_children)
2596
2594
                    stack.append((f_ie.file_id, fp, fap, new_children))
2597
2595
                    # Break out of inner loop,