HomeSort by relevance Sort by last modified time
    Searched defs:next (Results 601 - 625 of 3921) sorted by null

<<21222324252627282930>>

  /external/apache-xml/src/main/java/org/apache/xpath/axes/
ReverseAxesWalker.java 70 * Get the next node in document order on the axes.
72 * @return the next node in document order on the axes, or null.
79 int next = m_iterator.next(); local
84 if (DTM.NULL == next)
87 return next;
150 int next; local
152 while (DTM.NULL != (next = clone.nextNode()))
213 int next; local
215 while (DTM.NULL != (next = clone.nextNode())
    [all...]
  /external/bison/src/
symlist.h 81 struct symbol_list *next; member in struct:symbol_list
  /external/bluetooth/bluedroid/btif/src/
btif_profile_queue.c 129 ** Description Add a new connection to the queue and trigger the next
152 ** Description Clear the queue's busy status and advance to the next
180 connect_node_t *next = current->p_next; local
182 current = next;
  /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/x9/
DHDomainParameters.java 76 ASN1Encodable next = getNext(e); local
78 if (next != null && next instanceof ASN1Integer)
80 this.j = ASN1Integer.getInstance(next);
81 next = getNext(e);
84 if (next != null)
86 this.validationParms = DHValidationParms.getInstance(next.toASN1Primitive());
  /external/chromium/chrome/browser/sync/engine/
change_reorder_buffer.cc 164 int64 next = to_visit.front(); local
168 i = operations_.find(next);
171 record.id = next;
183 // Now add the children of |next| to |to_visit|.
184 if (parents_of_position_changes.find(next) ==
188 Traversal::LinkSet::const_iterator j = traversal.begin_children(next);
189 Traversal::LinkSet::const_iterator end = traversal.end_children(next);
191 CHECK(j->first == next);
197 syncable::Entry parent(trans, syncable::GET_BY_HANDLE, next);
  /external/chromium/net/websockets/
websocket_throttle_unittest.cc 35 struct addrinfo* next) {
50 addrinfo->ai_next = next;
56 struct addrinfo* next; local
57 for (struct addrinfo* a = head; a != NULL; a = next) {
58 next = a->ai_next;
  /external/chromium/testing/gtest/samples/
sample3-inl.h 47 // type E and a pointer to the next node.
56 // Gets the next node in the queue.
57 QueueNode* next() { return next_; } function in class:QueueNode
58 const QueueNode* next() const { return next_; } function in class:QueueNode
61 // Creates a node with a given element value. The next pointer is
88 QueueNode<E>* next = node->next(); local
91 node = next;
93 next = node->next();
    [all...]
  /external/chromium_org/chrome/browser/ui/app_list/
extension_app_model_builder.cc 239 ExtensionAppItem* next = NULL; local
243 next = static_cast<ExtensionAppItem*>(item);
248 if (prev || next)
249 static_cast<ExtensionAppItem*>(item)->Move(prev, next);
  /external/chromium_org/media/base/
audio_buffer_queue.cc 118 // Next buffer may not have timestamp, so we need to update current
119 // timestamp before switching to the next buffer.
124 BufferQueue::iterator next = current_buffer + 1; local
125 if (next == buffers_.end())
129 current_buffer = next;
seekable_buffer.cc 157 // are preparing for rewind for next iteration.
229 // Next buffer may not have timestamp, so we need to update current
230 // timestamp before switching to the next buffer.
234 BufferQueue::iterator next = current_buffer; local
235 ++next;
237 if (next == buffers_.end())
241 current_buffer = next;
  /external/chromium_org/net/websockets/
websocket_extension_parser.cc 97 char next = current_[1]; local
98 if (IsControl(next) || IsSeparator(next)) break;
99 *token += next;
  /external/chromium_org/testing/gtest/samples/
sample3-inl.h 47 // type E and a pointer to the next node.
56 // Gets the next node in the queue.
57 QueueNode* next() { return next_; } function in class:QueueNode
58 const QueueNode* next() const { return next_; } function in class:QueueNode
61 // Creates a node with a given element value. The next pointer is
87 QueueNode<E>* next = node->next(); local
90 node = next;
92 next = node->next();
    [all...]
  /external/chromium_org/third_party/WebKit/Source/core/css/
CSSParserValues.cpp 186 OwnPtr<CSSParserSelector> next = selector->m_tagHistory.release(); local
188 if (!next)
190 selector = next.release();
  /external/chromium_org/third_party/WebKit/Source/core/dom/shadow/
ComposedTreeWalker.h 62 void next();
145 inline void ComposedTreeWalker::next() function in class:WebCore::ComposedTreeWalker
148 if (Node* next = traverseFirstChild(m_node)) {
149 m_node = next;
  /external/chromium_org/third_party/WebKit/Source/core/editing/
ModifySelectionListLevel.cpp 95 Node* next = node->nextSibling(); local
102 node = next;
110 Node* next = node->nextSibling(); local
118 node = next;
126 Node* next = node->nextSibling(); local
133 node = next;
  /external/chromium_org/third_party/WebKit/Source/core/html/
HTMLDialogElement.cpp 46 Node* next = 0; local
47 for (Node* node = dialog->firstChild(); node; node = next) {
49 next = NodeTraversal::nextSkippingChildren(*node, dialog);
51 next = NodeTraversal::next(*node, dialog);
  /external/chromium_org/third_party/WebKit/Source/core/html/parser/
HTMLElementStack.h 65 ElementRecord* next() const { return m_next.get(); } function in class:WebCore::HTMLElementStack::ElementRecord
72 void setNext(PassOwnPtr<ElementRecord> next) { m_next = next; }
  /external/chromium_org/third_party/WebKit/Source/core/rendering/style/
FillLayer.cpp 174 for (curr = this; curr && curr->isXPositionSet(); curr = curr->next()) { }
177 for (FillLayer* pattern = this; curr; curr = curr->next()) {
183 pattern = pattern->next();
189 for (curr = this; curr && curr->isYPositionSet(); curr = curr->next()) { }
192 for (FillLayer* pattern = this; curr; curr = curr->next()) {
198 pattern = pattern->next();
204 for (curr = this; curr && curr->isAttachmentSet(); curr = curr->next()) { }
207 for (FillLayer* pattern = this; curr; curr = curr->next()) {
209 pattern = pattern->next();
215 for (curr = this; curr && curr->isClipSet(); curr = curr->next()) { }
296 FillLayer* next; local
    [all...]
  /external/chromium_org/third_party/WebKit/Source/platform/text/
BidiRunList.h 106 Run* next = m_firstRun; local
107 while (next != run) {
108 current = next;
109 next = current->next();
113 m_firstRun = run->next();
130 Run* next = current->next(); local
131 while (next != run) {
132 current = next;
235 Run* next = curr->next(); local
    [all...]
  /external/chromium_org/third_party/WebKit/Source/wtf/
TreeNode.h 61 NodeType* next() const { return m_next; } function in class:WTF::TreeNode
74 ASSERT(!newChild->next());
98 ASSERT(!child->next());
122 m_firstChild = child->next();
126 NodeType* oldNext = child->next();
149 if (typename TreeNode<T>::NodeType* next = current->firstChild())
150 return next;
153 if (typename TreeNode<T>::NodeType* next = current->next())
154 return next;
    [all...]
  /external/chromium_org/third_party/angle/src/compiler/
PoolAlloc.cpp 99 tHeader* next = inUseList->nextPage; local
102 inUseList = next;
110 tHeader* next = freeList->nextPage; local
112 freeList = next;
257 currentPageOffset = pageSize; // make next allocation come from a new page
  /external/chromium_org/third_party/freetype/src/base/
ftutil.c 254 cur = cur->next;
270 node->next = 0;
274 before->next = node;
291 node->next = after;
313 after = node->next;
316 before->next = after;
337 after = node->next;
343 before->next = after;
351 node->next = list->head;
370 FT_ListNode next = cur->next local
398 FT_ListNode next = cur->next; local
    [all...]
  /external/chromium_org/third_party/harfbuzz-ng/src/
hb-face-private.hh 62 plan_node_t *next; member in struct:hb_face_t::plan_node_t
  /external/chromium_org/third_party/icu/source/i18n/
coleitr.cpp 71 * Get the ordering priority of the next character in the string.
72 * @return the next character's ordering. Returns NULLORDER if an error has
75 int32_t CollationElementIterator::next(UErrorCode& status) function in class:CollationElementIterator
  /external/chromium_org/third_party/libwebp/enc/
token.c 56 const VP8Tokens* const next = p->next_; local
58 p = next;
222 const VP8Tokens* const next = p->next_; local
223 const int N = (next == NULL) ? b->left_ : 0;
235 p = next;

Completed in 892 milliseconds

<<21222324252627282930>>