Searched defs:next (Results 201 - 225 of 2310) sorted by relevance

1234567891011>>

/external/wpa_supplicant_8/hostapd/src/eap_peer/
H A Deap_fast_pac.h15 struct eap_fast_pac *next; member in struct:eap_fast_pac
/external/wpa_supplicant_8/src/ap/
H A Dap_list.h15 /* Note: next/prev pointers are updated whenever a new beacon is
18 struct ap_info *next; /* next entry in AP list */ member in struct:ap_info
20 struct ap_info *hnext; /* next entry in hash table list */
/external/wpa_supplicant_8/src/eap_peer/
H A Deap_fast_pac.h15 struct eap_fast_pac *next; member in struct:eap_fast_pac
/external/wpa_supplicant_8/wpa_supplicant/src/ap/
H A Dap_list.h15 /* Note: next/prev pointers are updated whenever a new beacon is
18 struct ap_info *next; /* next entry in AP list */ member in struct:ap_info
20 struct ap_info *hnext; /* next entry in hash table list */
/external/wpa_supplicant_8/wpa_supplicant/src/eap_peer/
H A Deap_fast_pac.h15 struct eap_fast_pac *next; member in struct:eap_fast_pac
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/
H A DTreeIterator.java53 * next() call.
85 public Object next() { method in class:TreeIterator
100 // next node will be child 0 if any children
103 nodes.add(tree); // real node is next after DOWN
106 // if no children, look for next sibling of tree or ancestor
/external/apache-http/src/org/apache/http/message/
H A DBasicHeaderElementIterator.java113 // get next header value
158 public final Object next() throws NoSuchElementException { method in class:BasicHeaderElementIterator
H A DBasicHeaderIterator.java63 * The position of the next header in {@link #allHeaders allHeaders}.
97 * Determines the index of the next header.
102 * @return the index of the next header that matches the filter name,
140 * Obtains the next header from this iteration.
142 * @return the next header in this iteration
161 * Returns the next header.
164 * @return the next header in this iteration
168 public final Object next() method in class:BasicHeaderIterator
H A DBasicListHeaderIterator.java63 * The position of the next header in {@link #allHeaders allHeaders}.
105 * Determines the index of the next header.
110 * @return the index of the next header that matches the filter name,
153 * Obtains the next header from this iteration.
155 * @return the next header in this iteration
175 * Returns the next header.
178 * @return the next header in this iteration
182 public final Object next() method in class:BasicListHeaderIterator
/external/bison/lib/
H A Dfd-hook.c100 struct fd_hook *next = link->private_next; local
103 if (next != NULL && prev != NULL)
106 prev->private_next = next;
107 next->private_prev = prev;
/external/ceres-solver/internal/ceres/
H A Dlow_rank_inverse_hessian.cc101 int next = indices_.size(); local
104 // making it the next position where the LBFGS history is stored.
105 if (next == max_num_corrections_) {
106 next = indices_.front();
110 indices_.push_back(next);
111 delta_x_history_.col(next) = delta_x;
112 delta_gradient_history_.col(next) = delta_gradient;
113 delta_x_dot_delta_gradient_(next) = delta_x_dot_delta_gradient;
/external/chromium_org/base/containers/
H A Dlinked_list.h14 // list, as extending LinkNode (this gives it next/previous pointers).
39 // node = node->next()) {
73 // A. Doubly-linked lists are made up of nodes that contain "next" and
77 // space for the "next" and "previous" pointers (base::LinkNode<T>*).
79 // needs to glue on the "next" and "previous" pointers using
88 LinkNode(LinkNode<T>* previous, LinkNode<T>* next) argument
89 : previous_(previous), next_(next) {}
111 // next() and previous() return non-NULL if and only this node is not in any
121 LinkNode<T>* next() const { function in class:base::LinkNode
145 // list (root_.next() wil
[all...]
/external/chromium_org/chrome/common/extensions/docs/server2/
H A Dpatched_file_system.py41 def next(files): function in function:PatchedFileSystem.Read
49 skip_not_found=skip_not_found).Then(next)
/external/chromium_org/components/autofill/core/browser/
H A Dname_field.cc111 AutofillField* next = NULL; local
114 ParseEmptyLabel(scanner, &next)) {
118 v->middle_name_ = next;
121 v->last_name_ = next;
/external/chromium_org/content/renderer/
H A Drenderer_webcolorchooser_impl.cc12 static int next = 0; local
13 return ++next;
/external/chromium_org/media/midi/
H A Dmidi_message_queue.cc52 const uint8 next = queue_.front(); local
59 if (IsSystemRealTimeMessage(next)) {
60 message->push_back(next);
68 ((next_message_[0] == kSysEx && IsFirstStatusByte(next)) ||
69 (next_message_[0] != kSysEx && !IsDataByte(next)))) {
76 if (IsFirstStatusByte(next)) {
77 next_message_.push_back(next);
88 next_message_.push_back(next);
91 if (next == kEndOfSysEx) {
99 DCHECK(IsDataByte(next));
[all...]
/external/chromium_org/net/base/
H A Dpriority_queue_unittest.cc97 PriorityQueue<int>::Pointer next = queue_.GetNextTowardsLastMin(current); local
99 current = next;
/external/chromium_org/net/quic/test_tools/
H A Dtest_task_runner.cc41 // Find the next task to run, advance the time to the correct time
43 std::vector<PostedTask>::iterator next = FindNextTask(); local
44 DCHECK(next != tasks_.end());
46 (next->GetTimeToRun() - clock_->NowInTicks()).InMicroseconds()));
47 PostedTask task = *next;
48 tasks_.erase(next);
/external/chromium_org/third_party/WebKit/Source/platform/fonts/
H A DFontFamily.h47 const FontFamily* next() const;
75 reaper = reaper->releaseNext(); // implicitly protects reaper->next, then derefs reaper
78 inline const FontFamily* FontFamily::next() const function in class:blink::FontFamily
/external/chromium_org/third_party/WebKit/Source/platform/heap/
H A DHeapLinkedStack.h61 Node(const T&, Node* next);
74 HeapLinkedStack<T>::Node::Node(const T& data, Node* next) argument
76 , m_next(next)
/external/chromium_org/third_party/boringssl/src/include/openssl/
H A Dlhash.h110 * for this element and to the next item in the chain. The linked-list is NULL
114 struct lhash_item_st *next; member in struct:lhash_item_st
/external/chromium_org/third_party/cython/src/Cython/Compiler/
H A DScanning.pxd43 cdef next(self) member in class:PyrexScanner
/external/chromium_org/third_party/icu/source/common/
H A Dbytestrieiterator.cpp100 BytesTrie::Iterator::next(UErrorCode &errorCode) { function in class:BytesTrie::Iterator
109 // Pop the state off the stack and continue with the next outbound edge of
H A Ducharstrieiterator.cpp99 UCharsTrie::Iterator::next(UErrorCode &errorCode) { function in class:UCharsTrie::Iterator
108 // Pop the state off the stack and continue with the next outbound edge of
150 // next time.
/external/chromium_org/third_party/libjingle/source/talk/p2p/client/
H A Dsessionsendtask.h111 const buzz::XmlElement* next = NextStanza(); local
112 if (next == NULL)
116 if (next->Attr(buzz::QN_TYPE) == buzz::STR_RESULT) {
117 session_manager_->OnIncomingResponse(stanza_.get(), next);
119 session_manager_->OnFailedSend(stanza_.get(), next);

Completed in 826 milliseconds

1234567891011>>