Show More
@@ -1075,10 +1075,6 b' static int nt_init(nodetree *self, index' | |||
|
1075 | 1075 | return -1; |
|
1076 | 1076 | } |
|
1077 | 1077 | self->length = 1; |
|
1078 | if (nt_insert(self, nullid, -1) == -1) { | |
|
1079 | free(self->nodes); | |
|
1080 | return -1; | |
|
1081 | } | |
|
1082 | 1078 | return 0; |
|
1083 | 1079 | } |
|
1084 | 1080 | |
@@ -1152,6 +1148,11 b' static int index_init_nt(indexObject *se' | |||
|
1152 | 1148 | self->nt = NULL; |
|
1153 | 1149 | return -1; |
|
1154 | 1150 | } |
|
1151 | if (nt_insert(self->nt, nullid, -1) == -1) { | |
|
1152 | PyMem_Free(self->nt); | |
|
1153 | self->nt = NULL; | |
|
1154 | return -1; | |
|
1155 | } | |
|
1155 | 1156 | self->ntrev = (int)index_length(self); |
|
1156 | 1157 | self->ntlookups = 1; |
|
1157 | 1158 | self->ntmisses = 0; |
@@ -3,7 +3,7 b'' | |||
|
3 | 3 | |
|
4 | 4 | $ echo 0 > a |
|
5 | 5 | $ hg ci -qAm 0 |
|
6 | $ for i in 5 8 14 43; do | |
|
6 | $ for i in 5 8 14 43 167; do | |
|
7 | 7 | > hg up -q 0 |
|
8 | 8 | > echo $i > a |
|
9 | 9 | > hg ci -qm $i |
@@ -14,6 +14,7 b'' | |||
|
14 | 14 | > EOF |
|
15 | 15 | |
|
16 | 16 | $ hg l |
|
17 | 5:00f | |
|
17 | 18 | 4:7ba5d |
|
18 | 19 | 3:7ba57 |
|
19 | 20 | 2:72 |
@@ -21,9 +22,10 b'' | |||
|
21 | 22 | 0:b |
|
22 | 23 | $ cat <<EOF >> .hg/hgrc |
|
23 | 24 | > [experimental] |
|
24 |
> revisions.disambiguatewithin= |
|
|
25 | > revisions.disambiguatewithin=not 4 | |
|
25 | 26 | > EOF |
|
26 | 27 | $ hg l |
|
28 | 5:0 | |
|
27 | 29 | 4:7ba5d |
|
28 | 30 | 3:7b |
|
29 | 31 | 2:72 |
General Comments 0
You need to be logged in to leave comments.
Login now