flattenhierarchy.cpp

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

/*
  
  Context       : Fuzzy Clustering Algorithms

  Author        : Frank Hoeppner, see also AUTHORS file 

  Description   : implementation of class module FlattenHierarchy
                  
  History       :
    

  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 FlattenHierarchy_SOURCE
#define FlattenHierarchy_SOURCE

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



// necessary includes
#include "FlattenHierarchy.hpp"

// data


// implementation
template < class ANALYSIS >
FlattenHierarchy< ANALYSIS >::FlattenHierarchy
  (
  Algorithm<output_type> *ap_alg
  )
  : mp_succ_alg(ap_alg)
  , mp_analysis(NULL)
  
  {
  
  }
template < class ANALYSIS >
FlattenHierarchy< ANALYSIS >::~FlattenHierarchy
  (
  )
  {
  FUNCLOG("~FlattenHierarchy");
  
  delete mp_succ_alg;
  }
template < class ANALYSIS >
void
FlattenHierarchy< ANALYSIS >::operator()
  (
  ANALYSIS& a_analysis
  )
  {
  FUNCLOG("FlattenHierarchy");
  
  const int c(a_analysis.option().number_prototypes());
  if (mp_analysis!=NULL) delete mp_analysis;
  mp_analysis = new flat_analysis_type(
    &m_option,&m_data_set,&m_prot_set,&a_analysis.links()  );

  m_option=a_analysis.option();
  m_data_set.clear();
  m_prot_set.clear();
  typename ANALYSIS::link_iter i_link(a_analysis.links().begin());;
  for (
      typename ANALYSIS::data_iter i_data(a_analysis.data().begin());
      i_data != a_analysis.data().end();
      ++i_data
      )
    { 
    if ((*i_data).datum().rows()>0)
      {
      flat_feature_type feature(&(*i_data),&a_analysis,i_link);
      m_data_set.push_back(feature);
      }
    for (
        typename ANALYSIS::data_iter i_encl_data( (*i_data).hierarchy().begin());
        i_encl_data != (*i_data).hierarchy().end();
        ++i_encl_data
        )
      {
        flat_feature_type feature(&(*i_encl_data),&a_analysis,i_link);
        m_data_set.push_back(feature);
      }
    for (int i=0;i<c;++i) ++i_link;
    }
  invariant(i_link==a_analysis.links().end(),"linkage size matches",SOURCELOC);
  for (
      typename ANALYSIS::prot_iter i_prot(a_analysis.prototypes().begin());
      i_prot != a_analysis.prototypes().end();
      ++i_prot
      )
    {
    if ((*i_prot).center().rows()>0)
      {
      m_prot_set.push_back(*i_prot);
      }
    for (
        typename ANALYSIS::prot_iter i_encl_prot( (*i_prot).hierarchy().begin());
        i_encl_prot != (*i_prot).hierarchy().end();
        ++i_encl_prot
        )
      {
      m_prot_set.push_back(*i_encl_prot);
      }
    }
  m_option.number_prototypes()=m_prot_set.size();
  m_option.number_features()=m_data_set.size();
  call_successor(mp_succ_alg,*mp_analysis,"flat");
  
  }

// template instantiation



#endif // FlattenHierarchy_SOURCE