Home
last modified time | relevance | path

Searched refs:pairIndex (Results 1 – 10 of 10) sorted by relevance

/external/icu/icu4c/source/common/
Dusc_impl.c37 int32_t pairIndex; member
78 static void push(UScriptRun *scriptRun, int32_t pairIndex, UScriptCode scriptCode) in push() argument
84 scriptRun->parenStack[scriptRun->parenSP].pairIndex = pairIndex; in push()
164 int32_t pairIndex = 0; in getPairIndex() local
167 pairIndex = pairedCharExtra; in getPairIndex()
173 if (ch >= pairedChars[pairIndex + probe]) { in getPairIndex()
174 pairIndex += probe; in getPairIndex()
178 if (pairedChars[pairIndex] != ch) { in getPairIndex()
179 pairIndex = -1; in getPairIndex()
182 return pairIndex; in getPairIndex()
[all …]
/external/icu/icu4c/source/extra/scrptrun/
Dscrptrun.cpp143 int32_t pairIndex = getPairIndex(ch); in next() local
151 if (pairIndex >= 0) { in next()
152 if ((pairIndex & 1) == 0) { in next()
153 parenStack[++parenSP].pairIndex = pairIndex; in next()
156 int32_t pi = pairIndex & ~1; in next()
158 while (parenSP >= 0 && parenStack[parenSP].pairIndex != pi) { in next()
185 if (pairIndex >= 0 && (pairIndex & 1) != 0 && parenSP >= 0) { in next()
Dscrptrun.h30 int32_t pairIndex; member
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/lang/
DUScriptRun.java354 int pairIndex = getPairIndex(ch); in next() local
364 if (pairIndex >= 0) { in next()
365 if ((pairIndex & 1) == 0) { in next()
366 push(pairIndex, scriptCode); in next()
368 int pi = pairIndex & ~1; in next()
370 while (stackIsNotEmpty() && top().pairIndex != pi) { in next()
389 if (pairIndex >= 0 && (pairIndex & 1) != 0) { in next()
424 int pairIndex; field in UScriptRun.ParenStackEntry
429 pairIndex = thePairIndex; in ParenStackEntry()
478 private final void push(int pairIndex, int scrptCode) in push() argument
[all …]
/external/icu/android_icu4j/src/main/java/android/icu/lang/
DUScriptRun.java356 int pairIndex = getPairIndex(ch); in next() local
366 if (pairIndex >= 0) { in next()
367 if ((pairIndex & 1) == 0) { in next()
368 push(pairIndex, scriptCode); in next()
370 int pi = pairIndex & ~1; in next()
372 while (stackIsNotEmpty() && top().pairIndex != pi) { in next()
391 if (pairIndex >= 0 && (pairIndex & 1) != 0) { in next()
426 int pairIndex; field in UScriptRun.ParenStackEntry
431 pairIndex = thePairIndex; in ParenStackEntry()
480 private final void push(int pairIndex, int scrptCode) in push() argument
[all …]
/external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/CollisionDispatch/
DbtHashedSimplePairCache.cpp195 int pairIndex = int(pair - &m_overlappingPairArray[0]); in removeOverlappingPair() local
196 btAssert(pairIndex < m_overlappingPairArray.size()); in removeOverlappingPair()
203 while (index != pairIndex) in removeOverlappingPair()
211 btAssert(m_next[previous] == pairIndex); in removeOverlappingPair()
212 m_next[previous] = m_next[pairIndex]; in removeOverlappingPair()
216 m_hashTable[hash] = m_next[pairIndex]; in removeOverlappingPair()
226 if (lastPairIndex == pairIndex) in removeOverlappingPair()
258 m_overlappingPairArray[pairIndex] = m_overlappingPairArray[lastPairIndex]; in removeOverlappingPair()
261 m_next[pairIndex] = m_hashTable[lastHash]; in removeOverlappingPair()
262 m_hashTable[lastHash] = pairIndex; in removeOverlappingPair()
/external/libgdx/extensions/gdx-bullet/jni/src/bullet/LinearMath/
DbtHashMap.h300 int pairIndex = findIndex(key); in remove() local
302 if (pairIndex ==BT_HASH_NULL) in remove()
312 while (index != pairIndex) in remove()
320 btAssert(m_next[previous] == pairIndex); in remove()
321 m_next[previous] = m_next[pairIndex]; in remove()
325 m_hashTable[hash] = m_next[pairIndex]; in remove()
335 if (lastPairIndex == pairIndex) in remove()
366 m_valueArray[pairIndex] = m_valueArray[lastPairIndex]; in remove()
367 m_keyArray[pairIndex] = m_keyArray[lastPairIndex]; in remove()
370 m_next[pairIndex] = m_hashTable[lastHash]; in remove()
[all …]
/external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/BroadphaseCollision/
DbtOverlappingPairCache.cpp299 int pairIndex = int(pair - &m_overlappingPairArray[0]); in removeOverlappingPair() local
300 btAssert(pairIndex < m_overlappingPairArray.size()); in removeOverlappingPair()
307 while (index != pairIndex) in removeOverlappingPair()
315 btAssert(m_next[previous] == pairIndex); in removeOverlappingPair()
316 m_next[previous] = m_next[pairIndex]; in removeOverlappingPair()
320 m_hashTable[hash] = m_next[pairIndex]; in removeOverlappingPair()
333 if (lastPairIndex == pairIndex) in removeOverlappingPair()
365 m_overlappingPairArray[pairIndex] = m_overlappingPairArray[lastPairIndex]; in removeOverlappingPair()
368 m_next[pairIndex] = m_hashTable[lastHash]; in removeOverlappingPair()
369 m_hashTable[lastHash] = pairIndex; in removeOverlappingPair()
/external/lzma/CPP/7zip/UI/Common/
DUpdateCallback.cpp499 unsigned pairIndex = _map.AddToUniqueSorted2(pair); in GetStream() local
504 _hardIndex_To = pairIndex; in GetStream()
DArchiveExtractCallback.cpp1169 int pairIndex = pairs[i].Index; in SetDirsTimes() local
1170 int index = _extractedFolderIndices[pairIndex]; in SetDirsTimes()
1185 SetDirTime(_extractedFolderPaths[pairIndex], in SetDirsTimes()