Implementation of d-ary heap, copied from boost/graph/detail/d_ary_heap.hpp and modified.
More...
|
| d_ary_heap_indirect (DistanceMap distance, IndexInHeapPropertyMap index_in_heap, const Compare &compare=Compare(), const Container &data=Container()) |
|
size_type | size () const |
|
bool | empty () const |
|
void | push (const Value &v) |
|
Value & | top () |
|
const Value & | top () const |
|
void | pop () |
|
void | update (const Value &v) |
|
bool | contains (const Value &v) const |
|
void | push_or_update (const Value &v) |
|
|
typedef Container::size_type | size_type |
|
typedef Value | value_type |
|
template<typename Value, std::size_t Arity, typename IndexInHeapPropertyMap, typename DistanceMap, typename Compare = std::less<Value>, typename Container = std::vector<Value>>
class stapl::sequential::d_ary_heap_indirect< Value, Arity, IndexInHeapPropertyMap, DistanceMap, Compare, Container >
Implementation of d-ary heap, copied from boost/graph/detail/d_ary_heap.hpp and modified.
The modifications of the class use put and get methods of a property map instead of free standing put and get functions that accept a property_map as a parameter.
The documentation for this class was generated from the following file: