First inclusion

[SVN r37593]

example/doc_iterator_from_value.cpp

@@ -0,0 +1,94 @@
+/////////////////////////////////////////////////////////////////////////////
+//
+// (C) Copyright Ion Gaztañaga  2006-2007
+//
+// 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.
+//
+/////////////////////////////////////////////////////////////////////////////
+//[doc_iterator_from_value
+#include <boost/intrusive/list.hpp>
+#include <boost/intrusive/unordered_set.hpp>
+#include <boost/functional/hash.hpp>
+#include <vector>
+
+class intrusive_data
+{
+   int data_id_;
+   public:
+
+   int get() const   {  return data_id_;  }
+   void set(int id)  {  data_id_ = id;    }
+
+   //This class can be inserted in an intrusive list
+   typedef boost::intrusive::
+      list_member_hook<>           list_member_hook_t;
+   list_member_hook_t     list_hook_;
+
+   //This class can be inserted in an intrusive unordered_set
+   typedef boost::intrusive::
+      unordered_set_member_hook<>  unordered_set_member_hook_t;
+   unordered_set_member_hook_t   unordered_set_hook_;
+
+   //Comparison operators
+   friend bool operator==(const intrusive_data &a, const intrusive_data &b)
+   {  return a.get() == b.get(); }
+
+   friend bool operator!=(const intrusive_data &a, const intrusive_data &b)
+   {  return a.get() != b.get(); }
+};
+
+//The hash function
+std::size_t hash_value(const intrusive_data &i)
+{  return boost::hash<int>()(i.get());  }
+
+//Definition of the intrusive list that will hold intrusive_data
+typedef boost::intrusive::list< intrusive_data::list_member_hook_t::
+   value_traits<intrusive_data, &intrusive_data::list_hook_> > list_t;
+
+//Definition of the intrusive unordered_set that will hold intrusive_data
+typedef boost::intrusive::unordered_set< intrusive_data::unordered_set_member_hook_t::
+   value_traits<intrusive_data, &intrusive_data::unordered_set_hook_> > unordered_set_t;
+
+int main()
+{
+   //Create MaxElem objects
+   const int MaxElem = 100;
+   std::vector<intrusive_data> nodes(MaxElem);
+
+   //Declare the intrusive containers
+   list_t     list;
+   unordered_set_t::bucket_type buckets[MaxElem];
+   unordered_set_t  unordered_set(buckets, MaxElem);
+
+   //Initialize all the nodes
+   for(int i = 0; i < MaxElem; ++i)
+      nodes[i].set(i);
+
+   //Now insert them in both intrusive containers
+   list.insert(list.end(), nodes.begin(), nodes.end());
+   unordered_set.insert(nodes.begin(), nodes.end());
+
+   //Now check list::iterator_to
+   //which is an static member function
+   list_t::iterator list_it(list.begin());
+   for(int i = 0; i < MaxElem; ++i, ++list_it)
+      if(list_t::iterator_to(nodes[i]) != list_it)
+         return 1;
+
+   //Now check unordered_set::iterator_to (which is a member function)
+   //and unordered_set::local_current (which is an static member function)
+   unordered_set_t::iterator unordered_set_it(unordered_set.begin());
+   for(int i = 0; i < MaxElem; ++i, ++unordered_set_it){
+      if(unordered_set.iterator_to(nodes[i]) != unordered_set.find(nodes[i]))
+         return 1;
+      if(*unordered_set_t::local_iterator_to(nodes[i]) != *unordered_set.find(nodes[i]))
+         return 1;
+   }
+
+   return 0;
+}
+//]