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
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_of_edge : (int * int) -> string
val solve_node : (unit * ((int * int) * 'a) * ((int * int) * (bool, 'b) GuaCaml.Tree.gnext)) -> (int * int) * ('a, unit * ((int * int) * 'a) * ((int * int) * (bool, 'b) GuaCaml.Tree.gnext)) GuaCaml.Utils.merge
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) * (bool, 'c) GuaCaml.Tree.gnext), 'b * ('d -> 'd)) GuaCaml.Utils.merge
val solve_and : (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_or : (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_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_iff : (unit * ((int * 'a) * ('b, 'c) GuaCaml.Tree.gnext) * ((int * 'd) * ('b, 'e) GuaCaml.Tree.gnext)) -> ((int * int) * (bool, 'f) GuaCaml.Tree.gnext, (int * int) * (unit * ((int * 'a) * ('b, 'c) GuaCaml.Tree.gnext) * ((int * 'd) * ('b, 'e) GuaCaml.Tree.gnext))) GuaCaml.Utils.merge
val cons_and : (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 cons_or : (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 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 cons_iff : (unit * ((int * 'a) * ('b, 'c) GuaCaml.Tree.gnext) * ((int * 'd) * ('b, 'e) GuaCaml.Tree.gnext)) -> (int * int) * ((bool, 'f) GuaCaml.Tree.gnext, 'g, unit * ((int * 'a) * ('b, 'c) GuaCaml.Tree.gnext) * ((int * 'd) * ('b, 'e) GuaCaml.Tree.gnext)) GuaCaml.Utils.merge3