Home
last modified time | relevance | path

Searched refs:entries (Results 126 - 150 of 801) sorted by relevance

12345678910>>...33

/third_party/node/test/parallel/
H A Dtest-dgram-udp6-link-local-address.js13 for (const [ifname, entries] of Object.entries(os.networkInterfaces())) {
14 for (const { address, family, scopeid } of entries) {
H A Dtest-http2-pack-end-stream-flag.js35 const entries = list.getEntries();
36 for (let n = 0; n < entries.length; n++) {
37 const entry = entries[n];
/third_party/vk-gl-cts/framework/common/
H A DtcuFunctionLibrary.cpp41 StaticFunctionLibrary::StaticFunctionLibrary (const Entry* entries, int numEntries) in StaticFunctionLibrary() argument
44 m_functions.insert(std::make_pair(std::string(entries[entryNdx].name), entries[entryNdx].ptr)); in StaticFunctionLibrary()
/third_party/skia/third_party/externals/angle2/src/common/
H A DFastVector_unittest.cpp351 std::set<KeyValuePair> entries = {KeyValuePair(17, "testing"), KeyValuePair(63, "fast"), in TEST()
358 testMap.insert(entries.begin()->first, entries.begin()->second); in TEST()
359 EXPECT_TRUE(testMap.contains(entries.begin()->first)); in TEST()
360 EXPECT_FALSE(testMap.contains(entries.rbegin()->first)); in TEST()
363 EXPECT_TRUE(testMap.get(entries.begin()->first, &str)); in TEST()
364 EXPECT_EQ(entries.begin()->second, str); in TEST()
371 for (KeyValuePair entry : entries) in TEST()
377 for (KeyValuePair entry : entries) in TEST()
/third_party/skia/third_party/externals/dawn/src/tests/unittests/wire/
H A DWireArgumentTests.cpp53 bglDescriptor.entries = nullptr; in TEST_F()
62 bindGroupDescriptor.entries = nullptr; in TEST_F()
273 bglDescriptor.entries = nullptr;
301 WGPUBindGroupLayoutEntry entries[NUM_BINDINGS]{
326 bglDescriptor.entries = entries;
333 apiDevice, MatchesLambda([entries](const WGPUBindGroupLayoutDescriptor* desc) -> bool {
335 const auto& a = desc->entries[i];
336 const auto& b = entries[i];
H A DWireOptionalTests.cpp48 bgDesc.entries = &entry; in TEST_F()
56 desc->entries[0].binding == 0 && in TEST_F()
57 desc->entries[0].sampler == nullptr && in TEST_F()
58 desc->entries[0].buffer == nullptr && in TEST_F()
59 desc->entries[0].textureView == nullptr; in TEST_F()
/third_party/skia/third_party/externals/harfbuzz/src/
H A Dhb-aat-layout-common.hh242 const LookupSingle<T> *v = entries.bsearch (glyph_id); in get_value()
249 return_trace (entries.sanitize (c)); in sanitize()
254 return_trace (entries.sanitize (c, base)); in sanitize()
260 entries; /* The actual entries, sorted by glyph index. */ member
262 DEFINE_SIZE_ARRAY (8, entries);
519 const Entry<Extra> *entries = (this+entryTable).arrayZ; in get_entry() local
524 return entries[entry]; in get_entry()
536 const Entry<Extra> *entries = (this+entryTable).arrayZ; in sanitize() local
608 if (unlikely (!c->check_array (entries, num_entrie in sanitize()
[all...]
/third_party/skia/third_party/externals/dawn/src/tests/unittests/validation/
H A DMinimumBufferSizeValidationTests.cpp218 std::vector<wgpu::BindGroupLayoutEntry> entries; in CreateBindGroupLayout() local
227 entries.push_back(e); in CreateBindGroupLayout()
231 descriptor.entryCount = static_cast<uint32_t>(entries.size()); in CreateBindGroupLayout()
232 descriptor.entries = entries.data(); in CreateBindGroupLayout()
259 std::vector<wgpu::BindGroupEntry> entries; in CreateBindGroup() local
260 entries.reserve(bindingSizes.size()); in CreateBindGroup()
268 entries.push_back(entry); in CreateBindGroup()
273 descriptor.entryCount = entries.size(); in CreateBindGroup()
274 descriptor.entries in CreateBindGroup()
[all...]
/third_party/ffmpeg/libavformat/
H A Dseek.c66 AVIndexEntry *entries, *ie; in ff_add_index_entry() local
81 entries = av_fast_realloc(*index_entries, in ff_add_index_entry()
85 if (!entries) in ff_add_index_entry()
88 *index_entries = entries; in ff_add_index_entry()
94 ie = &entries[index]; in ff_add_index_entry()
97 ie = &entries[index]; in ff_add_index_entry()
101 memmove(entries + index + 1, entries + index, in ff_add_index_entry()
128 int ff_index_search_timestamp(const AVIndexEntry *entries, int nb_entries, in ff_index_search_timestamp() argument
137 // Optimize appending index entries a in ff_index_search_timestamp()
[all...]
H A Dbinka.c37 int entries, offset; in binka_read_header() local
52 entries = avio_rl16(pb); in binka_read_header()
54 offset = entries * 2 + 2; in binka_read_header()
/third_party/alsa-utils/axfer/
H A Dxfer.c44 } *entry, entries[] = { in xfer_context_init() local
57 for (i = 0; i < ARRAY_SIZE(entries); ++i) { in xfer_context_init()
58 if (entries[i].type == type) in xfer_context_init()
61 if (i == ARRAY_SIZE(entries)) in xfer_context_init()
63 entry = &entries[i]; in xfer_context_init()
/third_party/protobuf/js/experimental/runtime/
H A Dint64_test.js118 for (const [hex, decimals] of Object.entries(decimalHexPairs)) {
125 for (const [hex, decimals] of Object.entries(decimalHexPairs)) {
133 for (const [hex, decimals] of Object.entries(decimalHexPairs)) {
144 for (const [hex, decimals] of Object.entries(decimalHexPairs)) {
155 for (const [hex, decimals] of Object.entries(decimalHexPairs)) {
/third_party/icu/icu4j/samples/src/com/ibm/icu/samples/iuc/
H A DPopulationData.java51 public static Set<TerritoryEntry> getTerritoryEntries(Locale loc, Set<TerritoryEntry> entries) { in getTerritoryEntries() argument
65 entries.add(new TerritoryEntry(territory.getDisplayCountry(ULocale.forLocale(loc)), SupplementalUtilities.ldml2d(vec[2]))); in getTerritoryEntries()
67 return entries; in getTerritoryEntries()
/third_party/libphonenumber/cpp/src/phonenumbers/geocoding/
H A Darea_code_map.cc43 const int entries = storage_->GetNumOfEntries(); in Lookup() local
44 if (!entries) { in Lookup()
56 int current_index = entries - 1; in Lookup()
/third_party/skia/third_party/externals/spirv-tools/source/
H A Dtable.h69 const spv_operand_desc_t* entries; member
83 const spv_ext_inst_desc_t* entries; member
88 const spv_opcode_desc_t* entries; member
124 // Populates *table with entries for env.
127 // Populates *table with entries for env.
130 // Populates *table with entries for env.
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/
H A Dtable.h69 const spv_operand_desc_t* entries; member
83 const spv_ext_inst_desc_t* entries; member
88 const spv_opcode_desc_t* entries; member
124 // Populates *table with entries for env.
127 // Populates *table with entries for env.
130 // Populates *table with entries for env.
/third_party/pulseaudio/src/pulsecore/
H A Dqueue.c32 PA_STATIC_FLIST_DECLARE(entries, 0, pa_xfree);
74 if (!(e = pa_flist_pop(PA_STATIC_FLIST_GET(entries)))) in pa_queue_push()
110 if (pa_flist_push(PA_STATIC_FLIST_GET(entries), e) < 0) in pa_queue_pop()
/third_party/spirv-tools/source/
H A Dtable.h69 const spv_operand_desc_t* entries; member
83 const spv_ext_inst_desc_t* entries; member
88 const spv_opcode_desc_t* entries; member
124 // Populates *table with entries for env.
127 // Populates *table with entries for env.
130 // Populates *table with entries for env.
/third_party/node/deps/v8/tools/
H A Dgen-postmortem-metadata.py489 entries = typestr.split(',');
490 for entry in entries:
492 entries = torque_typestr.split('\\')
493 for entry in entries:
496 entries = torque_fulldefstr.split('\\')
497 for entry in entries:
/third_party/node/deps/undici/src/lib/mock/
H A Dmock-utils.js34 Object.entries(headers).map(([headerName, headerValue]) => {
63 const entries = []
65 entries.push([clone[index], clone[index + 1]])
67 return Object.fromEntries(entries)
84 for (const [matchHeaderName, matchHeaderValue] of Object.entries(mockDispatch.headers)) {
191 return Object.entries(data).reduce((keyValuePairs, [key, value]) => [
/third_party/node/deps/npm/node_modules/path-scurry/dist/cjs/
H A Dindex.js77 // set after successfully calling readdir() and getting entries.
86 // cannot have child entries -- also verify &IFMT is either IFDIR or IFLNK
138 // thousands of Path entries when walking extremely large trees, the "children"
139 // in this tree are represented by storing an array of Path entries in an
143 // benefit as much from having the cached entries, but huge directory walks
149 * an LRUCache for storing child entries.
200 * a reference to the parent path, or undefined in the case of root entries
300 * For root entries, it's the path to the entry itself.
519 * link, or whether it has child entries.
622 * Returns the cached child Path entries arra
[all...]
/third_party/node/deps/npm/node_modules/path-scurry/dist/mjs/
H A Dindex.js51 // set after successfully calling readdir() and getting entries.
60 // cannot have child entries -- also verify &IFMT is either IFDIR or IFLNK
111 // thousands of Path entries when walking extremely large trees, the "children"
112 // in this tree are represented by storing an array of Path entries in an
116 // benefit as much from having the cached entries, but huge directory walks
122 * an LRUCache for storing child entries.
172 * a reference to the parent path, or undefined in the case of root entries
272 * For root entries, it's the path to the entry itself.
491 * link, or whether it has child entries.
594 * Returns the cached child Path entries arra
[all...]
/third_party/node/test/fixtures/wpt/user-timing/resources/
H A Dwebperftestharnessextension.js52 function test_resource_entries(entries, expected_entries)
58 for (var i = 0; i < entries.length; ++i) {
59 var entry = entries[i];
65 test_fail(expected_entry + ' is not expected to have duplicate entries');
72 test_fail(entries[i].name + ' is not expected to be in the Resource Timing buffer');
127 test_equals(entryList.length, expectedLength, testDescription + 'There should be ' + expectedLength + ' entries.');
/third_party/mesa3d/src/gallium/drivers/nouveau/nv50/
H A Dnv50_screen.h87 void **entries; member
93 void **entries; member
204 screen->tic.entries[tic->id] = NULL; in nv50_screen_tic_free()
213 screen->tsc.entries[tsc->id] = NULL; in nv50_screen_tsc_free()
/third_party/mesa3d/src/util/
H A Dhash_table.h57 uint32_t entries; member
88 return ht->entries; in _mesa_hash_table_num_entries()
146 * It is not safe to use when inserting or removing entries.
150 (ht)->entries; \
152 (ht)->entries--, entry = _mesa_hash_table_next_entry_unsafe(ht, entry))

Completed in 13 milliseconds

12345678910>>...33