C++ Programming Code Examples C++ > Visual C++ 5.0 Standard C++ Library Code Examples 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. 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, Page 1 Page 2 Page 3 Page 8