From bae46b3906f4550c4af9a3733a6a061e31c9dea9 Mon Sep 17 00:00:00 2001 From: Daniel James Date: Fri, 21 Jan 2011 09:17:08 +0000 Subject: [PATCH] Branch to work on filename handling without disturbing trunk. [SVN r68345] --- development/boost/iterator_categories.hpp | 159 ----- development/boost/iterator_concepts.hpp | 172 ----- development/libs/iterator/concept_tests.cpp | 73 -- .../libs/iterator/iterator_categories.htm | 160 ----- .../libs/iterator/iterator_concepts.fig | 37 - .../libs/iterator/iterator_concepts.gif | Bin 3287 -> 0 bytes .../libs/iterator/iterator_concepts.htm | 663 ------------------ doc/BidirectionalTraversal.rst | 0 doc/ForwardTraversal.rst | 0 doc/GNUmakefile | 0 doc/IncrementableIterator.rst | 0 doc/LvalueIterator.rst | 0 doc/ReadableIterator.rst | 0 doc/SinglePassIterator.rst | 0 doc/SwappableIterator.rst | 0 doc/WritableIterator.rst | 0 doc/counting_iterator.pdf | Bin doc/docutils.sty | 0 doc/facade-and-adaptor.html | 0 doc/facade-and-adaptor.pdf | Bin doc/facade_iterator_category.rst | 0 doc/filter_iterator.pdf | Bin doc/function_output_iterator.pdf | Bin doc/indirect_iterator.pdf | Bin doc/indirect_reference_ref.rst | 0 doc/interoperability-revisited.rst | 0 doc/issues.rst | 0 doc/iterator_adaptor.pdf | Bin doc/iterator_adaptor_tutorial.rst | 0 doc/iterator_archetypes.html | 0 doc/iterator_archetypes.pdf | Bin doc/iterator_archetypes.rst | 0 doc/iterator_concepts.pdf | Bin doc/iterator_concepts.rst | 0 doc/iterator_facade.pdf | Bin doc/iterator_facade_tutorial.rst | 0 doc/iterator_traits.html | 0 doc/iterator_traits.pdf | Bin doc/iterator_traits.rst | 0 doc/make_counting_iterator.rst | 0 doc/make_filter_iterator.rst | 0 doc/make_transform_iterator.rst | 0 doc/make_zip_iterator.rst | 0 doc/new-iter-concepts.html | 0 doc/new-iter-concepts.pdf | Bin doc/permutation_iterator.pdf | Bin doc/pointee.html | 0 doc/pointee.pdf | Bin doc/pointee.rst | 0 doc/pointee_ref.rst | 0 doc/reverse_iterator.pdf | Bin doc/transform_iterator.pdf | Bin doc/transform_iterator_eg.rst | 0 doc/zip_iterator.html | 0 doc/zip_iterator.pdf | Bin doc/zip_iterator.rst | 0 doc/zip_iterator_abstract.rst | 0 doc/zip_iterator_eg.rst | 0 doc/zip_iterator_ref.rst | 0 example/node.hpp | 0 example/node_iterator1.cpp | 0 example/node_iterator1.hpp | 0 example/node_iterator2.cpp | 0 example/node_iterator2.hpp | 0 example/node_iterator3.cpp | 0 example/node_iterator3.hpp | 0 .../iterator/detail/any_conversion_eater.hpp | 0 .../detail/facade_iterator_category.hpp | 0 .../iterator/detail/minimum_category.hpp | 0 include/boost/iterator/is_lvalue_iterator.hpp | 0 .../boost/iterator/is_readable_iterator.hpp | 0 include/boost/pointee.hpp | 0 index.html | 0 test/constant_iter_arrow.cpp | 0 test/constant_iter_arrow_fail.cpp | 0 test/interoperable.cpp | 0 test/is_lvalue_iterator.cpp | 0 test/is_readable_iterator.cpp | 0 test/iter_archetype_default_ctor.cpp | 0 test/pointee.cpp | 0 80 files changed, 1264 deletions(-) delete mode 100644 development/boost/iterator_categories.hpp delete mode 100644 development/boost/iterator_concepts.hpp delete mode 100644 development/libs/iterator/concept_tests.cpp delete mode 100644 development/libs/iterator/iterator_categories.htm delete mode 100644 development/libs/iterator/iterator_concepts.fig delete mode 100644 development/libs/iterator/iterator_concepts.gif delete mode 100644 development/libs/iterator/iterator_concepts.htm mode change 100755 => 100644 doc/BidirectionalTraversal.rst mode change 100755 => 100644 doc/ForwardTraversal.rst mode change 100755 => 100644 doc/GNUmakefile mode change 100755 => 100644 doc/IncrementableIterator.rst mode change 100755 => 100644 doc/LvalueIterator.rst mode change 100755 => 100644 doc/ReadableIterator.rst mode change 100755 => 100644 doc/SinglePassIterator.rst mode change 100755 => 100644 doc/SwappableIterator.rst mode change 100755 => 100644 doc/WritableIterator.rst mode change 100755 => 100644 doc/counting_iterator.pdf mode change 100755 => 100644 doc/docutils.sty mode change 100755 => 100644 doc/facade-and-adaptor.html mode change 100755 => 100644 doc/facade-and-adaptor.pdf mode change 100755 => 100644 doc/facade_iterator_category.rst mode change 100755 => 100644 doc/filter_iterator.pdf mode change 100755 => 100644 doc/function_output_iterator.pdf mode change 100755 => 100644 doc/indirect_iterator.pdf mode change 100755 => 100644 doc/indirect_reference_ref.rst mode change 100755 => 100644 doc/interoperability-revisited.rst mode change 100755 => 100644 doc/issues.rst mode change 100755 => 100644 doc/iterator_adaptor.pdf mode change 100755 => 100644 doc/iterator_adaptor_tutorial.rst mode change 100755 => 100644 doc/iterator_archetypes.html mode change 100755 => 100644 doc/iterator_archetypes.pdf mode change 100755 => 100644 doc/iterator_archetypes.rst mode change 100755 => 100644 doc/iterator_concepts.pdf mode change 100755 => 100644 doc/iterator_concepts.rst mode change 100755 => 100644 doc/iterator_facade.pdf mode change 100755 => 100644 doc/iterator_facade_tutorial.rst mode change 100755 => 100644 doc/iterator_traits.html mode change 100755 => 100644 doc/iterator_traits.pdf mode change 100755 => 100644 doc/iterator_traits.rst mode change 100755 => 100644 doc/make_counting_iterator.rst mode change 100755 => 100644 doc/make_filter_iterator.rst mode change 100755 => 100644 doc/make_transform_iterator.rst mode change 100755 => 100644 doc/make_zip_iterator.rst mode change 100755 => 100644 doc/new-iter-concepts.html mode change 100755 => 100644 doc/new-iter-concepts.pdf mode change 100755 => 100644 doc/permutation_iterator.pdf mode change 100755 => 100644 doc/pointee.html mode change 100755 => 100644 doc/pointee.pdf mode change 100755 => 100644 doc/pointee.rst mode change 100755 => 100644 doc/pointee_ref.rst mode change 100755 => 100644 doc/reverse_iterator.pdf mode change 100755 => 100644 doc/transform_iterator.pdf mode change 100755 => 100644 doc/transform_iterator_eg.rst mode change 100755 => 100644 doc/zip_iterator.html mode change 100755 => 100644 doc/zip_iterator.pdf mode change 100755 => 100644 doc/zip_iterator.rst mode change 100755 => 100644 doc/zip_iterator_abstract.rst mode change 100755 => 100644 doc/zip_iterator_eg.rst mode change 100755 => 100644 doc/zip_iterator_ref.rst mode change 100755 => 100644 example/node.hpp mode change 100755 => 100644 example/node_iterator1.cpp mode change 100755 => 100644 example/node_iterator1.hpp mode change 100755 => 100644 example/node_iterator2.cpp mode change 100755 => 100644 example/node_iterator2.hpp mode change 100755 => 100644 example/node_iterator3.cpp mode change 100755 => 100644 example/node_iterator3.hpp mode change 100755 => 100644 include/boost/iterator/detail/any_conversion_eater.hpp mode change 100755 => 100644 include/boost/iterator/detail/facade_iterator_category.hpp mode change 100755 => 100644 include/boost/iterator/detail/minimum_category.hpp mode change 100755 => 100644 include/boost/iterator/is_lvalue_iterator.hpp mode change 100755 => 100644 include/boost/iterator/is_readable_iterator.hpp mode change 100755 => 100644 include/boost/pointee.hpp mode change 100755 => 100644 index.html mode change 100755 => 100644 test/constant_iter_arrow.cpp mode change 100755 => 100644 test/constant_iter_arrow_fail.cpp mode change 100755 => 100644 test/interoperable.cpp mode change 100755 => 100644 test/is_lvalue_iterator.cpp mode change 100755 => 100644 test/is_readable_iterator.cpp mode change 100755 => 100644 test/iter_archetype_default_ctor.cpp mode change 100755 => 100644 test/pointee.cpp diff --git a/development/boost/iterator_categories.hpp b/development/boost/iterator_categories.hpp deleted file mode 100644 index 138a5be..0000000 --- a/development/boost/iterator_categories.hpp +++ /dev/null @@ -1,159 +0,0 @@ -#ifndef BOOST_ITERATOR_CATEGORIES_HPP -#define BOOST_ITERATOR_CATEGORIES_HPP - -#include -#include -#include -#include -#include - -namespace boost { - - // Return Type Categories - struct readable_iterator_tag { }; - struct writable_iterator_tag { }; - struct swappable_iterator_tag { }; - struct mutable_lvalue_iterator_tag : - virtual public writable_iterator_tag, - virtual public readable_iterator_tag { }; - struct constant_lvalue_iterator_tag : - virtual public readable_iterator_tag { }; - - // Traversal Categories - struct forward_traversal_tag { }; - struct bidirectional_traversal_tag : public forward_traversal_tag { }; - struct random_access_traversal_tag : public bidirectional_traversal_tag { }; - - struct error_iterator_tag { }; - - // Inherit from iterator_base if your iterator defines its own - // return_category and traversal_category. Otherwise, the "old style" - // iterator category will be mapped to the return_category and - // traversal_category. - struct new_iterator_base { }; - - namespace detail { - - struct return_category_from_nested_type { - template struct bind { - typedef typename Iterator::return_category type; - }; - }; - - struct traversal_category_from_nested_type { - template struct bind { - typedef typename Iterator::traversal_category type; - }; - }; - - template - struct choose_lvalue_return { - typedef typename ct_if::value, - boost::constant_lvalue_iterator_tag, - boost::mutable_lvalue_iterator_tag>::type type; - }; - - - template - struct iter_category_to_return { - typedef typename ct_if< - is_convertible::value, - typename choose_lvalue_return::type, - typename ct_if< - is_convertible::value, - boost::readable_iterator_tag, - typename ct_if< - is_convertible::value, - boost::writable_iterator_tag, - boost::error_iterator_tag - >::type - >::type - >::type type; - }; - - template - struct iter_category_to_traversal { - typedef typename ct_if< - is_convertible::value, - random_access_traversal_tag, - typename ct_if< - is_convertible::value, - bidirectional_traversal_tag, - forward_traversal_tag - >::type - >::type type; - }; - - struct return_category_from_old_traits { - template class bind { - typedef boost::detail::iterator_traits OldTraits; - typedef typename OldTraits::iterator_category Cat; - typedef typename OldTraits::value_type value_type; - public: - typedef iter_category_to_return::type type; - }; - }; - - struct traversal_category_from_old_traits { - template class bind { - typedef boost::detail::iterator_traits OldTraits; - typedef typename OldTraits::iterator_category Cat; - public: - typedef iter_category_to_traversal::type type; - }; - }; - - template - class choose_return_category { - typedef typename ct_if::value, - return_category_from_nested_type, - return_category_from_old_traits>::type Choice; - public: - typedef typename Choice:: template bind::type type; - }; - - template - class choose_traversal_category { - typedef typename ct_if::value, - traversal_category_from_nested_type, - traversal_category_from_old_traits>::type Choice; - public: - typedef typename Choice:: template bind::type type; - }; - - } // namespace detail - - template - struct return_category { - typedef typename detail::choose_return_category::type type; - }; - - - template - struct traversal_category { - typedef typename detail::choose_traversal_category::type type; - }; - -#if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) - - template - struct return_category - { - typedef typename ct_if::value, - constant_lvalue_iterator_tag, - mutable_lvalue_iterator_tag>::type type; - }; - - template - struct traversal_category - { - typedef random_access_traversal_tag type; - }; - -#endif - -} // namespace boost - -#endif // BOOST_ITERATOR_CATEGORIES_HPP diff --git a/development/boost/iterator_concepts.hpp b/development/boost/iterator_concepts.hpp deleted file mode 100644 index a30ff17..0000000 --- a/development/boost/iterator_concepts.hpp +++ /dev/null @@ -1,172 +0,0 @@ -#ifndef BOOST_ITERATOR_CONCEPTS_HPP -#define BOOST_ITERATOR_CONCEPTS_HPP - -#include -#include -#include -#include - -namespace boost_concepts { - // Used a different namespace here (instead of "boost") so that the - // concept descriptions do not take for granted the names in - // namespace boost. - - - //=========================================================================== - // Iterator Access Concepts - - template - class ReadableIteratorConcept { - public: - typedef typename std::iterator_traits::value_type value_type; - typedef typename std::iterator_traits::reference reference; - typedef typename boost::return_category::type return_category; - - void constraints() { - boost::function_requires< boost::SGIAssignableConcept >(); - boost::function_requires< boost::EqualityComparableConcept >(); - boost::function_requires< - boost::DefaultConstructibleConcept >(); - - BOOST_STATIC_ASSERT((boost::is_convertible::value)); - - reference r = *i; // or perhaps read(x) - value_type v(r); - boost::ignore_unused_variable_warning(v); - } - Iterator i; - }; - - template - class WritableIteratorConcept { - public: - typedef typename boost::return_category::type return_category; - - void constraints() { - boost::function_requires< boost::SGIAssignableConcept >(); - boost::function_requires< boost::EqualityComparableConcept >(); - boost::function_requires< - boost::DefaultConstructibleConcept >(); - - BOOST_STATIC_ASSERT((boost::is_convertible::value)); - - *i = v; // a good alternative could be something like write(x, v) - } - ValueType v; - Iterator i; - }; - - template - class ConstantLvalueIteratorConcept { - public: - typedef typename std::iterator_traits::value_type value_type; - typedef typename std::iterator_traits::reference reference; - typedef typename boost::return_category::type return_category; - - void constraints() { - boost::function_requires< ReadableIteratorConcept >(); - - BOOST_STATIC_ASSERT((boost::is_convertible::value)); - - BOOST_STATIC_ASSERT((boost::is_same::value)); - - reference v = *i; - boost::ignore_unused_variable_warning(v); - } - Iterator i; - }; - - template - class MutableLvalueIteratorConcept { - public: - typedef typename std::iterator_traits::value_type value_type; - typedef typename std::iterator_traits::reference reference; - typedef typename boost::return_category::type return_category; - - void constraints() { - boost::function_requires< ReadableIteratorConcept >(); - boost::function_requires< - WritableIteratorConcept >(); - - BOOST_STATIC_ASSERT((boost::is_convertible::value)); - - BOOST_STATIC_ASSERT((boost::is_same::value)); - - reference v = *i; - boost::ignore_unused_variable_warning(v); - } - Iterator i; - }; - - //=========================================================================== - // Iterator Traversal Concepts - - template - class ForwardIteratorConcept { - public: - typedef typename boost::traversal_category::type traversal_category; - - void constraints() { - boost::function_requires< boost::SGIAssignableConcept >(); - boost::function_requires< boost::EqualityComparableConcept >(); - boost::function_requires< - boost::DefaultConstructibleConcept >(); - - BOOST_STATIC_ASSERT((boost::is_convertible::value)); - ++i; - (void)i++; - } - Iterator i; - }; - - template - class BidirectionalIteratorConcept { - public: - typedef typename boost::traversal_category::type traversal_category; - - void constraints() { - boost::function_requires< ForwardIteratorConcept >(); - - BOOST_STATIC_ASSERT((boost::is_convertible::value)); - - --i; - (void)i--; - } - Iterator i; - }; - - template - class RandomAccessIteratorConcept { - public: - typedef typename boost::traversal_category::type traversal_category; - typedef typename std::iterator_traits::difference_type - difference_type; - - void constraints() { - boost::function_requires< BidirectionalIteratorConcept >(); - - BOOST_STATIC_ASSERT((boost::is_convertible::value)); - - i += n; - i = i + n; - i = n + i; - i -= n; - i = i - n; - n = i - j; - } - difference_type n; - Iterator i, j; - }; - -} // namespace boost_concepts - - -#endif // BOOST_ITERATOR_CONCEPTS_HPP diff --git a/development/libs/iterator/concept_tests.cpp b/development/libs/iterator/concept_tests.cpp deleted file mode 100644 index f75f311..0000000 --- a/development/libs/iterator/concept_tests.cpp +++ /dev/null @@ -1,73 +0,0 @@ -#include -#include - -struct new_iterator - : public boost::iterator, - public boost::new_iterator_base -{ - typedef boost::random_access_traversal_tag traversal_category; - typedef boost::mutable_lvalue_iterator_tag return_category; - - int& operator*() const { return *m_x; } - new_iterator& operator++() { return *this; } - new_iterator operator++(int) { return *this; } - new_iterator& operator--() { return *this; } - new_iterator operator--(int) { return *this; } - new_iterator& operator+=(std::ptrdiff_t) { return *this; } - new_iterator operator+(std::ptrdiff_t) { return *this; } - new_iterator& operator-=(std::ptrdiff_t) { return *this; } - std::ptrdiff_t operator-(const new_iterator&) const { return 0; } - new_iterator operator-(std::ptrdiff_t) const { return *this; } - bool operator==(const new_iterator&) const { return false; } - bool operator!=(const new_iterator&) const { return false; } - bool operator<(const new_iterator&) const { return false; } - int* m_x; -}; -new_iterator operator+(std::ptrdiff_t, new_iterator x) { return x; } - -struct old_iterator - : public boost::iterator -{ - int& operator*() const { return *m_x; } - old_iterator& operator++() { return *this; } - old_iterator operator++(int) { return *this; } - old_iterator& operator--() { return *this; } - old_iterator operator--(int) { return *this; } - old_iterator& operator+=(std::ptrdiff_t) { return *this; } - old_iterator operator+(std::ptrdiff_t) { return *this; } - old_iterator& operator-=(std::ptrdiff_t) { return *this; } - old_iterator operator-(std::ptrdiff_t) const { return *this; } - std::ptrdiff_t operator-(const old_iterator&) const { return 0; } - bool operator==(const old_iterator&) const { return false; } - bool operator!=(const old_iterator&) const { return false; } - bool operator<(const old_iterator&) const { return false; } - int* m_x; -}; -old_iterator operator+(std::ptrdiff_t, old_iterator x) { return x; } - -int -main() -{ -#if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) - boost::function_requires< - boost_concepts::MutableLvalueIteratorConcept >(); - boost::function_requires< - boost_concepts::RandomAccessIteratorConcept >(); - - boost::function_requires< - boost_concepts::ConstantLvalueIteratorConcept >(); - boost::function_requires< - boost_concepts::RandomAccessIteratorConcept >(); -#endif - - boost::function_requires< - boost_concepts::MutableLvalueIteratorConcept >(); - boost::function_requires< - boost_concepts::RandomAccessIteratorConcept >(); - - boost::function_requires< - boost_concepts::MutableLvalueIteratorConcept >(); - boost::function_requires< - boost_concepts::RandomAccessIteratorConcept >(); - return 0; -} diff --git a/development/libs/iterator/iterator_categories.htm b/development/libs/iterator/iterator_categories.htm deleted file mode 100644 index 83c29e5..0000000 --- a/development/libs/iterator/iterator_categories.htm +++ /dev/null @@ -1,160 +0,0 @@ - - - - Boost Iterator Traits - - - -C++ Boost -
- -

