SMT-RAT  24.02
Toolbox for Strategic and Parallel Satisfiability-Modulo-Theories Solving
smtrat::Branching Struct Reference

Stores all necessary information of an branch, which can be used to detect probable infinite loop of branchings. More...

#include <Module.h>

Public Member Functions

 Branching (const typename Poly::PolyType &_polynomial, const Rational &_value)
 Constructor. More...
 

Data Fields

Poly::PolyType mPolynomial
 The polynomial to branch at. More...
 
Rational mValue
 The value to branch the polynomial at. More...
 
size_t mRepetitions
 The number of repetitions of the branching. More...
 
int mIncreasing
 Stores whether this the branching of the polynomial has been on an increasing sequence of values (>0), or on a decreasing sequence of values (<0). More...
 

Detailed Description

Stores all necessary information of an branch, which can be used to detect probable infinite loop of branchings.

Definition at line 31 of file Module.h.

Constructor & Destructor Documentation

◆ Branching()

smtrat::Branching::Branching ( const typename Poly::PolyType &  _polynomial,
const Rational _value 
)
inline

Constructor.

Parameters
_polynomialThe polynomial to branch at.
_valueThe value to branch the polynomial at.

Definition at line 57 of file Module.h.

Field Documentation

◆ mIncreasing

int smtrat::Branching::mIncreasing

Stores whether this the branching of the polynomial has been on an increasing sequence of values (>0), or on a decreasing sequence of values (<0).

It is initially zero.

Definition at line 47 of file Module.h.

◆ mPolynomial

Poly::PolyType smtrat::Branching::mPolynomial

The polynomial to branch at.

Definition at line 37 of file Module.h.

◆ mRepetitions

size_t smtrat::Branching::mRepetitions

The number of repetitions of the branching.

Definition at line 42 of file Module.h.

◆ mValue

Rational smtrat::Branching::mValue

The value to branch the polynomial at.

Definition at line 40 of file Module.h.


The documentation for this struct was generated from the following file: