| /system/extras/tests/bootloader/ |
| haltest.py | 33 suffixes = dict()
37 suffixes[suffix] = slot
38 self.assertEqual(len(suffixes), num_slots)
|
| /external/icu/android_icu4j/src/main/java/android/icu/impl/coll/ |
| 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...] |
| 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();
|
| /external/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/ |
| 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...] |
| 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();
|
| /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;
|
| /external/eigen/cmake/ |
| EigenTesting.cmake | 138 string(REGEX REPLACE "CALL_SUBTEST_|EIGEN_TEST_PART_|EIGEN_SUFFIXES" "" suffixes "${occurences}")
139 list(REMOVE_DUPLICATES suffixes)
140 if(EIGEN_SPLIT_LARGE_TESTS AND suffixes)
142 foreach(suffix ${suffixes})
147 else(EIGEN_SPLIT_LARGE_TESTS AND suffixes)
149 foreach(suffix ${suffixes})
154 endif(EIGEN_SPLIT_LARGE_TESTS AND suffixes)
|
| /external/selinux/policycoreutils/mcstrans/src/ |
| mcstrans.c | 82 affix_t *suffixes; member in struct:word_group
308 while(group->suffixes) {
309 affix_t *next = group->suffixes->next;
310 free(group->suffixes->text);
311 free(group->suffixes);
312 group->suffixes=next;
831 if (append (&group->suffixes, tok) < 0)
1068 if (g->suffixes)
1073 if (g->suffixes) {
1076 for (a = g->suffixes; a; a = a->next)
[all...] |
| /prebuilts/go/darwin-x86/doc/codewalk/ |
| markov.xml | 18 A prefix can have an arbitrary number of suffixes.
21 lists of suffixes (a slice of strings, <code>[]string</code>).
98 and parses it into prefixes and suffixes that are stored in the
204 <step title="Getting potential suffixes" src="doc/codewalk/markov.go:/choices/,/}\n/">
205 At each iteration of the loop we retrieve a list of potential suffixes
210 are no potential suffixes for that prefix.
|
| /prebuilts/go/linux-x86/doc/codewalk/ |
| markov.xml | 18 A prefix can have an arbitrary number of suffixes.
21 lists of suffixes (a slice of strings, <code>[]string</code>).
98 and parses it into prefixes and suffixes that are stored in the
204 <step title="Getting potential suffixes" src="doc/codewalk/markov.go:/choices/,/}\n/">
205 At each iteration of the loop we retrieve a list of potential suffixes
210 are no potential suffixes for that prefix.
|
| /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/compiler-rt/test/asan/ |
| lit.cfg | 187 # Default test suffixes.
188 config.suffixes = ['.c', '.cc', '.cpp']
191 config.suffixes.append('.mm')
|
| /external/curl/docs/ |
| Makefile.am | 45 SUFFIXES = .1 .html .pdf
|
| /external/icu/icu4c/source/extra/ |
| Makefile.in | 33 .SUFFIXES :
|
| /external/icu/icu4c/source/extra/scrptrun/ |
| Makefile.in | 45 .SUFFIXES :
|
| /external/icu/icu4c/source/test/perf/DateFmtPerf/ |
| Makefile.in | 34 .SUFFIXES :
|
| /external/icu/icu4c/source/test/perf/ |
| Makefile.in | 33 .SUFFIXES :
|
| /external/icu/icu4c/source/test/perf/charperf/ |
| Makefile.in | 34 .SUFFIXES :
|
| /external/icu/icu4c/source/test/perf/collationperf/ |
| Makefile.in | 34 .SUFFIXES :
|
| /external/icu/icu4c/source/test/perf/collperf/ |
| Makefile.in | 34 .SUFFIXES :
|
| /external/icu/icu4c/source/test/perf/collperf2/ |
| Makefile.in | 34 .SUFFIXES :
|
| /external/icu/icu4c/source/test/perf/convperf/ |
| Makefile.in | 34 .SUFFIXES :
|
| /external/icu/icu4c/source/test/perf/dicttrieperf/ |
| Makefile.in | 34 .SUFFIXES :
|
| /external/icu/icu4c/source/test/perf/howExpensiveIs/ |
| Makefile.in | 35 .SUFFIXES :
|
