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
|
/*
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/Trapezoid.h"
namespace fl {
Trapezoid::Trapezoid(const std::string& name,
scalar vertexA, scalar vertexB, scalar vertexC, scalar vertexD, scalar height)
: Term(name, height), _vertexA(vertexA), _vertexB(vertexB), _vertexC(vertexC), _vertexD(vertexD) {
if (Op::isNaN(vertexC) and Op::isNaN(vertexD)) {
this->_vertexD = _vertexB;
scalar range = _vertexD - _vertexA;
this->_vertexB = _vertexA + range * 1.0 / 5.0;
this->_vertexC = _vertexA + range * 4.0 / 5.0;
}
}
Trapezoid::~Trapezoid() { }
std::string Trapezoid::className() const {
return "Trapezoid";
}
Complexity Trapezoid::complexity() const {
return Complexity().comparison(1 + 6).arithmetic(1 + 3).function(1);
}
scalar Trapezoid::membership(scalar x) const {
if (Op::isNaN(x)) return fl::nan;
if (Op::isLt(x, _vertexA) or Op::isGt(x, _vertexD))
return Term::_height * 0.0;
if (Op::isLt(x, _vertexB)) {
if (_vertexA == -fl::inf) return Term::_height * 1.0;
return Term::_height * Op::min(scalar(1.0), (x - _vertexA) / (_vertexB - _vertexA));
}
if (Op::isLE(x, _vertexC))
return Term::_height * 1.0;
if (Op::isLt(x, _vertexD)) {
if (_vertexD == fl::inf) return Term::_height * 1.0;
return Term::_height * (_vertexD - x) / (_vertexD - _vertexC);
}
if (_vertexD == fl::inf) return Term::_height * 1.0;
return Term::_height * 0.0;
}
std::string Trapezoid::parameters() const {
return Op::join(4, " ", _vertexA, _vertexB, _vertexC, _vertexD)+
(not Op::isEq(getHeight(), 1.0) ? " " + Op::str(getHeight()) : "");
}
void Trapezoid::configure(const std::string& parameters) {
if (parameters.empty()) return;
std::vector<std::string> values = Op::split(parameters, " ");
std::size_t required = 4;
if (values.size() < required) {
std::ostringstream ex;
ex << "[configuration error] term <" << className() << ">"
<< " requires <" << required << "> parameters";
throw Exception(ex.str(), FL_AT);
}
setVertexA(Op::toScalar(values.at(0)));
setVertexB(Op::toScalar(values.at(1)));
setVertexC(Op::toScalar(values.at(2)));
setVertexD(Op::toScalar(values.at(3)));
if (values.size() > required)
setHeight(Op::toScalar(values.at(required)));
}
void Trapezoid::setVertexA(scalar a) {
this->_vertexA = a;
}
scalar Trapezoid::getVertexA() const {
return this->_vertexA;
}
void Trapezoid::setVertexB(scalar b) {
this->_vertexB = b;
}
scalar Trapezoid::getVertexB() const {
return this->_vertexB;
}
void Trapezoid::setVertexC(scalar c) {
this->_vertexC = c;
}
scalar Trapezoid::getVertexC() const {
return this->_vertexC;
}
void Trapezoid::setVertexD(scalar d) {
this->_vertexD = d;
}
scalar Trapezoid::getVertexD() const {
return this->_vertexD;
}
Trapezoid* Trapezoid::clone() const {
return new Trapezoid(*this);
}
Term* Trapezoid::constructor() {
return new Trapezoid;
}
}
|
