aGrUM  0.16.0
localSearchWithTabuList_inl.h
Go to the documentation of this file.
1 
28 #ifndef DOXYGEN_SHOULD_SKIP_THIS
29 
30 namespace gum {
31 
32  namespace learning {
33 
40  GUM_CONSTRUCTOR(LocalSearchWithTabuList);
41  }
42 
45  const LocalSearchWithTabuList& from) :
46  ApproximationScheme(from),
48  GUM_CONS_CPY(LocalSearchWithTabuList);
49  }
50 
52  INLINE
54  LocalSearchWithTabuList&& from) :
55  ApproximationScheme(std::move(from)),
57  GUM_CONS_MOV(LocalSearchWithTabuList);
58  }
59 
62  GUM_DESTRUCTOR(LocalSearchWithTabuList);
63  }
64 
68  ApproximationScheme::operator=(from);
69  __MaxNbDecreasing = from.__MaxNbDecreasing;
70  return *this;
71  }
72 
76  ApproximationScheme::operator=(std::move(from));
77  __MaxNbDecreasing = std::move(from.__MaxNbDecreasing);
78  return *this;
79  }
80 
84  __MaxNbDecreasing = nb;
85  }
86 
89  return *this;
90  }
91 
92  } /* namespace learning */
93 
94 } /* namespace gum */
95 
96 #endif /* DOXYGEN_SHOULD_SKIP_THIS */
void disableMinEpsilonRate()
Disable stopping criterion on epsilon rate.
LocalSearchWithTabuList()
default constructor
STL namespace.
LocalSearchWithTabuList & operator=(const LocalSearchWithTabuList &from)
copy operator
Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.
Definition: agrum.h:25
ApproximationScheme(bool verbosity=false)
void disableEpsilon()
Disable stopping criterion on epsilon.
virtual ~LocalSearchWithTabuList()
destructor
void disableMaxTime()
Disable stopping criterion on timeout.
ApproximationScheme & approximationScheme()
returns the approximation policy of the learning algorithm
Size __MaxNbDecreasing
the max number of changes decreasing the score that we allow to apply
void disableMaxIter()
Disable stopping criterion on max iterations.
std::size_t Size
In aGrUM, hashed values are unsigned long int.
Definition: types.h:48
void setMaxNbDecreasingChanges(Size nb)
set the max number of changes decreasing the score that we allow to apply