##// END OF EJS Templates
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

File last commit:

r35759:73432eee default
r37875:92ed344a @27 default
Show More
test-minifileset.py
38 lines | 1.4 KiB | text/x-python | PythonLexer
from __future__ import absolute_import
from __future__ import print_function
import os
import sys
# make it runnable directly without run-tests.py
sys.path[0:0] = [os.path.join(os.path.dirname(__file__), '..')]
from mercurial import minifileset
def check(text, truecases, falsecases):
f = minifileset.compile(text)
for args in truecases:
if not f(*args):
print('unexpected: %r should include %r' % (text, args))
for args in falsecases:
if f(*args):
print('unexpected: %r should exclude %r' % (text, args))
check('all()', [('a.php', 123), ('b.txt', 0)], [])
check('none()', [], [('a.php', 123), ('b.txt', 0)])
check('!!!!((!(!!all())))', [], [('a.php', 123), ('b.txt', 0)])
check('"path:a" & (**.b | **.c)', [('a/b.b', 0), ('a/c.c', 0)], [('b/c.c', 0)])
check('(path:a & **.b) | **.c',
[('a/b.b', 0), ('a/c.c', 0), ('b/c.c', 0)], [])
check('**.bin - size("<20B")', [('b.bin', 21)], [('a.bin', 11), ('b.txt', 21)])
check('!!**.bin or size(">20B") + "path:bin" or !size(">10")',
[('a.bin', 11), ('b.txt', 21), ('bin/abc', 11)],
[('a.notbin', 11), ('b.txt', 11), ('bin2/abc', 11)])
check('(**.php and size(">10KB")) | **.zip | ("path:bin" & !"path:bin/README") '
' | size(">1M")',
[('a.php', 15000), ('a.zip', 0), ('bin/a', 0), ('bin/README', 1e7)],
[('a.php', 5000), ('b.zip2', 0), ('t/bin/a', 0), ('bin/README', 1)])