Lines Matching refs:m_pTreeTraversal
412 CPDF_Dictionary* pPages = m_pTreeTraversal[level].first;
415 m_pTreeTraversal.pop_back();
422 m_pTreeTraversal.pop_back();
427 for (size_t i = m_pTreeTraversal[level].second; i < pKidList->GetCount();
435 m_pTreeTraversal[level].second++;
439 m_pTreeTraversal[level].second++;
445 m_pTreeTraversal[level].second++;
452 if (m_pTreeTraversal.size() == level + 1)
453 m_pTreeTraversal.push_back(std::make_pair(pKid, 0));
454 // Now m_pTreeTraversal[level+1] should exist and be equal to pKid.
457 if (m_pTreeTraversal.size() == level + 1)
458 m_pTreeTraversal[level].second++;
460 if (m_pTreeTraversal.size() != level + 1 || *nPagesToGo == 0 ||
467 if (m_pTreeTraversal[level].second == pKidList->GetCount())
468 m_pTreeTraversal.pop_back();
475 m_pTreeTraversal.clear();
505 if (m_pTreeTraversal.empty()) {
507 m_pTreeTraversal.push_back(std::make_pair(pPages, 0));