gum::PriorityQueueImplementation< Val, Priority, Cmp, Alloc, Gen > Class Template Reference

The internal class for representing priority queues. More...

#include <agrum/core/priorityQueue.h>

Collaboration diagram for gum::PriorityQueueImplementation< Val, Priority, Cmp, Alloc, Gen >:

Public Member Functions
template<typename... Args>
INLINE Size	emplace (Args &&... args)
template<typename Val, typename Priority, typename Cmp, typename Alloc>
	PriorityQueueImplementation (const PriorityQueueImplementation< Val, Priority, Cmp, Alloc, true > &from)
template<typename OtherAlloc >
	PriorityQueueImplementation (const PriorityQueueImplementation< Val, Priority, Cmp, OtherAlloc, true > &from)
template<typename Val, typename Priority, typename Cmp, typename Alloc>
	PriorityQueueImplementation (PriorityQueueImplementation< Val, Priority, Cmp, Alloc, true > &&from)
template<typename OtherAlloc >
PriorityQueueImplementation< Val, Priority, Cmp, Alloc, true > &	operator= (const PriorityQueueImplementation< Val, Priority, Cmp, OtherAlloc, true > &from)
Operators
PriorityQueueImplementation< Val, Priority, Cmp, Alloc, Gen > &	operator= (const PriorityQueueImplementation< Val, Priority, Cmp, Alloc, Gen > &from)
	Copy operator. More...
template<typename OtherAlloc >
PriorityQueueImplementation< Val, Priority, Cmp, Alloc, Gen > &	operator= (const PriorityQueueImplementation< Val, Priority, Cmp, OtherAlloc, Gen > &from)
	Generalized copy operator. More...
PriorityQueueImplementation< Val, Priority, Cmp, Alloc, Gen > &	operator= (PriorityQueueImplementation< Val, Priority, Cmp, Alloc, Gen > &&from)
	Move operator. More...
const Val &	operator[] (Size index_elt) const
	Returns the element at index "index_elt" from the priority queue. More...
Accessors / Modifiers
Size	size () const noexcept
	Returns the number of elements in the priority queue. More...
bool	empty () const noexcept
	Indicates whether the priority queue is empty. More...
bool	contains (const Val &val) const
	Indicates whether the priority queue contains a given value. More...
const Val &	top () const
	returns the element at the top of the priority queue More...
const Priority &	topPriority () const
	Returns the priority of the top element. More...
Val	pop ()
	Removes the top element from the priority queue and return it. More...
Size	insert (const Val &val, const Priority &priority)
	Inserts a new (a copy) element in the priority queue. More...
Size	insert (Val &&val, Priority &&priority)
	Inserts (by move) a new element in the priority queue. More...
template<typename... Args>
Size	emplace (Args &&... args)
	Emplace a new element into the priority queue. More...
void	eraseTop ()
	Removes the top of the priority queue (but does not return it). More...
void	eraseByPos (Size index)
	Removes the element at position "index" from the priority queue. More...
void	erase (const Val &val)
	Removes a given element from the priority queue (but does not return it). More...
Size	setPriorityByPos (Size index, const Priority &new_priority)
	Modifies the priority of the element at position "index" of the queue. More...
Size	setPriorityByPos (Size index, Priority &&new_priority)
	Modifies the priority of the element at position "index" of the queue. More...
void	setPriority (const Val &elt, const Priority &new_priority)
	Modifies the priority of each instance of a given element. More...
void	setPriority (const Val &elt, Priority &&new_priority)
	Modifies the priority of each instance of a given element. More...
const Priority &	priority (const Val &elt) const
	Returns the priority of an instance of the value passed in argument. More...
const Priority &	priorityByPos (Size index) const
	Returns the priority of the value passed in argument. More...
void	clear ()
	Removes all the elements from the queue. More...
const HashTable< Val, Size > &	allValues () const noexcept
	Returns a hashtable the keys of which are the values stored in the queue. More...
std::string	toString () const
	Displays the content of the queue. More...
Fine tuning
Size	capacity () const noexcept
	Returns the size of the internal structure storing the priority queue. More...
void	resize (Size new_size)
	Changes the size of the internal structure storing the priority queue. More...

Public Types
using	IndexAllocator = typename Alloc::template rebind< std::pair< Val, Size > >::other
using	HeapAllocator = typename Alloc::template rebind< std::pair< Priority, const Val *> >::other
using	value_type = Val
	Types for STL compliance. More...
using	reference = Val &
	Types for STL compliance. More...
using	const_reference = const Val &
	Types for STL compliance. More...
using	pointer = Val *
	Types for STL compliance. More...
using	const_pointer = const Val *
	Types for STL compliance. More...
using	difference_type = std::ptrdiff_t
	Types for STL compliance. More...
using	allocator_type = Alloc
	Types for STL compliance. More...

Friends
class	PriorityQueue< Val, Priority, Cmp, Alloc >
	All gum::PriorityQueue are friends with themselves. More...
template<typename V , typename P , typename C , typename A , bool g>
class	PriorityQueueImplementation
	All gum::PriorityQueueImplementation are friends with themselves. More...

Detailed Description

template<typename Val, typename Priority, typename Cmp, typename Alloc, bool Gen>
class gum::PriorityQueueImplementation< Val, Priority, Cmp, Alloc, Gen >

The internal class for representing priority queues.

Priority Queues have different implementations depending on the nature of the values they store. Basically, scalar values can lead to optimization of the code whereas general types like classes cannot. The current class is used for general types (and therefore for classes). The user shall not use directly the implementation but rather use the PriorityQueue class. The latter will be assigned the best implementation at compile time.

Template Parameters

