A queue for holding the history in which certain members of a set are promoted to the front of the queue before eventually falling off the end of the queue.
More...
#include <platform/types.hh>
#include <utility/vector1.hh>
#include <utility/pointer/ReferenceCount.hh>
|
struct | utility::history_queue_struct |
|
class | utility::recent_history_queue |
| A class for keeping track of a subset of elements in a set that are pushed into a queue in a certain order, and which fall off the end of the queue in ther order in which they arrive. Elements in the set can be bumped to the front of the queue. More...
|
|
|
| utility |
| unresizable vector whose size is known at compile time, which may be allocated on the stack, and which indexes from 1.
|
|
A queue for holding the history in which certain members of a set are promoted to the front of the queue before eventually falling off the end of the queue.
- Author
- Andrew Leaver-Fay (aleav.nosp@m.erfa.nosp@m.y@gma.nosp@m.il.c.nosp@m.om)