#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) |
| template<class V> |
| const V & | get (const std::vector< V > &pa, std::size_t k) |
◆ get() [1/2]
template<class K, class V>
| const V & get |
( |
const std::map< K, V > & | pa, |
|
|
K | k ) |
|
inline |
Definition at line 70 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().
◆ get() [2/2]
template<class V>
| const V & get |
( |
const std::vector< V > & | pa, |
|
|
std::size_t | k ) |
|
inline |
◆ put()
template<class T, class K, class V>
| void put |
( |
T & | pa, |
|
|
K | k, |
|
|
const V & | val ) |
|
inline |
Definition at line 67 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().