gum::List< Val, Alloc > Class Template Reference

Generic doubly linked lists. More...

#include <agrum/core/list.h>

Public Member Functions
template<typename OtherAlloc >
INLINE	List (const List< Val, OtherAlloc > &src)
template<typename OtherAlloc >
INLINE List< Val, Alloc > &	operator= (const List< Val, OtherAlloc > &src)
template<typename... Args>
INLINE ListBucket< Val > *	__createEmplaceBucket (Args &&... args) const
template<typename... Args>
INLINE Val &	push_front (Args &&... args)
template<typename... Args>
INLINE Val &	emplaceFront (Args &&... args)
template<typename... Args>
INLINE Val &	push_back (Args &&... args)
template<typename... Args>
INLINE Val &	emplaceBack (Args &&... args)
template<typename... Args>
INLINE Val &	emplace (const const_iterator &iter, Args &&... args)
template<typename... Args>
INLINE Val &	emplace (const const_iterator_safe &iter, Args &&... args)
template<typename OtherAlloc >
INLINE bool	operator== (const List< Val, OtherAlloc > &src) const
template<typename OtherAlloc >
INLINE bool	operator!= (const List< Val, OtherAlloc > &src) const
Constructors / Destructors
	List ()
	A basic constructor that creates an empty list. More...
	List (const List< Val, Alloc > &src)
	Copy constructor. More...
template<typename OtherAlloc >
	List (const List< Val, OtherAlloc > &src)
	Ceneralized copy constructor. More...
	List (List< Val, Alloc > &&src)
	Move constructor. More...
	List (std::initializer_list< Val > list)
	Initializer_list constructor. More...
	~List ()
	Class destructor. More...
Iterators
const const_iterator_safe &	cendSafe () const noexcept
	Returns a safe const iterator pointing to the end of the List. More...
const iterator_safe &	endSafe () noexcept
	Returns a safe iterator pointing to the end of the List. More...
const const_iterator_safe &	crendSafe () const noexcept
	Return a safe const iterator pointing just before the beginning of the List. More...
const iterator_safe &	rendSafe () noexcept
	Returns a safe iterator pointing just before the beginning of the List. More...
const_iterator_safe	cbeginSafe () const
	Returns a safe const iterator pointing to the beginning of the List. More...
iterator_safe	beginSafe ()
	Returns a safe iterator pointing to the beginning of the List. More...
const_iterator_safe	crbeginSafe () const
	Returns a safe const iterator pointing to the last element of the List. More...
iterator_safe	rbeginSafe ()
	Returns a safe iterator pointing to the last element of the List. More...
const const_iterator &	cend () const noexcept
	Returns an unsafe const iterator pointing to the end of the List. More...
const iterator &	end () noexcept
	Returns an unsafe iterator pointing to the end of the List. More...
const const_iterator &	end () const noexcept
	Returns an unsafe const iterator pointing to the end of the List. More...
const const_iterator &	crend () const noexcept
	Returns an unsafe const iterator pointing just before the beginning of the List. More...
const iterator &	rend () noexcept
	Returns an unsafe iterator pointing just before the beginning of the List. More...
const const_iterator &	rend () const noexcept
	Returns an unsafe const iterator pointing just before the beginning of the List. More...
const_iterator	cbegin () const
	Returns an unsafe const iterator pointing to the beginning of the List. More...
iterator	begin ()
	Returns an unsafe iterator pointing to the beginning of the List. More...
const_iterator	begin () const
	Returns an unsafe const iterator pointing to the beginning of the List. More...
const_iterator	crbegin () const
	Returns an unsafe const iterator pointing to the last element of the List. More...
iterator	rbegin ()
	Returns an unsafe iterator pointing to the last element of the List. More...
const_iterator	rbegin () const
	Returns an unsafe const iterator pointing to the last element of the List. More...
Accessors / Modifiers
Val &	pushFront (const Val &val)
	Inserts a new element (a copy) at the beginning of the chained list. More...
Val &	pushFront (Val &&val)
	Inserts a new element (a move) at the beginning of the chained list. More...
template<typename... Args>
Val &	push_front (Args &&... args)
	An alias for pushFront used for STL compliance. More...
template<typename... Args>
Val &	emplaceFront (Args &&... args)
	Emplace elements at the beginning of the chained list. More...
Val &	pushBack (const Val &val)
	Inserts a new element (a copy) at the end of the chained list. More...
Val &	pushBack (Val &&val)
	Inserts a new element (a move) at the end of the chained list. More...
template<typename... Args>
Val &	push_back (Args &&... args)
	An alias for pushBack used for STL compliance. More...
template<typename... Args>
Val &	emplaceBack (Args &&... args)
	Emplace elements at the end of the chained list. More...
Val &	insert (const Val &val)
	Inserts a new element at the end of the chained list (alias of pushBack). More...
Val &	insert (Val &&val)
	Inserts a new element at the end of the chained list (alias of pushBack). More...
Val &	insert (Size pos, const Val &val)
	Inserts a new element at the ith pos of the chained list. More...
Val &	insert (Size pos, Val &&val)
	Insert an rvalue at the ith pos of the chained list. More...
Val &	insert (const const_iterator_safe &iter, const Val &val, location place=location::BEFORE)
	Inserts a new element before or after a given iterator. More...
Val &	insert (const const_iterator_safe &iter, Val &&val, location place=location::BEFORE)
	Inserts an rvalue before or after a given iterator. More...
Val &	insert (const const_iterator &iter, const Val &val, location place=location::BEFORE)
	Inserts a new element before or after a given iterator. More...
Val &	insert (const const_iterator &iter, Val &&val, location place=location::BEFORE)
	Inserts an rvalue before or after a given iterator. More...
template<typename... Args>
Val &	emplace (const const_iterator &iter, Args &&... args)
	Emplace a new element before a given iterator. More...
template<typename... Args>
Val &	emplace (const const_iterator_safe &iter, Args &&... args)
	Emplace a new element before a given safe iterator. More...
Val &	front () const
	Returns a reference to first element of a list, if any. More...
Val &	back () const
	Returns a reference to last element of a list, if any. More...
Size	size () const noexcept
	Returns the number of elements in the list. More...
bool	exists (const Val &val) const
	Checks whether there exists a given element in the list. More...
void	erase (Size i)
	Erases the ith element of the List (the first one is in position 0). More...
void	erase (const iterator_safe &iter)
	Erases the element of the List pointed to by the safe iterator. More...
void	erase (const const_iterator_safe &iter)
	Erases the element of the List pointed to by the safe const iterator. More...
void	eraseByVal (const Val &val)
	erases the first element encountered with a given value. More...
void	eraseAllVal (const Val &val)
	erases all the elements encountered with a given value More...
void	popBack ()
	Removes the last element of a List, if any. More...
void	popFront ()
	Removes the first element of a List, if any. More...
void	clear ()
	Deletes all the elements of a chained list. More...
bool	empty () const noexcept
	Returns a boolean indicating whether the chained list is empty. More...
void	swap (List &other_list)
	Swap the current list with another one. More...
std::string	toString () const
	Converts a list into a string. More...
template<typename Mount , typename OtherAlloc = std::allocator< Mount >>
List< Mount, OtherAlloc >	map (Mount(*f)(Val)) const
	Creates a list of mountains from a list of val. More...
template<typename Mount , typename OtherAlloc = std::allocator< Mount >>
List< Mount, OtherAlloc >	map (Mount(*f)(Val &)) const
	Creates a list of mountains from a list of val. More...
template<typename Mount , typename OtherAlloc = std::allocator< Mount >>
List< Mount, OtherAlloc >	map (Mount(*f)(const Val &)) const
	Creates a list of mountains from a list of val. More...
template<typename Mount , typename OtherAlloc = std::allocator< Mount >>
List< Mount, OtherAlloc >	map (const Mount &mount) const
	Creates a list of mountains with a given value from a list of val. More...
Operators
List< Val, Alloc > &	operator= (const List< Val, Alloc > &src)
	Copy operator. More...
template<typename OtherAlloc >
List< Val, Alloc > &	operator= (const List< Val, OtherAlloc > &src)
	Generalized copy operator. More...
List< Val, Alloc > &	operator= (List< Val, Alloc > &&src)
	Move operator. More...
Val &	operator+= (const Val &val)
	Inserts a new element at the end of the list (alias of pushBack). More...
Val &	operator+= (Val &&val)
	Inserts a new element at the end of the list (alias of pushBack). More...
template<typename OtherAlloc >
bool	operator== (const List< Val, OtherAlloc > &src) const
	Checks whether two lists are identical (same elements in the same order). More...
template<typename OtherAlloc >
bool	operator!= (const List< Val, OtherAlloc > &src) const
	Checks whether two lists are different (different elements or orders). More...
Val &	operator[] (const Size i)
	Returns the ith element in the current chained list. More...
const Val &	operator[] (const Size i) const
	Returns the const ith element in the current chained list. More...

Public Types
enum	location { location::BEFORE, location::AFTER }
	Locations around iterators where insertions of new elements can take / place. More...
using	BucketAllocator = typename Alloc::template rebind< ListBucket< Val > >::other
	Type of the allocator for ListBuckets. 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	size_type = Size
	Types for STL compliance. More...
using	difference_type = std::ptrdiff_t
	Types for STL compliance. More...
using	allocator_type = Alloc
	Types for STL compliance. More...
using	iterator = ListIterator< Val >
	Types for STL compliance. More...
using	const_iterator = ListConstIterator< Val >
	Types for STL compliance. More...
using	iterator_safe = ListIteratorSafe< Val >
	Types for STL compliance. More...
using	const_iterator_safe = ListConstIteratorSafe< Val >
	Types for STL compliance. More...

Friends
class	ListIterator< Val >
	ListIterator should be a friend to optimize access to elements. More...
class	ListConstIterator< Val >
	ListIterator should be a friend to optimize access to elements. More...
class	ListIteratorSafe< Val >
	ListIterator should be a friend to optimize access to elements. More...
class	ListConstIteratorSafe< Val >
	ListIterator should be a friend to optimize access to elements. More...

Detailed Description

template<typename Val, typename Alloc = std::allocator< Val >>
class gum::List< Val, Alloc >

Generic doubly linked lists.

List enables fast and safe manipulation of chained lists. Unless the elements are rvalues, the insertions of new elements into the lists are ALWAYS performed by copy, i.e., each time we add a new element X to the List, a copy of X is actually created and this very copy is stored into the list. For rvalues, move operations are performed.

The List iterators are implemented so as to avoid segmentation faults when elements of the list are deleted while some safe iterators are pointing on them. Moreover they ensure that, when elements are removed from a List, iterators on that list will never access these elements (which is not the case for the iterators in the C++ standard library). Note that this guarantee is ensured at low cost as experimental results show that List and ListIterator are as efficient as their STL counterparts. However, this guarantee can hold only if List is aware of all of the iterators pointing to it: thus, when List erases one element, it can parse the list of its iterators and update those that point toward the now deleted element. When parsing elements without removing any element, you can use unsafe iterators instead of safe ones because they are slightly faster. But those will most certainly segfault if they perform some operations on deleted elements.

