The sample code below illustrates how to use the deque::size
and deque::resize
STL functions in Visual C++.
Required Header:
<deque>
size_type size() const;
void resize(size_type n, T x = T());
size_type max_size() const;
Note: The class/parameter names in the prototype do not match the version in the header file. Some have been modified to improve readability.
Description:
The member function size returns the length of the controlled sequence. The member function resize ensures that size() henceforth returns n. If it must make the controlled sequence longer, it appends elements with value x. If no value is supplied, the default value depends upon the type. For example, if it is a deque of chars, the default is a blank. If it is a deque of ints, the default is zero. The member function max_size returns the length of the longest sequence that the object can control.
Sample Code:
//////////////////////////////////////////////////////////////////////
//
// Compile options needed: -GX
//
// deque.cpp :
//
// Functions:
//
// size
// resize
// max_size
// begin
// end
//////////////////////////////////////////////////////////////////////
/* Compile options needed:-GX
*/
#include <iostream>
#include <deque>
using namespace std;
typedef deque<char > CHARDEQUE;
void print_contents (CHARDEQUE deque, char*);
void main()
{
//create a with A, B, C and D
CHARDEQUE a;
a.push_back('A');
a.push_back('B');
a.push_back('C');
a.push_back('D');
//print out the contents
print_contents (a,"a");
cout <<"max_size of a is " <<a.max_size() <<endl;
cout <<"size of a is " <<a.size() <<endl;
//let us increase the size to 10
// and set the new elements to be 'X'
a.resize(10,'X');
print_contents (a,"a");
cout <<"size of a is " <<a.size() <<endl;
//let us resize it to 5
a.resize(5);
print_contents (a,"a");
cout <<"size of a is " <<a.size() <<endl;
cout <<"max_size of a is still " <<a.max_size() <<endl;
}
//function to print the contents of deque
void print_contents (CHARDEQUE deque, char *name)
{
CHARDEQUE::iterator pdeque;
cout <<"The contents of "<< name <<" : ";
for(pdeque = deque.begin();
pdeque != deque.end();
pdeque++)
{
cout << *pdeque <<" " ;
}
cout<<endl;
}
Program Output is:
The contents of a : A B C D
max_size of a is 4294967295
size of a is 4
The contents of a : A B C D X X X X X X
size of a is 10
The contents of a : A B C D X
size of a is 5
max_size of a is still 4294967295