Flexible pt range for the efficiency histogramming

[u/mrichter/AliRoot.git] / MUON / mapping / AliMpIntPair.h

/* Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *
 * See cxx source for full Copyright notice                               */

// $Id$
// $MpId: AliMpIntPair.h,v 1.6 2006/05/24 13:58:07 ivana Exp $

/// \ingroup core
/// \class AliMpIntPair
/// \brief A pair of integers.
///
/// The pair created by the default constructor is in invalide state,
/// setting one of values changes the state to valid.
///
/// \author David Guez, Ivana Hrivnacova; IPN Orsay

#ifndef ALI_MP_INT_PAIR_H
#define ALI_MP_INT_PAIR_H

#include <TObject.h>

using std::ostream;

class AliMpIntPair : public TObject
{
 public:
  AliMpIntPair(Int_t ix,Int_t iy);
  AliMpIntPair(Int_t ix,Int_t iy, Bool_t validity);
  AliMpIntPair(const AliMpIntPair& right);
  AliMpIntPair();
  virtual ~AliMpIntPair();

  // operators  
  Bool_t operator <  (const AliMpIntPair& pos2) const;
  Bool_t operator == (const AliMpIntPair& pos2) const;
  Bool_t operator != (const AliMpIntPair& pos2) const;
  AliMpIntPair& operator = (const AliMpIntPair& src) ;
  void operator += (const AliMpIntPair& op);
  void operator -= (const AliMpIntPair& op);

  //
  // static get methods
  //
         /// Return invalid pair
  static AliMpIntPair Invalid() {return AliMpIntPair();}

  //
  // get methods
  //
         /// Return first value
  Int_t  GetFirst() const  {return fFirst;}
         /// Return second value
  Int_t  GetSecond() const {return fSecond;}
         /// Return validity
  Bool_t IsValid() const   {return fValidity;}

  //
  // set methods
  //
         /// Set first value 
  void SetFirst(Int_t ix)  {fFirst=ix; fValidity=true; }
         /// Set second value 
  void SetSecond(Int_t iy) {fSecond=iy; fValidity=true;}
         /// Set both first and second value
  void Set(Int_t ix, Int_t iy) { fFirst=ix; fSecond=iy; fValidity=true; }
  
  //
  // TObject functions used for sorting in Root collections
  //
         /// Return true as Compare() function is implemented 
  virtual Bool_t  IsSortable() const {return kTRUE;}
  virtual Int_t   Compare(const TObject* obj) const;

 private:
  // data members
  Int_t   fFirst;    ///< the first value
  Int_t   fSecond;   ///< the second value
  Bool_t  fValidity; ///< validity

  ClassDef(AliMpIntPair,1) // utility class for the motif type
};

AliMpIntPair operator + (const AliMpIntPair& op1,const AliMpIntPair& op2);
AliMpIntPair operator - (const AliMpIntPair& op1,const AliMpIntPair& op2);
AliMpIntPair operator * (const AliMpIntPair& op1,const AliMpIntPair& op2);
ostream& operator << (ostream &stream,const AliMpIntPair& op);

#endif //ALI_MP_INT_PAIR_H