mirror of
https://github.com/Gericom/teak-llvm.git
synced 2025-06-23 21:45:46 -04:00
e17a155c61
Add static_cast<int>. In these cases, the values are guaranteed to be small-ish, and they're being compared to int elements. test/std/containers/sequences/deque/deque.capacity/access.pass.cpp Use int instead of unsigned to iterate from 0 to 10. llvm-svn: 288747
40 lines
1.1 KiB
C++
40 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, Callable<auto, Iter::reference> Function>
|
|
// requires CopyConstructible<Function>
|
|
// Function
|
|
// for_each(Iter first, Iter last, Function f);
|
|
|
|
#include <algorithm>
|
|
#include <cassert>
|
|
|
|
#include "test_iterators.h"
|
|
|
|
struct for_each_test
|
|
{
|
|
for_each_test(int c) : count(c) {}
|
|
int count;
|
|
void operator()(int& i) {++i; ++count;}
|
|
};
|
|
|
|
int main()
|
|
{
|
|
int ia[] = {0, 1, 2, 3, 4, 5};
|
|
const unsigned s = sizeof(ia)/sizeof(ia[0]);
|
|
for_each_test f = std::for_each(input_iterator<int*>(ia),
|
|
input_iterator<int*>(ia+s),
|
|
for_each_test(0));
|
|
assert(f.count == s);
|
|
for (unsigned i = 0; i < s; ++i)
|
|
assert(ia[i] == static_cast<int>(i+1));
|
|
}
|