githubmirror/omim

std/algorithm.hpp
102 строки2 KB
Vladimir Byko-Ianko
Adding minmax_element to algorithm.hpp
14 сен 2016, 17:37
14 сен 2016, 17:3793511da
#pragma once

#ifdef new
#undef new
#endif

#include <algorithm>

using std::all_of;
using std::any_of;
using std::binary_search;
using std::copy;
using std::equal;
using std::equal_range;
using std::fill;
using std::find;
using std::find_first_of;
using std::find_if;
using std::for_each;
using std::is_sorted;
using std::iter_swap;
using std::lexicographical_compare;
using std::lower_bound;
using std::max;
using std::max_element;
using std::min;
using std::min_element;
using std::minmax_element;
using std::next_permutation;
using std::none_of;
using std::nth_element;
using std::partial_sort;
using std::remove_if;
using std::replace;
using std::reverse;
using std::set_intersection;
using std::set_union;
using std::sort;
using std::stable_partition;
using std::stable_sort;
using std::swap;
using std::unique;
using std::upper_bound;
// Bug workaround, see http://connect.microsoft.com/VisualStudio/feedbackdetail/view/840578/algorithm-possible-c-compiler-bug-when-using-std-set-difference-with-custom-comperator
#ifdef _MSC_VER
namespace vs_bug
{
template<class InputIt1, class InputIt2, class OutputIt, class Compare>
OutputIt set_difference( InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2, OutputIt d_first, Compare comp)
{
  while (first1 != last1)
  {
    if (first2 == last2)
      return std::copy(first1, last1, d_first);
    if (comp(*first1, *first2))
      *d_first++ = *first1++;
    else
    {
      if (!comp(*first2, *first1))
        ++first1;
      ++first2;
    }
  }
  return d_first;
}

template<class InputIt1, class InputIt2, class OutputIt>
OutputIt set_difference(InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2, OutputIt d_first)
{
  while (first1 != last1)
  {
    if (first2 == last2)
      return std::copy(first1, last1, d_first);

    if (*first1 < *first2)
      *d_first++ = *first1++;
    else
    {
      if (! (*first2 < *first1))
        ++first1;
      ++first2;
    }
  }
  return d_first;
}

} // namespace vc_bug
#else
using std::set_difference;
#endif
using std::distance;
using std::generate;
using std::pop_heap;
using std::push_heap;
using std::remove_copy_if;
using std::set_symmetric_difference;
using std::sort_heap;
using std::transform;

#ifdef DEBUG_NEW
#define new DEBUG_NEW
#endif