Usage example:

// creation of an empty list
List<int> list1;
List<int> list2 { 3, 4, 5 }; // initializer list

// adding elements to the list
list1.pushFront (23);
list1.pushBack (10);
list1 += 25;
list1.insert (12);

// getting the second element of the list
cerr << "10 = " << list1[1] << endl;

// getting the first and last elements
cerr << "first = " << list1.front() << " last = " << list1.back() << endl;

// get the number of elements in the list
cerr << "number of elements = " << list1.size () << endl;

// display the content of the list
cerr << list1 << endl;

// copy the list
List<int> list2 = list1, list3;
list3 = list1;

// delete the second element from the list
list1.erase (1);

// delete the first and last elements
list1.popFront ();
list1.popBack ();

// delete element whose value is 25
list1.eraseByVal (25);

// check whether the list is empty
if (list1.empty()) cerr << "empty list" << endl;

// remove all elements from the list
list1.clear ();

// parse all the elements of a list using unsafe iterators
for (List<int>::iterator iter = list2.begin();
     iter != list2.end(); ++iter)
  cerr << *iter << endl;
for (List<int>::iterator iter = list2.rbegin();
     iter != list2.rend(); --iter)
  cerr << *iter << endl;
for (List<int>::const_iterator iter = list2.cbegin();
     iter != list2.cend(); ++iter)
  cerr << *iter << endl;
for (List<int>::const_iterator iter = list2.crbegin();
     iter != list2.crend(); --iter)
  cerr << *iter << endl;

// parse all the elements of a list using safe iterators
for (List<int>::iterator_safe iter = list2.beginSafe();
     iter != list2.endSafe(); ++iter)
  cerr << *iter << endl;
for (List<int>::iterator_safe iter = list2.rbeginSafe();
     iter != list2.rendSafe(); --iter)
  cerr << *iter << endl;
for (List<int>::const_iterator_safe iter = list2.cbeginSafe();
     iter != list2.cendSafe(); ++iter)
  cerr << *iter << endl;
for (List<int>::const_iterator_safe iter = list2.crbeginSafe();
     iter != list2.crendSafe(); --iter)
  cerr << *iter << endl;

// use an iterator to point the element we wish to erase
List<int>::iterator_safe iter = list2.beginSafe();
List2.erase ( iter );
List<int>::iterator iter2 = list2.begin() + 4; // 5th element of the list
iter2 = iter + 4;

// map a list into another list (assuming function f is defined as
// float f (int x) { return (2.5 * x); } )
List<float> flist = list2.map (f);

Template Parameters

Val	The values type stored in the gum::List.
Alloc	The allocator for the values stored in the gum::List.

Definition at line 372 of file list.h.

Member Typedef Documentation

allocator_type

template<typename Val, typename Alloc = std::allocator< Val >>

using gum::List< Val, Alloc >::allocator_type = Alloc

Types for STL compliance.

Definition at line 383 of file list.h.

BucketAllocator

template<typename Val, typename Alloc = std::allocator< Val >>

using gum::List< Val, Alloc >::BucketAllocator = typename Alloc::template rebind< ListBucket< Val > >::other

Type of the allocator for ListBuckets.

Definition at line 392 of file list.h.

const_iterator

template<typename Val, typename Alloc = std::allocator< Val >>

using gum::List< Val, Alloc >::const_iterator = ListConstIterator< Val >

Types for STL compliance.

Definition at line 385 of file list.h.

const_iterator_safe

template<typename Val, typename Alloc = std::allocator< Val >>

using gum::List< Val, Alloc >::const_iterator_safe = ListConstIteratorSafe< Val >

Types for STL compliance.

Definition at line 387 of file list.h.

const_pointer

template<typename Val, typename Alloc = std::allocator< Val >>

using gum::List< Val, Alloc >::const_pointer = const Val*

Types for STL compliance.

Definition at line 380 of file list.h.

const_reference

template<typename Val, typename Alloc = std::allocator< Val >>

using gum::List< Val, Alloc >::const_reference = const Val&

Types for STL compliance.

Definition at line 378 of file list.h.

difference_type

template<typename Val, typename Alloc = std::allocator< Val >>

using gum::List< Val, Alloc >::difference_type = std::ptrdiff_t

Types for STL compliance.

Definition at line 382 of file list.h.

iterator

template<typename Val, typename Alloc = std::allocator< Val >>

using gum::List< Val, Alloc >::iterator = ListIterator< Val >

Types for STL compliance.

Definition at line 384 of file list.h.

iterator_safe

template<typename Val, typename Alloc = std::allocator< Val >>

using gum::List< Val, Alloc >::iterator_safe = ListIteratorSafe< Val >

Types for STL compliance.

Definition at line 386 of file list.h.

pointer

template<typename Val, typename Alloc = std::allocator< Val >>

using gum::List< Val, Alloc >::pointer = Val*

Types for STL compliance.

Definition at line 379 of file list.h.

reference

template<typename Val, typename Alloc = std::allocator< Val >>

using gum::List< Val, Alloc >::reference = Val&

Types for STL compliance.

Definition at line 377 of file list.h.

size_type

template<typename Val, typename Alloc = std::allocator< Val >>

using gum::List< Val, Alloc >::size_type = Size

Types for STL compliance.

Definition at line 381 of file list.h.

value_type

template<typename Val, typename Alloc = std::allocator< Val >>

using gum::List< Val, Alloc >::value_type = Val

Types for STL compliance.

Definition at line 376 of file list.h.

Member Enumeration Documentation

location

template<typename Val, typename Alloc = std::allocator< Val >>

enum gum::List::location

strong

Locations around iterators where insertions of new elements can take / place.

Enumerator
BEFORE
AFTER

Definition at line 396 of file list.h.

{ BEFORE, AFTER };

Constructor & Destructor Documentation

List() [1/6]

template<typename Val , typename Alloc >

INLINE gum::List< Val, Alloc >::List

(

)

A basic constructor that creates an empty list.

Definition at line 1186 of file list_tpl.h.

                                  {
    // for debugging purposes
    GUM_CONSTRUCTOR(List);

    // reserve space for only the default number of iterators
    __safe_iterators.reserve(GUM_DEFAULT_ITERATOR_NUMBER);
  }

List() [2/6]

template<typename Val, typename Alloc>

INLINE gum::List< Val, Alloc >::List

(

const List< Val, Alloc > &

src

)

Copy constructor.

The new list and that which is copied do not share their elements: the new list contains new instances of the values stored in the list to be copied. Of course if these values are pointers, the new values point toward the same elements. This constructor runs in linear time.

Parameters

src	the list the contents of which is copied into the current one.

Definition at line 1196 of file list_tpl.h.

                                                               {
    // for debugging purposes
    GUM_CONS_CPY(List);

    // copy the elements
    __copy_elements(src);

    // reserve space for only the default number of iterators
    __safe_iterators.reserve(GUM_DEFAULT_ITERATOR_NUMBER);
  }

List() [3/6]

template<typename Val, typename Alloc = std::allocator< Val >>

template<typename OtherAlloc >

gum::List< Val, Alloc >::List

(

const List< Val, OtherAlloc > &

src

)

Ceneralized copy constructor.

The new list and that which is copied do not share their elements: the new list contains new instances of the values stored in the list to be copied. Of course if these values are pointers, the new values point toward the same elements. This constructor runs in linear time.

Parameters

src	the list the contents of which is copied into the current one.

Template Parameters

OtherAlloc

The other allocator.

List() [4/6]

template<typename Val, typename Alloc>

INLINE gum::List< Val, Alloc >::List

(

List< Val, Alloc > &&

src

)

Move constructor.

Parameters

src	The gum::List to move.

Definition at line 1223 of file list_tpl.h.

                                                          :
      __deb_list{std::move(src.__deb_list)}, __end_list{std::move(src.__end_list)},
      __nb_elements{std::move(src.__nb_elements)},
      __safe_iterators{std::move(src.__safe_iterators)}, __alloc_bucket{std::move(
                                                            src.__alloc_bucket)} {
    // for debugging purposes
    GUM_CONS_MOV(List);

    src.__deb_list = nullptr;
    src.__end_list = nullptr;
    src.__nb_elements = 0;
    src.__safe_iterators.clear();
  }

List() [5/6]

template<typename Val, typename Alloc>

INLINE gum::List< Val, Alloc >::List

(

std::initializer_list< Val >

list

)

Initializer_list constructor.

Parameters

list	The initializer list.

Definition at line 1239 of file list_tpl.h.

                                                                 {
    // for debugging purposes
    GUM_CONSTRUCTOR(List);

    // adding all the elements
    for (const auto& val : list) {
      pushBack(val);
    }

    // reserve space for only the default number of iterators
    __safe_iterators.reserve(GUM_DEFAULT_ITERATOR_NUMBER);
  }

~List()

template<typename Val , typename Alloc >

INLINE gum::List< Val, Alloc >::~List

(

)

Class destructor.

Definition at line 1254 of file list_tpl.h.

                                   {
    // for debugging (although this program is bug-free)
    GUM_DESTRUCTOR(List);

    // we detach all the safe iterators attached to the current List and we
    // remove all the elements from the list
    clear();
  }

List() [6/6]

template<typename Val, typename Alloc = std::allocator< Val >>

template<typename OtherAlloc >

INLINE gum::List< Val, Alloc >::List

(

const List< Val, OtherAlloc > &

src

)

Definition at line 1210 of file list_tpl.h.

                                                                    {
    // for debugging purposes
    GUM_CONS_CPY(List);

    // copy the elements
    __copy_elements(src);

    // reserve space for only the default number of iterators
    __safe_iterators.reserve(GUM_DEFAULT_ITERATOR_NUMBER);
  }

Member Function Documentation

__copy_elements()

template<typename Val, typename Alloc >

template<typename OtherAlloc >

void gum::List< Val, Alloc >::__copy_elements ( const List< Val, OtherAlloc > &  src )

private

A function used to perform copies of elements of Lists.

Before performing the copy, we assume in this function that the current list (this) is empty (else there would be memory leak).

Template Parameters

OtherAlloc

The other allocator.

Parameters

src	The gum::List to copy.

Definition at line 1114 of file list_tpl.h.

                                                                             {
    ListBucket< Val >* ptr;
    ListBucket< Val >* old_ptr = nullptr;
    ListBucket< Val >* new_elt = nullptr;

    // copy src's list
    try {
      for (ptr = src.__deb_list; ptr != nullptr; ptr = ptr->__next) {
        // create a copy bucket
        new_elt = __alloc_bucket.allocate(1);

        try {
          __alloc_bucket.construct(new_elt, *ptr);
        } catch (...) {
          __alloc_bucket.deallocate(new_elt, 1);
          throw;
        }

        // rechain properly the new list (the next field is already initialized
        // with nullptr)
        new_elt->__prev = old_ptr;

        if (old_ptr)
          old_ptr->__next = new_elt;
        else
          __deb_list = new_elt;

        old_ptr = new_elt;
      }
    } catch (...) {
      // problem: we could not allocate an element in the list => we delete
      // the elements created so far and we throw an exception
      for (; __deb_list != nullptr;
           __deb_list = const_cast< ListBucket< Val >* >(ptr)) {
        ptr = __deb_list->__next;
        __alloc_bucket.destroy(__deb_list);
        __alloc_bucket.deallocate(__deb_list, 1);
      }

      __deb_list = nullptr;
      throw;
    }

    // update properly the end of the chained list and the number of elements
    __end_list = old_ptr;
    __nb_elements = src.__nb_elements;
  }

