4684ddb6aa
- import libcxx - reduce targets to the one when compiled as a tools Change-Id: Iabb8427f80ff8e89463559a28bcb8b4f2bdbc496
32 lines
1.1 KiB
C++
32 lines
1.1 KiB
C++
//===----------------------------------------------------------------------===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file is dual licensed under the MIT and the University of Illinois Open
|
|
// Source Licenses. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// <algorithm>
|
|
|
|
// template<InputIterator Iter, class T>
|
|
// requires HasEqualTo<Iter::value_type, T>
|
|
// Iter::difference_type
|
|
// count(Iter first, Iter last, const T& value);
|
|
|
|
#include <algorithm>
|
|
#include <cassert>
|
|
|
|
#include "test_iterators.h"
|
|
|
|
int main()
|
|
{
|
|
int ia[] = {0, 1, 2, 2, 0, 1, 2, 3};
|
|
const unsigned sa = sizeof(ia)/sizeof(ia[0]);
|
|
assert(std::count(input_iterator<const int*>(ia),
|
|
input_iterator<const int*>(ia + sa), 2) == 3);
|
|
assert(std::count(input_iterator<const int*>(ia),
|
|
input_iterator<const int*>(ia + sa), 7) == 0);
|
|
assert(std::count(input_iterator<const int*>(ia),
|
|
input_iterator<const int*>(ia), 2) == 0);
|
|
}
|