mirror of
https://github.com/ApfelTeeSaft/PlanetFleet.git
synced 2026-08-26 19:33:38 +00:00
styling
This commit is contained in:
+3
-3
@@ -10,10 +10,10 @@ namespace battleship{
|
||||
static Pathfinder *pathfinder = nullptr;
|
||||
|
||||
Pathfinder* Pathfinder::getSingleton(){
|
||||
if(!pathfinder)
|
||||
pathfinder = new Pathfinder();
|
||||
if(!pathfinder)
|
||||
pathfinder = new Pathfinder();
|
||||
|
||||
return pathfinder;
|
||||
return pathfinder;
|
||||
}
|
||||
|
||||
int Pathfinder::findMinDistVert(vector<Map::Cell> &cells, u32 distances[]){
|
||||
|
||||
+11
-11
@@ -8,18 +8,18 @@
|
||||
#include <util.h>
|
||||
|
||||
namespace battleship{
|
||||
class Pathfinder{
|
||||
public:
|
||||
static Pathfinder* getSingleton();
|
||||
std::vector<int> findPath(std::vector<Map::Cell>&, int, int, int = -1);
|
||||
inline vb01::u32 getImpassibleNodeVal(){return impassibleNodeVal;}
|
||||
inline void setImpassibleNodeVal(vb01::u32 val){this->impassibleNodeVal = val;}
|
||||
private:
|
||||
Pathfinder(){}
|
||||
int findMinDistVert(std::vector<Map::Cell>&, vb01::u32[]);
|
||||
class Pathfinder{
|
||||
public:
|
||||
static Pathfinder* getSingleton();
|
||||
std::vector<int> findPath(std::vector<Map::Cell>&, int, int, int = -1);
|
||||
inline vb01::u32 getImpassibleNodeVal(){return impassibleNodeVal;}
|
||||
inline void setImpassibleNodeVal(vb01::u32 val){this->impassibleNodeVal = val;}
|
||||
private:
|
||||
Pathfinder(){}
|
||||
int findMinDistVert(std::vector<Map::Cell>&, vb01::u32[]);
|
||||
|
||||
vb01::u32 impassibleNodeVal;
|
||||
};
|
||||
vb01::u32 impassibleNodeVal;
|
||||
};
|
||||
}
|
||||
|
||||
#endif
|
||||
|
||||
+1
-1
@@ -54,7 +54,7 @@ namespace battleship{
|
||||
}
|
||||
|
||||
void PathfinderTest::testFindBigPath(){
|
||||
int numIterations = 10;
|
||||
int numIterations = 1;
|
||||
cells = generateCellGraph(60);
|
||||
s64 sumTime = 0;
|
||||
|
||||
|
||||
Reference in New Issue
Block a user