Val	The values type.
Priority	The priorities type.
Cmp	The priorities comparator.
Alloc	The values allocator.
Gen	Used for metaprogramation, for scalar and non-scalar priority queues.

Definition at line 85 of file priorityQueue.h.

Member Typedef Documentation

allocator_type

template<typename Val, typename Priority, typename Cmp, typename Alloc, bool Gen>

using gum::PriorityQueueImplementation< Val, Priority, Cmp, Alloc, Gen >::allocator_type = Alloc

Types for STL compliance.

Definition at line 102 of file priorityQueue.h.

const_pointer

template<typename Val, typename Priority, typename Cmp, typename Alloc, bool Gen>

using gum::PriorityQueueImplementation< Val, Priority, Cmp, Alloc, Gen >::const_pointer = const Val*

Types for STL compliance.

Definition at line 100 of file priorityQueue.h.

const_reference

template<typename Val, typename Priority, typename Cmp, typename Alloc, bool Gen>

using gum::PriorityQueueImplementation< Val, Priority, Cmp, Alloc, Gen >::const_reference = const Val&

Types for STL compliance.

Definition at line 98 of file priorityQueue.h.

difference_type

template<typename Val, typename Priority, typename Cmp, typename Alloc, bool Gen>

using gum::PriorityQueueImplementation< Val, Priority, Cmp, Alloc, Gen >::difference_type = std::ptrdiff_t

Types for STL compliance.

Definition at line 101 of file priorityQueue.h.

HeapAllocator

template<typename Val, typename Priority, typename Cmp, typename Alloc, bool Gen>

using gum::PriorityQueueImplementation< Val, Priority, Cmp, Alloc, Gen >::HeapAllocator = typename Alloc::template rebind< std::pair< Priority, const Val* > >::other

Definition at line 111 of file priorityQueue.h.

IndexAllocator

template<typename Val, typename Priority, typename Cmp, typename Alloc, bool Gen>

using gum::PriorityQueueImplementation< Val, Priority, Cmp, Alloc, Gen >::IndexAllocator = typename Alloc::template rebind< std::pair< Val, Size > >::other

Definition at line 107 of file priorityQueue.h.

pointer

template<typename Val, typename Priority, typename Cmp, typename Alloc, bool Gen>

using gum::PriorityQueueImplementation< Val, Priority, Cmp, Alloc, Gen >::pointer = Val*

Types for STL compliance.

Definition at line 99 of file priorityQueue.h.

reference

template<typename Val, typename Priority, typename Cmp, typename Alloc, bool Gen>

using gum::PriorityQueueImplementation< Val, Priority, Cmp, Alloc, Gen >::reference = Val&

Types for STL compliance.

Definition at line 97 of file priorityQueue.h.

value_type

template<typename Val, typename Priority, typename Cmp, typename Alloc, bool Gen>

using gum::PriorityQueueImplementation< Val, Priority, Cmp, Alloc, Gen >::value_type = Val

Types for STL compliance.

Definition at line 96 of file priorityQueue.h.

Constructor & Destructor Documentation

PriorityQueueImplementation() [1/8]

template<typename Val , typename Priority , typename Cmp, typename Alloc >

INLINE gum::PriorityQueueImplementation< Val, Priority, Cmp, Alloc >::PriorityQueueImplementation ( Cmp  compare, Size  capacity  )

explicitprivate

Basic constructor.

Creates an empty priority queue.

Parameters

compare	A function taking two elements in argument, say e1 and e2, and returning a Boolean indicating wether e1 < e2, i.e., whether e1 should be nearer than e2 to the top of the heap.
capacity	The size of the internal data structures containing the elements (could be for instance vectors or hashtables)

Definition at line 45 of file priorityQueue_tpl.h.

                                                             :
      __indices(capacity >> 1, true, true),
      __cmp(compare) {
    __heap.reserve(capacity);

    // for debugging purposes
    GUM_CONSTRUCTOR(PriorityQueueImplementation);
  }

PriorityQueueImplementation() [2/8]

template<typename Val, typename Priority, typename Cmp, typename Alloc >

gum::PriorityQueueImplementation< Val, Priority, Cmp, Alloc >::PriorityQueueImplementation ( std::initializer_list< std::pair< Val, Priority > >  list )

explicitprivate

Initializer list constructor.

The elements of the initializer list are pairs <Val,Priority>. The comparison function is the default one, i.e., std::less<Priority>.

Parameters

list	The initializer list.

Definition at line 61 of file priorityQueue_tpl.h.

                                                              :
      __indices(Size(list.size()) / 2, true, true) {
    // fill the queue
    __heap.reserve(list.size());
    for (const auto& elt : list) {
      insert(elt.first, elt.second);
    }

    // for debugging purposes
    GUM_CONSTRUCTOR(PriorityQueueImplementation);
  }

PriorityQueueImplementation() [3/8]

template<typename Val, typename Priority, typename Cmp, typename Alloc, bool Gen>

gum::PriorityQueueImplementation< Val, Priority, Cmp, Alloc, Gen >::PriorityQueueImplementation ( const PriorityQueueImplementation< Val, Priority, Cmp, Alloc, Gen > &  from )

private

Copy constructor.

Parameters

from	The gum::PriorityQueueImplementation to copy.

Definition at line 81 of file priorityQueue_tpl.h.

                 :
      __heap(from.__heap),
      __indices(from.__indices), __nb_elements(from.__nb_elements),
      __cmp(from.__cmp) {
    // fill the heap structure
    for (const auto& elt : __indices) {
      __heap[elt.second].second = &(elt.first);
    }

    // for debugging purposes
    GUM_CONS_CPY(PriorityQueueImplementation);
  }

PriorityQueueImplementation() [4/8]

template<typename Val, typename Priority, typename Cmp, typename Alloc , bool Gen>

