circular_queue Class Reference
Detailed Description
Member Typedef Documentation
Definition at line 249 of file circular_queue.hpp. Const reference to Definition at line 251 of file circular_queue.hpp. Pointer to Definition at line 248 of file circular_queue.hpp. Reference to Definition at line 250 of file circular_queue.hpp. Equivalent to std::size_t. Definition at line 252 of file circular_queue.hpp. The type of object, Definition at line 247 of file circular_queue.hpp. Constructor & Destructor Documentation
Creates a circular_queue.
Definition at line 320 of file circular_queue.hpp. Member Function Documentation
Definition at line 264 of file circular_queue.hpp.
All elements are removed from the queue. Equivalent to Definition at line 269 of file circular_queue.hpp.
Definition at line 266 of file circular_queue.hpp.
Definition at line 354 of file circular_queue.hpp.
Definition at line 363 of file circular_queue.hpp.
Definition at line 267 of file circular_queue.hpp.
Equivalent to
Definition at line 263 of file circular_queue.hpp.
The element at the front of the queue is removed. The element is not destructed and may be returned with
Definition at line 388 of file circular_queue.hpp.
Definition at line 373 of file circular_queue.hpp.
The last element popped from the front of the queue is returned to the front of the queue.
circular_queue<int> queue; queue.push_back(10); queue.push_back(20); assert(queue.front() == 10); queue.pop_front(); assert(queue.front() == 20); queue.putback(); assert(queue.front() == 10); Definition at line 399 of file circular_queue.hpp.
Definition at line 411 of file circular_queue.hpp. Friends And Related Function Documentation
|