Home
last modified time | relevance | path

Searched refs:iStack (Results 1 – 25 of 32) sorted by relevance

12

/dports/devel/glrparser/glrparser-1.4/glr/
H A DglrStack.h330 …for(map<class glrStateVertex*,vector<glrNode*> >::const_iterator iStack = iSym->second.nodesFromSt… in merge() local
331 iStack!=iSym->second.nodesFromState_end(); ++iStack){ in merge()
332 …for(vector<glrNode*>::const_iterator iNode = iStack->second.begin(); iNode!=iStack->second.end(); … in merge()
333 where->addPred(iStack->first, *iNode); in merge()
334 if(iStack->first->getToken()==where->getToken()){ in merge()
335 … iStack->first->getState()->crossEdges.push_back(pair<glrNode*, glrState*>(*iNode, getState())); in merge()
347 …glrNode*> >::const_iterator iStack = iSym->second.nodesFromState_begin();iStack!=iSym->second.node… in addCrossEdges() local
348 if(iStack->first->getToken()==getToken()){ in addCrossEdges()
349 …for(vector<glrNode*>::const_iterator iNode = iStack->second.begin(); iNode!=iStack->second.end(); … in addCrossEdges()
350 … iStack->first->getState()->crossEdges.push_back(pair<glrNode*, glrState*>(*iNode, getState())); in addCrossEdges()
H A DglrParser.h703 …for(vector<glrStateVertex*>::const_iterator iStack=iNode->second.begin();iStack!=iNode->second.end… in runReductions() local
706 << " (" << (*iStack)->getToken() << ")" << endl; in runReductions()
751 …r(vector<glrStateVertex*>::const_iterator iStack=iStates->second.begin();iStack!=iStates->second.e… in recursiveCrossEdges() local
838 …for(vector<glrStateVertex*>::const_iterator iStack=iNode->second.begin();iStack!=iNode->second.end… in recursiveReduce() local
841 << " (" << (*iStack)->getToken() << ")" << endl; in recursiveReduce()
843 recursiveReduce(*iStack,rulePos-1,succ,rule,fromState); in recursiveReduce()
1284 …for(vector<glrStateVertex*>::const_iterator iStack=iNode->second.begin();iStack!=iNode->second.end… in runTerminalReductions() local
1488 …for(vector<glrStateVertex*>::const_iterator iStack=iNode->second.begin();iStack!=iNode->second.end… in recursiveTermReduce() local
1509 …or(vector<glrStateVertex*>::const_iterator iStack = fromVertices.begin(); iStack!=fromVertices.end… in findEdgeAndNodeSetsForReductions() local
1510 ret=((*iStack)->bottom())||ret; in findEdgeAndNodeSetsForReductions()
[all …]
/dports/math/yacas/yacas-1.9.1/cyacas/libyacas/src/
H A Dlispevalhash.cpp18 int stacktop = aEnvironment.iStack.size(); in Evaluate()
22 aEnvironment.iStack.push_back(aArguments); in Evaluate()
39 aEnvironment.iStack.push_back(LispPtr(iter.getObj()->Copy())); in Evaluate()
45 aEnvironment.iStack.push_back(LispPtr(LispSubList::New(head))); in Evaluate()
54 aEnvironment.iStack.push_back(arg); in Evaluate()
63 aEnvironment.iStack.push_back(arg); in Evaluate()
68 aResult = (aEnvironment.iStack[stacktop]); in Evaluate()
69 aEnvironment.iStack.resize(stacktop); in Evaluate()
H A Derrors.cpp46 ShowArgTypeErrorInfo(arg_idx, env.iStack[stack_top], env); in CheckArg()
57 ShowArgTypeErrorInfo(arg_idx, env.iStack[stack_top], env); in CheckArgIsString()
64 CheckArgIsString(env.iStack[stack_top + arg_idx], arg_idx, env, stack_top); in CheckArgIsString()
73 ShowArgTypeErrorInfo(arg_idx, env.iStack[stack_top], env); in CheckArgIsList()
80 CheckArgIsList(env.iStack[stack_top + arg_idx], arg_idx, env, stack_top); in CheckArgIsList()
106 ShowFunctionError(env.iStack[stack_top], env); in CheckSecure()
H A Dmathcommands2.cpp20 #define RESULT aEnvironment.iStack[aStackTop]
21 #define ARGUMENT(i) aEnvironment.iStack[aStackTop + i]
H A Dyacasapi.cpp44 int stackTop = env.iStack.size(); in Evaluate()
103 env.iStack.resize(stackTop); in Evaluate()
H A Darggetter.cpp13 const LispString* str = aEnvironment.iStack[aStackTop + aArgNr]->String(); in GetIntegerArgument()
H A Dmathcommands.cpp36 #define RESULT aEnvironment.iStack[aStackTop]
37 #define ARGUMENT(i) aEnvironment.iStack[aStackTop + i]
786 LispPtr p(env.iStack[top + 1]); in LispProtect()
794 InternalTrue(env, env.iStack[top]); in LispProtect()
799 LispPtr p(env.iStack[top + 1]); in LispUnProtect()
807 InternalTrue(env, env.iStack[top]); in LispUnProtect()
812 LispPtr p(env.iStack[top + 1]); in LispIsProtected()
818 env.iStack[top] = env.Protected(s) ? env.iTrue->Copy() : env.iFalse->Copy(); in LispIsProtected()
/dports/math/yacas/yacas-1.9.1/jyacas/net/sf/yacas/
H A DYacasEvaluator.java23 int stacktop = aEnvironment.iStack.size(); in Evaluate()
26 aEnvironment.iStack.add(new LispPtr(aArguments.Get())); in Evaluate()
42 aEnvironment.iStack.add(new LispPtr(iter.GetObject().Copy(false))); in Evaluate()
49 aEnvironment.iStack.add(new LispPtr(LispSubList.New(head.Get()))); in Evaluate()
57 aEnvironment.iStack.add(new LispPtr(arg.Get())); in Evaluate()
70 aEnvironment.iStack.add(new LispPtr(arg.Get())); in Evaluate()
75 aResult.Set(aEnvironment.iStack.get(stacktop).Get()); in Evaluate()
76 aEnvironment.iStack.subList(stacktop, aEnvironment.iStack.size()).clear(); in Evaluate()
H A DYacasEvalCaller.java10 return aEnvironment.iStack.get(aStackTop); in RESULT()
14 return aEnvironment.iStack.get(aStackTop+i); in ARGUMENT()
H A DLispEnvironment.java48 iStack = new ArrayList<>(); in LispEnvironment()
95 ArrayList<LispPtr> iStack; field in LispEnvironment
/dports/math/saga/saga-8.1.3/saga-gis/src/tools/terrain_analysis/ta_preprocessor/
H A DPit_Router.cpp929 iStack = 0; in Mark_Flat()
960 iStack--; in Mark_Flat()
962 if( iStack >= 0 ) in Mark_Flat()
964 x = xMem[iStack]; in Mark_Flat()
965 y = yMem[iStack]; in Mark_Flat()
971 if( nStack <= iStack ) in Mark_Flat()
979 xMem[iStack] = x; in Mark_Flat()
980 yMem[iStack] = y; in Mark_Flat()
981 iMem[iStack] = i + 1; in Mark_Flat()
997 iStack++; in Mark_Flat()
[all …]
/dports/textproc/metauml/metauml_lib/thrunk/
H A Dmetauml_class_assoc.mp53 PictureStackInfo.@#iStack(2, 2, 1, 1)(7)(@#iPict);
55 @#iStack.iPict.ignoreNegativeBase := 1;
69 PictureStackInfoCopy.@#iStack(src.iStack);
83 EPictureStack.@#elementsStack(@#info.iStack)(qualifiedAssociations)("vleftbase");
H A Dmetauml_note.mp55 PictureStackInfo.@#iStack (0, 0, 0, 0)(9)(@#iText);
57 @#iStack.iPict.ignoreNegativeBase := 1;
74 PictureStackInfoCopy.@#iStack (src.iStack);
106 %EPictureStack.@#stack(@#info.iStack)(scantokens listArray(@#lines)(@#nLines))("vleftbase");
108 EPictureStack.@#stack(@#info.iStack)(contents)("vleftbase");
H A Dmetauml_templates.mp49 PictureStackInfo.@#iStack(2, 2, 1, 1)(7)(@#iPict);
51 @#iStack.iPict.ignoreNegativeBase := 1;
65 PictureStackInfoCopy.@#iStack(src.iStack);
79 EPictureStack.@#elementsStack(@#info.iStack)(templates)("vleftbase");
H A Dmetauml_state.mp47 PictureStackInfo.@#iStack (2, 2, 2, 2)(9)(@#iText);
49 @#iStack.iPict.ignoreNegativeBase := 1;
69 PictureStackInfoCopy.@#iStack (src.iStack);
107 EPictureStack.@#stack(@#info.iStack)(scantokens listArray(@#lines)(@#nLines))("vcenterbase");
128 EPictureStack.@#internalTransitionsStack(@#info.iStack)
H A Dmetauml_activity.mp46 PictureStackInfo.@#iStack (2, 2, 2, 2)(9)(@#iText);
48 @#iStack.iPict.ignoreNegativeBase := 1;
65 PictureStackInfoCopy.@#iStack (src.iStack);
94 EPictureStack.@#stack(@#info.iStack)(scantokens listArray(@#lines)(@#nLines))("vcenterbase");
H A Dutil_picture_stack.mp72 log "*** Creating iStack...";
73 PictureStackInfo.iStack(2, 2, 2, 2)(2)(iPict);
104 EPictureStack@#(iStack)(thePictures)(how);
/dports/devel/p5-Class-XSAccessor/Class-XSAccessor-1.19/XS/
H A DHash.xs178 int iStack;
192 for (iStack = 1; iStack < items; iStack += 2) {
194 (void)hv_store_ent(hash, ST(iStack), newSVsv(ST(iStack+1)), 0);
/dports/graphics/ipe/ipe-7.2.23/src/ipelets/qvoronoi/
H A Dqvoronoi.cpp98 std::list<Matrix> iStack; member in CollectVisitor
104 iStack.push_back(Matrix()); // id matrix in CollectVisitor()
109 iStack.push_back(iStack.back() * obj->matrix()); in visitGroup()
112 iStack.pop_back(); in visitGroup()
117 Matrix m = iStack.back() * obj->matrix(); in visitPath()
133 iSites.push_back(iStack.back() * obj->matrix() * obj->position()); in visitReference()
/dports/textproc/libsphinxclient/sphinx-2.0.9-release/src/
H A Dsphinxutils.cpp630 int iStack = 0; in Parse() local
640 …#define LOC_PUSH(_new) { assert ( iStack<int(sizeof(eStack)/sizeof(eState)) ); eStack[iStack++] = … in Parse()
641 #define LOC_POP() { assert ( iStack>0 ); eState = eStack[--iStack]; } in Parse()
/dports/math/yacas/yacas-1.9.1/cyacas/yacas/src/
H A Dyacasmain.cpp119 #define RESULT aEnvironment.iStack[aStackTop]
120 #define ARGUMENT(i) aEnvironment.iStack[aStackTop + i]
/dports/math/ogdf/OGDF/src/coin/Clp/
H A DClpSimplexOther.cpp3810 int iStack = numJ; in expandKnapsack() local
3835 while (iStack >= 0) { in expandKnapsack()
3940 if (sum > maxSize || stack[iStack] > bound[iStack]) { in expandKnapsack()
3941 sum -= size[iStack] * stack[iStack]; in expandKnapsack()
3942 stack[iStack--] = 0; in expandKnapsack()
3943 if (iStack >= 0) { in expandKnapsack()
3944 stack[iStack] ++; in expandKnapsack()
3945 sum += size[iStack]; in expandKnapsack()
3950 iStack = numJ - 1; in expandKnapsack()
3951 sum += size[iStack]; in expandKnapsack()
[all …]
/dports/math/cbc/Cbc-releases-2.10.5/Cbc/src/
H A DCbcHeuristicFPump.cpp1544 int iStack = n; in solutionInternal() local
1548 while (iStack >= 0) { in solutionInternal()
1590 while (iStack >= 0 && stack[iStack]) { in solutionInternal()
1591 stack[iStack]--; in solutionInternal()
1592 iStack--; in solutionInternal()
1594 if (iStack >= 0) { in solutionInternal()
1595 stack[iStack] = 1; in solutionInternal()
1596 iStack = n; in solutionInternal()
/dports/textproc/sphinxsearch/sphinx-2.2.11-release/src/
H A Dsphinxutils.cpp1020 int iStack = 0; in Parse() local
1030 …#define LOC_PUSH(_new) { assert ( iStack<int(sizeof(eStack)/sizeof(eState)) ); eStack[iStack++] = … in Parse()
1031 #define LOC_POP() { assert ( iStack>0 ); eState = eStack[--iStack]; } in Parse()

12