Skip to content

ranges_is_heap.md

Latest commit

 

History

History
142 lines (118 loc) · 3.84 KB

ranges_is_heap.md

File metadata and controls

142 lines (118 loc) · 3.84 KB

is_heap

  • algorithm[meta header]
  • std::ranges[meta namespace]
  • function template[meta id-type]
  • cpp20[meta cpp]
namespace std::ranges {
  template <random_access_iterator I,
            sentinel_for<I> S,
            class Proj = identity,
            indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
  constexpr bool
    is_heap(I first,
            S last,
            Comp comp = {},
            Proj proj = {}); // (1) C++20

  template <random_access_range R,
            class Proj = identity,
            indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
  constexpr bool
    is_heap(R&& r,
            Comp comp = {},
            Proj proj = {}); // (2) C++20

  template <execution-policy Ep,
            random_access_iterator I,
            sized_sentinel_for<I> S,
            class Proj = identity,
            indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
  bool
    is_heap(Ep&& exec,
            I first,
            S last,
            Comp comp = {},
            Proj proj = {}); // (3) C++26

  template <execution-policy Ep,
            sized-random-access-range R,
            class Proj = identity,
            indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
  bool
    is_heap(Ep&& exec,
            R&& r,
            Comp comp = {},
            Proj proj = {}); // (4) C++26
}
  • ranges::less[link /reference/functional/ranges_less.md]
  • indirect_strict_weak_order[link /reference/iterator/indirect_strict_weak_order.md]
  • execution-policy[link /reference/execution/execution-policy.md]
  • random_access_iterator[link /reference/iterator/random_access_iterator.md]
  • sized_sentinel_for[link /reference/iterator/sized_sentinel_for.md]
  • sized-random-access-range[link /reference/ranges/sized-random-access-range.md]

概要

範囲がヒープ化されているか判定する。

  • (1): イテレータ範囲を指定する
  • (2): Rangeを直接指定する
  • (3): (1)の並列アルゴリズム版。実行ポリシーを指定する
  • (4): (2)の並列アルゴリズム版。実行ポリシーを指定する

効果

ranges::is_heap_until(first, last, comp, proj) == last と等しい。

例

基本的な使い方

#include <iostream>
#include <vector>
#include <algorithm>

int main()
{
  std::vector<int> v = {3, 1, 4};

  std::cout << std::boolalpha;

  std::cout << "before: is heap? "
            << std::ranges::is_heap(v) << std::endl;

  std::ranges::make_heap(v);
  std::cout << " after: is heap? "
            << std::ranges::is_heap(v) << std::endl;
}
  • std::ranges::is_heap[color ff0000]
  • std::ranges::make_heap[link ranges_make_heap.md]

出力

before: is heap? false
 after: is heap? true

並列アルゴリズムの例 (C++26)

#include <iostream>
#include <vector>
#include <algorithm>
#include <execution>

int main()
{
  std::vector<int> v = {3, 1, 4, 1, 5};

  std::cout << std::boolalpha;
  std::cout << "before: is heap? "
            << std::ranges::is_heap(std::execution::par, v) << std::endl;

  std::ranges::make_heap(v);

  std::cout << " after: is heap? "
            << std::ranges::is_heap(std::execution::par, v) << std::endl;
}
  • std::ranges::is_heap[color ff0000]
  • std::ranges::make_heap[link ranges_make_heap.md]

出力

before: is heap? false
 after: is heap? true

バージョン

言語

  • C++20

処理系

参照