📄 settupleconversion.cpp
字号:
/* Context : Fuzzy Clustering Algorithms Author : Frank Hoeppner, see also AUTHORS file Description : implementation of class module SetTupleConversion 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 SetTupleConversion_SOURCE#define SetTupleConversion_SOURCE/* configuration include */#ifdef HAVE_CONFIG_H/*//FILETREE_IFDEF HAVE_CONFIG_H*/#include "config.h"/*//FILETREE_ENDIF*/#endif// necessary includes#include "SetTupleConversion.hpp"// data// implementationtemplate < class ANALYSIS >SetTupleConversion< ANALYSIS >::SetTupleConversion ( OnePassAlgorithm<ANALYSIS>* ap_alg ) : mp_succ_alg(ap_alg) , m_elem_funcs_called(false) , m_emulated_elem_wise(false) { m_sub_feature.datum().adjust(0); m_sub_feature.start().adjust(2); m_sub_feature.delta().adjust(2); m_sub_prototype.center().adjust(0); m_sub_prototype.start().adjust(2); m_sub_prototype.delta().adjust(2); }template < class ANALYSIS >SetTupleConversion< ANALYSIS >::~SetTupleConversion ( ) { FUNCLOG("~SetTupleConversion"); delete mp_succ_alg; }template < class ANALYSIS >voidSetTupleConversion< ANALYSIS >::operator() ( ANALYSIS& a_analysis ) { FUNCLOG("SetTupleConversion"); if (!m_elem_funcs_called) { m_emulated_elem_wise = true; operator()(a_analysis,a_analysis.option()); for ( typename ANALYSIS::data_iter i_data(a_analysis.data().begin()); i_data != a_analysis.data().end(); ++i_data ) { operator()(a_analysis,*i_data); } for ( typename ANALYSIS::prot_iter i_prot(a_analysis.prototypes().begin()); i_prot != a_analysis.prototypes().end(); ++i_prot ) { operator()(a_analysis,*i_prot); } for ( typename ANALYSIS::link_iter i_link(a_analysis.links().begin()); i_link != a_analysis.links().end(); ++i_link ) { operator()(a_analysis,*i_link); } } call_successor(mp_succ_alg,a_analysis,"stc"); m_elem_funcs_called=false; m_emulated_elem_wise=false; }template < class ANALYSIS >voidSetTupleConversion< ANALYSIS >::operator() ( ANALYSIS& a_analysis, SetTupleConversion< ANALYSIS >::opt_type& a_option ) { FUNCLOG("SetTupleConversion::operator(opt)"); if (!m_elem_funcs_called) reset(a_analysis); a_option.data_dimension()=DEFAULT_OPTION_NODATADIM; a_option.bbox_local().adjust(0); a_option.bbox_global().adjust(0); (*mp_succ_alg)(a_analysis,a_option); }template < class ANALYSIS >voidSetTupleConversion< ANALYSIS >::operator() ( ANALYSIS& a_analysis, SetTupleConversion< ANALYSIS >::data_type& a_datum ) { FUNCLOG("SetTupleConversion::operator(data)"); if (!m_elem_funcs_called) reset(a_analysis); m_feature.hierarchy().clear(); if (a_datum.hierarchy().size()==0) { m_feature.datum().adjust(0); real_type x(0); for (int i=0;i<a_datum.datum().rows()-1;++i) { m_sub_feature.start()(AXIS_X) = x; m_sub_feature.start()(AXIS_Y) = a_datum.datum()(i); x = 1.0/(a_datum.datum().rows()-1)*(i+1); m_sub_feature.delta()(AXIS_X) = x - m_sub_feature.start()(AXIS_X); m_sub_feature.delta()(AXIS_Y) = a_datum.datum()(i+1)-a_datum.datum()(i); m_feature.hierarchy().push_back(m_sub_feature); } } else { m_feature.datum().adjust(a_datum.hierarchy().size()); int i(0); for ( typename ANALYSIS::data_iter i_encl_data( a_datum.hierarchy().begin()); i_encl_data != a_datum.hierarchy().end(); ++i_encl_data ) { m_feature.datum()(i) = (*i_encl_data).select(AXIS_X); ++i; } } (*mp_succ_alg)(a_analysis,m_feature); }template < class ANALYSIS >voidSetTupleConversion< ANALYSIS >::operator() ( ANALYSIS& a_analysis, SetTupleConversion< ANALYSIS >::prot_type& a_prototype ) { FUNCLOG("SetTupleConversion::operator(prot)"); if (!m_elem_funcs_called) reset(a_analysis); m_prototype.hierarchy().clear(); if (a_prototype.hierarchy().size()==0) { m_prototype.center().adjust(0); real_type x(0); for (int i=0;i<a_prototype.center().rows()-1;++i) { m_sub_prototype.start()(AXIS_X) = x; m_sub_prototype.start()(AXIS_Y) = a_prototype.center()(i); x = 1.0/(a_prototype.center().rows()-1)*(i+1); m_sub_prototype.delta()(AXIS_X) = x - m_sub_prototype.start()(AXIS_X); m_sub_prototype.delta()(AXIS_Y) = a_prototype.center()(i+1)-a_prototype.center()(i); m_prototype.hierarchy().push_back(m_sub_prototype); } } else { m_prototype.center().adjust(a_prototype.hierarchy().size()); int i(0); for ( prot_iter i_encl_prot(a_prototype.hierarchy().begin()); i_encl_prot != a_prototype.hierarchy().end(); ++i_encl_prot ) { m_prototype.center()(i) = (*i_encl_prot).select(AXIS_X); ++i; } } (*mp_succ_alg)(a_analysis,m_prototype); }template < class ANALYSIS >voidSetTupleConversion< ANALYSIS >::operator() ( ANALYSIS& a_analysis, SetTupleConversion< ANALYSIS >::link_type& a_link ) { FUNCLOG("SetTupleConversion::operator(link)"); if (!m_elem_funcs_called) reset(a_analysis); (*mp_succ_alg)(a_analysis,a_link); }template < class ANALYSIS >voidSetTupleConversion< ANALYSIS >::reset ( ANALYSIS& a_analysis ) { FUNCLOG("SetTupleConversion::reset"); m_elem_funcs_called=true; }// template instantiation#endif // SetTupleConversion_SOURCE
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -