# HG changeset patch # User Nicolas Saunier # Date 1341289050 14400 # Node ID 04355e51d895a45334858f1cc16ee8dfbf9fe6db # Parent 249d65ff6c35596e3bd95a55971b14f9048bb7f6 removed tr1:: diff -r 249d65ff6c35 -r 04355e51d895 c/Motion.cpp --- a/c/Motion.cpp Mon Jul 02 23:49:39 2012 -0400 +++ b/c/Motion.cpp Tue Jul 03 00:17:30 2012 -0400 @@ -164,7 +164,7 @@ if (ft->minMaxSimilarity(*ft2, firstInstant, lastInstant, connectionDistance, segmentationDistance)) { UndirectedGraph::edge_descriptor e; bool unused; - tr1::tie(e, unused) = add_edge(newVertex, *vi, graph); + tie(e, unused) = add_edge(newVertex, *vi, graph); // no need to add measures to graph[e] (edge properties) } } @@ -185,7 +185,7 @@ vector > tmpobjects(num), objects; // vector of components (component = vector of vertex descriptors) graph_traits::vertex_iterator vi, vend; - for(tr1::tie(vi,vend) = vertices(graph); vi != vend; ++vi) { + for(tie(vi,vend) = vertices(graph); vi != vend; ++vi) { unsigned int id = components[*vi]; lastInstants[id] = max(lastInstants[id], graph[*vi].feature->getLastInstant()); tmpobjects[id].push_back(*vi); @@ -246,6 +246,6 @@ void FeatureGraph::computeVertexIndex(void) { graph_traits::vertex_iterator vi, vend; graph_traits::vertices_size_type cnt = 0; - for(tr1::tie(vi,vend) = vertices(graph); vi != vend; ++vi) + for(tie(vi,vend) = vertices(graph); vi != vend; ++vi) graph[*vi].index = cnt++; }