Algorithms.h

Go to the documentation of this file.

#ifndef FWCore_Utilities_Algorithms_h
#define FWCore_Utilities_Algorithms_h

#include <algorithm>

namespace edm {


  template <typename ForwardSequence, typename Func>
  inline Func for_all(ForwardSequence& s, Func f) {
    return std::for_each(s.begin(), s.end(), f);
  }

  template <typename ForwardSequence, typename Func>
  inline Func copy_all(ForwardSequence& s, Func f) {
    return std::copy(s.begin(), s.end(), f);
  }

  template <typename ForwardSequence, typename Datum>
  inline typename ForwardSequence::const_iterator find_in_all(ForwardSequence const& s, Datum const& d) {
    return std::find(s.begin(), s.end(), d);
  }

  template <typename ForwardSequence, typename Datum>
  inline typename ForwardSequence::iterator find_in_all(ForwardSequence& s, Datum const& d) {
    return std::find(s.begin(), s.end(), d);
  }

  template <typename ForwardSequence, typename Datum>
  inline bool search_all(ForwardSequence const& s, Datum const& d) {
    return std::find(s.begin(), s.end(), d) != s.end();
  }

  template <typename ForwardSequence, typename Predicate>
  inline typename ForwardSequence::const_iterator find_if_in_all(ForwardSequence const& s, Predicate const& p) {
    return std::find_if(s.begin(), s.end(), p);
  }

  template <typename ForwardSequence, typename Predicate>
  inline typename ForwardSequence::iterator find_if_in_all(ForwardSequence& s, Predicate const& p) {
    return std::find_if(s.begin(), s.end(), p);
  }

  template <typename ForwardSequence, typename Predicate>
  inline bool search_if_in_all(ForwardSequence const& s, Predicate const& p) {
    return std::find_if(s.begin(), s.end(), p) != s.end();
  }

  template <typename ForwardSequence, typename Datum>
  inline bool binary_search_all(ForwardSequence const& s, Datum const& d) {
    return std::binary_search(s.begin(), s.end(), d);
  }

  template <typename ForwardSequence, typename Datum, typename Predicate>
  inline bool binary_search_all(ForwardSequence const& s, Datum const& d, Predicate p) {
    return std::binary_search(s.begin(), s.end(), d, p);
  }

  template <typename ForwardSequence, typename Datum>
  inline typename ForwardSequence::const_iterator lower_bound_all(ForwardSequence const& s, Datum const& d) {
    return std::lower_bound(s.begin(), s.end(), d);
  }

  template <typename ForwardSequence, typename Datum>
  inline typename ForwardSequence::iterator lower_bound_all(ForwardSequence& s, Datum const& d) {
    return std::lower_bound(s.begin(), s.end(), d);
  }

  template <typename ForwardSequence, typename Datum, typename Predicate>
  inline typename ForwardSequence::const_iterator lower_bound_all(ForwardSequence const& s,
                                                                  Datum const& d,
                                                                  Predicate p) {
    return std::lower_bound(s.begin(), s.end(), d, p);
  }

  template <typename ForwardSequence, typename Datum, typename Predicate>
  inline typename ForwardSequence::iterator lower_bound_all(ForwardSequence& s, Datum const& d, Predicate p) {
    return std::lower_bound(s.begin(), s.end(), d, p);
  }

  template <typename RandomAccessSequence>
  inline void sort_all(RandomAccessSequence& s) {
    std::sort(s.begin(), s.end());
  }

  template <typename RandomAccessSequence, typename Predicate>
  inline void sort_all(RandomAccessSequence& s, Predicate p) {
    std::sort(s.begin(), s.end(), p);
  }

  template <typename RandomAccessSequence>
  inline void stable_sort_all(RandomAccessSequence& s) {
    std::stable_sort(s.begin(), s.end());
  }

  template <typename RandomAccessSequence, typename Predicate>
  inline void stable_sort_all(RandomAccessSequence& s, Predicate p) {
    std::stable_sort(s.begin(), s.end(), p);
  }
}  // namespace edm
#endif