Hello,
I'm wondering whether the STL defines a data structure with
the following features:
o provides push_front() and pop_back() (like std::list) to
implement a FIFO buffer.
o allows fast lookup (like std::map) so I can easily search
for a specific item in the buffer.
I suppose I could always use std::list and write my own search
function, but I'm asking in case I've overlooked something.
(The keys would be int, and the values would be character arrays.)
Regards.