f25c767a2b
Most template type parameters 'Allocator' were modified their default type to void since 1.70.0. These modifications cause has_trivial_destructor_after_move to compile error or yield wrong result. So, fix them by changing specializations of has_trivial_destructor_after_move.
656 lines
21 KiB
C++
656 lines
21 KiB
C++
//////////////////////////////////////////////////////////////////////////////
|
|
//
|
|
// (C) Copyright Ion Gaztanaga 2004-2013. Distributed under the Boost
|
|
// Software License, Version 1.0. (See accompanying file
|
|
// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
|
//
|
|
// See http://www.boost.org/libs/container for documentation.
|
|
//
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
#include <boost/container/detail/config_begin.hpp>
|
|
#include <set>
|
|
#include <boost/container/set.hpp>
|
|
#include <boost/container/adaptive_pool.hpp>
|
|
|
|
#include "print_container.hpp"
|
|
#include "movable_int.hpp"
|
|
#include "dummy_test_allocator.hpp"
|
|
#include "set_test.hpp"
|
|
#include "propagate_allocator_test.hpp"
|
|
#include "emplace_test.hpp"
|
|
#include "../../intrusive/test/iterator_test.hpp"
|
|
|
|
using namespace boost::container;
|
|
|
|
//Test recursive structures
|
|
class recursive_set
|
|
{
|
|
public:
|
|
recursive_set & operator=(const recursive_set &x)
|
|
{ id_ = x.id_; set_ = x.set_; return *this; }
|
|
|
|
int id_;
|
|
set<recursive_set> set_;
|
|
set<recursive_set>::iterator it_;
|
|
set<recursive_set>::const_iterator cit_;
|
|
set<recursive_set>::reverse_iterator rit_;
|
|
set<recursive_set>::const_reverse_iterator crit_;
|
|
|
|
friend bool operator< (const recursive_set &a, const recursive_set &b)
|
|
{ return a.id_ < b.id_; }
|
|
};
|
|
|
|
//Test recursive structures
|
|
class recursive_multiset
|
|
{
|
|
public:
|
|
recursive_multiset & operator=(const recursive_multiset &x)
|
|
{ id_ = x.id_; multiset_ = x.multiset_; return *this; }
|
|
|
|
int id_;
|
|
multiset<recursive_multiset> multiset_;
|
|
multiset<recursive_multiset>::iterator it_;
|
|
multiset<recursive_multiset>::const_iterator cit_;
|
|
multiset<recursive_multiset>::reverse_iterator rit_;
|
|
multiset<recursive_multiset>::const_reverse_iterator crit_;
|
|
|
|
friend bool operator< (const recursive_multiset &a, const recursive_multiset &b)
|
|
{ return a.id_ < b.id_; }
|
|
};
|
|
|
|
template<class C>
|
|
void test_move()
|
|
{
|
|
//Now test move semantics
|
|
C original;
|
|
original.emplace();
|
|
C move_ctor(boost::move(original));
|
|
C move_assign;
|
|
move_assign.emplace();
|
|
move_assign = boost::move(move_ctor);
|
|
move_assign.swap(original);
|
|
}
|
|
|
|
bool node_type_test()
|
|
{
|
|
using namespace boost::container;
|
|
{
|
|
typedef set<test::movable_int> set_type;
|
|
set_type src;
|
|
{
|
|
test::movable_int mv_1(1), mv_2(2), mv_3(3);
|
|
src.emplace(boost::move(mv_1));
|
|
src.emplace(boost::move(mv_2));
|
|
src.emplace(boost::move(mv_3));
|
|
}
|
|
if(src.size() != 3)
|
|
return false;
|
|
|
|
set_type dst;
|
|
{
|
|
test::movable_int mv_3(3);
|
|
dst.emplace(boost::move(mv_3));
|
|
}
|
|
|
|
if(dst.size() != 1)
|
|
return false;
|
|
|
|
const test::movable_int mv_1(1);
|
|
const test::movable_int mv_2(2);
|
|
const test::movable_int mv_3(3);
|
|
const test::movable_int mv_33(33);
|
|
set_type::insert_return_type r;
|
|
|
|
r = dst.insert(src.extract(mv_33)); // Key version, try to insert empty node
|
|
if(! (r.position == dst.end() && r.inserted == false && r.node.empty()) )
|
|
return false;
|
|
r = dst.insert(src.extract(src.find(mv_1))); // Iterator version, successful
|
|
if(! (r.position == dst.find(mv_1) && r.inserted == true && r.node.empty()) )
|
|
return false;
|
|
r = dst.insert(dst.begin(), src.extract(mv_2)); // Key type version, successful
|
|
if(! (r.position == dst.find(mv_2) && r.inserted == true && r.node.empty()) )
|
|
return false;
|
|
r = dst.insert(src.extract(mv_3)); // Key type version, unsuccessful
|
|
|
|
if(!src.empty())
|
|
return false;
|
|
if(dst.size() != 3)
|
|
return false;
|
|
if(! (r.position == dst.find(mv_3) && r.inserted == false && r.node.value() == mv_3) )
|
|
return false;
|
|
}
|
|
|
|
{
|
|
typedef multiset<test::movable_int> multiset_type;
|
|
multiset_type src;
|
|
{
|
|
test::movable_int mv_1(1), mv_2(2), mv_3(3), mv_3bis(3);
|
|
src.emplace(boost::move(mv_1));
|
|
src.emplace(boost::move(mv_2));
|
|
src.emplace(boost::move(mv_3));
|
|
src.emplace_hint(src.begin(), boost::move(mv_3bis));
|
|
}
|
|
if(src.size() != 4)
|
|
return false;
|
|
|
|
multiset_type dst;
|
|
{
|
|
test::movable_int mv_3(3);
|
|
dst.emplace(boost::move(mv_3));
|
|
}
|
|
|
|
if(dst.size() != 1)
|
|
return false;
|
|
|
|
const test::movable_int mv_1(1);
|
|
const test::movable_int mv_2(2);
|
|
const test::movable_int mv_3(3);
|
|
const test::movable_int mv_4(4);
|
|
multiset_type::iterator r;
|
|
|
|
multiset_type::node_type nt(src.extract(mv_3));
|
|
r = dst.insert(dst.begin(), boost::move(nt));
|
|
if(! (*r == mv_3 && dst.find(mv_3) == r && nt.empty()) )
|
|
return false;
|
|
|
|
nt = src.extract(src.find(mv_1));
|
|
r = dst.insert(boost::move(nt)); // Iterator version, successful
|
|
if(! (*r == mv_1 && nt.empty()) )
|
|
return false;
|
|
|
|
nt = src.extract(mv_2);
|
|
r = dst.insert(boost::move(nt)); // Key type version, successful
|
|
if(! (*r == mv_2 && nt.empty()) )
|
|
return false;
|
|
|
|
r = dst.insert(src.extract(mv_3)); // Key type version, successful
|
|
if(! (*r == mv_3 && r == --multiset_type::iterator(dst.upper_bound(mv_3)) && nt.empty()) )
|
|
return false;
|
|
|
|
r = dst.insert(src.extract(mv_4)); // Key type version, unsuccessful
|
|
if(! (r == dst.end()) )
|
|
return false;
|
|
|
|
if(!src.empty())
|
|
return false;
|
|
if(dst.size() != 5)
|
|
return false;
|
|
}
|
|
return true;
|
|
}
|
|
|
|
struct boost_container_set;
|
|
struct boost_container_multiset;
|
|
|
|
namespace boost {
|
|
namespace container {
|
|
namespace test {
|
|
|
|
template<>
|
|
struct alloc_propagate_base<boost_container_set>
|
|
{
|
|
template <class T, class Allocator>
|
|
struct apply
|
|
{
|
|
typedef boost::container::set<T, std::less<T>, Allocator> type;
|
|
};
|
|
};
|
|
|
|
template<>
|
|
struct alloc_propagate_base<boost_container_multiset>
|
|
{
|
|
template <class T, class Allocator>
|
|
struct apply
|
|
{
|
|
typedef boost::container::multiset<T, std::less<T>, Allocator> type;
|
|
};
|
|
};
|
|
|
|
bool constructor_template_auto_deduction_test()
|
|
{
|
|
#ifndef BOOST_CONTAINER_NO_CXX17_CTAD
|
|
using namespace boost::container;
|
|
const std::size_t NumElements = 100;
|
|
{
|
|
std::set<int> int_set;
|
|
for (std::size_t i = 0; i != NumElements; ++i) {
|
|
int_set.insert(static_cast<int>(i));
|
|
}
|
|
std::multiset<int> int_mset;
|
|
for (std::size_t i = 0; i != NumElements; ++i) {
|
|
int_mset.insert(static_cast<int>(i));
|
|
}
|
|
|
|
typedef std::less<int> comp_int_t;
|
|
typedef std::allocator<int> alloc_int_t;
|
|
|
|
//range
|
|
{
|
|
auto fset = set(int_set.begin(), int_set.end());
|
|
if (!CheckEqualContainers(int_set, fset))
|
|
return false;
|
|
auto fmset = multiset(int_mset.begin(), int_mset.end());
|
|
if (!CheckEqualContainers(int_mset, fmset))
|
|
return false;
|
|
}
|
|
//range+comp
|
|
{
|
|
auto fset = set(int_set.begin(), int_set.end(), comp_int_t());
|
|
if (!CheckEqualContainers(int_set, fset))
|
|
return false;
|
|
auto fmset = multiset(int_mset.begin(), int_mset.end(), comp_int_t());
|
|
if (!CheckEqualContainers(int_mset, fmset))
|
|
return false;
|
|
}
|
|
//range+comp+alloc
|
|
{
|
|
auto fset = set(int_set.begin(), int_set.end(), comp_int_t(), alloc_int_t());
|
|
if (!CheckEqualContainers(int_set, fset))
|
|
return false;
|
|
auto fmset = multiset(int_mset.begin(), int_mset.end(), comp_int_t(), alloc_int_t());
|
|
if (!CheckEqualContainers(int_mset, fmset))
|
|
return false;
|
|
}
|
|
//range+alloc
|
|
{
|
|
auto fset = set(int_set.begin(), int_set.end(), alloc_int_t());
|
|
if (!CheckEqualContainers(int_set, fset))
|
|
return false;
|
|
auto fmset = multiset(int_mset.begin(), int_mset.end(), alloc_int_t());
|
|
if (!CheckEqualContainers(int_mset, fmset))
|
|
return false;
|
|
}
|
|
|
|
//ordered_unique_range / ordered_range
|
|
|
|
//range
|
|
{
|
|
auto fset = set(ordered_unique_range, int_set.begin(), int_set.end());
|
|
if (!CheckEqualContainers(int_set, fset))
|
|
return false;
|
|
auto fmset = multiset(ordered_range, int_mset.begin(), int_mset.end());
|
|
if (!CheckEqualContainers(int_mset, fmset))
|
|
return false;
|
|
}
|
|
//range+comp
|
|
{
|
|
auto fset = set(ordered_unique_range, int_set.begin(), int_set.end(), comp_int_t());
|
|
if (!CheckEqualContainers(int_set, fset))
|
|
return false;
|
|
auto fmset = multiset(ordered_range, int_mset.begin(), int_mset.end(), comp_int_t());
|
|
if (!CheckEqualContainers(int_mset, fmset))
|
|
return false;
|
|
}
|
|
//range+comp+alloc
|
|
{
|
|
auto fset = set(ordered_unique_range, int_set.begin(), int_set.end(), comp_int_t(), alloc_int_t());
|
|
if (!CheckEqualContainers(int_set, fset))
|
|
return false;
|
|
auto fmset = multiset(ordered_range, int_mset.begin(), int_mset.end(), comp_int_t(), alloc_int_t());
|
|
if (!CheckEqualContainers(int_mset, fmset))
|
|
return false;
|
|
}
|
|
//range+alloc
|
|
{
|
|
auto fset = set(ordered_unique_range, int_set.begin(), int_set.end(), alloc_int_t());
|
|
if (!CheckEqualContainers(int_set, fset))
|
|
return false;
|
|
auto fmset = multiset(ordered_range, int_mset.begin(), int_mset.end(), alloc_int_t());
|
|
if (!CheckEqualContainers(int_mset, fmset))
|
|
return false;
|
|
}
|
|
}
|
|
#endif
|
|
return true;
|
|
}
|
|
|
|
}}} //boost::container::test
|
|
|
|
template<class VoidAllocator, boost::container::tree_type_enum tree_type_value>
|
|
struct GetAllocatorSet
|
|
{
|
|
template<class ValueType>
|
|
struct apply
|
|
{
|
|
typedef set < ValueType
|
|
, std::less<ValueType>
|
|
, typename allocator_traits<VoidAllocator>
|
|
::template portable_rebind_alloc<ValueType>::type
|
|
, typename boost::container::tree_assoc_options
|
|
< boost::container::tree_type<tree_type_value>
|
|
>::type
|
|
> set_type;
|
|
|
|
typedef multiset < ValueType
|
|
, std::less<ValueType>
|
|
, typename allocator_traits<VoidAllocator>
|
|
::template portable_rebind_alloc<ValueType>::type
|
|
, typename boost::container::tree_assoc_options
|
|
< boost::container::tree_type<tree_type_value>
|
|
>::type
|
|
> multiset_type;
|
|
};
|
|
};
|
|
|
|
void test_merge_from_different_comparison()
|
|
{
|
|
set<int> set1;
|
|
set<int, std::greater<int> > set2;
|
|
set1.merge(set2);
|
|
}
|
|
|
|
bool test_heterogeneous_lookups()
|
|
{
|
|
typedef set<int, test::less_transparent> set_t;
|
|
typedef multiset<int, test::less_transparent> mset_t;
|
|
|
|
set_t set1;
|
|
mset_t mset1;
|
|
|
|
const set_t &cset1 = set1;
|
|
const mset_t &cmset1 = mset1;
|
|
|
|
set1.insert(1);
|
|
set1.insert(1);
|
|
set1.insert(2);
|
|
set1.insert(2);
|
|
set1.insert(3);
|
|
|
|
mset1.insert(1);
|
|
mset1.insert(1);
|
|
mset1.insert(2);
|
|
mset1.insert(2);
|
|
mset1.insert(3);
|
|
|
|
const test::non_copymovable_int find_me(2);
|
|
|
|
//find
|
|
if(*set1.find(find_me) != 2)
|
|
return false;
|
|
if(*cset1.find(find_me) != 2)
|
|
return false;
|
|
if(*mset1.find(find_me) != 2)
|
|
return false;
|
|
if(*cmset1.find(find_me) != 2)
|
|
return false;
|
|
|
|
//count
|
|
if(set1.count(find_me) != 1)
|
|
return false;
|
|
if(cset1.count(find_me) != 1)
|
|
return false;
|
|
if(mset1.count(find_me) != 2)
|
|
return false;
|
|
if(cmset1.count(find_me) != 2)
|
|
return false;
|
|
|
|
//contains
|
|
if(!set1.contains(find_me))
|
|
return false;
|
|
if(!cset1.contains(find_me))
|
|
return false;
|
|
if(!mset1.contains(find_me))
|
|
return false;
|
|
if(!cmset1.contains(find_me))
|
|
return false;
|
|
|
|
//lower_bound
|
|
if(*set1.lower_bound(find_me) != 2)
|
|
return false;
|
|
if(*cset1.lower_bound(find_me) != 2)
|
|
return false;
|
|
if(*mset1.lower_bound(find_me) != 2)
|
|
return false;
|
|
if(*cmset1.lower_bound(find_me) != 2)
|
|
return false;
|
|
|
|
//upper_bound
|
|
if(*set1.upper_bound(find_me) != 3)
|
|
return false;
|
|
if(*cset1.upper_bound(find_me) != 3)
|
|
return false;
|
|
if(*mset1.upper_bound(find_me) != 3)
|
|
return false;
|
|
if(*cmset1.upper_bound(find_me) != 3)
|
|
return false;
|
|
|
|
//equal_range
|
|
if(*set1.equal_range(find_me).first != 2)
|
|
return false;
|
|
if(*cset1.equal_range(find_me).second != 3)
|
|
return false;
|
|
if(*mset1.equal_range(find_me).first != 2)
|
|
return false;
|
|
if(*cmset1.equal_range(find_me).second != 3)
|
|
return false;
|
|
|
|
return true;
|
|
}
|
|
|
|
int main ()
|
|
{
|
|
//Recursive container instantiation
|
|
{
|
|
set<recursive_set> set_;
|
|
multiset<recursive_multiset> multiset_;
|
|
}
|
|
//Allocator argument container
|
|
{
|
|
set<int> set_((set<int>::allocator_type()));
|
|
multiset<int> multiset_((multiset<int>::allocator_type()));
|
|
}
|
|
//Now test move semantics
|
|
{
|
|
test_move<set<recursive_set> >();
|
|
test_move<multiset<recursive_multiset> >();
|
|
}
|
|
//Test std::pair value type as tree has workarounds to make old std::pair
|
|
//implementations movable that can break things
|
|
{
|
|
boost::container::set<std::pair<int,int> > s;
|
|
std::pair<int,int> p(0, 0);
|
|
s.insert(p);
|
|
s.emplace(p);
|
|
}
|
|
|
|
if (!boost::container::test::instantiate_constructors<set<int>, multiset<int> >())
|
|
return 1;
|
|
|
|
test_merge_from_different_comparison();
|
|
|
|
////////////////////////////////////
|
|
// Constructor Template Auto Deduction test
|
|
////////////////////////////////////
|
|
if (!test::constructor_template_auto_deduction_test()) {
|
|
return 1;
|
|
}
|
|
|
|
if(!test_heterogeneous_lookups())
|
|
return 1;
|
|
|
|
////////////////////////////////////
|
|
// Testing allocator implementations
|
|
////////////////////////////////////
|
|
{
|
|
typedef std::set<int> MyStdSet;
|
|
typedef std::multiset<int> MyStdMultiSet;
|
|
|
|
if (0 != test::set_test
|
|
< GetAllocatorSet<std::allocator<void>, red_black_tree>::apply<int>::set_type
|
|
, MyStdSet
|
|
, GetAllocatorSet<std::allocator<void>, red_black_tree>::apply<int>::multiset_type
|
|
, MyStdMultiSet>()) {
|
|
std::cout << "Error in set_test<std::allocator<void>, red_black_tree>" << std::endl;
|
|
return 1;
|
|
}
|
|
|
|
if (0 != test::set_test
|
|
< GetAllocatorSet<new_allocator<void>, avl_tree>::apply<int>::set_type
|
|
, MyStdSet
|
|
, GetAllocatorSet<new_allocator<void>, avl_tree>::apply<int>::multiset_type
|
|
, MyStdMultiSet>()) {
|
|
std::cout << "Error in set_test<new_allocator<void>, avl_tree>" << std::endl;
|
|
return 1;
|
|
}
|
|
|
|
if (0 != test::set_test
|
|
< GetAllocatorSet<adaptive_pool<void>, scapegoat_tree>::apply<int>::set_type
|
|
, MyStdSet
|
|
, GetAllocatorSet<adaptive_pool<void>, scapegoat_tree>::apply<int>::multiset_type
|
|
, MyStdMultiSet>()) {
|
|
std::cout << "Error in set_test<adaptive_pool<void>, scapegoat_tree>" << std::endl;
|
|
return 1;
|
|
}
|
|
|
|
///////////
|
|
|
|
if (0 != test::set_test
|
|
< GetAllocatorSet<new_allocator<void>, splay_tree>::apply<test::movable_int>::set_type
|
|
, MyStdSet
|
|
, GetAllocatorSet<new_allocator<void>, splay_tree>::apply<test::movable_int>::multiset_type
|
|
, MyStdMultiSet>()) {
|
|
std::cout << "Error in set_test<new_allocator<void>, splay_tree>" << std::endl;
|
|
return 1;
|
|
}
|
|
|
|
if (0 != test::set_test
|
|
< GetAllocatorSet<new_allocator<void>, red_black_tree>::apply<test::copyable_int>::set_type
|
|
, MyStdSet
|
|
, GetAllocatorSet<new_allocator<void>, red_black_tree>::apply<test::copyable_int>::multiset_type
|
|
, MyStdMultiSet>()) {
|
|
std::cout << "Error in set_test<new_allocator<void>, red_black_tree>" << std::endl;
|
|
return 1;
|
|
}
|
|
|
|
if (0 != test::set_test
|
|
< GetAllocatorSet<new_allocator<void>, red_black_tree>::apply<test::movable_and_copyable_int>::set_type
|
|
, MyStdSet
|
|
, GetAllocatorSet<new_allocator<void>, red_black_tree>::apply<test::movable_and_copyable_int>::multiset_type
|
|
, MyStdMultiSet>()) {
|
|
std::cout << "Error in set_test<new_allocator<void>, red_black_tree>" << std::endl;
|
|
return 1;
|
|
}
|
|
}
|
|
|
|
////////////////////////////////////
|
|
// Emplace testing
|
|
////////////////////////////////////
|
|
const test::EmplaceOptions SetOptions = (test::EmplaceOptions)(test::EMPLACE_HINT | test::EMPLACE_ASSOC);
|
|
if(!boost::container::test::test_emplace<set<test::EmplaceInt>, SetOptions>())
|
|
return 1;
|
|
if(!boost::container::test::test_emplace<multiset<test::EmplaceInt>, SetOptions>())
|
|
return 1;
|
|
|
|
////////////////////////////////////
|
|
// Allocator propagation testing
|
|
////////////////////////////////////
|
|
if(!boost::container::test::test_propagate_allocator<boost_container_set>())
|
|
return 1;
|
|
|
|
if(!boost::container::test::test_propagate_allocator<boost_container_multiset>())
|
|
return 1;
|
|
|
|
if (!boost::container::test::test_set_methods_with_initializer_list_as_argument_for<set<int> >())
|
|
return 1;
|
|
|
|
if (!boost::container::test::test_set_methods_with_initializer_list_as_argument_for<multiset<int> >())
|
|
return 1;
|
|
|
|
////////////////////////////////////
|
|
// Test optimize_size option
|
|
////////////////////////////////////
|
|
//
|
|
// set
|
|
//
|
|
typedef set< int*, std::less<int*>, std::allocator<int*>
|
|
, tree_assoc_options< optimize_size<false>, tree_type<red_black_tree> >::type > rbset_size_optimized_no;
|
|
|
|
typedef set< int*, std::less<int*>, std::allocator<int*>
|
|
, tree_assoc_options< optimize_size<true>, tree_type<avl_tree> >::type > avlset_size_optimized_yes;
|
|
//
|
|
// multiset
|
|
//
|
|
typedef multiset< int*, std::less<int*>, std::allocator<int*>
|
|
, tree_assoc_options< optimize_size<true>, tree_type<red_black_tree> >::type > rbmset_size_optimized_yes;
|
|
|
|
typedef multiset< int*, std::less<int*>, std::allocator<int*>
|
|
, tree_assoc_options< optimize_size<false>, tree_type<avl_tree> >::type > avlmset_size_optimized_no;
|
|
|
|
BOOST_STATIC_ASSERT(sizeof(rbmset_size_optimized_yes) < sizeof(rbset_size_optimized_no));
|
|
BOOST_STATIC_ASSERT(sizeof(avlset_size_optimized_yes) < sizeof(avlmset_size_optimized_no));
|
|
|
|
////////////////////////////////////
|
|
// Iterator testing
|
|
////////////////////////////////////
|
|
{
|
|
typedef boost::container::set<int> cont_int;
|
|
cont_int a; a.insert(0); a.insert(1); a.insert(2);
|
|
boost::intrusive::test::test_iterator_bidirectional< cont_int >(a);
|
|
if(boost::report_errors() != 0) {
|
|
return 1;
|
|
}
|
|
}
|
|
{
|
|
typedef boost::container::multiset<int> cont_int;
|
|
cont_int a; a.insert(0); a.insert(1); a.insert(2);
|
|
boost::intrusive::test::test_iterator_bidirectional< cont_int >(a);
|
|
if(boost::report_errors() != 0) {
|
|
return 1;
|
|
}
|
|
}
|
|
|
|
////////////////////////////////////
|
|
// Node extraction/insertion testing functions
|
|
////////////////////////////////////
|
|
if(!node_type_test())
|
|
return 1;
|
|
|
|
////////////////////////////////////
|
|
// has_trivial_destructor_after_move testing
|
|
////////////////////////////////////
|
|
// set, default allocator
|
|
{
|
|
typedef boost::container::set<int> cont;
|
|
typedef boost::container::dtl::tree<int, void, std::less<int>, void, void> tree;
|
|
if (boost::has_trivial_destructor_after_move<cont>::value !=
|
|
boost::has_trivial_destructor_after_move<tree>::value) {
|
|
std::cerr << "has_trivial_destructor_after_move(set, default allocator) test failed" << std::endl;
|
|
return 1;
|
|
}
|
|
}
|
|
// set, std::allocator
|
|
{
|
|
typedef boost::container::set<int, std::less<int>, std::allocator<int> > cont;
|
|
typedef boost::container::dtl::tree<int, void, std::less<int>, std::allocator<int>, void> tree;
|
|
if (boost::has_trivial_destructor_after_move<cont>::value !=
|
|
boost::has_trivial_destructor_after_move<tree>::value) {
|
|
std::cerr << "has_trivial_destructor_after_move(set, std::allocator) test failed" << std::endl;
|
|
return 1;
|
|
}
|
|
}
|
|
// multiset, default allocator
|
|
{
|
|
typedef boost::container::multiset<int> cont;
|
|
typedef boost::container::dtl::tree<int, void, std::less<int>, void, void> tree;
|
|
if (boost::has_trivial_destructor_after_move<cont>::value !=
|
|
boost::has_trivial_destructor_after_move<tree>::value) {
|
|
std::cerr << "has_trivial_destructor_after_move(multiset, default allocator) test failed" << std::endl;
|
|
return 1;
|
|
}
|
|
}
|
|
// multiset, std::allocator
|
|
{
|
|
typedef boost::container::multiset<int, std::less<int>, std::allocator<int> > cont;
|
|
typedef boost::container::dtl::tree<int, void, std::less<int>, std::allocator<int>, void> tree;
|
|
if (boost::has_trivial_destructor_after_move<cont>::value !=
|
|
boost::has_trivial_destructor_after_move<tree>::value) {
|
|
std::cerr << "has_trivial_destructor_after_move(multiset, std::allocator) test failed" << std::endl;
|
|
return 1;
|
|
}
|
|
}
|
|
|
|
return 0;
|
|
}
|
|
|
|
#include <boost/container/detail/config_end.hpp>
|