aGrUM  0.20.2
a C++ library for (probabilistic) graphical models
gum::SequenceIteratorSafe< Key > Class Template Reference

Safe iterators for Sequence. More...

#include <agrum/tools/core/sequence.h>

+ Collaboration diagram for gum::SequenceIteratorSafe< Key >:

Public Member Functions

template<typename Alloc , bool Gen>
INLINE SequenceIteratorSafe (const SequenceImplementation< Key, Alloc, Gen > &seq, Idx pos) noexcept
 
template<typename Alloc >
INLINE SequenceIteratorSafe (const Sequence< Key, Alloc > &seq, Idx pos) noexcept
 
Constructors / Destructors
template<typename Alloc >
 SequenceIteratorSafe (const Sequence< Key, Alloc > &seq, Idx pos=0) noexcept
 Constructor, always give a valid iterator (even if pos too large). More...
 
 SequenceIteratorSafe (const SequenceIteratorSafe< Key > &source) noexcept
 Copy constructor. More...
 
 SequenceIteratorSafe (SequenceIteratorSafe< Key > &&source) noexcept
 Move constructor. More...
 
 ~SequenceIteratorSafe () noexcept
 Class destructor. More...
 
Operators
SequenceIteratorSafe< Key > & operator= (const SequenceIteratorSafe< Key > &source) noexcept
 Copy operator. More...
 
SequenceIteratorSafe< Key > & operator= (SequenceIteratorSafe< Key > &&source) noexcept
 Move operator. More...
 
SequenceIteratorSafe< Key > & operator++ () noexcept
 Point the iterator to the next value in the sequence. More...
 
SequenceIteratorSafe< Key > & operator-- () noexcept
 Point the iterator to the preceding value in the sequence. More...
 
SequenceIteratorSafe< Key > & operator+= (Size nb) noexcept
 Makes the iterator point to i elements further in the sequence. More...
 
SequenceIteratorSafe< Key > & operator-= (Size nb) noexcept
 Makes the iterator point to i elements further in the sequence. More...
 
SequenceIteratorSafe< Key > operator+ (Size nb) noexcept
 Returns a new iterator. More...
 
SequenceIteratorSafe< Key > operator- (Size nb) noexcept
 Returns a new iterator. More...
 
bool operator!= (const SequenceIteratorSafe< Key > &source) const noexcept
 Checks whether two iterators are pointing to different elements. More...
 
bool operator== (const SequenceIteratorSafe< Key > &source) const noexcept
 Checks whether two iterators are pointing to the same elements. More...
 
const Key & operator* () const
 Returns the value pointed to by the iterator. More...
 
const Key * operator-> () const
 Returns the value pointed to by the iterator (works only for non-scalars). More...
 
Accessors / Modifiers
Idx pos () const
 Returns the position of the iterator in the sequence. More...
 

Public Types

using iterator_category = std::bidirectional_iterator_tag
 types for STL compliance More...
 
using value_type = Key
 types for STL compliance More...
 
using reference = Key &
 types for STL compliance More...
 
using const_reference = const Key &
 types for STL compliance More...
 
using pointer = Key *
 types for STL compliance More...
 
using const_pointer = const Key *
 types for STL compliance More...
 
using difference_type = std::ptrdiff_t
 types for STL compliance More...
 

Friends

template<typename K , typename A , bool >
class SequenceImplementation
 Friend to speed up access. More...
 

Detailed Description

template<typename Key>
class gum::SequenceIteratorSafe< Key >

Safe iterators for Sequence.

This iterator enables to parse the elements in the sequence. Note that this is similar to a const safe iterator because the elements that can be accessed in the sequence are constant.

Usage example:
// creation of a sequence
Sequence<int> seq { 1, 2, 3, 4 };
Sequence<string> seq2;
// creation of iterators
auto iter1 = seq.beginSafe (); // points to 1
auto iiter2 = iter1;
auto iiter3 = std::move ( iter1 );
// parsing the sequence
for ( auto iter = seq.beginSafe (); iter != seq.endSafe (); ++iter )
std::cout << *iter << std::endl;
for ( auto iter = seq.rbeginSafe (); iter != seq.rend (); --iter )
std::cout << *iter << std::endl;
for ( auto iter = seq.beginSafe (); iter != seq.end (); ++iter )
std::cout << iter->size () << std::endl;
Template Parameters
KeyThe type of elements stored in the gum::Sequence.

Definition at line 1205 of file sequence.h.

Member Typedef Documentation

