summaryrefslogtreecommitdiff
path: root/src/game-server/being.cpp
diff options
context:
space:
mode:
Diffstat (limited to 'src/game-server/being.cpp')
-rw-r--r--src/game-server/being.cpp8
1 files changed, 4 insertions, 4 deletions
diff --git a/src/game-server/being.cpp b/src/game-server/being.cpp
index 7b934a61..634d566a 100644
--- a/src/game-server/being.cpp
+++ b/src/game-server/being.cpp
@@ -126,7 +126,7 @@ void Being::setDestination(const Point &dst)
mPath.clear();
}
-std::list<PATH_NODE> Being::findPath()
+Path Being::findPath()
{
mOld = getPosition();
int startX = mOld.x / 32, startY = mOld.y / 32;
@@ -165,7 +165,7 @@ void Being::move()
* class has been used, because that seems to be the most logical
* place extra functionality will be added.
*/
- for (std::list<PATH_NODE>::iterator pathIterator = mPath.begin();
+ for (PathIterator pathIterator = mPath.begin();
pathIterator != mPath.end(); pathIterator++)
{
if (!map->getWalk(pathIterator->x, pathIterator->y, getWalkMask()))
@@ -190,11 +190,11 @@ void Being::move()
return;
}
- PATH_NODE prev(tileSX, tileSY);
+ Position prev(tileSX, tileSY);
Point pos;
do
{
- PATH_NODE next = mPath.front();
+ Position next = mPath.front();
mPath.pop_front();
// 362 / 256 is square root of 2, used for walking diagonally
mActionTime += (prev.x != next.x && prev.y != next.y)