Pathfinding.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_PATHFINDING_H
#define OPENXCOM_PATHFINDING_H

#include <vector>
#include "Position.h"
#include "PathfindingNode.h"
#include "../Ruleset/MapData.h"

namespace OpenXcom
{

class SavedBattleGame;
class Tile;
class BattleUnit;

class Pathfinding
{
private:
    SavedBattleGame *_save;
    std::vector<PathfindingNode> _nodes;
    int _size;
    BattleUnit *_unit;
    bool _pathPreviewed;
    bool _strafeMove;
    int _totalTUCost;
    bool _modifierUsed;
    MovementType _movementType;
    PathfindingNode *getNode(const Position& pos);
    bool isBlocked(Tile *tile, const int part, BattleUnit *missileTarget, int bigWallExclusion = -1);
    bool bresenhamPath(const Position& origin, const Position& target, BattleUnit *missileTarget, bool sneak = false, int maxTUCost = 1000);
    bool aStarPath(const Position& origin, const Position& target, BattleUnit *missileTarget, bool sneak = false, int maxTUCost = 1000);
    bool canFallDown(Tile *destinationTile);
    bool canFallDown(Tile *destinationTile, int size);
    std::vector<int> _path;
public:
    bool isOnStairs(const Position &startPosition, const Position &endPosition);
    bool isBlocked(Tile *startTile, Tile *endTile, const int direction, BattleUnit *missileTarget);
    static const int DIR_UP = 8;
    static const int DIR_DOWN = 9;
    enum bigWallTypes{ BLOCK = 1, BIGWALLNESW, BIGWALLNWSE, BIGWALLWEST, BIGWALLNORTH, BIGWALLEAST, BIGWALLSOUTH, BIGWALLEASTANDSOUTH};
    static const int O_BIGWALL = -1;
    Pathfinding(SavedBattleGame *save);
    ~Pathfinding();
    void calculate(BattleUnit *unit, Position endPosition, BattleUnit *missileTarget = 0, int maxTUCost = 1000);
    static void directionToVector(const int direction, Position *vector);
    static void vectorToDirection(const Position &vector, int &dir);
    int getStartDirection();
    int dequeuePath();
    int getTUCost(const Position &startPosition, const int direction, Position *endPosition, BattleUnit *unit, BattleUnit *target, bool missile);
    void abortPath();
    bool getStrafeMove() const;
    bool validateUpDown(BattleUnit *bu, Position startPosition, const int direction);
    bool previewPath(bool bRemove = false);
    bool removePreview();
    void setUnit(BattleUnit *unit);
    std::vector<int> findReachable(BattleUnit *unit, int tuMax);
    int getTotalTUCost() const { return _totalTUCost; }
    bool isPathPreviewed() const;
    bool isModifierUsed() const;
    const std::vector<int> &getPath();
    std::vector<int> copyPath() const;
};

}

#endif