---

semantics.h File Reference

#include <stdint.h>
#include <string>
#include <fstream>
#include <iostream>
#include <coconut_types.h>

Include dependency graph for semantics.h:

Go to the source code of this file.

Compounds
class	convex_e
class	semantics
Enumerations
enum	convex_info { c_convex = 1, c_linear = 0, c_concave = -1, c_maybe = 2 }
enum	type_annotation { v_exists = 0, v_forall = 1, v_free = 2, v_stochastic = 3 }
enum	activity_descr {   a_redundant = 1, a_active_lo = 2, a_active_lo_red = a_active_lo|a_redundant, a_active_hi = 4,   a_active_hi_red = a_active_hi|a_redundant, a_active = a_active_lo|a_active_hi, a_active_red = a_active|a_redundant }
Functions
bool	operator== (const convex_e &__c, const convex_e &__d)
bool	operator== (const convex_e &__c, const convex_info &__d)
bool	operator== (const convex_info &__c, const convex_e &__d)
bool	operator!= (const convex_e &__c, const convex_e &__d)
bool	operator!= (const convex_e &__c, const convex_info &__d)
bool	operator!= (const convex_info &__c, const convex_e &__d)
std::ostream &	operator<< (std::ostream &o, const convex_e &__s)
std::ostream &	operator<< (std::ostream &o, const semantics &__s)

---

Detailed Description

Definition in file semantics.h.

---

Enumeration Type Documentation

enum activity_descr

This enum describes the activity state known about a constraint and whether it is redundant or not. The meaning of the enum entries is: a_redundant: The constraint is known to be redundant. There can be two reasons for that. It can be inactive on both sides, or it was constructed, knowing that it would be redundant (e.g. cuts). a_active_lo: The work_node may contain points, for which this constraint is active at the lower bound but no points, for which the constraint is active at the upper bound. a_active_hi: The work_node may contain points, for which this constraint is active at the upper bound but no points, for which the constraint is active at the lower bound. a_active: The work_node may contain points, for which this constraint is active at the upper bound and points, for which the constraint is active at the lower bound. ..._red: A combination with _red means that although the inactivity of the constraint could not be proved, it is still known to be redundant. Enumeration values: a_redundant  a_active_lo  a_active_lo_red  a_active_hi  a_active_hi_red  a_active  a_active_red  Definition at line 66 of file semantics.h.

enum convex_info

Enumeration values: c_convex  c_linear  c_concave  c_maybe  Definition at line 36 of file semantics.h.

enum type_annotation

Enumeration values: v_exists  v_forall  v_free  v_stochastic  Definition at line 38 of file semantics.h.

---

Function Documentation

bool operator!= (  const convex_info &    __c, const convex_e &    __d )  [inline]

Definition at line 177 of file semantics.h.

bool operator!= (  const convex_e &    __c, const convex_info &    __d )  [inline]

Definition at line 172 of file semantics.h.

bool operator!= (  const convex_e &    __c, const convex_e &    __d )  [inline]

Definition at line 167 of file semantics.h.

std::ostream& operator<< (  std::ostream &    o, const semantics &    __s )

Definition at line 224 of file semantics.cc.

std::ostream& operator<< (  std::ostream &    o, const convex_e &    __s )  [inline]

Definition at line 182 of file semantics.h.

bool operator== (  const convex_info &    __c, const convex_e &    __d )  [inline]

Definition at line 162 of file semantics.h.

bool operator== (  const convex_e &    __c, const convex_info &    __d )  [inline]

Definition at line 157 of file semantics.h.

bool operator== (  const convex_e &    __c, const convex_e &    __d )  [inline]

Definition at line 152 of file semantics.h.

---