Lines Matching defs:m_clusters
166 ListOfClusters m_clusters; /**< \brief Partition of eigenvalues into clusters of ei'vals "close" to each other */
226 * This function computes #m_clusters. This is a partition of the
245 if (qi == m_clusters.end()) {
248 m_clusters.push_back(l);
249 qi = m_clusters.end();
257 if (qj == m_clusters.end()) {
261 m_clusters.erase(qj);
268 /** \brief Find cluster in #m_clusters containing some value
271 * \c m_clusters.end() if no cluster in m_clusters contains \c key.
277 for (typename ListOfClusters::iterator i = m_clusters.begin(); i != m_clusters.end(); ++i) {
282 return m_clusters.end();
285 /** \brief Compute #m_clusterSize and #m_eivalToCluster using #m_clusters */
291 const Index numClusters = static_cast<Index>(m_clusters.size());
296 for (typename ListOfClusters::const_iterator cluster = m_clusters.begin(); cluster != m_clusters.end(); ++cluster) {