template<typename OtherAlloc >

gum::PriorityQueueImplementation< Val, Priority, Cmp, Alloc, Gen >::PriorityQueueImplementation ( const PriorityQueueImplementation< Val, Priority, Cmp, OtherAlloc, Gen > &  from )

private

Generalized copy constructor.

Template Parameters

OtherAlloc

The other gum::PriorityQueueImplementation allocator.

Parameters

from	The gum::PriorityQueueImplementation to copy.

Definition at line 104 of file priorityQueue_tpl.h.

                 :
      __indices(from.__indices),
      __nb_elements(from.__nb_elements), __cmp(from.__cmp) {
    // fill the heap structure
    if (__nb_elements) {
      __heap.reserve(from.__heap.size());
      for (const auto& elt : from.__heap) {
        __heap.push_back(elt);
      }
      for (const auto& elt : __indices) {
        __heap[elt.second].second = &(elt.first);
      }
    }

    // for debugging purposes
    GUM_CONS_CPY(PriorityQueueImplementation);
  }

PriorityQueueImplementation() [5/8]

template<typename Val, typename Priority, typename Cmp, typename Alloc, bool Gen>

gum::PriorityQueueImplementation< Val, Priority, Cmp, Alloc, Gen >::PriorityQueueImplementation ( PriorityQueueImplementation< Val, Priority, Cmp, Alloc, Gen > &&  from )

private

Move constructor.

Parameters

from	The gum::PriorityQueueImplementation to move.

Definition at line 131 of file priorityQueue_tpl.h.

                                                                              :
      __heap(std::move(from.__heap)),
      __indices(std::move(from.__indices)),
      __nb_elements(std::move(from.__nb_elements)), __cmp(std::move(from.__cmp)) {
    // for debugging purposes
    GUM_CONS_MOV(PriorityQueueImplementation);
  }

~PriorityQueueImplementation()

template<typename Val , typename Priority , typename Cmp , typename Alloc >

gum::PriorityQueueImplementation< Val, Priority, Cmp, Alloc >::~PriorityQueueImplementation ( )

private

Class destructor.

Definition at line 147 of file priorityQueue_tpl.h.

                                    {
    // for debugging purposes
    GUM_DESTRUCTOR(PriorityQueueImplementation);
  }

PriorityQueueImplementation() [6/8]

template<typename Val, typename Priority, typename Cmp, typename Alloc, bool Gen>

template<typename Val, typename Priority, typename Cmp, typename Alloc>

gum::PriorityQueueImplementation< Val, Priority, Cmp, Alloc, Gen >::PriorityQueueImplementation

(

const PriorityQueueImplementation< Val, Priority, Cmp, Alloc, true > &

from

)

Definition at line 777 of file priorityQueue_tpl.h.

                 :
      __heap(from.__heap),
      __indices(from.__indices), __nb_elements(from.__nb_elements),
      __cmp(from.__cmp) {
    // for debugging purposes
    GUM_CONS_CPY(PriorityQueueImplementation);
  }

PriorityQueueImplementation() [7/8]

template<typename Val, typename Priority, typename Cmp, typename Alloc, bool Gen>

template<typename OtherAlloc >

gum::PriorityQueueImplementation< Val, Priority, Cmp, Alloc, Gen >::PriorityQueueImplementation

(

const PriorityQueueImplementation< Val, Priority, Cmp, OtherAlloc, true > &

from

)

Definition at line 791 of file priorityQueue_tpl.h.

                 :
      __indices(from.__indices),
      __nb_elements(from.__nb_elements), __cmp(from.__cmp) {
    // fill the heap structure
    if (__nb_elements) {
      __heap.reserve(from.__heap.size());
      for (const auto& elt : from.__heap) {
        __heap.push_back(elt);
      }
    }

    // for debugging purposes
    GUM_CONS_CPY(PriorityQueueImplementation);
  }

PriorityQueueImplementation() [8/8]

template<typename Val, typename Priority, typename Cmp, typename Alloc, bool Gen>

template<typename Val, typename Priority, typename Cmp, typename Alloc>

gum::PriorityQueueImplementation< Val, Priority, Cmp, Alloc, Gen >::PriorityQueueImplementation

(

PriorityQueueImplementation< Val, Priority, Cmp, Alloc, true > &&

from

)

Definition at line 811 of file priorityQueue_tpl.h.

                                                                               :
      __heap(std::move(from.__heap)),
      __indices(std::move(from.__indices)),
      __nb_elements(std::move(from.__nb_elements)), __cmp(std::move(from.__cmp)) {
    // for debugging purposes
    GUM_CONS_MOV(PriorityQueueImplementation);
  }

Member Function Documentation

allValues()

template<typename Val , typename Priority , typename Cmp , typename Alloc >

INLINE const HashTable< Val, Size > & gum::PriorityQueueImplementation< Val, Priority, Cmp, Alloc >::allValues ( ) const

noexcept

Returns a hashtable the keys of which are the values stored in the queue.

The keys of the hashtable correspond to the values stored in the priority queue and, for each key, the corresponding value is the index in the queue where we can find the key.

Returns

Returns a hashtable the keys of which are the values stored in the queue.

Definition at line 424 of file priorityQueue_tpl.h.

                       {
    return reinterpret_cast< const HashTable< Val, Size >& >(__indices);
  }

capacity()

template<typename Val , typename Priority , typename Cmp , typename Alloc >

INLINE Size gum::PriorityQueueImplementation< Val, Priority, Cmp, Alloc >::capacity ( ) const

noexcept

Returns the size of the internal structure storing the priority queue.

Returns

Returns the size of the internal structure storing the priority queue.

