package DAGaml

  1. Overview
  2. Docs
package DAGaml
Legend:
Library
Module
Module type
Parameter
Class
Class type
val arity : 'a Ldd_B_u_nu_types.edge' -> int
val arity_node : (unit * 'a Ldd_B_u_nu_types.edge' * 'b Ldd_B_u_nu_types.edge') -> int
val push_U : ?n:int -> 'a Ldd_B_u_nu_types.edge' -> 'a Ldd_B_u_nu_types.edge'
val split_by_uniq : 'a list -> Ldd_B_u_nu_types.uniq -> 'a list * 'a list
val edge_of_mask : bool list -> bool * Ldd_B_u_nu_types.uniq_elem list
val support_of_edge : (('a * Ldd_B_u_nu_types.uniq_elem list) * 'b) -> bool list
val solve_cons : (unit * (('a * Ldd_B_u_nu_types.uniq_elem list) * 'b) * (('a * Ldd_B_u_nu_types.uniq_elem list) * 'b)) -> ('a * Ldd_B_u_nu_types.uniq_elem list) * ('b, unit * ((bool * Ldd_B_u_nu_types.uniq_elem list) * 'b) * ((bool * Ldd_B_u_nu_types.uniq_elem list) * 'b)) GuaCaml.Utils.merge
val make_cst : 'a -> int -> ('a * Ldd_B_u_nu_types.uniq_elem list) * (unit, 'b) GuaCaml.Tree.gnext
val cst : 'a -> int -> ('a * Ldd_B_u_nu_types.uniq_elem list) * (unit, 'b) GuaCaml.Tree.gnext
val get_root : 'a -> 'b Ldd_B_u_nu_types.edge' -> ('a * Ldd_B_u_nu_types.uniq_elem list) * (unit, 'c) GuaCaml.Tree.gnext
val get_cst : 'a -> 'b Ldd_B_u_nu_types.edge' -> ('a * Ldd_B_u_nu_types.uniq_elem list) * (unit, 'c) GuaCaml.Tree.gnext
val is_cst : (('a * 'b) * (unit, 'c) GuaCaml.Tree.gnext) -> 'a option
val neg : ((bool * 'a) * 'b) -> (bool * 'a) * 'b
val cneg : 'a -> (('a * 'b) * 'c) -> (bool * 'b) * 'c
val compose_edge : ('a * Ldd_B_u_nu_types.uniq_elem list) -> ('a * Ldd_B_u_nu_types.uniq_elem list) -> bool * Ldd_B_u_nu_types.uniq_elem list
val compose : ('a * Ldd_B_u_nu_types.uniq_elem list) -> (('a * Ldd_B_u_nu_types.uniq_elem list) * 'b) -> (bool * Ldd_B_u_nu_types.uniq_elem list) * 'b
val assign : bool option list -> (('a * Ldd_B_u_nu_types.uniq_elem list) * (unit, GuaCaml.Utils.peval option * 'b) GuaCaml.Tree.gnext) -> ('a * Ldd_B_u_nu_types.uniq_elem list) * (unit, GuaCaml.Utils.peval option * 'b) GuaCaml.Tree.gnext