Home
last modified time | relevance | path

Searched refs:next (Results 2176 - 2200 of 5701) sorted by relevance

1...<<81828384858687888990>>...229

/third_party/libphonenumber/metadata/src/test/java/com/google/i18n/phonenumbers/metadata/
H A DDigitSequenceTest.java66 assertThat(domain().next(DigitSequence.empty())).isNotNull(); in testMin()
75 assertThat(domain().next(max)).isNull(); in testMax()
/third_party/rust/crates/bindgen/bindgen/ir/
H A Dtraversal.rs307 /// Pop the next item to traverse, if any.
308 fn next(&mut self) -> Option<ItemId>; in next() functions
316 fn next(&mut self) -> Option<ItemId> { in next() functions
326 fn next(&mut self) -> Option<ItemId> { in next() functions
452 fn next(&mut self) -> Option<Self::Item> { in next() functions
453 let id = self.queue.next()?; in next()
/third_party/skia/src/core/
H A DSkTextBlobTrace.cpp75 iter.next(); in DumpTrace()
113 while (void* ptr = iter.next()) { in dump()
/third_party/openssl/providers/implementations/encode_decode/
H A Ddecode_pvk2key.c126 goto next; in pvk2key_decode()
132 next: in pvk2key_decode()
/third_party/skia/third_party/externals/spirv-tools/source/opt/
H A Dtree_iterator.h31 // children. To move to the next node, the iterator:
86 // Moves the iterator to the next node in the tree.
100 // Update the iterator for the next child. in MoveToNextNode()
112 // already visited) and the iterator of the next children to visit.
113 // When all the children has been visited, we pop the entry, get the next
124 // children. To move to the next node, the iterator:
193 // Moves the iterator to the next node in the tree.
215 // Update the iterator for the next child (avoid unneeded pop). in MoveToNextNode()
220 // Moves the iterator to the next node in the tree.
227 NodeIterator next in WalkToLeaf() local
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/opt/
H A Dtree_iterator.h31 // children. To move to the next node, the iterator:
86 // Moves the iterator to the next node in the tree.
100 // Update the iterator for the next child. in MoveToNextNode()
112 // already visited) and the iterator of the next children to visit.
113 // When all the children has been visited, we pop the entry, get the next
124 // children. To move to the next node, the iterator:
193 // Moves the iterator to the next node in the tree.
215 // Update the iterator for the next child (avoid unneeded pop). in MoveToNextNode()
220 // Moves the iterator to the next node in the tree.
227 NodeIterator next in WalkToLeaf() local
[all...]
/third_party/skia/tests/
H A DDequeTest.cpp39 while ((ptr = iter.next())) { in assert_iter()
60 for (int i = 0; i < deq.count()/2 && (ptr = iter.next()); i++) { in assert_iter()
/third_party/skia/src/pathops/
H A DSkOpBuilder.cpp66 if (!contourHead.next()) { in FixWinding()
105 } while ((test = test->next())); in FixWinding()
/third_party/skia/third_party/externals/dawn/src/dawn_wire/client/
H A DClient.cpp140 device = device->next()) { in Disconnect()
147 object = object->next()) { in Disconnect()
/third_party/skia/third_party/externals/dawn/generator/templates/
H A Dapi.h101 struct {{c_prefix}}ChainedStruct const * next; member
106 struct {{c_prefix}}ChainedStructOut * next; member
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/MSP430/
H A DMSP430RegisterInfo.cpp144 BuildMI(MBB, std::next(II), dl, TII.get(MSP430::SUB16ri), DstReg) in eliminateFrameIndex()
147 BuildMI(MBB, std::next(II), dl, TII.get(MSP430::ADD16ri), DstReg) in eliminateFrameIndex()
/third_party/skia/third_party/externals/icu/source/common/unicode/
H A Dbrkiter.h198 * encoded text, the break positions returned by next(), previous(), etc.
219 * DONE is returned by previous() and next() after all valid
250 * @return The character index of the next text boundary or DONE if all
254 virtual int32_t next(void) = 0;
302 virtual int32_t next(int32_t n) = 0;
H A Drbbi.h402 * equivalent to repeatedly calling next() or previous().
409 virtual int32_t next(int32_t n);
412 * Advances the iterator to the next boundary position.
416 virtual int32_t next(void);
457 * next() will return UBRK_DONE).
480 * position from <code>next()</code>, <code>previous()</code>, or
484 * <code>current()</code> index even after <code>next()</code> has returned DONE.
/third_party/typescript/tests/baselines/reference/tsbuild/sample1/
H A Dinvalidates-projects-correctly.js468 non Dts change to logic:: After building next project
586 Dts change to Logic:: After building next project
/third_party/toybox/kconfig/lxdialog/
H A Ddialog.h169 struct dialog_list *next; member
184 item_cur && (item_cur != &item_nil); item_cur = item_cur->next)
/third_party/toybox/toys/posix/
H A Dtail.c36 struct line_list *next, *prev; member
90 // Read in next chunk from end of file in try_lseek()
98 temp->next = list; in try_lseek()
154 // Read next page of data, appending to linked list in order in do_tail()
/third_party/typescript/tests/baselines/reference/
H A DasyncImportNestedYield.js9 return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
14 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;
38 return i = {}, verb("next"), verb("throw"), verb("return"), i[Symbol.asyncIterator] = function () { return this; }, i;
42 function fulfill(value) { resume("next", value); }
H A DdeclarationEmitPromise.js29 function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
32 step((generator = generator.apply(thisArg, _arguments || [])).next());
H A DprivateNamesIncompatibleModifiers.js42 function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
45 step((generator = generator.apply(thisArg, _arguments || [])).next());
52 return i = {}, verb("next"), verb("throw"), verb("return"), i[Symbol.asyncIterator] = function () { return this; }, i;
56 function fulfill(value) { resume("next", value); }
/third_party/skia/third_party/externals/expat/expat/tests/
H A Dminicheck.c117 TCase *next = suite->tests->next_tcase; in suite_free() local
119 suite->tests = next; in suite_free()
/third_party/rust/crates/rustix/tests/process/
H A Dprctl.rs205 if let Some(current_name) = iter.next().map(str::trim) { in is_linux_kernel_config_item_enabled()
207 if let Some(mut value) = iter.next().map(str::trim) { in is_linux_kernel_config_item_enabled()
/third_party/rust/crates/nix/test/common/
H A Dmod.rs96 if fields.next() == Some("Seccomp:") &&
97 fields.next() != Some("0")
/third_party/spirv-tools/source/opt/
H A Dtree_iterator.h31 // children. To move to the next node, the iterator:
86 // Moves the iterator to the next node in the tree.
100 // Update the iterator for the next child. in MoveToNextNode()
112 // already visited) and the iterator of the next children to visit.
113 // When all the children has been visited, we pop the entry, get the next
124 // children. To move to the next node, the iterator:
193 // Moves the iterator to the next node in the tree.
215 // Update the iterator for the next child (avoid unneeded pop). in MoveToNextNode()
220 // Moves the iterator to the next node in the tree.
227 NodeIterator next in WalkToLeaf() local
[all...]
/third_party/elfutils/libdwfl/
H A Ddwfl_report_elf.c83 const GElf_Addr next = (end + align - 1) & -align; in __libdwfl_elf_address_range() local
88 || (bias == 0 && end > start && end != next)) in __libdwfl_elf_address_range()
90 shdr->sh_addr = next; in __libdwfl_elf_address_range()
/third_party/ffmpeg/libavfilter/
H A Dvf_fieldhint.c269 AVFrame *next = av_frame_clone(s->frame[2]); in request_frame() local
270 if (!next) in request_frame()
272 ret = filter_frame(ctx->inputs[0], next); in request_frame()

Completed in 15 milliseconds

1...<<81828384858687888990>>...229