From e459d66d3fd58eb91c2738d260d28531ca367427 Mon Sep 17 00:00:00 2001
From: Jeremy Siek <jeremy.siek@gmail.com>
Date: Sat, 5 May 2001 16:37:14 +0000
Subject: [PATCH] new file

[SVN r10014]
---
 include/boost/graph/property_iter_range.hpp | 135 ++++++++++++++++++++
 1 file changed, 135 insertions(+)
 create mode 100644 include/boost/graph/property_iter_range.hpp

diff --git a/include/boost/graph/property_iter_range.hpp b/include/boost/graph/property_iter_range.hpp
new file mode 100644
index 00000000..680df269
--- /dev/null
+++ b/include/boost/graph/property_iter_range.hpp
@@ -0,0 +1,135 @@
+
+// (C) Copyright François Faure, iMAGIS-GRAVIR / UJF, 2001. Permission
+// to copy, use, modify, sell and distribute this software is granted
+// provided this copyright notice appears in all copies. This software
+// is provided "as is" without express or implied warranty, and with
+// no claim as to its suitability for any purpose.
+
+// Revision History:
+// 03 May 2001   Jeremy Siek
+//      Generalized the property map iterator and moved that
+//      part to boost/property_map.hpp. Also modified to
+//      differentiate between const/mutable graphs and
+//      added a workaround to avoid partial specialization.
+
+// 02 May 2001   François Faure
+//     Initial version.
+
+#ifndef BOOST_GRAPH_PROPERTY_ITER_RANGE_HPP
+#define BOOST_GRAPH_PROPERTY_ITER_RANGE_HPP
+
+#include <boost/property_map_iterator.hpp>
+#include <boost/graph/properties.hpp>
+
+namespace boost {
+
+//======================================================================
+// graph property iterator range
+
+  namespace detail {
+
+    template <class PropertyKind>
+    struct choose_graph_iterator { };
+
+    template <>
+    struct choose_graph_iterator<vertex_property_tag> {
+      template <class Graph> struct bind {
+        typedef typename graph_traits<Graph>::vertex_iterator type;
+      };
+    };
+    template <>
+    struct choose_graph_iterator<edge_property_tag> {
+      template <class Graph> struct bind {
+        typedef typename graph_traits<Graph>::edge_iterator type;
+      };
+    };
+    
+  } // namespace detail
+
+  template <class Graph, class PropertyTag>
+  class graph_property_iter_range {
+    typedef typename property_map<Graph, PropertyTag>::type map_type;
+    typedef typename property_map<Graph, PropertyTag>::const_type 
+      const_map_type;
+    typedef typename property_kind<PropertyTag>::type Kind;
+    typedef typename detail::choose_graph_iterator<Kind>
+      ::template bind<Graph>::type iter;
+  public:
+    typedef typename property_map_iterator_generator<map_type, iter>::type 
+      iterator;
+    typedef typename property_map_iterator_generator<const_map_type, iter>
+      ::type const_iterator;
+    typedef std::pair<iterator, iterator> type;
+    typedef std::pair<const_iterator, const_iterator> const_type;
+  };
+
+  namespace detail {
+
+    template<class Graph,class Tag>
+    typename graph_property_iter_range<Graph,Tag>::type
+    get_property_iter_range_kind(Graph& graph, const Tag& tag, 
+                                 const vertex_property_tag& )
+    {
+      typedef typename graph_property_iter_range<Graph,Tag>::iterator iter;
+      return std::make_pair(iter(vertices(graph).first, get(tag, graph)),
+                            iter(vertices(graph).second, get(tag, graph)));
+    }
+
+    template<class Graph,class Tag>
+    typename graph_property_iter_range<Graph,Tag>::const_type
+    get_property_iter_range_kind(const Graph& graph, const Tag& tag, 
+                                 const vertex_property_tag& )
+    {
+      typedef typename graph_property_iter_range<Graph,Tag>
+        ::const_iterator iter;
+      return std::make_pair(iter(vertices(graph).first, get(tag, graph)),
+                            iter(vertices(graph).second, get(tag, graph)));
+    }
+
+
+    template<class Graph,class Tag>
+    typename graph_property_iter_range<Graph,Tag>::type
+    get_property_iter_range_kind(Graph& graph, const Tag& tag, 
+                                 const edge_property_tag& )
+    {
+      typedef typename graph_property_iter_range<Graph,Tag>::iterator iter;
+      return std::make_pair(iter(edges(graph).first, get(tag, graph)),
+                            iter(edges(graph).second, get(tag, graph)));
+    }
+
+    template<class Graph,class Tag>
+    typename graph_property_iter_range<Graph,Tag>::const_type
+    get_property_iter_range_kind(const Graph& graph, const Tag& tag, 
+                                 const edge_property_tag& )
+    {
+      typedef typename graph_property_iter_range<Graph,Tag>
+        ::const_iterator iter;
+      return std::make_pair(iter(edges(graph).first, get(tag, graph)),
+                            iter(edges(graph).second, get(tag, graph)));
+    }
+
+  } // namespace detail
+
+  //======================================================================
+  // get an iterator range of properties
+
+  template<class Graph, class Tag>
+  typename graph_property_iter_range<Graph, Tag>::type
+  get_property_iter_range(Graph& graph, const Tag& tag)
+  {
+    typedef typename property_kind<Tag>::type Kind;
+    return get_property_iter_range_kind(graph, tag, Kind());
+  }
+
+  template<class Graph, class Tag>
+  typename graph_property_iter_range<Graph, Tag>::const_type
+  get_property_iter_range(const Graph& graph, const Tag& tag)
+  {
+    typedef typename property_kind<Tag>::type Kind;
+    return get_property_iter_range_kind(graph, tag, Kind());
+  }
+
+} // namespace boost
+
+
+#endif // BOOST_GRAPH_PROPERTY_ITER_RANGE_HPP