Home
last modified time | relevance | path

Searched full:items (Results 1 – 25 of 3217) sorted by relevance

12345678910>>...129

/third_party/python/Lib/test/
Dtest_dictviews.py13 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 …]
Dtest_pulldom.py46 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 …]
Dtest_weakset.py30 self.items = [ustr(c) for c in ('a', 'b', 'c')]
39 self.s = WeakSet(self.items)
40 self.d = dict.fromkeys(self.items)
76 self.assertEqual(self.s, WeakSet(self.items))
80 x = WeakSet(self.items + self.items2)
84 self.assertEqual(len(u), len(self.items) + len(self.items2))
87 self.assertEqual(len(u), len(self.items) + len(self.items2))
103 self.assertEqual(i.intersection(C(self.items)), x)
122 self.assertEqual(self.s, WeakSet(self.items))
135 self.assertEqual(self.s, WeakSet(self.items))
[all …]
/third_party/selinux/libsepol/src/
Dwrite.c66 size_t items; in ebitmap_write() local
76 items = put_entry(buf, sizeof(uint32_t), 3, fp); in ebitmap_write()
77 if (items != 3) in ebitmap_write()
82 items = put_entry(&bit, sizeof(uint32_t), 1, fp); in ebitmap_write()
83 if (items != 1) in ebitmap_write()
86 items = put_entry(&map, sizeof(uint64_t), 1, fp); in ebitmap_write()
87 if (items != 1) in ebitmap_write()
113 size_t items, items2; in avtab_write_item() local
127 items = 1; /* item 0 is used for the item count */ in avtab_write_item()
129 buf32[items++] = cpu_to_le32(val); in avtab_write_item()
[all …]
/third_party/typescript/tests/baselines/reference/
DoverloadingOnConstants2.types20 function foo(x: "hi", items: string[]): D;
21 >foo : { (x: "hi", items: string[]): D; (x: "bye", items: string[]): E; }
23 >items : string[]
25 function foo(x: "bye", items: string[]): E;
26 >foo : { (x: "hi", items: string[]): D; (x: "bye", items: string[]): E; }
28 >items : string[]
30 function foo(x: string, items: string[]): C {
31 >foo : { (x: "hi", items: string[]): D; (x: "bye", items: string[]): E; }
33 >items : string[]
41 >foo : { (x: "hi", items: string[]): D; (x: "bye", items: string[]): E; }
[all …]
DcontrolFlowArrays.types46 >x.push : (...items: any[]) => number
48 >push : (...items: any[]) => number
53 >x.push : (...items: any[]) => number
55 >push : (...items: any[]) => number
60 >x.push : (...items: any[]) => number
62 >push : (...items: any[]) => number
82 >x.push : (...items: any[]) => number
84 >push : (...items: any[]) => number
105 >x.push : (...items: any[]) => number
107 >push : (...items: any[]) => number
[all …]
DinferenceLimit.types19 …ct) => { this.doStuff(order.id) .then((items) => { order.items = items;…
22 …ct) => { this.doStuff(order.id) .then((items) => { order.items = items;…
33 …ct) => { this.doStuff(order.id) .then((items) => { order.items = items;…
37 …ct) => { this.doStuff(order.id) .then((items) => { order.items = items;…
39 …ct) => { this.doStuff(order.id) .then((items) => { order.items = items;…
44 >this.doStuff(order.id) .then((items) => { order.items = items; reso…
54 .then((items) => {
56 >(items) => { order.items = items; resolve(order); } : (items: void)…
57 >items : void
59 order.items = items;
[all …]
DcrashInGetTextOfComputedPropertyName.symbols20 const items: { [id: string]: AB } = {}
21 >items : Symbol(items, Decl(crashInGetTextOfComputedPropertyName.ts, 8, 5))
25 const { [itemId]: itemOk1 } = items
28 >items : Symbol(items, Decl(crashInGetTextOfComputedPropertyName.ts, 8, 5))
37 items: {[s: string]: AB}
38 >items : Symbol(ObjWithItems.items, Decl(crashInGetTextOfComputedPropertyName.ts, 13, 24))
42 const objWithItems: ObjWithItems = { items: {}}
45 >items : Symbol(items, Decl(crashInGetTextOfComputedPropertyName.ts, 16, 36))
47 const itemOk2 = objWithItems.items[itemId]
49 >objWithItems.items : Symbol(ObjWithItems.items, Decl(crashInGetTextOfComputedPropertyName.ts, 13, …
[all …]
DcontrolFlowArrayErrors.types18 >x.push : (...items: any[]) => number
20 >push : (...items: any[]) => number
45 >x.push : (...items: any[]) => number
47 >push : (...items: any[]) => number
64 >x.push : (...items: any[]) => number
66 >push : (...items: any[]) => number
92 >x.push : (...items: (string | number)[]) => number
94 >push : (...items: (string | number)[]) => number
109 >x.push : (...items: (string | number)[]) => number
111 >push : (...items: (string | number)[]) => number
[all …]
DcrashInGetTextOfComputedPropertyName.types17 const items: { [id: string]: AB } = {}
18 >items : { [id: string]: AB; }
22 const { [itemId]: itemOk1 } = items
25 >items : { [id: string]: AB; }
33 items: {[s: string]: AB}
34 >items : { [s: string]: AB; }
37 const objWithItems: ObjWithItems = { items: {}}
39 >{ items: {}} : { items: {}; }
40 >items : {}
43 const itemOk2 = objWithItems.items[itemId]
[all …]
DcouldNotSelectGenericOverload.types2 function makeArray<T>(items: T[]): T[] { return items; }
3 >makeArray : <T>(items: T[]) => T[]
4 >items : T[]
5 >items : T[]
16 >makeArray : <T>(items: T[]) => T[]
23 >makeArray : <T>(items: T[]) => T[]
26 function makeArray2(items: any[]): any[] { return items; }
27 >makeArray2 : (items: any[]) => any[]
28 >items : any[]
29 >items : any[]
[all …]
DjsDeclarationsTypeReassignmentFromDeclaration.symbols8 declare const items: Item[];
9 >items : Symbol(items, Decl(some-mod.d.ts, 3, 13))
12 export = items;
13 >items : Symbol(items, Decl(some-mod.d.ts, 3, 13))
17 const items = [];
18 >items : Symbol(items, Decl(index.js, 1, 5))
20 module.exports = items;
24 >items : Symbol(items, Decl(index.js, 1, 5))
/third_party/lzma/C/
DSwapBytes.c92 const __m128i v = *(const __m128i *)(const void *)(items + (i) * 8); \
93 *( __m128i *)( void *)(items + (i) * 8) = \
105 SwapBytes2_128(CSwapUInt16 *items, const CSwapUInt16 *lim) in SwapBytes2_128() argument
110 SWAP2_128(0) SWAP2_128(1) items += 2 * 8; in SwapBytes2_128()
111 SWAP2_128(0) SWAP2_128(1) items += 2 * 8; in SwapBytes2_128()
113 while (items != lim); in SwapBytes2_128()
119 __m128i v = *(const __m128i *)(const void *)(items + (i) * 4); \
126 *(__m128i *)(void *)(items + (i) * 4) = _mm_packus_epi16(v0, v1); }
134 SwapBytes4_128_pack(CSwapUInt32 *items, const CSwapUInt32 *lim)
141 SWAP4_128_pack(0); items += 1 * 4;
[all …]
/third_party/python/Tools/c-analyzer/c_common/
Diterutil.py5 def peek_and_iter(items): argument
6 if not items:
8 items = iter(items)
10 peeked = next(items)
15 yield from items
19 def iter_many(items, onempty=None): argument
20 if not items:
25 items = onempty(items)
26 yield from iter_many(items, onempty=None)
28 items = iter(items)
[all …]
/third_party/node/deps/openssl/openssl/util/perl/OpenSSL/
DOrdinals.pm36 foreach ($ordinals->items(comparator => by_name()) {
88 loaded_contents => [], # Loaded items, if loading there was
91 contents => [], # Items, indexed by number
182 foreach ($self->items(sort => by_number())) {
199 same semantics as for B<< $ordinals->items >> described below, apart
219 same semantics as for B<< $ordinals->items >> described next, apart
235 foreach ($self->items(%opts, sort => by_number())) {
244 =item B<< $ordinals->items >> I<%options>
246 Returns a list of items according to a set of criteria. The criteria is
267 sub items { subroutine
[all …]
/third_party/openssl/util/perl/OpenSSL/
DOrdinals.pm36 foreach ($ordinals->items(comparator => by_name()) {
88 loaded_contents => [], # Loaded items, if loading there was
91 contents => [], # Items, indexed by number
182 foreach ($self->items(sort => by_number())) {
199 same semantics as for B<< $ordinals->items >> described below, apart
219 same semantics as for B<< $ordinals->items >> described next, apart
235 foreach ($self->items(%opts, sort => by_number())) {
244 =item B<< $ordinals->items >> I<%options>
246 Returns a list of items according to a set of criteria. The criteria is
267 sub items { subroutine
[all …]
/third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/
DRow.java21 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 …]
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/impl/
DRow.java25 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 …]
/third_party/libxml2/
Dbackport-malloc-fail-Fix-null-deref-after-xmlSchemaItemList-A.patch23 - if (list->items == NULL) {
24 - list->items = (void **) xmlMalloc(
26 - if (list->items == NULL) {
33 - list->items = (void **) xmlRealloc(list->items,
35 - if (list->items == NULL) {
40 + tmp = (void **) xmlRealloc(list->items, newSize * sizeof(void *));
46 + list->items = tmp;
49 list->items[list->nbItems++] = item;
55 - if (list->items == NULL) {
56 - list->items = (void **) xmlMalloc(
[all …]
/third_party/json/docs/mkdocs/docs/api/basic_json/
Ditems.md1 # <small>nlohmann::basic_json::</small>items
4 iteration_proxy<iterator> items() noexcept;
5 iteration_proxy<const_iterator> items() const noexcept;
11 For loop without `items()` function:
20 Range-based for loop without `items()` function:
30 Range-based for loop with `items()` function:
33 for (auto& el : j_object.items())
39 The `items()` function also allows using
43 for (auto& [key, val] : j_object.items())
68 …Using `items()` on temporary objects is dangerous. Make sure the object's lifetime exceeds the ite…
[all …]
/third_party/icu/tools/unicodetools/com/ibm/rbm/
DBundleGroup.java23 private TreeSet items; // The NLS items contained in this group field in BundleGroup
34 items = new TreeSet(new Comparator(){ in BundleGroup()
57 Iterator iter = items.iterator(); in getItemsAsVector()
70 if (items.contains(item)) { in addBundleItem()
71 items.remove(item); in addBundleItem()
74 items.add(item); in addBundleItem()
81 Iterator iter = items.iterator(); in removeBundleItem()
85 items.remove(item); in removeBundleItem()
92 * Returns the number of items stored in the group
95 return items.size(); in getItemCount()
[all …]
/third_party/mesa3d/src/mesa/program/
Dprog_cache.c49 struct cache_item **items; member
86 struct cache_item **items; in rehash() local
93 items = malloc(size * sizeof(*items)); in rehash()
94 memset(items, 0, size * sizeof(*items)); in rehash()
97 for (c = cache->items[i]; c; c = next) { in rehash()
99 c->next = items[c->hash % size]; in rehash()
100 items[c->hash % size] = c; in rehash()
103 free(cache->items); in rehash()
104 cache->items = items; in rehash()
119 for (c = cache->items[i]; c; c = next) { in clear_cache()
[all …]
/third_party/skia/third_party/externals/harfbuzz/src/
Dhb-map.hh94 item_t *items; member
104 hb_swap (a.items, b.items); in swap()
112 items = nullptr; in init_shallow()
121 hb_free (items); in fini_shallow()
122 items = nullptr; in fini_shallow()
155 item_t *old_items = items; in resize()
161 items = new_items; in resize()
163 /* Insert back old items. */ in resize()
181 if (unlikely (!items)) return vINVALID; in get()
183 return items[i].is_real () && items[i] == key ? items[i].value : vINVALID; in get()
[all …]
/third_party/libwebsockets/READMEs/
DREADME.lws_cache.md3 lws_cache implements a single- or multi-level cache for generic payload items
10 a complete set of cached items, earlier levels may be empty or contain a partial
24 The max heap footprint of its items and max number of items can be capped. LRU
25 tracking is performed so the least recently relevant items are evicted first.
28 Time To Live (TTL) tracking is also performed automatically, so cached items
35 Items in L1 can be accessed in heap casually and reliably if the following is
38 - Any return to the event loop may perform removal of cache items due to TTL
41 - Any operation that writes new items may evict items from non-last
46 or removing items in the cache.
74 storage for the items, this would close the file and leave any entries as they
[all …]
/third_party/gn/src/gn/
Dvector_utils.h13 // de-duplicate one or more sets of items of type T, then iterate over the
17 // input items in order to minimize memory usage. Callers should ensure the
18 // items added to this sorter do not change until the instance is destroyed.
22 // 2) Add items using one of the Add() methods, as many times as
23 // necessary. Note that this records only pointers to said items
27 // items.
30 // copies of the original sorted / deduplicated items.
37 // input items is known in advance.
48 // Add one range of items to the sorter.
56 // Add one range of items to the sorter.
[all …]

12345678910>>...129