582 lines
14 KiB
C++
582 lines
14 KiB
C++
/* Boost.MultiIndex test for modifier memfuns.
|
|
*
|
|
* Copyright 2003-2018 Joaquin M Lopez Munoz.
|
|
* 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/multi_index for library home page.
|
|
*/
|
|
|
|
#include "test_modifiers.hpp"
|
|
|
|
#include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
|
|
#include <boost/detail/lightweight_test.hpp>
|
|
#include <boost/enable_shared_from_this.hpp>
|
|
#include <boost/iterator/iterator_facade.hpp>
|
|
#include <boost/move/core.hpp>
|
|
#include <boost/move/utility_core.hpp>
|
|
#include <boost/next_prior.hpp>
|
|
#include <boost/shared_ptr.hpp>
|
|
#include <iterator>
|
|
#include <vector>
|
|
#include "pre_multi_index.hpp"
|
|
#include "employee.hpp"
|
|
|
|
using namespace boost::multi_index;
|
|
|
|
struct non_copyable_int
|
|
{
|
|
explicit non_copyable_int(int n_):n(n_){}
|
|
non_copyable_int(BOOST_RV_REF(non_copyable_int) x):n(x.n){x.n=0;}
|
|
non_copyable_int& operator=(BOOST_RV_REF(non_copyable_int) x)
|
|
{
|
|
n=x.n;
|
|
x.n=0;
|
|
return *this;
|
|
}
|
|
|
|
int n;
|
|
private:
|
|
BOOST_MOVABLE_BUT_NOT_COPYABLE(non_copyable_int)
|
|
};
|
|
|
|
class always_one
|
|
{
|
|
public:
|
|
always_one():n(1){}
|
|
~always_one(){n=0;}
|
|
|
|
int get()const{return n;}
|
|
|
|
private:
|
|
int n;
|
|
};
|
|
|
|
inline bool operator==(const always_one& x,const always_one& y)
|
|
{
|
|
return x.get()==y.get();
|
|
}
|
|
|
|
#if defined(BOOST_NO_ARGUMENT_DEPENDENT_LOOKUP)
|
|
namespace boost{
|
|
#endif
|
|
|
|
inline std::size_t hash_value(const always_one& x)
|
|
{
|
|
return static_cast<std::size_t>(x.get());
|
|
}
|
|
|
|
#if defined(BOOST_NO_ARGUMENT_DEPENDENT_LOOKUP)
|
|
} /* namespace boost */
|
|
#endif
|
|
|
|
class linked_object
|
|
{
|
|
struct impl:boost::enable_shared_from_this<impl>
|
|
{
|
|
typedef boost::shared_ptr<const impl> ptr;
|
|
|
|
impl(int n_,ptr next_=ptr()):n(n_),next(next_){}
|
|
|
|
int n;
|
|
ptr next;
|
|
};
|
|
|
|
typedef multi_index_container<
|
|
impl,
|
|
indexed_by<
|
|
|
|
#if BOOST_WORKAROUND(__IBMCPP__,BOOST_TESTED_AT(1010))
|
|
ordered_unique<member<impl,int,&linked_object::impl::n> >,
|
|
hashed_non_unique<member<impl,int,&linked_object::impl::n> >,
|
|
#else
|
|
ordered_unique<member<impl,int,&impl::n> >,
|
|
hashed_non_unique<member<impl,int,&impl::n> >,
|
|
#endif
|
|
|
|
sequenced<>,
|
|
random_access<>
|
|
>
|
|
> impl_repository_t;
|
|
|
|
static impl_repository_t impl_repository;
|
|
|
|
public:
|
|
linked_object(int n):pimpl(init(impl(n))){}
|
|
linked_object(int n,const linked_object& x):pimpl(init(impl(n,x.pimpl))){}
|
|
|
|
private:
|
|
impl::ptr init(const impl& x)
|
|
{
|
|
std::pair<impl_repository_t::iterator,bool> p=impl_repository.insert(x);
|
|
if(p.second)return impl::ptr(&*p.first,&erase_impl);
|
|
else return p.first->shared_from_this();
|
|
}
|
|
|
|
static void erase_impl(const impl* p)
|
|
{
|
|
impl_repository.erase(p->n);
|
|
}
|
|
|
|
impl::ptr pimpl;
|
|
};
|
|
|
|
linked_object::impl_repository_t linked_object::impl_repository;
|
|
|
|
struct tempvalue_iterator:
|
|
boost::iterator_facade<
|
|
tempvalue_iterator,int,boost::forward_traversal_tag,int>
|
|
{
|
|
tempvalue_iterator(int n_):n(n_){}
|
|
|
|
void increment(){++n;}
|
|
bool equal(const tempvalue_iterator& x)const{return n==x.n;}
|
|
int dereference()const{return n;}
|
|
|
|
int n;
|
|
};
|
|
|
|
struct change_int
|
|
{
|
|
change_int(int n):n(n){}
|
|
|
|
void operator()(int& x)const{x=n;}
|
|
|
|
int n;
|
|
};
|
|
|
|
#if !(defined BOOST_NO_EXCEPTIONS)
|
|
struct change_int_and_throw
|
|
{
|
|
change_int_and_throw(int n):n(n){}
|
|
|
|
void operator()(int& x)const{x=n;throw 0;}
|
|
|
|
int n;
|
|
};
|
|
#endif
|
|
|
|
void test_modifiers()
|
|
{
|
|
employee_set es;
|
|
employee_set_by_name& i1=get<name>(es);
|
|
employee_set_by_age& i2=get<age>(es);
|
|
employee_set_as_inserted& i3=get<as_inserted>(es);
|
|
employee_set_by_ssn& i4=get<ssn>(es);
|
|
employee_set_randomly& i5=get<randomly>(es);
|
|
|
|
es.insert(employee(0,"Joe",31,1123));
|
|
BOOST_TEST(es.emplace(0,"Joe",31,1123).second==false);
|
|
BOOST_TEST(i1.insert(employee(0,"Joe Jr.",5,2563)).second==false);
|
|
BOOST_TEST(i2.emplace_hint(i2.end(),1,"Victor",5,1123)->name!="Victor");
|
|
BOOST_TEST(i3.insert(i3.begin(),employee(1,"Victor",5,1123)).second
|
|
==false);
|
|
BOOST_TEST(i3.push_front(employee(0,"Joe Jr.",5,2563)).second==false);
|
|
BOOST_TEST(i3.push_back(employee(0,"Joe Jr.",5,2563)).second==false);
|
|
BOOST_TEST(i5.emplace_front(1,"Victor",5,1123).second==false);
|
|
BOOST_TEST(i5.emplace_back(1,"Victor",5,1123).second==false);
|
|
|
|
employee_set_by_name::iterator it1=i1.find("Joe");
|
|
i1.insert(it1,employee(1,"Joe Jr.",5,2563));
|
|
BOOST_TEST(es.size()==2);
|
|
|
|
employee_set_by_age::iterator it2=i2.find(31);
|
|
i2.insert(it2,employee(2,"Grandda Joe",64,7881));
|
|
BOOST_TEST(es.size()==3);
|
|
|
|
employee_set_as_inserted::iterator it3=i3.begin();
|
|
i3.insert(it3,100,employee(3,"Judy",39,6201));
|
|
BOOST_TEST((--it3)->ssn==6201);
|
|
BOOST_TEST(es.size()==4);
|
|
|
|
employee_set_randomly::iterator it5=i5.begin();
|
|
i5.insert(it5,100,employee(4,"Jill",52,3379));
|
|
BOOST_TEST(i5.begin()->age==52);
|
|
BOOST_TEST(es.size()==5);
|
|
|
|
es.erase(employee(1,"Joe Jr.",5,2563));
|
|
BOOST_TEST(i3.size()==4&&i5.size()==4);
|
|
|
|
BOOST_TEST(i1.erase("Judy")==1);
|
|
BOOST_TEST(es.size()==3&&i2.size()==3);
|
|
|
|
BOOST_TEST(i2.erase(it2)->age==52);
|
|
BOOST_TEST(i3.size()==2&&i4.size()==2);
|
|
|
|
i3.pop_front();
|
|
BOOST_TEST(i1.size()==1&&i2.size()==1);
|
|
|
|
i5.erase(i5.begin(),i5.end());
|
|
BOOST_TEST(es.size()==0&&i3.size()==0);
|
|
|
|
i5.emplace(i5.end(),0,"Joe",31,1123);
|
|
BOOST_TEST(i1.erase(i1.begin())==i1.end());
|
|
BOOST_TEST(i1.size()==0);
|
|
|
|
i1.emplace(0,"Joe",31,1123);
|
|
i3.emplace(i3.begin(),1,"Jack",31,5032);
|
|
i4.emplace_hint(i4.end(),2,"James",31,3847);
|
|
BOOST_TEST(i2.erase(31)==3);
|
|
BOOST_TEST(i2.size()==0);
|
|
|
|
i3.emplace_front(1,"Jack",31,5032);
|
|
i3.emplace_back(0,"Joe",31,1123);
|
|
BOOST_TEST(i3.front()==employee(1,"Jack",31,5032));
|
|
BOOST_TEST(i3.back()==employee(0,"Joe",31,1123));
|
|
|
|
i3.pop_back();
|
|
BOOST_TEST(i3.back()==employee(1,"Jack",31,5032));
|
|
BOOST_TEST(es.size()==1);
|
|
|
|
i3.pop_front();
|
|
BOOST_TEST(es.size()==0);
|
|
|
|
i5.push_back(employee(1,"Jack",31,5032));
|
|
i5.push_front(employee(0,"Joe",31,1123));
|
|
i5.insert(i5.end()-1,employee(2,"Grandda Joe",64,7881));
|
|
BOOST_TEST(i5.back()==employee(1,"Jack",31,5032));
|
|
BOOST_TEST(i5.front()==employee(0,"Joe",31,1123));
|
|
BOOST_TEST(i5[0]==i5.front()&&i5.at(0)==i5.front());
|
|
BOOST_TEST(i5[i5.size()-1]==i5.back()&&i5.at(i5.size()-1)==i5.back());
|
|
|
|
i5.pop_front();
|
|
BOOST_TEST(i5.back()==employee(1,"Jack",31,5032));
|
|
BOOST_TEST(i5.front()==employee(2,"Grandda Joe",64,7881));
|
|
BOOST_TEST(es.size()==2);
|
|
|
|
i5.pop_back();
|
|
BOOST_TEST(i5.back()==employee(2,"Grandda Joe",64,7881));
|
|
BOOST_TEST(i5.front()==i5.front());
|
|
BOOST_TEST(es.size()==1);
|
|
|
|
i5.erase(i5.begin());
|
|
BOOST_TEST(es.size()==0);
|
|
|
|
std::vector<employee> ve;
|
|
ve.push_back(employee(3,"Anna",31,5388));
|
|
ve.push_back(employee(1,"Rachel",27,9012));
|
|
ve.push_back(employee(2,"Agatha",40,1520));
|
|
|
|
i1.insert(ve.begin(),ve.end());
|
|
BOOST_TEST(i2.size()==3);
|
|
|
|
#if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
|
|
i1.insert({{4,"Vanessa",20,9236},{5,"Penelope",55,2358}});
|
|
BOOST_TEST(i2.size()==5);
|
|
#endif
|
|
|
|
BOOST_TEST(i2.erase(i2.begin(),i2.end())==i2.end());
|
|
BOOST_TEST(es.size()==0);
|
|
|
|
i2.insert(ve.begin(),ve.end());
|
|
BOOST_TEST(i3.size()==3);
|
|
|
|
#if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
|
|
i2.insert({{4,"Vanessa",20,9236},{5,"Penelope",55,2358}});
|
|
BOOST_TEST(i3.size()==5);
|
|
#endif
|
|
|
|
BOOST_TEST(*(i3.erase(i3.begin()))==employee(1,"Rachel",27,9012));
|
|
BOOST_TEST(i3.erase(i3.begin(),i3.end())==i3.end());
|
|
BOOST_TEST(es.size()==0);
|
|
|
|
i3.insert(i3.end(),ve.begin(),ve.end());
|
|
BOOST_TEST(es.size()==3);
|
|
|
|
#if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
|
|
i3.insert(i3.begin(),{{4,"Vanessa",20,9236},{5,"Penelope",55,2358}});
|
|
BOOST_TEST(i3.front().name=="Vanessa");
|
|
BOOST_TEST(i4.size()==5);
|
|
#endif
|
|
|
|
BOOST_TEST(i4.erase(9012)==1);
|
|
i4.erase(i4.begin());
|
|
BOOST_TEST(i4.erase(i4.begin(),i4.end())==i4.end());
|
|
|
|
i4.insert(ve.begin(),ve.end());
|
|
BOOST_TEST(i5.size()==3);
|
|
|
|
BOOST_TEST(i5.erase(i5.begin(),i5.end())==i5.end());
|
|
BOOST_TEST(es.size()==0);
|
|
|
|
i5.insert(i5.begin(),ve.begin(),ve.end());
|
|
BOOST_TEST(i1.size()==3);
|
|
|
|
#if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
|
|
i5.insert(i5.end(),{{4,"Vanessa",20,9236},{5,"Penelope",55,2358}});
|
|
BOOST_TEST(i5.back().name=="Penelope");
|
|
BOOST_TEST(i1.size()==5);
|
|
#endif
|
|
|
|
BOOST_TEST(es.erase(es.begin(),es.end())==es.end());
|
|
BOOST_TEST(i2.size()==0);
|
|
|
|
es.insert(employee(0,"Joe",31,1123));
|
|
es.insert(employee(1,"Robert",27,5601));
|
|
es.insert(employee(2,"John",40,7889));
|
|
es.insert(employee(3,"Albert",20,9012));
|
|
es.insert(employee(4,"John",57,1002));
|
|
|
|
employee_set es_backup(es);
|
|
|
|
employee_set es2;
|
|
es2.insert(employee(3,"Anna",31,5388));
|
|
es2.insert(employee(1,"Rachel",27,9012));
|
|
es2.insert(employee(2,"Agatha",40,1520));
|
|
|
|
employee_set es2_backup(es2);
|
|
|
|
i1.swap(get<1>(es2));
|
|
BOOST_TEST(es==es2_backup&&es2==es_backup);
|
|
|
|
i2.swap(get<2>(es2));
|
|
BOOST_TEST(es==es_backup&&es2==es2_backup);
|
|
|
|
i3.swap(get<3>(es2));
|
|
BOOST_TEST(es==es2_backup&&es2==es_backup);
|
|
|
|
i4.swap(get<4>(es2));
|
|
BOOST_TEST(es==es_backup&&es2==es2_backup);
|
|
|
|
i5.swap(get<5>(es2));
|
|
BOOST_TEST(es==es2_backup&&es2==es_backup);
|
|
|
|
#if defined(BOOST_FUNCTION_SCOPE_USING_DECLARATION_BREAKS_ADL)
|
|
::boost::multi_index::detail::swap(i1,get<1>(es2));
|
|
#else
|
|
using std::swap;
|
|
swap(i1,get<1>(es2));
|
|
#endif
|
|
|
|
BOOST_TEST(es==es_backup&&es2==es2_backup);
|
|
|
|
#if defined(BOOST_FUNCTION_SCOPE_USING_DECLARATION_BREAKS_ADL)
|
|
::boost::multi_index::detail::swap(i2,get<2>(es2));
|
|
#else
|
|
using std::swap;
|
|
swap(i2,get<2>(es2));
|
|
#endif
|
|
|
|
BOOST_TEST(es==es2_backup&&es2==es_backup);
|
|
|
|
#if defined(BOOST_FUNCTION_SCOPE_USING_DECLARATION_BREAKS_ADL)
|
|
::boost::multi_index::detail::swap(i3,get<3>(es2));
|
|
#else
|
|
using std::swap;
|
|
swap(i3,get<3>(es2));
|
|
#endif
|
|
|
|
BOOST_TEST(es==es_backup&&es2==es2_backup);
|
|
|
|
#if defined(BOOST_FUNCTION_SCOPE_USING_DECLARATION_BREAKS_ADL)
|
|
::boost::multi_index::detail::swap(i4,get<4>(es2));
|
|
#else
|
|
using std::swap;
|
|
swap(i4,get<4>(es2));
|
|
#endif
|
|
|
|
BOOST_TEST(es==es2_backup&&es2==es_backup);
|
|
|
|
#if defined(BOOST_FUNCTION_SCOPE_USING_DECLARATION_BREAKS_ADL)
|
|
::boost::multi_index::detail::swap(i5,get<5>(es2));
|
|
#else
|
|
using std::swap;
|
|
swap(i5,get<5>(es2));
|
|
#endif
|
|
|
|
BOOST_TEST(es==es_backup&&es2==es2_backup);
|
|
|
|
i3.clear();
|
|
BOOST_TEST(i3.size()==0);
|
|
|
|
es=es2;
|
|
i4.clear();
|
|
BOOST_TEST(i4.size()==0);
|
|
|
|
es=es2;
|
|
i5.clear();
|
|
BOOST_TEST(i5.size()==0);
|
|
|
|
es2.clear();
|
|
BOOST_TEST(es2.size()==0);
|
|
|
|
/* non-copyable elements */
|
|
|
|
multi_index_container<
|
|
non_copyable_int,
|
|
indexed_by<
|
|
ordered_non_unique<member<non_copyable_int,int,&non_copyable_int::n> >,
|
|
hashed_non_unique<member<non_copyable_int,int,&non_copyable_int::n> >,
|
|
sequenced<>,
|
|
random_access<>
|
|
>
|
|
> ncic,ncic2;
|
|
|
|
ncic.emplace(1);
|
|
get<1>(ncic).emplace(1);
|
|
get<2>(ncic).emplace_back(1);
|
|
get<3>(ncic).emplace_back(1);
|
|
|
|
non_copyable_int nci(1);
|
|
ncic.insert(boost::move(nci));
|
|
BOOST_TEST(nci.n==0);
|
|
|
|
nci.n=1;
|
|
get<1>(ncic).insert(boost::move(nci));
|
|
BOOST_TEST(nci.n==0);
|
|
|
|
nci.n=1;
|
|
get<2>(ncic).push_back(boost::move(nci));
|
|
BOOST_TEST(nci.n==0);
|
|
|
|
nci.n=1;
|
|
get<3>(ncic).push_back(boost::move(nci));
|
|
BOOST_TEST(nci.n==0);
|
|
|
|
std::vector<int> vi(4,1);
|
|
const std::vector<int>& cvi=vi;
|
|
ncic.insert(vi.begin(),vi.end());
|
|
ncic.insert(cvi.begin(),cvi.end());
|
|
get<2>(ncic).insert(get<2>(ncic).begin(),vi.begin(),vi.end());
|
|
get<2>(ncic).insert(get<2>(ncic).begin(),cvi.begin(),cvi.end());
|
|
|
|
BOOST_TEST(ncic.count(1)==24);
|
|
|
|
ncic.swap(ncic2);
|
|
BOOST_TEST(ncic.empty());
|
|
BOOST_TEST(ncic2.count(1)==24);
|
|
|
|
/* testcase for problem reported at
|
|
* http://lists.boost.org/boost-users/2006/12/24215.php
|
|
*/
|
|
|
|
multi_index_container<
|
|
always_one,
|
|
indexed_by<
|
|
hashed_non_unique<identity<always_one> >
|
|
>
|
|
> aoc;
|
|
|
|
aoc.insert(always_one());
|
|
aoc.insert(always_one());
|
|
aoc.erase(*(aoc.begin()));
|
|
BOOST_TEST(aoc.empty());
|
|
|
|
/* Testcases for compliance with "as close to hint as possible"
|
|
* proposed behavior for associative containers:
|
|
* http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#233
|
|
* http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2005/n1780.html
|
|
*/
|
|
|
|
typedef multi_index_container<
|
|
int,
|
|
indexed_by<
|
|
ordered_non_unique<identity<int> >
|
|
>
|
|
> int_non_unique_container;
|
|
|
|
int_non_unique_container c;
|
|
c.insert(0);c.insert(0);
|
|
c.insert(1);c.insert(1);
|
|
c.insert(2);c.insert(2);
|
|
|
|
BOOST_TEST(std::distance(c.begin(),c.insert(c.begin(),1))==2);
|
|
BOOST_TEST(std::distance(c.begin(),c.insert(boost::next(c.begin()),1))==2);
|
|
BOOST_TEST(std::distance(c.begin(),c.insert(c.lower_bound(1),1))==2);
|
|
BOOST_TEST(
|
|
std::distance(c.begin(),c.insert(boost::next(c.lower_bound(1)),1))==3);
|
|
BOOST_TEST(std::distance(c.begin(),c.insert(c.upper_bound(1),1))==8);
|
|
BOOST_TEST(std::distance(c.begin(),c.insert(boost::prior(c.end()),1))==9);
|
|
BOOST_TEST(std::distance(c.begin(),c.insert(c.end(),1))==10);
|
|
|
|
/* testcase for erase() reentrancy */
|
|
{
|
|
linked_object o1(1);
|
|
linked_object o2(2,o1);
|
|
o1=o2;
|
|
}
|
|
|
|
/* testcases for bug reported at
|
|
* https://svn.boost.org/trac/boost/ticket/9665
|
|
*/
|
|
|
|
{
|
|
multi_index_container<
|
|
int,
|
|
indexed_by<hashed_unique<identity<int> > >
|
|
> hc;
|
|
hc.insert(tempvalue_iterator(0),tempvalue_iterator(10));
|
|
BOOST_TEST(hc.size()==10);
|
|
|
|
multi_index_container<
|
|
int,
|
|
indexed_by<ordered_unique<identity<int> > >
|
|
> oc;
|
|
oc.insert(tempvalue_iterator(0),tempvalue_iterator(10));
|
|
BOOST_TEST(oc.size()==10);
|
|
}
|
|
|
|
/* testcases for https://svn.boost.org/trac10/ticket/12542 */
|
|
|
|
{
|
|
multi_index_container<
|
|
int,
|
|
indexed_by<
|
|
ordered_unique<identity<int> >,
|
|
hashed_unique<identity<int> >
|
|
>
|
|
> ohc;
|
|
|
|
#if !(defined BOOST_NO_EXCEPTIONS)
|
|
ohc.insert(0);
|
|
ohc.insert(1);
|
|
|
|
try{
|
|
ohc.modify_key(ohc.begin(),change_int_and_throw(1));
|
|
}
|
|
catch(int){}
|
|
BOOST_TEST(ohc.size()==1);
|
|
ohc.clear();
|
|
|
|
ohc.insert(0);
|
|
ohc.insert(1);
|
|
|
|
try{
|
|
ohc.modify_key(ohc.begin(),change_int_and_throw(1),change_int(0));
|
|
}
|
|
catch(int){}
|
|
BOOST_TEST(ohc.size()==1);
|
|
ohc.clear();
|
|
|
|
ohc.insert(0);
|
|
ohc.insert(1);
|
|
|
|
try{
|
|
ohc.modify_key(
|
|
ohc.begin(),change_int_and_throw(1),change_int_and_throw(0));
|
|
}
|
|
catch(int){}
|
|
BOOST_TEST(ohc.size()==1);
|
|
ohc.clear();
|
|
|
|
ohc.insert(0);
|
|
ohc.insert(1);
|
|
|
|
try{
|
|
ohc.modify_key(ohc.begin(),change_int(1),change_int_and_throw(0));
|
|
}
|
|
catch(int){}
|
|
BOOST_TEST(ohc.size()==1);
|
|
ohc.clear();
|
|
#endif
|
|
|
|
ohc.insert(0);
|
|
ohc.insert(1);
|
|
|
|
ohc.modify_key(ohc.begin(),change_int(1),change_int(1));
|
|
BOOST_TEST(ohc.size()==1);
|
|
ohc.clear();
|
|
}
|
|
}
|