package DAGaml

  1. Overview
  2. Docs
package DAGaml
Legend:
Library
Module
Module type
Parameter
Class
Class type
val arity : (('a * 'b) * 'c) -> 'a
val arity_node : (unit * ((int * 'a) * 'b) * ((int * 'c) * 'd)) -> int
val pushU : ?n:int -> ((int * 'a) * 'b) -> (int * 'a) * 'b
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 pretty_edge : (int * int) -> string
val cst : 'a -> int -> (int * int) * ('a, 'b) GuaCaml.Tree.gnext
val get_cst : 'a -> ((int * 'b) * 'c) -> (int * int) * ('a, 'd) GuaCaml.Tree.gnext
val is_cst : (('a * 'b) * ('c, 'd) GuaCaml.Tree.gnext) -> 'c option
val compose : ('a * 'b) -> (('b * 'c) * 'd) -> ('a * 'c) * 'd
val node_pull : ((int * int) * ('a, 'b) GuaCaml.Tree.gnext) -> (unit * ((int * int) * ('a, 'b) GuaCaml.Tree.gnext) * ((int * int) * ('a, 'b) GuaCaml.Tree.gnext), 'b * ((unit * 'c * 'd) -> unit * 'c * 'd)) GuaCaml.Utils.merge
val solve_cons : (unit * ((int * 'a) * 'b) * ((int * 'a) * 'b)) -> ((int * 'a) * 'b, (int * int) * (unit * ((int * 'a) * 'b) * ((int * 'a) * 'b))) GuaCaml.Utils.merge
val sort_node : (unit * 'a * 'a) -> unit * 'a * 'a
val solve_and : (unit * (('a * 'b) * (bool, 'c) GuaCaml.Tree.gnext) * (('a * 'b) * (bool, 'c) GuaCaml.Tree.gnext)) -> (('a * 'b) * (bool, 'c) GuaCaml.Tree.gnext, ('a * 'b) * (unit * (('b * 'b) * (bool, 'c) GuaCaml.Tree.gnext) * (('b * 'b) * (bool, 'c) GuaCaml.Tree.gnext))) GuaCaml.Utils.merge
val solve_xor : (unit * ((int * int) * (bool, 'a) GuaCaml.Tree.gnext) * ((int * int) * (bool, 'a) GuaCaml.Tree.gnext)) -> ((int * int) * (bool, 'a) GuaCaml.Tree.gnext, (int * int) * (unit * ((int * int) * (bool, 'a) GuaCaml.Tree.gnext) * ((int * int) * (bool, 'a) GuaCaml.Tree.gnext))) GuaCaml.Utils.merge
val solve_node : (unit * ((int * int) * 'a) * ((int * int) * 'a)) -> (int * int) * ('a, unit * ((int * int) * 'a) * ((int * int) * 'a)) GuaCaml.Utils.merge
val cons_and : (unit * (('a * 'b) * (bool, 'c) GuaCaml.Tree.gnext) * (('a * 'b) * (bool, 'c) GuaCaml.Tree.gnext)) -> ('a * 'b) * ((bool, 'c) GuaCaml.Tree.gnext, 'd, unit * (('b * 'b) * (bool, 'c) GuaCaml.Tree.gnext) * (('b * 'b) * (bool, 'c) GuaCaml.Tree.gnext)) GuaCaml.Utils.merge3
val cons_xor : (unit * ((int * int) * (bool, 'a) GuaCaml.Tree.gnext) * ((int * int) * (bool, 'a) GuaCaml.Tree.gnext)) -> (int * int) * ((bool, 'a) GuaCaml.Tree.gnext, 'b, unit * ((int * int) * (bool, 'a) GuaCaml.Tree.gnext) * ((int * int) * (bool, 'a) GuaCaml.Tree.gnext)) GuaCaml.Utils.merge3
val solve_of_tag : TacxTypes.tag -> (unit * ((int * int) * (bool, 'a) GuaCaml.Tree.gnext) * ((int * int) * (bool, 'a) GuaCaml.Tree.gnext)) -> ((int * int) * (bool, 'a) GuaCaml.Tree.gnext, (int * int) * (unit * ((int * int) * (bool, 'a) GuaCaml.Tree.gnext) * ((int * int) * (bool, 'a) GuaCaml.Tree.gnext))) GuaCaml.Utils.merge
val solve_tacx : (TacxTypes.tag * ((int * int) * (bool, 'a) GuaCaml.Tree.gnext) * ((int * int) * (bool, 'a) GuaCaml.Tree.gnext)) -> (int * int) * ((bool, 'a) GuaCaml.Tree.gnext, TacxTypes.tag * ((int * int) * (bool, 'a) GuaCaml.Tree.gnext) * ((int * int) * (bool, 'a) GuaCaml.Tree.gnext)) GuaCaml.Utils.merge