D:/simple_rts/include/AStarSearchManager.h

Go to the documentation of this file.

#ifndef __ASTAR_SEARCH_MANAGER_H__
#define __ASTAR_SEARCH_MANAGER_H__

#pragma once

#include "AStarSearch.h"

#include <string>
#include <map>

#include "OgreException.h"
using Ogre::Exception;
using std::string;
using std::map;


template<typename UserState>
class AStarSearchManager
{
// Data Storage
// ----------------------------------------------------------------------------
private:
        typedef map< string, AStarSearch<UserState>* >  SearchMap;
        SearchMap               mSearchList;


// Construction
// ----------------------------------------------------------------------------
public:
        AStarSearchManager ()
        {
                mSearchList.clear ();
        }

        ~AStarSearchManager ()
        {
                destroyAllSearchs ();
        }

// Search Management
// ----------------------------------------------------------------------------
public:
        AStarSearch<UserState>* createSearch ( string name, UserState* startState, UserState* goalState )
        {
                SearchMap::iterator iter = mSearchList.find ( name );
                if ( iter != mSearchList.end() )
                        throw Exception ( Exception::ERR_ITEM_NOT_FOUND, "Search already exists", "AStarSearchManager::createSearch" );

                AStarSearch<UserState>* newSearch = new AStarSearch<UserState> ();
                newSearch->setStartState( startState, goalState );
                mSearchList[name] = newSearch;

                return newSearch;
        }


        // ----------------------------------------------------------------------------
        void destroySearch ( string name )
        {
                SearchMap::iterator iter = mSearchList.find ( name );
                if ( iter == mSearchList.end() )
                        throw Exception ( Exception::ERR_ITEM_NOT_FOUND, "Search doesn't exists", "AStarSearchManager::destroySearch" );

                delete (*iter).second;
                mSearchList.erase ( iter );
        }


        // ----------------------------------------------------------------------------
        void destroyAllSearchs ()
        {
                SearchMap::iterator iter = mSearchList.begin ();
                while ( iter != mSearchList.end() )
                {
                        delete (*iter).second;
                        iter++;
                }
                mSearchList.clear ();
        }


        // ----------------------------------------------------------------------------
        bool isSearchSolved ( string name )
        {
                return ( _getSearch(name)->getSearchState() == AStarSearch<UserState>::SS_PATH_FOUND );
        }


        // ----------------------------------------------------------------------------
        bool isSearchUnsolvable ( string name )
        {
                return ( _getSearch(name)->getSearchState() == AStarSearch<UserState>::SS_PATH_NOT_FOUND );
        }


        // ----------------------------------------------------------------------------
        void advanceSearch ( string searchName, int numSteps = 1 )
        {
                _advanceSearch ( _getSearch(searchName), numSteps );
        }


        // ----------------------------------------------------------------------------
        void advanceAllSearchs ( int numSteps = 1 )
        {
                SearchMap::iterator iter = mSearchList.begin ();

                while ( iter != mSearchList.end() )
                {
                        _advanceSearch ( (*iter).second, numSteps );
                        iter++;
                }
        }


        // ----------------------------------------------------------------------------
        const WaypointList<UserState>* getSolutionPath ( string name )
        {
                return _getSearch(name)->getSolutionPath();
        }

        // ----------------------------------------------------------------------------
        AStarSearch<UserState>* getSearch ( string name )
        {
                SearchMap::iterator iter = mSearchList.find ( name );
                if ( iter == mSearchList.end() )
                        throw Exception ( Exception::ERR_ITEM_NOT_FOUND, "Search not found", "AStarSearchManager::getSearch" );

                return (*iter).second;
        }


// Helper Methods
// ----------------------------------------------------------------------------
private:
        void _advanceSearch ( AStarSearch<UserState>* search, int numSteps )
        {
                for ( int i = 0; i < numSteps; i++ )
                {
                        // Only advance the solution if it is possible
                        // (either no path is possible or we found it)
                        if ( search->isRunnable() )
                                search->advanceSearch ();
                        else
                                break;
                }
        }
};

#endif

---