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 !'a t = {

signed : bool;
reg : 'a Cudd.Bdd.t array;

}

type dt = Cudd.Man.d t

type vt = Cudd.Man.v t

exception Typing of string

val extend : 'a Cudd.Man.t -> int -> 'a t -> 'a t

val neg : 'a t -> 'a t

val succ : 'a t -> 'a t

val pred : 'a t -> 'a t

val add : 'a t -> 'a t -> 'a t

val sub : 'a t -> 'a t -> 'a t

val mul : 'a t -> 'a t -> 'a t

val shift_left : int -> 'a t -> 'a t

val shift_right : int -> 'a t -> 'a t

val scale : int -> 'a t -> 'a t

val ite : 'a Cudd.Bdd.t -> 'a t -> 'a t -> 'a t

val is_cst : 'a t -> bool

val zero : 'a Cudd.Man.t -> 'a t -> 'a Cudd.Bdd.t

val equal : 'a Cudd.Man.t -> 'a t -> 'a t -> 'a Cudd.Bdd.t

val greatereq : 'a Cudd.Man.t -> 'a t -> 'a t -> 'a Cudd.Bdd.t

val greater : 'a Cudd.Man.t -> 'a t -> 'a t -> 'a Cudd.Bdd.t

val of_int : 'a Cudd.Man.t -> bool -> int -> int -> 'a t

val to_int : 'a t -> int

val equal_int : 'a Cudd.Man.t -> 'a t -> int -> 'a Cudd.Bdd.t

val greatereq_int : 'a Cudd.Man.t -> 'a t -> int -> 'a Cudd.Bdd.t

val greater_int : 'a Cudd.Man.t -> 'a t -> int -> 'a Cudd.Bdd.t

module Minterm : sig ... end

val guard_of_int : 'a Cudd.Man.t -> 'a t -> int -> 'a Cudd.Bdd.t

val guardints : 'a Cudd.Man.t -> 'a t -> ('a Cudd.Bdd.t * int) list

val cofactor : 'a t -> 'a Cudd.Bdd.t -> 'a t

val restrict : 'a t -> 'a Cudd.Bdd.t -> 'a t

val tdrestrict : 'a t -> 'a Cudd.Bdd.t -> 'a t

val print : 
  (Format.formatter -> int -> unit) ->
  Format.formatter ->
  'a t ->
  unit

val print_minterm : 
  (Format.formatter -> 'a Cudd.Bdd.t -> unit) ->
  Format.formatter ->
  'a t ->
  unit

val permute : ?memo:Cudd.Memo.t -> 'a t -> int array -> 'a t

val varmap : 'a t -> 'a t

val vectorcompose : ?memo:Cudd.Memo.t -> 'a Cudd.Bdd.t array -> 'a t -> 'a t