package libabsolute

You can search for identifiers within the package.

in-package search v0.2.0

package libabsolute

libabsolute
- Libabsolute
  - Consistency
  - Constant
  - Constraint
  - Csp
  - Dom
  - Domains
    
    ApronBox
    
    B
    
    Make
    
    N
    
    Boolean
    
    Make
    
    N
    
    BoxF
    
    BoxS
    
    D1
    
    Make
    
    D
    
    D2
    
    Make
    
    A
    
    B
    
    Oct
    
    Poly
    
    Product
    
    Make
    
    A
    
    B
    
    Utree
    
    Make
    
    N
  - Expr
  - F
  - I
  - Instance
  - Kleene
  - Parser
  - Polynom
    
    Float
    
    Int
    
    Make
    
    R
    
    Rational
  - Q
  - Result
  - Ring
    
    T
  - Signature
    
    Domain
    
    Numeric
  - Solver
    
    Make
    
    D
  - Tools
    
    VarMap
    
    VarSet

Legend:
Library
Module
Module type
Parameter
Class
Class type

This module defines solution of the abstract solver as covers

type 'a t = {

sure : 'a list;
(*
elements that satisfy the constraints
*)
unsure : 'a list;
(*
elements that MAY satisfy the constraints
*)
nb_sure : int;
(*
size of sure list
*)
nb_unsure : int;
(*
size of unsure list
*)
vol_sure : float;
(*
volume of the elements in the sure list
*)
vol_unsure : float;
(*
volume of the elements in the unsure list
*)
nb_steps : int;
(*
number of steps of the solving process
*)
best_value : Q.t;
(*
best value found during the optimization
*)

}

The type of cover where sure is an under-approximation of the solution set and the union of sure and unsure is an over-approximaton of the solution set

val empty : 'a t

empty result

val inner_ratio : 'a t -> float

computes the inner ratio (between 0 and 1) of a solution

val add_inner : 'a t -> 'a -> 'a t

adds an inner element to a result

val add_outer : 'a t -> 'a -> 'a t

adds an outer element to a result

val print : Stdlib.Format.formatter -> 'a t -> unit

printer