| // Copyright (c) 2020, the Dart project authors. Please see the AUTHORS file |
| // for details. All rights reserved. Use of this source code is governed by a |
| // BSD-style license that can be found in the LICENSE file. |
| |
| import 'dart:math' show max; |
| |
| import 'package:_fe_analyzer_shared/src/type_inference/type_analyzer_operations.dart' |
| show Variance; |
| import 'package:analyzer/dart/element/element.dart'; |
| import 'package:analyzer/dart/element/nullability_suffix.dart'; |
| import 'package:analyzer/dart/element/type.dart'; |
| import 'package:analyzer/src/dart/element/element.dart'; |
| import 'package:analyzer/src/dart/element/extensions.dart'; |
| import 'package:analyzer/src/dart/element/type.dart'; |
| import 'package:analyzer/src/dart/element/type_schema.dart'; |
| import 'package:analyzer/src/dart/element/type_system.dart'; |
| import 'package:analyzer/src/generated/utilities_dart.dart'; |
| import 'package:meta/meta.dart'; |
| |
| class InterfaceLeastUpperBoundHelper { |
| final TypeSystemImpl typeSystem; |
| |
| InterfaceLeastUpperBoundHelper(this.typeSystem); |
| |
| /// This currently does not implement a very complete least upper bound |
| /// algorithm, but handles a couple of the very common cases that are |
| /// causing pain in real code. The current algorithm is: |
| /// 1. If either of the types is a supertype of the other, return it. |
| /// This is in fact the best result in this case. |
| /// 2. If the two types have the same class element and are implicitly or |
| /// explicitly covariant, then take the pointwise least upper bound of |
| /// the type arguments. This is again the best result, except that the |
| /// recursive calls may not return the true least upper bounds. The |
| /// result is guaranteed to be a well-formed type under the assumption |
| /// that the input types were well-formed (and assuming that the |
| /// recursive calls return well-formed types). |
| /// If the variance of the type parameter is contravariant, we take the |
| /// greatest lower bound of the type arguments. If the variance of the |
| /// type parameter is invariant, we verify if the type arguments satisfy |
| /// subtyping in both directions, then choose a bound. |
| /// 3. Otherwise return the spec-defined least upper bound. This will |
| /// be an upper bound, might (or might not) be least, and might |
| /// (or might not) be a well-formed type. |
| /// |
| // TODO(leafp): Use matchTypes or something similar here to handle the |
| // case where one of the types is a superclass (but not supertype) of |
| // the other, e.g. LUB(Iterable<double>, List<int>) = Iterable<num> |
| // TODO(leafp): Figure out the right final algorithm and implement it. |
| InterfaceTypeImpl compute(InterfaceTypeImpl type1, InterfaceTypeImpl type2) { |
| var nullability = _chooseNullability(type1, type2); |
| |
| // Strip off nullability. |
| type1 = type1.withNullability(NullabilitySuffix.none); |
| type2 = type2.withNullability(NullabilitySuffix.none); |
| |
| if (typeSystem.isSubtypeOf(type1, type2)) { |
| return type2.withNullability(nullability); |
| } |
| if (typeSystem.isSubtypeOf(type2, type1)) { |
| return type1.withNullability(nullability); |
| } |
| |
| if (type1.element == type2.element) { |
| var args1 = type1.typeArguments; |
| var args2 = type2.typeArguments; |
| var params = type1.element.typeParameters; |
| assert(args1.length == args2.length); |
| assert(args1.length == params.length); |
| |
| var args = <DartType>[]; |
| for (int i = 0; i < args1.length; i++) { |
| // TODO(kallentu): : Clean up TypeParameterElementImpl casting once |
| // variance is added to the interface. |
| Variance parameterVariance = |
| (params[i] as TypeParameterElementImpl).variance; |
| if (parameterVariance.isCovariant) { |
| args.add(typeSystem.leastUpperBound(args1[i], args2[i])); |
| } else if (parameterVariance.isContravariant) { |
| args.add(typeSystem.greatestLowerBound(args1[i], args2[i])); |
| } else if (parameterVariance.isInvariant) { |
| if (!typeSystem.isSubtypeOf(args1[i], args2[i]) || |
| !typeSystem.isSubtypeOf(args2[i], args1[i])) { |
| // No bound will be valid, find bound at the interface level. |
| return _computeLeastUpperBound(type1, type2) |
| .withNullability(nullability); |
| } |
| // TODO(kallentu): : Fix asymmetric bounds behavior for invariant type |
| // parameters. |
| args.add(args1[i]); |
| } else { |
| throw StateError('Type parameter ${params[i]} has unknown ' |
| 'variance $parameterVariance for bounds calculation.'); |
| } |
| } |
| |
| return InterfaceTypeImpl( |
| element: type1.element, |
| typeArguments: args, |
| nullabilitySuffix: nullability, |
| ); |
| } |
| |
| var result = _computeLeastUpperBound(type1, type2); |
| if (nullability != NullabilitySuffix.none) { |
| result = result.withNullability(nullability); |
| } |
| return result; |
| } |
| |
| /// Return all of the superinterfaces of the given [type]. |
| @visibleForTesting |
| Set<InterfaceTypeImpl> computeSuperinterfaceSet(InterfaceType type) { |
| var result = <InterfaceTypeImpl>{}; |
| _addSuperinterfaces(result, type); |
| return result; |
| } |
| |
| /// Add all of the superinterfaces of the given [type] to the given [set]. |
| void _addSuperinterfaces(Set<InterfaceType> set, InterfaceType type) { |
| type as InterfaceTypeImpl; |
| |
| if (type.isDartCoreObjectNone || type.isDartCoreNull) { |
| set.add(typeSystem.objectQuestion); |
| return; |
| } |
| |
| if (type.element is ExtensionTypeElement) { |
| set.add(typeSystem.objectQuestion); |
| } |
| |
| for (var interface in type.interfaces) { |
| if (set.add(interface)) { |
| _addSuperinterfaces(set, interface); |
| } |
| } |
| |
| for (var mixin in type.mixins) { |
| if (set.add(mixin)) { |
| _addSuperinterfaces(set, mixin); |
| } |
| } |
| |
| for (var constraint in type.superclassConstraints) { |
| if (set.add(constraint)) { |
| _addSuperinterfaces(set, constraint); |
| } |
| } |
| |
| var supertype = type.superclass; |
| if (supertype != null) { |
| if (set.add(supertype)) { |
| _addSuperinterfaces(set, supertype); |
| } |
| } |
| } |
| |
| /// Compute the least upper bound of types [i] and [j], both of which are |
| /// known to be interface types. |
| /// |
| /// In the event that the algorithm fails (which might occur due to a bug in |
| /// the analyzer), `null` is returned. |
| InterfaceTypeImpl _computeLeastUpperBound( |
| InterfaceTypeImpl i, |
| InterfaceTypeImpl j, |
| ) { |
| // compute set of supertypes |
| var si = computeSuperinterfaceSet(i); |
| var sj = computeSuperinterfaceSet(j); |
| |
| // union si with i and sj with j |
| si.add(i); |
| sj.add(j); |
| |
| // compute intersection, reference as set 's' |
| var s = si.intersection(sj).toList(); |
| return _computeTypeAtMaxUniqueDepth(s); |
| } |
| |
| /// Return the length of the longest inheritance path from the [type] to |
| /// Object. |
| @visibleForTesting |
| static int computeLongestInheritancePathToObject(InterfaceType type) { |
| return _computeLongestInheritancePathToObject(type, <InterfaceElement>{}); |
| } |
| |
| static NullabilitySuffix _chooseNullability( |
| InterfaceTypeImpl type1, |
| InterfaceTypeImpl type2, |
| ) { |
| var nullability1 = type1.nullabilitySuffix; |
| var nullability2 = type2.nullabilitySuffix; |
| if (nullability1 == NullabilitySuffix.question || |
| nullability2 == NullabilitySuffix.question) { |
| return NullabilitySuffix.question; |
| } |
| return NullabilitySuffix.none; |
| } |
| |
| /// Return the length of the longest inheritance path from a subtype of the |
| /// given [element] to Object, where the given [depth] is the length of the |
| /// longest path from the subtype to this type. The set of [visitedElements] |
| /// is used to prevent infinite recursion in the case of a cyclic type |
| /// structure. |
| static int _computeLongestInheritancePathToObject( |
| InterfaceType type, Set<InterfaceElement> visitedElements) { |
| var element = type.element; |
| // recursion |
| if (visitedElements.contains(element)) { |
| return 0; |
| } |
| // Null, direct subtype of Object? |
| if (type.isDartCoreNull) { |
| return 1; |
| } |
| // Object case |
| if (element is ClassElement) { |
| if (element.isDartCoreObject) { |
| return type.nullabilitySuffix == NullabilitySuffix.none ? 1 : 0; |
| } |
| } |
| |
| // Extension type without interfaces, implicit `Object?` |
| if (element is ExtensionTypeElement) { |
| if (element.interfaces.isEmpty) { |
| return 1; |
| } |
| } |
| |
| int longestPath = 0; |
| try { |
| visitedElements.add(element); |
| |
| // loop through each of the superinterfaces recursively calling this |
| // method and keeping track of the longest path to return |
| if (element is MixinElement) { |
| for (InterfaceType interface in element.superclassConstraints) { |
| var pathLength = _computeLongestInheritancePathToObject( |
| interface, visitedElements); |
| longestPath = max(longestPath, 1 + pathLength); |
| } |
| } |
| |
| // loop through each of the superinterfaces recursively calling this |
| // method and keeping track of the longest path to return |
| for (InterfaceType interface in element.interfaces) { |
| var pathLength = |
| _computeLongestInheritancePathToObject(interface, visitedElements); |
| longestPath = max(longestPath, 1 + pathLength); |
| } |
| |
| if (element is! ClassElement) { |
| return longestPath; |
| } |
| |
| var supertype = element.supertype; |
| if (supertype == null) { |
| return longestPath; |
| } |
| |
| var superLength = |
| _computeLongestInheritancePathToObject(supertype, visitedElements); |
| |
| var mixins = element.mixins; |
| for (var i = 0; i < mixins.length; i++) { |
| // class _X&S&M extends S implements M {} |
| // So, we choose the maximum length from S and M. |
| var mixinLength = _computeLongestInheritancePathToObject( |
| mixins[i], |
| visitedElements, |
| ); |
| superLength = max(superLength, mixinLength); |
| // For this synthetic class representing the mixin application. |
| superLength++; |
| } |
| |
| longestPath = max(longestPath, 1 + superLength); |
| } finally { |
| visitedElements.remove(element); |
| } |
| return longestPath; |
| } |
| |
| /// Return the type from the [types] list that has the longest inheritance |
| /// path to Object of unique length. |
| static InterfaceTypeImpl _computeTypeAtMaxUniqueDepth( |
| List<InterfaceTypeImpl> types, |
| ) { |
| // for each element in Set s, compute the largest inheritance path to Object |
| List<int> depths = List<int>.filled(types.length, 0); |
| int maxDepth = 0; |
| for (int i = 0; i < types.length; i++) { |
| depths[i] = computeLongestInheritancePathToObject(types[i]); |
| if (depths[i] > maxDepth) { |
| maxDepth = depths[i]; |
| } |
| } |
| // ensure that the currently computed maxDepth is unique, |
| // otherwise, decrement and test for uniqueness again |
| for (; maxDepth >= 0; maxDepth--) { |
| int indexOfLeastUpperBound = -1; |
| int numberOfTypesAtMaxDepth = 0; |
| for (int m = 0; m < depths.length; m++) { |
| if (depths[m] == maxDepth) { |
| numberOfTypesAtMaxDepth++; |
| indexOfLeastUpperBound = m; |
| } |
| } |
| if (numberOfTypesAtMaxDepth == 1) { |
| return types[indexOfLeastUpperBound]; |
| } |
| } |
| // Should be impossible--there should always be exactly one type with the |
| // maximum depth. |
| throw StateError('Empty path: $types'); |
| } |
| } |
| |
| class LeastUpperBoundHelper { |
| final TypeSystemImpl _typeSystem; |
| |
| LeastUpperBoundHelper(this._typeSystem); |
| |
| InterfaceType get _interfaceTypeFunctionNone { |
| return _typeSystem.typeProvider.functionType.element.instantiate( |
| typeArguments: const [], |
| nullabilitySuffix: NullabilitySuffix.none, |
| ); |
| } |
| |
| /// Compute the least upper bound of two types. |
| /// |
| /// https://github.com/dart-lang/language |
| /// See `resources/type-system/upper-lower-bounds.md` |
| DartType getLeastUpperBound(DartType T1, DartType T2) { |
| // UP(T, T) = T |
| if (identical(T1, T2)) { |
| return T1; |
| } |
| |
| // For any type T, UP(?, T) == T. |
| if (identical(T1, UnknownInferredType.instance)) { |
| return T2; |
| } |
| if (identical(T2, UnknownInferredType.instance)) { |
| return T1; |
| } |
| |
| var T1_isTop = _typeSystem.isTop(T1); |
| var T2_isTop = _typeSystem.isTop(T2); |
| |
| // UP(T1, T2) where TOP(T1) and TOP(T2) |
| if (T1_isTop && T2_isTop) { |
| // * T1 if MORETOP(T1, T2) |
| // * T2 otherwise |
| if (_typeSystem.isMoreTop(T1, T2)) { |
| return T1; |
| } else { |
| return T2; |
| } |
| } |
| |
| // UP(T1, T2) = T1 if TOP(T1) |
| if (T1_isTop) { |
| return T1; |
| } |
| |
| // UP(T1, T2) = T2 if TOP(T2) |
| if (T2_isTop) { |
| return T2; |
| } |
| |
| var T1_isBottom = T1.isBottom; |
| var T2_isBottom = T2.isBottom; |
| |
| // UP(T1, T2) where BOTTOM(T1) and BOTTOM(T2) |
| if (T1_isBottom && T2_isBottom) { |
| // * T2 if MOREBOTTOM(T1, T2) |
| // * T1 otherwise |
| if (_typeSystem.isMoreBottom(T1, T2)) { |
| return T2; |
| } else { |
| return T1; |
| } |
| } |
| |
| // UP(T1, T2) = T2 if BOTTOM(T1) |
| if (T1_isBottom) { |
| return T2; |
| } |
| |
| // UP(T1, T2) = T1 if BOTTOM(T2) |
| if (T2_isBottom) { |
| return T1; |
| } |
| |
| // UP(X1 & B1, T2) |
| if (T1 case TypeParameterTypeImpl(promotedBound: var B1?)) { |
| var X1 = T1.withoutPromotedBound; |
| // T2 if X1 <: T2 |
| if (_typeSystem.isSubtypeOf(X1, T2)) { |
| return T2; |
| } |
| // otherwise X1 if T2 <: X1 |
| if (_typeSystem.isSubtypeOf(T2, X1)) { |
| return X1; |
| } |
| // otherwise UP(B1a, T2) |
| // where B1a is the greatest closure of B1 with respect to X1 |
| var B1a = _typeSystem.greatestClosure(B1, [X1.element]); |
| return getLeastUpperBound(B1a, T2); |
| } |
| |
| // UP(T1, X2 & B2) |
| if (T2 case TypeParameterTypeImpl(promotedBound: var B2?)) { |
| var X2 = T2.withoutPromotedBound; |
| // X2 if T1 <: X2 |
| if (_typeSystem.isSubtypeOf(T1, X2)) { |
| return X2; |
| } |
| // otherwise T1 if X2 <: T1 |
| if (_typeSystem.isSubtypeOf(X2, T1)) { |
| return T1; |
| } |
| // otherwise UP(T1, B2a) |
| // where B2a is the greatest closure of B2 with respect to X2 |
| var B2a = _typeSystem.greatestClosure(B2, [X2.element]); |
| return getLeastUpperBound(T1, B2a); |
| } |
| |
| var T1_isNull = _typeSystem.isNull(T1); |
| var T2_isNull = _typeSystem.isNull(T2); |
| |
| // UP(T1, T2) where NULL(T1) and NULL(T2) |
| if (T1_isNull && T2_isNull) { |
| // * T2 if MOREBOTTOM(T1, T2) |
| // * T1 otherwise |
| if (_typeSystem.isMoreBottom(T1, T2)) { |
| return T2; |
| } else { |
| return T1; |
| } |
| } |
| |
| var T1_impl = T1 as TypeImpl; |
| var T2_impl = T2 as TypeImpl; |
| |
| var T1_nullability = T1_impl.nullabilitySuffix; |
| var T2_nullability = T2_impl.nullabilitySuffix; |
| |
| // UP(T1, T2) where NULL(T1) |
| if (T1_isNull) { |
| // * T2 if T2 is nullable |
| // * T2? otherwise |
| if (_typeSystem.isNullable(T2)) { |
| return T2; |
| } else { |
| return _typeSystem.makeNullable(T2); |
| } |
| } |
| |
| // UP(T1, T2) where NULL(T2) |
| if (T2_isNull) { |
| // * T1 if T1 is nullable |
| // * T1? otherwise |
| if (_typeSystem.isNullable(T1)) { |
| return T1; |
| } else { |
| return _typeSystem.makeNullable(T1); |
| } |
| } |
| |
| var T1_isObject = _typeSystem.isObject(T1); |
| var T2_isObject = _typeSystem.isObject(T2); |
| |
| // UP(T1, T2) where OBJECT(T1) and OBJECT(T2) |
| if (T1_isObject && T2_isObject) { |
| // * T1 if MORETOP(T1, T2) |
| // * T2 otherwise |
| if (_typeSystem.isMoreTop(T1, T2)) { |
| return T1; |
| } else { |
| return T2; |
| } |
| } |
| |
| // UP(T1, T2) where OBJECT(T1) |
| if (T1_isObject) { |
| // * T1 if T2 is non-nullable |
| // * T1? otherwise |
| if (_typeSystem.isNonNullable(T2)) { |
| return T1; |
| } else { |
| return _typeSystem.makeNullable(T1); |
| } |
| } |
| |
| // UP(T1, T2) where OBJECT(T2) |
| if (T2_isObject) { |
| // * T2 if T1 is non-nullable |
| // * T2? otherwise |
| if (_typeSystem.isNonNullable(T1)) { |
| return T2; |
| } else { |
| return _typeSystem.makeNullable(T2); |
| } |
| } |
| |
| // UP(T1?, T2?) = S? where S is UP(T1, T2) |
| // UP(T1?, T2) = S? where S is UP(T1, T2) |
| // UP(T1, T2?) = S? where S is UP(T1, T2) |
| if (T1_nullability != NullabilitySuffix.none || |
| T2_nullability != NullabilitySuffix.none) { |
| var T1_none = T1_impl.withNullability(NullabilitySuffix.none); |
| var T2_none = T2_impl.withNullability(NullabilitySuffix.none); |
| var S = getLeastUpperBound(T1_none, T2_none); |
| return (S as TypeImpl).withNullability(NullabilitySuffix.question); |
| } |
| |
| assert(T1_nullability == NullabilitySuffix.none); |
| assert(T2_nullability == NullabilitySuffix.none); |
| |
| // UP(X1 extends B1, T2) |
| if (T1 is TypeParameterTypeImpl) { |
| // T2 if X1 <: T2 |
| if (_typeSystem.isSubtypeOf(T1, T2)) { |
| return T2; |
| } |
| // otherwise X1 if T2 <: X1 |
| if (_typeSystem.isSubtypeOf(T2, T1)) { |
| return T1; |
| } |
| // otherwise UP(B1a, T2) |
| // where B1a is the greatest closure of B1 with respect to X1 |
| var bound = _typeParameterBound(T1); |
| var closure = _typeSystem.greatestClosure(bound, [T1.element]); |
| return getLeastUpperBound(closure, T2); |
| } |
| |
| // UP(T1, X2 extends B2) |
| if (T2 is TypeParameterTypeImpl) { |
| // X2 if T1 <: X2 |
| if (_typeSystem.isSubtypeOf(T1, T2)) { |
| // TODO(scheglov): How to get here? |
| return T2; |
| } |
| // otherwise T1 if X2 <: T1 |
| if (_typeSystem.isSubtypeOf(T2, T1)) { |
| return T1; |
| } |
| // otherwise UP(T1, B2a) |
| // where B2a is the greatest closure of B2 with respect to X2 |
| var bound = _typeParameterBound(T2); |
| var closure = _typeSystem.greatestClosure(bound, [T2.element]); |
| return getLeastUpperBound(T1, closure); |
| } |
| |
| // UP(T Function<...>(...), Function) = Function |
| if (T1 is FunctionType && T2.isDartCoreFunction) { |
| return T2; |
| } |
| |
| // UP(Function, T Function<...>(...)) = Function |
| if (T1.isDartCoreFunction && T2 is FunctionType) { |
| return T1; |
| } |
| |
| // UP(T Function<...>(...), S Function<...>(...)) = Function |
| // And other, more interesting variants. |
| if (T1 is FunctionTypeImpl && T2 is FunctionTypeImpl) { |
| return _functionType(T1, T2); |
| } |
| |
| // UP(T Function<...>(...), T2) = UP(Object, T2) |
| if (T1 is FunctionType) { |
| return getLeastUpperBound(_typeSystem.objectNone, T2); |
| } |
| |
| // UP(T1, T Function<...>(...)) = UP(T1, Object) |
| if (T2 is FunctionType) { |
| return getLeastUpperBound(T1, _typeSystem.objectNone); |
| } |
| |
| // UP((...), Record) = Record |
| if (T1 is RecordType && T2.isDartCoreRecord) { |
| return T2; |
| } |
| |
| // UP(Record, (...)) = Record |
| if (T1.isDartCoreRecord && T2 is RecordType) { |
| return T1; |
| } |
| |
| // Record types. |
| if (T1 is RecordTypeImpl && T2 is RecordTypeImpl) { |
| return _recordType(T1, T2); |
| } |
| |
| // UP(RecordType, T2) = UP(Object, T2) |
| if (T1 is RecordTypeImpl) { |
| return getLeastUpperBound(_typeSystem.objectNone, T2); |
| } |
| |
| // UP(T1, RecordType) = UP(T1, Object) |
| if (T2 is RecordTypeImpl) { |
| return getLeastUpperBound(T1, _typeSystem.objectNone); |
| } |
| |
| var futureOrResult = _futureOr(T1, T2); |
| if (futureOrResult != null) { |
| return futureOrResult; |
| } |
| |
| // UP(T1, T2) = T2 if T1 <: T2 |
| // UP(T1, T2) = T1 if T2 <: T1 |
| // And other, more complex variants of interface types. |
| var helper = InterfaceLeastUpperBoundHelper(_typeSystem); |
| return helper.compute( |
| T1 as InterfaceTypeImpl, |
| T2 as InterfaceTypeImpl, |
| ); |
| } |
| |
| /// Compute the least upper bound of function types [f] and [g]. |
| /// |
| /// https://github.com/dart-lang/language |
| /// See `resources/type-system/upper-lower-bounds.md` |
| DartType _functionType(FunctionType f, FunctionType g) { |
| var fTypeFormals = f.typeFormals; |
| var gTypeFormals = g.typeFormals; |
| |
| // The number of type parameters must be the same. |
| // Otherwise the result is `Function`. |
| if (fTypeFormals.length != gTypeFormals.length) { |
| return _interfaceTypeFunctionNone; |
| } |
| |
| // The bounds of type parameters must be equal. |
| // Otherwise the result is `Function`. |
| var fresh = _typeSystem.relateTypeParameters(f.typeFormals, g.typeFormals); |
| if (fresh == null) { |
| return _interfaceTypeFunctionNone; |
| } |
| |
| f = f.instantiate(fresh.typeParameterTypes); |
| g = g.instantiate(fresh.typeParameterTypes); |
| |
| var fParameters = f.parameters; |
| var gParameters = g.parameters; |
| |
| var parameters = <ParameterElement>[]; |
| var fIndex = 0; |
| var gIndex = 0; |
| while (fIndex < fParameters.length && gIndex < gParameters.length) { |
| var fParameter = fParameters[fIndex]; |
| var gParameter = gParameters[gIndex]; |
| if (fParameter.isRequiredPositional) { |
| if (gParameter.isRequiredPositional) { |
| fIndex++; |
| gIndex++; |
| parameters.add( |
| fParameter.copyWith( |
| type: _parameterType(fParameter, gParameter), |
| ), |
| ); |
| } else { |
| break; |
| } |
| } else if (fParameter.isOptionalPositional) { |
| if (gParameter.isOptionalPositional) { |
| fIndex++; |
| gIndex++; |
| parameters.add( |
| fParameter.copyWith( |
| type: _parameterType(fParameter, gParameter), |
| ), |
| ); |
| } else { |
| break; |
| } |
| } else if (fParameter.isNamed) { |
| if (gParameter.isNamed) { |
| var compareNames = fParameter.name.compareTo(gParameter.name); |
| if (compareNames == 0) { |
| fIndex++; |
| gIndex++; |
| parameters.add( |
| fParameter.copyWith( |
| type: _parameterType(fParameter, gParameter), |
| kind: fParameter.isRequiredNamed || gParameter.isRequiredNamed |
| ? ParameterKind.NAMED_REQUIRED |
| : ParameterKind.NAMED, |
| ), |
| ); |
| } else if (compareNames < 0) { |
| if (fParameter.isRequiredNamed) { |
| // We cannot skip required named. |
| return _interfaceTypeFunctionNone; |
| } else { |
| fIndex++; |
| } |
| } else { |
| assert(compareNames > 0); |
| if (gParameter.isRequiredNamed) { |
| // We cannot skip required named. |
| return _interfaceTypeFunctionNone; |
| } else { |
| gIndex++; |
| } |
| } |
| } else { |
| break; |
| } |
| } |
| } |
| |
| while (fIndex < fParameters.length) { |
| var fParameter = fParameters[fIndex++]; |
| if (fParameter.isRequired) { |
| return _interfaceTypeFunctionNone; |
| } |
| } |
| |
| while (gIndex < gParameters.length) { |
| var gParameter = gParameters[gIndex++]; |
| if (gParameter.isRequired) { |
| return _interfaceTypeFunctionNone; |
| } |
| } |
| |
| var returnType = getLeastUpperBound(f.returnType, g.returnType); |
| |
| return FunctionTypeImpl( |
| typeFormals: fresh.typeParameters, |
| parameters: parameters, |
| returnType: returnType, |
| nullabilitySuffix: NullabilitySuffix.none, |
| ); |
| } |
| |
| DartType? _futureOr(DartType T1, DartType T2) { |
| var T1_futureOr = T1 is InterfaceType && T1.isDartAsyncFutureOr |
| ? T1.typeArguments[0] |
| : null; |
| |
| var T1_future = T1 is InterfaceType && T1.isDartAsyncFuture |
| ? T1.typeArguments[0] |
| : null; |
| |
| var T2_futureOr = T2 is InterfaceType && T2.isDartAsyncFutureOr |
| ? T2.typeArguments[0] |
| : null; |
| |
| var T2_future = T2 is InterfaceType && T2.isDartAsyncFuture |
| ? T2.typeArguments[0] |
| : null; |
| |
| // UP(FutureOr<T1>, FutureOr<T2>) = FutureOr<T3> where T3 = UP(T1, T2) |
| if (T1_futureOr != null && T2_futureOr != null) { |
| var T3 = getLeastUpperBound(T1_futureOr, T2_futureOr); |
| return _typeSystem.typeProvider.futureOrType(T3); |
| } |
| |
| // UP(Future<T1>, FutureOr<T2>) = FutureOr<T3> where T3 = UP(T1, T2) |
| if (T1_future != null && T2_futureOr != null) { |
| var T3 = getLeastUpperBound(T1_future, T2_futureOr); |
| return _typeSystem.typeProvider.futureOrType(T3); |
| } |
| |
| // UP(FutureOr<T1>, Future<T2>) = FutureOr<T3> where T3 = UP(T1, T2) |
| if (T1_futureOr != null && T2_future != null) { |
| var T3 = getLeastUpperBound(T1_futureOr, T2_future); |
| return _typeSystem.typeProvider.futureOrType(T3); |
| } |
| |
| // UP(T1, FutureOr<T2>) = FutureOr<T3> where T3 = UP(T1, T2) |
| if (T2_futureOr != null) { |
| var T3 = getLeastUpperBound(T1, T2_futureOr); |
| return _typeSystem.typeProvider.futureOrType(T3); |
| } |
| |
| // UP(FutureOr<T1>, T2) = FutureOr<T3> where T3 = UP(T1, T2) |
| if (T1_futureOr != null) { |
| var T3 = getLeastUpperBound(T1_futureOr, T2); |
| return _typeSystem.typeProvider.futureOrType(T3); |
| } |
| |
| return null; |
| } |
| |
| DartType _parameterType(ParameterElement a, ParameterElement b) { |
| return _typeSystem.greatestLowerBound(a.type, b.type); |
| } |
| |
| DartType _recordType(RecordTypeImpl T1, RecordTypeImpl T2) { |
| var positional1 = T1.positionalFields; |
| var positional2 = T2.positionalFields; |
| if (positional1.length != positional2.length) { |
| return _typeSystem.typeProvider.recordType; |
| } |
| |
| var named1 = T1.namedFields; |
| var named2 = T2.namedFields; |
| if (named1.length != named2.length) { |
| return _typeSystem.typeProvider.recordType; |
| } |
| |
| var positionalFields = <RecordTypePositionalFieldImpl>[]; |
| for (var i = 0; i < positional1.length; i++) { |
| var field1 = positional1[i]; |
| var field2 = positional2[i]; |
| var type = getLeastUpperBound(field1.type, field2.type); |
| positionalFields.add( |
| RecordTypePositionalFieldImpl( |
| type: type, |
| ), |
| ); |
| } |
| |
| var namedFields = <RecordTypeNamedFieldImpl>[]; |
| for (var i = 0; i < named1.length; i++) { |
| var field1 = named1[i]; |
| var field2 = named2[i]; |
| if (field1.name != field2.name) { |
| return _typeSystem.typeProvider.recordType; |
| } |
| var type = getLeastUpperBound(field1.type, field2.type); |
| namedFields.add( |
| RecordTypeNamedFieldImpl( |
| name: field1.name, |
| type: type, |
| ), |
| ); |
| } |
| |
| return RecordTypeImpl( |
| positionalFields: positionalFields, |
| namedFields: namedFields, |
| nullabilitySuffix: NullabilitySuffix.none, |
| ); |
| } |
| |
| /// Return the promoted or declared bound of the type parameter. |
| DartType _typeParameterBound(TypeParameterTypeImpl type) { |
| var bound = type.promotedBound ?? type.element.bound; |
| if (bound != null) { |
| return bound; |
| } |
| return _typeSystem.objectQuestion; |
| } |
| } |
