Debian Codegraph @

Source/Reasoner/Kernel/Process/CIndividualProcessNodePriority.cpp

raw
1 /*
2 * Copyright (C) 2013-2015, 2019 by the Konclude Developer Team.
3 *
4 * This file is part of the reasoning system Konclude.
5 * For details and support, see <http://konclude.com/>.
6 *
7 * Konclude is free software: you can redistribute it and/or modify
8 * it under the terms of version 3 of the GNU Lesser General Public
9 * License (LGPLv3) as published by the Free Software Foundation.
10 *
11 * Konclude is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU (Lesser) General Public License for more details.
15 *
16 * You should have received a copy of the GNU (Lesser) General Public
17 * License along with Konclude. If not, see <http://www.gnu.org/licenses/>.
18 *
19 */
20
21 #include "CIndividualProcessNodePriority.h"
22
23
24 namespace Konclude {
25
26 namespace Reasoner {
27
28 namespace Kernel {
29
30 namespace Process {
31
32
33 CIndividualProcessNodePriority::CIndividualProcessNodePriority(double conPriority, double indiPriority, bool stirctOrder) {
34 mPriorityCon = conPriority;
35 mPriorityInd = indiPriority;
36 mStrictOrder = stirctOrder;
37 }
38
39 bool CIndividualProcessNodePriority::isNullPriority() const {
40 return mPriorityCon == 0. && mPriorityInd == 0.;
41 }
42
43
44 double CIndividualProcessNodePriority::getConceptPriority() const {
45 return mPriorityCon;
46 }
47
48 double CIndividualProcessNodePriority::getIndividualPriority() const {
49 return mPriorityInd;
50 }
51
52 CIndividualProcessNodePriority* CIndividualProcessNodePriority::setPriority(double conPriority, double indiPriority) {
53 mPriorityCon = conPriority;
54 mPriorityInd = indiPriority;
55 return this;
56 }
57
58 CIndividualProcessNodePriority* CIndividualProcessNodePriority::setPriorityToNull() {
59 mPriorityCon = 0.;
60 mPriorityInd = 0.;
61 mStrictOrder = true;
62 return this;
63 }
64
65 bool CIndividualProcessNodePriority::operator==(const CIndividualProcessNodePriority& indiPriority) const {
66 return mPriorityCon == indiPriority.mPriorityCon && mPriorityInd == indiPriority.mPriorityInd;
67 }
68
69 bool CIndividualProcessNodePriority::operator!=(const CIndividualProcessNodePriority& indiPriority) const {
70 return mPriorityCon != indiPriority.mPriorityCon || mPriorityInd != indiPriority.mPriorityInd;
71 }
72
73 bool CIndividualProcessNodePriority::operator<=(const CIndividualProcessNodePriority& indiPriority) const {
74 bool strictOrder = mStrictOrder || indiPriority.mStrictOrder;
75 if (strictOrder) {
76 if (mPriorityInd < indiPriority.mPriorityInd) {
77 return true;
78 } else if (mPriorityInd > indiPriority.mPriorityInd) {
79 return false;
80 } else {
81 return mPriorityCon <= indiPriority.mPriorityCon;
82 }
83 } else {
84 bool sameConceptPriority = mPriorityCon == indiPriority.mPriorityCon;
85 return sameConceptPriority && (mPriorityInd <= indiPriority.mPriorityInd)
86 || !sameConceptPriority && (mPriorityCon >= indiPriority.mPriorityCon);
87 }
88 }
89
90 bool CIndividualProcessNodePriority::operator>=(const CIndividualProcessNodePriority& indiPriority) const {
91 bool strictOrder = mStrictOrder || indiPriority.mStrictOrder;
92 if (strictOrder) {
93 if (mPriorityInd > indiPriority.mPriorityInd) {
94 return true;
95 } else if (mPriorityInd < indiPriority.mPriorityInd) {
96 return false;
97 } else {
98 return mPriorityCon >= indiPriority.mPriorityCon;
99 }
100 } else {
101 bool sameConceptPriority = mPriorityCon == indiPriority.mPriorityCon;
102 return sameConceptPriority && (mPriorityInd >= indiPriority.mPriorityInd)
103 || !sameConceptPriority && (mPriorityCon <= indiPriority.mPriorityCon);
104 }
105 }
106
107 bool CIndividualProcessNodePriority::operator<(const CIndividualProcessNodePriority& indiPriority) const {
108 bool strictOrder = mStrictOrder || indiPriority.mStrictOrder;
109 if (strictOrder) {
110 if (mPriorityInd < indiPriority.mPriorityInd) {
111 return true;
112 } else {
113 return false;
114 }
115 } else {
116 bool sameConceptPriority = mPriorityCon == indiPriority.mPriorityCon;
117 return sameConceptPriority && (mPriorityInd < indiPriority.mPriorityInd)
118 || !sameConceptPriority && (mPriorityCon > indiPriority.mPriorityCon);
119 }
120 }
121
122 bool CIndividualProcessNodePriority::operator>(const CIndividualProcessNodePriority& indiPriority) const {
123 bool strictOrder = mStrictOrder || indiPriority.mStrictOrder;
124 if (strictOrder) {
125 if (mPriorityInd > indiPriority.mPriorityInd) {
126 return true;
127 } else {
128 return false;
129 }
130 } else {
131 bool sameConceptPriority = mPriorityCon == indiPriority.mPriorityCon;
132 return sameConceptPriority && (mPriorityInd > indiPriority.mPriorityInd)
133 || !sameConceptPriority && (mPriorityCon < indiPriority.mPriorityCon);
134 }
135 }
136
137 }; // end namespace Process
138
139 }; // end namespace Kernel
140
141 }; // end namespace Reasoner
142
143 }; // end namespace Konclude