50#ifndef DOXYGEN_SHOULD_SKIP_THIS
67 ApproximationScheme(from), _MaxNbDecreasing_(from._MaxNbDecreasing_) {
68 GUM_CONS_CPY(LocalSearchWithTabuList);
72 INLINE LocalSearchWithTabuList::LocalSearchWithTabuList(LocalSearchWithTabuList&& from) :
73 ApproximationScheme(
std::move(from)), _MaxNbDecreasing_(
std::move(from._MaxNbDecreasing_)) {
74 GUM_CONS_MOV(LocalSearchWithTabuList);
78 INLINE LocalSearchWithTabuList::~LocalSearchWithTabuList() {
79 GUM_DESTRUCTOR(LocalSearchWithTabuList);
83 INLINE LocalSearchWithTabuList&
84 LocalSearchWithTabuList::operator=(
const LocalSearchWithTabuList& from) =
default;
87 INLINE LocalSearchWithTabuList&
88 LocalSearchWithTabuList::operator=(LocalSearchWithTabuList&& from) {
89 ApproximationScheme::operator=(std::move(from));
90 _MaxNbDecreasing_ = std::move(from._MaxNbDecreasing_);
96 INLINE
void LocalSearchWithTabuList::setMaxNbDecreasingChanges(Size nb) {
97 _MaxNbDecreasing_ = nb;
101 INLINE ApproximationScheme& LocalSearchWithTabuList::approximationScheme() {
return *
this; }
void disableMaxTime() override
Disable stopping criterion on timeout.
void disableEpsilon() override
Disable stopping criterion on epsilon.
void disableMinEpsilonRate() override
Disable stopping criterion on epsilon rate.
void disableMaxIter() override
Disable stopping criterion on max iterations.
The local search with tabu list learning algorithm (for directed graphs).
LocalSearchWithTabuList()
default constructor
The local search learning with tabu list algorithm (for directed graphs).
include the inlined functions if necessary
gum is the global namespace for all aGrUM entities