51#ifndef GUM_ACTION_SET_H
52#define GUM_ACTION_SET_H
75 template <
typename GUM_ELEMENT >
82 const GUM_ELEMENT&
operator()(
const GUM_ELEMENT& x,
const GUM_ELEMENT& y)
const;
122 void*
operator new(
size_t s);
124 void operator delete(
void* p);
Headers of the ITerminalNodePolicy.
A class to store the optimal actions.
ActionSet & operator=(const ActionSet &src)
Constructor.
friend std::ostream & operator<<(std::ostream &streamy, const ActionSet &objy)
SequenceIteratorSafe< Idx > beginSafe() const
Iterator beginning.
bool exists(const Idx &elem) const
SequenceIteratorSafe< Idx > endSafe() const
Iterator end.
ActionSet & operator+=(const Idx &elem)
Ajout d'un élément.
bool operator==(const ActionSet &compared) const
Compares two ActionSet to check if they are equals.
ActionSet & operator-=(const ActionSet &src)
Use to insert the content of another set inside this one.
Sequence< Idx > * _actionSeq_
The very bone of the ActionSet.
const Idx & operator[](const Idx i) const
Gives the ith element.
Size size() const
Gives the size.
Class for implementation of factored markov decision process.
This files contains several function objects that are not (yet) defined in the STL.
std::size_t Size
In aGrUM, hashed values are unsigned long int.
Size Idx
Type for indexes.
aGrUM's inline/outline selection
gum is the global namespace for all aGrUM entities
<agrum/FMDP/planning/actionSet.h>
const GUM_ELEMENT & operator()(const GUM_ELEMENT &x, const GUM_ELEMENT &y) const