Nonpredicate Version of adjacent_find

在 Visual C++ 演示如何使用 adjacent_find 标准模板库函数 (STL) nonpredicate 版本。

template<class ForwardIterator> inline
   ForwardIterator adjacent_find(
      ForwardIterator First,
      ForwardIterator Last
   );

备注

备注

类/参数名在原型不匹配版本在头文件。修改某些提高可读性。

顺序 adjacent_find 算法的查找对序列中匹配的元素。 adjacent_find 算法返回迭代器对该范围 (First， Last) 的第一个连续匹配的元素，或者 Last ，如果不存在这样的元素。 比较完成使用在算法的此 nonpredicate 版本的 operator== 。

示例

// adfind.cpp
// compile with: /EHsc
// Illustrates how to use the  non-predicate version of
//              adjacent_find function.
//
// Functions:
//   adjacent_find - Locate a matching consecutive sequence in a range.

#include <algorithm>
#include <iostream>

using namespace std;

int main()
{
    const int ARRAY_SIZE = 8 ;
    int IntArray[ARRAY_SIZE] = { 1, 2, 3, 4, 4, 5, 6, 7 } ;

    int *location ;   // stores the position for the first pair
                      // of matching consecutive elements.

    int i ;

    // print content of IntArray
    cout << "IntArray { " ;
    for(i = 0; i < ARRAY_SIZE; i++)
        cout << IntArray[i] << ", " ;
    cout << " }" << endl ;

    // Find the first pair of matching consecutive elements
    // in the range [first, last + 1)
    // This version performs matching using operator==
    location = adjacent_find(IntArray, IntArray + ARRAY_SIZE) ;

    //print the matching consecutive elements if any were found
    if (location != IntArray + ARRAY_SIZE)  // matching consecutive
                                            // elements found
        cout << "Found adjacent pair of matching elements: ("
        << *location << ", " << *(location + 1) << "), " <<
        "at location " << location - IntArray << endl;
    else         // no matching consecutive elements were found
        cout << "No adjacent pair of matching elements were found"
        << endl ;

}

Output

IntArray { 1, 2, 3, 4, 4, 5, 6, 7,  }
Found adjacent pair of matching elements: (4, 4), at location 3

要求

**标题:**algorithm

请参见

概念

标准模板库示例