Home
last modified time | relevance | path

Searched refs:next (Results 1526 - 1550 of 6082) sorted by relevance

1...<<61626364656667686970>>...244

/third_party/node/deps/v8/src/strings/
H A Dunicode-inl.h88 byte next = **cursor; in ValueOfIncremental() local
91 if (V8_LIKELY(next <= kMaxOneByteChar && old_state == State::kAccept)) { in ValueOfIncremental()
93 return static_cast<uchar>(next); in ValueOfIncremental()
98 Utf8DfaDecoder::Decode(next, state, buffer); in ValueOfIncremental()
114 // the next (which we already did above). If we were already in a in ValueOfIncremental()
119 // next time. in ValueOfIncremental()
/third_party/libphonenumber/metadata/src/test/java/com/google/i18n/phonenumbers/metadata/finitestatematcher/
H A DDigitSequenceMatcherTest.java46 Assert.assertEquals(1, digits.next()); in testStringDigits()
48 Assert.assertEquals(2, digits.next()); in testStringDigits()
50 Assert.assertEquals(3, digits.next()); in testStringDigits()
52 Assert.assertEquals(4, digits.next()); in testStringDigits()
/third_party/python/Python/
H A Dsuggestions.c214 PyTracebackObject *next = traceback->tb_next; in offer_suggestions_for_name_error() local
215 if (next == NULL || !Py_IS_TYPE(next, &PyTraceBack_Type)) { in offer_suggestions_for_name_error()
219 traceback = next; in offer_suggestions_for_name_error()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/
H A DMachineLoopUtils.cpp23 return *std::next(BB->instr_begin(), Offset); in findEquivalentInstruction()
34 Preheader = *std::next(Loop->pred_begin()); in PeelSingleBlockLoop()
37 Exit = *std::next(Loop->succ_begin()); in PeelSingleBlockLoop()
43 MF.insert(std::next(Loop->getIterator()), NewBB); in PeelSingleBlockLoop()
/third_party/skia/src/image/
H A DSkRescaleAndReadPixels.cpp119 auto next = SkSurface::MakeRaster(ii); in SkRescaleAndReadPixels() local
120 if (!next) { in SkRescaleAndReadPixels()
124 next->getCanvas()->drawImageRect( in SkRescaleAndReadPixels()
127 tempSurf = std::move(next); in SkRescaleAndReadPixels()
/third_party/skia/src/effects/
H A DSk2DPathEffect.cpp27 next() will receive u and v values within these bounds,
31 virtual void next(const SkPoint& loc, int u, int v, SkPath* dst) const {} in next() function in Sk2DPathEffect
35 The default implementation calls next() repeatedly with each
54 this->next(dst, x++, y, path); in nextSpan()
83 for (; !iter.done(); iter.next()) {
166 void next(const SkPoint& loc, int u, int v, SkPath* dst) const override {
/third_party/skia/third_party/externals/swiftshader/src/OpenGL/compiler/
H A DPoolAlloc.cpp114 tHeader* next = inUseList->nextPage; in ~TPoolAllocator() local
117 inUseList = next; in ~TPoolAllocator()
125 tHeader* next = freeList->nextPage; in ~TPoolAllocator() local
127 freeList = next; in ~TPoolAllocator()
292 currentPageOffset = pageSize; // make next allocation come from a new page in allocate()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Lanai/
H A DLanaiDelaySlotFiller.cpp120 MBB.splice(std::next(I), &MBB, FI, I); in runOnMachineBasicBlock()
124 MBB.splice(std::next(I), &MBB, J); in runOnMachineBasicBlock()
126 BuildMI(MBB, std::next(I), DebugLoc(), TII->get(Lanai::NOP)); in runOnMachineBasicBlock()
133 // The instruction after it will be visited in the next iteration. in runOnMachineBasicBlock()
138 MIBundleBuilder(MBB, InstrWithSlot, std::next(LastFiller)); in runOnMachineBasicBlock()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/MSP430/
H A DMSP430BranchSelector.cpp146 if (MI->getOpcode() == MSP430::JCC && std::next(MI) != EE) { in expandBranches()
154 MF->insert(std::next(MBB), NewBB); in expandBranches()
157 NewBB->splice(NewBB->end(), &*MBB, std::next(MI), MBB->end()); in expandBranches()
184 MachineBasicBlock *NextMBB = &*std::next(MBB); in expandBranches()
/third_party/spirv-tools/source/diff/
H A Dlcs.h161 DiffMatchIndex next = {current.src_offset + 1, current.dst_offset + 1}; in CalculateLCS() local
162 if (IsCalculatedOrOutOfBound(next)) { in CalculateLCS()
163 MarkMatched(current, GetMemoizedLength(next) + 1, true); in CalculateLCS()
166 to_calculate.push(next); in CalculateLCS()
/third_party/skia/third_party/externals/icu/source/common/
H A Dustr_titlecase_brkiter.cpp40 * Titlecasing only calls setText(), first(), and next().
59 int32_t next() U_OVERRIDE;
64 int32_t next(int32_t n) U_OVERRIDE;
109 int32_t WholeStringBreakIterator::next() { return length; } in next() function in WholeStringBreakIterator
114 int32_t WholeStringBreakIterator::next(int32_t /*n*/) { return length; } in next() function in WholeStringBreakIterator
/third_party/typescript/tests/baselines/reference/
H A DasyncAwaitIsolatedModules_es5.js47 function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
50 step((generator = generator.apply(thisArg, _arguments || [])).next());
55 return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
60 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;
H A DasyncAwait_es5.js53 function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
56 step((generator = generator.apply(thisArg, _arguments || [])).next());
61 return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
66 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;
H A DclassStaticBlock6.js85 function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
88 step((generator = generator.apply(thisArg, _arguments || [])).next());
93 return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
98 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;
H A DcontrolFlowForCatchAndFinally.js48 function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
51 step((generator = generator.apply(thisArg, _arguments || [])).next());
56 return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
61 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;
H A DneverAsDiscriminantType(strict=false).js73 function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
76 step((generator = generator.apply(thisArg, _arguments || [])).next());
81 return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
86 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;
H A DneverAsDiscriminantType(strict=true).js73 function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
76 step((generator = generator.apply(thisArg, _arguments || [])).next());
81 return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
86 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;
H A Des5-asyncFunctionLongObjectLiteral.js35 function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
38 step((generator = generator.apply(thisArg, _arguments || [])).next());
43 return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
48 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;
H A DimportCallExpressionAsyncES3AMD.js35 function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
38 step((generator = generator.apply(thisArg, _arguments || [])).next());
43 return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
48 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;
H A DimportCallExpressionAsyncES3CJS.js36 function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
39 step((generator = generator.apply(thisArg, _arguments || [])).next());
44 return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
49 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;
H A DimportCallExpressionAsyncES3UMD.js35 function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
38 step((generator = generator.apply(thisArg, _arguments || [])).next());
43 return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
48 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;
H A DimportCallExpressionAsyncES5AMD.js35 function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
38 step((generator = generator.apply(thisArg, _arguments || [])).next());
43 return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
48 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;
H A DimportCallExpressionAsyncES5CJS.js36 function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
39 step((generator = generator.apply(thisArg, _arguments || [])).next());
44 return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
49 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;
H A DimportCallExpressionAsyncES5UMD.js35 function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
38 step((generator = generator.apply(thisArg, _arguments || [])).next());
43 return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
48 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;
H A DimportMeta(module=commonjs,target=es5).js46 function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
49 step((generator = generator.apply(thisArg, _arguments || [])).next());
54 return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
59 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;

Completed in 14 milliseconds

1...<<61626364656667686970>>...244