package DAGaml

  1. Overview
  2. Docs
package DAGaml
Legend:
Library
Module
Module type
Parameter
Class
Class type
val arity : (('a * 'b list) * 'c) -> int
val edge_of_mask : bool list -> bool * Ldd_B_u_nux_types.uniq_elem list
val cst : 'a -> int -> ('a * Ldd_B_u_nux_types.uniq_elem list) * (unit, 'b) GuaCaml.Tree.gnext
val is_cst : (('a * Ldd_B_u_nux_types.uniq_elem list) * (unit, 'b) GuaCaml.Tree.gnext) -> 'a option
val get_cst : 'a -> (('b * 'c list) * 'd) -> ('a * Ldd_B_u_nux_types.uniq_elem list) * (unit, 'e) GuaCaml.Tree.gnext
val solve_cons : (unit * (('a * Ldd_B_u_nux_types.uniq_elem list) * 'b) * (('a * Ldd_B_u_nux_types.uniq_elem list) * 'b)) -> ('a * Ldd_B_u_nux_types.uniq_elem list) * ('b, unit * ((bool * Ldd_B_u_nux_types.uniq_elem list) * 'b) * ((bool * Ldd_B_u_nux_types.uniq_elem list) * 'b)) GuaCaml.Utils.merge
val is_const : (('a * Ldd_B_u_nux_types.uniq_elem list) * (unit, 'b) GuaCaml.Tree.gnext) -> 'a option
val solve_and : (unit * ((bool * Ldd_B_u_nux_types.uniq_elem list) * (unit, 'a) GuaCaml.Tree.gnext) * ((bool * Ldd_B_u_nux_types.uniq_elem list) * (unit, 'a) GuaCaml.Tree.gnext)) -> (bool * Ldd_B_u_nux_types.uniq_elem list) * ((unit, 'a) GuaCaml.Tree.gnext, 'b, unit * ((bool * Ldd_B_u_nux_types.uniq_elem list) * (unit, 'a) GuaCaml.Tree.gnext) * ((bool * Ldd_B_u_nux_types.uniq_elem list) * (unit, 'a) GuaCaml.Tree.gnext)) GuaCaml.Utils.merge3
val neg : ((bool * 'a) * 'b) -> (bool * 'a) * 'b
val cneg : 'a -> (('a * 'b) * 'c) -> (bool * 'b) * 'c
val compose_edge : ('a * Ldd_B_u_nux_types.uniq_elem list) -> ('a * Ldd_B_u_nux_types.uniq_elem list) -> bool * Ldd_B_u_nux_types.uniq_elem list
val compose : ('a * Ldd_B_u_nux_types.uniq_elem list) -> (('a * Ldd_B_u_nux_types.uniq_elem list) * 'b) -> (bool * Ldd_B_u_nux_types.uniq_elem list) * 'b
val solve_xor_trivial : (('a * Ldd_B_u_nux_types.uniq_elem list) * (unit, 'b) GuaCaml.Tree.gnext) -> (('a * Ldd_B_u_nux_types.uniq_elem list) * (unit, 'b) GuaCaml.Tree.gnext) -> ((bool * Ldd_B_u_nux_types.uniq_elem list) * (unit, 'b) GuaCaml.Tree.gnext) option
val m3edge_of_edge : ('a * 'b) -> 'a * ('b, 'c, 'd) GuaCaml.Utils.merge3
val solve_xor : (unit * (('a * Ldd_B_u_nux_types.uniq_elem list) * (unit, 'b) GuaCaml.Tree.gnext) * (('a * Ldd_B_u_nux_types.uniq_elem list) * (unit, 'b) GuaCaml.Tree.gnext)) -> (bool * Ldd_B_u_nux_types.uniq_elem list) * ((unit, 'b) GuaCaml.Tree.gnext, 'c, unit * ((bool * Ldd_B_u_nux_types.uniq_elem list) * (unit, 'b) GuaCaml.Tree.gnext) * ((bool * Ldd_B_u_nux_types.uniq_elem list) * (unit, 'b) GuaCaml.Tree.gnext)) GuaCaml.Utils.merge3