Boost Iterator Category Traits

-Header boost/iterator_categories.hpp - -

-The boost::traversal_category and -boost::return_category traits classes provides access to the -category tags for iterators that model the Boost Iterator Concepts, which are a -replacement for the iterator requirements in the C++ standard. The -other associated types of the Boost iterator concepts are accessed -through the std::iterator_traits class. - -

    -
  • traversal_category<Iter>::type   Can the iterator go forward, backward, etc.? -
  • return_category<Iter>::type   Is the iterator read or write only? - Is the dereferenced type an lvalue? -
- -

-An important feature of the boost::traversal_category and -boost::return_category classes is that they are backwards -compatible, i.e., they automatically work for iterators for which -there are valid definitions of std::iterator_traits. The old -iterator_category is mapped to the appropriate traversal and -return categories. - -

-When creating a new iterator type that is meant to work with -boost::traversal_category and -boost::return_category, you can either create a -specialization of these classes for your iterator type, or you can -provide all the necessary associated types as nested typedefs. In -this case, your iterator class will need to inherit from -new_iterator_base to let the category traits know -that it will be able to find typedefs for traversal_category -and return_category in you iterator class. - - -Each of the new iterator requirements will need a category tag. - -

-namespace boost {
-
-  // Return Type Categories
-  struct readable_iterator_tag { };
-  struct writable_iterator_tag { };
-  struct swappable_iterator_tag { };
-  struct mutable_lvalue_iterator_tag : virtual public writable_iterator_tag,
-    virtual public readable_iterator_tag { };
-  struct constant_lvalue_iterator_tag : public readable_iterator_tag { };
-
-  // Traversal Categories
-  struct forward_traversal_tag { };
-  struct bidirectional_traversal_tag : public forward_traversal_tag { };
-  struct random_access_traversal_tag : public bidirectional_traversal_tag { };
-
-}
-
- -

