40template <
class BaseType,
class CoType>
49 redundantAge_(0,max-1, 0)
51 n_ = (max < a->number()) ? max : a->number();
53 for (
int i = 0; i < n_; i++)
54 active_[i] =
new PoolSlotRef<BaseType, CoType>(*(a->active_[i]));
58template <
class BaseType,
class CoType>
64 redundantAge_(0, rhs.max()-1, 0)
66 for (
int i = 0; i < n_; i++) {
67 active_[i] =
new PoolSlotRef<BaseType, CoType>(*(rhs.active_[i]));
68 redundantAge_[i] = rhs.redundantAge_[i];
73template <
class BaseType,
class CoType>
74Active<BaseType, CoType>::~Active()
76 for (
int i = 0; i < n_; i++)
81template <
class BaseType,
class CoType>
84 for (
int i = 0; i < rhs.n_; i++) {
90 out <<
"void" << std::endl;
96template <
class BaseType,
class CoType>
101 active_[n_] =
new PoolSlotRef<BaseType, CoType>(
ps);
102 redundantAge_[n_] = 0;
107template <
class BaseType,
class CoType>
108void Active<BaseType, CoType>::insert(
111 const int nPs =
ps.size();
113 for(
int i = 0; i <
nPs; i++)
118template <
class BaseType,
class CoType>
119void Active<BaseType, CoType>::remove(ArrayBuffer<int> &del)
121 const int nDel = del.size();
123 for(
int i = 0; i <
nDel; i++)
124 delete active_[del[i]];
125 active_.leftShift(del);
126 redundantAge_.leftShift(del);
131template <
class BaseType,
class CoType>
132void Active<BaseType, CoType>::realloc(
int newSize)
Active(Master *master, int max)
Creates an empty set of active items.
constraints and variables.
#define OGDF_ASSERT(expr)
Assert condition expr. See doc/build.md for more information.
the master of the optimization.
static MultilevelBuilder * getDoubleFactoredZeroAdjustedMerger()
std::ostream & operator<<(std::ostream &os, const ogdf::Array< E, INDEX > &a)
Prints array a to output stream os.