package bddapron

You can search for identifiers within the package.

in-package search v0.2.0

package bddapron

bddapron.bdd
- Bdd
  - Cond
  - Decompose
  - Domain0
    
    O
    
    Asssub
  - Domain1
    
    O
  - Enum
    
    Minterm
  - Env
    
    O
  - Expr0
    
    Benum
    
    Bint
    
    Bool
    
    O
    
    Benum
    
    Bint
    
    Bool
    
    Expr
  - Expr1
    
    Benum
    
    Bint
    
    Bool
    
    List
    
    O
    
    Benum
    
    Bint
    
    Bool
    
    List
  - Int
    
    Minterm
  - Normalform
  - Output
  - Reg
    
    Minterm
bddapron.bddapron
- Bddapron
  - ApronDD
  - Apronexpr
    
    Condition
    
    Lin
    
    Poly
    
    Tree
  - ApronexprDD
    
    Condition
  - Bdddomain0
    
    O
    
    L
  - Bdddomain1
  - Bddleaf
  - Common
  - Cond
    
    O
  - Descend
  - Domain0
  - Domain1
  - Domainlevel1
    
    Level0
    
    Level1
    
    Make
    
    Level0
  - Env
    
    O
  - Expr0
    
    Apron
    
    Benum
    
    Bint
    
    Bool
    
    O
    
    Apron
    
    Benum
    
    Bint
    
    Bool
  - Expr1
    
    Apron
    
    Benum
    
    Bint
    
    Bool
    
    List
    
    O
    
    Apron
    
    Benum
    
    Bint
    
    Bool
    
    List
  - Expr2
    
    Bool
    
    List
    
    O
    
    Bool
    
    List
  - Formula
    
    Expr0
    
    Bool
    
    Expr1
    
    Bool
    
    O
    
    Expr0
    
    Bool
    
    Expr1
    
    Bool
  - Lex
  - Mtbdddomain0
    
    O
  - Mtbdddomain1
  - Parser
  - Policy
    
    DDDnf
    
    DPolicy
    
    Dnf
    
    Domain0
    
    Domain1
    
    Mtbdddomain0
    
    PDomain0
    
    PMtbdddomain0
  - Syntax
  - Yacc

Legend:
Library
Module
Module type
Parameter
Class
Class type

type bnode =

| BIte of int * int * bool * int
| BTrue

type !'a bdd = {

cond : int PSette.t Pervasives.ref;
mutable bdef : (int, bnode) PMappe.t;
bhash : ('a Cudd.Bdd.t, int) Hashhe.t;
mutable blastid : int;

}

type !'a vnode =

| VIte of int * int * int
| VCst of 'a

type !'a vdd = {

cond : int PSette.t Pervasives.ref;
mutable vdef : (int, 'a vnode) PMappe.t;
lhash : ('a, unit) PHashhe.t;
vhash : ('a Cudd.Vdd.t, int) Hashhe.t;
mutable vlastid : int;

}

type anode =

| AIte of int * int * int
| ACst of float

type add = {

cond : int PSette.t Pervasives.ref;
mutable adef : (int, anode) PMappe.t;
mutable lset : float Sette.t;
ahash : (Cudd.Add.t, int) Hashhe.t;
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