Mercurial > hg
comparison mercurial/policy.py @ 39226:7a759ad2d06d
shortest: use nodetree for finding shortest node within revset
This speeds up `hg log -T '{shortest(node,1)}\n'` in my repo from 12s
to 4.5s. That's very close to the 4.1s it takes without the
disambiguation revset configured. My repo has 69.5k revisions, of
which 550 were in the configured revset ("not public()").
Differential Revision: https://phab.mercurial-scm.org/D4120
author | Martin von Zweigbergk <martinvonz@google.com> |
---|---|
date | Sun, 05 Aug 2018 00:42:07 -0700 |
parents | b85b377e7fc2 |
children | 481db51c83e9 |
comparison
equal
deleted
inserted
replaced
39225:fcaffbd7e635 | 39226:7a759ad2d06d |
---|---|
67 _cextversions = { | 67 _cextversions = { |
68 (r'cext', r'base85'): 1, | 68 (r'cext', r'base85'): 1, |
69 (r'cext', r'bdiff'): 3, | 69 (r'cext', r'bdiff'): 3, |
70 (r'cext', r'mpatch'): 1, | 70 (r'cext', r'mpatch'): 1, |
71 (r'cext', r'osutil'): 4, | 71 (r'cext', r'osutil'): 4, |
72 (r'cext', r'parsers'): 8, | 72 (r'cext', r'parsers'): 9, |
73 } | 73 } |
74 | 74 |
75 # map import request to other package or module | 75 # map import request to other package or module |
76 _modredirects = { | 76 _modredirects = { |
77 (r'cext', r'charencode'): (r'cext', r'parsers'), | 77 (r'cext', r'charencode'): (r'cext', r'parsers'), |