22
22
| Exists of char_bool_fun
23
23
| Mem of char
24
24
| Find_opt of char_bool_fun
25
- | Find_index of char_bool_fun
25
+ (* | Find_index of char_bool_fun since 5.1 *)
26
26
| Sort
27
27
| Stable_sort
28
28
| Fast_sort
42
42
| Exists f -> cst1 pp_char_bool_fun " Exists" par fmt f
43
43
| Mem x -> cst1 pp_char " Mem" par fmt x
44
44
| Find_opt f -> cst1 pp_char_bool_fun " Find_opt" par fmt f
45
- | Find_index f -> cst1 pp_char_bool_fun " Find_index" par fmt f
45
+ (* | Find_index f -> cst1 pp_char_bool_fun "Find_index" par fmt f*)
46
46
| Sort -> cst0 " Sort" fmt
47
47
| Stable_sort -> cst0 " Stable_sort" fmt
48
48
| Fast_sort -> cst0 " Fast_sort" fmt
69
69
map (fun f -> Exists f) (fun1 Observable. char QCheck. bool ).gen;
70
70
map (fun c -> Mem c) char_gen;
71
71
map (fun f -> Find_opt f) (fun1 Observable. char QCheck. bool ).gen;
72
- map (fun f -> Find_index f) (fun1 Observable. char QCheck. bool ).gen;
72
+ (* map (fun f -> Find_index f) (fun1 Observable.char QCheck.bool).gen;*)
73
73
return Sort ;
74
74
return Stable_sort ;
75
75
return Fast_sort ;
97
97
| Exists _ -> s
98
98
| Mem _ -> s
99
99
| Find_opt _ -> s
100
- | Find_index _ -> s
100
+ (* | Find_index _ -> s*)
101
101
| Sort -> List. sort Char. compare s
102
102
| Stable_sort -> List. stable_sort Char. compare s
103
103
| Fast_sort -> List. fast_sort Char. compare s
@@ -121,7 +121,7 @@ struct
121
121
| Exists (Fun (_ ,f )) -> Res (bool , Array. exists f a)
122
122
| Mem c -> Res (bool , Array. mem c a)
123
123
| Find_opt (Fun (_ ,f )) -> Res (option char , Array. find_opt f a)
124
- | Find_index (Fun (_ ,f )) -> Res (option int , Array. find_index f a)
124
+ (* | Find_index (Fun (_,f)) -> Res (option int, Array.find_index f a) * )
125
125
| Sort -> Res (unit , Array. sort Char. compare a)
126
126
| Stable_sort -> Res (unit , Array. stable_sort Char. compare a)
127
127
| Fast_sort -> Res (unit , Array. fast_sort Char. compare a)
@@ -151,7 +151,7 @@ struct
151
151
| Exists (Fun (_ ,f )), Res ((Bool,_ ),r ) -> r = List. exists f s
152
152
| Mem c , Res ((Bool,_ ),r ) -> r = List. mem c s
153
153
| Find_opt (Fun (_ ,f )), Res ((Option Char,_ ),r ) -> r = List. find_opt f s
154
- | Find_index (Fun (_ ,f )), Res ((Option Int,_ ),r ) -> r = List. find_index f s
154
+ (* | Find_index (Fun (_,f)), Res ((Option Int,_),r) -> r = List.find_index f s*)
155
155
| Sort , Res ((Unit,_ ),r ) -> r = ()
156
156
| Stable_sort , Res ((Unit,_ ),r ) -> r = ()
157
157
| Fast_sort , Res ((Unit,_ ),r ) -> r = ()
0 commit comments