Method query

src/CompactNSearch.cpp:278–452

}

void
NeighborhoodSearch::query()
{
	for (PointSet& d : m_point_sets)
	{
		if (d.is_neighborsearch_enabled())
		{
			for (auto& n : d.m_neighbors)
			{
				n.clear();
			}
		}
	}

	std::vector<std::pair<HashKey const, unsigned int> const*> kvps(m_map.size());
	std::transform(m_map.begin(), m_map.end(), kvps.begin(),
	[](std::pair<HashKey const, unsigned int> const& kvp)
	{
		return &kvp;
	});

	// Perform neighborhood search.
#ifdef _MSC_VER
	concurrency::parallel_for_each
#else
	__gnu_parallel::for_each
#endif
	(kvps.begin(), kvps.end(), [&](std::pair<HashKey const, unsigned int> const* kvp_)
	{
		auto const& kvp = *kvp_;
		HashEntry const& entry = m_entries[kvp.second];
		HashKey const& key = kvp.first;

		for (unsigned int a = 0; a < entry.n_indices(); ++a)
		{
			PointID const& va = entry.indices[a];
			PointSet& da = m_point_sets[va.point_set_id];
			for (unsigned int b = a + 1; b < entry.n_indices(); ++b)
			{
				PointID const& vb = entry.indices[b];
				PointSet& db = m_point_sets[vb.point_set_id];

				if (!da.is_neighborsearch_enabled() && 
					!db.is_neighborsearch_enabled())
				{
					continue;
				}

				Real const* xa = da.point(va.point_id);
				Real const* xb = db.point(vb.point_id);
				Real tmp = xa[0] - xb[0];
				Real l2 = tmp * tmp;
				tmp = xa[1] - xb[1];
				l2 += tmp * tmp;
				tmp = xa[2] - xb[2];
				l2 += tmp * tmp;

				if (l2 < m_r2)