Definition at line 304 of file priorityQueue_tpl.h.

                       {
    return Size(__heap.capacity());
  }

clear()

template<typename Val , typename Priority , typename Cmp , typename Alloc >

INLINE void gum::PriorityQueueImplementation< Val, Priority, Cmp, Alloc >::clear

(

)

Removes all the elements from the queue.

Definition at line 331 of file priorityQueue_tpl.h.

Referenced by gum::PriorityQueueImplementation< NodeId, double, std::greater< double >, std::allocator< NodeId >, std::is_scalar< NodeId >::value >::clear(), and gum::PriorityQueueImplementation< NodeId, double, std::greater< double >, std::allocator< NodeId >, std::is_scalar< NodeId >::value >::operator=().

                                                                          {
    __nb_elements = 0;
    __heap.clear();
    __indices.clear();
  }

Here is the caller graph for this function:

contains()

template<typename Val, typename Priority , typename Cmp , typename Alloc , bool Gen>

INLINE bool gum::PriorityQueueImplementation< Val, Priority, Cmp, Alloc >::contains

(

const Val &

val

)

const

Indicates whether the priority queue contains a given value.

Parameters

val	The value to look for.

Returns

Returns true if val is in the priority queue.

Definition at line 549 of file priorityQueue_tpl.h.

                              {
    return __indices.exists(val);
  }

emplace() [1/2]

template<typename Val, typename Priority, typename Cmp, typename Alloc, bool Gen>

template<typename... Args>

Size gum::PriorityQueueImplementation< Val, Priority, Cmp, Alloc, Gen >::emplace

(

Args &&...

args

)

Emplace a new element into the priority queue.

See gum::PriorityQueueImplementation::eraseByPos(Size) for more details about the index.

Template Parameters

Args	The emplace arguments types.

Parameters

args	The emplace arguments.

Returns

Returns the index of the element inserted into the priority queue.

Exceptions

DuplicateElement

Raised if the element already exists.

emplace() [2/2]

template<typename Val , typename Priority , typename Cmp , typename Alloc >

template<typename... Args>

INLINE Size gum::PriorityQueueImplementation< Val, Priority, Cmp, Alloc >::emplace

(

Args &&...

args

)

Definition at line 523 of file priorityQueue_tpl.h.

                        {
    std::pair< Val, Priority > new_elt =
       std::make_pair< Val, Priority >(std::forward< Args >(args)...);
    return insert(std::move(new_elt.first), std::move(new_elt.second));
  }

empty()

template<typename Val , typename Priority , typename Cmp , typename Alloc >

INLINE bool gum::PriorityQueueImplementation< Val, Priority, Cmp, Alloc >::empty ( ) const

noexcept

Indicates whether the priority queue is empty.

Returns

Returns true if the priority queue is empty.

Definition at line 537 of file priorityQueue_tpl.h.

              {
    return (__nb_elements == 0);
  }

erase()

template<typename Val, typename Priority , typename Cmp , typename Alloc , bool Gen>

INLINE void gum::PriorityQueueImplementation< Val, Priority, Cmp, Alloc >::erase

(

const Val &

val

)

Removes a given element from the priority queue (but does not return it).

If the element cannot be found, the function returns without throwing any exception.

If the queue contains several times this element, then the one with the smallest index is removed.

Parameters

val	the element we wish to remove.

Definition at line 384 of file priorityQueue_tpl.h.

Referenced by gum::PriorityQueueImplementation< NodeId, double, std::greater< double >, std::allocator< NodeId >, std::is_scalar< NodeId >::value >::eraseByPos(), and gum::PriorityQueueImplementation< NodeId, double, std::greater< double >, std::allocator< NodeId >, std::is_scalar< NodeId >::value >::operator=().

                     {
    try {
      eraseByPos(__indices[val]);
    } catch (NotFound&) {}
  }

Here is the caller graph for this function:

eraseByPos()

template<typename Val , typename Priority , typename Cmp , typename Alloc >

void gum::PriorityQueueImplementation< Val, Priority, Cmp, Alloc >::eraseByPos

(

Size

index

)

Removes the element at position "index" from the priority queue.

If the element cannot be found, the function returns without throwing any exception.

The priority is computed as follows: suppose that the queue is a complete binary tree where all levels are completely filled except, eventually, the last one. In this case, the elements of the last level are all on the left of the tree.

We assign 0 to the root, then parsing the tree from top to bottom then from left to right we increment the index and assigned it to the current node. Doing so, we get a unique index for each element. This is precisely what the index passed in argument of the function represents.

Parameters

index

represents the position of the element to be removed.

Definition at line 343 of file priorityQueue_tpl.h.

                 {
    if (index >= __nb_elements) return;

    // remove the element from the hashtable
    __indices.erase(*(__heap[index].second));

    // put the last element at the "index" location
    std::pair< Priority, const Val* > last = std::move(__heap[__nb_elements - 1]);
    __heap.pop_back();
    --__nb_elements;

    if (!__nb_elements || (index == __nb_elements)) return;

    // restore the heap property
    Size i = index;

    for (Size j = (index << 1) + 1; j < __nb_elements; i = j, j = (j << 1) + 1) {
      // let j be the max child
      if ((j + 1 < __nb_elements) && __cmp(__heap[j + 1].first, __heap[j].first))
        ++j;

      // if "last" is lower than heap[j], "last" must be stored at index i
      if (__cmp(last.first, __heap[j].first)) break;

      // else pull up the jth node
      __heap[i] = std::move(__heap[j]);
      __indices[*(__heap[i].second)] = i;
    }

    // put "last" back into the heap
    __heap[i] = std::move(last);
    __indices[*(__heap[i].second)] = i;
  }

eraseTop()

template<typename Val , typename Priority , typename Cmp , typename Alloc >

