gum::LinkedList< T > Class Template Reference

Chain list allocated using the SmallObjectAllocator. More...

#include <agrum/multidim/FunctionGraphUtilities/link.h>

Public Member Functions
Constructors and Destructors
	LinkedList ()
	Constructor. More...
	~LinkedList ()
	Destructor. More...
void *	operator new (size_t s)
	Operator new overload to use the SmallObjectAllocator. More...
void	operator delete (void *p)
	Operator delete overload to use the SmallObjectAllocator. More...
Misceleanous methods
const Link< T > *	list () const
	Returns the first link in the chained list. More...
Link< T > *	list ()
	Returns the first link in the chained list. More...
void	clear ()
	Clears the list. More...
void	addLink (const T &elem)
	Adds a link. More...
void	searchAndRemoveLink (const T &elem)
	Removes a element from the list. More...

Detailed Description

template<typename T>
class gum::LinkedList< T >

Chain list allocated using the SmallObjectAllocator.

Template Parameters

T	The type stored by the chain list.

Definition at line 131 of file link.h.

Constructor & Destructor Documentation

LinkedList()

template<typename T >

INLINE gum::LinkedList< T >::LinkedList

(

)

Constructor.

Definition at line 89 of file link_tpl.h.

                                     {
    GUM_CONSTRUCTOR(LinkedList);
    __firstLink = nullptr;
  }

~LinkedList()

template<typename T >

INLINE gum::LinkedList< T >::~LinkedList

(

)

Destructor.

Definition at line 96 of file link_tpl.h.

                                      {
    clear();
    GUM_DESTRUCTOR(LinkedList);
  }

Member Function Documentation

addLink()

template<typename T>

INLINE void gum::LinkedList< T >::addLink

(

const T &

elem

)

Adds a link.

Definition at line 133 of file link_tpl.h.

Referenced by gum::MultiDimFunctionGraphManager< bool, ExactTerminalNodePolicy >::__adjacentSwap(), and gum::MultiDimFunctionGraphGenerator::generate().

                                                    {
    Link< T >* newLink = new Link< T >(elem, __firstLink);
    __firstLink = newLink;
  }

Here is the caller graph for this function:

clear()

template<typename T >

void gum::LinkedList< T >::clear

(

)

Clears the list.

Definition at line 122 of file link_tpl.h.

                              {
    Link< T >* curLink = __firstLink;
    Link< T >* nl = nullptr;
    while (curLink) {
      nl = curLink->nextLink();
      delete curLink;
      curLink = nl;
    }
  }

list() [1/2]

template<typename T >

INLINE const Link< T > * gum::LinkedList< T >::list

(

)

const

Returns the first link in the chained list.

Definition at line 112 of file link_tpl.h.

Referenced by gum::MultiDimFunctionGraphManager< bool, ExactTerminalNodePolicy >::__adjacentSwap(), and gum::MultiDimFunctionGraphGenerator::generate().

                                                      {
    return __firstLink;
  }

Here is the caller graph for this function:

list() [2/2]

template<typename T >

INLINE Link< T > * gum::LinkedList< T >::list

(

)

Returns the first link in the chained list.

Definition at line 117 of file link_tpl.h.

                                          {
    return __firstLink;
  }

operator delete()

template<typename T >

INLINE void gum::LinkedList< T >::operator delete

(

void *

p

)

Operator delete overload to use the SmallObjectAllocator.

Definition at line 107 of file link_tpl.h.

                                                      {
    SmallObjectAllocator::instance().deallocate(p, sizeof(LinkedList< T >));
  }

operator new()

template<typename T >

INLINE void * gum::LinkedList< T >::operator new

(

size_t

s

)

Operator new overload to use the SmallObjectAllocator.

Definition at line 102 of file link_tpl.h.

                                                     {
    return SmallObjectAllocator::instance().allocate(Size(s));
  }

searchAndRemoveLink()

template<typename T>

INLINE void gum::LinkedList< T >::searchAndRemoveLink

(

const T &

elem

)

Removes a element from the list.

Definition at line 139 of file link_tpl.h.

Referenced by gum::MultiDimFunctionGraphManager< bool, ExactTerminalNodePolicy >::__adjacentSwap().

                                                                {
    Link< T >* curLink = __firstLink;
    Link< T >* prevLink = nullptr;
    while (curLink && curLink->element() != elem) {
      prevLink = curLink;
      curLink = curLink->nextLink();
    }
    if (curLink) {
      if (prevLink)
        prevLink->setNextLink(curLink->nextLink());
      else
        __firstLink = curLink->nextLink();
      delete curLink;
    }
  }

Here is the caller graph for this function:

Member Data Documentation

__firstLink

template<typename T>

Link< T >* gum::LinkedList< T >::__firstLink

private

The first link of our list.

Definition at line 193 of file link.h.

---

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

• agrum/multidim/utils/FunctionGraphUtilities/link.h
• agrum/multidim/utils/FunctionGraphUtilities/link_tpl.h