smtrat::PriorityQueue< T, Compare > Class Template Reference

#include <DynamicPriorityQueue.h>

Inheritance diagram for smtrat::PriorityQueue< T, Compare >:

Collaboration diagram for smtrat::PriorityQueue< T, Compare >:

Public Member Functions
	PriorityQueue ()
	PriorityQueue (const Compare &comp)
const auto &	data () const
auto &	data ()
auto	find (const T &t) const
auto	begin () const
auto	begin ()
auto	end () const
auto	end ()
auto	erase (typename std::vector< T >::const_iterator it)
auto	erase (typename std::vector< T >::const_iterator it, typename std::vector< T >::const_iterator end)
void	fix ()
template<typename F >
void	removeIf (F &&f)
void	clear ()

Data Fields
T	elements
	STL member. More...

Private Types
using	super = std::priority_queue< T, std::vector< T >, Compare >

Detailed Description

template<typename T, typename Compare = std::less<T>>
class smtrat::PriorityQueue< T, Compare >

Definition at line 11 of file DynamicPriorityQueue.h.

Member Typedef Documentation

super

template<typename T , typename Compare = std::less<T>>

using smtrat::PriorityQueue< T, Compare >::super = std::priority_queue<T,std::vector<T>,Compare>

private

Definition at line 12 of file DynamicPriorityQueue.h.

Constructor & Destructor Documentation

PriorityQueue() [1/2]

template<typename T , typename Compare = std::less<T>>

smtrat::PriorityQueue< T, Compare >::PriorityQueue ( )

inlineexplicit

Definition at line 14 of file DynamicPriorityQueue.h.

PriorityQueue() [2/2]

template<typename T , typename Compare = std::less<T>>

smtrat::PriorityQueue< T, Compare >::PriorityQueue ( const Compare &  comp )

inlineexplicit

Definition at line 15 of file DynamicPriorityQueue.h.

Member Function Documentation

begin() [1/2]

template<typename T , typename Compare = std::less<T>>

auto smtrat::PriorityQueue< T, Compare >::begin ( )

inline

Definition at line 28 of file DynamicPriorityQueue.h.

Here is the call graph for this function:

begin() [2/2]

template<typename T , typename Compare = std::less<T>>

auto smtrat::PriorityQueue< T, Compare >::begin ( ) const

inline

Definition at line 25 of file DynamicPriorityQueue.h.

Here is the call graph for this function:

Here is the caller graph for this function:

clear()

template<typename T , typename Compare = std::less<T>>

void smtrat::PriorityQueue< T, Compare >::clear ( )

inline

Definition at line 52 of file DynamicPriorityQueue.h.

Here is the call graph for this function:

Here is the caller graph for this function:

data() [1/2]

template<typename T , typename Compare = std::less<T>>

auto& smtrat::PriorityQueue< T, Compare >::data ( )

inline

Definition at line 19 of file DynamicPriorityQueue.h.

data() [2/2]

template<typename T , typename Compare = std::less<T>>

const auto& smtrat::PriorityQueue< T, Compare >::data ( ) const

inline

Definition at line 16 of file DynamicPriorityQueue.h.

Here is the caller graph for this function:

end() [1/2]

template<typename T , typename Compare = std::less<T>>

auto smtrat::PriorityQueue< T, Compare >::end ( )

inline

Definition at line 34 of file DynamicPriorityQueue.h.

Here is the call graph for this function:

end() [2/2]

template<typename T , typename Compare = std::less<T>>

auto smtrat::PriorityQueue< T, Compare >::end ( ) const

inline

Definition at line 31 of file DynamicPriorityQueue.h.

Here is the call graph for this function:

Here is the caller graph for this function:

erase() [1/2]

template<typename T , typename Compare = std::less<T>>

auto smtrat::PriorityQueue< T, Compare >::erase ( typename std::vector< T >::const_iterator  it )

inline

Definition at line 37 of file DynamicPriorityQueue.h.

Here is the call graph for this function:

Here is the caller graph for this function:

erase() [2/2]

template<typename T , typename Compare = std::less<T>>

auto smtrat::PriorityQueue< T, Compare >::erase ( typename std::vector< T >::const_iterator  it, typename std::vector< T >::const_iterator  end  )

inline

Definition at line 40 of file DynamicPriorityQueue.h.

Here is the call graph for this function:

find()

template<typename T , typename Compare = std::less<T>>

auto smtrat::PriorityQueue< T, Compare >::find ( const T &  t ) const

inline

Definition at line 22 of file DynamicPriorityQueue.h.

Here is the call graph for this function:

Here is the caller graph for this function:

fix()

template<typename T , typename Compare = std::less<T>>

void smtrat::PriorityQueue< T, Compare >::fix ( )

inline

Definition at line 43 of file DynamicPriorityQueue.h.

Here is the call graph for this function:

Here is the caller graph for this function:

removeIf()

template<typename T , typename Compare = std::less<T>>

template<typename F >

void smtrat::PriorityQueue< T, Compare >::removeIf ( F &&  f )

inline

Definition at line 47 of file DynamicPriorityQueue.h.

Here is the call graph for this function:

Here is the caller graph for this function:

Field Documentation

elements

T std::priority_queue< T >::elements

inherited

STL member.

---

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

• smtrat-cad/utils/DynamicPriorityQueue.h