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
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
|
/*
* 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 "CTaskStatus.h"
namespace Konclude {
namespace Scheduler {
CTaskStatus::CTaskStatus() {
mTaskState = TSUNINITIALIZED;
mCanceledFlag = false;
mFinishedFlag = false;
mReleaseable = true;
mErrorFlag = false;
mErrorCode = 0;
}
CTaskStatus::~CTaskStatus() {
}
CTaskStatus::TASKSTATE CTaskStatus::getTaskState() {
return mTaskState;
}
CTaskStatus* CTaskStatus::setTaskState(TASKSTATE taskState) {
mTaskState = taskState;
return this;
}
CTaskStatus* CTaskStatus::setCanceled(bool canceled) {
mCanceledFlag = canceled;
return this;
}
CTaskStatus* CTaskStatus::setFinished(bool finished) {
mFinishedFlag = finished;
return this;
}
CTaskStatus* CTaskStatus::setError(bool error, cint64 errorCode) {
mErrorFlag = error;
mErrorCode = errorCode;
return this;
}
CTaskStatus* CTaskStatus::setMemoryReleaseable(bool releaseable) {
mReleaseable = releaseable;
return this;
}
bool CTaskStatus::isFinished() {
return mFinishedFlag;
}
bool CTaskStatus::isCanceled() {
return mCanceledFlag;
}
bool CTaskStatus::isError() {
return mErrorFlag;
}
bool CTaskStatus::isProcessable() {
return !mCanceledFlag && !mFinishedFlag && !mErrorFlag;
}
cint64 CTaskStatus::getErrorCode() {
return mErrorCode;
}
bool CTaskStatus::isTaskState(TASKSTATE taskState) {
return mTaskState = taskState;
}
bool CTaskStatus::hasOneTaskState(TASKSTATE taskStateCompination) {
return (mTaskState & taskStateCompination) != 0;
}
CTaskStatus* CTaskStatus::setTaskQUEUEDState() {
mTaskState = TSQUEUED;
return this;
}
CTaskStatus* CTaskStatus::setTaskPROCESSINGState() {
mTaskState = TSPROCESSING;
return this;
}
CTaskStatus* CTaskStatus::setTaskSCHEDULINGState() {
mTaskState = TSSCHEDULING;
return this;
}
CTaskStatus* CTaskStatus::setTaskCOMPLETEDState() {
mTaskState = TSCOMPLETED;
return this;
}
CTaskStatus* CTaskStatus::setTaskFINISHEDState() {
mTaskState = TSFINISHED;
return this;
}
bool CTaskStatus::isTaskStateQUEUED() {
return mTaskState == TSQUEUED;
}
bool CTaskStatus::isTaskStatePROCESSING() {
return mTaskState == TSPROCESSING;
}
bool CTaskStatus::isTaskStateSCHEDULING() {
return mTaskState == TSSCHEDULING;
}
bool CTaskStatus::isTaskStateFINISHED() {
return mTaskState == TSFINISHED;
}
bool CTaskStatus::isTaskStateCOMPLETED() {
return mTaskState == TSCOMPLETED;
}
bool CTaskStatus::isTaskStateUNINITIALIZED() {
return mTaskState == TSUNINITIALIZED;
}
bool CTaskStatus::isMemoryReleaseable() {
return mReleaseable;
}
}; // end namespace Scheduler
}; // end namespace Konclude
|