INLINE void gum::PriorityQueueImplementation< Val, Priority, Cmp, Alloc >::eraseTop

(

)

Removes the top of the priority queue (but does not return it).

If the heap is empty, it does nothing (in particular, it does not throw any exception).

Definition at line 398 of file priorityQueue_tpl.h.

                                                                             {
    eraseByPos(0);
  }

insert() [1/2]

template<typename Val, typename Priority, typename Cmp , typename Alloc , bool Gen>

INLINE Size gum::PriorityQueueImplementation< Val, Priority, Cmp, Alloc, Gen >::insert	(	const Val &	val,
		const Priority &	priority
	)

Inserts a new (a copy) element in the priority queue.

See gum::PriorityQueueImplementation::eraseByPos(Size) for more details about the index.

Parameters

val	The value to insert.
priority	The value's priority in the queue.

Returns

Returns the index of the element inserted into the priority queue.

Exceptions

DuplicateElement

Raised if the element already exists.

Definition at line 436 of file priorityQueue_tpl.h.

Referenced by gum::StaticTriangulation::__computeRecursiveThinning().

                                                  {
    // create the entry in the indices hashtable (if the element already exists,
    // __indices.insert will raise a Duplicateelement exception)
    typename HashTable< Val, Size, IndexAllocator >::value_type& new_elt =
       __indices.insert(val, 0);

    try {
      __heap.push_back(
         std::pair< Priority, const Val* >(priority, &new_elt.first));
    } catch (...) {
      __indices.erase(val);
      throw;
    }

    std::pair< Priority, const Val* > new_heap_val =
       std::move(__heap[__nb_elements]);
    ++__nb_elements;

    // restore the heap property
    Size i = __nb_elements - 1;

    for (Size j = (i - 1) >> 1; i && __cmp(new_heap_val.first, __heap[j].first);
         i = j, j = (j - 1) >> 1) {
      __heap[i] = std::move(__heap[j]);
      __indices[*(__heap[i].second)] = i;
    }

    // put the new bucket into the heap
    __heap[i].first = std::move(new_heap_val.first);
    __heap[i].second = &(new_elt.first);
    new_elt.second = i;

    return i;
  }

Here is the caller graph for this function:

insert() [2/2]

template<typename Val, typename Priority, typename Cmp , typename Alloc , bool Gen>

INLINE Size gum::PriorityQueueImplementation< Val, Priority, Cmp, Alloc, Gen >::insert	(	Val &&	val,
		Priority &&	priority
	)

Inserts (by move) a new element in the priority queue.

See gum::PriorityQueueImplementation::eraseByPos(Size) for more details about the index.

Parameters

val	The value to insert.
priority	The value's priority in the queue.

Returns

Returns the index of the element inserted into the priority queue.

Exceptions

DuplicateElement

Raised if the element already exists.

Definition at line 479 of file priorityQueue_tpl.h.

                                        {
    // create the entry in the indices hashtable (if the element already exists,
    // __indices.insert will raise a Duplicateelement exception)
    typename HashTable< Val, Size, IndexAllocator >::value_type& new_elt =
       __indices.insert(std::move(val), 0);

    try {
      __heap.push_back(
         std::pair< Priority, const Val* >(std::move(priority), &(new_elt.first)));
    } catch (...) {
      __indices.erase(new_elt.first);
      throw;
    }

    std::pair< Priority, const Val* > new_heap_val =
       std::move(__heap[__nb_elements]);
    ++__nb_elements;

    // restore the heap property
    Size i = __nb_elements - 1;

    for (Size j = (i - 1) >> 1; i && __cmp(new_heap_val.first, __heap[j].first);
         i = j, j = (j - 1) >> 1) {
      __heap[i] = std::move(__heap[j]);
      __indices[*(__heap[i].second)] = i;
    }

    // put the new bucket into the heap
    __heap[i].first = std::move(new_heap_val.first);
    __heap[i].second = &(new_elt.first);
    new_elt.second = i;

    return i;
  }

operator=() [1/4]

template<typename Val, typename Priority, typename Cmp, typename Alloc, bool Gen>

PriorityQueueImplementation< Val, Priority, Cmp, Alloc, Gen > & gum::PriorityQueueImplementation< Val, Priority, Cmp, Alloc, Gen >::operator=

(

const PriorityQueueImplementation< Val, Priority, Cmp, Alloc, Gen > &

from

)

Copy operator.

When a problem occurs during the copy (for instance when not enough memory is available), the operator guarantees that the heap stays in a coherent state. Actually, the priority queue becomes empty. An exception is then thrown.

Parameters

from	The gum::PriorityQueueImplementation to copy.

Returns

Returns this gum::PriorityQueueImplementation.

Definition at line 159 of file priorityQueue_tpl.h.

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

      try {
        // set the comparison function
        __cmp = from.__cmp;

        // copy the indices and the heap
        __indices = from.__indices;
        __heap = from.__heap;
        __nb_elements = from.__nb_elements;

        // restore the link between __indices and __heap
        for (const auto& elt : __indices) {
          __heap[elt.second].second = &(elt.first);
        }
      } catch (...) {
        __heap.clear();
        __indices.clear();
        __nb_elements = 0;

        throw;
      }
    }

    return *this;
  }

operator=() [2/4]

template<typename Val, typename Priority, typename Cmp, typename Alloc , bool Gen>

template<typename OtherAlloc >

PriorityQueueImplementation< Val, Priority, Cmp, Alloc, Gen > & gum::PriorityQueueImplementation< Val, Priority, Cmp, Alloc, Gen >::operator=

(

const PriorityQueueImplementation< Val, Priority, Cmp, OtherAlloc, Gen > &

from

)

