Implements the sets of active constraints and variables which are associated with each subproblem.
More...
|
| | Active (const Active< BaseType, CoType > &rhs) |
| | Copy constructor.
|
| |
| | Active (Master *master, Active *a, int max) |
| | Creates a set of active items, initialized to at most max items from a.
|
| |
| | Active (Master *master, int max) |
| | Creates an empty set of active items.
|
| |
| | ~Active () |
| |
| void | incrementRedundantAge (int i) |
| | Increments the number ofiterations the item i is already redundant by 1.
|
| |
| void | insert (ArrayBuffer< PoolSlot< BaseType, CoType > * > &ps) |
| | Adds constraints/variables to the active items set.
|
| |
| void | insert (PoolSlot< BaseType, CoType > *ps) |
| | Adds a constraint/variable to the active items set.
|
| |
| int | max () const |
| | Returns the maximum number of storable active items (without reallocation).
|
| |
| int | number () const |
| | Returns the current number of active items.
|
| |
| BaseType * | operator[] (int i) |
| | Access to the i-th active item.
|
| |
| const BaseType * | operator[] (int i) const |
| | Access to the i-th active item.
|
| |
| PoolSlotRef< BaseType, CoType > * | poolSlotRef (int i) |
| | Returns the i-th entry in the Array active.
|
| |
| const PoolSlotRef< BaseType, CoType > * | poolSlotRef (int i) const |
| | Returns the i-th entry in the Array active.
|
| |
| void | realloc (int newSize) |
| | Changes the maximum number of active items which can be stored.
|
| |
| int | redundantAge (int i) const |
| | Returns the number of iterations a constraint/variable is already redundant.
|
| |
| void | remove (ArrayBuffer< int > &del) |
| | Removes items from the list of active items.
|
| |
| void | resetRedundantAge (int i) |
| | Sets the number of iterations item i is redundant to 0.
|
| |
| virtual | ~AbacusRoot () |
| | The destructor.
|
| |
template<class BaseType, class CoType>
class abacus::Active< BaseType, CoType >
Implements the sets of active constraints and variables which are associated with each subproblem.
This parameterized class implements the sets of active constraints and variables which are associated with each subproblem. Note, also an inactive subproblem can have an active set of constraints and variables, e.g., the sets with which its unprocessed sons in the enumeration tree are initialized.
If an active set of constraints is instantiated then the BaseType should be Constraint and the CoType should be Variable, for an active set of variables this is vice versa.
Definition at line 63 of file active.h.
template<class BaseType , class CoType >
| std::ostream & operator<< |
( |
std::ostream & |
out, |
|
|
const Active< BaseType, CoType > & |
rhs |
|
) |
| |
|
friend |
Output operator for active sets.
The output operator writes all active constraints and variables to an output stream.
If an associated pool slot is void, or the item is newer than the one we refer to, then "void" is written.
- Parameters
-
| out | The output stream. |
| rhs | The active set being output. |
- Returns
- A reference to the output stream.
Inheritance diagram for abacus::Active< BaseType, CoType >:
