Anp::Hist1d< T > Class Template Reference

#include <Hist1d.h>

List of all members.

Public Types
typedef std::vector< Anp::Bin< T > >::const_iterator	BinIter
typedef std::vector< Anp::Bin< T > >::iterator	BinIterator
typedef std::vector< T >::const_iterator	Iter
typedef std::vector< T >::iterator	Iterator
Public Member Functions
	Hist1d ()
	Hist1d (unsigned int nbin, const T low, const T high)
	Hist1d (const std::vector< T > &vec)
	Hist1d (const TH1 &h)
	~Hist1d ()
unsigned int	Fill (const T value)
unsigned int	Fill (const T value, const T weight)
unsigned int	Fill (const T value, const T weight, const T width)
unsigned int	Fill (const TH1 &h)
unsigned int	Merge (const T minvalue)
unsigned int	Rebin (unsigned int ngroup)
Bin< T > &	operator[] (unsigned int bin)
Bin< T > &	GetBin (const T value)
const Bin< T > &	operator[] (unsigned int bin) const
const Bin< T > &	GetBin (const T value) const
T	GetIntegral (const std::string &option="") const
unsigned int	GetEntries (const std::string &option="") const
unsigned int	GetNbins () const
const std::vector< Anp::Bin< T > > &	GetBins () const
void	Reset ()
void	Print (std::ostream &o=std::cout) const
Private Member Functions
const Bin< T > &	get_bin_const (const T value) const
Bin< T > &	get_bin (const T value)
void	init_bins ()
void	init_bins (std::vector< T > vec)
void	init_trivial ()
Private Attributes
std::vector< Anp::Bin< T > >	fData
unsigned int	fNBin
T	fLowEdge
T	fHighEdge
bool	fSearchBin

template<typename T>
class Anp::Hist1d< T >

---

Member Typedef Documentation

template<typename T> typedef std::vector<Anp::Bin<T> >::const_iterator Anp::Hist1d< T >::BinIter

Definition at line 90 of file Hist1d.h. Referenced by Anp::Hist1d< T >::get_bin_const(), Anp::Hist1d< T >::GetEntries(), Anp::Hist1d< T >::GetIntegral(), and Anp::Hist1d< T >::Print().

template<typename T> typedef std::vector<Anp::Bin<T> >::iterator Anp::Hist1d< T >::BinIterator

Definition at line 91 of file Hist1d.h. Referenced by Anp::Hist1d< T >::Fill(), Anp::Hist1d< T >::Merge(), and Anp::Hist1d< T >::Reset().

template<typename T> typedef std::vector<T>::const_iterator Anp::Hist1d< T >::Iter

Definition at line 93 of file Hist1d.h.

template<typename T> typedef std::vector<T>::iterator Anp::Hist1d< T >::Iterator

Definition at line 94 of file Hist1d.h.

---

Constructor & Destructor Documentation

template<typename T> Anp::Hist1d< T >::Hist1d (   )

Definition at line 349 of file Hist1d.h. References Anp::Hist1d< T >::init_trivial(). : fData(), fNBin(0), fLowEdge(), fHighEdge(), fSearchBin(false) { init_trivial(); }

template<typename T> Anp::Hist1d< T >::Hist1d (  unsigned int  nbin, const T  low, const T  high )

Definition at line 357 of file Hist1d.h. References Anp::Hist1d< T >::fNBin, Anp::Hist1d< T >::init_bins(), and Anp::Hist1d< T >::init_trivial(). : fData(), fNBin(nbin), fLowEdge(low), fHighEdge(high), fSearchBin(false) { if(fNBin > 0) { init_bins(); } else { init_trivial(); } }

template<typename T> Anp::Hist1d< T >::Hist1d (  const std::vector< T > &  vec  )  [explicit]

Definition at line 372 of file Hist1d.h. References Anp::Hist1d< T >::init_bins(), and Anp::Hist1d< T >::init_trivial(). : fData(), fNBin(0), fLowEdge(), fHighEdge(), fSearchBin(true) { if(vec.size() > 1) { init_bins(vec); } else { init_trivial(); } }

template<typename T> Anp::Hist1d< T >::Hist1d (  const TH1 &  h  )  [explicit]

Definition at line 387 of file Hist1d.h. References Anp::Bin< T >::add(), and Anp::Hist1d< T >::fData. :fData(), fNBin(h.GetNbinsX()), fLowEdge(h.GetXaxis() -> GetXmin()), fHighEdge(h.GetXaxis() -> GetXmax()), fSearchBin(true) { const int nbin = h.GetNbinsX(); if(nbin < 2) { std::cerr << "Hist1d<T>::Hist1d encountered TH1 without bins" << std::endl; return; } for(int ibin = 1; ibin <= nbin + 1; ++ibin) { const double value = h.GetBinContent(ibin); const double edge = h.GetBinLowEdge(ibin); if(ibin == 1) { fData.push_back(Bin<T>(0, edge)); } Bin<T> bin(ibin, edge); bin.add(value); fData.push_back(bin); } std::sort(fData.begin(), fData.end()); }

template<typename T> Anp::Hist1d< T >::~Hist1d (   )

Definition at line 423 of file Hist1d.h. {}

---

Member Function Documentation

template<typename T> unsigned int Anp::Hist1d< T >::Fill (  const TH1 &  h  )

Definition at line 545 of file Hist1d.h. References Anp::Bin< T >::add(), Anp::Hist1d< T >::fData, and Anp::Hist1d< T >::Fill(). { const int nbin = h.GetNbinsX(); assert(nbin > 1 && "Hist1d<T>::Fill encountered TH1 without bins"); for(int ibin = 0; ibin <= nbin + 1; ++ibin) { const double value = h.GetBinContent(ibin); const double center = h.GetBinCenter(ibin); if(ibin == 0) { fData.front().add(value); } else if(ibin == nbin + 1) { fData.back().add(value); } else { Fill(center, value); } } return 0; }

template<typename T> unsigned int Anp::Hist1d< T >::Fill (  const T  value, const T  weight, const T  width )

