system.hpp

Go to the documentation of this file.

/*  Copyright (C) 2004-2015
    ANTONIO JAVIER BARRAGAN, antonio.barragan@diesia.uhu.es
    http://uhu.es/antonio.barragan

    Collaborators:
    JOSE MANUEL ANDUJAR, andujar@diesia.uhu.es

    DPTO. DE ING. ELECTRONICA, DE SISTEMAS INFORMATICOS Y AUTOMATICA
    ETSI, UNIVERSITY OF HUELVA (SPAIN)

    For more information, please contact with authors.
    
    This software is free software: you can redistribute it and/or modify
    it under the terms of the GNU General Public License as published by
    the Free Software Foundation, either version 3 of the License, or
    (at your option) any later version.

    This software 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 General Public License for more details.

    You should have received a copy of the GNU General Public License
    along with this program.  If not, see <http://www.gnu.org/licenses/>.
*/

#ifndef _SYSTEM_HPP_
#define _SYSTEM_HPP_

#include <flt/rule.hpp>

namespace FLT // Use the FTL (Fuzzy Logic Tools) namespace
{
  #define LOW_DEFAULT_LIMIT -100.0 
  #define HIGH_DEFAULT_LIMIT 100.0 
  

  class System
  {
    size_t in;  
    size_t out; 
    size_t *N;  
    double *low_in; 
    double *low_out; 
    double *high_in; 
    double *high_out; 
    Rule **R; 
  public:
    size_t inputs(void) const; 
    size_t outputs(void) const; 
    size_t rules(size_t output) const; 
    
    TNT::Array1D<size_t> rules(void) const; 
    
    TNT::Array1D<double> in_low(void) const; 
    double in_low(size_t input) const; 
    
    TNT::Array1D<double> in_high(void) const; 
    double in_high(size_t input) const; 
    
    TNT::Array1D<double> out_low(void) const; 
    double out_low(size_t output) const; 
    
    TNT::Array1D<double> out_high(void) const; 
    double out_high(size_t output) const; 

    void in_low(double *limits); 
    void in_high(double *limits); 
    void out_low(double *limits); 
    void out_high(double *limits); 

    int checkInputLimits(const double * const point);

    int checkOutputLimits(const double * const output);

    int test(void) const;
    
    int changeRule(const Rule &R,
             size_t r,
             size_t output);
    
    int readRule(Rule &R,
                 size_t output,
           size_t r) const;
    
    Rule* readRule(size_t output,
                   size_t r);
    
    void initialize(size_t in,
                    size_t out,
            size_t *N);

    size_t NumberOfAntecedents(void);

    int setAntecedents(const double *const parameters);
  
    TNT::Array1D<double> getAntecedents(void);

    size_t NumberOfConsequents(void);
    
    void setConsequents(const double *const parameters);
  
    TNT::Array1D<double> getConsequents(void);

    TNT::Array1D<double> evaluate(const double * const point);

    System & operator=(const System &S);
    System();
    System(const System &S);
    System(size_t in,
           size_t out,
         size_t *N);
    ~System();
  };
}  // FLT namespace

#endif