brighterscript 1.0.0-alpha.5 → 1.0.0-alpha.51

package/dist/types/UnionType.js

@@ -0,0 +1,196 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.UnionType = exports.unionTypeFactory = void 0;
+const reflection_1 = require("../astUtils/reflection");
+const BscType_1 = require("./BscType");
+const ReferenceType_1 = require("./ReferenceType");
+const helpers_1 = require("./helpers");
+const BscTypeKind_1 = require("./BscTypeKind");
+const SymbolTable_1 = require("../SymbolTable");
+const BuiltInInterfaceAdder_1 = require("./BuiltInInterfaceAdder");
+const util_1 = require("../util");
+function unionTypeFactory(types) {
+    return new UnionType(types);
+}
+exports.unionTypeFactory = unionTypeFactory;
+class UnionType extends BscType_1.BscType {
+    constructor(types) {
+        super((0, helpers_1.joinTypesString)(types, 'or', BscTypeKind_1.BscTypeKind.UnionType));
+        this.types = types;
+        this.kind = BscTypeKind_1.BscTypeKind.UnionType;
+        this.callFuncAssociatedTypesTable = new SymbolTable_1.SymbolTable(`Union: CallFuncAssociatedTypes`);
+    }
+    addType(type) {
+        this.types.push(type);
+    }
+    isResolvable() {
+        for (const type of this.types) {
+            if (!type.isResolvable()) {
+                return false;
+            }
+        }
+        return true;
+    }
+    getMemberTypeFromInnerTypes(name, options) {
+        return this.types.map((innerType) => innerType === null || innerType === void 0 ? void 0 : innerType.getMemberType(name, options));
+    }
+    getCallFuncFromInnerTypes(name, options) {
+        return this.types.map((innerType) => innerType === null || innerType === void 0 ? void 0 : innerType.getCallFuncType(name, options));
+    }
+    getMemberType(name, options) {
+        const innerTypesMemberTypes = this.getMemberTypeFromInnerTypes(name, options);
+        if (!innerTypesMemberTypes || innerTypesMemberTypes.includes(undefined)) {
+            // We don't have any members of any inner types that match
+            // so instead, create reference type that will
+            return new ReferenceType_1.ReferenceType(name, name, options.flags, () => {
+                return {
+                    name: `UnionType MemberTable: '${this.__identifier}'`,
+                    getSymbolType: (innerName, innerOptions) => {
+                        const referenceTypeInnerMemberTypes = this.getMemberTypeFromInnerTypes(name, options);
+                        if (!referenceTypeInnerMemberTypes || referenceTypeInnerMemberTypes.includes(undefined)) {
+                            return undefined;
+                        }
+                        return (0, helpers_1.getUniqueType)((0, helpers_1.findTypeUnion)(referenceTypeInnerMemberTypes), unionTypeFactory);
+                    },
+                    setCachedType: (innerName, innerCacheEntry, innerOptions) => {
+                        // TODO: is this even cachable? This is a NO-OP for now, and it shouldn't hurt anything
+                    },
+                    addSibling: (symbolTable) => {
+                        // TODO: I don't know what this means in this context?
+                    }
+                };
+            });
+        }
+        return (0, helpers_1.getUniqueType)((0, helpers_1.findTypeUnion)(innerTypesMemberTypes), unionTypeFactory);
+    }
+    getCallFuncType(name, options) {
+        const innerTypesMemberTypes = this.getCallFuncFromInnerTypes(name, options);
+        if (!innerTypesMemberTypes || innerTypesMemberTypes.includes(undefined)) {
+            // We don't have any members of any inner types that match
+            // so instead, create reference type that will
+            return new ReferenceType_1.ReferenceType(name, name, options.flags, () => {
+                return {
+                    name: `UnionType CallFunc MemberTable: '${this.__identifier}'`,
+                    getSymbolType: (innerName, innerOptions) => {
+                        const referenceTypeInnerMemberTypes = this.getCallFuncFromInnerTypes(name, options);
+                        if (!referenceTypeInnerMemberTypes || referenceTypeInnerMemberTypes.includes(undefined)) {
+                            return undefined;
+                        }
+                        return (0, helpers_1.getUniqueType)((0, helpers_1.findTypeUnionDeepCheck)(referenceTypeInnerMemberTypes), unionTypeFactory);
+                    },
+                    setCachedType: (innerName, innerCacheEntry, innerOptions) => {
+                        // TODO: is this even cachable? This is a NO-OP for now, and it shouldn't hurt anything
+                    },
+                    addSibling: (symbolTable) => {
+                        // TODO: I don't know what this means in this context?
+                    }
+                };
+            });
+        }
+        const resultCallFuncType = (0, helpers_1.getUniqueType)((0, helpers_1.findTypeUnionDeepCheck)(innerTypesMemberTypes), unionTypeFactory, false);
+        if ((0, reflection_1.isTypedFunctionType)(resultCallFuncType)) {
+            const typesToCheck = [...resultCallFuncType.params.map(p => p.type), resultCallFuncType.returnType];
+            for (const type of typesToCheck) {
+                (0, helpers_1.addAssociatedTypesTableAsSiblingToMemberTable)(type, this.callFuncAssociatedTypesTable, 1 /* SymbolTypeFlag.runtime */);
+            }
+        }
+        return resultCallFuncType;
+    }
+    get returnType() {
+        return util_1.util.getReturnTypeOfUnionOfFunctions(this);
+    }
+    isTypeCompatible(targetType, data) {
+        while ((0, reflection_1.isTypeStatementType)(targetType)) {
+            targetType = targetType.wrappedType;
+        }
+        if ((0, reflection_1.isDynamicType)(targetType) || (0, reflection_1.isObjectType)(targetType) || this === targetType) {
+            return true;
+        }
+        if ((0, helpers_1.isEnumTypeCompatible)(this, targetType, data)) {
+            return true;
+        }
+        if ((0, reflection_1.isUnionType)(targetType)) {
+            // check if this set of inner types is a SUPERSET of targetTypes's inner types
+            for (const targetInnerType of targetType.types) {
+                if (!this.isTypeCompatible(targetInnerType, data)) {
+                    return false;
+                }
+            }
+            return true;
+        }
+        for (const innerType of this.types) {
+            const foundCompatibleInnerType = innerType.isTypeCompatible(targetType, data);
+            if (foundCompatibleInnerType) {
+                return true;
+            }
+        }
+        return false;
+    }
+    toString() {
+        return (0, helpers_1.joinTypesString)(this.types, 'or', BscTypeKind_1.BscTypeKind.UnionType);
+    }
+    /**
+     * Used for transpilation
+     */
+    toTypeString() {
+        const uniqueTypeStrings = new Set((0, helpers_1.getAllTypesFromCompoundType)(this).map(t => t.toTypeString()));
+        if (uniqueTypeStrings.size === 1) {
+            return uniqueTypeStrings.values().next().value;
+        }
+        return 'dynamic';
+    }
+    checkAllMemberTypes(predicate) {
+        return this.types.reduce((acc, type) => {
+            return acc && predicate(type);
+        }, true);
+    }
+    isEqual(targetType) {
+        if (!(0, reflection_1.isUnionType)(targetType)) {
+            return false;
+        }
+        if (this === targetType) {
+            return true;
+        }
+        if (this.types.length !== targetType.types.length) {
+            return false;
+        }
+        for (const type of this.types) {
+            let foundMatch = false;
+            for (const targetTypeInner of targetType.types) {
+                if (type.isEqual(targetTypeInner)) {
+                    foundMatch = true;
+                    break;
+                }
+            }
+            if (!foundMatch) {
+                return false;
+            }
+        }
+        return true;
+    }
+    getMemberTable() {
+        const unionTable = new SymbolTable_1.SymbolTable(this.__identifier + ' UnionTable');
+        const firstType = this.types[0];
+        if (!firstType) {
+            return unionTable;
+        }
+        firstType.addBuiltInInterfaces();
+        for (const symbol of firstType.getMemberTable().getAllSymbols(1 /* SymbolTypeFlag.runtime */)) {
+            const foundType = this.getMemberTypeFromInnerTypes(symbol.name, { flags: 1 /* SymbolTypeFlag.runtime */ });
+            const allResolvableTypes = foundType.reduce((acc, curType) => {
+                return acc && (curType === null || curType === void 0 ? void 0 : curType.isResolvable());
+            }, true);
+            if (!allResolvableTypes) {
+                continue;
+            }
+            const uniqueType = (0, helpers_1.getUniqueType)((0, helpers_1.findTypeUnion)(foundType), unionTypeFactory);
+            unionTable.addSymbol(symbol.name, {}, uniqueType, 1 /* SymbolTypeFlag.runtime */);
+        }
+        return unionTable;
+    }
+}
+exports.UnionType = UnionType;
+BuiltInInterfaceAdder_1.BuiltInInterfaceAdder.unionTypeFactory = (types) => {
+    return new UnionType(types);
+};
+//# sourceMappingURL=UnionType.js.map

