| /external/v8/tools/sodium/ |
| D | sodium.js | 235 function makeContainerPosVisible(container, newTop) { argument
238 if (newTop < container.scrollTop + margin) {
239 newTop -= margin;
240 if (newTop < 0) newTop = 0;
241 container.scrollTop = newTop;
244 if (newTop > (container.scrollTop + 3 * margin)) {
245 newTop = newTop - 3 * margin;
246 container.scrollTop = newTop;
250 function makeAsmPosVisible(newTop) { argument
252 makeContainerPosVisible(asmContainer, newTop);
[all …]
|
| /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
| D | TreeMultiset.java | 785 AvlNode<E> newTop = pred;
787 newTop.left = left.removeMax(newTop);
788 newTop.right = right;
789 newTop.distinctElements = distinctElements - 1;
790 newTop.totalCount = totalCount - oldElemCount;
791 return newTop.rebalance();
793 AvlNode<E> newTop = succ;
794 newTop.right = right.removeMin(newTop);
795 newTop.left = left;
796 newTop.distinctElements = distinctElements - 1;
[all …]
|
| /external/guava/guava/src/com/google/common/collect/ |
| D | TreeMultiset.java | 789 AvlNode<E> newTop = pred;
791 newTop.left = left.removeMax(newTop);
792 newTop.right = right;
793 newTop.distinctElements = distinctElements - 1;
794 newTop.totalCount = totalCount - oldElemCount;
795 return newTop.rebalance();
797 AvlNode<E> newTop = succ;
798 newTop.right = right.removeMin(newTop);
799 newTop.left = left;
800 newTop.distinctElements = distinctElements - 1;
[all …]
|
| /external/pdfium/xfa/src/fxbarcode/pdf417/ |
| D | BC_PDF417BoundingBox.cpp | 85 CBC_ResultPoint* newTop = NULL; in addMissingRows() local
93 newTop = new CBC_ResultPoint((FX_FLOAT)top->GetX(), (FX_FLOAT)newMinY); in addMissingRows()
95 newTopLeft = newTop; in addMissingRows()
97 newTopRight = newTop; in addMissingRows()
117 delete newTop; in addMissingRows()
|
| /external/icu/icu4c/source/tools/makeconv/ |
| D | genmbcs.cpp | 566 uint32_t blockSize, newTop, i, nextOffset, newBlock, min; in MBCSSingleAddFromUnicode() local
598 newTop=newBlock+MBCS_STAGE_2_BLOCK_SIZE; in MBCSSingleAddFromUnicode()
600 if(newTop>MBCS_MAX_STAGE_2_TOP) { in MBCSSingleAddFromUnicode()
610 mbcsData->stage2Top=newTop; in MBCSSingleAddFromUnicode()
632 newTop=newBlock+blockSize; in MBCSSingleAddFromUnicode()
634 if(newTop>MBCS_STAGE_3_SBCS_SIZE) { in MBCSSingleAddFromUnicode()
640 while(newBlock<newTop) { in MBCSSingleAddFromUnicode()
644 mbcsData->stage3Top=newTop; /* ==newBlock */ in MBCSSingleAddFromUnicode()
685 uint32_t blockSize, newTop, i, nextOffset, newBlock, min, overlap, maxOverlap; in MBCSAddFromUnicode() local
728 newTop=newBlock+MBCS_STAGE_2_BLOCK_SIZE; in MBCSAddFromUnicode()
[all …]
|
| /external/icu/android_icu4j/src/main/java/android/icu/impl/ |
| D | Trie2Writable.java | 169 int newBlock, newTop; in allocIndex2Block() local
172 newTop=newBlock+UTRIE2_INDEX_2_BLOCK_LENGTH; in allocIndex2Block()
173 if(newTop > index2.length) { in allocIndex2Block()
181 index2Length=newTop; in allocIndex2Block()
203 int newBlock, newTop; in allocDataBlock() local
212 newTop=newBlock+UTRIE2_DATA_BLOCK_LENGTH; in allocDataBlock()
213 if(newTop>dataCapacity) { in allocDataBlock()
235 dataLength=newTop; in allocDataBlock()
|
| D | IntTrieBuilder.java | 507 int newTop = newBlock + DATA_BLOCK_LENGTH; in allocDataBlock() local
508 if (newTop > m_dataCapacity_) { in allocDataBlock()
512 m_dataLength_ = newTop; in allocDataBlock()
|
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
| D | Trie2Writable.java | 167 int newBlock, newTop; in allocIndex2Block() local
170 newTop=newBlock+UTRIE2_INDEX_2_BLOCK_LENGTH; in allocIndex2Block()
171 if(newTop > index2.length) { in allocIndex2Block()
179 index2Length=newTop; in allocIndex2Block()
201 int newBlock, newTop; in allocDataBlock() local
210 newTop=newBlock+UTRIE2_DATA_BLOCK_LENGTH; in allocDataBlock()
211 if(newTop>dataCapacity) { in allocDataBlock()
233 dataLength=newTop; in allocDataBlock()
|
| D | IntTrieBuilder.java | 505 int newTop = newBlock + DATA_BLOCK_LENGTH; in allocDataBlock() local
506 if (newTop > m_dataCapacity_) { in allocDataBlock()
510 m_dataLength_ = newTop; in allocDataBlock()
|
| /external/icu/icu4c/source/common/ |
| D | utrie2_builder.cpp | 473 int32_t newBlock, newTop; in allocIndex2Block() local
476 newTop=newBlock+UTRIE2_INDEX_2_BLOCK_LENGTH; in allocIndex2Block()
477 if(newTop>UPRV_LENGTHOF(trie->index2)) { in allocIndex2Block()
485 trie->index2Length=newTop; in allocIndex2Block()
512 int32_t newBlock, newTop; in allocDataBlock() local
521 newTop=newBlock+UTRIE2_DATA_BLOCK_LENGTH; in allocDataBlock()
522 if(newTop>trie->dataCapacity) { in allocDataBlock()
548 trie->dataLength=newTop; in allocDataBlock()
|
| D | utrie.cpp | 175 int32_t newBlock, newTop; in utrie_allocDataBlock() local
178 newTop=newBlock+UTRIE_DATA_BLOCK_LENGTH; in utrie_allocDataBlock()
179 if(newTop>trie->dataCapacity) { in utrie_allocDataBlock()
183 trie->dataLength=newTop; in utrie_allocDataBlock()
|
| /external/skia/src/core/ |
| D | SkCanvas.cpp | 1054 MCRec* newTop = (MCRec*)fMCStack.push_back(); in internalSave() local
1055 new (newTop) MCRec(*fMCRec); // balanced in restore() in internalSave()
1056 fMCRec = newTop; in internalSave()
|