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
Multiset swap - Swaps all the elements of the multiset container
Multiset temp swap - Swaps the contents of container ms1 with contents
Multiset upper bound - Returns a const iterator pointing to the first element
Multiset value comp - Returns an object of type value compare
Numeric accumulate - The accumulate function initializes
Numeric adjacent difference - creates an output sequence that consists
Numeric inner product - adds the product of the input sequences to a total.
Numeric partial sum - Fills a sequence with a running total
Priority queue - container adaptor which allows use of any sequential
Priority queue empty - Returns true if the priority queue container is empty.
Priority queue get allocator - The member function returns allocator.
Priority queue pop - Removes an element with the highest priority
Priority queue priority queue - The default constructor creates an empty
Priority queue push - Inserts object x at the top of the stack.
Priority queue size - Returns the number of objects stored
Priority queue top - Returns a const reference to the element most recently
Queue empty - Returns true if the queue container is empty.
Queue front - Returns a const reference to the first element.
Queue get allocator - The member function returns allocator.
Queue operatoreq - Equality operation on queues
Queue operatorgt - The function returns the result of: q2 < q1
Queue operatorgteq - Returns true if !(q1 < q2).
Queue operatorlt - Returns true if q1 is lexicographically less
Queue operatorlteq - Returns true if !(q1 > q2).
Queue operatorneq - The opposite of equality operation. Returns !(q1 == q2).
Queue pop - Removes an element from the top of the queue
Queue push - Inserts object x at the top of the queue.
Queue queue - The default constructor creates an empty queue.
Queue size - Returns the number of objects stored
Set begin - Returns a const iterator to the first object
Set clear - Erases the elements of the set container.
Set count - Return the number of elements in the set
Set empty - Returns true if the set container is empty.
Set end - Returns a const iterator which points
Set equal range - Returns a pair
Set erase - Removes from the set container
Set find - Returns a const iterator pointing to element key
Set get allocator - The member function returns allocator.
Set insert - Inserts object x in the set, if x is not already
Set key comp - Returns the function object that set
Set lower bound - Returns a const iterator pointing to the first element
Set max size - Returns the maximum number of objects
Set operatoreq - Equality operation on sets
Set operatorgt - Returns true if s2 < s1.
Set operatorgteq - Returns true if !(s1 < s2).
Set operatorlt - Returns true if s1 is lexicographically less
Set operatorlteq - Returns true if !(s1 > s2).
Set operatorneq - The opposite of equality operation. Returns !(s1 == s2)
Set rbegin - Returns a const reverse iterator value
Set rend - Returns a const reverse iterator value
Set set - The default constructor creates an empty set
Set size - Returns the number of objects stored in the set
Set swap - Swaps all the elements of the set container
Set temp swap - Swaps the contents of container s1 with
Set upper bound - Returns a const iterator to the first
Set value comp - Returns an object of type value compare
Stack empty - Returns true if the stack container is empty.
Stack get allocator - The member function returns allocator.
Stack operatoreq - Equality operation on stacks
Stack operatorgt - The function returns the result of: s2 < s1
Stack operatorgteq - Returns true if !(s1 < s2).
Stack operatorlt - Returns true if s1 is lexicographically less
Stack operatorlteq - Returns true if !(s1 > s2).
Stack operatorneq - The opposite of equality operation. Returns !(s1 == s2).
Stack pop - Removes an element from the top of the stack
Stack push - Inserts object x at the top of the stack.
Stack size - Returns the number of objects stored in the stack
Stack stack - The default constructor creates an empty stack.
Stack top - Returns a const reference to the element most recently
The Standard C++ Library Components
Page 1
Page 2
Page 3
Page 5
Privacy Policy
|
Link to Us
|
Links
