gum::ListConstIteratorSafe< Val > Class Template Reference

Safe const iterators for Lists. More...

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

Inheritance diagram for gum::ListConstIteratorSafe< Val >:

Collaboration diagram for gum::ListConstIteratorSafe< Val >:

Public Member Functions
template<typename Alloc >
INLINE	ListConstIteratorSafe (const List< Val, Alloc > &theList)
Constructors / Destructors
	ListConstIteratorSafe () noexcept
	Default constructor. More...
template<typename Alloc >
	ListConstIteratorSafe (const List< Val, Alloc > &theList)
	Constructor for a begin. More...
	ListConstIteratorSafe (const ListConstIteratorSafe< Val > &src)
	Copy constructor. More...
template<typename Alloc >
	ListConstIteratorSafe (const List< Val, Alloc > &theList, Size ind_elt)
	Constructor for an iterator pointing to the ind_eltth element of a List. More...
	ListConstIteratorSafe (ListConstIteratorSafe< Val > &&src)
	Move constructor. More...
	~ListConstIteratorSafe ()
	Class Desctructor. More...
Accessors / Modifiers
void	clear ()
	Makes the iterator point toward nothing. More...
void	setToEnd ()
	Positions the iterator to the end of the list. More...
bool	isEnd () const
	Returns a bool indicating whether the iterator points to the end of the list. More...
Operators
ListConstIteratorSafe< Val > &	operator= (const ListConstIteratorSafe< Val > &src)
	Copy operator. More...
ListConstIteratorSafe< Val > &	operator= (ListConstIteratorSafe< Val > &&src)
	Move operator. More...
ListConstIteratorSafe< Val > &	operator++ () noexcept
	Makes the iterator point to the next element in the List. More...
ListConstIteratorSafe< Val > &	operator+= (difference_type i) noexcept
	Makes the iterator point to i elements further in the List. More...
ListConstIteratorSafe< Val > &	operator-- () noexcept
	Makes the iterator point to the preceding element in the List. More...
ListConstIteratorSafe< Val > &	operator-= (difference_type i) noexcept
	Makes the iterator point to i elements befor in the List. More...
ListConstIteratorSafe< Val >	operator+ (difference_type i) noexcept
	Returns a new iterator pointing to i further elements in the gum::List. More...
ListConstIteratorSafe< Val >	operator- (difference_type i) noexcept
	Returns a new iterator pointing to i preceding elements in the gum::List. More...
bool	operator!= (const ListConstIteratorSafe< Val > &src) const
	Checks whether two iterators point toward different elements. More...
bool	operator== (const ListConstIteratorSafe< Val > &src) const
	Checks whether two iterators point toward the same elements. More...
const Val &	operator* () const
	Gives access to the content of the iterator. More...
const Val *	operator-> () const
	Dereferences the value pointed to by the iterator. More...

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

Friends
template<typename T , typename A >
class	List
	class List must be a friend because it uses the getBucket method to speed up some processes. More...
class	ListConstIterator< Val >
	class List must be a friend because it uses the getBucket method to speed up some processes. More...

Detailed Description

template<typename Val>
class gum::ListConstIteratorSafe< Val >

Safe const iterators for Lists.

Class ListConstIteratorSafe implements safe const iterators for List. However, developers may consider using List<x>::const_iterator_safe instead of ListConstIteratorSafe<x>.

These const iterators ensure that whenever they point to an element that is being deleted from memory, their accessing this element will never produce a segmentation fault but rather throw an exception. Similarly, incrementing or decrementing an iterator pointing to a deleted element is guaranteed to make the iterator point on the next (or preceding) element that has not been deleted.

Usage example:

// create a list of strings
List<string> list;
list.pushBack ("toto"); list.pushBack ("titi");

// parse all the elements of a list
for ( List<string>::const_iterator_safe iter = list.cbeginSafe ();
      iter != list.cendSafe (); ++iter )
  cerr << *iter << endl;
for ( List<string>::const_iterator_safe iter = list.cbeginSafe ();
      iter != list.cendSafe (); iter += 2 ) // step = 2
  cerr << *iter << endl;
for ( List<string>::const_iterator_safe iter = list.cbeginSafe ();
      iter != list.cendSafe (); iter = iter + 2 ) // step = 2
  cerr << *iter << endl;
for ( List<string>::const_iterator_safe iter = list.crbeginSafe ();
      iter != list.crendSafe (); --iter )
  cerr << *iter << endl;

