From e141c980027df299b53314975d969273062771cd Mon Sep 17 00:00:00 2001 From: Jonathan Gray Date: Tue, 23 Apr 2013 20:09:21 +1000 Subject: [PATCH] add the typename keyword as needed to Ragl --- code/Ragl/graph_region.h | 2 +- code/Ragl/graph_vs.h | 12 ++++++------ 2 files changed, 7 insertions(+), 7 deletions(-) diff --git a/code/Ragl/graph_region.h b/code/Ragl/graph_region.h index a35c460..59673eb 100644 --- a/code/Ragl/graph_region.h +++ b/code/Ragl/graph_region.h @@ -183,7 +183,7 @@ public: bool find_regions(const typename TGraph::user& user) { int CurNodeIndex; - for (TGraph::TNodes::iterator i=mGraph.nodes_begin(); i!=mGraph.nodes_end(); i++) + for (typename TGraph::TNodes::iterator i=mGraph.nodes_begin(); i!=mGraph.nodes_end(); i++) { CurNodeIndex = i.index(); if (mRegions[CurNodeIndex] == NULL_REGION) diff --git a/code/Ragl/graph_vs.h b/code/Ragl/graph_vs.h index 9f50d5c..525fafb 100644 --- a/code/Ragl/graph_vs.h +++ b/code/Ragl/graph_vs.h @@ -290,7 +290,7 @@ public: // I. Fill All The Cells With The Points Contained By Those Cells //---------------------------------------------------------------- bool full = false; - for (TNodes::iterator it=mGraph.nodes_begin(); it!=mGraph.nodes_end() && !full; it++) + for (typename TNodes::iterator it=mGraph.nodes_begin(); it!=mGraph.nodes_end() && !full; it++) { TNODE& node = (*it); SCell& cell = mCells.get(node[0], node[1]); @@ -306,8 +306,8 @@ public: // II. Go To All Neighboring Cells And Get Them //============================================== int iRange = (int)(range) + 1; - TCells::riterator rcell; - TCells::riterator rcellend; + typename TCells::riterator rcell; + typename TCells::riterator rcellend; CVec3 cellCenter(0,0,0); CVec3 nodeCenter(0,0,0); @@ -392,7 +392,7 @@ public: // I. Fill All The Cells With The Points Contained By Those Cells //---------------------------------------------------------------- bool full = false; - for (TEdges::iterator eit=mGraph.edges_begin(); eit!=mGraph.edges_end() && !full; eit++) + for (typename TEdges::iterator eit=mGraph.edges_begin(); eit!=mGraph.edges_end() && !full; eit++) { TEDGE& edge = (*eit); SCell& cell = mCells.get(edge[0], edge[1]); @@ -409,8 +409,8 @@ public: // II. Go To All Neighboring Cells And Get Them //============================================== int iRange = (int)(range) + 1; - TCells::riterator rcell; - TCells::riterator rcellend; + typename TCells::riterator rcell; + typename TCells::riterator rcellend; CVec3 cellCenter(0,0,0); CVec3 nodeCenter(0,0,0);