Maximilian/unreal
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Neighbors function draft; refactoring

Browse Source
This commit is contained in:
Maximilian Fajnberg
2022-01-13 16:34:06 +01:00
parent b5c9c661fe
commit 219b99c8d7
6 changed files with 34 additions and 14 deletions
Download Patch File Download Diff File Expand all files Collapse all files

26
AdventureMap.cpp
View File

@ -92,3 +92,29 @@ AHexTile* AAdventureMap::RandomHex()
}
return Grid[RandHex];
}
TArray<AHexTile*> AAdventureMap::Neighbors(AHexTile* OfHex)
{
TArray<AHexTile*> Neighbors;
int32 Index;
Index = GridIndex(OfHex->Q + 1 , OfHex->R + 0 );
if (Index < Grid.Num() && Index >= 0) { Neighbors.Add(Grid[Index]); }
Index = GridIndex(OfHex->Q + 1 , OfHex->R - 1 );
if (Index < Grid.Num() && Index >= 0) { Neighbors.Add(Grid[Index]); }
Index = GridIndex(OfHex->Q + 0 , OfHex->R - 1 );
if (Index < Grid.Num() && Index >= 0) { Neighbors.Add(Grid[Index]); }
Index = GridIndex(OfHex->Q - 1 , OfHex->R + 0 );
if (Index < Grid.Num() && Index >= 0) { Neighbors.Add(Grid[Index]); }
Index = GridIndex(OfHex->Q - 1 , OfHex->R + 1 );
if (Index < Grid.Num() && Index >= 0) { Neighbors.Add(Grid[Index]); }
Index = GridIndex(OfHex->Q + 0 , OfHex->R + 1 );
if (Index < Grid.Num() && Index >= 0) { Neighbors.Add(Grid[Index]); }
return Neighbors; // currently wrapping from corner to corner --> rectify this with a manhattan distance check
}