📄 max_element.html
字号:
<HTML><!-- -- Copyright (c) 1996-1999 -- Silicon Graphics Computer Systems, Inc. -- -- Permission to use, copy, modify, distribute and sell this software -- and its documentation for any purpose is hereby granted without fee, -- provided that the above copyright notice appears in all copies and -- that both that copyright notice and this permission notice appear -- in supporting documentation. Silicon Graphics makes no -- representations about the suitability of this software for any -- purpose. It is provided "as is" without express or implied warranty. -- -- Copyright (c) 1994 -- Hewlett-Packard Company -- -- Permission to use, copy, modify, distribute and sell this software -- and its documentation for any purpose is hereby granted without fee, -- provided that the above copyright notice appears in all copies and -- that both that copyright notice and this permission notice appear -- in supporting documentation. Hewlett-Packard Company makes no -- representations about the suitability of this software for any -- purpose. It is provided "as is" without express or implied warranty. -- --><Head><Title>max_element</Title><!-- Generated by htmldoc --></HEAD><BODY TEXT="#000000" LINK="#006600" ALINK="#003300" VLINK="#7C7F87" BGCOLOR="#FFFFFF"><A HREF="/"><IMG SRC="/images/common/sgilogo_small.gif" ALT="SGI Logo" WIDTH="80" HEIGHT="72" BORDER="0"></A><P><!--end header--><BR Clear><H1>max_element</H1><Table CellPadding=0 CellSpacing=0 width=100%><TR><TD Align=left><Img src = "algorithms.gif" Alt="" WIDTH = "194" HEIGHT = "38" ></TD><TD Align=right><Img src = "function.gif" Alt="" WIDTH = "194" HEIGHT = "38" ></TD></TR><TR><TD Align=left VAlign=top><b>Category</b>: algorithms</TD><TD Align=right VAlign=top><b>Component type</b>: function</TD></TR></Table><h3>Prototype</h3><tt>Max_element</tt> is an overloaded name; there are actually two <tt>max_element</tt> functions. <pre>template <class <A href="ForwardIterator.html">ForwardIterator</A>>ForwardIterator max_element(ForwardIterator first, ForwardIterator last);template <class <A href="ForwardIterator.html">ForwardIterator</A>, class <A href="BinaryPredicate.html">BinaryPredicate</A>>ForwardIterator max_element(ForwardIterator first, ForwardIterator last, <A href="BinaryPredicate.html">BinaryPredicate</A> comp);</pre> <h3>Description</h3><tt>Max_element</tt> finds the largest element in the range <tt>[first, last)</tt>.It returns the first iterator <tt>i</tt> in <tt>[first, last)</tt> such that noother iterator in <tt>[first, last)</tt> points to a value greater than <tt>*i</tt>.The return value is <tt>last</tt> if and only if <tt>[first, last)</tt> is an emptyrange.<P>The two versions of <tt>max_element</tt> differ in how they define whether oneelement is less than another. The first version comparesobjects using <tt>operator<</tt>, and the second compares objects usinga <A href="functors.html">function object</A> <tt>comp</tt>. <P>The first version of <tt>max_element</tt> returns the first iterator <tt>i</tt> in <tt>[first, last)</tt> such that, for everyiterator <tt>j</tt> in <tt>[first, last)</tt>, <tt>*i < *j</tt> is <tt>false</tt>.The second version returns the first iterator <tt>i</tt> in <tt>[first, last)</tt> such that, for everyiterator <tt>j</tt> in <tt>[first, last)</tt>, <tt>comp(*i, *j)</tt> is <tt>false</tt>.<h3>Definition</h3>Defined in the standard header <A href="algorithm">algorithm</A>, and in the nonstandardbackward-compatibility header <A href="algo.h">algo.h</A>.<h3>Requirements on types</h3>For the first version:<UL><LI><tt>ForwardIterator</tt> is a model of <A href="ForwardIterator.html">Forward Iterator</A>.<LI><tt>ForwardIterator</tt>'s value type is <A href="LessThanComparable.html">LessThan Comparable</A>.</UL>For the second version:<UL><LI><tt>ForwardIterator</tt> is a model of <A href="ForwardIterator.html">Forward Iterator</A>.<LI><tt>BinaryPredicate</tt> is a model of <A href="BinaryPredicate.html">Binary Predicate</A>.<LI><tt>ForwardIterator</tt>'s value type is convertible to <tt>BinaryPredicate</tt>'s first argument type and second argument type.</UL><h3>Preconditions</h3><UL><LI><tt>[first, last)</tt> is a valid range.</UL><h3>Complexity</h3>Linear. Zero comparisons if <tt>[first, last)</tt> is an empty range,otherwise exactly <tt>(last - first) - 1</tt> comparisons.<h3>Example</h3><pre>int main(){ <A href="List.html">list</A><int> L; <A href="generate_n.html">generate_n</A>(<A href="front_insert_iterator.html">front_inserter</A>(L), 1000, rand); list<int>::const_iterator it = max_element(L.begin(), L.end()); cout << "The largest element is " << *it << endl;}</pre><h3>Notes</h3><h3>See also</h3><tt><A href="min.html">min</A></tt>, <tt><A href="max.html">max</A></tt>, <tt><A href="min_element.html">min_element</A></tt>, <A href="LessThanComparable.html">LessThan Comparable</A>,<tt><A href="sort.html">sort</A></tt>, <tt><A href="nth_element.html">nth_element</A></tt><!-- start footer --><!-- Footer Begins --><STYLE TYPE="text/css"><!--TD.footer, TD.footer A{ font-family: Arial, helvetica, sans-serif; font-size: 8pt;}A.home {font-family: Arial, helvetica, sans-serif;}--></STYLE><P><A CLASS="home" HREF="index.html">STL Home</A><P><TABLE WIDTH="600" CELLPADDING="0" CELLPADDING="0" BORDER="0"> <TR> <TD ALIGN="RIGHT" CLASS="footer"><A HREF="/company_info/terms.html" TARGET="_top">terms of use</A> | <A HREF="/company_info/privacy.html" TARGET="_top">privacy policy</A></TD> <TD ALIGN="CENTER" CLASS="footer"> | </TD> <TD ALIGN="LEFT" CLASS="footer"><A HREF="/cgi-bin/feedback/" TARGET="_top">contact us</A></TD> </TR><TR> <TD ALIGN="RIGHT" CLASS="footer">Copyright © 1993-2003 Silicon Graphics, Inc. All rights reserved.</TD> <TD ALIGN="CENTER" CLASS="footer"> | </TD> <TD ALIGN="LEFT" CLASS="footer"><A HREF="/company_info/trademarks/" TARGET="_top">Trademark Information</A></TD> </TR></TABLE><!-- Footer Ends --><!-- end footer --><P></BODY></HTML> ⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -