Home
last modified time | relevance | path

Searched refs:insertionPoint (Results 1 – 7 of 7) sorted by relevance

/external/icu/icu4c/source/common/
Duarrsort.cpp119 int32_t insertionPoint=uprv_stableBinarySearch(array, j, item, itemSize, cmp, context); in doInsertionSort() local
120 if(insertionPoint<0) { in doInsertionSort()
121 insertionPoint=~insertionPoint; in doInsertionSort()
123 ++insertionPoint; /* one past the last equal item */ in doInsertionSort()
125 if(insertionPoint<j) { in doInsertionSort()
126 char *dest=array+insertionPoint*itemSize; in doInsertionSort()
128 uprv_memmove(dest+itemSize, dest, (j-insertionPoint)*(size_t)itemSize); in doInsertionSort()
/external/icu/icu4j/main/classes/collate/src/com/ibm/icu/text/
DAlphabeticIndex.java476 … int insertionPoint = Collections.binarySearch(indexCharacters, item, collatorPrimaryOnly); in initLabels() local
477 if (insertionPoint < 0) { in initLabels()
478 indexCharacters.add(~insertionPoint, item); in initLabels()
480 String itemAlreadyIn = indexCharacters.get(insertionPoint); in initLabels()
482 indexCharacters.set(insertionPoint, item); in initLabels()
/external/icu/android_icu4j/src/main/java/android/icu/text/
DAlphabeticIndex.java457 … int insertionPoint = Collections.binarySearch(indexCharacters, item, collatorPrimaryOnly); in initLabels() local
458 if (insertionPoint < 0) { in initLabels()
459 indexCharacters.add(~insertionPoint, item); in initLabels()
461 String itemAlreadyIn = indexCharacters.get(insertionPoint); in initLabels()
463 indexCharacters.set(insertionPoint, item); in initLabels()
/external/protobuf/java/core/src/main/java/com/google/protobuf/
DSmallSortedMap.java244 final int insertionPoint = -(index + 1); in put() local
245 if (insertionPoint >= maxArraySize) { in put()
256 entryList.add(insertionPoint, new Entry(key, value)); in put()
DRopeByteString.java661 int insertionPoint = -(depth + 1); in getDepthBinForLength() local
662 depth = insertionPoint - 1; in getDepthBinForLength()
/external/icu/icu4c/source/i18n/
Dalphaindex.cpp339 int32_t insertionPoint = binarySearch(indexCharacters, *item, *collatorPrimaryOnly_); in initLabels() local
340 if (insertionPoint < 0) { in initLabels()
342 ownedString(*item, ownedItem, errorCode), ~insertionPoint, errorCode); in initLabels()
344 const UnicodeString &itemAlreadyIn = *getString(indexCharacters, insertionPoint); in initLabels()
347 ownedString(*item, ownedItem, errorCode), insertionPoint); in initLabels()
/external/v8/tools/
Dmap-processor.js444 let insertionPoint = this.find(time);
445 this.values.splice(insertionPoint, map);