HomeSort by relevance Sort by last modified time
    Searched refs:m_next (Results 1 - 25 of 64) sorted by null

1 2 3

  /external/libgdx/extensions/gdx-bullet/jni/src/bullet/LinearMath/
btList.h 22 btGEN_Link() : m_next(0), m_prev(0) {}
23 btGEN_Link(btGEN_Link *next, btGEN_Link *prev) : m_next(next), m_prev(prev) {}
25 btGEN_Link *getNext() const { return m_next; }
29 bool isTail() const { return m_next == 0; }
32 m_next = link;
34 m_next->m_prev = this;
35 m_prev->m_next = this;
39 m_next = link->m_next;
41 m_next->m_prev = this
51 btGEN_Link *m_next; member in class:btGEN_Link
    [all...]
btHashMap.h 225 btAlignedObjectArray<int> m_next; member in class:btHashMap
240 m_next.resize(newCapacity);
250 m_next[i] = BT_HASH_NULL;
259 m_next[i] = m_hashTable[hashValue];
292 m_next[count] = m_hashTable[hash];
315 index = m_next[index];
320 btAssert(m_next[previous] == pairIndex);
321 m_next[previous] = m_next[pairIndex];
325 m_hashTable[hash] = m_next[pairIndex]
    [all...]
  /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/CollisionDispatch/
btHashedSimplePairCache.cpp 55 m_next.clear();
82 index = m_next[index];
108 m_next.resize(newCapacity);
119 m_next[i] = BT_SIMPLE_NULL_PAIR;
130 m_next[i] = m_hashTable[hashValue];
167 m_next[count] = m_hashTable[hash];
206 index = m_next[index];
211 btAssert(m_next[previous] == pairIndex);
212 m_next[previous] = m_next[pairIndex]
    [all...]
btHashedSimplePairCache.h 65 btAlignedObjectArray<int> m_next; member in class:btHashedSimplePairCache
153 index = m_next[index];
  /external/apache-xml/src/main/java/org/apache/xpath/axes/
NodeSequence.java 50 protected int m_next = 0; field in class:NodeSequence
271 m_next=0;
283 m_next = 0;
318 if(m_next < vec.size())
321 int next = vec.elementAt(m_next);
322 m_next++;
327 m_next++;
343 m_next++;
349 m_next++;
353 m_next++
    [all...]
  /external/apache-xml/src/main/java/org/apache/xml/serializer/
ElemContext.java 101 * that connections between the frames via m_next and m_prev
106 private ElemContext m_next; field in class:ElemContext
167 ElemContext frame = this.m_next;
174 this.m_next = frame;
201 ElemContext frame = this.m_next;
208 this.m_next = frame;
  /external/apache-xml/src/main/java/org/apache/xml/utils/
NameSpace.java 37 public NameSpace m_next = null; field in class:NameSpace
  /external/opencv/cv/src/