package/dist/types/UnionType.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"UnionType.js","sourceRoot":"","sources":["../../src/types/UnionType.ts"],"names":[],"mappings":";;;AACA,uDAA4H;AAC5H,uCAAoC;AACpC,mDAAgD;AAChD,uCAAoM;AACpM,+CAA4C;AAE5C,gDAA6C;AAE7C,mEAAgE;AAChE,kCAA+B;AAE/B,SAAgB,gBAAgB,CAAC,KAAgB;IAC7C,OAAO,IAAI,SAAS,CAAC,KAAK,CAAC,CAAC;AAChC,CAAC;AAFD,4CAEC;AAED,MAAa,SAAU,SAAQ,iBAAO;IAClC,YACW,KAAgB;QAEvB,KAAK,CAAC,IAAA,yBAAe,EAAC,KAAK,EAAE,IAAI,EAAE,yBAAW,CAAC,SAAS,CAAC,CAAC,CAAC;QAFpD,UAAK,GAAL,KAAK,CAAW;QAMX,SAAI,GAAG,yBAAW,CAAC,SAAS,CAAC;QAHzC,IAAI,CAAC,4BAA4B,GAAG,IAAI,yBAAW,CAAC,gCAAgC,CAAC,CAAC;IAC1F,CAAC;IAMM,OAAO,CAAC,IAAa;QACxB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC1B,CAAC;IAED,YAAY;QACR,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE;YAC3B,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE,EAAE;gBACtB,OAAO,KAAK,CAAC;aAChB;SACJ;QACD,OAAO,IAAI,CAAC;IAChB,CAAC;IAEO,2BAA2B,CAAC,IAAY,EAAE,OAAuB;QACrE,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,aAAT,SAAS,uBAAT,SAAS,CAAE,aAAa,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC,CAAC;IAClF,CAAC;IAEO,yBAAyB,CAAC,IAAY,EAAE,OAAuB;QACnE,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,aAAT,SAAS,uBAAT,SAAS,CAAE,eAAe,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC,CAAC;IACpF,CAAC;IAED,aAAa,CAAC,IAAY,EAAE,OAAuB;QAC/C,MAAM,qBAAqB,GAAG,IAAI,CAAC,2BAA2B,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QAC9E,IAAI,CAAC,qBAAqB,IAAI,qBAAqB,CAAC,QAAQ,CAAC,SAAS,CAAC,EAAE;YACrE,0DAA0D;YAC1D,8CAA8C;YAC9C,OAAO,IAAI,6BAAa,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,CAAC,KAAK,EAAE,GAAG,EAAE;gBACrD,OAAO;oBACH,IAAI,EAAE,2BAA2B,IAAI,CAAC,YAAY,GAAG;oBACrD,aAAa,EAAE,CAAC,SAAiB,EAAE,YAA4B,EAAE,EAAE;wBAC/D,MAAM,6BAA6B,GAAG,IAAI,CAAC,2BAA2B,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;wBACtF,IAAI,CAAC,6BAA6B,IAAI,6BAA6B,CAAC,QAAQ,CAAC,SAAS,CAAC,EAAE;4BACrF,OAAO,SAAS,CAAC;yBACpB;wBACD,OAAO,IAAA,uBAAa,EAAC,IAAA,uBAAa,EAAC,6BAA6B,CAAC,EAAE,gBAAgB,CAAC,CAAC;oBACzF,CAAC;oBACD,aAAa,EAAE,CAAC,SAAiB,EAAE,eAA+B,EAAE,YAA4B,EAAE,EAAE;wBAChG,uFAAuF;oBAC3F,CAAC;oBACD,UAAU,EAAE,CAAC,WAAwB,EAAE,EAAE;wBACrC,sDAAsD;oBAC1D,CAAC;iBACJ,CAAC;YACN,CAAC,CAAC,CAAC;SACN;QACD,OAAO,IAAA,uBAAa,EAAC,IAAA,uBAAa,EAAC,qBAAqB,CAAC,EAAE,gBAAgB,CAAC,CAAC;IACjF,CAAC;IAED,eAAe,CAAC,IAAY,EAAE,OAAuB;QACjD,MAAM,qBAAqB,GAAG,IAAI,CAAC,yBAAyB,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QAC5E,IAAI,CAAC,qBAAqB,IAAI,qBAAqB,CAAC,QAAQ,CAAC,SAAS,CAAC,EAAE;YACrE,0DAA0D;YAC1D,8CAA8C;YAC9C,OAAO,IAAI,6BAAa,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,CAAC,KAAK,EAAE,GAAG,EAAE;gBACrD,OAAO;oBACH,IAAI,EAAE,oCAAoC,IAAI,CAAC,YAAY,GAAG;oBAC9D,aAAa,EAAE,CAAC,SAAiB,EAAE,YAA4B,EAAE,EAAE;wBAC/D,MAAM,6BAA6B,GAAG,IAAI,CAAC,yBAAyB,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;wBACpF,IAAI,CAAC,6BAA6B,IAAI,6BAA6B,CAAC,QAAQ,CAAC,SAAS,CAAC,EAAE;4BACrF,OAAO,SAAS,CAAC;yBACpB;wBACD,OAAO,IAAA,uBAAa,EAAC,IAAA,gCAAsB,EAAC,6BAA6B,CAAC,EAAE,gBAAgB,CAAC,CAAC;oBAClG,CAAC;oBACD,aAAa,EAAE,CAAC,SAAiB,EAAE,eAA+B,EAAE,YAA4B,EAAE,EAAE;wBAChG,uFAAuF;oBAC3F,CAAC;oBACD,UAAU,EAAE,CAAC,WAAwB,EAAE,EAAE;wBACrC,sDAAsD;oBAC1D,CAAC;iBACJ,CAAC;YACN,CAAC,CAAC,CAAC;SACN;QACD,MAAM,kBAAkB,GAAG,IAAA,uBAAa,EAAC,IAAA,gCAAsB,EAAC,qBAAqB,CAAC,EAAE,gBAAgB,EAAE,KAAK,CAAC,CAAC;QAGjH,IAAI,IAAA,gCAAmB,EAAC,kBAAkB,CAAC,EAAE;YACzC,MAAM,YAAY,GAAG,CAAC,GAAG,kBAAkB,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,kBAAkB,CAAC,UAAU,CAAC,CAAC;YAEpG,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE;gBAC7B,IAAA,uDAA6C,EAAC,IAAI,EAAE,IAAI,CAAC,4BAA4B,iCAAyB,CAAC;aAClH;SACJ;QACD,OAAO,kBAAkB,CAAC;IAC9B,CAAC;IAED,IAAI,UAAU;QACV,OAAO,WAAI,CAAC,+BAA+B,CAAC,IAAI,CAAC,CAAC;IACtD,CAAC;IAGD,gBAAgB,CAAC,UAAmB,EAAE,IAA4B;QAC9D,OAAO,IAAA,gCAAmB,EAAC,UAAU,CAAC,EAAE;YACpC,UAAU,GAAG,UAAU,CAAC,WAAW,CAAC;SACvC;QACD,IAAI,IAAA,0BAAa,EAAC,UAAU,CAAC,IAAI,IAAA,yBAAY,EAAC,UAAU,CAAC,IAAI,IAAI,KAAK,UAAU,EAAE;YAC9E,OAAO,IAAI,CAAC;SACf;QACD,IAAI,IAAA,8BAAoB,EAAC,IAAI,EAAE,UAAU,EAAE,IAAI,CAAC,EAAE;YAC9C,OAAO,IAAI,CAAC;SACf;QACD,IAAI,IAAA,wBAAW,EAAC,UAAU,CAAC,EAAE;YACzB,8EAA8E;YAC9E,KAAK,MAAM,eAAe,IAAI,UAAU,CAAC,KAAK,EAAE;gBAC5C,IAAI,CAAC,IAAI,CAAC,gBAAgB,CAAC,eAAe,EAAE,IAAI,CAAC,EAAE;oBAC/C,OAAO,KAAK,CAAC;iBAChB;aACJ;YACD,OAAO,IAAI,CAAC;SACf;QACD,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,KAAK,EAAE;YAChC,MAAM,wBAAwB,GAAG,SAAS,CAAC,gBAAgB,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;YAC9E,IAAI,wBAAwB,EAAE;gBAC1B,OAAO,IAAI,CAAC;aACf;SACJ;QAED,OAAO,KAAK,CAAC;IACjB,CAAC;IACD,QAAQ;QACJ,OAAO,IAAA,yBAAe,EAAC,IAAI,CAAC,KAAK,EAAE,IAAI,EAAE,yBAAW,CAAC,SAAS,CAAC,CAAC;IACpE,CAAC;IAED;;OAEG;IACH,YAAY;QACR,MAAM,iBAAiB,GAAG,IAAI,GAAG,CAAS,IAAA,qCAA2B,EAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,YAAY,EAAE,CAAC,CAAC,CAAC;QAExG,IAAI,iBAAiB,CAAC,IAAI,KAAK,CAAC,EAAE;YAC9B,OAAO,iBAAiB,CAAC,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC;SAClD;QACD,OAAO,SAAS,CAAC;IACrB,CAAC;IAED,mBAAmB,CAAC,SAA+B;QAC/C,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE;YACnC,OAAO,GAAG,IAAI,SAAS,CAAC,IAAI,CAAC,CAAC;QAClC,CAAC,EAAE,IAAI,CAAC,CAAC;IACb,CAAC;IAED,OAAO,CAAC,UAAmB;QACvB,IAAI,CAAC,IAAA,wBAAW,EAAC,UAAU,CAAC,EAAE;YAC1B,OAAO,KAAK,CAAC;SAChB;QACD,IAAI,IAAI,KAAK,UAAU,EAAE;YACrB,OAAO,IAAI,CAAC;SACf;QAED,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,UAAU,CAAC,KAAK,CAAC,MAAM,EAAE;YAC/C,OAAO,KAAK,CAAC;SAChB;QACD,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE;YAC3B,IAAI,UAAU,GAAG,KAAK,CAAC;YACvB,KAAK,MAAM,eAAe,IAAI,UAAU,CAAC,KAAK,EAAE;gBAC5C,IAAI,IAAI,CAAC,OAAO,CAAC,eAAe,CAAC,EAAE;oBAC/B,UAAU,GAAG,IAAI,CAAC;oBAClB,MAAM;iBACT;aACJ;YACD,IAAI,CAAC,UAAU,EAAE;gBACb,OAAO,KAAK,CAAC;aAChB;SACJ;QACD,OAAO,IAAI,CAAC;IAChB,CAAC;IAED,cAAc;QACV,MAAM,UAAU,GAAG,IAAI,yBAAW,CAAC,IAAI,CAAC,YAAY,GAAG,aAAa,CAAC,CAAC;QACtE,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAChC,IAAI,CAAC,SAAS,EAAE;YACZ,OAAO,UAAU,CAAC;SACrB;QACD,SAAS,CAAC,oBAAoB,EAAE,CAAC;QACjC,KAAK,MAAM,MAAM,IAAI,SAAS,CAAC,cAAc,EAAE,CAAC,aAAa,gCAAwB,EAAE;YACnF,MAAM,SAAS,GAAG,IAAI,CAAC,2BAA2B,CAAC,MAAM,CAAC,IAAI,EAAE,EAAE,KAAK,gCAAwB,EAAE,CAAC,CAAC;YACnG,MAAM,kBAAkB,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,OAAO,EAAE,EAAE;gBACzD,OAAO,GAAG,KAAI,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,YAAY,EAAE,CAAA,CAAC;YAC1C,CAAC,EAAE,IAAI,CAAC,CAAC;YAET,IAAI,CAAC,kBAAkB,EAAE;gBACrB,SAAS;aACZ;YACD,MAAM,UAAU,GAAG,IAAA,uBAAa,EAAC,IAAA,uBAAa,EAAC,SAAS,CAAC,EAAE,gBAAgB,CAAC,CAAC;YAC7E,UAAU,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,EAAE,EAAE,EAAE,UAAU,iCAAyB,CAAC;SAC7E;QACD,OAAO,UAAU,CAAC;IACtB,CAAC;CACJ;AAvMD,8BAuMC;AAGD,6CAAqB,CAAC,gBAAgB,GAAG,CAAC,KAAgB,EAAE,EAAE;IAC1D,OAAO,IAAI,SAAS,CAAC,KAAK,CAAC,CAAC;AAChC,CAAC,CAAC"}

