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
|
(* TEST
flags = "-w +48";
*)
external ( |> ) : 'a -> ('a -> 'b) -> 'b = "%revapply"
let f x = x + x
let g x = x * x
let h x = x + 1
let add x y = x + y
let _ =
List.iter (fun x ->
print_int x; print_newline ()
)
[
3 |> f; (* 6 *)
3 |> f |> g; (* 36 *)
3 |> g |> f; (* 18 *)
3 |> f |> g |> h; (* 37 *)
3 |> add 2 |> add 3 |> f |> g |> add 4; (* 260 *)
]
(* PR#10081 *)
let bump ?(cap = 100) x = min cap (x + 1)
let _f x = x |> bump (* no warning 48 *)
(* PR#10081 *)
type t = A | B
type s = A | B
let _f (x : t) = x |> function A -> 0 | B -> 1
(* Abstract functions *)
let _ =
let module A:sig
type f
type x
val succ: f
val zero:x
external (|>): x -> f -> int = "%revapply"
end = struct
type f = int -> int
type x = int
let succ = succ
let zero = 0
external (|>): x -> f -> int = "%revapply"
end in
A.(zero |> succ)
|
