Boost  v1.57.0
doxygen for www.boost.org
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Modules Pages
Classes | Public Types | Public Member Functions | List of all members
boost::relaxed_heap< IndexedType, Compare, ID > Class Template Reference

#include <relaxed_heap.hpp>

Inheritance diagram for boost::relaxed_heap< IndexedType, Compare, ID >:
Inheritance graph
[legend]

Public Types

typedef IndexedType value_type
 
typedef rank_type size_type
 

Public Member Functions

 relaxed_heap (size_type n, const Compare &compare=Compare(), const ID &id=ID())
 
 ~relaxed_heap ()
 
void push (const value_type &x)
 
void update (const value_type &x)
 
void remove (const value_type &x)
 
value_type & top ()
 
const value_type & top () const
 
bool empty () const
 
bool contains (const value_type &x) const
 
void pop ()
 

Member Typedef Documentation

template<typename IndexedType, typename Compare = std::less<IndexedType>, typename ID = identity_property_map>
typedef rank_type boost::relaxed_heap< IndexedType, Compare, ID >::size_type
template<typename IndexedType, typename Compare = std::less<IndexedType>, typename ID = identity_property_map>
typedef IndexedType boost::relaxed_heap< IndexedType, Compare, ID >::value_type

Constructor & Destructor Documentation

template<typename IndexedType, typename Compare = std::less<IndexedType>, typename ID = identity_property_map>
boost::relaxed_heap< IndexedType, Compare, ID >::relaxed_heap ( size_type  n,
const Compare &  compare = Compare(),
const ID &  id = ID() 
)
inline
template<typename IndexedType, typename Compare = std::less<IndexedType>, typename ID = identity_property_map>
boost::relaxed_heap< IndexedType, Compare, ID >::~relaxed_heap ( )
inline

Member Function Documentation

template<typename IndexedType, typename Compare = std::less<IndexedType>, typename ID = identity_property_map>
bool boost::relaxed_heap< IndexedType, Compare, ID >::contains ( const value_type &  x) const
inline

Referenced by boost::graph::distributed::detail::crauser_et_al_dijkstra_queue< Graph, Combine, Compare, VertexIndexMap, DistanceMap, PredecessorMap, MinOutWeightMap, MinInWeightMap >::receive_update().

template<typename IndexedType, typename Compare = std::less<IndexedType>, typename ID = identity_property_map>
bool boost::relaxed_heap< IndexedType, Compare, ID >::empty ( void  ) const
inline

Referenced by boost::graph::distributed::detail::crauser_et_al_dijkstra_queue< Graph, Combine, Compare, VertexIndexMap, DistanceMap, PredecessorMap, MinOutWeightMap, MinInWeightMap >::do_synchronize().

template<typename IndexedType, typename Compare = std::less<IndexedType>, typename ID = identity_property_map>
void boost::relaxed_heap< IndexedType, Compare, ID >::pop ( void  )
inline

Referenced by boost::relaxed_heap< vertex_descriptor, queue_compare_type, VertexIndexMap >::remove().

template<typename IndexedType, typename Compare = std::less<IndexedType>, typename ID = identity_property_map>
void boost::relaxed_heap< IndexedType, Compare, ID >::push ( const value_type &  x)
inline

Referenced by boost::graph::distributed::detail::crauser_et_al_dijkstra_queue< Graph, Combine, Compare, VertexIndexMap, DistanceMap, PredecessorMap, MinOutWeightMap, MinInWeightMap >::receive_update().

template<typename IndexedType, typename Compare = std::less<IndexedType>, typename ID = identity_property_map>
void boost::relaxed_heap< IndexedType, Compare, ID >::remove ( const value_type &  x)
inline

Referenced by boost::graph::distributed::detail::crauser_et_al_dijkstra_queue< Graph, Combine, Compare, VertexIndexMap, DistanceMap, PredecessorMap, MinOutWeightMap, MinInWeightMap >::pop().

template<typename IndexedType, typename Compare = std::less<IndexedType>, typename ID = identity_property_map>
value_type& boost::relaxed_heap< IndexedType, Compare, ID >::top ( void  )
inline

Referenced by boost::graph::distributed::detail::crauser_et_al_dijkstra_queue< Graph, Combine, Compare, VertexIndexMap, DistanceMap, PredecessorMap, MinOutWeightMap, MinInWeightMap >::do_synchronize().

template<typename IndexedType, typename Compare = std::less<IndexedType>, typename ID = identity_property_map>
const value_type& boost::relaxed_heap< IndexedType, Compare, ID >::top ( void  ) const
inline
template<typename IndexedType, typename Compare = std::less<IndexedType>, typename ID = identity_property_map>
void boost::relaxed_heap< IndexedType, Compare, ID >::update ( const value_type &  x)
inline

Referenced by boost::relaxed_heap< vertex_descriptor, queue_compare_type, VertexIndexMap >::push(), and boost::graph::distributed::detail::crauser_et_al_dijkstra_queue< Graph, Combine, Compare, VertexIndexMap, DistanceMap, PredecessorMap, MinOutWeightMap, MinInWeightMap >::receive_update().

The documentation for this class was generated from the following file: