Mercurial > hg
comparison tests/test-parseindex2.py @ 16414:e8d37b78acfb
parsers: use base-16 trie for faster node->rev mapping
This greatly speeds up node->rev lookups, with results that are
often user-perceptible: for instance, "hg --time log" of the node
associated with rev 1000 on a linux-2.6 repo improves from 0.3
seconds to 0.03. I have not found any instances of slowdowns.
The new perfnodelookup command in contrib/perf.py demonstrates the
speedup more dramatically, since it performs no I/O. For a single
lookup, the new code is about 40x faster.
These changes also prepare the ground for the possibility of further
improving the performance of prefix-based node lookups.
author | Bryan O'Sullivan <bryano@fb.com> |
---|---|
date | Thu, 12 Apr 2012 14:05:59 -0700 |
parents | 2cdd7e63211b |
children | e22d6b1dec1d |
comparison
equal
deleted
inserted
replaced
16413:1a420761fcb7 | 16414:e8d37b78acfb |
---|---|
108 print "Parse index result (with inlined data) differs!" | 108 print "Parse index result (with inlined data) differs!" |
109 | 109 |
110 if py_res_2 != c_res_2: | 110 if py_res_2 != c_res_2: |
111 print "Parse index result (no inlined data) differs!" | 111 print "Parse index result (no inlined data) differs!" |
112 | 112 |
113 ix = parsers.parse_index2(data_inlined, True)[0] | |
114 for i, r in enumerate(ix): | |
115 if r[7] == nullid: | |
116 i = -1 | |
117 if ix[r[7]] != i: | |
118 print 'Reverse lookup inconsistent for %r' % r[7].encode('hex') | |
119 | |
113 print "done" | 120 print "done" |
114 | 121 |
115 runtest() | 122 runtest() |