// use member size() of the strings
for ( List<string>::const_iterator_safe iter = list.cbeginSafe ();
      iter != list.cendSafe (); ++iter )
  cerr << iter->size() << endl;

Template Parameters

Val	The gum::List values type.

Definition at line 2034 of file list.h.

Member Typedef Documentation

const_pointer

template<typename Val >

using gum::ListConstIteratorSafe< Val >::const_pointer = const Val*

Types for STL compliance.

Definition at line 2043 of file list.h.

const_reference

template<typename Val >

using gum::ListConstIteratorSafe< Val >::const_reference = const Val&

Types for STL compliance.

Definition at line 2041 of file list.h.

difference_type

template<typename Val >

using gum::ListConstIteratorSafe< Val >::difference_type = std::ptrdiff_t

Types for STL compliance.

Definition at line 2044 of file list.h.

iterator_category

template<typename Val >

using gum::ListConstIteratorSafe< Val >::iterator_category = std::bidirectional_iterator_tag

Types for STL compliance.

Definition at line 2038 of file list.h.

pointer

template<typename Val >

using gum::ListConstIteratorSafe< Val >::pointer = Val*

Types for STL compliance.

Definition at line 2042 of file list.h.

reference

template<typename Val >

using gum::ListConstIteratorSafe< Val >::reference = Val&

Types for STL compliance.

Definition at line 2040 of file list.h.

value_type

template<typename Val >

using gum::ListConstIteratorSafe< Val >::value_type = Val

Types for STL compliance.

Definition at line 2039 of file list.h.

Constructor & Destructor Documentation

ListConstIteratorSafe() [1/6]

template<typename Val >

INLINE gum::ListConstIteratorSafe< Val >::ListConstIteratorSafe ( )

noexcept

Default constructor.

Returns an iterator pointing toward nothing.

Definition at line 492 of file list_tpl.h.

References gum::Set< Key, Alloc >::emplace().

                                                                      {
    // for debugging purposes
    GUM_CONSTRUCTOR(ListConstIteratorSafe);
  }

Here is the call graph for this function:

ListConstIteratorSafe() [2/6]

template<typename Val >

template<typename Alloc >

gum::ListConstIteratorSafe< Val >::ListConstIteratorSafe

(

const List< Val, Alloc > &

theList

)

Constructor for a begin.

Template Parameters

Alloc

The gum::List allocator.

ListConstIteratorSafe() [3/6]

template<typename Val >

INLINE gum::ListConstIteratorSafe< Val >::ListConstIteratorSafe

(

const ListConstIteratorSafe< Val > &

src

)

Copy constructor.

Parameters

src	The gum::ListConstIteratorSafe to copy.

Definition at line 514 of file list_tpl.h.

References gum::Set< Key, Alloc >::emplace().

                                              :
      list__{src.list__},
      bucket__{src.bucket__}, next_current_bucket__{src.next_current_bucket__},
      prev_current_bucket__{src.prev_current_bucket__}, null_pointing__{
                                                           src.null_pointing__} {
    // for debugging purposes
    GUM_CONS_CPY(ListConstIteratorSafe);

    // add the iterator to the list of safe iterators
    if (list__ != nullptr) list__->safe_iterators__.push_back(this);
  }

Here is the call graph for this function:

ListConstIteratorSafe() [4/6]

template<typename Val >

template<typename Alloc >

gum::ListConstIteratorSafe< Val >::ListConstIteratorSafe	(	const List< Val, Alloc > &	theList,
		Size	ind_elt
	)

Constructor for an iterator pointing to the ind_eltth element of a List.

Parameters

theList	The list to iterate over.
ind_elt	The iterator starting position.

Exceptions

UndefinedIteratorValue

Raised if the element does not exist in the list.

Definition at line 531 of file list_tpl.h.

