Method init

src/CompactNSearch.cpp:78–115

Build hash table and entry array from scratch.

// Build hash table and entry array from scratch.
void
NeighborhoodSearch::init()
{
	m_entries.clear();
	m_map.clear();

	// Determine existing entries.
	std::vector<HashKey> temp_keys;
	for (unsigned int j = 0; j < m_point_sets.size(); ++j)
	{
		PointSet& d = m_point_sets[j];
		d.m_locks.resize(d.n_points());
		for (unsigned int i = 0; i < d.n_points(); i++)
		{
			HashKey const& key = cell_index(d.point(i));
			d.m_keys[i] = d.m_old_keys[i] = key;
			auto it = m_map.find(key);
			if (it == m_map.end())
			{
				m_entries.push_back({{ j, i }});
				temp_keys.push_back(key);
				m_map[key] = static_cast<unsigned int>(m_entries.size() - 1);
			}
			else
			{
				m_entries[it->second].add({j, i});
			}
		}
	}

	m_map.clear();
	for (unsigned int i = 0; i < m_entries.size(); ++i)
	{
		m_map.emplace(temp_keys[i], i);
	}

	m_initialized = true;
}


void