Pair syntax
Give this one a try later!
, #include <utility>
pair<type1, type2> nameOfPair
EX: make_pair(10, 100) returns a pair object with the first field of 10 and the
second filed of 100
Iterator Adapter: Reverse
Give this one a try later!
operate in reverse
rbegin( )
// returns last element in container
rend( )
//returns position before first element
vector<int>::reverse_iterator rit;
for(rit = v.rbegin( ); rit != v.rend( ); rit++)
vector<int>::const_reverse_iterator crlt;
Vector Constructor Member Methods
Give this one a try later!
Constructor:
vector<int> name;
Copy Constructor:
vector<int> name(SourceName);
, vector<float> name(source.begin( ), source.end( )
// above copies content of source into vector
creating an iterator and loop through a string
Give this one a try later!
for (string::iterator it = alpa.begin( ); it != alpha.end( ); it++)
{
cout << *it;
}
Associative Containers
Give this one a try later!
advantage for searching not sorting
order of data valued based
internally a self-balancing binary search tree
Advantages of deque
Give this one a try later!
possibly larger max_size
massive reallocations are avoided
Give this one a try later!
, #include <utility>
pair<type1, type2> nameOfPair
EX: make_pair(10, 100) returns a pair object with the first field of 10 and the
second filed of 100
Iterator Adapter: Reverse
Give this one a try later!
operate in reverse
rbegin( )
// returns last element in container
rend( )
//returns position before first element
vector<int>::reverse_iterator rit;
for(rit = v.rbegin( ); rit != v.rend( ); rit++)
vector<int>::const_reverse_iterator crlt;
Vector Constructor Member Methods
Give this one a try later!
Constructor:
vector<int> name;
Copy Constructor:
vector<int> name(SourceName);
, vector<float> name(source.begin( ), source.end( )
// above copies content of source into vector
creating an iterator and loop through a string
Give this one a try later!
for (string::iterator it = alpa.begin( ); it != alpha.end( ); it++)
{
cout << *it;
}
Associative Containers
Give this one a try later!
advantage for searching not sorting
order of data valued based
internally a self-balancing binary search tree
Advantages of deque
Give this one a try later!
possibly larger max_size
massive reallocations are avoided
