TRange.h

Go to the documentation of this file.

#ifndef TRange_H
#define TRange_H

#include <iostream>
#include <utility>
#include <algorithm>


template<class T> class TRange : public std::pair<T,T> {
public:

  TRange() { }

  TRange(const T & aMin, const T & aMax) 
      : std::pair<T,T> (aMin,aMax) { }

  TRange(const std::pair<T,T> & apair ) 
      : std::pair<T,T> (apair) { }  

  const T & min() const { return this->first; }

  const T & max() const { return this->second; }

  T mean() const { return (this->first+this->second)/2.; }

  bool empty() const { return (this->second < this->first); }

  bool inside(const T & value) const {
    if (value < this->first || this->second < value)  return false; 
    else  return true;
  }

/*
  bool hasIntersection( const TRange<T> & r) const {
    return rangesIntersect(*this,r); 
  }

  TRange<T> intersection( 
      const TRange<T> & r) const {
    return rangeIntersection(*this,r); 
  }
*/

  TRange<T> sum(const TRange<T> & r) const {
   if( this->empty()) return r;
   else if( r.empty()) return *this;
   else return TRange( (min() < r.min()) ? min() : r.min(), 
      (max() < r.max()) ? r.max() : max()); 
  }

  void sort() { if (empty() ) std::swap(this->first,this->second); }
};

template <class T> std::ostream & operator<<( 
    std::ostream& out, const TRange<T>& r) 
{
  return out << "("<<r.min()<<","<<r.max()<<")";
}
#endif