📄 adjacent_find.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>adjacent_find</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>adjacent_find</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>Adjacent_find</tt> is an overloaded name; there are actually two <tt>adjacent_find</tt>functions.<pre>template <class <A href="ForwardIterator.html">ForwardIterator</A>>ForwardIterator adjacent_find(ForwardIterator first, ForwardIterator last);template <class <A href="ForwardIterator.html">ForwardIterator</A>, class <A href="BinaryPredicate.html">BinaryPredicate</A>>ForwardIterator adjacent_find(ForwardIterator first, ForwardIterator last, BinaryPredicate binary_pred);</pre> <h3>Description</h3>The first version of <tt>adjacent_find</tt>returns the first iterator <tt>i</tt> such that <tt>i</tt> and <tt>i+1</tt>are both valid iterators in <tt>[first, last)</tt>, and such that <tt>*i == *(i+1)</tt>. It returns <tt>last</tt> if no such iterator exists.<P>The second version of <tt>adjacent_find</tt>returns the first iterator <tt>i</tt> such that <tt>i</tt> and <tt>i+1</tt>are both valid iterators in <tt>[first, last)</tt>, and such that <tt>binary_pred(*i, *(i+1))</tt> is <tt>true</tt>. It returns <tt>last</tt> if no such iterator exists.<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="EqualityComparable.html">Equality 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>ForwardIterator</tt>'s value type is convertible to <tt>BinaryPredicate</tt>'s first argument type and to its second argument type.</UL><h3>Preconditions</h3><UL><LI><tt>[first, last)</tt> is a valid range.</UL><h3>Complexity</h3>Linear. If <tt>first == last</tt> then no comparison are performed;otherwise, at most <tt>(last - first) - 1</tt> comparisons.<h3>Example</h3>Find the first element that is greater than its successor.<pre>int A[] = {1, 2, 3, 4, 6, 5, 7, 8};const int N = sizeof(A) / sizeof(int);const int* p = adjacent_find(A, A + N, <A href="greater.html">greater</A><int>());cout << "Element " << p - A << " is out of order: " << *p << " > " << *(p + 1) << "." << endl;</pre><h3>Notes</h3><h3>See also</h3><tt><A href="find.html">find</A></tt>, <tt><A href="mismatch.html">mismatch</A></tt>, <tt><A href="equal.html">equal</A></tt>, <tt><A href="search.html">search</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 + -