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
Adjacent find algorithm finds consecutive pairs of matching elements in a sequence.
Binary Search - Returns a boolean value indicating whether or not val was found.
Algorithm copy - Copies elements from one range to another.
Algorithm copy backward - Copy a range of elements backwards to another range.
The count algorithm counts the number of elements in the range [first, last +1)
The count if algorithm counts the number of elements in the range [first, last)
Algorithm equal - Compares two sequences to see if they match.
Algorithm equal range - Returns the lower and upper bounds within a range.
Algorithm fill - Initializes every item in a range to value.
Algorithm fill n - Assign n items to value, starting at position first.
The find algorithm locates the first element in the range [first, last)
Find end algorithm locates, within the range [first1, last1), the last element
Find first of algorithm locates, within the range [first1, last1), the first element
The find if algorithm locates the first element in the range [first, last)
The for each algorithm calls Function F for each element in the range [first, last)
The generate algorithm traverses the range [first,last), assigning to each element
The generate n algorithm traverses the range [first, first + n), assigning to each
Includes algorithm searches for one sequence of values in another sequence of values
The inplace merge algorithm merges two sorted sub-sequences: [first..middle) and
The iter swap algorithm swaps two elements represented by two iterators.
Algorithm lexicographical compare - Lexicographically compare two sequences.
The lower bound algorithm returns the first location in the sequence that value
Algorithm make heap - A heap is a sequence of elements organized like a binary tree
Algorithm max - Returns the maximum of the two items.
Max element algorithm returns the location of the maximum element in the sequence
The merge algorithm merges two sorted sequences: [first1..last1) and [first2..last2)
Algorithm min - Returns the minimum of the two items.
The min element algorithm returns the location of the minimum element
Algorithm mismatch - Search two sequences for a mismatched item.
The next permutation algorithm changes the order of the elements in the range
The nth element algorithm partitions the sequence [first..last) on the value
The partial sort algorithm sorts the smallest N elements, where N = middle - first
The partial sort copy algorithm sorts the smallest N elements, where N = min
The partition algorithm arranges elements in the range [first, last) such that
Algorithm pop heap - A heap is a sequence of elements organized like a binary tree
The prev permutation algorithm changes the order of the elements the range
Algorithm push heap - A heap is a sequence of elements organized like a binary tree
The random shuffle algorithm shuffles the elements of a sequence
Remove algorithm removes all elements that match value from the range (first, last)
Remove copy algorithm copies all elements from the range (first, last) to the range
The remove copy if algorithm copies all elements from the range (first, last)
The remove if algorithm removes all elements from the range (first, last) that cause
The replace algorithm replaces all elements that match old value from the range
The replace copy algorithm copies all elements from the range [first, last)
The replace copy if algorithm copies all elements from the range [first, last) to
The replace if algorithm replaces all elements from the range [first, last)
The reverse algorithm reverses the order of the elements in the range [first, last)
Reverse copy algorithm reverses the order of the elements in the range [first, last)
Rotate algorithm rotates the elements in the range [first, last) to the right by N
The rotate copy algorithm rotates the elements in the range
Algorithm search - search checks whether the sequence in the second range
Algorithm search n searches for a sequence of equal values.
Set difference - Creates a sorted set of elements in the first set that are not in
The intersection of two sets is the set of elements they have in common.
Set symmetric difference - Creates a sorted set of elements in the first set,
A union is a set of containing all unique elements of the source sets.
Sort all elements in the range [first, last) into ascending order.
Algorithm sort heap - A heap is a sequence of elements organized like a binary tree
Stable partition places all elements in the range [first, last) that satisfy
Stable sort - Sort all elements in the range [first, last) into ascending order.
Algorithm swap - Swaps the elements a and b.
Algorithm swap ranges - Swap elements in the range [first1, last1) with elements
Algorithm transform - Generates a sequence of elements by applying a unary function
Unique - Replace all consecutive matching occurences of a value in the range
Unique copy - Copy the sequence [first, last) to a sequence starting at result,
The upper bound algorithm returns the last location in the sequence that value can be
C++ Templates Tutorial
Deque assign - Initializes the deque container with a set of n copies of object x
Deque at - Returns const reference to the object at position pos.
Deque back - Returns a const reference to the last element.
Page 2
Page 3
Page 4
Page 5
Privacy Policy
|
Link to Us
|
Links
