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
|
/*
* 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 "CRealizingTestingStep.h"
#include "COntologyRealizingItem.h"
namespace Konclude {
namespace Reasoner {
namespace Realizer {
CRealizingTestingStep::CRealizingTestingStep(TESTINGSTEPTYPE testingStepType, COntologyProcessingStepData* ontProcStepData, COntologyRealizingItem* preproItem) {
mTestingStepType = testingStepType;
mOntologyPreproItem = preproItem;
mProcessingStepData = ontProcStepData;
mStepFinished = false;
}
COntologyRealizingItem* CRealizingTestingStep::getOntologyRealizingItem() {
return mOntologyPreproItem;
}
CRealizingTestingStep* CRealizingTestingStep::setOntologyRealizingItem(COntologyRealizingItem* preproItem) {
mOntologyPreproItem = preproItem;
return this;
}
bool CRealizingTestingStep::isStepFinished() {
return mStepFinished;
}
bool CRealizingTestingStep::areStepProcessingRequirementSatisfied() {
return mProcessingStepData->getProcessingStep()->areAllRequirementsSatisfied(mOntologyPreproItem->getOntology());
}
bool CRealizingTestingStep::hasRequirements() {
return !mRequirementStepDataList.isEmpty();
}
CRealizingTestingStep* CRealizingTestingStep::setStepFinished(bool finished) {
mStepFinished = finished;
cint64 installFlags = COntologyProcessingStatus::PSCOMPLETELYYPROCESSED;
mProcessingStepData->getProcessingStatus()->setProcessingFlags(installFlags);
return this;
}
QList<COntologyProcessingRequirement*>* CRealizingTestingStep::getRequirementList() {
return &mRequirementStepDataList;
}
COntologyProcessingStepData* CRealizingTestingStep::getProcessingStepData() {
return mProcessingStepData;
}
CRealizingTestingStep::TESTINGSTEPTYPE CRealizingTestingStep::getRealizingTestingType() {
return mTestingStepType;
}
CRealizingTestingStep* CRealizingTestingStep::setProcessingStepData(COntologyProcessingStepData* processingData) {
mProcessingStepData = processingData;
return this;
}
CRealizingTestingStep* CRealizingTestingStep::addProcessingRequirement(COntologyProcessingRequirement* processingRequirement) {
mRequirementStepDataList.append(processingRequirement);
return this;
}
CRealizingTestingStep* CRealizingTestingStep::submitRequirementsUpdate(cint64 flags, bool clearRequirements) {
mProcessingStepData->getProcessingStatus()->setErrorFlags(flags);
for (QList<COntologyProcessingRequirement*>::const_iterator it = mRequirementStepDataList.constBegin(), itEnd = mRequirementStepDataList.constEnd(); it != itEnd; ++it) {
COntologyProcessingRequirement* requirement(*it);
requirement->submitRequirementUpdate(COntologyProcessingStatus::PSCOMPLETELYYPROCESSED,flags);
}
if (clearRequirements) {
mRequirementStepDataList.clear();
}
return this;
}
}; // end namespace Realizer
}; // end namespace Reasoner
}; // end namespace Konclude
|
