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
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
|
/*
* Copyright (c) 2011-2014, Intel Corporation
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without modification,
* are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice, this
* list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation and/or
* other materials provided with the distribution.
*
* 3. Neither the name of the copyright holder nor the names of its contributors
* may be used to endorse or promote products derived from this software without
* specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR
* ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
* ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "SelectionCriterion.h"
#include "AutoLog.h"
#include "Utility.h"
#define base CElement
CSelectionCriterion::CSelectionCriterion(const std::string& strName, const CSelectionCriterionType* pType) : base(strName), _iState(0), _pType(pType), _uiNbModifications(0)
{
}
std::string CSelectionCriterion::getKind() const
{
return "SelectionCriterion";
}
bool CSelectionCriterion::hasBeenModified() const
{
return _uiNbModifications != 0;
}
void CSelectionCriterion::resetModifiedStatus()
{
_uiNbModifications = 0;
}
/// From ISelectionCriterionInterface
// State
void CSelectionCriterion::setCriterionState(int iState)
{
// Check for a change
if (_iState != iState) {
_iState = iState;
log_info("Selection criterion changed event: %s", getFormattedDescription(false, false).c_str());
// Check if the previous criterion value has been taken into account (i.e. at least one Configuration was applied
// since the last criterion change)
if (_uiNbModifications != 0) {
log_warning("Selection criterion \"%s\" has been modified %d time(s) without any configuration application", getName().c_str(), _uiNbModifications);
}
// Track the number of modifications for this criterion
_uiNbModifications++;
}
}
int CSelectionCriterion::getCriterionState() const
{
return _iState;
}
// Name
std::string CSelectionCriterion::getCriterionName() const
{
return getName();
}
// Type
const ISelectionCriterionTypeInterface* CSelectionCriterion::getCriterionType() const
{
return _pType;
}
/// Match methods
bool CSelectionCriterion::is(int iState) const
{
return _iState == iState;
}
bool CSelectionCriterion::isNot(int iState) const
{
return _iState != iState;
}
bool CSelectionCriterion::includes(int iState) const
{
// For inclusive criterion, Includes checks if ALL the bit sets in iState are set in the
// current _iState.
return (_iState & iState) == iState;
}
bool CSelectionCriterion::excludes(int iState) const
{
return (_iState & iState) == 0;
}
/// User request
std::string CSelectionCriterion::getFormattedDescription(bool bWithTypeInfo, bool bHumanReadable) const
{
std::string strFormattedDescription;
if (bHumanReadable) {
if (bWithTypeInfo) {
// Display type info
CUtility::appendTitle(strFormattedDescription, getName() + ":");
// States
strFormattedDescription += "Possible states ";
// Type Kind
strFormattedDescription += "(";
strFormattedDescription += _pType->isTypeInclusive() ? "Inclusive" : "Exclusive";
strFormattedDescription += "): ";
// States
strFormattedDescription += _pType->listPossibleValues() + "\n";
// Current State
strFormattedDescription += "Current state";
} else {
// Name only
strFormattedDescription = getName();
}
// Current State
strFormattedDescription += " = " + _pType->getFormattedState(_iState);
} else {
// Name
strFormattedDescription = "Criterion name: " + getName();
if (bWithTypeInfo) {
// Type Kind
strFormattedDescription += ", type kind: ";
strFormattedDescription += _pType->isTypeInclusive() ? "inclusive" : "exclusive";
}
// Current State
strFormattedDescription += ", current state: " +
_pType->getFormattedState(_iState);
if (bWithTypeInfo) {
// States
strFormattedDescription += ", states: " +
_pType->listPossibleValues();
}
}
return strFormattedDescription;
}
// XML export
void CSelectionCriterion::toXml(CXmlElement& xmlElement, CXmlSerializingContext& serializingContext) const
{
// Current Value
xmlElement.setAttributeString("Value", _pType->getFormattedState(_iState));
// Serialize Type node
_pType->toXml(xmlElement, serializingContext);
base::toXml(xmlElement, serializingContext);
}
|
