typescript-to-lua 1.4.1 → 1.4.4

package/dist/CompilerOptions.d.ts

@@ -15,7 +15,7 @@ export interface LuaPluginImport {
     import?: string;
     [option: string]: any;
 }
-export declare type CompilerOptions = OmitIndexSignature<ts.CompilerOptions> & {
+export interface TypeScriptToLuaOptions {
     buildMode?: BuildMode;
     extension?: string;
     luaBundle?: string;
@@ -29,6 +29,9 @@ export declare type CompilerOptions = OmitIndexSignature<ts.CompilerOptions> & {
     plugins?: Array<ts.PluginImport | TransformerImport>;
     sourceMapTraceback?: boolean;
     tstlVerbose?: boolean;
+    lua51AllowTryCatchInAsyncAwait?: boolean;
+}
+export declare type CompilerOptions = OmitIndexSignature<ts.CompilerOptions> & TypeScriptToLuaOptions & {
     [option: string]: any;
 };
 export declare enum LuaLibImportKind {

package/dist/LuaAST.d.ts

@@ -65,12 +65,19 @@ export declare type Operator = UnaryOperator | BinaryOperator;
 export declare type SymbolId = number & {
     _symbolIdBrand: any;
 };
+export declare enum NodeFlags {
+    None = 0,
+    Inline = 1,
+    Declaration = 2,
+    TableUnpackCall = 4
+}
 export interface TextRange {
     line?: number;
     column?: number;
 }
 export interface Node extends TextRange {
     kind: SyntaxKind;
+    flags: NodeFlags;
 }
 export declare function createNode(kind: SyntaxKind, tsOriginal?: ts.Node): Node;
 export declare function cloneNode<T extends Node>(node: T): T;
@@ -78,6 +85,7 @@ export declare function setNodePosition<T extends Node>(node: T, position: TextR
 export declare function setNodeOriginal<T extends Node>(node: T, tsOriginal: ts.Node): T;
 export declare function setNodeOriginal<T extends Node>(node: T | undefined, tsOriginal: ts.Node): T | undefined;
 export declare function getOriginalPos(node: Node): TextRange;
+export declare function setNodeFlags<T extends Node>(node: T, flags: NodeFlags): T;
 export interface File extends Node {
     kind: SyntaxKind.File;
     statements: Statement[];
@@ -217,20 +225,14 @@ export interface StringLiteral extends Expression {
 export declare function isStringLiteral(node: Node): node is StringLiteral;
 export declare function createStringLiteral(value: string, tsOriginal?: ts.Node): StringLiteral;
 export declare function isLiteral(node: Node): node is NilLiteral | DotsLiteral | BooleanLiteral | NumericLiteral | StringLiteral;
-export declare enum FunctionExpressionFlags {
-    None = 1,
-    Inline = 2,
-    Declaration = 4
-}
 export interface FunctionExpression extends Expression {
     kind: SyntaxKind.FunctionExpression;
     params?: Identifier[];
     dots?: DotsLiteral;
     body: Block;
-    flags: FunctionExpressionFlags;
 }
 export declare function isFunctionExpression(node: Node): node is FunctionExpression;
-export declare function createFunctionExpression(body: Block, params?: Identifier[], dots?: DotsLiteral, flags?: FunctionExpressionFlags, tsOriginal?: ts.Node): FunctionExpression;
+export declare function createFunctionExpression(body: Block, params?: Identifier[], dots?: DotsLiteral, flags?: NodeFlags, tsOriginal?: ts.Node): FunctionExpression;
 export interface TableFieldExpression extends Expression {
     kind: SyntaxKind.TableFieldExpression;
     value: Expression;

package/dist/LuaAST.js

@@ -2,8 +2,8 @@
 // Simplified Lua AST based roughly on http://lua-users.org/wiki/MetaLuaAbstractSyntaxTree,
 // https://www.lua.org/manual/5.3/manual.html#9 and the TS AST implementation
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.isFunctionExpression = exports.FunctionExpressionFlags = exports.isLiteral = exports.createStringLiteral = exports.isStringLiteral = exports.createNumericLiteral = exports.isNumericLiteral = exports.createDotsLiteral = exports.isDotsLiteral = exports.createBooleanLiteral = exports.isBooleanLiteral = exports.createNilLiteral = exports.isNilLiteral = exports.createExpressionStatement = exports.isExpressionStatement = exports.createBreakStatement = exports.isBreakStatement = exports.createReturnStatement = exports.isReturnStatement = exports.createLabelStatement = exports.isLabelStatement = exports.createGotoStatement = exports.isGotoStatement = exports.createForInStatement = exports.isForInStatement = exports.createForStatement = exports.isForStatement = exports.createRepeatStatement = exports.isRepeatStatement = exports.createWhileStatement = exports.isWhileStatement = exports.isIterationStatement = exports.createIfStatement = exports.isIfStatement = exports.createAssignmentStatement = exports.isAssignmentStatement = exports.createVariableDeclarationStatement = exports.isVariableDeclarationStatement = exports.createDoStatement = exports.isDoStatement = exports.createBlock = exports.isBlock = exports.createFile = exports.isFile = exports.getOriginalPos = exports.setNodeOriginal = exports.setNodePosition = exports.cloneNode = exports.createNode = exports.SyntaxKind = void 0;
-exports.isInlineFunctionExpression = exports.isFunctionDefinition = exports.isAssignmentLeftHandSideExpression = exports.createTableIndexExpression = exports.isTableIndexExpression = exports.createAnonymousIdentifier = exports.cloneIdentifier = exports.createIdentifier = exports.isIdentifier = exports.createMethodCallExpression = exports.isMethodCallExpression = exports.createCallExpression = exports.isCallExpression = exports.createBinaryExpression = exports.isBinaryExpression = exports.createUnaryExpression = exports.isUnaryExpression = exports.createTableExpression = exports.isTableExpression = exports.createTableFieldExpression = exports.isTableFieldExpression = exports.createFunctionExpression = void 0;
+exports.isLiteral = exports.createStringLiteral = exports.isStringLiteral = exports.createNumericLiteral = exports.isNumericLiteral = exports.createDotsLiteral = exports.isDotsLiteral = exports.createBooleanLiteral = exports.isBooleanLiteral = exports.createNilLiteral = exports.isNilLiteral = exports.createExpressionStatement = exports.isExpressionStatement = exports.createBreakStatement = exports.isBreakStatement = exports.createReturnStatement = exports.isReturnStatement = exports.createLabelStatement = exports.isLabelStatement = exports.createGotoStatement = exports.isGotoStatement = exports.createForInStatement = exports.isForInStatement = exports.createForStatement = exports.isForStatement = exports.createRepeatStatement = exports.isRepeatStatement = exports.createWhileStatement = exports.isWhileStatement = exports.isIterationStatement = exports.createIfStatement = exports.isIfStatement = exports.createAssignmentStatement = exports.isAssignmentStatement = exports.createVariableDeclarationStatement = exports.isVariableDeclarationStatement = exports.createDoStatement = exports.isDoStatement = exports.createBlock = exports.isBlock = exports.createFile = exports.isFile = exports.setNodeFlags = exports.getOriginalPos = exports.setNodeOriginal = exports.setNodePosition = exports.cloneNode = exports.createNode = exports.NodeFlags = exports.SyntaxKind = void 0;
+exports.isInlineFunctionExpression = exports.isFunctionDefinition = exports.isAssignmentLeftHandSideExpression = exports.createTableIndexExpression = exports.isTableIndexExpression = exports.createAnonymousIdentifier = exports.cloneIdentifier = exports.createIdentifier = exports.isIdentifier = exports.createMethodCallExpression = exports.isMethodCallExpression = exports.createCallExpression = exports.isCallExpression = exports.createBinaryExpression = exports.isBinaryExpression = exports.createUnaryExpression = exports.isUnaryExpression = exports.createTableExpression = exports.isTableExpression = exports.createTableFieldExpression = exports.isTableFieldExpression = exports.createFunctionExpression = exports.isFunctionExpression = void 0;
 // We can elide a lot of nodes especially tokens and keywords
 // because we don't create the AST from text
 const ts = require("typescript");
@@ -77,16 +77,23 @@ var SyntaxKind;
     SyntaxKind[SyntaxKind["BitwiseLeftShiftOperator"] = 53] = "BitwiseLeftShiftOperator";
     SyntaxKind[SyntaxKind["BitwiseNotOperator"] = 54] = "BitwiseNotOperator";
 })(SyntaxKind = exports.SyntaxKind || (exports.SyntaxKind = {}));
+var NodeFlags;
+(function (NodeFlags) {
+    NodeFlags[NodeFlags["None"] = 0] = "None";
+    NodeFlags[NodeFlags["Inline"] = 1] = "Inline";
+    NodeFlags[NodeFlags["Declaration"] = 2] = "Declaration";
+    NodeFlags[NodeFlags["TableUnpackCall"] = 4] = "TableUnpackCall";
+})(NodeFlags = exports.NodeFlags || (exports.NodeFlags = {}));
 function createNode(kind, tsOriginal) {
     if (tsOriginal === undefined) {
-        return { kind };
+        return { kind, flags: NodeFlags.None };
     }
     const sourcePosition = getSourcePosition(tsOriginal);
     if (sourcePosition) {
-        return { kind, line: sourcePosition.line, column: sourcePosition.column };
+        return { kind, line: sourcePosition.line, column: sourcePosition.column, flags: NodeFlags.None };
     }
     else {
-        return { kind };
+        return { kind, flags: NodeFlags.None };
     }
 }
 exports.createNode = createNode;
@@ -124,6 +131,11 @@ function getOriginalPos(node) {
     return { line: node.line, column: node.column };
 }
 exports.getOriginalPos = getOriginalPos;
+function setNodeFlags(node, flags) {
+    node.flags = flags;
+    return node;
+}
+exports.setNodeFlags = setNodeFlags;
 function isFile(node) {
     return node.kind === SyntaxKind.File;
 }
@@ -346,17 +358,11 @@ function isLiteral(node) {
         isStringLiteral(node));
 }
 exports.isLiteral = isLiteral;
-var FunctionExpressionFlags;
-(function (FunctionExpressionFlags) {
-    FunctionExpressionFlags[FunctionExpressionFlags["None"] = 1] = "None";
-    FunctionExpressionFlags[FunctionExpressionFlags["Inline"] = 2] = "Inline";
-    FunctionExpressionFlags[FunctionExpressionFlags["Declaration"] = 4] = "Declaration";
-})(FunctionExpressionFlags = exports.FunctionExpressionFlags || (exports.FunctionExpressionFlags = {}));
 function isFunctionExpression(node) {
     return node.kind === SyntaxKind.FunctionExpression;
 }
 exports.isFunctionExpression = isFunctionExpression;
-function createFunctionExpression(body, params, dots, flags = FunctionExpressionFlags.None, tsOriginal) {
+function createFunctionExpression(body, params, dots, flags = NodeFlags.None, tsOriginal) {
     const expression = createNode(SyntaxKind.FunctionExpression, tsOriginal);
     expression.body = body;
     expression.params = params;
@@ -481,7 +487,7 @@ function isInlineFunctionExpression(expression) {
     return (((_a = expression.body.statements) === null || _a === void 0 ? void 0 : _a.length) === 1 &&
         isReturnStatement(expression.body.statements[0]) &&
         expression.body.statements[0].expressions !== undefined &&
-        (expression.flags & FunctionExpressionFlags.Inline) !== 0);
+        (expression.flags & NodeFlags.Inline) !== 0);
 }
 exports.isInlineFunctionExpression = isInlineFunctionExpression;
 //# sourceMappingURL=LuaAST.js.map

package/dist/LuaLib.d.ts

@@ -15,10 +15,10 @@ export declare enum LuaLibFeature {
     ArrayJoin = "ArrayJoin",
     ArrayMap = "ArrayMap",
     ArrayPush = "ArrayPush",
+    ArrayPushArray = "ArrayPushArray",
     ArrayReduce = "ArrayReduce",
     ArrayReduceRight = "ArrayReduceRight",
     ArrayReverse = "ArrayReverse",
-    ArrayShift = "ArrayShift",
     ArrayUnshift = "ArrayUnshift",
     ArraySort = "ArraySort",
     ArraySlice = "ArraySlice",
@@ -78,7 +78,6 @@ export declare enum LuaLibFeature {
     StringAccess = "StringAccess",
     StringCharAt = "StringCharAt",
     StringCharCodeAt = "StringCharCodeAt",
-    StringConcat = "StringConcat",
     StringEndsWith = "StringEndsWith",
     StringIncludes = "StringIncludes",
     StringPadEnd = "StringPadEnd",

package/dist/LuaLib.js

@@ -19,10 +19,10 @@ var LuaLibFeature;
     LuaLibFeature["ArrayJoin"] = "ArrayJoin";
     LuaLibFeature["ArrayMap"] = "ArrayMap";
     LuaLibFeature["ArrayPush"] = "ArrayPush";
+    LuaLibFeature["ArrayPushArray"] = "ArrayPushArray";
     LuaLibFeature["ArrayReduce"] = "ArrayReduce";
     LuaLibFeature["ArrayReduceRight"] = "ArrayReduceRight";
     LuaLibFeature["ArrayReverse"] = "ArrayReverse";
-    LuaLibFeature["ArrayShift"] = "ArrayShift";
     LuaLibFeature["ArrayUnshift"] = "ArrayUnshift";
     LuaLibFeature["ArraySort"] = "ArraySort";
     LuaLibFeature["ArraySlice"] = "ArraySlice";
@@ -82,7 +82,6 @@ var LuaLibFeature;
     LuaLibFeature["StringAccess"] = "StringAccess";
     LuaLibFeature["StringCharAt"] = "StringCharAt";
     LuaLibFeature["StringCharCodeAt"] = "StringCharCodeAt";
-    LuaLibFeature["StringConcat"] = "StringConcat";
     LuaLibFeature["StringEndsWith"] = "StringEndsWith";
     LuaLibFeature["StringIncludes"] = "StringIncludes";
     LuaLibFeature["StringPadEnd"] = "StringPadEnd";

package/dist/LuaPrinter.js

@@ -291,8 +291,7 @@ class LuaPrinter {
     printVariableAssignmentStatement(statement) {
         const chunks = [];
         chunks.push(this.indent());
-        if (lua.isFunctionDefinition(statement) &&
-            (statement.right[0].flags & lua.FunctionExpressionFlags.Declaration) !== 0) {
+        if (lua.isFunctionDefinition(statement) && (statement.right[0].flags & lua.NodeFlags.Declaration) !== 0) {
             // Use `function foo()` instead of `foo = function()`
             const name = this.printExpression(statement.left[0]);
             if (isValidLuaFunctionDeclarationName(name.toString(), this.options)) {

package/dist/cli/parse.js

@@ -69,6 +69,11 @@ exports.optionDeclarations = [
         description: "An array of paths that tstl should not resolve and keep as-is.",
         type: "array",
     },
+    {
+        name: "lua51AllowTryCatchInAsyncAwait",
+        description: "Always allow try/catch in async/await functions for Lua 5.1.",
+        type: "boolean",
+    },
 ];
 function updateParsedConfigFile(parsedConfigFile) {
     let hasRootLevelOptions = false;

package/dist/lualib/ArrayConcat.lua

@@ -1,18 +1,22 @@
-local function __TS__ArrayConcat(arr1, ...)
-    local args = {...}
-    local out = {}
-    for ____, val in ipairs(arr1) do
-        out[#out + 1] = val
+local function __TS__ArrayConcat(self, ...)
+    local items = {...}
+    local result = {}
+    local len = 0
+    for i = 1, #self do
+        len = len + 1
+        result[len] = self[i]
     end
-    for ____, arg in ipairs(args) do
-        if __TS__ArrayIsArray(arg) then
-            local argAsArray = arg
-            for ____, val in ipairs(argAsArray) do
-                out[#out + 1] = val
+    for i = 1, #items do
+        local item = items[i]
+        if __TS__ArrayIsArray(item) then
+            for j = 1, #item do
+                len = len + 1
+                result[len] = item[j]
             end
         else
-            out[#out + 1] = arg
+            len = len + 1
+            result[len] = item
         end
     end
-    return out
+    return result
 end

package/dist/lualib/ArrayEvery.lua

@@ -1,11 +1,7 @@
-local function __TS__ArrayEvery(arr, callbackfn)
-    do
-        local i = 0
-        while i < #arr do
-            if not callbackfn(nil, arr[i + 1], i, arr) then
-                return false
-            end
-            i = i + 1
+local function __TS__ArrayEvery(self, callbackfn, thisArg)
+    for i = 1, #self do
+        if not callbackfn(thisArg, self[i], i - 1, self) then
+            return false
         end
     end
     return true

package/dist/lualib/ArrayFilter.lua

@@ -1,12 +1,10 @@
-local function __TS__ArrayFilter(arr, callbackfn)
+local function __TS__ArrayFilter(self, callbackfn, thisArg)
     local result = {}
-    do
-        local i = 0
-        while i < #arr do
-            if callbackfn(nil, arr[i + 1], i, arr) then
-                result[#result + 1] = arr[i + 1]
-            end
-            i = i + 1
+    local len = 0
+    for i = 1, #self do
+        if callbackfn(thisArg, self[i], i - 1, self) then
+            len = len + 1
+            result[len] = self[i]
         end
     end
     return result

package/dist/lualib/ArrayFind.lua

@@ -1,12 +1,9 @@
-local function __TS__ArrayFind(arr, predicate)
-    local len = #arr
-    local k = 0
-    while k < len do
-        local elem = arr[k + 1]
-        if predicate(nil, elem, k, arr) then
+local function __TS__ArrayFind(self, predicate, thisArg)
+    for i = 1, #self do
+        local elem = self[i]
+        if predicate(thisArg, elem, i - 1, self) then
             return elem
         end
-        k = k + 1
     end
     return nil
 end

package/dist/lualib/ArrayFindIndex.lua

@@ -1,12 +1,7 @@
-local function __TS__ArrayFindIndex(arr, callbackFn)
-    do
-        local i = 0
-        local len = #arr
-        while i < len do
-            if callbackFn(nil, arr[i + 1], i, arr) then
-                return i
-            end
-            i = i + 1
+local function __TS__ArrayFindIndex(self, callbackFn, thisArg)
+    for i = 1, #self do
+        if callbackFn(thisArg, self[i], i - 1, self) then
+            return i - 1
         end
     end
     return -1

package/dist/lualib/ArrayFlat.lua

@@ -1,16 +1,26 @@
-local function __TS__ArrayFlat(array, depth)
+local function __TS__ArrayFlat(self, depth)
     if depth == nil then
         depth = 1
     end
     local result = {}
-    for ____, value in ipairs(array) do
+    local len = 0
+    for i = 1, #self do
+        local value = self[i]
         if depth > 0 and __TS__ArrayIsArray(value) then
-            result = __TS__ArrayConcat(
-                result,
-                __TS__ArrayFlat(value, depth - 1)
-            )
+            local toAdd
+            if depth == 1 then
+                toAdd = value
+            else
+                toAdd = __TS__ArrayFlat(value, depth - 1)
+            end
+            for j = 1, #toAdd do
+                local val = toAdd[j]
+                len = len + 1
+                result[len] = val
+            end
         else
-            result[#result + 1] = value
+            len = len + 1
+            result[len] = value
         end
     end
     return result

package/dist/lualib/ArrayFlatMap.lua

@@ -1,15 +1,16 @@
-local function __TS__ArrayFlatMap(array, callback)
+local function __TS__ArrayFlatMap(self, callback, thisArg)
     local result = {}
-    do
-        local i = 0
-        while i < #array do
-            local value = callback(nil, array[i + 1], i, array)
-            if type(value) == "table" and __TS__ArrayIsArray(value) then
-                result = __TS__ArrayConcat(result, value)
-            else
-                result[#result + 1] = value
+    local len = 0
+    for i = 1, #self do
+        local value = callback(thisArg, self[i], i - 1, self)
+        if __TS__ArrayIsArray(value) then
+            for j = 1, #value do
+                len = len + 1
+                result[len] = value[j]
             end
-            i = i + 1
+        else
+            len = len + 1
+            result[len] = value
         end
     end
     return result

package/dist/lualib/ArrayForEach.lua

@@ -1,9 +1,5 @@
-local function __TS__ArrayForEach(arr, callbackFn)
-    do
-        local i = 0
-        while i < #arr do
-            callbackFn(nil, arr[i + 1], i, arr)
-            i = i + 1
-        end
+local function __TS__ArrayForEach(self, callbackFn, thisArg)
+    for i = 1, #self do
+        callbackFn(thisArg, self[i], i - 1, self)
     end
 end

package/dist/lualib/ArrayFrom.lua

@@ -17,14 +17,11 @@ do
         local result = {}
         if mapFn == nil then
             for ____, v in arrayLikeIterator(arrayLike) do
-                __TS__ArrayPush(result, v)
+                result[#result + 1] = v
             end
         else
             for i, v in arrayLikeIterator(arrayLike) do
-                __TS__ArrayPush(
-                    result,
-                    mapFn(thisArg, v, i - 1)
-                )
+                result[#result + 1] = mapFn(thisArg, v, i - 1)
             end
         end
         return result

package/dist/lualib/ArrayIncludes.lua

@@ -10,8 +10,8 @@ local function __TS__ArrayIncludes(self, searchElement, fromIndex)
     if k < 0 then
         k = 0
     end
-    for i = k, len do
-        if self[i + 1] == searchElement then
+    for i = k + 1, len do
+        if self[i] == searchElement then
             return true
         end
     end

package/dist/lualib/ArrayIndexOf.lua

@@ -1,31 +1,23 @@
-local function __TS__ArrayIndexOf(arr, searchElement, fromIndex)
-    local len = #arr
+local function __TS__ArrayIndexOf(self, searchElement, fromIndex)
+    if fromIndex == nil then
+        fromIndex = 0
+    end
+    local len = #self
     if len == 0 then
         return -1
     end
-    local n = 0
-    if fromIndex then
-        n = fromIndex
-    end
-    if n >= len then
+    if fromIndex >= len then
         return -1
     end
-    local k
-    if n >= 0 then
-        k = n
-    else
-        k = len + n
-        if k < 0 then
-            k = 0
+    if fromIndex < 0 then
+        fromIndex = len + fromIndex
+        if fromIndex < 0 then
+            fromIndex = 0
         end
     end
-    do
-        local i = k
-        while i < len do
-            if arr[i + 1] == searchElement then
-                return i
-            end
-            i = i + 1
+    for i = fromIndex + 1, len do
+        if self[i] == searchElement then
+            return i - 1
         end
     end
     return -1

package/dist/lualib/ArrayIsArray.lua

@@ -1,3 +1,3 @@
 local function __TS__ArrayIsArray(value)
-    return type(value) == "table" and (value[1] ~= nil or next(value, nil) == nil)
+    return type(value) == "table" and (value[1] ~= nil or next(value) == nil)
 end

package/dist/lualib/ArrayJoin.lua

@@ -2,12 +2,9 @@ local function __TS__ArrayJoin(self, separator)
     if separator == nil then
         separator = ","
     end
-    local result = ""
-    for index, value in ipairs(self) do
-        if index > 1 then
-            result = result .. separator
-        end
-        result = result .. tostring(value)
+    local parts = {}
+    for i = 1, #self do
+        parts[i] = tostring(self[i])
     end
-    return result
+    return table.concat(parts, separator)
 end

package/dist/lualib/ArrayMap.lua

@@ -1,11 +1,7 @@
-local function __TS__ArrayMap(arr, callbackfn)
-    local newArray = {}
-    do
-        local i = 0
-        while i < #arr do
-            newArray[i + 1] = callbackfn(nil, arr[i + 1], i, arr)
-            i = i + 1
-        end
+local function __TS__ArrayMap(self, callbackfn, thisArg)
+    local result = {}
+    for i = 1, #self do
+        result[i] = callbackfn(thisArg, self[i], i - 1, self)
     end
-    return newArray
+    return result
 end

package/dist/lualib/ArrayPush.lua

@@ -1,7 +1,9 @@
-local function __TS__ArrayPush(arr, ...)
+local function __TS__ArrayPush(self, ...)
     local items = {...}
-    for ____, item in ipairs(items) do
-        arr[#arr + 1] = item
+    local len = #self
+    for i = 1, #items do
+        len = len + 1
+        self[len] = items[i]
     end
-    return #arr
+    return len
 end

package/dist/lualib/ArrayPushArray.lua

@@ -0,0 +1,8 @@
+local function __TS__ArrayPushArray(self, items)
+    local len = #self
+    for i = 1, #items do
+        len = len + 1
+        self[len] = items[i]
+    end
+    return len
+end

package/dist/lualib/ArrayReduce.lua

@@ -1,22 +1,22 @@
-local function __TS__ArrayReduce(arr, callbackFn, ...)
-    local len = #arr
+local function __TS__ArrayReduce(self, callbackFn, ...)
+    local len = #self
     local k = 0
     local accumulator = nil
     if select("#", ...) ~= 0 then
-        accumulator = select(1, ...)
+        accumulator = ...
     elseif len > 0 then
-        accumulator = arr[1]
+        accumulator = self[1]
         k = 1
     else
         error("Reduce of empty array with no initial value", 0)
     end
-    for i = k, len - 1 do
+    for i = k + 1, len do
         accumulator = callbackFn(
             nil,
             accumulator,
-            arr[i + 1],
-            i,
-            arr
+            self[i],
+            i - 1,
+            self
         )
     end
     return accumulator

package/dist/lualib/ArrayReduceRight.lua

@@ -1,22 +1,22 @@
-local function __TS__ArrayReduceRight(arr, callbackFn, ...)
-    local len = #arr
+local function __TS__ArrayReduceRight(self, callbackFn, ...)
+    local len = #self
     local k = len - 1
     local accumulator = nil
     if select("#", ...) ~= 0 then
-        accumulator = select(1, ...)
+        accumulator = ...
     elseif len > 0 then
-        accumulator = arr[k + 1]
+        accumulator = self[k + 1]
         k = k - 1
     else
         error("Reduce of empty array with no initial value", 0)
     end
-    for i = k, 0, -1 do
+    for i = k + 1, 1, -1 do
         accumulator = callbackFn(
             nil,
             accumulator,
-            arr[i + 1],
-            i,
-            arr
+            self[i],
+            i - 1,
+            self
         )
     end
     return accumulator

package/dist/lualib/ArrayReverse.lua

@@ -1,12 +1,12 @@
-local function __TS__ArrayReverse(arr)
-    local i = 0
-    local j = #arr - 1
+local function __TS__ArrayReverse(self)
+    local i = 1
+    local j = #self
     while i < j do
-        local temp = arr[j + 1]
-        arr[j + 1] = arr[i + 1]
-        arr[i + 1] = temp
+        local temp = self[j]
+        self[j] = self[i]
+        self[i] = temp
         i = i + 1
         j = j - 1
     end
-    return arr
+    return self
 end

package/dist/lualib/ArraySetLength.lua

@@ -1,16 +1,12 @@
-local function __TS__ArraySetLength(arr, length)
+local function __TS__ArraySetLength(self, length)
     if length < 0 or length ~= length or length == math.huge or math.floor(length) ~= length then
         error(
             "invalid array length: " .. tostring(length),
             0
         )
     end
-    do
-        local i = #arr - 1
-        while i >= length do
-            arr[i + 1] = nil
-            i = i - 1
-        end
+    for i = length + 1, #self do
+        self[i] = nil
     end
     return length
 end