Home
last modified time | relevance | path

Searched refs:first (Results 701 - 725 of 3993) sorted by relevance

1...<<21222324252627282930>>...160

/third_party/python/Modules/cjkcodecs/
H A D_codecs_cn.c55 * codecs in this file use the first byte of MultibyteCodec_State.c[8]
227 utrrange->first != 0; in ENCODER()
229 if (utrrange->first <= c && in ENCODER()
233 tc = c - utrrange->first + in ENCODER()
248 if (utrrange->first == 0) in ENCODER()
302 OUTCHAR(utr->first - utr->base + lseq); in DECODER()
/third_party/vk-gl-cts/framework/randomshaders/
H A DrsgVariableManager.hpp268 std::vector<const ValueEntry*>::const_iterator first = m_entryCache.begin(); in getBegin() local
269 while (first != m_entryCache.end() && !filter(*first)) in getBegin()
270 first++; in getBegin()
271 return ValueEntryIterator<Filter>(first, m_entryCache.end(), filter); in getBegin()
/third_party/libphonenumber/metadata/src/main/java/com/google/i18n/phonenumbers/metadata/
H A DRangeTree.java670 // This is the first time this result was seen, so add it in a new entry. in recurse()
733 private RangeTree union(RangeTree first, RangeTree... rest) { in union() argument
734 Node node = first.root; in union()
775 private RangeTree intersect(RangeTree first, RangeTree... rest) { in intersect() argument
776 Node node = first.root; in intersect()
958 public DigitSequence first() { in first() method in RangeTree
960 DigitSequence first = DigitSequence.empty(); in first()
970 // Exit when we find the first edge for which the minimum length path can be reached. in first()
971 // This is only possible for first() because edges are ordered by their minimum digit in first()
975 first in first()
[all...]
H A DRangeSpecification.java216 // as a contiguous set when finding first/last elements however to avoid worrying about bound in addRangeSpecsOf()
219 DigitSequence start = s.first(); in addRangeSpecsOf()
246 // is not a '0'. This is the first digit that needs to be adjusted to create a range in addRangeSpecs()
247 // specification covering it and the digits 'below' it. For example, the first specification in addRangeSpecs()
257 DigitSequence prefix = start.first(n); in addRangeSpecs()
264 // <first (n-1) digits of 'start'> [loDigit..9] <any digits mask...> in addRangeSpecs()
274 // difference now is that we look for the first digit that's not '9' and generate ranges that in addRangeSpecs()
275 // go down to the start of the range, not up to the end. Thus for ["0000", "1299"] the first in addRangeSpecs()
281 DigitSequence prefix = end.first(n); in addRangeSpecs()
288 // <first ( in addRangeSpecs()
608 public RangeSpecification first(int n) { first() method in RangeSpecification
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/SelectionDAG/
H A DLegalizeTypes.cpp401 // Otherwise, this node is new: this is the first operand of it that in run()
508 // This is the first operand to change - add all operands so far. in AnalyzeNewNode()
738 assert((Entry.first != 0) && "Operand isn't expanded"); in GetExpandedInteger()
739 Lo = getSDValue(Entry.first); in GetExpandedInteger()
767 assert((Entry.first == 0) && "Node already expanded"); in SetExpandedInteger()
768 Entry.first = getTableId(Lo); in SetExpandedInteger()
775 assert((Entry.first != 0) && "Operand isn't expanded"); in GetExpandedFloat()
776 Lo = getSDValue(Entry.first); in GetExpandedFloat()
791 assert((Entry.first == 0) && "Node already expanded"); in SetExpandedFloat()
792 Entry.first in SetExpandedFloat()
[all...]
/third_party/python/Objects/stringlib/
H A Dunicode_format.h313 output: 'first' points to the part before the first '[' or '.'
314 'first_idx' is -1 if 'first' is not an integer, otherwise
315 it's the value of first converted to an integer
319 field_name_split(PyObject *str, Py_ssize_t start, Py_ssize_t end, SubString *first, in field_name_split() argument
328 /* find the part up until the first '.' or '[' */ in field_name_split()
344 SubString_init(first, str, start, i); in field_name_split()
347 /* see if "first" is an integer, in which case it's used as an index */ in field_name_split()
348 *first_idx = get_integer(first); in field_name_split()
352 field_name_is_empty = first in field_name_split()
403 SubString first; get_field_object() local
1247 SubString first; formatter_field_name_split() local
[all...]
/third_party/mesa3d/src/gallium/drivers/r600/sb/
H A Dsb_ir.h176 return KComp()(v1.first, v2.first); in operator ()()
199 return (*(set.insert(P).first)).second; in operator []()
883 : node(nt, nst, flags | NF_CONTAINER), first(), last(), in container_node()
887 node *first, *last; member in r600_sb::container_node
925 iterator begin() { return first; } in begin()
930 bool empty() { assert(first != NULL || first == last); return !first; } in empty()
954 void clear() { first
[all...]
/third_party/node/deps/v8/src/compiler/
H A Dgraph-visualizer.cc832 // Do a post-order depth-first search on the RPO graph. For every node, in operator <<()
986 bool first = true; in operator <<() local
989 if (first) { in operator <<()
990 first = false; in operator <<()
999 first = true; in operator <<()
1002 if (first) { in operator <<()
1003 first = false; in operator <<()
1018 bool first = true; in operator <<() local
1023 if (first) { in operator <<()
1024 first in operator <<()
1044 bool first = true; PrintTopLevelLiveRanges() local
1241 bool first = true; operator <<() local
[all...]
/third_party/libabigail/src/
H A Dabg-leaf-reporter.cc481 class_or_union_sptr first = d.first_class_or_union(), in report()
488 if (filtering::has_class_decl_only_def_change(first, second)) in report()
491 first->get_is_declaration_only() in report()
500 out << indent << "type " << first->get_pretty_representation() in report()
683 class_decl_sptr first = d.first_class_decl(), in report() local
686 report_name_size_and_alignment_changes(first, second, d.context(), in report()
690 maybe_report_diff_for_member(first, second, ctxt, out, indent); in report()
718 union_decl_sptr first = d.first_union_decl(), second = d.second_union_decl(); in report() local
720 report_name_size_and_alignment_changes(first, second, d.context(), in report()
723 maybe_report_diff_for_member(first, secon in report()
[all...]
/third_party/python/Lib/
H A Dipaddress.py171 A tuple containing the first and last IP addresses in the sequence.
175 first = last = next(it)
178 yield first, last
179 first = ip
181 yield first, last
200 def summarize_address_range(first, last):
201 """Summarize a network range given the first and last IP addresses.
211 first: the first IPv4Address or IPv6Address in the range.
219 If the first an
[all...]
/third_party/skia/third_party/externals/angle2/src/libANGLE/renderer/gl/
H A DContextGL.cpp220 GLint first, in setDrawArraysState()
226 (features.shiftInstancedArrayDataWithExtraOffset.enabled && first > 0)) in setDrawArraysState()
234 first, count, instanceCount)); in setDrawArraysState()
240 else if (features.shiftInstancedArrayDataWithExtraOffset.enabled && first == 0) in setDrawArraysState()
311 GLint first, in drawArrays()
322 ANGLE_TRY(setDrawArraysState(context, first, count, instanceCount)); in drawArrays()
325 ANGLE_GL_TRY(context, getFunctions()->drawArrays(ToGLenum(mode), first, count)); in drawArrays()
329 ANGLE_GL_TRY(context, getFunctions()->drawArraysInstanced(ToGLenum(mode), first, count, in drawArrays()
339 GLint first, in drawArraysInstanced()
350 ANGLE_TRY(setDrawArraysState(context, first, coun in drawArraysInstanced()
219 setDrawArraysState(const gl::Context *context, GLint first, GLsizei count, GLsizei instanceCount) setDrawArraysState() argument
309 drawArrays(const gl::Context *context, gl::PrimitiveMode mode, GLint first, GLsizei count) drawArrays() argument
337 drawArraysInstanced(const gl::Context *context, gl::PrimitiveMode mode, GLint first, GLsizei count, GLsizei instanceCount) drawArraysInstanced() argument
435 drawArraysInstancedBaseInstance(const gl::Context *context, gl::PrimitiveMode mode, GLint first, GLsizei count, GLsizei instanceCount, GLuint baseInstance) drawArraysInstancedBaseInstance() argument
[all...]
/third_party/skia/third_party/externals/harfbuzz/src/
H A Dhb-algs.hh475 hb_pair_t (T1 a, T2 b) : first (a), second (b) {} in hb_pair_t()
480 operator hb_pair_t<Q1, Q2> () { return hb_pair_t<Q1, Q2> (first, second); } in operator hb_pair_t()
483 { return hb_pair_t<T1, T2> (second, first); } in reverse()
485 bool operator == (const pair_t& o) const { return first == o.first && second == o.second; } in operator ==()
487 bool operator < (const pair_t& o) const { return first < o.first || (first == o.first && second < o.second); } in operator <()
489 bool operator > (const pair_t& o) const { return first > in operator >=()
492 T1 first; global() member
[all...]
/third_party/node/deps/v8/src/heap/cppgc-js/
H A Dcpp-marking-state-inl.h21 map, object, wrapper_descriptor_.wrappable_type_index, snapshot.first); in ExtractEmbedderDataSnapshot()
29 const EmbedderDataSlot type_slot(snapshot.first); in MarkAndPush()
/third_party/python/Lib/idlelib/idle_test/
H A Dmock_idle.py49 first = self.text.index('1.0')
51 return first, last
/third_party/ffmpeg/libavutil/
H A Dhwcontext_qsv.c130 base_handle[0] = handle_pair->first; in ff_qsv_get_surface_base_handle()
135 base_handle[0] = handle_pair->first; in ff_qsv_get_surface_base_handle()
141 base_handle[0] = handle_pair->first; in ff_qsv_get_surface_base_handle()
424 s->handle_pairs_internal[i].first = child_frames_hwctx->surface_ids + i; in qsv_init_child_ctx()
435 s->handle_pairs_internal[i].first = (mfxMemId)child_frames_hwctx->texture_infos[i].texture; in qsv_init_child_ctx()
454 s->handle_pairs_internal[i].first = (mfxMemId)child_frames_hwctx->surfaces[i]; in qsv_init_child_ctx()
603 pair_dst->first = pair_src->first; in frame_get_hdl()
800 dst_hwctx->surface_ids[i] = *(VASurfaceID*)pair->first; in qsv_frames_derive_from()
820 dst_hwctx->texture_infos[i].texture = (ID3D11Texture2D*)pair->first; in qsv_frames_derive_from()
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Hexagon/
H A DHexagonISelDAGToDAGHVX.cpp208 if (!P.first) in color()
215 Node N = E.first; in color()
219 if (!P.first) in color()
228 Node N = E.first; in color()
237 if (P.first) { in color()
288 dbgs() << " " << E.first << " -> {"; in dump()
309 dbgs() << " " << C.first << " -> " << ColorKindToName(C.second) << "\n"; in dump()
554 // result in different controls. Let's pick the one where the first
939 // unselected nodes first to avoid traversing a mutating DAG.
1075 // first elemen
[all...]
/third_party/mesa3d/src/amd/compiler/
H A Daco_register_allocation.cpp154 static PhysRegInterval from_until(PhysReg first, PhysReg end) { return {first, end - first}; } in from_until()
220 stride = info.first; in DefInfo()
363 subdword_regs.emplace(i, std::array<uint32_t, 4>{0, 0, 0, 0}).first->second; in fill_subdword()
470 const auto& first_reg = reg_and_var.first; in print_regs()
479 PhysReg last_reg = first_reg.advance(size_id.first - 1); in print_regs()
775 reg_file.clear(copy.first); in update_renames()
789 if (def.isTemp() && def.getTemp() == it->first.getTemp()) { in update_renames()
806 if (it->first in update_renames()
834 bool first = true; update_renames() local
[all...]
/third_party/skia/third_party/externals/abseil-cpp/absl/container/
H A Dbtree_test.cc67 CheckPairEquals(x.first, y.first); in CheckPairEquals()
146 EXPECT_EQ(tree_.equal_range(key).first, in erase_check()
166 iter_check(tree_res.first, checker_res.first); in equal_range()
176 iter_check(tree_res.first, checker_res.first); in equal_range()
340 CheckPairEquals(*tree_res.first, *checker_res.first); in insert()
351 CheckPairEquals(*tree_res, *checker_res.first); in insert()
[all...]
/third_party/mesa3d/src/broadcom/vulkan/
H A Dv3dv_query.c541 uint32_t first, in v3dv_get_query_pool_results()
547 assert(first < pool->query_count); in v3dv_get_query_pool_results()
548 assert(first + count <= pool->query_count); in v3dv_get_query_pool_results()
559 for (uint32_t i = first; i < first + count; i++) { in v3dv_get_query_pool_results()
669 uint32_t first, in v3dv_reset_query_pools()
674 for (uint32_t i = first; i < first + count; i++) { in v3dv_reset_query_pools()
539 v3dv_get_query_pool_results(struct v3dv_device *device, struct v3dv_query_pool *pool, uint32_t first, uint32_t count, void *data, VkDeviceSize stride, VkQueryResultFlags flags) v3dv_get_query_pool_results() argument
667 v3dv_reset_query_pools(struct v3dv_device *device, struct v3dv_query_pool *pool, uint32_t first, uint32_t count) v3dv_reset_query_pools() argument
/third_party/mesa3d/src/gallium/drivers/vc4/
H A Dvc4_qir.c506 bool first = true; in qir_dump() local
514 if (first) { in qir_dump()
515 first = false; in qir_dump()
523 if (first) in qir_dump()
530 bool first = true; in qir_dump() local
536 if (first) { in qir_dump()
537 first = false; in qir_dump()
545 if (first) in qir_dump()
/third_party/node/src/
H A Dutil.cc185 for (auto first = in.data(), second = in.data(), last = first + in.size(); in SplitString()
186 second != last && first != last; in SplitString()
187 first = second + 1) { in SplitString()
189 std::find_first_of(first, last, std::cbegin(delim), std::cend(delim)); in SplitString()
191 if (first != second) { in SplitString()
192 out.emplace_back(first, second - first); in SplitString()
/third_party/node/deps/npm/node_modules/ip-address/dist/
H A Dipv6.js285 * Return the first n bits of the address, defaulting to the subnet mask
289 * @returns {String} the first n bits of the address as a string
321 * The first address in the range given by this address' subnet
331 * The first host address in the range given by this address's subnet ie
332 * the first address after the Network Address
563 let first = halves[0].split(':');
565 if (first.length === 1 && first[0] === '') {
566 first = [];
571 const remaining = this.groups - (first
[all...]
/third_party/node/deps/v8/src/compiler/backend/
H A Dmove-optimizer.cc336 // all the moves in the first gap position, and none in the second/end gap in CompressGaps()
338 ParallelMove* first = in CompressGaps() local
342 USE(first); in CompressGaps()
346 (first != nullptr && (last == nullptr || last->empty()))); in CompressGaps()
413 res.first->second++; in OptimizeMerge()
414 if (res.first->second == block->PredecessorCount()) { in OptimizeMerge()
433 InstructionOperand dest = current->first.destination; in OptimizeMerge()
452 if (conflicting_srcs.ContainsOpOrAlias(current->first.source)) { in OptimizeMerge()
453 conflicting_srcs.InsertOp(current->first.destination); in OptimizeMerge()
515 // slot and keep remaining moves in the first slo
[all...]
/third_party/node/deps/v8/src/heap/
H A Dscavenger-inl.h37 entry->heap_object = regular_object.first; in Pop()
312 HeapObject first = HeapObject::cast(object.unchecked_first()); in EvacuateShortcutCandidate() local
314 HeapObjectReference::Update(slot, first); in EvacuateShortcutCandidate()
316 if (!Heap::InYoungGeneration(first)) { in EvacuateShortcutCandidate()
317 object.set_map_word(MapWord::FromForwardingAddress(first), kReleaseStore); in EvacuateShortcutCandidate()
321 MapWord first_word = first.map_word(kAcquireLoad); in EvacuateShortcutCandidate()
332 first_map, slot, first, first.SizeFromMap(first_map), in EvacuateShortcutCandidate()
413 // If the first word is a forwarding address, the object has already been in ScavengeObject()
/third_party/vk-gl-cts/external/vulkancts/modules_no_buildgn/vulkan/api/
H A DvktApiVersionCheck.cpp160 if (it->first <= m_context.getUsedApiVersion()) in iterate()
456 if (deStringEqual(testsArr[ndx].first, "vkGetInstanceProcAddr") || deStringEqual(testsArr[ndx].first, "vkEnumerateInstanceVersion")) in mixupAddressProcCheck()
459 const char* functionName = testsArr[ndx].first; in mixupAddressProcCheck()
479 checkPlatformFunction(ctx, log, testsArr[ndx].first, DE_FALSE, failsQuantity); in specialCasesCheck()
481 checkInstanceFunction(ctx, log, testsArr[ndx].first, DE_FALSE, failsQuantity); in specialCasesCheck()
483 checkDeviceFunction(ctx, log, testsArr[ndx].first, DE_FALSE, failsQuantity); in specialCasesCheck()
494 const auto& funcName = testsArr[ndx].first; in regularCheck()

Completed in 32 milliseconds

1...<<21222324252627282930>>...160