214 lines
7.9 KiB
C++
214 lines
7.9 KiB
C++
/////////////////////////////////////////////////////////////////////////////
|
|
//
|
|
// (C) Copyright Ion Gaztanaga 2007-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/intrusive for documentation.
|
|
//
|
|
/////////////////////////////////////////////////////////////////////////////
|
|
#include <boost/intrusive/list.hpp>
|
|
#include <boost/intrusive/slist.hpp>
|
|
#include <boost/intrusive/set.hpp>
|
|
#include <boost/intrusive/unordered_set.hpp>
|
|
#include <boost/intrusive/avl_set.hpp>
|
|
#include <boost/intrusive/sg_set.hpp>
|
|
#include <boost/intrusive/splay_set.hpp>
|
|
#include <boost/intrusive/bs_set.hpp>
|
|
#include <boost/intrusive/treap_set.hpp>
|
|
#include <boost/intrusive/detail/mpl.hpp>
|
|
#include <boost/intrusive/pointer_traits.hpp>
|
|
#include <boost/static_assert.hpp>
|
|
#include "smart_ptr.hpp"
|
|
#include <vector>
|
|
|
|
using namespace boost::intrusive;
|
|
|
|
struct my_tag;
|
|
struct my_tag2;
|
|
struct my_tag3;
|
|
|
|
typedef make_bs_set_base_hook
|
|
< void_pointer<smart_ptr<void> >, link_mode<normal_link>
|
|
, tag<my_tag> >::type TreapHook;
|
|
typedef make_bs_set_base_hook
|
|
< void_pointer<smart_ptr<void> >, link_mode<normal_link>
|
|
, tag<my_tag2> >::type SplayHook;
|
|
typedef make_bs_set_base_hook
|
|
< void_pointer<smart_ptr<void> >, link_mode<normal_link>
|
|
, tag<my_tag3> >::type BsHook;
|
|
|
|
class MyClass
|
|
: public make_list_base_hook
|
|
< void_pointer<smart_ptr<void> >, link_mode<normal_link> >::type
|
|
, public make_slist_base_hook
|
|
< void_pointer<smart_ptr<void> >, link_mode<normal_link> >::type
|
|
, public make_set_base_hook
|
|
< void_pointer<smart_ptr<void> >, link_mode<normal_link> >::type
|
|
, public make_unordered_set_base_hook
|
|
< void_pointer<smart_ptr<void> >, link_mode<normal_link> >::type
|
|
, public make_avl_set_base_hook
|
|
< void_pointer<smart_ptr<void> >, link_mode<normal_link> >::type
|
|
, public make_bs_set_base_hook
|
|
< void_pointer<smart_ptr<void> >, link_mode<normal_link> >::type
|
|
, public TreapHook
|
|
, public SplayHook
|
|
, public BsHook
|
|
{
|
|
int int_;
|
|
|
|
public:
|
|
MyClass(int i)
|
|
: int_(i)
|
|
{}
|
|
|
|
friend bool operator<(const MyClass &l, const MyClass &r)
|
|
{ return l.int_ < r.int_; }
|
|
|
|
friend bool operator==(const MyClass &l, const MyClass &r)
|
|
{ return l.int_ == r.int_; }
|
|
|
|
friend std::size_t hash_value(const MyClass &v)
|
|
{ return boost::hash_value(v.int_); }
|
|
|
|
friend bool priority_order(const MyClass &l, const MyClass &r)
|
|
{ return l.int_ < r.int_; }
|
|
};
|
|
|
|
//Define a list that will store MyClass using the public base hook
|
|
typedef make_list<MyClass>::type List;
|
|
typedef make_slist<MyClass>::type Slist;
|
|
typedef make_set<MyClass>::type Set;
|
|
typedef make_unordered_set<MyClass>::type USet;
|
|
|
|
typedef make_avl_set<MyClass>::type AvlSet;
|
|
typedef make_sg_set<MyClass>::type SgSet;
|
|
typedef make_treap_set<MyClass
|
|
, base_hook<TreapHook> >::type TreapSet;
|
|
typedef make_splay_set<MyClass
|
|
, base_hook<SplayHook> >::type SplaySet;
|
|
typedef make_bs_set<MyClass
|
|
, base_hook<BsHook> >::type BsSet;
|
|
|
|
int main()
|
|
{
|
|
typedef std::vector<MyClass>::iterator VectIt;
|
|
typedef std::vector<MyClass>::reverse_iterator VectRit;
|
|
|
|
//Create several MyClass objects, each one with a different value
|
|
std::vector<MyClass> values;
|
|
for(int i = 0; i < 100; ++i) values.push_back(MyClass(i));
|
|
|
|
USet::bucket_type buckets[100];
|
|
|
|
List my_list;
|
|
Slist my_slist;
|
|
Set my_set;
|
|
USet my_uset(USet::bucket_traits
|
|
(pointer_traits<USet::bucket_ptr>::pointer_to(buckets[0]), 100));
|
|
|
|
AvlSet my_avlset;
|
|
SplaySet my_splayset;
|
|
BsSet my_bsset;
|
|
SgSet my_sgset;
|
|
TreapSet my_treapset;
|
|
|
|
//Now insert them in containers
|
|
for(VectIt it(values.begin()), itend(values.end()); it != itend; ++it){
|
|
my_list.push_front(*it);
|
|
my_slist.push_front(*it);
|
|
my_set.insert(*it);
|
|
my_uset.insert(*it);
|
|
my_avlset.insert(*it);
|
|
my_splayset.insert(*it);
|
|
my_bsset.insert(*it);
|
|
my_sgset.insert(*it);
|
|
my_treapset.insert(*it);
|
|
}
|
|
|
|
//Now test lists
|
|
{
|
|
List::const_iterator list_it(my_list.cbegin());
|
|
Slist::const_iterator slist_it(my_slist.cbegin());
|
|
Set::const_reverse_iterator set_rit(my_set.crbegin());
|
|
|
|
AvlSet::const_reverse_iterator avlset_rit(my_avlset.crbegin());
|
|
SplaySet::const_reverse_iterator splayset_rit(my_splayset.crbegin());
|
|
BsSet::const_reverse_iterator bsset_rit(my_bsset.crbegin());
|
|
SgSet::const_reverse_iterator sgset_rit(my_sgset.crbegin());
|
|
TreapSet::const_reverse_iterator treapset_rit(my_treapset.crbegin());
|
|
|
|
VectRit vect_it(values.rbegin()), vect_itend(values.rend());
|
|
|
|
//Test the objects inserted in the base hook list
|
|
for( ; vect_it != vect_itend
|
|
; ++vect_it, ++list_it, ++slist_it, ++set_rit
|
|
, ++avlset_rit, ++splayset_rit, ++bsset_rit, ++sgset_rit, ++treapset_rit
|
|
){
|
|
if(&*list_it != &*vect_it) return 1;
|
|
if(&*slist_it != &*vect_it) return 1;
|
|
if(&*set_rit != &*vect_it) return 1;
|
|
if(my_uset.find(*set_rit) == my_uset.cend()) return 1;
|
|
if(&*avlset_rit != &*vect_it) return 1;
|
|
if(&*splayset_rit != &*vect_it) return 1;
|
|
if(&*bsset_rit != &*vect_it) return 1;
|
|
if(&*sgset_rit != &*vect_it) return 1;
|
|
if(&*treapset_rit != &*vect_it) return 1;
|
|
}
|
|
}
|
|
|
|
//Check defined types and implicitly defined types are equal
|
|
BOOST_STATIC_ASSERT((detail::is_same<make_list_base_hook<void_pointer<void*>, link_mode<safe_link> >::type
|
|
,make_list_base_hook<>::type
|
|
>::value));
|
|
|
|
BOOST_STATIC_ASSERT((detail::is_same<make_slist_base_hook<void_pointer<void*>, link_mode<safe_link> >::type
|
|
,make_slist_base_hook<>::type
|
|
>::value));
|
|
|
|
BOOST_STATIC_ASSERT((detail::is_same<make_set_base_hook<void_pointer<void*>, link_mode<safe_link> >::type
|
|
,make_set_base_hook<>::type
|
|
>::value));
|
|
|
|
BOOST_STATIC_ASSERT((detail::is_same<make_unordered_set_base_hook<void_pointer<void*>, link_mode<safe_link> >::type
|
|
,make_unordered_set_base_hook<>::type
|
|
>::value));
|
|
|
|
BOOST_STATIC_ASSERT((detail::is_same<make_avl_set_base_hook<void_pointer<void*>, link_mode<safe_link> >::type
|
|
,make_avl_set_base_hook<>::type
|
|
>::value));
|
|
|
|
BOOST_STATIC_ASSERT((detail::is_same<make_bs_set_base_hook<void_pointer<void*>, link_mode<safe_link> >::type
|
|
,make_bs_set_base_hook<>::type
|
|
>::value));
|
|
|
|
//Check defined types and implicitly defined types are unequal
|
|
BOOST_STATIC_ASSERT(!(detail::is_same<make_list_base_hook<void_pointer<void*>, link_mode<normal_link> >::type
|
|
,make_list_base_hook<>::type
|
|
>::value));
|
|
|
|
BOOST_STATIC_ASSERT(!(detail::is_same<make_slist_base_hook<void_pointer<void*>, link_mode<normal_link> >::type
|
|
,make_slist_base_hook<>::type
|
|
>::value));
|
|
|
|
BOOST_STATIC_ASSERT(!(detail::is_same<make_set_base_hook<void_pointer<void*>, link_mode<normal_link> >::type
|
|
,make_set_base_hook<>::type
|
|
>::value));
|
|
|
|
BOOST_STATIC_ASSERT(!(detail::is_same<make_unordered_set_base_hook<void_pointer<void*>, link_mode<normal_link> >::type
|
|
,make_unordered_set_base_hook<>::type
|
|
>::value));
|
|
|
|
BOOST_STATIC_ASSERT(!(detail::is_same<make_avl_set_base_hook<void_pointer<void*>, link_mode<normal_link> >::type
|
|
,make_avl_set_base_hook<>::type
|
|
>::value));
|
|
|
|
BOOST_STATIC_ASSERT(!(detail::is_same<make_bs_set_base_hook<void_pointer<void*>, link_mode<normal_link> >::type
|
|
,make_bs_set_base_hook<>::type
|
|
>::value));
|
|
|
|
return 0;
|
|
}
|