SMT-RAT
24.02
Toolbox for Strategic and Parallel Satisfiability-Modulo-Theories Solving
|
#include <SampleIteratorQueue.h>
Public Member Functions | |
auto | begin () const |
auto | end () const |
template<typename InputIt > | |
void | assign (InputIt begin, InputIt end) |
void | clear () |
template<typename Filter > | |
void | cleanup (Filter &&f) |
bool | empty () const |
Iterator | getNextSample () |
void | addNewSample (Iterator it) |
template<typename InputIt > | |
void | addNewSamples (InputIt begin, InputIt end) |
Iterator | removeNextSample () |
bool | is_consistent () const |
Private Attributes | |
PriorityQueue< Iterator, Comparator > | mQueue |
Definition at line 11 of file SampleIteratorQueue.h.
|
inline |
Definition at line 39 of file SampleIteratorQueue.h.
|
inline |
|
inline |
|
inline |
Definition at line 15 of file SampleIteratorQueue.h.
|
inline |
|
inline |
|
inline |
Definition at line 33 of file SampleIteratorQueue.h.
|
inline |
Definition at line 18 of file SampleIteratorQueue.h.
|
inline |
Definition at line 36 of file SampleIteratorQueue.h.
|
inline |
Definition at line 54 of file SampleIteratorQueue.h.
|
inline |
Definition at line 48 of file SampleIteratorQueue.h.
|
private |
Definition at line 13 of file SampleIteratorQueue.h.