| /external/guice/core/src/com/google/inject/internal/ |
| D | EncounterImpl.java | 40 private final Lookups lookups;
48 EncounterImpl(Errors errors, Lookups lookups) { in EncounterImpl()
|
| D | Lookups.java | 30 interface Lookups { interface
|
| D | DeferredLookups.java | 35 final class DeferredLookups implements Lookups {
|
| D | InjectorImpl.java | 67 final class InjectorImpl implements Injector, Lookups {
126 Lookups lookups = new DeferredLookups(this);
|
| /external/python/cpython2/Tools/pybench/ |
| D | Setup.py | 23 from Lookups import *
|
| /external/libchrome/components/policy/core/common/ |
| D | schema_map_unittest.cc | 99 TEST_F(SchemaMapTest, Lookups) { in TEST_F() argument
|
| D | schema_unittest.cc | 443 TEST(SchemaTest, Lookups) { in TEST() argument
|
| /external/llvm-project/clang/lib/Sema/ |
| D | SemaOpenMP.cpp | 14593 SmallVectorImpl<U> &Lookups, const llvm::function_ref<T(ValueDecl *)> Gen) { in filterLookupForUDReductionAndMapper() argument
14594 for (U &Set : Lookups) { in filterLookupForUDReductionAndMapper()
14622 SmallVectorImpl<UnresolvedSet<8>> &Lookups) { in argumentDependentLookup() argument
14671 Lookups.emplace_back(); in argumentDependentLookup()
14672 Lookups.back().addDecl(Underlying); in argumentDependentLookup()
14684 SmallVector<UnresolvedSet<8>, 4> Lookups; in buildDeclareReductionRef() local
14695 Lookups.emplace_back(); in buildDeclareReductionRef()
14696 Lookups.back().append(Lookup.begin(), Lookup.end()); in buildDeclareReductionRef()
14701 Lookups.push_back(UnresolvedSet<8>()); in buildDeclareReductionRef()
14705 Lookups.push_back(UnresolvedSet<8>()); in buildDeclareReductionRef()
[all …]
|
| D | SemaTemplateInstantiateDecl.cpp | 4583 SmallVector<DeclAccessPair, 32> Lookups; in SubstDefaultedFunction() local
4584 Lookups.reserve(DFI->getUnqualifiedLookups().size()); in SubstDefaultedFunction()
4592 Lookups.push_back(DeclAccessPair::make(D, DA.getAccess())); in SubstDefaultedFunction()
4599 SemaRef.Context, Lookups) in SubstDefaultedFunction()
|
| /external/llvm-project/clang/lib/AST/ |
| D | Decl.cpp | 2866 ArrayRef<DeclAccessPair> Lookups) { in Create() argument
2868 totalSizeToAlloc<DeclAccessPair>(Lookups.size()), in Create()
2871 Info->NumLookups = Lookups.size(); in Create()
2872 std::uninitialized_copy(Lookups.begin(), Lookups.end(), in Create()
|
| /external/clang/lib/Sema/ |
| D | SemaOpenMP.cpp | 8887 static T filterLookupForUDR(SmallVectorImpl<UnresolvedSet<8>> &Lookups, in filterLookupForUDR() argument
8889 for (auto &Set : Lookups) { in filterLookupForUDR()
8905 SmallVector<UnresolvedSet<8>, 4> Lookups; in buildDeclareReductionRef() local
8916 Lookups.push_back(UnresolvedSet<8>()); in buildDeclareReductionRef()
8917 Lookups.back().append(Lookup.begin(), Lookup.end()); in buildDeclareReductionRef()
8922 Lookups.push_back(UnresolvedSet<8>()); in buildDeclareReductionRef()
8926 Lookups.push_back(UnresolvedSet<8>()); in buildDeclareReductionRef()
8928 Lookups.back().addDecl(DRD); in buildDeclareReductionRef()
8934 filterLookupForUDR<bool>(Lookups, [](ValueDecl *D) -> bool { in buildDeclareReductionRef()
8941 for (auto &Set : Lookups) { in buildDeclareReductionRef()
[all …]
|
| /external/llvm-project/clang/lib/Serialization/ |
| D | ASTReaderDecl.cpp | 897 SmallVector<DeclAccessPair, 8> Lookups; in VisitFunctionDecl() local
901 Lookups.push_back(DeclAccessPair::make(ND, AS)); in VisitFunctionDecl()
904 Reader.getContext(), Lookups)); in VisitFunctionDecl()
1790 assert(Reader.Lookups.find(MergeDD.Definition) == Reader.Lookups.end() && in MergeDefinitionData()
4221 Lookups[DC].Table.add( in loadDeclUpdateRecords()
|
| D | ASTReader.cpp | 7591 auto It = Lookups.find(DC); in FindExternalVisibleDeclsByName()
7592 if (It == Lookups.end()) in FindExternalVisibleDeclsByName()
7614 auto It = Lookups.find(DC); in completeVisibleDeclsMap()
7615 assert(It != Lookups.end() && in completeVisibleDeclsMap()
7635 auto I = Lookups.find(Primary); in getLoadedLookupTables()
7636 return I == Lookups.end() ? nullptr : &I->second; in getLoadedLookupTables()
|
| D | ASTWriter.cpp | 3842 auto *Lookups = Chain ? Chain->getLoadedLookupTables(DC) : nullptr; in GenerateNameLookupTable() local
3843 Generator.emit(LookupTable, Trait, Lookups ? &Lookups->Table : nullptr); in GenerateNameLookupTable()
|
| /external/python/cpython2/Objects/ |
| D | dictnotes.txt | 263 Caching Lookups
|
| /external/clang/lib/Serialization/ |
| D | ASTReader.cpp | 6647 auto It = Lookups.find(DC); in FindExternalVisibleDeclsByName()
6648 if (It == Lookups.end()) in FindExternalVisibleDeclsByName()
6670 auto It = Lookups.find(DC); in completeVisibleDeclsMap()
6671 assert(It != Lookups.end() && in completeVisibleDeclsMap()
6691 auto I = Lookups.find(Primary); in getLoadedLookupTables()
6692 return I == Lookups.end() ? nullptr : &I->second; in getLoadedLookupTables()
|
| D | ASTReaderDecl.cpp | 1567 assert(Reader.Lookups.find(MergeDD.Definition) == Reader.Lookups.end() && in MergeDefinitionData()
3528 Lookups[DC].Table.add( in loadDeclUpdateRecords()
|
| D | ASTWriter.cpp | 3701 auto *Lookups = Chain ? Chain->getLoadedLookupTables(DC) : nullptr; in GenerateNameLookupTable() local
3702 Generator.emit(LookupTable, Trait, Lookups ? &Lookups->Table : nullptr); in GenerateNameLookupTable()
|
| /external/llvm-project/clang/include/clang/Serialization/ |
| D | ASTReader.h | 572 serialization::reader::DeclContextLookupTable> Lookups; variable
|
| /external/clang/include/clang/Serialization/ |
| D | ASTReader.h | 513 serialization::reader::DeclContextLookupTable> Lookups; variable
|
| /external/testng/lib-supplied/ |
| D | guice-2.0.jar | META-INF/
META-INF/MANIFEST.MF
LICENSE
NOTICE
org/
org/testng/
... |
| /external/llvm-project/clang/include/clang/AST/ |
| D | Decl.h | 1838 ArrayRef<DeclAccessPair> Lookups);
|
| /external/python/cpython3/Doc/library/ |
| D | collections.rst | 62 Lookups search the underlying mappings successively until a key is found. In
|
| /external/llvm/docs/ |
| D | SourceLevelDebugging.rst | 750 * Lookups should be very fast
|
| /external/llvm-project/llvm/docs/ |
| D | SourceLevelDebugging.rst | 1357 * Lookups should be very fast
|