package hardcaml_verify

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

Module Hardcaml_verify_kernel.Basic_gatesSource

Sourcemodule Uid : sig ... end
Sourcetype t
include Ppx_compare_lib.Comparable.S with type t := t
Sourceval sexp_of_t : t -> Sexplib0.Sexp.t
include Base.Comparable.S with type t := t
include Base.Comparisons.S with type t := t
include Base.Comparisons.Infix with type t := t
Sourceval (>=) : t -> t -> bool
Sourceval (<=) : t -> t -> bool
Sourceval (=) : t -> t -> bool
Sourceval (>) : t -> t -> bool
Sourceval (<) : t -> t -> bool
Sourceval (<>) : t -> t -> bool
Sourceval equal : t -> t -> bool
Sourceval compare : t -> t -> int

compare t1 t2 returns 0 if t1 is equal to t2, a negative integer if t1 is less than t2, and a positive integer if t1 is greater than t2.

Sourceval min : t -> t -> t
Sourceval max : t -> t -> t
Sourceval ascending : t -> t -> int

ascending is identical to compare. descending x y = ascending y x. These are intended to be mnemonic when used like List.sort ~compare:ascending and List.sort ~cmp:descending, since they cause the list to be sorted in ascending or descending order, respectively.

Sourceval descending : t -> t -> int
Sourceval between : t -> low:t -> high:t -> bool

between t ~low ~high means low <= t <= high

Sourceval clamp_exn : t -> min:t -> max:t -> t

clamp_exn t ~min ~max returns t', the closest value to t such that between t' ~low:min ~high:max is true.

Raises if not (min <= max).

Sourceval clamp : t -> min:t -> max:t -> t Base.Or_error.t
include Base.Comparator.S with type t := t
Sourcetype comparator_witness
Sourceval uid : t -> Uid.t
Sourceval vdd : t
Sourceval gnd : t
Sourceval is_vdd : t -> Base.bool
Sourceval is_gnd : t -> Base.bool
Sourceval var : Label.t -> t
Sourceval (~:) : t -> t
Sourceval (|:) : t -> t -> t
Sourceval (^:) : t -> t -> t
Sourceval (&:) : t -> t -> t
Sourceval cofactor : var:t -> t -> f:t -> t

cofactor ~var p ~f computes the cofactor of f wrt to var. p=vdd for positive cofactor and p=gnd for negative cofactor

Sourceval difference : t -> f:t -> t

boolean difference

Sourceval forall : t -> f:t -> t

universal quantification

Sourceval exists : t -> f:t -> t

existential quantification

Sourceval shannon_expansion : t -> f:t -> t

F = xF_x + x'F_x'

Sourceval deps : t -> t Base.list

Gate inputs

Visit all nodes in the list of functions and call f. Nodes are visited once only.

Sourceval cnf : ?show_hidden:Base.bool -> t Base.list -> Cnf.t

Create CNF for each given equation. In the resulting CNF the equations are logically AND'd.

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