package DAGaml

  1. Overview
  2. Docs
package DAGaml
Legend:
Library
Module
Module type
Parameter
Class
Class type
val arity_block : Ldd_B_u_nuc_types.block -> int
val arity_edge : (Ldd_B_u_nuc_types.block * 'a) -> int
val neg_edge : (Ldd_B_u_nuc_types.block * 'a) -> Ldd_B_u_nuc_types.block * 'a
val cneg_edge : bool -> (Ldd_B_u_nuc_types.block * 'a) -> Ldd_B_u_nuc_types.block * 'a
val merge_of_edge : ('a * 'b) -> 'a * ('b, 'c) GuaCaml.Utils.merge
val merge3_of_edge : ('a * 'b) -> 'a * ('b, 'c, 'd) GuaCaml.Utils.merge3
val (=>) : bool -> bool -> bool
val make_nU : int -> Ldd_B_u_nuc_types.elem list
val make_nS : int -> Ldd_B_u_nuc_types.elem list
val isS : Ldd_B_u_nuc_types.elem -> bool
val isntS : Ldd_B_u_nuc_types.elem -> bool
val isU : Ldd_B_u_nuc_types.elem -> bool
val isntU : Ldd_B_u_nuc_types.elem -> bool
val isC : Ldd_B_u_nuc_types.elem -> bool
val isntC : Ldd_B_u_nuc_types.elem -> bool
val hasS : Ldd_B_u_nuc_types.block -> bool
val mod2 : int -> bool
val block_arity : Ldd_B_u_nuc_types.block -> int
val edge_arity : (Ldd_B_u_nuc_types.block * 'a) -> int
val get_suc_tag_from_block_suc : Ldd_B_u_nuc_types.elem list -> Ldd_B_u_nuc_types.suc_tag
val suc_is_const : Ldd_B_u_nuc_types.elem list -> bool
val block_is_const : Ldd_B_u_nuc_types.block -> bool option
val edge_is_const : (Ldd_B_u_nuc_types.block * (unit, 'a) GuaCaml.Tree.gnext) -> bool option
val block_c0_to_block_suc : int -> bool * Ldd_B_u_nuc_types.suc_tag * Ldd_B_u_nuc_types.elem list
val block_id_to_block_suc : int -> int -> bool * Ldd_B_u_nuc_types.suc_tag * Ldd_B_u_nuc_types.elem list
val block_choice_to_block_suc : int -> Ldd_B_u_nuc_types.block_choice -> bool * Ldd_B_u_nuc_types.suc_tag * Ldd_B_u_nuc_types.elem list
val push_S_edge : (Ldd_B_u_nuc_types.block * 'a) -> Ldd_B_u_nuc_types.block * 'a
val push_U_edge : (Ldd_B_u_nuc_types.block * 'a) -> Ldd_B_u_nuc_types.block * 'a
val minicheck_suc : Ldd_B_u_nuc_types.elem list -> bool
val get_suc_tag_from_suc : Ldd_B_u_nuc_types.elem list -> Ldd_B_u_nuc_types.suc_tag
val check_suc_tag : Ldd_B_u_nuc_types.suc_tag -> Ldd_B_u_nuc_types.elem list -> bool
val get_maxC_block : Ldd_B_u_nuc_types.block -> int option
val in_block_suc : (bool * Ldd_B_u_nuc_types.suc_tag * Ldd_B_u_nuc_types.elem list) -> bool list -> bool option
val in_block_choice : Ldd_B_u_nuc_types.block_choice -> bool list -> bool option
val in_block : Ldd_B_u_nuc_types.block -> bool list -> bool option
val suc_is_contig : ('a * Ldd_B_u_nuc_types.suc_tag * Ldd_B_u_nuc_types.elem list) -> bool -> bool
val assert_block_suc : int -> (bool * Ldd_B_u_nuc_types.suc_tag * Ldd_B_u_nuc_types.elem list) -> bool -> unit
val check_block_suc : int -> (bool * Ldd_B_u_nuc_types.suc_tag * Ldd_B_u_nuc_types.elem list) -> bool -> bool
val assert_block_choice : int -> bool -> Ldd_B_u_nuc_types.block_choice -> unit
val check_block_choice : int -> bool -> Ldd_B_u_nuc_types.block_choice -> bool
val assert_block : Ldd_B_u_nuc_types.block -> bool -> unit
val check_block : Ldd_B_u_nuc_types.block -> bool -> bool
val check_edge : (Ldd_B_u_nuc_types.block * ('a, 'b) GuaCaml.Tree.gnext) -> bool
val reduce_block_suc : bool -> int -> bool -> bool -> Ldd_B_u_nuc_types.elem list -> Ldd_B_u_nuc_types.block
val reduce_block_choice : bool -> int -> bool -> Ldd_B_u_nuc_types.block_choice -> Ldd_B_u_nuc_types.block
val reduce_block : Ldd_B_u_nuc_types.block -> bool -> Ldd_B_u_nuc_types.block
val suc_liste_to_block : bool -> bool -> Ldd_B_u_nuc_types.elem list -> Ldd_B_u_nuc_types.block
val suc_liste_to_edge : bool -> bool -> (Ldd_B_u_nuc_types.elem list * ('a, 'b) GuaCaml.Tree.gnext) -> Ldd_B_u_nuc_types.block * ('a, 'b) GuaCaml.Tree.gnext
val push_C0_block_suc : bool -> bool -> bool -> int -> (bool * Ldd_B_u_nuc_types.suc_tag * Ldd_B_u_nuc_types.elem list) -> bool -> Ldd_B_u_nuc_types.block
val push_C0_block_choice : bool -> bool -> bool -> int -> bool -> Ldd_B_u_nuc_types.block_choice -> Ldd_B_u_nuc_types.block
val push_C0_block : bool -> bool -> Ldd_B_u_nuc_types.block -> bool -> Ldd_B_u_nuc_types.block
val push_C0_edge : bool -> bool -> (Ldd_B_u_nuc_types.block * ('a, 'b) GuaCaml.Tree.gnext) -> Ldd_B_u_nuc_types.block * ('a, 'b) GuaCaml.Tree.gnext
val count_nS_suc : Ldd_B_u_nuc_types.elem list -> int
val count_nS_block_suc : ('a * 'b * Ldd_B_u_nuc_types.elem list) -> int
val count_nS_block_choice : Ldd_B_u_nuc_types.block_choice -> int
val count_nS_block : Ldd_B_u_nuc_types.block -> int
val count_nS_edge : (Ldd_B_u_nuc_types.block * 'a) -> int
val make_block_S : bool -> int -> Ldd_B_u_nuc_types.block
val make_block_C0 : bool -> int -> Ldd_B_u_nuc_types.block
val make_edge_C0 : bool -> int -> Ldd_B_u_nuc_types.block * (unit, 'a) GuaCaml.Tree.gnext
val make_block_U : bool -> int -> bool -> Ldd_B_u_nuc_types.block
val arity_merge : (Ldd_B_u_nuc_types.block * 'a) -> int
val arity_merge3 : (Ldd_B_u_nuc_types.block * 'a) -> int
val make_cst : bool -> int -> Ldd_B_u_nuc_types.block * (unit, 'a) GuaCaml.Tree.gnext
val get_root : bool -> (Ldd_B_u_nuc_types.block * 'a) -> Ldd_B_u_nuc_types.block * (unit, 'b) GuaCaml.Tree.gnext
val make_id : bool -> int -> int -> Ldd_B_u_nuc_types.block * (unit, 'a) GuaCaml.Tree.gnext
val cneg : bool -> (Ldd_B_u_nuc_types.block * 'a) -> Ldd_B_u_nuc_types.block * 'a
val check_peval : 'a option list -> bool
val check_opeval : 'a option list option -> bool
val compose_opeval : GuaCaml.Utils.peval option -> GuaCaml.Utils.peval option -> GuaCaml.Utils.peval option
val select : bool -> (unit * 'a * 'a) -> 'a
val compose_mask_edge : bool list -> (Ldd_B_u_nuc_types.block * ('a, 'b) GuaCaml.Tree.gnext) -> Ldd_B_u_nuc_types.block * ('a, 'b) GuaCaml.Tree.gnext