TeGroupingAlgorithms.h File Reference

---

Detailed Description

Definition in file TeGroupingAlgorithms.h.

#include "TeDefines.h"
#include "TeSlice.h"
#include "TeUtils.h"
#include "TeDataTypes.h"
#include <math.h>
#include <time.h>
#include <algorithm>

Go to the source code of this file.

Functions
template<class iterator>
void	TeElemCountingBySlice (iterator begin, iterator end, vector< TeSlice > &result)
	Counts the number of elements, from a general container, per slice of a vector of slices.
template<class iterator>
void	TeGroupByEqualStep (iterator begin, iterator end, int nstep, vector< TeSlice > &result, int precision=0, bool countElements=true)
	Groups a set of elements defined by a range of iterators in nstep groups, using Equal Step algorithm.
TL_DLL void	TeGroupByEqualStep (double min, double max, int nstep, vector< TeSlice > &result, int precision=0)
	Defines the classes (slices) of a equal step grouping.
template<class iterator>
void	TeGroupByQuantil (iterator begin, iterator end, int nstep, vector< TeSlice > &result, int precision=0, bool countElements=true)
	Groups a set of elements defined by a range of iterators in nstep groups, using Quantil algorithm.
template<class iterator>
void	TeGroupByStdDev (iterator begin, iterator end, double ndev, vector< TeSlice > &result, string &rmean, int precision=0, bool countElements=true)
	Groups a set of elements defined by a range of iterators in ndev groups, using Standanrd deviation algorithm.
TL_DLL void	TeGroupByUniqueValue (vector< string > &vec, TeAttrDataType tipo, vector< TeSlice > &result, int precision)
	Groups a set of elements in a vector of string using Unique Value algorithm.
template<typename It>
void	TeMaximumValue (It begin, It end, vector< double > &maxValue, double dummy=-9999.99, bool usesDummy=false)
	Finds the element with maximum value among the elements contained in a range of iterators.
template<typename It>
void	TeMinimumValue (It begin, It end, vector< double > &minValue, double dummy=-9999.99, bool usesDummy=false)
	Finds the element with minimum value among the elements contained in a range of iterators.

---

Function Documentation

TL_DLL void TeGroupByEqualStep	(	double	min,
		double	max,
		int	nstep,
		vector< TeSlice > &	result,
		int	precision = 0
	)

Definition at line 96 of file TeGroupingAlgorithms.cpp.

References TeSlice::count_, TeSlice::from_, Te2String(), TeAdjustToPrecision(), and TeSlice::to_.

{
        double slice = (max - min)/double(nstep);
        int ns;
        for (ns=0;ns<nstep;ns++)
        {
                TeSlice ps;
                ps.count_ = 0;
                ps.from_ = Te2String(min+double(ns)*slice, precision);
                ps.to_ = Te2String(min+double(ns+1)*slice, precision);
                result.push_back(ps);
        }
        min = TeAdjustToPrecision(min, precision, true);
        result[0].from_ = Te2String(min, precision);
        max = TeAdjustToPrecision(max, precision);
        result[result.size()-1].to_ = Te2String(max, precision);
}

template<typename It>

void TeMaximumValue	(	It	begin,
		It	end,
		vector< double > &	maxValue,
		double	dummy = -9999.99,
		bool	usesDummy = false
	)			[inline]

Definition at line 64 of file TeGroupingAlgorithms.h.

References TeMAXFLOAT.

Referenced by TeKMeans().

{
        for (int i=0; i<maxValue.size(); i++)
                maxValue[i] = -TeMAXFLOAT;

        It it = begin;
        double val;
        while ( it != end) 
        {
                if (!(usesDummy && dummy == val))
                        for (int i=0; i<maxValue.size(); i++)
                        {
                                val= (*it)[i];
                                if (val > maxValue[i])
                                        maxValue[i] = val;
                        }
                it++;
        }
}

template<typename It>

void TeMinimumValue	(	It	begin,
		It	end,
		vector< double > &	minValue,
		double	dummy = -9999.99,
		bool	usesDummy = false
	)			[inline]

Definition at line 42 of file TeGroupingAlgorithms.h.

References TeMAXFLOAT.

Referenced by TeKMeans().

{
        for (int i=0; i<minValue.size(); i++)
                minValue[i] = TeMAXFLOAT;

        It it = begin;
        double val;
        while ( it != end) 
        {
                if (!(usesDummy && dummy == val))
                        for (int i=0; i<minValue.size(); i++)
                        {
                                val= (*it)[i];
                                if (val < minValue[i])
                                        minValue[i] = val;
                        }
                it++;
        }
}

---