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 cst = [

| `Apron of Apron.Coeff.t
| `Bint of (bool * int) * int
| `Bool of bool

]

type unop = [

| `Apron of Apron.Texpr1.unop * Apron.Texpr1.typ * Apron.Texpr1.round
| `Not

]

type bbinop = [

| `And
| `EQ
| `GEQ
| `GT
| `LEQ
| `LT
| `NEQ
| `Or

]

type binop = [

| `Apron of Apron.Texpr1.binop * Apron.Texpr1.typ * Apron.Texpr1.round
| `Bool of bbinop

]

type !'a expr = [

| `Binop of binop * 'a expr * 'a expr
| `Cst of cst
| `If of 'a expr * 'a expr * 'a expr
| `In of 'a expr * 'a expr list
| `Ref of 'a
| `Unop of unop * 'a expr

]

val print_cst : Format.formatter -> cst -> unit

val print_unop : Format.formatter -> unop -> unit

val print_bbinop : Format.formatter -> bbinop -> unit

val print_binop : Format.formatter -> binop -> unit

val print_expr : 
  (Format.formatter -> 'a -> unit) ->
  Format.formatter ->
  'a expr ->
  unit

exception Error of string

val to_expr0 : 'a Env.t -> 'a Cond.t -> string expr -> 'a Expr0.t

val to_expr1 : 'a Env.t -> 'a Cond.t -> string expr -> 'a Expr1.t

val to_listexpr1 : 'a Env.t -> 'a Cond.t -> string expr list -> 'a Expr1.List.t

val to_listexpr2 : 
  ?normalize:bool ->
  ?reduce:bool ->
  ?careset:bool ->
  'a Env.t ->
  'a Cond.t ->
  string expr list ->
  'a Expr2.List.t

val to_boolexpr2 : 
  ?normalize:bool ->
  ?reduce:bool ->
  ?careset:bool ->
  'a Env.t ->
  'a Cond.t ->
  string expr ->
  'a Expr2.Bool.t

val error : ('a, Format.formatter, unit, 'b) Pervasives.format4 -> 'a

val is_zero : 'a expr -> bool

val precedence_of_unop : unop -> int

val precedence_of_binop : binop -> int

val precedence_of_expr : 'a expr -> int

val cst_to_expr0 : 'a Env.t -> 'a Cond.t -> [< cst ] -> 'a Expr0.expr

val apply_bbinop : 
  'a Env.t ->
  'a Cond.t ->
  bbinop ->
  'a Expr0.expr ->
  'a Expr0.expr ->
  'a Expr0.Bool.t

val apply_binop : 
  'a Env.t ->
  'a Cond.t ->
  binop ->
  'a Expr0.t ->
  'a Expr0.t ->
  'a Expr0.t