dynamorio::drmemtrace::flexible_queue_t< T, comparator_t, hash_t > Class Template Reference

#include <flexible_queue.h>

Detailed Description

template<typename T, class comparator_t = std::less<T>, class hash_t = std::hash<T>>
class dynamorio::drmemtrace::flexible_queue_t< T, comparator_t, hash_t >

< DrMemtrace tracing + simulation infrastructure namespace. A priority queue with constant-time search and removal from the middle. The type T must support the << operator. We follow std::priority_queue convention where comparator_t(a,b) returning true means that a is lower priority (worse) than b.

---

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

• /home/runner/work/dynamorio/dynamorio/build_release-64/clients/include/drmemtrace/flexible_queue.h