Home
last modified time | relevance | path

Searched refs:Intersect (Results 1 – 25 of 36) sorted by relevance

12

/third_party/node/deps/v8/src/compiler/
Doperation-typer.cc257 type = Type::Intersect(type, Type::Receiver(), zone()); in ConvertReceiver()
279 type = Type::Intersect(type, Type::PlainPrimitive(), zone()); in ToNumber()
300 return Type::Intersect(type, Type::Number(), zone()); in ToNumber()
308 type = ToNumber(Type::Intersect(type, Type::NonBigInt(), zone())); in ToNumberConvertBigInt()
320 return Type::Union(ToNumber(Type::Intersect(type, Type::NonBigInt(), zone())), in ToNumeric()
321 Type::Intersect(type, Type::BigInt(), zone()), zone()); in ToNumeric()
331 type = Type::Intersect(type, Type::PlainNumber(), zone()); in NumberAbs()
392 type = Type::Intersect(type, Type::NaN(), zone()); in NumberCeil()
425 type = Type::Intersect(type, Type::MinusZeroOrNaN(), zone()); in NumberFloor()
458 type = Type::Intersect(type, Type::NaN(), zone()); in NumberRound()
[all …]
Dstore-store-elimination.cc104 ObservableState Intersect(const ObservableState state1,
109 UnobservablesSet Intersect(const UnobservablesSet& other,
493 cur_set.Intersect(new_set, unobservables_visited_empty_, temp_zone()); in RecomputeUseIntersection()
510 UnobservablesSet::ObservableState UnobservablesSet::Intersect( in Intersect() function in v8::internal::compiler::__anone4aeb15e0111::UnobservablesSet
520 UnobservablesSet UnobservablesSet::Intersect(const UnobservablesSet& other, in Intersect() function in v8::internal::compiler::__anone4aeb15e0111::UnobservablesSet
528 Intersect(std::get<1>(triple), std::get<2>(triple)); in Intersect()
Dsimplified-lowering-verifier.cc116 Type::Intersect(input_type, Type::Signed32(), graph_zone()); in VisitNode()
118 input_type = Type::Intersect(input_type, Type::Signed32OrMinusZero(), in VisitNode()
222 input_type = Type::Intersect(input_type, Type::BigInt(), graph_zone()); in VisitNode()
Dtyper.cc355 type = Type::Intersect(type, NodeProperties::GetType(node), in Decorate()
484 return Type::Union(Type::Intersect(type, t->cache_->kInteger, t->zone()), in ToInteger()
900 type = Type::Intersect(type, bound_type, typer_->zone()); in InductionVariablePhiTypeIsPrefixedPoint()
910 type = Type::Intersect(type, bound_type, typer_->zone()); in InductionVariablePhiTypeIsPrefixedPoint()
1383 Type current_integer = Type::Intersect(current_type, integer, zone()); in Weaken()
1384 Type previous_integer = Type::Intersect(previous_type, integer, zone()); in Weaken()
2101 return Type::Intersect(arg, Type::InternalizedString(), zone()); in TypeCheckInternalizedString()
2114 return Type::Intersect(arg, Type::Receiver(), zone()); in TypeCheckReceiver()
2119 return Type::Intersect(arg, Type::ReceiverOrNullOrUndefined(), zone()); in TypeCheckReceiverOrNullOrUndefined()
2124 return Type::Intersect(arg, Type::SignedSmall(), zone()); in TypeCheckSmi()
[all …]
Dtype-narrowing-reducer.cc72 Type restricted = Type::Intersect(new_type, original_type, zone()); in Reduce()
Dtypes.cc25 RangeType::Limits RangeType::Limits::Intersect(Limits lhs, Limits rhs) { in Intersect() function in v8::internal::compiler::RangeType::Limits
45 return !RangeType::Limits::Intersect(RangeType::Limits(lhs), in Overlap()
665 Type Type::Intersect(Type type1, Type type2, Zone* zone) { in Intersect() function in v8::internal::compiler::Type
752 return RangeType::Limits::Intersect(range_lims, bitset_lims); in IntersectRangeAndBitset()
782 RangeType::Limits lim = RangeType::Limits::Intersect( in IntersectAux()
Dtypes.h332 static Limits Intersect(Limits lhs, Limits rhs);
395 static Type Intersect(Type type1, Type type2, Zone* zone);
Djs-typed-lowering.cc288 NodeProperties::SetType(node_, Type::Intersect(node_type, type, zone())); in ChangeToPureOperator()
326 Type::Intersect(node_type, upper_bound, zone())); in ChangeToSpeculativeOperator()
570 node, Type::Intersect(r.type(), Type::String(), graph()->zone())); in ReduceJSAdd()
577 node, Type::Intersect(r.type(), Type::String(), graph()->zone())); in ReduceJSAdd()
1043 node, Type::Intersect(node_type, Type::Number(), graph()->zone())); in ReduceJSToNumber()
1058 node, Type::Intersect(node_type, Type::Number(), graph()->zone())); in ReduceJSToNumeric()
Dsimplified-lowering.cc206 left = Type::Intersect(left, Type::Signed32(), type_zone); in CanOverflowSigned32()
207 right = Type::Intersect(right, Type::Signed32(), type_zone); in CanOverflowSigned32()
430 new_type = Type::Intersect(op_typer_.Name(input0_type, input1_type), \ in UpdateFeedbackType()
448 new_type = Type::Intersect(op_typer_.Name(input0_type), \ in UpdateFeedbackType()
465 Type::Intersect(op_typer_.CheckBounds(input0_type, input1_type), in UpdateFeedbackType()
470 new_type = Type::Intersect(op_typer_.CheckFloat64Hole(input0_type), in UpdateFeedbackType()
475 new_type = Type::Intersect(op_typer_.CheckNumber(input0_type), in UpdateFeedbackType()
515 new_type = Type::Intersect(GetUpperBound(node), new_type, graph_zone()); in UpdateFeedbackType()
554 Type current_integer = Type::Intersect(current_type, integer, graph_zone()); in Weaken()
557 Type::Intersect(previous_type, integer, graph_zone()); in Weaken()
Dtyped-optimization.cc392 type = Type::Intersect(node_type, type, graph()->zone()); in ReducePhi()
659 type = Type::Intersect(node_type, type, graph()->zone()); in ReduceSelect()
Descape-analysis-reducer.cc67 Type::Intersect(original_type, replacement_type, jsgraph()->zone())); in ReplaceNode()
/third_party/typescript/tests/baselines/reference/
DrecursiveConditionalTypes.js99 type Intersect<U extends any[], R = unknown> = U extends [infer H, ...infer T] ? Intersect<T, R & H…
101 type QQ = Intersect<[string[], number[], 7]>;
267 type Intersect<U extends any[], R = unknown> = U extends [infer H, ...infer T] ? Intersect<T, R & H…
268 type QQ = Intersect<[string[], number[], 7]>;
DrecursiveConditionalTypes.types260 // Intersect tuple element types
262 type Intersect<U extends any[], R = unknown> = U extends [infer H, ...infer T] ? Intersect<T, R & H…
263 >Intersect : Intersect<U, R>
265 type QQ = Intersect<[string[], number[], 7]>;
DrecursiveConditionalTypes.symbols369 // Intersect tuple element types
371 type Intersect<U extends any[], R = unknown> = U extends [infer H, ...infer T] ? Intersect<T, R & H…
372 >Intersect : Symbol(Intersect, Decl(recursiveConditionalTypes.ts, 93, 7))
378 >Intersect : Symbol(Intersect, Decl(recursiveConditionalTypes.ts, 93, 7))
384 type QQ = Intersect<[string[], number[], 7]>;
386 >Intersect : Symbol(Intersect, Decl(recursiveConditionalTypes.ts, 93, 7))
DrecursiveConditionalTypes.errors.txt151 // Intersect tuple element types
153 …type Intersect<U extends any[], R = unknown> = U extends [infer H, ...infer T] ? Intersect<T, R & …
155 type QQ = Intersect<[string[], number[], 7]>;
/third_party/typescript/tests/cases/compiler/
DrecursiveConditionalTypes.ts102 type Intersect<U extends any[], R = unknown> = U extends [infer H, ...infer T] ? Intersect<T, R & H…
104 type QQ = Intersect<[string[], number[], 7]>;
/third_party/gn/src/gn/
Danalyzer.cc57 TargetSet Intersect(const TargetSet& l, const TargetSet& r) { in Intersect() function
339 LabelsFor(Intersect(filtered_targets, affected_targets)); in Analyze()
348 outputs.test_labels = LabelsFor(Intersect(test_targets, affected_targets)); in Analyze()
/third_party/protobuf/python/google/protobuf/internal/
Dwell_known_types_test.py528 out_mask.Intersect(mask1, mask2)
535 out_mask.Intersect(mask1, mask2)
540 out_mask.Intersect(mask1, mask2)
544 out_mask.Intersect(mask1, mask2)
553 out_mask.Intersect(mask1, mask2)
/third_party/node/deps/v8/src/base/
Denum-set.h42 void Intersect(EnumSet set) { bits_ &= set.bits_; } in Intersect() function
/third_party/protobuf/src/google/protobuf/util/
Dfield_mask_util.h142 static void Intersect(const FieldMask& mask1, const FieldMask& mask2,
Dfield_mask_util_test.cc352 FieldMaskUtil::Intersect(mask1, mask2, &out); in TEST()
357 FieldMaskUtil::Intersect(mask1, mask2, &out); in TEST()
362 FieldMaskUtil::Intersect(mask1, mask2, &out); in TEST()
/third_party/skia/modules/canvaskit/
Dexterns.js832 Intersect: {}, property
914 Intersect: {}, property
/third_party/skia/modules/canvaskit/tests/
Dpath.spec.js92 const path = CanvasKit.Path.MakeFromOp(pathOne, pathTwo, CanvasKit.PathOp.Intersect);
515 canvas.clipRect(clipRect, CanvasKit.ClipOp.Intersect, false);
Dcanvas.spec.js353 canvas.clipRect(CanvasKit.LTRBRect(x1, y1, x2, y2), CanvasKit.ClipOp.Intersect, true);
397 canvas.clipPath(path, CanvasKit.ClipOp.Intersect, false);
/third_party/node/deps/v8/src/utils/
Dbit-vector.h237 void Intersect(const BitVector& other) { in Intersect() function

12