Repository navigation
Expand file tree
/
Copy pathPathfindingNode.cpp
More file actions
135 lines (121 loc) · 2.85 KB
/
Copy pathPathfindingNode.cpp
File metadata and controls
135 lines (121 loc) · 2.85 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
/*
* Copyright 2010-2013 OpenXcom Developers.
*
* This file is part of OpenXcom.
*
* OpenXcom is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* OpenXcom is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with OpenXcom. If not, see <http://www.gnu.org/licenses/>.
*/
#include "PathfindingNode.h"
#include "Position.h"
#include <math.h>
namespace OpenXcom
{
/**
* Sets up a PathfindingNode.
* @param pos Position.
*/
PathfindingNode::PathfindingNode(Position pos) : _pos(pos), _openentry(0)
{
}
/**
* Deletes the PathfindingNode.
*/
PathfindingNode::~PathfindingNode()
{
}
/**
* Get the node position
* @return node position
*/
const Position &PathfindingNode::getPosition() const
{
return _pos;
}
/**
* Reset node.
*/
void PathfindingNode::reset()
{
_checked = false;
_openentry = 0;
}
/**
* Is checked?
* @return bool
*/
bool PathfindingNode::isChecked() const
{
return _checked;
}
/**
* Get TU cost.
* @return cost
*/
int PathfindingNode::getTUCost(bool missile) const
{
if (missile)
return 0;
else
return _tuCost;
}
/**
* Get previous node
* @return pointer to previous node
*/
PathfindingNode* PathfindingNode::getPrevNode() const
{
return _prevNode;
}
/**
* Get previous walking direction how we got on this node.
* @return previous vector
*/
int PathfindingNode::getPrevDir() const
{
return _prevDir;
}
/**
* Connect node. This will connect the node to the previous node along the path to @a target
* and update the pathfinding information.
* @param tuCost The total cost of the path so far.
* @param prevNode The previous node along the path.
* @param prevDir The direction FROM the previous node.
* @param target The target position (used to update our guess cost).
*/
void PathfindingNode::connect(int tuCost, PathfindingNode* prevNode, int prevDir, const Position &target)
{
_tuCost = tuCost;
_prevNode = prevNode;
_prevDir = prevDir;
if (!inOpenSet()) // Otherwise we have this already.
{
Position d = target - _pos;
d *= d;
_tuGuess = 4 * sqrt((double)d.x + d.y + d.z);
}
}
/**
* Connect node. This will connect the node to the previous node along the path.
* @param tuCost The total cost of the path so far.
* @param prevNode The previous node along the path.
* @param prevDir The direction FROM the previous node.
*/
void PathfindingNode::connect(int tuCost, PathfindingNode* prevNode, int prevDir)
{
_tuCost = tuCost;
_prevNode = prevNode;
_prevDir = prevDir;
_tuGuess = 0;
}
}