◆ const_pointer

template<typename Key>
using gum::SequenceIteratorSafe< Key >::const_pointer = const Key*

types for STL compliance

Definition at line 1218 of file sequence.h.

◆ const_reference

template<typename Key>
using gum::SequenceIteratorSafe< Key >::const_reference = const Key&

types for STL compliance

Definition at line 1216 of file sequence.h.

◆ difference_type

template<typename Key>
using gum::SequenceIteratorSafe< Key >::difference_type = std::ptrdiff_t

types for STL compliance

Definition at line 1219 of file sequence.h.

◆ Getter

template<typename Key>
using gum::SequenceIteratorSafe< Key >::Getter = SequenceIteratorGet< std::is_scalar< Key >::value >
private

The Getter used by this iterator.

Definition at line 1224 of file sequence.h.

◆ iterator_category

template<typename Key>
using gum::SequenceIteratorSafe< Key >::iterator_category = std::bidirectional_iterator_tag

types for STL compliance

Definition at line 1213 of file sequence.h.

◆ pointer

template<typename Key>
using gum::SequenceIteratorSafe< Key >::pointer = Key*

types for STL compliance

Definition at line 1217 of file sequence.h.

◆ reference

template<typename Key>
using gum::SequenceIteratorSafe< Key >::reference = Key&

types for STL compliance

Definition at line 1215 of file sequence.h.

◆ value_type

template<typename Key>
using gum::SequenceIteratorSafe< Key >::value_type = Key

types for STL compliance

Definition at line 1214 of file sequence.h.

Constructor & Destructor Documentation

◆ SequenceIteratorSafe() [1/6]

template<typename Key>
template<typename Alloc , bool Gen>
gum::SequenceIteratorSafe< Key >::SequenceIteratorSafe ( const SequenceImplementation< Key, Alloc, Gen > &  seq,
Idx  pos = 0 
)
privatenoexcept

Constructor, always give a valid iterator (even if pos too large).

Warning
if pos is greater than the size of the sequence, the iterator is made pointing to end().
Template Parameters
AllocThe sequence allocator.
GenUsed for meta-programation.
Parameters
seqThe sequence.
posIndicates to which position of the sequence the iterator should be pointing. By default, the iterator points to begin().

◆ SequenceIteratorSafe() [2/6]

template<typename Key>
template<typename Alloc >
gum::SequenceIteratorSafe< Key >::SequenceIteratorSafe ( const Sequence< Key, Alloc > &  seq,
Idx  pos = 0 
)
noexcept

Constructor, always give a valid iterator (even if pos too large).

Warning
if pos is greater than the size of the sequence, the iterator is made pointing to end().
Parameters
seqthe sequence
posindicates to which position of the sequence the iterator should be pointing. By default, the iterator points to begin()
Template Parameters
AllocThe sequence allocator.

◆ SequenceIteratorSafe() [3/6]

template<typename Key>
INLINE gum::SequenceIteratorSafe< Key >::SequenceIteratorSafe ( const SequenceIteratorSafe< Key > &  source)
noexcept

Copy constructor.

Parameters
sourceThe iterator to copy.

Definition at line 101 of file sequence_tpl.h.

102  :
103  iterator__{source.iterator__},
104  seq__{source.seq__} {
105  GUM_CONS_CPY(SequenceIteratorSafe);
106  }
Idx iterator__
The index in the sequence&#39;s vector where the iterator is pointing.
Definition: sequence.h:1416
SequenceIteratorSafe(const SequenceImplementation< Key, Alloc, Gen > &seq, Idx pos=0) noexcept
Constructor, always give a valid iterator (even if pos too large).
const SequenceImplementation< Key, std::allocator< Key >, std::is_scalar< Key >::value > * seq__
The sequence pointed to by the iterator (by default, key is a scalar).
Definition: sequence.h:1421

◆ SequenceIteratorSafe() [4/6]

template<typename Key>
INLINE gum::SequenceIteratorSafe< Key >::SequenceIteratorSafe ( SequenceIteratorSafe< Key > &&  source)
noexcept

Move constructor.

Parameters
sourceThe iterator to move.

Definition at line 110 of file sequence_tpl.h.