Generalized copy operator.

When a problem occurs during the copy (for instance when not enough memory is available), the operator guarantees that the heap stays in a coherent state. Actually, the priority queue becomes empty. An exception is then thrown.

Template Parameters

OtherAlloc

The other gum::PriorityQueueImplementation allocator.

Parameters

from	The gum::PriorityQueueImplementation to copy.

Returns

Returns this gum::PriorityQueueImplementation.

Definition at line 200 of file priorityQueue_tpl.h.

                 {
    // for debugging purposes
    GUM_OP_CPY(PriorityQueueImplementation);

    try {
      // set the comprison function
      __cmp = from.__cmp;

      // copy the indices and the heap
      __indices = from.__indices;
      __nb_elements = from.__nb_elements;

      __heap.clear();
      if (__nb_elements) {
        __heap.reserve(from.__heap.size());
        for (const auto& elt : from.__heap) {
          __heap.push_back(elt);
        }
        for (const auto& elt : __indices) {
          __heap[elt.second].second = &(elt.first);
        }
      }
    } catch (...) {
      __heap.clear();
      __indices.clear();
      __nb_elements = 0;

      throw;
    }

    return *this;
  }

operator=() [3/4]

template<typename Val, typename Priority, typename Cmp, typename Alloc, bool Gen>

INLINE PriorityQueueImplementation< Val, Priority, Cmp, Alloc, Gen > & gum::PriorityQueueImplementation< Val, Priority, Cmp, Alloc, Gen >::operator=

(

PriorityQueueImplementation< Val, Priority, Cmp, Alloc, Gen > &&

from

)

Move operator.

Parameters

from	The gum::PriorityQueueImplementation to move.

Returns

Returns this gum::PriorityQueueImplementation.

Definition at line 242 of file priorityQueue_tpl.h.

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

      __indices = std::move(from.__indices);
      __heap = std::move(from.__heap);
      __cmp = std::move(from.__cmp);
      __nb_elements = std::move(from.__nb_elements);
    }

    return *this;
  }

operator=() [4/4]

template<typename Val, typename Priority, typename Cmp, typename Alloc, bool Gen>

template<typename OtherAlloc >

PriorityQueueImplementation< Val, Priority, Cmp, Alloc, true >& gum::PriorityQueueImplementation< Val, Priority, Cmp, Alloc, Gen >::operator=

(

const PriorityQueueImplementation< Val, Priority, Cmp, OtherAlloc, true > &

from

)

Definition at line 863 of file priorityQueue_tpl.h.

                 {
    // for debugging purposes
    GUM_OP_CPY(PriorityQueueImplementation);

    try {
      // set the comprison function
      __cmp = from.__cmp;

      // copy the indices and the heap
      __indices = from.__indices;
      __nb_elements = from.__nb_elements;

      __heap.clear();
      if (__nb_elements) {
        __heap.reserve(from.__heap.size());
        for (const auto& elt : from.__heap) {
          __heap.push_back(elt);
        }
      }
    } catch (...) {
      __heap.clear();
      __indices.clear();
      __nb_elements = 0;

      throw;
    }

    return *this;
  }

operator[]()

template<typename Val , typename Priority , typename Cmp , typename Alloc >

INLINE const Val & gum::PriorityQueueImplementation< Val, Priority, Cmp, Alloc >::operator[]

(

Size

index_elt

)

const

Returns the element at index "index_elt" from the priority queue.

Parameters

index_elt

The index of the element to return.

Returns

Returns the element at index "index_elt" from the priority queue.

Exceptions

NotFound

Raised if the element does not exist.

Definition at line 561 of file priorityQueue_tpl.h.

                                                 {
    if (index >= __nb_elements) {
      GUM_ERROR(NotFound,
                "not enough elements in the PriorityQueueImplementation");
    }

    return *(__heap[index].second);
  }

pop()

template<typename Val , typename Priority , typename Cmp , typename Alloc >

INLINE Val gum::PriorityQueueImplementation< Val, Priority, Cmp, Alloc >::pop

(

)

Removes the top element from the priority queue and return it.

Returns

Returns the top element from the priority queue.

Exceptions

NotFound

Raised if the queue is empty.

Definition at line 408 of file priorityQueue_tpl.h.

                                                                                {
    if (!__nb_elements) { GUM_ERROR(NotFound, "empty priority queue"); }

    Val v = *(__heap[0].second);
    eraseByPos(0);

    return v;
  }

priority()

template<typename Val, typename Priority , typename Cmp , typename Alloc , bool Gen>

INLINE const Priority & gum::PriorityQueueImplementation< Val, Priority, Cmp, Alloc >::priority

(

const Val &

elt

)

const

Returns the priority of an instance of the value passed in argument.

Parameters

elt	The element for which the priority is returned.

Returns

Returns the priority of an instance of the value passed in argument.

Exceptions

NotFound

Raised if the element cannot be found.

Definition at line 721 of file priorityQueue_tpl.h.

Referenced by gum::DefaultPartialOrderedEliminationSequenceStrategy::__nodeToEliminate().

                              {
    return __heap[__indices[elt]].first;
  }

Here is the caller graph for this function:

priorityByPos()

template<typename Val , typename Priority , typename Cmp , typename Alloc >

INLINE const Priority & gum::PriorityQueueImplementation< Val, Priority, Cmp, Alloc >::priorityByPos

(

Size

index

)

const

Returns the priority of the value passed in argument.

Parameters

index

The index of the value of which the priority is returned.

Exceptions

NotFound

Raised if the element cannot be found.

Definition at line 733 of file priorityQueue_tpl.h.

                          {
    if (index > __nb_elements) {
      GUM_ERROR(NotFound,
                "not enough elements in the PriorityQueueImplementation");
    }
    return __heap[index].first;
  }

