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

  /frameworks/compile/mclinker/include/mcld/ADT/
BinTree.h 37 m_Stack.push(m_pNode->right);
39 m_Stack.push(m_pNode->left);
46 if (m_Stack.empty()) { // reach the end
50 m_pNode = m_Stack.top();
51 m_Stack.pop();
53 m_Stack.push(m_pNode->right);
55 m_Stack.push(m_pNode->left);
59 std::stack<NodeBase *> m_Stack;
  /external/pdfium/core/src/fpdfapi/fpdf_page/
fpdf_page_func.cpp 55 FX_FLOAT m_Stack[PSENGINE_STACKSIZE];
119 m_Stack[m_StackCount++] = v;
126 return m_Stack[--m_StackCount];
375 m_Stack[m_StackCount + i] = m_Stack[m_StackCount + i - n];
385 Push(m_Stack[m_StackCount - n - 1]);
399 FX_FLOAT first = m_Stack[m_StackCount - n];
401 m_Stack[m_StackCount - n + ii] = m_Stack[m_StackCount - n + ii + 1];
403 m_Stack[m_StackCount - 1] = first;
    [all...]

Completed in 222 milliseconds