Lines Matching refs:m_aNodeStack

1042     sal_uLong n = m_aNodeStack.Count();  in Table()
1047 LineArray[n - (i + 1)] = m_aNodeStack.Pop(); in Table()
1051 m_aNodeStack.Push(pSNode); in Table()
1105 { pSNode->SetSubNodes(m_aNodeStack.Pop(), 0); in Align()
1106 m_aNodeStack.Push(pSNode); in Align()
1124 ExpressionArray[n - 1] = m_aNodeStack.Pop(); in Line()
1133 ExpressionArray[n - 1] = m_aNodeStack.Pop(); in Line()
1138 m_aNodeStack.Push(pSNode); in Line()
1145 SmNode *pNode = m_aNodeStack.Pop(); in Expression()
1151m_aNodeStack.Push(pNode); // push the node from above again (now to be used as argument to this c… in Expression()
1161 RelationArray[n - 1] = m_aNodeStack.Pop(); in Expression()
1166 RelationArray[n - 1] = m_aNodeStack.Pop(); in Expression()
1172 m_aNodeStack.Push(pSNode); in Expression()
1182 SmNode *pFirst = m_aNodeStack.Pop(); in Relation()
1185 SmNode *pSecond = m_aNodeStack.Pop(); in Relation()
1189 pSNode->SetSubNodes(pFirst, pSecond, m_aNodeStack.Pop()); in Relation()
1190 m_aNodeStack.Push(pSNode); in Relation()
1201 SmNode *pFirst = m_aNodeStack.Pop(); in Sum()
1204 SmNode *pSecond = m_aNodeStack.Pop(); in Sum()
1208 pSNode->SetSubNodes(pFirst, pSecond, m_aNodeStack.Pop()); in Sum()
1209 m_aNodeStack.Push(pSNode); in Sum()
1220 SmNode *pFirst = m_aNodeStack.Pop(), in Product()
1239 pOper = m_aNodeStack.Pop(); in Product()
1268 pOper = m_aNodeStack.Pop(); in Product()
1275 pSNode->SetSubNodes(pFirst, m_aNodeStack.Pop(), pOper); in Product()
1277 pSNode->SetSubNodes(pFirst, pOper, m_aNodeStack.Pop()); in Product()
1278 m_aNodeStack.Push(pSNode); in Product()
1303 aSubNodes[0] = m_aNodeStack.Pop(); in SubSup()
1343 aSubNodes[nIndex] = m_aNodeStack.Pop(); in SubSup()
1347 m_aNodeStack.Push(pNode); in SubSup()
1354 m_aNodeStack.Push(new SmMathSymbolNode(m_aCurToken)); in OpSubSup()
1390 m_aNodeStack.Push(pBlankNode); in Blank()
1408 m_aNodeStack.Push(new SmExpressionNode(m_aCurToken)); in Term()
1413 m_aNodeStack.Pop(); // get rid of the 'no space' node pushed above in Term()
1424 m_aNodeStack.Pop(); in Term()
1427 m_aNodeStack.Push(pSNode); in Term()
1453 m_aNodeStack.Push(new SmTextNode(m_aCurToken, FNT_TEXT)); in Term()
1458 m_aNodeStack.Push(new SmTextNode(m_aCurToken, FNT_VARIABLE)); in Term()
1462 m_aNodeStack.Push(new SmTextNode(m_aCurToken, FNT_NUMBER)); in Term()
1499 m_aNodeStack.Push(new SmMathSymbolNode(m_aCurToken)); in Term()
1504 m_aNodeStack.Push(new SmPlaceNode(m_aCurToken)); in Term()
1550 DBG_ASSERT(!m_aNodeStack.Top()->IsVisible(), "Sm : Ooops..."); in Term()
1552 aArray[n] = (SmStructureNode *) m_aNodeStack.Pop(); in Term()
1558 SmNode *pFirstNode = m_aNodeStack.Pop(); in Term()
1564 m_aNodeStack.Push(pFirstNode); in Term()
1580 SmNode *pFunc = m_aNodeStack.Pop(); in Term()
1593 pSNode->SetSubNodes(pFunc, m_aNodeStack.Pop()); in Term()
1594 m_aNodeStack.Push(pSNode); in Term()
1634 m_aNodeStack.Push(pNode); in Escape()
1650 SmNode *pOperator = m_aNodeStack.Pop(); in Operator()
1655 pSNode->SetSubNodes(pOperator, m_aNodeStack.Pop()); in Operator()
1656 m_aNodeStack.Push(pSNode); in Operator()
1714 m_aNodeStack.Push(pNode); in Oper()
1743 pExtra = m_aNodeStack.Pop(); in UnOper()
1749 pOper = m_aNodeStack.Pop(); in UnOper()
1759 pOper = m_aNodeStack.Pop(); in UnOper()
1768 pArg = m_aNodeStack.Pop(); in UnOper()
1802 m_aNodeStack.Push(pSNode); in UnOper()
1838 m_aNodeStack.Push(pSNode); in Attribut()
1853 m_aNodeStack.Push(new SmFontNode(m_aCurToken)); in FontAttribut()
1892 m_aNodeStack.Push(new SmFontNode(aToken)); in Color()
1913 m_aNodeStack.Push(new SmFontNode(aToken)); in Font()
2004 m_aNodeStack.Push(pFontNode); in FontSize()
2032 pBody = m_aNodeStack.Pop(); in Brace()
2060 pBody = m_aNodeStack.Pop(); in Brace()
2094 m_aNodeStack.Push(pSNode); in Brace()
2120 m_aNodeStack.Push(new SmMathSymbolNode(m_aCurToken)); in Bracebody()
2139 m_aNodeStack.Push(new SmMathSymbolNode(m_aCurToken)); in Bracebody()
2156 aNodes[nNum - 1 - i] = m_aNodeStack.Pop(); in Bracebody()
2160 m_aNodeStack.Push(pBody); in Bracebody()
2191 m_aNodeStack.Push(new SmTextNode(m_aCurToken, FNT_FUNCTION)); in Function()
2214 ExpressionArray[2 - (i + 1)] = m_aNodeStack.Pop(); in Binom()
2217 m_aNodeStack.Push(pSNode); in Binom()
2240 ExpressionArray[n - (i + 1)] = m_aNodeStack.Pop(); in Stack()
2249 m_aNodeStack.Push(pSNode); in Stack()
2300 ExpressionArray[(nRC) - (i + 1)] = m_aNodeStack.Pop(); in Matrix()
2310 m_aNodeStack.Push(pMNode); in Matrix()
2392 m_aNodeStack.Push(new SmSpecialNode(m_aCurToken)); in Special()
2399 m_aNodeStack.Push(new SmGlyphSpecialNode(m_aCurToken)); in GlyphSpecial()
2413 m_aNodeStack.Push(pSNode); in Error()
2449 m_aNodeStack.Clear(); in Parse()
2455 return m_aNodeStack.Pop(); in Parse()