/ndk/sources/host-tools/make-3.81/ |
rule.h | 26 char **suffixes; /* Suffixes (after `%') of each target. */ member in struct:rule
|
/packages/apps/UnifiedEmail/src/org/apache/commons/io/filefilter/ |
SuffixFileFilter.java | 50 /** The filename suffixes to search for */ 51 private final String[] suffixes; field in class:SuffixFileFilter 79 this.suffixes = new String[] {suffix}; 89 * @param suffixes the suffixes to allow, must not be null 92 public SuffixFileFilter(String[] suffixes) { 93 this(suffixes, IOCase.SENSITIVE); 103 * @param suffixes the suffixes to allow, must not be null 108 public SuffixFileFilter(String[] suffixes, IOCase caseSensitivity) [all...] |
/cts/tests/tests/drm/src/android/drm/cts/ |
DrmSupportInfoTest.java | 43 // Note that null file suffix is valid (for files without suffixes) 121 Iterator<String> suffixes = info.getFileSuffixIterator(); local 122 assertTrue(suffixes.hasNext()); 123 String suffix = (String) suffixes.next();
|
/frameworks/base/core/tests/coretests/src/android/app/ |
SuggestionProvider.java | 70 String[] suffixes = { "", "a", " foo", "XXXXXXXXXXXXXXXXX" }; local 71 for (String suffix : suffixes) {
|
/external/iptables/extensions/ |
libxt_rateest.c | 65 } suffixes[] = { variable in typeref:struct:rate_suffix 102 for (s = suffixes; s->name; ++s) {
|
/art/compiler/utils/x86_64/ |
assembler_x86_64_test.cc | 1468 std::string suffixes[15] = { "o", "no", "b", "ae", "e", "ne", "be", "a", "s", "ns", "pe", "po", local [all...] |
/external/compiler-rt/lib/sanitizer_common/tests/ |
sanitizer_linux_test.cc | 239 const char *suffixes[] = { "", "-linux", ".1.2", "-linux.1.2" }; local 243 for (uptr j = 0; j < ARRAY_SIZE(suffixes); j++) { 246 paths[i], base_names[k], suffixes[j]);
|
/external/gptfdisk/ |
support.cc | 94 // or the same with "K", "M", "G", "T", or "P" as suffixes to add 136 string suffixes = "KMGTPE"; local 169 foundAt = suffixes.find(suffix);
|
/external/icu/android_icu4j/src/main/java/android/icu/impl/coll/ |
TailoredSet.java | 289 // Parallel iteration over suffixes of both tables. 290 CharsTrie.Iterator suffixes = new CharsTrie(p, pidx).iterator(); local 301 if (suffixes.hasNext()) { 302 te = suffixes.next(); 362 CharsTrie.Iterator suffixes = new CharsTrie(p, pidx).iterator(); local 363 while (suffixes.hasNext()) { 364 Entry e = suffixes.next();
|
CollationIterator.java | 521 // All contraction suffixes start with characters with lccc!=0 535 // All contraction suffixes start with characters with lccc!=0 711 // and therefore need not remember the suffixes state from before a mismatch for retrying. 713 CharsTrie suffixes = new CharsTrie(trieChars, trieOffset); local 714 if(skipped != null && !skipped.isEmpty()) { skipped.saveTrieState(suffixes); } 715 BytesTrie.Result match = suffixes.firstForCodePoint(c); 719 ce32 = suffixes.getValue(); 723 if(skipped != null && !skipped.isEmpty()) { skipped.saveTrieState(suffixes); } 747 d, suffixes, ce32, lookAhead, c); 760 match = suffixes.nextForCodePoint(c) [all...] |
ContractionsAndExpansions.java | 261 CharsTrie.Iterator suffixes = new CharsTrie(data.contexts, index + 2).iterator(); local 262 while (suffixes.hasNext()) { 263 Entry e = suffixes.next();
|
CollationFastLatinBuilder.java | 341 CharsTrie.Iterator suffixes = CharsTrie.iterator(data.contexts, trieIndex + 2, 0); local 342 while(suffixes.hasNext()) { 343 CharsTrie.Entry entry = suffixes.next();
|
/external/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/ |
TailoredSet.java | 287 // Parallel iteration over suffixes of both tables. 288 CharsTrie.Iterator suffixes = new CharsTrie(p, pidx).iterator(); local 299 if (suffixes.hasNext()) { 300 te = suffixes.next(); 360 CharsTrie.Iterator suffixes = new CharsTrie(p, pidx).iterator(); local 361 while (suffixes.hasNext()) { 362 Entry e = suffixes.next();
|
CollationIterator.java | 519 // All contraction suffixes start with characters with lccc!=0 533 // All contraction suffixes start with characters with lccc!=0 709 // and therefore need not remember the suffixes state from before a mismatch for retrying. 711 CharsTrie suffixes = new CharsTrie(trieChars, trieOffset); local 712 if(skipped != null && !skipped.isEmpty()) { skipped.saveTrieState(suffixes); } 713 BytesTrie.Result match = suffixes.firstForCodePoint(c); 717 ce32 = suffixes.getValue(); 721 if(skipped != null && !skipped.isEmpty()) { skipped.saveTrieState(suffixes); } 745 d, suffixes, ce32, lookAhead, c); 758 match = suffixes.nextForCodePoint(c) [all...] |
ContractionsAndExpansions.java | 257 CharsTrie.Iterator suffixes = new CharsTrie(data.contexts, index + 2).iterator(); local 258 while (suffixes.hasNext()) { 259 Entry e = suffixes.next();
|
CollationFastLatinBuilder.java | 340 CharsTrie.Iterator suffixes = CharsTrie.iterator(data.contexts, trieIndex + 2, 0); local 341 while(suffixes.hasNext()) { 342 CharsTrie.Entry entry = suffixes.next();
|
/external/iproute2/tc/ |
tc_util.c | 172 } suffixes[] = { variable in typeref:struct:rate_suffix 204 for (s = suffixes; s->name; ++s) { 232 for (s = suffixes; s->name; ++s) {
|
/external/opencv3/modules/ml/test/ |
test_save_load.cpp | 164 : cvtest::BaseTest(), modelName(_modelName), suffixes(_suffixes) 174 if (idx >= suffixes.size()) 176 int found = (int)suffixes.find(';', idx); 177 string piece = suffixes.substr(idx, found - idx); 254 string suffixes; member in class:CV_LegacyTest
|
/external/toybox/toys/pending/ |
dd.c | 72 static struct pair suffixes[] = { variable in typeref:struct:pair 116 for (i = 0; i < ARRAY_LEN(suffixes); i++) 117 if (!strcmp(endp, suffixes[i].name)) idx = i; 118 if (idx == -1 || (max/suffixes[idx].val < result)) 120 result = result* suffixes[idx].val;
|
/frameworks/compile/mclinker/tools/mcld/ |
Main.cpp | 148 static const char* suffixes[] = {"ld", "ld.mcld"}; local 152 for (size_t i = 0; i < sizeof(suffixes) / sizeof(suffixes[0]); ++i) { 153 if (name == suffixes[i]) 160 for (size_t i = 0; i < sizeof(suffixes) / sizeof(suffixes[0]); ++i) { 161 if (!prog_name_ref.endswith(suffixes[i])) 165 prog_name_ref.rfind('-', prog_name_ref.size() - strlen(suffixes[i])); [all...] |
/hardware/qcom/audio/legacy/libalsa-intf/ |
alsa_mixer.c | 71 } suffixes[] = { variable in typeref:struct:suf 82 p = suffixes;
|
/external/libgdx/extensions/gdx-freetype/jni/freetype-2.6.2/src/base/ |
ftmac.c | 471 unsigned char* suffixes = names[style->indexes[face_index] - 1]; local 474 for ( i = 1; i <= suffixes[0]; i++ ) 477 size_t j = suffixes[i] - 1; [all...] |
/external/mesa3d/src/mesa/program/ |
nvfragparse.c | 72 /* Optional suffixes */ 84 GLuint suffixes; member in struct:instruction_pattern 224 result.suffixes = 0; 231 result.suffixes = 0; 234 result.suffixes |= _R; 238 result.suffixes |= _H; 242 result.suffixes |= _X; 246 result.suffixes |= _C; 251 result.suffixes |= _S; [all...] |
/external/pdfium/third_party/freetype/src/base/ |
ftmac.c | 471 unsigned char* suffixes = names[style->indexes[face_index] - 1]; local 474 for ( i = 1; i <= suffixes[0]; i++ ) 477 size_t j = suffixes[i] - 1; [all...] |
/packages/apps/UnifiedEmail/src/org/apache/commons/io/ |
FileUtils.java | 347 * Converts an array of file extensions to suffixes for use 351 * @return an array of suffixes. Format: {".java", ".xml"} 354 String[] suffixes = new String[extensions.length]; local 356 suffixes[i] = "." + extensions[i]; 358 return suffixes; 378 String[] suffixes = toSuffixes(extensions); local 379 filter = new SuffixFileFilter(suffixes); [all...] |