PathfindingNode.h

/*
 * Copyright 2010-2014 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/>.
 */
#ifndef OPENXCOM_PATHFINDINGNODE_H
#define OPENXCOM_PATHFINDINGNODE_H

#include "Position.h"

namespace OpenXcom
{

class PathfindingOpenSet;
struct OpenSetEntry;

class PathfindingNode
{
private:
    Position _pos;
    bool _checked;
    int _tuCost;
    PathfindingNode* _prevNode;
    int _prevDir;
    int _tuGuess;
    // Invasive field needed by PathfindingOpenSet
    OpenSetEntry *_openentry;
    friend class PathfindingOpenSet;
public:
    PathfindingNode(Position pos);
    ~PathfindingNode();
    const Position &getPosition() const;
    void reset();
    bool isChecked() const;
    void setChecked() { _checked = true; }
    int getTUCost(bool missile) const;
    PathfindingNode* getPrevNode() const;
    int getPrevDir() const;
    bool inOpenSet() const { return (_openentry != 0); }
    int getTUGuess() const { return _tuGuess; }

    #ifdef __MORPHOS__
    #undef connect
    #endif

    void connect(int tuCost, PathfindingNode* prevNode, int prevDir, const Position &target);
    void connect(int tuCost, PathfindingNode* prevNode, int prevDir);
};

class MinNodeCosts
{
public:
    bool operator()(const PathfindingNode *a, const PathfindingNode *b) const
    {
        return a->getTUCost(false) < b->getTUCost(false);
    }
};

}

#endif