isaacscript-common 1.2.255 → 1.2.258

package/dist/lualib_bundle.lua

@@ -1,24 +1,28 @@
 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
 
-local function __TS__ArrayConcat(arr1, ...)
-    local args = {...}
-    local out = {}
-    for ____, val in ipairs(arr1) do
-        out[#out + 1] = val
-    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
+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 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
 
 local __TS__Symbol, Symbol
@@ -51,78 +55,52 @@ local function __TS__ArrayEntries(array)
     }
 end
 
-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
 end
 
-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
 end
 
-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
 
-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
 
-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
 end
 
-local function __TS__ArrayPush(arr, ...)
-    local items = {...}
-    for ____, item in ipairs(items) do
-        arr[#arr + 1] = item
-    end
-    return #arr
-end
-
 local __TS__Iterator
 do
     local function iteratorGeneratorStep(self)
@@ -183,14 +161,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
@@ -209,42 +184,34 @@ 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
     return false
 end
 
-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
@@ -254,304 +221,310 @@ 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 table.concat(parts, separator)
+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 result
 end
 
-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__ArrayPush(self, ...)
+    local items = {...}
+    local len = #self
+    for i = 1, #items do
+        len = len + 1
+        self[len] = items[i]
     end
-    return newArray
+    return len
 end
 
-local function __TS__ArrayReduce(arr, callbackFn, ...)
-    local len = #arr
+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
+
+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
 end
 
-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
 end
 
-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
 
-local function __TS__ArrayShift(arr)
-    return table.remove(arr, 1)
-end
-
-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
+    for i = #self, 1, -1 do
+        self[i + numItemsToInsert] = self[i]
+    end
+    for i = 1, numItemsToInsert do
+        self[i] = items[i]
     end
-    return #arr
+    return #self
 end
 
-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
 
-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)
-    end
-    local relativeEnd = last
-    if last == nil then
-        relativeEnd = len
+        if first > len then
+            first = len
+        end
     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
 end
 
-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
 end
 
-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
 
-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
 
-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
 end
 
-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
 end
 
-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
@@ -590,21 +563,15 @@ end
 
 local __TS__Unpack = table.unpack or unpack
 
-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
 
@@ -677,19 +644,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
@@ -707,7 +674,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
@@ -903,17 +871,15 @@ local function __TS__CloneDescriptor(____bindingPattern0)
     return descriptor
 end
 
-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
 
 local function __TS__ObjectGetOwnPropertyDescriptor(object, key)
@@ -1528,8 +1494,10 @@ end
 
 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
@@ -1557,8 +1525,10 @@ end
 
 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
@@ -1575,8 +1545,10 @@ end
 
 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
@@ -1776,9 +1748,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)
@@ -1798,7 +1770,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})
@@ -1819,7 +1791,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)
@@ -2124,16 +2096,14 @@ end
 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)
@@ -2159,15 +2129,6 @@ local function __TS__StringCharCodeAt(self, index)
     return string.byte(self, index + 1) or 0 / 0
 end
 
-local function __TS__StringConcat(str1, ...)
-    local args = {...}
-    local out = str1
-    for ____, arg in ipairs(args) do
-        out = out .. arg
-    end
-    return out
-end
-
 local function __TS__StringEndsWith(self, searchString, endPosition)
     if endPosition == nil or endPosition > #self then
         endPosition = #self
@@ -2239,58 +2200,105 @@ local function __TS__StringPadStart(self, maxLength, fillString)
     ) .. self
 end
 
-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
 
-local function __TS__StringReplaceAll(source, searchValue, replaceValue)
-    local replacer
-    if type(replaceValue) == "string" then
-        replacer = function() return replaceValue end
-    else
-        replacer = replaceValue
+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
+        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
-    local parts = {}
-    local partsIndex = 1
+end
+
+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
 
 local function __TS__StringSlice(self, start, ____end)
@@ -2309,43 +2317,6 @@ local function __TS__StringSlice(self, start, ____end)
     return string.sub(self, start, ____end)
 end
 
-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
-        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
-        end
-    end
-    if count < limit then
-        out[count + 1] = __TS__StringSubstring(source, index)
-    end
-    return out
-end
-
 local function __TS__StringStartsWith(self, searchString, position)
     if position == nil or position < 0 then
         position = 0
@@ -2412,10 +2383,10 @@ return {
   __TS__ArrayJoin = __TS__ArrayJoin,
   __TS__ArrayMap = __TS__ArrayMap,
   __TS__ArrayPush = __TS__ArrayPush,
+  __TS__ArrayPushArray = __TS__ArrayPushArray,
   __TS__ArrayReduce = __TS__ArrayReduce,
   __TS__ArrayReduceRight = __TS__ArrayReduceRight,
   __TS__ArrayReverse = __TS__ArrayReverse,
-  __TS__ArrayShift = __TS__ArrayShift,
   __TS__ArrayUnshift = __TS__ArrayUnshift,
   __TS__ArraySort = __TS__ArraySort,
   __TS__ArraySlice = __TS__ArraySlice,
@@ -2481,7 +2452,6 @@ return {
   __TS__StringAccess = __TS__StringAccess,
   __TS__StringCharAt = __TS__StringCharAt,
   __TS__StringCharCodeAt = __TS__StringCharCodeAt,
-  __TS__StringConcat = __TS__StringConcat,
   __TS__StringEndsWith = __TS__StringEndsWith,
   __TS__StringIncludes = __TS__StringIncludes,
   __TS__StringPadEnd = __TS__StringPadEnd,