#include <vector>
#include <cstddef>
#include <algorithm>
#include <utility>
Go to the source code of this file.
|
template<class T , class K , class V > |
void | put (T &pa, K k, const V &val) |
|
template<class K , class V > |
const V & | get (const std::map< K, V > &pa, K k) |
|
◆ get()
template<class K , class V >
const V & get |
( |
const std::map< K, V > & |
pa, |
|
|
K |
k |
|
) |
| |
|
inline |
Definition at line 69 of file d_ary_heap.h.
Referenced by d_ary_heap_indirect< Value, Arity, IndexInHeapPropertyMap, DistanceMap, Compare, Container >::contains(), d_ary_heap_indirect< Value, Arity, IndexInHeapPropertyMap, DistanceMap, Compare, Container >::push_or_update(), and d_ary_heap_indirect< Value, Arity, IndexInHeapPropertyMap, DistanceMap, Compare, Container >::update().
◆ put()
template<class T , class K , class V >
void put |
( |
T & |
pa, |
|
|
K |
k, |
|
|
const V & |
val |
|
) |
| |
|
inline |
Definition at line 66 of file d_ary_heap.h.
Referenced by d_ary_heap_indirect< Value, Arity, IndexInHeapPropertyMap, DistanceMap, Compare, Container >::pop(), d_ary_heap_indirect< Value, Arity, IndexInHeapPropertyMap, DistanceMap, Compare, Container >::push(), and d_ary_heap_indirect< Value, Arity, IndexInHeapPropertyMap, DistanceMap, Compare, Container >::push_or_update().