MutablePriorityQueue.hpp File Reference

#include <assert.h>
#include <cstddef>
#include <limits>
#include <type_traits>
#include <utility>
#include <vector>

Include dependency graph for MutablePriorityQueue.hpp:

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

Go to the source code of this file.

Classes
class	MutablePriorityQueue< T, IndexSetter, LessPredicate, ResetIndexWhenRemoved >
struct	SkipHeapAddressing< blocking >
class	MutableSkipHeapPriorityQueue< T, IndexSetter, LessPredicate, blocking, ResetIndexWhenRemoved >

Functions
template<typename T, const bool ResetIndexWhenRemoved, typename IndexSetter, typename LessPredicate>
MutablePriorityQueue< T, IndexSetter, LessPredicate, ResetIndexWhenRemoved >	make_mutable_priority_queue (IndexSetter &&index_setter, LessPredicate &&less_predicate)
template<typename T, std::size_t BlockSize, const bool ResetIndexWhenRemoved, typename IndexSetter, typename LessPredicate>
MutableSkipHeapPriorityQueue< T, IndexSetter, LessPredicate, BlockSize, ResetIndexWhenRemoved >	make_miniheap_mutable_priority_queue (IndexSetter &&index_setter, LessPredicate &&less_predicate)

Variables
constexpr auto	InvalidQueueID = std::numeric_limits<size_t>::max()

Function Documentation

make_miniheap_mutable_priority_queue()

template<typename T, std::size_t BlockSize, const bool ResetIndexWhenRemoved, typename IndexSetter, typename LessPredicate>

MutableSkipHeapPriorityQueue< T, IndexSetter, LessPredicate, BlockSize, ResetIndexWhenRemoved > make_miniheap_mutable_priority_queue	(	IndexSetter &&	index_setter,
		LessPredicate &&	less_predicate )

{
    return MutableSkipHeapPriorityQueue<T, IndexSetter, LessPredicate, BlockSize, ResetIndexWhenRemoved>(
      std::forward<IndexSetter>(index_setter), std::forward<LessPredicate>(less_predicate));
}

Referenced by Slic3r::its_quadric_edge_collapse().

Here is the caller graph for this function:

make_mutable_priority_queue()

template<typename T, const bool ResetIndexWhenRemoved, typename IndexSetter, typename LessPredicate>

MutablePriorityQueue< T, IndexSetter, LessPredicate, ResetIndexWhenRemoved > make_mutable_priority_queue	(	IndexSetter &&	index_setter,
		LessPredicate &&	less_predicate )

{
    return MutablePriorityQueue<T, IndexSetter, LessPredicate, ResetIndexWhenRemoved>(
      std::forward<IndexSetter>(index_setter), std::forward<LessPredicate>(less_predicate));
}

Referenced by Slic3r::chain_segments_greedy_constrained_reversals2_(), and Slic3r::chain_segments_greedy_constrained_reversals_().

Here is the caller graph for this function:

Variable Documentation

InvalidQueueID

auto InvalidQueueID = std::numeric_limits<size_t>::max()

constexpr