package DAGaml

  1. Overview
  2. Docs
package DAGaml
Legend:
Library
Module
Module type
Parameter
Class
Class type
module M : sig ... end
type ident = BinUbdag.Make(Model.M).ident = {
  1. height : int;
  2. index : int;
}
type next' = ident M.next'
type edge' = ident M.edge'
type node' = ident M.node'
type manager = BinUbdag.Make(Model.M).manager = {
  1. mutable man : GuaCaml.H2Array.t array;
}
val default_layer : int
val makeman : int -> manager
val default_hsize : int
val newman : unit -> manager
val getsize : manager -> int
val number_of_nodes : manager -> int
val dump_stats : manager -> string GuaCaml.Tree.tree
val getsize_edge : (M.edge * 'a) -> int
val getsize_edges : (M.edge * 'a) list -> int
val dump_estats : manager -> (M.edge * 'a) list -> string GuaCaml.Tree.tree
val string_of_ident : ident -> string
val string_of_next' : (M.leaf, ident) GuaCaml.Tree.gnext -> string
val height_next : ('a, ident) GuaCaml.Tree.gnext -> int
val height_edge : ('a * ('b, ident) GuaCaml.Tree.gnext) -> int
val height_node : ('a * ('b * ('c, ident) GuaCaml.Tree.gnext) * ('d * ('e, ident) GuaCaml.Tree.gnext)) -> int
val resize_double : manager -> unit
val push : manager -> ident M.node' -> ident
val pull : manager -> ident -> ident M.node'
val dump : manager -> ident M.edge' list -> string GuaCaml.Tree.tree
val load : string GuaCaml.Tree.tree -> manager * ident M.edge' list
val tof_edge' : GuaCaml.Io.ToF.stream -> ident M.edge' -> unit
val true_height : manager -> int
val bw : ?destruct:bool -> manager -> GuaCaml.BTools.ToBStream.Channel.t -> edge' list -> unit
val combine_layerized_file : ?normalize:bool -> in_channel array -> out_channel -> unit
val to_barray : ?destruct:bool -> manager -> edge' list -> GuaCaml.BTools.BArray.t
val of_barray : GuaCaml.BTools.BArray.t -> manager * ident M.edge' list
val export : manager -> ((ident -> 'xnode) -> ident -> 'xnode) -> ((unit -> 'xnode) M.node' -> 'xnode) -> ident -> 'xnode
val traverse : manager -> edge' -> bool
val copy_into : manager -> manager -> edge' -> edge'
val copy_list_into : manager -> manager -> edge' list -> edge' list
val reachable : ?clean:bool -> ?hr:bool -> manager -> edge' list -> unit
val collect : ?hr:bool -> manager -> edge' list -> unit
val compact : manager -> ?hr:bool -> ?normalize:bool -> edge' list -> edge' list
val keep_clean : ?hr:bool -> ?compactify:bool -> ?normalize:bool -> manager -> edge' list -> edge' list
type !'lk bw_next' = 'lk GuaCaml.BTools.bw -> 'lk M.next' GuaCaml.BTools.bw
type !'lk bw_node' = 'lk GuaCaml.BTools.bw -> 'lk M.node' GuaCaml.BTools.bw
type !'lk bw_edge' = 'lk GuaCaml.BTools.bw -> 'lk M.edge' GuaCaml.BTools.bw
module BW : sig ... end
val bw_node_list : ident bw_node' -> manager -> GuaCaml.BTools.ToBStream.Channel.t -> ident list -> unit
val bw_edge_list : ident bw_node' -> ident bw_edge' -> manager -> GuaCaml.BTools.ToBStream.Channel.t -> edge' list -> unit
type !'lk br_next' = 'lk GuaCaml.BTools.br -> 'lk M.next' GuaCaml.BTools.br
type !'lk br_node' = 'lk GuaCaml.BTools.br -> 'lk M.node' GuaCaml.BTools.br
type !'lk br_edge' = 'lk GuaCaml.BTools.br -> 'lk M.edge' GuaCaml.BTools.br
module BR : sig ... end
type !'lk bre_node' = 'lk M.edge' GuaCaml.BTools.br -> ('lk M.node' -> 'lk) -> 'lk M.edge' GuaCaml.BTools.br
type !'lk bre_edge' = 'lk M.edge' GuaCaml.BTools.br -> 'lk M.edge' GuaCaml.BTools.br
module BRE : sig ... end
val to_stree : manager -> GuaCaml.Tree.stree
module ToF : sig ... end
module OfF : sig ... end