package preface

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

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

module Suite_applicative
    (R : Model.COVARIANT_1)
    (T : Preface_specs.Traversable.API_OVER_APPLICATIVE with type 'a t = 'a R.t)
    (RF : Model.COVARIANT_1)
    (F : Preface_specs.APPLICATIVE with type 'a t = 'a RF.t)
    (RG : Model.COVARIANT_1)
    (G : Preface_specs.APPLICATIVE with type 'a t = 'a RG.t) (NT : sig
      val run : 'a F.t -> 'a G.t
    end)
    (A : Model.T0)
    (B : Model.T0)
    (C : Model.T0) =
struct
  module Laws = Preface_laws.Traversable.For_applicative (T)
  module Compose = Laws.Compose (F) (G)
  module Naturality = Laws.Naturality (F) (G) (NT)

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

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

  let travserable_2 count =
    let generator =
      Gen.tup3
        (fun1 A.observable (RF.generator B.generator))
        (fun1 B.observable (RG.generator C.generator))
        (R.generator A.generator)
    in
    let print (_, _, x) = print A.pp x in
    Util.test ~count ~print generator Compose.traversable_composition_1
      (fun lhs rhs (ff, gg, x) ->
        let f = Fn.apply ff
        and g = Fn.apply gg in
        let left = lhs f g x
        and right = rhs f g x in
        RF.equal (RG.equal (R.equal C.equal)) left right )
  ;;

  let travserable_3 count =
    let generator =
      Gen.tup2
        (fun1 A.observable (RF.generator B.generator))
        (R.generator A.generator)
    in
    let print (_, x) = print A.pp x in
    Util.test ~count ~print generator Naturality.traversable_naturality_1
      (fun lhs rhs (ff, x) ->
        let f = Fn.apply ff in
        let left = lhs f x
        and right = rhs f x in
        RG.equal (R.equal B.equal) left right )
  ;;

  let tests ~count =
    [ traversable_1 count; travserable_2 count; travserable_3 count ]
  ;;
end

module Suite_monad
    (R : Model.COVARIANT_1)
    (T : Preface_specs.Traversable.API_OVER_MONAD with type 'a t = 'a R.t)
    (A : Model.T0) =
struct
  module Laws = Preface_laws.Traversable.For_monad (T)

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

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

  let tests ~count = [ traversable_1 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