This class implements a simplified bucket heap data structure. It does not provide some functionality but it faster and simplier data structure than the BucketHeap. The main difference is that the BucketHeap stores for every key a double linked list while this class stores just simple lists. In the other way it does not support erasing each elements just the minimal and it does not supports key increasing, decreasing.
IM  A read and write Item int map, used internally to handle the cross references. 
MIN  If the given parameter is false then instead of the minimum value the maximum can be retrivied with the top() and prio() member functions. 
#include <lemon/bucket_heap.h>
Public Types  
enum  State { IN_HEAP = 0, PRE_HEAP = 1, POST_HEAP = 2 } 
Type to represent the items states. More...  
Public Member Functions  
SimpleBucketHeap (ItemIntMap &map)  
The constructor.  
int  size () const 
Returns the number of items stored in the heap.  
bool  empty () const 
Checks if the heap stores no items.  
void  clear () 
Make empty this heap.  
void  push (const Pair &p) 
Insert a pair of item and priority into the heap.  
void  push (const Item &i, const Prio &p) 
Insert an item into the heap with the given priority.  
Item  top () const 
Returns the item with minimum priority.  
Prio  prio () const 
Returns the minimum priority.  
void  pop () 
Deletes the item with minimum priority.  
Prio  operator[] (const Item &i) const 
Returns the priority of i .  
State  state (const Item &i) const 
Returns if item is in, has already been in, or has never been in the heap.  
enum State 
Each Item element have a state associated to it. It may be "in heap", "pre heap" or "post heap". The latter two are indifferent from the heap's point of view, but may be useful to the user.
The itemint map must be initialized in such way that it assigns PRE_HEAP
(1
) to any element to be put in the heap.

inlineexplicit 
The constructor.
map  should be given to the constructor, since it is used internally to handle the cross references. The value of the map should be PRE_HEAP (1) for each element. 

inline 
The number of items stored in the heap.

inline 
Returns true
if and only if the heap stores no items.

inline 
Make empty this heap. It does not change the cross reference map. If you want to reuse a heap what is not surely empty you should first clear the heap and after that you should set the cross reference map for each item to PRE_HEAP
.

inline 
Adds p.first
to the heap with priority p.second
.
p  The pair to insert. 

inline 
Adds i
to the heap with priority p
.
i  The item to insert. 
p  The priority of the item. 

inline 
This method returns the item with minimum priority.

inline 
It returns the minimum priority.

inline 
This method deletes the item with minimum priority from the heap.

inline 
This function returns the priority of item i
.
i
must be in the heap. i  The item. 

inline 
This method returns PRE_HEAP if item
has never been in the heap, IN_HEAP if it is in the heap at the moment, and POST_HEAP otherwise. In the latter case it is possible that item
will get back to the heap again.
i  The item. 