__createBucket() [1/2]

template<typename Val, typename Alloc >

INLINE ListBucket< Val > * gum::List< Val, Alloc >::__createBucket ( const Val &  val ) const

private

Create a new bucket with a given value.

Parameters

val	The value of the new bucket.

Returns

Returns the bucket holding val.

Definition at line 1475 of file list_tpl.h.

                                                                {
    // create a new bucket (catch allocation and construction exceptions)
    ListBucket< Val >* new_elt = __alloc_bucket.allocate(1);

    try {
      __alloc_bucket.construct(new_elt, val);
    } catch (...) {
      __alloc_bucket.deallocate(new_elt, 1);
      throw;
    }

    return new_elt;
  }

__createBucket() [2/2]

template<typename Val, typename Alloc >

INLINE ListBucket< Val > * gum::List< Val, Alloc >::__createBucket ( Val &&  val ) const

private

Create a new bucket with a given value.

Parameters

val	The value of the new bucket.

Returns

Returns the bucket holding val.

Definition at line 1491 of file list_tpl.h.

                                                                              {
    // create a new bucket (catch allocation and construction exceptions)
    ListBucket< Val >* new_elt = __alloc_bucket.allocate(1);

    try {
      __alloc_bucket.construct(new_elt, std::move(val));
    } catch (...) {
      __alloc_bucket.deallocate(new_elt, 1);
      throw;
    }

    return new_elt;
  }

__createEmplaceBucket() [1/2]

template<typename Val, typename Alloc = std::allocator< Val >>

template<typename... Args>

ListBucket< Val >* gum::List< Val, Alloc >::__createEmplaceBucket ( Args &&...  args ) const

private

Create an emplace bucket.

Template Parameters

Args	The emplace arguments types.

Parameters

args	The emplace arguments.

Returns

Returns the bucket holding the new value.

__createEmplaceBucket() [2/2]

template<typename Val, typename Alloc = std::allocator< Val >>

template<typename... Args>

INLINE ListBucket< Val >* gum::List< Val, Alloc >::__createEmplaceBucket

(

Args &&...

args

)

const

Definition at line 1509 of file list_tpl.h.

                                                                       {
    // create a new bucket (catch allocation and construction exceptions)
    ListBucket< Val >* new_elt = __alloc_bucket.allocate(1);

    try {
      __alloc_bucket.construct(new_elt,
                               ListBucket< Val >::Emplace::EMPLACE,
                               std::forward< Args >(args)...);
    } catch (...) {
      __alloc_bucket.deallocate(new_elt, 1);
      throw;
    }

    return new_elt;
  }

__erase()

template<typename Val, typename Alloc >

INLINE void gum::List< Val, Alloc >::__erase ( ListBucket< Val > *  bucket )

private

Removes an element from a chained list.

If parameter bucket is equal to 0, then the method does not perform anything, else the bucket is deleted. In the latter case, no test is ever performed to check that the bucket does actually belong to the List. The method runs in constant time.

Parameters

bucket

A pointer on the bucket in the chained list we wish to remove.

Definition at line 1866 of file list_tpl.h.

                                                                   {
    // perform deletion only if there is a bucket to remove
    if (bucket != nullptr) {
      // update the iterators pointing on this element
      for (const auto ptr_iter : __safe_iterators) {
        if (ptr_iter->__bucket == bucket) {
          ptr_iter->__next_current_bucket = bucket->__prev;
          ptr_iter->__prev_current_bucket = bucket->__next;
          ptr_iter->__bucket = nullptr;
          ptr_iter->__null_pointing = true;
        } else {
          if (ptr_iter->__null_pointing) {
            if (ptr_iter->__next_current_bucket == bucket)
              ptr_iter->__next_current_bucket = bucket->__prev;

            if (ptr_iter->__prev_current_bucket == bucket)
              ptr_iter->__prev_current_bucket = bucket->__next;
          }
        }
      }

      // set properly the begin and end of the chained list (the other chainings
      // will be performed by operator delete)
      if (bucket->__prev == nullptr)
        __deb_list = bucket->__next;
      else
        bucket->__prev->__next = bucket->__next;

      if (bucket->__next == nullptr)
        __end_list = bucket->__prev;
      else
        bucket->__next->__prev = bucket->__prev;

      // remove the current element src the list
      __alloc_bucket.destroy(bucket);
      __alloc_bucket.deallocate(bucket, 1);

      --__nb_elements;
    }
  }

__getBucket()

template<typename Val, typename Alloc >

INLINE ListBucket< Val > * gum::List< Val, Alloc >::__getBucket ( const Val &  val ) const

privatenoexcept

Returns the bucket corresponding to a given value.

Actually, this is the first bucket of value val encountered in the list, if any, that is returned. If the element cannot be found, 0 is returned. This method enables fast removals of buckets. It runs in linear time.

Comparisons between Val instances are performed through == operators.

Parameters

val	The value of the element the bucket of which we wish to return.

Returns

Returns the bucket corresponding to a given value.

Definition at line 1930 of file list_tpl.h.

              {
    for (ListBucket< Val >* ptr = __deb_list; ptr != nullptr; ptr = ptr->__next)
      if (ptr->__val == val) return ptr;

    return nullptr;
  }

__getIthBucket()

template<typename Val , typename Alloc >

INLINE ListBucket< Val > * gum::List< Val, Alloc >::__getIthBucket ( Size  i ) const

privatenoexcept

Returns the bucket corresponding to the ith position in the list.

This method assumes that the list contains at least i+1 elements. The index of the first element of the list is 0.

Parameters

i	The position of the returned element.

Returns

Returns the gum::ListBucket of the ith element.

Definition at line 1631 of file list_tpl.h.

              {
    ListBucket< Val >* ptr;

    if (i < __nb_elements / 2) {
      for (ptr = __deb_list; i; --i, ptr = ptr->__next) {}
    } else {
      for (ptr = __end_list, i = __nb_elements - i - 1; i;
           --i, ptr = ptr->__prev) {}
    }

    return ptr;
  }

__insert() [1/2]

template<typename Val, typename Alloc >

INLINE Val & gum::List< Val, Alloc >::__insert ( const const_iterator_safe &  iter, ListBucket< Val > *  new_elt, location  place  )

private

Inserts a new bucket before or after the location pointed to by an iterator.

Parameters

iter	An iterator pointing where to insert a new element.
new_elt	The new element ot insert in the gum::List.
place	Where to insert the new element relatively to the iterator.

Returns

Returns a reference over the value stored in the gum::List.

Definition at line 1706 of file list_tpl.h.

                                                                             {
    // find the location around which the new element should be inserted
    ListBucket< Val >* ptr;

    if (iter.__null_pointing) {
      if (place == location::BEFORE) {
        ptr = iter.__next_current_bucket;
      } else {
        ptr = iter.__prev_current_bucket;
      }
    } else {
      ptr = iter.__getBucket();
    }

    if (ptr == nullptr) {
      // here, we are at the end of the list
      return __pushBack(new_elt);
    } else {
      switch (place) {
        case location::BEFORE: return __insertBefore(new_elt, ptr);

        case location::AFTER: return __insertAfter(new_elt, ptr);

        default:
          GUM_ERROR(FatalError, "List insertion for this location unimplemented");
      }
    }
  }

__insert() [2/2]

template<typename Val, typename Alloc >

INLINE Val & gum::List< Val, Alloc >::__insert ( const const_iterator &  iter, ListBucket< Val > *  new_elt, location  place  )

private

Inserts a new bucket before or after the location pointed to by an iterator.

Parameters

iter	An iterator pointing where to insert a new element.
new_elt	The new element ot insert in the gum::List.
place	Where to insert the new element relatively to the iterator.

Returns

Returns a reference over the value stored in the gum::List.

Definition at line 1740 of file list_tpl.h.

                                                                        {
    // find the location around which the new element should be inserted
    ListBucket< Val >* ptr = iter.__getBucket();

    if (ptr == nullptr) {
      // here, we are at the end of the list
      return __pushBack(new_elt);
    } else {
      switch (place) {
        case location::BEFORE: return __insertBefore(new_elt, ptr);

        case location::AFTER: return __insertAfter(new_elt, ptr);

        default:
          GUM_ERROR(FatalError, "List insertion for this location unimplemented");
      }
    }
  }

__insertAfter()

template<typename Val, typename Alloc >

INLINE Val & gum::List< Val, Alloc >::__insertAfter ( ListBucket< Val > *  new_elt, ListBucket< Val > *  current_elt  )

private

Insert a new bucket after another one.

Parameters

new_elt	The new element to insert in the gum::List.
current_elt	The element before which new_elt will be inserted.

Returns

Returns a reference over the value stored in the gum::List.

Definition at line 1667 of file list_tpl.h.

                                                                                {
    new_elt->__prev = current_elt;
    new_elt->__next = current_elt->__next;
    current_elt->__next = new_elt;

    if (new_elt->__next == nullptr)
      __end_list = new_elt;
    else
      new_elt->__next->__prev = new_elt;

    // update the number of elements
    ++__nb_elements;

    // returns the current value
    return new_elt->__val;
  }

__insertBefore()

template<typename Val, typename Alloc >

INLINE Val & gum::List< Val, Alloc >::__insertBefore ( ListBucket< Val > *  new_elt, ListBucket< Val > *  current_elt  )

private

Insert a new bucket before another one.

Parameters

new_elt	The new element to insert in the gum::List.
current_elt	The element before which new_elt will be inserted.

Returns

Returns a reference over the value stored in the gum::List.

Definition at line 1647 of file list_tpl.h.

                                                                                 {
    new_elt->__next = current_elt;
    new_elt->__prev = current_elt->__prev;
    current_elt->__prev = new_elt;

    if (new_elt->__prev == nullptr)
      __deb_list = new_elt;
    else
      new_elt->__prev->__next = new_elt;

    // update the number of elements
    ++__nb_elements;

    // returns the current value
    return new_elt->__val;
  }

__pushBack()

template<typename Val, typename Alloc >

INLINE Val & gum::List< Val, Alloc >::__pushBack ( ListBucket< Val > *  new_elt )

private

Insert a bucket at the end of the list.

Parameters

new_elt

The new element pushed at the end of the gum::List.

Returns

Returns a refefence over the value stored in the gum::List.

Definition at line 1546 of file list_tpl.h.

                                                                       {
    // place the bucket at the end of the list
    new_elt->__prev = __end_list;

    if (__end_list != nullptr)
      __end_list->__next = new_elt;
    else
      __deb_list = new_elt;

    __end_list = new_elt;

    // update the number of elements
    ++__nb_elements;

    // returns the current value
    return new_elt->__val;
  }

