sandbox/java.hints/spi.java.hints/src/org/netbeans/spi/java/hints/MatcherUtilities.java
1.1 --- a/sandbox/java.hints/spi.java.hints/src/org/netbeans/spi/java/hints/MatcherUtilities.java Mon Dec 19 11:37:36 2016 +0100
1.2 +++ /dev/null Thu Jan 01 00:00:00 1970 +0000
1.3 @@ -1,157 +0,0 @@
1.4 -/*
1.5 - * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER.
1.6 - *
1.7 - * Copyright 2010 Oracle and/or its affiliates. All rights reserved.
1.8 - *
1.9 - * Oracle and Java are registered trademarks of Oracle and/or its affiliates.
1.10 - * Other names may be trademarks of their respective owners.
1.11 - *
1.12 - * The contents of this file are subject to the terms of either the GNU
1.13 - * General Public License Version 2 only ("GPL") or the Common
1.14 - * Development and Distribution License("CDDL") (collectively, the
1.15 - * "License"). You may not use this file except in compliance with the
1.16 - * License. You can obtain a copy of the License at
1.17 - * http://www.netbeans.org/cddl-gplv2.html
1.18 - * or nbbuild/licenses/CDDL-GPL-2-CP. See the License for the
1.19 - * specific language governing permissions and limitations under the
1.20 - * License. When distributing the software, include this License Header
1.21 - * Notice in each file and include the License file at
1.22 - * nbbuild/licenses/CDDL-GPL-2-CP. Oracle designates this
1.23 - * particular file as subject to the "Classpath" exception as provided
1.24 - * by Oracle in the GPL Version 2 section of the License file that
1.25 - * accompanied this code. If applicable, add the following below the
1.26 - * License Header, with the fields enclosed by brackets [] replaced by
1.27 - * your own identifying information:
1.28 - * "Portions Copyrighted [year] [name of copyright owner]"
1.29 - *
1.30 - * If you wish your version of this file to be governed by only the CDDL
1.31 - * or only the GPL Version 2, indicate your decision by adding
1.32 - * "[Contributor] elects to include this software in this distribution
1.33 - * under the [CDDL or GPL Version 2] license." If you do not indicate a
1.34 - * single choice of license, a recipient has the option to distribute
1.35 - * your version of this file under either the CDDL, the GPL Version 2 or
1.36 - * to extend the choice of license to its licensees as provided above.
1.37 - * However, if you add GPL Version 2 code and therefore, elected the GPL
1.38 - * Version 2 license, then the option applies only if the new code is
1.39 - * made subject to such option by the copyright holder.
1.40 - *
1.41 - * Contributor(s):
1.42 - *
1.43 - * Portions Copyrighted 2009 Sun Microsystems, Inc.
1.44 - */
1.45 -
1.46 -package org.netbeans.spi.java.hints;
1.47 -
1.48 -import com.sun.source.tree.BlockTree;
1.49 -import com.sun.source.tree.Scope;
1.50 -import com.sun.source.tree.StatementTree;
1.51 -import com.sun.source.tree.Tree;
1.52 -import com.sun.source.util.TreePath;
1.53 -import java.util.Collection;
1.54 -import java.util.Collections;
1.55 -import java.util.HashMap;
1.56 -import java.util.Iterator;
1.57 -import java.util.List;
1.58 -import java.util.Map;
1.59 -import java.util.concurrent.atomic.AtomicBoolean;
1.60 -import javax.lang.model.type.TypeMirror;
1.61 -import org.netbeans.api.annotations.common.NonNull;
1.62 -import org.netbeans.modules.java.hints.spiimpl.Utilities;
1.63 -import org.netbeans.modules.java.hints.spiimpl.pm.PatternCompiler;
1.64 -import org.netbeans.api.java.source.matching.Matcher;
1.65 -import org.netbeans.api.java.source.matching.Occurrence;
1.66 -import org.netbeans.api.java.source.matching.Pattern;
1.67 -
1.68 -/**XXX: cancelability
1.69 - * TODO: needed?
1.70 - *
1.71 - * @author lahvac
1.72 - */
1.73 -public class MatcherUtilities {
1.74 -
1.75 - public static boolean matches(@NonNull HintContext ctx, @NonNull TreePath variable, @NonNull String pattern) {
1.76 - return matches(ctx, variable, pattern, null, null, null);
1.77 - }
1.78 -
1.79 - public static boolean matches(@NonNull HintContext ctx, @NonNull TreePath variable, @NonNull String pattern, boolean fillInVariablesHack) {
1.80 - return matches(ctx, variable, pattern, ctx.getVariables(), ctx.getMultiVariables(), ctx.getVariableNames());
1.81 - }
1.82 -
1.83 - public static boolean matches(@NonNull HintContext ctx, @NonNull TreePath variable, @NonNull String pattern, Map<String, TreePath> outVariables, Map<String, Collection<? extends TreePath>> outMultiVariables, Map<String, String> outVariables2Names) {
1.84 - Pattern p = PatternCompiler.compile(ctx.getInfo(), pattern, Collections.<String, TypeMirror>emptyMap(), Collections.<String>emptyList());
1.85 - Map<String, TreePath> variables = new HashMap<String, TreePath>(ctx.getVariables());
1.86 - Map<String, Collection<? extends TreePath>> multiVariables = new HashMap<String, Collection<? extends TreePath>>(ctx.getMultiVariables());
1.87 - Map<String, String> variables2Names = new HashMap<String, String>(ctx.getVariableNames());
1.88 - Iterable<? extends Occurrence> occurrences = Matcher.create(ctx.getInfo()).setCancel(new AtomicBoolean()).setPresetVariable(variables, multiVariables, variables2Names).setSearchRoot(variable).setTreeTopSearch().match(p);
1.89 -
1.90 - if (occurrences.iterator().hasNext()) {
1.91 - Occurrence od = occurrences.iterator().next();
1.92 - outVariables(outVariables, od.getVariables(), ctx.getVariables());
1.93 - outVariables(outMultiVariables, od.getMultiVariables(), ctx.getMultiVariables());
1.94 - outVariables(outVariables2Names, od.getVariables2Names(), ctx.getVariableNames());
1.95 -
1.96 - return true;
1.97 - }
1.98 -
1.99 - return false;
1.100 - }
1.101 -
1.102 - public static boolean matches(@NonNull HintContext ctx, @NonNull Collection<? extends TreePath> variable, @NonNull String pattern, Map<String, TreePath> outVariables, Map<String, Collection<? extends TreePath>> outMultiVariables, Map<String, String> outVariables2Names) {
1.103 - Scope s = Utilities.constructScope(ctx.getInfo(), Collections.<String, TypeMirror>emptyMap());
1.104 - Tree patternTree = Utilities.parseAndAttribute(ctx.getInfo(), pattern, s);
1.105 - List<? extends Tree> patternTrees;
1.106 -
1.107 - if (Utilities.isFakeBlock(patternTree)) {
1.108 - List<? extends StatementTree> statements = ((BlockTree) patternTree).getStatements();
1.109 -
1.110 - patternTrees = statements.subList(1, statements.size() - 1);
1.111 - } else {
1.112 - patternTrees = Collections.singletonList(patternTree);
1.113 - }
1.114 -
1.115 - if (variable.size() != patternTrees.size()) return false;
1.116 -
1.117 - Map<String, TreePath> variables = new HashMap<String, TreePath>(ctx.getVariables());
1.118 - Map<String, Collection<? extends TreePath>> multiVariables = new HashMap<String, Collection<? extends TreePath>>(ctx.getMultiVariables());
1.119 - Map<String, String> variables2Names = new HashMap<String, String>(ctx.getVariableNames());
1.120 - Iterator<? extends TreePath> variableIt = variable.iterator();
1.121 - Iterator<? extends Tree> patternTreesIt = patternTrees.iterator();
1.122 -
1.123 - while (variableIt.hasNext() && patternTreesIt.hasNext()) {
1.124 - TreePath patternTreePath = new TreePath(new TreePath(ctx.getInfo().getCompilationUnit()), patternTreesIt.next());
1.125 - Pattern p = Pattern.createPatternWithFreeVariables(patternTreePath, Collections.<String, TypeMirror>emptyMap());
1.126 - Iterable<? extends Occurrence> occurrences = Matcher.create(ctx.getInfo()).setCancel(new AtomicBoolean()).setPresetVariable(variables, multiVariables, variables2Names).setSearchRoot(variableIt.next()).setTreeTopSearch().match(p);
1.127 -
1.128 - if (!occurrences.iterator().hasNext()) {
1.129 - return false;
1.130 - }
1.131 -
1.132 - Occurrence od = occurrences.iterator().next();
1.133 -
1.134 - variables = od.getVariables();
1.135 - multiVariables = od.getMultiVariables();
1.136 - variables2Names = od.getVariables2Names();
1.137 - }
1.138 -
1.139 - if (variableIt.hasNext() == patternTreesIt.hasNext()) {
1.140 - outVariables(outVariables, variables, ctx.getVariables());
1.141 - outVariables(outMultiVariables, multiVariables, ctx.getMultiVariables());
1.142 - outVariables(outVariables2Names, variables2Names, ctx.getVariableNames());
1.143 -
1.144 - return true;
1.145 - }
1.146 -
1.147 - return false;
1.148 - }
1.149 -
1.150 - private static <T> void outVariables(Map<String, T> outMap, Map<String, T> currentValues, Map<String, T> origValues) {
1.151 - if (outMap == null) return;
1.152 -
1.153 - for (String key : origValues.keySet()) {
1.154 - currentValues.remove(key);
1.155 - }
1.156 -
1.157 - outMap.putAll(currentValues);
1.158 - }
1.159 -
1.160 -}