ioquake/jedi-academy
0
0
Fork 0
mirror of https://github.com/ioquake/jedi-academy.git synced 2024-11-10 07:11:44 +00:00
Code Issues Projects Releases Packages Wiki Activity

add the typename keyword as needed to Ragl

Browse source
This commit is contained in:
Jonathan Gray 2013-04-23 20:09:21 +10:00
parent ef2d578693
commit e141c98002
2 changed files with 7 additions and 7 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

2
code/Ragl/graph_region.h
View file

@ -183,7 +183,7 @@ public:
bool find_regions(const typename TGraph::user& user) bool find_regions(const typename TGraph::user& user)
{ {
int CurNodeIndex; 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(); CurNodeIndex = i.index();
if (mRegions[CurNodeIndex] == NULL_REGION) if (mRegions[CurNodeIndex] == NULL_REGION)

12
code/Ragl/graph_vs.h
View file

@ -290,7 +290,7 @@ public:
// I. Fill All The Cells With The Points Contained By Those Cells // I. Fill All The Cells With The Points Contained By Those Cells
//---------------------------------------------------------------- //----------------------------------------------------------------
bool full = false; 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); TNODE& node = (*it);
SCell& cell = mCells.get(node[0], node[1]); SCell& cell = mCells.get(node[0], node[1]);
@ -306,8 +306,8 @@ public:
// II. Go To All Neighboring Cells And Get Them // II. Go To All Neighboring Cells And Get Them
//============================================== //==============================================
int iRange = (int)(range) + 1; int iRange = (int)(range) + 1;
TCells::riterator rcell; typename TCells::riterator rcell;
TCells::riterator rcellend; typename TCells::riterator rcellend;
CVec3 cellCenter(0,0,0); CVec3 cellCenter(0,0,0);
CVec3 nodeCenter(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 // I. Fill All The Cells With The Points Contained By Those Cells
//---------------------------------------------------------------- //----------------------------------------------------------------
bool full = false; 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); TEDGE& edge = (*eit);
SCell& cell = mCells.get(edge[0], edge[1]); SCell& cell = mCells.get(edge[0], edge[1]);
@ -409,8 +409,8 @@ public:
// II. Go To All Neighboring Cells And Get Them // II. Go To All Neighboring Cells And Get Them
//============================================== //==============================================
int iRange = (int)(range) + 1; int iRange = (int)(range) + 1;
TCells::riterator rcell; typename TCells::riterator rcell;
TCells::riterator rcellend; typename TCells::riterator rcellend;
CVec3 cellCenter(0,0,0); CVec3 cellCenter(0,0,0);
CVec3 nodeCenter(0,0,0); CVec3 nodeCenter(0,0,0);