recipetreenode.h

Go to the documentation of this file.

/*
* recipetreenode.h
*
* Copyright (C) 2011 Atomic Blue (info@planeshift.it, http://www.atomicblue.org)
*
*
* This program 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 (version 2 of the License)
* This program 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 this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
*
*/

#ifndef __RECIPETREENODE_H__
#define __RECIPETREENODE_H__

//=============================================================================
// Crystal Space Includes
//=============================================================================
#include <csutil/array.h>
//=============================================================================
// Project Includes
//=============================================================================

//=============================================================================
// Local Includes
//=============================================================================
#include "tribe.h"
#include "recipe.h"

class Recipe;

#define CYCLIC_RECIPE_PRIORITY 100

class RecipeTreeNode
{
public:
    typedef enum
    {
        REQ_CONCENTRATED,
        REQ_DISTRIBUTED
    } RequirementParseType;
    static const char* RequirementParseTypeString[];


    Recipe*                  recipe;     
    int                      priority;   
    int                      wait;       
    int                      nextStep;   
    int                      cost;       

    RequirementParseType     requirementParseType; 
    int                      nextReq;    

    RecipeTreeNode*          parent;   
    csArray<RecipeTreeNode*> children; 

    RecipeTreeNode(Recipe* newRecipe, int newCost, RecipeTreeNode* parent = NULL);
    ~RecipeTreeNode();

    void AddChild(RecipeTreeNode* child);

    bool AddChild(RecipeTreeNode* child, Recipe* parent);

    bool RemoveChild(RecipeTreeNode* child);

    bool RemoveChild(Recipe* child);

    bool IsRoot()
    {
        return parent == NULL;
    };

    bool IsLeaf()
    {
        return children.GetSize() == 0;
    }

    RecipeTreeNode* GetTreeRecipe(Recipe* searchRecipe);

    RecipeTreeNode* GetNextRecipe();

    bool ModifyWait(Recipe* theRecipe, int delta);

    void UpdateWaitTimes(int delta);

    void DumpRecipeTree()
    {
        DumpRecipeTree(1);
    }
    void DumpRecipeTree(int index);
    void DumpRecipeTreeRecipes()
    {
        DumpRecipeTreeRecipes(1);
    }
    void DumpRecipeTreeRecipes(int index);
};

#endif