summaryrefslogtreecommitdiff
path: root/fuzzylite/src/term/Triangle.cpp
blob: 2fce1a6f6b84637f773c0304d3d2d52d0524a170 (plain)
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
/*
 Author: Juan Rada-Vilela, Ph.D.
 Copyright (C) 2010-2014 FuzzyLite Limited
 All rights reserved

 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.

 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.

 */

#include "fl/term/Triangle.h"

namespace fl {

    Triangle::Triangle(const std::string& name, scalar vertexA, scalar vertexB, scalar vertexC, scalar height)
    : Term(name, height), _vertexA(vertexA), _vertexB(vertexB), _vertexC(vertexC) {
        if (fl::Op::isNaN(vertexC)) {
            //TODO: Modify FLL to allow passing two parameters only.
            this->_vertexC = vertexB;
            this->_vertexB = (vertexA + vertexB) / 2.0;
        }
    }

    Triangle::~Triangle() {
    }

    std::string Triangle::className() const {
        return "Triangle";
    }

    scalar Triangle::membership(scalar x) const {
        if (fl::Op::isNaN(x)) return fl::nan;

        if (Op::isLt(x, _vertexA) or Op::isGt(x, _vertexC))
            return _height * 0.0;

        if (Op::isEq(x, _vertexB))
            return _height * 1.0;

        if (Op::isLt(x, _vertexB))
            return _height * (x - _vertexA) / (_vertexB - _vertexA);

        return _height * (_vertexC - x) / (_vertexC - _vertexB);
    }

    std::string Triangle::parameters() const {
        return Op::join(3, " ", _vertexA, _vertexB, _vertexC) +
                (not Op::isEq(_height, 1.0) ? " " + Op::str(_height) : "");
    }

    void Triangle::configure(const std::string& parameters) {
        if (parameters.empty()) return;
        std::vector<std::string> values = Op::split(parameters, " ");
        std::size_t required = 3;
        if (values.size() < required) {
            std::ostringstream ex;
            ex << "[configuration error] term <" << className() << ">"
                    << " requires <" << required << "> parameters";
            throw fl::Exception(ex.str(), FL_AT);
        }
        setVertexA(Op::toScalar(values.at(0)));
        setVertexB(Op::toScalar(values.at(1)));
        setVertexC(Op::toScalar(values.at(2)));
        if (values.size() > required)
            setHeight(Op::toScalar(values.at(required)));
    }

    void Triangle::setVertexA(scalar a) {
        this->_vertexA = a;
    }

    scalar Triangle::getVertexA() const {
        return this->_vertexA;
    }

    void Triangle::setVertexB(scalar b) {
        this->_vertexB = b;
    }

    scalar Triangle::getVertexB() const {
        return this->_vertexB;
    }

    void Triangle::setVertexC(scalar c) {
        this->_vertexC = c;
    }

    scalar Triangle::getVertexC() const {
        return this->_vertexC;
    }

    Triangle* Triangle::clone() const {
        return new Triangle(*this);
    }

    Term* Triangle::constructor() {
        return new Triangle;
    }


}