Mega Code Archive
Search
.Net
ASP .Net
ASP .Net Tutorial
C#
C# Book
C# by API
C# Tutorial
VB.Net
VB.Net by API
VB.Net Tutorial
Visual C++ .Net
VisualBasic Script
Java
Java
Java Book
Java by API
Java Tutorial
Script
Flash ActionScript
Flex
JavaScript DHTML
JavaScript Reference
JavaScript Tutorial
Database
MSSQL
MSSQL Tutorial
MySQL
MySQL Tutorial
Oracle PLSQL
Oracle PLSQL Tutorial
PostgreSQL
Languages
Android
C
C Tutorial
C++
C++ Tutorial
Delphi
Perl
PHP
Python
Python Tutorial
Ruby
Silverlight
Office
MSOfficeExcel 2007 Tutorial
MSOfficePowerPoint 2007 Tutorial
MSOfficeWord 2007 Tutorial
Data
XML
XML Tutorial
C++ Tutorial
Deque 42 codes
Home
C++ Tutorial
Deque
1 Change size to four elements
2 Change the values of some of deques elements
3 Checking if One Container Is Less Than or Greater Than Another
4 Clear dq by popping elements one at a time
5 Combine insert and end to add elements to a deque
6 Constructing a Container with Values from the Standard Input
7 Create a deque
8 Create an empty deque and then assign it a sequence that is the reverse of deque
9 Create another deque that contains a subrange of dq
10 Create your own stack based on deque
11 Define iterator for deque
12 Deque
13 Deque for char type
14 Deque push_back( value )
15 Deque push_front( value )
16 Dequeint
17 Illustrating the generic search algorithm
18 Initialize deque with 26 copies of the letter x
19 Insert value into every element but the first
20 Print out a deque, reference its content by index
21 Print the contents in reverse order using reverse_iterator and functions rbegin() and rend()
22 Push an element onto the front of deque
23 Push element into deque and print all elements
24 Remove all elements with values less than 50
25 Remove first and last element
26 Resize a deque
27 STL deque
28 Transform deque with boolean function
29 Use assign and push_back, push_front to insert element to a deque
30 Use copy function to print all elements in a deque
31 Use find the search an element in deque
32 Use generic deque to store chars
33 Use generic deque to store integers
34 Use generic deque to store strings
35 Use indexer to add elements to a deque
36 Use insert iterator adaptors to insert one deque into another by way of the copy() algorithm
37 Use iterator and reverse_iterator with deque
38 Use reverse function on deque
39 Use std
40 Use subscript operator to modify element at location 1
41 Use subscript operator to obtain elements of values
42 Using the Front of a Deque