stl 在容器中寻找元素

最新推荐文章于 2023-02-12 10:58:15 发布

A彡安静氵

最新推荐文章于 2023-02-12 10:58:15 发布

阅读量296

点赞数

文章标签：容器运维 c++

本文链接：https://blog.csdn.net/phd17621680432/article/details/108335493

版权

7、std::search_n

描述：
在范围 [first, last) 中搜索 count 个等同元素的序列，每个都等于给定的值 value 。
用 operator== 比较元素。
用给定的二元谓词 p 比较元素。

函数定义：

template< class ForwardIt, class Size, class T >
ForwardIt search_n( ForwardIt first, ForwardIt last, Size count, const T& value );

template< class ForwardIt, class Size, class T >
constexpr ForwardIt search_n( ForwardIt first, ForwardIt last, Size count, const T& value );

template< class ForwardIt, class Size, class T, class BinaryPredicate >
ForwardIt search_n( ForwardIt first, ForwardIt last, Size count, const T& value,
                     BinaryPredicate p );

template< class ForwardIt, class Size, class T, class BinaryPredicate >
constexpr ForwardIt search_n( ForwardIt first, ForwardIt last, Size count, const T& value,
                               BinaryPredicate p );

参数：
first, last - 要检验的元素范围
count - 要搜索的序列长度
value - 要搜索的元素值
p - 若元素应被当做相等则返回 true 的二元谓词。

返回值：
指向范围 [first, last) 中找到的序列起始的迭代器。若找不到这种序列，则返回 last 。
若 count 为零或负，则返回 first 。

可能的实现：

template<class ForwardIt, class Size, class T>
ForwardIt search_n(ForwardIt first, ForwardIt last,
                    Size count, const T& value)
{
    if (count <= 0) {
        return first;
    }
 
    for(; first != last; ++first) {
        if (!(*first == value)) {
            continue;
        }
 
        ForwardIt candidate = first;
        Size cur_count = 0;
 
        while (true) {
            ++cur_count;
            if (cur_count >= count) {
                // 成功
                return candidate;
            }
            ++first;
            if (first == last) {
                // 穷尽列表
                return last;
            }
            if (!(*first == value)) {
                // 栏中过少
                break;
            }
        }
    }
    return last;
}

template<class ForwardIt, class Size, class T, class BinaryPredicate>
ForwardIt search_n(ForwardIt first, ForwardIt last,
                    Size count, const T& value, BinaryPredicate p)
{
    if (count <= 0) {
        return first;
    }
 
    for(; first != last; ++first) {
        if (!p(*first, value)) {
            continue;
        }
 
        ForwardIt candidate = first;
        Size cur_count = 0;
 
        while (true) {
            ++cur_count;
            if (cur_count >= count) {
                // 成功
                return candidate;
            }
            ++first;
            if (first == last) {
                // 穷尽列表
                return last;
            }
            if (!p(*first, value)) {
                // 栏中过少
                break;
            }
        }
    }
    return last;
}

示例：

#include <iostream>
#include <algorithm>
#include <iterator>
 
template <class Container, class Size, class T>
bool consecutive_values(const Container& c, Size count, const T& v)
{
  return std::search_n(std::begin(c),std::end(c),count,v) != std::end(c);
}
 
int main()
{
   const char sequence[] = "1001010100010101001010101";
 
   std::cout << std::boolalpha;
   std::cout << "Has 4 consecutive zeros: "
             << consecutive_values(sequence,4,'0') << '\n';
   std::cout << "Has 3 consecutive zeros: "
             << consecutive_values(sequence,3,'0') << '\n';
}

/*
输出：
Has 4 consecutive zeros: false
Has 3 consecutive zeros: true
*/