All Downloads are FREE. Search and download functionalities are using the official Maven repository.

com.google.javascript.rhino.jstype.UnionType Maven / Gradle / Ivy

Go to download

Closure Compiler is a JavaScript optimizing compiler. It parses your JavaScript, analyzes it, removes dead code and rewrites and minimizes what's left. It also checks syntax, variable references, and types, and warns about common JavaScript pitfalls. It is used in many of Google's JavaScript apps, including Gmail, Google Web Search, Google Maps, and Google Docs. This binary checks for style issues such as incorrect or missing JSDoc usage, and missing goog.require() statements. It does not do more advanced checks such as typechecking.

There is a newer version: v20200830
Show newest version
/*
 *
 * ***** BEGIN LICENSE BLOCK *****
 * Version: MPL 1.1/GPL 2.0
 *
 * The contents of this file are subject to the Mozilla Public License Version
 * 1.1 (the "License"); you may not use this file except in compliance with
 * the License. You may obtain a copy of the License at
 * http://www.mozilla.org/MPL/
 *
 * Software distributed under the License is distributed on an "AS IS" basis,
 * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
 * for the specific language governing rights and limitations under the
 * License.
 *
 * The Original Code is Rhino code, released
 * May 6, 1999.
 *
 * The Initial Developer of the Original Code is
 * Netscape Communications Corporation.
 * Portions created by the Initial Developer are Copyright (C) 1997-1999
 * the Initial Developer. All Rights Reserved.
 *
 * Contributor(s):
 *   Bob Jervis
 *   Google Inc.
 *
 * Alternatively, the contents of this file may be used under the terms of
 * the GNU General Public License Version 2 or later (the "GPL"), in which
 * case the provisions of the GPL are applicable instead of those above. If
 * you wish to allow use of your version of this file only under the terms of
 * the GPL and not to allow others to use your version of this file under the
 * MPL, indicate your decision by deleting the provisions above and replacing
 * them with the notice and other provisions required by the GPL. If you do
 * not delete the provisions above, a recipient may use your version of this
 * file under either the MPL or the GPL.
 *
 * ***** END LICENSE BLOCK ***** */

package com.google.javascript.rhino.jstype;

import static com.google.javascript.rhino.jstype.TernaryValue.UNKNOWN;

import com.google.common.base.Joiner;
import com.google.common.base.Predicate;
import com.google.common.collect.ImmutableList;
import com.google.javascript.rhino.ErrorReporter;
import java.util.ArrayList;
import java.util.Collection;
import java.util.List;
import java.util.SortedSet;
import java.util.TreeSet;

