diff options
| author | 2022-04-29 10:48:09 +0200 | |
|---|---|---|
| committer | 2022-04-29 10:48:09 +0200 | |
| commit | 07c5f6ec23fcf9237a24e71adcfacabce677f818 (patch) | |
| tree | 588e8c5f82b9163181fad3581f610e6f1d88cba4 /result/result.cpp | |
| parent | a9153f1615a842cfb9e9bcda4d9071e202618569 (diff) | |
| download | OneRoll-07c5f6ec23fcf9237a24e71adcfacabce677f818.tar.gz OneRoll-07c5f6ec23fcf9237a24e71adcfacabce677f818.zip | |
Change file organization.
Diffstat (limited to 'result/result.cpp')
| -rw-r--r-- | result/result.cpp | 86 |
1 files changed, 0 insertions, 86 deletions
diff --git a/result/result.cpp b/result/result.cpp deleted file mode 100644 index ca410b3..0000000 --- a/result/result.cpp +++ /dev/null @@ -1,86 +0,0 @@ -/*************************************************************************** - * Copyright (C) 2014 by Renaud Guezennec * - * https://rolisteam.org/contact * - * * - * This file is part of DiceParser * - * * - * DiceParser 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 "result.h" -#include <QUuid> - -Result::Result() - : m_resultTypes(static_cast<int>(Dice::RESULT_TYPE::NONE)) - , m_id(QString("\"%1\"").arg(QUuid::createUuid().toString())) - , m_previous(nullptr) -{ -} -Result::~Result() {} - -Result* Result::getPrevious() const -{ - return m_previous; -} - -void Result::setPrevious(Result* p) -{ - Q_ASSERT(p != this); - m_previous= p; -} - -bool Result::isStringResult() const -{ - return false; -} -void Result::clear() {} -bool Result::hasResultOfType(Dice::RESULT_TYPE type) const -{ - return (m_resultTypes & static_cast<int>(type)); -} -void Result::generateDotTree(QString& s) -{ - auto str= toString(true); - if(s.contains(str)) - return; - s.append(str); - s.append(";\n"); - - if(nullptr != m_previous) - { - s.append(toString(false)); - s.append(" -> "); - s.append(m_previous->toString(false)); - s.append("[label=\"previousResult\"]\n"); - m_previous->generateDotTree(s); - } - else - { - s.append(toString(false)); - s.append(" -> "); - s.append("nullptr"); - s.append(" [label=\"previousResult\", shape=\"box\"];\n"); - } -} - -QString Result::getId() const -{ - return m_id; -} - -QString Result::getStringResult() const -{ - return {}; -} |