4684ddb6aa
- import libcxx - reduce targets to the one when compiled as a tools Change-Id: Iabb8427f80ff8e89463559a28bcb8b4f2bdbc496
55 lines
1.8 KiB
C++
55 lines
1.8 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 <class InputIterator, class Predicate>
|
|
// bool
|
|
// none_of(InputIterator first, InputIterator last, Predicate pred);
|
|
|
|
#include <algorithm>
|
|
#include <cassert>
|
|
|
|
#include "test_iterators.h"
|
|
|
|
struct test1
|
|
{
|
|
bool operator()(const int& i) const
|
|
{
|
|
return i % 2 == 0;
|
|
}
|
|
};
|
|
|
|
int main()
|
|
{
|
|
{
|
|
int ia[] = {2, 4, 6, 8};
|
|
const unsigned sa = sizeof(ia)/sizeof(ia[0]);
|
|
assert(std::none_of(input_iterator<const int*>(ia),
|
|
input_iterator<const int*>(ia + sa), test1()) == false);
|
|
assert(std::none_of(input_iterator<const int*>(ia),
|
|
input_iterator<const int*>(ia), test1()) == true);
|
|
}
|
|
{
|
|
const int ia[] = {2, 4, 5, 8};
|
|
const unsigned sa = sizeof(ia)/sizeof(ia[0]);
|
|
assert(std::none_of(input_iterator<const int*>(ia),
|
|
input_iterator<const int*>(ia + sa), test1()) == false);
|
|
assert(std::none_of(input_iterator<const int*>(ia),
|
|
input_iterator<const int*>(ia), test1()) == true);
|
|
}
|
|
{
|
|
const int ia[] = {1, 3, 5, 7};
|
|
const unsigned sa = sizeof(ia)/sizeof(ia[0]);
|
|
assert(std::none_of(input_iterator<const int*>(ia),
|
|
input_iterator<const int*>(ia + sa), test1()) == true);
|
|
assert(std::none_of(input_iterator<const int*>(ia),
|
|
input_iterator<const int*>(ia), test1()) == true);
|
|
}
|
|
}
|