std::queue
cppreference.com
| <queue> 에 정의되어 있음.
|
||
| template< class T, |
||
The std::queue class is a container adapter that gives the programmer the functionality of a queue - specifically, a FIFO (first-in, first-out) data structure.
The class template acts as a wrapper to the underlying container - only a specific set of functions is provided. The queue pushes the elements on the back of the underlying container and pops them from the front.
목차 |
[편집] Template parameters
| T | - | The type of the stored elements. |
| Container | - | The type of the underlying container to use to store the elements. The container must satisfy the requirements of SequenceContainer. Additionally, it must provide the following functions with the usual semantics:
The standard containers std::deque and std::list satisfy these requirements. |
[편집] Member types
| Member type | Definition |
container_type
|
Container
|
value_type
|
Container::value_type
|
size_type
|
Container::size_type
|
reference
|
Container::reference
|
const_reference
|
Container::const_reference
|
[편집] Member functions
queue의 생성자이다. (public member function) | |
queue의 소멸자이다. (public member function) | |
| 컨테이너 어댑터에 값을 할당한다. (public member function) | |
Element access | |
| 첫번째 요소에 접근한다. (public member function) | |
| 마지막 요소에 접근한다. (public member function) | |
Capacity | |
| 현재 컨테이너가 비어있는지 확인한다. (public member function) | |
| 원소의 개수를 반환한다. (public member function) | |
Modifiers | |
| inserts element at the end (public member function) | |
| (C++11) |
끝에 원소를 바로 만들어 삽입한다. (public member function) |
| removes the first element (public member function) | |
| 원소들을 서로 바꾼다 (public member function) | |
Member objects | |
| Container c |
the underlying container (protected member object) |
[편집] Non-member functions
| lexicographically compares the values in the queue (function template) | |
| specializes the std::swap algorithm (function template) |
[편집] Helper classes
| specializes the std::uses_allocator type trait (function template) |
