[Boost-commit] svn:boost r78328 - trunk/boost/graph

Subject: [Boost-commit] svn:boost r78328 - trunk/boost/graph
From: jewillco_at_[hidden]
Date: 2012-05-04 22:52:41

Author: jewillco
Date: 2012-05-04 22:52:41 EDT (Fri, 04 May 2012)
New Revision: 78328
URL: http://svn.boost.org/trac/boost/changeset/78328

Log:
Qualified calls to tie
Text files modified: 
   trunk/boost/graph/two_graphs_common_spanning_trees.hpp |    12 ++++++------                            
   1 files changed, 6 insertions(+), 6 deletions(-)

Modified: trunk/boost/graph/two_graphs_common_spanning_trees.hpp
==============================================================================
--- trunk/boost/graph/two_graphs_common_spanning_trees.hpp	(original)
+++ trunk/boost/graph/two_graphs_common_spanning_trees.hpp	2012-05-04 22:52:41 EDT (Fri, 04 May 2012)
@@ -635,11 +635,11 @@
     vG_bimap.insert(bimap_value(i, vG_map[i]));
 
   edge_iterator current, last;
-  tie(current, last) = edges(iG);
+  boost::tuples::tie(current, last) = edges(iG);
   for(; current != last; ++current)
     if(iG_bimap.right.find(*current) == iG_bimap.right.end())
       return;
-  tie(current, last) = edges(vG);
+  boost::tuples::tie(current, last) = edges(vG);
   for(; current != last; ++current)
     if(vG_bimap.right.find(*current) == vG_bimap.right.end())
       return;
@@ -749,10 +749,10 @@
     associative_property_map< std::map<edge_descriptor, bool> > diG(iG_deleted);
     associative_property_map< std::map<edge_descriptor, bool> > dvG(vG_deleted);
 
-    tie(current, last) = edges(iG);
+    boost::tuples::tie(current, last) = edges(iG);
     for(; current != last; ++current)
       put(diG, *current, false);
-    tie(current, last) = edges(vG);
+    boost::tuples::tie(current, last) = edges(vG);
     for(; current != last; ++current)
       put(dvG, *current, false);
 
@@ -852,11 +852,11 @@
   std::vector<edge_descriptor> iGO, vGO;
   edge_iterator curr, last;
 
-  tie(curr, last) = edges(iG);
+  boost::tuples::tie(curr, last) = edges(iG);
   for(; curr != last; ++curr)
     iGO.push_back(*curr);
 
-  tie(curr, last) = edges(vG);
+  boost::tuples::tie(curr, last) = edges(vG);
   for(; curr != last; ++curr)
     vGO.push_back(*curr);