package preface

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

Source file choice.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
143
144
145
146
open QCheck2

module Suite
    (R : Model.PROFUNCTORIAL)
    (P : Preface_specs.CHOICE 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 Profunctor = Profunctor.Suite (R) (P) (A) (B) (C) (D) (E) (F)
  module Laws = Preface_laws.Choice.For (P)

  let choice_1 count =
    let generator = R.generator A.observable B.generator
    and input = R.input (Util.gen_either A.generator C.generator) in
    Util.test ~count (Gen.tup2 generator input) Laws.choice_1
      (fun lhs rhs (p, x) ->
        let pro = R.lift p in
        let left = lhs pro
        and right = rhs pro in
        R.run_equality x
          (R.equal (Util.equal_either B.equal C.equal))
          left right )
  ;;

  let choice_2 count =
    let generator = R.generator A.observable B.generator
    and input = R.input A.generator in
    Util.test ~count (Gen.tup2 generator input) Laws.choice_2
      (fun lhs rhs (p, x) ->
        let pro = R.lift p in
        let left = lhs pro
        and right = rhs pro in
        R.run_equality x
          (R.equal (Util.equal_either B.equal C.equal))
          left right )
  ;;

  let choice_3 count =
    let generator =
      Gen.tup2
        (fun1 A.observable B.generator)
        (R.generator C.observable D.generator)
    and input = R.input (Util.gen_either C.generator A.generator) in
    Util.test ~count (Gen.tup2 generator input) Laws.choice_3
      (fun lhs rhs ((f, p), x) ->
        let f = Fn.apply f
        and pro = R.lift p in
        let left = lhs f pro
        and right = rhs f pro in
        R.run_equality x
          (R.equal (Util.equal_either D.equal B.equal))
          left right )
  ;;

  let choice_4 count =
    let generator = R.generator A.observable B.generator
    and input =
      R.input
        (Util.gen_either (Util.gen_either A.generator C.generator) D.generator)
    in
    Util.test ~count (Gen.tup2 generator input) Laws.choice_4
      (fun lhs rhs (p, x) ->
        let pro = R.lift p in
        let left = lhs pro
        and right = rhs pro in
        R.run_equality x
          (R.equal Util.(equal_either (equal_either B.equal C.equal) D.equal))
          left right )
  ;;

  let choice_5 count =
    let generator = R.generator A.observable B.generator
    and input = R.input (Util.gen_either C.generator A.generator) in
    Util.test ~count (Gen.tup2 generator input) Laws.choice_5
      (fun lhs rhs (p, x) ->
        let pro = R.lift p in
        let left = lhs pro
        and right = rhs pro in
        R.run_equality x
          (R.equal (Util.equal_either C.equal B.equal))
          left right )
  ;;

  let choice_6 count =
    let generator = R.generator A.observable B.generator
    and input = R.input A.generator in
    Util.test ~count (Gen.tup2 generator input) Laws.choice_6
      (fun lhs rhs (p, x) ->
        let pro = R.lift p in
        let left = lhs pro
        and right = rhs pro in
        R.run_equality x
          (R.equal (Util.equal_either C.equal B.equal))
          left right )
  ;;

  let choice_7 count =
    let generator =
      Gen.tup2
        (fun1 A.observable B.generator)
        (R.generator C.observable D.generator)
    and input = R.input (Util.gen_either A.generator C.generator) in
    Util.test ~count (Gen.tup2 generator input) Laws.choice_7
      (fun lhs rhs ((f, p), x) ->
        let f = Fn.apply f
        and pro = R.lift p in
        let left = lhs f pro
        and right = rhs f pro in
        R.run_equality x
          (R.equal (Util.equal_either B.equal D.equal))
          left right )
  ;;

  let choice_8 count =
    let generator = R.generator A.observable B.generator
    and input =
      R.input Util.(gen_either C.generator (gen_either D.generator A.generator))
    in
    Util.test ~count (Gen.tup2 generator input) Laws.choice_8
      (fun lhs rhs (p, x) ->
        let pro = R.lift p in
        let left = lhs pro
        and right = rhs pro in
        R.run_equality x
          (R.equal Util.(equal_either C.equal (equal_either D.equal B.equal)))
          left right )
  ;;

  let tests ~count =
    Profunctor.tests ~count
    @ [
        choice_1 count
      ; choice_2 count
      ; choice_3 count
      ; choice_4 count
      ; choice_5 count
      ; choice_6 count
      ; choice_7 count
      ; choice_8 count
      ]
  ;;
end
OCaml

Innovation. Community. Security.

GitHub Discord Twitter Peertube RSS
About
Changelog Releases Industrial Users Academic Users Why OCaml
Ecosystem
Packages Community Events OCaml Planet Jobs
Resources
Install OCaml Get Started Platform Tools Language Manual Standard Library API Books Exercises Papers OCaml Playground Logo
Policies
Carbon Footprint Governance Privacy Code of Conduct