package DAGaml

  1. Overview
  2. Docs
package DAGaml
Legend:
Library
Module
Module type
Parameter
Class
Class type
val arity : 'lk Ldd_B_o_nucx_types.edge' -> int
val arity_node : (unit * 'a Ldd_B_o_nucx_types.edge' * 'b Ldd_B_o_nucx_types.edge') -> 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_nucx_types.tag -> char
val pretty_of_tlist : (Ldd_B_o_nucx_types.tag * int) list -> string
val pretty_of_edge : (int * bool * (Ldd_B_o_nucx_types.tag * int) list) -> string
val is_cst : (('a * 'b * 'c list) * ('d, 'e) GuaCaml.Tree.gnext) -> 'b option
val get_cst : bool -> 'a Ldd_B_o_nucx_types.edge' -> 'lk Ldd_B_o_nucx_types.edge'
val is_id : (('a * 'b * (Ldd_B_o_nucx_types.tag * int) list) * ('c, 'd) GuaCaml.Tree.gnext) -> 'b option
val make_id : 'a -> int -> (int * 'a * (Ldd_B_o_nucx_types.tag * int) list) * (int, 'b) GuaCaml.Tree.gnext
val push0_tlist : ?n:int -> 'a -> ('a * int) list -> ('a * int) list
val push0_tag : ?n:int -> Ldd_B_o_nucx_types.tag -> ((int * bool * (Ldd_B_o_nucx_types.tag * int) list) * 'a) -> (int * bool * (Ldd_B_o_nucx_types.tag * int) list) * 'a
val push_U : ?n:int -> 'lk Ldd_B_o_nucx_types.edge' -> 'lk Ldd_B_o_nucx_types.edge'
val push_X : ?n:int -> 'lk Ldd_B_o_nucx_types.edge' -> 'lk Ldd_B_o_nucx_types.edge'
val push_C : ?n:int -> bool -> bool -> 'lk Ldd_B_o_nucx_types.edge' -> 'lk Ldd_B_o_nucx_types.edge'
val detect_oU : 'lk Ldd_B_o_nucx_types.edge' -> int
val detect_oX : 'lk Ldd_B_o_nucx_types.edge' -> int
val detect_oC : bool -> bool -> 'lk Ldd_B_o_nucx_types.edge' -> int
val elim_oU : int -> 'lk Ldd_B_o_nucx_types.edge' -> 'lk Ldd_B_o_nucx_types.edge'
val elim_oX : int -> 'lk Ldd_B_o_nucx_types.edge' -> 'lk Ldd_B_o_nucx_types.edge'
val elim_oC : bool -> bool -> int -> 'lk Ldd_B_o_nucx_types.edge' -> 'lk Ldd_B_o_nucx_types.edge'
val medge_of_edge : ('a * 'b) -> 'a * ('b, 'c) GuaCaml.Utils.merge
val neg : (('a * bool * 'b) * 'c) -> ('a * bool * 'b) * 'c
val cneg : bool -> (('a * bool * 'b) * 'c) -> ('a * bool * 'b) * 'c
val un_neg : (('a * 'b * 'c) * 'd) -> 'b * (('a * bool * 'c) * 'd)
val compose : (int * bool * (Ldd_B_o_nucx_types.tag * int) list) -> ((int * bool * Ldd_B_o_nucx_types.tlist) * 'a Ldd_B_o_nucx_types.next') -> (int * bool * Ldd_B_o_nucx_types.tlist) * 'a Ldd_B_o_nucx_types.next'
val normalize : ((int * bool * (Ldd_B_o_nucx_types.tag * int) list) * 'a Ldd_B_o_nucx_types.next') -> (int * bool * Ldd_B_o_nucx_types.tlist) * 'a Ldd_B_o_nucx_types.next'
val pull_tlist : ((int * bool * (Ldd_B_o_nucx_types.tag * int) list) * (int, 'a) GuaCaml.Tree.gnext) -> (Ldd_B_o_nucx_types.tag * ((int * bool * (Ldd_B_o_nucx_types.tag * int) list) * (int, 'a) GuaCaml.Tree.gnext), bool * 'a) GuaCaml.Utils.merge
val node_pull : ((int * bool * (Ldd_B_o_nucx_types.tag * int) list) * (int, 'a) GuaCaml.Tree.gnext) -> (unit * 'a Ldd_B_o_nucx_types.edge' * 'a Ldd_B_o_nucx_types.edge', 'a * ((unit * (('b * bool * 'c) * 'd) * (('e * bool * 'f) * 'g)) -> unit * (('b * bool * 'c) * 'd) * (('e * bool * 'f) * 'g))) GuaCaml.Utils.merge
val sort_node : (unit * 'a * 'a) -> unit * 'a * 'a
val f_hdtl : ((int * bool * (Ldd_B_o_nucx_types.tag * int) list) * 'a) -> ((Ldd_B_o_nucx_types.tag * int) * ((int * bool * (Ldd_B_o_nucx_types.tag * int) list) * 'a)) option
val edge'm_of_edge : ('a * ('b, 'c) GuaCaml.Tree.gnext) -> 'a * ('b, ('c, 'd) GuaCaml.Utils.merge) GuaCaml.Tree.gnext
val edge'm_of_merge : ('a * (('b, 'c) GuaCaml.Tree.gnext, 'd) GuaCaml.Utils.merge) -> 'a * ('b, ('c, 'd) GuaCaml.Utils.merge) GuaCaml.Tree.gnext
val merge_of_edge'm : ('a * ('b, ('c, 'd) GuaCaml.Utils.merge) GuaCaml.Tree.gnext) -> 'a * (('b, 'c) GuaCaml.Tree.gnext, 'd) GuaCaml.Utils.merge