-The following is pseudo-code for the iterator category traits classes. - -

-namespace boost {
-
-  // Inherit from iterator_base if your iterator defines its own
-  // return_category and traversal_category. Otherwise, the "old style"
-  // iterator category will be mapped to the return_category and
-  // traversal_category.
-  struct new_iterator_base { };
-
-  template <typename Iterator>
-  struct return_category
-  {
-    // Pseudo-code
-    if (Iterator inherits from new_iterator_base) {
-      typedef typename Iterator::return_category type;
-    } else {
-      typedef std::iterator_traits<Iterator> OldTraits;
-      typedef typename OldTraits::iterator_category Cat;
-      if (Cat inherits from std::forward_iterator_tag)
-	if (is-const(T))
-	  typedef boost::constant_lvalue_iterator_tag type;
-	else
-	  typedef boost::mutable_lvalue_iterator_tag type;
-      else if (Cat inherits from std::input_iterator_tag)
-	typedef boost::readable_iterator_tag type;
-      else if (Cat inherits from std::output_iterator_tag)
-	typedef boost::writable_iterator_tag type;
-    }
-  };
-
-  template <typename T>
-  struct return_category<T*>
-  {
-    // Pseudo-code
-    if (is-const(T))
-      typedef boost::constant_lvalue_iterator_tag type;
-    else
-      typedef boost::mutable_lvalue_iterator_tag type;
-  };
-
-  template <typename Iterator>
-  struct traversal_category
-  {
-    // Pseudo-code
-    if (Iterator inherits from new_iterator_base) {
-      typedef typename Iterator::traversal_category type;
-    } else {
-      typedef std::iterator_traits<Iterator> OldTraits;
-      typedef typename OldTraits::iterator_category Cat;
-
-      if (Cat inherits from std::random_access_iterator_tag)
-	typedef boost::random_access_traversal_tag type;
-      else if (Cat inherits from std::bidirectional_iterator_tag)
-	typedef boost::bidirectional_traversal_tag type;
-      else if (Cat inherits from std::forward_iterator_tag)
-	typedef boost::forward_traversal_tag type;
-    }
-  };
-
-  template <typename T>
-  struct traversal_category<T*>
-  {
-    typedef boost::random_access_traversal_tag type;
-  };
-
-}
-
- -
-
jeremy siek
- - -Last modified: Mon Mar 19 12:59:30 EST 2001 - - - diff --git a/development/libs/iterator/iterator_concepts.fig b/development/libs/iterator/iterator_concepts.fig deleted file mode 100644 index 198205e..0000000 --- a/development/libs/iterator/iterator_concepts.fig +++ /dev/null @@ -1,37 +0,0 @@ -#FIG 3.2 -Landscape -Center -Inches -Letter -100.00 -Single --2 -1200 2 -6 150 2325 4275 4350 -2 1 0 1 0 7 100 0 -1 4.000 0 0 -1 1 0 2 - 1 1 1.00 60.00 120.00 - 1725 4050 1725 3450 -2 1 0 1 0 7 100 0 -1 4.000 0 0 -1 1 0 2 - 1 1 1.00 60.00 120.00 - 1725 3150 1725 2550 -4 0 0 100 0 19 18 0.0000 4 210 3180 375 2550 ForwardTraversalIterator\001 -4 0 0 100 0 19 18 0.0000 4 210 3765 225 3450 BidirectionalTraversalIterator\001 -4 0 0 100 0 19 18 0.0000 4 210 4125 150 4350 RandomAccessTraversalIterator\001 --6 -2 1 0 1 0 7 50 0 -1 0.000 0 0 -1 1 0 2 - 1 1 1.00 60.00 120.00 - 4800 3600 4800 2400 -2 1 0 1 0 7 50 0 -1 0.000 0 0 -1 1 0 2 - 1 1 1.00 60.00 120.00 - 6900 3000 5400 2400 -2 1 0 1 0 7 50 0 -1 0.000 0 0 -1 1 0 2 - 1 1 1.00 60.00 120.00 - 6900 3000 7500 2400 -2 1 0 1 0 7 50 0 -1 0.000 0 0 -1 1 0 2 - 1 1 1.00 60.00 120.00 - 6900 3000 9075 2475 -4 0 0 100 0 19 18 0.0000 4 210 2040 6600 2400 WritableIterator\001 -4 0 0 100 0 19 18 0.0000 4 210 2145 3900 2400 ReadableIterator\001 -4 0 0 50 0 19 18 0.0000 4 210 2835 5700 3300 MutableLvalueIterator\001 -4 0 0 50 0 19 18 0.0000 4 270 2355 9075 2400 SwappableIterator\001 -4 0 0 50 0 19 18 0.0000 4 210 2970 3825 3900 ConstantLvalueIterator\001 diff --git a/development/libs/iterator/iterator_concepts.gif b/development/libs/iterator/iterator_concepts.gif deleted file mode 100644 index bac35c7d13e402c6bc2fd5ff770bf444da6f4426..0000000000000000000000000000000000000000 GIT binary patch literal 0 HcmV?d00001 literal 3287 zcmV;|3@GzQNk%v~Ve|r!0Du4h00030|Nkri0002=0+0Xz0{)DTsmtvTqnxzbi?iOm z`wxcVNS5Y_rs~SJ?h9wYOw*$M%nk0~0QrkacmWMC1SB^!+N@7x`q+KYK7ey{QNVkRiH*0&W^Xt5~g_z2lT)HsBQ zWLZcD1sGPR$axuY2+H@lNmg@b*@?M&pm{?YIZIpXapc)`cKMUrwyXM@D%`sZT*{~V z=S!Td;xi0gjBKWiMfgh`XH#9et;03!y?hNWi!o^)RA=4h?JnM~o&HHbz8=qwpIiSu zZ3{4D@JV@7@ki}5>nkx?s! zcdU&(i85R_f+6+2L|KxeOPm9H`jlgjrp;zT)jiA@3~5o2HtP{(_b%Qubwl4hm3dU= zzM@-~MuqB?t5p*r#a0!`vZKkYEJZ3~+BKCpsC1kDyo(o1LZ=|Jfi1T-YeTef1*<72 z&9AEx`Zy9DY(z2Ouy!dMJ$$um(#0P>HvLybvgoIyH*2n(*fbKvSPkcW4SVX|k`@UL zzIS`*-oQ7{ZnT}p_lm|dgW`fHdbd~QO+4b^Wjh77&-7BOe(ZcQb-AsX_sK2{I;Gg; z%TqXRa=QA-Iiu^Io!UEKeL~K z*IBlei(x?rnT-0~@{uFkNkvP1KnxP$ie@1NrBY|1)|!3)UHMf?UZ^FaicxB{Bb6)$ zhNYAr#!})LbAican{1j%rkFvJDOR1_Y1u=OKpA*UE!NQ}3TJ4f$&hD;W(Qt-9WvP7 zgB`)JW{Gp|q>zM(I$C9;z46Cbkz7(rX{9J``ro6aTBoU2j0OTIq!Z#P#-Ff4An2Bo z7FScDx*kK)oT5IKDmh(B@&}N~b=SOzxs% zRhVyQeSS<<%{ZU9N2@!dvukN+fu`N9uNpgtWV{uNtsA46%Cas)a!V)87nf1-&qV61 zbqjgdOzpi7Cw_p-vg$V&Fre%cMLiD9dh_1=DKtl`nsjq5O2 z2p?ThZM0RrtEH#j86ebxgZ>?m&!_xdqvho(hq={utUDj!IVPwJ;!e)%ae$}8&1sAt zW{RqLeY=YH&zj4gap$oG{$}Yb_pbWPRO@$;>%(97sN_z8t}^iV&MpMyT7wq0p1N<& z`=xJp=gVBrsscmg9Lae^Ww zq6~MZ#3f1*O-`I*{tT*kMIi$5E;qBH7g?djFY4uaSiFx1qbSBSZmo=JL;)L%_{JpG z5RGlDBi86>$9(}Vj!>|L4)X}eX9Th*eC%N%F+##H4swwkI3yzj(ZC@-;*XE4Bx5Y; zr|K!Pk21s~CO@eJP;M}OjueF zEq!T)S0?g`Ae1FAkC_EzMlXWA>;cb&sZ3fz^O)1T+Z(G$$!Kb`4BIqg2b-BRDt2?6 zf+S}-O-M%$cF~;dL_<5>NJB;9Et~JGr`YUy$sH!}V)VqPKZo$o8z517ck*c&aE4^nO zBO|<)%2Wn31t=hMSJRxjRHr-OsZX_OQdNmXT2mkQOcJyn!b zjjB~SR@F~t^{QOW;Z?WV)v${2t3yPOEF21mOvp2YPY|eBQwY{df>m6CQtQ{w8phih zZfkEvCt0l-A-o3au7kCi-C!}OzA6@ia|Pg}5EVM3q3vXqnwqkTh9Y^XYhoOV>ta8v zOTZS-Nf7JJ`C4Wy)ADF1Y!MYsBnCjmfp)fI6>Up=!#cJI@G|HVQI!(Y*|y|1OMF=^ zacTaG+|5~&ZEHc*R14gE___{s^Jbz zO>txI7tZE8y?uASehe?&|<=)5PHfaBoFMSW(G5bb$M!#)vk5&Rw z=L$t=Q}fs8K-bsVd`m|xJ)o@?=h@{fDKA@BkT6bdWn z*l?yhLhHkeo8y?!gqN(&Si|ZIm4L%nK>n%EwLdNx0Z+SPu1;1DN#x`H2-)DvaWP5% zrHJ^hC0Up(tb_&laT@`%kV^a7_2k!oV?6YsiR`i#$t=`5GT4jq z*QCcj=SirY(tlY8GyJ}eDy{VNfr%XB7m?PwT_%~+vU}xlE@-t)Q$%&UEF1>&C&$6G zHG;u6VC;q}Yjvp`Wl^)cHJ=B6*YWvuScZNqpNb~mT4j55?BO?4OUwQqU7?DZA8-`_1Z%#tTr zS?e}S$3D2E>a^MAWqio$jW&>(w(LJh?Z1w|Wbv=OxFCz}i4`S=hxW{!2@{$W)8D zhC@ozl_M9_Fwyn4j!y48t2Wp@$GNtP+h=>Dd4P|0?1m>U^sH;W*<0_r#s2E`u%8j^ zVlR7H$!_+vZ!pA*WV_nC4s>(6{q0%DXhi2u_m$fnqIl1HzxS@tzWd$T>*T562Typ! zD_-%3U%cZF+W5yy-ky=4yyfM7`OIs*@|y2FH9Ze{TXUX^fKMnzuZ}Sto7oGY_vh%b zT$WADQ{k#l{f=wjdUn3v$57WYt2_*}!>&59xqs*G%j&z)wmVyZc1^f#URe$gnmY3$ zw4l9ZuHvWi_8=#y)DP;|t0Ud;m_N(OInSArTefx`q{FE(c_C|x)v zKQ2RIrN(X=cRV(DgA$a3YX@;@A%R5bgvy3`A$M{=NNX^tY%=&3NSK7oBv%5nfiCxd zENFiMLuRA`X*`ENO}Hvu2!EF3ZQyfRUq*AD&|}*(eg+g-uJbFTBWQkhdu|v=ODKqi z2v>%Ph=!Mli#St+$cT@KOOPmu8RdwRXo=HviJACMm8kxSov1II=!u~yJEBO6rD%$$ zh>EGGimS+qt>}uc2#c{Oi?c|JwTM*K!&kDGRO{wreZfh#C{momW8$QNfkszS*nHV{eac5@ z)fi3xhH3l3Xw!y`fwgJrr*q=yUifwsl~z8vg=zjMY4dn=?nq69B62*aJQp`D5yyYL z3l4rk5Z#s4`?*cWf%cu zCBjB(+4YeJNpxWdaQHxiE%+l>Cm;CJUkjIJ%)+&P;`VeJIc)?ofmd`}6L7}$VQsg3i;ZOfJ$fmm~MhG%66h^bR^ z4M&y_H*2H=muAU~bQpz7vxQ$`JUzE-C~0t~Ls`UAmnW&0c5;O-nT0J@V}997%tMCU zW@JWaRxmej;@2p6*mTu#hV}@S<3)49vYA|HnK1-yb(mkF^Kcw?T1eS`?!t{*X*ORu Vm;SYLqjGHw1Bh+bnwC@m06T#5Vk!Ut diff --git a/development/libs/iterator/iterator_concepts.htm b/development/libs/iterator/iterator_concepts.htm deleted file mode 100644 index f2f8dcd..0000000 --- a/development/libs/iterator/iterator_concepts.htm +++ /dev/null @@ -1,663 +0,0 @@ - - - - -Iterator Concepts - -C++ Boost - -
- - -

