package preface

  1. Overview
  2. Docs
Legend:
Page
Library
Module
Module type
Parameter
Class
Class type
Source

Source file bifunctor.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
open QCheck2

module Suite
    (R : Model.COVARIANT_2)
    (BF : Preface_specs.BIFUNCTOR with type ('a, 'b) t = ('a, 'b) R.t)
    (A : Model.T0)
    (B : Model.T0)
    (C : Model.T0)
    (D : Model.T0)
    (E : Model.T0)
    (F : Model.T0) =
struct
  module Laws = Preface_laws.Bifunctor.For (BF)

  let print pp_a pp_b = Format.asprintf "%a" (R.pp pp_a pp_b)

  let bifunctor_1 count =
    let generator = R.generator A.generator B.generator in
    let print = print A.pp B.pp in
    Util.test ~count ~print generator Laws.bifunctor_1 (fun lhs rhs x ->
        let left = lhs x
        and right = rhs x in
        R.equal A.equal B.equal left right )
  ;;

  let bifunctor_2 count =
    let generator = R.generator A.generator B.generator in
    let print = print A.pp B.pp in
    Util.test ~count ~print generator Laws.bifunctor_2 (fun lhs rhs x ->
        let left = lhs x
        and right = rhs x in
        R.equal A.equal B.equal left right )
  ;;

  let bifunctor_3 count =
    let generator = R.generator A.generator B.generator in
    let print = print A.pp B.pp in
    Util.test ~count ~print generator Laws.bifunctor_3 (fun lhs rhs x ->
        let left = lhs x
        and right = rhs x in
        R.equal A.equal B.equal left right )
  ;;

  let bifunctor_4 count =
    let generator =
      Gen.tup3
        (fun1 A.observable B.generator)
        (fun1 C.observable D.generator)
        (R.generator A.generator C.generator)
    in
    let print (_, _, x) = print A.pp C.pp x in
    Util.test ~count ~print generator Laws.bifunctor_4 (fun lhs rhs (f, g, x) ->
        let f = Fn.apply f
        and g = Fn.apply g in
        let left = lhs f g x
        and right = rhs f g x in
        R.equal B.equal D.equal left right )
  ;;

  let bifunctor_5 count =
    let generator =
      Gen.tup5
        (fun1 A.observable B.generator)
        (fun1 C.observable A.generator)
        (fun1 D.observable E.generator)
        (fun1 F.observable D.generator)
        (R.generator C.generator F.generator)
    in
    let print (_, _, _, _, x) = print C.pp F.pp x in
    Util.test ~count ~print generator Laws.bifunctor_5
      (fun lhs rhs (f, g, h, i, x) ->
        let f = Fn.apply f
        and g = Fn.apply g
        and h = Fn.apply h
        and i = Fn.apply i in
        let left = lhs f g h i x
        and right = rhs f g h i x in
        R.equal B.equal E.equal left right )
  ;;

  let bifunctor_6 count =
    let generator =
      Gen.tup3
        (fun1 A.observable B.generator)
        (fun1 C.observable A.generator)
        (R.generator C.generator D.generator)
    in
    let print (_, _, x) = print C.pp D.pp x in
    Util.test ~count ~print generator Laws.bifunctor_6 (fun lhs rhs (f, g, x) ->
        let f = Fn.apply f
        and g = Fn.apply g in
        let left = lhs f g x
        and right = rhs f g x in
        R.equal B.equal D.equal left right )
  ;;

  let bifunctor_7 count =
    let generator =
      Gen.tup3
        (fun1 A.observable B.generator)
        (fun1 C.observable A.generator)
        (R.generator D.generator C.generator)
    in
    let print (_, _, x) = print D.pp C.pp x in
    Util.test ~count ~print generator Laws.bifunctor_7 (fun lhs rhs (f, g, x) ->
        let f = Fn.apply f
        and g = Fn.apply g in
        let left = lhs f g x
        and right = rhs f g x in
        R.equal D.equal B.equal left right )
  ;;

  let tests ~count =
    [
      bifunctor_1 count
    ; bifunctor_2 count
    ; bifunctor_3 count
    ; bifunctor_4 count
    ; bifunctor_5 count
    ; bifunctor_6 count
    ; bifunctor_7 count
    ]
  ;;
end
OCaml

Innovation. Community. Security.