| /external/apache-xml/src/main/java/org/apache/xpath/axes/ |
| D | NodeSequence.java | 50 protected int m_next = 0; field in NodeSequence
271 m_next=0; in setRoot()
283 m_next = 0; in reset()
318 if(m_next < vec.size()) in nextNode()
321 int next = vec.elementAt(m_next); in nextNode()
322 m_next++; in nextNode()
327 m_next++; in nextNode()
343 m_next++; in nextNode()
349 m_next++; in nextNode()
353 m_next++; in nextNode()
[all …]
|
| /external/apache-xml/src/main/java/org/apache/xpath/ |
| D | NodeSetDTM.java | 285 m_next = 0; in reset()
388 if ((m_next) < this.size()) in nextNode()
390 int next = this.elementAt(m_next); in nextNode()
392 m_next++; in nextNode()
418 if ((m_next - 1) > 0) in previousNode()
420 m_next--; in previousNode()
422 return this.elementAt(m_next); in previousNode()
463 return (m_next == 0); in isFresh()
485 if ((index >= 0) && (m_next < m_firstFree)) in runTo()
486 m_next = index; in runTo()
[all …]
|
| D | NodeSet.java | 172 m_next = 0; in reset()
244 if ((m_next) < this.size()) in nextNode()
246 Node next = this.elementAt(m_next); in nextNode()
248 m_next++; in nextNode()
274 if ((m_next - 1) > 0) in previousNode()
276 m_next--; in previousNode()
278 return this.elementAt(m_next); in previousNode()
307 return (m_next == 0); in isFresh()
329 if ((index >= 0) && (m_next < m_firstFree)) in runTo()
330 m_next = index; in runTo()
[all …]
|
| /external/emma/core/java12/com/vladium/util/ |
| D | SoftValueMap.java | 169 for (SoftEntry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in get()
238 for (SoftEntry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in put()
307 …ntry entry = buckets [bucketIndex], prev = null; entry != null; prev = entry, entry = entry.m_next) in remove()
315 buckets [bucketIndex] = entry.m_next; in remove()
319 prev.m_next = entry.m_next; in remove()
331 entry.m_next = null; in remove()
351 …final SoftEntry next = entry.m_next; // remember next pointer because we are going to reuse this e… in clear()
358 entry.m_next = null; in clear()
454 m_next = next; in SoftEntry()
460 SoftEntry m_next; // singly-linked list link field in SoftValueMap.SoftEntry
[all …]
|
| D | IntIntMap.java | 91 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in contains()
115 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in get()
134 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in get()
153 for (Entry entry = m_buckets [b]; entry != null; entry = entry.m_next) in keys()
179 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in put()
224 final Entry next = entry.m_next; in remove()
231 prev.m_next = next; in remove()
270 m_next = next; in Entry()
276 Entry m_next; // singly-linked list link field in IntIntMap.Entry
300 … final Entry next = entry.m_next; // remember next pointer because we are going to reuse this entry in rehash()
[all …]
|
| D | ObjectIntMap.java | 96 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in contains()
124 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in get()
143 for (Entry entry = m_buckets [b]; entry != null; entry = entry.m_next) in keys()
172 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in put()
220 final Entry next = entry.m_next; in remove()
227 prev.m_next = next; in remove()
266 m_next = next; in Entry()
272 Entry m_next; // singly-linked list link field in ObjectIntMap.Entry
296 … final Entry next = entry.m_next; // remember next pointer because we are going to reuse this entry in rehash()
303 entry.m_next = bucketListHead; in rehash()
|
| D | IntSet.java | 89 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in contains()
109 for (Entry entry = m_buckets [b]; entry != null; entry = entry.m_next) in values()
127 for (Entry entry = m_buckets [b]; entry != null; entry = entry.m_next) in values()
146 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in add()
201 m_next = next; in Entry()
206 Entry m_next; // singly-linked list link field in IntSet.Entry
230 … final Entry next = entry.m_next; // remember next pointer because we are going to reuse this entry in rehash()
237 entry.m_next = bucketListHead; in rehash()
|
| D | IntObjectMap.java | 91 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in contains()
116 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in get()
136 for (Entry entry = m_buckets [b]; entry != null; entry = entry.m_next) in keys()
165 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in put()
228 m_next = next; in Entry()
234 Entry m_next; // singly-linked list link field in IntObjectMap.Entry
258 … final Entry next = entry.m_next; // remember next pointer because we are going to reuse this entry in rehash()
265 entry.m_next = bucketListHead; in rehash()
|
| /external/apache-xml/src/main/java/org/apache/xml/serializer/ |
| D | ElemContext.java | 106 private ElemContext m_next; field in ElemContext
167 ElemContext frame = this.m_next; in push()
174 this.m_next = frame; in push()
201 ElemContext frame = this.m_next; in push()
208 this.m_next = frame; in push()
|
| /external/apache-xml/src/main/java/org/apache/xalan/templates/ |
| D | RedundentExprEliminator.java | 173 next = next.m_next; in eleminateSharedPartialPaths()
218 matchedPathsTail.m_next = null; in matchAndEliminatePartialPaths()
223 matchedPathsTail.m_next = (MultistepExprHolder)meh.clone(); in matchAndEliminatePartialPaths()
227 matchedPathsTail = matchedPathsTail.m_next; in matchAndEliminatePartialPaths()
228 matchedPathsTail.m_next = null; in matchAndEliminatePartialPaths()
231 meh = meh.m_next; in matchAndEliminatePartialPaths()
255 matchedPaths = matchedPaths.m_next; in matchAndEliminatePartialPaths()
317 next = next.m_next; in findCommonAncestor()
390 next = next.m_next; in isNotSameAsOwner()
629 tail.m_next = new MultistepExprHolder(owner2, stepCount, null); in findAndEliminateRedundant()
[all …]
|
| D | TemplateSubPatternAssociation.java | 50 private TemplateSubPatternAssociation m_next = null; field in TemplateSubPatternAssociation
87 tspa.m_next = null; in clone()
233 return m_next; in getNext()
247 m_next = mp; in setNext()
|
| /external/tensorflow/tensorflow/compiler/tests/ |
| D | lstm.py | 76 m_next = Clip(out_gate * c_next)
80 m_next = m_prev * pad + m_next * (1.0 - pad)
82 return m_next, c_next
|
| /external/apache-xml/src/main/java/org/apache/xml/utils/ |
| D | NameSpace.java | 37 public NameSpace m_next = null; field in NameSpace
|
| D | QName.java | 285 ns = ns.m_next; in QName()
|
| /external/antlr/runtime/Cpp/include/ |
| D | antlr3collections.hpp | 48 TrieEntry* m_next; /* Allows duplicate entries for same key in insertion order */ member in TrieEntry
|
| D | antlr3collections.inl | 7 m_next = next;
22 return m_next;
28 m_next = next;
|
| /external/ipsec-tools/src/libipsec/ |
| D | key_debug.c | 734 m, m->m_next, m->m_nextpkt, m->m_data,
761 for (j = 0; m; m = m->m_next) {
|
| /external/mdnsresponder/mDNSWindows/mdnsNSP/ |
| D | mdnsNSP.c | 93 struct HostsFileInfo * m_next; member
1858 node->m_next = gHostsFileInfo; in InHostsTable()
1870 for ( node = gHostsFileInfo; node; node = node->m_next ) in InHostsTable()
2020 HostsFileInfo * next = info->m_next; in HostsFileInfoFree()
|
| /external/deqp/external/vulkancts/modules/vulkan/ubo/ |
| D | vktUniformBlockCase.cpp | 1155 m_next = m_elements.begin(); in Traverser()
1160 if (m_next != m_elements.end()) in next()
1161 return *m_next++; in next()
1168 typename std::vector<T*>::const_iterator m_next; member in vkt::ubo::__anon771516b90111::Traverser
|
| /external/libvpx/libvpx/third_party/libwebm/mkvparser/ |
| D | mkvparser.h | 180 const long long m_next; variable
|
| D | mkvparser.cc | 7575 m_next(next), in BlockGroup()
7584 m_block.SetKey((m_prev > 0) && (m_next <= 0)); in Parse()
7592 long long BlockGroup::GetNextTimeCode() const { return m_next; } in GetNextTimeCode()
|
| /external/libvpx/libwebm/mkvparser/ |
| D | mkvparser.h | 180 const long long m_next; variable
|
| D | mkvparser.cc | 7588 m_next(next), in BlockGroup()
7597 m_block.SetKey((m_prev > 0) && (m_next <= 0)); in Parse()
7605 long long BlockGroup::GetNextTimeCode() const { return m_next; } in GetNextTimeCode()
|
| /external/libaom/libaom/third_party/libwebm/mkvparser/ |
| D | mkvparser.h | 180 const long long m_next; variable
|
| D | mkvparser.cc | 7575 m_next(next), in BlockGroup()
7584 m_block.SetKey((m_prev > 0) && (m_next <= 0)); in Parse()
7592 long long BlockGroup::GetNextTimeCode() const { return m_next; } in GetNextTimeCode()
|