Definition at line 445 of file Hist1d.h. References Anp::Bin< T >::add(), Anp::Bin< T >::bin(), Anp::Hist1d< T >::BinIterator, Anp::Hist1d< T >::fData, Anp::Hist1d< T >::Fill(), and Anp::Hist1d< T >::fNBin. { if(!(width > 0.0) || fNBin < 1 || fData.empty()) { return Fill(value, weight); } // compute boundaries for non zero kernel coontributions const T lpos = value - width; const T rpos = value + width; // Only overlap with underflow or overflow bins if(rpos < fData.front()) { // rpos < underflow bin edge - no contribution to other bins Bin<T> &bin = fData.front(); bin.add(weight); return bin.bin(); } else if(!(lpos < fData.back())) { // lpos >= last overflow edge - no contribution to other bins Bin<T> &bin = fData.back(); bin.add(weight); return bin.bin(); } BinIterator lit = std::lower_bound(fData.begin(), fData.end(), lpos); if(lit == fData.end()) { std::cerr << "Hist1d<T>::Fill - lower_bound has failed to find correct bin" << std::endl; return 0; } // make copy of beg and end iterators BinIterator ibeg = fData.begin(); BinIterator iend = fData.end(); // // special case: compute overlap with underflow bin // if(lit == ibeg) { if(lpos < ibeg -> edge()) { ibeg -> add(weight*GetKernelOverlap<T>(lpos, ibeg -> edge(), value, width)); } lit++; } else { lit--; assert(lit != ibeg && "logic error finding underflow bin"); } for(; lit != iend; ++lit) { // // No more non overlapping bins // if(!(lit -> edge() < rpos)) { break; } // // Overlap with this bin // T overlap = 0; const BinIterator nit = lit + 1; if(nit == iend) { overlap = Anp::GetKernelOverlap<T>(lit -> edge(), rpos, value, width); } else { // // kernel is entirely contain in a single bin // if(lit -> edge() < lpos && rpos < nit -> edge()) { lit -> add(weight); break; } overlap = Anp::GetKernelOverlap<T>(std::max<T>(lit -> edge(), lpos), std::min<T>(nit -> edge(), rpos), value, width); } lit -> add(weight*overlap); // compute overlap fraction with this bin } return 0; }

template<typename T> unsigned int Anp::Hist1d< T >::Fill (  const T  value, const T  weight )

Definition at line 436 of file Hist1d.h. References Anp::Bin< T >::add(), Anp::Bin< T >::bin(), and Anp::Hist1d< T >::get_bin(). { Bin<T> &bin = get_bin(value); bin.add(weight); return bin.bin(); }

template<typename T> unsigned int Anp::Hist1d< T >::Fill (  const T  value  )

Definition at line 427 of file Hist1d.h. References Anp::Bin< T >::add(), Anp::Bin< T >::bin(), and Anp::Hist1d< T >::get_bin(). Referenced by Plot::Hist::CreateRatio(), Anp::Hist1d< T >::Fill(), Plot::Hist::GetRatio(), Anp::CountHist::Refill(), and Plot::TestHist(). { Bin<T> &bin = get_bin(value); bin.add(); return bin.bin(); }

template<typename T> Bin< T > & Anp::Hist1d< T >::get_bin (  const T  value  )  [private]

Definition at line 900 of file Hist1d.h. References Anp::Hist1d< T >::get_bin_const(). Referenced by Anp::Hist1d< T >::Fill(), and Anp::Hist1d< T >::GetBin(). { return const_cast<Bin<T> &>(get_bin_const(value)); }

template<typename T> const Bin< T > & Anp::Hist1d< T >::get_bin_const (  const T  value  )  const [private]

Definition at line 843 of file Hist1d.h. References Anp::Hist1d< T >::BinIter, Anp::Hist1d< T >::fData, Anp::Hist1d< T >::fHighEdge, and Anp::Hist1d< T >::fNBin. Referenced by Anp::Hist1d< T >::get_bin(), and Anp::Hist1d< T >::GetBin(). { assert(!fData.empty() && "Hist1d<T>::get_bin_const() - vector is empty"); if(fData.size() == 1) { return fData.front(); } else if(value < fData.front()) { // value < underflow bin edge so return underflow bin return fData.front(); } else if(!(value < fData.back())) { // value >= last overflow edge so return overflow bin return fData.back(); } // this point is reached if value >= low edge AND value < high edge // use stl binary_search to find proper bin, exclude underflow bin if(fSearchBin) { BinIter bit = std::lower_bound(fData.begin() + 1, fData.end(), value); if(bit == fData.end()) { std::cerr << "Hist1d<T>::get_bin_const() - lower_bound has failed to find bin" << std::endl; return fData.back(); } else if(!(value < *bit) && !(*bit < value)) { return *bit; } return *(bit - 1); } else { const unsigned int bin = 1 + static_cast<unsigned int>((fNBin*(value - fLowEdge))/(fHighEdge - fLowEdge)); if(bin > fNBin) { std::cerr << "Hist1d<T>::get_bin_const() - logic error #1" << std::endl; return fData.back(); } return fData[bin]; } std::cerr << "Hist1d<T>::get_bin_const() - logic error #2" << std::endl; return fData.front(); }

template<typename T> const Bin< T > & Anp::Hist1d< T >::GetBin (  const T  value  )  const

Definition at line 756 of file Hist1d.h. References Anp::Hist1d< T >::get_bin_const(). { return get_bin_const(value); }

template<typename T> Bin< T > & Anp::Hist1d< T >::GetBin (  const T  value  )

Definition at line 734 of file Hist1d.h. References Anp::Hist1d< T >::get_bin(). { return get_bin(value); }

template<typename T> const std::vector< Anp::Bin< T > > & Anp::Hist1d< T >::GetBins (   )  const [inline]

Definition at line 829 of file Hist1d.h. Referenced by Anp::CreateTH1(). { return fData; }

template<typename T> unsigned int Anp::Hist1d< T >::GetEntries (  const std::string &  option = ""  )  const [inline]

Definition at line 763 of file Hist1d.h. References Anp::Hist1d< T >::BinIter, Anp::Hist1d< T >::fData, and option. { if(fData.size() < 2) { return 0; } unsigned int entries = 0; BinIter beg = fData.begin(); BinIter end = fData.end(); if(option.find("U") == std::string::npos) { beg++; } if(option.find("O") == std::string::npos) { end--; } for(BinIter cit = beg; cit != end; ++cit) { entries += cit -> entries(); } return entries; }

template<typename T> T Anp::Hist1d< T >::GetIntegral (  const std::string &  option = ""  )  const [inline]

Definition at line 794 of file Hist1d.h. References Anp::Hist1d< T >::BinIter, Anp::Hist1d< T >::fData, and option. Referenced by Anp::CreateTH1(). { if(fData.size() < 2) { return 0; } T integral = 0; BinIter beg = fData.begin(); BinIter end = fData.end(); if(option.find("U") == std::string::npos) { beg++; } if(option.find("O") == std::string::npos) { end--; } for(BinIter cit = beg; cit != end; ++cit) { integral += cit -> sum(); } return integral; }

template<typename T> unsigned int Anp::Hist1d< T >::GetNbins (   )  const [inline]

Definition at line 825 of file Hist1d.h. { return fNBin; }

template<typename T> void Anp::Hist1d< T >::init_bins (  std::vector< T >  vec  )  [private]

Definition at line 938 of file Hist1d.h. References Anp::Hist1d< T >::fData, and Anp::Hist1d< T >::fNBin. { assert(vec.size() > 1 && "Hist1d<T>::init_bins() encountered small vector"); // sort bin edges std::sort(vec.begin(), vec.end()); fNBin = vec.size() - 1; fData.push_back(Bin<T>(0, vec.front())); for(unsigned int ibin = 0; ibin < vec.size(); ++ibin) { fData.push_back(Bin<T>(ibin + 1, vec[ibin])); } // sort all but first overflow bin std::sort(fData.begin() + 1, fData.end()); }

template<typename T> void Anp::Hist1d< T >::init_bins (   )  [private]

Definition at line 915 of file Hist1d.h. References Anp::Hist1d< T >::fData, Anp::Hist1d< T >::fHighEdge, Anp::Hist1d< T >::fLowEdge, Anp::Hist1d< T >::fNBin, and Anp::Hist1d< T >::init_trivial(). Referenced by Anp::Hist1d< T >::Hist1d(). { if(!(fLowEdge < fHighEdge)) { std::cerr << "Hist1d<T>::init_bins() - minimum is not larger than maximum" << std::endl; init_trivial(); return; } fData.push_back(Bin<T>(0, fLowEdge)); for(unsigned int ibin = 0; ibin < fNBin + 1; ++ibin) { const T edge = fLowEdge + static_cast<T>(((fHighEdge - fLowEdge)*ibin)/fNBin); fData.push_back(Bin<T>(ibin + 1, edge)); } // sort all but first overflow bin std::sort(fData.begin() + 1, fData.end()); }

template<typename T> void Anp::Hist1d< T >::init_trivial (   )  [private]

Definition at line 907 of file Hist1d.h. References Anp::Hist1d< T >::fData, and Anp::Hist1d< T >::fNBin. Referenced by Anp::Hist1d< T >::Hist1d(), and Anp::Hist1d< T >::init_bins(). { fNBin = 0; fData.push_back(Bin<T>(0, T())); }

template<typename T> unsigned int Anp::Hist1d< T >::Merge (  const T  minvalue  )

Definition at line 575 of file Hist1d.h. References Anp::Hist1d< T >::BinIterator, Anp::Hist1d< T >::fData, and Anp::Hist1d< T >::fNBin. Referenced by Anp::CountHist::ComputeRatio(), Plot::Hist::CreateRatio(), and Plot::TestHist(). { unsigned int nmerge = 0; typename std::vector<Bin<T> >::iterator bit = fData.begin(); while(bit != fData.end()) { if(bit -> sum() > minvalue) { ++bit; continue; } if(bit == fData.begin() || bit - 1 == fData.begin()) { ++bit; continue; } if(bit + 1 == fData.end() || bit + 2 == fData.end()) { ++bit; continue; } typename std::vector<Bin<T> >::iterator lit = bit - 1; typename std::vector<Bin<T> >::iterator hit = bit + 1; if(lit -> sum() < hit -> sum()) { const Bin<T> newbin(*lit, *bit); typename std::vector<Bin<T> >::iterator pit = fData.erase(lit, bit + 1); fData.insert(pit, newbin); } else { const Bin<T> newbin(*bit, *hit); typename std::vector<Bin<T> >::iterator pit = fData.erase(bit, hit + 1); fData.insert(pit, newbin); } bit = fData.begin(); ++nmerge; } BinIterator pit = fData.begin(); for(BinIterator cit = fData.begin(); cit != fData.end(); ++cit) { if(cit == fData.begin() || cit - 1 == fData.begin()) { pit = cit; continue; } if(!(pit -> edge() < cit -> edge()) || !(pit -> bin() < cit -> bin())) { std::cerr << "Hist1d<T>::Merge - logic error for bin " << cit -> bin() << std::endl; } pit = cit; cit -> set_bin(std::distance(fData.begin(), cit)); } fNBin = fData.size() - 2; return nmerge; }

template<typename T> const Bin< T > & Anp::Hist1d< T >::operator[] (  unsigned int  bin  )  const

Definition at line 741 of file Hist1d.h. References Anp::Hist1d< T >::fData. { assert(!fData.empty() && "empty bin vector in Hist1d<T>::operator[]"); if(bin >= fData.size()) { std::cerr << "Hist1d<T>::operator[" << bin << "] is out of range" << std::endl; return fData.back(); } return fData[bin]; }

template<typename T> Bin< T > & Anp::Hist1d< T >::operator[] (  unsigned int  bin  )

Definition at line 719 of file Hist1d.h. References Anp::Hist1d< T >::fData. { assert(!fData.empty() && "empty bin vector in Hist1d<T>::operator[]"); if(bin >= fData.size()) { std::cerr << "Hist1d<T>::operator[" << bin << "] is out of range" << std::endl; return fData.back(); } return fData[bin]; }

template<typename T> void Anp::Hist1d< T >::Print (  std::ostream &  o = std::cout  )  const

Definition at line 959 of file Hist1d.h. References Anp::Hist1d< T >::BinIter, Anp::Hist1d< T >::fData, Anp::Hist1d< T >::fNBin, and print(). Referenced by Anp::operator<<(), and Plot::TestHist(). { o << "Printing 1d histogram containing " << fNBin << " bins" << std::endl; short width = 1; for(short i = 1; i < 10; ++i) { if(fNBin < 10^(i)) { width = i; break; } } if(width < 4) { width = 4; } for(BinIter it = fData.begin(); it != fData.end(); ++it) { it -> print(o, width, width); } }

template<typename T> unsigned int Anp::Hist1d< T >::Rebin (  unsigned int  ngroup  )

Definition at line 652 of file Hist1d.h. References Anp::Hist1d< T >::fData, Anp::Hist1d< T >::fNBin, Anp::Hist1d< T >::fSearchBin, and Anp::Bin< T >::set_bin(). Referenced by Plot::Hist::Rebin(). { // // rebin histogram by adding ngroup bins together // if(ngroup < 1 || ngroup >= fNBin || fData.size() < 3) { return 0; } std::vector<Anp::Bin<T> > data; bool newbin = true; Bin<T> bin; assert(int(fNBin) == int(fData.size()) - 2 && "logic error counting bins"); for(unsigned int ibin = 1; ibin <= fNBin; ++ibin) { assert(ibin < fData.size() && "out of bounds access"); if(newbin) { bin = fData[ibin]; newbin = false; continue; } bin = Anp::Merge<T>(bin, fData[ibin]); if(ibin % ngroup == 0) { data.push_back(bin); newbin = true; } } // // Add last bin // if(!newbin) data.push_back(bin); // // sort bins // std::sort(data.begin(), data.end()); // // Add overflow and underflow bins // data.insert(data.begin(), fData.front()); data.insert(data.end(), fData.back()); for(unsigned int ibin = 0; ibin < data.size(); ibin++) { data[ibin].set_bin(ibin); } fData = data; fNBin = data.size() - 2; fSearchBin = true; return fNBin; }

template<typename T> void Anp::Hist1d< T >::Reset (   )  [inline]

Definition at line 833 of file Hist1d.h. References Anp::Hist1d< T >::BinIterator, and Anp::Hist1d< T >::fData. Referenced by Plot::Hist::CreateRatio(), Plot::Hist::GetRatio(), Anp::CountHist::Refill(), and Plot::TestHist(). { for(BinIterator cit = fData.begin(); cit != fData.end(); ++cit) { cit -> reset(); } }

---

Member Data Documentation

template<typename T> std::vector<Anp::Bin<T> > Anp::Hist1d< T >::fData [private]

Definition at line 140 of file Hist1d.h. Referenced by Anp::Hist1d< T >::Fill(), Anp::Hist1d< T >::get_bin_const(), Anp::Hist1d< T >::GetEntries(), Anp::Hist1d< T >::GetIntegral(), Anp::Hist1d< T >::Hist1d(), Anp::Hist1d< T >::init_bins(), Anp::Hist1d< T >::init_trivial(), Anp::Hist1d< T >::Merge(), Anp::Hist1d< T >::operator[](), Anp::Hist1d< T >::Print(), Anp::Hist1d< T >::Rebin(), and Anp::Hist1d< T >::Reset().

template<typename T> T Anp::Hist1d< T >::fHighEdge [private]

Definition at line 145 of file Hist1d.h. Referenced by Anp::Hist1d< T >::get_bin_const(), and Anp::Hist1d< T >::init_bins().

template<typename T> T Anp::Hist1d< T >::fLowEdge [private]

Definition at line 144 of file Hist1d.h. Referenced by Anp::Hist1d< T >::init_bins().

template<typename T> unsigned int Anp::Hist1d< T >::fNBin [private]

Definition at line 142 of file Hist1d.h. Referenced by Anp::Hist1d< T >::Fill(), Anp::Hist1d< T >::get_bin_const(), Anp::Hist1d< T >::Hist1d(), Anp::Hist1d< T >::init_bins(), Anp::Hist1d< T >::init_trivial(), Anp::Hist1d< T >::Merge(), Anp::Hist1d< T >::Print(), and Anp::Hist1d< T >::Rebin().

template<typename T> bool Anp::Hist1d< T >::fSearchBin [private]

Definition at line 147 of file Hist1d.h. Referenced by Anp::Hist1d< T >::Rebin().

---

The documentation for this class was generated from the following file:

• Hist1d.h

---