Remove all elements in the set */

Copy the set to two C arrays * @param indices pointer to a C array of indices * @param dist pointer to a C array of distances * @param

@brief Rounds floating-point number to the nearest integer not smaller than the original. The function computes an integer i such that: \f[i \le \t

Returns true if the any contains no value.

front() and back()

Get a bucket given the key * @param key * @return */

* Initializes the number generator. * @param n the size of the interval from which to generate random numbers. */

returns "magic" border value for erosion and dilation. It is automatically transformed to Scalar::all(-DBL_MAX) for dilation.

* Return a distinct random integer in greater or equal to 0 and less * than 'n' on each call. It should be called maximum 'n' times. * Retur

* Returns the node of minimum value from the heap (top of the heap). * * Params: * value = out parameter used to return the min ele

This method has no effects in this class, but raises an exception if the expected size does not match */

set a bit to true * @param index the index of the bit to set to 1 */

* Number of features in this index. */

Copy the set to two C arrays but sort it according to the distance first * @param indices pointer to a C array of indices * @param dist poin

<summary> Clean up any resources being used. </summary> <param name="disposing">true if managed resources should be disposed; otherwise, false.</param

<summary> Draws a 32 bit per pixel image of previously specified width, height, and stride to the associated hwnd </summary> <param name="pImage">imag

* Method responsible with building the index. */

@brief Clears the algorithm state */

@brief Rounds floating-point number to the nearest integer not larger than the original. The function computes an integer i such that: \f[i \le \te

Inline constructor. No data is allocated internally!!! * (Use together with cvCreateData, or use cvCreateMat instead to * get a matrix with allocate

* Find set of nearest neighbors to vec. Their indices are stored inside * the result object. * * Params: * result = the result

* Algorithm name */

* Generates a random double value. */ * Generates a random double value. * @param high Upper limit * @param low Lower limit * @return Random doubl

Frees any allocated memory, and sets the value to NULL.

check if a bit is set * @param index the index of the bit to check * @return true if the bit is set */

* The amount of memory (in bytes) this index uses. */