Quelle T6423583.java Sprache: JAVA

/*
* Copyright (c) 2006, 2015, Oracle and/or its affiliates. All rights reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation.
*
* This code is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* You should have received a copy of the GNU General Public License version
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
* or visit www.oracle.com if you need additional information or have any
* questions.
*/

/*
* @test
* @bug 6423583
* @summary LiteralTree.getValue() should return Boolean for Kind.BOOLEAN_LITERAL literals
* @modules jdk.compiler
* @build T6423583
* @compile -proc:only -processor T6423583 T6423583.java
*/

import java.util.*;
import javax.annotation.processing.*;
import javax.lang.model.*;
import javax.lang.model.element.*;
import com.sun.source.tree.*;
import com.sun.source.util.*;

@SupportedAnnotationTypes("*")
public class T6423583 extends AbstractProcessor {
    boolean b1 = true;
    boolean b2 = false;
    String s = "s";
    char c = 'c';
    int i = 0;
    long l = 0l;
    float f = 0f;
    double d = 0d;
    Void v = null;

    public boolean process(Set<? extends TypeElement> annos, RoundEnvironment rEnv) {
        Trees trees = Trees.instance(processingEnv);
        Test test = new Test();
        for (Element e: rEnv.getRootElements()) {
            Tree t = trees.getTree(e);
            test.scan(t, null);
        }
        return true;
    }

    @Override
    public SourceVersion getSupportedSourceVersion() {
        return SourceVersion.latest();
    }

    private static class Test extends TreeScanner<Void,Void> {

        private static Map<Tree.Kind, Class> map = new HashMap<Tree.Kind, Class>();
        static {
            map.put(Tree.Kind.BOOLEAN_LITERAL, Boolean.class);
            map.put(Tree.Kind.CHAR_LITERAL, Character.class);
            map.put(Tree.Kind.STRING_LITERAL, String.class);
            map.put(Tree.Kind.INT_LITERAL, Integer.class);
            map.put(Tree.Kind.LONG_LITERAL, Long.class);
            map.put(Tree.Kind.FLOAT_LITERAL, Float.class);
            map.put(Tree.Kind.DOUBLE_LITERAL, Double.class);
        }

        public Void visitLiteral(LiteralTree tree, Void ignore) {
            System.err.println(tree);
            Class expect = map.get(tree.getKind());
            if (!check(tree.getValue(), expect)) {
                System.err.println("tree: " + tree);
                System.err.println("expected class: " + expect);
                if (tree.getValue() != null)
                    System.err.println("actual class: " + tree.getValue().getClass());
                throw new AssertionError("unexpected value for literal");
            }
            return null;
        }

        private boolean check(Object value, Class<?> expectedClass) {
            return (value == null ? expectedClass == null : value.getClass().equals(expectedClass));
        }
    }
}

quality93%

¤ Dauer der Verarbeitung: 0.18 Sekunden (vorverarbeitet) ¤

Wurzel

Suchen

Beweissystem der NASA

Beweissystem Isabelle

NIST Cobol Testsuite

Cephes Mathematical Library

Wiener Entwicklungsmethode

Haftungshinweis

Die Informationen auf dieser Webseite wurden nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit, noch Qualität der bereit gestellten Informationen zugesichert.

Bemerkung:

Die farbliche Syntaxdarstellung ist noch experimentell.