@@ -53,7 +53,7 @@ test_likelihood_errors(void)
53
53
ret = tsk_mutation_table_add_row (
54
54
& tables .mutations , 0 , 1 , -1 , TSK_UNKNOWN_TIME , "C" , 1 , NULL , 0 );
55
55
CU_ASSERT_FATAL (ret >= 0 );
56
- ret = tsk_treeseq_init (& ts , & tables , TSK_BUILD_INDEXES );
56
+ ret = tsk_treeseq_init (& ts , & tables , TSK_TS_INIT_BUILD_INDEXES );
57
57
CU_ASSERT_EQUAL_FATAL (ret , 0 );
58
58
59
59
/* Ne <= 0 is an error */
@@ -91,7 +91,7 @@ test_likelihood_zero_edges(void)
91
91
& tables .nodes , TSK_NODE_IS_SAMPLE , 0.0 , TSK_NULL , TSK_NULL , NULL , 0 );
92
92
CU_ASSERT_FATAL (ret >= 0 );
93
93
94
- ret = tsk_treeseq_init (& ts , & tables , TSK_BUILD_INDEXES );
94
+ ret = tsk_treeseq_init (& ts , & tables , TSK_TS_INIT_BUILD_INDEXES );
95
95
CU_ASSERT_EQUAL_FATAL (ret , 0 );
96
96
97
97
/* Zero edges should give a likelihood of zero */
@@ -115,7 +115,7 @@ test_likelihood_zero_edges(void)
115
115
ret = tsk_mutation_table_add_row (
116
116
& tables .mutations , 0 , 0 , -1 , TSK_UNKNOWN_TIME , "C" , 1 , NULL , 0 );
117
117
CU_ASSERT_FATAL (ret >= 0 );
118
- ret = tsk_treeseq_init (& ts , & tables , TSK_BUILD_INDEXES );
118
+ ret = tsk_treeseq_init (& ts , & tables , TSK_TS_INIT_BUILD_INDEXES );
119
119
CU_ASSERT_EQUAL_FATAL (ret , 0 );
120
120
121
121
/* Zero edges should give a likelihood of zero */
@@ -225,7 +225,7 @@ test_likelihood_three_leaves(void)
225
225
226
226
tsk_population_table_add_row (& tables .populations , NULL , 0 );
227
227
228
- ret = tsk_treeseq_init (& ts , & tables , TSK_BUILD_INDEXES );
228
+ ret = tsk_treeseq_init (& ts , & tables , TSK_TS_INIT_BUILD_INDEXES );
229
229
CU_ASSERT_EQUAL_FATAL (ret , 0 );
230
230
231
231
for (i = 0 ; i < 3 ; i ++ ) {
@@ -330,7 +330,7 @@ test_likelihood_two_mrcas(void)
330
330
331
331
tsk_population_table_add_row (& tables .populations , NULL , 0 );
332
332
333
- ret = tsk_treeseq_init (& ts , & tables , TSK_BUILD_INDEXES );
333
+ ret = tsk_treeseq_init (& ts , & tables , TSK_TS_INIT_BUILD_INDEXES );
334
334
CU_ASSERT_EQUAL_FATAL (ret , 0 );
335
335
336
336
for (i = 0 ; i < 3 ; i ++ ) {
@@ -440,7 +440,7 @@ test_likelihood_material_overhang(void)
440
440
CU_ASSERT_FATAL (ret >= 0 );
441
441
442
442
tsk_population_table_add_row (& tables .populations , NULL , 0 );
443
- ret = tsk_treeseq_init (& ts , & tables , TSK_BUILD_INDEXES );
443
+ ret = tsk_treeseq_init (& ts , & tables , TSK_TS_INIT_BUILD_INDEXES );
444
444
CU_ASSERT_EQUAL_FATAL (ret , 0 );
445
445
446
446
for (i = 0 ; i < 3 ; i ++ ) {
@@ -564,7 +564,7 @@ test_likelihood_material_gap(void)
564
564
CU_ASSERT_FATAL (ret >= 0 );
565
565
566
566
tsk_population_table_add_row (& tables .populations , NULL , 0 );
567
- ret = tsk_treeseq_init (& ts , & tables , TSK_BUILD_INDEXES );
567
+ ret = tsk_treeseq_init (& ts , & tables , TSK_TS_INIT_BUILD_INDEXES );
568
568
CU_ASSERT_EQUAL_FATAL (ret , 0 );
569
569
570
570
for (i = 0 ; i < 3 ; i ++ ) {
@@ -698,7 +698,7 @@ test_likelihood_recombination_in_material_gap(void)
698
698
CU_ASSERT_FATAL (ret >= 0 );
699
699
700
700
tsk_population_table_add_row (& tables .populations , NULL , 0 );
701
- ret = tsk_treeseq_init (& ts , & tables , TSK_BUILD_INDEXES );
701
+ ret = tsk_treeseq_init (& ts , & tables , TSK_TS_INIT_BUILD_INDEXES );
702
702
CU_ASSERT_EQUAL_FATAL (ret , 0 );
703
703
704
704
for (i = 0 ; i < 3 ; i ++ ) {
0 commit comments