__pushFront()

template<typename Val, typename Alloc >

INLINE Val & gum::List< Val, Alloc >::__pushFront ( ListBucket< Val > *  new_elt )

private

Insert a bucket at the front of the list.

Parameters

new_elt

The new element pushed at the front of the gum::List.

Returns

Returns a refefence over the value stored in the gum::List.

Definition at line 1527 of file list_tpl.h.

                                                                        {
    new_elt->__next = __deb_list;

    if (__deb_list != nullptr)
      __deb_list->__prev = new_elt;
    else
      __end_list = new_elt;

    __deb_list = new_elt;

    // update the number of elements
    ++__nb_elements;

    // return the inserted element
    return new_elt->__val;
  }

back()

template<typename Val , typename Alloc >

INLINE Val & gum::List< Val, Alloc >::back

(

)

const

Returns a reference to last element of a list, if any.

Exceptions

NotFound

exception is thrown if the list is empty.

Definition at line 1841 of file list_tpl.h.

                                             {
    if (__nb_elements == Size(0)) {
      GUM_ERROR(NotFound, "not enough elements in the chained list");
    }

    return __end_list->__val;
  }

begin() [1/2]

template<typename Val , typename Alloc >

INLINE ListIterator< Val > gum::List< Val, Alloc >::begin

(

)

Returns an unsafe iterator pointing to the beginning of the List.

Unsafe iterators are a little bit faster than safe iterators and they consume less memory. However, if the element they point to is erased, their dereference or their increment/decrement will produce a mess, probably a segfault. You should use them only when performance is an issue and if you are sure that they will never point to an element erased.

Returns

Returns an unsafe iterator pointing to the beginning of the List.

Definition at line 1417 of file list_tpl.h.

                                                       {
    return ListIterator< Val >{*this};
  }

begin() [2/2]

template<typename Val , typename Alloc >

INLINE ListConstIterator< Val > gum::List< Val, Alloc >::begin

(

)

const

Returns an unsafe const iterator pointing to the beginning of the List.

Unsafe const iterators are a little bit faster than safe const iterators and they consume less memory. However, if the element they point to is erased, their dereference or their increment/decrement will produce a mess, probably a segfault. You should use them only when performance is an issue and if you are sure that they will never point to an element erased.

Returns an unsafe const iterator pointing to the beginning of the List.

Definition at line 1423 of file list_tpl.h.

                                                                  {
    return ListConstIterator< Val >{*this};
  }

beginSafe()

template<typename Val , typename Alloc >

INLINE ListIteratorSafe< Val > gum::List< Val, Alloc >::beginSafe

(

)

Returns a safe iterator pointing to the beginning of the List.

Safe iterators are iterators whose state is updated by the list when the element they point to is erased. As such, in this case, they can throw an exception when we try to derefence them and they are able to perform a valid ++ or – step.

Returns

Returns a safe iterator pointing to the beginning of the List.

Definition at line 1405 of file list_tpl.h.

                                                               {
    return ListIteratorSafe< Val >{*this};
  }

cbegin()

template<typename Val , typename Alloc >

INLINE ListConstIterator< Val > gum::List< Val, Alloc >::cbegin

(

)

const

Returns an unsafe const iterator pointing to the beginning of the List.

Unsafe const iterators are a little bit faster than safe const iterators and they consume less memory. However, if the element they point to is erased, their dereference or their increment/decrement will produce a mess, probably a segfault. You should use them only when performance is an issue and if you are sure that they will never point to an element erased.

Returns

Returns an unsafe const iterator pointing to the beginning of the List.

Definition at line 1411 of file list_tpl.h.

                                                                   {
    return ListConstIterator< Val >{*this};
  }

cbeginSafe()

template<typename Val , typename Alloc >

INLINE ListConstIteratorSafe< Val > gum::List< Val, Alloc >::cbeginSafe

(

)

const

Returns a safe const iterator pointing to the beginning of the List.

Safe const iterators are const iterators whose state is updated by the list when the element they point to is erased. As such, in this case, they can throw an exception when we try to derefence them and they are able to perform a valid ++ or – step.

Returns

Returns a safe const iterator pointing to the beginning of the List.

Definition at line 1399 of file list_tpl.h.

                                                                           {
    return ListConstIteratorSafe< Val >{*this};
  }

cend()

template<typename Val , typename Alloc >

INLINE const ListConstIterator< Val > & gum::List< Val, Alloc >::cend ( ) const

noexcept

Returns an unsafe const iterator pointing to the end of the List.

Unsafe const iterators are a little bit faster than safe const iterators and they consume less memory. However, if the element they point to is erased, their dereference or their increment/decrement will produce a mess, probably a segfault. You should use them only when performance is an issue and if you are sure that they will never point to an element erased.

Returns an unsafe const iterator pointing to the end of the List.

Definition at line 1346 of file list_tpl.h.

              {
    return *(reinterpret_cast< const ListConstIterator< Val >* >(__list_end));
  }

cendSafe()

template<typename Val , typename Alloc >

INLINE const ListConstIteratorSafe< Val > & gum::List< Val, Alloc >::cendSafe ( ) const

noexcept

Returns a safe const iterator pointing to the end of the List.

Safe const iterators are const iterators whose state is updated by the list when the element they point to is erased. As such, in this case, they can throw an exception when we try to derefence them and they are able to perform a valid ++ or – step

Returns a safe const iterator pointing to the end of the List.

Definition at line 1332 of file list_tpl.h.

              {
    return *(
       reinterpret_cast< const ListConstIteratorSafe< Val >* >(__list_end_safe));
  }

clear()

template<typename Val , typename Alloc >

void gum::List< Val, Alloc >::clear

(

)

Deletes all the elements of a chained list.

All the iterators of the list will be resetted to rend. The method runs in linear time of both the size of the list and the number of iterators attached to the List.

Definition at line 1164 of file list_tpl.h.

                                 {
    // first we update all the safe iterators of the list : they should now
    // point to end/rend
    for (const auto ptr_iter : __safe_iterators) {
      ptr_iter->clear();
    }

    // clear all the values
    for (ListBucket< Val >*ptr = __deb_list, *next_ptr = nullptr; ptr != nullptr;
         ptr = next_ptr) {
      next_ptr = ptr->__next;
      __alloc_bucket.destroy(ptr);
      __alloc_bucket.deallocate(ptr, 1);
    }

    __nb_elements = 0;
    __deb_list = nullptr;
    __end_list = nullptr;
  }

crbegin()

template<typename Val , typename Alloc >

INLINE ListConstIterator< Val > gum::List< Val, Alloc >::crbegin

(

)

const

Returns an unsafe const iterator pointing to the last element of the List.

Unsafe iterators are a little bit faster than safe iterators and they consume less memory. However, if the element they point to is erased, their dereference or their increment/decrement will produce a mess, probably a segfault. You should use them only when performance is an issue and if you are sure that they will never point to an element erased.

Returns

Returns an unsafe const iterator pointing to the last element of the List.

Definition at line 1447 of file list_tpl.h.

                                                                    {
    if (__nb_elements)
      return ListConstIterator< Val >{*this, __nb_elements - 1};
    else
      return ListConstIterator< Val >{};
  }

crbeginSafe()

template<typename Val , typename Alloc >

INLINE ListConstIteratorSafe< Val > gum::List< Val, Alloc >::crbeginSafe

(

)

const

Returns a safe const iterator pointing to the last element of the List.

Safe const iterators are const iterators whose state is updated by the list when the element they point to is erased. As such, in this case, they can throw an exception when we try to derefence them and they are able to perform a valid ++ or – step.

Returns

Returns a safe const iterator pointing to the last element of the List.

Definition at line 1429 of file list_tpl.h.

                                                                            {
    if (__nb_elements)
      return ListConstIteratorSafe< Val >{*this, __nb_elements - 1};
    else
      return ListConstIteratorSafe< Val >{};
  }

crend()

template<typename Val , typename Alloc >

INLINE const ListConstIterator< Val > & gum::List< Val, Alloc >::crend ( ) const

noexcept

Returns an unsafe const iterator pointing just before the beginning of the List.

Unsafe const iterators are a little bit faster than safe const iterators and they consume less memory. However, if the element they point to is erased, their dereference or their increment/decrement will produce a mess, probably a segfault. You should use them only when performance is an issue and if you are sure that they will never point to an element erased.

Returns

Returns an unsafe const iterator pointing just before the beginning of the List

Definition at line 1379 of file list_tpl.h.

              {
    return *(reinterpret_cast< const ListConstIterator< Val >* >(__list_end));
  }

crendSafe()

template<typename Val , typename Alloc >

INLINE const ListConstIteratorSafe< Val > & gum::List< Val, Alloc >::crendSafe ( ) const

noexcept

Return a safe const iterator pointing just before the beginning of the List.

Safe const iterators are const iterators whose state is updated by the list when the element they point to is erased. As such, in this case, they can throw an exception when we try to derefence them and they are able to perform a valid ++ or – step.

Return a safe const iterator pointing just before the beginning of the List.

Definition at line 1365 of file list_tpl.h.

              {
    return *(
       reinterpret_cast< const ListConstIteratorSafe< Val >* >(__list_end_safe));
  }

emplace() [1/4]

template<typename Val, typename Alloc = std::allocator< Val >>

template<typename... Args>

Val& gum::List< Val, Alloc >::emplace	(	const const_iterator &	iter,
		Args &&...	args
	)

Emplace a new element before a given iterator.

Emplace is a method that allows to construct directly an element of type Val by passing to its constructor all the arguments it needs. The first element of the list is at pos 0. After the insert, the element is placed precisely at pos if pos is less than the size of the list before insertion, else it is inserted at the end of the list.

Parameters

iter	The position in the list
args	The arguments passed to the constructor

Returns

Returns a reference on the copy inserted into the list.

emplace() [2/4]

template<typename Val, typename Alloc = std::allocator< Val >>

template<typename... Args>

Val& gum::List< Val, Alloc >::emplace	(	const const_iterator_safe &	iter,
		Args &&...	args
	)

Emplace a new element before a given safe iterator.

Emplace is a method that allows to construct directly an element of type Val by passing to its constructor all the arguments it needs. The first element of the list is at pos 0. After the insert, the element is placed precisely at pos if pos is less than the size of the list before insertion, else it is inserted at the end of the list.

Parameters

iter	The position in the list.
args	the arguments passed to the constructor.

Returns

Returns a reference on the copy inserted into the list.

emplace() [3/4]

template<typename Val, typename Alloc = std::allocator< Val >>

template<typename... Args>

INLINE Val& gum::List< Val, Alloc >::emplace	(	const const_iterator &	iter,
		Args &&...	args
	)

Definition at line 1812 of file list_tpl.h.

                                                          {
    return __insert(iter,
                    __createEmplaceBucket(std::forward< Args >(args)...),
                    location::BEFORE);
  }

emplace() [4/4]

