@brief Returns the particular element of single-channel floating-point matrix. The function is a fast replacement for cvGetReal2D in the case of sing

@brief Sets a specific element of a single-channel floating-point matrix. The function is a fast replacement for cvSetReal2D in the case of single-ch

@brief Add a filled in DMatch \<dmatch\> to debug GUI. The matches can are visualized for interactive inspection in different GUI views (one similar

* @brief Use the debug-framework to compare two images (from which the second * is intended to be the result of * a filter applied to the first). *

Wrapper to allocate data by template

Method responsible for generating the disparity map function for generating disparity maps at sub pixel level costVolume - represents the cost volume

@return Distance map that's created during working of the method. */

@brief Integer division with result round up. Use this function instead of `ceil((float)a / b)` expressions. @sa alignSize */

* Create a tree node that subdivides the list of vecs from vind[first] * to vind[last]. The routine is called recursively on each sublist.

* Create a tree node that subdivides the list of vecs from vind[first] * to vind[last]. The routine is called recursively on each sublist.

Returns the eigenvalues of this LDA. */

Returns the eigenvectors of this LDA. */

@brief Returns the matrix element size in bytes. The method returns the matrix element size in bytes. For example, if the matrix type is CV_1

@brief Returns true if the Algorithm is empty (e.g. in the very beginning or after unsuccessful read */

* Tests if the heap is empty * * Returns: true is heap empty, false otherwise */

@brief checks if the bitset is empty * @return true if the bitset is empty */

@brief Difference between 1 and next representable value */

reserve menory for an UINT32 */

* Chooses the best nearest-neighbor algorithm and estimates the optimal * parameters to use when building the index (for a given precision).

* Estimates the search time parameters needed to get the desired precision. * Precondition: the index is built * Postcondition: the searc

* Helper function that computes the nearest childs of a node to a given query point. * Params: * node = the node * q = the quer