Iterator Concepts

- -

The standard iterator categories and requirements are flawed because -they use a single hierarchy of requirements to address two orthogonal -issues: iterator traversal and dereference return -type. The current iterator requirement hierarchy is mainly -geared towards iterator traversal (hence the category names), while -requirements that address dereference return type sneak in at various -places. - -

-The iterator requirements should be separated into two hierarchies. -One set of concepts handles the return type semantics: -

- -The other set of concepts handles iterator traversal: - - - -The current Input Iterator and Output Iterator requirements will -continue to be used as is. Note that Input Iterator implies Readable -Iterator and Output Iterator implies Writable Iterator. - -

-Note: we considered defining a Single-Pass Iterator, which could be -combined with Readable or Writable Iterator to replace the Input and -Output Iterator requirements. We rejected this idea because there are -some differences between Input and Output Iterators that make it hard -to merge them: for example Input Iterator requires Equality Comparable -while Output Iterator does not. - - -

-
- - - -
Figure 1: -The iterator concepts and refinement relationships. -
-
-

- - -

Relationship with the standard iterator concepts

- -

-std::Input Iterator implies boost::ReadableIterator. - -

-std::Output Iterator implies boost::Writable Iterator. - -

-std::Forward Iterator refines boost::Forward Iterator and -boost::Constant Lvalue Iterator or boost::Mutable Lvalue Iterator. - -

