package DAGaml

  1. Overview
  2. Docs
package DAGaml
Legend:
Library
Module
Module type
Parameter
Class
Class type
type t = manager
type f = G0.edge'
val arity : 'a -> (('b * 'c) * 'd) -> 'b
val (->>) : manager -> bool list -> G0.edge' -> G0.edge'
val neg : t -> f -> f
val cneg : t -> bool -> f -> f
val (|!) : t -> f -> f -> f
val cst : 'a -> 'b -> int -> (int * int) * ('b, 'c) GuaCaml.Tree.gnext
val var : manager -> G0.M.leaf -> int -> int -> (int * int) * G0.ident G0.M.next'
val to_bool : 'a -> (('b * 'c) * ('d, 'e) GuaCaml.Tree.gnext) -> 'd option
val cofactor : t -> bool -> f -> f
val id : t -> f -> GuaCaml.BTools.barray
val eq : t -> f -> f -> bool
val newman : unit -> manager
val copy_into : t -> f list -> t -> f list
val of_barray : ?t:t option -> GuaCaml.BTools.BArray.t -> t * f list
val do_nocopy : bool -> G1.G.manager -> G1.G.edge' list -> G1.G.manager * G1.G.edge' list
val to_barray : ?nocopy:bool -> ?destruct:bool -> t -> f list -> GuaCaml.BTools.BArray.t
val br_fl : ?t:t option -> GuaCaml.BTools.OfBStream.Channel.t -> t * f list
val bw_fl : ?nocopy:bool -> ?destruct:bool -> t -> GuaCaml.BTools.ToBStream.Channel.t -> f list -> unit
val t_stats : t -> GuaCaml.Tree.stree
val f_stats : t -> f list -> GuaCaml.Tree.stree
val clear_caches : t -> unit
val keep_clean : ?normalize:bool -> t -> f list -> f list
val check : manager -> G0.edge' -> bool
module F : sig ... end
val tof : ?nocopy:bool -> ?normalize:bool -> ?destruct:bool -> t -> out_channel -> f list -> unit
val off : in_channel -> t * f list