References gum::Set< Key, Alloc >::emplace().

                                        :
      list__{
         reinterpret_cast< const List< Val, std::allocator< Val > >* >(&theList)} {
    // for debugging purposes
    GUM_CONSTRUCTOR(ListConstIteratorSafe);

    // check if the index ind_elt passed as parameter is valid
    if (ind_elt >= list__->nb_elements__) {
      GUM_ERROR(UndefinedIteratorValue, "Not enough elements in the list");
    }

    // check if it is faster to find the indexth element src the start or
    // src the end of the list
    if (ind_elt < (list__->nb_elements__ >> 1)) {
      // find the element we shall point to src the start of the list
      for (bucket__ = list__->deb_list__; ind_elt;
           --ind_elt, bucket__ = bucket__->next__) {}
    } else {
      // find the element we shall point to src the end of the list
      for (bucket__ = list__->end_list__,
          ind_elt   = list__->nb_elements__ - ind_elt - 1;
           ind_elt;
           --ind_elt, bucket__ = bucket__->prev__) {}
    }

    // add the iterator to the list of safe iterators
    theList.safe_iterators__.push_back(this);
  }

Here is the call graph for this function:

ListConstIteratorSafe() [5/6]

template<typename Val >

INLINE gum::ListConstIteratorSafe< Val >::ListConstIteratorSafe

(

ListConstIteratorSafe< Val > &&

src

)

Move constructor.

Parameters

src	The gum::ListConstIterator to move.

Definition at line 564 of file list_tpl.h.

References gum::Set< Key, Alloc >::emplace().

                                         :
      list__{src.list__},
      bucket__{src.bucket__}, next_current_bucket__{src.next_current_bucket__},
      prev_current_bucket__{src.prev_current_bucket__}, null_pointing__{
                                                           src.null_pointing__} {
    // for debugging purposes
    GUM_CONS_MOV(ListConstIteratorSafe);

    if (list__ != nullptr) {
      // substitute src by this in the list of safe iterators
      std::vector< ListConstIteratorSafe< Val >* >& vect
         = list__->safe_iterators__;

      for (auto ptr = vect.rbegin(); ptr != vect.rend(); --ptr) {
        if (*ptr == &src) {
          *ptr = this;
          break;
        }
      }

      src.list__          = nullptr;
      src.bucket__        = nullptr;
      src.null_pointing__ = false;
    }
  }

Here is the call graph for this function:

~ListConstIteratorSafe()

template<typename Val >

INLINE gum::ListConstIteratorSafe< Val >::~ListConstIteratorSafe

(

)

Class Desctructor.

Definition at line 693 of file list_tpl.h.

References gum::Set< Key, Alloc >::emplace().

                                                              {
    // for debugging purposes
    GUM_DESTRUCTOR(ListConstIteratorSafe);

    // remove the iterator src the table's iterator list
    if (list__) removeFromSafeList__();
  }

Here is the call graph for this function:

ListConstIteratorSafe() [6/6]

template<typename Val >

template<typename Alloc >

INLINE gum::ListConstIteratorSafe< Val >::ListConstIteratorSafe

(

const List< Val, Alloc > &

theList

)

Definition at line 500 of file list_tpl.h.

References gum::Set< Key, Alloc >::emplace().

                                        :
      list__{
         reinterpret_cast< const List< Val, std::allocator< Val > >* >(&theList)},
      bucket__{theList.deb_list__} {
    // for debugging purposes
    GUM_CONSTRUCTOR(ListConstIteratorSafe);

    // add the iterator to the list of safe iterators
    theList.safe_iterators__.push_back(this);
  }

Here is the call graph for this function:

Member Function Documentation

clear()

template<typename Val >

INLINE void gum::ListConstIteratorSafe< Val >::clear

(

)

Makes the iterator point toward nothing.

A method for detaching the iterator from the List it is attached to. It is mainly used by the List when the latter is deleted while the iterator is still alive. After being detached, the iterator does not point to any element, i.e., trying to access its content will raise an exception.

Definition at line 710 of file list_tpl.h.

References gum::Set< Key, Alloc >::emplace().

                                                  {
    // remove the iterator src the list's iterator list
    if (list__) removeFromSafeList__();

    // set its list as well as the element it points to to nullptr
    list__          = nullptr;
    bucket__        = nullptr;
    null_pointing__ = false;
  }

Here is the call graph for this function:

getBucket__()

template<typename Val >

INLINE ListBucket< Val > * gum::ListConstIteratorSafe< Val >::getBucket__ ( ) const

privatenoexcept

Returns the bucket the iterator is pointing to.

Definition at line 704 of file list_tpl.h.

References gum::Set< Key, Alloc >::emplace().

                                                                  {
    return bucket__;
  }

Here is the call graph for this function:

isEnd()

template<typename Val >

INLINE bool gum::ListConstIteratorSafe< Val >::isEnd

(

)

const

