/external/libdrm/ |
xf86drmHash.h | 42 unsigned long partials; /* Not at top of linked list */ member in struct:HashTable
|
xf86drmHash.c | 114 table->partials = 0; 160 ++table->partials;
|
/external/skia/src/pathops/ |
SkPathWriter.h | 42 const SkTArray<SkPath>& partials() const { return fPartials; } function in class:SkPathWriter
|
SkPathWriter.cpp | 252 const SkTArray<SkPath>& partPartials = partWriter.partials();
|
/external/skqp/src/pathops/ |
SkPathWriter.h | 42 const SkTArray<SkPath>& partials() const { return fPartials; } function in class:SkPathWriter
|
SkPathWriter.cpp | 252 const SkTArray<SkPath>& partPartials = partWriter.partials();
|
/external/icu/android_icu4j/src/main/java/android/icu/impl/ |
SimpleFilteredSentenceBreakIterator.java | 341 int[] partials = new int[subCount]; local 349 partials[i] = 0; // default: no partial 364 if (partials[j] == 0) { // hasn't been processed yet 365 partials[j] = SuppressInReverse | AddToForward; 366 } else if ((partials[j] & SuppressInReverse) != 0) { 372 if ((sameAs == -1) && (partials[i] == 0)) { 378 partials[i] = SuppressInReverse | AddToForward; 385 if (partials[i] == 0) {
|
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
SimpleFilteredSentenceBreakIterator.java | 336 int[] partials = new int[subCount]; local 344 partials[i] = 0; // default: no partial 359 if (partials[j] == 0) { // hasn't been processed yet 360 partials[j] = SuppressInReverse | AddToForward; 361 } else if ((partials[j] & SuppressInReverse) != 0) { 367 if ((sameAs == -1) && (partials[i] == 0)) { 373 partials[i] = SuppressInReverse | AddToForward; 380 if (partials[i] == 0) {
|
/external/python/cpython3/Lib/ |
statistics.py | 142 partials = {d: n} 143 partials_get = partials.get 149 partials[d] = partials_get(d, 0) + n 150 if None in partials: 152 # partials, and just look at this special one. 153 total = partials[None] 158 total = sum(Fraction(n, d) for d, n in sorted(partials.items()))
|
/external/icu/icu4c/source/common/ |
filteredbrk.cpp | 579 LocalMemory<int> partials; local 580 partials.allocateInsteadAndReset(subCount); 599 partials[n] = 0; // default: not partial 602 // first pass - find partials. 615 if(partials[j]==0) { // hasn't been processed yet 616 partials[j] = kSuppressInReverse | kAddToForward; 618 } else if(partials[j] & kSuppressInReverse) { 624 FB_TRACE(" == partial #",&ustrs[i],FALSE,partials[i]); 626 if(sameAs == -1 && partials[i] == 0) { 633 partials[i] = kSuppressInReverse | kAddToForward [all...] |
/external/tensorflow/tensorflow/tools/dockerfiles/ |
assembler.py | 132 './partials', 183 partials: 236 if 'partials' in kwargs: 237 self.partials = kwargs['partials'] 250 if ispartial and value not in self.partials: 252 '{} is not present in the partials directory.'.format(value)) 400 used_partials = gather_slice_list_items(slices, 'partials') 415 'partials': used_partials, 446 """Find and read all available partials [all...] |
/external/mesa3d/src/glx/ |
glxhash.c | 119 unsigned long partials; /* Not at top of linked list */ member in struct:__glxHashTable 167 table->partials = 0; 217 ++table->partials; 361 printf("Hits = %ld, partials = %ld, misses = %ld\n", 362 table->hits, table->partials, table->misses);
|
/external/libdrm/tests/ |
hash.c | 109 printf("Entries = %ld, hits = %ld, partials = %ld, misses = %ld\n", 110 table->entries, table->hits, table->partials, table->misses);
|
/external/tensorflow/tensorflow/python/ops/ |
math_ops_test.py | 355 partials = [] 357 partials.append(math_ops.add_n([constant_op.constant(1)])) 358 partials.append( 362 res = math_ops.add_n(partials) + constant_op.constant(0)
|
/external/cldr/tools/java/libs/ |
icu4j.jar | |