turnintopointmap.hpp

模糊聚類分析源碼。包含教學文件

/*
  
  Context       : Fuzzy Clustering Algorithms

  Author        : Frank Hoeppner, see also AUTHORS file 

  Description   : header of class TurnIntoPointMap
                  
  History       : see source file

  Comment       : 
    This file was generated automatically. DO NOT EDIT.

  Copyright     : Copyright (C) 1999-2000 Frank Hoeppner

    This program 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 2 of the License, or
    (at your option) any later version.

    This program 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, write to the Free Software
    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
*/
/*
  The University of Applied Sciences Oldenburg/Ostfriesland/Wilhelmshaven
  hereby disclaims all copyright interests in the program package `fc' 
  (tool package for fuzzy cluster analysis) written by Frank Hoeppner.
  
  Prof. Haass, President of Vice, 2000-Mar-10
*/

#ifndef TurnIntoPointMap_HEADER
#define TurnIntoPointMap_HEADER

/* configuration include */
#ifdef HAVE_CONFIG_H
/*
//FILETREE_IFDEF HAVE_CONFIG_H
*/
#include "config.h"
/*
//FILETREE_ENDIF
*/
#endif



// necessary includes
#include "ddl.hpp"
#include "algorithm.hpp"
#include "Tuple.hpp"
#include "Box.hpp"
#include <map>
#include <set>
//#define INLINE inline

// global types, constants, definitions
template <class OPTION,int DIM = AXIS_END>
class PointMap
  {
  public:
    typedef Tuple<DIM,real_type> display_tuple_type;
    typedef set< display_tuple_type > display_tuple_set_type;
    typedef map< int,display_tuple_set_type,less<int> > time_map_type;
    typedef map< int,OPTION,less<int> > option_map_type;
    typedef Box< display_tuple_type > display_box_type;

  inline const time_map_type& grid() const { return m_grid; }
  inline time_map_type& grid() { return m_grid; }
  inline const time_map_type& data() const { return m_data; }
  inline time_map_type& data() { return m_data; }
  inline const time_map_type& prototypes() const { return m_prototypes; }
  inline time_map_type& prototypes() { return m_prototypes; }
  inline const option_map_type& options() const { return m_options; }
  inline option_map_type& options() { return m_options; }
  inline const display_box_type& bbox() const { return m_bbox; }
  inline display_box_type& bbox() { return m_bbox; }

  protected:
    time_map_type m_grid,m_data,m_prototypes;
    option_map_type m_options;
    display_box_type m_bbox;
  };

typedef 
  PointMap< Option, AXIS_END >
  basic_pointmap_type;

// class definition
template < class ANALYSIS >
class TurnIntoPointMap
  : public IterateAlgorithm<ANALYSIS>
  {
  
  public:
    typedef typename ANALYSIS::opt_type opt_type;
    typedef typename ANALYSIS::data_type data_type;
    typedef typename ANALYSIS::prot_type prot_type;
    typedef typename ANALYSIS::link_type link_type;

    typedef typename ANALYSIS::data_set_type data_set_type;
    typedef typename ANALYSIS::prot_set_type prot_set_type;
    typedef typename ANALYSIS::link_set_type link_set_type;

    typedef typename ANALYSIS::data_iter data_iter;
    typedef typename ANALYSIS::prot_iter prot_iter;
    typedef typename ANALYSIS::link_iter link_iter;
    TurnIntoPointMap(Algorithm<basic_pointmap_type>* ap_alg);
    ~TurnIntoPointMap();
    virtual void operator()(ANALYSIS&);
    virtual void operator()(const typename ANALYSIS::data_type&,int,const
    typename ANALYSIS::data_type* p=NULL, const typename ANALYSIS::data_type* f=NULL);
    virtual void operator()(const typename ANALYSIS::prot_type&,int);
    inline const basic_pointmap_type& pointmap() const { return m_point_map; }
    
  protected:
    
    
    Algorithm<basic_pointmap_type>* mp_succ_alg;
    int m_analysis_counter;
    int m_data_counter;
    int m_prot_counter;
    int m_connect;
    typename ANALYSIS::link_iter mi_link;
    basic_pointmap_type m_point_map;
    ANALYSIS* mp_analysis;
  private:
    
    
    basic_pointmap_type::display_tuple_type gridres,gridstart,lastpoint;
    
  };

// class related functions and definitions
template <class ALGORITHM> 
inline TurnIntoPointMap<full_analysis_type>*
pointmap(ALGORITHM* a)
  { return new TurnIntoPointMap<full_analysis_type>(a); }

inline NoOperation2<basic_pointmap_type>* 
ptmap_nop()
  { return new NoOperation2<basic_pointmap_type>(); }


/* inline implementation */




#endif // TurnIntoPointMap_HEADER