summaryrefslogtreecommitdiff
path: root/fuzzylite/src/norm/s/NilpotentMaximum.cpp
diff options
context:
space:
mode:
Diffstat (limited to 'fuzzylite/src/norm/s/NilpotentMaximum.cpp')
-rw-r--r--fuzzylite/src/norm/s/NilpotentMaximum.cpp32
1 files changed, 14 insertions, 18 deletions
diff --git a/fuzzylite/src/norm/s/NilpotentMaximum.cpp b/fuzzylite/src/norm/s/NilpotentMaximum.cpp
index 0a09136..7c63999 100644
--- a/fuzzylite/src/norm/s/NilpotentMaximum.cpp
+++ b/fuzzylite/src/norm/s/NilpotentMaximum.cpp
@@ -1,38 +1,36 @@
/*
- 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/norm/s/NilpotentMaximum.h"
+#include "fl/Operation.h"
+
namespace fl {
std::string NilpotentMaximum::className() const {
return "NilpotentMaximum";
}
+ Complexity NilpotentMaximum::complexity() const {
+ return Complexity().comparison(1).arithmetic(1).function(1);
+ }
+
scalar NilpotentMaximum::compute(scalar a, scalar b) const {
if (Op::isLt(a + b, 1.0)) {
- return std::max(a, b);
+ return Op::max(a, b);
}
return 1.0;
}
@@ -45,6 +43,4 @@ namespace fl {
return new NilpotentMaximum;
}
-
}
-