/************************************************************************* * Copyright (C) 2009 by Renaud Guezennec * * * * https://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 #include "keepdiceexecnode.h" #include "parsingtoolbox.h" KeepDiceExecNode::KeepDiceExecNode() : m_diceResult(new DiceResult()) { m_result= m_diceResult; } KeepDiceExecNode::~KeepDiceExecNode() {} void KeepDiceExecNode::run(ExecutionNode* previous) { m_previousNode= previous; if(nullptr == previous || nullptr == m_numberOfDiceNode) { return; } m_numberOfDiceNode->run(previous); auto lastnode = ParsingToolBox::getLeafNode(m_numberOfDiceNode); if(nullptr == lastnode) return; auto result = lastnode->getResult(); if(nullptr == result) return; if(!result->hasResultOfType(Dice::RESULT_TYPE::SCALAR)) return; auto numberOfDice = result->getResult(Dice::RESULT_TYPE::SCALAR).toInt(); DiceResult* previousDiceResult = dynamic_cast(previous->getResult()); m_result->setPrevious(previousDiceResult); if(nullptr != previousDiceResult) { QList diceList= previousDiceResult->getResultList(); if(numberOfDice < 0) { numberOfDice= diceList.size() + numberOfDice; } QList diceList3= diceList.mid(0, static_cast(numberOfDice)); QList diceList2; for(Die* die : qAsConst(diceList3)) { Die* tmpdie= new Die(*die); diceList2.append(tmpdie); die->displayed(); die->setSelected(false); } if(numberOfDice > static_cast(diceList.size())) { m_errors.insert(Dice::ERROR_CODE::TOO_MANY_DICE, QObject::tr(" You ask to keep %1 dice but the result only has %2") .arg(numberOfDice) .arg(diceList.size())); } for(auto& tmp : diceList.mid(static_cast(numberOfDice), -1)) { tmp->setHighlighted(false); } m_diceResult->setResultList(diceList2); if(nullptr != m_nextNode) { m_nextNode->run(this); } } } void KeepDiceExecNode::setDiceKeepNumber(ExecutionNode* n) { m_numberOfDiceNode = n; } QString KeepDiceExecNode::toString(bool wl) const { if(wl) { auto param = m_numberOfDiceNode->toString(wl); return QString("%1 [label=\"KeepDiceExecNode %2\"]").arg(m_id, param); } else { return m_id; } } qint64 KeepDiceExecNode::getPriority() const { qint64 priority= 0; if(nullptr != m_previousNode) { priority= m_previousNode->getPriority(); } return priority; } ExecutionNode* KeepDiceExecNode::getCopy() const { KeepDiceExecNode* node = new KeepDiceExecNode(); if(nullptr != m_numberOfDiceNode) { node->setDiceKeepNumber(m_numberOfDiceNode->getCopy()); } if(nullptr != m_nextNode) { node->setNextNode(m_nextNode->getCopy()); } return node; }