template<typename Val, typename Alloc = std::allocator< Val >>

template<typename... Args>

INLINE Val& gum::List< Val, Alloc >::emplace	(	const const_iterator_safe &	iter,
		Args &&...	args
	)

Definition at line 1822 of file list_tpl.h.

                                                          {
    return __insert(iter,
                    __createEmplaceBucket(std::forward< Args >(args)...),
                    location::BEFORE);
  }

emplaceBack() [1/2]

template<typename Val, typename Alloc = std::allocator< Val >>

template<typename... Args>

Val& gum::List< Val, Alloc >::emplaceBack

(

Args &&...

args

)

Emplace elements at the end of the chained list.

Emplace is a method that allows to construct directly an element of type Val by passing to its constructor all the arguments it needs

Template Parameters

Args	The emplaced arguments types.

Parameters

args	The arguments passed to the constructor

Returns

A reference on the copy inserted into the list.

emplaceBack() [2/2]

template<typename Val, typename Alloc = std::allocator< Val >>

template<typename... Args>

INLINE Val& gum::List< Val, Alloc >::emplaceBack

(

Args &&...

args

)

Definition at line 1612 of file list_tpl.h.

                                                            {
    return __pushBack(__createEmplaceBucket(std::forward< Args >(args)...));
  }

emplaceFront() [1/2]

template<typename Val, typename Alloc = std::allocator< Val >>

template<typename... Args>

Val& gum::List< Val, Alloc >::emplaceFront

(

Args &&...

args

)

Emplace elements at the beginning of the chained list.

Emplace is a method that allows to construct directly an element of type Val by passing to its constructor all the arguments it needs

Parameters

args	The arguments passed to the constructor.

Returns

Returns a reference on the copy inserted into the list.

emplaceFront() [2/2]

template<typename Val, typename Alloc = std::allocator< Val >>

template<typename... Args>

INLINE Val& gum::List< Val, Alloc >::emplaceFront

(

Args &&...

args

)

Definition at line 1586 of file list_tpl.h.

                                                             {
    return __pushFront(__createEmplaceBucket(std::forward< Args >(args)...));
  }

empty()

template<typename Val , typename Alloc >

INLINE bool gum::List< Val, Alloc >::empty ( ) const

noexcept

Returns a boolean indicating whether the chained list is empty.

Returns

Returns a boolean indicating whether the chained list is empty.

Definition at line 1970 of file list_tpl.h.

Referenced by gum::prm::SVED< GUM_SCALAR >::__eliminateNodes(), gum::prm::SVE< GUM_SCALAR >::__eliminateNodes(), gum::prm::SVED< GUM_SCALAR >::__eliminateNodesDownward(), gum::learning::Miic::__existsDirectedPath(), gum::InfluenceDiagram< GUM_SCALAR >::_getChildrenDecision(), gum::BarrenNodesFinder::barrenNodes(), gum::ArcGraphPart::directedPath(), gum::ArcGraphPart::directedUnorientedPath(), gum::InfluenceDiagram< GUM_SCALAR >::existsPathBetween(), gum::DiGraph::hasDirectedPath(), gum::UndiGraph::hasUndirectedCycle(), gum::MixedGraph::mixedOrientedPath(), gum::MixedGraph::mixedUnorientedPath(), gum::BayesBall::relevantPotentials(), gum::dSeparation::relevantPotentials(), gum::BayesBall::requisiteNodes(), gum::dSeparation::requisiteNodes(), gum::DAGCycleDetector::setDAG(), and gum::EdgeGraphPart::undirectedPath().

                                                       {
    return (__nb_elements == Size(0));
  }

Here is the caller graph for this function:

end() [1/2]

template<typename Val , typename Alloc >

INLINE const ListIterator< Val > & gum::List< Val, Alloc >::end ( )

noexcept

Returns an unsafe iterator pointing to the end of the List.

Unsafe iterators are a little bit faster than safe iterators and they consume less memory. However, if the element they point to is erased, their dereference or their increment/decrement will produce a mess, probably a segfault. You should use them only when performance is an issue and if you are sure that they will never point to an element erased.

Returns

Returns an unsafe iterator pointing to the end of the List.

Definition at line 1353 of file list_tpl.h.

                                                                     {
    return *(reinterpret_cast< const ListIterator< Val >* >(__list_end));
  }

end() [2/2]

template<typename Val , typename Alloc >

INLINE const ListConstIterator< Val > & gum::List< Val, Alloc >::end ( ) const

noexcept

Returns an unsafe const iterator pointing to the end of the List.

Unsafe const iterators are a little bit faster than safe const iterators and they consume less memory. However, if the element they point to is erased, their dereference or their increment/decrement will produce a mess, probably a segfault. You should use them only when performance is an issue and if you are sure that they will never point to an element erased.

Returns

Returns an unsafe const iterator pointing to the end of the List.

Definition at line 1359 of file list_tpl.h.

                                                                                {
    return *(reinterpret_cast< const ListConstIterator< Val >* >(__list_end));
  }

endSafe()

template<typename Val , typename Alloc >

INLINE const ListIteratorSafe< Val > & gum::List< Val, Alloc >::endSafe ( )

noexcept

Returns a safe iterator pointing to the end of the List.

Safe iterators are iterators whose state is updated by the list when the element they point to is erased. As such, in this case, they can throw an exception when we try to derefence them and they are able to perform a valid ++ or – step.

Ceturns a safe iterator pointing to the end of the List.

Definition at line 1340 of file list_tpl.h.

                                                                             {
    return *(reinterpret_cast< const ListIteratorSafe< Val >* >(__list_end_safe));
  }

erase() [1/3]

template<typename Val , typename Alloc >

INLINE void gum::List< Val, Alloc >::erase

(

Size

i

)

Erases the ith element of the List (the first one is in position 0).

If the element cannot be found, the function returns without throwing any exception. It runs in linear time in the size of the list.

Parameters

i	The position in the list of the element we wish to remove.

Definition at line 1909 of file list_tpl.h.

Referenced by gum::prm::StructuredInference< GUM_SCALAR >::__reduceAloneInstances().

                                              {
    if (i >= __nb_elements) return;

    // erase the ith bucket
    __erase(__getIthBucket(i));
  }

Here is the caller graph for this function:

erase() [2/3]

template<typename Val , typename Alloc >

INLINE void gum::List< Val, Alloc >::erase

(

const iterator_safe &

iter

)

Erases the element of the List pointed to by the safe iterator.

If the element cannot be found, i.e., it has already been erased or the iterator points to end/rend, the function returns without throwing any exception. It runs in linear time in the size of the list.

Parameters

iter	An iterator pointing to the element to remove.

Definition at line 1918 of file list_tpl.h.

                                                                 {
    __erase(iter.__getBucket());
  }

erase() [3/3]

template<typename Val , typename Alloc >

INLINE void gum::List< Val, Alloc >::erase

(

const const_iterator_safe &

iter

)

Erases the element of the List pointed to by the safe const iterator.

If the element cannot be found, i.e., it has already been erased or the iterator points to end/rend, the function returns without throwing any exception. It runs in linear time in the size of the list.

Parameters

iter	An iterator pointing to the element to remove.

Definition at line 1924 of file list_tpl.h.

                                                                       {
    __erase(iter.__getBucket());
  }

eraseAllVal()

template<typename Val, typename Alloc >

INLINE void gum::List< Val, Alloc >::eraseAllVal

(

const Val &

val

)

erases all the elements encountered with a given value

If no element equal to val can be found, the function returns without throwing any exception.

Comparisons between Val instances are performed through == operators.

Parameters

val	the value of the element we wish to remove.

Definition at line 1946 of file list_tpl.h.

                                                            {
    for (ListBucket< Val >*iter = __deb_list, *next_bucket = nullptr;
         iter != nullptr;
         iter = next_bucket) {
      next_bucket = iter->__next;

      if (val == iter->__val) __erase(iter);
    }
  }

eraseByVal()

template<typename Val, typename Alloc >

INLINE void gum::List< Val, Alloc >::eraseByVal

(

const Val &

val

)

erases the first element encountered with a given value.

If no element equal to val can be found, the function returns without throwing any exception. It runs in linear time both in the size of the list and in the number of iterators referenced in the list. Comparisons between Val instances are performed through == operators.

Parameters

val	The value of the element we wish to remove.

Definition at line 1940 of file list_tpl.h.

                                                           {
    __erase(__getBucket(val));
  }

exists()

template<typename Val, typename Alloc >

INLINE bool gum::List< Val, Alloc >::exists

(

const Val &

val

)

const

Checks whether there exists a given element in the list.

This method runs in linear time.

Comparisons between Val instances are performed through == operators.

Parameters

val	the value of the element we wish to check the existence of.

Returns

Returns true if val is in the gum::List.

Definition at line 1857 of file list_tpl.h.

Referenced by gum::EssentialGraph::toDot(), gum::UndiGraph::toDot(), and gum::MixedGraph::toDot().

                                                             {
    for (ListBucket< Val >* ptr = __deb_list; ptr != nullptr; ptr = ptr->__next)
      if (ptr->__val == val) return true;

    return false;
  }

Here is the caller graph for this function:

front()

template<typename Val , typename Alloc >

INLINE Val & gum::List< Val, Alloc >::front

(

)

const

Returns a reference to first element of a list, if any.

Exceptions

NotFound

exception is thrown if the list is empty.

Definition at line 1831 of file list_tpl.h.

Referenced by gum::prm::SVED< GUM_SCALAR >::__eliminateNodes(), gum::prm::SVE< GUM_SCALAR >::__eliminateNodes(), gum::prm::SVED< GUM_SCALAR >::__eliminateNodesDownward(), gum::learning::Miic::__existsDirectedPath(), gum::InfluenceDiagram< GUM_SCALAR >::_getChildrenDecision(), gum::BarrenNodesFinder::barrenNodes(), gum::ArcGraphPart::directedPath(), gum::ArcGraphPart::directedUnorientedPath(), gum::InfluenceDiagram< GUM_SCALAR >::existsPathBetween(), gum::DiGraph::hasDirectedPath(), gum::UndiGraph::hasUndirectedCycle(), gum::MixedGraph::mixedOrientedPath(), gum::MixedGraph::mixedUnorientedPath(), gum::BayesBall::relevantPotentials(), gum::dSeparation::relevantPotentials(), gum::BayesBall::requisiteNodes(), gum::dSeparation::requisiteNodes(), gum::DAGCycleDetector::setDAG(), and gum::EdgeGraphPart::undirectedPath().

                                              {
    if (__nb_elements == Size(0)) {
      GUM_ERROR(NotFound, "not enough elements in the chained list");
    }

    return __deb_list->__val;
  }

Here is the caller graph for this function:

insert() [1/8]

template<typename Val, typename Alloc >

INLINE Val & gum::List< Val, Alloc >::insert

(

const Val &

val

)

Inserts a new element at the end of the chained list (alias of pushBack).

Parameters

val	The value inserted.

Returns

a reference on the copy inserted into the list.

Warning

Note that val is not actually inserted into the list. Rather, it is a copy of val that is inserted.

