@Override public boolean matches(LiteralTree literalTree, VisitorState state) { if (literalTree.getKind() == Kind.LONG_LITERAL) { // The javac AST doesn't seem to record whether the suffix is present, or whether it's // an 'l' or 'L'. We have to look at the original source String longLiteral = getLongLiteral(literalTree, state); return longLiteral != null && longLiteral.endsWith("l"); } else { return false; } } };
@Override public ULiteral visitLiteral(LiteralTree tree, Void v) { return ULiteral.create(tree.getKind(), tree.getValue()); }
@Override public Description matchLiteral(LiteralTree tree, VisitorState state) { if (tree.getKind() != STRING_LITERAL) { return Description.NO_MATCH;
@Override public boolean matches(LiteralTree literalTree, VisitorState state) { if (literalTree.getKind() == Kind.LONG_LITERAL) { // The javac AST doesn't seem to record whether the suffix is present, or whether it's // an 'l' or 'L'. We have to look at the original source String longLiteral = getLongLiteral(literalTree, state); return longLiteral != null && longLiteral.endsWith("l"); } else { return false; } } };
public CharacterLiteralNode(LiteralTree t) { super(t); assert t.getKind().equals(Tree.Kind.CHAR_LITERAL); }
public NullLiteralNode(LiteralTree t) { super(t); assert t.getKind().equals(Tree.Kind.NULL_LITERAL); }
public BooleanLiteralNode(LiteralTree t) { super(t); assert t.getKind().equals(Tree.Kind.BOOLEAN_LITERAL); }
public DoubleLiteralNode(LiteralTree t) { super(t); assert t.getKind().equals(Tree.Kind.DOUBLE_LITERAL); }
public ShortLiteralNode(LiteralTree t) { super(t); assert t.getKind().equals(Tree.Kind.INT_LITERAL); }
public IntegerLiteralNode(LiteralTree t) { super(t); assert t.getKind().equals(Tree.Kind.INT_LITERAL); }
public FloatLiteralNode(LiteralTree t) { super(t); assert t.getKind().equals(Tree.Kind.FLOAT_LITERAL); }
public LongLiteralNode(LiteralTree t) { super(t); assert t.getKind().equals(Tree.Kind.LONG_LITERAL); }
public StringLiteralNode(LiteralTree t) { super(t); assert t.getKind().equals(Tree.Kind.STRING_LITERAL); }
private UsageStatus getUseStatus(LiteralTree tree) { if(tree.getKind() == Tree.Kind.STRING_LITERAL && vbExpression.equals(tree.getValue())) { if(getEnclosingMethodName(getCurrentPath()).equals("_init")) { return UsageStatus.INIT_USE_ONLY; }else { return UsageStatus.USED; } }else { return UsageStatus.NOT_USED; } }
@Override public ULiteral visitLiteral(LiteralTree tree, Void v) { return ULiteral.create(tree.getKind(), tree.getValue()); }
StringBuilder out = new StringBuilder(); Object value = node.getValue(); switch (node.getKind()) { case INT_LITERAL: out.append(value);
appendComment( node, out ); Object value = node.getValue(); switch( node.getKind() )
@Override public Tree visitLiteral(LiteralTree literalTree, Element element) { // Is this a string literal if (literalTree.getKind() == Tree.Kind.STRING_LITERAL) { // Replace oldString with newString transformStringLiteral(getCurrentPath(), literalTree); } return super.visitLiteral(literalTree, element); }
private void renameIfMatch(LiteralTree tree) { if(tree.getKind() == Tree.Kind.STRING_LITERAL && oldName.equals(tree.getValue())) { Tree nju = workingCopy.getTreeMaker().Literal(newName); workingCopy.rewrite(tree, nju); } } }
@Override public Node visitLiteral(LiteralTree tree, Void p) { Node r = null; switch (tree.getKind()) { case BOOLEAN_LITERAL: r = new BooleanLiteralNode(tree);