typescript-to-lua 1.4.1 → 1.4.4

package/dist/lualib/ArraySlice.lua

@@ -1,27 +1,34 @@
-local function __TS__ArraySlice(list, first, last)
-    local len = #list
-    local relativeStart = first or 0
-    local k
-    if relativeStart < 0 then
-        k = math.max(len + relativeStart, 0)
+local function __TS__ArraySlice(self, first, last)
+    local len = #self
+    first = first or 0
+    if first < 0 then
+        first = len + first
+        if first < 0 then
+            first = 0
+        end
     else
-        k = math.min(relativeStart, len)
+        if first > len then
+            first = len
+        end
     end
-    local relativeEnd = last
-    if last == nil then
-        relativeEnd = len
-    end
-    local final
-    if relativeEnd < 0 then
-        final = math.max(len + relativeEnd, 0)
+    last = last or len
+    if last < 0 then
+        last = len + last
+        if last < 0 then
+            last = 0
+        end
     else
-        final = math.min(relativeEnd, len)
+        if last > len then
+            last = len
+        end
     end
     local out = {}
-    local n = 0
-    while k < final do
-        out[n + 1] = list[k + 1]
-        k = k + 1
+    first = first + 1
+    last = last + 1
+    local n = 1
+    while first < last do
+        out[n] = self[first]
+        first = first + 1
         n = n + 1
     end
     return out

package/dist/lualib/ArraySome.lua

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

package/dist/lualib/ArraySort.lua

@@ -1,11 +1,11 @@
-local function __TS__ArraySort(arr, compareFn)
+local function __TS__ArraySort(self, compareFn)
     if compareFn ~= nil then
         table.sort(
-            arr,
+            self,
             function(a, b) return compareFn(nil, a, b) < 0 end
         )
     else
-        table.sort(arr)
+        table.sort(self)
     end
-    return arr
+    return self
 end

package/dist/lualib/ArraySplice.lua

@@ -1,84 +1,73 @@
-local function __TS__ArraySplice(list, ...)
-    local len = #list
+local function __TS__ArraySplice(self, ...)
+    local args = {...}
+    local len = #self
     local actualArgumentCount = select("#", ...)
-    local start = select(1, ...)
-    local deleteCount = select(2, ...)
-    local actualStart
+    local start = args[1]
+    local deleteCount = args[2]
     if start < 0 then
-        actualStart = math.max(len + start, 0)
-    else
-        actualStart = math.min(start, len)
+        start = len + start
+        if start < 0 then
+            start = 0
+        end
+    elseif start > len then
+        start = len
+    end
+    local itemCount = actualArgumentCount - 2
+    if itemCount < 0 then
+        itemCount = 0
     end
-    local itemCount = math.max(actualArgumentCount - 2, 0)
     local actualDeleteCount
     if actualArgumentCount == 0 then
         actualDeleteCount = 0
     elseif actualArgumentCount == 1 then
-        actualDeleteCount = len - actualStart
+        actualDeleteCount = len - start
     else
-        actualDeleteCount = math.min(
-            math.max(deleteCount or 0, 0),
-            len - actualStart
-        )
+        actualDeleteCount = deleteCount or 0
+        if actualDeleteCount < 0 then
+            actualDeleteCount = 0
+        end
+        if actualDeleteCount > len - start then
+            actualDeleteCount = len - start
+        end
     end
     local out = {}
-    do
-        local k = 0
-        while k < actualDeleteCount do
-            local from = actualStart + k
-            if list[from + 1] then
-                out[k + 1] = list[from + 1]
-            end
-            k = k + 1
+    for k = 1, actualDeleteCount do
+        local from = start + k
+        if self[from] ~= nil then
+            out[k] = self[from]
         end
     end
     if itemCount < actualDeleteCount then
