[Boost-commit] svn:boost r86456 - trunk/libs/graph/doc

Subject: [Boost-commit] svn:boost r86456 - trunk/libs/graph/doc
From: jewillco_at_[hidden]
Date: 2013-10-26 11:30:09

Author: jewillco
Date: 2013-10-26 11:30:09 EDT (Sat, 26 Oct 2013)
New Revision: 86456
URL: http://svn.boost.org/trac/boost/changeset/86456

Log:
Changed random_access_iterator_property_map to iterator_property_map in documentation; fixes #9300

Text files modified: 
   trunk/libs/graph/doc/using_property_maps.html |    14 +++++++-------                          
   1 files changed, 7 insertions(+), 7 deletions(-)

Modified: trunk/libs/graph/doc/using_property_maps.html
==============================================================================
--- trunk/libs/graph/doc/using_property_maps.html	Sat Oct 26 11:21:25 2013	(r86455)
+++ trunk/libs/graph/doc/using_property_maps.html	2013-10-26 11:30:09 EDT (Sat, 26 Oct 2013)	(r86456)
@@ -219,7 +219,7 @@
 
 <P>
 The first method uses the adaptor class
-<TT>random_access_iterator_property_map</TT>. This
+<TT>iterator_property_map</TT>. This
 class wraps a random access iterator, creating a property map out
 of it. The random access iterator must point to the beginning of a
 range of property values, and the length of the range must be the
@@ -229,7 +229,7 @@
 edge descriptor to the offset of the property value (offset from the
 random access iterator). The ID property map will typically be an
 interior property map of the graph.  The following example shows
-how the <TT>random_access_iterator_property_map</TT>
+how the <TT>iterator_property_map</TT>
 can be used to create exterior property maps for the capacity and flow properties, which are stored in arrays. The arrays are
 indexed by edge ID. The edge ID is added to the graph using a property,
 and the values of the ID's are given when each edge is added to the
@@ -257,7 +257,7 @@
   typedef property_map&lt;Graph, edge_index_t&gt;::type EdgeID_Map;
   EdgeID_Map edge_id = get(edge_index, G);
 
-  random_access_iterator_property_map
+  iterator_property_map
     &lt;int*, int, int&amp;, EdgeID_Map&gt; 
       capacity(capacity_array, edge_id), 
       flow(flow_array, edge_id);
@@ -276,7 +276,7 @@
 <TT>VertexList</TT> is not <TT>vecS</TT>, then the vertex descriptor is
 not an integer, and cannot be used with a pointer property map.
 Instead the method described above of using a
-<TT>random_access_iterator_property_map</TT> with an ID
+<TT>iterator_property_map</TT> with an ID
 property must be used. The <TT>edge_list</TT> class may also use an
 integer type for the vertex descriptor, depending on how the adapted
 edge iterator is defined. The example in
@@ -388,10 +388,10 @@
 
 <P>
 The implementation of the
-<TT>random_access_iterator_property_map</TT> class
+<TT>iterator_property_map</TT> class
 serves as a good example for how to build and exterior property
 map. Here we present a simplified implementation of the
-<TT>random_access_iterator_property_map</TT> class
+<TT>iterator_property_map</TT> class
 which we will name <TT>iterator_pa</TT>.
 
 <P>
@@ -462,7 +462,7 @@
 <P>
 That is it. The <TT>iterator_map</TT> class is complete and could be
 used just like the
-<TT>random_access_iterator_property_map</TT> in the
+<TT>iterator_property_map</TT> in the
 previous section.
 
 <P>