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
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
|
/*
fuzzylite (R), a fuzzy logic control library in C++.
Copyright (C) 2010-2017 FuzzyLite Limited. All rights reserved.
Author: Juan Rada-Vilela, Ph.D. <jcrada@fuzzylite.com>
This file is part of fuzzylite.
fuzzylite is free software: you can redistribute it and/or modify it under
the terms of the FuzzyLite License included with the software.
You should have received a copy of the FuzzyLite License along with
fuzzylite. If not, see <http://www.fuzzylite.com/license/>.
fuzzylite is a registered trademark of FuzzyLite Limited.
*/
#include "fl/term/Discrete.h"
namespace fl {
Discrete::Discrete(const std::string& name, const std::vector<Pair>& xy, scalar height)
: Term(name, height), _xy(xy) { }
Discrete::~Discrete() { }
std::string Discrete::className() const {
return "Discrete";
}
bool compare(const Discrete::Pair& a, const Discrete::Pair& b) {
return a.first < b.first;
}
void Discrete::sort(std::vector<Pair>& pairs) {
std::sort(pairs.begin(), pairs.end(), compare);
}
void Discrete::sort() {
std::sort(_xy.begin(), _xy.end(), compare);
}
Complexity Discrete::complexity() const {
return Complexity().comparison(1 + 4).arithmetic(1 + 1 + 1).function(1)
.function(2 * std::log(scalar(_xy.size())));
}
scalar Discrete::membership(scalar x) const {
if (Op::isNaN(x)) return fl::nan;
if (_xy.empty())
throw Exception("[discrete error] term is empty", FL_AT);
/* ______________________
/ \
/ \
____________/ \____________
x[0] x[n-1]
*/
if (Op::isLE(x, _xy.front().first))
return Term::_height * _xy.front().second;
if (Op::isGE(x, _xy.back().first))
return Term::_height * _xy.back().second;
const Pair value(x, fl::nan);
typedef std::vector<Discrete::Pair>::const_iterator Bound;
//std::lower_bound finds the first number greater than or equal to x
Bound lowerBound(std::lower_bound(_xy.begin(), _xy.end(), value, compare));
//if the lower bound is equal to x
if (Op::isEq(x, lowerBound->first)) {
return Term::_height * lowerBound->second;
}
//find the upper bound starting from a copy of lowerBound
const Bound upperBound(std::upper_bound(_xy.begin(), _xy.end(), value, compare));
--lowerBound; //One arithmetic
return Term::_height * Op::scale(x, lowerBound->first, upperBound->first,
lowerBound->second, upperBound->second);
}
std::string Discrete::parameters() const {
std::ostringstream ss;
for (std::size_t i = 0; i < _xy.size(); ++i) {
ss << Op::str(_xy.at(i).first) << " " << Op::str(_xy.at(i).second);
if (i + 1 < _xy.size()) ss << " ";
}
if (not Op::isEq(getHeight(), 1.0)) ss << " " << Op::str(getHeight());
return ss.str();
}
void Discrete::configure(const std::string& parameters) {
if (parameters.empty()) return;
std::vector<std::string> strValues = Op::split(parameters, " ");
std::vector<scalar> values(strValues.size());
for (std::size_t i = 0; i < strValues.size(); ++i) {
values.at(i) = Op::toScalar(strValues.at(i));
}
if (values.size() % 2 == 0) {
setHeight(1.0);
} else {
setHeight(values.back());
values.pop_back();
}
this->_xy = toPairs(values);
}
void Discrete::setXY(const std::vector<Pair>& xy) {
this->_xy = xy;
}
const std::vector<Discrete::Pair>& Discrete::xy() const {
return this->_xy;
}
std::vector<Discrete::Pair>& Discrete::xy() {
return this->_xy;
}
const Discrete::Pair& Discrete::xy(std::size_t index) const {
return this->_xy.at(index);
}
Discrete::Pair& Discrete::xy(std::size_t index) {
return this->_xy.at(index);
}
std::vector<scalar> Discrete::x() const {
std::vector<scalar> result(_xy.size());
for (std::size_t i = 0; i < result.size(); ++i) {
result.at(i) = _xy.at(i).first;
}
return result;
}
std::vector<scalar> Discrete::y() const {
std::vector<scalar> result(_xy.size());
for (std::size_t i = 0; i < result.size(); ++i) {
result.at(i) = _xy.at(i).second;
}
return result;
}
scalar Discrete::x(std::size_t index) const {
return _xy.at(index).first;
}
scalar& Discrete::x(std::size_t index) {
return _xy.at(index).first;
}
scalar Discrete::y(std::size_t index) const {
return _xy.at(index).second;
}
scalar& Discrete::y(std::size_t index) {
return _xy.at(index).second;
}
std::vector<Discrete::Pair> Discrete::toPairs(const std::vector<scalar>& xy) {
if (xy.size() % 2 != 0) {
std::ostringstream os;
os << "[discrete error] missing value in set of pairs (|xy|=" << xy.size() << ")";
throw Exception(os.str(), FL_AT);
}
std::vector<Pair> result((xy.size() + 1) / 2);
for (std::size_t i = 0; i + 1 < xy.size(); i += 2) {
result.at(i / 2).first = xy.at(i);
result.at(i / 2).second = xy.at(i + 1);
}
return result;
}
std::vector<Discrete::Pair> Discrete::toPairs(const std::vector<scalar>& xy,
scalar missingValue) FL_INOEXCEPT {
std::vector<Pair> result((xy.size() + 1) / 2);
for (std::size_t i = 0; i + 1 < xy.size(); i += 2) {
result.at(i / 2).first = xy.at(i);
result.at(i / 2).second = xy.at(i + 1);
}
if (xy.size() % 2 != 0) {
result.back().first = xy.back();
result.back().second = missingValue;
}
return result;
}
std::vector<scalar> Discrete::toVector(const std::vector<Pair>& xy) {
std::vector<scalar> result(xy.size() * 2);
for (std::size_t i = 0; i < xy.size(); ++i) {
result.at(2 * i) = xy.at(i).first;
result.at(2 * i + 1) = xy.at(i).second;
}
return result;
}
std::string Discrete::formatXY(const std::vector<Pair>& xy, const std::string& prefix,
const std::string& innerSeparator, const std::string& suffix, const std::string& outerSeparator) {
std::ostringstream os;
for (std::size_t i = 0; i < xy.size(); ++i) {
os << prefix << Op::str(xy.at(i).first) << innerSeparator
<< Op::str(xy.at(i).second) << suffix;
if (i + 1 < xy.size()) os << outerSeparator;
}
return os.str();
}
Discrete* Discrete::discretize(const Term* term, scalar start, scalar end, int resolution,
bool boundedMembershipFunction) {
FL_unique_ptr<Discrete> result(new Discrete(term->getName()));
scalar dx = (end - start) / resolution;
scalar x, y;
for (int i = 0; i <= resolution; ++i) {
x = start + i * dx;
y = term->membership(x);
if (boundedMembershipFunction)
y = Op::bound(y, scalar(0.0), scalar(1.0));
result->xy().push_back(Discrete::Pair(x, y));
}
return result.release();
}
Discrete* Discrete::clone() const {
return new Discrete(*this);
}
Term* Discrete::constructor() {
return new Discrete;
}
}
|
