package DAGaml

  1. Overview
  2. Docs
package DAGaml
Legend:
Library
Module
Module type
Parameter
Class
Class type
module G0 : sig ... end
val fulladd2 : M0.t -> M0.f -> M0.f -> M0.f * M0.f
val fulladd3 : M0.t -> M0.f -> M0.f -> M0.f -> M0.f * M0.f
type uint = VUInt.Make(M0).uint = {
  1. arity : int;
  2. array : M0.f array;
}
val length : uint -> int
val uint_get : M0.t -> ?default:M0.f -> int -> uint -> M0.f
val map : (M0.f -> M0.f) -> uint -> uint
val uint_of_bool : M0.t -> M0.f -> uint
val uint_of_int : M0.t -> int -> int -> uint
val uint_one : M0.t -> int -> uint
val uint_zero : 'a -> int -> uint
val add : M0.t -> ?carry:M0.f -> uint -> uint -> uint
val (+/) : M0.t -> uint -> uint -> uint
val array_add : M0.t -> uint array -> uint
val list_add : M0.t -> uint list -> uint
val (+?/) : M0.t -> uint -> int -> uint
val (?+/) : M0.t -> int -> uint -> uint
val shift_right : 'a -> int -> uint -> uint
val (>>/) : 'a -> uint -> int -> uint
val shift_left : M0.t -> int -> uint -> uint
val (<</) : M0.t -> uint -> int -> uint
val add_3to2 : M0.t -> uint -> uint -> uint -> uint * uint
val list_add_3to2 : M0.t -> ?arity:int option -> uint list -> uint
val array_add_3to2 : M0.t -> ?arity:int option -> uint array -> uint
val bitwise_binop : (M0.t -> M0.f -> M0.f -> M0.f) -> M0.t -> ?defaultX:M0.f -> ?defaultY:M0.f -> uint -> uint -> uint
val (|&/) : M0.t -> ?defaultX:M0.f -> ?defaultY:M0.f -> uint -> uint -> uint
val (|^/) : M0.t -> ?defaultX:M0.f -> ?defaultY:M0.f -> uint -> uint -> uint
val (||/) : M0.t -> ?defaultX:M0.f -> ?defaultY:M0.f -> uint -> uint -> uint
val (|=/) : M0.t -> ?defaultX:M0.f -> ?defaultY:M0.f -> uint -> uint -> uint
val (|*/) : M0.t -> ?defaultX:M0.f -> ?defaultY:M0.f -> uint -> uint -> uint
val (=/) : G0.t -> uint -> uint -> G0.f
val (<>/) : G0.t -> uint -> uint -> G0.f
val bitwise_choice : M0.t -> G0.f -> uint -> uint -> uint
val zero_choice : M0.t -> G0.f -> uint -> uint
val shift_right' : M0.t -> uint -> uint -> uint
val (>>//) : M0.t -> uint -> uint -> uint
val shift_left' : M0.t -> uint -> uint -> uint
val (<<//) : M0.t -> uint -> uint -> uint
val card : M0.t -> M0.f array -> uint
val exp_card : M0.t -> int -> G0.f array -> uint
val exp_card' : M0.t -> int -> M0.f array -> uint
val scalar_binop_left : (M0.t -> M0.f -> M0.f -> M0.f) -> M0.t -> M0.f -> uint -> uint
val scalar_binop_right : (M0.t -> M0.f -> M0.f -> M0.f) -> M0.t -> uint -> M0.f -> uint
val (|.&/) : M0.t -> M0.f -> uint -> uint
val (|.^/) : M0.t -> M0.f -> uint -> uint
val (|.|/) : M0.t -> M0.f -> uint -> uint
val (|.=/) : M0.t -> M0.f -> uint -> uint
val (|.*/) : M0.t -> M0.f -> uint -> uint
val (|&./) : M0.t -> uint -> M0.f -> uint
val (|^./) : M0.t -> uint -> M0.f -> uint
val (||./) : M0.t -> uint -> M0.f -> uint
val (|=./) : M0.t -> uint -> M0.f -> uint
val (|*./) : M0.t -> uint -> M0.f -> uint
val lX : bool -> G0.t -> uint -> uint -> M0.f
val lt : G0.t -> uint -> uint -> M0.f
val (</) : G0.t -> uint -> uint -> M0.f
val le : G0.t -> uint -> uint -> M0.f
val (<=/) : G0.t -> uint -> uint -> M0.f
val gX : bool -> G0.t -> uint -> uint -> M0.f
val gt : G0.t -> uint -> uint -> M0.f
val (>/) : G0.t -> uint -> uint -> M0.f
val ge : G0.t -> uint -> uint -> M0.f
val (>=/) : G0.t -> uint -> uint -> M0.f
val copy : G0.t -> int -> uint -> uint array
val copy_t : G0.t -> int -> uint -> uint array
val input : M0.t -> int -> uint
val range : G0.t -> int -> uint * M0.f
val truncate : 'a -> int -> uint -> uint
val mult_length : int -> int -> int
val mult : M0.t -> uint -> uint -> uint
val mult_3to2 : M0.t -> uint -> uint -> uint
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