| /prebuilts/sdk/tools/jetifier/jetifier-standalone/lib/ |
| annotations-13.0.jar | |
| /prebuilts/tools/common/intellij-core/171.2455.10/ |
| annotations.jar | |
| /prebuilts/tools/common/m2/repository/com/intellij/annotations/12.0/ |
| annotations-12.0.jar | |
| /prebuilts/tools/common/m2/repository/org/jetbrains/annotations/13.0/ |
| annotations-13.0.jar | |
| /prebuilts/tools/common/offline-m2/com/intellij/annotations/12.0/ |
| annotations-12.0.jar | |
| /external/clang/lib/Sema/ |
| SemaTemplateInstantiate.cpp | 48 /// \param Pattern If non-NULL, indicates the pattern from which we will be
56 const FunctionDecl *Pattern) {
158 // instead of its semantic parent, unless of course the pattern we're
162 (!Pattern || !Pattern->getLexicalDeclContext()->isFileContext())) {
[all...] |
| SemaTemplateDeduction.cpp | 581 TemplateDeductionInfo &Info, TemplateArgument Pattern)
588 S.collectUnexpandedParameterPacks(Pattern, Unexpanded);
827 QualType Pattern = Expansion->getPattern();
828 PackDeductionScope PackScope(S, TemplateParams, Deduced, Info, Pattern);
[all...] |
| SemaTemplateInstantiateDecl.cpp | 569 TypeAliasDecl *Pattern = D->getTemplatedDecl();
572 if (getPreviousDeclForInstantiation<TypedefNameDecl>(Pattern)) {
573 DeclContext::lookup_result Found = Owner->lookup(Pattern->getDeclName());
580 InstantiateTypedefNameDecl(Pattern, /*IsTypeAlias=*/true));
819 // parameters into the pattern type and checking the result.
[all...] |
| SemaTemplate.cpp | [all...] |
| SemaType.cpp | [all...] |
| SemaDeclCXX.cpp | [all...] |
| TreeTransform.h | 218 /// transforming the pattern.
226 /// \param PatternRange The source range that covers the entire pattern of
230 /// pattern.
[all...] |
| /external/icu/android_icu4j/src/main/java/android/icu/text/ |
| StringSearch.java | 31 // ICU4C implementation initializes pattern.CE and pattern.PCE. It looks like
51 * A pattern string P matches a text string S at the offsets [start, end]
65 * a given pattern. This search iterator allows changing of direction by
86 * <li> If a following pattern match is to be found, any position within a
88 * preceding pattern match is to be found, an invalid starting point
94 * boundaries given by the {@link BreakIterator}. For instance the pattern "e" will
99 * for the pattern "abab" in the text "ababab", where mutually
135 private Pattern pattern_;
161 * the argument collator to search for argument pattern in the argumen
[all...] |
| /external/icu/icu4j/main/classes/collate/src/com/ibm/icu/text/ |
| StringSearch.java | 30 // ICU4C implementation initializes pattern.CE and pattern.PCE. It looks like
50 * A pattern string P matches a text string S at the offsets [start, end]
64 * a given pattern. This search iterator allows changing of direction by
85 * <li> If a following pattern match is to be found, any position within a
87 * preceding pattern match is to be found, an invalid starting point
93 * boundaries given by the {@link BreakIterator}. For instance the pattern "e" will
98 * for the pattern "abab" in the text "ababab", where mutually
135 private Pattern pattern_;
161 * the argument collator to search for argument pattern in the argumen
[all...] |
| /external/python/cpython3/Lib/ |
| typing.py | 279 name: The name, e.g. 'Pattern'.
353 Also, _TypeAlias instances (e.g. Match, Pattern) are acceptable.
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/ |
| wincodec.h | 331 BYTE *Pattern;
[all...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.gldebugger/src/com/android/ide/eclipse/gltrace/editors/ |
| GLFunctionTraceViewer.java | 101 import java.util.regex.Pattern;
731 private final List<Pattern> mPatterns = new ArrayList<Pattern>();
740 mPatterns.add(Pattern.compile(regex, Pattern.CASE_INSENSITIVE));
757 for (Pattern p : mPatterns) {
[all...] |
| /frameworks/base/services/core/java/com/android/server/pm/ |
| ShortcutService.java | 138 import java.util.regex.Pattern;
[all...] |
| /external/llvm/utils/TableGen/ |
| CodeGenDAGPatterns.cpp | 771 /// "Predicate_foo" if from a pattern fragment "foo".
812 /// getPatternSize - Return the 'size' of this pattern. We want to match large
814 /// pattern.
824 // which maps a sub-dag to a complex pattern. e.g. favors LEA over ADD.
825 // Later we can allow complexity / cost for each pattern to be (optionally)
826 // specified. To get best possible pattern match we'll need to dynamically
860 /// Compute the complexity metric for the input pattern. This roughly
869 /// pattern's predicates concatenated with "&&" operators.
[all...] |
| /external/ltp/testcases/kernel/fs/doio/ |
| doio.c | 89 #include "pattern.h"
308 char Pattern[128];
321 int signo, char *pattern, void *iosw);
323 char *format_sds(struct io_req *ioreq, void *buffer, int sds char *pattern);
332 struct listreq *list, int nent, int fd, char *pattern);
403 int doio_pat_fill(char *addr, int mem_needed, char *Pattern,
406 char *pattern, int pattern_length, int patshift);
407 char *check_file(char *file, int offset, int length, char *pattern,
767 * Initialize the Pattern - write-type syscalls will replace Pattern[1
1604 char *addr, pattern, *file, *msg; local
3060 int logged_write, got_lock, pattern; local
[all...] |
| /external/swiftshader/third_party/LLVM/utils/TableGen/ |
| CodeGenDAGPatterns.cpp | 646 /// "Predicate_foo" if from a pattern fragment "foo".
687 /// getPatternSize - Return the 'size' of this pattern. We want to match large
689 /// pattern.
699 // which maps a sub-dag to a complex pattern. e.g. favors LEA over ADD.
700 // Later we can allow complexity / cost for each pattern to be (optionally)
701 // specified. To get best possible pattern match we'll need to dynamically
731 /// Compute the complexity metric for the input pattern. This roughly
740 /// pattern's predicates concatenated with "&&" operators.
831 /// ApplyTypeConstraint - Given a node in a pattern, apply this type
[all...] |
| /external/clang/lib/Serialization/ |
| ASTReaderDecl.cpp | [all...] |
| ASTReader.cpp | [all...] |
| /external/clang/include/clang/AST/ |
| Type.h | [all...] |
| /external/pdfium/xfa/fxfa/ |
| fxfa_basic.h | 706 Pattern,
|
