brighterscript 0.66.0-alpha.1 → 0.66.0-alpha.10

package/dist/util.js

@@ -13,9 +13,7 @@ const BooleanType_1 = require("./types/BooleanType");
 const DoubleType_1 = require("./types/DoubleType");
 const DynamicType_1 = require("./types/DynamicType");
 const FloatType_1 = require("./types/FloatType");
-const FunctionType_1 = require("./types/FunctionType");
 const IntegerType_1 = require("./types/IntegerType");
-const InvalidType_1 = require("./types/InvalidType");
 const LongIntegerType_1 = require("./types/LongIntegerType");
 const ObjectType_1 = require("./types/ObjectType");
 const StringType_1 = require("./types/StringType");
@@ -27,8 +25,28 @@ const reflection_1 = require("./astUtils/reflection");
 const visitors_1 = require("./astUtils/visitors");
 const source_map_1 = require("source-map");
 const requireRelative = require("require-relative");
+const AstNode_1 = require("./parser/AstNode");
 const creators_1 = require("./astUtils/creators");
+const FunctionType_1 = require("./types/FunctionType");
+const ArrayType_1 = require("./types/ArrayType");
+const SymbolTable_1 = require("./SymbolTable");
+const AssociativeArrayType_1 = require("./types/AssociativeArrayType");
+const ComponentType_1 = require("./types/ComponentType");
+const diagnosticUtils_1 = require("./diagnosticUtils");
+const ReferenceType_1 = require("./types/ReferenceType");
 class Util {
+    constructor() {
+        /**
+         * A cache of `Range` objects. The key is a 52bit integer created from the 4 range integers and leveraging bitshifting.
+         * The whole point of this cache is to reduce garbage collection churn, so we didn't want to use string concatenation for the key
+         */
+        this.rangeCache = new Map();
+        /**
+         * A cache of `Position` objects. The key is a 26bit integer created from line and character and leveraging bitshifting
+         * The whole point of this cache is to reduce garbage collection churn, so we didn't want to use string concatenation for the key
+         */
+        this.positionCache = new Map();
+    }
     clearConsole() {
         // process.stdout.write('\x1Bc');
     }
@@ -75,12 +93,10 @@ class Util {
      * Given a pkg path of any kind, transform it to a roku-specific pkg path (i.e. "pkg:/some/path.brs")
      */
     sanitizePkgPath(pkgPath) {
-        pkgPath = pkgPath.replace(/\\/g, '/');
-        //if there's no protocol, assume it's supposed to start with `pkg:/`
-        if (!this.startsWithProtocol(pkgPath)) {
-            pkgPath = 'pkg:/' + pkgPath;
-        }
-        return pkgPath;
+        //convert all slashes to forwardslash
+        pkgPath = pkgPath.replace(/[\/\\]+/g, '/');
+        //ensure every path has the leading pkg:/
+        return 'pkg:/' + pkgPath.replace(/^pkg:\//i, '');
     }
     /**
      * Determine if the given path starts with a protocol
@@ -90,10 +106,10 @@ class Util {
     }
     /**
      * Given a pkg path of any kind, transform it to a roku-specific pkg path (i.e. "pkg:/some/path.brs")
+     * @deprecated use `sanitizePkgPath instead. Will be removed in v1
      */
     getRokuPkgPath(pkgPath) {
-        pkgPath = pkgPath.replace(/\\/g, '/');
-        return 'pkg:/' + pkgPath;
+        return this.sanitizePkgPath(pkgPath);
     }
     /**
      * Given a path to a file/directory, replace all path separators with the current system's version.
@@ -269,6 +285,9 @@ class Util {
      */
     normalizeAndResolveConfig(config) {
         let result = this.normalizeConfig({});
+        if (config === null || config === void 0 ? void 0 : config.noProject) {
+            return result;
+        }
         //if no options were provided, try to find a bsconfig.json file
         if (!config || !config.project) {
             result.project = this.getConfigFilePath(config === null || config === void 0 ? void 0 : config.cwd);
@@ -290,7 +309,7 @@ class Util {
      * @param config a bsconfig object to use as the baseline for the resulting config
      */
     normalizeConfig(config) {
-        var _a, _b, _c, _d, _e, _f, _g, _h, _j, _k;
+        var _a, _b, _c, _d, _e, _f, _g, _h, _j, _k, _l;
         config = config || {};
         config.cwd = (_a = config.cwd) !== null && _a !== void 0 ? _a : process.cwd();
         config.deploy = config.deploy === true ? true : false;
@@ -315,11 +334,15 @@ class Util {
         config.allowBrighterScriptInBrightScript = config.allowBrighterScriptInBrightScript === true ? true : false;
         config.emitDefinitions = config.emitDefinitions === true ? true : false;
         config.removeParameterTypes = config.removeParameterTypes === true ? true : false;
-        config.enableTypeValidation = config.enableTypeValidation === true ? true : false;
         if (typeof config.logLevel === 'string') {
             config.logLevel = Logger_1.LogLevel[config.logLevel.toLowerCase()];
         }
         config.logLevel = (_k = config.logLevel) !== null && _k !== void 0 ? _k : Logger_1.LogLevel.log;
+        config.bslibDestinationDir = (_l = config.bslibDestinationDir) !== null && _l !== void 0 ? _l : 'source';
+        if (config.bslibDestinationDir !== 'source') {
+            // strip leading and trailing slashes
+            config.bslibDestinationDir = config.bslibDestinationDir.replace(/^(\/*)(.*?)(\/*)$/, '$2');
+        }
         return config;
     }
     /**
@@ -462,6 +485,10 @@ class Util {
      * ```
      */
     rangesIntersect(a, b) {
+        //stop if the either range is misisng
+        if (!a || !b) {
+            return false;
+        }
         // Check if `a` is before `b`
         if (a.end.line < b.start.line || (a.end.line === b.start.line && a.end.character <= b.start.character)) {
             return false;
@@ -483,6 +510,10 @@ class Util {
      * ```
      */
     rangesIntersectOrTouch(a, b) {
+        //stop if the either range is misisng
+        if (!a || !b) {
+            return false;
+        }
         // Check if `a` is before `b`
         if (a.end.line < b.start.line || (a.end.line === b.start.line && a.end.character < b.start.character)) {
             return false;
@@ -502,6 +533,10 @@ class Util {
         return this.comparePositionToRange(position, range) === 0;
     }
     comparePositionToRange(position, range) {
+        //stop if the either range is misisng
+        if (!position || !range) {
+            return 0;
+        }
         if (position.line < range.start.line || (position.line === range.start.line && position.character < range.start.character)) {
             return -1;
         }
@@ -510,6 +545,65 @@ class Util {
         }
         return 0;
     }
+    /**
+     * Combine all the documentation found before a token (i.e. comment tokens)
+     */
+    getTokenDocumentation(tokens, token) {
+        const comments = [];
+        const idx = tokens === null || tokens === void 0 ? void 0 : tokens.indexOf(token);
+        if (!idx || idx === -1) {
+            return undefined;
+        }
+        for (let i = idx - 1; i >= 0; i--) {
+            const token = tokens[i];
+            //skip whitespace and newline chars
+            if (token.kind === TokenKind_1.TokenKind.Comment) {
+                comments.push(token);
+            }
+            else if (token.kind === TokenKind_1.TokenKind.Newline || token.kind === TokenKind_1.TokenKind.Whitespace) {
+                //skip these tokens
+                continue;
+                //any other token means there are no more comments
+            }
+            else {
+                break;
+            }
+        }
+        if (comments.length > 0) {
+            return comments.reverse().map(x => x.text.replace(/^('|rem)/i, '').trim()).map(line => {
+                if (line.startsWith('@')) {
+                    // Handle jsdoc/brightscriptdoc tags specially
+                    // make sure they are on their own markdown line, and add italics
+                    const firstSpaceIndex = line.indexOf(' ');
+                    if (firstSpaceIndex === -1) {
+                        return `\n_${line}_`;
+                    }
+                    const firstWord = line.substring(0, firstSpaceIndex);
+                    return `\n_${firstWord}_ ${line.substring(firstSpaceIndex + 1)}`;
+                }
+                return line;
+            }).join('\n');
+        }
+    }
+    /**
+     * Combine all the documentation for a node - uses the AstNode's leadingTrivia property
+     */
+    getNodeDocumentation(node) {
+        if (!node) {
+            return;
+        }
+        const leadingTrivia = node.getLeadingTrivia();
+        return this.getTokenDocumentation(leadingTrivia, leadingTrivia[leadingTrivia.length - 1]);
+    }
+    /**
+     * Prefixes a component name so it can be used as type in the symbol table, without polluting available symbols
+     *
+     * @param sgNodeName the Name of the component
+     * @returns the node name, prefixed with `roSGNode`
+     */
+    getSgNodeTypeName(sgNodeName) {
+        return 'roSGNode' + sgNodeName;
+    }
     /**
      * Parse an xml file and get back a javascript object containing its results
      */
@@ -649,13 +743,14 @@ class Util {
         const diagnosticCode = typeof diagnostic.code === 'string' ? diagnostic.code.toLowerCase() : diagnostic.code;
         for (let flag of (_b = (_a = diagnostic.file) === null || _a === void 0 ? void 0 : _a.commentFlags) !== null && _b !== void 0 ? _b : []) {
             //this diagnostic is affected by this flag
-            if (this.rangeContains(flag.affectedRange, diagnostic.range.start)) {
+            if (diagnostic.range && this.rangeContains(flag.affectedRange, diagnostic.range.start)) {
                 //if the flag acts upon this diagnostic's code
                 if (flag.codes === null || flag.codes.includes(diagnosticCode)) {
                     return true;
                 }
             }
         }
+        return false;
     }
     /**
      * Walks up the chain to find the closest bsconfig.json file
@@ -836,31 +931,23 @@ class Util {
      * Helper for creating `Range` objects. Prefer using this function because vscode-languageserver's `Range.create()` is significantly slower
      */
     createRange(startLine, startCharacter, endLine, endCharacter) {
-        return {
-            start: {
-                line: startLine,
-                character: startCharacter
-            },
-            end: {
-                line: endLine,
-                character: endCharacter
-            }
-        };
+        // eslint-disable-next-line no-bitwise
+        const key = (startLine << 39) + (startCharacter << 26) + (endLine << 13) + endCharacter;
+        let range = this.rangeCache.get(key);
+        if (!range) {
+            range = {
+                start: this.createPosition(startLine, startCharacter),
+                end: this.createPosition(endLine, endCharacter)
+            };
+            this.rangeCache.set(key, range);
+        }
+        return range;
     }
     /**
      * Create a `Range` from two `Position`s
      */
     createRangeFromPositions(startPosition, endPosition) {
-        return {
-            start: {
-                line: startPosition.line,
-                character: startPosition.character
-            },
-            end: {
-                line: endPosition.line,
-                character: endPosition.character
-            }
-        };
+        return this.createRange(startPosition.line, startPosition.character, endPosition.line, endPosition.character);
     }
     /**
      * Given a list of ranges, create a range that starts with the first non-null lefthand range, and ends with the first non-null
@@ -900,10 +987,17 @@ class Util {
      * Create a `Position` object. Prefer this over `Position.create` for performance reasons
      */
     createPosition(line, character) {
-        return {
-            line: line,
-            character: character
-        };
+        // eslint-disable-next-line no-bitwise
+        const key = (line << 13) + character;
+        let position = this.positionCache.get(key);
+        if (!position) {
+            position = {
+                line: line,
+                character: character
+            };
+            this.positionCache.set(key, position);
+        }
+        return position;
     }
     /**
      * Convert a list of tokens into a string, including their leading whitespace
@@ -938,14 +1032,13 @@ class Util {
             case TokenKind_1.TokenKind.FloatLiteral:
                 return FloatType_1.FloatType.instance;
             case TokenKind_1.TokenKind.Function:
-                //TODO should there be a more generic function type without a signature that's assignable to all other function types?
-                return new FunctionType_1.FunctionType(new DynamicType_1.DynamicType(token.text));
+                return new FunctionType_1.FunctionType(token.text);
             case TokenKind_1.TokenKind.Integer:
                 return new IntegerType_1.IntegerType(token.text);
             case TokenKind_1.TokenKind.IntegerLiteral:
                 return IntegerType_1.IntegerType.instance;
             case TokenKind_1.TokenKind.Invalid:
-                return new InvalidType_1.InvalidType(token.text);
+                return DynamicType_1.DynamicType.instance; // TODO: use InvalidType better new InvalidType(token.text);
             case TokenKind_1.TokenKind.LongInteger:
                 return new LongIntegerType_1.LongIntegerType(token.text);
             case TokenKind_1.TokenKind.LongIntegerLiteral:
@@ -972,11 +1065,11 @@ class Util {
                     case 'float':
                         return new FloatType_1.FloatType(token.text);
                     case 'function':
-                        return new FunctionType_1.FunctionType(new DynamicType_1.DynamicType(token.text));
+                        return new FunctionType_1.FunctionType(token.text);
                     case 'integer':
                         return new IntegerType_1.IntegerType(token.text);
                     case 'invalid':
-                        return new InvalidType_1.InvalidType(token.text);
+                        return DynamicType_1.DynamicType.instance; // TODO: use InvalidType better new InvalidType(token.text);
                     case 'longinteger':
                         return new LongIntegerType_1.LongIntegerType(token.text);
                     case 'object':
@@ -988,9 +1081,244 @@ class Util {
                 }
         }
     }
+    /**
+     * Deciphers the correct types for fields based on docs
+     * https://developer.roku.com/en-ca/docs/references/scenegraph/xml-elements/interface.md
+     * @param typeDescriptor the type descriptor from the docs
+     * @returns {BscType} the known type, or dynamic
+     */
+    getNodeFieldType(typeDescriptor, lookupTable) {
+        const typeDescriptorLower = typeDescriptor.toLowerCase().trim();
+        const bscType = this.tokenToBscType((0, creators_1.createToken)(TokenKind_1.TokenKind.Identifier, typeDescriptorLower));
+        if (bscType) {
+            return bscType;
+        }
+        if (typeDescriptorLower.startsWith('array of ')) {
+            let arrayOfTypeName = typeDescriptorLower.substring(9); //cut off beginning 'array of'
+            if (arrayOfTypeName.endsWith('s')) {
+                // remove "s" in "floats", etc.
+                arrayOfTypeName = arrayOfTypeName.substring(0, arrayOfTypeName.length - 1);
+            }
+            if (arrayOfTypeName.endsWith('\'')) {
+                // remove "'" in "float's", etc.
+                arrayOfTypeName = arrayOfTypeName.substring(0, arrayOfTypeName.length - 1);
+            }
+            let arrayType = this.getNodeFieldType(arrayOfTypeName, lookupTable);
+            return new ArrayType_1.ArrayType(arrayType);
+        }
+        else if (typeDescriptorLower.startsWith('option ')) {
+            const actualTypeName = typeDescriptorLower.substring('option '.length); //cut off beginning 'option '
+            return this.getNodeFieldType(actualTypeName, lookupTable);
+        }
+        else if (typeDescriptorLower.startsWith('value ')) {
+            const actualTypeName = typeDescriptorLower.substring('value '.length); //cut off beginning 'value '
+            return this.getNodeFieldType(actualTypeName, lookupTable);
+        }
+        else if (typeDescriptorLower === 'uri') {
+            return StringType_1.StringType.instance;
+        }
+        else if (typeDescriptorLower === 'vector2d' || typeDescriptorLower === 'floatarray') {
+            return new ArrayType_1.ArrayType(FloatType_1.FloatType.instance);
+        }
+        else if (typeDescriptorLower === 'intarray') {
+            return new ArrayType_1.ArrayType(IntegerType_1.IntegerType.instance);
+        }
+        else if (typeDescriptorLower === 'boolarray') {
+            return new ArrayType_1.ArrayType(BooleanType_1.BooleanType.instance);
+        }
+        else if (typeDescriptorLower === 'stringarray' || typeDescriptorLower === 'strarray') {
+            return new ArrayType_1.ArrayType(StringType_1.StringType.instance);
+        }
+        else if (typeDescriptorLower === 'int') {
+            return IntegerType_1.IntegerType.instance;
+        }
+        else if (typeDescriptorLower === 'time') {
+            return FloatType_1.FloatType.instance;
+        }
+        else if (typeDescriptorLower === 'str') {
+            return StringType_1.StringType.instance;
+        }
+        else if (typeDescriptorLower === 'bool') {
+            return BooleanType_1.BooleanType.instance;
+        }
+        else if (typeDescriptorLower === 'assocarray' || typeDescriptorLower === 'associative array') {
+            return new AssociativeArrayType_1.AssociativeArrayType();
+        }
+        else if (typeDescriptorLower === 'node') {
+            return ComponentType_1.ComponentType.instance;
+        }
+        else if (typeDescriptorLower === 'nodearray') {
+            return new ArrayType_1.ArrayType(ComponentType_1.ComponentType.instance);
+        }
+        else if (lookupTable) {
+            //try doing a lookup
+            return lookupTable.getSymbolType(typeDescriptorLower, { flags: SymbolTable_1.SymbolTypeFlag.typetime });
+        }
+        //  TODO: Handle  'rect2d', 'rect2dArray', 'color', 'colorarray', 'time'
+        return DynamicType_1.DynamicType.instance;
+    }
+    /**
+     * Return the type of the result of a binary operator
+     * Note: compound assignments (eg. +=) internally use a binary expression, so that's why TokenKind.PlusEqual, etc. are here too
+     */
+    binaryOperatorResultType(leftType, operator, rightType) {
+        if (((0, reflection_1.isAnyReferenceType)(leftType) && !leftType.isResolvable()) ||
+            ((0, reflection_1.isAnyReferenceType)(rightType) && !rightType.isResolvable())) {
+            return new ReferenceType_1.BinaryOperatorReferenceType(leftType, operator, rightType, (lhs, op, rhs) => {
+                return this.binaryOperatorResultType(lhs, op, rhs);
+            });
+        }
+        if ((0, reflection_1.isEnumMemberType)(leftType)) {
+            leftType = leftType.underlyingType;
+        }
+        if ((0, reflection_1.isEnumMemberType)(rightType)) {
+            rightType = rightType.underlyingType;
+        }
+        let hasDouble = (0, reflection_1.isDoubleType)(leftType) || (0, reflection_1.isDoubleType)(rightType);
+        let hasFloat = (0, reflection_1.isFloatType)(leftType) || (0, reflection_1.isFloatType)(rightType);
+        let hasLongInteger = (0, reflection_1.isLongIntegerType)(leftType) || (0, reflection_1.isLongIntegerType)(rightType);
+        let hasInvalid = (0, reflection_1.isInvalidType)(leftType) || (0, reflection_1.isInvalidType)(rightType);
+        let hasDynamic = (0, reflection_1.isDynamicType)(leftType) || (0, reflection_1.isDynamicType)(rightType);
+        let bothNumbers = (0, reflection_1.isNumberType)(leftType) && (0, reflection_1.isNumberType)(rightType);
+        let bothStrings = (0, reflection_1.isStringType)(leftType) && (0, reflection_1.isStringType)(rightType);
+        let eitherBooleanOrNum = ((0, reflection_1.isNumberType)(leftType) || (0, reflection_1.isBooleanType)(leftType)) && ((0, reflection_1.isNumberType)(rightType) || (0, reflection_1.isBooleanType)(rightType));
+        // eslint-disable-next-line @typescript-eslint/switch-exhaustiveness-check
+        switch (operator.kind) {
+            // Math operators
+            case TokenKind_1.TokenKind.Plus:
+            case TokenKind_1.TokenKind.PlusEqual:
+                if (bothStrings) {
+                    // "string" + "string" is the only binary expression allowed with strings
+                    return StringType_1.StringType.instance;
+                }
+            // eslint-disable-next-line no-fallthrough
+            case TokenKind_1.TokenKind.Minus:
+            case TokenKind_1.TokenKind.MinusEqual:
+            case TokenKind_1.TokenKind.Star:
+            case TokenKind_1.TokenKind.StarEqual:
+            case TokenKind_1.TokenKind.Mod:
+                if (bothNumbers) {
+                    if (hasDouble) {
+                        return DoubleType_1.DoubleType.instance;
+                    }
+                    else if (hasFloat) {
+                        return FloatType_1.FloatType.instance;
+                    }
+                    else if (hasLongInteger) {
+                        return LongIntegerType_1.LongIntegerType.instance;
+                    }
+                    return IntegerType_1.IntegerType.instance;
+                }
+                break;
+            case TokenKind_1.TokenKind.Forwardslash:
+            case TokenKind_1.TokenKind.ForwardslashEqual:
+                if (bothNumbers) {
+                    if (hasDouble) {
+                        return DoubleType_1.DoubleType.instance;
+                    }
+                    else if (hasFloat) {
+                        return FloatType_1.FloatType.instance;
+                    }
+                    else if (hasLongInteger) {
+                        return LongIntegerType_1.LongIntegerType.instance;
+                    }
+                    return FloatType_1.FloatType.instance;
+                }
+                break;
+            case TokenKind_1.TokenKind.Backslash:
+            case TokenKind_1.TokenKind.BackslashEqual:
+                if (bothNumbers) {
+                    if (hasLongInteger) {
+                        return LongIntegerType_1.LongIntegerType.instance;
+                    }
+                    return IntegerType_1.IntegerType.instance;
+                }
+                break;
+            case TokenKind_1.TokenKind.Caret:
+                if (bothNumbers) {
+                    if (hasDouble || hasLongInteger) {
+                        return DoubleType_1.DoubleType.instance;
+                    }
+                    else if (hasFloat) {
+                        return FloatType_1.FloatType.instance;
+                    }
+                    return IntegerType_1.IntegerType.instance;
+                }
+                break;
+            // Bitshift operators
+            case TokenKind_1.TokenKind.LeftShift:
+            case TokenKind_1.TokenKind.LeftShiftEqual:
+            case TokenKind_1.TokenKind.RightShift:
+            case TokenKind_1.TokenKind.RightShiftEqual:
+                if (bothNumbers) {
+                    if (hasLongInteger) {
+                        return LongIntegerType_1.LongIntegerType.instance;
+                    }
+                    // Bitshifts are allowed with non-integer numerics
+                    // but will always truncate to ints
+                    return IntegerType_1.IntegerType.instance;
+                }
+                break;
+            // Comparison operators
+            // All comparison operators result in boolean
+            case TokenKind_1.TokenKind.Equal:
+            case TokenKind_1.TokenKind.LessGreater:
+                // = and <> can accept invalid / dynamic
+                if (hasDynamic || hasInvalid || bothStrings || eitherBooleanOrNum) {
+                    return BooleanType_1.BooleanType.instance;
+                }
+                break;
+            case TokenKind_1.TokenKind.Greater:
+            case TokenKind_1.TokenKind.Less:
+            case TokenKind_1.TokenKind.GreaterEqual:
+            case TokenKind_1.TokenKind.LessEqual:
+                if (bothStrings || bothNumbers) {
+                    return BooleanType_1.BooleanType.instance;
+                }
+                break;
+            // Logical operators
+            case TokenKind_1.TokenKind.Or:
+            case TokenKind_1.TokenKind.And:
+                if (eitherBooleanOrNum) {
+                    return BooleanType_1.BooleanType.instance;
+                }
+                break;
+        }
+        return DynamicType_1.DynamicType.instance;
+    }
+    /**
+     * Return the type of the result of a binary operator
+     */
+    unaryOperatorResultType(operator, exprType) {
+        // eslint-disable-next-line @typescript-eslint/switch-exhaustiveness-check
+        switch (operator.kind) {
+            // Math operators
+            case TokenKind_1.TokenKind.Minus:
+                if ((0, reflection_1.isNumberType)(exprType)) {
+                    // a negative number will be the same type, eg, double->double, int->int, etc.
+                    return exprType;
+                }
+                break;
+            case TokenKind_1.TokenKind.Not:
+                if ((0, reflection_1.isBooleanType)(exprType)) {
+                    return BooleanType_1.BooleanType.instance;
+                }
+                else if ((0, reflection_1.isNumberType)(exprType)) {
+                    //numbers can be "notted"
+                    // by default they go to ints, except longints, which stay that way
+                    if ((0, reflection_1.isLongIntegerType)(exprType)) {
+                        return LongIntegerType_1.LongIntegerType.instance;
+                    }
+                    return IntegerType_1.IntegerType.instance;
+                }
+                break;
+        }
+        return DynamicType_1.DynamicType.instance;
+    }
     /**
      * Get the extension for the given file path. Basically the part after the final dot, except for
      * `d.bs` which is treated as single extension
+     * @returns the file extension (i.e. ".d.bs", ".bs", ".brs", ".xml", ".jpg", etc...)
      */
     getExtension(filePath) {
         filePath = filePath.toLowerCase();
@@ -998,10 +1326,7 @@ class Util {
             return '.d.bs';
         }
         else {
-            const idx = filePath.lastIndexOf('.');
-            if (idx > -1) {
-                return filePath.substring(idx);
-            }
+            return path.extname(filePath).toLowerCase();
         }
     }
     /**
@@ -1067,6 +1392,10 @@ class Util {
         expressionWalker(expression);
         return { expressions: expressions, varExpressions: variableExpressions, uniqueVarNames: [...uniqueVarNames] };
     }
+    concatAnnotationLeadingTrivia(stmt, otherTrivia) {
+        var _a, _b;
+        return [...((_b = (_a = stmt.annotations) === null || _a === void 0 ? void 0 : _a.map(anno => anno.getLeadingTrivia()).flat()) !== null && _b !== void 0 ? _b : []), ...otherTrivia];
+    }
     /**
      * Create a SourceNode that maps every line to itself. Useful for creating maps for files
      * that haven't changed at all, but we still need the map
@@ -1087,29 +1416,6 @@ class Util {
     standardizePath(thePath) {
         return exports.util.driveLetterToLower((0, roku_deploy_1.standardizePath)(thePath));
     }
-    /**
-     * Copy the version of bslib from local node_modules to the staging folder
-     */
-    async copyBslibToStaging(stagingDir) {
-        //copy bslib to the output directory
-        await fsExtra.ensureDir(standardizePath(`${stagingDir}/source`));
-        // eslint-disable-next-line
-        const bslib = require('@rokucommunity/bslib');
-        let source = bslib.source;
-        //apply the `bslib_` prefix to the functions
-        let match;
-        const positions = [];
-        const regexp = /^(\s*(?:function|sub)\s+)([a-z0-9_]+)/mg;
-        // eslint-disable-next-line no-cond-assign
-        while (match = regexp.exec(source)) {
-            positions.push(match.index + match[1].length);
-        }
-        for (let i = positions.length - 1; i >= 0; i--) {
-            const position = positions[i];
-            source = source.slice(0, position) + 'bslib_' + source.slice(position);
-        }
-        await fsExtra.writeFile(`${stagingDir}/source/bslib.brs`, source);
-    }
     /**
      * Given a Diagnostic or BsDiagnostic, return a deep clone of the diagnostic.
      * @param diagnostic the diagnostic to clone
@@ -1117,11 +1423,20 @@ class Util {
      */
     toDiagnostic(diagnostic, relatedInformationFallbackLocation) {
         var _a;
+        let relatedInformation = (_a = diagnostic.relatedInformation) !== null && _a !== void 0 ? _a : [];
+        if (relatedInformation.length > diagnosticUtils_1.MAX_RELATED_INFOS_COUNT) {
+            const relatedInfoLength = relatedInformation.length;
+            relatedInformation = relatedInformation.slice(0, diagnosticUtils_1.MAX_RELATED_INFOS_COUNT);
+            relatedInformation.push({
+                message: `...and ${relatedInfoLength - diagnosticUtils_1.MAX_RELATED_INFOS_COUNT} more`,
+                location: exports.util.createLocation('   ', exports.util.createRange(0, 0, 0, 0))
+            });
+        }
         return {
             severity: diagnostic.severity,
             range: diagnostic.range,
             message: diagnostic.message,
-            relatedInformation: (_a = diagnostic.relatedInformation) === null || _a === void 0 ? void 0 : _a.map(x => {
+            relatedInformation: relatedInformation.map(x => {
                 //clone related information just in case a plugin added circular ref info here
                 const clone = Object.assign({}, x);
                 if (!clone.location) {
@@ -1222,55 +1537,70 @@ class Util {
      * @returns an array of the parts of the dotted get. If not fully a dotted get, then returns undefined
      */
     getAllDottedGetParts(node) {
+        //this is a hot function and has been optimized. Don't rewrite unless necessary
         const parts = [];
         let nextPart = node;
-        while (nextPart) {
-            if ((0, reflection_1.isAssignmentStatement)(node)) {
-                return [node.name];
-            }
-            else if ((0, reflection_1.isDottedGetExpression)(nextPart)) {
-                parts.push(nextPart === null || nextPart === void 0 ? void 0 : nextPart.name);
-                nextPart = nextPart.obj;
-            }
-            else if ((0, reflection_1.isCallExpression)(nextPart)) {
-                nextPart = nextPart.callee;
-            }
-            else if ((0, reflection_1.isTypeExpression)(nextPart)) {
-                nextPart = nextPart.expression;
-            }
-            else if ((0, reflection_1.isVariableExpression)(nextPart)) {
-                parts.push(nextPart === null || nextPart === void 0 ? void 0 : nextPart.name);
-                break;
-            }
-            else if ((0, reflection_1.isLiteralExpression)(nextPart)) {
-                parts.push(nextPart === null || nextPart === void 0 ? void 0 : nextPart.token);
-                break;
-            }
-            else if ((0, reflection_1.isIndexedGetExpression)(nextPart)) {
-                nextPart = nextPart.obj;
-            }
-            else if ((0, reflection_1.isFunctionParameterExpression)(nextPart)) {
-                return [nextPart.name];
-            }
-            else if ((0, reflection_1.isGroupingExpression)(nextPart)) {
-                parts.push((0, creators_1.createIdentifier)('()', nextPart.range));
-                break;
-            }
-            else {
-                //we found a non-DottedGet expression, so return because this whole operation is invalid.
-                return undefined;
+        loop: while (nextPart) {
+            switch (nextPart === null || nextPart === void 0 ? void 0 : nextPart.kind) {
+                case AstNode_1.AstNodeKind.AssignmentStatement:
+                    return [node.name];
+                case AstNode_1.AstNodeKind.DottedGetExpression:
+                    parts.push(nextPart === null || nextPart === void 0 ? void 0 : nextPart.name);
+                    nextPart = nextPart.obj;
+                    continue;
+                case AstNode_1.AstNodeKind.CallExpression:
+                    nextPart = nextPart.callee;
+                    continue;
+                case AstNode_1.AstNodeKind.TypeExpression:
+                    nextPart = nextPart.expression;
+                    continue;
+                case AstNode_1.AstNodeKind.VariableExpression:
+                    parts.push(nextPart === null || nextPart === void 0 ? void 0 : nextPart.name);
+                    break loop;
+                case AstNode_1.AstNodeKind.LiteralExpression:
+                    parts.push(nextPart === null || nextPart === void 0 ? void 0 : nextPart.token);
+                    break loop;
+                case AstNode_1.AstNodeKind.IndexedGetExpression:
+                    nextPart = nextPart.obj;
+                    continue;
+                case AstNode_1.AstNodeKind.FunctionParameterExpression:
+                    return [nextPart.name];
+                case AstNode_1.AstNodeKind.GroupingExpression:
+                    parts.push((0, creators_1.createIdentifier)('()', nextPart.range));
+                    break loop;
+                default:
+                    //we found a non-DottedGet expression, so return because this whole operation is invalid.
+                    return undefined;
             }
         }
         return parts.reverse();
     }
+    /**
+     * Given an expression, return all the DottedGet name parts as a string.
+     * Mostly used to convert namespaced item full names to a strings
+     */
     getAllDottedGetPartsAsString(node, parseMode = Parser_1.ParseMode.BrighterScript) {
+        var _a, _b;
+        //this is a hot function and has been optimized. Don't rewrite unless necessary
+        /* eslint-disable no-var */
+        var sep = parseMode === Parser_1.ParseMode.BrighterScript ? '.' : '_';
+        const parts = (_a = this.getAllDottedGetParts(node)) !== null && _a !== void 0 ? _a : [];
+        var result = (_b = parts[0]) === null || _b === void 0 ? void 0 : _b.text;
+        for (var i = 1; i < parts.length; i++) {
+            result += sep + parts[i].text;
+        }
+        return result;
+        /* eslint-enable no-var */
+    }
+    stringJoin(strings, separator) {
         var _a;
-        const sep = parseMode === Parser_1.ParseMode.BrighterScript ? '.' : '_';
-        const hello = (_a = this.getAllDottedGetParts(node)) === null || _a === void 0 ? void 0 : _a.map(part => part.text).join(sep);
-        if (!hello) {
-            console.log(node);
+        // eslint-disable-next-line no-var
+        var result = (_a = strings[0]) !== null && _a !== void 0 ? _a : '';
+        // eslint-disable-next-line no-var
+        for (var i = 1; i < strings.length; i++) {
+            result += separator + strings[i];
         }
-        return hello;
+        return result;
     }
     /**
      * Break an expression into each part.
@@ -1301,36 +1631,37 @@ class Util {
     getDottedGetPath(expression) {
         let parts = [];
         let nextPart = expression;
-        while (nextPart) {
-            if ((0, reflection_1.isDottedGetExpression)(nextPart)) {
-                parts.unshift(nextPart);
-                nextPart = nextPart.obj;
-            }
-            else if ((0, reflection_1.isIndexedGetExpression)(nextPart) || (0, reflection_1.isXmlAttributeGetExpression)(nextPart)) {
-                nextPart = nextPart.obj;
-                parts = [];
-            }
-            else if ((0, reflection_1.isCallExpression)(nextPart) || (0, reflection_1.isCallfuncExpression)(nextPart)) {
-                nextPart = nextPart.callee;
-                parts = [];
-            }
-            else if ((0, reflection_1.isNewExpression)(nextPart)) {
-                nextPart = nextPart.call.callee;
-                parts = [];
-            }
-            else if ((0, reflection_1.isTypeExpression)(nextPart)) {
-                nextPart = nextPart.expression;
-            }
-            else if ((0, reflection_1.isVariableExpression)(nextPart)) {
-                parts.unshift(nextPart);
-                break;
-            }
-            else {
-                parts = [];
-                break;
+        loop: while (nextPart) {
+            switch (nextPart === null || nextPart === void 0 ? void 0 : nextPart.kind) {
+                case AstNode_1.AstNodeKind.DottedGetExpression:
+                    parts.push(nextPart);
+                    nextPart = nextPart.obj;
+                    continue;
+                case AstNode_1.AstNodeKind.IndexedGetExpression:
+                case AstNode_1.AstNodeKind.XmlAttributeGetExpression:
+                    nextPart = nextPart.obj;
+                    parts = [];
+                    continue;
+                case AstNode_1.AstNodeKind.CallExpression:
+                case AstNode_1.AstNodeKind.CallfuncExpression:
+                    nextPart = nextPart.callee;
+                    parts = [];
+                    continue;
+                case AstNode_1.AstNodeKind.NewExpression:
+                    nextPart = nextPart.call.callee;
+                    parts = [];
+                    continue;
+                case AstNode_1.AstNodeKind.TypeExpression:
+                    nextPart = nextPart.expression;
+                    continue;
+                case AstNode_1.AstNodeKind.VariableExpression:
+                    parts.push(nextPart);
+                    break loop;
+                default:
+                    return [];
             }
         }
-        return parts;
+        return parts.reverse();
     }
     /**
      * Returns an integer if valid, or undefined. Eliminates checking for NaN
@@ -1354,15 +1685,15 @@ class Util {
     validateTooDeepFile(file) {
         var _a;
         //find any files nested too deep
-        let pkgPath = (_a = file.pkgPath) !== null && _a !== void 0 ? _a : file.pkgPath.toString();
-        let rootFolder = pkgPath.replace(/^pkg:/, '').split(/[\\\/]/)[0].toLowerCase();
+        let destPath = (_a = file === null || file === void 0 ? void 0 : file.destPath) === null || _a === void 0 ? void 0 : _a.toString();
+        let rootFolder = destPath === null || destPath === void 0 ? void 0 : destPath.replace(/^pkg:/, '').split(/[\\\/]/)[0].toLowerCase();
         if ((0, reflection_1.isBrsFile)(file) && rootFolder !== 'source') {
             return;
         }
         if ((0, reflection_1.isXmlFile)(file) && rootFolder !== 'components') {
             return;
         }
-        let fileDepth = this.getParentDirectoryCount(pkgPath);
+        let fileDepth = this.getParentDirectoryCount(destPath);
         if (fileDepth >= 8) {
             file.addDiagnostics([Object.assign(Object.assign({}, DiagnosticMessages_1.DiagnosticMessages.detectedTooDeepFileSource(fileDepth)), { file: file, range: this.createRange(0, 0, 0, Number.MAX_VALUE) })]);
         }
@@ -1378,35 +1709,132 @@ class Util {
         }
     }
     processTypeChain(typeChain) {
+        var _a, _b, _c, _d;
         let fullChainName = '';
         let fullErrorName = '';
-        let missingItemName = '';
+        let itemName = '';
         let previousTypeName = '';
         let parentTypeName = '';
         let errorRange;
+        let containsDynamic = false;
         for (let i = 0; i < typeChain.length; i++) {
             const chainItem = typeChain[i];
+            const dotSep = (_b = (_a = chainItem.separatorToken) === null || _a === void 0 ? void 0 : _a.text) !== null && _b !== void 0 ? _b : '.';
             if (i > 0) {
-                fullChainName += '.';
+                fullChainName += dotSep;
             }
             fullChainName += chainItem.name;
             parentTypeName = previousTypeName;
-            fullErrorName = previousTypeName ? `${previousTypeName}.${chainItem.name}` : chainItem.name;
-            previousTypeName = chainItem.type.toString();
-            missingItemName = chainItem.name;
+            fullErrorName = previousTypeName ? `${previousTypeName}${dotSep}${chainItem.name}` : chainItem.name;
+            previousTypeName = (_d = (_c = chainItem.type) === null || _c === void 0 ? void 0 : _c.toString()) !== null && _d !== void 0 ? _d : '';
+            itemName = chainItem.name;
+            containsDynamic = containsDynamic || ((0, reflection_1.isDynamicType)(chainItem.type) && !(0, reflection_1.isAnyReferenceType)(chainItem.type));
             if (!chainItem.isResolved) {
                 errorRange = chainItem.range;
                 break;
             }
         }
         return {
-            missingItemName: missingItemName,
-            missingItemParentTypeName: parentTypeName,
-            fullNameOfMissingItem: fullErrorName,
+            itemName: itemName,
+            itemParentTypeName: parentTypeName,
+            fullNameOfItem: fullErrorName,
             fullChainName: fullChainName,
-            range: errorRange
+            range: errorRange,
+            containsDynamic: containsDynamic
         };
     }
+    isInTypeExpression(expression) {
+        //TODO: this is much faster than node.findAncestor(), but may need to be updated for "complicated" type expressions
+        if ((0, reflection_1.isTypeExpression)(expression) ||
+            (0, reflection_1.isTypeExpression)(expression.parent) ||
+            (0, reflection_1.isTypedArrayExpression)(expression) ||
+            (0, reflection_1.isTypedArrayExpression)(expression.parent)) {
+            return true;
+        }
+        if ((0, reflection_1.isBinaryExpression)(expression.parent)) {
+            let currentExpr = expression.parent;
+            while ((0, reflection_1.isBinaryExpression)(currentExpr) && currentExpr.operator.kind === TokenKind_1.TokenKind.Or) {
+                currentExpr = currentExpr.parent;
+            }
+            return (0, reflection_1.isTypeExpression)(currentExpr) || (0, reflection_1.isTypedArrayExpression)(currentExpr);
+        }
+        return false;
+    }
+    setContainsUnresolvedSymbol(symbolLowerNameSet, symbol) {
+        var _a, _b;
+        const possibleOriginalSymbolNamesLower = [];
+        let nameSoFar = '';
+        for (const tce of symbol.typeChain) {
+            if (nameSoFar.length > 0) {
+                nameSoFar += '.';
+            }
+            nameSoFar += tce.name.toLowerCase();
+            possibleOriginalSymbolNamesLower.push(nameSoFar);
+        }
+        const possibleNamespace = (_b = (_a = symbol.containingNamespaces) === null || _a === void 0 ? void 0 : _a.join('.')) !== null && _b !== void 0 ? _b : '';
+        for (const possibleNameLower of possibleOriginalSymbolNamesLower) {
+            if (symbolLowerNameSet.has(possibleNameLower)) {
+                return true;
+            }
+            if (possibleNamespace) {
+                const fullName = possibleNamespace + '.' + possibleNameLower;
+                if (symbolLowerNameSet.has(fullName.toLowerCase())) {
+                    return true;
+                }
+            }
+        }
+        return false;
+    }
+    truncate(options) {
+        var _a, _b, _c, _d, _e, _f, _g;
+        let leadingText = options.leadingText;
+        let items = (_a = options === null || options === void 0 ? void 0 : options.items) !== null && _a !== void 0 ? _a : [];
+        let trailingText = (_b = options === null || options === void 0 ? void 0 : options.trailingText) !== null && _b !== void 0 ? _b : '';
+        let maxLength = (_c = options === null || options === void 0 ? void 0 : options.maxLength) !== null && _c !== void 0 ? _c : 160;
+        let itemSeparator = (_d = options === null || options === void 0 ? void 0 : options.itemSeparator) !== null && _d !== void 0 ? _d : ', ';
+        let partBuilder = (_e = options === null || options === void 0 ? void 0 : options.partBuilder) !== null && _e !== void 0 ? _e : ((x) => x.toString());
+        let parts = [];
+        let length = leadingText.length + ((_f = trailingText === null || trailingText === void 0 ? void 0 : trailingText.length) !== null && _f !== void 0 ? _f : 0);
+        //calculate the max number of items we could fit in the given space
+        for (let i = 0; i < items.length; i++) {
+            let part = partBuilder(items[i]);
+            if (i > 0) {
+                part = itemSeparator + part;
+            }
+            parts.push(part);
+            length += part.length;
+            //exit the loop if we've maxed out our length
+            if (length >= maxLength) {
+                break;
+            }
+        }
+        let message;
+        //we have enough space to include all the parts
+        if (parts.length >= items.length) {
+            message = leadingText + parts.join('') + trailingText;
+            //we require truncation
+        }
+        else {
+            //account for truncation message length including max possible "more" items digits, trailing text length, and the separator between last item and trailing text
+            length = leadingText.length + `...and ${items.length} more`.length + itemSeparator.length + ((_g = trailingText === null || trailingText === void 0 ? void 0 : trailingText.length) !== null && _g !== void 0 ? _g : 0);
+            message = leadingText;
+            for (let i = 0; i < parts.length; i++) {
+                //always include at least 2 items. if this part would overflow the max, then skip it and finalize the message
+                if (i > 1 && length + parts[i].length > maxLength) {
+                    message += itemSeparator + `...and ${items.length - i} more` + trailingText;
+                    return message;
+                }
+                else {
+                    message += parts[i];
+                    length += parts[i].length;
+                }
+            }
+        }
+        return message;
+    }
+    getAstNodeFriendlyName(node) {
+        return node === null || node === void 0 ? void 0 : node.kind.replace(/Statement|Expression/g, '');
+    }
 }
 exports.Util = Util;
 /**