本文导语: C++ Double Ended Queues 成员 erase():removes an element erase syntax: iterator erase( iterator pos ); iterator erase( iterator start, iterator end ); the function erase() erases the element at location pos, or the items between start and end. the return value is an iterator to the e...

c++ double ended queues 成员 erase():removes an element

erase

syntax:


  iterator erase( iterator pos );
  iterator erase( iterator start, iterator end );

the function erase() erases the element at location pos, or the items between start and end. the return value is an iterator to the element just after the last one erased.

您可能感兴趣的文章:

本站(WWW.)旨在分享和传播互联网科技相关的资讯和技术，将尽最大努力为读者提供更好的信息聚合和浏览方式。
本站(WWW.)站内文章除注明原创外，均为转载,整理或搜集自网络.欢迎任何形式的转载，转载请注明出处.
转载请注明：文章转载自:[169IT-IT技术资讯]
本文标题:C++ Double Ended Queues 成员 erase():removes an element

C++ Double Ended Queues 成员 pop_back():removes the last element

C++ Double Ended Queues 成员 begin():returns an iterator to the first element

C++ Double Ended Queues 成员 insert():insert elements into the dequeue

C++ Double Ended Queues 成员 size():return the number of elements in the dequeue

C++ Double Ended Queues 成员 max_size():returns the maximum elements that the dequeue can hold

C++ Double Ended Queues 成员 push_front():add an element to the front of the dequeue

C++ Double Ended Queues 成员 push_back():add an element to the end of the dequeue