package preface

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

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

module Suite
    (R : Model.CONTRAVARIANT_1)
    (F : Preface_specs.DECIDABLE with type 'a t = 'a R.t)
    (A : Model.T0)
    (B : Model.T0)
    (C : Model.T0) =
struct
  module Laws = Preface_laws.Decidable.For (F)
  module Divisible = Divisible.Suite (R) (F) (A) (B) (C)

  let decidable_1 count =
    let generator = R.generator A.observable
    and input = R.input A.generator in
    Util.test ~count (Gen.tup2 generator input) Laws.decidable_1
      (fun lhs rhs (f, x) ->
        let decidable = R.lift f
        and f : 'a -> Preface_core.Void.t = function _ -> assert false in
        let left = lhs f decidable
        and right = rhs f decidable in
        R.run_equality x left right )
  ;;

  let decidable_2 count =
    let generator = R.generator A.observable
    and input = R.input A.generator in
    Util.test ~count (Gen.tup2 generator input) Laws.decidable_2
      (fun lhs rhs (f, x) ->
        let decidable = R.lift f
        and f : 'a -> Preface_core.Void.t = function _ -> assert false in
        let left = lhs f decidable
        and right = rhs f decidable in
        R.run_equality x left right )
  ;;

  let tests ~count =
    Divisible.tests ~count @ [ decidable_1 count; decidable_2 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