package DAGaml

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