| /external/compiler-rt/test/cfi/ |
| D | README.txt | 2 functionality associated with bit sets of different sizes. When certain
3 macros are defined the tests instantiate classes that force the bit sets
6 - B32 forces 32-bit bit sets.
7 - B64 forces 64-bit bit sets.
8 - BM forces memory bit sets.
|
| /external/clang/utils/ |
| D | token-delta.py | 63 def delta(self, c, sets): argument
67 if len(sets) <= 1:
71 res = self.search(c, sets)
76 refined = sum(map(list, map(self.split, sets)), [])
77 if len(refined) == len(sets):
82 def search(self, c, sets): argument
83 for i,S in enumerate(sets):
90 if len(sets) > 2:
91 complement = sum(sets[:i] + sets[i+1:],[])
93 return self.delta(complement, sets[:i] + sets[i+1:])
|
| /external/python/cpython2/Doc/library/ |
| D | sets.rst | 2 :mod:`sets` --- Unordered collections of unique elements
5 .. module:: sets
6 :synopsis: Implementation of sets of unique elements.
19 The :mod:`sets` module provides classes for constructing and manipulating
22 operations on sets such as intersection, union, difference, and symmetric
25 Like other collections, sets support ``x in set``, ``len(set)``, and ``for x in
26 set``. Being an unordered collection, sets do not record element position or
27 order of insertion. Accordingly, sets do not support indexing, slicing, or
40 sets cannot contain mutable elements such as lists or dictionaries. However,
42 :class:`ImmutableSet`. For convenience in implementing sets of sets, inner sets
[all …]
|
| D | datatypes.rst | 10 queues, and sets.
14 :class:`frozenset`, replaces the deprecated :mod:`sets` module), and
29 sets.rst
|
| /external/icu/android_icu4j/src/main/tests/android/icu/dev/test/lang/ |
| D | UnicodeSetStringSpanTest.java | 568 void verifySpan(final UnicodeSetWithStrings sets[], final String s, int whichSpans, in verifySpan() argument
590 … limitsCount = getSpans(sets[i], (0 != (i & 1)), s, whichSpans, type, typeName, limits, in verifySpan()
635 if (!sets[SLOW].getSet().containsAll(string)) { in verifySpan()
640 if (!sets[FAST].getSet().containsAll(string)) { in verifySpan()
646 if (!sets[SLOW].getSet().containsNone(string)) { in verifySpan()
651 if (!sets[FAST].getSet().containsNone(string)) { in verifySpan()
664 void verifySpan(final UnicodeSetWithStrings sets[], final String s, int whichSpans, in verifySpan() argument
668 verifySpan(sets, s, whichSpans, expectLimits, expectCount, testName, index); in verifySpan()
675 void verifySpanBothUTFs(final UnicodeSetWithStrings sets[], final String s16, int whichSpans, in verifySpanBothUTFs() argument
683 verifySpan(sets, s16, whichSpans, expectLimits, expectCount, testName, index); in verifySpanBothUTFs()
[all …]
|
| /external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/lang/ |
| D | UnicodeSetStringSpanTest.java | 567 void verifySpan(final UnicodeSetWithStrings sets[], final String s, int whichSpans, in verifySpan() argument
589 … limitsCount = getSpans(sets[i], (0 != (i & 1)), s, whichSpans, type, typeName, limits, in verifySpan()
634 if (!sets[SLOW].getSet().containsAll(string)) { in verifySpan()
639 if (!sets[FAST].getSet().containsAll(string)) { in verifySpan()
645 if (!sets[SLOW].getSet().containsNone(string)) { in verifySpan()
650 if (!sets[FAST].getSet().containsNone(string)) { in verifySpan()
663 void verifySpan(final UnicodeSetWithStrings sets[], final String s, int whichSpans, in verifySpan() argument
667 verifySpan(sets, s, whichSpans, expectLimits, expectCount, testName, index); in verifySpan()
674 void verifySpanBothUTFs(final UnicodeSetWithStrings sets[], final String s16, int whichSpans, in verifySpanBothUTFs() argument
682 verifySpan(sets, s16, whichSpans, expectLimits, expectCount, testName, index); in verifySpanBothUTFs()
[all …]
|
| /external/icu/icu4c/source/test/intltest/ |
| D | usettest.h | 174 … void testSpan(const UnicodeSetWithStrings *sets[4], const void *s, int32_t length, UBool isUTF16,
178 … void testSpan(const UnicodeSetWithStrings *sets[4], const void *s, int32_t length, UBool isUTF16,
181 void testSpanBothUTFs(const UnicodeSetWithStrings *sets[4],
185 …void testSpanContents(const UnicodeSetWithStrings *sets[4], uint32_t whichSpans, const char *testN…
186 …void testSpanUTF16String(const UnicodeSetWithStrings *sets[4], uint32_t whichSpans, const char *te…
187 …void testSpanUTF8String(const UnicodeSetWithStrings *sets[4], uint32_t whichSpans, const char *tes…
|
| /external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/util/ |
| D | LocaleDataTest.java | 220 UnicodeSet[] sets = new UnicodeSet[scriptCodes.length]; in TestExemplarSet() local
223 … sets[j] = new UnicodeSet("[:" + UScript.getShortName(scriptCodes[j]) + ":]"); in TestExemplarSet()
230 for(int j=0; j<sets.length; j++){ in TestExemplarSet()
231 if(sets[j].contains(iter.codepoint, iter.codepointEnd)){ in TestExemplarSet()
237 for(int j=0; j<sets.length; j++){ in TestExemplarSet()
238 if(sets[j].contains(iter.string)){ in TestExemplarSet()
293 UnicodeSet[] sets = new UnicodeSet[scriptCodes.length]; in TestExemplarSet2() local
296 … sets[j] = new UnicodeSet("[:" + UScript.getShortName(scriptCodes[j]) + ":]"); in TestExemplarSet2()
303 for(int j=0; j<sets.length; j++){ in TestExemplarSet2()
304 if(sets[j].contains(iter.codepoint, iter.codepointEnd)){ in TestExemplarSet2()
[all …]
|
| /external/icu/android_icu4j/src/main/tests/android/icu/dev/test/util/ |
| D | LocaleDataTest.java | 221 UnicodeSet[] sets = new UnicodeSet[scriptCodes.length]; in TestExemplarSet() local
224 … sets[j] = new UnicodeSet("[:" + UScript.getShortName(scriptCodes[j]) + ":]"); in TestExemplarSet()
231 for(int j=0; j<sets.length; j++){ in TestExemplarSet()
232 if(sets[j].contains(iter.codepoint, iter.codepointEnd)){ in TestExemplarSet()
238 for(int j=0; j<sets.length; j++){ in TestExemplarSet()
239 if(sets[j].contains(iter.string)){ in TestExemplarSet()
294 UnicodeSet[] sets = new UnicodeSet[scriptCodes.length]; in TestExemplarSet2() local
297 … sets[j] = new UnicodeSet("[:" + UScript.getShortName(scriptCodes[j]) + ":]"); in TestExemplarSet2()
304 for(int j=0; j<sets.length; j++){ in TestExemplarSet2()
305 if(sets[j].contains(iter.codepoint, iter.codepointEnd)){ in TestExemplarSet2()
[all …]
|
| /external/abi-compliance-checker/modules/Internals/Scripts/ |
| D | Tabs.js | 11 var sets = document.getElementsByTagName('div');
12 for (var i = 0; i < sets.length; i++)
14 if (sets[i].className.indexOf('tabset') != -1)
17 var links = sets[i].getElementsByTagName('a');
|
| /external/python/cpython2/Doc/c-api/ |
| D | objbuffer.rst | 20 interface. On success, returns ``0``, sets *buffer* to the memory location
21 and *buffer_len* to the buffer length. Returns ``-1`` and sets a
35 interface. On success, returns ``0``, sets *buffer* to the memory location
36 and *buffer_len* to the buffer length. Returns ``-1`` and sets a
58 returns ``0``, sets *buffer* to the memory location and *buffer_len* to the
59 buffer length. Returns ``-1`` and sets a :exc:`TypeError` on error.
|
| /external/protobuf/benchmarks/ |
| D | README.md | 4 This directory contains benchmarking schemas and data sets that you
10 Generate the data sets like so:
25 We would like to add more data sets. In general we will favor data sets
|
| /external/python/cpython2/Parser/ |
| D | spark.py | 302 sets = [ [(1,0), (2,0)] ]
316 sets.append([])
318 if sets[i] == []:
320 self.makeSet(tokens[i], sets, i)
322 sets.append([])
323 self.makeSet(None, sets, len(tokens))
328 if finalitem not in sets[-2]:
335 tokens, len(sets)-2)
471 def makeSet(self, token, sets, i): argument
472 cur, next = sets[i], sets[i+1]
[all …]
|
| /external/valgrind/callgrind/ |
| D | threads.c | 116 t->lastdump_cost = CLG_(get_eventset_cost)( CLG_(sets).full ); in new_thread()
117 t->sighandler_cost = CLG_(get_eventset_cost)( CLG_(sets).full ); in new_thread()
118 CLG_(init_cost)( CLG_(sets).full, t->lastdump_cost ); in new_thread()
119 CLG_(init_cost)( CLG_(sets).full, t->sighandler_cost ); in new_thread()
214 CLG_(zero_cost)( CLG_(sets).full, es->cost ); in CLG_()
283 CLG_(add_and_zero_cost)( CLG_(sets).full, in CLG_()
333 es->cost = CLG_(get_eventset_cost)(CLG_(sets).full); in new_exec_state()
334 CLG_(zero_cost)( CLG_(sets).full, es->cost ); in new_exec_state()
427 CLG_(print_cost)(-9, CLG_(sets).full, es->cost); in exec_state_save()
454 CLG_(print_cost)(-9, CLG_(sets).full, es->cost); in exec_state_restore()
|
| D | dump.c | 426 c->cost = CLG_(get_eventset_cost)( CLG_(sets).full ); in init_fcost()
427 CLG_(init_cost)( CLG_(sets).full, c->cost ); in init_fcost()
546 CLG_(print_cost)(-5, CLG_(sets).full, c->cost); in fprint_fcost()
555 CLG_(add_and_zero_cost)( CLG_(sets).full, dump_total_cost, c->cost ); in fprint_fcost()
584 CLG_ASSERT(CLG_(is_zero_cost)( CLG_(sets).full, jcc->cost)); in fprint_jcc()
651 if (!CLG_(is_zero_cost)( CLG_(sets).full, jcc->cost)) { in fprint_jcc()
660 CLG_(init_cost)( CLG_(sets).full, jcc->cost ); in fprint_jcc()
718 if (!CLG_(is_zero_cost)( CLG_(sets).full, currCost->cost )) { in fprint_bbcc()
739 (!CLG_(is_zero_cost)( CLG_(sets).full, jcc->cost ))) in fprint_bbcc()
743 if (!CLG_(is_zero_cost)( CLG_(sets).full, currCost->cost )) { in fprint_bbcc()
[all …]
|
| D | sim.c | 74 int sets; member
158 for (i = 0; i < c->sets * c->assoc; i++) in cachesim_clearcache()
161 for (i = 0; i < c->sets * c->assoc; i++) { in cachesim_clearcache()
183 c->sets = (c->size / c->line_size) / c->assoc; in cachesim_initcache()
184 c->sets_min_1 = c->sets - 1; in cachesim_initcache()
186 c->tag_shift = c->line_size_bits + VG_(log2)(c->sets); in cachesim_initcache()
204 sizeof(UWord) * c->sets * c->assoc); in cachesim_initcache()
219 for (i = 0, set = 0; set < c->sets; set++) {
612 sizeof(line_use) * c->sets * c->assoc); in cacheuse_initcache()
614 sizeof(line_loaded) * c->sets * c->assoc); in cacheuse_initcache()
[all …]
|
| /external/bison/tests/ |
| D | sets.at | 22 # Extract the information about the grammar sets from a bison
81 AT_BISON_CHECK([[--trace=sets input.y]], [], [], [stderr])
82 AT_EXTRACT_SETS([stderr], [sets])
83 AT_CHECK([[cat sets]], [],
165 AT_BISON_CHECK([[--trace=sets input.y]], [], [], [stderr])
211 AT_BISON_CHECK([[--trace=sets input.y]], [], [], [stderr])
212 AT_EXTRACT_SETS([stderr], [sets])
213 AT_CHECK([[cat sets]], [],
|
| /external/valgrind/cachegrind/ |
| D | cg_sim.c | 45 Int sets; member
62 c->sets = (c->size / c->line_size) / c->assoc; in cachesim_initcache()
63 c->sets_min_1 = c->sets - 1; in cachesim_initcache()
65 c->tag_shift = c->line_size_bits + VG_(log2)(c->sets); in cachesim_initcache()
76 sizeof(UWord) * c->sets * c->assoc); in cachesim_initcache()
78 for (i = 0; i < c->sets * c->assoc; i++) in cachesim_initcache()
|
| /external/swiftshader/third_party/LLVM/lib/DebugInfo/ |
| D | DWARFDebugAranges.cpp | 66 SetCollection sets; in extract() local
71 sets.push_back(set); in extract()
75 std::for_each(sets.begin(), sets.end(), CountArangeDescriptors(count)); in extract()
80 std::for_each(sets.begin(), sets.end(), range_adder); in extract()
|
| /external/syslinux/doc/ |
| D | chain.txt | 115 nosect sets: nomaps
163 save sets: strict=2
199 [un]hide[all] sets: strict=2
210 fixchs sets: strict=2
258 break sets: nofile nomaps nohand
268 sets: file=<file> nohand nosect isolinux
276 sets: file=<file> seg=0x2000 setbpb nohand
282 sets: file=<file> seg=0x2000 setbpb nohand cmldr
288 sets: file=<file> seg=0:0x8000:0x8100 setbpb nohand
294 sets: file=<file> seg=0x60 sect=0x1FE0 setbpb nohand
[all …]
|
| /external/swiftshader/third_party/LLVM/tools/llvm-config/ |
| D | llvm-config.in.in | 415 my ($label, @sets) = @_;
417 foreach my $set (@sets) { push @output, join(',', @$set); }
440 my @sets = @_;
443 SCAN: while (@sets) { # We'll delete items from @sets as we go.
446 for (my $i = 0; $i < @sets; ++$i) {
447 my $set = $sets[$i];
452 splice(@sets, $i, 1);
|
| /external/libxml2/os400/iconv/ |
| D | README.iconv | 4 - Supported character sets names are all of the form IBMCCSIDccsid..., where
20 http://www.iana.org/assignments/character-sets/character-sets.xhtml
33 - http://www.iana.org/assignments/character-sets/character-sets.xhtml provides
|
| /external/guava/guava-testlib/src/com/google/common/collect/testing/features/ |
| D | FeatureUtil.java | 308 public static <T> Set<T> intersection(Set<? extends T> ... sets) { in intersection() argument
309 if (sets.length == 0) { in intersection()
313 Set<T> results = Helpers.copyToSet(sets[0]); in intersection()
314 for (int i = 1; i < sets.length; i++) { in intersection()
315 Set<? extends T> set = sets[i]; in intersection()
|
| /external/eigen/bench/ |
| D | check_cache_queries.cpp | 68 int sets = (abcd[2]); // C[31:0] in main() local
69 int cache_size = (ways+1) * (partitions+1) * (line_size+1) * (sets+1); in main()
76 cout << "cache[" << cache_id << "].sets = " << sets << "\n"; in main()
|
| /external/autotest/client/site_tests/network_ModemManagerSMSSignal/src/ |
| D | fake-gsm | 6 # sets CONNECT response
9 # sets DCD mode
34 # Get supported character sets
|