package bddapron

  1. Overview
  2. Docs
type bnode =
  1. | BIte of int * int * bool * int
  2. | BTrue
type !'a bdd = {
  1. cond : int PSette.t Pervasives.ref;
  2. mutable bdef : (int, bnode) PMappe.t;
  3. bhash : ('a Cudd.Bdd.t, int) Hashhe.t;
  4. mutable blastid : int;
}
type !'a vnode =
  1. | VIte of int * int * int
  2. | VCst of 'a
type !'a vdd = {
  1. cond : int PSette.t Pervasives.ref;
  2. mutable vdef : (int, 'a vnode) PMappe.t;
  3. lhash : ('a, unit) PHashhe.t;
  4. vhash : ('a Cudd.Vdd.t, int) Hashhe.t;
  5. mutable vlastid : int;
}
type anode =
  1. | AIte of int * int * int
  2. | ACst of float
type add = {
  1. cond : int PSette.t Pervasives.ref;
  2. mutable adef : (int, anode) PMappe.t;
  3. mutable lset : float Sette.t;
  4. ahash : (Cudd.Add.t, int) Hashhe.t;
  5. mutable alastid : int;
}
val make_bdd : cond:int PSette.t Pervasives.ref -> 'a bdd
val signid_of_bdd : 'a bdd -> 'a Cudd.Bdd.t -> bool * int
val make_vdd : compare:'a Cudd.PWeakke.compare -> cond:int PSette.t Pervasives.ref -> 'a vdd
val make_mtbdd : table:'a Cudd.Mtbdd.table -> cond:int PSette.t Pervasives.ref -> 'a Cudd.Mtbdd.unique vdd
val make_mtbddc : table:'a Cudd.Mtbddc.table -> cond:int PSette.t Pervasives.ref -> 'a Cudd.Mtbddc.unique vdd
val id_of_vdd : 'a vdd -> 'a Cudd.Vdd.t -> int
val iter_cond_ordered : int PSette.t -> 'a Cudd.Man.t -> (int -> unit) -> unit
val iter_bdef_ordered : 'a bdd -> (int -> bnode -> unit) -> unit
val iter_vdef_ordered : 'a vdd -> (int -> 'a vnode -> unit) -> unit
OCaml

Innovation. Community. Security.