|  | SMT-RAT
    24.02
    Toolbox for Strategic and Parallel Satisfiability-Modulo-Theories Solving | 
#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 () | 
| T | popTop () | 
| Protected Attributes | |
| Sequence | c | 
| Compare | comp | 
| Private Types | |
| using | Sequence = std::vector< T > | 
Definition at line 67 of file DynamicPriorityQueue.h.
| 
 | private | 
Definition at line 68 of file DynamicPriorityQueue.h.
| using smtrat::DynamicPriorityQueue< T, Compare >::value_type = typename Sequence::value_type | 
Definition at line 71 of file DynamicPriorityQueue.h.
| 
 | inlineexplicit | 
Definition at line 79 of file DynamicPriorityQueue.h.
| 
 | inlineexplicit | 
Definition at line 82 of file DynamicPriorityQueue.h.
| 
 | inline | 
Definition at line 115 of file DynamicPriorityQueue.h.
| 
 | inline | 
Definition at line 92 of file DynamicPriorityQueue.h.
| 
 | inline | 
Definition at line 88 of file DynamicPriorityQueue.h.
| 
 | inline | 
| 
 | inline | 
| 
 | inline | 
Definition at line 104 of file DynamicPriorityQueue.h.
| 
 | inline | 
Definition at line 109 of file DynamicPriorityQueue.h.
| 
 | inline | 
Definition at line 96 of file DynamicPriorityQueue.h.
| 
 | inline | 
| 
 | protected | 
Definition at line 74 of file DynamicPriorityQueue.h.
| 
 | protected | 
Definition at line 75 of file DynamicPriorityQueue.h.