#include <named_function_params.hpp>
Public Types | |
typedef std::vector< ValueT > ::size_type | default_index_in_heap_type |
typedef map_maker< Graph, ArgPack, IndexInHeapMapTag, default_index_in_heap_type > ::helper::map_type | index_in_heap_map |
typedef boost::d_ary_heap_indirect < ValueT, 4, index_in_heap_map, typename map_maker< Graph, ArgPack, KeyMapTag, KeyT > ::helper::map_type, Compare > | priority_queue_type |
Static Public Member Functions | |
static priority_queue_type | make_queue (const Graph &g, const ArgPack &ap, KeyT defaultKey, const Q &) |
typedef std::vector<ValueT>::size_type boost::detail::priority_queue_maker_helper< false, Graph, ArgPack, KeyT, ValueT, KeyMapTag, IndexInHeapMapTag, Compare, Q >::default_index_in_heap_type |
typedef map_maker<Graph, ArgPack, IndexInHeapMapTag, default_index_in_heap_type>::helper::map_type boost::detail::priority_queue_maker_helper< false, Graph, ArgPack, KeyT, ValueT, KeyMapTag, IndexInHeapMapTag, Compare, Q >::index_in_heap_map |
typedef boost::d_ary_heap_indirect<ValueT, 4, index_in_heap_map, typename map_maker<Graph, ArgPack, KeyMapTag, KeyT>::helper::map_type, Compare> boost::detail::priority_queue_maker_helper< false, Graph, ArgPack, KeyT, ValueT, KeyMapTag, IndexInHeapMapTag, Compare, Q >::priority_queue_type |
|
inlinestatic |