SortedRange.h

/**************************************************************************
* BASF2 (Belle Analysis Framework 2)                                     *
* Copyright(C) 2015 - Belle II Collaboration                             *
*                                                                        *
* Author: The Belle II Collaboration                                     *
* Contributors: Oliver Frost                                             *
*                                                                        *
* This software is provided "as is" without any warranty.                *
**************************************************************************/
#pragma once
 
#include <tracking/trackFindingCDC/utilities/Range.h>
 
#include <algorithm>
#include <iterator>
#include <utility>
 
namespace Belle2 {
  namespace TrackFindingCDC {
 
    template<class AIterator>
    class SortedRange : public Range<AIterator> {
 
    private:
      using Super = Range<AIterator>;
 
    public:
      using Iterator = AIterator;
 
      using Reference = typename std::iterator_traits<AIterator>::reference;
 
    public:
      template<class AOtherIterator>
      explicit SortedRange(const std::pair<AOtherIterator, AOtherIterator>& itPair)
        : Super(AIterator(itPair.first), AIterator(itPair.second))
      {}
 
      template<class Ts, class ItT = GetIterator<Ts>>
      explicit SortedRange(const Ts& ts)
        : Super(AIterator(std::begin(ts)), AIterator(std::end(ts)))
      {}
 
      using Super::Super;
 
      template<class T>
      SortedRange<AIterator> equal_range(const T& t) const
      { return SortedRange<AIterator>(std::equal_range(this->begin(), this->end(), t)); }
 
      template<class T>
      SortedRange<AIterator> upper_bound(const T& t) const
      { return SortedRange<AIterator>(std::upper_bound(this->begin(), this->end(), t)); }
 
      template<class T>
      SortedRange<AIterator> lowers_bound(const T& t) const
      { return SortedRange<AIterator>(std::lower_bound(this->begin(), this->end(), t)); }
 
      bool count(Reference t) const
      {
        Range<AIterator> relevant_range = this->equal_range(t);
        return relevant_range.count(t);
      }
 
    };
  }
}