A simple class that supports fast access and simple function to remove the first element in queue.

hashable-queue is a hybrid class of queue and unordered_map. It provides most necessary functions to maintain a queue that is capable of random access by key.

bool empty() const;
size_t size() const;
value_type &front();
value_type &back();
void pop();
value_type &operator[](const key_type &key);
value_type &at(const key_type &key);

A small test can be done with below script

mkdir build
cd build
cmake ../test
make
./Test_Hash_Queue