48#ifndef DOXYGEN_SHOULD_SKIP_THIS
65 ApproximationScheme(from), _MaxNbDecreasing_(from._MaxNbDecreasing_) {
66 GUM_CONS_CPY(LocalSearchWithTabuList);
70 INLINE LocalSearchWithTabuList::LocalSearchWithTabuList(LocalSearchWithTabuList&& from) :
71 ApproximationScheme(
std::move(from)), _MaxNbDecreasing_(
std::move(from._MaxNbDecreasing_)) {
72 GUM_CONS_MOV(LocalSearchWithTabuList);
76 INLINE LocalSearchWithTabuList::~LocalSearchWithTabuList() {
77 GUM_DESTRUCTOR(LocalSearchWithTabuList);
81 INLINE LocalSearchWithTabuList&
82 LocalSearchWithTabuList::operator=(
const LocalSearchWithTabuList& from) {
83 ApproximationScheme::operator=(from);
84 _MaxNbDecreasing_ = from._MaxNbDecreasing_;
89 INLINE LocalSearchWithTabuList&
90 LocalSearchWithTabuList::operator=(LocalSearchWithTabuList&& from) {
91 ApproximationScheme::operator=(std::move(from));
92 _MaxNbDecreasing_ = std::move(from._MaxNbDecreasing_);
98 INLINE
void LocalSearchWithTabuList::setMaxNbDecreasingChanges(Size nb) {
99 _MaxNbDecreasing_ = nb;
103 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
include the inlined functions if necessary
gum is the global namespace for all aGrUM entities