111  :
112  iterator__{source.iterator__},
113  seq__{source.seq__} {
114  GUM_CONS_MOV(SequenceIteratorSafe);
115  }
Idx iterator__
The index in the sequence&#39;s vector where the iterator is pointing.
Definition: sequence.h:1416
SequenceIteratorSafe(const SequenceImplementation< Key, Alloc, Gen > &seq, Idx pos=0) noexcept
Constructor, always give a valid iterator (even if pos too large).
const SequenceImplementation< Key, std::allocator< Key >, std::is_scalar< Key >::value > * seq__
The sequence pointed to by the iterator (by default, key is a scalar).
Definition: sequence.h:1421

◆ ~SequenceIteratorSafe()

template<typename Key >
INLINE gum::SequenceIteratorSafe< Key >::~SequenceIteratorSafe ( )
noexcept

Class destructor.

Definition at line 119 of file sequence_tpl.h.

119  {
120  GUM_DESTRUCTOR(SequenceIteratorSafe);
121  }
SequenceIteratorSafe(const SequenceImplementation< Key, Alloc, Gen > &seq, Idx pos=0) noexcept
Constructor, always give a valid iterator (even if pos too large).

◆ SequenceIteratorSafe() [5/6]

template<typename Key>
template<typename Alloc , bool Gen>
INLINE gum::SequenceIteratorSafe< Key >::SequenceIteratorSafe ( const SequenceImplementation< Key, Alloc, Gen > &  seq,
Idx  pos 
)
noexcept

Definition at line 66 of file sequence_tpl.h.

68  :
69  seq__{reinterpret_cast<
70  const SequenceImplementation< Key,
71  std::allocator< Key >,
72  std::is_scalar< Key >::value >* >(&seq)} {
73  GUM_CONSTRUCTOR(SequenceIteratorSafe);
74 
75  if (pos > seq__->size())
76  iterator__ = seq__->size(); // make the iterator point to end
77  else
78  iterator__ = pos;
79  }
Idx iterator__
The index in the sequence&#39;s vector where the iterator is pointing.
Definition: sequence.h:1416
Size size() const noexcept
Returns the size of the sequence.
Definition: sequence_tpl.h:37
Idx pos() const
Returns the position of the iterator in the sequence.
Definition: sequence_tpl.h:219
friend class SequenceImplementation
Friend to speed up access.
Definition: sequence.h:1208
SequenceIteratorSafe(const SequenceImplementation< Key, Alloc, Gen > &seq, Idx pos=0) noexcept
Constructor, always give a valid iterator (even if pos too large).
const SequenceImplementation< Key, std::allocator< Key >, std::is_scalar< Key >::value > * seq__
The sequence pointed to by the iterator (by default, key is a scalar).
Definition: sequence.h:1421

◆ SequenceIteratorSafe() [6/6]

template<typename Key>
template<typename Alloc >
INLINE gum::SequenceIteratorSafe< Key >::SequenceIteratorSafe ( const Sequence< Key, Alloc > &  seq,
Idx  pos 
)
noexcept

Definition at line 84 of file sequence_tpl.h.

86  :
87  seq__{reinterpret_cast<
88  const SequenceImplementation< Key,
89  std::allocator< Key >,
90  std::is_scalar< Key >::value >* >(&seq)} {
91  GUM_CONSTRUCTOR(SequenceIteratorSafe);
92 
93  if (pos > seq__->size())
94  iterator__ = seq__->size(); // make the iterator point to end
95  else
96  iterator__ = pos;
97  }
Idx iterator__
The index in the sequence&#39;s vector where the iterator is pointing.
Definition: sequence.h:1416
Size size() const noexcept
Returns the size of the sequence.
Definition: sequence_tpl.h:37
Idx pos() const
Returns the position of the iterator in the sequence.
Definition: sequence_tpl.h:219
friend class SequenceImplementation
Friend to speed up access.
Definition: sequence.h:1208
SequenceIteratorSafe(const SequenceImplementation< Key, Alloc, Gen > &seq, Idx pos=0) noexcept
Constructor, always give a valid iterator (even if pos too large).
const SequenceImplementation< Key, std::allocator< Key >, std::is_scalar< Key >::value > * seq__
The sequence pointed to by the iterator (by default, key is a scalar).
Definition: sequence.h:1421

Member Function Documentation

◆ operator!=()

template<typename Key>
INLINE bool gum::SequenceIteratorSafe< Key >::operator!= ( const SequenceIteratorSafe< Key > &  source) const
noexcept

Checks whether two iterators are pointing to different elements.

Parameters
sourceThe iterator to test for inequality.
Returns
Returns true if both iterators are not equal.

Definition at line 212 of file sequence_tpl.h.

