#include <gdtp_queue.h>
Public Types | |
typedef heap_item | item |
Public Member Functions | |
const P & | prio (pq_item it) const |
const I & | inf (pq_item it) const |
pq_item | insert (const P &p, const I &i) |
pq_item | find_min () const |
void | decrease_p (pq_item it, const P &x) |
P | del_min () |
void | del_item (pq_item it) |
bool | empty () const |
heap_item | first_item () const |
heap_item | last_item () const |
heap_item | next_item (heap_item p) const |
heap_item | pred_item (heap_item p) const |
Definition at line 20 of file gdtp_queue.h.
typedef heap_item gdt::gdtp_queue< P, I, less >::item |
const P& gdt::gdtp_queue< P, I, less >::prio | ( | pq_item | it | ) | const [inline] |
Definition at line 26 of file gdtp_queue.h.
Referenced by gdt::gdtnode_pq< P >::inf(), and gdt::gdtnode_pq< P >::prio().
const I& gdt::gdtp_queue< P, I, less >::inf | ( | pq_item | it | ) | const [inline] |
Definition at line 31 of file gdtp_queue.h.
Referenced by gdt::gdtnode_pq< P >::find_min(), and gdt::gdtnode_pq< P >::get_nodes().
pq_item gdt::gdtp_queue< P, I, less >::insert | ( | const P & | p, | |
const I & | i | |||
) | [inline] |
Reimplemented from gdt::gdtbinary_heap2< P, I, less >.
Definition at line 35 of file gdtp_queue.h.
Referenced by gdt::gdtnode_pq< P >::insert().
pq_item gdt::gdtp_queue< P, I, less >::find_min | ( | ) | const [inline] |
Reimplemented in gdt::gdtnode_pq< P >.
Definition at line 39 of file gdtp_queue.h.
Referenced by gdt::gdtnode_pq< P >::find_min().
void gdt::gdtp_queue< P, I, less >::decrease_p | ( | pq_item | it, | |
const P & | x | |||
) | [inline] |
Definition at line 43 of file gdtp_queue.h.
Referenced by gdt::gdtnode_pq< P >::decrease_inf(), and gdt::gdtnode_pq< P >::decrease_p().
P gdt::gdtp_queue< P, I, less >::del_min | ( | ) | [inline] |
Reimplemented in gdt::gdtnode_pq< P >.
Definition at line 47 of file gdtp_queue.h.
Referenced by gdt::gdtnode_pq< P >::del_min().
void gdt::gdtp_queue< P, I, less >::del_item | ( | pq_item | it | ) | [inline] |
Definition at line 55 of file gdtp_queue.h.
Referenced by gdt::gdtnode_pq< P >::del().
bool gdt::gdtp_queue< P, I, less >::empty | ( | ) | const [inline] |
Definition at line 59 of file gdtp_queue.h.
heap_item gdt::gdtp_queue< P, I, less >::first_item | ( | ) | const [inline] |
heap_item gdt::gdtp_queue< P, I, less >::last_item | ( | ) | const [inline] |
heap_item gdt::gdtp_queue< P, I, less >::next_item | ( | heap_item | p | ) | const [inline] |
heap_item gdt::gdtp_queue< P, I, less >::pred_item | ( | heap_item | p | ) | const [inline] |