Returns a bool indicating whether the iterator points to the end of the list.

Returns

Returns a bool indicating whether the iterator points to the end of the list.

Definition at line 729 of file list_tpl.h.

References gum::Set< Key, Alloc >::emplace().

                                                        {
    return null_pointing__ ? (next_current_bucket__ == nullptr)
                                && (prev_current_bucket__ == nullptr)
                           : (bucket__ == nullptr);
  }

Here is the call graph for this function:

operator!=()

template<typename Val >

INLINE bool gum::ListConstIteratorSafe< Val >::operator!=

(

const ListConstIteratorSafe< Val > &

src

)

const

Checks whether two iterators point toward different elements.

Warning

the end and rend iterators are always equal, whatever the list they belong to, i.e., list1.end() == list2.rend().

Parameters

src	The gum::ListConstIteratorSafe to test for inequality.

Returns

Returns true if src and this are equal.

Definition at line 925 of file list_tpl.h.

References gum::Set< Key, Alloc >::emplace().

                                                    {
    return null_pointing__
            ? (next_current_bucket__ != src.next_current_bucket__)
                 || (prev_current_bucket__ != src.prev_current_bucket__)
            : (bucket__ != src.bucket__);
  }

Here is the call graph for this function:

operator*()

template<typename Val >

INLINE const Val & gum::ListConstIteratorSafe< Val >::operator*

(

)

const

Gives access to the content of the iterator.

Exceptions

UndefinedIteratorValue

Raised if the iterator points to nothing.

Returns

Returns the content of the iterator.

Definition at line 955 of file list_tpl.h.

References gum::Set< Key, Alloc >::emplace().

                                                                  {
    if (bucket__ != nullptr)
      return bucket__->val__;
    else {
      GUM_ERROR(UndefinedIteratorValue, "Accessing a NULL object");
    }
  }

Here is the call graph for this function:

operator+()

template<typename Val >

INLINE ListConstIteratorSafe< Val > gum::ListConstIteratorSafe< Val >::operator+ ( difference_type  i )

noexcept

Returns a new iterator pointing to i further elements in the gum::List.

Parameters

i	The number of steps to move the iterator.

Returns

Returns a new gum::ListConstIteratoSafe.

Definition at line 911 of file list_tpl.h.

References gum::Set< Key, Alloc >::emplace().

                                                                      {
    return ListConstIteratorSafe< Val >(*this) += i;
  }

Here is the call graph for this function:

operator++()

template<typename Val >

INLINE ListConstIteratorSafe< Val > & gum::ListConstIteratorSafe< Val >::operator++ ( )

noexcept

Makes the iterator point to the next element in the List.

for (iter = list.begin(); iter != list.end(); ++iter) { }

The above loop is guaranteed to parse the whole List as long as no element is added to or deleted from the List while being in the loop. Runs in constant time.

Returns

Returns this gum::ListConstIteratorSafe.

Definition at line 738 of file list_tpl.h.

References gum::Set< Key, Alloc >::emplace().

                                                       {
    // check if we are pointing to something that has been deleted
    if (null_pointing__) {
      null_pointing__ = false;

      // if we are pointing to an element of the chained list that has been
      // deleted
      // but that has a next element, just point on the latter
      if (next_current_bucket__ != nullptr) {
        bucket__ = next_current_bucket__->next__;
        return *this;
      }

      // here we were pointing on an extremity of the list (either end or rend)
      // if prev_current_bucket is not null, then we are at rend and doing
      // a ++ shall now point to the beginning of the list
      if (prev_current_bucket__ != nullptr) {
        bucket__ = prev_current_bucket__;
        return *this;
      }

      // here, we are at the end of the chained list, hence we shall remain at
      // end
      bucket__ = nullptr;
      return *this;
    } else {
      // if we are pointing to an element of the chained list, just
      // point on the next bucket in this list
      if (bucket__ != nullptr) { bucket__ = bucket__->next__; }

      return *this;
    }
  }

Here is the call graph for this function:

operator+=()

template<typename Val >

INLINE ListConstIteratorSafe< Val > & gum::ListConstIteratorSafe< Val >::operator+= ( difference_type  i )

noexcept

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

Parameters

i	The number of steps to move the iterator.

Returns

Returns this gum::ListConstIterator.

Definition at line 850 of file list_tpl.h.

References gum::Set< Key, Alloc >::emplace().

                                                                      {
    if (!i) return *this;

    if (i < 0)
      return opMinus__(-i);
    else
      return opPlus__(i);
  }

Here is the call graph for this function:

operator-()

template<typename Val >

INLINE ListConstIteratorSafe< Val > gum::ListConstIteratorSafe< Val >::operator- ( difference_type  i )

noexcept

Returns a new iterator pointing to i preceding elements in the gum::List.

Parameters

i	The number of steps to move the iterator.

Returns

Returns a new gum::ListConstIteratorSafe.

Definition at line 918 of file list_tpl.h.

References gum::Set< Key, Alloc >::emplace().

                                                                      {
    return ListConstIteratorSafe< Val >(*this) -= i;
  }

Here is the call graph for this function:

operator--()

template<typename Val >

INLINE ListConstIteratorSafe< Val > & gum::ListConstIteratorSafe< Val >::operator-- ( )

noexcept

Makes the iterator point to the preceding element in the List.

for (iter = list.rbegin(); iter != list.rend(); --iter) { }

The above loop is guaranteed to parse the whole List as long as no element is added to or deleted from the List while being in the loop. Runs in constant time.

Returns

Returns this gum::ListConstIteratorSafe.

Definition at line 863 of file list_tpl.h.

References gum::Set< Key, Alloc >::emplace().

                                                       {
    // check if we are pointing to something that has been deleted
    if (null_pointing__) {
      null_pointing__ = false;

      // if we are pointing to an element of the chained list that has been
      // deleted
      // but that has a preceding element, just point on the latter
      if (prev_current_bucket__ != nullptr) {
        bucket__ = prev_current_bucket__->prev__;
        return *this;
      }

      // here we were pointing on an extremity of the list (either end or rend)
      // if next_current_bucket is not null, then we are at end and doing
      // a -- shall now point to the beginning of the list
      if (next_current_bucket__ != nullptr) {
        bucket__ = next_current_bucket__;
        return *this;
      }

      // here, we are at the rend of the chained list, hence we shall remain
      // at rend
      bucket__ = nullptr;
      return *this;
    } else {
      // if we are pointing to an element of the chained list, just
      // point on the preceding bucket in this list
      if (bucket__ != nullptr) { bucket__ = bucket__->prev__; }

      return *this;
    }
  }

Here is the call graph for this function:

operator-=()

template<typename Val >

INLINE ListConstIteratorSafe< Val > & gum::ListConstIteratorSafe< Val >::operator-= ( difference_type  i )

noexcept

Makes the iterator point to i elements befor in the List.

Parameters

i	The number of steps to move the iterator.

Returns

Returns this gum::ListConstIteratorSafe.

Definition at line 899 of file list_tpl.h.

References gum::Set< Key, Alloc >::emplace().

                                                                      {
    if (!i) return *this;

    if (i < 0)
      return opPlus__(-i);
    else
      return opMinus__(i);
  }

Here is the call graph for this function:

operator->()

template<typename Val >

INLINE const Val * gum::ListConstIteratorSafe< Val >::operator->

(

)

const

Dereferences the value pointed to by the iterator.

Exceptions

UndefinedIteratorValue

Raised if the iterator points to nothing.

Returns

Returns the value pointed to by the iterator.

Definition at line 945 of file list_tpl.h.

References gum::Set< Key, Alloc >::emplace().

                                                                   {
    if (bucket__ != nullptr)
      return &(bucket__->val__);
    else {
      GUM_ERROR(UndefinedIteratorValue, "Accessing a NULL object");
    }
  }

Here is the call graph for this function:

operator=() [1/2]

template<typename Val >

ListConstIteratorSafe< Val > & gum::ListConstIteratorSafe< Val >::operator=

(

const ListConstIteratorSafe< Val > &

src

)

Copy operator.

The current iterator now points to the same element as iterator from.

Parameters

src	The gum::ListConstIteratorSafe to copy.

Returns

Returns this gum::ListConstIteratorSafe.

Definition at line 607 of file list_tpl.h.

References gum::Set< Key, Alloc >::emplace().

                                              {
    // avoid self assignment
    if (this != &src) {
      // for debugging purposes
      GUM_OP_CPY(ListConstIteratorSafe);

      // check if src and this belong to the same list. If this is not
      // the case, we shall remove this from its iterator's list and
      // put it into src's list one.
      if (list__ && (src.list__ != list__)) {
        removeFromSafeList__();
        list__ = nullptr;
      }

      // if necessary, put this into the same list of safe iterators as src
      if (src.list__ && (src.list__ != list__)) {
        try {
          src.list__->safe_iterators__.push_back(this);
        } catch (...) {
          list__          = nullptr;
          bucket__        = nullptr;
          null_pointing__ = false;
          throw;
        }
      }

      list__                = src.list__;
      bucket__              = src.bucket__;
      prev_current_bucket__ = src.prev_current_bucket__;
      next_current_bucket__ = src.next_current_bucket__;
      null_pointing__       = src.null_pointing__;
    }

    return *this;
  }

Here is the call graph for this function:

operator=() [2/2]

template<typename Val >

ListConstIteratorSafe< Val > & gum::ListConstIteratorSafe< Val >::operator=

(

ListConstIteratorSafe< Val > &&

src

)

Move operator.

Parameters

src	The gum::ListConstIteratorSafe to move.

Returns

Returns this gum::ListConstIteratorSafe.

Definition at line 647 of file list_tpl.h.

References gum::Set< Key, Alloc >::emplace().

                                                                               {
    // avoid self assignment
    if (this != &src) {
      // for debugging purposes
      GUM_OP_MOV(ListConstIteratorSafe);

      // if the two iterators do not point to the same list, remove
      // the current iterator from its safe iterators list
      if ((list__ != nullptr) && (src.list__ != list__)) {
        removeFromSafeList__();
        list__ = nullptr;
      }

      // now if src points to a list, put this at its location
      if ((src.list__ != nullptr)) {
        std::vector< ListConstIteratorSafe< Val >* >& vect
           = src.list__->safe_iterators__;
        Idx index_src = Size(vect.size()) - 1;

        for (;; --index_src) {
          if (vect[index_src] == &src) { break; }
        }

        if (list__ == nullptr) {
          vect[index_src] = this;
        } else {
          vect.erase(vect.begin() + index_src);
        }
      }

      list__                = src.list__;
      bucket__              = src.bucket__;
      prev_current_bucket__ = src.prev_current_bucket__;
      next_current_bucket__ = src.next_current_bucket__;
      null_pointing__       = src.null_pointing__;

      src.list__          = nullptr;
      src.bucket__        = nullptr;
      src.null_pointing__ = false;
    }

    return *this;
  }

Here is the call graph for this function:

operator==()

template<typename Val >

INLINE bool gum::ListConstIteratorSafe< Val >::operator==

(

const ListConstIteratorSafe< Val > &

src

)

const

Checks whether two iterators point toward the same elements.

Warning

the end and rend iterators are always equal, whatever the list they belong to, i.e., list1.end() == list2.rend().

Parameters

src	The gum::ListConstIteratorSafe to test for equality.

Returns

Returns true if src and this are equal.

Definition at line 935 of file list_tpl.h.

References gum::Set< Key, Alloc >::emplace().

                                                    {
    return null_pointing__
            ? (next_current_bucket__ == src.next_current_bucket__)
                 && (prev_current_bucket__ == src.prev_current_bucket__)
            : (bucket__ == src.bucket__);
  }

Here is the call graph for this function:

opMinus__()

template<typename Val >

INLINE ListConstIteratorSafe< Val > & gum::ListConstIteratorSafe< Val >::opMinus__ ( Size  i )

privatenoexcept

Makes the iterator point to i elements before in the List.

Definition at line 775 of file list_tpl.h.

References gum::Set< Key, Alloc >::emplace().

                                                                {
    // check if we are pointing to something that has been deleted
    if (null_pointing__) {
      null_pointing__ = false;

      // if we are pointing to an element of the chained list that has been
      // deleted
      // but that has a preceding element, just point on the latter
      if (prev_current_bucket__ != nullptr) {
        bucket__ = prev_current_bucket__->prev__;
      } else {
        // here we were pointing on an extremity of the list (either end or
        // rend)
        // if next_current_bucket is not null, then we are at end and doing
        // a -- shall now point to the beginning of the list
        if (next_current_bucket__ != nullptr) {
          bucket__ = next_current_bucket__;
        } else {
          // here, we are at the rend of the chained list, hence we shall remain
          // at rend
          bucket__ = nullptr;
          return *this;
        }
      }
    } else {
      // if we are pointing to an element of the chained list, just
      // point on the preceding bucket in this list
      if (bucket__ != nullptr) { bucket__ = bucket__->prev__; }
    }

    for (--i; i && (bucket__ != nullptr); --i, bucket__ = bucket__->prev__) {}

    return *this;
  }

