Home
last modified time | relevance | path

Searched refs:partials (Results 1 - 15 of 15) sorted by relevance

/third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/
H A DSimpleFilteredSentenceBreakIterator.java354 int[] partials = new int[subCount]; in wrapIteratorWithFilter()
362 partials[i] = 0; // default: no partial in wrapIteratorWithFilter()
377 if (partials[j] == 0) { // hasn't been processed yet in wrapIteratorWithFilter()
378 partials[j] = SuppressInReverse | AddToForward; in wrapIteratorWithFilter()
379 } else if ((partials[j] & SuppressInReverse) != 0) { in wrapIteratorWithFilter()
385 if ((sameAs == -1) && (partials[i] == 0)) { in wrapIteratorWithFilter()
391 partials[i] = SuppressInReverse | AddToForward; in wrapIteratorWithFilter()
398 if (partials[i] == 0) { in wrapIteratorWithFilter()
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/impl/
H A DSimpleFilteredSentenceBreakIterator.java341 int[] partials = new int[subCount]; in wrapIteratorWithFilter()
349 partials[i] = 0; // default: no partial in wrapIteratorWithFilter()
364 if (partials[j] == 0) { // hasn't been processed yet in wrapIteratorWithFilter()
365 partials[j] = SuppressInReverse | AddToForward; in wrapIteratorWithFilter()
366 } else if ((partials[j] & SuppressInReverse) != 0) { in wrapIteratorWithFilter()
372 if ((sameAs == -1) && (partials[i] == 0)) { in wrapIteratorWithFilter()
378 partials[i] = SuppressInReverse | AddToForward; in wrapIteratorWithFilter()
385 if (partials[i] == 0) { in wrapIteratorWithFilter()
/third_party/vk-gl-cts/external/vulkan-docs/src/antora/
H A DMakefile14 JSPAGEMAP = antora/modules/ROOT/partials/gen/pageMap.cjs
67 antora/modules/ROOT/partials \
69 antora/modules/proposals/partials \
/third_party/icu/icu4c/source/common/
H A Dfilteredbrk.cpp605 LocalMemory<int> partials; in build() local
606 partials.allocateInsteadAndReset(subCount); in build()
625 partials[n] = 0; // default: not partial in build()
628 // first pass - find partials. in build()
641 if(partials[j]==0) { // hasn't been processed yet in build()
642 partials[j] = kSuppressInReverse | kAddToForward; in build()
644 } else if(partials[j] & kSuppressInReverse) { in build()
650 FB_TRACE(" == partial #",&ustrs[i],false,partials[i]); in build()
652 if(sameAs == -1 && partials[i] == 0) { in build()
659 partials[ in build()
[all...]
/third_party/node/deps/icu-small/source/common/
H A Dfilteredbrk.cpp605 LocalMemory<int> partials; in build() local
606 partials.allocateInsteadAndReset(subCount); in build()
625 partials[n] = 0; // default: not partial in build()
628 // first pass - find partials. in build()
641 if(partials[j]==0) { // hasn't been processed yet in build()
642 partials[j] = kSuppressInReverse | kAddToForward; in build()
644 } else if(partials[j] & kSuppressInReverse) { in build()
650 FB_TRACE(" == partial #",&ustrs[i],false,partials[i]); in build()
652 if(sameAs == -1 && partials[i] == 0) { in build()
659 partials[ in build()
[all...]
/third_party/skia/third_party/externals/icu/source/common/
H A Dfilteredbrk.cpp606 LocalMemory<int> partials; in build() local
607 partials.allocateInsteadAndReset(subCount); in build()
626 partials[n] = 0; // default: not partial in build()
629 // first pass - find partials. in build()
642 if(partials[j]==0) { // hasn't been processed yet in build()
643 partials[j] = kSuppressInReverse | kAddToForward; in build()
645 } else if(partials[j] & kSuppressInReverse) { in build()
651 FB_TRACE(" == partial #",&ustrs[i],FALSE,partials[i]); in build()
653 if(sameAs == -1 && partials[i] == 0) { in build()
660 partials[ in build()
[all...]
/third_party/mesa3d/src/glx/
H A Dglxhash.c119 unsigned long partials; /* Not at top of linked list */ member
167 table->partials = 0; in __glxHashCreate()
217 ++table->partials; in HashFind()
361 printf("Hits = %ld, partials = %ld, misses = %ld\n", in compute_dist()
362 table->hits, table->partials, table->misses); in compute_dist()
/third_party/libdrm/
H A Dxf86drmHash.h42 unsigned long partials; /* Not at top of linked list */ member
H A Dxf86drmHash.c155 ++table->partials; in HashFind()
/third_party/python/Lib/
H A Dstatistics.py189 partials = {}
190 partials_get = partials.get
195 partials[d] = partials_get(d, 0) + n
196 if None in partials:
198 # partials, and just look at this special one.
199 total = partials[None]
203 total = sum(Fraction(n, d) for d, n in partials.items())
235 # partials, and just look at this special one.
/third_party/skia/src/pathops/
H A DSkPathWriter.h42 const SkTArray<SkPath>& partials() const { return fPartials; } in partials() function in SkPathWriter
H A DSkPathWriter.cpp249 const SkTArray<SkPath>& partPartials = partWriter.partials(); in assemble()
/third_party/libdrm/tests/
H A Dhash.c109 printf("Entries = %ld, hits = %ld, partials = %ld, misses = %ld\n", in compute_dist()
110 table->entries, table->hits, table->partials, table->misses); in compute_dist()
/third_party/node/test/fixtures/wpt/resources/
H A Didlharness.js181 * Both this.partials and this.includes will be the objects as parsed by
184 this.partials = [];
247 this.partials.forEach(p => all_deps.add(p.name));
282 const testedPartials = this.partials.filter(m => !m.untested && m.members);
340 || this.partials.some(function(p) {
388 * arrays. If only is given then only members, partials and interface
416 this.partials.push(parsed_idl);
769 this.partials.forEach(function(parsed_idl)
776 // Ensure unique test name in case of multiple partials.
864 this.partials
[all...]
/third_party/mesa3d/src/gallium/drivers/llvmpipe/
H A Dlp_state_cs.c119 arg_types[13] = int32_type; /* coro only - partials */ in generate_compute()
192 LLVMValueRef partials = LLVMBuildURem(gallivm->builder, block_x_size_arg, vec_length, ""); in generate_compute() local
235 args[13] = partials; in generate_compute()
311 partials = LLVMGetParam(coro, 13); in generate_compute()
346 LLVMValueRef has_partials = LLVMBuildICmp(gallivm->builder, LLVMIntNE, partials, lp_build_const_int32(gallivm, 0), ""); in generate_compute()
414 lp_build_loop_begin(&mask_loop_state, gallivm, partials); in generate_compute()

Completed in 15 milliseconds