libcxx initial import
git-svn-id: https://llvm.org/svn/llvm-project/libcxx/trunk@103490 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
@@ -0,0 +1,60 @@
|
||||
//===----------------------------------------------------------------------===//
|
||||
//
|
||||
// <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>The LLVM Compiler Infrastructure
|
||||
//
|
||||
// This file is distributed under the University of Illinois Open Source
|
||||
// License. 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*>();
|
||||
}
|
@@ -0,0 +1,81 @@
|
||||
//===----------------------------------------------------------------------===//
|
||||
//
|
||||
// <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>The LLVM Compiler Infrastructure
|
||||
//
|
||||
// This file is distributed under the University of Illinois Open Source
|
||||
// License. See LICENSE.TXT for details.
|
||||
//
|
||||
//===----------------------------------------------------------------------===//
|
||||
|
||||
// <algorithm>
|
||||
|
||||
// template<BidirectionalIterator InIter, OutputIterator<auto, InIter::reference> OutIter>
|
||||
// OutIter
|
||||
// reverse_copy(InIter first, InIter last, OutIter result);
|
||||
|
||||
#include <algorithm>
|
||||
#include <cassert>
|
||||
|
||||
#include "../../iterators.h"
|
||||
|
||||
template <class InIter, class OutIter>
|
||||
void
|
||||
test()
|
||||
{
|
||||
const int ia[] = {0};
|
||||
const unsigned sa = sizeof(ia)/sizeof(ia[0]);
|
||||
int ja[sa] = {-1};
|
||||
OutIter r = std::reverse_copy(InIter(ia), InIter(ia), OutIter(ja));
|
||||
assert(base(r) == ja);
|
||||
assert(ja[0] == -1);
|
||||
r = std::reverse_copy(InIter(ia), InIter(ia+sa), OutIter(ja));
|
||||
assert(ja[0] == 0);
|
||||
|
||||
const int ib[] = {0, 1};
|
||||
const unsigned sb = sizeof(ib)/sizeof(ib[0]);
|
||||
int jb[sb] = {-1};
|
||||
r = std::reverse_copy(InIter(ib), InIter(ib+sb), OutIter(jb));
|
||||
assert(base(r) == jb+sb);
|
||||
assert(jb[0] == 1);
|
||||
assert(jb[1] == 0);
|
||||
|
||||
const int ic[] = {0, 1, 2};
|
||||
const unsigned sc = sizeof(ic)/sizeof(ic[0]);
|
||||
int jc[sc] = {-1};
|
||||
r = std::reverse_copy(InIter(ic), InIter(ic+sc), OutIter(jc));
|
||||
assert(base(r) == jc+sc);
|
||||
assert(jc[0] == 2);
|
||||
assert(jc[1] == 1);
|
||||
assert(jc[2] == 0);
|
||||
|
||||
int id[] = {0, 1, 2, 3};
|
||||
const unsigned sd = sizeof(id)/sizeof(id[0]);
|
||||
int jd[sd] = {-1};
|
||||
r = std::reverse_copy(InIter(id), InIter(id+sd), OutIter(jd));
|
||||
assert(base(r) == jd+sd);
|
||||
assert(jd[0] == 3);
|
||||
assert(jd[1] == 2);
|
||||
assert(jd[2] == 1);
|
||||
assert(jd[3] == 0);
|
||||
}
|
||||
|
||||
int main()
|
||||
{
|
||||
test<bidirectional_iterator<const int*>, output_iterator<int*> >();
|
||||
test<bidirectional_iterator<const int*>, forward_iterator<int*> >();
|
||||
test<bidirectional_iterator<const int*>, bidirectional_iterator<int*> >();
|
||||
test<bidirectional_iterator<const int*>, random_access_iterator<int*> >();
|
||||
test<bidirectional_iterator<const int*>, int*>();
|
||||
|
||||
test<random_access_iterator<const int*>, output_iterator<int*> >();
|
||||
test<random_access_iterator<const int*>, forward_iterator<int*> >();
|
||||
test<random_access_iterator<const int*>, bidirectional_iterator<int*> >();
|
||||
test<random_access_iterator<const int*>, random_access_iterator<int*> >();
|
||||
test<random_access_iterator<const int*>, int*>();
|
||||
|
||||
test<const int*, output_iterator<int*> >();
|
||||
test<const int*, forward_iterator<int*> >();
|
||||
test<const int*, bidirectional_iterator<int*> >();
|
||||
test<const int*, random_access_iterator<int*> >();
|
||||
test<const int*, int*>();
|
||||
}
|
Reference in New Issue
Block a user