blob: ca410b398c3bd567c3d7e3a1f6c130c1da2a149f (
plain) (
blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
|
/***************************************************************************
* 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 {};
}
|