---

genericalgs.h

Go to the documentation of this file.

#ifndef __GENERICALGS_H__
#define __GENERICALGS_H__

#include <algorithm>

#ifndef ISEQ
#define ISEQ(container) (container).begin(),(container).end()
#endif


#ifndef callMemberFunction
#define callMemberFunction(object,ptrToMember)  ((object).*(ptrToMember))
#endif


namespace Generic {



template <class T>
inline const T crop(const T lower, const T upper, const T x) {
  return std::max(lower,std::min(upper,x));
}
  

 
template <class T>
inline const T wrap(const T lower, const T upper, const T x) {
  const T range=upper-lower;
  return lower + (T)fmod(x-lower + 2*range*(1-floor(x/(2*range))),
                         range);
}
 

 
template <class T>
inline int round(const T x) {  return int(x+0.5);  }



template<class Container>
void delete_contents(Container& c)
{
  while(!c.empty()) {
    delete c.back();
    c.pop_back();
  }
}



template<class Container>
void nested_delete_contents(Container& c)
{
  while(!c.empty()) {
    delete_contents(*c.back());
    delete c.back();
    c.pop_back();
  }
}



template <class ForwardIterator, class T>
void lower_threshold(ForwardIterator first, ForwardIterator last,
                     const T& threshold, const T& new_value)
{  for (; first != last; ++first) if (*first < threshold) *first=new_value;  }



template <class InputIterator, class ForwardIterator, class T>
void lower_threshold(InputIterator   ifirst, InputIterator   ilast,
                     ForwardIterator ofirst,
                     const T& threshold, const T& new_value)  {
  for (; ifirst != ilast; ++ifirst,++ofirst)
    *ofirst = (*ifirst < threshold) ? new_value : *ifirst;
}



template <class ForwardIterator, class T>
void upper_threshold(ForwardIterator first, ForwardIterator last,
                     const T& threshold, const T& new_value)
{  for (; first != last; ++first) if (*first > threshold) *first=new_value;  }



template <class InputIterator, class ForwardIterator, class T>
void upper_threshold(InputIterator   ifirst, InputIterator   ilast,
                     ForwardIterator ofirst,
                     const T& threshold, const T& new_value)  {
  for (; ifirst != ilast; ++ifirst,++ofirst)
    *ofirst = (*ifirst > threshold) ? new_value : *ifirst;
}



template <class InputIterator, class T, class Operation >
T accumulate(InputIterator beg, InputIterator end, T init, Operation op)
{
  for ( ; beg != end; ++beg)
    init = init + op(*beg);
  return init;
}

template <class InputIterator, class T, class Operation, class BinaryOperation >
T accumulate(InputIterator beg, InputIterator end, T init, Operation op, BinaryOperation binop)
{
  for ( ; beg != end; ++beg)
    init = binop(init,op(*beg));
  return init;
}


template <class T>
inline T hypot(T x, T y)
{  return sqrt(x*x+y*y);  }


} /* namespace Generic */ 
#endif

---