/*************************************************************************
 *   Copyright (C) 2009 by Renaud Guezennec                              *
 *                                                                       *
 *   http://www.rolisteam.org/                                           *
 *                                                                       *
 *   rolisteam 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 2 of the License,   *
 *   or (at your option) any later version.                              *
 *                                                                       *
 *   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.           *
 *************************************************************************/
#include "jumpbackwardnode.h"
#include <QDebug>

JumpBackwardNode::JumpBackwardNode()
{
    m_previousNode=NULL;
    m_diceResult =new DiceResult();
    m_result = m_diceResult;
}



qint64 JumpBackwardNode::getPriority() const
{
    return 4;
}
QString JumpBackwardNode::toString(bool wl) const
{
	if(wl)
	{
		return QString("%1 [label=\"JumpBackwardNode\"]").arg(m_id);
	}
	else
	{
		return m_id;
	}
}
void JumpBackwardNode::run(ExecutionNode* previous)
{
        m_previousNode = previous;
		ExecutionNode* parent = previous;
		bool found=false;
        int i = 3;
		Result* result=NULL;
        while((NULL!=parent)&&(!found))
		{

			result = parent->getResult();
            if((NULL!=result))
			{
				--i;
                if((i==0)&&(result->hasResultOfType(Result::DICE_LIST)))
				{
					found =true;
				}
			}
            if(!found)
            {
                parent = parent->getPreviousNode();
            }

		}
        DiceResult* diceResult = dynamic_cast<DiceResult*>(result);
        foreach(Die* die,diceResult->getResultList())
        {
            Die* tmpdie = new Die();
            *tmpdie=*die;
            m_diceResult->insertResult(tmpdie);
            die->displayed();
        }


        m_result->setPrevious(parent->getResult());



        if(NULL!=m_nextNode)
        {
            m_nextNode->run(this);
        }
        for(int i =0;i<diceResult->getResultList().size();++i)
        {
            Die* tmp =diceResult->getResultList().at(i);
            Die* tmp2 =m_diceResult->getResultList().at(i);
            if(tmp->isHighlighted())
            {
                tmp2->setHighlighted(true);
            }
        }


}