PndMvaUtil.h File Reference

#include <typeinfo>
#include <sstream>
#include <string>
#include <vector>
#include <map>
#include <cmath>
#include <cassert>

Go to the source code of this file.

Classes
struct	StepError
	Structure to hold the per step error values. More...
struct	PndMvaDistObj

Functions
bool	CompLess (PndMvaDistObj const *a, PndMvaDistObj const *b)
	Less than, comparison funtion. More...
template<typename T >
T const &	minFunct (T const &a, T const &b)
template<typename T >
bool	compareL (T const *l, T const *r)
	Less than, comparison funtion. More...
template<typename Set1 , typename Set2 >
bool	is_disjoint (Set1 const &set1, Set2 const &set2)
float	ComputeDist (std::vector< float > const &EvtData, std::vector< float > const &Example)
int	str2int (std::string const &str)
unsigned int	str2Uint (std::string const &str)
std::string	int2str (int n)

Function Documentation

compareL()

template<typename T >

bool compareL ( T const *  l, T const *  r  )

inline

Less than, comparison funtion.

Definition at line 135 of file PndMvaUtil.h.

{
  assert(l && r);
  return ((*l) < (*r));
};

CompLess()

bool CompLess ( PndMvaDistObj const *  a, PndMvaDistObj const *  b  )

inline

Less than, comparison funtion.

Definition at line 114 of file PndMvaUtil.h.

{
  assert(a && b);
  return ((*a).m_dist < (*b).m_dist);
};

ComputeDist()

float ComputeDist	(	std::vector< float > const &	EvtData,
		std::vector< float > const &	Example
	)

Computes the Euclidean distance between two given vectors of event features.

Referenced by is_disjoint().

int2str()

std::string int2str

(

int

n

)

Referenced by is_disjoint().

is_disjoint()

template<typename Set1 , typename Set2 >

bool is_disjoint	(	Set1 const &	set1,
		Set2 const &	set2
	)

If 2 sets are disjoint.

Input two sorted (ASC) sequences.

Returns

true if the sets are disjoint.

NOTE: In some cases one might consider using std::set_intersection from <algorithm>

Definition at line 151 of file PndMvaUtil.h.

References ComputeDist(), int2str(), str2int(), and str2Uint().

{
  // IF one of the sets is empty. O(1) true on empty sets per
  // definition.
  if (set1.empty() || set2.empty()) {
    return true;
  }
  // Start and end iterators of the first sequence.
  typename Set1::const_iterator it1 = set1.begin();
  typename Set1::const_iterator it1End = set1.end();

  // Start and end iterators of the second sequence.
  typename Set2::const_iterator it2 = set2.begin();
  typename Set2::const_iterator it2End = set2.end();

  // This holds because the sequences are pre-sorted. O(1)
  if (*it1 > *set2.rbegin() || *it2 > *set1.rbegin()) {
    return true;
  }

  // Investigate element-wise.
  while ((it1 != it1End) && (it2 != it2End)) {
    if (*it1 == *it2) {
      return false;
    }

    if (*it1 < *it2) {
      it1++;
    } else {
      it2++;
    }
  } // WHILE
  return true;
}

minFunct()

template<typename T >

T const& minFunct ( T const &  a, T const &  b  )

inline

Binary Minimum function.

Definition at line 127 of file PndMvaUtil.h.

{
  // or: return comp(a,b)?a:b; for the comp version
  return (a < b) ? a : b;
};

str2int()

int str2int

(

std::string const &

str

)

Referenced by is_disjoint().

str2Uint()

unsigned int str2Uint

(

std::string const &

str

)

Referenced by is_disjoint().