STL - queue/stack

queue();
queue( const Container& con );
TYPE front();
TYPE back();
void push( const TYPE &val );
void pop();
bool empty();
size_type size();
void swap( queue &from );


stack();
stack( const Container& con );
TYPE top();
void push( const TYPE &val );
void pop();
bool empty();
size_type size();
void swap( stack &from );


priority_queue( const Compare& cmp = Compare(), const Container& c = Container() );
priority_queue( input_iterator start, input_iterator end, const Compare& comp = Compare(), const Container& c = Container() );
TYPE top();
void push( const TYPE &val );
void pop();
bool empty();
size_type size();
void swap( priority_queue &from );

posted @ 2013-05-08 21:35  Leung文  阅读(140)  评论(0编辑  收藏  举报