Heap.h File Reference

#include "functional_base.h"
#include "Platform.h"
#include "type_traits.h"

Include dependency graph for Heap.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Namespaces
namespace	dyno
	This is an implementation of AdditiveCCD based on peridyno.

Functions
template<typename RandomAccessIterator, typename Distance, typename T, typename Compare, typename ValueType>
DYN_FUNC void	dyno::promote_heap_impl (RandomAccessIterator first, Distance topPosition, Distance position, T value, Compare compare)
	promote_heap_implementation
template<typename RandomAccessIterator, typename Distance, typename T, typename Compare>
DYN_FUNC void	dyno::promote_heap (RandomAccessIterator first, Distance topPosition, Distance position, const T &value, Compare compare)
template<typename RandomAccessIterator, typename Distance, typename T, typename Compare>
DYN_FUNC void	dyno::promote_heap (RandomAccessIterator first, Distance topPosition, Distance position, T &&value, Compare compare)
template<typename RandomAccessIterator, typename Distance, typename T, typename Compare, typename ValueType>
DYN_FUNC void	dyno::adjust_heap_impl (RandomAccessIterator first, Distance topPosition, Distance heapSize, Distance position, T value, Compare compare)
	adjust heap implementation
template<typename RandomAccessIterator, typename Distance, typename T, typename Compare>
DYN_FUNC void	dyno::adjust_heap (RandomAccessIterator first, Distance topPosition, Distance heapSize, Distance position, const T &value, Compare compare)
template<typename RandomAccessIterator, typename Distance, typename T, typename Compare>
DYN_FUNC void	dyno::adjust_heap (RandomAccessIterator first, Distance topPosition, Distance heapSize, Distance position, T &&value, Compare compare)
template<typename RandomAccessIterator, typename Compare>
DYN_FUNC void	dyno::push_heap (RandomAccessIterator first, RandomAccessIterator last, Compare compare)
template<typename RandomAccessIterator, typename Compare>
DYN_FUNC void	dyno::pop_heap (RandomAccessIterator first, RandomAccessIterator last, Compare compare)
template<typename RandomAccessIterator, typename Compare>
DYN_FUNC void	dyno::make_heap (RandomAccessIterator first, RandomAccessIterator last, Compare compare)
template<typename RandomAccessIterator, typename Compare>
DYN_FUNC void	dyno::sort_heap (RandomAccessIterator first, RandomAccessIterator last, Compare compare)
template<typename RandomAccessIterator, typename Distance, typename Compare>
DYN_FUNC void	dyno::remove_heap (RandomAccessIterator first, Distance heapSize, Distance position, Compare compare)
template<typename RandomAccessIterator, typename Distance, typename Compare>
DYN_FUNC void	dyno::change_heap (RandomAccessIterator first, Distance heapSize, Distance position, Compare compare)
template<typename RandomAccessIterator, typename Compare>
DYN_FUNC RandomAccessIterator	dyno::is_heap_until (RandomAccessIterator first, RandomAccessIterator last, Compare compare)
	is_heap_until
template<typename RandomAccessIterator>
DYN_FUNC bool	dyno::is_heap (RandomAccessIterator first, RandomAccessIterator last)