123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188 |
- /////////////////////////////////////////////////////////////////////////////
- //
- // (C) Copyright Olaf Krzikalla 2004-2006.
- // (C) Copyright Ion Gaztanaga 2006-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/any_hook.hpp>
- #include<boost/intrusive/slist.hpp>
- #include<boost/intrusive/rbtree.hpp>
- #include<boost/intrusive/list.hpp>
- #include<boost/intrusive/avltree.hpp>
- #include<boost/intrusive/sgtree.hpp>
- #include<boost/intrusive/splaytree.hpp>
- #include<boost/intrusive/treap.hpp>
- #include<boost/intrusive/hashtable.hpp>
- #include<boost/functional/hash.hpp>
- #include <vector> //std::vector
- #include <cstddef> //std::size_t
- using namespace boost::intrusive;
- class MyClass : public any_base_hook<>
- {
- int int_;
- public:
- //This is a member hook
- any_member_hook<> member_hook_;
- MyClass(int i = 0)
- : int_(i)
- {}
- int get() const
- { return this->int_; }
- 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 &o)
- { return boost::hash<int>()(o.get()); }
- friend bool priority_order(const MyClass &a, const MyClass &b)
- { return a.int_ < b.int_; }
- };
- void instantiation_test()
- {
- typedef member_hook< MyClass, any_member_hook<>, &MyClass::member_hook_> MemberHook;
- typedef base_hook< any_base_hook<> > BaseHook;
- MyClass myclass;
- {
- slist < MyClass, any_to_slist_hook< BaseHook > > slist_base;
- slist_base.push_front(myclass);
- }
- {
- slist < MyClass, any_to_slist_hook< MemberHook > > slist_member;
- slist_member.push_front(myclass);
- }
- {
- list < MyClass, any_to_list_hook< BaseHook > > list_base;
- list_base.push_front(myclass);
- }
- {
- list < MyClass, any_to_list_hook< MemberHook > > list_member;
- list_member.push_front(myclass);
- }
- {
- rbtree < MyClass, any_to_set_hook< BaseHook > > rbtree_base;
- rbtree_base.insert_unique(myclass);
- }
- {
- rbtree < MyClass, any_to_set_hook< MemberHook > > rbtree_member;
- rbtree_member.insert_unique(myclass);
- }
- {
- avltree < MyClass, any_to_avl_set_hook< BaseHook > > avltree_base;
- avltree_base.insert_unique(myclass);
- }
- {
- avltree < MyClass, any_to_avl_set_hook< MemberHook > > avltree_member;
- avltree_member.insert_unique(myclass);
- }
- {
- sgtree < MyClass, any_to_bs_set_hook< BaseHook > > sgtree_base;
- sgtree_base.insert_unique(myclass);
- }
- {
- sgtree < MyClass, any_to_bs_set_hook< MemberHook > > sgtree_member;
- sgtree_member.insert_unique(myclass);
- }
- {
- treap < MyClass, any_to_bs_set_hook< BaseHook > > treap_base;
- treap_base.insert_unique(myclass);
- }
- {
- treap < MyClass, any_to_bs_set_hook< MemberHook > > treap_member;
- treap_member.insert_unique(myclass);
- }
- {
- splaytree < MyClass, any_to_bs_set_hook< BaseHook > > splaytree_base;
- splaytree_base.insert_unique(myclass);
- }
- {
- splaytree < MyClass, any_to_bs_set_hook< MemberHook > > splaytree_member;
- splaytree_member.insert_unique(myclass);
- }
- typedef unordered_bucket<any_to_unordered_set_hook< BaseHook > >::type bucket_type;
- typedef unordered_default_bucket_traits<any_to_unordered_set_hook< BaseHook > >::type bucket_traits;
- bucket_type buckets[2];
- {
- hashtable < MyClass, any_to_unordered_set_hook< BaseHook > >
- hashtable_base(bucket_traits(&buckets[0], 1));
- hashtable_base.insert_unique(myclass);
- }
- {
- hashtable < MyClass, any_to_unordered_set_hook< MemberHook > >
- hashtable_member(bucket_traits(&buckets[1], 1));
- hashtable_member.insert_unique(myclass);
- }
- }
- bool simple_slist_test()
- {
- //Define an slist that will store MyClass using the public base hook
- typedef any_to_slist_hook< base_hook< any_base_hook<> > >BaseOption;
- typedef slist<MyClass, BaseOption, constant_time_size<false> > BaseList;
- //Define an slist that will store MyClass using the public member hook
- typedef any_to_slist_hook< member_hook<MyClass, any_member_hook<>, &MyClass::member_hook_> > MemberOption;
- typedef slist<MyClass, MemberOption> MemberList;
- 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));
- BaseList baselist;
- MemberList memberlist;
- //Now insert them in the reverse order in the base hook list
- for(VectIt it(values.begin()), itend(values.end()); it != itend; ++it)
- baselist.push_front(*it);
- //Now insert them in the same order as in vector in the member hook list
- for(BaseList::iterator it(baselist.begin()), itend(baselist.end())
- ; it != itend; ++it){
- memberlist.push_front(*it);
- }
- //Now test lists
- {
- BaseList::iterator bit(baselist.begin());
- MemberList::iterator mit(memberlist.begin());
- VectRit rit(values.rbegin()), ritend(values.rend());
- VectIt it(values.begin()), itend(values.end());
- //Test the objects inserted in the base hook list
- for(; rit != ritend; ++rit, ++bit)
- if(&*bit != &*rit) return false;
- //Test the objects inserted in the member hook list
- for(; it != itend; ++it, ++mit)
- if(&*mit != &*it) return false;
- }
- return true;
- }
- int main()
- {
- if(!simple_slist_test())
- return 1;
- instantiation_test();
- return 0;
- }
|