| /external/swiftshader/src/OpenGL/libGLES_CM/ |
| D | IndexDataManager.cpp | 63 void computeRange(const IndexType *indices, GLsizei count, GLuint *minIndex, GLuint *maxIndex) in computeRange() argument
65 *minIndex = indices[0]; in computeRange()
70 if(*minIndex > indices[i]) *minIndex = indices[i]; in computeRange()
75 void computeRange(GLenum type, const void *indices, GLsizei count, GLuint *minIndex, GLuint *maxInd… in computeRange() argument
79 computeRange(static_cast<const GLubyte*>(indices), count, minIndex, maxIndex); in computeRange()
83 computeRange(static_cast<const GLushort*>(indices), count, minIndex, maxIndex); in computeRange()
113 computeRange(type, indices, count, &translated->minIndex, &translated->maxIndex); in prepareIndexData()
135 computeRange(type, indices, count, &translated->minIndex, &translated->maxIndex); in prepareIndexData()
|
| D | IndexDataManager.h | 30 unsigned int minIndex; member
|
| /external/jdiff/src/jdiff/ |
| D | RootDocToXML.java | 995 index = minIndex(index, text.indexOf("? ", fromindex)); in endOfFirstSentence()
996 index = minIndex(index, text.indexOf("?\t", fromindex)); in endOfFirstSentence()
997 index = minIndex(index, text.indexOf("?\n", fromindex)); in endOfFirstSentence()
998 index = minIndex(index, text.indexOf("?\r", fromindex)); in endOfFirstSentence()
999 index = minIndex(index, text.indexOf("?\f", fromindex)); in endOfFirstSentence()
1000 index = minIndex(index, text.indexOf("! ", fromindex)); in endOfFirstSentence()
1001 index = minIndex(index, text.indexOf("!\t", fromindex)); in endOfFirstSentence()
1002 index = minIndex(index, text.indexOf("!\n", fromindex)); in endOfFirstSentence()
1003 index = minIndex(index, text.indexOf("!\r", fromindex)); in endOfFirstSentence()
1004 index = minIndex(index, text.indexOf("!\f", fromindex)); in endOfFirstSentence()
[all …]
|
| /external/swiftshader/src/OpenGL/libGLESv2/ |
| D | IndexDataManager.cpp | 196 void computeRange(const IndexType *indices, GLsizei count, GLuint *minIndex, GLuint *maxIndex, std:… in computeRange() argument
199 *minIndex = MAX_ELEMENTS_INDICES; in computeRange()
208 if(*minIndex > indices[i]) *minIndex = indices[i]; in computeRange()
213 void computeRange(GLenum type, const void *indices, GLsizei count, GLuint *minIndex, GLuint *maxInd… in computeRange() argument
217 computeRange(static_cast<const GLubyte*>(indices), count, minIndex, maxIndex, restartIndices); in computeRange()
221 computeRange(static_cast<const GLuint*>(indices), count, minIndex, maxIndex, restartIndices); in computeRange()
225 computeRange(static_cast<const GLushort*>(indices), count, minIndex, maxIndex, restartIndices); in computeRange()
293 computeRange(type, indices, count, &translated->minIndex, &translated->maxIndex, restartIndices); in prepareIndexData()
354 if(translated->minIndex < start || translated->maxIndex > end) in prepareIndexData()
356 …provided: [%d -> %d]. Range used: [%d -> %d].", start, end, translated->minIndex, translated->maxI… in prepareIndexData()
|
| D | IndexDataManager.h | 32 unsigned int minIndex; member
|
| /external/guava/guava-tests/benchmark/com/google/common/collect/ |
| D | BinaryTreeTraverserBenchmark.java | 97 int minIndex = 0; in createTreap() local
99 if (keys.get(i) < keys.get(minIndex)) { in createTreap()
100 minIndex = i; in createTreap()
103 Optional<BinaryNode> leftChild = createTreap(keys.subList(0, minIndex)); in createTreap()
104 Optional<BinaryNode> rightChild = createTreap(keys.subList(minIndex + 1, keys.size())); in createTreap()
105 return Optional.of(new BinaryNode(keys.get(minIndex), leftChild, rightChild)); in createTreap()
|
| /external/guava/android/guava-tests/benchmark/com/google/common/collect/ |
| D | BinaryTreeTraverserBenchmark.java | 97 int minIndex = 0; in createTreap() local
99 if (keys.get(i) < keys.get(minIndex)) { in createTreap()
100 minIndex = i; in createTreap()
103 Optional<BinaryNode> leftChild = createTreap(keys.subList(0, minIndex)); in createTreap()
104 Optional<BinaryNode> rightChild = createTreap(keys.subList(minIndex + 1, keys.size())); in createTreap()
105 return Optional.of(new BinaryNode(keys.get(minIndex), leftChild, rightChild)); in createTreap()
|
| /external/icu/icu4c/source/tools/toolutil/ |
| D | denseranges.cpp | 67 int32_t minIndex=-1; in firstAfter() local
69 if(value<gapStarts[i] && (minIndex<0 || gapStarts[i]<minValue)) { in firstAfter()
71 minIndex=i; in firstAfter()
74 return minIndex; in firstAfter()
|
| /external/skia/src/pathops/ |
| D | SkPathOpsCurve.cpp | 36 int minIndex = -1; in nearPoint() local
42 minIndex = index; in nearPoint()
45 if (minIndex < 0) { in nearPoint()
52 return SkPinT(i[0][minIndex]); in nearPoint()
|
| /external/skqp/src/pathops/ |
| D | SkPathOpsCurve.cpp | 36 int minIndex = -1; in nearPoint() local
42 minIndex = index; in nearPoint()
45 if (minIndex < 0) { in nearPoint()
52 return SkPinT(i[0][minIndex]); in nearPoint()
|
| /external/s2-geometry-library-java/src/com/google/common/geometry/ |
| D | S2Polyline.java | 223 int minIndex = -1; in getNearestEdgeIndex() local
230 minIndex = i; in getNearestEdgeIndex()
233 return minIndex; in getNearestEdgeIndex()
|
| /external/drrickorang/LoopbackApp/app/src/main/java/org/drrickorang/loopback/ |
| D | Correlation.java | 75 int minIndex = (int) (0.5 + minLatencyMs * mSamplingRate / (groupSize * 1000)); in computeCorrelation() local
81 for (int i = minIndex; i < mDataAutocorrelated.length; i++) { in computeCorrelation()
93 mDataAutocorrelated.length, data.length, minIndex)); in computeCorrelation()
|
| /external/skqp/src/codec/ |
| D | SkIcoCodec.cpp | 211 int32_t minIndex = -1; in onGetScaledDimensions() local
219 minIndex = i; in onGetScaledDimensions()
222 SkASSERT(minIndex >= 0); in onGetScaledDimensions()
224 return fEmbeddedCodecs->operator[](minIndex)->dimensions(); in onGetScaledDimensions()
|
| /external/skia/src/codec/ |
| D | SkIcoCodec.cpp | 218 int32_t minIndex = -1; in onGetScaledDimensions() local
226 minIndex = i; in onGetScaledDimensions()
229 SkASSERT(minIndex >= 0); in onGetScaledDimensions()
231 return fEmbeddedCodecs->operator[](minIndex)->dimensions(); in onGetScaledDimensions()
|
| /external/angle/src/common/ |
| D | utilities.cpp | 35 IndexType minIndex = 0; in ComputeTypedIndexRange() local
47 minIndex = indices[i]; in ComputeTypedIndexRange()
59 if (minIndex > indices[i]) in ComputeTypedIndexRange()
61 minIndex = indices[i]; in ComputeTypedIndexRange()
73 minIndex = indices[0]; in ComputeTypedIndexRange()
79 if (minIndex > indices[i]) in ComputeTypedIndexRange()
81 minIndex = indices[i]; in ComputeTypedIndexRange()
90 return gl::IndexRange(static_cast<size_t>(minIndex), static_cast<size_t>(maxIndex), in ComputeTypedIndexRange()
|
| /external/icu/icu4c/source/test/letest/ |
| D | cletest.c | 701 le_int32 minIndex = 0x7FFFFFFF, maxIndex = -1; in GlyphToCharTest() local
710 if (ix < minIndex) { in GlyphToCharTest()
711 minIndex = ix; in GlyphToCharTest()
715 if (minIndex != charIndex) { in GlyphToCharTest()
717 run, lineNumber, charIndex, minIndex); in GlyphToCharTest()
|
| D | letest.cpp | 931 le_int32 minIndex = 0x7FFFFFFF, maxIndex = -1; in GlyphToCharTest() local
940 if (ix < minIndex) { in GlyphToCharTest()
941 minIndex = ix; in GlyphToCharTest()
945 if (minIndex != charIndex) { in GlyphToCharTest()
947 run, lineNumber, charIndex, minIndex); in GlyphToCharTest()
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/linear/ |
| D | AbstractRealVector.java | 301 int minIndex = -1; in getMinIndex() local
307 minIndex = entry.getIndex(); in getMinIndex()
311 return minIndex; in getMinIndex()
318 final int minIndex = getMinIndex(); in getMinValue() local
319 return minIndex < 0 ? Double.NaN : getEntry(minIndex); in getMinValue()
|
| /external/guava/guava/src/com/google/common/collect/ |
| D | MinMaxPriorityQueue.java | 590 int minIndex = index; in findMin() local
592 if (compareElements(i, minIndex) < 0) { in findMin()
593 minIndex = i; in findMin()
596 return minIndex; in findMin()
|
| /external/guava/android/guava/src/com/google/common/collect/ |
| D | MinMaxPriorityQueue.java | 590 int minIndex = index; in findMin() local
592 if (compareElements(i, minIndex) < 0) { in findMin()
593 minIndex = i; in findMin()
596 return minIndex; in findMin()
|
| /external/llvm-project/clang/utils/ABITest/ |
| D | ABITestGen.py | 602 opts.minIndex = max(0,min(opts.maxIndex-1, opts.minIndex))
604 opts.count = min(opts.count, opts.maxIndex-opts.minIndex)
662 index = opts.minIndex + i
664 index = opts.minIndex + int((opts.maxIndex-opts.minIndex) * random.random())
|
| /external/clang/utils/ABITest/ |
| D | ABITestGen.py | 601 opts.minIndex = max(0,min(opts.maxIndex-1, opts.minIndex))
603 opts.count = min(opts.count, opts.maxIndex-opts.minIndex)
661 index = opts.minIndex + i
663 index = opts.minIndex + int((opts.maxIndex-opts.minIndex) * random.random())
|
| /external/apache-commons-compress/src/main/java/org/apache/commons/compress/compressors/lz77support/ |
| D | LZ77Compressor.java | 536 final int minIndex = Math.max(0, currentPosition - params.getMaxOffset()); in longestMatch() local
539 … for (int candidates = 0; candidates < maxCandidates && matchHead >= minIndex; candidates++) { in longestMatch()
|
| /external/icu/android_icu4j/src/main/java/android/icu/impl/ |
| D | StringRange.java | 45 int minIndex = Math.min(o1.length, o2.length);
46 for (int i = 0; i < minIndex; ++i) {
|
| /external/cldr/tools/java/org/unicode/cldr/util/ |
| D | StringRange.java | 31 int minIndex = Math.min(o1.length, o2.length);
32 for (int i = 0; i < minIndex; ++i) {
|