Method update_hash_table

src/CompactNSearch.cpp:234–276

}

void
NeighborhoodSearch::update_hash_table(std::vector<unsigned int>& to_delete)
{
	// Indicate points changing inheriting cell.
	for (unsigned int j = 0; j < m_point_sets.size(); ++j)
	{
		PointSet& d = m_point_sets[j];
		for (unsigned int i = 0; i < d.n_points(); ++i)
		{
			if (d.m_keys[i] == d.m_old_keys[i]) continue;

			HashKey const& key = d.m_keys[i];
			auto it = m_map.find(key);
			if (it == m_map.end())
			{
				m_entries.push_back({{j, i}});
				m_map.insert({ key, static_cast<unsigned int>(m_entries.size() - 1) });
			}
			else
			{
				HashEntry& entry = m_entries[it->second];
				entry.add({j, i});
			}

			unsigned int entry_index = m_map[d.m_old_keys[i]];
			m_entries[entry_index].erase({j, i});
			if (m_erase_empty_cells)
			{
				if (m_entries[entry_index].n_indices() == 0)
				{
					to_delete.push_back(entry_index);
				}
			}
		}
	}

	to_delete.erase(std::remove_if(to_delete.begin(), to_delete.end(),
	[&](unsigned int index)
	{
		return m_entries[index].n_indices() != 0;
	}), to_delete.end());
	std::sort(to_delete.begin(), to_delete.end(), std::greater<unsigned int>());
}

void
NeighborhoodSearch::query()