Definition at line 1619 of file list_tpl.h.

Referenced by gum::prm::SVED< GUM_SCALAR >::__eliminateNodes(), gum::prm::SVE< GUM_SCALAR >::__eliminateNodes(), gum::prm::SVED< GUM_SCALAR >::__eliminateNodesUpward(), gum::prm::SVE< GUM_SCALAR >::__eliminateNodesUpward(), gum::prm::gspan::StrictSearch< GUM_SCALAR >::__elimination_cost(), gum::credal::CNMonteCarloSampling< GUM_SCALAR, BNInferenceEngine >::__insertEvidence(), gum::prm::StructuredInference< GUM_SCALAR >::__reduceAloneInstances(), gum::BarrenNodesFinder::barrenNodes(), gum::UndiGraph::hasUndirectedCycle(), gum::BayesBall::relevantPotentials(), gum::dSeparation::relevantPotentials(), gum::BayesBall::requisiteNodes(), gum::dSeparation::requisiteNodes(), gum::DAGCycleDetector::setDAG(), gum::EssentialGraph::toDot(), gum::UndiGraph::toDot(), and gum::MixedGraph::toDot().

                                                       {
    return pushBack(val);
  }

Here is the caller graph for this function:

insert() [2/8]

template<typename Val, typename Alloc >

INLINE Val & gum::List< Val, Alloc >::insert

(

Val &&

val

)

Inserts a new element at the end of the chained list (alias of pushBack).

Parameters

val	The value inserted.

Returns

a reference on the copy inserted into the list.

Warning

Note that val is not actually inserted into the list. Rather, it is a copy of val that is inserted.

Definition at line 1625 of file list_tpl.h.

                                                  {
    return pushBack(std::move(val));
  }

insert() [3/8]

template<typename Val, typename Alloc >

INLINE Val & gum::List< Val, Alloc >::insert	(	Size	pos,
		const Val &	val
	)

Inserts a new element at the ith pos of the chained list.

The first element of the list is at pos 0. After the insert, the element is placed precisely at pos if pos is less than the size of the list before insertion, else it is inserted at the end of the list.

Parameters

pos	The position where to inser the new element.
val	The value to insert.

Returns

a reference on the copy inserted into the list.

Warning

Note that val is not actually inserted into the list. Rather, it is a copy of val that is inserted.

Definition at line 1687 of file list_tpl.h.

                                                                 {
    // if ther are fewer elements than pos, put the value at the end of the list
    if (__nb_elements <= pos) { return pushBack(val); }

    return __insertBefore(__createBucket(val), __getIthBucket(pos));
  }

insert() [4/8]

template<typename Val, typename Alloc >

INLINE Val & gum::List< Val, Alloc >::insert	(	Size	pos,
		Val &&	val
	)

Insert an rvalue at the ith pos of the chained list.

The first element of the list is at pos 0. After the insert, the element is placed precisely at pos if pos is less than the size of the list before insertion, else it is inserted at the end of the list.

Parameters

pos	The position where to inser the new element.
val	The value to insert.

Returns

Returns a reference on the copy inserted into the list.

Definition at line 1696 of file list_tpl.h.

                                                            {
    // if ther are fewer elements than pos, put the value at the end of the list
    if (__nb_elements <= pos) { return pushBack(std::move(val)); }

    return __insertBefore(__createBucket(std::move(val)), __getIthBucket(pos));
  }

insert() [5/8]

template<typename Val, typename Alloc >

INLINE Val & gum::List< Val, Alloc >::insert	(	const const_iterator_safe &	iter,
		const Val &	val,
		location	place = location::BEFORE
	)

Inserts a new element before or after a given iterator.

Parameters

iter	The iterator pointing where to inser the new element.
val	The value to insert.
place	Defines where to insert the new element relatively to iter.

Returns

Returns a reference on the copy inserted into the list.

Warning

Note that val is not actually inserted into the list. Rather, it is a copy of val that is inserted.

Definition at line 1764 of file list_tpl.h.

                                                                           {
    // if the iterator does not point to the list, raise an exception
    if (iter.__list != this) {
      GUM_ERROR(InvalidArgument,
                "the iterator does not point to the correct list");
    }

    return __insert(iter, __createBucket(val), place);
  }

insert() [6/8]

template<typename Val, typename Alloc >

INLINE Val & gum::List< Val, Alloc >::insert	(	const const_iterator_safe &	iter,
		Val &&	val,
		location	place = location::BEFORE
	)

Inserts an rvalue before or after a given iterator.

Parameters

iter	The iterator pointing where to inser the new element.
val	The value to insert.
place	Defines where to insert the new element relatively to iter.

Returns

Returns a reference on the copy inserted into the list.

Warning

Note that val is not actually inserted into the list. Rather, it is a copy of val that is inserted.

Definition at line 1779 of file list_tpl.h.

                                                                           {
    // if the iterator does not point to the list, raise an exception
    if (iter.__list != this) {
      GUM_ERROR(InvalidArgument,
                "the iterator does not point to the correct list");
    }

    return __insert(iter, __createBucket(std::move(val)), place);
  }

insert() [7/8]

template<typename Val, typename Alloc >

INLINE Val & gum::List< Val, Alloc >::insert	(	const const_iterator &	iter,
		const Val &	val,
		location	place = location::BEFORE
	)

Inserts a new element before or after a given iterator.

Parameters

iter	The iterator pointing where to inser the new element.
val	The value to insert.
place	Defines where to insert the new element relatively to iter.

Returns

Returns a reference on the copy inserted into the list.

Warning

Note that val is not actually inserted into the list. Rather, it is a copy of val that is inserted.

Definition at line 1794 of file list_tpl.h.

                                                                      {
    return __insert(iter, __createBucket(val), place);
  }

insert() [8/8]

template<typename Val, typename Alloc >

INLINE Val & gum::List< Val, Alloc >::insert	(	const const_iterator &	iter,
		Val &&	val,
		location	place = location::BEFORE
	)

Inserts an rvalue before or after a given iterator.

Parameters

iter	The iterator pointing where to inser the new element.
val	The value to insert.
place	Defines where to insert the new element relatively to iter.

Returns

Returns a reference on the copy inserted into the list.

Warning

Note that val is not actually inserted into the list. Rather, it is a copy of val that is inserted.

Definition at line 1803 of file list_tpl.h.

                                                                      {
    return __insert(iter, __createBucket(std::move(val)), place);
  }

map() [1/4]

template<typename Val, typename Alloc >

template<typename Mount , typename OtherAlloc >

List< Mount, OtherAlloc > gum::List< Val, Alloc >::map

(

Mount(*)(Val)

f

)

const

Creates a list of mountains from a list of val.

Parameters

f	A function that maps any Val element into a Mount

Returns

Returns a lsit of mountains.

Template Parameters

Mount	The type of mountains.
OtherAlloc	The mountains type allocator.

Definition at line 1996 of file list_tpl.h.

                                                                         {
    // create a new empty list
    List< Mount, OtherAlloc > list;

    // fill the new list
    for (const_iterator iter = begin(); iter != end(); ++iter) {
      list.pushBack(f(*iter));
    }

    return list;
  }

map() [2/4]

template<typename Val, typename Alloc >

template<typename Mount , typename OtherAlloc >

List< Mount, OtherAlloc > gum::List< Val, Alloc >::map

(

Mount(*)(Val &)

f

)

const

Creates a list of mountains from a list of val.

Parameters

f	A function that maps any Val element into a Mount

Returns

Returns a lsit of mountains.

Template Parameters

Mount	The type of mountains.
OtherAlloc	The mountains type allocator.

Definition at line 2011 of file list_tpl.h.

                                                                          {
    // create a new empty list
    List< Mount, OtherAlloc > list;

    // fill the new list
    for (const_iterator iter = begin(); iter != end(); ++iter) {
      list.pushBack(f(*iter));
    }

    return list;
  }

map() [3/4]

template<typename Val, typename Alloc >

template<typename Mount , typename OtherAlloc >

List< Mount, OtherAlloc > gum::List< Val, Alloc >::map

(

Mount(*)(const Val &)

f

)

const

Creates a list of mountains from a list of val.

Parameters

f	A function that maps any Val element into a Mount

Returns

Returns a lsit of mountains.

Template Parameters

Mount	The type of mountains.
OtherAlloc	The mountains type allocator.

Definition at line 2026 of file list_tpl.h.

                                                                                {
    // create a new empty list
    List< Mount, OtherAlloc > list;

    // fill the new list
    for (const_iterator iter = begin(); iter != end(); ++iter) {
      list.pushBack(f(*iter));
    }

    return list;
  }

map() [4/4]

template<typename Val, typename Alloc >

template<typename Mount , typename OtherAlloc >

List< Mount, OtherAlloc > gum::List< Val, Alloc >::map

(

const Mount &

mount

)

const

Creates a list of mountains with a given value from a list of val.

Parameters

mount

the value taken by all the elements of the resulting list

Returns

Returns a lsit of mountains.

Template Parameters

Mount	The type of mountains.
OtherAlloc	The mountains type allocator.

Definition at line 2041 of file list_tpl.h.

                                                                            {
    // create a new empty list
    List< Mount, OtherAlloc > list;

    // fill the new list
    for (Size i = Size(0); i < __nb_elements; ++i)
      list.pushBack(mount);

    return list;
  }

operator!=() [1/2]

template<typename Val, typename Alloc = std::allocator< Val >>

template<typename OtherAlloc >

bool gum::List< Val, Alloc >::operator!=

(

const List< Val, OtherAlloc > &

src

)

const

Checks whether two lists are different (different elements or orders).

This method runs in time linear in the number of elements of the list.

Returns

Returns true if src and this gum::List are identical.

Template Parameters

OtherAlloc

The other allocator.

operator!=() [2/2]

template<typename Val, typename Alloc = std::allocator< Val >>

template<typename OtherAlloc >

INLINE bool gum::List< Val, Alloc >::operator!=

(

const List< Val, OtherAlloc > &

src

)

const

Definition at line 2087 of file list_tpl.h.

                                                                   {
    return !operator==(src);
  }

operator+=() [1/2]

template<typename Val, typename Alloc >

INLINE Val & gum::List< Val, Alloc >::operator+=

(

const Val &

val

)

Inserts a new element at the end of the list (alias of pushBack).

This enables writing code like list += xxx; to add element xxx to the list.

Warning

Note that val is not actually inserted into the list. Rather, it is a copy of val that is inserted.

Parameters

val	Tha value inserted int the list.

Returns

Returns a reference on the copy inserted into the list.

Definition at line 2055 of file list_tpl.h.

                                                           {
    return pushBack(val);
  }

operator+=() [2/2]

template<typename Val, typename Alloc >

INLINE Val & gum::List< Val, Alloc >::operator+=

(

Val &&

val

)

Inserts a new element at the end of the list (alias of pushBack).

This enables writing code like list += xxx; to add element xxx to the list.

Warning

Note that val is not actually inserted into the list. Rather, it is a copy of val that is inserted.

Parameters

