int operator; try { switch (operator = (Integer) stk.pop()) { case ADD: case SUB: v1 = stk.pop(); stk.push(((Boolean) stk.pop()) && ((Boolean) v1)); break; v1 = stk.pop(); stk.push(((Boolean) stk.pop()) || ((Boolean) v1)); break; v1 = stk.pop(); if (!isEmpty(v2 = stk.pop()) || !isEmpty(v1)) { stk.clear(); stk.push(!isEmpty(v2) ? v2 : v1); stk.push(java.util.regex.Pattern.compile(java.lang.String.valueOf(stk.pop())) .matcher(java.lang.String.valueOf(stk.pop())).matches()); break; stk.push(((Class) stk.pop()).isInstance(stk.pop())); break; stk.push(soundex(java.lang.String.valueOf(stk.pop())) .equals(soundex(java.lang.String.valueOf(stk.pop())))); break;
holdOverRegister = stk.pop(); stk.clear();
/** * This method peforms the equivilent of an XSWAP operation to flip the operator * over to the top of the stack, and loads the stored values on the d-stack onto * the main program stack. */ private void reduceRight() { if (dStack.isEmpty()) return; Object o = stk.pop(); stk.push(dStack.pop(), o, dStack.pop()); reduce(); }
/** * This method peforms the equivilent of an XSWAP operation to flip the operator * over to the top of the stack, and loads the stored values on the d-stack onto * the main program stack. */ private void reduceRight() { if (dStack.isEmpty()) return; Object o = stk.pop(); stk.push(dStack.pop(), o, dStack.pop()); reduce(); }
public static Object pop() { return relativePathStack.get().pop(); }
public static Object pop() { return relativePathStack.get().pop(); }
/** * This method peforms the equivilent of an XSWAP operation to flip the operator * over to the top of the stack, and loads the stored values on the d-stack onto * the main program stack. */ private void reduceRight() { if (dStack.isEmpty()) return; Object o = stk.pop(); stk.push(dStack.pop()); stk.push(o); stk.push(dStack.pop()); reduce(); }
private boolean compileReduce(int opCode, ASTLinkedList astBuild) { switch (arithmeticFunctionReduction(opCode)) { case -1: /** * The reduction failed because we encountered a non-literal, * so we must now back out and cleanup. */ stk.xswap_op(); astBuild.addTokenNode(new LiteralNode(stk.pop(), pCtx)); astBuild.addTokenNode( (OperatorNode) splitAccumulator.pop(), verify(pCtx, (ASTNode) splitAccumulator.pop()) ); return false; case -2: /** * Back out completely, pull everything back off the stack and add the instructions * to the output payload as they are. */ LiteralNode rightValue = new LiteralNode(stk.pop(), pCtx); OperatorNode operator = new OperatorNode((Integer) stk.pop(), expr, st, pCtx); astBuild.addTokenNode(new LiteralNode(stk.pop(), pCtx), operator); astBuild.addTokenNode(rightValue, (OperatorNode) splitAccumulator.pop()); astBuild.addTokenNode(verify(pCtx, (ASTNode) splitAccumulator.pop())); } return true; }
private boolean compileReduce(int opCode, ASTLinkedList astBuild) { switch (arithmeticFunctionReduction(opCode)) { case -1: /** * The reduction failed because we encountered a non-literal, * so we must now back out and cleanup. */ stk.xswap_op(); astBuild.addTokenNode(new LiteralNode(stk.pop())); astBuild.addTokenNode( (OperatorNode) splitAccumulator.pop(), verify(pCtx, (ASTNode) splitAccumulator.pop()) ); return false; case -2: /** * Back out completely, pull everything back off the stack and add the instructions * to the output payload as they are. */ LiteralNode rightValue = new LiteralNode(stk.pop()); OperatorNode operator = new OperatorNode((Integer) stk.pop()); astBuild.addTokenNode(new LiteralNode(stk.pop()), operator); astBuild.addTokenNode(rightValue, (OperatorNode) splitAccumulator.pop()); astBuild.addTokenNode(verify(pCtx, (ASTNode) splitAccumulator.pop())); } return true; }
instream.close(); runtime.getRelPath().pop();
astBuild.addTokenNode(new LiteralNode(stk.pop(), pCtx)); astBuild.addTokenNode( (OperatorNode) splitAccumulator.pop(), verify(pCtx, (ASTNode) splitAccumulator.pop()) ); return false; LiteralNode rightValue = new LiteralNode(stk.pop(), pCtx); OperatorNode operator = new OperatorNode((Integer) stk.pop(), expr, st, pCtx); astBuild.addTokenNode(new LiteralNode(stk.pop(), pCtx), operator); astBuild.addTokenNode(rightValue, (OperatorNode) splitAccumulator.pop()); astBuild.addTokenNode(verify(pCtx, (ASTNode) splitAccumulator.pop())); return false; case OP_NOT_LITERAL: ASTNode tkLA2 = (ASTNode) stk.pop(); Integer tkOp2 = (Integer) stk.pop(); astBuild.addTokenNode(new LiteralNode(getStackValueResult(), pCtx)); astBuild.addTokenNode(new OperatorNode(tkOp2, expr, st, pCtx), verify(pCtx, tkLA2));
instream.close(); runtime.getRelPath().pop();
runtime.getRelPath().pop(); return appender.toString();
runtime.getRelPath().pop(); return appender.toString();
return o == null ? null : o.toString(); } finally { runtime.getRelPath().pop();
return o == null ? null : o.toString(); } finally { runtime.getRelPath().pop();
if (decl) { splitAccumulator.add(new DeclTypedVarNode(new String(expr, st, cursor - st), expr, st, cursor - st, (Class) stk.pop(), fields | ASTNode.ASSIGN, pCtx)); fields | ASTNode.ASSIGN, (Class) stk.pop(), pCtx)); if (decl) { splitAccumulator.add(new DeclProtoVarNode(new String(expr, st, cursor - st), (Proto) stk.pop(), fields | ASTNode.ASSIGN, pCtx)); stk.pop(), pCtx)); return (ASTNode) splitAccumulator.pop();