package DAGaml

  1. Overview
  2. Docs
package DAGaml
Legend:
Library
Module
Module type
Parameter
Class
Class type
val arity_node : (unit * ((int * 'a) * 'b) * ((int * 'c) * 'd)) -> int
module ToS : sig ... end
module ToB : sig ... end
module OfB : sig ... end
module IoB : sig ... end
module ToBStream : sig ... end
module OfBStream : sig ... end
module ToBa : sig ... end
module OfBa : sig ... end
val char_of_tag : Ldd_B_o_uc0_types.tag -> char
val pretty_of_tlist : (Ldd_B_o_uc0_types.tag * int) list -> string
val pretty_of_edge : (int * (Ldd_B_o_uc0_types.tag * int) list) -> string
val is_cst : (('a * 'b list) * ('c * 'd, 'e) GuaCaml.Tree.gnext) -> 'c option
val cst : 'a -> 'b -> ('b * 'c list) * ('a * 'b, 'd) GuaCaml.Tree.gnext
val arity : (('a * 'b) * 'c) -> 'a
val get_cst : 'a -> (('b * 'c) * 'd) -> ('b * 'e list) * ('a * 'b, 'f) GuaCaml.Tree.gnext
val push0_tlist : ?n:int -> 'a -> ('a * int) list -> ('a * int) list
val push_U : ?n:int -> ((int * (Ldd_B_o_uc0_types.tag * int) list) * ('a * int, 'b) GuaCaml.Tree.gnext) -> (int * (Ldd_B_o_uc0_types.tag * int) list) * ('a * int, 'b) GuaCaml.Tree.gnext
val push_C0 : ?n:int -> bool -> ((int * (Ldd_B_o_uc0_types.tag * int) list) * (bool * int, 'a) GuaCaml.Tree.gnext) -> (int * (Ldd_B_o_uc0_types.tag * int) list) * (bool * int, 'a) GuaCaml.Tree.gnext
val push_ttag : (Ldd_B_o_uc0_types.tag * int) -> ((int * (Ldd_B_o_uc0_types.tag * int) list) * (bool * int, 'a) GuaCaml.Tree.gnext) -> (int * (Ldd_B_o_uc0_types.tag * int) list) * (bool * int, 'a) GuaCaml.Tree.gnext
val push_tag : ?n:int -> Ldd_B_o_uc0_types.tag -> ((int * (Ldd_B_o_uc0_types.tag * int) list) * (bool * int, 'a) GuaCaml.Tree.gnext) -> (int * (Ldd_B_o_uc0_types.tag * int) list) * (bool * int, 'a) GuaCaml.Tree.gnext
val medge_of_edge : ('a * 'b) -> 'a * ('b, 'c) GuaCaml.Utils.merge
val compose : (int * (Ldd_B_o_uc0_types.tag * int) list) -> ((int * (Ldd_B_o_uc0_types.tag * int) list) * (bool * int, 'a) GuaCaml.Tree.gnext) -> (int * (Ldd_B_o_uc0_types.tag * int) list) * (bool * int, 'a) GuaCaml.Tree.gnext
val normalize : ((int * (Ldd_B_o_uc0_types.tag * int) list) * (bool * int, 'a) GuaCaml.Tree.gnext) -> (int * (Ldd_B_o_uc0_types.tag * int) list) * (bool * int, 'a) GuaCaml.Tree.gnext
val pull_tlist : ((int * (Ldd_B_o_uc0_types.tag * int) list) * ('a * int, 'b) GuaCaml.Tree.gnext) -> (Ldd_B_o_uc0_types.tag * ((int * (Ldd_B_o_uc0_types.tag * int) list) * ('a * int, 'b) GuaCaml.Tree.gnext), 'b) GuaCaml.Utils.merge
val node_pull : ((int * (Ldd_B_o_uc0_types.tag * int) list) * (bool * int, 'a) GuaCaml.Tree.gnext) -> (unit * ((int * (Ldd_B_o_uc0_types.tag * int) list) * (bool * int, 'a) GuaCaml.Tree.gnext) * ((int * (Ldd_B_o_uc0_types.tag * int) list) * (bool * int, 'a) GuaCaml.Tree.gnext), 'a * ('b -> 'b)) GuaCaml.Utils.merge
val solve_and : (unit * (('a * 'b list) * (bool * 'c, 'd) GuaCaml.Tree.gnext) * (('a * 'b list) * (bool * 'c, 'd) GuaCaml.Tree.gnext)) -> (('a * 'b list) * (bool * 'c, 'd) GuaCaml.Tree.gnext, ('a * 'e list) * (unit * (('a * 'b list) * (bool * 'c, 'd) GuaCaml.Tree.gnext) * (('a * 'b list) * (bool * 'c, 'd) GuaCaml.Tree.gnext))) GuaCaml.Utils.merge
val solve_or : (unit * (('a * 'b list) * (bool * 'c, 'd) GuaCaml.Tree.gnext) * (('a * 'b list) * (bool * 'c, 'd) GuaCaml.Tree.gnext)) -> (('a * 'b list) * (bool * 'c, 'd) GuaCaml.Tree.gnext, ('a * 'e list) * (unit * (('a * 'b list) * (bool * 'c, 'd) GuaCaml.Tree.gnext) * (('a * 'b list) * (bool * 'c, 'd) GuaCaml.Tree.gnext))) GuaCaml.Utils.merge
val solve_xor : (unit * (('a * 'b list) * (bool * 'a, 'c) GuaCaml.Tree.gnext) * (('a * 'b list) * (bool * 'a, 'c) GuaCaml.Tree.gnext)) -> (('a * 'b list) * (bool * 'a, 'c) GuaCaml.Tree.gnext, ('a * 'd list) * (unit * (('a * 'b list) * (bool * 'a, 'c) GuaCaml.Tree.gnext) * (('a * 'b list) * (bool * 'a, 'c) GuaCaml.Tree.gnext))) GuaCaml.Utils.merge
val cons_and : (unit * (('a * 'b list) * (bool * 'c, 'd) GuaCaml.Tree.gnext) * (('a * 'b list) * (bool * 'c, 'd) GuaCaml.Tree.gnext)) -> ('a * 'b list) * ((bool * 'c, 'd) GuaCaml.Tree.gnext, 'e, unit * (('a * 'b list) * (bool * 'c, 'd) GuaCaml.Tree.gnext) * (('a * 'b list) * (bool * 'c, 'd) GuaCaml.Tree.gnext)) GuaCaml.Utils.merge3
val cons_or : (unit * (('a * 'b list) * (bool * 'c, 'd) GuaCaml.Tree.gnext) * (('a * 'b list) * (bool * 'c, 'd) GuaCaml.Tree.gnext)) -> ('a * 'b list) * ((bool * 'c, 'd) GuaCaml.Tree.gnext, 'e, unit * (('a * 'b list) * (bool * 'c, 'd) GuaCaml.Tree.gnext) * (('a * 'b list) * (bool * 'c, 'd) GuaCaml.Tree.gnext)) GuaCaml.Utils.merge3
val cons_xor : (unit * (('a * 'b list) * (bool * 'a, 'c) GuaCaml.Tree.gnext) * (('a * 'b list) * (bool * 'a, 'c) GuaCaml.Tree.gnext)) -> ('a * 'b list) * ((bool * 'a, 'c) GuaCaml.Tree.gnext, 'd, unit * (('a * 'b list) * (bool * 'a, 'c) GuaCaml.Tree.gnext) * (('a * 'b list) * (bool * 'a, 'c) GuaCaml.Tree.gnext)) GuaCaml.Utils.merge3