c++泛型算法（C++ generic algorithms）.docVIP

c++泛型算法（C++ generic algorithms） Object search algorithm 1. simple search algorithm Find (beg, end, Val); search the input iterator range Val, if found return iterators to Val, and return to the off the end iterator Count (beg, end, Val); search the input iterator range of Val, the number of returns in the range of up to val Find_if (beg, end, unarypred); in the input iterator range, the predicate returns the first unarypred iterator really elements, if there is no return end Count_if (beg, end, unarypred); in the input iterator range, each element of the application of unarypred, and returns the number of elements for which unarypred is true. 2. to find one of many values of the algorithm Find_first_of (beg1, end1, beg2, end2); return of any element from the second range in the first range of the first appearance of the iterator, if you can not find to return end Find_first_of (beg1, end1, beg2, end2, binarypred); using the binarypred comparison from the two elements of the sequence, the first return to the first in the range Iterator: when the element from the second range and an element of the application of binarypred, binarypred is true. If no such element exists, it returns end Find_end (beg1, end1, beg2, end2); return any element from the second range in the first range of the last occurrence of the iterator, if you can not find to return end Find_end (beg1, end1, beg2, end2, binarypred); using the binarypred comparison from the two elements of the sequence, the iterator returns the last element of the first range. When the element from the second range and an element of the application of binarypred, binarypred is true. If you can not find to return end 3. algorithms to find a subsequence Adjacent_find (beg, end); return the duplicate elements adjacent to the first. If there are no adjacent duplicate elements, it returns end Adjacent_find (beg, end, binarypred); return elements for which binarypred is true the first pair. If there is no adjacent elements, it