14 std::lock_guard<std::mutex>
lock;
28 return a.getIndex() > b.getIndex();
32template<
typename T,
typename IT,
typename L>
47 auto val =
queue.top();
72 return a->getIndex() > b->getIndex();
76template<
typename T,
typename IT,
typename L>
91 auto val =
queue.top();
MinHeapFakeLocker(std::mutex &mut)
Definition: MinHeap.h:20
std::mutex queue_mutex
Definition: MinHeap.h:63
std::priority_queue< T, std::vector< T >, MinHeapComparator< T > > queue
Definition: MinHeap.h:62
IT nextIndex
Definition: MinHeap.h:64
T pop(void)
Definition: MinHeap.h:42
size_t size(void)
Definition: MinHeap.h:56
MinHeap()
Definition: MinHeap.h:36
void push(T val)
Definition: MinHeap.h:37
MinHeapLocker(std::mutex &mut)
Definition: MinHeap.h:11
std::lock_guard< std::mutex > lock
Definition: MinHeap.h:14
MinHeapPtr()
Definition: MinHeap.h:80
std::priority_queue< T *, std::vector< T * >, MinHeapPtrComparator< T > > queue
Definition: MinHeap.h:106
void push(T *val)
Definition: MinHeap.h:81
std::mutex queue_mutex
Definition: MinHeap.h:107
T * pop(void)
Definition: MinHeap.h:86
IT nextIndex
Definition: MinHeap.h:108
size_t size(void)
Definition: MinHeap.h:100
Copyright (C) 2016-2023 Grok Image Compression Inc.
Definition: ICacheable.h:20
bool operator()(const T a, const T b) const
Definition: MinHeap.h:26
bool operator()(const T *a, const T *b) const
Definition: MinHeap.h:70