val	Tha value inserted int the list.

Returns

Returns a reference on the copy inserted into the list.

Definition at line 2062 of file list_tpl.h.

                                                      {
    return pushBack(std::move(val));
  }

operator=() [1/4]

template<typename Val, typename Alloc>

INLINE List< Val, Alloc > & gum::List< Val, Alloc >::operator=

(

const List< Val, Alloc > &

src

)

Copy operator.

The new list and that which is copied do not share the elements: the new list contains new instances of the values stored in the list to be copied. Of course if these values are pointers, the new values point toward the same elements. The List on which the operator is applied keeps its iterator's list. Of course, if it previously contained some elements, those are removed prior to the copy. This operator runs in linear time.

Warning

If the current List previously contained iterators, those will be resetted to end()/rend().

Parameters

src	the list the content of which will be copied into the current List.

Returns

Returns this gum::List.

Definition at line 1266 of file list_tpl.h.

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

      // remove the old content of 'this' and update accordingly the iterators
      clear();

      // perform the copy
      __copy_elements(src);
    }

    return *this;
  }

operator=() [2/4]

template<typename Val, typename Alloc = std::allocator< Val >>

template<typename OtherAlloc >

List< Val, Alloc >& gum::List< Val, Alloc >::operator=

(

const List< Val, OtherAlloc > &

src

)

Generalized copy operator.

The new list and that which is copied do not share the elements: the new list contains new instances of the values stored in the list to be copied. Of course if these values are pointers, the new values point toward the same elements. The List on which the operator is applied keeps its iterator's list. Of course, if it previously contained some elements, those are removed prior to the copy. This operator runs in linear time.

Warning

If the current List previously contained iterators, those will be resetted to end()/rend().

Parameters

src	the list the content of which will be copied into the current List.

Returns

Returns this gum::List.

operator=() [3/4]

template<typename Val, typename Alloc>

INLINE List< Val, Alloc > & gum::List< Val, Alloc >::operator=

(

List< Val, Alloc > &&

src

)

Move operator.

Parameters

src	The gum::List to move.

Returns

Returns this gum::List.

Definition at line 1305 of file list_tpl.h.

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

      // remove the old content of 'this' and update accordingly the iterators
      clear();

      // perform the move
      __deb_list = std::move(src.__deb_list);
      __end_list = std::move(src.__end_list);
      __nb_elements = std::move(src.__nb_elements);
      __safe_iterators = std::move(src.__safe_iterators);
      __alloc_bucket = std::move(src.__alloc_bucket);

      src.__deb_list = nullptr;
      src.__end_list = nullptr;
      src.__nb_elements = 0;
      src.__safe_iterators.clear();
    }

    return *this;
  }

operator=() [4/4]

template<typename Val, typename Alloc = std::allocator< Val >>

template<typename OtherAlloc >

INLINE List< Val, Alloc >& gum::List< Val, Alloc >::operator=

(

const List< Val, OtherAlloc > &

src

)

Definition at line 1286 of file list_tpl.h.

                                                                           {
    // avoid self assignment
    if (this != reinterpret_cast< List< Val, Alloc >* >(&src)) {
      // for debugging purposes
      GUM_OP_CPY(List);

      // remove the old content of 'this' and update accordingly the iterators
      clear();

      // perform the copy
      __copy_elements(src);
    }

    return *this;
  }

operator==() [1/2]

template<typename Val, typename Alloc = std::allocator< Val >>

template<typename OtherAlloc >

bool gum::List< Val, Alloc >::operator==

(

const List< Val, OtherAlloc > &

src

)

const

Checks whether two lists are identical (same elements in the same order).

This method runs in time linear in the number of elements of the list.

Returns

Returns true if src and this gum::List are identical.

Template Parameters

OtherAlloc

The other allocator.

operator==() [2/2]

template<typename Val, typename Alloc = std::allocator< Val >>

template<typename OtherAlloc >

INLINE bool gum::List< Val, Alloc >::operator==

(

const List< Val, OtherAlloc > &

src

)

const

Definition at line 2070 of file list_tpl.h.

                                                                   {
    // check if the two lists have at least the same number of elements
    if (__nb_elements != src.__nb_elements) return false;

    // parse the two lists
    for (ListBucket< Val >*iter1 = __deb_list, *iter2 = src.__deb_list;
         iter1 != nullptr;
         iter1 = iter1->__next, iter2 = iter2->__next)
      if (*iter1 != *iter2) return false;

    return true;
  }

operator[]() [1/2]

template<typename Val , typename Alloc >

INLINE Val & gum::List< Val, Alloc >::operator[]

(

const Size

i

)

Returns the ith element in the current chained list.

The first of the list element has index 0.

This method runs in linear time.

Parameters

i	The position of the element in the list (0 = first element).

Exceptions

NotFound

Raised if the element to be retrieved does not exist.

Returns

Returns a reference on the element stored at the ith position in the list.

Definition at line 2093 of file list_tpl.h.

                                                         {
    // check if we can return the element we ask for
    if (i >= __nb_elements) {
      GUM_ERROR(NotFound, "not enough elements in the chained list");
    }

    return **__getIthBucket(i);
  }

operator[]() [2/2]

template<typename Val , typename Alloc >

INLINE const Val & gum::List< Val, Alloc >::operator[]

(

const Size

i

)

const

Returns the const ith element in the current chained list.

The first of the list element has index 0.

This method runs in linear time.

Parameters

i	the position of the element in the list (0 = first element).

Exceptions

NotFound

Raised if the element to be retrieved does not exist.

Returns

Returns a reference on the element stored at the ith position in the list.

Definition at line 2104 of file list_tpl.h.

                                                                     {
    // check if we can return the element we ask for
    if (i >= __nb_elements) {
      GUM_ERROR(NotFound, "not enough elements in the chained list");
    }

    return **__getIthBucket(i);
  }

popBack()

template<typename Val , typename Alloc >

INLINE void gum::List< Val, Alloc >::popBack

(

)

Removes the last element of a List, if any.

When the list is empty, it does not do anything.

Definition at line 1958 of file list_tpl.h.

                                          {
    __erase(__end_list);
  }

popFront()

template<typename Val , typename Alloc >

INLINE void gum::List< Val, Alloc >::popFront

(

)

Removes the first element of a List, if any.

When the list is empty, it does not do anything.

Definition at line 1964 of file list_tpl.h.

Referenced by gum::prm::SVED< GUM_SCALAR >::__eliminateNodes(), gum::prm::SVE< GUM_SCALAR >::__eliminateNodes(), gum::prm::SVED< GUM_SCALAR >::__eliminateNodesDownward(), gum::learning::Miic::__existsDirectedPath(), gum::InfluenceDiagram< GUM_SCALAR >::_getChildrenDecision(), gum::BarrenNodesFinder::barrenNodes(), gum::ArcGraphPart::directedPath(), gum::ArcGraphPart::directedUnorientedPath(), gum::InfluenceDiagram< GUM_SCALAR >::existsPathBetween(), gum::DiGraph::hasDirectedPath(), gum::UndiGraph::hasUndirectedCycle(), gum::MixedGraph::mixedOrientedPath(), gum::MixedGraph::mixedUnorientedPath(), gum::BayesBall::relevantPotentials(), gum::dSeparation::relevantPotentials(), gum::BayesBall::requisiteNodes(), gum::dSeparation::requisiteNodes(), gum::DAGCycleDetector::setDAG(), and gum::EdgeGraphPart::undirectedPath().

                                           {
    __erase(__deb_list);
  }

Here is the caller graph for this function:

push_back() [1/2]

template<typename Val, typename Alloc = std::allocator< Val >>

template<typename... Args>

Val& gum::List< Val, Alloc >::push_back

(

Args &&...

args

)

An alias for pushBack used for STL compliance.

Defining push_back allows using, for instance, BackInserters.

Template Parameters

Args	The emplace arguments type.

Parameters

args	The emplace arguments values.

Returns

Returns a reference on the copy inserted into the list.

Referenced by gum::prm::SVE< GUM_SCALAR >::__initLiftedNodes(), and gum::prm::StructuredInference< GUM_SCALAR >::__reduceAloneInstances().

Here is the caller graph for this function:

push_back() [2/2]

template<typename Val, typename Alloc = std::allocator< Val >>

template<typename... Args>

INLINE Val& gum::List< Val, Alloc >::push_back

(

Args &&...

args

)

Definition at line 1605 of file list_tpl.h.

                                                          {
    return pushBack(std::forward< Args >(args)...);
  }

push_front() [1/2]

template<typename Val, typename Alloc = std::allocator< Val >>

template<typename... Args>

Val& gum::List< Val, Alloc >::push_front

(

Args &&...

args

)

An alias for pushFront used for STL compliance.

Defining push_front allows using, for instance, FrontInserters.

Template Parameters

Args	The emplace values type.

Parameters

args	The emplace values.

Returns

Returns a reference on the copy inserted into the list.

push_front() [2/2]

template<typename Val, typename Alloc = std::allocator< Val >>

template<typename... Args>

INLINE Val& gum::List< Val, Alloc >::push_front

(

Args &&...

args

)

Definition at line 1579 of file list_tpl.h.

                                                           {
    return pushFront(std::forward< Args >(args)...);
  }

pushBack() [1/2]

template<typename Val, typename Alloc >

INLINE Val & gum::List< Val, Alloc >::pushBack

(

const Val &

val

)

Inserts a new element (a copy) at the end of the chained list.

The value passed in argument is not actually inserted into the list: this is a copy of this value that is inserted. The method runs in constant time.

Parameters

val	The value pushed back.

Returns

Returns a reference on the copy inserted into the list.

Warning

Note that val is not actually inserted into the list. Rather, it is a copy of val that is inserted.

Definition at line 1592 of file list_tpl.h.

Referenced by gum::learning::Miic::__existsDirectedPath(), gum::BayesNetFactory< GUM_SCALAR >::__fillProbaWithValuesTable(), gum::prm::SVED< GUM_SCALAR >::__initLiftedNodes(), gum::InfluenceDiagram< GUM_SCALAR >::_getChildrenDecision(), gum::ArcGraphPart::directedPath(), gum::ArcGraphPart::directedUnorientedPath(), gum::InfluenceDiagram< GUM_SCALAR >::existsPathBetween(), gum::DiGraph::hasDirectedPath(), gum::Set< gum::Potential< GUM_SCALAR > * >::listMap(), gum::List< const gum::Potential< GUM_SCALAR > * >::map(), gum::MixedGraph::mixedOrientedPath(), gum::MixedGraph::mixedUnorientedPath(), and gum::EdgeGraphPart::undirectedPath().

                                                         {
    return __pushBack(__createBucket(val));
  }

Here is the caller graph for this function:

pushBack() [2/2]

template<typename Val, typename Alloc >

INLINE Val & gum::List< Val, Alloc >::pushBack

(

Val &&

val

)

Inserts a new element (a move) at the end of the chained list.

The value passed in argument is not actually inserted into the list: this is a copy of this value that is inserted. The method runs in constant time.

Parameters

val	The value pushed back.

