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
|
/*
* Copyright (C) 2013-2015, 2019 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 3 of the GNU Lesser General Public
* License (LGPLv3) as published by the Free Software Foundation.
*
* 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. See the
* GNU (Lesser) General Public License for more details.
*
* You should have received a copy of the GNU (Lesser) General Public
* License along with Konclude. If not, see <http://www.gnu.org/licenses/>.
*
*/
#include "CThroughputTestTask.h"
namespace Konclude {
namespace Test {
CThroughputTestTask::CThroughputTestTask(CMemoryPool* memoryPool) : CTask(memoryPool) {
mMaxBranchDepth = 0;
mCurBranchDepth = 0;
mBranchingFactor = 0;
}
CThroughputTestTask::~CThroughputTestTask() {
}
cint64 CThroughputTestTask::getBranchingFactor() {
return mBranchingFactor;
}
cint64 CThroughputTestTask::getCurrentBranchingDepth() {
return mCurBranchDepth;
}
cint64 CThroughputTestTask::getMaximumBranchingDepth() {
return mMaxBranchDepth;
}
CTask* CThroughputTestTask::makeTaskReference(CTask* dependedTask, CTaskHandleContext* handlerContext) {
CTask::makeTaskReference(dependedTask,handlerContext);
CThroughputTestTask* testDepTask = (CThroughputTestTask*)dependedTask;
testDepTask->mMaxBranchDepth = mMaxBranchDepth;
testDepTask->mBranchingFactor = mBranchingFactor;
testDepTask->mCurBranchDepth = mCurBranchDepth+1;
return this;
}
CTask* CThroughputTestTask::initTask(CTask* parentTask, CTaskHandleContext* context) {
CTask::initTask(parentTask,context);
return this;
}
CTask* CThroughputTestTask::initTestTask(cint64 maxBranchDepth, cint64 branchingFactor) {
CTask::initTask(nullptr,nullptr);
mBranchingFactor = branchingFactor;
mMaxBranchDepth = maxBranchDepth;
return this;
}
bool CThroughputTestTask::hasReachedMaxBranchingDepth() {
return mCurBranchDepth >= mMaxBranchDepth;
}
CTaskResult* CThroughputTestTask::createTaskResult(CTaskHandleContext* handlerContext) {
return &mBoolTaskResult;
}
CTaskStatus* CThroughputTestTask::createTaskStatus(CTaskHandleContext* handlerContext) {
return &mDefaultTaskResult;
}
}; // end namespace Test
}; // end namespace Konclude
|
