/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/guava/guava-tests/benchmark/com/google/common/collect/ |
D | BinaryTreeTraverserBenchmark.java | 98 int minIndex = 0; in createTreap() local 100 if (keys.get(i) < keys.get(minIndex)) { in createTreap() 101 minIndex = i; in createTreap() 104 Optional<BinaryNode> leftChild = createTreap(keys.subList(0, minIndex)); in createTreap() 105 Optional<BinaryNode> rightChild = createTreap(keys.subList(minIndex + 1, keys.size())); in createTreap() 106 return Optional.of(new BinaryNode(keys.get(minIndex), leftChild, rightChild)); in createTreap()
|
/external/icu/icu4c/source/tools/toolutil/ |
D | denseranges.cpp | 65 int32_t minIndex=-1; in firstAfter() local 67 if(value<gapStarts[i] && (minIndex<0 || gapStarts[i]<minValue)) { in firstAfter() 69 minIndex=i; in firstAfter() 72 return minIndex; in firstAfter()
|
/external/skia/src/codec/ |
D | SkIcoCodec.cpp | 201 int32_t minIndex = -1; in onGetScaledDimensions() local 208 minIndex = i; in onGetScaledDimensions() 211 SkASSERT(minIndex >= 0); in onGetScaledDimensions() 213 return fEmbeddedCodecs->operator[](minIndex)->getInfo().dimensions(); in onGetScaledDimensions()
|
/external/libgdx/gdx/src/com/badlogic/gdx/scenes/scene2d/ui/ |
D | TextArea.java | 218 int minIndex = Math.min(cursor, selectionStart); in drawSelection() local 225 if (!((minIndex < lineStart && minIndex < lineEnd && maxIndex < lineStart && maxIndex < lineEnd) in drawSelection() 226 … || (minIndex > lineStart && minIndex > lineEnd && maxIndex > lineStart && maxIndex > lineEnd))) { in drawSelection() 228 int start = Math.max(linesBreak.get(i), minIndex); in drawSelection()
|
D | TextField.java | 258 int minIndex = Math.min(cursor, selectionStart); in calculateOffsets() local 260 float minX = Math.max(glyphPositions[minIndex], -renderOffset); in calculateOffsets() 467 int minIndex = Math.min(from, to); in delete() local 469 String newText = (minIndex > 0 ? text.substring(0, minIndex) : "") in delete() 476 return minIndex; in delete()
|
/external/icu/icu4c/source/test/letest/ |
D | cletest.c | 699 le_int32 minIndex = 0x7FFFFFFF, maxIndex = -1; in GlyphToCharTest() local 708 if (ix < minIndex) { in GlyphToCharTest() 709 minIndex = ix; in GlyphToCharTest() 713 if (minIndex != charIndex) { in GlyphToCharTest() 715 run, lineNumber, charIndex, minIndex); in GlyphToCharTest()
|
D | letest.cpp | 929 le_int32 minIndex = 0x7FFFFFFF, maxIndex = -1; in GlyphToCharTest() local 938 if (ix < minIndex) { in GlyphToCharTest() 939 minIndex = ix; in GlyphToCharTest() 943 if (minIndex != charIndex) { in GlyphToCharTest() 945 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 | 578 int minIndex = index; in findMin() local 580 if (compareElements(i, minIndex) < 0) { in findMin() 581 minIndex = i; in findMin() 584 return minIndex; in findMin()
|
/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/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.eclipse.test.performance.ui/src/org/eclipse/test/performance/ui/ |
D | Utils.java | 150 int minIndex = 0; in closest() local 159 minIndex = i; in closest() 162 return minIndex; in closest()
|
/external/icu/android_icu4j/src/main/java/android/icu/impl/ |
D | StringRange.java | 39 int minIndex = Math.min(o1.length, o2.length); 40 for (int i = 0; i < minIndex; ++i) {
|
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
D | StringRange.java | 35 int minIndex = Math.min(o1.length, o2.length); 36 for (int i = 0; i < minIndex; ++i) {
|
/external/libgdx/extensions/gdx-bullet/jni/src/bullet/LinearMath/ |
D | btVector3.h | 1159 int minIndex = -1; in minAxis4() local 1163 minIndex = 0; in minAxis4() 1168 minIndex = 1; in minAxis4() 1173 minIndex = 2; in minAxis4() 1178 minIndex = 3; in minAxis4() 1182 return minIndex; in minAxis4()
|
D | btVector3.cpp | 445 long minIndex = -1L; in _mindot_large() local 564 minIndex = 4*index + segment + indexTable[test]; in _mindot_large() 815 minIndex = 4*index + segment + indexTable[test]; in _mindot_large() 819 return minIndex; in _mindot_large()
|
/external/mesa3d/src/mesa/program/ |
D | program_parse.y | 2339 const GLint minIndex = 0; 2340 ASSERT(index >= minIndex); 2341 (void) minIndex; 2381 const GLint minIndex = -(1 << INST_INDEX_BITS); 2383 ASSERT(index >= minIndex); 2384 (void) minIndex;
|
/external/llvm/include/llvm/CodeGen/PBQP/ |
D | ReductionRules.h | 212 s.setSelection(NId, v.minIndex()); in backpropagate()
|
D | Math.h | 131 unsigned minIndex() const { in minIndex() function
|
/external/skia/src/core/ |
D | SkPath.cpp | 2607 int minIndex = index; in find_min_max_x_at_y() local 2616 minIndex = i; in find_min_max_x_at_y() 2623 return minIndex; in find_min_max_x_at_y() 2675 int minIndex = find_min_max_x_at_y(pts, index, n, &maxIndex); in CheapComputeFirstDirection() local 2676 if (minIndex == maxIndex) { in CheapComputeFirstDirection() 2679 SkASSERT(pts[minIndex].fY == pts[index].fY); in CheapComputeFirstDirection() 2681 SkASSERT(pts[minIndex].fX <= pts[maxIndex].fX); in CheapComputeFirstDirection() 2684 cross = minIndex - maxIndex; in CheapComputeFirstDirection()
|