Returns

Returns a reference on the copy inserted into the list.

Warning

Note that val is not actually inserted into the list. Rather, it is a copy of val that is inserted.

Definition at line 1598 of file list_tpl.h.

                                                    {
    return __pushBack(__createBucket(std::move(val)));
  }

pushFront() [1/2]

template<typename Val, typename Alloc >

INLINE Val & gum::List< Val, Alloc >::pushFront

(

const Val &

val

)

Inserts a new element (a copy) at the beginning of the chained list.

The value passed in argument is not actually inserted into the list: this is a copy of this value that is inserted. The method runs in constant time.

Parameters

val	The valus pushed at the front.

Returns

Returns a reference on the copy inserted into the list.

Warning

Note that val is not actually inserted into the list. Rather, it is a copy of val that is inserted.

Definition at line 1566 of file list_tpl.h.

                                                          {
    return __pushFront(__createBucket(val));
  }

pushFront() [2/2]

template<typename Val, typename Alloc >

INLINE Val & gum::List< Val, Alloc >::pushFront

(

Val &&

val

)

Inserts a new element (a move) at the beginning of the chained list.

Parameters

val	The valus pushed at the front.

Returns

Returns a reference on the copy inserted into the list.

Warning

Note that val is not actually inserted into the list. Rather, it is a copy of val that is inserted.

Definition at line 1572 of file list_tpl.h.

                                                     {
    return __pushFront(__createBucket(std::move(val)));
  }

rbegin() [1/2]

template<typename Val , typename Alloc >

INLINE ListIterator< Val > gum::List< Val, Alloc >::rbegin

(

)

Returns an unsafe iterator pointing to the last element of the List.

Unsafe iterators are a little bit faster than safe iterators and they consume less memory. However, if the element they point to is erased, their dereference or their increment/decrement will produce a mess, probably a segfault. You should use them only when performance is an issue and if you are sure that they will never point to an element erased.

Returns

Returns an unsafe iterator pointing to the last element of the List.

Definition at line 1456 of file list_tpl.h.

                                                        {
    if (__nb_elements)
      return ListIterator< Val >{*this, __nb_elements - 1};
    else
      return ListIterator< Val >{};
  }

rbegin() [2/2]

template<typename Val , typename Alloc >

INLINE ListConstIterator< Val > gum::List< Val, Alloc >::rbegin

(

)

const

Returns an unsafe const iterator pointing to the last element of the List.

Unsafe iterators are a little bit faster than safe iterators and they consume less memory. However, if the element they point to is erased, their dereference or their increment/decrement will produce a mess, probably a segfault. You should use them only when performance is an issue and if you are sure that they will never point to an element erased.

Returns

Returns an unsafe const iterator pointing to the last element of the List.

Definition at line 1465 of file list_tpl.h.

                                                                   {
    if (__nb_elements)
      return ListConstIterator< Val >{*this, __nb_elements - 1};
    else
      return ListConstIterator< Val >{};
  }

rbeginSafe()

template<typename Val , typename Alloc >

INLINE ListIteratorSafe< Val > gum::List< Val, Alloc >::rbeginSafe

(

)

Returns a safe iterator pointing to the last element of the List.

Safe iterators are iterators whose state is updated by the list when the element they point to is erased. As such, in this case, they can throw an exception when we try to derefence them and they are able to perform a valid ++ or – step.

Returns

Returns a safe iterator pointing to the last element of the List.

Definition at line 1438 of file list_tpl.h.

                                                                {
    if (__nb_elements)
      return ListIteratorSafe< Val >{*this, __nb_elements - 1};
    else
      return ListIteratorSafe< Val >{};
  }

rend() [1/2]

template<typename Val , typename Alloc >

INLINE const ListIterator< Val > & gum::List< Val, Alloc >::rend ( )

noexcept

Returns an unsafe iterator pointing just before the beginning of the List.

Unsafe iterators are a little bit faster than safe iterators and they consume less memory. However, if the element they point to is erased, their dereference or their increment/decrement will produce a mess, probably a segfault. You should use them only when performance is an issue and if you are sure that they will never point to an element erased.

Returns an unsafe iterator pointing just before the beginning of the List.

Definition at line 1386 of file list_tpl.h.

                                                                      {
    return *(reinterpret_cast< const ListIterator< Val >* >(__list_end));
  }

rend() [2/2]

template<typename Val , typename Alloc >

INLINE const ListConstIterator< Val > & gum::List< Val, Alloc >::rend ( ) const

noexcept

Returns an unsafe const iterator pointing just before the beginning of the List.

Unsafe const iterators are a little bit faster than safe const iterators and they consume less memory. However, if the element they point to is erased, their dereference or their increment/decrement will produce a mess, probably a segfault. You should use them only when performance is an issue and if you are sure that they will never point to an element erased.

Returns

Returns an unsafe const iterator pointing just before the beginning of the List.

Definition at line 1392 of file list_tpl.h.

              {
    return *(reinterpret_cast< const ListConstIterator< Val >* >(__list_end));
  }

rendSafe()

template<typename Val , typename Alloc >

INLINE const ListIteratorSafe< Val > & gum::List< Val, Alloc >::rendSafe ( )

noexcept

Returns a safe iterator pointing just before the beginning of the List.

Safe iterators are iterators whose state is updated by the list when the element they point to is erased. As such, in this case, they can throw an exception when we try to derefence them and they are able to perform a valid ++ or – step.

Returns

Returns a safe iterator pointing just before the beginning of the List.

Definition at line 1373 of file list_tpl.h.

                                                                              {
    return *(reinterpret_cast< const ListIteratorSafe< Val >* >(__list_end_safe));
  }

size()

template<typename Val , typename Alloc >

INLINE Size gum::List< Val, Alloc >::size ( ) const

noexcept

Returns the number of elements in the list.

This method runs in constant time.

Definition at line 1851 of file list_tpl.h.

Referenced by gum::BayesNetFactory< GUM_SCALAR >::__fillProbaWithValuesTable(), gum::BayesNetFactory< GUM_SCALAR >::__increment(), gum::credal::CNMonteCarloSampling< GUM_SCALAR, BNInferenceEngine >::__insertEvidence(), and gum::prm::StructuredInference< GUM_SCALAR >::__reduceAloneInstances().

                                                      {
    return __nb_elements;
  }

Here is the caller graph for this function:

swap()

template<typename Val , typename Alloc >

INLINE void gum::List< Val, Alloc >::swap

(

List< Val, Alloc > &

other_list

)

Swap the current list with another one.

Parameters

other_list

The list to swap elements with.

Definition at line 2115 of file list_tpl.h.

                                                       {
    std::swap(__deb_list, other_list.__deb_list);
    std::swap(__end_list, other_list.__end_list);
    std::swap(__nb_elements, other_list.__nb_elements);
    std::swap(__safe_iterators, other_list.__safe_iterators);
    std::swap(__alloc_bucket, other_list.__alloc_bucket);
  }

toString()

template<typename Val , typename Alloc >

std::string gum::List< Val, Alloc >::toString

(

)

const

Converts a list into a string.

Returns

Returns a std::string representation of the gum::List.

Definition at line 1976 of file list_tpl.h.

                                               {
    bool              deja = false;
    std::stringstream stream;
    stream << "[";

    for (ListBucket< Val >* ptr = __deb_list; ptr != nullptr;
         ptr = ptr->__next, deja = true) {
      if (deja) stream << " --> ";

      stream << ptr->__val;
    }

    stream << "]";

    return stream.str();
  }

Friends And Related Function Documentation

ListConstIterator< Val >

template<typename Val, typename Alloc = std::allocator< Val >>

friend class ListConstIterator< Val >

friend

ListIterator should be a friend to optimize access to elements.

Definition at line 1448 of file list.h.

ListConstIteratorSafe< Val >

template<typename Val, typename Alloc = std::allocator< Val >>

friend class ListConstIteratorSafe< Val >

friend

ListIterator should be a friend to optimize access to elements.

Definition at line 1450 of file list.h.

ListIterator< Val >

template<typename Val, typename Alloc = std::allocator< Val >>

friend class ListIterator< Val >

friend

ListIterator should be a friend to optimize access to elements.

Definition at line 1447 of file list.h.

ListIteratorSafe< Val >

template<typename Val, typename Alloc = std::allocator< Val >>

friend class ListIteratorSafe< Val >

friend

ListIterator should be a friend to optimize access to elements.

Definition at line 1449 of file list.h.

Member Data Documentation

__alloc_bucket

template<typename Val, typename Alloc = std::allocator< Val >>

BucketAllocator gum::List< Val, Alloc >::__alloc_bucket

mutableprivate

The allocator for the buckets.

Definition at line 1314 of file list.h.

Referenced by gum::List< const gum::Potential< GUM_SCALAR > * >::swap().

__deb_list

template<typename Val, typename Alloc = std::allocator< Val >>

ListBucket< Val >* gum::List< Val, Alloc >::__deb_list {nullptr}

private

A pointer on the first element of the chained list.

Definition at line 1302 of file list.h.

Referenced by gum::List< const gum::Potential< GUM_SCALAR > * >::__copy_elements(), gum::ListConstIterator< Val >::ListConstIterator(), gum::ListConstIteratorSafe< Val >::ListConstIteratorSafe(), gum::List< const gum::Potential< GUM_SCALAR > * >::operator==(), and gum::List< const gum::Potential< GUM_SCALAR > * >::swap().

__end_list

template<typename Val, typename Alloc = std::allocator< Val >>

ListBucket< Val >* gum::List< Val, Alloc >::__end_list {nullptr}

private

A pointer on the last element of the chained list.

Definition at line 1305 of file list.h.

Referenced by gum::ListConstIterator< Val >::ListConstIterator(), gum::ListConstIteratorSafe< Val >::ListConstIteratorSafe(), and gum::List< const gum::Potential< GUM_SCALAR > * >::swap().

__nb_elements

template<typename Val, typename Alloc = std::allocator< Val >>

Size gum::List< Val, Alloc >::__nb_elements {Size(0)}

private

The number of elements in the list.

Definition at line 1308 of file list.h.

Referenced by gum::List< const gum::Potential< GUM_SCALAR > * >::__copy_elements(), gum::ListConstIterator< Val >::ListConstIterator(), gum::ListConstIteratorSafe< Val >::ListConstIteratorSafe(), gum::List< const gum::Potential< GUM_SCALAR > * >::operator==(), and gum::List< const gum::Potential< GUM_SCALAR > * >::swap().

__safe_iterators

template<typename Val, typename Alloc = std::allocator< Val >>

std::vector< const_iterator_safe* > gum::List< Val, Alloc >::__safe_iterators

mutableprivate

The list of "safe" iterators attached to the list.

Definition at line 1311 of file list.h.

Referenced by gum::ListConstIteratorSafe< Val >::__removeFromSafeList(), gum::ListConstIteratorSafe< Val >::ListConstIteratorSafe(), gum::ListConstIteratorSafe< Val >::operator=(), and gum::List< const gum::Potential< GUM_SCALAR > * >::swap().

---

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

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