File pairing_queue.hpp¶
-
namespace
find_embedding
-
class
max_heap_tag
- #include <pairing_queue.hpp>
-
class
min_heap_tag
- #include <pairing_queue.hpp>
-
template<typename
N
>
classpairing_node
: public N - #include <pairing_queue.hpp>
Public Functions
-
pairing_node
()¶
-
pairing_node<N> *
merge_roots
(pairing_node<N> *other) the basic operation of the pairing queue put
this
andother
into heap-order
-
pairing_node<N> *
next_root
()¶
-
pairing_node<N> *
merge_pairs
()¶
Private Functions
-
pairing_node<N> *
merge_roots_unsafe
(pairing_node<N> *other)¶ the basic operation of the pairing queue put
this
andother
into heap-order
-
pairing_node<N> *
merge_roots_unchecked
(pairing_node *other)¶ merge_roots, assuming
other
is not null and thatval
<other->val
.may invalidate the internal data structure (see source for details)
-
-
template<typename
N
>
classpairing_queue
- #include <pairing_queue.hpp>
-
template<typename
P
, typenameheap_tag
= min_heap_tag>
classpriority_node
- #include <pairing_queue.hpp>
-
class