_cvlist.h 89 struct prefix##element_##type* m_next;\
121 if(element->m_next != NULL)\
123 element->m_next->m_prev = NULL;\
124 l->m_head_free.m_pos = element->m_next;\
152 element->m_next = ((element_type*)l->m_head_free.m_pos);\
197 pos->m_pos = element->m_next;\
234 element->m_next = (ELEMENT_##type*)(l->m_head.m_pos);\
236 if(element->m_next)\
238 element->m_next->m_prev = element;\
251 element->m_next = NULL;
    [all...]
  /external/apache-xml/src/main/java/org/apache/xpath/
NodeSetDTM.java 285 m_next = 0;
388 if ((m_next) < this.size())
390 int next = this.elementAt(m_next);
392 m_next++;
418 if ((m_next - 1) > 0)
420 m_next--;
422 return this.elementAt(m_next);
463 return (m_next == 0);
469 * m_next to the index. If the index argument is -1, this
485 if ((index >= 0) && (m_next < m_firstFree)
1103 transient protected int m_next = 0; field in class:NodeSetDTM
    [all...]
NodeSet.java 172 m_next = 0;
244 if ((m_next) < this.size())
246 Node next = this.elementAt(m_next);
248 m_next++;
274 if ((m_next - 1) > 0)
276 m_next--;
278 return this.elementAt(m_next);
307 return (m_next == 0);
313 * m_next to the index. If the index argument is -1, this
329 if ((index >= 0) && (m_next < m_firstFree)
718 transient protected int m_next = 0; field in class:NodeSet
    [all...]
  /external/emma/core/java12/com/vladium/util/
IntObjectMap.java 91 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
116 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
136 for (Entry entry = m_buckets [b]; entry != null; entry = entry.m_next)
165 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
228 m_next = next;
234 Entry m_next; // singly-linked list link field in class:IntObjectMap.Entry
258 final Entry next = entry.m_next; // remember next pointer because we are going to reuse this entry
265 entry.m_next = bucketListHead;
IntSet.java 89 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
109 for (Entry entry = m_buckets [b]; entry != null; entry = entry.m_next)
127 for (Entry entry = m_buckets [b]; entry != null; entry = entry.m_next)
146 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
201 m_next = next;
206 Entry m_next; // singly-linked list link field in class:IntSet.Entry
230 final Entry next = entry.m_next; // remember next pointer because we are going to reuse this entry
237 entry.m_next = bucketListHead;
IntIntMap.java 91 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
115 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
134 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
153 for (Entry entry = m_buckets [b]; entry != null; entry = entry.m_next)
179 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
224 final Entry next = entry.m_next;
231 prev.m_next = next;
270 m_next = next;
276 Entry m_next; // singly-linked list link field in class:IntIntMap.Entry
300 final Entry next = entry.m_next; // remember next pointer because we are going to reuse this entr
    [all...]
SoftValueMap.java 169 for (SoftEntry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
238 for (SoftEntry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
307 for (SoftEntry entry = buckets [bucketIndex], prev = null; entry != null; prev = entry, entry = entry.m_next)
315 buckets [bucketIndex] = entry.m_next;
319 prev.m_next = entry.m_next;
331 entry.m_next = null;
351 final SoftEntry next = entry.m_next; // remember next pointer because we are going to reuse this entry
358 entry.m_next = null;
454 m_next = next
460 SoftEntry m_next; \/\/ singly-linked list link field in class:SoftValueMap.SoftEntry
    [all...]
ObjectIntMap.java 96 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
124 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
143 for (Entry entry = m_buckets [b]; entry != null; entry = entry.m_next)
172 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
220 final Entry next = entry.m_next;
227 prev.m_next = next;
266 m_next = next;
272 Entry m_next; // singly-linked list link field in class:ObjectIntMap.Entry
296 final Entry next = entry.m_next; // remember next pointer because we are going to reuse this entry
303 entry.m_next = bucketListHead
    [all...]
  /external/apache-xml/src/main/java/org/apache/xalan/templates/
TemplateSubPatternAssociation.java 50 private TemplateSubPatternAssociation m_next = null; field in class:TemplateSubPatternAssociation
87 tspa.m_next = null;
233 return m_next;
247 m_next = mp;
RedundentExprEliminator.java 173 next = next.m_next;
218 matchedPathsTail.m_next = null;
223 matchedPathsTail.m_next = (MultistepExprHolder)meh.clone();
227 matchedPathsTail = matchedPathsTail.m_next;
228 matchedPathsTail.m_next = null;
231 meh = meh.m_next;
255 matchedPaths = matchedPaths.m_next;
317 next = next.m_next;
390 next = next.m_next;
629 tail.m_next = new MultistepExprHolder(owner2, stepCount, null)
1303 MultistepExprHolder m_next; field in class:RedundentExprEliminator.MultistepExprHolder
    [all...]
  /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/BroadphaseCollision/
btOverlappingPairCache.cpp 157 index = m_next[index];
183 m_next.resize(newCapacity);
194 m_next[i] = BT_NULL_PAIR;
206 m_next[i] = m_hashTable[hashValue];
265 m_next[count] = m_hashTable[hash];
310 index = m_next[index];
315 btAssert(m_next[previous] == pairIndex);
316 m_next[previous] = m_next[pairIndex];
320 m_hashTable[hash] = m_next[pairIndex]
    [all...]
  /external/libgdx/extensions/gdx-box2d/gdx-box2d/jni/Box2D/Dynamics/Joints/
b2Joint.h 172 b2Joint* m_next; member in class:b2Joint
203 return m_next;
208 return m_next;
  /external/libgdx/extensions/gdx-box2d/gdx-box2d/jni/Box2D/Dynamics/
b2Body.cpp 72 m_next = NULL;
156 for (b2Fixture* f = m_fixtureList; f; f = f->m_next)
186 fixture->m_next = m_fixtureList;
232 *node = fixture->m_next;
237 node = &(*node)->m_next;
271 fixture->m_next = NULL;
303 for (b2Fixture* f = m_fixtureList; f; f = f->m_next)
435 for (b2Fixture* f = m_fixtureList; f; f = f->m_next)
448 for (b2Fixture* f = m_fixtureList; f; f = f->m_next)
469 for (b2Fixture* f = m_fixtureList; f; f = f->m_next)
    [all...]
b2ContactManager.cpp 52 c->m_prev->m_next = c->m_next;
55 if (c->m_next)
57 c->m_next->m_prev = c->m_prev;
62 m_contactList = c->m_next;
255 c->m_next = m_contactList;
  /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/test/
execution_monitor.hpp 64 next.swap( m_next );
74 boost::scoped_ptr<translate_exception_base> m_next; member in class:boost::detail::translate_exception_base
214 return m_next ? (*m_next)( F ) : F();
  /ndk/tests/device/test-gnustl-full/unit/cppunit/
test_main.cpp 33 in_testCase->m_next = m_root;
46 tmp = tmp->m_next;
  /ndk/tests/device/test-stlport/unit/cppunit/
test_main.cpp 33 in_testCase->m_next = m_root;
46 tmp = tmp->m_next;
  /external/libgdx/extensions/gdx-box2d/gdx-box2d-gwt/src/com/badlogic/gdx/physics/box2d/gwt/emu/org/jbox2d/dynamics/
ContactManager.java 132 c.m_next = m_contactList;
187 c.m_prev.m_next = c.m_next;
190 if (c.m_next != null) {
191 c.m_next.m_prev = c.m_prev;
195 m_contactList = c.m_next;

Completed in 2062 milliseconds

1 2 3