1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209
|
/*
* Copyright 2018 Google Inc. All Rights Reserved.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package com.google.turbine.binder.lookup;
import com.google.common.base.Supplier;
import com.google.common.base.Suppliers;
import com.google.common.collect.ImmutableList;
import com.google.turbine.binder.sym.ClassSymbol;
import java.util.HashMap;
import java.util.Map;
import java.util.Objects;
import org.checkerframework.checker.nullness.qual.Nullable;
/**
* An index of canonical type names where all members are known statically.
*
* <p>Qualified names are represented internally as a tree, where each package name part or class
* name is a node.
*/
public class SimpleTopLevelIndex implements TopLevelIndex {
/** A class symbol or package. */
public static class Node {
public @Nullable Node lookup(String bit) {
return children.get(bit);
}
private final @Nullable ClassSymbol sym;
// TODO(cushon): the set of children is typically going to be small, consider optimizing this
// to use a denser representation where appropriate.
private final Map<String, Node> children = new HashMap<>();
Node(@Nullable ClassSymbol sym) {
this.sym = sym;
}
/**
* Add a child with the given simple name. The given symbol will be null if a package is being
* inserted.
*
* @return {@code null} if an existing symbol with the same name has already been inserted.
*/
private @Nullable Node insert(String name, @Nullable ClassSymbol sym) {
Node child = children.get(name);
if (child != null) {
if (child.sym != null) {
return null;
}
} else {
child = new Node(sym);
children.put(name, child);
}
return child;
}
}
/** A builder for {@link TopLevelIndex}es. */
public static class Builder {
public TopLevelIndex build() {
// Freeze the index. The immutability of nodes is enforced by making insert private, doing
// a deep copy here isn't necessary.
return new SimpleTopLevelIndex(root);
}
/** The root of the lookup tree, effectively the package node of the default package. */
final Node root = new Node(null);
/** Inserts a {@link ClassSymbol} into the index, creating any needed packages. */
public void insert(ClassSymbol sym) {
String binaryName = sym.binaryName();
int start = 0;
int end = binaryName.indexOf('/');
Node curr = root;
while (end != -1) {
String simpleName = binaryName.substring(start, end);
curr = curr.insert(simpleName, null);
// If we've already inserted something with the current name (either a package or another
// symbol), bail out. When inserting elements from the classpath, this results in the
// expected first-match-wins semantics.
if (curr == null) {
return;
}
start = end + 1;
end = binaryName.indexOf('/', start);
}
String simpleName = binaryName.substring(start);
curr = curr.insert(simpleName, sym);
if (curr == null || !Objects.equals(curr.sym, sym)) {
return;
}
return;
}
}
/** Returns a builder for {@link TopLevelIndex}es. */
public static Builder builder() {
return new Builder();
}
/** Creates an index over the given symbols. */
public static TopLevelIndex of(Iterable<ClassSymbol> syms) {
Builder builder = builder();
for (ClassSymbol sym : syms) {
builder.insert(sym);
}
return builder.build();
}
private SimpleTopLevelIndex(Node root) {
this.root = root;
}
final Node root;
/** Looks up top-level qualified type names. */
final Scope scope =
new Scope() {
@Override
public @Nullable LookupResult lookup(LookupKey lookupKey) {
Node curr = root;
while (true) {
curr = curr.lookup(lookupKey.first().value());
if (curr == null) {
return null;
}
if (curr.sym != null) {
return new LookupResult(curr.sym, lookupKey);
}
if (!lookupKey.hasNext()) {
return null;
}
lookupKey = lookupKey.rest();
}
}
};
@Override
public Scope scope() {
return scope;
}
/** Returns a {@link Scope} that performs lookups in the given qualified package name. */
@Override
public @Nullable PackageScope lookupPackage(Iterable<String> packagename) {
Node curr = root;
for (String bit : packagename) {
curr = curr.lookup(bit);
if (curr == null || curr.sym != null) {
return null;
}
}
return new PackageIndex(curr);
}
static class PackageIndex implements PackageScope {
private final Node node;
public PackageIndex(Node node) {
this.node = node;
}
@Override
public @Nullable LookupResult lookup(LookupKey lookupKey) {
Node result = node.lookup(lookupKey.first().value());
if (result != null && result.sym != null) {
return new LookupResult(result.sym, lookupKey);
}
return null;
}
private final Supplier<ImmutableList<ClassSymbol>> classes =
Suppliers.memoize(
new Supplier<ImmutableList<ClassSymbol>>() {
@Override
public ImmutableList<ClassSymbol> get() {
ImmutableList.Builder<ClassSymbol> result = ImmutableList.builder();
for (Node child : node.children.values()) {
if (child.sym != null) {
result.add(child.sym);
}
}
return result.build();
}
});
@Override
public Iterable<ClassSymbol> classes() {
return classes.get();
}
}
}
|