![]() |
QuickRank
v2.0
QuickRank: A C++ suite of Learning to Rank algorithms
|
#include <rt.h>
Public Member Functions | |
| DevianceMaxHeap (unsigned int initsize) | |
| void | push_chidrenof (RTNode *parent) |
| void | pop () |
Public Member Functions inherited from MaxHeap< val_t > | |
| MaxHeap (size_t initsize=0) | |
| default constructor More... | |
| ~MaxHeap () | |
| bool | is_notempty () const |
| return true if heap is empty More... | |
| size_t | get_size () const |
| return numebr of items stored in the heap More... | |
| void | push (const double &key, const val_t &val) |
| push a new element in the heap and resize the data structure if it is full More... | |
| void | pop () |
| remove the element on the top of the heap, i.e. More... | |
| val_t & | top () const |
| ref to the top element More... | |
Additional Inherited Members | |
Protected Attributes inherited from MaxHeap< val_t > | |
| item * | arr |
| size_t | arrsize |
| size_t | maxsize |
|
inline |
| void DevianceMaxHeap::pop | ( | ) |
| void DevianceMaxHeap::push_chidrenof | ( | RTNode * | parent | ) |
1.8.11