cxx/test/algorithms/alg.modifying.operations/alg.reverse/reverse.pass.cpp
Howard Hinnant b64f8b07c1 license change
git-svn-id: https://llvm.org/svn/llvm-project/libcxx/trunk@119395 91177308-0d34-0410-b5e6-96231b3b80d8
2010-11-16 22:09:02 +00:00

61 lines
1.5 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<BidirectionalIterator Iter>
// requires HasSwap<Iter::reference, Iter::reference>
// void
// reverse(Iter first, Iter last);
#include <algorithm>
#include <cassert>
#include "../../iterators.h"
template <class Iter>
void
test()
{
int ia[] = {0};
const unsigned sa = sizeof(ia)/sizeof(ia[0]);
std::reverse(Iter(ia), Iter(ia));
assert(ia[0] == 0);
std::reverse(Iter(ia), Iter(ia+sa));
assert(ia[0] == 0);
int ib[] = {0, 1};
const unsigned sb = sizeof(ib)/sizeof(ib[0]);
std::reverse(Iter(ib), Iter(ib+sb));
assert(ib[0] == 1);
assert(ib[1] == 0);
int ic[] = {0, 1, 2};
const unsigned sc = sizeof(ic)/sizeof(ic[0]);
std::reverse(Iter(ic), Iter(ic+sc));
assert(ic[0] == 2);
assert(ic[1] == 1);
assert(ic[2] == 0);
int id[] = {0, 1, 2, 3};
const unsigned sd = sizeof(id)/sizeof(id[0]);
std::reverse(Iter(id), Iter(id+sd));
assert(id[0] == 3);
assert(id[1] == 2);
assert(id[2] == 1);
assert(id[3] == 0);
}
int main()
{
test<bidirectional_iterator<int*> >();
test<random_access_iterator<int*> >();
test<int*>();
}