queue library 의 queue class
template <class Type, class Container = deque <Type>>
class queue
queue();
explicit queue(const container_type& right);
int main(){
queue<int> q;
}
Name | Description |
---|---|
container_type | queue의 container type |
value_type | container에 저장되는 element type |
size_type | element의 size를 표현하기 위한 unsigned int |
reference | element의 reference type |
const_reference | element의 const reference type |
template <class _Tp, class _Container /*= deque<_Tp>*/>
class _LIBCPP_TEMPLATE_VIS queue
{
public:
typedef _Container container_type;
typedef typename container_type::value_type value_type;
typedef typename container_type::reference reference;
typedef typename container_type::const_reference const_reference;
typedef typename container_type::size_type size_type;
/**
*
*the rest is omitted
*/
}
bool empty() const;
int main(){
queue<int> q;
if(q.empty()) cout<<"true";
}
void push(const Type& val);
void push(const Type&& val);
void pop();
int main(){
queue<int> q;
int x=3;
q.push(3); // void push(const Type&& val);
q.push(x); // void push(const Type& val);
q.pop();
q.pop();
if(q.empty()) cout<<"true";
}
reference front();
const_reference front() const;
reference back();
const_reference back() const;
int main(){
queue<int> q;
int x=3;
q.push(3);
q.push(x);
int& fr = q.front();
int& br = q.back();
int fv = q.front();
int bv = q.back();
q.front()++;
fr++;
if( fr==5 && fv==3 ) cout<<"true";
}
size_type size() const;
int main(){
queue<int> q;
int x=3;
q.push(3);
q.push(x);
int size = q.size();
for(int i=0; i<size; i++){
cout<<i<<" ";
}
}
출처 : https://learn.microsoft.com/ko-kr/cpp/standard-library/queue-class?view=msvc-170