Home
last modified time | relevance | path

Searched refs:next (Results 751 - 775 of 5918) sorted by relevance

1...<<31323334353637383940>>...237

/third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/text/
H A DUCharacterIterator.java158 // next code point in currentCodePoint()
159 next(); in currentCodePoint()
161 // current() after next() actually in currentCodePoint()
194 * Returns the UTF16 code unit at index, and increments to the next code unit (post-increment semantics). If index
197 * @return the next UTF16 code unit, or DONE if the index is at the limit of the text.
201 public abstract int next(); in next() method in UCharacterIterator
204 * Returns the code point at index, and increments to the next code point (post-increment semantics). If index does
205 * not point to a valid surrogate pair, the behavior is the same as <code>next()</code>. Otherwise the iterator is
208 * @return the next codepoint in text, or DONE if the index is at the limit of the text.
213 int ch1 = next(); in nextCodePoint()
[all...]
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/text/
H A DUCharacterIterator.java147 // next code point in currentCodePoint()
148 next(); in currentCodePoint()
150 // current() after next() actually in currentCodePoint()
181 * Returns the UTF16 code unit at index, and increments to the next code unit (post-increment semantics). If index
184 * @return the next UTF16 code unit, or DONE if the index is at the limit of the text.
187 public abstract int next(); in next() method in UCharacterIterator
190 * Returns the code point at index, and increments to the next code point (post-increment semantics). If index does
191 * not point to a valid surrogate pair, the behavior is the same as <code>next()</code>. Otherwise the iterator is
194 * @return the next codepoint in text, or DONE if the index is at the limit of the text.
198 int ch1 = next(); in nextCodePoint()
[all...]
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/impl/
H A DCharacterIteration.java29 * Move the iterator forward to the next code point, and return that code point,
33 * @return The next code point.
37 // which leaves it in position for underlying iterator's next() to work. in next32()
40 c = ci.next(); in next32()
46 // For BMP chars, this next() is the real deal. in next32()
47 c = ci.next(); in next32()
65 // The call site does an initial ci.next() and calls this function
68 // middle of a surrogate pair. ci.next() will work correctly
77 char cTrail = ci.next(); in nextTrail32()
102 ci.next(); in previous32()
[all...]
/third_party/libuv/src/win/
H A Dfs-fd-hash-inl.h60 struct uv__fd_hash_entry_group_s* next; member
116 for (group_ptr = group_ptr->next; \
118 group_ptr = group_ptr->next) \
153 new_group_ptr->next = bucket_ptr->data; in uv__fd_hash_add()
187 bucket_ptr->data = old_group_ptr->next; in uv__fd_hash_remove()
/third_party/mesa3d/src/gallium/frontends/nine/
H A Dthreadpool.c11 * The above copyright notice and this permission notice (including the next
63 pool->workqueue = task->next; in threadpool_worker()
160 task->next = NULL; in _mesa_threadpool_queue_task()
169 while (previous && previous->next) in _mesa_threadpool_queue_task()
170 previous = previous->next; in _mesa_threadpool_queue_task()
172 previous->next = task; in _mesa_threadpool_queue_task()
/third_party/node/deps/v8/src/handles/
H A Dlocal-handles.cc26 prev_next_ = data->next; in OpenMainThreadScope()
57 FullObjectSlot(scope_.next)); in Iterate()
70 : scope_.next; in Contains()
80 DCHECK_EQ(scope_.next, scope_.limit); in AddBlock()
83 scope_.next = block; in AddBlock()
/third_party/node/deps/v8/src/objects/
H A Dtemplate-objects.cc41 maybe_cached_template = cached_template.next(); in GetTemplateObject()
89 Handle<HeapObject> next) { in New()
90 DCHECK(next->IsCachedTemplateObject() || next->IsTheHole()); in New()
99 result.set_next(*next); in New()
87 New( Isolate* isolate, int slot_id, Handle<JSArray> template_object, Handle<HeapObject> next) New() argument
/third_party/node/deps/uv/src/win/
H A Dfs-fd-hash-inl.h60 struct uv__fd_hash_entry_group_s* next; member
116 for (group_ptr = group_ptr->next; \
118 group_ptr = group_ptr->next) \
153 new_group_ptr->next = bucket_ptr->data; in uv__fd_hash_add()
187 bucket_ptr->data = old_group_ptr->next; in uv__fd_hash_remove()
/third_party/python/Tools/demo/
H A Dmarkov.py13 def add(self, state, next):
14 self.trans.setdefault(state, []).append(next)
32 next = choice(options)
33 if not next:
35 seq += next
/third_party/pulseaudio/src/pulsecore/
H A Dhook-list.c70 for (where = hook->slots; where; where = where->next) { in pa_hook_connect()
93 pa_hook_slot *slot, *next; in pa_hook_fire() local
111 for (slot = hook->slots; hook->n_dead > 0 && slot; slot = next) { in pa_hook_fire()
112 next = slot->next; in pa_hook_fire()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Utils/
H A DMetaRenamer.cpp48 unsigned long next; member
51 next = seed; in srand()
55 next = next * 1103515245 + 12345; in rand()
56 return (unsigned int)(next / 65536) % 32768; in rand()
/third_party/typescript/tests/baselines/reference/
H A DblockScopedBindingsInDownlevelGenerator.js12 return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
17 if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;
41 next: function () {
69 _a = __values([1, 2, 3]), _b = _a.next();
79 _b = _a.next();
/third_party/rust/crates/proc-macro-error/proc-macro-error-attr/src/
H A Dparse.rs17 let body = input.next().ok_or_else(|| {
31 Some(TokenTree::Punct(ref punct)) if punct.as_char() == '#' => input.next().unwrap(), in parse_next_attr()
38 input.next(); in parse_next_attr()
47 let path = match group.stream().into_iter().next() { in parse_next_attr()
67 _ => sig.push(input.next().unwrap()), in parse_signature()
/third_party/selinux/libsepol/src/
H A Dwrite.c72 for (n = e->node; n; n = n->next) in ebitmap_write()
80 for (n = e->node; n; n = n->next) { in ebitmap_write()
274 for (cur = a->htable[i]; cur; cur = cur->next) in avtab_reset_merged()
313 for (cur = a->htable[i]; cur; cur = cur->next) { in avtab_write()
334 for (cur = a->htable[i]; cur; cur = cur->next) { in avtab_write()
361 for (cat = l->cat; cat; cat = cat->next) in mls_write_semantic_level_helper()
370 for (cat = l->cat; cat; cat = cat->next) { in mls_write_semantic_level_helper()
515 for (tr = r; tr; tr = tr->next) in role_trans_write()
523 for (tr = r; tr; tr = tr->next) { in role_trans_write()
556 for (ra = r; ra; ra = ra->next) in role_allow_write()
[all...]
/third_party/libunwind/libunwind/src/mi/
H A Ddyn-register.c37 di->next = _U_dyn_info_list.first; in _U_dyn_register()
39 if (di->next) in _U_dyn_register()
40 di->next->prev = di; in _U_dyn_register()
/third_party/lwip/src/core/
H A Dtcp_out.c186 seg->next = NULL; in tcp_create_segment()
279 LWIP_ASSERT("need unchained pbuf", p->next == NULL); in tcp_pbuf_prealloc()
493 for (last_unsent = pcb->unsent; last_unsent->next != NULL; in tcp_write()
494 last_unsent = last_unsent->next); in tcp_write()
570 for (p = last_unsent->p; p->next != NULL; p = p->next); in tcp_write()
696 prev_seg->next = seg; in tcp_write()
698 /* remember last segment of to-be-queued data for next iteration */ in tcp_write()
726 for (p = last_unsent->p; p; p = p->next) { in tcp_write()
728 if (p->next in tcp_write()
[all...]
/third_party/wpa_supplicant/wpa_supplicant-2.9/src/tls/
H A Dx509v3.c49 if (cert->next) { in x509_certificate_free()
51 "was still on a list (next=%p)\n", in x509_certificate_free()
52 cert, cert->next); in x509_certificate_free()
69 struct x509_certificate *next; in x509_certificate_chain_free() local
72 next = cert->next; in x509_certificate_chain_free()
73 cert->next = NULL; in x509_certificate_chain_free()
75 cert = next; in x509_certificate_chain_free()
183 const u8 **next) in x509_parse_algorithm_identifier()
208 *next in x509_parse_algorithm_identifier()
181 x509_parse_algorithm_identifier(const u8 *buf, size_t len, struct x509_algorithm_identifier *id, const u8 **next) x509_parse_algorithm_identifier() argument
219 x509_parse_public_key(const u8 *buf, size_t len, struct x509_certificate *cert, const u8 **next) x509_parse_public_key() argument
291 x509_parse_name(const u8 *buf, size_t len, struct x509_name *name, const u8 **next) x509_parse_name() argument
692 x509_parse_validity(const u8 *buf, size_t len, struct x509_certificate *cert, const u8 **next) x509_parse_validity() argument
1259 x509_parse_extension(struct x509_certificate *cert, const u8 *pos, size_t len, const u8 **next) x509_parse_extension() argument
1366 x509_parse_tbs_certificate(const u8 *buf, size_t len, struct x509_certificate *cert, const u8 **next) x509_parse_tbs_certificate() argument
1774 const u8 *pos, *end, *next, *da_end; x509_check_signature() local
[all...]
/third_party/wpa_supplicant/wpa_supplicant-2.9_standard/src/tls/
H A Dx509v3.c49 if (cert->next) { in x509_certificate_free()
51 "was still on a list (next=%p)\n", in x509_certificate_free()
52 cert, cert->next); in x509_certificate_free()
69 struct x509_certificate *next; in x509_certificate_chain_free() local
72 next = cert->next; in x509_certificate_chain_free()
73 cert->next = NULL; in x509_certificate_chain_free()
75 cert = next; in x509_certificate_chain_free()
183 const u8 **next) in x509_parse_algorithm_identifier()
205 *next in x509_parse_algorithm_identifier()
181 x509_parse_algorithm_identifier(const u8 *buf, size_t len, struct x509_algorithm_identifier *id, const u8 **next) x509_parse_algorithm_identifier() argument
216 x509_parse_public_key(const u8 *buf, size_t len, struct x509_certificate *cert, const u8 **next) x509_parse_public_key() argument
285 x509_parse_name(const u8 *buf, size_t len, struct x509_name *name, const u8 **next) x509_parse_name() argument
686 x509_parse_validity(const u8 *buf, size_t len, struct x509_certificate *cert, const u8 **next) x509_parse_validity() argument
1355 x509_parse_extension(struct x509_certificate *cert, const u8 *pos, size_t len, const u8 **next) x509_parse_extension() argument
1455 x509_parse_tbs_certificate(const u8 *buf, size_t len, struct x509_certificate *cert, const u8 **next) x509_parse_tbs_certificate() argument
1844 const u8 *pos, *end, *next, *da_end; x509_check_signature() local
[all...]
/third_party/python/Lib/re/
H A D_parser.py229 self.next = None
236 self.next = None
246 self.next = char
248 if char == self.next:
253 this = self.next
259 c = self.next
268 c = self.next
283 return self.index - len(self.next or '')
285 return self.index - len(self.next or '')
415 if source.next i
[all...]
/third_party/ffmpeg/libavcodec/
H A Dcrystalhd.c88 struct OpaqueList *next; member
205 priv->tail->next = newNode; in opaque_list_push()
235 priv->head = node->next; in opaque_list_pop()
237 if (!priv->head->next) in opaque_list_pop()
240 node->next = NULL; in opaque_list_pop()
246 * previous element available to rewrite its next pointer. in opaque_list_pop()
248 while (node->next) { in opaque_list_pop()
249 OpaqueList *current = node->next; in opaque_list_pop()
251 node->next = current->next; in opaque_list_pop()
298 OpaqueList *next = node->next; uninit() local
[all...]
/third_party/icu/ohos_icu4j/src/main/tests/ohos/global/icu/dev/test/util/
H A DTrieMap.java91 * Warning: the entry contents are only valid until the next next() call!!
104 abstract boolean next(); in next() method in TrieMap.Matcher
137 result = limit == 1 ? bytesTrie.next(bytes[0]) : bytesTrie.next(bytes, 0, limit); in get()
152 // result = bytesTrie.next(bytes[j]&0xFF); in get()
166 * Warning: the entry contents are only valid until the next next() call!!
185 public Entry<CharSequence, V> next() { in next() method in TrieMap.BytesTrieMap.BytesIterator
186 entry.bytesEntry = iterator.next(); in next()
238 public boolean next() { next() method in TrieMap.BytesTrieMap.BytesMatcher
371 public Entry<CharSequence, V> next() { next() method in TrieMap.CharsTrieMap.CharsIterator
421 public boolean next() { next() method in TrieMap.CharsTrieMap.CharsMatcher
[all...]
/third_party/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/util/
H A DTrieMap.java90 * Warning: the entry contents are only valid until the next next() call!!
103 abstract boolean next(); in next() method in TrieMap.Matcher
136 result = limit == 1 ? bytesTrie.next(bytes[0]) : bytesTrie.next(bytes, 0, limit); in get()
151 // result = bytesTrie.next(bytes[j]&0xFF); in get()
165 * Warning: the entry contents are only valid until the next next() call!!
184 public Entry<CharSequence, V> next() { in next() method in TrieMap.BytesTrieMap.BytesIterator
185 entry.bytesEntry = iterator.next(); in next()
237 public boolean next() { next() method in TrieMap.BytesTrieMap.BytesMatcher
370 public Entry<CharSequence, V> next() { next() method in TrieMap.CharsTrieMap.CharsIterator
420 public boolean next() { next() method in TrieMap.CharsTrieMap.CharsMatcher
[all...]
/third_party/nghttp2/examples/
H A Dlibevent-server.c90 struct http2_stream_data *prev, *next; member
209 stream_data->next = session_data->root.next; in add_stream()
210 session_data->root.next = stream_data; in add_stream()
212 if (stream_data->next) { in add_stream()
213 stream_data->next->prev = stream_data; in add_stream()
221 stream_data->prev->next = stream_data->next; in remove_stream()
222 if (stream_data->next) { in remove_stream()
223 stream_data->next in remove_stream()
287 http2_stream_data *next = stream_data->next; delete_http2_session_data() local
[all...]
/third_party/skia/src/core/
H A DSkDraw_vertices.cpp229 // normalized 0...1 value. If curr is 0, returns 0. If next is 0, returns 1. in fill_triangle_3()
230 auto computeT = [](float curr, float next) { in fill_triangle_3()
231 // Check that 0 is between next and curr. in fill_triangle_3()
232 SkASSERT((next <= 0 && 0 < curr) || (curr <= 0 && 0 < next)); in fill_triangle_3()
233 float t = curr / (curr - next); in fill_triangle_3()
238 auto lerp = [](SkPoint3 curr, SkPoint3 next, float t) { in fill_triangle_3()
239 return curr + t * (next - curr); in fill_triangle_3()
245 auto clip = [&](SkPoint3 curr, SkPoint3 next) { in fill_triangle_3()
246 // Return the point between curr and next wher in fill_triangle_3()
[all...]
/third_party/toybox/toys/pending/
H A Dcrond.c40 struct _var *next, *prev; member
45 struct _job *next, *prev; member
52 struct _cronfile *next, *prev; member
338 jlist = jlist->next; in remove_completed_jobs()
341 jstart = jstart->next; in remove_completed_jobs()
352 lstart = lstart->next; in remove_completed_jobs()
357 list = list->next; in remove_completed_jobs()
441 if ((v=v->next) == vstart) break; in do_fork()
531 if ((job = job->next) == jstart) break; in count_running_jobs()
533 if ((cfile = cfile->next) in count_running_jobs()
[all...]

Completed in 19 milliseconds

1...<<31323334353637383940>>...237