-std::Bidirectional Iterator refines boost::Bidirectional Iterator and -boost::Constant Lvalue Iterator or boost::Mutable Lvalue Iterator. - -

-std::Random Access Iterator refines boost::Random Access Iterator and -boost::Constant Lvalue Iterator or boost::Mutable Lvalue Iterator. - - -

Notation

- - - - - - - - - - - - - - - - - -
XThe iterator type.
TThe value type of X, i.e., std::iterator_traits<X>::value_type.
x, yAn object of type X.
tAn object of type T.
- -

- -

- - -

-Readable Iterator -

- -A Readable Iterator is an iterator that dereferences to produce an -rvalue that is convertible to the value_type of the -iterator. - -

Associated Types

- - - - - - - - - - - - - - - - - - - - - -
Value typestd::iterator_traits<X>::value_typeThe type of the objects pointed to by the iterator.
Reference typestd::iterator_traits<X>::reference - The return type of dereferencing the iterator. This - type must be convertible to T. -
Return Categorystd::return_category<X>::type - A type convertible to std::readable_iterator_tag -
- -

Refinement of

- -Copy Constructible - -

Valid expressions

- - - - - - - - - - - - - - - -
NameExpressionType requirementsReturn type
Dereference*x std::iterator_traits<X>::reference
Member accessx->mT is a type with a member named m. -If m is a data member, the type of m. -If m is a member function, the return type of m. -
- -

- -

- - -

-Writable Iterator -

- -A Writable Iterator is an iterator that can be used to store a value -using the dereference-assignment expression. - -

Definitions

- -If x is an Writable Iterator of type X, then the -expression *x = a; stores the value a into -x. Note that operator=, like other C++ functions, -may be overloaded; it may, in fact, even be a template function. In -general, then, a may be any of several different types. A -type A belongs to the set of value types of X -if, for an object a of type A, *x = a; is -well-defined and does not require performing any non-trivial -conversions on a. - -

Associated Types

- - - - - - - - - -
Return Categorystd::return_category<X>::type - A type convertible to std::writable_iterator_tag -
- - - -

Refinement of

- -Copy Constructible - -

Valid expressions

- - - - - - - - - - -
NameExpressionReturn type
Dereference assignment*x = aunspecified
- -

- - -

- - -

-Swappable Iterator -

- -A Swappable Iterator is an iterator whose dereferenced values can be -swapped. - -

-Note: the requirements for Swappable Iterator are dependent on the -issues surrounding std::swap() being resolved. Here we assume -that the issue will be resolved by allowing the overload of -std::swap() for user-defined types. - -

-Note: Readable Iterator and Writable Iterator combined implies -Swappable Iterator because of the fully templated -std::swap(). However, Swappable Iterator does not imply -Readable Iterator nor Writable Iterator. - -

Associated Types

