Mercurial > hg
comparison tests/test-parseindex.t @ 26061:be8a4e0800d8
reachableroots: use baseset lazy sorting
smartset sorting is lazy (so faster in some case) and better (informs that the
set is sorted allowing some optimisation). So we rely on it directly.
Some test output are updated because we now have more information (ordering).
author | Pierre-Yves David <pierre-yves.david@fb.com> |
---|---|
date | Thu, 20 Aug 2015 17:23:21 -0700 |
parents | b68c9d232db6 |
children | df41c7be16d6 |
comparison
equal
deleted
inserted
replaced
26060:4ee2af2194d4 | 26061:be8a4e0800d8 |
---|---|
94 > print 'uncaught error?' | 94 > print 'uncaught error?' |
95 > except TypeError as inst: | 95 > except TypeError as inst: |
96 > print inst | 96 > print inst |
97 > EOF | 97 > EOF |
98 good heads: | 98 good heads: |
99 0: <baseset [0]> | 99 0: <baseset+ [0]> |
100 1: <baseset [0]> | 100 1: <baseset+ [0]> |
101 -1: <baseset []> | 101 -1: <baseset+ []> |
102 bad heads: | 102 bad heads: |
103 2: head out of range | 103 2: head out of range |
104 10000: head out of range | 104 10000: head out of range |
105 -2: head out of range | 105 -2: head out of range |
106 -10000: head out of range | 106 -10000: head out of range |
107 None: an integer is required | 107 None: an integer is required |
108 good roots: | 108 good roots: |
109 0: <baseset [0]> | 109 0: <baseset+ [0]> |
110 1: <baseset [1]> | 110 1: <baseset+ [1]> |
111 -1: <baseset [-1]> | 111 -1: <baseset+ [-1]> |
112 out-of-range roots are ignored: | 112 out-of-range roots are ignored: |
113 2: <baseset []> | 113 2: <baseset+ []> |
114 10000: <baseset []> | 114 10000: <baseset+ []> |
115 -2: <baseset []> | 115 -2: <baseset+ []> |
116 -10000: <baseset []> | 116 -10000: <baseset+ []> |
117 bad roots: | 117 bad roots: |
118 None: an integer is required | 118 None: an integer is required |
119 | 119 |
120 $ cd .. | 120 $ cd .. |
121 | 121 |