(types, aliasSymbol, aliasTypeArguments)
| 61581 | return true; |
| 61582 | } |
| 61583 | function createIntersectionType(types, aliasSymbol, aliasTypeArguments) { |
| 61584 | var result = createType(2097152 /* TypeFlags.Intersection */); |
| 61585 | result.objectFlags = getPropagatingFlagsOfTypes(types, /*excludeKinds*/ 98304 /* TypeFlags.Nullable */); |
| 61586 | result.types = types; |
| 61587 | result.aliasSymbol = aliasSymbol; |
| 61588 | result.aliasTypeArguments = aliasTypeArguments; |
| 61589 | return result; |
| 61590 | } |
| 61591 | // We normalize combinations of intersection and union types based on the distributive property of the '&' |
| 61592 | // operator. Specifically, because X & (A | B) is equivalent to X & A | X & B, we can transform intersection |
| 61593 | // types with union type constituents into equivalent union types with intersection type constituents and |
no test coverage detected
searching dependent graphs…