OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:m_next
(Results
1 - 25
of
42
) sorted by null
1
2
/external/apache-xml/src/main/java/org/apache/xml/utils/
NameSpace.java
37
public NameSpace
m_next
= null;
field in class:NameSpace
/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/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/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;
/external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/CollisionDispatch/
btHashedSimplePairCache.h
65
btAlignedObjectArray<int>
m_next
;
member in class:btHashedSimplePairCache
153
index =
m_next
[index];
/external/emma/core/java12/com/vladium/util/
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
...]
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;
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
...]
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
...]