package GuaCaml

  1. Overview
  2. Docs
package GuaCaml
Legend:
Library
Module
Module type
Parameter
Class
Class type
exception StrError of string
type (!'edge, !'node) merge =
  1. | MEdge of 'edge
  2. | MNode of 'node
val dump_merge : ('a -> 'b -> bool list) -> ('c -> 'b -> bool list) -> ('a, 'c) merge -> 'b -> bool list
val load_merge : (bool list -> 'a * 'b) -> (bool list -> 'c * 'b) -> 'd -> bool list -> ('a, 'c) merge * 'b
val iob_merge : (('a -> 'b -> bool list) * (bool list -> 'c * 'd)) -> (('e -> 'b -> bool list) * (bool list -> 'f * 'd)) -> (('a, 'e) merge -> 'b -> bool list) * ('g -> bool list -> ('c, 'f) merge * 'd)
type (!'return, !'node) pull_request = ('return, 'node -> 'return) merge
type (!'edge, !'node) unmerge = ('edge * 'edge, 'node) pull_request
type (!'tag, !'edge, !'node) unmerge_tagged = ('tag * 'edge * 'edge, 'node) pull_request
val string_of_gnode : ('a -> string) -> ('b -> string) -> ('a, 'b) Tree.gnext -> string
val gnode : ('a -> string) -> ('b -> string) -> ('a, 'b) Tree.gnext -> string
val bw_gnode : (BTools.ToBStream.Channel.t -> 'a -> 'b) -> (BTools.ToBStream.Channel.t -> 'c -> 'b) -> BTools.ToBStream.Channel.t -> ('a, 'c) Tree.gnext -> 'b
val gnode_leaf : ('a, 'b) Tree.gnext -> 'a
val gnode_node : ('a, 'b) Tree.gnext -> 'b
val dump_gnode : ('a -> 'b -> bool list) -> ('c -> 'b -> bool list) -> ('a, 'c) Tree.gnext -> 'b -> bool list
val load_gnode : (bool list -> 'a * 'b) -> (bool list -> 'c * 'b) -> bool list -> ('a, 'c) Tree.gnext * 'b
val kldump_gnode : ('a -> 'b -> bool list * 'c) -> ('d -> 'b -> bool list * 'c) -> ('a, 'd) Tree.gnext -> 'b -> bool list * 'c
val klload_gnode : ((bool list * 'a) -> 'b * 'c) -> ((bool list * 'a) -> 'd * 'e) -> (bool list * 'a) -> ('b, 'd) Tree.gnext
val kliob_gnode : (('a -> 'b -> bool list * 'c) * ((bool list * 'd) -> 'e * 'f)) -> (('g -> 'b -> bool list * 'c) * ((bool list * 'd) -> 'h * 'i)) -> (('a, 'g) Tree.gnext -> 'b -> bool list * 'c) * ((bool list * 'd) -> ('e, 'h) Tree.gnext)
val gnode_is_leaf : ('a, 'b) Tree.gnext -> bool
type (!'stop, !'left, !'right, !'both) binpull =
  1. | MStop of 'stop
  2. | Go0 of 'left
  3. | Go1 of 'right
  4. | MPull of 'both
type (!'return, !'edge, !'node) binpath = ('return, 'edge -> 'return, 'edge -> 'return, 'node -> 'return) binpull
type (!'edge, !'cons, !'node) merge3 =
  1. | M3Edge of 'edge
  2. | M3Cons of 'cons
  3. | M3Node of 'node
type (!'edge, !'node, !'leaf, !'link) node =
  1. | TNode of 'node * (('edge, 'node, 'leaf, 'link) edge * ('edge, 'node, 'leaf, 'link) edge)
  2. | TLeaf of 'leaf
and (!'edge, !'node, !'leaf, !'link) edge = 'edge * ('edge, 'node, 'leaf, 'link) node
type (!'pnode, !'tnode) pt_node =
  1. | PTree of 'pnode
  2. | TTree of 'tnode
val pnext_of_next : ('a, 'b) Tree.gnext -> ('a, 'c option * 'b) Tree.gnext
val pedge_of_edge : ('a * ('b, 'c) Tree.gnext) -> 'a * ('b, 'd option * 'c) Tree.gnext
val pnode_of_node : ('a * ('b * ('c, 'd) Tree.gnext) * ('e * ('f, 'g) Tree.gnext)) -> 'a * ('b * ('c, 'h option * 'd) Tree.gnext) * ('e * ('f, 'i option * 'g) Tree.gnext)
val merge_of_edge : ('a * 'b) -> 'a * ('b, 'c) merge
val merge3_of_edge : ('a * 'b) -> 'a * ('b, 'c, 'd) merge3
val merge : ('a -> string) -> ('b -> string) -> ('a, 'b) merge -> string
val emerge : 'a STools.ToS.t -> 'b STools.ToS.t -> ('a * 'b) -> string
val merge3 : ('a -> string) -> ('b -> string) -> ('a, 'b, 'b) merge3 -> string
val emerge3 : 'a STools.ToS.t -> 'b STools.ToS.t -> ('a * 'b) -> string
val o3s_gnode : 'leaf BTools.IoB.t -> 'node BTools.IoB.t -> ('leaf, 'node) Tree.gnext BTools.IoB.t
val mp_of_bool : bool -> string
val mp_char_of_bool : bool -> char
val pm_of_bool : bool -> string
val pm_char_of_bool : bool -> char
val bool_of_pm : string -> bool
val bool_of_mp : string -> bool
val bool_of_pm_char : char -> bool
val bool_of_mp_char : char -> bool
val consensus : (('a * 'b) -> 'c * ('d * 'e) option) -> 'a list -> 'b list -> 'c list * ('d list * 'e list)
val consensus0 : (('a * 'b) -> 'c * 'd option) -> 'a list -> 'b list -> 'c list * 'd list
val consensus2 : (('a * 'b) -> 'c * ('d option * 'e option)) -> 'a list -> 'b list -> 'c list * 'd list * 'e list
val consensus3 : (('a * 'b) -> 'c option * 'd option) -> 'a list -> 'b list -> 'c list * 'd list
val compose : 'a -> 'a list -> 'a list -> 'a list
type peval = bool option list
type opeval = peval option
type quant = bool list
type opquant = quant option
val stree_of_peval : bool option list STools.ToS.t
val stree_of_opeval : bool option list option STools.ToS.t
val reduce_opeval : opeval -> opeval
val preduce_pnode : ('a, opeval * 'b) Tree.gnext -> ('a, opeval * 'b) Tree.gnext
val preduce_pedge : ('a * ('b, opeval * 'c) Tree.gnext) -> 'a * ('b, opeval * 'c) Tree.gnext
val gen_peval : int -> bool option list IterExtra.iter
val compose_peval : peval -> peval -> peval
val compose_opeval : peval option -> peval option -> peval option
val compose_peval_opeval : peval -> peval option -> peval option
val default_eval_node : (bool option list -> 'a -> 'b) -> bool option list -> (unit * 'a * 'a) -> ('b, unit * 'b * 'b) merge
val print_bstream : ?text:string -> bool list -> unit
val sort_node : (unit * 'a * 'a) -> unit * 'a * 'a
val edge'm_of_edge : ('a * ('b, 'c) Tree.gnext) -> 'a * ('b, ('c, 'd) merge) Tree.gnext
val edge'm_of_merge : ('a * (('b, 'c) Tree.gnext, 'd) merge) -> 'a * ('b, ('c, 'd) merge) Tree.gnext
val merge_of_edge'm : ('a * ('b, ('c, 'd) merge) Tree.gnext) -> 'a * (('b, 'c) Tree.gnext, 'd) merge