Here is the call graph for this function:

opPlus__()

template<typename Val >

INLINE ListConstIteratorSafe< Val > & gum::ListConstIteratorSafe< Val >::opPlus__ ( Size  i )

privatenoexcept

Makes the iterator point to the next element in the List.

Definition at line 813 of file list_tpl.h.

References gum::Set< Key, Alloc >::emplace().

                                                               {
    // check if we are pointing to something that has been deleted
    if (null_pointing__) {
      null_pointing__ = false;

      // if we are pointing to an element of the chained list that has been
      // deleted
      // but that has a next element, just point on the latter
      if (next_current_bucket__ != nullptr) {
        bucket__ = next_current_bucket__->next__;
      } else {
        // here we were pointing on an extremity of the list (either end or
        // rend)
        // if prev_current_bucket is not null, then we are at rend and doing
        // a ++ shall now point to the beginning of the list
        if (prev_current_bucket__ != nullptr) {
          bucket__ = prev_current_bucket__;
        } else {
          // here, we are at the end of the chained list, hence we shall
          // remain at end
          bucket__ = nullptr;
          return *this;
        }
      }
    } else {
      // if we are pointing to an element of the chained list, just
      // point on the next bucket in this list
      if (bucket__ != nullptr) { bucket__ = bucket__->next__; }
    }

    for (--i; i && (bucket__ != nullptr); --i, bucket__ = bucket__->next__) {}

    return *this;
  }

Here is the call graph for this function:

removeFromSafeList__()

template<typename Val >

INLINE void gum::ListConstIteratorSafe< Val >::removeFromSafeList__ ( ) const

private

Remove the iterator for its list' safe iterators list.

Definition at line 593 of file list_tpl.h.

References gum::Set< Key, Alloc >::emplace().

                                                                       {
    // find where the iterator is
    std::vector< ListConstIteratorSafe< Val >* >& vect = list__->safe_iterators__;

    for (auto i = vect.size() - 1; i >= 0; --i) {
      if (vect[i] == this) {
        vect.erase(vect.begin() + i);
        break;
      }
    }
  }

Here is the call graph for this function:

setToEnd()

template<typename Val >

INLINE void gum::ListConstIteratorSafe< Val >::setToEnd

(

)

Positions the iterator to the end of the list.

Definition at line 722 of file list_tpl.h.

References gum::Set< Key, Alloc >::emplace().

                                                     {
    clear();
  }

Here is the call graph for this function:

Friends And Related Function Documentation

List

template<typename Val >

template<typename T , typename A >

friend class List

friend

class List must be a friend because it uses the getBucket method to speed up some processes.

Definition at line 2252 of file list.h.

ListConstIterator< Val >

template<typename Val >

friend class ListConstIterator< Val >

friend

class List must be a friend because it uses the getBucket method to speed up some processes.

Definition at line 2253 of file list.h.

Member Data Documentation

bucket__

template<typename Val >

ListBucket< Val >* gum::ListConstIteratorSafe< Val >::bucket__ {nullptr}

private

The bucket in the chained list pointed to by the iterator.

Definition at line 2260 of file list.h.

list__

template<typename Val >

const List< Val, std::allocator< Val > >* gum::ListConstIteratorSafe< Val >::list__ {nullptr}

private

The list the iterator is pointing to.

Definition at line 2257 of file list.h.

next_current_bucket__

template<typename Val >

ListBucket< Val >* gum::ListConstIteratorSafe< Val >::next_current_bucket__ {nullptr}

private

The bucket we should start from when we are pointing on a deleted bucket and we decide to do a ++.

Definition at line 2264 of file list.h.

null_pointing__

template<typename Val >

bool gum::ListConstIteratorSafe< Val >::null_pointing__ {false}

private

Indicates whether the bucket the iterator points to has been deleted.

Definition at line 2271 of file list.h.

prev_current_bucket__

template<typename Val >

ListBucket< Val >* gum::ListConstIteratorSafe< Val >::prev_current_bucket__ {nullptr}

private

The bucket we should start from when we are pointing on a deleted bucket and we decide to do a –.

Definition at line 2268 of file list.h.

---

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

• agrum/tools/core/list.h
• agrum/tools/core/list_tpl.h