213  {
214  return !operator==(source);
215  }
bool operator==(const SequenceIteratorSafe< Key > &source) const noexcept
Checks whether two iterators are pointing to the same elements.
Definition: sequence_tpl.h:200

◆ operator*()

template<typename Key >
INLINE const Key & gum::SequenceIteratorSafe< Key >::operator* ( ) const

Returns the value pointed to by the iterator.

Returns
Returns the value pointed to by the iterator.
Exceptions
UndefinedIteratorValueRaised on end() or rend().

Definition at line 250 of file sequence_tpl.h.

250  {
251  return Getter::op_star(seq__->v__[pos()]);
252  }
Idx pos() const
Returns the position of the iterator in the sequence.
Definition: sequence_tpl.h:219
std::vector< Key *, typename Alloc::template rebind< Key *>::other > v__
The set of the elements stored into the sequence.
Definition: sequence.h:502
const SequenceImplementation< Key, std::allocator< Key >, std::is_scalar< Key >::value > * seq__
The sequence pointed to by the iterator (by default, key is a scalar).
Definition: sequence.h:1421

◆ operator+()

template<typename Key >
INLINE SequenceIteratorSafe< Key > gum::SequenceIteratorSafe< Key >::operator+ ( Size  nb)
noexcept

Returns a new iterator.

Warning
The created iterator should point outside the Sequence, then it is set either to end or rend, depending on the sign of nb.
Parameters
nbThe number of steps the created iterator is ahead of this.
Returns
Returns a new iterator.

Definition at line 187 of file sequence_tpl.h.

187  {
188  return SequenceIteratorSafe< Key >{*this} += nb;
189  }

◆ operator++()

template<typename Key >
INLINE SequenceIteratorSafe< Key > & gum::SequenceIteratorSafe< Key >::operator++ ( )
noexcept

Point the iterator to the next value in the sequence.

Warning
if the iterator already points to end(), it is unaltered.
Returns
Returns this iterator.

Definition at line 144 of file sequence_tpl.h.

144  {
145  if (iterator__ < seq__->size())
146  ++iterator__;
147  else
148  iterator__ = seq__->size();
149 
150  return *this;
151  }
Idx iterator__
The index in the sequence&#39;s vector where the iterator is pointing.
Definition: sequence.h:1416
Size size() const noexcept
Returns the size of the sequence.
Definition: sequence_tpl.h:37
const SequenceImplementation< Key, std::allocator< Key >, std::is_scalar< Key >::value > * seq__
The sequence pointed to by the iterator (by default, key is a scalar).
Definition: sequence.h:1421

◆ operator+=()

template<typename Key >
INLINE SequenceIteratorSafe< Key > & gum::SequenceIteratorSafe< Key >::operator+= ( Size  nb)
noexcept

Makes the iterator point to i elements further in the sequence.

Warning
If moving the iterator nb would make it point outside the Sequence, then iterator is moved to end or rend, depending on the sign of nb.
Parameters
nbThe number of steps to move the iterator.
Returns
Returns this iterator.

Definition at line 165 of file sequence_tpl.h.

165  {
166  if (iterator__ == std::numeric_limits< Idx >::max()) return *this;
167  iterator__ += nb;
168  if (iterator__ > seq__->size()) iterator__ = seq__->size();
169 
170  return *this;
171  }
Idx iterator__
The index in the sequence&#39;s vector where the iterator is pointing.
Definition: sequence.h:1416
Size size() const noexcept
Returns the size of the sequence.
Definition: sequence_tpl.h:37
const SequenceImplementation< Key, std::allocator< Key >, std::is_scalar< Key >::value > * seq__
The sequence pointed to by the iterator (by default, key is a scalar).
Definition: sequence.h:1421

◆ operator-()

template<typename Key >
INLINE SequenceIteratorSafe< Key > gum::SequenceIteratorSafe< Key >::operator- ( Size  nb)
noexcept

Returns a new iterator.

Warning
The created iterator should point outside the Sequence, then it is set either to end or rend, depending on the sign of nb.
Parameters
nbThe number of steps the created iterator is behind of this. Returns a new iterator.

Definition at line 194 of file sequence_tpl.h.

194  {
195  return SequenceIteratorSafe< Key >{*this} -= nb;
196  }

◆ operator--()

template<typename Key >
INLINE SequenceIteratorSafe< Key > & gum::SequenceIteratorSafe< Key >::operator-- ( )
noexcept

Point the iterator to the preceding value in the sequence.

