SMT-RAT  24.02
Toolbox for Strategic and Parallel Satisfiability-Modulo-Theories Solving
smtrat::DynamicPriorityQueue< T, Compare > Class Template Reference

#include <DynamicPriorityQueue.h>

Public Types

using value_type = typename Sequence::value_type
 

Public Member Functions

 DynamicPriorityQueue (const Compare &_comp=Compare())
 
 DynamicPriorityQueue (Sequence &&_seq, const Compare &_comp=Compare())
 
void fix ()
 
bool empty () const
 
std::size_t size () const
 
const T & top () const
 
void push (const T &t)
 
void push (T &&t)
 
template<typename... Args>
void emplace (Args &&... args)
 
void pop ()
 
popTop ()
 

Protected Attributes

Sequence c
 
Compare comp
 

Private Types

using Sequence = std::vector< T >
 

Detailed Description

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

Definition at line 67 of file DynamicPriorityQueue.h.

Member Typedef Documentation

◆ Sequence

template<typename T , typename Compare = std::less<T>>
using smtrat::DynamicPriorityQueue< T, Compare >::Sequence = std::vector<T>
private

Definition at line 68 of file DynamicPriorityQueue.h.

◆ value_type

template<typename T , typename Compare = std::less<T>>
using smtrat::DynamicPriorityQueue< T, Compare >::value_type = typename Sequence::value_type

Definition at line 71 of file DynamicPriorityQueue.h.

Constructor & Destructor Documentation

◆ DynamicPriorityQueue() [1/2]

template<typename T , typename Compare = std::less<T>>
smtrat::DynamicPriorityQueue< T, Compare >::DynamicPriorityQueue ( const Compare &  _comp = Compare())
inlineexplicit

Definition at line 79 of file DynamicPriorityQueue.h.

◆ DynamicPriorityQueue() [2/2]

template<typename T , typename Compare = std::less<T>>
smtrat::DynamicPriorityQueue< T, Compare >::DynamicPriorityQueue ( Sequence &&  _seq,
const Compare &  _comp = Compare() 
)
inlineexplicit

Definition at line 82 of file DynamicPriorityQueue.h.

Member Function Documentation

◆ emplace()

template<typename T , typename Compare = std::less<T>>
template<typename... Args>
void smtrat::DynamicPriorityQueue< T, Compare >::emplace ( Args &&...  args)
inline

Definition at line 115 of file DynamicPriorityQueue.h.

◆ empty()

template<typename T , typename Compare = std::less<T>>
bool smtrat::DynamicPriorityQueue< T, Compare >::empty ( ) const
inline

Definition at line 92 of file DynamicPriorityQueue.h.

◆ fix()

template<typename T , typename Compare = std::less<T>>
void smtrat::DynamicPriorityQueue< T, Compare >::fix ( )
inline

Definition at line 88 of file DynamicPriorityQueue.h.

◆ pop()

template<typename T , typename Compare = std::less<T>>
void smtrat::DynamicPriorityQueue< T, Compare >::pop ( )
inline

Definition at line 120 of file DynamicPriorityQueue.h.

Here is the caller graph for this function:

◆ popTop()

template<typename T , typename Compare = std::less<T>>
T smtrat::DynamicPriorityQueue< T, Compare >::popTop ( )
inline

Definition at line 124 of file DynamicPriorityQueue.h.

Here is the call graph for this function:

◆ push() [1/2]

template<typename T , typename Compare = std::less<T>>
void smtrat::DynamicPriorityQueue< T, Compare >::push ( const T &  t)
inline

Definition at line 104 of file DynamicPriorityQueue.h.

◆ push() [2/2]

template<typename T , typename Compare = std::less<T>>
void smtrat::DynamicPriorityQueue< T, Compare >::push ( T &&  t)
inline

Definition at line 109 of file DynamicPriorityQueue.h.

◆ size()

template<typename T , typename Compare = std::less<T>>
std::size_t smtrat::DynamicPriorityQueue< T, Compare >::size ( ) const
inline

Definition at line 96 of file DynamicPriorityQueue.h.

◆ top()

template<typename T , typename Compare = std::less<T>>
const T& smtrat::DynamicPriorityQueue< T, Compare >::top ( ) const
inline

Definition at line 100 of file DynamicPriorityQueue.h.

Here is the caller graph for this function:

Field Documentation

◆ c

template<typename T , typename Compare = std::less<T>>
Sequence smtrat::DynamicPriorityQueue< T, Compare >::c
protected

Definition at line 74 of file DynamicPriorityQueue.h.

◆ comp

template<typename T , typename Compare = std::less<T>>
Compare smtrat::DynamicPriorityQueue< T, Compare >::comp
protected

Definition at line 75 of file DynamicPriorityQueue.h.


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