STL--------------count

最新推荐文章于 2021-12-01 16:04:25 发布

zhangyulin54321

最新推荐文章于 2021-12-01 16:04:25 发布

阅读量447

点赞数

分类专栏： STL 文章标签： function iterator class algorithm behavior output

本文链接：https://blog.csdn.net/zhangyulin54321/article/details/7871716

版权

STL 专栏收录该内容

9 篇文章 0 订阅

订阅专栏

template <class InputIterator, class T>
  typename iterator_traits<InputIterator>::difference_type
    count ( ForwardIterator first, ForwardIterator last, const T& value );

Count appearances of value in range

Returns the number of elements in the range [first,last) that compare equal to value.

The behavior of this function template is equivalent to:

template <class InputIterator, class T>
  ptrdiff_t count ( InputIterator first, InputIterator last, const T& value )
{
  ptrdiff_t ret=0;
  while (first != last) if (*first++ == value) ++ret;
  return ret;
}

Parameters

first, last

Forward iterators to the initial and final positions of the sequence of elements. The range used is [first,last), which contains all the elements between first and last, including the element pointed by first but not the element pointed by last.

value

Value to compare the elements in the range with.

Return value

The number of elements in the range [first,last) that compare equal to value.
The return type ( iterator_traits<InputIterator>::difference_type) is a signed integral type, generally defined as the same type as ptrdiff_t.

Example

// count algorithm example
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

int main () {
  int mycount;

  // counting elements in array:
  int myints[] = {10,20,30,30,20,10,10,20};   // 8 elements
  mycount = (int) count (myints, myints+8, 10);
  cout << "10 appears " << mycount << " times.\n";

  // counting elements in container:
  vector<int> myvector (myints, myints+8);
  mycount = (int) count (myvector.begin(), myvector.end(), 20);
  cout << "20 appears " << mycount  << " times.\n";

  return 0;
}