resize()

template<typename Val , typename Priority , typename Cmp , typename Alloc >

INLINE void gum::PriorityQueueImplementation< Val, Priority, Cmp, Alloc >::resize

(

Size

new_size

)

Changes the size of the internal structure storing the priority queue.

Parameters

new_size

The internal structure new size.

Definition at line 316 of file priorityQueue_tpl.h.

Referenced by gum::PriorityQueueImplementation< NodeId, double, std::greater< double >, std::allocator< NodeId >, std::is_scalar< NodeId >::value >::operator=(), and gum::PriorityQueueImplementation< NodeId, double, std::greater< double >, std::allocator< NodeId >, std::is_scalar< NodeId >::value >::resize().

                       {
    if (new_size < __nb_elements) return;

    __heap.reserve(new_size);
    __indices.resize(new_size / 2);
  }

Here is the caller graph for this function:

setPriority() [1/2]

template<typename Val, typename Priority, typename Cmp , typename Alloc , bool Gen>

void gum::PriorityQueueImplementation< Val, Priority, Cmp, Alloc, Gen >::setPriority	(	const Val &	elt,
		const Priority &	new_priority
	)

Modifies the priority of each instance of a given element.

Parameters

elt	The value to update.
new_priority	The values new priority.

Exceptions

NotFound

Raised if the element cannot be found.

Definition at line 698 of file priorityQueue_tpl.h.

                                                   {
    setPriorityByPos(__indices[elt], new_priority);
  }

setPriority() [2/2]

template<typename Val, typename Priority, typename Cmp , typename Alloc , bool Gen>

void gum::PriorityQueueImplementation< Val, Priority, Cmp, Alloc, Gen >::setPriority	(	const Val &	elt,
		Priority &&	new_priority
	)

Modifies the priority of each instance of a given element.

Parameters

elt	The value to update.
new_priority	The values new priority.

Exceptions

NotFound

Raised if the element cannot be found.

Definition at line 709 of file priorityQueue_tpl.h.

                                              {
    setPriorityByPos(__indices[elt], std::move(new_priority));
  }

setPriorityByPos() [1/2]

template<typename Val , typename Priority, typename Cmp , typename Alloc >

Size gum::PriorityQueueImplementation< Val, Priority, Cmp, Alloc >::setPriorityByPos	(	Size	index,
		const Priority &	new_priority
	)

Modifies the priority of the element at position "index" of the queue.

Parameters

index	The index of the element to update.
new_priority	The element's new priority.

Returns

Returns the elements new priority.

Exceptions

NotFound

Raised if the element cannot be found.

Definition at line 601 of file priorityQueue_tpl.h.

                                                                {
    // check whether the element the priority of which should be changed exists
    if (index >= __nb_elements) {
      GUM_ERROR(NotFound,
                "not enough elements in the PriorityQueueImplementation");
    }

    // get the element itself
    const Val* val = __heap[index].second;

    // restore the heap property
    Size i = index;

    // move val upward if needed
    for (Size j = (i - 1) >> 1; i && __cmp(new_priority, __heap[j].first);
         i = j, j = (j - 1) >> 1) {
      __heap[i] = std::move(__heap[j]);
      __indices[*(__heap[i].second)] = i;
    }

    // move val downward if needed
    for (Size j = (i << 1) + 1; j < __nb_elements; i = j, j = (j << 1) + 1) {
      // let j be the max child
      if ((j + 1 < __nb_elements) && __cmp(__heap[j + 1].first, __heap[j].first))
        ++j;

      // if "val" is lower than heap[j], "val" must be stored at index i
      if (__cmp(new_priority, __heap[j].first)) break;

      // else pull up the jth node
      __heap[i] = std::move(__heap[j]);
      __indices[*(__heap[i].second)] = i;
    }

    // update the index of val
    __heap[i].first = new_priority;
    __heap[i].second = val;
    __indices[*val] = i;

    return i;
  }

setPriorityByPos() [2/2]

template<typename Val , typename Priority, typename Cmp , typename Alloc >

Size gum::PriorityQueueImplementation< Val, Priority, Cmp, Alloc >::setPriorityByPos	(	Size	index,
		Priority &&	new_priority
	)

Modifies the priority of the element at position "index" of the queue.

Parameters

index	The index of the element to update.
new_priority	The element's new priority.

Returns

Returns the elements new priority.

Exceptions

NotFound

Raised if the element cannot be found.

Definition at line 650 of file priorityQueue_tpl.h.

                                                           {
    // check whether the element the priority of which should be changed exists
    if (index >= __nb_elements) {
      GUM_ERROR(NotFound,
                "not enough elements in the PriorityQueueImplementation");
    }

    // get the element itself
    const Val* val = __heap[index].second;

    // restore the heap property
    Size i = index;

    // move val upward if needed
    for (Size j = (i - 1) >> 1; i && __cmp(new_priority, __heap[j].first);
         i = j, j = (j - 1) >> 1) {
      __heap[i] = std::move(__heap[j]);
      __indices[*(__heap[i].second)] = i;
    }

    // move val downward if needed
    for (Size j = (i << 1) + 1; j < __nb_elements; i = j, j = (j << 1) + 1) {
      // let j be the max child
      if ((j + 1 < __nb_elements) && __cmp(__heap[j + 1].first, __heap[j].first))
        ++j;

      // if "val" is lower than heap[j], "val" must be stored at index i
      if (__cmp(new_priority, __heap[j].first)) break;

      // else pull up the jth node
      __heap[i] = std::move(__heap[j]);
      __indices[*(__heap[i].second)] = i;
    }

    // update the index of val
    __heap[i].first = std::move(new_priority);
    __heap[i].second = val;
    __indices[*val] = i;

    return i;
  }

