package preface

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

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

module Suite
    (R : Model.PROFUNCTORIAL)
    (P : Preface_specs.PROFUNCTOR 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.Profunctor.For (P)

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

  let profunctor_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.profunctor_2
      (fun lhs rhs (f, x) ->
        let pro = R.lift f in
        let left = lhs pro
        and right = rhs pro in
        R.run_equality x (R.equal B.equal) left right )
  ;;

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

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

  let profunctor_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 B.observable F.generator)
    and input = R.input C.generator in
    Util.test ~count (Gen.tup2 generator input) Laws.profunctor_5
      (fun lhs rhs ((f, g, h, i, p), x) ->
        let f = Fn.apply f
        and g = Fn.apply g
        and h = Fn.apply h
        and i = Fn.apply i
        and pro = R.lift p in
        let left = lhs f g h i pro
        and right = rhs f g h i pro in
        R.run_equality x (R.equal E.equal) left right )
  ;;

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

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

  let tests ~count =
    [
      profunctor_1 count
    ; profunctor_2 count
    ; profunctor_3 count
    ; profunctor_4 count
    ; profunctor_5 count
    ; profunctor_6 count
    ; profunctor_7 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