Insert the specified item into the front of this queue.
Declared in <bdlc_queue.h>
void
pushFront(T const& item);Insert the specified item into the front of this queue efficiently (in O[1]time when memory reallocation is not required). Note that this function is logically equivalent to (but generally more efficient than): ` insert(0, item); `
| Name | Description |
|---|---|
| item | value to insert at the front |