-        do
-            local k = actualStart
-            while k < len - actualDeleteCount do
-                local from = k + actualDeleteCount
-                local to = k + itemCount
-                if list[from + 1] then
-                    list[to + 1] = list[from + 1]
-                else
-                    list[to + 1] = nil
-                end
-                k = k + 1
+        for k = start + 1, len - actualDeleteCount do
+            local from = k + actualDeleteCount
+            local to = k + itemCount
+            if self[from] then
+                self[to] = self[from]
+            else
+                self[to] = nil
             end
         end
-        do
-            local k = len
-            while k > len - actualDeleteCount + itemCount do
-                list[k] = nil
-                k = k - 1
-            end
+        for k = len - actualDeleteCount + itemCount + 1, len do
+            self[k] = nil
         end
     elseif itemCount > actualDeleteCount then
-        do
-            local k = len - actualDeleteCount
-            while k > actualStart do
-                local from = k + actualDeleteCount - 1
-                local to = k + itemCount - 1
-                if list[from + 1] then
-                    list[to + 1] = list[from + 1]
-                else
-                    list[to + 1] = nil
-                end
-                k = k - 1
+        for k = len - actualDeleteCount, start + 1, -1 do
+            local from = k + actualDeleteCount
+            local to = k + itemCount
+            if self[from] then
+                self[to] = self[from]
+            else
+                self[to] = nil
             end
         end
     end
-    local j = actualStart
+    local j = start + 1
     for i = 3, actualArgumentCount do
-        list[j + 1] = select(i, ...)
+        self[j] = args[i]
         j = j + 1
     end
-    do
-        local k = #list - 1
-        while k >= len - actualDeleteCount + itemCount do
-            list[k + 1] = nil
-            k = k - 1
-        end
+    for k = #self, len - actualDeleteCount + itemCount + 1, -1 do
+        self[k] = nil
     end
     return out
 end

package/dist/lualib/ArrayToObject.lua

@@ -1,11 +1,7 @@
-local function __TS__ArrayToObject(array)
+local function __TS__ArrayToObject(self)
     local object = {}
-    do
-        local i = 0
-        while i < #array do
-            object[i] = array[i + 1]
-            i = i + 1
-        end
+    for i = 1, #self do
+        object[i - 1] = self[i]
     end
     return object
 end

package/dist/lualib/ArrayUnshift.lua

@@ -1,11 +1,14 @@
-local function __TS__ArrayUnshift(arr, ...)
+local function __TS__ArrayUnshift(self, ...)
     local items = {...}
-    do
-        local i = #items - 1
-        while i >= 0 do
-            table.insert(arr, 1, items[i + 1])
-            i = i - 1
-        end
+    local numItemsToInsert = #items
+    if numItemsToInsert == 0 then
+        return #self
     end
-    return #arr
+    for i = #self, 1, -1 do
+        self[i + numItemsToInsert] = self[i]
+    end
+    for i = 1, numItemsToInsert do
+        self[i] = items[i]
+    end
+    return #self
 end

package/dist/lualib/FunctionBind.lua

@@ -1,17 +1,11 @@
-local function __TS__FunctionBind(fn, thisArg, ...)
+local function __TS__FunctionBind(fn, ...)
     local boundArgs = {...}
     return function(____, ...)
         local args = {...}
