本文导语: C++ Double Ended Queues 成员 rend():returns a reverse iterator to the beginning of the dequeue rend syntax: reverse_iterator rend(); the function rend() returns a reverse iterator to the front of the double-ended queue.

c++ double ended queues 成员 rend():returns a reverse iterator to the beginning of the dequeue

rend

syntax:


  reverse_iterator rend();

the function rend() returns a reverse iterator to the front of the double-ended queue.

您可能感兴趣的文章:

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

C++ Double Ended Queues 成员 assign():set the values of the dequeue

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

C++ Double Ended Queues 成员 end():returns an iterator to the end of the queue

C++ Double Ended Queues 成员 rbegin():returns a reverse iterator to the end of 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

C++ Double Ended Queues 成员 pop_front():removes the first element

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

returns iis7站长之家

C++ Double Ended Queues 成员 get_allocator():returns the dequeue's allocator

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