- - - - - - - - - -
Return Categorystd::return_category<X>::type - A type convertible to std::swappable_iterator_tag -
- - -

Valid expressions

- -Of the two valid expressions listed below, only one OR the -other is required. If std::iter_swap() is overloaded for -X then std::swap() is not required. If -std::iter_swap() is not overloaded for X then the -default (fully templated) version is used, which will call -std::swap() (this means changing the current requirements for -std::iter_swap()). - -

- - - - - - - - - - - - - - - - - -
NameExpressionReturn type
Iterator Swapstd::iter_swap(x, y)void
Dereference and Swapstd::swap(*x, *y)void
- -

- - -

- - -

-Constant Lvalue Iterator -

- -A Constant Lvalue Iterator is an iterator that dereferences to produce a -const reference to the pointed-to object, i.e., the associated -reference type is const T&. Changing the value -of or destroying an iterator that models Constant Lvalue Iterator does -not invalidate pointers and references previously obtained from that -iterator. - - -

Refinement of

- -Readable Iterator - -

Associated Types

- - - - - - - - - - - - - - - - - -
Reference typestd::iterator_traits<X>::reference - The return type of dereferencing the iterator, which must be - const T&. -
Return Categorystd::return_category<X>::type - A type convertible to std::constant_lvalue_iterator_tag -
- - - -

- -

- - -

-Mutable Lvalue Iterator -

- -A Mutable Lvalue Iterator is an iterator that dereferences to produce a -reference to the pointed-to object. The associated reference -type is T&. Changing the value of or destroying an -iterator that models Mutable Lvalue Iterator does not invalidate -pointers and references previously obtained from that iterator. - -

Refinement of

- -Readable Iterator, -Writable Iterator, -and Swappable Iterator. - - - -

Associated Types

- - - - - - - - - - - - - - - - - -
Reference typestd::iterator_traits<X>::referenceThe return type of dereferencing the iterator, which must be - T&.
Return Categorystd::return_category<X>::type - A type convertible to std::mutable_lvalue_iterator_tag -
- - - -

-

- - -

-Forward Traversal Iterator -

- -The Forward Iterator is an iterator that can be incremented. Also, it -is permissible to make multiple passes through the iterator's range. - -

Refinement of

- -Copy Constructible, -Assignable, -Default Constructible, and -Equality Comparable - - -

Associated types

- - - - - - - - - - - - - - -
Difference Typestd::iterator_traits<X>::difference_type - A signed integral type used for representing distances - between iterators that point into the same range. -
Traversal Categorystd::traversal_category<X>::type - A type convertible to std::forward_traversal_tag -
- -

Valid expressions

- - - - - - - - - - - - - - -
NameExpressionType requirementsReturn type
Preincrement++i X&
Postincrementi++ convertible to const X&
- -

-

- - -

-Bidirectional Traversal Iterator -

- -An iterator that can be incremented and decremented. - -

Refinement of

- -Forward Traversal Iterator - -

Associated types

- - - - - - - -
Traversal Categorystd::traversal_category<X>::type - A type convertible to std::bidirectional_traversal_tag -
- -

Valid expressions

- - - - - - - - - - - - -
NameExpressionType requirementsReturn type
Predecrement--i X&
Postdecrementi-- convertible to const X&
- -

-

- - -

-Random Access Traversal Iterator -

- -An iterator that provides constant-time methods for moving forward and -backward in arbitrary-sized steps. - -

Refinement of

- -Bidirectional Traversal Iterator and -Less Than Comparable where < is a total ordering - -

Associated types

- - - - - - - -
Traversal Categorystd::traversal_category<X>::type - A type convertible to std::random_access_traversal_tag -
- -

Valid expressions

- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
NameExpressionType requirementsReturn type
Iterator additioni += n X&
Iterator additioni + n or n + i X
Iterator subtractioni -= n X&
Iterator subtractioni - n X
Differencei - j std::iterator_traits<X>::difference_type
Element operatori[n]X must also be a model of - Readable Iterator. std::iterator_traits<X>::reference
Element assignmenti[n] = tX must also be a model of - Writable Iterator.unspecified
- -

- -