-        do
-            local i = 0
-            while i < #boundArgs do
-                table.insert(args, i + 1, boundArgs[i + 1])
-                i = i + 1
-            end
-        end
-        return fn(
-            thisArg,
-            __TS__Unpack(args)
+        __TS__ArrayUnshift(
+            args,
+            __TS__Unpack(boundArgs)
         )
+        return fn(__TS__Unpack(args))
     end
 end

package/dist/lualib/ObjectAssign.lua

@@ -1,12 +1,10 @@
-local function __TS__ObjectAssign(to, ...)
+local function __TS__ObjectAssign(target, ...)
     local sources = {...}
-    if to == nil then
-        return to
-    end
-    for ____, source in ipairs(sources) do
+    for i = 1, #sources do
+        local source = sources[i]
         for key in pairs(source) do
-            to[key] = source[key]
+            target[key] = source[key]
         end
     end
-    return to
+    return target
 end

package/dist/lualib/ObjectEntries.lua

@@ -1,7 +1,9 @@
 local function __TS__ObjectEntries(obj)
     local result = {}
+    local len = 0
     for key in pairs(obj) do
-        result[#result + 1] = {key, obj[key]}
+        len = len + 1
+        result[len] = {key, obj[key]}
     end
     return result
 end

package/dist/lualib/ObjectKeys.lua

@@ -1,7 +1,9 @@
 local function __TS__ObjectKeys(obj)
     local result = {}
+    local len = 0
     for key in pairs(obj) do
-        result[#result + 1] = key
+        len = len + 1
+        result[len] = key
     end
     return result
 end

package/dist/lualib/ObjectValues.lua

@@ -1,7 +1,9 @@
 local function __TS__ObjectValues(obj)
     local result = {}
+    local len = 0
     for key in pairs(obj) do
-        result[#result + 1] = obj[key]
+        len = len + 1
+        result[len] = obj[key]
     end
     return result
 end

package/dist/lualib/Promise.lua

@@ -67,19 +67,19 @@ do
         local isRejected = self.state == 2
         if onFulfilled then
             local internalCallback = self:createPromiseResolvingCallback(onFulfilled, resolve, reject)
-            __TS__ArrayPush(self.fulfilledCallbacks, internalCallback)
+            local ____self_fulfilledCallbacks_1 = self.fulfilledCallbacks
+            ____self_fulfilledCallbacks_1[#____self_fulfilledCallbacks_1 + 1] = internalCallback
             if isFulfilled then
                 internalCallback(nil, self.value)
             end
         else
-            __TS__ArrayPush(
-                self.fulfilledCallbacks,
-                function() return resolve(nil, nil) end
-            )
+            local ____self_fulfilledCallbacks_2 = self.fulfilledCallbacks
+            ____self_fulfilledCallbacks_2[#____self_fulfilledCallbacks_2 + 1] = function() return resolve(nil, nil) end
         end
         if onRejected then
             local internalCallback = self:createPromiseResolvingCallback(onRejected, resolve, reject)
-            __TS__ArrayPush(self.rejectedCallbacks, internalCallback)
+            local ____self_rejectedCallbacks_3 = self.rejectedCallbacks
+            ____self_rejectedCallbacks_3[#____self_rejectedCallbacks_3 + 1] = internalCallback
             if isRejected then
                 internalCallback(nil, self.rejectionReason)
             end
@@ -97,7 +97,8 @@ do
     end
     function __TS__Promise.prototype.finally(self, onFinally)
         if onFinally then
-            __TS__ArrayPush(self.finallyCallbacks, onFinally)
+            local ____self_finallyCallbacks_4 = self.finallyCallbacks
+            ____self_finallyCallbacks_4[#____self_finallyCallbacks_4 + 1] = onFinally
             if self.state ~= 0 then
                 onFinally(nil)
             end

package/dist/lualib/PromiseAny.lua

@@ -6,9 +6,9 @@ local function __TS__PromiseAny(iterable)
             if item.state == 1 then
                 return __TS__Promise.resolve(item.value)
             elseif item.state == 2 then
-                __TS__ArrayPush(rejections, item.rejectionReason)
+                rejections[#rejections + 1] = item.rejectionReason
             else
-                __TS__ArrayPush(pending, item)
+                pending[#pending + 1] = item
             end
         else
             return __TS__Promise.resolve(item)
@@ -28,7 +28,7 @@ local function __TS__PromiseAny(iterable)
                         resolve(nil, data)
                     end,
                     function(____, reason)
-                        __TS__ArrayPush(rejections, reason)
+                        rejections[#rejections + 1] = reason
                         numResolved = numResolved + 1
                         if numResolved == #pending then
                             reject(nil, {name = "AggregateError", message = "All Promises rejected", errors = rejections})

package/dist/lualib/PromiseRace.lua

@@ -7,7 +7,7 @@ local function __TS__PromiseRace(iterable)
             elseif item.state == 2 then
                 return __TS__Promise.reject(item.rejectionReason)
             else
-                __TS__ArrayPush(pending, item)
+                pending[#pending + 1] = item
             end
         else
             return __TS__Promise.resolve(item)

package/dist/lualib/SourceMapTraceBack.lua

@@ -30,10 +30,23 @@ local function __TS__SourceMapTraceBack(fileName, sourceMap)
                 "(%S+)%.lua:(%d+)",
                 function(file, line) return replacer(nil, file .. ".lua", file .. ".ts", line) end
             )
+            local function stringReplacer(____, file, line)
+                local fileSourceMap = _G.__TS__sourcemap[file]
+                if fileSourceMap and fileSourceMap[line] then
+                    local chunkName = string.match(file, "%[string \"([^\"]+)\"%]")
+                    local sourceName = string.gsub(chunkName, ".lua$", ".ts")
+                    local data = fileSourceMap[line]
+                    if type(data) == "number" then
+                        return (sourceName .. ":") .. tostring(data)
+                    end
+                    return (tostring(data.file) .. ":") .. tostring(data.line)
+                end
+                return (file .. ":") .. line
+            end
             result = string.gsub(
                 result,
                 "(%[string \"[^\"]+\"%]):(%d+)",
-                function(file, line) return replacer(nil, file, "unknown", line) end
+                function(file, line) return stringReplacer(nil, file, line) end
             )
             return result
         end

package/dist/lualib/Spread.lua

@@ -1,16 +1,14 @@
 local function __TS__Spread(iterable)
     local arr = {}
     if type(iterable) == "string" then
-        do
-            local i = 0
-            while i < #iterable do
-                arr[#arr + 1] = __TS__StringAccess(iterable, i)
-                i = i + 1
-            end
+        for i = 0, #iterable - 1 do
+            arr[i + 1] = __TS__StringAccess(iterable, i)
         end
     else
+        local len = 0
         for ____, item in __TS__Iterator(iterable) do
-            arr[#arr + 1] = item
+            len = len + 1
+            arr[len] = item
         end
     end
     return __TS__Unpack(arr)

package/dist/lualib/StringReplace.lua

@@ -1,17 +1,20 @@
-local function __TS__StringReplace(source, searchValue, replaceValue)
-    local startPos, endPos = string.find(source, searchValue, nil, true)
-    if not startPos then
-        return source
-    end
+local __TS__StringReplace
+do
     local sub = string.sub
-    local before = sub(source, 1, startPos - 1)
-    local ____temp_0
-    if type(replaceValue) == "string" then
-        ____temp_0 = replaceValue
-    else
-        ____temp_0 = replaceValue(nil, searchValue, startPos - 1, source)
+    function __TS__StringReplace(source, searchValue, replaceValue)
+        local startPos, endPos = string.find(source, searchValue, nil, true)
+        if not startPos then
+            return source
+        end
+        local before = sub(source, 1, startPos - 1)
+        local ____temp_0
+        if type(replaceValue) == "string" then
+            ____temp_0 = replaceValue
+        else
+            ____temp_0 = replaceValue(nil, searchValue, startPos - 1, source)
+        end
+        local replacement = ____temp_0
+        local after = sub(source, endPos + 1)
+        return (before .. replacement) .. after
     end
-    local replacement = ____temp_0
-    local after = sub(source, endPos + 1)
-    return (before .. replacement) .. after
 end

package/dist/lualib/StringReplaceAll.lua

@@ -1,35 +1,42 @@
-local function __TS__StringReplaceAll(source, searchValue, replaceValue)
-    local replacer
-    if type(replaceValue) == "string" then
-        replacer = function() return replaceValue end
-    else
-        replacer = replaceValue
-    end
-    local parts = {}
-    local partsIndex = 1
+local __TS__StringReplaceAll
+do
     local sub = string.sub
-    if #searchValue == 0 then
-        parts[1] = replacer(nil, "", 0, source)
-        partsIndex = 2
-        for i = 1, #source do
-            parts[partsIndex] = sub(source, i, i)
-            parts[partsIndex + 1] = replacer(nil, "", i, source)
-            partsIndex = partsIndex + 2
+    local find = string.find
+    function __TS__StringReplaceAll(source, searchValue, replaceValue)
+        if type(replaceValue) == "string" then
+            local concat = table.concat(
+                __TS__StringSplit(source, searchValue),
+                replaceValue
+            )
+            if #searchValue == 0 then
+                return (replaceValue .. concat) .. replaceValue
+            end
+            return concat
         end
-    else
-        local find = string.find
-        local currentPos = 1
-        while true do
-            local startPos, endPos = find(source, searchValue, currentPos, true)
-            if not startPos then
-                break
+        local parts = {}
+        local partsIndex = 1
+        if #searchValue == 0 then
+            parts[1] = replaceValue(nil, "", 0, source)
+            partsIndex = 2
+            for i = 1, #source do
+                parts[partsIndex] = sub(source, i, i)
+                parts[partsIndex + 1] = replaceValue(nil, "", i, source)
+                partsIndex = partsIndex + 2
+            end
+        else
+            local currentPos = 1
+            while true do
+                local startPos, endPos = find(source, searchValue, currentPos, true)
+                if not startPos then
+                    break
+                end
+                parts[partsIndex] = sub(source, currentPos, startPos - 1)
+                parts[partsIndex + 1] = replaceValue(nil, searchValue, startPos - 1, source)
+                partsIndex = partsIndex + 2
+                currentPos = endPos + 1
             end
-            parts[partsIndex] = sub(source, currentPos, startPos - 1)
-            parts[partsIndex + 1] = replacer(nil, searchValue, startPos - 1, source)
-            partsIndex = partsIndex + 2
-            currentPos = endPos + 1
+            parts[partsIndex] = sub(source, currentPos)
         end
-        parts[partsIndex] = sub(source, currentPos)
+        return table.concat(parts)
     end
-    return table.concat(parts)
 end

package/dist/lualib/StringSplit.lua

@@ -1,36 +1,36 @@
-local function __TS__StringSplit(source, separator, limit)
-    if limit == nil then
-        limit = 4294967295
-    end
-    if limit == 0 then
-        return {}
-    end
-    local out = {}
-    local index = 0
-    local count = 0
-    if separator == nil or separator == "" then
-        while index < #source - 1 and count < limit do
-            out[count + 1] = __TS__StringAccess(source, index)
-            count = count + 1
-            index = index + 1
+local __TS__StringSplit
+do
+    local sub = string.sub
+    local find = string.find
+    function __TS__StringSplit(source, separator, limit)
+        if limit == nil then
+            limit = 4294967295
         end
-    else
-        local separatorLength = #separator
-        local nextIndex = (string.find(source, separator, nil, true) or 0) - 1
-        while nextIndex >= 0 and count < limit do
-            out[count + 1] = __TS__StringSubstring(source, index, nextIndex)
-            count = count + 1
-            index = nextIndex + separatorLength
-            nextIndex = (string.find(
-                source,
-                separator,
-                math.max(index + 1, 1),
-                true
-            ) or 0) - 1
+        if limit == 0 then
+            return {}
         end
+        local result = {}
+        local resultIndex = 1
+        if separator == nil or separator == "" then
+            for i = 1, #source do
+                result[resultIndex] = sub(source, i, i)
+                resultIndex = resultIndex + 1
+            end
+        else
+            local currentPos = 1
+            while resultIndex <= limit do
+                local startPos, endPos = find(source, separator, currentPos, true)
+                if not startPos then
+                    break
+                end
+                result[resultIndex] = sub(source, currentPos, startPos - 1)
+                resultIndex = resultIndex + 1
+                currentPos = endPos + 1
+            end
+            if resultIndex <= limit then
+                result[resultIndex] = sub(source, currentPos)
+            end
+        end
+        return result
     end
-    if count < limit then
-        out[count + 1] = __TS__StringSubstring(source, index)
-    end
-    return out
 end