FCSStateStorage.h

Go to the documentation of this file.

#ifndef MMANN_FCS_STATE_STORAGE
#define MMANN_FCS_STATE_STORAGE


#include "CompareAlgorithms.h"
#include "HashAlgorithms.h"
#include "AGenericTree.h"
#include "FCInternalHash.h"
#include "GLIBHash.h"
#include "FCIndirectState.h"
#include "FCSIndirectStateWithLocations.h"
#include "FCSIndirectStateCompareAlgorithm.h"
#include "FCState.h"

#define PREV_STATES_SORT_MARGIN     32

#define PREV_STATES_GROW_BY         128

#define HASH_TABLE_SIZE             2048

#define TALON_CACHE_SIZE            512

class AFCSGenericStateStorage
{
public:
    virtual ~AFCSGenericStateStorage();

    virtual bool CheckAndInsert(FCSStateWithLocations** ExistingState, FCSStateWithLocations* NewState) = 0;
};

class FCTreeStateStorage : public AFCSGenericStateStorage
{
public:
    FCTreeStateStorage();

    virtual ~FCTreeStateStorage();

    virtual bool CheckAndInsert(FCSStateWithLocations** ExistingState, FCSStateWithLocations* NewState);

protected:
    AGenericTree<FCSStateWithLocations, void>* m_Tree;
};

class FCAVLTreeStateStorage : public FCTreeStateStorage
{
public:
    FCAVLTreeStateStorage(ACompareNodesAlgorithm<FCSStateWithLocations, void>* Compare);

    virtual ~FCAVLTreeStateStorage();
};

class FCAVLRedBlackTreeStateStorage : public FCTreeStateStorage
{
public:
    FCAVLRedBlackTreeStateStorage(ACompareNodesAlgorithm<FCSStateWithLocations, void>* Compare);

    virtual ~FCAVLRedBlackTreeStateStorage();
};

class FCRedBlackTreeStateStorage : public FCTreeStateStorage
{
public:
    FCRedBlackTreeStateStorage(ACompareNodesAlgorithm<FCSStateWithLocations, void>* Compare);

    virtual ~FCRedBlackTreeStateStorage();
};

class FCGLIBTreeStateStorage : public FCTreeStateStorage
{
public:
    FCGLIBTreeStateStorage(ACompareNodesAlgorithm<FCSStateWithLocations, void>* Compare);

    virtual ~FCGLIBTreeStateStorage();
};

class FCHashStateStorage : public AFCSGenericStateStorage
{
public:
    FCHashStateStorage();

    virtual ~FCHashStateStorage();

    virtual bool CheckAndInsert(FCSStateWithLocations** ExistingState, FCSStateWithLocations* NewState);

protected:
    AGenericHash<FCSStateWithLocations, void>* m_Hash;
};

class FCGLIBHashStateStorage : public FCHashStateStorage
{
public:

    FCGLIBHashStateStorage(int SizeWanted, ACompareNodesAlgorithm<FCSStateWithLocations, void>* Compare, 
                        AHashAlgorithm<FCSStateWithLocations>* Hash);

    virtual ~FCGLIBHashStateStorage();
};

class FCInternalHashStateStorage : public FCHashStateStorage
{
public:
    FCInternalHashStateStorage(int SizeWanted, ACompareNodesAlgorithm<FCSStateWithLocations, void>* CompareAlgorithm, 
                            AHashAlgorithm<FCSStateWithLocations>* Hash);
    
    virtual ~FCInternalHashStateStorage();
};

class FCIndirectStateStorage : public AFCSGenericStateStorage
{
public:
    FCIndirectStateStorage();

    virtual ~FCIndirectStateStorage();

    virtual bool CheckAndInsert(FCSStateWithLocations** ExistingState, FCSStateWithLocations* NewState);

protected:
    FCSIndirectStateWithLocations<FCSStateWithLocations>* m_IndirectPreviousStatesMargin[PREV_STATES_SORT_MARGIN];

    int m_NumberOfPreviousStatesMargin;    

    FCSIndirectStateWithLocations<FCSStateWithLocations>** m_IndirectPreviousStates;
    int m_NumberOfIndirectPreviousStates;
    int m_MaxNumberOfIndirectPreviousStates;

    FCSIndirectStatesCompareAlgorithm<FCSIndirectStateWithLocations<FCSStateWithLocations>*> m_Compare;
};

/****************************
Add talon class that is similar to above
*****************************/

#endif

---