Source file list_override.ml
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
let tc_limit =
match Sys.backend_type with
| Other "js_of_ocaml" -> 50
| Other _ | Native | Bytecode -> 1000
let append_tc l1 l2 = List.rev_append (List.rev l1) l2
let rec append_count l1 l2 ~count =
match l1 with
| [] -> l2
| [x1] -> x1 :: l2
| [x1; x2] -> x1 :: x2 :: l2
| [x1; x2; x3] -> x1 :: x2 :: x3 :: l2
| [x1; x2; x3; x4] -> x1 :: x2 :: x3 :: x4 :: l2
| x1 :: x2 :: x3 :: x4 :: x5 :: l1' ->
x1 :: x2 :: x3 :: x4 :: x5
::
(if count > tc_limit then append_tc l1' l2
else append_count l1' l2 ~count:(count + 1))
let append l1 l2 = match l2 with [] -> l1 | _ -> append_count l1 l2 ~count:0
let map_direct xs ~f = List.map f xs
let map_tc xs ~f =
let rec rise ys = function
| [] -> ys
| (y0, y1, y2, y3, y4, y5, y6, y7, y8) :: bs ->
rise (y0 :: y1 :: y2 :: y3 :: y4 :: y5 :: y6 :: y7 :: y8 :: ys) bs
in
let rec dive bs = function
| x0 :: x1 :: x2 :: x3 :: x4 :: x5 :: x6 :: x7 :: x8 :: xs ->
let y0 = f x0 in
let y1 = f x1 in
let y2 = f x2 in
let y3 = f x3 in
let y4 = f x4 in
let y5 = f x5 in
let y6 = f x6 in
let y7 = f x7 in
let y8 = f x8 in
dive ((y0, y1, y2, y3, y4, y5, y6, y7, y8) :: bs) xs
| xs -> rise (map_direct ~f xs) bs
in
dive [] xs
let rec map_count ~f l ~count =
match l with
| [] -> []
| [x1] ->
let f1 = f x1 in
[f1]
| [x1; x2] ->
let f1 = f x1 in
let f2 = f x2 in
[f1; f2]
| [x1; x2; x3] ->
let f1 = f x1 in
let f2 = f x2 in
let f3 = f x3 in
[f1; f2; f3]
| [x1; x2; x3; x4] ->
let f1 = f x1 in
let f2 = f x2 in
let f3 = f x3 in
let f4 = f x4 in
[f1; f2; f3; f4]
| x1 :: x2 :: x3 :: x4 :: x5 :: tl ->
let f1 = f x1 in
let f2 = f x2 in
let f3 = f x3 in
let f4 = f x4 in
let f5 = f x5 in
f1 :: f2 :: f3 :: f4 :: f5
::
(if count > tc_limit then map_tc ~f tl
else map_count ~f tl ~count:(count + 1))
let mapi_direct xs ~f = List.mapi f xs
let mapi_tc xs ~f i =
let rec rise ys = function
| [] -> ys
| (y0, y1, y2, y3, y4, y5, y6, y7, y8) :: bs ->
rise (y0 :: y1 :: y2 :: y3 :: y4 :: y5 :: y6 :: y7 :: y8 :: ys) bs
in
let rec dive i bs = function
| x0 :: x1 :: x2 :: x3 :: x4 :: x5 :: x6 :: x7 :: x8 :: xs ->
let y0 = f (i + 0) x0 in
let y1 = f (i + 1) x1 in
let y2 = f (i + 2) x2 in
let y3 = f (i + 3) x3 in
let y4 = f (i + 4) x4 in
let y5 = f (i + 5) x5 in
let y6 = f (i + 6) x6 in
let y7 = f (i + 7) x7 in
let y8 = f (i + 8) x8 in
dive (i + 9) ((y0, y1, y2, y3, y4, y5, y6, y7, y8) :: bs) xs
| xs -> rise (mapi_direct ~f:(fun j x -> f (i + j) x) xs) bs
in
dive i [] xs
let rec mapi_count ~f l ~count i =
match l with
| [] -> []
| [x1] ->
let f1 = f i x1 in
[f1]
| [x1; x2] ->
let f1 = f (i + 0) x1 in
let f2 = f (i + 1) x2 in
[f1; f2]
| [x1; x2; x3] ->
let f1 = f (i + 0) x1 in
let f2 = f (i + 1) x2 in
let f3 = f (i + 2) x3 in
[f1; f2; f3]
| [x1; x2; x3; x4] ->
let f1 = f (i + 0) x1 in
let f2 = f (i + 1) x2 in
let f3 = f (i + 2) x3 in
let f4 = f (i + 3) x4 in
[f1; f2; f3; f4]
| x1 :: x2 :: x3 :: x4 :: x5 :: tl ->
let f1 = f (i + 0) x1 in
let f2 = f (i + 1) x2 in
let f3 = f (i + 2) x3 in
let f4 = f (i + 3) x4 in
let f5 = f (i + 4) x5 in
f1 :: f2 :: f3 :: f4 :: f5
::
(if count > tc_limit then mapi_tc ~f tl (i + 5)
else mapi_count ~f tl ~count:(count + 1) (i + 5))
let map f l = map_count ~f l ~count:0
let mapi f l = mapi_count ~f l ~count:0 0