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
|
/*
* 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 "CBranchingTree.h"
namespace Konclude {
namespace Reasoner {
namespace Kernel {
namespace Process {
namespace Dependency {
CBranchingTree::CBranchingTree(CProcessContext* processContext) {
mPocessContext = processContext;
}
CBranchingTree* CBranchingTree::initBranchingTree(CBranchingTree* tree) {
mRootNode = nullptr;
mCurrNode = nullptr;
mPrevCurrNode = nullptr;
mBaseDepNode = nullptr;
if (tree) {
mPrevCurrNode = tree->mPrevCurrNode;
mRootNode = tree->mRootNode;
mBaseDepNode = tree->mBaseDepNode;
}
return this;
}
CBranchTreeNode* CBranchingTree::getBranchTreeNode(Task::CSatisfiableCalculationTask* task, bool forceBranchCreation) {
if (mCurrNode) {
if (mCurrNode->getSatisfiableCalculationTask() != task) {
CBranchTreeNode* branchNode = CObjectParameterizingAllocator< CBranchTreeNode,CProcessContext* >::allocateAndConstructAndParameterize(mPocessContext->getUsedMemoryAllocationManager(),mPocessContext);
branchNode->initBranchingCopyNode(mCurrNode,task);
mCurrNode = branchNode;
mPrevCurrNode = mCurrNode;
if (branchNode->isRootNode()) {
mRootNode = branchNode;
}
}
if (forceBranchCreation) {
CBranchTreeNode* branchNode = CObjectParameterizingAllocator< CBranchTreeNode,CProcessContext* >::allocateAndConstructAndParameterize(mPocessContext->getUsedMemoryAllocationManager(),mPocessContext);
branchNode->initBranchingChildNode(mCurrNode,task);
mCurrNode = branchNode;
mPrevCurrNode = mCurrNode;
}
} else if (!mCurrNode) {
if (mPrevCurrNode) {
CBranchTreeNode* branchNode = CObjectParameterizingAllocator< CBranchTreeNode,CProcessContext* >::allocateAndConstructAndParameterize(mPocessContext->getUsedMemoryAllocationManager(),mPocessContext);
branchNode->initBranchingChildNode(mPrevCurrNode,task);
mCurrNode = branchNode;
mPrevCurrNode = mCurrNode;
} else {
CBranchTreeNode* branchNode = CObjectParameterizingAllocator< CBranchTreeNode,CProcessContext* >::allocateAndConstructAndParameterize(mPocessContext->getUsedMemoryAllocationManager(),mPocessContext);
branchNode->initBranchingRootNode(task);
mCurrNode = branchNode;
mRootNode = branchNode;
mPrevCurrNode = mCurrNode;
}
}
return mCurrNode;
}
CDependencyNode* CBranchingTree::getBaseDependencyNode(bool create) {
if (!mBaseDepNode && create) {
CIndependentBaseDependencyNode* indBaseDepNode = CObjectParameterizingAllocator< CIndependentBaseDependencyNode,CProcessContext* >::allocateAndConstructAndParameterize(mPocessContext->getUsedMemoryAllocationManager(),mPocessContext);
indBaseDepNode->initIndependentBaseDependencyNode();
mBaseDepNode = indBaseDepNode;
}
return mBaseDepNode;
}
}; // end namespace Dependency
}; // end namespace Process
}; // end namespace Kernel
}; // end namespace Reasoner
}; // end namespace Konclude
|
