|
Boost-Commit : |
From: aaron.windsor_at_[hidden]
Date: 2007-10-07 19:49:08
Author: aaron_windsor
Date: 2007-10-07 19:49:07 EDT (Sun, 07 Oct 2007)
New Revision: 39773
URL: http://svn.boost.org/trac/boost/changeset/39773
Log:
Adding some missing typenames
Text files modified:
trunk/boost/graph/planar_detail/boyer_myrvold_impl.hpp | 6 +++---
1 files changed, 3 insertions(+), 3 deletions(-)
Modified: trunk/boost/graph/planar_detail/boyer_myrvold_impl.hpp
==============================================================================
--- trunk/boost/graph/planar_detail/boyer_myrvold_impl.hpp (original)
+++ trunk/boost/graph/planar_detail/boyer_myrvold_impl.hpp 2007-10-07 19:49:07 EDT (Sun, 07 Oct 2007)
@@ -465,7 +465,7 @@
// to v. This will set the stage for the walkdown to efficiently
// traverse the graph of bicomps down from v.
- typedef face_vertex_iterator<both_sides>::type walkup_iterator_t;
+ typedef typename face_vertex_iterator<both_sides>::type walkup_iterator_t;
out_edge_iterator_t oi, oi_end;
for(tie(oi,oi_end) = out_edges(v,g); oi != oi_end; ++oi)
@@ -1081,7 +1081,7 @@
return current_endpoint;
}
- typedef face_edge_iterator<>::type walkup_itr_t;
+ typedef typename face_edge_iterator<>::type walkup_itr_t;
walkup_itr_t
walkup_itr(current_endpoint, face_handles, first_side());
@@ -1319,7 +1319,7 @@
bicomp_root = current_vertex;
}
- typedef face_edge_iterator<>::type walkup_itr_t;
+ typedef typename face_edge_iterator<>::type walkup_itr_t;
std::vector<bool> outer_face_edge_vector(num_edges(g), false);
edge_to_bool_map_t outer_face_edge(outer_face_edge_vector.begin(), em);
Boost-Commit list run by bdawes at acm.org, david.abrahams at rcn.com, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk