Package org.jruby.ast

Examples of org.jruby.ast.AndNode

569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
        context.defineAlias(alias.getNewName(), alias.getOldName());
    }

    public void compileAnd(Node node, BodyCompiler context) {
        final AndNode andNode = (AndNode) node;

        compile(andNode.getFirstNode(), context);

        BranchCallback longCallback = new BranchCallback() {

                    public void branch(BodyCompiler context) {
                        compile(andNode.getSecondNode(), context);
                    }
                };

        context.performLogicalAnd(longCallback);
    }
View Full Code Here
197
198
199
200
201
202
203
204
205
206
207
208
209
        switch (node.nodeId) {
        case ALIASNODE:
            setFlag(METHOD);
            break;
        case ANDNODE:
            AndNode andNode = (AndNode)node;
            inspect(andNode.getFirstNode());
            inspect(andNode.getSecondNode());
            break;
        case ARGSCATNODE:
            ArgsCatNode argsCatNode = (ArgsCatNode)node;
            inspect(argsCatNode.getFirstNode());
            inspect(argsCatNode.getSecondNode());
View Full Code Here
723
724
725
726
727
728
729
730
731
732
733
        }
        case ANDNODE:
            leftNode = cond0(((AndNode) node).getFirstNode());
            rightNode = cond0(((AndNode) node).getSecondNode());
           
            return new AndNode(node.getPosition(), makeNullNil(leftNode), makeNullNil(rightNode));
        case ORNODE:
            leftNode = cond0(((OrNode) node).getFirstNode());
            rightNode = cond0(((OrNode) node).getSecondNode());
           
            return new OrNode(node.getPosition(), makeNullNil(leftNode), makeNullNil(rightNode));
View Full Code Here
788
789
790
791
792
793
794
795
796
    }

    public AndNode newAndNode(ISourcePosition position, Node left, Node right) {
        checkExpression(left);
       
        if (left == null && right == null) return new AndNode(position, makeNullNil(left), makeNullNil(right));
       
        return new AndNode(union(left, right), makeNullNil(left), makeNullNil(right));
    }
View Full Code Here
279
280
281
282
283
284
285
286
287
288
289
290
291
        switch (node.getNodeType()) {
        case ALIASNODE:
            setFlag(node, METHOD);
            break;
        case ANDNODE:
            AndNode andNode = (AndNode)node;
            inspect(andNode.getFirstNode());
            inspect(andNode.getSecondNode());
            break;
        case ARGSCATNODE:
            ArgsCatNode argsCatNode = (ArgsCatNode)node;
            inspect(argsCatNode.getFirstNode());
            inspect(argsCatNode.getSecondNode());
View Full Code Here
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
        // TODO: don't require pop
        if (!expr) context.consumeCurrentValue();
    }

    public void compileAnd(Node node, BodyCompiler context, final boolean expr) {
        final AndNode andNode = (AndNode) node;

        if (andNode.getFirstNode().getNodeType().alwaysTrue()) {
            // compile first node as non-expr and then second node
            compile(andNode.getFirstNode(), context, false);
            compile(andNode.getSecondNode(), context, expr);
        } else if (andNode.getFirstNode().getNodeType().alwaysFalse()) {
            // compile first node only
            compile(andNode.getFirstNode(), context, expr);
        } else {
            compile(andNode.getFirstNode(), context, true);
            BranchCallback longCallback = new BranchCallback() {
                        public void branch(BodyCompiler context) {
                            compile(andNode.getSecondNode(), context, true);
                        }
                    };

            context.performLogicalAnd(longCallback);
            if (!expr) context.consumeCurrentValue();
View Full Code Here
751
752
753
754
755
756
757
758
759
760
761
        }
        case ANDNODE:
            leftNode = cond0(((AndNode) node).getFirstNode());
            rightNode = cond0(((AndNode) node).getSecondNode());
           
            return new AndNode(node.getPosition(), makeNullNil(leftNode), makeNullNil(rightNode));
        case ORNODE:
            leftNode = cond0(((OrNode) node).getFirstNode());
            rightNode = cond0(((OrNode) node).getSecondNode());
           
            return new OrNode(node.getPosition(), makeNullNil(leftNode), makeNullNil(rightNode));
View Full Code Here
824
825
826
827
828
829
830
831
832
    }

    public AndNode newAndNode(ISourcePosition position, Node left, Node right) {
        checkExpression(left);
       
        if (left == null && right == null) return new AndNode(position, makeNullNil(left), makeNullNil(right));
       
        return new AndNode(position(left, right), makeNullNil(left), makeNullNil(right));
    }
View Full Code Here
TOP

Related Classes of org.jruby.ast.AndNode

  • org.jruby.compiler.ASTCompiler
  • org.jruby.compiler.ASTInspector
  • org.jruby.parser.ParserSupport
  • org.jruby.runtime.builtin.IRubyObject
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.