Method erase_empty_entries

src/CompactNSearch.cpp:176–232

}

void
NeighborhoodSearch::erase_empty_entries(std::vector<unsigned int> const& to_delete)
{
	if (to_delete.empty())
		return;

	// Indicated empty cells.
	m_entries.erase(std::remove_if(m_entries.begin(), m_entries.end(), [](HashEntry const& entry)
	{
		return entry.indices.empty();
	}), m_entries.end());

	{
		auto it = m_map.begin();
		while (it != m_map.end())
		{
			auto& kvp = *it;

			if (kvp.second <= to_delete.front() && kvp.second >= to_delete.back() &&
				std::binary_search(to_delete.rbegin(), to_delete.rend(), kvp.second))
			{
				it = m_map.erase(it);
			}
			else
			{
				++it;
			}
		}
	}

	std::vector<std::pair<HashKey const, unsigned int>*> kvps(m_map.size());
	std::transform(m_map.begin(), m_map.end(), kvps.begin(),
	[](std::pair<HashKey const, unsigned int>& 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>* kvp_)
	{
		auto& kvp = *kvp_;

		for (unsigned int i = 0; i < to_delete.size(); ++i)
		{
			if (kvp.second >= to_delete[i])
			{
				kvp.second -= static_cast<unsigned int>(to_delete.size() - i);
				break;
			}
		}
	});
}