generic-library/cxx
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

sync with N3126

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/libcxx/trunk@113101 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Howard Hinnant
2010-09-05 01:14:30 +00:00
parent a2ccccce89
commit 3991b553df
83 changed files with 0 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

38
test/containers/container.adaptors/stack/stack.cons.alloc/ctor_alloc.pass.cpp Normal file
View File

@@ -0,0 +1,38 @@
//===----------------------------------------------------------------------===//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
// <stack>
// template <class Alloc>
// explicit stack(const Alloc& a);
#include <stack>
#include <cassert>
#include "../../../../test_allocator.h"
struct test
: private std::stack<int, std::deque<int, test_allocator<int> > >
{
typedef std::stack<int, std::deque<int, test_allocator<int> > > base;
explicit test(const test_allocator<int>& a) : base(a) {}
test(const container_type& c, const test_allocator<int>& a) : base(c, a) {}
#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES
test(container_type&& c, const test_allocator<int>& a) : base(std::move(c), a) {}
test(test&& q, const test_allocator<int>& a) : base(std::move(q), a) {}
#endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES
test_allocator<int> get_allocator() {return c.get_allocator();}
};
int main()
{
test q(test_allocator<int>(3));
assert(q.get_allocator() == test_allocator<int>(3));
}

57
test/containers/container.adaptors/stack/stack.cons.alloc/ctor_container_alloc.pass.cpp Normal file
View File

@@ -0,0 +1,57 @@
//===----------------------------------------------------------------------===//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
// <stack>
// template <class Alloc>
// stack(const container_type& c, const Alloc& a);
#include <stack>
#include <cassert>
#include "../../../../test_allocator.h"
template <class C>
C
make(int n)
{
C c;
for (int i = 0; i < n; ++i)
c.push_back(i);
return c;
}
typedef std::deque<int, test_allocator<int> > C;
struct test
: public std::stack<int, C>
{
typedef std::stack<int, C> base;
explicit test(const test_allocator<int>& a) : base(a) {}
test(const container_type& c, const test_allocator<int>& a) : base(c, a) {}
#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES
test(container_type&& c, const test_allocator<int>& a) : base(std::move(c), a) {}
test(test&& q, const test_allocator<int>& a) : base(std::move(q), a) {}
#endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES
test_allocator<int> get_allocator() {return c.get_allocator();}
};
int main()
{
C d = make<C>(5);
test q(d, test_allocator<int>(4));
assert(q.get_allocator() == test_allocator<int>(4));
assert(q.size() == 5);
for (int i = 0; i < d.size(); ++i)
{
assert(q.top() == d[d.size() - i - 1]);
q.pop();
}
}

52
test/containers/container.adaptors/stack/stack.cons.alloc/ctor_copy_alloc.pass.cpp Normal file
View File

@@ -0,0 +1,52 @@
//===----------------------------------------------------------------------===//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
// <stack>
// template <class Alloc>
// stack(const stack& q, const Alloc& a);
#include <stack>
#include <cassert>
#include "../../../../test_allocator.h"
template <class C>
C
make(int n)
{
C c;
for (int i = 0; i < n; ++i)
c.push_back(int(i));
return c;
}
typedef std::deque<int, test_allocator<int> > C;
template <class T>
struct test
: public std::stack<T, C>
{
typedef std::stack<T, C> base;
typedef test_allocator<int> allocator_type;
typedef typename base::container_type container_type;
explicit test(const allocator_type& a) : base(a) {}
test(const container_type& c, const allocator_type& a) : base(c, a) {}
test(const test& q, const allocator_type& a) : base(q, a) {}
allocator_type get_allocator() {return this->c.get_allocator();}
};
int main()
{
test<int> q(make<C>(5), test_allocator<int>(4));
test<int> q2(q, test_allocator<int>(5));
assert(q2.get_allocator() == test_allocator<int>(5));
assert(q2.size() == 5);
}

59
test/containers/container.adaptors/stack/stack.cons.alloc/ctor_rcontainer_alloc.pass.cpp Normal file
View File

@@ -0,0 +1,59 @@
//===----------------------------------------------------------------------===//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
// <stack>
// template <class Alloc>
// stack(const container_type& c, const Alloc& a);
#include <stack>
#include <cassert>
#include "../../../../test_allocator.h"
#include "../../../../MoveOnly.h"
#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES
template <class C>
C
make(int n)
{
C c;
for (int i = 0; i < n; ++i)
c.push_back(MoveOnly(i));
return c;
}
typedef std::deque<MoveOnly, test_allocator<MoveOnly> > C;
template <class T>
struct test
: public std::stack<T, C>
{
typedef std::stack<T, C> base;
typedef test_allocator<MoveOnly> allocator_type;
typedef typename base::container_type container_type;
explicit test(const allocator_type& a) : base(a) {}
test(const container_type& c, const allocator_type& a) : base(c, a) {}
test(container_type&& c, const allocator_type& a) : base(std::move(c), a) {}
test(test&& q, const allocator_type& a) : base(std::move(q), a) {}
allocator_type get_allocator() {return this->c.get_allocator();}
};
#endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES
int main()
{
#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES
test<MoveOnly> q(make<C>(5), test_allocator<MoveOnly>(4));
assert(q.get_allocator() == test_allocator<MoveOnly>(4));
assert(q.size() == 5);
#endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES
}

60
test/containers/container.adaptors/stack/stack.cons.alloc/ctor_rqueue_alloc.pass.cpp Normal file
View File

@@ -0,0 +1,60 @@
//===----------------------------------------------------------------------===//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
// <stack>
// template <class Alloc>
// stack(stack&& q, const Alloc& a);
#include <stack>
#include <cassert>
#include "../../../../test_allocator.h"
#include "../../../../MoveOnly.h"
#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES
template <class C>
C
make(int n)
{
C c;
for (int i = 0; i < n; ++i)
c.push_back(MoveOnly(i));
return c;
}
typedef std::deque<MoveOnly, test_allocator<MoveOnly> > C;
template <class T>
struct test
: public std::stack<T, C>
{
typedef std::stack<T, C> base;
typedef test_allocator<MoveOnly> allocator_type;
typedef typename base::container_type container_type;
explicit test(const allocator_type& a) : base(a) {}
test(const container_type& c, const allocator_type& a) : base(c, a) {}
test(container_type&& c, const allocator_type& a) : base(std::move(c), a) {}
test(test&& q, const allocator_type& a) : base(std::move(q), a) {}
allocator_type get_allocator() {return this->c.get_allocator();}
};
#endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES
int main()
{
#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES
test<MoveOnly> q(make<C>(5), test_allocator<MoveOnly>(4));
test<MoveOnly> q2(std::move(q), test_allocator<MoveOnly>(5));
assert(q2.get_allocator() == test_allocator<MoveOnly>(5));
assert(q2.size() == 5);
#endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES
}