Home
last modified time | relevance | path

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

12345678910>>...180

/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.py23 self.items = [ustr(c) for c in ('a', 'b', 'c')]
32 self.s = WeakSet(self.items)
33 self.d = dict.fromkeys(self.items)
69 self.assertEqual(self.s, WeakSet(self.items))
73 x = WeakSet(self.items + self.items2)
77 self.assertEqual(len(u), len(self.items) + len(self.items2))
80 self.assertEqual(len(u), len(self.items) + len(self.items2))
96 self.assertEqual(i.intersection(C(self.items)), x)
115 self.assertEqual(self.s, WeakSet(self.items))
128 self.assertEqual(self.s, WeakSet(self.items))
[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 …]
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 …]
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 …]
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 …]
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))
DcouldNotSelectGenericOverload.symbols2 function makeArray<T>(items: T[]): T[] { return items; }
5 >items : Symbol(items, Decl(couldNotSelectGenericOverload.ts, 0, 22))
8 >items : Symbol(items, Decl(couldNotSelectGenericOverload.ts, 0, 22))
22 function makeArray2(items: any[]): any[] { return items; }
24 >items : Symbol(items, Decl(couldNotSelectGenericOverload.ts, 5, 20))
25 >items : Symbol(items, Decl(couldNotSelectGenericOverload.ts, 5, 20))
DarrayConcat2.types8 >a.concat : { (...items: ConcatArray<string>[]): string[]; (...items: (string | ConcatArray<string>…
10 >concat : { (...items: ConcatArray<string>[]): string[]; (...items: (string | ConcatArray<string>)[…
16 >a.concat : { (...items: ConcatArray<string>[]): string[]; (...items: (string | ConcatArray<string>…
18 >concat : { (...items: ConcatArray<string>[]): string[]; (...items: (string | ConcatArray<string>)[…
28 >b.concat : { (...items: ConcatArray<string>[]): string[]; (...items: (string | ConcatArray<string>…
30 >concat : { (...items: ConcatArray<string>[]): string[]; (...items: (string | ConcatArray<string>)[…
/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/glib/tests/
Dcompletion-test.c31 GList *items; in main() local
37 items = NULL; in main()
38 items = g_list_append (items, "a\302\243"); in main()
39 items = g_list_append (items, "a\302\244"); in main()
40 items = g_list_append (items, "bb"); in main()
41 items = g_list_append (items, "bc"); in main()
42 g_completion_add_items (cmp, items); in main()
43 g_list_free (items); in main()
45 items = g_completion_complete (cmp, "a", &prefix); in main()
47 g_assert (g_list_length (items) == 2); in main()
[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/npm/node_modules/har-validator/node_modules/json-schema-traverse/spec/fixtures/
Dschema.js5 items: subschema('items'), property
14 items: [ property
70 .concat(expectedCalls('items'))
79 … [schema.allOf[2].items[0], '/allOf/2/items/0', schema, '/allOf/2', 'items', schema.allOf[2], 0],
80 …lOf[2].items[0].properties.foo_items_0, '/allOf/2/items/0/properties/foo_items_0', schema, '/allOf…
81 …lOf[2].items[0].properties.bar_items_0, '/allOf/2/items/0/properties/bar_items_0', schema, '/allOf…
82 …[schema.allOf[2].items[0].anyOf[0], '/allOf/2/items/0/anyOf/0', schema, '/allOf/2/items/0', 'anyOf…
83 …[schema.allOf[2].items[0].anyOf[1], '/allOf/2/items/0/anyOf/1', schema, '/allOf/2/items/0', 'anyOf…
85 … [schema.allOf[2].items[1], '/allOf/2/items/1', schema, '/allOf/2', 'items', schema.allOf[2], 1],
86 …lOf[2].items[1].properties.foo_items_1, '/allOf/2/items/1/properties/foo_items_1', schema, '/allOf…
[all …]
/third_party/boost/tools/build/src/engine/
Dhash.cpp31 /* Header attached to all hash table data items. */
52 int bloat; /* tab.nel / items.nel */
61 int more; /* how many more ITEMs fit in lists[ list ] */
62 ITEM * free; /* free list of items */
63 char * next; /* where to put more ITEMs in lists[ list ] */
65 int nel; /* total ITEMs held by all lists[] */
70 int nel; /* total ITEMs held by this list */
71 char * base; /* base of ITEMs array */
73 } items; member
106 hp->items.more = 0; in hashinit()
[all …]
/third_party/glib/glib/deprecated/
Dgcompletion.c54 * A #GCompletion is created using g_completion_new(). Target items are
61 * Items in the completion can be simple strings (e.g. filenames), or
74 * @items: list of target items (strings or data structures).
76 * target item. It is %NULL if the target items are strings.
79 * @cache: the list of items which begin with @prefix.
92 * This is used when you use data structures as #GCompletion items.
105 * #GCompletion items.
120 * be used as the #GCompletion items.
132 gcomp->items = NULL; in g_completion_new()
144 * @items: (transfer none): the list of items to add.
[all …]
/third_party/flutter/flutter/packages/flutter/test/widgets/
Dsliver_list_test.dart11 final List<int> items = List<int>.generate(20, (int i) => i);
19 items: items,
33 items: items.reversed.toList(),
58 final List<int> items = List<int>.generate(20, (int i) => i);
66 items: items,
80 items: items.map<int>((int i) => i + 100).toList(),
110 final List<int> items = List<int>.generate(20, (int i) => i);
114 final double scrollPosition = items.length * itemHeight - viewportHeight;
118 items: items,
133 items: items.sublist(0, items.length - 1),
[all …]
/third_party/glib/gio/
Dgliststore.c35 * items in memory.
53 GSequence *items; member
95 g_clear_pointer (&store->items, g_sequence_free); in g_list_store_dispose()
151 * The type of items contained in this list store. Items must be in g_list_store_class_init()
174 return g_sequence_get_length (store->items); in g_list_store_get_n_items()
195 it = g_sequence_get_iter_at_pos (store->items, position); in g_list_store_get_item()
218 store->items = g_sequence_new (g_object_unref); in g_list_store_init()
225 * @item_type: the #GType of items in the list
227 * Creates a new #GListStore with items of type @item_type. @item_type
258 * Use g_list_store_splice() to insert multiple items at the same time
[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/harfbuzz/src/
Dhb-map.hh71 item_t *items; member
79 items = nullptr; in init_shallow()
88 free (items); in fini_shallow()
89 items = nullptr; in fini_shallow()
122 item_t *old_items = items; in resize()
128 items = new_items; in resize()
130 /* Insert back old items. */ in resize()
150 if (unlikely (!items)) return vINVALID; in get()
152 return items[i].is_real () && items[i] == key ? items[i].value : vINVALID; in get()
172 if (items) in clear()
[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 …]

12345678910>>...180