equal
deleted
inserted
replaced
665 * @return the result of scanning |
665 * @return the result of scanning |
666 */ |
666 */ |
667 @Override |
667 @Override |
668 public R visitInstanceOf(InstanceOfTree node, P p) { |
668 public R visitInstanceOf(InstanceOfTree node, P p) { |
669 R r = scan(node.getExpression(), p); |
669 R r = scan(node.getExpression(), p); |
670 r = scanAndReduce(node.getType(), p, r); |
670 if (node.getPattern() != null) { |
671 return r; |
671 r = scanAndReduce(node.getPattern(), p, r); |
|
672 } else { |
|
673 r = scanAndReduce(node.getType(), p, r); |
|
674 } |
|
675 return r; |
|
676 } |
|
677 |
|
678 /** |
|
679 * {@inheritDoc} This implementation scans the children in left to right order. |
|
680 * |
|
681 * @param node {@inheritDoc} |
|
682 * @param p {@inheritDoc} |
|
683 * @return the result of scanning |
|
684 * @since 14 |
|
685 */ |
|
686 @Override |
|
687 public R visitBindingPattern(BindingPatternTree node, P p) { |
|
688 return scan(node.getType(), p); |
672 } |
689 } |
673 |
690 |
674 /** |
691 /** |
675 * {@inheritDoc} This implementation scans the children in left to right order. |
692 * {@inheritDoc} This implementation scans the children in left to right order. |
676 * |
693 * |