cxx/test/algorithms/alg.modifying.operations/alg.partitions/is_partitioned.pass.cpp
Howard Hinnant eb564e76cc Fixing whitespace problems
git-svn-id: https://llvm.org/svn/llvm-project/libcxx/trunk@111753 91177308-0d34-0410-b5e6-96231b3b80d8
2010-08-22 00:08:10 +00:00

59 lines
1.9 KiB
C++

//===----------------------------------------------------------------------===//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
// <algorithm>
// template <class InputIterator, class Predicate>
// bool
// is_partitioned(InputIterator first, InputIterator last, Predicate pred);
#include <algorithm>
#include <cassert>
#include "../../iterators.h"
struct is_odd
{
bool operator()(const int& i) const {return i & 1;}
};
int main()
{
{
const int ia[] = {1, 2, 3, 4, 5, 6};
assert(!std::is_partitioned(input_iterator<const int*>(std::begin(ia)),
input_iterator<const int*>(std::end(ia)),
is_odd()));
}
{
const int ia[] = {1, 3, 5, 2, 4, 6};
assert( std::is_partitioned(input_iterator<const int*>(std::begin(ia)),
input_iterator<const int*>(std::end(ia)),
is_odd()));
}
{
const int ia[] = {2, 4, 6, 1, 3, 5};
assert(!std::is_partitioned(input_iterator<const int*>(std::begin(ia)),
input_iterator<const int*>(std::end(ia)),
is_odd()));
}
{
const int ia[] = {1, 3, 5, 2, 4, 6, 7};
assert(!std::is_partitioned(input_iterator<const int*>(std::begin(ia)),
input_iterator<const int*>(std::end(ia)),
is_odd()));
}
{
const int ia[] = {1, 3, 5, 2, 4, 6, 7};
assert( std::is_partitioned(input_iterator<const int*>(std::begin(ia)),
input_iterator<const int*>(std::begin(ia)),
is_odd()));
}
}