Home
last modified time | relevance | path

Searched refs:resultCount (Results 1 – 14 of 14) sorted by relevance

/external/deqp/scripts/log/
Dbottleneck_report.py65 def bottleneck (self, resultCount) : argument
73 if int(ndx) > int(resultCount) :
102 def bottleneck (self, resultCount) : argument
115 if int(ndx) > int(resultCount) :
126 if int(ndx) > int(resultCount) :
154 def printTimes (inFile, resultCount) : argument
162 handler.bottleneck(resultCount)
178 handlerGroups.bottleneck(resultCount)
/external/icu/icu4c/source/i18n/
Dcsdetect.cpp152 resultCount(0), fStripTags(FALSE), fFreshTextSet(FALSE), in CharsetDetector()
257 resultCount = 0; in detectAll()
260 if (csr->match(textIn, resultArray[resultCount])) { in detectAll()
261 resultCount++; in detectAll()
265 if (resultCount > 1) { in detectAll()
266 …uprv_sortArray(resultArray, resultCount, sizeof resultArray[0], charsetMatchComparator, NULL, TRUE… in detectAll()
271 maxMatchesFound = resultCount; in detectAll()
Dnfrule.h85 int32_t startingAt, int32_t* resultCount) const;
105 int32_t startingAt, int32_t* resultCount) const;
Dcsdetect.h30 int32_t resultCount; variable
/external/skqp/tests/
DBlurTest.cpp180 int* result, int resultCount) { in ground_truth_2d() argument
199 if (i < resultCount) { in ground_truth_2d()
203 for ( ; i < resultCount; ++i) { in ground_truth_2d()
230 int* result, int resultCount) { in brute_force_1d() argument
234 for (int i = 0; i < resultCount; ++i) { in brute_force_1d()
261 static void readback(const SkBitmap& src, int* result, int resultCount) { in readback() argument
263 readback.allocN32Pixels(resultCount, 30); in readback()
270 for (int i = 0; i < resultCount; ++i) { in readback()
278 int* result, int resultCount) { in cpu_blur_path() argument
281 bitmap.allocN32Pixels(resultCount, 30); in cpu_blur_path()
[all …]
/external/skia/tests/
DBlurTest.cpp180 int* result, int resultCount) { in ground_truth_2d() argument
199 if (i < resultCount) { in ground_truth_2d()
203 for ( ; i < resultCount; ++i) { in ground_truth_2d()
230 int* result, int resultCount) { in brute_force_1d() argument
234 for (int i = 0; i < resultCount; ++i) { in brute_force_1d()
261 static void readback(const SkBitmap& src, int* result, int resultCount) { in readback() argument
263 readback.allocN32Pixels(resultCount, 30); in readback()
270 for (int i = 0; i < resultCount; ++i) { in readback()
278 int* result, int resultCount) { in cpu_blur_path() argument
281 bitmap.allocN32Pixels(resultCount, 30); in cpu_blur_path()
[all …]
/external/robolectric-shadows/robolectric/src/test/java/org/robolectric/shadows/
DShadowFilterTest.java100 public void onFilterComplete(int resultCount) { in testFilter_whenExceptionThrown_ShouldReturn()
101 assertThat(resultCount).isEqualTo(0); in testFilter_whenExceptionThrown_ShouldReturn()
/external/icu/icu4c/source/common/
Dcaniter.cpp407 int32_t resultCount; in getEquivalents() local
408 if((resultCount = result.count()) != 0) { in getEquivalents()
409 finalResult = new UnicodeString[resultCount]; in getEquivalents()
/external/python/httplib2/doc/html/_static/
Dsearchtools.js418 var resultCount = results.length;
454 if (!resultCount)
457 …text(_('Search finished, found %s page(s) matching the search query.').replace('%s', resultCount));
/external/skia/src/pathops/
DSkPathOpsCubic.cpp294 int resultCount = 0; in ComplexBreak() local
307 t[resultCount++] = testT; in ComplexBreak()
310 if (!resultCount && infTCount == 1) { in ComplexBreak()
312 resultCount = (int) (t[0] > 0 && t[0] < 1); in ComplexBreak()
314 return resultCount; in ComplexBreak()
/external/skqp/src/pathops/
DSkPathOpsCubic.cpp294 int resultCount = 0; in ComplexBreak() local
307 t[resultCount++] = testT; in ComplexBreak()
310 if (!resultCount && infTCount == 1) { in ComplexBreak()
312 resultCount = (int) (t[0] > 0 && t[0] < 1); in ComplexBreak()
314 return resultCount; in ComplexBreak()
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
DTreeMultiset.java607 long resultCount = (long) elemCount + count;
608 checkArgument(resultCount <= Integer.MAX_VALUE);
/external/guava/guava/src/com/google/common/collect/
DTreeMultiset.java611 long resultCount = (long) elemCount + count;
612 checkArgument(resultCount <= Integer.MAX_VALUE);
/external/deqp/external/vulkancts/modules/vulkan/api/
DvktApiCommandBuffersTests.cpp2061 deUint32 resultCount; in simultaneousUseSecondaryBufferOnePrimaryBufferTest() local
2062 result.readResultContentsTo(&resultCount); in simultaneousUseSecondaryBufferOnePrimaryBufferTest()
2064 if (resultCount == 2) in simultaneousUseSecondaryBufferOnePrimaryBufferTest()
2239 deUint32 resultCount; in simultaneousUseSecondaryBufferTwoPrimaryBuffersTest() local
2240 result.readResultContentsTo(&resultCount); in simultaneousUseSecondaryBufferTwoPrimaryBuffersTest()
2242 if (resultCount == 2) in simultaneousUseSecondaryBufferTwoPrimaryBuffersTest()