Warning
If the iterator already points to rend(), it is unaltered.
Returns
Returns this iterator.

Definition at line 156 of file sequence_tpl.h.

156  {
157  if (iterator__ != std::numeric_limits< Idx >::max()) --iterator__;
158 
159  return *this;
160  }
Idx iterator__
The index in the sequence&#39;s vector where the iterator is pointing.
Definition: sequence.h:1416

◆ operator-=()

template<typename Key >
INLINE SequenceIteratorSafe< Key > & gum::SequenceIteratorSafe< Key >::operator-= ( Size  nb)
noexcept

Makes the iterator point to i elements further in the sequence.

Warning
If moving the iterator nb would make it point outside the Sequence, then iterator is moved to end or rend, depending on the sign of nb.
Parameters
nbThe number of steps to move the iterator.
Returns
Returns this iterator.

Definition at line 176 of file sequence_tpl.h.

176  {
177  if (iterator__ == std::numeric_limits< Idx >::max()) return *this;
178  iterator__ -= nb;
179  if (iterator__ > seq__->size()) iterator__ = std::numeric_limits< Idx >::max();
180 
181  return *this;
182  }
Idx iterator__
The index in the sequence&#39;s vector where the iterator is pointing.
Definition: sequence.h:1416
Size size() const noexcept
Returns the size of the sequence.
Definition: sequence_tpl.h:37
const SequenceImplementation< Key, std::allocator< Key >, std::is_scalar< Key >::value > * seq__
The sequence pointed to by the iterator (by default, key is a scalar).
Definition: sequence.h:1421

◆ operator->()

template<typename Key >
INLINE const Key * gum::SequenceIteratorSafe< Key >::operator-> ( ) const

Returns the value pointed to by the iterator (works only for non-scalars).

Returns
Returns the value pointed to by the iterator (works only for non-scalars).

Definition at line 256 of file sequence_tpl.h.

256  {
257  return Getter::op_arrow(seq__->v__[pos()]);
258  }
Idx pos() const
Returns the position of the iterator in the sequence.
Definition: sequence_tpl.h:219
std::vector< Key *, typename Alloc::template rebind< Key *>::other > v__
The set of the elements stored into the sequence.
Definition: sequence.h:502
const SequenceImplementation< Key, std::allocator< Key >, std::is_scalar< Key >::value > * seq__
The sequence pointed to by the iterator (by default, key is a scalar).
Definition: sequence.h:1421

◆ operator=() [1/2]

template<typename Key>
INLINE SequenceIteratorSafe< Key > & gum::SequenceIteratorSafe< Key >::operator= ( const SequenceIteratorSafe< Key > &  source)
noexcept

Copy operator.

Parameters
sourceThe iterator to copy.
Returns
Returns this iterator.

Definition at line 125 of file sequence_tpl.h.

126  {
127  iterator__ = source.iterator__;
128  seq__ = source.seq__;
129  return *this;
130  }
Idx iterator__
The index in the sequence&#39;s vector where the iterator is pointing.
Definition: sequence.h:1416
const SequenceImplementation< Key, std::allocator< Key >, std::is_scalar< Key >::value > * seq__
The sequence pointed to by the iterator (by default, key is a scalar).
Definition: sequence.h:1421

◆ operator=() [2/2]

template<typename Key>
INLINE SequenceIteratorSafe< Key > & gum::SequenceIteratorSafe< Key >::operator= ( SequenceIteratorSafe< Key > &&  source)
noexcept

Move operator.

Parameters
sourceThe iterator to move.
Returns
Returns this iterator.

Definition at line 134 of file sequence_tpl.h.

135  {
136  iterator__ = source.iterator__;
137  seq__ = source.seq__;
138  return *this;
139  }
Idx iterator__
The index in the sequence&#39;s vector where the iterator is pointing.
Definition: sequence.h:1416
const SequenceImplementation< Key, std::allocator< Key >, std::is_scalar< Key >::value > * seq__
The sequence pointed to by the iterator (by default, key is a scalar).
Definition: sequence.h:1421

◆ operator==()

template<typename Key>
INLINE bool gum::SequenceIteratorSafe< Key >::operator== ( const SequenceIteratorSafe< Key > &  source) const
noexcept

Checks whether two iterators are pointing to the same elements.

Parameters
sourceThe iterator to test for equality.
Returns
Returns true if both iterators are equal.

Definition at line 200 of file sequence_tpl.h.

