summaryrefslogtreecommitdiff
path: root/fuzzylite/src/defuzzifier/LargestOfMaximum.cpp
diff options
context:
space:
mode:
Diffstat (limited to 'fuzzylite/src/defuzzifier/LargestOfMaximum.cpp')
-rw-r--r--fuzzylite/src/defuzzifier/LargestOfMaximum.cpp48
1 files changed, 19 insertions, 29 deletions
diff --git a/fuzzylite/src/defuzzifier/LargestOfMaximum.cpp b/fuzzylite/src/defuzzifier/LargestOfMaximum.cpp
index 470af52..ff05707 100644
--- a/fuzzylite/src/defuzzifier/LargestOfMaximum.cpp
+++ b/fuzzylite/src/defuzzifier/LargestOfMaximum.cpp
@@ -1,25 +1,17 @@
/*
- Author: Juan Rada-Vilela, Ph.D.
- Copyright (C) 2010-2014 FuzzyLite Limited
- All rights reserved
+ 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 GNU Lesser General Public License as published by the Free
- Software Foundation, either version 3 of the License, or (at your option)
- any later version.
+ the terms of the FuzzyLite License included with the software.
- fuzzylite 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 fuzzylite. If not, see <http://www.gnu.org/licenses/>.
-
- fuzzyliteâ„¢ is a trademark of FuzzyLite Limited.
+ 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/defuzzifier/LargestOfMaximum.h"
@@ -30,29 +22,27 @@
namespace fl {
LargestOfMaximum::LargestOfMaximum(int resolution)
- : IntegralDefuzzifier(resolution) {
- }
+ : IntegralDefuzzifier(resolution) { }
- LargestOfMaximum::~LargestOfMaximum() {
- }
+ LargestOfMaximum::~LargestOfMaximum() { }
std::string LargestOfMaximum::className() const {
return "LargestOfMaximum";
}
+ Complexity LargestOfMaximum::complexity(const Term* term) const {
+ return Complexity().comparison(1).arithmetic(1 + 2) +
+ term->complexity().comparison(1).arithmetic(3).multiply(getResolution());
+ }
+
scalar LargestOfMaximum::defuzzify(const Term* term, scalar minimum, scalar maximum) const {
- if (not fl::Op::isFinite(minimum + maximum)) {
- return fl::nan;
- }
- if (maximum - minimum > _resolution) {
- FL_DBG("[accuracy warning] the resolution <" << _resolution << "> "
- "is smaller than the range <" << minimum << ", " << maximum << ">. In order to "
- "improve the accuracy, the resolution should be at least equal to the range.");
- }
- scalar dx = (maximum - minimum) / _resolution;
+ if (not Op::isFinite(minimum + maximum)) return fl::nan;
+
+ const int resolution = getResolution();
+ const scalar dx = (maximum - minimum) / resolution;
scalar x, y;
scalar ymax = -1.0, xlargest = maximum;
- for (int i = 0; i < _resolution; ++i) {
+ for (int i = 0; i < resolution; ++i) {
x = minimum + (i + 0.5) * dx;
y = term->membership(x);