Mercurial > public > mercurial-scm > hg

comparison mercurial/revset.py @ 21204:1d7a2771aa36 stable

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
revset: inline spanset containment check (fix perf regression) Calling a function is super expensive in python. We inline the trivial range comparison to get back to more sensible performance on common revset operation. Benchmark result below: Revision mapping: 0) 3f83fc5cfe71 2.9.2 release 1) bcfd44abad93 current @ 2) This revision revset #0: public() 0) wall 0.010890 comb 0.010000 user 0.010000 sys 0.000000 (best of 201) 1) wall 0.012109 comb 0.010000 user 0.010000 sys 0.000000 (best of 199) 2) wall 0.012211 comb 0.020000 user 0.020000 sys 0.000000 (best of 197) revset #1: :10000 and public() 0) wall 0.007141 comb 0.010000 user 0.010000 sys 0.000000 (best of 361) 1) wall 0.014139 comb 0.010000 user 0.010000 sys 0.000000 (best of 186) 2) wall 0.008334 comb 0.010000 user 0.010000 sys 0.000000 (best of 308) revset #2: draft() 0) wall 0.009610 comb 0.010000 user 0.010000 sys 0.000000 (best of 279) 1) wall 0.010942 comb 0.010000 user 0.010000 sys 0.000000 (best of 243) 2) wall 0.011036 comb 0.010000 user 0.010000 sys 0.000000 (best of 239) revset #3: :10000 and draft() 0) wall 0.006852 comb 0.010000 user 0.010000 sys 0.000000 (best of 383) 1) wall 0.014641 comb 0.010000 user 0.010000 sys 0.000000 (best of 183) 2) wall 0.008314 comb 0.010000 user 0.010000 sys 0.000000 (best of 299) We can see this changeset gains back the regression for `and` operation on spanset. We are still a bit slowerfor the `public()` and `draft()`. Predicates not touched by this changeset.
author Pierre-Yves David <pierre-yves.david@fb.com>
date Mon, 28 Apr 2014 15:15:36 -0700
parents c8b9c6147108
children e2031c8ca4f8
comparison
equal deleted inserted replaced
21203:9f12d8665c7b 21204:1d7a2771aa36
2782 else: 2782 else:
2783 for r in iterrange: 2783 for r in iterrange:
2784 yield r 2784 yield r
2785 2785
2786 def __contains__(self, rev): 2786 def __contains__(self, rev):
2787 return self._contained(rev) and not (self._hiddenrevs and rev in 2787 return (((self._end < rev <= self._start)
2788 self._hiddenrevs) 2788 or (self._start <= rev < self._end))
2789 and not (self._hiddenrevs and rev in self._hiddenrevs))
2789 2790
2790 def __nonzero__(self): 2791 def __nonzero__(self):
2791 for r in self: 2792 for r in self:
2792 return True 2793 return True
2793 return False 2794 return False