ann_sample.cpp File Reference

#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <ANN/ANN.h>

Include dependency graph for ann_sample.cpp:

Go to the source code of this file.

Functions
void	getArgs (int argc, char **argv)
bool	readPt (istream &in, ANNpoint p)
void	printPt (ostream &out, ANNpoint p)
int	main (int argc, char **argv)

Variables
int	k = 1
int	dim = 2
double	eps = 0
int	maxPts = 1000
istream *	dataIn = NULL
istream *	queryIn = NULL

Function Documentation

void getArgs	(	int	argc,
		char **	argv
	)

int main	(	int	argc,
		char **	argv
	)

Definition at line 78 of file ann_sample.cpp.

References annAllocPt(), annAllocPts(), annClose(), ANNkd_tree::annkSearch(), dataIn, dim, eps, getArgs(), k, maxPts, printPt(), queryIn, and readPt().

{
        int                                     nPts;                                   // actual number of data points
        ANNpointArray           dataPts;                                // data points
        ANNpoint                        queryPt;                                // query point
        ANNidxArray                     nnIdx;                                  // near neighbor indices
        ANNdistArray            dists;                                  // near neighbor distances
        ANNkd_tree*                     kdTree;                                 // search structure

        getArgs(argc, argv);                                            // read command-line arguments

        queryPt = annAllocPt(dim);                                      // allocate query point
        dataPts = annAllocPts(maxPts, dim);                     // allocate data points
        nnIdx = new ANNidx[k];                                          // allocate near neigh indices
        dists = new ANNdist[k];                                         // allocate near neighbor dists

        nPts = 0;                                                                       // read data points

        cout << "Data Points:\n";
        while (nPts < maxPts && readPt(*dataIn, dataPts[nPts])) {
                printPt(cout, dataPts[nPts]);
                nPts++;
        }

        kdTree = new ANNkd_tree(                                        // build search structure
                                        dataPts,                                        // the data points
                                        nPts,                                           // number of points
                                        dim);                                           // dimension of space

        while (readPt(*queryIn, queryPt)) {                     // read query points
                cout << "Query point: ";                                // echo query point
                printPt(cout, queryPt);

                kdTree->annkSearch(                                             // search
                                queryPt,                                                // query point
                                k,                                                              // number of near neighbors
                                nnIdx,                                                  // nearest neighbors (returned)
                                dists,                                                  // distance (returned)
                                eps);                                                   // error bound

                cout << "\tNN:\tIndex\tDistance\n";
                for (int i = 0; i < k; i++) {                   // print summary
                        dists[i] = sqrt(dists[i]);                      // unsquare distance
                        cout << "\t" << i << "\t" << nnIdx[i] << "\t" << dists[i] << "\n";
                }
        }
    delete [] nnIdx;                                                    // clean things up
    delete [] dists;
    delete kdTree;
        annClose();                                                                     // done with ANN

        return EXIT_SUCCESS;
}

void printPt	(	ostream &	out,
		ANNpoint	p
	)

Definition at line 69 of file ann_sample.cpp.

References dim.

Referenced by main().

{
        out << "(" << p[0];
        for (int i = 1; i < dim; i++) {
                out << ", " << p[i];
        }
        out << ")\n";
}

bool readPt	(	istream &	in,
		ANNpoint	p
	)

Definition at line 61 of file ann_sample.cpp.

References dim.

Referenced by main().

{
        for (int i = 0; i < dim; i++) {
                if(!(in >> p[i])) return false;
        }
        return true;
}

Variable Documentation

istream* dataIn = NULL

Definition at line 58 of file ann_sample.cpp.

Referenced by main(), QUESO::SequenceOfVectors< V, M >::unifiedReadContents(), and QUESO::ScalarSequence< T >::unifiedReadContents().

int dim = 2

Definition at line 54 of file ann_sample.cpp.

double eps = 0

Definition at line 55 of file ann_sample.cpp.

Referenced by main().

int k = 1

Definition at line 53 of file ann_sample.cpp.

Referenced by ANNbruteForce::annkFRSearch(), ANNkd_tree::annkFRSearch(), ANNkd_tree::annkPriSearch(), ANNbruteForce::annkSearch(), ANNkd_tree::annkSearch(), annMedianSplit(), QUESO::ComputeCovCorrBetweenScalarSequences(), QUESO::ComputeCovCorrMatricesBetweenVectorRvs(), QUESO::ComputeCovCorrMatricesBetweenVectorSequences(), QUESO::ComputeSubGaussian2dKde(), QUESO::GpmsaComputerModel< S_V, S_M, D_V, D_M, P_V, P_M, Q_V, Q_M >::fillR_formula1_for_Sigma_u(), QUESO::GpmsaComputerModel< S_V, S_M, D_V, D_M, P_V, P_M, Q_V, Q_M >::fillR_formula1_for_Sigma_u_hat_u_asterisk(), QUESO::GpmsaComputerModel< S_V, S_M, D_V, D_M, P_V, P_M, Q_V, Q_M >::fillR_formula1_for_Sigma_uw(), QUESO::GpmsaComputerModel< S_V, S_M, D_V, D_M, P_V, P_M, Q_V, Q_M >::fillR_formula1_for_Sigma_w(), QUESO::GpmsaComputerModel< S_V, S_M, D_V, D_M, P_V, P_M, Q_V, Q_M >::fillR_formula1_for_Sigma_w_hat_u_asterisk(), QUESO::GpmsaComputerModel< S_V, S_M, D_V, D_M, P_V, P_M, Q_V, Q_M >::fillR_formula1_for_Sigma_w_hat_w_asterisk(), QUESO::GpmsaComputerModel< S_V, S_M, D_V, D_M, P_V, P_M, Q_V, Q_M >::fillR_formula2_for_Sigma_v(), QUESO::GpmsaComputerModel< S_V, S_M, D_V, D_M, P_V, P_M, Q_V, Q_M >::fillR_formula2_for_Sigma_v_hat_v_asterisk(), QUESO::ArrayOfSequences< V, M >::gaussianKDE(), QUESO::SampledScalarCdf< T >::inverse(), QUESO::GslMatrix::largestEigen(), QUESO::GPMSAEmulator< V, M >::lnValue(), main(), QUESO::GslMatrix::mpiSum(), QUESO::operator*(), QUESO::ScalarSequence< T >::parallelMerge(), QUESO::GslMatrix::smallestEigen(), QUESO::SubF1F2Gaussian2dKdeIntegral(), QUESO::ScalarSequence< T >::subGaussian1dKde(), QUESO::ScalarSequence< T >::unifiedGaussian1dKde(), QUESO::LagrangePolynomial1D1DFunction::value(), and QUESO::LagrangeBasis1D1DFunction::value().

int maxPts = 1000

Definition at line 56 of file ann_sample.cpp.

Referenced by annMaxPtsVisit(), and main().

istream* queryIn = NULL

Definition at line 59 of file ann_sample.cpp.

Referenced by main().