218 |
218 |
219 # The C gca algorithm requires a real repo. These are textual descriptions of |
219 # The C gca algorithm requires a real repo. These are textual descriptions of |
220 # DAGs that have been known to be problematic, and, optionally, known pairs |
220 # DAGs that have been known to be problematic, and, optionally, known pairs |
221 # of revisions and their expected ancestor list. |
221 # of revisions and their expected ancestor list. |
222 dagtests = [ |
222 dagtests = [ |
223 ('+2*2*2/*3/2', {}), |
223 (b'+2*2*2/*3/2', {}), |
224 ('+3*3/*2*2/*4*4/*4/2*4/2*2', {}), |
224 (b'+3*3/*2*2/*4*4/*4/2*4/2*2', {}), |
225 ('+2*2*/2*4*/4*/3*2/4', {(6, 7): [3, 5]}), |
225 (b'+2*2*/2*4*/4*/3*2/4', {(6, 7): [3, 5]}), |
226 ] |
226 ] |
227 def test_gca(): |
227 def test_gca(): |
228 u = uimod.ui.load() |
228 u = uimod.ui.load() |
229 for i, (dag, tests) in enumerate(dagtests): |
229 for i, (dag, tests) in enumerate(dagtests): |
230 repo = hg.repository(u, b'gca%d' % i, create=1) |
230 repo = hg.repository(u, b'gca%d' % i, create=1) |