| /external/python/cpython3/Lib/test/ |
| D | test_dictviews.py | 13 it = type({}.items())
42 items = d.items()
43 self.assertEqual(len(items), 2)
44 self.assertEqual(set(items), {(1, 10), ("a", "ABC")})
45 self.assertEqual(items, {(1, 10), ("a", "ABC")})
46 self.assertNotEqual(items, {(1, 10), ("a", "ABC"), "junk"})
47 self.assertNotEqual(items, {(1, 10), ("a", "def")})
48 self.assertNotEqual(items, {(1, 10)})
49 self.assertNotEqual(items, 42)
50 self.assertIn((1, 10), items)
[all …]
|
| D | test_pulldom.py | 46 items = pulldom.parseString(SMALL_SAMPLE)
47 evt, node = next(items)
51 evt, node = next(items)
57 evt, node = next(items)
59 evt, node = next(items)
64 evt, node = next(items)
67 evt, node = next(items)
70 evt, node = next(items)
74 evt, node = next(items)
76 evt, node = next(items)
[all …]
|
| D | test_weakset.py | 21 self.items = [ustr(c) for c in ('a', 'b', 'c')]
30 self.s = WeakSet(self.items)
31 self.d = dict.fromkeys(self.items)
65 self.assertEqual(self.s, WeakSet(self.items))
69 x = WeakSet(self.items + self.items2)
73 self.assertEqual(len(u), len(self.items) + len(self.items2))
76 self.assertEqual(len(u), len(self.items) + len(self.items2))
92 self.assertEqual(i.intersection(C(self.items)), x)
111 self.assertEqual(self.s, WeakSet(self.items))
124 self.assertEqual(self.s, WeakSet(self.items))
[all …]
|
| /external/selinux/libsepol/src/ |
| D | write.c | 62 size_t items; in ebitmap_write() local
72 items = put_entry(buf, sizeof(uint32_t), 3, fp); in ebitmap_write()
73 if (items != 3) in ebitmap_write()
78 items = put_entry(&bit, sizeof(uint32_t), 1, fp); in ebitmap_write()
79 if (items != 1) in ebitmap_write()
82 items = put_entry(&map, sizeof(uint64_t), 1, fp); in ebitmap_write()
83 if (items != 1) in ebitmap_write()
109 size_t items, items2; in avtab_write_item() local
123 items = 1; /* item 0 is used for the item count */ in avtab_write_item()
125 buf32[items++] = cpu_to_le32(val); in avtab_write_item()
[all …]
|
| /external/oj-libjdwp/src/share/back/ |
| D | bag.c | 32 void *items; /* hold items in bag, must align on itemSize */ member
33 int used; /* number of items in bag */
45 theBag->items = jvmtiAllocate(initialAllocation * itemSize); in bagCreateBag()
46 if (theBag->items == NULL) { in bagCreateBag()
63 (void)memcpy(newBag->items, oldBag->items, newBag->used * newBag->itemSize); in bagDup()
72 jvmtiDeallocate(theBag->items); in bagDestroyBag()
80 char *items = theBag->items; in bagFind() local
82 char *itemsEnd = items + (itemSize * theBag->used); in bagFind()
84 for (; items < itemsEnd; items += itemSize) { in bagFind()
86 if (*((void**)items) == key) { in bagFind()
[all …]
|
| /external/autotest/cli/ |
| D | topic_common.py | 197 inline_option: the option containing the items (--label)
212 """Splits a string of comma separated items. Escaped commas will not
240 for items in add_on:
243 result.update(__get_items(items, split_spaces=False))
247 items = getattr(options, self.inline_option)
248 result.update(__get_items(items))
253 # The file can contain space and/or comma separated items
322 items and returns them
332 # the items that failed.
340 otherwise, queue the error and accumulate all the items
[all …]
|
| /external/jacoco/org.jacoco.core/src/org/jacoco/core/analysis/ |
| D | ICounter.java | 15 * A counter holds the missed and the covered number of particular items like
25 /** Total number of items */
28 /** Number of missed items */
31 /** Number of covered items */
34 /** Ratio of missed to total items */
37 /** Ratio of covered to total items */
42 * Status flag for no items (value is 0x00).
47 * Status flag when all items are not covered (value is 0x01).
52 * Status flag when all items are covered (value is 0x02).
57 * Status flag when items are partly covered (value is 0x03).
[all …]
|
| /external/tensorflow/tensorflow/contrib/slim/python/slim/data/ |
| D | data_provider.py | 20 data, or 'items':
22 provider.get(items=['image', 'sentence', 'class'])
46 """Maps a list of requested data items to tensors from a data source.
63 def get(self, items): argument
64 """Returns a list of tensors specified by the given list of items.
66 The list of items is arbitrary different data providers satisfy different
67 lists of items. For example the Pascal VOC might accept items 'image' and
68 'semantics', whereas the NYUDepthV2 data provider might accept items
72 items: a list of strings, each of which indicate a particular data type.
75 a list of tensors, whose length matches the length of `items`, where each
[all …]
|
| /external/python/cpython2/Lib/test/ |
| D | test_weakset.py | 41 self.items = [SomeClass(c) for c in ('a', 'b', 'c')]
50 self.s = WeakSet(self.items)
51 self.d = dict.fromkeys(self.items)
85 self.assertEqual(self.s, WeakSet(self.items))
89 x = WeakSet(self.items + self.items2)
93 self.assertEqual(len(u), len(self.items) + len(self.items2))
96 self.assertEqual(len(u), len(self.items) + len(self.items2))
112 self.assertEqual(i.intersection(C(self.items)), x)
131 self.assertEqual(self.s, WeakSet(self.items))
144 self.assertEqual(self.s, WeakSet(self.items))
[all …]
|
| /external/minigbm/ |
| D | helpers_array.c | 15 void **items; member
29 array->items = calloc(array->allocations, sizeof(*array->items)); in drv_array_init()
41 new_items = realloc(array->items, array->allocations * sizeof(*array->items)); in drv_array_append()
43 array->items = new_items; in drv_array_append()
48 array->items[array->size] = item; in drv_array_append()
60 free(array->items[idx]); in drv_array_remove()
61 array->items[idx] = NULL; in drv_array_remove()
64 array->items[i - 1] = array->items[i]; in drv_array_remove()
70 new_items = realloc(array->items, array->allocations * sizeof(*array->items)); in drv_array_remove()
72 array->items = new_items; in drv_array_remove()
[all …]
|
| /external/llvm/utils/llvm-build/llvmbuild/ |
| D | componentinfo.py | 25 def parse_items(items, has_dependencies = True): argument
27 kwargs['name'] = items.get_string('name')
28 kwargs['parent'] = items.get_optional_string('parent')
30 kwargs['dependencies'] = items.get_list('dependencies')
64 this object. Items are of the form (reference-type, component-name).
98 def parse(subpath, items): argument
99 kwargs = ComponentInfo.parse_items(items, has_dependencies = False)
116 def parse_items(items): argument
117 kwargs = ComponentInfo.parse_items(items)
118 kwargs['library_name'] = items.get_optional_string('library_name')
[all …]
|
| /external/swiftshader/third_party/llvm-7.0/llvm/utils/llvm-build/llvmbuild/ |
| D | componentinfo.py | 25 def parse_items(items, has_dependencies = True): argument
27 kwargs['name'] = items.get_string('name')
28 kwargs['parent'] = items.get_optional_string('parent')
30 kwargs['dependencies'] = items.get_list('dependencies')
64 this object. Items are of the form (reference-type, component-name).
98 def parse(subpath, items): argument
99 kwargs = ComponentInfo.parse_items(items, has_dependencies = False)
116 def parse_items(items): argument
117 kwargs = ComponentInfo.parse_items(items)
118 kwargs['library_name'] = items.get_optional_string('library_name')
[all …]
|
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
| D | Row.java | 21 protected Object[] items; field in Row
42 items = new Object[] {a, b}; in R2()
47 items = new Object[] {a, b, c}; in R3()
52 items = new Object[] {a, b, c, d}; in R4()
57 items = new Object[] {a, b, c, d, e}; in R5()
65 return (C0) items[0]; in get0()
71 return (C1) items[1]; in get1()
77 return (C2) items[2]; in get2()
83 return (C3) items[3]; in get3()
89 return (C4) items[4]; in get4()
[all …]
|
| /external/icu/android_icu4j/src/main/java/android/icu/impl/ |
| D | Row.java | 25 protected Object[] items; field in Row
49 items = new Object[] {a, b}; in R2()
57 items = new Object[] {a, b, c}; in R3()
65 items = new Object[] {a, b, c, d}; in R4()
73 items = new Object[] {a, b, c, d, e}; in R5()
81 return (C0) items[0]; in get0()
87 return (C1) items[1]; in get1()
93 return (C2) items[2]; in get2()
99 return (C3) items[3]; in get3()
105 return (C4) items[4]; in get4()
[all …]
|
| /external/mesa3d/src/mesa/program/ |
| D | prog_cache.c | 48 struct cache_item **items; member
85 struct cache_item **items; in rehash() local
92 items = malloc(size * sizeof(*items)); in rehash()
93 memset(items, 0, size * sizeof(*items)); in rehash()
96 for (c = cache->items[i]; c; c = next) { in rehash()
98 c->next = items[c->hash % size]; in rehash()
99 items[c->hash % size] = c; in rehash()
102 free(cache->items); in rehash()
103 cache->items = items; in rehash()
118 for (c = cache->items[i]; c; c = next) { in clear_cache()
[all …]
|
| /external/python/google-api-python-client/docs/dyn/ |
| D | doubleclickbidmanager_v1.lineitems.html | 79 <p class="firstline">Retrieves line items in CSV format.</p>
82 <p class="firstline">Uploads line items in CSV format.</p>
86 <pre>Retrieves line items in CSV format.
92 { # Request to fetch stored line items.
93 …ing", # File specification (column names, types, order) in which the line items will be returned. …
94 "filterType": "A String", # Filter type used to filter line items to fetch.
95 …Ids of the specified filter type used to filter line items to fetch. If omitted, all the line item…
98 "format": "A String", # Format in which the line items will be returned. Default to CSV.
105 { # Download line items response.
106 …"lineItems": "A String", # Retrieved line items in CSV format. Refer to Entity Write File Format …
[all …]
|
| /external/harfbuzz_ng/src/ |
| D | hb-map.hh | 66 item_t *items; member
74 items = nullptr; in init_shallow()
83 free (items); in fini_shallow()
84 items = nullptr; in fini_shallow()
110 item_t *old_items = items; in resize()
116 items = new_items; in resize()
118 /* Insert back old items. */ in resize()
136 if (value == INVALID && items[i].key != key) in set()
139 if (!items[i].is_unused ()) in set()
142 if (items[i].is_tombstone ()) in set()
[all …]
|
| D | hb-object.hh | 48 hb_vector_t <item_t, 1> items; member
50 void init () { items.init (); } in init()
56 item_t *item = items.find (v); in replace_or_insert()
69 item = items.push (v); in replace_or_insert()
79 item_t *item = items.find (v); in remove()
82 *item = items[items.len - 1]; in remove()
83 items.pop (); in remove()
95 item_t *item = items.find (v); in find()
106 item_t *item = items.find (v); in find_or_insert()
108 item = items.push (v); in find_or_insert()
[all …]
|
| /external/sl4a/Common/src/com/googlecode/android_scripting/facade/ui/ |
| D | AlertDialogTask.java | 84 * Set list items.
86 * @param items
88 public void setItems(JSONArray items) { in setItems() argument
90 for (int i = 0; i < items.length(); i++) { in setItems()
92 mItems.add(items.getString(i)); in setItems()
101 * Set single choice items.
103 * @param items
104 * a list of items as {@link String}s to display
108 public void setSingleChoiceItems(JSONArray items, int selected) { in setSingleChoiceItems() argument
109 setItems(items); in setSingleChoiceItems()
[all …]
|
| /external/guava/guava-tests/benchmark/com/google/common/util/concurrent/ |
| D | MonitorBasedArrayBlockingQueue.java | 68 /** The queued items */
69 final E[] items; field in MonitorBasedArrayBlockingQueue
70 /** items index for next take, poll or remove */
72 /** items index for next put, offer, or add. */
74 /** Number of items in the queue */
97 return (++i == items.length) ? 0 : i; in inc()
105 items[putIndex] = x; in insert()
115 final E[] items = this.items; in extract() local
116 E x = items[takeIndex]; in extract()
117 items[takeIndex] = null; in extract()
[all …]
|
| /external/hamcrest/hamcrest-library/src/main/java/org/hamcrest/collection/ |
| D | IsIterableContainingInAnyOrder.java | 22 protected boolean matchesSafely(Iterable<? extends T> items, Description mismatchDescription) { in matchesSafely() argument
24 for (T item : items) { in matchesSafely()
30 return matching.isFinished(items); in matchesSafely()
35 description.appendText("iterable with items ") in describeTo()
57 public boolean isFinished(Iterable<? extends S> items) { in isFinished() argument
63 .appendText(" in ").appendValueList("[", ", ", "]", items); in isFinished()
82 * the examined {@link Iterable} yields a series of items, each satisfying one matcher anywhere
106 * the examined {@link Iterable} yields a series of items, each logically equal to one item
107 * anywhere in the specified items. For a positive match, the examined iterable
108 * must be of the same length as the number of specified items.
[all …]
|
| /external/flatbuffers/tests/ |
| D | monster_test.schema.json | 117 "inventory" : { "type" : "array", "items" : { "type" : "number" } }, object
121 "test4" : { "type" : "array", "items" : { "$ref" : "#/definitions/MyGame_Example_Test" } }, object
122 "testarrayofstring" : { "type" : "array", "items" : { "type" : "string" } }, object
123 …"testarrayoftables" : { "type" : "array", "items" : { "$ref" : "#/definitions/MyGame_Example_Monst… object
125 "testnestedflatbuffer" : { "type" : "array", "items" : { "type" : "number" } }, object
136 "testarrayofbools" : { "type" : "array", "items" : { "type" : "boolean" } }, object
140 "testarrayofstring2" : { "type" : "array", "items" : { "type" : "string" } }, object
141 …"testarrayofsortedstruct" : { "type" : "array", "items" : { "$ref" : "#/definitions/MyGame_Example… object
142 "flex" : { "type" : "array", "items" : { "type" : "number" } }, object
143 "test5" : { "type" : "array", "items" : { "$ref" : "#/definitions/MyGame_Example_Test" } }, object
[all …]
|
| /external/webrtc/webrtc/libjingle/xmpp/ |
| D | pubsubtasks_unittest.cc | 34 const std::vector<buzz::PubSubItem>& items) { in OnReceiveUpdate() argument
35 OnItems(items); in OnReceiveUpdate()
39 const std::vector<buzz::PubSubItem>& items) { in OnRequestResult() argument
40 OnItems(items); in OnRequestResult()
43 void OnItems(const std::vector<buzz::PubSubItem>& items) { in OnItems() argument
44 for (std::vector<buzz::PubSubItem>::const_iterator item = items.begin(); in OnItems()
45 item != items.end(); ++item) { in OnItems()
51 this->items.push_back(handled_item); in OnItems()
67 std::vector<HandledPubSubItem> items; member in TestPubSubTasksListener
103 "<pub:items node=\"topic\"/>" in TEST_F()
[all …]
|
| /external/cldr/tools/java/org/unicode/cldr/util/ |
| D | DiscreteComparator.java | 52 * Compare the items. If there was a backup comparator, it will be used for
53 * items not specified explicitly. However, all explicit items will always
63 * the items is not explicit in the collator.
90 * Get a list of the explicit items.
141 * Add explicitly ordered items, from least to greatest
143 * @param items
146 public Builder<T> add(Collection<T> items) { in add() argument
147 if (items.size() < 2) { in add()
148 if (items.size() == 1) { in add()
149 T item = items.iterator().next(); in add()
[all …]
|
| /external/icu/icu4c/source/test/perf/leperf/ |
| D | letrperf.cpp | 25 long *items = 0; variable
28 long items[ITEM_COUNT]; member
36 Long items[ITEM_COUNT]; member
42 if(items[i]==2) { in time_null()
53 if(obj.items[i]==2) { in time_obj()
61 long *items2 = ((OneObject*)ref)->items; in time_obj2()
81 long *items2 = ((OneObject*)ref)->items; in time_letr1()
83 if(items[i]==2) { in time_letr1()
97 long *items2 = ((OneObject*)ref)->items; in time_letr2()
104 if(items[i]==2) { in time_letr2()
[all …]
|