- - -
Copyright © 2000 -Jeremy Siek, Univ.of Notre Dame (jsiek@lsc.nd.edu) -
- - - diff --git a/doc/BidirectionalTraversal.rst b/doc/BidirectionalTraversal.rst old mode 100755 new mode 100644 diff --git a/doc/ForwardTraversal.rst b/doc/ForwardTraversal.rst old mode 100755 new mode 100644 diff --git a/doc/GNUmakefile b/doc/GNUmakefile old mode 100755 new mode 100644 diff --git a/doc/IncrementableIterator.rst b/doc/IncrementableIterator.rst old mode 100755 new mode 100644 diff --git a/doc/LvalueIterator.rst b/doc/LvalueIterator.rst old mode 100755 new mode 100644 diff --git a/doc/ReadableIterator.rst b/doc/ReadableIterator.rst old mode 100755 new mode 100644 diff --git a/doc/SinglePassIterator.rst b/doc/SinglePassIterator.rst old mode 100755 new mode 100644 diff --git a/doc/SwappableIterator.rst b/doc/SwappableIterator.rst old mode 100755 new mode 100644 diff --git a/doc/WritableIterator.rst b/doc/WritableIterator.rst old mode 100755 new mode 100644 diff --git a/doc/counting_iterator.pdf b/doc/counting_iterator.pdf old mode 100755 new mode 100644 diff --git a/doc/docutils.sty b/doc/docutils.sty old mode 100755 new mode 100644 diff --git a/doc/facade-and-adaptor.html b/doc/facade-and-adaptor.html old mode 100755 new mode 100644 diff --git a/doc/facade-and-adaptor.pdf b/doc/facade-and-adaptor.pdf old mode 100755 new mode 100644 diff --git a/doc/facade_iterator_category.rst b/doc/facade_iterator_category.rst old mode 100755 new mode 100644 diff --git a/doc/filter_iterator.pdf b/doc/filter_iterator.pdf old mode 100755 new mode 100644 diff --git a/doc/function_output_iterator.pdf b/doc/function_output_iterator.pdf old mode 100755 new mode 100644 diff --git a/doc/indirect_iterator.pdf b/doc/indirect_iterator.pdf old mode 100755 new mode 100644 diff --git a/doc/indirect_reference_ref.rst b/doc/indirect_reference_ref.rst old mode 100755 new mode 100644 diff --git a/doc/interoperability-revisited.rst b/doc/interoperability-revisited.rst old mode 100755 new mode 100644 diff --git a/doc/issues.rst b/doc/issues.rst old mode 100755 new mode 100644 diff --git a/doc/iterator_adaptor.pdf b/doc/iterator_adaptor.pdf old mode 100755 new mode 100644 diff --git a/doc/iterator_adaptor_tutorial.rst b/doc/iterator_adaptor_tutorial.rst old mode 100755 new mode 100644 diff --git a/doc/iterator_archetypes.html b/doc/iterator_archetypes.html old mode 100755 new mode 100644 diff --git a/doc/iterator_archetypes.pdf b/doc/iterator_archetypes.pdf old mode 100755 new mode 100644 diff --git a/doc/iterator_archetypes.rst b/doc/iterator_archetypes.rst old mode 100755 new mode 100644 diff --git a/doc/iterator_concepts.pdf b/doc/iterator_concepts.pdf old mode 100755 new mode 100644 diff --git a/doc/iterator_concepts.rst b/doc/iterator_concepts.rst old mode 100755 new mode 100644 diff --git a/doc/iterator_facade.pdf b/doc/iterator_facade.pdf old mode 100755 new mode 100644 diff --git a/doc/iterator_facade_tutorial.rst b/doc/iterator_facade_tutorial.rst old mode 100755 new mode 100644 diff --git a/doc/iterator_traits.html b/doc/iterator_traits.html old mode 100755 new mode 100644 diff --git a/doc/iterator_traits.pdf b/doc/iterator_traits.pdf old mode 100755 new mode 100644 diff --git a/doc/iterator_traits.rst b/doc/iterator_traits.rst old mode 100755 new mode 100644 diff --git a/doc/make_counting_iterator.rst b/doc/make_counting_iterator.rst old mode 100755 new mode 100644 diff --git a/doc/make_filter_iterator.rst b/doc/make_filter_iterator.rst old mode 100755 new mode 100644 diff --git a/doc/make_transform_iterator.rst b/doc/make_transform_iterator.rst old mode 100755 new mode 100644 diff --git a/doc/make_zip_iterator.rst b/doc/make_zip_iterator.rst old mode 100755 new mode 100644 diff --git a/doc/new-iter-concepts.html b/doc/new-iter-concepts.html old mode 100755 new mode 100644 diff --git a/doc/new-iter-concepts.pdf b/doc/new-iter-concepts.pdf old mode 100755 new mode 100644 diff --git a/doc/permutation_iterator.pdf b/doc/permutation_iterator.pdf old mode 100755 new mode 100644 diff --git a/doc/pointee.html b/doc/pointee.html old mode 100755 new mode 100644 diff --git a/doc/pointee.pdf b/doc/pointee.pdf old mode 100755 new mode 100644 diff --git a/doc/pointee.rst b/doc/pointee.rst old mode 100755 new mode 100644 diff --git a/doc/pointee_ref.rst b/doc/pointee_ref.rst old mode 100755 new mode 100644 diff --git a/doc/reverse_iterator.pdf b/doc/reverse_iterator.pdf old mode 100755 new mode 100644 diff --git a/doc/transform_iterator.pdf b/doc/transform_iterator.pdf old mode 100755 new mode 100644 diff --git a/doc/transform_iterator_eg.rst b/doc/transform_iterator_eg.rst old mode 100755 new mode 100644 diff --git a/doc/zip_iterator.html b/doc/zip_iterator.html old mode 100755 new mode 100644 diff --git a/doc/zip_iterator.pdf b/doc/zip_iterator.pdf old mode 100755 new mode 100644 diff --git a/doc/zip_iterator.rst b/doc/zip_iterator.rst old mode 100755 new mode 100644 diff --git a/doc/zip_iterator_abstract.rst b/doc/zip_iterator_abstract.rst old mode 100755 new mode 100644 diff --git a/doc/zip_iterator_eg.rst b/doc/zip_iterator_eg.rst old mode 100755 new mode 100644 diff --git a/doc/zip_iterator_ref.rst b/doc/zip_iterator_ref.rst old mode 100755 new mode 100644 diff --git a/example/node.hpp b/example/node.hpp old mode 100755 new mode 100644 diff --git a/example/node_iterator1.cpp b/example/node_iterator1.cpp old mode 100755 new mode 100644 diff --git a/example/node_iterator1.hpp b/example/node_iterator1.hpp old mode 100755 new mode 100644 diff --git a/example/node_iterator2.cpp b/example/node_iterator2.cpp old mode 100755 new mode 100644 diff --git a/example/node_iterator2.hpp b/example/node_iterator2.hpp old mode 100755 new mode 100644 diff --git a/example/node_iterator3.cpp b/example/node_iterator3.cpp old mode 100755 new mode 100644 diff --git a/example/node_iterator3.hpp b/example/node_iterator3.hpp old mode 100755 new mode 100644 diff --git a/include/boost/iterator/detail/any_conversion_eater.hpp b/include/boost/iterator/detail/any_conversion_eater.hpp old mode 100755 new mode 100644 diff --git a/include/boost/iterator/detail/facade_iterator_category.hpp b/include/boost/iterator/detail/facade_iterator_category.hpp old mode 100755 new mode 100644 diff --git a/include/boost/iterator/detail/minimum_category.hpp b/include/boost/iterator/detail/minimum_category.hpp old mode 100755 new mode 100644 diff --git a/include/boost/iterator/is_lvalue_iterator.hpp b/include/boost/iterator/is_lvalue_iterator.hpp old mode 100755 new mode 100644 diff --git a/include/boost/iterator/is_readable_iterator.hpp b/include/boost/iterator/is_readable_iterator.hpp old mode 100755 new mode 100644 diff --git a/include/boost/pointee.hpp b/include/boost/pointee.hpp old mode 100755 new mode 100644 diff --git a/index.html b/index.html old mode 100755 new mode 100644 diff --git a/test/constant_iter_arrow.cpp b/test/constant_iter_arrow.cpp old mode 100755 new mode 100644 diff --git a/test/constant_iter_arrow_fail.cpp b/test/constant_iter_arrow_fail.cpp old mode 100755 new mode 100644 diff --git a/test/interoperable.cpp b/test/interoperable.cpp old mode 100755 new mode 100644 diff --git a/test/is_lvalue_iterator.cpp b/test/is_lvalue_iterator.cpp old mode 100755 new mode 100644 diff --git a/test/is_readable_iterator.cpp b/test/is_readable_iterator.cpp old mode 100755 new mode 100644 diff --git a/test/iter_archetype_default_ctor.cpp b/test/iter_archetype_default_ctor.cpp old mode 100755 new mode 100644 diff --git a/test/pointee.cpp b/test/pointee.cpp old mode 100755 new mode 100644