package/dist/types/VoidType.d.ts

@@ -1,8 +1,14 @@
-import type { BscType } from './BscType';
-export declare class VoidType implements BscType {
-    isAssignableTo(targetType: BscType): any;
-    isConvertibleTo(targetType: BscType): any;
+import { BscType } from './BscType';
+import { BscTypeKind } from './BscTypeKind';
+import type { GetTypeOptions, TypeCompatibilityData } from '../interfaces';
+import { DynamicType } from './DynamicType';
+export declare class VoidType extends BscType {
+    readonly kind = BscTypeKind.VoidType;
+    static instance: VoidType;
+    isBuiltIn: boolean;
+    isTypeCompatible(targetType: BscType, data?: TypeCompatibilityData): boolean;
     toString(): string;
     toTypeString(): string;
-    equals(targetType: BscType): boolean;
+    isEqual(targetType: BscType): boolean;
+    getMemberType(memberName: string, options: GetTypeOptions): DynamicType;
 }

package/dist/types/VoidType.js

@@ -2,13 +2,22 @@
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.VoidType = void 0;
 const reflection_1 = require("../astUtils/reflection");
-class VoidType {
-    isAssignableTo(targetType) {
-        return (reflection_1.isVoidType(targetType) ||
-            reflection_1.isDynamicType(targetType));
+const BscType_1 = require("./BscType");
+const BscTypeKind_1 = require("./BscTypeKind");
+const helpers_1 = require("./helpers");
+const BuiltInInterfaceAdder_1 = require("./BuiltInInterfaceAdder");
+const DynamicType_1 = require("./DynamicType");
+class VoidType extends BscType_1.BscType {
+    constructor() {
+        super(...arguments);
+        this.kind = BscTypeKind_1.BscTypeKind.VoidType;
+        this.isBuiltIn = true;
     }
-    isConvertibleTo(targetType) {
-        return this.isAssignableTo(targetType);
+    isTypeCompatible(targetType, data) {
+        return ((0, reflection_1.isVoidType)(targetType) ||
+            (0, reflection_1.isDynamicType)(targetType) ||
+            (0, reflection_1.isObjectType)(targetType) ||
+            (0, helpers_1.isUnionTypeCompatible)(this, targetType, data));
     }
     toString() {
         return 'void';
@@ -16,9 +25,14 @@ class VoidType {
     toTypeString() {
         return this.toString();
     }
-    equals(targetType) {
-        return reflection_1.isVoidType(targetType);
+    isEqual(targetType) {
+        return (0, reflection_1.isVoidType)(targetType);
+    }
+    getMemberType(memberName, options) {
+        return DynamicType_1.DynamicType.instance;
     }
 }
 exports.VoidType = VoidType;
+VoidType.instance = new VoidType();
+BuiltInInterfaceAdder_1.BuiltInInterfaceAdder.primitiveTypeInstanceCache.set('void', VoidType.instance);
 //# sourceMappingURL=VoidType.js.map

package/dist/types/VoidType.js.map

@@ -1 +1 @@
-{"version":3,"file":"VoidType.js","sourceRoot":"","sources":["../../src/types/VoidType.ts"],"names":[],"mappings":";;;AAAA,uDAAmE;AAGnE,MAAa,QAAQ;IACV,cAAc,CAAC,UAAmB;QACrC,OAAO,CACH,uBAAU,CAAC,UAAU,CAAC;YACtB,0BAAa,CAAC,UAAU,CAAC,CAC5B,CAAC;IACN,CAAC;IAEM,eAAe,CAAC,UAAmB;QACtC,OAAO,IAAI,CAAC,cAAc,CAAC,UAAU,CAAC,CAAC;IAC3C,CAAC;IAEM,QAAQ;QACX,OAAO,MAAM,CAAC;IAClB,CAAC;IAGM,YAAY;QACf,OAAO,IAAI,CAAC,QAAQ,EAAE,CAAC;IAC3B,CAAC;IAEM,MAAM,CAAC,UAAmB;QAC7B,OAAO,uBAAU,CAAC,UAAU,CAAC,CAAC;IAClC,CAAC;CACJ;AAxBD,4BAwBC"}
+{"version":3,"file":"VoidType.js","sourceRoot":"","sources":["../../src/types/VoidType.ts"],"names":[],"mappings":";;;AAAA,uDAAiF;AACjF,uCAAoC;AACpC,+CAA4C;AAC5C,uCAAkD;AAClD,mEAAgE;AAEhE,+CAA4C;AAE5C,MAAa,QAAS,SAAQ,iBAAO;IAArC;;QAEoB,SAAI,GAAG,yBAAW,CAAC,QAAQ,CAAC;QAIrC,cAAS,GAAG,IAAI,CAAC;IA0B5B,CAAC;IAxBU,gBAAgB,CAAC,UAAmB,EAAE,IAA4B;QACrE,OAAO,CACH,IAAA,uBAAU,EAAC,UAAU,CAAC;YACtB,IAAA,0BAAa,EAAC,UAAU,CAAC;YACzB,IAAA,yBAAY,EAAC,UAAU,CAAC;YACxB,IAAA,+BAAqB,EAAC,IAAI,EAAE,UAAU,EAAE,IAAI,CAAC,CAChD,CAAC;IACN,CAAC;IAEM,QAAQ;QACX,OAAO,MAAM,CAAC;IAClB,CAAC;IAEM,YAAY;QACf,OAAO,IAAI,CAAC,QAAQ,EAAE,CAAC;IAC3B,CAAC;IAEM,OAAO,CAAC,UAAmB;QAC9B,OAAO,IAAA,uBAAU,EAAC,UAAU,CAAC,CAAC;IAClC,CAAC;IAED,aAAa,CAAC,UAAkB,EAAE,OAAuB;QACrD,OAAO,yBAAW,CAAC,QAAQ,CAAC;IAChC,CAAC;;AA/BL,4BAgCC;AA5BiB,iBAAQ,GAAG,IAAI,QAAQ,EAAE,CAAC;AA8B5C,6CAAqB,CAAC,0BAA0B,CAAC,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,QAAQ,CAAC,CAAC"}

package/dist/types/helpers.d.ts

@@ -0,0 +1,51 @@
+import type { TypeCompatibilityData } from '../interfaces';
+import type { BscType } from './BscType';
+import type { UnionType } from './UnionType';
+import type { SymbolTable } from '../SymbolTable';
+import type { SymbolTypeFlag } from '../SymbolTypeFlag';
+import type { IntersectionType } from './IntersectionType';
+import type { BscTypeKind } from './BscTypeKind';
+export declare function findTypeIntersection(typesArr1: BscType[], typesArr2: BscType[]): BscType[];
+export declare function findTypeUnion(...typesArr: BscType[][]): BscType[];
+/**
+ * Same as findTypeUnion, but does not allow short cutting by just checking names
+ * Useful for checking types between callfuncs, as the parameter types may have the same name, but mean different things
+ */
+export declare function findTypeUnionDeepCheck(...typesArr: BscType[][]): BscType[];
+export declare function getUniqueTypesFromArray(types: BscType[], allowNameEquality?: boolean): BscType[];
+/**
+ * Reduces a list of types based on equality or inheritance
+ * If all types are the same - just that type is returned
+ * If one of the types is Dynamic, then Dynamic.instance is returned
+ * If any types inherit another type, the more general type is returned
+ * @param types array of types
+ * @returns an array of the most general types
+ */
+export declare function reduceTypesToMostGeneric(types: BscType[], allowNameEquality?: boolean): BscType[];
+/**
+ * Reduces a list of types based on equality or inheritance
+ * If all types are the same - just that type is returned
+ * If one of the types is Dynamic, then Dynamic.instance is returned
+ * If any types inherit another type, the more Specific type is returned, eg. the one with the most members
+ * @param types array of types
+ * @returns an array of the most specific types
+ */
+export declare function reduceTypesForIntersectionType(types: BscType[], allowNameEquality?: boolean): BscType[];
+/**
+ * Gets a Unique type from a list of types
+ * @param types array of types
+ * @returns either the singular most general type, if there is one, otherwise a UnionType of the most general types
+ */
+export declare function getUniqueType(types: BscType[], unionTypeFactory: (types: BscType[]) => BscType, allowNameEquality?: boolean): BscType;
+export declare function isUnionTypeCompatible(thisType: BscType, maybeUnionType: BscType, data?: TypeCompatibilityData): boolean;
+export declare function isEnumTypeCompatible(thisType: BscType, maybeEnumType: BscType, data?: TypeCompatibilityData): boolean;
+export declare function isNativeInterfaceCompatible(thisType: BscType, otherType: BscType, allowedType: string, data?: TypeCompatibilityData): boolean;
+export declare function isNativeInterfaceCompatibleNumber(thisType: BscType, otherType: BscType, data?: TypeCompatibilityData): boolean;
+export declare function getAllTypesFromCompoundType(complex: UnionType | IntersectionType): BscType[];
+export declare function addAssociatedTypesTableAsSiblingToMemberTable(type: BscType, associatedTypesTable: SymbolTable, bitFlags: SymbolTypeFlag): void;
+/**
+ * A map of all types created in the program during its lifetime. This applies across all programs, validate runs, etc. Mostly useful for a single run to track types created.
+ */
+export declare const TypesCreated: Record<string, number>;
+export declare function joinTypesString(types: BscType[], separator: string, thisTypeKind: BscTypeKind): string;
+export declare function isTypeWithPotentialDefaultDynamicMember(type: BscType): boolean;

package/dist/types/helpers.js

@@ -0,0 +1,329 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.isTypeWithPotentialDefaultDynamicMember = exports.joinTypesString = exports.TypesCreated = exports.addAssociatedTypesTableAsSiblingToMemberTable = exports.getAllTypesFromCompoundType = exports.isNativeInterfaceCompatibleNumber = exports.isNativeInterfaceCompatible = exports.isEnumTypeCompatible = exports.isUnionTypeCompatible = exports.getUniqueType = exports.reduceTypesForIntersectionType = exports.reduceTypesToMostGeneric = exports.getUniqueTypesFromArray = exports.findTypeUnionDeepCheck = exports.findTypeUnion = exports.findTypeIntersection = void 0;
+const reflection_1 = require("../astUtils/reflection");
+function findTypeIntersection(typesArr1, typesArr2) {
+    if (!typesArr1 || !typesArr2) {
+        return undefined;
+    }
+    return typesArr1 === null || typesArr1 === void 0 ? void 0 : typesArr1.filter((currentType) => {
+        if (!currentType) {
+            return false;
+        }
+        const indexOfCurrentTypeInArr2 = typesArr2.findIndex((checkType) => {
+            return currentType.isEqual(checkType);
+        });
+        return indexOfCurrentTypeInArr2 >= 0;
+    });
+}
+exports.findTypeIntersection = findTypeIntersection;
+function findTypeUnion(...typesArr) {
+    return getUniqueTypesFromArray([].concat(...typesArr));
+}
+exports.findTypeUnion = findTypeUnion;
+/**
+ * Same as findTypeUnion, but does not allow short cutting by just checking names
+ * Useful for checking types between callfuncs, as the parameter types may have the same name, but mean different things
+ */
+function findTypeUnionDeepCheck(...typesArr) {
+    return getUniqueTypesFromArray([].concat(...typesArr), false);
+}
+exports.findTypeUnionDeepCheck = findTypeUnionDeepCheck;
+function getUniqueTypesFromArray(types, allowNameEquality = true) {
+    if (!types) {
+        return undefined;
+    }
+    return types === null || types === void 0 ? void 0 : types.filter((currentType, currentIndex) => {
+        if (!currentType) {
+            return false;
+        }
+        while ((0, reflection_1.isTypeStatementType)(currentType)) {
+            currentType = currentType.wrappedType;
+        }
+        if (((0, reflection_1.isTypePropertyReferenceType)(currentType) || (0, reflection_1.isArrayDefaultTypeReferenceType)(currentType)) && !currentType.isResolvable()) {
+            return true;
+        }
+        const latestIndex = types.findIndex((checkType) => {
+            while ((0, reflection_1.isTypeStatementType)(checkType)) {
+                checkType = checkType.wrappedType;
+            }
+            return currentType.isEqual(checkType, { allowNameEquality: allowNameEquality });
+        });
+        // the index that was found is the index we're checking --- there are no equal types after this
+        return latestIndex === currentIndex;
+    });
+}
+exports.getUniqueTypesFromArray = getUniqueTypesFromArray;
+/**
+ * Reduces a list of types based on equality or inheritance
+ * If all types are the same - just that type is returned
+ * If one of the types is Dynamic, then Dynamic.instance is returned
+ * If any types inherit another type, the more general type is returned
+ * @param types array of types
+ * @returns an array of the most general types
+ */
+function reduceTypesToMostGeneric(types, allowNameEquality = true) {
+    if (!types || (types === null || types === void 0 ? void 0 : types.length) === 0) {
+        return undefined;
+    }
+    if (types.length === 1) {
+        // only one type
+        return [types[0]];
+    }
+    types = types.map(t => {
+        var _a;
+        if ((0, reflection_1.isReferenceType)(t) && t.isResolvable()) {
+            return (_a = t.getTarget()) !== null && _a !== void 0 ? _a : t;
+        }
+        return t;
+    });
+    // Get a list of unique types, based on the `isEqual()` method
+    const uniqueTypes = getUniqueTypesFromArray(types, allowNameEquality).map(t => {
+        // map to object with `shouldIgnore` flag
+        return { type: t, shouldIgnore: false };
+    });
+    if (uniqueTypes.length === 1) {
+        // only one type after filtering
+        return [uniqueTypes[0].type];
+    }
+    const existingDynamicType = uniqueTypes.find(t => !(0, reflection_1.isAnyReferenceType)(t.type) && (0, reflection_1.isDynamicType)(t.type));
+    if (existingDynamicType) {
+        // If it includes dynamic, then the result is dynamic
+        return [existingDynamicType.type];
+    }
+    const generalizedTypes = [];
+    //check assignability:
+    for (let i = 0; i < uniqueTypes.length; i++) {
+        const currentType = uniqueTypes[i].type;
+        if (i === uniqueTypes.length - 1) {
+            if (!uniqueTypes[i].shouldIgnore) {
+                //this type was not convertible to anything else... it is as general as possible
+                generalizedTypes.push(currentType);
+            }
+            break;
+        }
+        for (let j = i + 1; j < uniqueTypes.length; j++) {
+            if (uniqueTypes[j].shouldIgnore) {
+                continue;
+            }
+            const checkType = uniqueTypes[j].type;
+            if (currentType.isResolvable() && currentType.isEqual(uniqueTypes[j].type, { allowNameEquality: allowNameEquality })) {
+                uniqueTypes[j].shouldIgnore = true;
+            }
+            else if ((0, reflection_1.isInheritableType)(currentType) && (0, reflection_1.isInheritableType)(checkType)) {
+                if (currentType.isTypeDescendent(checkType)) {
+                    //the type we're checking is less general than the current type... it can be ignored
+                    uniqueTypes[j].shouldIgnore = true;
+                }
+                if (checkType.isTypeDescendent(currentType)) {
+                    // the currentType is a descendent to some other type - it won't be in the final set
+                    break;
+                }
+            }
+            if (j === uniqueTypes.length - 1) {
+                //this type was not convertible to anything else... it is as general as possible
+                generalizedTypes.push(currentType);
+            }
+        }
+    }
+    return generalizedTypes;
+}
+exports.reduceTypesToMostGeneric = reduceTypesToMostGeneric;
+/**
+ * Reduces a list of types based on equality or inheritance
+ * If all types are the same - just that type is returned
+ * If one of the types is Dynamic, then Dynamic.instance is returned
+ * If any types inherit another type, the more Specific type is returned, eg. the one with the most members
+ * @param types array of types
+ * @returns an array of the most specific types
+ */
+function reduceTypesForIntersectionType(types, allowNameEquality = true) {
+    if (!types || (types === null || types === void 0 ? void 0 : types.length) === 0) {
+        return undefined;
+    }
+    if (types.length === 1) {
+        // only one type
+        return [types[0]];
+    }
+    types = types.map(t => {
+        var _a;
+        if ((0, reflection_1.isReferenceType)(t)) {
+            if (t.isResolvable()) {
+                return (_a = t.getTarget()) !== null && _a !== void 0 ? _a : t;
+            }
+            return undefined;
+        }
+        return t;
+    }).filter(t => t);
+    // Get a list of unique types, based on the `isEqual()` method
+    const uniqueTypes = getUniqueTypesFromArray(types, allowNameEquality).map(t => {
+        // map to object with `shouldIgnore` flag
+        return { type: t, shouldIgnore: false };
+    });
+    if (uniqueTypes.length === 1) {
+        // only one type after filtering
+        return [uniqueTypes[0].type];
+    }
+    const existingDynamicType = uniqueTypes.find(t => !(0, reflection_1.isAnyReferenceType)(t.type) && (0, reflection_1.isDynamicType)(t.type));
+    if (existingDynamicType) {
+        // If it includes dynamic, then the result is dynamic
+        return [existingDynamicType.type];
+    }
+    const specificTypes = [];
+    //check assignability:
+    for (let i = 0; i < uniqueTypes.length; i++) {
+        const currentType = uniqueTypes[i].type;
+        if (i === uniqueTypes.length - 1) {
+            if (!uniqueTypes[i].shouldIgnore) {
+                //this type was not convertible to anything else... it is as general as possible
+                specificTypes.push(currentType);
+            }
+            break;
+        }
+        for (let j = i + 1; j < uniqueTypes.length; j++) {
+            if (uniqueTypes[j].shouldIgnore) {
+                continue;
+            }
+            const checkType = uniqueTypes[j].type;
+            if (currentType.isResolvable() && currentType.isEqual(uniqueTypes[j].type, { allowNameEquality: allowNameEquality })) {
+                uniqueTypes[j].shouldIgnore = true;
+            }
+            else if ((0, reflection_1.isInheritableType)(currentType) && (0, reflection_1.isInheritableType)(checkType)) {
+                if (checkType.isTypeDescendent(currentType)) {
+                    //the type we're checking is more general than the current type... it can be ignored
+                    uniqueTypes[j].shouldIgnore = true;
+                }
+                if (currentType.isTypeDescendent(checkType)) {
+                    // the currentType is an ancestor to some other type - it won't be in the final set
+                    break;
+                }
+            }
+            if (j === uniqueTypes.length - 1) {
+                //this type was not convertible to anything else... it is as general as possible
+                specificTypes.push(currentType);
+            }
+        }
+    }
+    return specificTypes;
+}
+exports.reduceTypesForIntersectionType = reduceTypesForIntersectionType;
+/**
+ * Gets a Unique type from a list of types
+ * @param types array of types
+ * @returns either the singular most general type, if there is one, otherwise a UnionType of the most general types
+ */
+function getUniqueType(types, unionTypeFactory, allowNameEquality = true) {
+    if (!types || types.length === 0) {
+        return undefined;
+    }
+    const dynType = types.find((x) => !(0, reflection_1.isAnyReferenceType)(x) && ((0, reflection_1.isDynamicType)(x) || (0, reflection_1.isVoidType)(x)));
+    if (dynType) {
+        return dynType;
+    }
+    types = types === null || types === void 0 ? void 0 : types.map(type => {
+        if (!(0, reflection_1.isAnyReferenceType)(type) && (0, reflection_1.isUnionType)(type)) {
+            return type.types;
+        }
+        return type;
+    }).flat();
+    const generalizedTypes = reduceTypesToMostGeneric(types, allowNameEquality);
+    if (!generalizedTypes || generalizedTypes.length === 0) {
+        return undefined;
+    }
+    if ((generalizedTypes === null || generalizedTypes === void 0 ? void 0 : generalizedTypes.length) === 1) {
+        // only one type
+        return generalizedTypes[0];
+    }
+    return unionTypeFactory(generalizedTypes);
+}
+exports.getUniqueType = getUniqueType;
+function isUnionTypeCompatible(thisType, maybeUnionType, data) {
+    if ((0, reflection_1.isUnionType)(maybeUnionType)) {
+        for (const innerType of maybeUnionType.types) {
+            if (!thisType.isTypeCompatible(innerType, data)) {
+                return false;
+            }
+        }
+        return true;
+    }
+    return false;
+}
+exports.isUnionTypeCompatible = isUnionTypeCompatible;
+function isEnumTypeCompatible(thisType, maybeEnumType, data) {
+    if ((0, reflection_1.isEnumMemberType)(maybeEnumType) || (0, reflection_1.isEnumType)(maybeEnumType)) {
+        return thisType.isTypeCompatible(maybeEnumType.underlyingType, data);
+    }
+    return false;
+}
+exports.isEnumTypeCompatible = isEnumTypeCompatible;
+function isNativeInterfaceCompatible(thisType, otherType, allowedType, data) {
+    if ((0, reflection_1.isInterfaceType)(otherType)) {
+        // TODO: it is not great to do type checking based on interface name
+        const lowerOtherName = otherType.name.toLowerCase();
+        return allowedType === lowerOtherName;
+    }
+    return false;
+}
+exports.isNativeInterfaceCompatible = isNativeInterfaceCompatible;
+function isNativeInterfaceCompatibleNumber(thisType, otherType, data) {
+    if ((0, reflection_1.isInterfaceType)(otherType)) {
+        // TODO: it is not great to do type checking based on interface name
+        const lowerOtherName = otherType.name.toLowerCase();
+        return lowerOtherName === 'roint' ||
+            lowerOtherName === 'rofloat' ||
+            lowerOtherName === 'rodouble' ||
+            lowerOtherName === 'rolonginteger';
+    }
+    return false;
+}
+exports.isNativeInterfaceCompatibleNumber = isNativeInterfaceCompatibleNumber;
+function getAllTypesFromCompoundType(complex) {
+    const results = [];
+    for (const type of complex.types) {
+        if ((0, reflection_1.isCompoundType)(type)) {
+            results.push(...getAllTypesFromCompoundType(type));
+        }
+        else {
+            results.push(type);
+        }
+    }
+    return results;
+}
+exports.getAllTypesFromCompoundType = getAllTypesFromCompoundType;
+function addAssociatedTypesTableAsSiblingToMemberTable(type, associatedTypesTable, bitFlags) {
+    if ((0, reflection_1.isReferenceType)(type) &&
+        !type.isResolvable()) {
+        // This param or return type is a reference - make sure the associated types are included
+        type.tableProvider().addSibling(associatedTypesTable);
+        // add this as a sister table to member tables too!
+        const memberTable = type.getMemberTable();
+        if (memberTable.getAllSymbols) {
+            for (const memberSymbol of memberTable.getAllSymbols(bitFlags)) {
+                addAssociatedTypesTableAsSiblingToMemberTable(memberSymbol === null || memberSymbol === void 0 ? void 0 : memberSymbol.type, associatedTypesTable, bitFlags);
+            }
+        }
+    }
+}
+exports.addAssociatedTypesTableAsSiblingToMemberTable = addAssociatedTypesTableAsSiblingToMemberTable;
+/**
+ * A map of all types created in the program during its lifetime. This applies across all programs, validate runs, etc. Mostly useful for a single run to track types created.
+ */
+exports.TypesCreated = {};
+function joinTypesString(types, separator, thisTypeKind) {
+    return [...new Set(types.map(t => {
+            const typeString = t.toString();
+            if (((0, reflection_1.isUnionType)(t) || (0, reflection_1.isIntersectionType)(t)) && t.kind !== thisTypeKind) {
+                return `(${typeString})`;
+            }
+            return t.toString();
+        }))].join(` ${separator} `);
+}
+exports.joinTypesString = joinTypesString;
+function isTypeWithPotentialDefaultDynamicMember(type) {
+    return ((0, reflection_1.isInheritableType)(type) && type.changeUnknownMemberToDynamic) ||
+        (0, reflection_1.isAssociativeArrayTypeLike)(type) ||
+        (0, reflection_1.isObjectType)(type) ||
+        (0, reflection_1.isUnionTypeOf)(type, isTypeWithPotentialDefaultDynamicMember);
+}
+exports.isTypeWithPotentialDefaultDynamicMember = isTypeWithPotentialDefaultDynamicMember;
+//# sourceMappingURL=helpers.js.map