Searched refs:nextIndex (Results 1 - 25 of 51) sorted by relevance

123

/macosx-10.10.1/BerkeleyDB-21/db/java/src/com/sleepycat/persist/impl/
H A DVisitedObjects.java42 private int nextIndex; field in class:VisitedObjects
50 nextIndex = 0;
59 int i = nextIndex;
60 nextIndex += 1;
61 if (nextIndex > objects.length) {
87 for (int i = 0; i < nextIndex; i += 1) {
99 for (int i = 0; i < nextIndex; i += 1) {
112 for (int i = nextIndex - 1; i >= 0; i -= 1) {
/macosx-10.10.1/BerkeleyDB-21/db/java/src/com/sleepycat/collections/
H A DBlockIterator.java42 * nextIndex is always greater or equal to zero. If the next record is not
43 * available, then nextIndex is equal to keys.length or keys[nextIndex] is
47 * key range is empty. Either way, nextIndex will be the array length and
54 private int nextIndex; field in class:BlockIterator
84 nextIndex = blockSize;
101 nextIndex = o.nextIndex;
121 * Returns whether the element at nextIndex is available.
125 return (nextIndex < key
495 public int nextIndex() { method in class:BlockIterator
[all...]
H A DStoredList.java541 if (i1.nextIndex() != i2.nextIndex()) return false;
H A DStoredIterator.java35 * under certain conditions. See {@link #nextIndex}, {@link #previousIndex},
260 * This method conforms to the {@link ListIterator#nextIndex} interface
274 public int nextIndex() { method in class:StoredIterator
/macosx-10.10.1/JavaScriptCore-7600.1.17/runtime/
H A DJSArrayIterator.h64 size_t nextIndex() const { return m_nextIndex; } function in class:JSC::JSArrayIterator
65 void setNextIndex(size_t nextIndex) { m_nextIndex = nextIndex; } argument
H A DJSArrayIterator.cpp109 size_t index = iterator->nextIndex();
/macosx-10.10.1/ICU-531.30/icuSources/common/
H A Dnormlzr.cpp35 currentIndex(0), nextIndex(0),
44 currentIndex(0), nextIndex(0),
53 currentIndex(0), nextIndex(0),
62 currentIndex(copy.currentIndex), nextIndex(copy.nextIndex),
100 return text->hashCode() + fUMode + fOptions + buffer.hashCode() + bufferPos + currentIndex + nextIndex;
112 nextIndex==that.nextIndex);
287 currentIndex=nextIndex=text->setToStart();
294 currentIndex=nextIndex
[all...]
/macosx-10.10.1/webdavfs-367/mount.tproj/
H A DOpaqueIDs.c76 * Keep a 'list' of free records in the gOpaqueEntryArray table, using the .nextIndex field as
85 uint32_t nextIndex; /* linkage for the free list */ member in struct:OpaqueEntry
113 freeEntry->nextIndex = 0;
118 gOpaqueEntryArray[gIndexOfFreeOpaqueEntryTail].nextIndex = indexToFree;
151 gIndexOfFreeOpaqueEntryHead = gOpaqueEntryArray[gIndexOfFreeOpaqueEntryHead].nextIndex;
/macosx-10.10.1/JavaScriptCore-7600.1.17/jit/
H A DJITDisassembler.cpp122 for (unsigned nextIndex = i + 1; ; nextIndex++) {
123 if (nextIndex >= labels.size()) {
128 if (labels[nextIndex].isSet()) {
129 dumpDisassembly(out, linkBuffer, labels[i], labels[nextIndex]);
131 i = nextIndex;
/macosx-10.10.1/ICU-531.30/icuSources/i18n/
H A Dcollationbuilder.cpp369 int32_t nextIndex = nextIndexFromNode(node); local
370 if(nextIndex == 0) { break; }
371 index = nextIndex;
468 int32_t nextIndex = nextIndexFromNode(node); local
471 index = insertNodeBetween(index, nextIndex, node, errorCode);
474 insertNodeBetween(index, nextIndex, node, errorCode);
639 int32_t nextIndex = nextIndexFromNode(node); local
640 if(nextIndex == 0) { break; }
641 int64_t nextNode = nodes.elementAti(nextIndex);
643 index = nextIndex;
896 int32_t nextIndex; local
934 int32_t nextIndex; local
946 insertNodeBetween(int32_t index, int32_t nextIndex, int64_t node, UErrorCode &errorCode) argument
963 nodes.setElementAt(changeNodePreviousIndex(node, newIndex), nextIndex); local
1388 int32_t nextIndex = nextIndexFromNode(node); local
[all...]
H A Dcollationfastlatin.cpp858 int32_t nextIndex = sIndex; local
860 c2 = s16[nextIndex++];
871 c2 = s8[nextIndex++];
874 if(c2 <= 0xc5 && 0xc2 <= c2 && nextIndex != sLength &&
875 0x80 <= (t = s8[nextIndex]) && t <= 0xbf) {
877 ++nextIndex;
879 int32_t i2 = nextIndex + 1;
881 if(c2 == 0xe2 && s8[nextIndex] == 0x80 &&
884 } else if(c2 == 0xef && s8[nextIndex] == 0xbf &&
893 nextIndex
[all...]
H A Dcsrmbcs.cpp159 charValue(0), index(-1), nextIndex(0), error(FALSE), done(FALSE)
168 nextIndex = 0;
175 if (nextIndex >= det->fRawLength) {
181 return det->fRawInput[nextIndex++];
317 it->index = it->nextIndex;
374 it->index = it->nextIndex;
494 it->index = it->nextIndex;
552 it->index = it->nextIndex;
H A Dcsrmbcs.h35 int32_t nextIndex; member in class:IteratedChar
H A Dcollationbuilder.h94 int32_t insertNodeBetween(int32_t index, int32_t nextIndex, int64_t node,
322 * Each list starts with a root primary node and ends with a nextIndex of 0.
325 * This allows some code not to have to check explicitly for nextIndex==0.
389 * + nextIndex=0 in last node per root-primary list
/macosx-10.10.1/JavaScriptCore-7600.1.17/assembler/
H A DAssemblerBuffer.h170 unsigned nextIndex = m_index + sizeof(IntegralType); local
171 if (UNLIKELY(nextIndex > m_storage.capacity()))
175 m_index = nextIndex;
/macosx-10.10.1/JavaScriptCore-7600.1.17/builtins/
H A DArray.prototype.js90 var nextIndex = 0;
96 result[nextIndex++] = current;
118 var nextIndex = 0;
/macosx-10.10.1/Security-57031.1.35/Security/libsecurity_apple_x509_cl/lib/
H A DCLCachedEntry.h107 * for nextIndex which can only increment
111 unsigned nextIndex() { return mNextIndex; } function in class:CLQuery
H A DSession_CRL.cpp114 if(query->nextIndex() >= query->numFields()) {
123 query->nextIndex(),
H A DSession_Cert.cpp115 if(query->nextIndex() >= query->numFields()) {
124 query->nextIndex(),
/macosx-10.10.1/tcl-105/tk/tk/generic/ttk/
H A DttkNotebook.c641 int nextIndex; local
645 for (nextIndex = index + 1; nextIndex < nTabs; ++nextIndex) {
646 Tab *tab = Ttk_SlaveData(nb->notebook.mgr, nextIndex);
648 return nextIndex;
654 for (nextIndex = index - 1; nextIndex >= 0; --nextIndex) {
655 Tab *tab = Ttk_SlaveData(nb->notebook.mgr, nextIndex);
676 int nextIndex = NextTab(nb, currentIndex); local
[all...]
/macosx-10.10.1/objc4-646/runtime/
H A Dmaptable.mm69 static INLINE unsigned nextIndex(NXMapTable *table, unsigned index) {
178 while ((index2 = nextIndex(table, index2)) != index) {
248 while ((index2 = nextIndex(table, index2)) != index) {
283 while ((index2 = nextIndex(table, index2)) != index) {
303 index2 = nextIndex(table, index2);
/macosx-10.10.1/xnu-2782.1.97/libkern/c++/
H A DOSMetaClass.cpp833 unsigned int * nextIndex = &_nextIndex[0]; local
845 nextIndex = IONew(typeof(nextIndex[0]), maxDepth);
859 nextIndex[level] = idx;
873 idx = nextIndex[level];
880 IODelete(nextIndex, typeof(nextIndex[0]), maxDepth);
/macosx-10.10.1/ICU-531.30/icuSources/common/unicode/
H A Dnormlzr.h752 // of the source in [currentIndex..nextIndex[ .
753 int32_t currentIndex, nextIndex; member in class:Normalizer
/macosx-10.10.1/tcl-105/tcl/tcl/generic/
H A DtclHash.c558 searchPtr->nextIndex = 0;
595 if (searchPtr->nextIndex >= tablePtr->numBuckets) {
599 tablePtr->buckets[searchPtr->nextIndex];
600 searchPtr->nextIndex++;
/macosx-10.10.1/tcl-105/tcl84/tcl/generic/
H A DtclHash.c683 searchPtr->nextIndex = 0;
719 if (searchPtr->nextIndex >= tablePtr->numBuckets) {
723 tablePtr->buckets[searchPtr->nextIndex];
724 searchPtr->nextIndex++;

Completed in 159 milliseconds

123