package preface

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

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

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

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

  let closed_2 count =
    let generator = R.generator A.observable B.generator
    and input = R.input (fun2 C.observable D.observable A.generator)
    and final = Gen.tup2 C.generator D.generator in
    Util.test ~count (Gen.tup3 generator input final) Laws.closed_2
      (fun lhs rhs (p, x, (final_1, final_2)) ->
        let pro = R.lift p
        and input = R.map_input Fn.apply x in
        let left = lhs pro
        and right = rhs pro in
        let equal l r =
          let a =
            R.(run_functional_output (run_functional_output l final_1) final_2)
          and b =
            R.(run_functional_output (run_functional_output r final_1) final_2)
          in
          R.equal B.equal a b
        in
        R.run_equality input equal left right )
  ;;

  let closed_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.closed_3
      (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 B.equal) left right )
  ;;

  let tests ~count =
    Profunctor.tests ~count @ [ closed_1 count; closed_2 count; closed_3 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