multilayersearch.h

Go to the documentation of this file.

/***************************************************************************
 *   Copyright (C) 2005-2019 by the FIFE team                              *
 *   http://www.fifengine.net                                              *
 *   This file is part of FIFE.                                            *
 *                                                                         *
 *   FIFE is free software; you can redistribute it and/or                 *
 *   modify it under the terms of the GNU Lesser General Public            *
 *   License as published by the Free Software Foundation; either          *
 *   version 2.1 of the License, or (at your option) any later version.    *
 *                                                                         *
 *   This library 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     *
 *   Lesser General Public License for more details.                       *
 *                                                                         *
 *   You should have received a copy of the GNU Lesser General Public      *
 *   License along with this library; if not, write to the                 *
 *   Free Software Foundation, Inc.,                                       *
 *   51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA          *
 ***************************************************************************/

#ifndef FIFE_PATHFINDER_MULTILAYERSEARCH
#define FIFE_PATHFINDER_MULTILAYERSEARCH

// Standard C++ library includes

// 3rd party library includes

// FIFE includes
// These includes are split up in two parts, separated by one empty line
// First block: files included from the FIFE root src directory
// Second block: files included from the same folder
#include "util/structures/priorityqueue.h"

#include "routepathersearch.h"

namespace FIFE {

    class CellCache;
    class Route;
    class Zone;

    class MultiLayerSearch: public RoutePatherSearch {
    public:
        MultiLayerSearch(Route* route, const int32_t sessionId);
        
        ~MultiLayerSearch();

        void updateSearch();
        
        void calcPath();

    private:
        void createSearchFrontier(int32_t startInt, CellCache* cache);
        
        void calcPathStep();

        void searchBetweenTargetsNeighbor();
        
        void searchBetweenTargetsMap();

        Location m_to;
        Location m_from;

        CellCache* m_startCache;
        CellCache* m_endCache;
        CellCache* m_currentCache;

        // A pointer to the start Zone.
        Zone* m_startZone;
        // A pointer to the end Zone.
        Zone* m_endZone;

        int32_t m_startCoordInt;
        int32_t m_lastStartCoordInt;
        int32_t m_destCoordInt;
        int32_t m_lastDestCoordInt;
        int32_t m_next;

        std::vector<int32_t> m_spt;
        std::vector<int32_t> m_sf;
        std::vector<double> m_gCosts;
        PriorityQueue<int32_t, double> m_sortedFrontier;

        std::list<Cell*> m_betweenTargets;
        bool m_foundLast;
        Path m_path;
    };
}
#endif