heap.hpp 文件参考

MSTL堆算法 更多...

#include "MSTL/core/functional/functor.hpp"
#include "MSTL/core/algorithm/iterator.hpp"

heap.hpp 的引用(Include)关系图:

浏览该文件的源代码.

函数
template<typename Iterator, typename Compare, enable_if_t< is_ranges_rnd_iter_v< Iterator >, int > = 0>
MSTL_CONSTEXPR20 Iterator	is_heap_until (Iterator first, Iterator last, Compare comp)
	查找堆中破坏堆性质的首个元素
template<typename Iterator, enable_if_t< is_ranges_rnd_iter_v< Iterator >, int > = 0>
MSTL_CONSTEXPR20 Iterator	is_heap_until (Iterator first, Iterator last)
	查找堆中破坏堆性质的首个元素
template<typename Iterator, typename Compare, enable_if_t< is_ranges_rnd_iter_v< Iterator >, int > = 0>
MSTL_CONSTEXPR20 bool	is_heap (Iterator first, Iterator last, Compare comp)
	检查范围是否为有效堆
template<typename Iterator, enable_if_t< is_ranges_rnd_iter_v< Iterator >, int > = 0>
MSTL_CONSTEXPR20 bool	is_heap (Iterator first, Iterator last)
	检查范围是否为有效堆
template<typename Iterator, typename Compare, enable_if_t< is_ranges_rnd_iter_v< Iterator >, int > = 0>
MSTL_CONSTEXPR20 void	push_heap (Iterator first, Iterator last, Compare comp)
	向堆中插入元素
template<typename Iterator, enable_if_t< is_ranges_rnd_iter_v< Iterator >, int > = 0>
MSTL_CONSTEXPR20 void	push_heap (Iterator first, Iterator last)
	向堆中插入元素
template<typename Iterator, typename Distance, typename T, typename Compare, enable_if_t< is_ranges_rnd_iter_v< Iterator >, int > = 0>
MSTL_CONSTEXPR20 void	adjust_heap (Iterator first, Distance hole_index, Distance len, T value, Compare comp)
	堆调整辅助函数
template<typename Iterator, typename Distance, typename T, enable_if_t< is_ranges_rnd_iter_v< Iterator >, int > = 0>
MSTL_CONSTEXPR20 void	adjust_heap (Iterator first, Distance hole_index, Distance len, T value)
	堆调整辅助函数
template<typename Iterator, typename Compare, enable_if_t< is_ranges_rnd_iter_v< Iterator >, int > = 0>
MSTL_CONSTEXPR20 void	pop_heap (Iterator first, Iterator last, Compare comp)
	删除堆顶元素
template<typename Iterator, enable_if_t< is_ranges_rnd_iter_v< Iterator >, int > = 0>
MSTL_CONSTEXPR20 void	pop_heap (Iterator first, Iterator last)
	删除堆顶元素
template<typename Iterator, typename Compare, enable_if_t< is_ranges_rnd_iter_v< Iterator >, int > = 0>
MSTL_CONSTEXPR20 void	sort_heap (Iterator first, Iterator last, Compare comp)
	将堆转换为有序序列
template<typename Iterator, enable_if_t< is_ranges_rnd_iter_v< Iterator >, int > = 0>
MSTL_CONSTEXPR20 void	sort_heap (Iterator first, Iterator last)
	将堆转换为有序序列
template<typename Iterator, typename Compare, enable_if_t< is_ranges_rnd_iter_v< Iterator >, int > = 0>
MSTL_CONSTEXPR20 void	make_heap (Iterator first, Iterator last, Compare comp)
	创建堆
template<typename Iterator, enable_if_t< is_ranges_rnd_iter_v< Iterator >, int > = 0>
MSTL_CONSTEXPR20 void	make_heap (Iterator first, Iterator last)
	创建堆

详细描述

MSTL堆算法

此文件提供了堆算法实现，用于在随机访问容器上创建和操作二叉堆数据结构。

在文件 heap.hpp 中定义.