@@ -159,21 +159,21 @@ and prolog_prog = {
159159
160160(* These two are the same, but the latter should not be mutated *)
161161
162- and preindex = clause Bl. t first_lvl_idx
163- and index = clause Bl. t first_lvl_idx
164- and 'clause_list first_lvl_idx = { idx : 'clause_list second_lvl_idx Ptmap .t ; time : int ; times : times }
165- and 'clause_list second_lvl_idx =
162+ and clause_list = clause Bl. t
163+ and index = first_lvl_idx
164+ and first_lvl_idx = { idx : second_lvl_idx Ptmap .t ; time : int ; times : times }
165+ and second_lvl_idx =
166166| TwoLevelIndex of {
167167 mode : mode ;
168168 argno : int ;
169- all_clauses : ' clause_list; (* when the query is flexible *)
170- flex_arg_clauses : ' clause_list; (* when the query is rigid but arg_id ha nothing *)
171- arg_idx : ' clause_list Ptmap .t ; (* when the query is rigid (includes in each binding flex_arg_clauses) *)
169+ all_clauses : clause_list ; (* when the query is flexible *)
170+ flex_arg_clauses : clause_list ; (* when the query is rigid but arg_id ha nothing *)
171+ arg_idx : clause_list Ptmap .t ; (* when the query is rigid (includes in each binding flex_arg_clauses) *)
172172 }
173173| BitHash of {
174174 mode : mode ;
175175 args : int list ;
176- args_idx : ' clause_list Ptmap .t ; (* clause, insertion time *)
176+ args_idx : clause_list Ptmap .t ; (* clause, insertion time *)
177177 }
178178| IndexWithDiscriminationTree of {
179179 mode : mode ;
@@ -183,7 +183,7 @@ and 'clause_list second_lvl_idx =
183183[@@ deriving show]
184184
185185let stop = ref false
186- let close_index ({idx; time; times} : preindex ) : index =
186+ let close_index ({idx; time; times} : index ) : index =
187187 { idx = idx; time = 0 ; times = StrMap. empty }
188188
189189type constraints = stuck_goal list
0 commit comments