@@ -1233,7 +1233,7 @@ def test_binary_tree(self):
1233
1233
t1 = msprime .simulate (10 , random_seed = 1234 ).first ()
1234
1234
t2 = t1 .split_polytomies (random_seed = 1234 )
1235
1235
tables = t1 .tree_sequence .dump_tables ()
1236
- assert tables .equals (t2 .tree_sequence .tables , ignore_provenance = True )
1236
+ tables .assert_equals (t2 .tree_sequence .tables , ignore_provenance = True )
1237
1237
1238
1238
def test_bad_method (self ):
1239
1239
tree = tskit .Tree .generate_star (3 )
@@ -1405,7 +1405,7 @@ def test_rank_unrank_round_trip(self, n):
1405
1405
tree2 = tskit .Tree .unrank (n , rank )
1406
1406
tables1 = tree1 .tree_sequence .tables
1407
1407
tables2 = tree2 .tree_sequence .tables
1408
- assert tables1 .equals (tables2 , ignore_provenance = True )
1408
+ tables1 .assert_equals (tables2 , ignore_provenance = True )
1409
1409
1410
1410
def test_kwargs (self ):
1411
1411
tree = self .method (3 , tracked_samples = [0 , 1 ])
@@ -1457,7 +1457,7 @@ def test_rank_unrank_round_trip_arity(self, n, arity):
1457
1457
tree2 = tskit .Tree .unrank (n , rank )
1458
1458
tables1 = tree1 .tree_sequence .tables
1459
1459
tables2 = tree2 .tree_sequence .tables
1460
- assert tables1 .equals (tables2 , ignore_provenance = True )
1460
+ tables1 .assert_equals (tables2 , ignore_provenance = True )
1461
1461
1462
1462
def test_bad_arity (self ):
1463
1463
for arity in [- 1 , 0 , 1 ]:
@@ -1505,7 +1505,7 @@ def test_rank_unrank_round_trip_seeds(self, seed):
1505
1505
tree2 = tskit .Tree .unrank (n , rank )
1506
1506
tables1 = tree1 .tree_sequence .tables
1507
1507
tables2 = tree2 .tree_sequence .tables
1508
- assert tables1 .equals (tables2 , ignore_provenance = True )
1508
+ tables1 .assert_equals (tables2 , ignore_provenance = True )
1509
1509
1510
1510
1511
1511
class TestGenerateComb (TreeGeneratorTestBase ):
0 commit comments