Method fetchNext

src/core/model/fileproxymodeliterator.cpp:99–145

* Fetch next index. */

 * Fetch next index.
 */
void FileProxyModelIterator::fetchNext()
{
  int count = 0;
  while (!m_aborted) {
    if (m_nodes.isEmpty()) {
      if (m_rootIndexes.isEmpty()) {
        break;
      }
      m_nodes.push(m_rootIndexes.takeFirst());
    }
    m_nextIdx = m_nodes.top();
    if (m_nextIdx.isValid()) {
      if (m_model->isDir(m_nextIdx) && m_model->canFetchMore(m_nextIdx)) {
        connect(m_model, &FileProxyModel::sortingFinished,
                this, &FileProxyModelIterator::onDirectoryLoaded);
        m_model->fetchMore(m_nextIdx);
        return;
      }
      if (++count >= 10) {
        // Avoid spinning too long to keep the GUI responsive.
        QTimer::singleShot(0, this, &FileProxyModelIterator::fetchNext);
        return;
      }
      m_nodes.pop();
      ++m_numDone;
      const int numRows = m_model->rowCount(m_nextIdx);
      QStack<QPersistentModelIndex> childNodes;
      childNodes.reserve(numRows);
      for (int row = numRows - 1; row >= 0; --row) {
        childNodes.push(m_model->index(row, 0, m_nextIdx));
      }
      std::stable_sort(childNodes.begin(), childNodes.end(),
                  [](const QPersistentModelIndex& lhs,
                     const QPersistentModelIndex& rhs) {
        return lhs.data().toString().compare(rhs.data().toString()) > 0;
      });
      m_nodes += childNodes;
      emit nextReady(m_nextIdx);
    } else {
      m_nodes.pop();
    }
  }
  m_nodes.clear();
  m_rootIndexes.clear();
  m_nextIdx = QPersistentModelIndex();
  emit nextReady(m_nextIdx);
}

/**
 * Called when the gatherer thread has finished to load.