201  {
202  if (seq__->empty())
203  return true; // all iterators are the same if seq is empty
204 
205  if ((iterator__ != source.iterator__) || (seq__ != source.seq__)) return false;
206 
207  return true;
208  }
Idx iterator__
The index in the sequence&#39;s vector where the iterator is pointing.
Definition: sequence.h:1416
bool empty() const noexcept
Return true if empty.
Definition: sequence_tpl.h:43
const SequenceImplementation< Key, std::allocator< Key >, std::is_scalar< Key >::value > * seq__
The sequence pointed to by the iterator (by default, key is a scalar).
Definition: sequence.h:1421

◆ pos()

template<typename Key >
INLINE Idx gum::SequenceIteratorSafe< Key >::pos ( ) const

Returns the position of the iterator in the sequence.

Returns
Returns the position of the iterator in the sequence.
Exceptions
UndefinedIteratorValueRaised on end() or rend().

Definition at line 219 of file sequence_tpl.h.

219  {
220  if (iterator__ >= seq__->size()) {
221  GUM_ERROR(UndefinedIteratorValue, "iterator is end() or rend()");
222  }
223 
224  return iterator__;
225  }
Idx iterator__
The index in the sequence&#39;s vector where the iterator is pointing.
Definition: sequence.h:1416
Size size() const noexcept
Returns the size of the sequence.
Definition: sequence_tpl.h:37
#define GUM_ERROR(type, msg)
Definition: exceptions.h:54
const SequenceImplementation< Key, std::allocator< Key >, std::is_scalar< Key >::value > * seq__
The sequence pointed to by the iterator (by default, key is a scalar).
Definition: sequence.h:1421

◆ setAtEnd__()

template<typename Key >
INLINE void gum::SequenceIteratorSafe< Key >::setAtEnd__ ( )
privatenoexcept

The iterator points to the end (which is pos size()-1).

Definition at line 244 of file sequence_tpl.h.

244  {
245  iterator__ = seq__->size();
246  }
Idx iterator__
The index in the sequence&#39;s vector where the iterator is pointing.
Definition: sequence.h:1416
Size size() const noexcept
Returns the size of the sequence.
Definition: sequence_tpl.h:37
const SequenceImplementation< Key, std::allocator< Key >, std::is_scalar< Key >::value > * seq__
The sequence pointed to by the iterator (by default, key is a scalar).
Definition: sequence.h:1421

◆ setAtRend__()

template<typename Key >
INLINE void gum::SequenceIteratorSafe< Key >::setAtRend__ ( )
privatenoexcept

The iterator points to rend.

Definition at line 238 of file sequence_tpl.h.

238  {
239  iterator__ = std::numeric_limits< Idx >::max();
240  }
Idx iterator__
The index in the sequence&#39;s vector where the iterator is pointing.
Definition: sequence.h:1416

◆ setPos__()

template<typename Key >
INLINE void gum::SequenceIteratorSafe< Key >::setPos__ ( Idx  pos)
privatenoexcept

The iterator points to the posth element (0 = beginning of the sequence).

Definition at line 229 of file sequence_tpl.h.

229  {
230  if (pos > seq__->size())
231  iterator__ = seq__->size();
232  else
233  iterator__ = pos;
234  }
Idx iterator__
The index in the sequence&#39;s vector where the iterator is pointing.
Definition: sequence.h:1416
Size size() const noexcept
Returns the size of the sequence.
Definition: sequence_tpl.h:37
Idx pos() const
Returns the position of the iterator in the sequence.
Definition: sequence_tpl.h:219
const SequenceImplementation< Key, std::allocator< Key >, std::is_scalar< Key >::value > * seq__
The sequence pointed to by the iterator (by default, key is a scalar).
Definition: sequence.h:1421

Friends And Related Function Documentation

◆ SequenceImplementation

template<typename Key>
template<typename K , typename A , bool >
friend class SequenceImplementation
friend

Friend to speed up access.

Definition at line 1208 of file sequence.h.

Member Data Documentation

◆ iterator__

template<typename Key>
Idx gum::SequenceIteratorSafe< Key >::iterator__
private

The index in the sequence's vector where the iterator is pointing.

Definition at line 1416 of file sequence.h.

◆ seq__

template<typename Key>
const SequenceImplementation< Key, std::allocator< Key >, std::is_scalar< Key >::value >* gum::SequenceIteratorSafe< Key >::seq__
private

The sequence pointed to by the iterator (by default, key is a scalar).

Definition at line 1421 of file sequence.h.


The documentation for this class was generated from the following files: