Home
last modified time | relevance | path

Searched refs:to_ (Results 1 – 16 of 16) sorted by relevance

/third_party/node/deps/v8/src/regexp/
Dregexp-ast.h51 Interval() : from_(kNone), to_(kNone - 1) {} // '- 1' for branchless size(). in Interval()
52 Interval(int from, int to) : from_(from), to_(to) {} in Interval()
56 return Interval(std::min(from_, that.from_), std::max(to_, that.to_)); in Union()
61 bool Contains(int value) const { return (from_ <= value) && (value <= to_); } in Contains()
64 int to() const { return to_; } in to()
65 int size() const { return to_ - from_ + 1; } in size()
71 int to_; variable
124 bool Contains(base::uc32 i) const { return from_ <= i && i <= to_; } in Contains()
126 base::uc32 to() const { return to_; } in to()
127 bool IsEverything(base::uc32 max) const { return from_ == 0 && to_ >= max; } in IsEverything()
[all …]
Dregexp-compiler-tonode.cc1539 r.to_ = std::min(r.to_, max_char); in RationalizeConsecutiveAtoms()
/third_party/node/deps/v8/src/wasm/
Dwasm-value.h45 sType to_##name() const { \ in FOREACH_SIMD_TYPE()
68 return to_##name(); \
105 ctype to_##name() const { \
107 return to_##name##_unchecked(); \
109 ctype to_##name##_unchecked() const { \
220 return to_##name##_unchecked(); \
224 return to_##name(); \
/third_party/python/Lib/turtledemo/
Dminimal_hanoi.py44 def hanoi(n, from_, with_, to_): argument
46 hanoi(n-1, from_, to_, with_)
47 to_.push(from_.pop())
48 hanoi(n-1, with_, from_, to_)
/third_party/node/deps/v8/tools/system-analyzer/
Dprocessor.mjs507 const to_ = this.getOrCreateMapEntry(to, time_);
511 if (to_.parent?.id === from || to_.time < from_.time || to_.depth > 0) {
519 to_.entry = profCodeEntry;
520 profCodeEntry.logEntry.add(to_);
523 to_.sourcePosition = script.addSourcePosition(line, column, to_);
527 let edge = new Edge(type, name, reason, time, from_, to_);
528 if (to_.parent !== undefined && to_.parent === from_) {
531 to_.edge.updateFrom(edge);
/third_party/mesa3d/src/freedreno/computerator/
Dmain.h78 static inline struct _to *to_##_to(struct _from *f) \
/third_party/mesa3d/src/freedreno/drm/virtio/
Dmsm_proto.h61 static inline struct child *to_##child(const struct parent *x) \
/third_party/node/doc/contributing/
Dcode-of-conduct.md37 course _even if you are not entirely convinced you need to_. Giving other
/third_party/mesa3d/src/freedreno/drm/
Dfreedreno_priv.h483 static inline struct child *to_##child(struct parent *x) \
/third_party/vk-gl-cts/external/vulkancts/modules_no_buildgn/vulkan/synchronization/
DvktGlobalPriorityQueueTests.cpp442 #define MAPENTRY(from_,to_) m_createInstanceMap[{from_,to_}] = &GPQCase::createInstance<from_,to_> argument
/third_party/vk-gl-cts/external/vulkancts/modules/vulkan/synchronization/
DvktGlobalPriorityQueueTests.cpp442 #define MAPENTRY(from_,to_) m_createInstanceMap[{from_,to_}] = &GPQCase::createInstance<from_,to_> argument
/third_party/rust/crates/log/
DCHANGELOG.md32 * Remove unstable `Value::to_*` conversions that were incorrectly using `as`.
/third_party/vk-gl-cts/external/vulkan-docs/src/appendices/
Dinvariance.txt108 respect to each other, for those fragments where the assignment to_
Dinvariance.adoc108 respect to each other, for those fragments where the assignment to_
Dmemorymodel.txt1003 Let M~2~ be a non-empty subset of M. Then X is _visible-to_ Y for memory
Dmemorymodel.adoc1013 Let M~2~ be a non-empty subset of M. Then X is _visible-to_ Y for memory