![]() |
aGrUM
0.20.3
a C++ library for (probabilistic) graphical models
|
The iterators for IdSets. More...
#include <agrum/BN/learning/scores_and_tests/idSet.h>
Public Member Functions | |
Constructors / Destructors | |
IdCondSetIterator () | |
default constructor More... | |
IdCondSetIterator (const IdCondSet< ALLOC > &idset) | |
Constructor for a begin. More... | |
IdCondSetIterator (const IdCondSetIterator< ALLOC > &from) | |
Copy constructor. More... | |
IdCondSetIterator (IdCondSetIterator< ALLOC > &&from) | |
move constructor More... | |
virtual | ~IdCondSetIterator () |
destructor More... | |
Operators | |
IdCondSetIterator< ALLOC > & | operator= (const IdCondSetIterator< ALLOC > &from) |
copy operator More... | |
IdCondSetIterator< ALLOC > & | operator= (IdCondSetIterator< ALLOC > &&from) |
move operator More... | |
NodeId | operator* () const |
Gives access to the content of the iterator. More... | |
bool | operator!= (const IdCondSetIterator< ALLOC > &from) const |
Checks whether two iterators point toward different elements. More... | |
bool | operator== (const IdCondSetIterator< ALLOC > &from) const |
Checks whether two iterators point toward the same elements. More... | |
IdCondSetIterator< ALLOC > & | operator++ () |
Makes the iterator point to the next element in the IdCondSet. More... | |
IdCondSetIterator< ALLOC > & | operator+= (const std::size_t i) |
Makes the iterator point to i elements further in the IdCondSet. More... | |
IdCondSetIterator< ALLOC > | operator+ (const std::size_t i) |
Returns a new iterator pointing to i further elements in the IdCondSet. More... | |
Accessors / Modifiers | |
std::size_t | pos () const |
Returns the position of the iterator in the IdCondSet. More... | |
Public Types | |
using | iterator_category = std::forward_iterator_tag |
types for STL compliance More... | |
using | value_type = NodeId |
types for STL compliance More... | |
using | reference = NodeId & |
types for STL compliance More... | |
using | const_reference = const NodeId & |
types for STL compliance More... | |
using | pointer = NodeId * |
types for STL compliance More... | |
using | const_pointer = const NodeId * |
types for STL compliance More... | |
using | difference_type = std::ptrdiff_t |
types for STL compliance More... | |
The iterators for IdSets.
Definition at line 56 of file idCondSet.h.
using gum::learning::IdCondSetIterator< ALLOC >::const_pointer = const NodeId* |
types for STL compliance
Definition at line 65 of file idCondSet.h.
using gum::learning::IdCondSetIterator< ALLOC >::const_reference = const NodeId& |
types for STL compliance
Definition at line 63 of file idCondSet.h.
using gum::learning::IdCondSetIterator< ALLOC >::difference_type = std::ptrdiff_t |
types for STL compliance
Definition at line 66 of file idCondSet.h.
using gum::learning::IdCondSetIterator< ALLOC >::iterator_category = std::forward_iterator_tag |
types for STL compliance
Definition at line 60 of file idCondSet.h.
using gum::learning::IdCondSetIterator< ALLOC >::pointer = NodeId* |
types for STL compliance
Definition at line 64 of file idCondSet.h.
using gum::learning::IdCondSetIterator< ALLOC >::reference = NodeId& |
types for STL compliance
Definition at line 62 of file idCondSet.h.
using gum::learning::IdCondSetIterator< ALLOC >::value_type = NodeId |
types for STL compliance
Definition at line 61 of file idCondSet.h.
gum::learning::IdCondSetIterator< ALLOC >::IdCondSetIterator | ( | ) |
default constructor
gum::learning::IdCondSetIterator< ALLOC >::IdCondSetIterator | ( | const IdCondSet< ALLOC > & | idset | ) |
Constructor for a begin.
idset | The IdCondSet to iterate over. |
gum::learning::IdCondSetIterator< ALLOC >::IdCondSetIterator | ( | const IdCondSetIterator< ALLOC > & | from | ) |
Copy constructor.
gum::learning::IdCondSetIterator< ALLOC >::IdCondSetIterator | ( | IdCondSetIterator< ALLOC > && | from | ) |
move constructor
|
virtual |
destructor
bool gum::learning::IdCondSetIterator< ALLOC >::operator!= | ( | const IdCondSetIterator< ALLOC > & | from | ) | const |
Checks whether two iterators point toward different elements.
NodeId gum::learning::IdCondSetIterator< ALLOC >::operator* | ( | ) | const |
Gives access to the content of the iterator.
UndefinedIteratorValue | Raised if the iterator points to nothing. |
IdCondSetIterator< ALLOC > gum::learning::IdCondSetIterator< ALLOC >::operator+ | ( | const std::size_t | i | ) |
Returns a new iterator pointing to i further elements in the IdCondSet.
i | The number of steps to move the iterator. |
IdCondSetIterator< ALLOC >& gum::learning::IdCondSetIterator< ALLOC >::operator++ | ( | ) |
Makes the iterator point to the next element in the IdCondSet.
The above loop is guaranteed to parse the whole IdCondSet as long as no element is added to or deleted from the IdCondSet while being in the loop.
IdCondSetIterator< ALLOC >& gum::learning::IdCondSetIterator< ALLOC >::operator+= | ( | const std::size_t | i | ) |
Makes the iterator point to i elements further in the IdCondSet.
i | The number of steps to move the iterator. |
IdCondSetIterator< ALLOC >& gum::learning::IdCondSetIterator< ALLOC >::operator= | ( | const IdCondSetIterator< ALLOC > & | from | ) |
copy operator
IdCondSetIterator< ALLOC >& gum::learning::IdCondSetIterator< ALLOC >::operator= | ( | IdCondSetIterator< ALLOC > && | from | ) |
move operator
bool gum::learning::IdCondSetIterator< ALLOC >::operator== | ( | const IdCondSetIterator< ALLOC > & | from | ) | const |
Checks whether two iterators point toward the same elements.
std::size_t gum::learning::IdCondSetIterator< ALLOC >::pos | ( | ) | const |
Returns the position of the iterator in the IdCondSet.
UndefinedIteratorValue | Raised on end() |