upstream/mercurial-mirror Files · tests/list-tree.py

revlog: use radix tree also for matching keys shorter than 4 hex digits...

revlog: use radix tree also for matching keys shorter than 4 hex digits I don't know what the reason for the 4-digit limit was, and I can't think of any real disadvantages of using the radix tree also when the requested minimum length is short. This speeds up `hg log -T '{shortest(node,1)}\n'` from 2m16s to 4.5s by making that not fall back to pure code. Differential Revision: https://phab.mercurial-scm.org/D3453

Matt Harbison - - Load All Authors

File last commit:

r35381:acff4195 default


                r37875:92ed344a

@27 default

Download file

             list-tree.py
        
                    27 lines
            
             | 684 B
            
                | text/x-python
            
             |
                PythonLexer
            
             / tests / list-tree.py
          
                    History
                
                 |
                  Annotation
                 | Raw
                 |Copy content
                 |Copy permalink

      from __future__ import (

          absolute_import,

          print_function,

      )

      import argparse

      import os

      ap = argparse.ArgumentParser()

      ap.add_argument('path', nargs='+')

      opts = ap.parse_args()

      def gather():

          for p in opts.path:

              if not os.path.exists(p):

                  return

              if os.path.isdir(p):

                  yield p + os.path.sep

                  for dirpath, dirs, files in os.walk(p):

                      for d in dirs:

                          yield os.path.join(dirpath, d) + os.path.sep

                      for f in files:

                          yield os.path.join(dirpath, f)

              else:

                  yield p

      print('\n'.join(sorted(gather(), key=lambda x: x.replace(os.path.sep, '/'))))

	Site-wide shortcuts
/	Use quick search box
g h	Goto home page
g g	Goto my private gists page
g G	Goto my public gists page
g 0-9	Goto bookmarked items from 0-9
n r	New repository page
n g	New gist page

	Repositories
g s	Goto summary page
g c	Goto changelog page
g f	Goto files page
g F	Goto files page with file search activated
g p	Goto pull requests page
g o	Goto repository settings
g O	Goto repository access permissions settings
t s	Toggle sidebar on some pages

				from __future__ import (
				absolute_import,
				print_function,
				)

				import argparse
				import os

				ap = argparse.ArgumentParser()
				ap.add_argument('path', nargs='+')
				opts = ap.parse_args()

				def gather():
				for p in opts.path:
				if not os.path.exists(p):
				return
				if os.path.isdir(p):
				yield p + os.path.sep
				for dirpath, dirs, files in os.walk(p):
				for d in dirs:
				yield os.path.join(dirpath, d) + os.path.sep
				for f in files:
				yield os.path.join(dirpath, f)
				else:
				yield p

				print('\n'.join(sorted(gather(), key=lambda x: x.replace(os.path.sep, '/'))))