A.I.M.S algorithms


aims::knn::Heap Class Reference

#include <aims/math/knn.h>

Classes

class  MiniHeap
 

Public Member Functions

 Heap (unsigned int n)
 
virtual ~Heap ()
 
void exchange (unsigned int a, unsigned int b)
 
void erase_worst (void)
 
void insert (double key, const void *value)
 
std::pair< std::vector
< unsigned int >, std::vector
< double > > 
toVectors (const Database &_db)
 
const MiniHeapoperator[] (unsigned int ind) const
 
double get_worst_value ()
 

Detailed Description

Definition at line 450 of file knn.h.

Constructor & Destructor Documentation

aims::knn::Heap::Heap ( unsigned int  n)
inline

Definition at line 494 of file knn.h.

virtual aims::knn::Heap::~Heap ( )
inlinevirtual

Definition at line 497 of file knn.h.

Member Function Documentation

void aims::knn::Heap::erase_worst ( void  )
void aims::knn::Heap::exchange ( unsigned int  a,
unsigned int  b 
)
double aims::knn::Heap::get_worst_value ( )
inline

Definition at line 510 of file knn.h.

void aims::knn::Heap::insert ( double  key,
const void *  value 
)
const MiniHeap& aims::knn::Heap::operator[] ( unsigned int  ind) const
inline

Definition at line 505 of file knn.h.

std::pair<std::vector<unsigned int>, std::vector<double> > aims::knn::Heap::toVectors ( const Database _db)

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