< prev index next >

src/jdk.compiler/share/classes/com/sun/source/util/TreeScanner.java

Print this page




 659      * @param p  {@inheritDoc}
 660      * @return the result of scanning
 661      */
 662     @Override
 663     public R visitTypeCast(TypeCastTree node, P p) {
 664         R r = scan(node.getType(), p);
 665         r = scanAndReduce(node.getExpression(), p, r);
 666         return r;
 667     }
 668 
 669     /**
 670      * {@inheritDoc} This implementation scans the children in left to right order.
 671      *
 672      * @param node  {@inheritDoc}
 673      * @param p  {@inheritDoc}
 674      * @return the result of scanning
 675      */
 676     @Override
 677     public R visitInstanceOf(InstanceOfTree node, P p) {
 678         R r = scan(node.getExpression(), p);
 679         r = scanAndReduce(node.getType(), p, r);




 680         return r;












 681     }
 682 
 683     /**
 684      * {@inheritDoc} This implementation scans the children in left to right order.
 685      *
 686      * @param node  {@inheritDoc}
 687      * @param p  {@inheritDoc}
 688      * @return the result of scanning
 689      */
 690     @Override
 691     public R visitArrayAccess(ArrayAccessTree node, P p) {
 692         R r = scan(node.getExpression(), p);
 693         r = scanAndReduce(node.getIndex(), p, r);
 694         return r;
 695     }
 696 
 697     /**
 698      * {@inheritDoc} This implementation scans the children in left to right order.
 699      *
 700      * @param node  {@inheritDoc}




 659      * @param p  {@inheritDoc}
 660      * @return the result of scanning
 661      */
 662     @Override
 663     public R visitTypeCast(TypeCastTree node, P p) {
 664         R r = scan(node.getType(), p);
 665         r = scanAndReduce(node.getExpression(), p, r);
 666         return r;
 667     }
 668 
 669     /**
 670      * {@inheritDoc} This implementation scans the children in left to right order.
 671      *
 672      * @param node  {@inheritDoc}
 673      * @param p  {@inheritDoc}
 674      * @return the result of scanning
 675      */
 676     @Override
 677     public R visitInstanceOf(InstanceOfTree node, P p) {
 678         R r = scan(node.getExpression(), p);
 679         if (node.getPattern() != null) {
 680             r = scanAndReduce(node.getPattern(), p, r);
 681         } else {
 682             r = scanAndReduce(node.getType(), p, r);
 683         }
 684         return r;
 685     }
 686 
 687     /**
 688      * {@inheritDoc} This implementation scans the children in left to right order.
 689      *
 690      * @param node  {@inheritDoc}
 691      * @param p  {@inheritDoc}
 692      * @return the result of scanning
 693      */
 694     @Override
 695     public R visitBindingPattern(BindingPatternTree node, P p) {
 696         return scan(node.getType(), p);
 697     }
 698 
 699     /**
 700      * {@inheritDoc} This implementation scans the children in left to right order.
 701      *
 702      * @param node  {@inheritDoc}
 703      * @param p  {@inheritDoc}
 704      * @return the result of scanning
 705      */
 706     @Override
 707     public R visitArrayAccess(ArrayAccessTree node, P p) {
 708         R r = scan(node.getExpression(), p);
 709         r = scanAndReduce(node.getIndex(), p, r);
 710         return r;
 711     }
 712 
 713     /**
 714      * {@inheritDoc} This implementation scans the children in left to right order.
 715      *
 716      * @param node  {@inheritDoc}


< prev index next >