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
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
|
/*
* Copyright (C) 2013, 2014, 2015 by the Konclude Developer Team.
*
* This file is part of the reasoning system Konclude.
* For details and support, see <http://konclude.com/>.
*
* Konclude is free software: you can redistribute it and/or modify it under
* the terms of version 2.1 of the GNU Lesser General Public License (LGPL2.1)
* as published by the Free Software Foundation.
*
* You should have received a copy of the GNU Lesser General Public License
* along with Konclude. If not, see <http://www.gnu.org/licenses/>.
*
* Konclude 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. For more
* details, see GNU Lesser General Public License.
*
*/
#include "CBranchTreeNode.h"
namespace Konclude {
namespace Reasoner {
namespace Kernel {
namespace Process {
namespace Dependency {
CBranchTreeNode::CBranchTreeNode(CProcessContext* processContext) {
mProcessContext = processContext;
mBranchedDepTrackPoint = nullptr;
mSatCalcTask = nullptr;
KONCLUCE_TASK_ALGORITHM_BRANCH_STRING_INSTRUCTION(mBranchString = nullptr);
}
CBranchTreeNode* CBranchTreeNode::initBranchingRootNode(Task::CSatisfiableCalculationTask* satCalcTask) {
mParentNode = nullptr;
mRootNode = this;
initBranchingTag((cint64)0);
mSatCalcTask = satCalcTask;
return this;
}
CBranchTreeNode* CBranchTreeNode::initBranchingChildNode(CBranchTreeNode* parentBranchTreeNode, Task::CSatisfiableCalculationTask* satCalcTask) {
mSatCalcTask = satCalcTask;
mBranchedDepTrackPoint = nullptr;
mParentNode = parentBranchTreeNode;
mRootNode = nullptr;
initBranchingTag((cint64)0);
if (parentBranchTreeNode) {
mRootNode = parentBranchTreeNode->mRootNode;
setBranchingTag(parentBranchTreeNode->getBranchingLevel());
}
return this;
}
CBranchTreeNode* CBranchTreeNode::branchingIncrement(CNonDeterministicDependencyTrackPoint* depTrackPoint) {
incBranchingTag();
mBranchedDepTrackPoint = depTrackPoint;
return this;
}
CNonDeterministicDependencyTrackPoint* CBranchTreeNode::getDependencyTrackPoint() {
return mBranchedDepTrackPoint;
}
CBranchTreeNode* CBranchTreeNode::initBranchingCopyNode(CBranchTreeNode* copyBranchTreeNode, Task::CSatisfiableCalculationTask* satCalcTask) {
mSatCalcTask = satCalcTask;
mBranchedDepTrackPoint = copyBranchTreeNode->mBranchedDepTrackPoint;
mParentNode = copyBranchTreeNode->mParentNode;
mRootNode = copyBranchTreeNode->mRootNode;
setBranchingTag(copyBranchTreeNode->getBranchingLevel());
if (copyBranchTreeNode->isRootNode()) {
mRootNode = this;
}
return this;
}
CBranchTreeNode* CBranchTreeNode::getParentNode() {
return mParentNode;
}
CBranchTreeNode* CBranchTreeNode::getRootNode() {
return mRootNode;
}
bool CBranchTreeNode::isRootNode() {
return mRootNode == this;
}
cint64 CBranchTreeNode::getBranchingLevel() {
return getBranchingTag();
}
Task::CSatisfiableCalculationTask* CBranchTreeNode::getSatisfiableCalculationTask() {
return mSatCalcTask;
}
KONCLUCE_TASK_ALGORITHM_BRANCH_STRING_INSTRUCTION(CBranchTreeNode* CBranchTreeNode::setBranchString(QString* string) {\
mBranchString = string;\
return this;\
})
}; // end namespace Dependency
}; // end namespace Process
}; // end namespace Kernel
}; // end namespace Reasoner
}; // end namespace Konclude
|
