testNSearchLib.cpp File Reference

#include "testNSearchLib.h"
#include "nsearch/nsearch.h"
#include "util/function.h"
#include "util/matrix.h"
#include "util/methods.h"
#include "util/point.h"
#include "util/randomDist.h"
#include "util/parallelUtil.h"
#include <fmt/format.h>
#include <bitset>
#include <fstream>
#include <iostream>
#include <random>
#include <vector>
#include <taskflow/taskflow/taskflow.hpp>
#include <taskflow/taskflow/algorithm/for_each.hpp>

Include dependency graph for testNSearchLib.cpp:

Go to the source code of this file.

Namespaces
namespace	anonymous_namespace{testNSearchLib.cpp}

Functions
bool	anonymous_namespace{testNSearchLib.cpp}::isInList (const std::vector< size_t > *list, size_t i)
void	anonymous_namespace{testNSearchLib.cpp}::stats (const std::vector< double > &x, double &mean, double &std)
void	anonymous_namespace{testNSearchLib.cpp}::lattice (double L, size_t Nx, size_t Ny, size_t Nz, double dL, int seed, std::vector< util::Point > &x, int dim=3)
void	anonymous_namespace{testNSearchLib.cpp}::assignRandomTags (std::vector< util::Point > &x, int numTags, int seed, std::vector< size_t > &xTags)
template<class NSearch >
double	anonymous_namespace{testNSearchLib.cpp}::neighSearchTree (const std::vector< util::Point > &x, const std::unique_ptr< NSearch > &nsearch, const double &r, std::vector< std::vector< size_t > > &neigh, std::vector< std::vector< float > > &neigh_sq_dist)
template<class NSearch >
double	anonymous_namespace{testNSearchLib.cpp}::neighSearchTreeSizet (const std::vector< util::Point > &x, const std::unique_ptr< NSearch > &nsearch, const double &r, std::vector< std::vector< size_t > > &neigh, std::vector< std::vector< float > > &neigh_sq_dist)
template<class NSearch >
double	anonymous_namespace{testNSearchLib.cpp}::neighSearchTreeSizetExcludeInclude (const std::vector< util::Point > &x, const std::vector< size_t > &xTags, const std::unique_ptr< NSearch > &nsearch, const double &r, std::vector< std::vector< size_t > > &neigh, std::vector< std::vector< float > > &neigh_sq_dist, int selection_criteria)
double	anonymous_namespace{testNSearchLib.cpp}::neighSearchBrute (const std::vector< util::Point > &x, const double &r, std::vector< std::vector< size_t > > &neigh, std::vector< std::vector< float > > &neigh_sq_dist)
double	anonymous_namespace{testNSearchLib.cpp}::neighSearchBruteExcludeInclude (const std::vector< util::Point > &x, const std::vector< size_t > &xTags, const double &r, std::vector< std::vector< size_t > > &neigh, std::vector< std::vector< float > > &neigh_sq_dist, int selection_criteria)
template<class NSearch >
double	anonymous_namespace{testNSearchLib.cpp}::neighSearchTreeClosestPointSizet (const std::vector< util::Point > &x, const std::unique_ptr< NSearch > &nsearch, const int &seed, const double &L, const double &dL, std::vector< util::Point > &search_points, std::vector< size_t > &err_points, std::vector< double > &err_dist)
std::string	anonymous_namespace{testNSearchLib.cpp}::compare_results (const std::vector< std::vector< size_t > > &neigh1, const std::vector< std::vector< size_t > > &neigh2, std::vector< std::string > tags, int check_nodes_num=-1, bool only_err_count=false)
std::string	anonymous_namespace{testNSearchLib.cpp}::compare_closest_point_results (const std::vector< util::Point > &x, const std::vector< util::Point > &search_points, const std::vector< size_t > &err_points, const std::vector< double > &err_dist, bool only_err_count=false)