Examples of ExpressionTree

Examples of com.sun.source.tree.ExpressionTree

135
136
137
138
139
140
141
142
143
144
145
146
      this.matches = matches;
    }

    @Override
    public Void visitExpressionStatement(ExpressionStatementTree node, VisitorState state) {
      ExpressionTree expression = node.getExpression();
      Match match = matches.get(expression.toString());
      if (match != null) {
        assertMatch(expression, match.expected);
        match.found = true;
      }
      return super.visitExpressionStatement(node, state);
View Full Code Here

Examples of com.sun.source.tree.ExpressionTree

147
148
149
150
151
152
153
154
155
156
157
158
159
  private Scanner methodInvocationMatches(final boolean shouldMatch, final StaticMethod toMatch) {
    return new Scanner() {
      @Override
      public Void visitMethodInvocation(MethodInvocationTree node, VisitorState visitorState) {
        ExpressionTree methodSelect = node.getMethodSelect();
        if (!methodSelect.toString().equals("super")) {
          assertTrue(methodSelect.toString(),
                !shouldMatch ^ toMatch.matches(methodSelect, visitorState));
        }
        return super.visitMethodInvocation(node, visitorState);
      }
    };
View Full Code Here

Examples of com.sun.source.tree.ExpressionTree

91
92
93
94
95
96
97
98
99
100
101
102
103
  private Scanner methodInvocationMatches(
      final boolean shouldMatch, final Matcher<ExpressionTree> toMatch) {
    return new Scanner() {
      @Override
      public Void visitMethodInvocation(MethodInvocationTree node, VisitorState visitorState) {
        ExpressionTree methodSelect = node.getMethodSelect();
        if (!methodSelect.toString().equals("super")) {
          assertTrue(methodSelect.toString(), !shouldMatch ^ toMatch.matches(node, visitorState));
        }
        return super.visitMethodInvocation(node, visitorState);
      }
    };
  }
View Full Code Here

Examples of com.sun.source.tree.ExpressionTree

86
87
88
89
90
91
92
93
94
95
96
97
98
  private Scanner methodInvocationMatches(
      final boolean shouldMatch, final Matcher<ExpressionTree> toMatch) {
    return new Scanner() {
      @Override
      public Void visitMethodInvocation(MethodInvocationTree node, VisitorState visitorState) {
        ExpressionTree methodSelect = node.getMethodSelect();
        if (!methodSelect.toString().equals("super")) {
          assertTrue(methodSelect.toString(), !shouldMatch ^ toMatch.matches(node, visitorState));
        }
        return super.visitMethodInvocation(node, visitorState);
      }
    };
  }
View Full Code Here

Examples of com.sun.source.tree.ExpressionTree

65
66
67
68
69
70
71
72
73
74
75
    ScannerTest test = new ScannerTest() {
      private boolean matched = false;

      @Override
      public Void visitMethodInvocation(MethodInvocationTree node, VisitorState visitorState) {
        ExpressionTree methodSelect = node.getMethodSelect();
        if (toMatch.matches(methodSelect, visitorState)) {
          matched = true;
        }
        return super.visitMethodInvocation(node, visitorState);
      }
View Full Code Here

Examples of com.sun.source.tree.ExpressionTree

114
115
116
117
118
119
120
121
122
123
124
125
126
  private Scanner methodInvocationMatches(
      final boolean shouldMatch, final Matcher<ExpressionTree> toMatch) {
    return new Scanner() {
      @Override
      public Void visitMethodInvocation(MethodInvocationTree node, VisitorState visitorState) {
        ExpressionTree methodSelect = node.getMethodSelect();
        if (!methodSelect.toString().equals("super")) {
          assertTrue(methodSelect.toString(), !shouldMatch ^ toMatch.matches(node, visitorState));
        }
        return super.visitMethodInvocation(node, visitorState);
      }
    };
  }
View Full Code Here

Examples of com.sun.source.tree.ExpressionTree

142
143
144
145
146
147
148
149
150
151
152
153
  private Scanner expressionStatementMatches(final String expectedExpression,
      final Matcher<ExpressionTree> matcher) {
    return new TestScanner() {
      @Override
      public Void visitExpressionStatement(ExpressionStatementTree node, VisitorState state) {
        ExpressionTree expression = node.getExpression();
        if (expression.toString().equals(expectedExpression)) {
          assertMatch(node.getExpression(), state, matcher);
          setAssertionsComplete();
        }
        return super.visitExpressionStatement(node, state);
      }
View Full Code Here

Examples of com.sun.source.tree.ExpressionTree

95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
      // foo.baz.bar == foo.baz.bar?
      return sym1.equals(sym2) &&
          sameVariable(((JCFieldAccess) expr1).selected,((JCFieldAccess) expr2).selected);
    } else {
      // this.foo == foo?
      ExpressionTree selected = null;
      if (expr1.getKind() == Kind.IDENTIFIER) {
        selected = ((JCFieldAccess) expr2).selected;
      } else {
        selected = ((JCFieldAccess) expr1).selected;
      }
      // TODO(user): really shouldn't be relying on .toString()
      return selected.toString().equals("this") && sym1.equals(sym2);
    }
  }
View Full Code Here

Examples of com.sun.source.tree.ExpressionTree

210
211
212
213
214
215
216
217
218
219
220
    if (((JCMethodInvocation) methodInvocationTree).getMethodSelect() instanceof JCIdent) {
      return null;
    }

    // Unwrap the field accesses until you get to an identifier.
    ExpressionTree expr = methodInvocationTree;
    while (expr instanceof JCMethodInvocation) {
      expr = ((JCMethodInvocation) expr).getMethodSelect();
      if (expr instanceof JCFieldAccess) {
        expr = ((JCFieldAccess) expr).getExpression();
      }
View Full Code Here

Examples of com.sun.source.tree.ExpressionTree

296
297
298
299
300
301
302
303
304
305
306
307
   * @param state the VisitorState
   * @return a list of matched operands, or null if at least one did not match
   */
  public static List<ExpressionTree> matchBinaryTree(BinaryTree tree,
      List<Matcher<ExpressionTree>> matchers, VisitorState state) {
    ExpressionTree leftOperand = tree.getLeftOperand();
    ExpressionTree rightOperand = tree.getRightOperand();
    if (matchers.get(0).matches(leftOperand, state) &&
        matchers.get(1).matches(rightOperand, state)) {
      return Arrays.asList(leftOperand, rightOperand);
    } else if (matchers.get(0).matches(rightOperand, state) &&
        matchers.get(1).matches(leftOperand, state)) {
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. 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.