| <!-- |
| Licensed to the Apache Software Foundation (ASF) under one or more |
| contributor license agreements. See the NOTICE file distributed |
| with this work for additional information regarding copyright |
| ownership. The ASF licenses this file to you under the Apache |
| License, Version 2.0 (the License); you may not use this file |
| except in compliance with the License. You may obtain a copy of |
| the License at |
| |
| http://www.apache.org/licenses/LICENSE-2.0 |
| |
| Unless required by applicable law or agreed to in writing, software |
| distributed under the License is distributed on an "AS IS" BASIS, |
| WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or |
| implied. See the License for the specific language governing |
| permissions and limitations under the License. |
| |
| Copyright 1999-2007 Rogue Wave Software, Inc. |
| --> |
| |
| <HTML> |
| <HEAD> |
| <TITLE><algorithm></TITLE> |
| <LINK REL=StyleSheet HREF="../rw.css" TYPE="text/css" TITLE="Apache stdcxx Stylesheet"></HEAD> |
| <BODY BGCOLOR=#FFFFFF> |
| <A HREF="advance.html"><IMG SRC="images/bprev.gif" WIDTH=20 HEIGHT=21 ALT="Previous file" BORDER=O></A><A HREF="noframes.html"><IMG SRC="images/btop.gif" WIDTH=56 HEIGHT=21 ALT="Top of Document" BORDER=O></A><A HREF="booktoc.html"><IMG SRC="images/btoc.gif" WIDTH=56 HEIGHT=21 ALT="Contents" BORDER=O></A><A HREF="tindex.html"><IMG SRC="images/bindex.gif" WIDTH=56 HEIGHT=21 ALT="Index page" BORDER=O></A><A HREF="algorithms.html"><IMG SRC="images/bnext.gif" WIDTH=25 HEIGHT=21 ALT="Next file" BORDER=O></A><DIV CLASS="DOCUMENTNAME"><B>Apache C++ Standard Library Reference Guide</B></DIV> |
| <H2><algorithm></H2> |
| <P><B>Library:</B> <A HREF="2-9.html">Algorithms</A></P> |
| |
| <PRE><HR><B><I>Header</I></B><HR></PRE> |
| |
| <UL> |
| <LI><A HREF="#sec1">Local Index</A></LI> |
| <LI><A HREF="#sec2">Summary</A></LI> |
| <LI><A HREF="#sec3">Synopsis</A></LI> |
| <LI><A HREF="#sec4">See Also</A></LI> |
| <LI><A HREF="#sec5">Standards Conformance</A></LI> |
| </UL> |
| <A NAME="sec1"><H3>Local Index</H3></A> |
| No Entries |
| <A NAME="sec2"><H3>Summary</H3></A> |
| <P> The header <SAMP><algorithm></SAMP> represents the Algorithms library of the C++ Standard Library.</P> |
| <A NAME="sec3"><H3>Synopsis</H3></A> |
| |
| <PRE>namespace std { |
| // lib.alg.nonmodifying, nonmodifying sequence operations: |
| template<class InputIterator, class Function> |
| Function <SAMP><A HREF="for-each.html">for_each</A></SAMP>(InputIterator start, InputIterator finish, |
| Function f); |
| |
| template<class InputIterator, class T> |
| InputIterator <SAMP><A HREF="find.html">find</A></SAMP>(InputIterator start, InputIterator finish, |
| const T& value); |
| |
| template<class InputIterator, class Predicate> |
| InputIterator <SAMP><A HREF="find-if.html">find_if</A></SAMP>(InputIterator start, |
| InputIterator finish, |
| Predicate pred); |
| |
| template<class ForwardIterator1, class ForwardIterator2> |
| ForwardIterator1 |
| <SAMP><A HREF="find-end.html">find_end</A></SAMP>(ForwardIterator1 start1, ForwardIterator1 finish1, |
| ForwardIterator2 start2, ForwardIterator2 finish2); |
| |
| template<class ForwardIterator1, class ForwardIterator2, |
| class BinaryPredicate> |
| ForwardIterator1 |
| find_end(ForwardIterator1 start1, ForwardIterator1 finish1, |
| ForwardIterator2 start2, ForwardIterator2 finish2, |
| BinaryPredicate binary_pred); |
| |
| template<class ForwardIterator1, class ForwardIterator2> |
| ForwardIterator1 |
| <SAMP><A HREF="find-first-of.html">find_first_of</A></SAMP>(ForwardIterator1 start1, |
| ForwardIterator1 finish1, |
| ForwardIterator2 start2, |
| ForwardIterator2 finish2); |
| |
| template<class ForwardIterator1, class ForwardIterator2, |
| class BinaryPredicate> |
| ForwardIterator1 |
| find_first_of(ForwardIterator1 start1, |
| ForwardIterator1 finish1, |
| ForwardIterator2 start2, |
| ForwardIterator2 finish2, |
| BinaryPredicate binary_pred); |
| |
| template<class ForwardIterator> |
| ForwardIterator <SAMP><A HREF="adjacent-find.html">adjacent_find</A></SAMP>(ForwardIterator start, |
| ForwardIterator finish); |
| |
| template<class ForwardIterator, class BinaryPredicate> |
| ForwardIterator adjacent_find(ForwardIterator start, |
| ForwardIterator finish, |
| BinaryPredicate binary_pred); |
| |
| template<class InputIterator, class T> |
| typename iterator_traits<InputIterator>::difference_type |
| <SAMP><A HREF="count.html">count</A></SAMP>(InputIterator start, InputIterator finish, |
| const T& value); |
| |
| template<class InputIterator, class Predicate> |
| typename iterator_traits<InputIterator>::difference_type |
| <SAMP><A HREF="count.html">count_if</A></SAMP>(InputIterator start, InputIterator finish, |
| Predicate pred); |
| |
| template<class InputIterator1, class InputIterator2> |
| pair<InputIterator1, InputIterator2> |
| <SAMP><A HREF="mismatch.html">mismatch</A></SAMP>(InputIterator1 start1, InputIterator1 finish1, |
| InputIterator2 start2); |
| |
| template<class InputIterator1, class InputIterator2, |
| class BinaryPredicate> |
| pair<InputIterator1, InputIterator2> |
| mismatch(InputIterator1 start1, InputIterator1 finish1, |
| InputIterator2 start2, BinaryPredicate binary_pred); |
| |
| template<class InputIterator1, class InputIterator2> |
| bool <SAMP><A HREF="equal.html">equal</A></SAMP>(InputIterator1 start1, InputIterator1 finish1, |
| InputIterator2 start2); |
| |
| template<class InputIterator1, class InputIterator2, |
| class BinaryPredicate> |
| bool equal(InputIterator1 start1, InputIterator1 finish1, |
| InputIterator2 start2, BinaryPredicate binary_pred); |
| |
| template<class ForwardIterator1, class ForwardIterator2> |
| ForwardIterator1 <SAMP><A HREF="search.html">search</A></SAMP>(ForwardIterator1 start1, |
| ForwardIterator1 finish1, |
| ForwardIterator2 start2, |
| ForwardIterator2 finish2); |
| |
| template<class ForwardIterator1, class ForwardIterator2, |
| class BinaryPredicate> |
| ForwardIterator1 search(ForwardIterator1 start1, |
| ForwardIterator1 finish1, |
| ForwardIterator2 start2, |
| ForwardIterator2 finish2, |
| BinaryPredicate binary_pred); |
| |
| template<class ForwardIterator, class Size, class T> |
| ForwardIterator <SAMP><A HREF="search.html">search_n</A></SAMP>(ForwardIterator start, |
| ForwardIterator finish, |
| Size count, |
| const T& value); |
| |
| template<class ForwardIterator, class Size, class T, |
| class BinaryPredicate> |
| ForwardIterator1 search_n(ForwardIterator start, |
| ForwardIterator finish, |
| Size count, |
| const T& value, |
| BinaryPredicate binary_pred); |
| |
| // lib.alg.modifying.operations, |
| // modifying sequence operations: |
| // lib.alg.copy, copy: |
| template<class InputIterator, class OutputIterator> |
| OutputIterator <SAMP><A HREF="copy.html">copy</A></SAMP>(InputIterator start, InputIterator finish, |
| OutputIterator result); |
| |
| template<class BidirectionalIterator1, |
| class BidirectionalIterator2> |
| BidirectionalIterator2 |
| <SAMP><A HREF="copy.html">copy_backward</A></SAMP>(BidirectionalIterator1 start, |
| BidirectionalIterator1 finish, |
| BidirectionalIterator2 result); |
| |
| // lib.alg.swap, swap: |
| template<class T> void <SAMP><A HREF="swap.html">swap</A></SAMP>(T& a, T& b); |
| |
| template<class ForwardIterator1, class ForwardIterator2> |
| ForwardIterator2 <SAMP><A HREF="swap-ranges.html">swap_ranges</A></SAMP>(ForwardIterator1 start1, |
| ForwardIterator1 finish1, |
| ForwardIterator2 start2); |
| |
| template<class ForwardIterator1, class ForwardIterator2> |
| void <SAMP><A HREF="iter-swap.html">iter_swap</A></SAMP>(ForwardIterator1 a, ForwardIterator2 b); |
| |
| template<class InputIterator, class OutputIterator, |
| class UnaryOperation> |
| OutputIterator <SAMP><A HREF="transform.html">transform</A></SAMP>(InputIterator start, |
| InputIterator finish, |
| OutputIterator result, |
| UnaryOperation op); |
| |
| template<class InputIterator1, |
| class InputIterator2, |
| class OutputIterator, |
| class BinaryOperation> |
| OutputIterator transform(InputIterator1 start1, |
| InputIterator1 finish1, |
| InputIterator2 start2, |
| OutputIterator result, |
| BinaryOperation binary_op); |
| |
| template<class ForwardIterator, class T> |
| void <SAMP><A HREF="replace.html">replace</A></SAMP>(ForwardIterator start, ForwardIterator finish, |
| const T& old_value, const T& new_value); |
| |
| template<class ForwardIterator, class Predicate, class T> |
| void <SAMP><A HREF="replace-if.html">replace_if</A></SAMP>(ForwardIterator start, ForwardIterator finish, |
| Predicate pred, const T& new_value); |
| |
| template<class InputIterator, class OutputIterator, class T> |
| OutputIterator <SAMP><A HREF="replace-copy.html">replace_copy</A></SAMP>(InputIterator start, |
| InputIterator finish, |
| OutputIterator result, |
| const T& old_value, |
| const T& new_value); |
| |
| template<class Iterator, class OutputIterator, |
| class Predicate, class T> |
| OutputIterator <SAMP><A HREF="replace-copy-if.html">replace_copy_if</A></SAMP>(Iterator start, |
| Iterator finish, |
| OutputIterator result, |
| Predicate pred, |
| const T& new_value); |
| |
| template<class ForwardIterator, class T> |
| void <SAMP><A HREF="fill.html">fill</A></SAMP>(ForwardIterator start, ForwardIterator finish, |
| const T& value); |
| |
| template<class OutputIterator, class Size, class T> |
| void <SAMP><A HREF="fill.html">fill_n</A></SAMP>(OutputIterator start, Size n, const T& value); |
| |
| template<class ForwardIterator, class Generator> |
| void <SAMP><A HREF="generate.html">generate</A></SAMP>(ForwardIterator start, ForwardIterator finish, |
| Generator gen); |
| |
| template<class OutputIterator, class Size, class Generator> |
| void <SAMP><A HREF="generate.html">generate_n</A></SAMP>(OutputIterator start, Size n, |
| Generator gen); |
| |
| template<class ForwardIterator, class T> |
| ForwardIterator <SAMP><A HREF="remove.html">remove</A></SAMP>(ForwardIterator start, |
| ForwardIterator finish, |
| const T& value); |
| |
| template<class ForwardIterator, class Predicate> |
| ForwardIterator <SAMP><A HREF="remove-if.html">remove_if</A></SAMP>(ForwardIterator start, |
| ForwardIterator finish, |
| Predicate pred); |
| |
| template<class InputIterator, class OutputIterator, class T> |
| OutputIterator <SAMP><A HREF="remove-copy.html">remove_copy</A></SAMP>(InputIterator start, |
| InputIterator finish, |
| OutputIterator result, |
| const T& value); |
| |
| template<class InputIterator, class OutputIterator, |
| class Predicate> |
| OutputIterator <SAMP><A HREF="remove-copy-if.html">remove_copy_if</A></SAMP>(InputIterator start, |
| InputIterator finish, |
| OutputIterator result, |
| Predicate pred); |
| |
| template<class ForwardIterator> |
| ForwardIterator <SAMP><A HREF="unique.html">unique</A></SAMP>(ForwardIterator start, |
| ForwardIterator finish); |
| |
| template<class ForwardIterator, class BinaryPredicate> |
| ForwardIterator unique(ForwardIterator start, |
| ForwardIterator finish, |
| BinaryPredicate binary_pred); |
| |
| template<class InputIterator, class OutputIterator> |
| OutputIterator <SAMP><A HREF="unique.html">unique_copy</A></SAMP>(InputIterator start, |
| InputIterator finish, |
| OutputIterator result); |
| |
| template<class InputIterator, class OutputIterator, |
| class BinaryPredicate> |
| OutputIterator unique_copy(InputIterator start, |
| InputIterator finish, |
| OutputIterator result, |
| BinaryPredicate binary_pred); |
| |
| template<class BidirectionalIterator> |
| void <SAMP><A HREF="reverse.html">reverse</A></SAMP>(BidirectionalIterator start, |
| BidirectionalIterator finish); |
| |
| template<class BidirectionalIterator, class OutputIterator> |
| OutputIterator <SAMP><A HREF="reverse-copy.html">reverse_copy</A></SAMP>(BidirectionalIterator start, |
| BidirectionalIterator finish, |
| OutputIterator result); |
| |
| template<class ForwardIterator> |
| void <SAMP><A HREF="rotate.html">rotate</A></SAMP>(ForwardIterator start, ForwardIterator mid, |
| ForwardIterator finish); |
| |
| |
| template<class ForwardIterator, class OutputIterator> |
| OutputIterator <SAMP><A HREF="rotate.html">rotate_copy</A></SAMP>(ForwardIterator start, |
| ForwardIterator mid, |
| ForwardIterator finish, |
| OutputIterator result); |
| |
| template<class RandomAccessIterator> |
| void <SAMP><A HREF="random-shuffle.html">random_shuffle</A></SAMP>(RandomAccessIterator start, |
| RandomAccessIterator finish); |
| |
| template<class RandomAccessIterator, |
| class RandomNumberGenerator> |
| void random_shuffle(RandomAccessIterator start, |
| RandomAccessIterator finish, |
| RandomNumberGenerator& rand); |
| |
| // lib.alg.partitions, partitions: |
| template<class BidirectionalIterator, class Predicate> |
| BidirectionalIterator <SAMP><A HREF="partition.html">partition</A></SAMP>(BidirectionalIterator start, |
| BidirectionalIterator finish, |
| Predicate pred); |
| |
| template<class BidirectionalIterator, class Predicate> |
| BidirectionalIterator |
| <SAMP><A HREF="stable-partition.html">stable_partition</A></SAMP>(BidirectionalIterator start, |
| BidirectionalIterator finish, |
| Predicate pred); |
| |
| // lib.alg.sorting, sorting and related operations: |
| // lib.alg.sort, sorting: |
| template<class RandomAccessIterator> |
| void <SAMP><A HREF="sort.html">sort</A></SAMP>(RandomAccessIterator start, |
| RandomAccessIterator finish); |
| |
| template<class RandomAccessIterator, class Compare> |
| void sort(RandomAccessIterator start, |
| RandomAccessIterator finish, |
| Compare comp); |
| |
| template<class RandomAccessIterator> |
| void <SAMP><A HREF="stable-sort.html">stable_sort</A></SAMP>(RandomAccessIterator start, |
| RandomAccessIterator finish); |
| |
| template<class RandomAccessIterator, class Compare> |
| void stable_sort(RandomAccessIterator start, |
| RandomAccessIterator finish, |
| Compare comp); |
| |
| template<class RandomAccessIterator> |
| void <SAMP><A HREF="partial-sort.html">partial_sort</A></SAMP>(RandomAccessIterator start, |
| RandomAccessIterator mid, |
| RandomAccessIterator finish); |
| |
| template<class RandomAccessIterator, class Compare> |
| void partial_sort(RandomAccessIterator start, |
| RandomAccessIterator mid, |
| RandomAccessIterator finish, |
| Compare comp); |
| |
| template<class InputIterator, class RandomAccessIterator> |
| RandomAccessIterator <SAMP><A HREF="partial-sort-copy.html">partial_sort_copy</A></SAMP>(InputIterator start, |
| InputIterator finish, |
| RandomAccessIterator result_start, |
| RandomAccessIterator result_finish); |
| |
| template<class InputIterator, class RandomAccessIterator, |
| class Compare> |
| RandomAccessIterator partial_sort_copy(InputIterator start, |
| InputIterator finish, |
| RandomAccessIterator result_start, |
| RandomAccessIterator result_finish, |
| Compare comp); |
| |
| template<class RandomAccessIterator> |
| void <SAMP><A HREF="nth-element.html">nth_element</A></SAMP>(RandomAccessIterator start, |
| RandomAccessIterator nth, |
| RandomAccessIterator finish); |
| |
| template<class RandomAccessIterator, class Compare> |
| void nth_element(RandomAccessIterator start, |
| RandomAccessIterator nth, |
| RandomAccessIterator finish, |
| Compare comp); |
| |
| // lib.alg.binary.search, binary search: |
| template<class ForwardIterator, class T> |
| ForwardIterator <SAMP><A HREF="lower-bound.html">lower_bound</A></SAMP>(ForwardIterator start, |
| ForwardIterator finish, |
| const T& value); |
| |
| template<class ForwardIterator, class T, class Compare> |
| ForwardIterator lower_bound(ForwardIterator start, |
| ForwardIterator finish, |
| const T& value, |
| Compare comp); |
| |
| template<class ForwardIterator, class T> |
| ForwardIterator <SAMP><A HREF="upper-bound.html">upper_bound</A></SAMP>(ForwardIterator start, |
| ForwardIterator finish, |
| const T& value); |
| |
| template<class ForwardIterator, class T, class Compare> |
| ForwardIterator upper_bound(ForwardIterator start, |
| ForwardIterator finish, |
| const T& value, |
| Compare comp); |
| |
| template<class ForwardIterator, class T> |
| pair<ForwardIterator, ForwardIterator> |
| <SAMP><A HREF="equal-range.html">equal_range</A></SAMP>(ForwardIterator start, ForwardIterator finish, |
| const T& value); |
| |
| template<class ForwardIterator, class T, class Compare> |
| pair<ForwardIterator, ForwardIterator> |
| equal_range(ForwardIterator start, ForwardIterator finish, |
| const T& value, Compare comp); |
| |
| template<class ForwardIterator, class T> |
| bool <SAMP><A HREF="binary-search.html">binary_search</A></SAMP>(ForwardIterator start, |
| ForwardIterator finish, |
| const T& value); |
| |
| template<class ForwardIterator, class T, class Compare> |
| bool binary_search(ForwardIterator start, |
| ForwardIterator finish, |
| const T& value, |
| Compare comp); |
| |
| // lib.alg.merge, merge: |
| template<class InputIterator1, class InputIterator2, |
| class OutputIterator> |
| OutputIterator <SAMP><A HREF="merge.html">merge</A></SAMP>(InputIterator1 start1, |
| InputIterator1 finish1, |
| InputIterator2 start2, |
| InputIterator2 finish2, |
| OutputIterator result); |
| |
| template<class InputIterator1, class InputIterator2, |
| class OutputIterator, class Compare> |
| OutputIterator merge(InputIterator1 start1, |
| InputIterator1 finish1, |
| InputIterator2 start2, |
| InputIterator2 finish2, |
| OutputIterator result, |
| Compare comp); |
| |
| template<class BidirectionalIterator> |
| void <SAMP><A HREF="inplace-merge.html">inplace_merge</A></SAMP>(BidirectionalIterator start, |
| BidirectionalIterator mid, |
| BidirectionalIterator finish); |
| |
| template<class BidirectionalIterator, class Compare> |
| void inplace_merge(BidirectionalIterator start, |
| BidirectionalIterator mid, |
| BidirectionalIterator finish, |
| Compare comp); |
| |
| // lib.alg.set.operations, set operations: |
| template<class InputIterator1, class InputIterator2> |
| bool <SAMP><A HREF="includes.html">includes</A></SAMP>(InputIterator1 start1, InputIterator1 finish1, |
| InputIterator2 start2, InputIterator2 finish2); |
| |
| template<class InputIterator1, class InputIterator2, |
| class Compare> |
| bool includes(InputIterator1 start1, |
| InputIterator1 finish1, |
| InputIterator2 start2, |
| InputIterator2 finish2, |
| Compare comp); |
| |
| template<class InputIterator1, class InputIterator2, |
| class OutputIterator> |
| OutputIterator <SAMP><A HREF="set-union.html">set_union</A></SAMP>(InputIterator1 start1, |
| InputIterator1 finish1, |
| InputIterator2 start2, |
| InputIterator2 finish2, |
| OutputIterator result); |
| |
| template<class InputIterator1, class InputIterator2, |
| class OutputIterator, class Compare> |
| OutputIterator set_union(InputIterator1 start1, |
| InputIterator1 finish1, |
| InputIterator2 start2, |
| InputIterator2 finish2, |
| OutputIterator result, |
| Compare comp); |
| |
| template<class InputIterator1, class InputIterator2, |
| class OutputIterator> |
| OutputIterator <SAMP><A HREF="set-intersection.html">set_intersection</A></SAMP>(InputIterator1 start1, |
| InputIterator1 finish1, |
| InputIterator2 start2, |
| InputIterator2 finish2, |
| OutputIterator result); |
| |
| template<class InputIterator1, class InputIterator2, |
| class OutputIterator, class Compare> |
| OutputIterator set_intersection(InputIterator1 start1, |
| InputIterator1 finish1, |
| InputIterator2 start2, |
| InputIterator2 finish2, |
| OutputIterator result, |
| Compare comp); |
| |
| template<class InputIterator1, class InputIterator2, |
| class OutputIterator> |
| OutputIterator <SAMP><A HREF="set-difference.html">set_difference</A></SAMP>(InputIterator1 start1, |
| InputIterator1 finish1, |
| InputIterator2 start2, |
| InputIterator2 finish2, |
| OutputIterator result); |
| |
| template<class InputIterator1, class InputIterator2, |
| class OutputIterator, class Compare> |
| OutputIterator set_difference(InputIterator1 start1, |
| InputIterator1 finish1, |
| InputIterator2 start2, |
| InputIterator2 finish2, |
| OutputIterator result, |
| Compare comp); |
| |
| template<class InputIterator1, class InputIterator2, |
| class OutputIterator> |
| OutputIterator <SAMP><A HREF="set-symmetric-difference.html">set_symmetric_difference</A></SAMP>( |
| InputIterator1 start1, |
| InputIterator1 finish1, |
| InputIterator2 start2, |
| InputIterator2 finish2, |
| OutputIterator result); |
| |
| template<class InputIterator1, class InputIterator2, |
| class OutputIterator, class Compare> |
| OutputIterator set_symmetric_difference( |
| InputIterator1 start1, |
| InputIterator1 finish1, |
| InputIterator2 start2, |
| InputIterator2 finish2, |
| OutputIterator result, |
| Compare comp); |
| |
| // lib.alg.heap.operations, heap operations: |
| template<class RandomAccessIterator> |
| void <SAMP><A HREF="push-heap.html">push_heap</A></SAMP>(RandomAccessIterator start, |
| RandomAccessIterator finish); |
| |
| template<class RandomAccessIterator, class Compare> |
| void push_heap(RandomAccessIterator start, |
| RandomAccessIterator finish, |
| Compare comp); |
| |
| template<class RandomAccessIterator> |
| void <SAMP><A HREF="pop-heap.html">pop_heap</A></SAMP>(RandomAccessIterator start, |
| RandomAccessIterator finish); |
| |
| template<class RandomAccessIterator, class Compare> |
| void pop_heap(RandomAccessIterator start, |
| RandomAccessIterator finish, |
| Compare comp); |
| |
| template<class RandomAccessIterator> |
| void <SAMP><A HREF="make-heap.html">make_heap</A></SAMP>(RandomAccessIterator start, |
| RandomAccessIterator finish); |
| |
| template<class RandomAccessIterator, class Compare> |
| void make_heap(RandomAccessIterator start, |
| RandomAccessIterator finish, |
| Compare comp); |
| |
| template<class RandomAccessIterator> |
| void <SAMP><A HREF="sort-heap.html">sort_heap</A></SAMP>(RandomAccessIterator start, |
| RandomAccessIterator finish); |
| |
| template<class RandomAccessIterator, class Compare> |
| void sort_heap(RandomAccessIterator start, |
| RandomAccessIterator finish, |
| Compare comp); |
| |
| // lib.alg.min.max, minimum and maximum: |
| template<class T> const T& <SAMP><A HREF="min.html">min</A></SAMP>(const T& a, const T& b); |
| |
| template<class T, class Compare> |
| const T& min(const T& a, const T& b, Compare comp); |
| |
| template<class T> const T& <SAMP><A HREF="max.html">max</A></SAMP>(const T& a, const T& b); |
| |
| template<class T, class Compare> |
| const T& max(const T& a, const T& b, Compare comp); |
| |
| template<class ForwardIterator> |
| ForwardIterator <SAMP><A HREF="min-element.html">min_element</A></SAMP>(ForwardIterator start, |
| ForwardIterator finish); |
| |
| |
| template<class ForwardIterator, class Compare> |
| ForwardIterator min_element(ForwardIterator start, |
| ForwardIterator finish, |
| Compare comp); |
| |
| template<class ForwardIterator> |
| ForwardIterator <SAMP><A HREF="max-element.html">max_element</A></SAMP>(ForwardIterator start, |
| ForwardIterator finish); |
| |
| template<class ForwardIterator, class Compare> |
| ForwardIterator max_element(ForwardIterator start, |
| ForwardIterator finish, |
| Compare comp); |
| |
| template<class InputIterator1, class InputIterator2> |
| bool <SAMP><A HREF="lexicographical-compare.html">lexicographical_compare</A></SAMP>(InputIterator1 start1, |
| InputIterator1 finish1, |
| InputIterator2 start2, |
| InputIterator2 finish2); |
| |
| template<class InputIterator1, class InputIterator2, |
| class Compare> |
| bool lexicographical_compare(InputIterator1 start1, |
| InputIterator1 finish1, |
| InputIterator2 start2, |
| InputIterator2 finish2, |
| Compare comp); |
| |
| // lib.alg.permutation.generators, permutations |
| template<class BidirectionalIterator> |
| bool <SAMP><A HREF="next-permutation.html">next_permutation</A></SAMP>(BidirectionalIterator start, |
| BidirectionalIterator finish); |
| |
| template<class BidirectionalIterator, class Compare> |
| bool next_permutation(BidirectionalIterator start, |
| BidirectionalIterator finish, |
| Compare comp); |
| |
| template<class BidirectionalIterator> |
| bool <SAMP><A HREF="prev-permutation.html">prev_permutation</A></SAMP>(BidirectionalIterator start, |
| BidirectionalIterator finish); |
| |
| template<class BidirectionalIterator, class Compare> |
| bool prev_permutation(BidirectionalIterator start, |
| BidirectionalIterator finish, |
| Compare comp); |
| } |
| </PRE> |
| <A NAME="sec4"><H3>See Also</H3></A> |
| <P><A HREF="algorithms.html">Algorithms</A>, <SAMP><A HREF="for-each.html">for_each()</A></SAMP>, <SAMP><A HREF="find.html">find()</A></SAMP>, <SAMP><A HREF="find-if.html">find_if()</A></SAMP>, <SAMP><A HREF="find-end.html">find_end()</A></SAMP>, <SAMP><A HREF="find-first-of.html">find_first_of()</A></SAMP>, <SAMP><A HREF="adjacent-find.html">adjacent_find()</A></SAMP>, <SAMP><A HREF="count.html">count()</A></SAMP>, <SAMP><A HREF="count.html">count_if()</A></SAMP>, <SAMP><A HREF="mismatch.html">mismatch()</A></SAMP>, <SAMP><A HREF="equal.html">equal()</A></SAMP>, <SAMP><A HREF="search.html">search()</A></SAMP>, <SAMP><A HREF="search.html">search_n()</A></SAMP>, <SAMP><A HREF="copy.html">copy()</A></SAMP>, <SAMP><A HREF="copy.html">copy_backward()</A></SAMP>, <SAMP><A HREF="swap.html">swap()</A></SAMP>, <SAMP><A HREF="swap-ranges.html">swap_ranges()</A></SAMP>, <SAMP><A HREF="iter-swap.html">iter_swap()</A></SAMP>, <SAMP><A HREF="transform.html">transform()</A></SAMP>, <SAMP><A HREF="replace.html">replace()</A></SAMP>, <SAMP><A HREF="replace-if.html">replace_if()</A></SAMP>, <SAMP><A HREF="replace-copy.html">replace_copy()</A></SAMP>, <SAMP><A HREF="replace-copy-if.html">replace_copy_if()</A></SAMP>, <SAMP><A HREF="fill.html">fill()</A></SAMP>, <SAMP><A HREF="fill.html">fill_n()</A></SAMP>, <SAMP><A HREF="generate.html">generate()</A></SAMP>, <SAMP><A HREF="generate.html">generate_n()</A></SAMP>, <SAMP><A HREF="remove.html">remove()</A></SAMP>, <SAMP><A HREF="remove-if.html">remove_if()</A></SAMP>, <SAMP><A HREF="remove-copy.html">remove_copy()</A></SAMP>, <SAMP><A HREF="remove-copy-if.html">remove_copy_if()</A></SAMP>, <SAMP><A HREF="unique.html">unique()</A></SAMP>, <SAMP><A HREF="unique.html">unique_copy()</A></SAMP>, <SAMP><A HREF="reverse.html">reverse()</A></SAMP>, <SAMP><A HREF="reverse-copy.html">reverse_copy()</A></SAMP>, <SAMP><A HREF="rotate.html">rotate()</A></SAMP>, <SAMP><A HREF="rotate.html">rotate_copy()</A></SAMP>, <SAMP><A HREF="random-shuffle.html">random_shuffle()</A></SAMP>, <SAMP><A HREF="partition.html">partition()</A></SAMP>, <SAMP><A HREF="stable-partition.html">stable_partition()</A></SAMP>, <SAMP><A HREF="sort.html">sort()</A></SAMP>, <SAMP><A HREF="partial-sort.html">partial_sort()</A></SAMP>, <SAMP><A HREF="partial-sort-copy.html">partial_sort_copy()</A></SAMP>, <SAMP><A HREF="nth-element.html">nth_element()</A></SAMP>, <SAMP><A HREF="lower-bound.html">lower_bound()</A></SAMP>, <SAMP><A HREF="upper-bound.html">upper_bound()</A></SAMP>, <SAMP><A HREF="equal-range.html">equal_range()</A></SAMP>, <SAMP><A HREF="binary-search.html">binary_search()</A></SAMP>, <SAMP><A HREF="merge.html">merge()</A></SAMP>, <SAMP><A HREF="inplace-merge.html">inplace_merge()</A></SAMP>, <SAMP><A HREF="includes.html">includes()</A></SAMP>, <SAMP><A HREF="set-union.html">set_union()</A></SAMP>, <SAMP><A HREF="set-intersection.html">set_intersection()</A></SAMP>, <SAMP><A HREF="set-difference.html">set_difference()</A></SAMP>, <SAMP><A HREF="set-symmetric-difference.html">set_symmetric_difference()</A></SAMP>, <SAMP><A HREF="push-heap.html">push_heap()</A></SAMP>, <SAMP><A HREF="pop-heap.html">pop_heap()</A></SAMP>, <SAMP><A HREF="make-heap.html">make_heap()</A></SAMP>, <SAMP><A HREF="sort-heap.html">sort_heap()</A></SAMP>, <SAMP><A HREF="min.html">min()</A></SAMP>, <SAMP><A HREF="max.html">max()</A></SAMP>, <SAMP><A HREF="min-element.html">min_element()</A></SAMP>, <SAMP><A HREF="max-element.html">max_element()</A></SAMP>, <SAMP><A HREF="lexicographical-compare.html">lexicographical_compare()</A></SAMP>, <SAMP><A HREF="next-permutation.html">next_permutation()</A></SAMP>, <SAMP><A HREF="prev-permutation.html">prev_permutation()</A></SAMP></P> |
| <A NAME="sec5"><H3>Standards Conformance</H3></A> |
| <P><I>ISO/IEC 14882:1998 -- International Standard for Information Systems --Programming Language C++. Section 25</I></P> |
| |
| <BR> |
| <HR> |
| <A HREF="advance.html"><IMG SRC="images/bprev.gif" WIDTH=20 HEIGHT=21 ALT="Previous file" BORDER=O></A><A HREF="noframes.html"><IMG SRC="images/btop.gif" WIDTH=56 HEIGHT=21 ALT="Top of Document" BORDER=O></A><A HREF="booktoc.html"><IMG SRC="images/btoc.gif" WIDTH=56 HEIGHT=21 ALT="Contents" BORDER=O></A><A HREF="tindex.html"><IMG SRC="images/bindex.gif" WIDTH=56 HEIGHT=21 ALT="Index page" BORDER=O></A><A HREF="algorithms.html"><IMG SRC="images/bnext.gif" WIDTH=20 HEIGHT=21 ALT="Next file" BORDER=O></A> |
| |
| <!-- Google Analytics tracking code --> |
| <script src="http://www.google-analytics.com/urchin.js" type="text/javascript"> |
| </script> |
| <script type="text/javascript"> |
| _uacct = "UA-1775151-1"; |
| urchinTracker(); |
| </script> |
| <!-- end of Google Analytics tracking code --> |
| |
| </BODY> |
| </HTML> |