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

  /external/pdfium/xfa/src/fdp/src/css/
fde_csscache.h 68 void Clear() { m_Stack.RemoveAll(); }
69 FDE_LPCSSTAGCACHE GetTopElement() const { return m_Stack.GetTopElement(); }
72 CFDE_CSSTagStack m_Stack;
fde_csscache.cpp 141 m_Stack.Push(item);
144 FDE_CSSTAGCACHE* pItem = m_Stack.GetTopElement();
146 m_Stack.Pop();
  /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;
  /external/pdfium/core/src/fpdfapi/fpdf_page/
fpdf_page_func.cpp 88 FX_FLOAT m_Stack[PSENGINE_STACKSIZE];
144 m_Stack[m_StackCount++] = v;
150 return m_Stack[--m_StackCount];
404 m_Stack[m_StackCount + i] = m_Stack[m_StackCount + i - n];
414 Push(m_Stack[m_StackCount - n - 1]);
428 FX_FLOAT first = m_Stack[m_StackCount - n];
430 m_Stack[m_StackCount - n + ii] = m_Stack[m_StackCount - n + ii + 1];
432 m_Stack[m_StackCount - 1] = first
    [all...]

Completed in 234 milliseconds