Home
last modified time | relevance | path

Searched refs:lastPairIndex (Results 1 – 25 of 38) sorted by relevance

12

/dports/devel/bullet/bullet3-3.21/src/BulletCollision/CollisionDispatch/
H A DbtHashedSimplePairCache.cpp199 int lastPairIndex = m_overlappingPairArray.size() - 1; in removeOverlappingPair() local
202 if (lastPairIndex == pairIndex) in removeOverlappingPair()
209 const btSimplePair* last = &m_overlappingPairArray[lastPairIndex]; in removeOverlappingPair()
217 while (index != lastPairIndex) in removeOverlappingPair()
225 btAssert(m_next[previous] == lastPairIndex); in removeOverlappingPair()
226 m_next[previous] = m_next[lastPairIndex]; in removeOverlappingPair()
230 m_hashTable[lastHash] = m_next[lastPairIndex]; in removeOverlappingPair()
234 m_overlappingPairArray[pairIndex] = m_overlappingPairArray[lastPairIndex]; in removeOverlappingPair()
/dports/graphics/blender/blender-2.91.0/extern/bullet2/src/BulletCollision/CollisionDispatch/
H A DbtHashedSimplePairCache.cpp199 int lastPairIndex = m_overlappingPairArray.size() - 1; in removeOverlappingPair() local
202 if (lastPairIndex == pairIndex) in removeOverlappingPair()
209 const btSimplePair* last = &m_overlappingPairArray[lastPairIndex]; in removeOverlappingPair()
217 while (index != lastPairIndex) in removeOverlappingPair()
225 btAssert(m_next[previous] == lastPairIndex); in removeOverlappingPair()
226 m_next[previous] = m_next[lastPairIndex]; in removeOverlappingPair()
230 m_hashTable[lastHash] = m_next[lastPairIndex]; in removeOverlappingPair()
234 m_overlappingPairArray[pairIndex] = m_overlappingPairArray[lastPairIndex]; in removeOverlappingPair()
/dports/science/chrono/chrono-7.0.1/src/chrono/collision/bullet/BulletCollision/CollisionDispatch/
H A DbtHashedSimplePairCache.cpp199 int lastPairIndex = m_overlappingPairArray.size() - 1; in removeOverlappingPair() local
202 if (lastPairIndex == pairIndex) in removeOverlappingPair()
209 const btSimplePair* last = &m_overlappingPairArray[lastPairIndex]; in removeOverlappingPair()
217 while (index != lastPairIndex) in removeOverlappingPair()
225 btAssert(m_next[previous] == lastPairIndex); in removeOverlappingPair()
226 m_next[previous] = m_next[lastPairIndex]; in removeOverlappingPair()
230 m_hashTable[lastHash] = m_next[lastPairIndex]; in removeOverlappingPair()
234 m_overlappingPairArray[pairIndex] = m_overlappingPairArray[lastPairIndex]; in removeOverlappingPair()
/dports/graphics/urho3d/Urho3D-1.7.1/Source/ThirdParty/Bullet/src/BulletCollision/CollisionDispatch/
H A DbtHashedSimplePairCache.cpp221 int lastPairIndex = m_overlappingPairArray.size() - 1; in removeOverlappingPair() local
224 if (lastPairIndex == pairIndex) in removeOverlappingPair()
231 const btSimplePair* last = &m_overlappingPairArray[lastPairIndex]; in removeOverlappingPair()
239 while (index != lastPairIndex) in removeOverlappingPair()
247 btAssert(m_next[previous] == lastPairIndex); in removeOverlappingPair()
248 m_next[previous] = m_next[lastPairIndex]; in removeOverlappingPair()
252 m_hashTable[lastHash] = m_next[lastPairIndex]; in removeOverlappingPair()
256 m_overlappingPairArray[pairIndex] = m_overlappingPairArray[lastPairIndex]; in removeOverlappingPair()
/dports/devel/py-bullet3/bullet3-3.21/src/BulletCollision/CollisionDispatch/
H A DbtHashedSimplePairCache.cpp199 int lastPairIndex = m_overlappingPairArray.size() - 1; in removeOverlappingPair() local
202 if (lastPairIndex == pairIndex) in removeOverlappingPair()
209 const btSimplePair* last = &m_overlappingPairArray[lastPairIndex]; in removeOverlappingPair()
217 while (index != lastPairIndex) in removeOverlappingPair()
225 btAssert(m_next[previous] == lastPairIndex); in removeOverlappingPair()
226 m_next[previous] = m_next[lastPairIndex]; in removeOverlappingPair()
230 m_hashTable[lastHash] = m_next[lastPairIndex]; in removeOverlappingPair()
234 m_overlappingPairArray[pairIndex] = m_overlappingPairArray[lastPairIndex]; in removeOverlappingPair()
/dports/games/OpenTomb/OpenTomb-win32-2018-02-03_alpha/extern/bullet/BulletCollision/CollisionDispatch/
H A DbtHashedSimplePairCache.cpp223 int lastPairIndex = m_overlappingPairArray.size() - 1; in removeOverlappingPair() local
226 if (lastPairIndex == pairIndex) in removeOverlappingPair()
233 const btSimplePair* last = &m_overlappingPairArray[lastPairIndex]; in removeOverlappingPair()
241 while (index != lastPairIndex) in removeOverlappingPair()
249 btAssert(m_next[previous] == lastPairIndex); in removeOverlappingPair()
250 m_next[previous] = m_next[lastPairIndex]; in removeOverlappingPair()
254 m_hashTable[lastHash] = m_next[lastPairIndex]; in removeOverlappingPair()
258 m_overlappingPairArray[pairIndex] = m_overlappingPairArray[lastPairIndex]; in removeOverlappingPair()
/dports/devel/godot/godot-3.2.3-stable/thirdparty/bullet/BulletCollision/CollisionDispatch/
H A DbtHashedSimplePairCache.cpp199 int lastPairIndex = m_overlappingPairArray.size() - 1; in removeOverlappingPair() local
202 if (lastPairIndex == pairIndex) in removeOverlappingPair()
209 const btSimplePair* last = &m_overlappingPairArray[lastPairIndex]; in removeOverlappingPair()
217 while (index != lastPairIndex) in removeOverlappingPair()
225 btAssert(m_next[previous] == lastPairIndex); in removeOverlappingPair()
226 m_next[previous] = m_next[lastPairIndex]; in removeOverlappingPair()
230 m_hashTable[lastHash] = m_next[lastPairIndex]; in removeOverlappingPair()
234 m_overlappingPairArray[pairIndex] = m_overlappingPairArray[lastPairIndex]; in removeOverlappingPair()
/dports/devel/godot-tools/godot-3.2.3-stable/thirdparty/bullet/BulletCollision/CollisionDispatch/
H A DbtHashedSimplePairCache.cpp199 int lastPairIndex = m_overlappingPairArray.size() - 1; in removeOverlappingPair() local
202 if (lastPairIndex == pairIndex) in removeOverlappingPair()
209 const btSimplePair* last = &m_overlappingPairArray[lastPairIndex]; in removeOverlappingPair()
217 while (index != lastPairIndex) in removeOverlappingPair()
225 btAssert(m_next[previous] == lastPairIndex); in removeOverlappingPair()
226 m_next[previous] = m_next[lastPairIndex]; in removeOverlappingPair()
230 m_hashTable[lastHash] = m_next[lastPairIndex]; in removeOverlappingPair()
234 m_overlappingPairArray[pairIndex] = m_overlappingPairArray[lastPairIndex]; in removeOverlappingPair()
/dports/devel/bullet/bullet3-3.21/src/Bullet3Common/
H A Db3HashMap.h335 int lastPairIndex = m_valueArray.size() - 1; in remove() local
338 if (lastPairIndex == pairIndex) in remove()
346 int lastHash = m_keyArray[lastPairIndex].getHash() & (m_valueArray.capacity() - 1); in remove()
352 while (index != lastPairIndex) in remove()
360 b3Assert(m_next[previous] == lastPairIndex); in remove()
361 m_next[previous] = m_next[lastPairIndex]; in remove()
365 m_hashTable[lastHash] = m_next[lastPairIndex]; in remove()
369 m_valueArray[pairIndex] = m_valueArray[lastPairIndex]; in remove()
370 m_keyArray[pairIndex] = m_keyArray[lastPairIndex]; in remove()
/dports/games/supertuxkart/SuperTuxKart-1.2-src/lib/bullet/src/LinearMath/
H A DbtHashMap.h332 int lastPairIndex = m_valueArray.size() - 1; in remove() local
335 if (lastPairIndex == pairIndex) in remove()
343 int lastHash = m_keyArray[lastPairIndex].getHash() & (m_valueArray.capacity()-1); in remove()
349 while (index != lastPairIndex) in remove()
357 btAssert(m_next[previous] == lastPairIndex); in remove()
358 m_next[previous] = m_next[lastPairIndex]; in remove()
362 m_hashTable[lastHash] = m_next[lastPairIndex]; in remove()
366 m_valueArray[pairIndex] = m_valueArray[lastPairIndex]; in remove()
367 m_keyArray[pairIndex] = m_keyArray[lastPairIndex]; in remove()
/dports/games/critterding/critterding-beta12/src/utils/bullet/LinearMath/
H A DbtHashMap.h316 int lastPairIndex = m_valueArray.size() - 1; in remove() local
319 if (lastPairIndex == pairIndex) in remove()
327 int lastHash = m_keyArray[lastPairIndex].getHash() & (m_valueArray.capacity()-1); in remove()
333 while (index != lastPairIndex) in remove()
341 btAssert(m_next[previous] == lastPairIndex); in remove()
342 m_next[previous] = m_next[lastPairIndex]; in remove()
346 m_hashTable[lastHash] = m_next[lastPairIndex]; in remove()
350 m_valueArray[pairIndex] = m_valueArray[lastPairIndex]; in remove()
351 m_keyArray[pairIndex] = m_keyArray[lastPairIndex]; in remove()
/dports/devel/godot-tools/godot-3.2.3-stable/thirdparty/bullet/Bullet3Common/
H A Db3HashMap.h335 int lastPairIndex = m_valueArray.size() - 1; in remove() local
338 if (lastPairIndex == pairIndex) in remove()
346 int lastHash = m_keyArray[lastPairIndex].getHash() & (m_valueArray.capacity() - 1); in remove()
352 while (index != lastPairIndex) in remove()
360 b3Assert(m_next[previous] == lastPairIndex); in remove()
361 m_next[previous] = m_next[lastPairIndex]; in remove()
365 m_hashTable[lastHash] = m_next[lastPairIndex]; in remove()
369 m_valueArray[pairIndex] = m_valueArray[lastPairIndex]; in remove()
370 m_keyArray[pairIndex] = m_keyArray[lastPairIndex]; in remove()
/dports/graphics/urho3d/Urho3D-1.7.1/Source/ThirdParty/Bullet/src/LinearMath/
H A DbtHashMap.h332 int lastPairIndex = m_valueArray.size() - 1; in remove() local
335 if (lastPairIndex == pairIndex) in remove()
343 int lastHash = m_keyArray[lastPairIndex].getHash() & (m_valueArray.capacity()-1); in remove()
349 while (index != lastPairIndex) in remove()
357 btAssert(m_next[previous] == lastPairIndex); in remove()
358 m_next[previous] = m_next[lastPairIndex]; in remove()
362 m_hashTable[lastHash] = m_next[lastPairIndex]; in remove()
366 m_valueArray[pairIndex] = m_valueArray[lastPairIndex]; in remove()
367 m_keyArray[pairIndex] = m_keyArray[lastPairIndex]; in remove()
/dports/devel/py-bullet3/bullet3-3.21/src/Bullet3Common/
H A Db3HashMap.h335 int lastPairIndex = m_valueArray.size() - 1; in remove() local
338 if (lastPairIndex == pairIndex) in remove()
346 int lastHash = m_keyArray[lastPairIndex].getHash() & (m_valueArray.capacity() - 1); in remove()
352 while (index != lastPairIndex) in remove()
360 b3Assert(m_next[previous] == lastPairIndex); in remove()
361 m_next[previous] = m_next[lastPairIndex]; in remove()
365 m_hashTable[lastHash] = m_next[lastPairIndex]; in remove()
369 m_valueArray[pairIndex] = m_valueArray[lastPairIndex]; in remove()
370 m_keyArray[pairIndex] = m_keyArray[lastPairIndex]; in remove()
/dports/games/OpenTomb/OpenTomb-win32-2018-02-03_alpha/extern/bullet/LinearMath/
H A DbtHashMap.h332 int lastPairIndex = m_valueArray.size() - 1; in remove() local
335 if (lastPairIndex == pairIndex) in remove()
343 int lastHash = m_keyArray[lastPairIndex].getHash() & (m_valueArray.capacity()-1); in remove()
349 while (index != lastPairIndex) in remove()
357 btAssert(m_next[previous] == lastPairIndex); in remove()
358 m_next[previous] = m_next[lastPairIndex]; in remove()
362 m_hashTable[lastHash] = m_next[lastPairIndex]; in remove()
366 m_valueArray[pairIndex] = m_valueArray[lastPairIndex]; in remove()
367 m_keyArray[pairIndex] = m_keyArray[lastPairIndex]; in remove()
/dports/devel/emscripten/emscripten-2.0.3/tests/third_party/bullet/src/LinearMath/
H A DbtHashMap.h332 int lastPairIndex = m_valueArray.size() - 1; in remove() local
335 if (lastPairIndex == pairIndex) in remove()
343 int lastHash = m_keyArray[lastPairIndex].getHash() & (m_valueArray.capacity()-1); in remove()
349 while (index != lastPairIndex) in remove()
357 btAssert(m_next[previous] == lastPairIndex); in remove()
358 m_next[previous] = m_next[lastPairIndex]; in remove()
362 m_hashTable[lastHash] = m_next[lastPairIndex]; in remove()
366 m_valueArray[pairIndex] = m_valueArray[lastPairIndex]; in remove()
367 m_keyArray[pairIndex] = m_keyArray[lastPairIndex]; in remove()
/dports/devel/godot/godot-3.2.3-stable/thirdparty/bullet/Bullet3Common/
H A Db3HashMap.h335 int lastPairIndex = m_valueArray.size() - 1; in remove() local
338 if (lastPairIndex == pairIndex) in remove()
346 int lastHash = m_keyArray[lastPairIndex].getHash() & (m_valueArray.capacity() - 1); in remove()
352 while (index != lastPairIndex) in remove()
360 b3Assert(m_next[previous] == lastPairIndex); in remove()
361 m_next[previous] = m_next[lastPairIndex]; in remove()
365 m_hashTable[lastHash] = m_next[lastPairIndex]; in remove()
369 m_valueArray[pairIndex] = m_valueArray[lastPairIndex]; in remove()
370 m_keyArray[pairIndex] = m_keyArray[lastPairIndex]; in remove()
/dports/devel/bullet/bullet3-3.21/src/LinearMath/
H A DbtHashMap.h328 int lastPairIndex = m_valueArray.size() - 1; in remove() local
331 if (lastPairIndex == pairIndex) in remove()
339 int lastHash = m_keyArray[lastPairIndex].getHash() & (m_valueArray.capacity() - 1); in remove()
345 while (index != lastPairIndex) in remove()
353 btAssert(m_next[previous] == lastPairIndex); in remove()
354 m_next[previous] = m_next[lastPairIndex]; in remove()
358 m_hashTable[lastHash] = m_next[lastPairIndex]; in remove()
362 m_valueArray[pairIndex] = m_valueArray[lastPairIndex]; in remove()
363 m_keyArray[pairIndex] = m_keyArray[lastPairIndex]; in remove()
/dports/graphics/blender/blender-2.91.0/extern/bullet2/src/LinearMath/
H A DbtHashMap.h328 int lastPairIndex = m_valueArray.size() - 1; in remove() local
331 if (lastPairIndex == pairIndex) in remove()
339 int lastHash = m_keyArray[lastPairIndex].getHash() & (m_valueArray.capacity() - 1); in remove()
345 while (index != lastPairIndex) in remove()
353 btAssert(m_next[previous] == lastPairIndex); in remove()
354 m_next[previous] = m_next[lastPairIndex]; in remove()
358 m_hashTable[lastHash] = m_next[lastPairIndex]; in remove()
362 m_valueArray[pairIndex] = m_valueArray[lastPairIndex]; in remove()
363 m_keyArray[pairIndex] = m_keyArray[lastPairIndex]; in remove()
/dports/devel/godot/godot-3.2.3-stable/thirdparty/bullet/LinearMath/
H A DbtHashMap.h328 int lastPairIndex = m_valueArray.size() - 1; in remove() local
331 if (lastPairIndex == pairIndex) in remove()
339 int lastHash = m_keyArray[lastPairIndex].getHash() & (m_valueArray.capacity() - 1); in remove()
345 while (index != lastPairIndex) in remove()
353 btAssert(m_next[previous] == lastPairIndex); in remove()
354 m_next[previous] = m_next[lastPairIndex]; in remove()
358 m_hashTable[lastHash] = m_next[lastPairIndex]; in remove()
362 m_valueArray[pairIndex] = m_valueArray[lastPairIndex]; in remove()
363 m_keyArray[pairIndex] = m_keyArray[lastPairIndex]; in remove()
/dports/devel/godot-tools/godot-3.2.3-stable/thirdparty/bullet/LinearMath/
H A DbtHashMap.h328 int lastPairIndex = m_valueArray.size() - 1; in remove() local
331 if (lastPairIndex == pairIndex) in remove()
339 int lastHash = m_keyArray[lastPairIndex].getHash() & (m_valueArray.capacity() - 1); in remove()
345 while (index != lastPairIndex) in remove()
353 btAssert(m_next[previous] == lastPairIndex); in remove()
354 m_next[previous] = m_next[lastPairIndex]; in remove()
358 m_hashTable[lastHash] = m_next[lastPairIndex]; in remove()
362 m_valueArray[pairIndex] = m_valueArray[lastPairIndex]; in remove()
363 m_keyArray[pairIndex] = m_keyArray[lastPairIndex]; in remove()
/dports/science/chrono/chrono-7.0.1/src/chrono/collision/bullet/LinearMath/
H A DbtHashMap.h328 int lastPairIndex = m_valueArray.size() - 1; in remove() local
331 if (lastPairIndex == pairIndex) in remove()
339 int lastHash = m_keyArray[lastPairIndex].getHash() & (m_valueArray.capacity() - 1); in remove()
345 while (index != lastPairIndex) in remove()
353 btAssert(m_next[previous] == lastPairIndex); in remove()
354 m_next[previous] = m_next[lastPairIndex]; in remove()
358 m_hashTable[lastHash] = m_next[lastPairIndex]; in remove()
362 m_valueArray[pairIndex] = m_valueArray[lastPairIndex]; in remove()
363 m_keyArray[pairIndex] = m_keyArray[lastPairIndex]; in remove()
/dports/devel/py-bullet3/bullet3-3.21/src/LinearMath/
H A DbtHashMap.h328 int lastPairIndex = m_valueArray.size() - 1; in remove() local
331 if (lastPairIndex == pairIndex) in remove()
339 int lastHash = m_keyArray[lastPairIndex].getHash() & (m_valueArray.capacity() - 1); in remove()
345 while (index != lastPairIndex) in remove()
353 btAssert(m_next[previous] == lastPairIndex); in remove()
354 m_next[previous] = m_next[lastPairIndex]; in remove()
358 m_hashTable[lastHash] = m_next[lastPairIndex]; in remove()
362 m_valueArray[pairIndex] = m_valueArray[lastPairIndex]; in remove()
363 m_keyArray[pairIndex] = m_keyArray[lastPairIndex]; in remove()
/dports/devel/bullet/bullet3-3.21/src/Bullet3Collision/BroadPhaseCollision/
H A Db3OverlappingPairCache.cpp286 int lastPairIndex = m_overlappingPairArray.size() - 1; in removeOverlappingPair() local
292 if (lastPairIndex == pairIndex) in removeOverlappingPair()
299 const b3BroadphasePair* last = &m_overlappingPairArray[lastPairIndex]; in removeOverlappingPair()
307 while (index != lastPairIndex) in removeOverlappingPair()
315 b3Assert(m_next[previous] == lastPairIndex); in removeOverlappingPair()
316 m_next[previous] = m_next[lastPairIndex]; in removeOverlappingPair()
320 m_hashTable[lastHash] = m_next[lastPairIndex]; in removeOverlappingPair()
324 m_overlappingPairArray[pairIndex] = m_overlappingPairArray[lastPairIndex]; in removeOverlappingPair()
/dports/devel/py-bullet3/bullet3-3.21/src/Bullet3Collision/BroadPhaseCollision/
H A Db3OverlappingPairCache.cpp286 int lastPairIndex = m_overlappingPairArray.size() - 1; in removeOverlappingPair() local
292 if (lastPairIndex == pairIndex) in removeOverlappingPair()
299 const b3BroadphasePair* last = &m_overlappingPairArray[lastPairIndex]; in removeOverlappingPair()
307 while (index != lastPairIndex) in removeOverlappingPair()
315 b3Assert(m_next[previous] == lastPairIndex); in removeOverlappingPair()
316 m_next[previous] = m_next[lastPairIndex]; in removeOverlappingPair()
320 m_hashTable[lastHash] = m_next[lastPairIndex]; in removeOverlappingPair()
324 m_overlappingPairArray[pairIndex] = m_overlappingPairArray[lastPairIndex]; in removeOverlappingPair()

12