GCC2 workarounds; fixed permutation_iterator_example

[SVN r22048]

example/node_iterator2.hpp

@@ -44,9 +44,9 @@ class node_iter
 
 
 # if !BOOST_WORKAROUND(__GNUC__, == 2)
- private: // GCC2 can't even grant that friendship to template member functions
-# endif 
+ private: // GCC2 can't grant friendship to template member functions    
     friend class boost::iterator_core_access;
+# endif 
 
     template <class OtherValue>
     bool equal(node_iter<OtherValue> const& other) const
@@ -54,14 +54,14 @@ class node_iter
         return this->m_node == other.m_node;
     }
 
- private:
     void increment() { m_node = m_node->next(); }
 
     Value& dereference() const { return *m_node; }
 
 # ifdef BOOST_NO_MEMBER_TEMPLATE_FRIENDS
  public:
-# else 
+# else
+ private:
     template <class> friend class node_iter;
 # endif 
     Value* m_node;

example/node_iterator3.hpp

@@ -47,8 +47,10 @@ class node_iter
     )
       : super_t(other.base()) {}
 
- private:
+# if !BOOST_WORKAROUND(__GNUC__, == 2)
+ private: // GCC2 can't grant friendship to template member functions    
     friend class boost::iterator_core_access;
+# endif     
     void increment() { this->base_reference() = this->base()->next(); }
 };
 

example/permutation_iterator_example.cpp

@@ -1,6 +1,7 @@
 #include <iostream>
 #include <vector>
-#include <list>
+#include <deque>
+#include <algorithm>
 #include <boost/iterator/permutation_iterator.hpp>
 #include <boost/cstdlib.hpp>
 
@@ -10,7 +11,7 @@ int main() {
   int i = 0;
 
   typedef std::vector< int > element_range_type;
-  typedef std::list< int > index_type;
+  typedef std::deque< int > index_type;
 
   static const int element_range_size = 10;
   static const int index_size = 4;