/**
 * The {@code UnionType} implements a common JavaScript idiom in which the
 * code is specifically designed to work with multiple input types.  Because
 * JavaScript always knows the run-time type of an object value, this is safer
 * than a C union.

* * For instance, values of the union type {@code (String,boolean)} can be of * type {@code String} or of type {@code boolean}. The commutativity of the * statement is captured by making {@code (String,boolean)} and * {@code (boolean,String)} equal.

* * * The implementation of this class prevents the creation of nested * unions.

*/ public class UnionType extends JSType { private static final long serialVersionUID = 1L; // NOTE: to avoid allocating iterators, all the loops below iterate over alternates by index // instead of using the for-each loop idiom. // alternates without merging structural interfaces and their subtypes ImmutableList alternatesWithoutStucturalTyping; // alternates under structural typing ImmutableList alternates; private int hashcode; /** * Creates a union type. * * @param alternatesWithoutStructuralTyping the alternates of the union without structural typing * subtype */ UnionType(JSTypeRegistry registry, ImmutableList alternatesWithoutStructuralTyping) { super(registry); this.alternatesWithoutStucturalTyping = alternatesWithoutStructuralTyping; UnionTypeBuilder builder = new UnionTypeBuilder(registry); for (JSType alternate : alternatesWithoutStructuralTyping) { builder.addAlternate(alternate, true); } this.alternates = builder.getAlternates(); this.hashcode = this.alternatesWithoutStucturalTyping.hashCode(); } /** * Gets the alternate types of this union type. * @return The alternate types of this union type. The returned set is * immutable. */ public Collection getAlternates() { return getAlternatesList(); } /** * Gets the alternate types of this union type. * * @return The alternate types of this union type. The returned list is immutable. */ ImmutableList getAlternatesList() { for (int i = 0; i < alternatesWithoutStucturalTyping.size(); i++) { JSType t = alternatesWithoutStucturalTyping.get(i); if (t.isUnionType()) { rebuildAlternates(); break; } } return alternates; } /** * Gets the alternate types of this union type, including structural interfaces * and implicit implementations as are distinct alternates. * @return The alternate types of this union type. The returned set is * immutable. */ public Collection getAlternatesWithoutStructuralTyping() { return getAlternatesWithoutStructuralTypingList(); } /** * Gets the alternate types of this union type, including structural interfaces and implicit * implementations as are distinct alternates. * * @return The alternate types of this union type. The returned set is immutable. */ ImmutableList getAlternatesWithoutStructuralTypingList() { for (int i = 0; i < alternatesWithoutStucturalTyping.size(); i++) { JSType t = alternatesWithoutStucturalTyping.get(i); if (t.isUnionType()) { rebuildAlternates(); break; } } return alternatesWithoutStucturalTyping; } /** * Use UnionTypeBuilder to rebuild the list of alternates and hashcode * of the current UnionType. */ private void rebuildAlternates() { UnionTypeBuilder builder = new UnionTypeBuilder(registry); for (JSType alternate : alternatesWithoutStucturalTyping) { builder.addAlternate(alternate); } alternatesWithoutStucturalTyping = builder.getAlternates(); builder = new UnionTypeBuilder(registry); for (JSType alternate : alternatesWithoutStucturalTyping) { builder.addAlternate(alternate, true); } alternates = builder.getAlternates(); hashcode = alternatesWithoutStucturalTyping.hashCode(); } /** * This predicate is used to test whether a given type can appear in a * numeric context, such as an operand of a multiply operator. * * @return true if the type can appear in a numeric context. */ @Override public boolean matchesNumberContext() { // TODO(user): Reverse this logic to make it correct instead of generous. for (JSType t : alternatesWithoutStucturalTyping) { if (t.matchesNumberContext()) { return true; } } return false; } /** * This predicate is used to test whether a given type can appear in a * {@code String} context, such as an operand of a string concat ({@code +}) * operator.

* * All types have at least the potential for converting to {@code String}. * When we add externally defined types, such as a browser OM, we may choose * to add types that do not automatically convert to {@code String}. * * @return {@code true} if not {@link VoidType} */ @Override public boolean matchesStringContext() { // TODO(user): Reverse this logic to make it correct instead of generous. for (JSType t : alternatesWithoutStucturalTyping) { if (t.matchesStringContext()) { return true; } } return false; } /** * This predicate is used to test whether a given type can appear in an * {@code Object} context, such as the expression in a {@code with} * statement.

* * Most types we will encounter, except notably {@code null}, have at least * the potential for converting to {@code Object}. Host defined objects can * get peculiar.

* * VOID type is included here because while it is not part of the JavaScript * language, functions returning 'void' type can't be used as operands of * any operator or statement.

* * @return {@code true} if the type is not {@link NullType} or * {@link VoidType} */ @Override public boolean matchesObjectContext() { // TODO(user): Reverse this logic to make it correct instead of generous. for (JSType t : alternatesWithoutStucturalTyping) { if (t.matchesObjectContext()) { return true; } } return false; } @Override public JSType findPropertyType(String propertyName) { JSType propertyType = null; for (JSType alternate : getAlternates()) { // Filter out the null/undefined type. if (alternate.isNullType() || alternate.isVoidType()) { continue; } JSType altPropertyType = alternate.findPropertyType(propertyName); if (altPropertyType == null) { continue; } if (propertyType == null) { propertyType = altPropertyType; } else { propertyType = propertyType.getLeastSupertype(altPropertyType); } } return propertyType; } @Override public boolean canBeCalled() { for (int i = 0; i < alternatesWithoutStucturalTyping.size(); i++) { JSType t = alternatesWithoutStucturalTyping.get(i); if (!t.canBeCalled()) { return false; } } return true; } @Override public JSType autobox() { UnionTypeBuilder restricted = new UnionTypeBuilder(registry); for (int i = 0; i < alternatesWithoutStucturalTyping.size(); i++) { JSType t = alternatesWithoutStucturalTyping.get(i); restricted.addAlternate(t.autobox()); } return restricted.build(); } @Override public JSType restrictByNotNullOrUndefined() { UnionTypeBuilder restricted = new UnionTypeBuilder(registry); for (int i = 0; i < alternatesWithoutStucturalTyping.size(); i++) { JSType t = alternatesWithoutStucturalTyping.get(i); restricted.addAlternate(t.restrictByNotNullOrUndefined()); } return restricted.build(); } @Override public TernaryValue testForEquality(JSType that) { TernaryValue result = null; for (int i = 0; i < alternatesWithoutStucturalTyping.size(); i++) { JSType t = alternatesWithoutStucturalTyping.get(i); TernaryValue test = t.testForEquality(that); if (result == null) { result = test; } else if (!result.equals(test)) { return UNKNOWN; } } return result; } /** * This predicate determines whether objects of this type can have the * {@code null} value, and therefore can appear in contexts where * {@code null} is expected. * * @return {@code true} for everything but {@code Number} and * {@code Boolean} types. */ @Override public boolean isNullable() { for (int i = 0; i < alternatesWithoutStucturalTyping.size(); i++) { JSType t = alternatesWithoutStucturalTyping.get(i); if (t.isNullable()) { return true; } } return false; } /** * Tests whether this type is voidable. */ @Override public boolean isVoidable() { for (int i = 0; i < alternatesWithoutStucturalTyping.size(); i++) { JSType t = alternatesWithoutStucturalTyping.get(i); if (t.isVoidable()) { return true; } } return false; } /** * Tests whether this type explicitly allows undefined. (as opposed to ? or *) */ @Override public boolean isExplicitlyVoidable() { for (int i = 0; i < alternatesWithoutStucturalTyping.size(); i++) { JSType t = alternatesWithoutStucturalTyping.get(i); if (t.isExplicitlyVoidable()) { return true; } } return false; } @Override public boolean isUnknownType() { for (int i = 0; i < alternatesWithoutStucturalTyping.size(); i++) { JSType t = alternatesWithoutStucturalTyping.get(i); if (t.isUnknownType()) { return true; } } return false; } @Override public boolean isStruct() { List alternates = getAlternatesList(); for (int i = 0; i < alternates.size(); i++) { JSType typ = alternates.get(i); if (typ.isStruct()) { return true; } } return false; } @Override public boolean isDict() { List alternates = getAlternatesList(); for (int i = 0; i < alternates.size(); i++) { JSType typ = alternates.get(i); if (typ.isDict()) { return true; } } return false; } @Override public JSType getLeastSupertype(JSType that) { if (!that.isUnknownType() && !that.isUnionType()) { for (int i = 0; i < alternatesWithoutStucturalTyping.size(); i++) { JSType alternate = alternatesWithoutStucturalTyping.get(i); if (!alternate.isUnknownType() && that.isSubtype(alternate)) { return this; } } } return getLeastSupertype(this, that); } JSType meet(JSType that) { UnionTypeBuilder builder = new UnionTypeBuilder(registry); for (int i = 0; i < alternatesWithoutStucturalTyping.size(); i++) { JSType alternate = alternatesWithoutStucturalTyping.get(i); if (alternate.isSubtype(that)) { builder.addAlternate(alternate); } } if (that.isUnionType()) { List thoseAlternatesWithoutStucturalTyping = that.toMaybeUnionType().alternatesWithoutStucturalTyping; for (int i = 0; i < thoseAlternatesWithoutStucturalTyping.size(); i++) { JSType otherAlternate = thoseAlternatesWithoutStucturalTyping.get(i); if (otherAlternate.isSubtype(this)) { builder.addAlternate(otherAlternate); } } } else if (that.isSubtype(this)) { builder.addAlternate(that); } JSType result = builder.build(); if (!result.isNoType()) { return result; } else if (this.isObject() && (that.isObject() && !that.isNoType())) { return getNativeType(JSTypeNative.NO_OBJECT_TYPE); } else { return getNativeType(JSTypeNative.NO_TYPE); } } /** * Two union types are equal if, after flattening nested union types, * they have the same number of alternates and all alternates are equal. */ boolean checkUnionEquivalenceHelper( UnionType that, EquivalenceMethod eqMethod, EqCache eqCache) { List thatAlternates = that.getAlternatesWithoutStructuralTypingList(); if (eqMethod == EquivalenceMethod.IDENTITY && getAlternatesWithoutStructuralTyping().size() != thatAlternates.size()) { return false; } for (int i = 0; i < thatAlternates.size(); i++) { JSType thatAlternate = thatAlternates.get(i); if (!hasAlternate(thatAlternate, eqMethod, eqCache)) { return false; } } return true; } private boolean hasAlternate(JSType type, EquivalenceMethod eqMethod, EqCache eqCache) { List alternatesWithoutStructuralTyping = getAlternatesWithoutStructuralTypingList(); for (int i = 0; i < alternatesWithoutStructuralTyping.size(); i++) { JSType alternate = alternatesWithoutStructuralTyping.get(i); if (alternate.checkEquivalenceHelper(type, eqMethod, eqCache)) { return true; } } return false; } @Override public boolean hasProperty(String pname) { for (int i = 0; i < alternatesWithoutStucturalTyping.size(); i++) { JSType alternate = alternatesWithoutStucturalTyping.get(i); if (alternate.hasProperty(pname)) { return true; } } return false; } @Override public int hashCode() { return this.hashcode; } @Override public UnionType toMaybeUnionType() { return this; } @Override public boolean isObject() { for (int i = 0; i < alternatesWithoutStucturalTyping.size(); i++) { JSType alternate = alternatesWithoutStucturalTyping.get(i); if (!alternate.isObject()) { return false; } } return true; } /** * A {@link UnionType} contains a given type (alternate) iff the member * vector contains it. * * @param type The alternate which might be in this union. * * @return {@code true} if the alternate is in the union */ public boolean contains(JSType type) { for (int i = 0; i < alternatesWithoutStucturalTyping.size(); i++) { JSType alt = alternatesWithoutStucturalTyping.get(i); if (alt.isEquivalentTo(type)) { return true; } } return false; } /** * Returns a more restricted union type than {@code this} one, in which all * subtypes of {@code type} have been removed.

* * Examples: *

    *
  • {@code (number,string)} restricted by {@code number} is * {@code string}
  • *
  • {@code (null, EvalError, URIError)} restricted by * {@code Error} is {@code null}
  • *
* * @param type the supertype of the types to remove from this union type */ public JSType getRestrictedUnion(JSType type) { UnionTypeBuilder restricted = new UnionTypeBuilder(registry); for (int i = 0; i < alternatesWithoutStucturalTyping.size(); i++) { JSType t = alternatesWithoutStucturalTyping.get(i); // Keep all unknown/unresolved types. if (t.isUnknownType() || t.isNoResolvedType() || !t.isSubtype(type)) { restricted.addAlternate(t); } } return restricted.build(); } @Override StringBuilder appendTo(StringBuilder sb, boolean forAnnotations) { boolean firstAlternate = true; sb.append("("); SortedSet sorted = new TreeSet<>(ALPHA); sorted.addAll(alternatesWithoutStucturalTyping); for (JSType t : sorted) { if (!firstAlternate) { sb.append("|"); } t.appendTo(sb, forAnnotations); firstAlternate = false; } return sb.append(")"); } @Override public boolean isSubtype(JSType that) { return isSubtype(that, ImplCache.create(), SubtypingMode.NORMAL); } @Override protected boolean isSubtype(JSType that, ImplCache implicitImplCache, SubtypingMode subtypingMode) { // unknown if (that.isUnknownType() || this.isUnknownType()) { return true; } // all type if (that.isAllType()) { return true; } for (int i = 0; i < alternatesWithoutStucturalTyping.size(); i++) { JSType element = alternatesWithoutStucturalTyping.get(i); if (subtypingMode == SubtypingMode.IGNORE_NULL_UNDEFINED && (element.isNullType() || element.isVoidType())) { continue; } if (!element.isSubtype(that, implicitImplCache, subtypingMode)) { return false; } } return true; } @Override public JSType getRestrictedTypeGivenToBooleanOutcome(boolean outcome) { // gather elements after restriction UnionTypeBuilder restricted = new UnionTypeBuilder(registry); for (int i = 0; i < alternatesWithoutStucturalTyping.size(); i++) { JSType element = alternatesWithoutStucturalTyping.get(i); restricted.addAlternate( element.getRestrictedTypeGivenToBooleanOutcome(outcome)); } return restricted.build(); } @Override public BooleanLiteralSet getPossibleToBooleanOutcomes() { BooleanLiteralSet literals = BooleanLiteralSet.EMPTY; for (int i = 0; i < alternatesWithoutStucturalTyping.size(); i++) { JSType element = alternatesWithoutStucturalTyping.get(i); literals = literals.union(element.getPossibleToBooleanOutcomes()); if (literals == BooleanLiteralSet.BOTH) { break; } } return literals; } @Override public TypePair getTypesUnderEquality(JSType that) { UnionTypeBuilder thisRestricted = new UnionTypeBuilder(registry); UnionTypeBuilder thatRestricted = new UnionTypeBuilder(registry); for (int i = 0; i < alternatesWithoutStucturalTyping.size(); i++) { JSType element = alternatesWithoutStucturalTyping.get(i); TypePair p = element.getTypesUnderEquality(that); if (p.typeA != null) { thisRestricted.addAlternate(p.typeA); } if (p.typeB != null) { thatRestricted.addAlternate(p.typeB); } } return new TypePair( thisRestricted.build(), thatRestricted.build()); } @Override public TypePair getTypesUnderInequality(JSType that) { UnionTypeBuilder thisRestricted = new UnionTypeBuilder(registry); UnionTypeBuilder thatRestricted = new UnionTypeBuilder(registry); for (int i = 0; i < alternatesWithoutStucturalTyping.size(); i++) { JSType element = alternatesWithoutStucturalTyping.get(i); TypePair p = element.getTypesUnderInequality(that); if (p.typeA != null) { thisRestricted.addAlternate(p.typeA); } if (p.typeB != null) { thatRestricted.addAlternate(p.typeB); } } return new TypePair( thisRestricted.build(), thatRestricted.build()); } @Override public TypePair getTypesUnderShallowInequality(JSType that) { UnionTypeBuilder thisRestricted = new UnionTypeBuilder(registry); UnionTypeBuilder thatRestricted = new UnionTypeBuilder(registry); for (int i = 0; i < alternatesWithoutStucturalTyping.size(); i++) { JSType element = alternatesWithoutStucturalTyping.get(i); TypePair p = element.getTypesUnderShallowInequality(that); if (p.typeA != null) { thisRestricted.addAlternate(p.typeA); } if (p.typeB != null) { thatRestricted.addAlternate(p.typeB); } } return new TypePair( thisRestricted.build(), thatRestricted.build()); } @Override public T visit(Visitor visitor) { return visitor.caseUnionType(this); } @Override T visit(RelationshipVisitor visitor, JSType that) { return visitor.caseUnionType(this, that); } @Override JSType resolveInternal(ErrorReporter t, StaticTypedScope scope) { setResolvedTypeInternal(this); // for circularly defined types. for (int i = 0; i < alternatesWithoutStucturalTyping.size(); i++) { JSType alternate = alternatesWithoutStucturalTyping.get(i); alternate.resolve(t, scope); } // Ensure the union is in a normalized state. rebuildAlternates(); return this; } @Override public String toDebugHashCodeString() { List hashCodes = new ArrayList<>(); for (JSType a : alternatesWithoutStucturalTyping) { hashCodes.add(a.toDebugHashCodeString()); } return "{(" + Joiner.on(",").join(hashCodes) + ")}"; } @Override public boolean setValidator(Predicate validator) { for (int i = 0; i < alternatesWithoutStucturalTyping.size(); i++) { JSType a = alternatesWithoutStucturalTyping.get(i); a.setValidator(validator); } return true; } @Override public JSType collapseUnion() { JSType currentValue = null; ObjectType currentCommonSuper = null; for (int i = 0; i < alternatesWithoutStucturalTyping.size(); i++) { JSType a = alternatesWithoutStucturalTyping.get(i); if (a.isUnknownType()) { return getNativeType(JSTypeNative.UNKNOWN_TYPE); } ObjectType obj = a.toObjectType(); if (obj == null) { if (currentValue == null && currentCommonSuper == null) { // If obj is not an object, then it must be a value. currentValue = a; } else { // Multiple values and objects will always collapse to the ALL_TYPE. return getNativeType(JSTypeNative.ALL_TYPE); } } else if (currentValue != null) { // Values and objects will always collapse to the ALL_TYPE. return getNativeType(JSTypeNative.ALL_TYPE); } else if (currentCommonSuper == null) { currentCommonSuper = obj; } else { currentCommonSuper = registry.findCommonSuperObject(currentCommonSuper, obj); } } return currentCommonSuper; } @Override public void matchConstraint(JSType constraint) { for (int i = 0; i < alternatesWithoutStucturalTyping.size(); i++) { JSType alternate = alternatesWithoutStucturalTyping.get(i); alternate.matchConstraint(constraint); } } @Override public boolean hasAnyTemplateTypesInternal() { for (int i = 0; i < alternatesWithoutStucturalTyping.size(); i++) { JSType alternate = alternatesWithoutStucturalTyping.get(i); if (alternate.hasAnyTemplateTypes()) { return true; } } return false; } }




© 2015 - 2024 Weber Informatics LLC | Privacy Policy