C++ Codes
Algorithms
Algorithm Analysis in C++
Beginners
Code Snippets
Graphics
Data Structures
File Manipulation
Games
Mathematics
Miscellaneous
Visual C++ Library
C++ > Visual C++ 5.0 Standard C++ Library sample source codes
Deque begin - Returns a const iterator to the first object in the container.
Deque clear - Erases the elements of the deque container
Creates a new empty deque object and copies all the elements of x into the new deque.
Deque empty - Returns true if the deque container is empty.
Returns a const iterator which points just beyond the last object in the container.
Deque erase - Removes from the deque container, the element postioned at it.
Deque front - Returns a const reference to the first element.
Deque get allocator - The member function returns allocator.
Inserts object x at the position specified by iterator it, into the deque container.
Returns the maximum number of objects of type T that can fit in the deque container,
Deque operator index - Returns const reference to the object at position pos.
Deque operatoreq - Equality operation on deques
Deque operatorgt - Returns true if d2 < d1.
Deque operatorgteq - Returns true if !(d1 < d2).
Deque operatorlt - Returns true if d1 is lexicographically less than d2
Deque operatorlteq - Returns true if !(d1 > d2).
Deque operatorneq - The opposite of equality operation. Returns !(d1 == d2)
Deque pop back - Removes an object from the end of the deque container.
Deque pop front - Removes an object from the front of the deque container.
Deque push back - Inserts object x at the end of the deque container.
Deque push front - Inserts object x at the front of the deque container.
Deque rbegin - Returns a const reverse iterator value, which points to the last used
Deque rend - Returns a const reverse iterator value, which points to just before
Deque resize - Forces the container to be of size sz.
Deque size - Returns the number of objects stored in the deque container at a given
Deque swap - Swaps all the elements of the deque container with the elements of x.
Deque temp swap - Swaps the contents of container d1 with contents of container d2.
List assign - Initializes the list container with a set of n copies of object x
List back - Returns a const reference to the last element.
List begin - Returns a const iterator to the first object in the container.
List clear - Erases the elements of the list container.
List empty - Returns true if the list container is empty.
List end - Returns a const iterator which points just beyond the last object
List erase - Removes from the list container, the element postioned at it.
List front - Returns a const reference to the first element.
List get allocator - The member function returns allocator.
List insert - Inserts object x at the position specified by iterator it,
List list - Constructs a list container initialized with n copies of v.
List max size - Returns the maximum number of objects of type T that can fit in the
List merge - Takes the contents of x and transfers them to the current list.
list operatoreq - Equality operation on lists.
List operatorgt - Returns true if l2 < l1.
List operatorgteq - Returns true if !(l1 < l2).
List operatorlt - Returns true if l1 is lexicographically less than l2,
List operatorlteq - Returns true if !(l1 > l2).
List operatorneq - The opposite of equality operation. Returns !(l1 == l2).
List pop back - Removes an object from the end of the list container.
List pop front - Removes an object from the front of the list container.
List push back - Inserts object x at the end of the list container.
List push front - Inserts object x at the front of the list container.
List rbegin - Returns a const reverse iterator value, which points to the last
List remove - Iterates through the current list and deletes any occurence of
List remove if - Erases all elements in the list for which pr(x)
List rend - Returns a const reverse iterator value, which points to
List resize - Forces the container to be of size sz.
List reverse - Reverses the order of the elements the container.
List size - Returns the number of objects stored in the list container at a given time
List sort - Sorts the list according to the operator< of the type T.
List splice - Inserts the contents of list x before position and removes all
List swap - Swaps all the elements of the sort container
List temp swap - Swaps the contents of container l1 with contents
List unique - Removes any duplicate elements from the current list
Map begin - Returns a const iterator to the first object in the container.
Map clear - Erases the elements of the map container.
Map count - Returns the number of elements in the map which match key.
Map empty - Returns true if the map container is empty.
Map end - Returns a const iterator which points just beyond
Map equal range
Map erase - Removes from the map container, the elements in the range
Map find - Returns a const iterator pointing to element key, if key is found
Page 1
Page 3
Page 4
Page 5
Privacy Policy
|
Link to Us
|
Links
