| /external/turbine/java/com/google/turbine/binder/lookup/ |
| LookupKey.java | 28 public class LookupKey {
31 public LookupKey(Iterable<String> simpleNames) {
45 * A {@link LookupKey} with the first simple name removed.
48 * resolved in the following stages, ending with a resolved class and a {@link LookupKey} for any
57 public LookupKey rest() {
61 return new LookupKey(simpleNames.subList(1, simpleNames.size()));
|
| Scope.java | 24 * Performs qualified name lookup on the given {@link LookupKey}, and returns either a {@link
28 LookupResult lookup(LookupKey lookupKey);
|
| ImportScope.java | 52 /** See {@link Scope#lookup(LookupKey)}. */
53 LookupResult lookup(LookupKey lookupKey, ResolveFunction resolve);
59 public LookupResult lookup(LookupKey lookupKey, ResolveFunction resolve) {
60 LookupResult result = next.lookup(lookupKey, resolve);
64 return ImportScope.this.lookup(lookupKey, resolve);
77 public LookupResult lookup(LookupKey lookupKey, ResolveFunction resolve) {
78 return scope.lookup(lookupKey);
[all...] |
| WildImportIndex.java | 77 public LookupResult lookup(LookupKey lookupKey, ResolveFunction resolve) {
78 return packageIndex.lookup(lookupKey);
82 LookupResult result = cpi.lookup(new LookupKey(i.type()));
92 public LookupResult lookup(LookupKey lookupKey, ResolveFunction unused) {
93 return resolveMember(member, importResolver, importResolver, lookupKey);
107 LookupResult result = cpi.lookup(new LookupKey(i.type()));
113 public LookupResult lookup(LookupKey lookupKey, ResolveFunction resolve)
[all...] |
| ImportIndex.java | 103 LookupResult result = cpi.lookup(new LookupKey(i.type()));
111 public LookupResult lookup(LookupKey lookupKey, ResolveFunction unused) {
112 return new LookupResult(sym, lookupKey);
125 LookupResult base = cpi.lookup(new LookupKey(i.type()));
131 public LookupResult lookup(LookupKey lookupKey, ResolveFunction resolve) {
133 return new LookupResult(result, lookupKey);
139 public LookupResult lookup(LookupKey lookup, ResolveFunction resolve) {
|
| CompoundScope.java | 35 public LookupResult lookup(LookupKey key) {
|
| LookupResult.java | 46 public LookupResult(Symbol sym, LookupKey remaining) {
|
| MemberImportIndex.java | 55 LookupResult result = tli.lookup(new LookupKey(i.type()));
66 LookupResult result1 = tli.lookup(new LookupKey(i.type()));
|
| TopLevelIndex.java | 130 public LookupResult lookup(LookupKey lookupKey) {
133 curr = curr.lookup(lookupKey.first());
138 return new LookupResult(curr.sym, lookupKey);
140 if (!lookupKey.hasNext()) {
143 lookupKey = lookupKey.rest();
168 public LookupResult lookup(LookupKey lookupKey) {
169 Node result = node.children.get(lookupKey.first())
[all...] |
| /external/turbine/javatests/com/google/turbine/binder/lookup/ |
| TopLevelIndexTest.java | 44 LookupResult result = index.lookup(new LookupKey(ImmutableList.of("java", "util", "Map")));
52 index.lookup(new LookupKey(ImmutableList.of("java", "util", "Map", "Entry")));
59 assertThat(index.lookup(new LookupKey(ImmutableList.of("java", "NoSuch", "Entry")))).isNull();
68 assertThat(scope.lookup(new LookupKey(ImmutableList.of("Map"))).sym())
70 assertThat(scope.lookup(new LookupKey(ImmutableList.of("List"))).sym())
72 assertThat(scope.lookup(new LookupKey(ImmutableList.of("NoSuch")))).isNull();
84 LookupResult result = index.lookup(new LookupKey(ImmutableList.of("java", "Foo")));
95 assertThat(index.lookup(new LookupKey(ImmutableList.of("java", "Foo")))).isNull();
99 .lookup(new LookupKey(ImmutableList.of("Bar")));
107 LookupKey key = new LookupKey(ImmutableList.of("java", "util", "List"))
[all...] |
| /external/llvm/include/llvm/ADT/ |
| DenseSet.h | 161 const LookupKeyT &LookupKey) {
162 return insert_as(ValueT(V), LookupKey);
165 std::pair<iterator, bool> insert_as(ValueT &&V, const LookupKeyT &LookupKey) {
167 return TheMap.insert_as(std::make_pair(std::move(V), Empty), LookupKey);
|
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
| DenseSet.h | 195 const LookupKeyT &LookupKey) {
196 return TheMap.insert_as({V, detail::DenseSetEmpty()}, LookupKey);
199 std::pair<iterator, bool> insert_as(ValueT &&V, const LookupKeyT &LookupKey) {
200 return TheMap.insert_as({std::move(V), detail::DenseSetEmpty()}, LookupKey);
|
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/ADT/ |
| DenseSet.h | 201 const LookupKeyT &LookupKey) {
202 return TheMap.insert_as({V, detail::DenseSetEmpty()}, LookupKey);
205 std::pair<iterator, bool> insert_as(ValueT &&V, const LookupKeyT &LookupKey) {
206 return TheMap.insert_as({std::move(V), detail::DenseSetEmpty()}, LookupKey);
|
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/ADT/ |
| DenseSet.h | 201 const LookupKeyT &LookupKey) {
202 return TheMap.insert_as({V, detail::DenseSetEmpty()}, LookupKey);
205 std::pair<iterator, bool> insert_as(ValueT &&V, const LookupKeyT &LookupKey) {
206 return TheMap.insert_as({std::move(V), detail::DenseSetEmpty()}, LookupKey);
|
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/ADT/ |
| DenseSet.h | 201 const LookupKeyT &LookupKey) {
202 return TheMap.insert_as({V, detail::DenseSetEmpty()}, LookupKey);
205 std::pair<iterator, bool> insert_as(ValueT &&V, const LookupKeyT &LookupKey) {
206 return TheMap.insert_as({std::move(V), detail::DenseSetEmpty()}, LookupKey);
|
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/ADT/ |
| DenseSet.h | 201 const LookupKeyT &LookupKey) {
202 return TheMap.insert_as({V, detail::DenseSetEmpty()}, LookupKey);
205 std::pair<iterator, bool> insert_as(ValueT &&V, const LookupKeyT &LookupKey) {
206 return TheMap.insert_as({std::move(V), detail::DenseSetEmpty()}, LookupKey);
|
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/ADT/ |
| DenseSet.h | 201 const LookupKeyT &LookupKey) {
202 return TheMap.insert_as({V, detail::DenseSetEmpty()}, LookupKey);
205 std::pair<iterator, bool> insert_as(ValueT &&V, const LookupKeyT &LookupKey) {
206 return TheMap.insert_as({std::move(V), detail::DenseSetEmpty()}, LookupKey);
|
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/ADT/ |
| DenseSet.h | 201 const LookupKeyT &LookupKey) {
202 return TheMap.insert_as({V, detail::DenseSetEmpty()}, LookupKey);
205 std::pair<iterator, bool> insert_as(ValueT &&V, const LookupKeyT &LookupKey) {
206 return TheMap.insert_as({std::move(V), detail::DenseSetEmpty()}, LookupKey);
|
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
| DenseSet.h | 195 const LookupKeyT &LookupKey) {
196 return TheMap.insert_as({V, detail::DenseSetEmpty()}, LookupKey);
199 std::pair<iterator, bool> insert_as(ValueT &&V, const LookupKeyT &LookupKey) {
200 return TheMap.insert_as({std::move(V), detail::DenseSetEmpty()}, LookupKey);
|
| /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/ADT/ |
| DenseSet.h | 201 const LookupKeyT &LookupKey) {
202 return TheMap.insert_as({V, detail::DenseSetEmpty()}, LookupKey);
205 std::pair<iterator, bool> insert_as(ValueT &&V, const LookupKeyT &LookupKey) {
206 return TheMap.insert_as({std::move(V), detail::DenseSetEmpty()}, LookupKey);
|
| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/ADT/ |
| DenseSet.h | 201 const LookupKeyT &LookupKey) {
202 return TheMap.insert_as({V, detail::DenseSetEmpty()}, LookupKey);
205 std::pair<iterator, bool> insert_as(ValueT &&V, const LookupKeyT &LookupKey) {
206 return TheMap.insert_as({std::move(V), detail::DenseSetEmpty()}, LookupKey);
|
| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/ADT/ |
| DenseSet.h | 201 const LookupKeyT &LookupKey) {
202 return TheMap.insert_as({V, detail::DenseSetEmpty()}, LookupKey);
205 std::pair<iterator, bool> insert_as(ValueT &&V, const LookupKeyT &LookupKey) {
206 return TheMap.insert_as({std::move(V), detail::DenseSetEmpty()}, LookupKey);
|
| /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/ADT/ |
| DenseSet.h | 201 const LookupKeyT &LookupKey) {
202 return TheMap.insert_as({V, detail::DenseSetEmpty()}, LookupKey);
205 std::pair<iterator, bool> insert_as(ValueT &&V, const LookupKeyT &LookupKey) {
206 return TheMap.insert_as({std::move(V), detail::DenseSetEmpty()}, LookupKey);
|
| /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/ADT/ |
| DenseSet.h | 201 const LookupKeyT &LookupKey) {
202 return TheMap.insert_as({V, detail::DenseSetEmpty()}, LookupKey);
205 std::pair<iterator, bool> insert_as(ValueT &&V, const LookupKeyT &LookupKey) {
206 return TheMap.insert_as({std::move(V), detail::DenseSetEmpty()}, LookupKey);
|
| /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/ADT/ |
| DenseSet.h | 201 const LookupKeyT &LookupKey) {
202 return TheMap.insert_as({V, detail::DenseSetEmpty()}, LookupKey);
205 std::pair<iterator, bool> insert_as(ValueT &&V, const LookupKeyT &LookupKey) {
206 return TheMap.insert_as({std::move(V), detail::DenseSetEmpty()}, LookupKey);
|
