Home
last modified time | relevance | path

Searched refs:nextIndex (Results 1 – 25 of 84) sorted by relevance

1234

/external/slf4j/slf4j-migrator/src/main/java/org/slf4j/migrator/helper/
DAbbreviator.java53 int nextIndex = computeNextIndex(filename, firstIndex); in abbreviate() local
54 if (nextIndex != -1) { in abbreviate()
55 buf.append(filename.substring(nextIndex)); in abbreviate()
71 int nextIndex = firstIndex + 1; in computeNextIndex() local
74 while (nextIndex < firstIndex + minToRemove) { in computeNextIndex()
75 int tmpIndex = filename.indexOf(folderSeparator, nextIndex + 1); in computeNextIndex()
80 return nextIndex; in computeNextIndex()
84 nextIndex = tmpIndex; in computeNextIndex()
87 return nextIndex; in computeNextIndex()
/external/libgdx/gdx/src/com/badlogic/gdx/utils/
DOrderedMap.java164 nextIndex = 0; in reset()
171 entry.key = keys.get(nextIndex); in next()
173 nextIndex++; in next()
174 hasNext = nextIndex < map.size; in next()
193 nextIndex = 0;
200 K key = keys.get(nextIndex);
201 nextIndex++;
202 hasNext = nextIndex < map.size;
208 map.remove(keys.get(nextIndex - 1));
221 nextIndex = 0;
[all …]
DOrderedSet.java117 nextIndex = 0; in reset()
124 T key = items.get(nextIndex); in next()
125 nextIndex++; in next()
126 hasNext = nextIndex < set.size; in next()
131 if (nextIndex < 0) throw new IllegalStateException("next must be called before remove.");
132 nextIndex--;
133 set.remove(items.get(nextIndex));
DIntFloatMap.java694 int nextIndex, currentIndex; field in IntFloatMap.MapIterator
704 nextIndex = INDEX_ZERO; in reset()
714 for (int n = map.capacity + map.stashSize; ++nextIndex < n;) { in findNextIndex()
715 if (keyTable[nextIndex] != EMPTY) { in findNextIndex()
729 nextIndex = currentIndex - 1; in remove()
751 if (nextIndex == INDEX_ZERO) { in next()
755 entry.key = keyTable[nextIndex]; in next()
756 entry.value = map.valueTable[nextIndex]; in next()
758 currentIndex = nextIndex; in next()
791 if (nextIndex == INDEX_ZERO) in next()
[all …]
DIntIntMap.java680 int nextIndex, currentIndex; field in IntIntMap.MapIterator
690 nextIndex = INDEX_ZERO; in reset()
700 for (int n = map.capacity + map.stashSize; ++nextIndex < n;) { in findNextIndex()
701 if (keyTable[nextIndex] != EMPTY) { in findNextIndex()
715 nextIndex = currentIndex - 1; in remove()
737 if (nextIndex == INDEX_ZERO) { in next()
741 entry.key = keyTable[nextIndex]; in next()
742 entry.value = map.valueTable[nextIndex]; in next()
744 currentIndex = nextIndex; in next()
777 if (nextIndex == INDEX_ZERO) in next()
[all …]
DIntMap.java713 int nextIndex, currentIndex; field in IntMap.MapIterator
723 nextIndex = INDEX_ZERO; in reset()
733 for (int n = map.capacity + map.stashSize; ++nextIndex < n;) { in findNextIndex()
734 if (keyTable[nextIndex] != EMPTY) { in findNextIndex()
749 nextIndex = currentIndex - 1; in remove()
772 if (nextIndex == INDEX_ZERO) { in next()
776 entry.key = keyTable[nextIndex]; in next()
777 entry.value = map.valueTable[nextIndex]; in next()
779 currentIndex = nextIndex; in next()
812 if (nextIndex == INDEX_ZERO) in next()
[all …]
DLongMap.java705 int nextIndex, currentIndex; field in LongMap.MapIterator
715 nextIndex = INDEX_ZERO; in reset()
725 for (int n = map.capacity + map.stashSize; ++nextIndex < n;) { in findNextIndex()
726 if (keyTable[nextIndex] != EMPTY) { in findNextIndex()
741 nextIndex = currentIndex - 1; in remove()
764 if (nextIndex == INDEX_ZERO) { in next()
768 entry.key = keyTable[nextIndex]; in next()
769 entry.value = map.valueTable[nextIndex]; in next()
771 currentIndex = nextIndex; in next()
804 if (nextIndex == INDEX_ZERO) in next()
[all …]
DObjectFloatMap.java628 int nextIndex, currentIndex; field in ObjectFloatMap.MapIterator
638 nextIndex = -1; in reset()
645 for (int n = map.capacity + map.stashSize; ++nextIndex < n;) { in findNextIndex()
646 if (keyTable[nextIndex] != null) { in findNextIndex()
657 nextIndex = currentIndex - 1; in remove()
679 entry.key = keyTable[nextIndex]; in next()
680 entry.value = map.valueTable[nextIndex]; in next()
681 currentIndex = nextIndex; in next()
713 float value = map.valueTable[nextIndex]; in next()
714 currentIndex = nextIndex; in next()
[all …]
DObjectIntMap.java629 int nextIndex, currentIndex; field in ObjectIntMap.MapIterator
639 nextIndex = -1; in reset()
646 for (int n = map.capacity + map.stashSize; ++nextIndex < n;) { in findNextIndex()
647 if (keyTable[nextIndex] != null) { in findNextIndex()
658 nextIndex = currentIndex - 1; in remove()
680 entry.key = keyTable[nextIndex]; in next()
681 entry.value = map.valueTable[nextIndex]; in next()
682 currentIndex = nextIndex; in next()
714 int value = map.valueTable[nextIndex]; in next()
715 currentIndex = nextIndex; in next()
[all …]
/external/proguard/src/proguard/util/
DListUtil.java81 int nextIndex; in commaSeparatedList() local
87 nextIndex = string.indexOf('\'', index + 1); in commaSeparatedList()
88 if (nextIndex < 0) in commaSeparatedList()
90 nextIndex = string.length(); in commaSeparatedList()
93 list.add(string.substring(index + 1, nextIndex)); in commaSeparatedList()
98 nextIndex = string.indexOf(',', index); in commaSeparatedList()
99 if (nextIndex < 0) in commaSeparatedList()
101 nextIndex = string.length(); in commaSeparatedList()
104 String substring = string.substring(index, nextIndex).trim(); in commaSeparatedList()
111 index = nextIndex + 1; in commaSeparatedList()
/external/libgdx/gdx/src/com/badlogic/gdx/math/
DEarClippingTriangulator.java105 int nextIndex = earTipIndex == vertexCount ? 0 : earTipIndex; in triangulate() local
107 vertexTypes[nextIndex] = classifyVertex(nextIndex); in triangulate()
124 int next = indices[nextIndex(index)] * 2; in classifyVertex()
153 int nextIndex = nextIndex(earTipIndex); in isEarTip() local
157 int p3 = indices[nextIndex] * 2; in isEarTip()
165 for (int i = nextIndex(nextIndex); i != previousIndex; i = nextIndex(i)) { in isEarTip()
191 triangles.add(indices[nextIndex(earTipIndex)]); in cutEarTip()
202 private int nextIndex (int index) { in nextIndex() method in EarClippingTriangulator
/external/icu/icu4c/source/common/
Dnormlzr.cpp35 currentIndex(0), nextIndex(0), in UOBJECT_DEFINE_RTTI_IMPLEMENTATION()
44 currentIndex(0), nextIndex(0), in Normalizer()
53 currentIndex(0), nextIndex(0), in Normalizer()
62 currentIndex(copy.currentIndex), nextIndex(copy.nextIndex), in Normalizer()
100 …rn text->hashCode() + fUMode + fOptions + buffer.hashCode() + bufferPos + currentIndex + nextIndex; in hashCode()
112 nextIndex==that.nextIndex); in operator ==()
287 currentIndex=nextIndex=text->setToStart(); in reset()
294 currentIndex=nextIndex=text->getIndex(); in setIndexOnly()
313 currentIndex=nextIndex=text->setToEnd(); in last()
336 return nextIndex; in getIndex()
[all …]
/external/guava/guava-tests/benchmark/com/google/common/util/concurrent/
DMonitorBasedArrayBlockingQueue.java687 private int nextIndex; field in MonitorBasedArrayBlockingQueue.Itr
706 nextIndex = -1; in Itr()
708 nextIndex = takeIndex; in Itr()
720 return nextIndex >= 0; in hasNext()
728 if (nextIndex == putIndex) { in checkNext()
729 nextIndex = -1; in checkNext()
732 nextItem = items[nextIndex]; in checkNext()
734 nextIndex = -1; in checkNext()
743 if (nextIndex < 0) in next()
745 lastRet = nextIndex; in next()
[all …]
/external/icu/android_icu4j/src/main/java/android/icu/impl/coll/
DCollationBuilder.java165 int nextIndex = nextIndexFromNode(node); in addReset() local
166 if(nextIndex == 0) { break; } in addReset()
167 index = nextIndex; in addReset()
420 int nextIndex = nextIndexFromNode(node); in getSpecialResetPosition() local
421 if(nextIndex == 0) { break; } in getSpecialResetPosition()
422 long nextNode = nodes.elementAti(nextIndex); in getSpecialResetPosition()
424 index = nextIndex; in getSpecialResetPosition()
653 int nextIndex = nextIndexFromNode(node); in findOrInsertWeakNode()
655 index = insertNodeBetween(index, nextIndex, node); in findOrInsertWeakNode()
657 insertNodeBetween(index, nextIndex, commonNode); in findOrInsertWeakNode()
[all …]
/external/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/
DCollationBuilder.java161 int nextIndex = nextIndexFromNode(node); in addReset() local
162 if(nextIndex == 0) { break; } in addReset()
163 index = nextIndex; in addReset()
416 int nextIndex = nextIndexFromNode(node); in getSpecialResetPosition() local
417 if(nextIndex == 0) { break; } in getSpecialResetPosition()
418 long nextNode = nodes.elementAti(nextIndex); in getSpecialResetPosition()
420 index = nextIndex; in getSpecialResetPosition()
649 int nextIndex = nextIndexFromNode(node); in findOrInsertWeakNode()
651 index = insertNodeBetween(index, nextIndex, node); in findOrInsertWeakNode()
653 insertNodeBetween(index, nextIndex, commonNode); in findOrInsertWeakNode()
[all …]
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
DLinkedListMultimap.java313 int nextIndex; field in LinkedListMultimap.NodeIterator
324 nextIndex = size; in NodeIterator()
352 nextIndex++; in next()
361 nextIndex--; in remove()
380 nextIndex--; in previous()
384 public int nextIndex() { in nextIndex() method in LinkedListMultimap.NodeIterator
385 return nextIndex; in nextIndex()
389 return nextIndex - 1; in previousIndex()
446 int nextIndex; field in LinkedListMultimap.ValueForKeyIterator
473 nextIndex = size; in ValueForKeyIterator()
[all …]
/external/icu/android_icu4j/src/main/java/android/icu/text/
DCharsetRecog_mbcs.java144 int nextIndex = 0; field in CharsetRecog_mbcs.iteratedChar
151 nextIndex = 0; in reset()
157 if (nextIndex >= det.fRawLength) { in nextByte()
161 int byteValue = (int)det.fRawInput[nextIndex++] & 0x00ff; in nextByte()
201 it.index = it.nextIndex; in nextChar()
264 it.index = it.nextIndex; in nextChar()
323 it.index = it.nextIndex; in nextChar()
463 it.index = it.nextIndex; in nextChar()
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/
DCharsetRecog_mbcs.java143 int nextIndex = 0; field in CharsetRecog_mbcs.iteratedChar
150 nextIndex = 0; in reset()
156 if (nextIndex >= det.fRawLength) { in nextByte()
160 int byteValue = (int)det.fRawInput[nextIndex++] & 0x00ff; in nextByte()
200 it.index = it.nextIndex; in nextChar()
263 it.index = it.nextIndex; in nextChar()
322 it.index = it.nextIndex; in nextChar()
462 it.index = it.nextIndex; in nextChar()
/external/guava/guava/src/com/google/common/collect/
DLinkedListMultimap.java317 int nextIndex; field in LinkedListMultimap.NodeIterator
328 nextIndex = size; in NodeIterator()
356 nextIndex++; in next()
365 nextIndex--; in remove()
384 nextIndex--; in previous()
388 public int nextIndex() { in nextIndex() method in LinkedListMultimap.NodeIterator
389 return nextIndex; in nextIndex()
393 return nextIndex - 1; in previousIndex()
450 int nextIndex; field in LinkedListMultimap.ValueForKeyIterator
477 nextIndex = size; in ValueForKeyIterator()
[all …]
/external/smali/util/src/test/java/org/jf/util/
DAbstractForwardSequentialListTest.java81 Assert.assertEquals(i, iter.nextIndex()); in testForwardIterationImpl()
91 Assert.assertEquals(iter.nextIndex(), 100); in testForwardIterationImpl()
104 Assert.assertEquals(i+1, iter.nextIndex()); in testReverseIterationImpl()
114 Assert.assertEquals(0, iter.nextIndex()); in testReverseIterationImpl()
130 Assert.assertEquals(50, iter.nextIndex()); in testAlternatingIteration()
137 Assert.assertEquals(51, iter.nextIndex()); in testAlternatingIteration()
/external/proguard/src/proguard/
DOutputWriter.java74 int nextIndex = index + 1; in execute() local
75 if (nextIndex == programJars.size() || in execute()
76 !programJars.get(nextIndex).isOutput()) in execute()
83 nextIndex); in execute()
86 firstInputIndex = nextIndex; in execute()
/external/icu/icu4c/source/i18n/
Dcollationbuilder.cpp360 int32_t nextIndex = nextIndexFromNode(node); in addReset() local
361 if(nextIndex == 0) { break; } in addReset()
362 index = nextIndex; in addReset()
628 int32_t nextIndex = nextIndexFromNode(node); in getSpecialResetPosition() local
629 if(nextIndex == 0) { break; } in getSpecialResetPosition()
630 int64_t nextNode = nodes.elementAti(nextIndex); in getSpecialResetPosition()
632 index = nextIndex; in getSpecialResetPosition()
898 int32_t nextIndex = nextIndexFromNode(node); in findOrInsertWeakNode() local
900 index = insertNodeBetween(index, nextIndex, node, errorCode); in findOrInsertWeakNode()
902 insertNodeBetween(index, nextIndex, commonNode, errorCode); in findOrInsertWeakNode()
[all …]
Dcsrmbcs.cpp117 charValue(0), index(-1), nextIndex(0), error(FALSE), done(FALSE) in IteratedChar()
133 if (nextIndex >= det->fRawLength) { in nextByte()
139 return det->fRawInput[nextIndex++]; in nextByte()
244 it->index = it->nextIndex; in nextChar()
297 it->index = it->nextIndex; in nextChar()
409 it->index = it->nextIndex; in nextChar()
463 it->index = it->nextIndex; in nextChar()
/external/apache-harmony/support/src/test/java/tests/support/
DSupport_ListTest.java147 assertTrue("list iterator nextIndex(): " + i, li.nextIndex() == i); in t_listIterator()
167 assertTrue("list iterator nextIndex()2: " + i, li.nextIndex() == i); in t_listIterator()
191 assertEquals("list iterator add(), nextIndex()", 1, li.nextIndex()); in t_listIterator()
200 assertEquals("list iterator add(), nextIndex()2", 2, li.nextIndex()); in t_listIterator()
207 assertEquals("list iterator remove(), nextIndex()", 2, li.nextIndex()); in t_listIterator()
217 assertEquals("list iterator nextIndex()3", 0, li.nextIndex()); in t_listIterator()
/external/emma/core/java12/com/vladium/jcd/cls/
DConstantCollection.java212 public int nextIndex ()
222 final int nextIndex = nextIndex ();
223 if (nextIndex < 0)
226 return (CONSTANT_info) m_constants.get (nextIndex - 1);

1234