HomeSort by relevance Sort by last modified time
    Searched refs:m_Stack (Results 1 - 5 of 5) sorted by null

  /external/pdfium/core/fxcrt/xml/
cfx_saxreader.cpp 123 m_Stack = std::stack<std::unique_ptr<CFX_SAXItem>>();
135 if (!m_Stack.empty())
136 pNew->m_bSkip = m_Stack.top()->m_bSkip;
137 m_Stack.push(std::move(pNew));
141 if (!m_Stack.empty())
142 m_Stack.pop();
146 return m_Stack.empty() ? nullptr : m_Stack.top().get();
203 m_Stack.push(pdfium::MakeUnique<CFX_SAXItem>(++m_dwItemID));
cfx_saxreader.h 157 std::stack<std::unique_ptr<CFX_SAXItem>> m_Stack;
  /external/pdfium/core/fpdfapi/page/
cpdf_psengine.cpp 182 m_Stack[m_StackCount++] = v;
186 return m_StackCount > 0 ? m_Stack[--m_StackCount] : 0;
400 m_Stack[m_StackCount + i] = m_Stack[m_StackCount + i - n];
408 Push(m_Stack[m_StackCount - n - 1]);
422 auto* begin_it = std::begin(m_Stack) + m_StackCount - n;
424 auto* end_it = std::begin(m_Stack) + m_StackCount;
cpdf_psengine.h 123 float m_Stack[kPSEngineStackSize];
  /frameworks/compile/mclinker/include/mcld/ADT/
BinTree.h 33 m_Stack.push(m_pNode->right);
35 m_Stack.push(m_pNode->left);
41 if (m_Stack.empty()) { // reach the end
45 m_pNode = m_Stack.top();
46 m_Stack.pop();
48 m_Stack.push(m_pNode->right);
50 m_Stack.push(m_pNode->left);
54 std::stack<NodeBase*> m_Stack;

Completed in 302 milliseconds