size()

template<typename Val , typename Priority , typename Cmp , typename Alloc >

INLINE Size gum::PriorityQueueImplementation< Val, Priority, Cmp, Alloc >::size ( ) const

noexcept

Returns the number of elements in the priority queue.

Returns

Returns the number of elements in the priority queue.

Definition at line 292 of file priorityQueue_tpl.h.

              {
    return __nb_elements;
  }

top()

template<typename Val , typename Priority , typename Cmp , typename Alloc >

INLINE const Val & gum::PriorityQueueImplementation< Val, Priority, Cmp, Alloc >::top

(

)

const

returns the element at the top of the priority queue

Exceptions

NotFound

Raised if the queue is empty

Definition at line 265 of file priorityQueue_tpl.h.

                                                                                        {
    if (!__nb_elements) { GUM_ERROR(NotFound, "empty priority queue"); }

    return *(__heap[0].second);
  }

topPriority()

template<typename Val , typename Priority , typename Cmp , typename Alloc >

INLINE const Priority & gum::PriorityQueueImplementation< Val, Priority, Cmp, Alloc >::topPriority

(

)

const

Returns the priority of the top element.

Returns

Returns the priority of the top element.

Exceptions

NotFound

Raised if the queue is empty.

Definition at line 278 of file priorityQueue_tpl.h.

              {
    if (!__nb_elements) { GUM_ERROR(NotFound, "empty priority queue"); }

    return __heap[0].first;
  }

toString()

template<typename Val , typename Priority , typename Cmp , typename Alloc >

std::string gum::PriorityQueueImplementation< Val, Priority, Cmp, Alloc >::toString

(

)

const

Displays the content of the queue.

Returns

Returns the content of the queue.

Definition at line 577 of file priorityQueue_tpl.h.

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

    for (Size i = 0; i != __nb_elements; ++i, deja = true) {
      if (deja) stream << " , ";

      stream << "(" << __heap[i].first << " , " << *(__heap[i].second) << ")";
    }

    stream << "]";

    return stream.str();
  }

Friends And Related Function Documentation

PriorityQueueImplementation

template<typename Val, typename Priority, typename Cmp, typename Alloc, bool Gen>

template<typename V , typename P , typename C , typename A , bool g>

friend class PriorityQueueImplementation

friend

All gum::PriorityQueueImplementation are friends with themselves.

Definition at line 91 of file priorityQueue.h.

PriorityQueue< Val, Priority, Cmp, Alloc >

template<typename Val, typename Priority, typename Cmp, typename Alloc, bool Gen>

friend class PriorityQueue< Val, Priority, Cmp, Alloc >

friend

All gum::PriorityQueue are friends with themselves.

Definition at line 87 of file priorityQueue.h.

Member Data Documentation

__cmp

template<typename Val, typename Priority, typename Cmp, typename Alloc, bool Gen>

Cmp gum::PriorityQueueImplementation< Val, Priority, Cmp, Alloc, Gen >::__cmp

private

Comparison function.

Definition at line 470 of file priorityQueue.h.

Referenced by gum::PriorityQueueImplementation< NodeId, double, std::greater< double >, std::allocator< NodeId >, std::is_scalar< NodeId >::value >::operator=(), and gum::PriorityQueueImplementation< NodeId, double, std::greater< double >, std::allocator< NodeId >, std::is_scalar< NodeId >::value >::PriorityQueueImplementation().

__heap

template<typename Val, typename Priority, typename Cmp, typename Alloc, bool Gen>

std::vector< std::pair< Priority, const Val* >, HeapAllocator > gum::PriorityQueueImplementation< Val, Priority, Cmp, Alloc, Gen >::__heap

private

An array storing all the elements of the heap as well as their score.

Definition at line 460 of file priorityQueue.h.

Referenced by gum::PriorityQueueImplementation< NodeId, double, std::greater< double >, std::allocator< NodeId >, std::is_scalar< NodeId >::value >::operator=(), and gum::PriorityQueueImplementation< NodeId, double, std::greater< double >, std::allocator< NodeId >, std::is_scalar< NodeId >::value >::PriorityQueueImplementation().

__indices

template<typename Val, typename Priority, typename Cmp, typename Alloc, bool Gen>

HashTable< Val, Size, IndexAllocator > gum::PriorityQueueImplementation< Val, Priority, Cmp, Alloc, Gen >::__indices

private

Initial value:

{
       HashTableConst::default_size, true, true}

A hashtable for quickly finding the elements by their value.

Definition at line 463 of file priorityQueue.h.

Referenced by gum::PriorityQueueImplementation< NodeId, double, std::greater< double >, std::allocator< NodeId >, std::is_scalar< NodeId >::value >::operator=(), and gum::PriorityQueueImplementation< NodeId, double, std::greater< double >, std::allocator< NodeId >, std::is_scalar< NodeId >::value >::PriorityQueueImplementation().

__nb_elements

template<typename Val, typename Priority, typename Cmp, typename Alloc, bool Gen>

Size gum::PriorityQueueImplementation< Val, Priority, Cmp, Alloc, Gen >::__nb_elements {0}

private

The number of elements in the heap.

Definition at line 467 of file priorityQueue.h.

Referenced by gum::PriorityQueueImplementation< NodeId, double, std::greater< double >, std::allocator< NodeId >, std::is_scalar< NodeId >::value >::operator=(), and gum::PriorityQueueImplementation< NodeId, double, std::greater< double >, std::allocator< NodeId >, std::is_scalar< NodeId >::value >::PriorityQueueImplementation().

---

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

• agrum/core/priorityQueue.h
• agrum/core/priorityQueue_tpl.h