Home
last modified time | relevance | path

Searched refs:item (Results 151 - 175 of 1577) sorted by relevance

12345678910>>...64

/third_party/typescript/tests/baselines/reference/
H A DinterfaceImplementation6.js3 item:number;
7 public item:number;
11 private item:number;
16 var item: number;
21 private pt: I1 = { item: 1 };
44 var item;
50 this.pt = { item: 1 };
H A Dfor-of58.js7 for (const item of arr) {
8 item.x;
9 item.y;
14 for (const item of arr) {
15 item.x;
16 item.y;
/third_party/rust/crates/rust-openssl/openssl-macros/src/
H A Dlib.rs9 pub fn corresponds(attr: TokenStream, item: TokenStream) -> TokenStream { in corresponds()
11 let item = parse_macro_input!(item as ItemFn); in corresponds()
19 let attrs = item.attrs; in corresponds()
20 let vis = item.vis; in corresponds()
21 let sig = item.sig; in corresponds()
22 let block = item.block; in corresponds()
/third_party/python/Lib/idlelib/
H A Dstackviewer.py11 global sc, item, node # For testing.
16 item = StackTreeItem(flist, tb)
17 node = TreeNode(sc.canvas, None, item)
55 item = FrameTreeItem(info, self.flist)
56 sublist.append(item)
78 item = "%s, line %d: %s" % (modname, lineno, sourceline)
80 item = "%s.%s(...), line %d: %s" % (modname, funcname,
82 return item
88 item = VariablesTreeItem("<locals>", frame.f_locals, self.flist)
89 sublist.append(item)
[all...]
/third_party/lzma/CPP/Common/
H A DWildcard.cpp344 void CCensorNode::AddItemSimple(bool include, CItem &item) in AddItemSimple() argument
347 items.Add(item); in AddItemSimple()
350 void CCensorNode::AddItem(bool include, CItem &item, int ignoreWildcardIndex) in AddItem() argument
352 if (item.PathParts.Size() <= 1) in AddItem()
354 if (item.PathParts.Size() != 0 && item.WildcardMatching) in AddItem()
356 if (!DoesNameContainWildcard(item.PathParts.Front())) in AddItem()
357 item.WildcardMatching = false; in AddItem()
359 AddItemSimple(include, item); in AddItem()
363 const UString &front = item in AddItem()
395 const CItem &item = IncludeItems[i]; NeedCheckSubDirs() local
729 CItem item; AddItem() local
[all...]
/third_party/mesa3d/src/intel/tools/
H A Dintel_noop_drm_shim.c263 query_write_topology(struct drm_i915_query_item *item) in query_write_topology() argument
266 (void *) (uintptr_t) item->data_ptr; in query_write_topology()
274 if (item->length == 0) { in query_write_topology()
275 item->length = length; in query_write_topology()
279 if (item->length < length) { in query_write_topology()
336 struct drm_i915_query_item *item = &items[i]; in i915_ioctl_query() local
338 switch (item->query_id) { in i915_ioctl_query()
340 int ret = query_write_topology(item); in i915_ioctl_query()
342 item->length = ret; in i915_ioctl_query()
352 (struct drm_i915_query_engine_info*)(uintptr_t)item in i915_ioctl_query()
[all...]
/third_party/rust/crates/bindgen/bindgen/ir/analysis/
H A Dtemplate_params.rs74 //! problem (where the set of template parameters used by a given IR item is the
75 //! union of its sub-item's used template parameters) and iterate to a
79 //! fix-point analysis, where our lattice is the mapping from each IR item to
83 //! lattice's bottom element: every item mapping to an empty set of template
84 //! parameters. Our analysis only adds members to each item's set of used
93 use crate::ir::item::{Item, ItemSet};
99 /// An analysis that finds for each IR item its set of template parameters that
126 /// * Finally, for all other IR item kinds, we use our lattice's `join`
127 /// operation: set union with each successor of the given item's template
214 "Should have a set of used template params for every item \ in take_this_id_usage_set()
[all...]
/third_party/alsa-lib/src/alisp/
H A Dalisp_snd.c26 struct alisp_object * (*func) (struct alisp_instance *instance, struct acall_table * item, struct alisp_object * args);
285 static struct alisp_object * FA_int_pp_strp_int(struct alisp_instance * instance, struct acall_table * item, struct alisp_object * args) in FA_int_pp_strp_int() argument
306 err = ((snd_int_pp_strp_int_t)item->xfunc)(&handle, name, mode); in FA_int_pp_strp_int()
308 return new_result1(instance, err, item->prefix, handle); in FA_int_pp_strp_int()
311 static struct alisp_object * FA_int_pp_p(struct alisp_instance * instance, struct acall_table * item, struct alisp_object * args) in FA_int_pp_p() argument
318 if (item->xfunc == &snd_hctl_open_ctl) in FA_int_pp_p()
330 err = ((snd_int_pp_p_t)item->xfunc)(&handle, handle); in FA_int_pp_p()
331 return new_result1(instance, err, item->prefix, handle); in FA_int_pp_p()
334 static struct alisp_object * FA_p_p(struct alisp_instance * instance, struct acall_table * item, struct alisp_object * args) in FA_p_p() argument
340 if (item in FA_p_p()
361 FA_int_p(struct alisp_instance * instance, struct acall_table * item, struct alisp_object * args) FA_int_p() argument
375 FA_str_p(struct alisp_instance * instance, struct acall_table * item, struct alisp_object * args) FA_str_p() argument
389 FA_int_intp(struct alisp_instance * instance, struct acall_table * item, struct alisp_object * args) FA_int_intp() argument
407 FA_int_str(struct alisp_instance * instance, struct acall_table * item, struct alisp_object * args) FA_int_str() argument
425 FA_int_int_strp(struct alisp_instance * instance, struct acall_table * item, struct alisp_object * args) FA_int_int_strp() argument
445 FA_card_info(struct alisp_instance * instance, struct acall_table * item, struct alisp_object * args) FA_card_info() argument
524 FA_hctl_find_elem(struct alisp_instance * instance, struct acall_table * item, struct alisp_object * args) FA_hctl_find_elem() argument
545 FA_hctl_elem_info(struct alisp_instance * instance, struct acall_table * item, struct alisp_object * args) FA_hctl_elem_info() argument
589 unsigned int items, item; FA_hctl_elem_info() local
623 FA_hctl_elem_read(struct alisp_instance * instance, struct acall_table * item, struct alisp_object * args) FA_hctl_elem_read() argument
685 FA_hctl_elem_write(struct alisp_instance * instance, struct acall_table * item, struct alisp_object * args) FA_hctl_elem_write() argument
750 FA_pcm_info(struct alisp_instance * instance, struct acall_table * item, struct alisp_object * args) FA_pcm_info() argument
820 struct acall_table key, *item; F_acall() local
[all...]
/test/testfwk/developer_test/aw/python/distributed/common/
H A Dmanager.py62 for item in device_info_list:
63 if len(item) != 4:
65 if item[1] == "phone":
68 device = self.make_device_adapter(item, device_name)
71 elif item[1] == "ivi":
74 device = self.make_device_adapter(item, device_name)
77 elif item[1] == "tv":
80 device = self.make_device_adapter(item, device_name)
83 elif item[1] == "watch":
86 device = self.make_device_adapter(item, device_nam
[all...]
/third_party/cJSON/tests/
H A Dparse_number.c31 static cJSON item[1]; variable
52 TEST_ASSERT_TRUE(parse_number(item, &buffer)); in assert_parse_number()
53 assert_is_number(item); in assert_parse_number()
54 TEST_ASSERT_EQUAL_INT(integer, item->valueint); in assert_parse_number()
55 TEST_ASSERT_EQUAL_DOUBLE(real, item->valuedouble); in assert_parse_number()
71 TEST_ASSERT_TRUE(parse_number(item, &buffer)); in assert_parse_int64_number()
72 TEST_ASSERT_EQUAL_INT64(integer, item->valueint); in assert_parse_int64_number()
73 TEST_ASSERT_EQUAL_DOUBLE(real, item->valuedouble); in assert_parse_int64_number()
79 assert_is_int64(item); in assert_parse_int64_number_with_type()
150 /* initialize cJSON item */ in main()
[all...]
/third_party/protobuf/csharp/src/Google.Protobuf/
H A DExtensionRegistry.cs122 public bool Contains(Extension item) in Contains() argument
124 ProtoPreconditions.CheckNotNull(item, nameof(item)); in Contains()
126 return extensions.ContainsKey(new ObjectIntPair<Type>(item.TargetType, item.FieldNumber)); in Contains()
165 /// <param name="item">The extension</param>
167 public bool Remove(Extension item) in Remove() argument
169 ProtoPreconditions.CheckNotNull(item, nameof(item)); in Remove()
171 return extensions.Remove(new ObjectIntPair<Type>(item in Remove()
[all...]
/third_party/pulseaudio/src/pulsecore/
H A Dllist.h32 /* The pointers in the linked list's items. Use this in the item structure */
37 #define PA_LLIST_HEAD_INIT(t,item) \
39 (item) = (t*) NULL; } \
42 /* Initialize a list item */
43 #define PA_LLIST_INIT(t,item) \
45 t *_item = (item); \
50 /* Prepend an item to the list */
51 #define PA_LLIST_PREPEND(t,head,item) \
53 t **_head = &(head), *_item = (item); \
61 /* Remove an item fro
[all...]
/third_party/ntfs-3g/libntfs-3g/
H A Dcache.c213 const struct CACHED_GENERIC *item, in ntfs_enter_cache()
228 h = cache->dohash(item); in ntfs_enter_cache()
230 while (link && compare(link->entry, item)) in ntfs_enter_cache()
245 && compare(current, item)) { in ntfs_enter_cache()
262 if (item->varsize) { in ntfs_enter_cache()
264 item->varsize); in ntfs_enter_cache()
267 current->varsize = item->varsize; in ntfs_enter_cache()
281 if (item->varsize) { in ntfs_enter_cache()
285 item->varsize); in ntfs_enter_cache()
288 item in ntfs_enter_cache()
212 ntfs_enter_cache(struct CACHE_HEADER *cache, const struct CACHED_GENERIC *item, cache_compare compare) ntfs_enter_cache() argument
374 ntfs_invalidate_cache(struct CACHE_HEADER *cache, const struct CACHED_GENERIC *item, cache_compare compare, int flags) ntfs_invalidate_cache() argument
432 ntfs_remove_cache(struct CACHE_HEADER *cache, struct CACHED_GENERIC *item, int flags) ntfs_remove_cache() argument
[all...]
/third_party/node/deps/npm/node_modules/node-gyp/gyp/pylib/packaging/
H A Dspecifiers.py92 def contains(self, item: str, prereleases: Optional[bool] = None) -> bool:
94 Determines if the given item is contained within this specifier.
384 # We want everything but the last item in the version, but we want to
514 def __contains__(self, item: Union[str, Version]) -> bool:
515 """Return whether or not the item is contained in this specifier.
517 :param item: The item to check for.
533 return self.contains(item)
536 self, item: UnparsedVersion, prereleases: Optional[bool] = None
538 """Return whether or not the item i
[all...]
/third_party/libwebsockets/minimal-examples/api-tests/api-test-lecp/
H A Dmain.c1027 struct lecp_item item; member
2009 { .reason = LECPCB_VAL_NUM_UINT, .item = { .u.u64 = 0 } },
2013 { .reason = LECPCB_VAL_NUM_UINT, .item = { .u.u64 = 1 } },
2017 { .reason = LECPCB_VAL_NUM_UINT, .item = { .u.u64 = 10 } },
2021 { .reason = LECPCB_VAL_NUM_UINT, .item = { .u.u64 = 23 } },
2025 { .reason = LECPCB_VAL_NUM_UINT, .item = { .u.u64 = 24 } },
2029 { .reason = LECPCB_VAL_NUM_UINT, .item = { .u.u64 = 25 } },
2033 { .reason = LECPCB_VAL_NUM_UINT, .item = { .u.u64 = 100 } },
2037 { .reason = LECPCB_VAL_NUM_UINT, .item = { .u.u64 = 1000 } },
2041 { .reason = LECPCB_VAL_NUM_UINT, .item
[all...]
/test/testfwk/developer_test/local_coverage/interface_coverage/
H A Dmake_report.py124 for item in summary_list:
125 subsystem = item[0]
130 nocoverd = item[1] - item[2]
131 report_title = report_title % (item[1], item[2], nocoverd)
173 for item in summary_list:
174 content = table_line % (item[0], str(item[1]), str(item[
[all...]
/third_party/jinja2/
H A Dasyncfilters.py11 async for item in value:
12 seq.append(item)
14 for item in value:
15 seq.append(item)
22 async for item in auto_aiter(seq):
23 if func(item):
24 yield item
72 return environment.undefined("No first item, sequence was empty.")
120 async for item in auto_aiter(seq):
121 yield await auto_await(func(item))
[all...]
/third_party/node/deps/v8/third_party/jinja2/
H A Dasyncfilters.py11 async for item in value:
12 seq.append(item)
14 for item in value:
15 seq.append(item)
22 async for item in auto_aiter(seq):
23 if func(item):
24 yield item
72 return environment.undefined("No first item, sequence was empty.")
120 async for item in auto_aiter(seq):
121 yield await auto_await(func(item))
[all...]
/third_party/node/tools/inspector_protocol/jinja2/
H A Dasyncfilters.py10 async for item in value:
11 seq.append(item)
13 for item in value:
14 seq.append(item)
22 async for item in auto_aiter(seq):
23 if func(item):
24 yield item
66 return environment.undefined('No first item, sequence was empty.')
111 async for item in auto_aiter(seq):
112 yield func(item)
[all...]
/third_party/skia/third_party/externals/jinja2/
H A Dasyncfilters.py11 async for item in value:
12 seq.append(item)
14 for item in value:
15 seq.append(item)
22 async for item in auto_aiter(seq):
23 if func(item):
24 yield item
72 return environment.undefined("No first item, sequence was empty.")
120 async for item in auto_aiter(seq):
121 yield await auto_await(func(item))
[all...]
/third_party/skia/third_party/externals/freetype/tests/scripts/
H A Ddownload-test-fonts.py18 # download item is a dictionary with one of the following schemas:
20 # - File item:
201 item: dict, install_dir: str, force_download: bool
203 """Download and install one item.
206 item: Download item as a dictionary, see above for schema.
218 if "file_url" in item:
219 file_url = item["file_url"]
220 install_name = item.get("install_name", os.path.basename(file_url))
222 hex_digest = item
[all...]
/third_party/python/Modules/_sre/
H A Dsre.c818 PyObject* item; in _sre_SRE_Pattern_findall_impl() local
840 item = getslice(state.isbytes, state.beginning, in _sre_SRE_Pattern_findall_impl()
842 if (!item) in _sre_SRE_Pattern_findall_impl()
846 item = state_getslice(&state, 1, string, 1); in _sre_SRE_Pattern_findall_impl()
847 if (!item) in _sre_SRE_Pattern_findall_impl()
851 item = PyTuple_New(self->groups); in _sre_SRE_Pattern_findall_impl()
852 if (!item) in _sre_SRE_Pattern_findall_impl()
857 Py_DECREF(item); in _sre_SRE_Pattern_findall_impl()
860 PyTuple_SET_ITEM(item, i, o); in _sre_SRE_Pattern_findall_impl()
865 status = PyList_Append(list, item); in _sre_SRE_Pattern_findall_impl()
962 PyObject* item; _sre_SRE_Pattern_split_impl() local
1060 PyObject* item; pattern_subx() local
1342 PyObject *item = PyUnicode_FromString(flag_names[i].name); pattern_repr() local
1355 PyObject *item = PyUnicode_FromFormat("0x%x", flags); pattern_repr() local
2139 PyObject* item = match_getslice( match_group() local
2180 PyObject* item; _sre_SRE_Match_groups_impl() local
2287 PyObject* item; _pair() local
2337 PyObject* item; match_regs() local
[all...]
/third_party/icu/icu4c/source/test/depstest/
H A Ddepstest.py119 item = dependencies.items[name]
120 item_type = item["type"]
125 exports = item.get("exports")
126 if exports != None: return item
131 system_symbols = item.get("system_symbols")
132 if system_symbols == None: system_symbols = item["system_symbols"] = set()
133 files = item.get("files")
140 deps = item.get("deps")
144 # Detect whether this item needs to depend on dep,
145 # except when this item ha
[all...]
/third_party/gn/src/gn/
H A Dvector_utils.h42 // Add one single item to the sorter.
43 void Add(const T& item) { in Add() argument
44 ptrs_.push_back(&item); in Add()
64 // |item_callback| is a callable that will be invoked for each item in the
72 for (const T* item : ptrs_) { in IterateOver()
73 if (!prev_item || *prev_item != *item) { in IterateOver()
74 item_callback(*item); in IterateOver()
75 prev_item = item; in IterateOver()
85 IterateOver([&result](const T& item) { result.push_back(item); }); in AsVector()
[all...]
/third_party/mesa3d/ohos/
H A DmodifyDtsi.py53 item = ''
55 item = newText[2:-11]
57 item = newText[:-2]
61 if(item in line):
62 if ((item + "=y" in line) or (item + " is not set" in line)):
63 print("Already has this item: " + item)
66 assert positionInedx >= 0, "If want to add an item, first 'positionInedx' must be >= 0"
71 print("Add item
[all...]

Completed in 15 milliseconds

12345678910>>...64