package DAGaml

  1. Overview
  2. Docs
package DAGaml
Legend:
Library
Module
Module type
Parameter
Class
Class type
type t = LDD.OOPS.M0.t
type f = LDD.OOPS.M0.f
val (->>) : t -> bool list -> f -> f
val arity : t -> f -> int
val cneg : t -> bool -> f -> f
val (&!) : t -> f -> f -> f
val (|!) : t -> f -> f -> f
val (^!) : t -> f -> f -> f
val (=!) : t -> f -> f -> f
val (*!) : t -> f -> f -> f
val cst : t -> bool -> int -> f
val to_bool : t -> f -> bool option
val newman : unit -> t
val copy_into : t -> f list -> t -> f list
val to_barray : ?nocopy:bool -> ?destruct:bool -> t -> f list -> GuaCaml.BTools.barray
val of_barray : ?t:t option -> GuaCaml.BTools.barray -> t * f list
val bw_fl : ?nocopy:bool -> ?destruct:bool -> t -> f list GuaCaml.BTools.bw
val br_fl : ?t:t option -> (t * f list) GuaCaml.BTools.br
val t_stats : t -> GuaCaml.Tree.stree
val f_stats : t -> f list -> GuaCaml.Tree.stree
val clear_caches : t -> unit
val keep_clean : ?normalize:bool -> t -> f list -> f list
val check : t -> f -> bool
module F : sig ... end
val tof : ?nocopy:bool -> ?normalize:bool -> ?destruct:bool -> t -> f list GuaCaml.Io.ToF.t
val off : (t * f list) GuaCaml.Io.OfF.t
val neg : t -> f -> f
val var : t -> bool -> int -> f
val cst0 : t -> f
val cst1 : t -> f
val ite : t -> f -> f -> f -> f
val biite : t -> (f * f) -> f -> f -> f
val push_pass : t -> f -> f
val array_make_n_var : LDD.OOPS.M0.t -> int -> LDD.OOPS.M0.f array
val array_make_n_bivar : LDD.OOPS.M0.t -> int -> (LDD.OOPS.M0.f * LDD.OOPS.M0.f) array
val list_make_n_var : LDD.OOPS.M0.t -> int -> LDD.OOPS.M0.f list
val array_and : t -> ?arity:int option -> f array -> f
val list_and : t -> ?arity:int option -> f list -> f
val init_and : t -> int -> (int -> f) -> f
val array_or : t -> ?arity:int option -> f array -> f
val list_or : t -> ?arity:int option -> f list -> f
val init_or : t -> ?arity:int option -> int -> (int -> f) -> f
val array_neg : t -> f array -> f array
val list_neg : t -> f list -> f list
val array_at_least_one : t -> ?arity:int option -> f array -> f
val list_at_least_one : t -> ?arity:int option -> f list -> f
val array_exactly_one : t -> f array -> f
val array_atmost_one : t -> f array -> f
val array_copy_fun : t -> int -> f -> f array
val array_copy_fun_t : t -> int -> f -> f array
val array_copy_fun_array : t -> int -> f array -> f GuaCaml.Matrix.matrix
val array_copy_fun_array_t : t -> int -> f array -> f GuaCaml.Matrix.matrix
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