| Howard Hinnant | 3e51952 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1 | //===----------------------------------------------------------------------===// |
| 2 | // |
| Howard Hinnant | 5b08a8a | 2010-05-11 21:36:01 +0000 | [diff] [blame] | 3 | // The LLVM Compiler Infrastructure |
| Howard Hinnant | 3e51952 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 4 | // |
| 5 | // This file is distributed under the University of Illinois Open Source |
| 6 | // License. See LICENSE.TXT for details. |
| 7 | // |
| 8 | //===----------------------------------------------------------------------===// |
| 9 | |
| 10 | // <algorithm> |
| 11 | |
| 12 | // template<InputIterator Iter, class T> |
| 13 | // requires HasEqualTo<Iter::value_type, T> |
| 14 | // Iter::difference_type |
| 15 | // count(Iter first, Iter last, const T& value); |
| 16 | |
| 17 | #include <algorithm> |
| 18 | #include <cassert> |
| 19 | |
| 20 | #include "../../iterators.h" |
| 21 | |
| 22 | int main() |
| 23 | { |
| 24 | int ia[] = {0, 1, 2, 2, 0, 1, 2, 3}; |
| 25 | const unsigned sa = sizeof(ia)/sizeof(ia[0]); |
| 26 | assert(std::count(input_iterator<const int*>(ia), |
| 27 | input_iterator<const int*>(ia + sa), 2) == 3); |
| 28 | assert(std::count(input_iterator<const int*>(ia), |
| 29 | input_iterator<const int*>(ia + sa), 7) == 0); |
| 30 | assert(std::count(input_iterator<const int*>(ia), |
| 31 | input_iterator<const int*>(ia), 2) == 0); |
| 32 | } |