| /third_party/typescript/tests/baselines/reference/ |
| H A D | modularizeLibrary_NoErrorDuplicateLibOptions2.js | 87 function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
90 step((generator = generator.apply(thisArg, _arguments || [])).next());
|
| H A D | modularizeLibrary_TargetES5UsingES6Lib.js | 87 function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
90 step((generator = generator.apply(thisArg, _arguments || [])).next());
|
| H A D | objectTypeWithRecursiveWrappedPropertyCheckedNominally.js | 6 next: List<List<T>>;
11 next: MyList<MyList<T>>;
|
| H A D | importCallExpressionAsyncES6UMD.js | 35 function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
38 step((generator = generator.apply(thisArg, _arguments || [])).next());
|
| H A D | inferenceErasedSignatures.js | 62 function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
65 step((generator = generator.apply(thisArg, _arguments || [])).next());
|
| H A D | yieldInForInInDownlevelGenerator.js | 14 return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
19 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;
|
| /third_party/protobuf/js/ |
| H A D | debug.js | 98 for (var entry = entries.next(); !entry.done; entry = entries.next()) {
|
| /third_party/python/Python/ |
| H A D | pyarena.c | 24 /* Total number of bytes already passed out. The next byte available
95 block *next = b->ab_next; in block_free() local
97 b = next; in block_free()
|
| /third_party/protobuf/java/core/src/test/java/com/google/protobuf/ |
| H A D | RopeByteStringSubstringTest.java | 49 ByteString sourceString = iter.next(); in setUp()
51 sourceString = sourceString.concat(iter.next()); in setUp()
|
| /third_party/skia/third_party/externals/abseil-cpp/absl/base/internal/ |
| H A D | thread_identity.h | 65 PerThreadSynch *next; // Circular waiter queue; initialized to 0. member
127 // When priority will next be read (cycles).
159 ThreadIdentity* next; member
|
| /third_party/skia/gm/ |
| H A D | windowrectangles.cpp | 56 for (const SkClipStack::Element* element = iter.next(); element; element = iter.next()) { in coverClipStack()
|
| /third_party/rust/crates/proc-macro2/ |
| H A D | build.rs | 188 if pieces.next() != Some("rustc 1") { in rustc_minor_version()
191 pieces.next()?.parse().ok() in rustc_minor_version()
|
| /third_party/rust/crates/rustix/tests/thread/ |
| H A D | prctl.rs | 138 if let Some(current_name) = iter.next().map(str::trim) { in is_linux_kernel_config_item_enabled()
140 if let Some(mut value) = iter.next().map(str::trim) { in is_linux_kernel_config_item_enabled()
|
| /third_party/rust/crates/rust-openssl/openssl/src/ |
| H A D | stack.rs | 146 while let Some(_) = self.next() {} in drop()
155 fn next(&mut self) -> Option<T> { in next() functions
158 .next() in next()
323 fn next(&mut self) -> Option<&'a T::Ref> { in next() functions
326 .next() in next()
357 fn next(&mut self) -> Option<&'a mut T::Ref> { in next() functions
360 .next() in next()
|
| /third_party/rust/crates/proc-macro2/src/ |
| H A D | rcvec.rs | 136 fn next(&mut self) -> Option<Self::Item> { in next() functions
137 self.inner.next() in next()
|
| /third_party/rust/crates/quote/src/ |
| H A D | runtime.rs | 85 fn next(&self) -> Option<&Self> { in next() functions
155 // Implements the relevant traits, and exports a dummy `next()` method. in quote_into_iter()
161 // This method is intended to look like `Iterator::next`, and is called when
165 pub fn next(self) -> Option<T> { in next() functions
173 fn next(&mut self) -> Option<Self::Item> { in next() functions
174 self.0.next() in next()
308 fn next(&mut self) -> Option<Self::Item> { in next() functions
340 fn next(&mut self) -> Option<Self::Item> { in next() functions
|
| /third_party/rust/crates/syn/src/ |
| H A D | tt.rs | 24 let item2 = match s2.next() { in eq()
32 s2.next().is_none() in eq()
|
| /third_party/rust/crates/regex/bench/src/ffi/ |
| H A D | re2.rs | 72 fn next(&mut self) -> Option<(usize, usize)> { in next() functions
100 // the next search at the smallest possible starting position in next()
101 // of the next match following this one. in next()
104 // Just move on to the next match. in next()
106 return self.next(); in next()
|
| /third_party/rust/crates/syn/tests/macros/ |
| H A D | mod.rs | 72 (($($expr:tt)*) $next:tt $($rest:tt)*) => {
73 snapshot_impl!(($($expr)* $next) $($rest)*)
|
| /third_party/skia/bench/ |
| H A D | PathIterBench.cpp | 95 while ((verb = iter.next(pts)) != SkPath::kDone_Verb) {
110 while (auto r = iter.next()) {
|
| /third_party/skia/third_party/externals/microhttpd/src/microhttpd/ |
| H A D | daemon.c | 739 for (pos = daemon->connections_head; NULL != pos; pos = pos->next) in MHD_get_fdset2()
1225 * to receive an HTTP request from this socket next).
1735 struct MHD_Connection *next = NULL; in resume_suspended_connections() local
1743 next = daemon->suspended_connections_head; in resume_suspended_connections()
1745 while (NULL != (pos = next)) in resume_suspended_connections()
1747 next = pos->next; in resume_suspended_connections()
1866 * to receive an HTTP request from this socket next).
2175 struct MHD_Connection *next; in MHD_run_from_select() local
2202 next in MHD_run_from_select()
2359 struct MHD_Connection *next; MHD_poll_all() local
2640 struct MHD_Connection *next; MHD_epoll() local
[all...] |
| /third_party/vulkan-loader/loader/ |
| H A D | wsi.c | 200 for (struct loader_icd_term *icd_term = loader_inst->icd_terms; icd_term != NULL; icd_term = icd_term->next, i++) { in terminator_DestroySurfaceKHR()
628 for (struct loader_icd_term *icd_term = loader_inst->icd_terms; icd_term != NULL; icd_term = icd_term->next, i++) { in terminator_CreateWin32SurfaceKHR()
647 for (struct loader_icd_term *icd_term = loader_inst->icd_terms; icd_term != NULL; icd_term = icd_term->next, i++) { in terminator_CreateWin32SurfaceKHR()
747 for (struct loader_icd_term *icd_term = loader_inst->icd_terms; icd_term != NULL; icd_term = icd_term->next, i++) { in terminator_CreateWaylandSurfaceKHR()
766 for (struct loader_icd_term *icd_term = loader_inst->icd_terms; icd_term != NULL; icd_term = icd_term->next, i++) { in terminator_CreateWaylandSurfaceKHR()
869 for (struct loader_icd_term *icd_term = loader_inst->icd_terms; icd_term != NULL; icd_term = icd_term->next, i++) { in terminator_CreateXcbSurfaceKHR()
888 for (struct loader_icd_term *icd_term = loader_inst->icd_terms; icd_term != NULL; icd_term = icd_term->next, i++) { in terminator_CreateXcbSurfaceKHR()
994 for (struct loader_icd_term *icd_term = loader_inst->icd_terms; icd_term != NULL; icd_term = icd_term->next, i++) { in terminator_CreateXlibSurfaceKHR()
1013 for (struct loader_icd_term *icd_term = loader_inst->icd_terms; icd_term != NULL; icd_term = icd_term->next, i++) { in terminator_CreateXlibSurfaceKHR()
1119 for (struct loader_icd_term *icd_term = loader_inst->icd_terms; icd_term != NULL; icd_term = icd_term->next, in terminator_CreateDirectFBSurfaceEXT()
[all...] |
| /third_party/backends/backend/ |
| H A D | magicolor.c | 1755 for (dev = first_dev; dev; dev = dev->next) { in device_detect()
1821 dev->next = first_dev; in device_detect()
1838 struct snmp_ip*next; member
1889 ip = ip->next; in mc_network_discovery_handle()
1894 new_handled->next = magic->handled; in mc_network_discovery_handle()
1953 new_detected->next = magic->detected; in mc_network_discovery_handle()
2096 snmp_ip *tmp = magic.handled->next; in mc_network_discovery()
2101 snmp_ip *tmp = magic.detected->next; in mc_network_discovery()
2242 Magicolor_Device *dev, *next; in free_devices() local
2246 for (dev = first_dev; dev; dev = next) { in free_devices()
[all...] |
| /third_party/curl/lib/ |
| H A D | multi.c | 465 data->next = NULL; /* end of the line */ in link_easy()
468 last->next = data; in link_easy()
483 /* make the previous node point to our next */ in unlink_easy()
485 data->prev->next = data->next; in unlink_easy()
487 multi->easyp = data->next; /* point to first node */ in unlink_easy()
489 /* make our next point to our previous node */ in unlink_easy()
490 if(data->next) in unlink_easy()
491 data->next->prev = data->prev; in unlink_easy()
495 data->prev = data->next in unlink_easy()
[all...] |
| /third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
| H A D | UnicodeSet.java | 1091 trial = it.next(); in matchesAt()
1103 trial = it.next(); in matchesAt()
1340 // c is before start of next range in add_unchecked()
1877 // // Each case deliberately falls through to the next
2656 c = chars.next(opts); in applyPattern()
2668 c = chars.next(opts); in applyPattern()
2674 c = chars.next(opts); in applyPattern()
2800 c = chars.next(opts); in applyPattern()
2837 c = chars.next(opts); in applyPattern()
2885 c = chars.next(opt in applyPattern()
4394 public EntryRange next() { next() method in UnicodeSet.EntryRangeIterator
4462 public String next() { next() method in UnicodeSet.UnicodeSetIterator2
[all...] |