The header <deque>: standard C/C++ Export

@article{citeulike:5119022, abstract = {A deque is thus as good as a list for implementing a first-in first-out (FIFO) queue or a last-in first-out (LIFO) queue, also known as a stack. It is not as good as a list for implementing a priority queue, because it takes longer on average to insert a new item at an arbitrary place — linear time versus constant time. If you need random access to the elements of a controlled sequence, however, a deque beats a list any day.}, address = {, USA}, author = {Plauger, P. J.}, citeulike-article-id = {5119022}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=252333.252334}, citeulike-linkout-1 = {http://www.ddj.com/cpp/184403309?pgno=2}, issn = {1075-2838}, journal = {C/C++ Users J.}, keywords = {code, cplusplus, deque, header, programming, sample, source, standard, stl}, month = {March}, number = {3}, pages = {8--22}, posted-at = {2009-07-11 17:51:31}, priority = {2}, publisher = {CMP Media, Inc.}, title = {The header {\tt <deque>}: standard C/C++}, url = {http://portal.acm.org/citation.cfm?id=252333.252334}, volume = {15}, year = {1997} }

TY - JOUR ID - citeulike:5119022 L3 - citeulike-article-id:5119022 N2 - A deque is thus as good as a list for implementing a first-in first-out (FIFO) queue or a last-in first-out (LIFO) queue, also known as a stack. It is not as good as a list for implementing a priority queue, because it takes longer on average to insert a new item at an arbitrary place — linear time versus constant time. If you need random access to the elements of a controlled sequence, however, a deque beats a list any day. IS - 3 JF - C/C++ Users J. SN - 1075-2838 AD - , USA EP - 22 TI - The header {\tt <deque>}: standard C/C++ PB - CMP Media, Inc. VL - 15 SP - 8 KW - code KW - cplusplus KW - deque KW - header KW - programming KW - sample KW - source KW - standard KW - stl AU - Plauger, PJ PY - 1997/03// UR - http://portal.acm.org/citation.cfm?id=252333.252334 ER -