an adjacency list-like data structur for sample values
#include <SampleValueAdjacencyList.h>
|
void | quicksort (std::vector< SampleValue * > &oppneighs, UWORD32 *distances, unsigned int l, unsigned int r) |
|
unsigned int | partition (std::vector< SampleValue * > &oppneighs, UWORD32 *distances, unsigned int l, unsigned int r, UWORD32 x) |
|
void | swap (std::vector< SampleValue * > &oppneighs, UWORD32 *distances, unsigned int i, unsigned int j) |
|
◆ SampleValueAdjacencyList()
◆ getNumRows()
unsigned long SampleValueAdjacencyList::getNumRows |
( |
void |
| ) |
const |
|
inline |
◆ operator==()
check if every row contains the same set of sample values
◆ operator[]() [1/2]
◆ operator[]() [2/2]
◆ partition()
unsigned int SampleValueAdjacencyList::partition |
( |
std::vector< SampleValue * > & |
oppneighs, |
|
|
UWORD32 * |
distances, |
|
|
unsigned int |
l, |
|
|
unsigned int |
r, |
|
|
UWORD32 |
x |
|
) |
| |
|
private |
partition oppneighs/distances into those with distances less than and those with distances greater than and equal to x
- Returns
- the index in oppneighs/distances that separates the two
◆ quicksort()
void SampleValueAdjacencyList::quicksort |
( |
std::vector< SampleValue * > & |
oppneighs, |
|
|
UWORD32 * |
distances, |
|
|
unsigned int |
l, |
|
|
unsigned int |
r |
|
) |
| |
|
private |
◆ sort()
void SampleValueAdjacencyList::sort |
( |
void |
| ) |
|
sort the list in a way that the first entry of a row has the least distance to source sample value
◆ swap()
void SampleValueAdjacencyList::swap |
( |
std::vector< SampleValue * > & |
oppneighs, |
|
|
UWORD32 * |
distances, |
|
|
unsigned int |
i, |
|
|
unsigned int |
j |
|
) |
| |
|
private |
◆ AdjacencyList
std::vector<std::vector<SampleValue*> > SampleValueAdjacencyList::AdjacencyList |
|
private |
The documentation for this class was generated from the following files: