package DAGaml

  1. Overview
  2. Docs
package DAGaml
Legend:
Library
Module
Module type
Parameter
Class
Class type
val arity : (Ldd_B_u_nuc_types.block * 'a) -> int
val cneg : bool -> (Ldd_B_u_nuc_types.block * 'a) -> Ldd_B_u_nuc_types.block * 'a
val un_neg : (Ldd_B_u_nuc_types.block * 'a) -> bool * (Ldd_B_u_nuc_types.block * 'a)
val is_cst : (Ldd_B_u_nuc_types.block * 'a) -> bool option
val cst : bool -> int -> Ldd_B_u_nuc_types.block * (unit, 'a) GuaCaml.Tree.gnext
val var : bool -> int -> int -> Ldd_B_u_nuc_types.block * (unit, 'a) GuaCaml.Tree.gnext
val get_cst : bool -> (Ldd_B_u_nuc_types.block * 'a) -> Ldd_B_u_nuc_types.block * (unit, 'b) GuaCaml.Tree.gnext
val edge_nop : bool -> int -> Ldd_B_u_nuc_types.block
val compose_mask : bool list -> (Ldd_B_u_nuc_types.block * ('a, 'b) GuaCaml.Tree.gnext) -> Ldd_B_u_nuc_types.block * ('a, 'b) GuaCaml.Tree.gnext
val sort_node : (unit * 'a * 'a) -> unit * 'a * 'a
val edge'm_of_edge : 'lk Ldd_B_u_nuc_types.edge' -> 'lk Ldd_B_u_nuc_types.edge'm
val edge'm_of_merge : 'lk Ldd_B_u_nuc_types.emerge -> 'lk Ldd_B_u_nuc_types.edge'm
val merge_of_edge'm : 'lk Ldd_B_u_nuc_types.edge'm -> 'lk Ldd_B_u_nuc_types.emerge
val ddl_cons : bool
val ddl_and : bool
val ddl_xor : bool
val block_is_singleton : Ldd_B_u_nuc_types.block -> bool
val solve_cons_id_suc_no_merge : int -> 'a -> Ldd_B_u_nuc_types.elem list -> (bool * Ldd_B_u_nuc_types.suc_tag * Ldd_B_u_nuc_types.elem list) * int * int * ('a * Ldd_B_u_nuc_types.suc_tag * Ldd_B_u_nuc_types.elem list)
val final_cons_ifsuc2 : int -> bool -> bool -> (Ldd_B_u_nuc_types.block_suc * 'a) -> (Ldd_B_u_nuc_types.block_suc * 'b) -> Ldd_B_u_nuc_types.block * ('c, unit * (Ldd_B_u_nuc_types.block * 'a) * (Ldd_B_u_nuc_types.block * 'b)) GuaCaml.Utils.merge
val find_consensus_block_suc : Ldd_B_u_nuc_types.elem list -> Ldd_B_u_nuc_types.elem list -> int option
val print_node : 'a -> 'b -> unit
val pull_C : int -> bool -> int -> bool -> Ldd_B_u_nuc_types.elem list -> bool -> Ldd_B_u_nuc_types.block * Ldd_B_u_nuc_types.block
exception Return_False
val factoUU : int -> bool -> bool -> ((bool * 'a * Ldd_B_u_nuc_types.elem list) * ('b, 'c) GuaCaml.Tree.gnext) -> ((bool * 'd * Ldd_B_u_nuc_types.elem list) * ('e, 'f) GuaCaml.Tree.gnext) -> Ldd_B_u_nuc_types.block * (unit * (Ldd_B_u_nuc_types.block * ('b, 'c) GuaCaml.Tree.gnext) * (Ldd_B_u_nuc_types.block * ('e, 'f) GuaCaml.Tree.gnext))
val final_and_ifsuc2 : int -> bool -> bool -> ((bool * 'a * Ldd_B_u_nuc_types.elem list) * ('b, 'c) GuaCaml.Tree.gnext) -> ((bool * 'd * Ldd_B_u_nuc_types.elem list) * ('e, 'f) GuaCaml.Tree.gnext) -> Ldd_B_u_nuc_types.block * ('g, 'h, unit * (Ldd_B_u_nuc_types.block * ('b, 'c) GuaCaml.Tree.gnext) * (Ldd_B_u_nuc_types.block * ('e, 'f) GuaCaml.Tree.gnext)) GuaCaml.Utils.merge3
val solve_xor_id_suc_no_merge : int -> 'a -> Ldd_B_u_nuc_types.elem list -> (bool * Ldd_B_u_nuc_types.suc_tag * Ldd_B_u_nuc_types.elem list) * int * int * ('a * Ldd_B_u_nuc_types.suc_tag * Ldd_B_u_nuc_types.elem list)
val final_xor_ifsuc2 : int -> 'a -> 'a -> ((bool * 'b * Ldd_B_u_nuc_types.elem list) * ('c, 'd) GuaCaml.Tree.gnext) -> ((bool * 'e * Ldd_B_u_nuc_types.elem list) * ('f, 'g) GuaCaml.Tree.gnext) -> Ldd_B_u_nuc_types.block * ('h, 'i, unit * (Ldd_B_u_nuc_types.block * ('c, 'd) GuaCaml.Tree.gnext) * (Ldd_B_u_nuc_types.block * ('f, 'g) GuaCaml.Tree.gnext)) GuaCaml.Utils.merge3
val pnode_of_node : (unit, 'a) GuaCaml.Tree.gnext -> (unit, 'b option * 'a) GuaCaml.Tree.gnext
val pedge_of_edge : ('a * (unit, 'b) GuaCaml.Tree.gnext) -> 'a * (unit, 'c option * 'b) GuaCaml.Tree.gnext
val opquant_of_quant : bool list -> bool list option
val compose_quant : bool list -> bool list -> bool list
val compose_opquant : bool list option -> bool list option -> bool list option
val compose_qnext : bool list -> (unit, bool list option * 'a) GuaCaml.Tree.gnext -> (unit, bool list option * 'a) GuaCaml.Tree.gnext
val quant_block_suc : bool list -> bool -> int -> Ldd_B_u_nuc_types.block_suc -> (unit, bool list option * 'a) GuaCaml.Tree.gnext -> Ldd_B_u_nuc_types.block * (unit, bool list option * 'a) GuaCaml.Tree.gnext
val quant_block_choice : bool list -> bool -> int -> (unit, bool list option * 'a) GuaCaml.Tree.gnext -> Ldd_B_u_nuc_types.block_choice -> Ldd_B_u_nuc_types.block * (unit, bool list option * 'a) GuaCaml.Tree.gnext
val quant_qedge : bool list -> (Ldd_B_u_nuc_types.block * (unit, bool list option * 'a) GuaCaml.Tree.gnext) -> Ldd_B_u_nuc_types.block * (unit, bool list option * 'a) GuaCaml.Tree.gnext
val quant_qnode : bool list -> (unit * (Ldd_B_u_nuc_types.block * (unit, bool list option * 'a) GuaCaml.Tree.gnext) * (Ldd_B_u_nuc_types.block * (unit, bool list option * 'b) GuaCaml.Tree.gnext)) -> unit * (Ldd_B_u_nuc_types.block * (unit, bool list option * 'a) GuaCaml.Tree.gnext) * (Ldd_B_u_nuc_types.block * (unit, bool list option * 'b) GuaCaml.Tree.gnext)
val quant_node : bool list -> (unit * (Ldd_B_u_nuc_types.block * (unit, 'a) GuaCaml.Tree.gnext) * (Ldd_B_u_nuc_types.block * (unit, 'b) GuaCaml.Tree.gnext)) -> unit * (Ldd_B_u_nuc_types.block * (unit, bool list option * 'a) GuaCaml.Tree.gnext) * (Ldd_B_u_nuc_types.block * (unit, bool list option * 'b) GuaCaml.Tree.gnext)
val solve_quant : bool list -> 'i Ldd_B_u_nuc_types.qnode -> (Ldd_B_u_nuc_types.block * (unit, 'a) GuaCaml.Tree.gnext, unit * (Ldd_B_u_nuc_types.block * (unit, bool list option * 'i) GuaCaml.Tree.gnext) * (Ldd_B_u_nuc_types.block * (unit, bool list option * 'i) GuaCaml.Tree.gnext), unit * (Ldd_B_u_nuc_types.block * (unit, bool list option * 'i) GuaCaml.Tree.gnext) * (Ldd_B_u_nuc_types.block * (unit, bool list option * 'i) GuaCaml.Tree.gnext)) GuaCaml.Utils.merge3