isaacscript-common 73.1.1 → 75.0.0

package/dist/src/functions/ambush.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"ambush.d.ts","sourceRoot":"","sources":["../../../src/functions/ambush.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,UAAU,EAAE,MAAM,qBAAqB,CAAC;AAEjD;;;GAGG;AACH,wBAAgB,aAAa,IAAI,UAAU,GAAG,SAAS,CAiBtD"}

package/dist/src/functions/ambush.lua

@@ -1,34 +0,0 @@
-local ____exports = {}
-local ____isaac_2Dtypescript_2Ddefinitions = require("isaac-typescript-definitions")
-local RoomType = ____isaac_2Dtypescript_2Ddefinitions.RoomType
-local ____cachedClasses = require("src.core.cachedClasses")
-local game = ____cachedClasses.game
-local ____AmbushType = require("src.enums.AmbushType")
-local AmbushType = ____AmbushType.AmbushType
---- Helper function to get the corresponding ambush type for the current room. Returns undefined if
--- the current room does not correspond to any particular ambush type.
-function ____exports.getAmbushType(self)
-    local room = game:GetRoom()
-    local roomType = room:GetType()
-    repeat
-        local ____switch3 = roomType
-        local ____cond3 = ____switch3 == RoomType.BOSS_RUSH
-        if ____cond3 then
-            do
-                return AmbushType.BOSS_RUSH
-            end
-        end
-        ____cond3 = ____cond3 or ____switch3 == RoomType.CHALLENGE
-        if ____cond3 then
-            do
-                return AmbushType.CHALLENGE_ROOM
-            end
-        end
-        do
-            do
-                return nil
-            end
-        end
-    until true
-end
-return ____exports

package/dist/src/functions/array.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"array.d.ts","sourceRoot":"","sources":["../../../src/functions/array.ts"],"names":[],"mappings":";;;AACA,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AAM1D;;;GAGG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAC3B,MAAM,EAAE,CAAC,EAAE,GAAG,SAAS,CAAC,EAAE,EAC1B,MAAM,EAAE,CAAC,EAAE,GAAG,SAAS,CAAC,EAAE,GACzB,OAAO,CAST;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAC3B,aAAa,EAAE,CAAC,EAAE,GAAG,SAAS,CAAC,EAAE,EACjC,GAAG,gBAAgB,EAAE,CAAC,EAAE,GACvB,CAAC,EAAE,CAIL;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,cAAc,CAAC,CAAC,EAC9B,aAAa,EAAE,CAAC,EAAE,GAAG,SAAS,CAAC,EAAE,EACjC,GAAG,gBAAgB,EAAE,CAAC,EAAE,GACvB,CAAC,EAAE,CAIL;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,qBAAqB,CAAC,CAAC,EACrC,KAAK,EAAE,CAAC,EAAE,EACV,GAAG,gBAAgB,EAAE,CAAC,EAAE,GACvB,OAAO,CAcT;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,kBAAkB,CAAC,CAAC,EAClC,KAAK,EAAE,CAAC,EAAE,EACV,GAAG,gBAAgB,EAAE,CAAC,EAAE,GACvB,CAAC,EAAE,CAYL;AAED;;;;;;GAMG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,EAChC,aAAa,EAAE,CAAC,EAAE,GAAG,SAAS,CAAC,EAAE,EACjC,GAAG,eAAe,EAAE,GAAG,EAAE,GACxB,CAAC,EAAE,CAWL;AAED;;;;;;;GAOG;AACH,wBAAgB,uBAAuB,CAAC,CAAC,EACvC,KAAK,EAAE,CAAC,EAAE,EACV,GAAG,eAAe,EAAE,GAAG,EAAE,GACxB,CAAC,EAAE,CAoBL;AAED,wBAAgB,aAAa,CAAC,KAAK,EAAE,OAAO,EAAE,GAAG,MAAM,CAQtD;AAED;;;;;;GAMG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,GAAG,MAAM,EAAE,KAAK,CAAC,CAAC,EAAE,GAAG,SAAS,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAS1E;AAED;;;;;;GAMG;AACH,wBAAgB,SAAS,CAAC,CAAC,EACzB,QAAQ,EAAE,CAAC,EAAE,GAAG,SAAS,CAAC,EAAE,EAC5B,WAAW,CAAC,EAAE,GAAG,GAChB,CAAC,EAAE,CAcL;AAED,0EAA0E;AAC1E,wBAAgB,UAAU,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,IAAI,CAE9C;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,SAAS,CAAC,IAAI,EAAE,IAAI,EAClC,KAAK,EAAE,IAAI,EAAE,GAAG,SAAS,IAAI,EAAE,EAC/B,IAAI,EAAE,CAAC,OAAO,EAAE,IAAI,KAAK,IAAI,GAAG,SAAS,GACxC,IAAI,EAAE,CAWR;AAED;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,wBAAgB,oBAAoB,CAAC,CAAC,EACpC,KAAK,EAAE,CAAC,EAAE,GAAG,SAAS,CAAC,EAAE,EACzB,iBAAiB,EAAE,OAAO,EAC1B,GAAG,CAAC,EAAE,GAAG,EACT,GAAG,CAAC,EAAE,GAAG,GACR,aAAa,CAAC,SAAS,CAAC,EAAE,CAAC,CAsB7B;AAqBD;;;;;;;;GAQG;AACH,wBAAgB,eAAe,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,SAAS,CAAC,EAAE,GAAG,GAAG,EAAE,CAEnE;AAED;;;GAGG;AACH,wBAAgB,sBAAsB,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,MAAM,GAAG,SAAS,CAc1E;AAED;;;GAGG;AACH,wBAAgB,qBAAqB,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,MAAM,GAAG,SAAS,CAczE;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,qBAAqB,CAAC,CAAC,EACrC,KAAK,EAAE,CAAC,EAAE,GAAG,SAAS,CAAC,EAAE,EACzB,SAAS,EAAE,IAAI,GAAG,GAAG,GAAG,SAAS,EACjC,UAAU,GAAE,CAAC,EAAE,GAAG,SAAS,CAAC,EAAO,GAClC,CAAC,CAiBH;AAED;;;;;;;;;;;;GAYG;AACH,wBAAgB,8BAA8B,CAAC,CAAC,EAC9C,KAAK,EAAE,CAAC,EAAE,EACV,SAAS,EAAE,IAAI,GAAG,GAAG,GAAG,SAAS,EACjC,UAAU,GAAE,CAAC,EAAE,GAAG,SAAS,CAAC,EAAO,GAClC,CAAC,CAQH;AAED;;;;;;;;;;;;GAYG;AACH,wBAAgB,mBAAmB,CAAC,CAAC,EACnC,KAAK,EAAE,CAAC,EAAE,GAAG,SAAS,CAAC,EAAE,EACzB,SAAS,EAAE,IAAI,GAAG,GAAG,GAAG,SAAS,EACjC,UAAU,GAAE,GAAG,EAAE,GAAG,SAAS,GAAG,EAAO,GACtC,GAAG,CAQL;AAED;;;;;GAKG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EAAE,YAAY,SAAS,YAAY,CAAC,CAAC,CAAC,EAC9D,KAAK,EAAE,SAAS,YAAY,EAAE,EAC9B,aAAa,EAAE,YAAY,CAAC,CAAC,CAAC,GAC7B,aAAa,IAAI,YAAY,CAG/B;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,OAAO,CACrB,MAAM,EAAE,OAAO,EACf,sBAAsB,UAAO,GAC5B,MAAM,IAAI,OAAO,EAAE,CAmCrB;AAED;;;;GAIG;AACH,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,GAAG,EAAE,GAAG,OAAO,CAavD;AAED,iEAAiE;AACjE,wBAAgB,cAAc,CAAC,CAAC,EAC9B,YAAY,EAAE,CAAC,EAAE,GAAG,SAAS,CAAC,EAAE,EAChC,WAAW,EAAE,KAAK,CAAC,CAAC,EAAE,GAAG,SAAS,CAAC,EAAE,CAAC,GACrC,OAAO,CAET;AAED,4EAA4E;AAC5E,wBAAgB,mBAAmB,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI,CAIjE;AAED;;;;;;;;;;;;GAYG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAC5B,aAAa,EAAE,CAAC,EAAE,GAAG,SAAS,CAAC,EAAE,EACjC,SAAS,EAAE,IAAI,GAAG,GAAG,GAAG,SAAS,GAChC,CAAC,EAAE,CAKL;AAED;;;;;;;;;;;;GAYG;AACH,wBAAgB,mBAAmB,CAAC,CAAC,EACnC,KAAK,EAAE,CAAC,EAAE,EACV,SAAS,EAAE,IAAI,GAAG,GAAG,GAAG,SAAS,GAChC,IAAI,CAWN;AAED,+DAA+D;AAC/D,wBAAgB,QAAQ,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,SAAS,MAAM,EAAE,GAAG,MAAM,CAEpE;AAED;;GAEG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,IAAI,CAM3E"}

package/dist/src/functions/array.lua

@@ -1,566 +0,0 @@
-local ____lualib = require("lualib_bundle")
-local __TS__ArrayEvery = ____lualib.__TS__ArrayEvery
-local __TS__ArrayIndexOf = ____lualib.__TS__ArrayIndexOf
-local __TS__ArraySplice = ____lualib.__TS__ArraySplice
-local __TS__ArrayPushArray = ____lualib.__TS__ArrayPushArray
-local __TS__New = ____lualib.__TS__New
-local __TS__ArrayEntries = ____lualib.__TS__ArrayEntries
-local __TS__Iterator = ____lualib.__TS__Iterator
-local __TS__ArrayFilter = ____lualib.__TS__ArrayFilter
-local __TS__ArrayMap = ____lualib.__TS__ArrayMap
-local __TS__ArrayUnshift = ____lualib.__TS__ArrayUnshift
-local __TS__ArraySlice = ____lualib.__TS__ArraySlice
-local __TS__SparseArrayNew = ____lualib.__TS__SparseArrayNew
-local __TS__SparseArrayPush = ____lualib.__TS__SparseArrayPush
-local __TS__SparseArraySpread = ____lualib.__TS__SparseArraySpread
-local __TS__ArrayIncludes = ____lualib.__TS__ArrayIncludes
-local __TS__ObjectKeys = ____lualib.__TS__ObjectKeys
-local __TS__ArraySome = ____lualib.__TS__ArraySome
-local __TS__ArrayReduce = ____lualib.__TS__ArrayReduce
-local ____exports = {}
-local addCombinations
-local ____ReadonlySet = require("src.types.ReadonlySet")
-local ReadonlySet = ____ReadonlySet.ReadonlySet
-local ____random = require("src.functions.random")
-local getRandomInt = ____random.getRandomInt
-local ____rng = require("src.functions.rng")
-local isRNG = ____rng.isRNG
-local newRNG = ____rng.newRNG
-local ____types = require("src.functions.types")
-local isNumber = ____types.isNumber
-local isTable = ____types.isTable
-local ____utils = require("src.functions.utils")
-local assertDefined = ____utils.assertDefined
-local eRange = ____utils.eRange
---- Removes all of the specified element(s) from the array. If the specified element(s) are not found
--- in the array, this function will do nothing.
--- 
--- This function is variadic, meaning that you can specify N arguments to remove N elements.
--- 
--- If there is more than one matching element in the array, this function will remove every matching
--- element. If you want to only remove the first matching element, use the `arrayRemoveInPlace`
--- function instead.
--- 
--- @returns True if one or more elements were removed, false otherwise.
-function ____exports.arrayRemoveAllInPlace(self, array, ...)
-    local elementsToRemove = {...}
-    local removedOneOrMoreElements = false
-    for ____, element in ipairs(elementsToRemove) do
-        local index
-        repeat
-            do
-                index = __TS__ArrayIndexOf(array, element)
-                if index > -1 then
-                    removedOneOrMoreElements = true
-                    __TS__ArraySplice(array, index, 1)
-                end
-            end
-        until not (index > -1)
-    end
-    return removedOneOrMoreElements
-end
---- Removes the specified element(s) from the array. If the specified element(s) are not found in the
--- array, this function will do nothing.
--- 
--- This function is variadic, meaning that you can specify N arguments to remove N elements.
--- 
--- If there is more than one matching element in the array, this function will only remove the first
--- matching element. If you want to remove all of the elements, use the `arrayRemoveAllInPlace`
--- function instead.
--- 
--- @returns The removed elements. This will be an empty array if no elements were removed.
-function ____exports.arrayRemoveInPlace(self, array, ...)
-    local elementsToRemove = {...}
-    local removedElements = {}
-    for ____, element in ipairs(elementsToRemove) do
-        local index = __TS__ArrayIndexOf(array, element)
-        if index > -1 then
-            local removedElement = __TS__ArraySplice(array, index, 1)
-            __TS__ArrayPushArray(removedElements, removedElement)
-        end
-    end
-    return removedElements
-end
---- Helper function to perform a shallow copy.
--- 
--- @param oldArray The array to copy.
--- @param numElements Optional. If specified, will only copy the first N elements. By default, the
--- entire array will be copied.
-function ____exports.copyArray(self, oldArray, numElements)
-    if numElements == nil then
-        return {table.unpack(oldArray)}
-    end
-    local newArrayWithFirstNElements = {}
-    do
-        local i = 0
-        while i < numElements do
-            newArrayWithFirstNElements[#newArrayWithFirstNElements + 1] = oldArray[i + 1]
-            i = i + 1
-        end
-    end
-    return newArrayWithFirstNElements
-end
-function addCombinations(self, n, src, got, all)
-    if n == 0 then
-        if #got > 0 then
-            all[#all + 1] = got
-        end
-        return
-    end
-    for ____, ____value in __TS__Iterator(__TS__ArrayEntries(src)) do
-        local i = ____value[1]
-        local element = ____value[2]
-        local ____addCombinations_3 = addCombinations
-        local ____temp_1 = n - 1
-        local ____TS__ArraySlice_result_2 = __TS__ArraySlice(src, i + 1)
-        local ____array_0 = __TS__SparseArrayNew(table.unpack(got))
-        __TS__SparseArrayPush(____array_0, element)
-        ____addCombinations_3(
-            nil,
-            ____temp_1,
-            ____TS__ArraySlice_result_2,
-            {__TS__SparseArraySpread(____array_0)},
-            all
-        )
-    end
-end
---- Helper function to get a random index from the provided array.
--- 
--- If you want to get an unseeded index, you must explicitly pass `undefined` to the `seedOrRNG`
--- parameter.
--- 
--- @param array The array to get the index from.
--- @param seedOrRNG The `Seed` or `RNG` object to use. If an `RNG` object is provided, the
--- `RNG.Next` method will be called. If `undefined` is provided, it will default to
--- a random seed.
--- @param exceptions Optional. An array of indexes that will be skipped over when getting the random
--- index. Default is an empty array.
-function ____exports.getRandomArrayIndex(self, array, seedOrRNG, exceptions)
-    if exceptions == nil then
-        exceptions = {}
-    end
-    if #array == 0 then
-        error("Failed to get a random array index since the provided array is empty.")
-    end
-    return getRandomInt(
-        nil,
-        0,
-        #array - 1,
-        seedOrRNG,
-        exceptions
-    )
-end
---- Shuffles the provided array in-place using the Fisher-Yates algorithm.
--- 
--- If you want an unseeded shuffle, you must explicitly pass `undefined` to the `seedOrRNG`
--- parameter.
--- 
--- From: https://stackoverflow.com/questions/2450954/how-to-randomize-shuffle-a-javascript-array
--- 
--- @param array The array to shuffle.
--- @param seedOrRNG The `Seed` or `RNG` object to use. If an `RNG` object is provided, the
--- `RNG.Next` method will be called. If `undefined` is provided, it will default to
--- a random seed.
-function ____exports.shuffleArrayInPlace(self, array, seedOrRNG)
-    local currentIndex = #array
-    local rng = isRNG(nil, seedOrRNG) and seedOrRNG or newRNG(nil, seedOrRNG)
-    while currentIndex > 0 do
-        currentIndex = currentIndex - 1
-        local randomIndex = ____exports.getRandomArrayIndex(nil, array, rng)
-        ____exports.swapArrayElements(nil, array, currentIndex, randomIndex)
-    end
-end
---- Helper function to swap two different array elements. (The elements will be swapped in-place.)
-function ____exports.swapArrayElements(self, array, i, j)
-    local value1 = array[i + 1]
-    local value2 = array[j + 1]
-    array[i + 1] = value2
-    array[j + 1] = value1
-end
---- Helper function for determining if two arrays contain the exact same elements. Note that this
--- only performs a shallow comparison.
-function ____exports.arrayEquals(self, array1, array2)
-    if #array1 ~= #array2 then
-        return false
-    end
-    return __TS__ArrayEvery(
-        array1,
-        function(____, array1Element, i)
-            local array2Element = array2[i + 1]
-            return array1Element == array2Element
-        end
-    )
-end
---- Shallow copies and removes the specified element(s) from the array. Returns the copied array. If
--- the specified element(s) are not found in the array, it will simply return a shallow copy of the
--- array.
--- 
--- This function is variadic, meaning that you can specify N arguments to remove N elements.
--- 
--- If there is more than one matching element in the array, this function will only remove the first
--- matching element. If you want to remove all of the elements, use the `arrayRemoveAll` function
--- instead.
-function ____exports.arrayRemove(self, originalArray, ...)
-    local array = ____exports.copyArray(nil, originalArray)
-    ____exports.arrayRemoveInPlace(nil, array, ...)
-    return array
-end
---- Shallow copies and removes the specified element(s) from the array. Returns the copied array. If
--- the specified element(s) are not found in the array, it will simply return a shallow copy of the
--- array.
--- 
--- This function is variadic, meaning that you can specify N arguments to remove N elements.
--- 
--- If there is more than one matching element in the array, this function will remove every matching
--- element. If you want to only remove the first matching element, use the `arrayRemove` function
--- instead.
-function ____exports.arrayRemoveAll(self, originalArray, ...)
-    local array = ____exports.copyArray(nil, originalArray)
-    ____exports.arrayRemoveAllInPlace(nil, array, ...)
-    return array
-end
---- Shallow copies and removes the elements at the specified indexes from the array. Returns the
--- copied array. If the specified indexes are not found in the array, it will simply return a
--- shallow copy of the array.
--- 
--- This function is variadic, meaning that you can specify N arguments to remove N elements.
-function ____exports.arrayRemoveIndex(self, originalArray, ...)
-    local indexesToRemove = {...}
-    local indexesToRemoveSet = __TS__New(ReadonlySet, indexesToRemove)
-    local array = {}
-    for ____, ____value in __TS__Iterator(__TS__ArrayEntries(originalArray)) do
-        local i = ____value[1]
-        local element = ____value[2]
-        if not indexesToRemoveSet:has(i) then
-            array[#array + 1] = element
-        end
-    end
-    return array
-end
---- Removes the elements at the specified indexes from the array. If the specified indexes are not
--- found in the array, this function will do nothing.
--- 
--- This function is variadic, meaning that you can specify N arguments to remove N elements.
--- 
--- @returns The removed elements. This will be an empty array if no elements were removed.
-function ____exports.arrayRemoveIndexInPlace(self, array, ...)
-    local indexesToRemove = {...}
-    local legalIndexes = __TS__ArrayFilter(
-        indexesToRemove,
-        function(____, i) return i >= 0 and i < #array end
-    )
-    if #legalIndexes == 0 then
-        return {}
-    end
-    local legalIndexesSet = __TS__New(ReadonlySet, legalIndexes)
-    local removedElements = {}
-    do
-        local i = #array - 1
-        while i >= 0 do
-            if legalIndexesSet:has(i) then
-                local removedElement = __TS__ArraySplice(array, i, 1)
-                __TS__ArrayPushArray(removedElements, removedElement)
-            end
-            i = i - 1
-        end
-    end
-    return removedElements
-end
-function ____exports.arrayToString(self, array)
-    if #array == 0 then
-        return "[]"
-    end
-    local strings = __TS__ArrayMap(
-        array,
-        function(____, element) return tostring(element) end
-    )
-    local commaSeparatedStrings = table.concat(strings, ", ")
-    return ("[" .. commaSeparatedStrings) .. "]"
-end
---- Helper function to combine two or more arrays. Returns a new array that is the composition of all
--- of the specified arrays.
--- 
--- This function is variadic, meaning that you can specify N arguments to combine N arrays. Note
--- that this will only perform a shallow copy of the array elements.
-function ____exports.combineArrays(self, ...)
-    local arrays = {...}
-    local elements = {}
-    for ____, array in ipairs(arrays) do
-        for ____, element in ipairs(array) do
-            elements[#elements + 1] = element
-        end
-    end
-    return elements
-end
---- Helper function to remove all of the elements in an array in-place.
-function ____exports.emptyArray(self, array)
-    __TS__ArraySplice(array, 0, #array)
-end
---- Helper function to perform a map and a filter at the same time. Similar to `Array.map`, provide a
--- function that transforms a value, but return `undefined` if the value should be skipped. (Thus,
--- this function cannot be used in situations where `undefined` can be a valid array element.)
--- 
--- This function is useful because the `Array.map` method will always produce an array with the same
--- amount of elements as the original array.
--- 
--- This is named `filterMap` after the Rust function:
--- https://doc.rust-lang.org/std/iter/struct.FilterMap.html
-function ____exports.filterMap(self, array, func)
-    local newArray = {}
-    for ____, element in ipairs(array) do
-        local newElement = func(nil, element)
-        if newElement ~= nil then
-            newArray[#newArray + 1] = newElement
-        end
-    end
-    return newArray
-end
---- Helper function to get all possible combinations of the given array. This includes the
--- combination of an empty array.
--- 
--- For example, if this function is provided an array containing 1, 2, and 3, then it will return an
--- array containing the following arrays:
--- 
--- - [] (if `includeEmptyArray` is set to true)
--- - [1]
--- - [2]
--- - [3]
--- - [1, 2]
--- - [1, 3]
--- - [2, 3]
--- - [1, 2, 3]
--- 
--- From: https://github.com/firstandthird/combinations/blob/master/index.js
--- 
--- @param array The array to get the combinations of.
--- @param includeEmptyArray Whether to include an empty array in the combinations.
--- @param min Optional. The minimum number of elements to include in each combination. Default is 1.
--- @param max Optional. The maximum number of elements to include in each combination. Default is
--- the length of the array.
-function ____exports.getArrayCombinations(self, array, includeEmptyArray, min, max)
-    if min == nil or min <= 0 then
-        min = 1
-    end
-    if max == nil or max <= 0 then
-        max = #array
-    end
-    local all = {}
-    do
-        local i = min
-        while i < #array do
-            addCombinations(
-                nil,
-                i,
-                array,
-                {},
-                all
-            )
-            i = i + 1
-        end
-    end
-    if #array == max then
-        all[#all + 1] = array
-    end
-    if includeEmptyArray then
-        __TS__ArrayUnshift(all, {})
-    end
-    return all
-end
---- Helper function to get an array containing the indexes of an array.
--- 
--- For example, an array of `["Apple", "Banana"]` would return an array of `[0, 1]`.
--- 
--- Note that normally, you would use the `Object.keys` method to get the indexes of an array, but
--- due to implementation details of TypeScriptToLua, this results in an array of 1 through N
--- (instead of an array of 0 through N -1).
-function ____exports.getArrayIndexes(self, array)
-    return eRange(nil, #array)
-end
---- Helper function to get the highest value in an array. Returns undefined if there were no elements
--- in the array.
-function ____exports.getHighestArrayElement(self, array)
-    if #array == 0 then
-        return nil
-    end
-    local highestValue
-    for ____, element in ipairs(array) do
-        if highestValue == nil or element > highestValue then
-            highestValue = element
-        end
-    end
-    return highestValue
-end
---- Helper function to get the lowest value in an array. Returns undefined if there were no elements
--- in the array.
-function ____exports.getLowestArrayElement(self, array)
-    if #array == 0 then
-        return nil
-    end
-    local lowestValue
-    for ____, element in ipairs(array) do
-        if lowestValue == nil or element < lowestValue then
-            lowestValue = element
-        end
-    end
-    return lowestValue
-end
---- Helper function to get a random element from the provided array.
--- 
--- If you want to get an unseeded element, you must explicitly pass `undefined` to the `seedOrRNG`
--- parameter.
--- 
--- @param array The array to get an element from.
--- @param seedOrRNG The `Seed` or `RNG` object to use. If an `RNG` object is provided, the
--- `RNG.Next` method will be called. If `undefined` is provided, it will default to
--- a random seed.
--- @param exceptions Optional. An array of elements to skip over if selected.
-function ____exports.getRandomArrayElement(self, array, seedOrRNG, exceptions)
-    if exceptions == nil then
-        exceptions = {}
-    end
-    if #array == 0 then
-        error("Failed to get a random array element since the provided array is empty.")
-    end
-    local arrayToUse = #exceptions > 0 and ____exports.arrayRemove(
-        nil,
-        array,
-        table.unpack(exceptions)
-    ) or array
-    local randomIndex = ____exports.getRandomArrayIndex(nil, arrayToUse, seedOrRNG)
-    local randomElement = arrayToUse[randomIndex + 1]
-    assertDefined(
-        nil,
-        randomElement,
-        ("Failed to get a random array element since the random index of " .. tostring(randomIndex)) .. " was not valid."
-    )
-    return randomElement
-end
---- Helper function to get a random element from the provided array. Once the random element is
--- decided, it is then removed from the array (in-place).
--- 
--- If you want to get an unseeded element, you must explicitly pass `undefined` to the `seedOrRNG`
--- parameter.
--- 
--- @param array The array to get an element from.
--- @param seedOrRNG The `Seed` or `RNG` object to use. If an `RNG` object is provided, the
--- `RNG.Next` method will be called. If `undefined` is provided, it will default to
--- a random seed.
--- @param exceptions Optional. An array of elements to skip over if selected.
-function ____exports.getRandomArrayElementAndRemove(self, array, seedOrRNG, exceptions)
-    if exceptions == nil then
-        exceptions = {}
-    end
-    local randomArrayElement = ____exports.getRandomArrayElement(nil, array, seedOrRNG, exceptions)
-    ____exports.arrayRemoveInPlace(nil, array, randomArrayElement)
-    return randomArrayElement
-end
---- Similar to the `Array.includes` method, but works on a widened version of the array.
--- 
--- This is useful when the normal `Array.includes` produces a type error from an array that uses an
--- `as const` assertion.
-function ____exports.includes(self, array, searchElement)
-    local widenedArray = array
-    return __TS__ArrayIncludes(widenedArray, searchElement)
-end
---- Since Lua uses tables for every non-primitive data structure, it is non-trivial to determine if a
--- particular table is being used as an array. `isArray` returns true if:
--- 
--- - the table contains all numerical indexes that are contiguous, starting at 1
--- - the table has no keys (i.e. an "empty" table)
--- 
--- @param object The object to analyze.
--- @param ensureContiguousValues Optional. Whether the Lua table has to have all contiguous keys in
--- order to be considered an array. Default is true.
-function ____exports.isArray(self, object, ensureContiguousValues)
-    if ensureContiguousValues == nil then
-        ensureContiguousValues = true
-    end
-    if not isTable(nil, object) then
-        return false
-    end
-    local metatable = getmetatable(object)
-    if metatable ~= nil then
-        return false
-    end
-    local keys = __TS__ObjectKeys(object)
-    if #keys == 0 then
-        return true
-    end
-    local hasAllNumberKeys = __TS__ArrayEvery(
-        keys,
-        function(____, key) return isNumber(nil, key) end
-    )
-    if not hasAllNumberKeys then
-        return false
-    end
-    if ensureContiguousValues then
-        do
-            local i = 1
-            while i <= #keys do
-                local element = object[i]
-                if element == nil then
-                    return false
-                end
-                i = i + 1
-            end
-        end
-    end
-    return true
-end
---- Helper function to see if every element in the array is N + 1.
--- 
--- For example, `[2, 3, 4]` would return true, and `[2, 3, 5]` would return false.
-function ____exports.isArrayContiguous(self, array)
-    local lastValue
-    for ____, element in ipairs(array) do
-        if lastValue == nil then
-            lastValue = element - 1
-        end
-        if element ~= lastValue - 1 then
-            return false
-        end
-    end
-    return true
-end
---- Checks if an array is in the provided 2-dimensional array.
-function ____exports.isArrayInArray(self, arrayToMatch, parentArray)
-    return __TS__ArraySome(
-        parentArray,
-        function(____, element) return ____exports.arrayEquals(nil, element, arrayToMatch) end
-    )
-end
---- Helper function to set every element in an array to a specific value.
-function ____exports.setAllArrayElements(self, array, value)
-    do
-        local i = 0
-        while i < #array do
-            array[i + 1] = value
-            i = i + 1
-        end
-    end
-end
---- Shallow copies and shuffles the array using the Fisher-Yates algorithm. Returns the copied array.
--- 
--- If you want an unseeded shuffle, you must explicitly pass `undefined` to the `seedOrRNG`
--- parameter.
--- 
--- From: https://stackoverflow.com/questions/2450954/how-to-randomize-shuffle-a-javascript-array
--- 
--- @param originalArray The array to shuffle.
--- @param seedOrRNG The `Seed` or `RNG` object to use. If an `RNG` object is provided, the
--- `RNG.Next` method will be called. If `undefined` is provided, it will default to
--- a random seed.
-function ____exports.shuffleArray(self, originalArray, seedOrRNG)
-    local array = ____exports.copyArray(nil, originalArray)
-    ____exports.shuffleArrayInPlace(nil, array, seedOrRNG)
-    return array
-end
---- Helper function to sum every value in an array together.
-function ____exports.sumArray(self, array)
-    return __TS__ArrayReduce(
-        array,
-        function(____, accumulator, element) return accumulator + element end,
-        0
-    )
-end
-return ____exports

package/dist/src/functions/arrayLua.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"arrayLua.d.ts","sourceRoot":"","sources":["../../../src/functions/arrayLua.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH;;;;;GAKG;AACH,wBAAgB,KAAK,CAAC,CAAC,EACrB,KAAK,EAAE,CAAC,EAAE,EACV,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,OAAO,GACrD,OAAO,CAET;AAED;;;;;GAKG;AACH,wBAAgB,MAAM,CAAC,CAAC,EACtB,KAAK,EAAE,CAAC,EAAE,EACV,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,OAAO,GACrD,CAAC,EAAE,CAEL;AAED;;;;GAIG;AACH,wBAAgB,IAAI,CAAC,CAAC,EACpB,KAAK,EAAE,CAAC,EAAE,EACV,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,OAAO,GACrD,CAAC,GAAG,SAAS,CAEf;AAED;;;;GAIG;AACH,wBAAgB,OAAO,CAAC,CAAC,EACvB,KAAK,EAAE,CAAC,EAAE,EACV,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,IAAI,GAClD,IAAI,CAEN;AAID;;;;;GAKG;AACH,wBAAgB,IAAI,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,SAAS,EAAE,MAAM,GAAG,MAAM,CAE7D;AAED;;;;;GAKG;AACH,wBAAgB,GAAG,CAAC,CAAC,EAAE,CAAC,EACtB,KAAK,EAAE,CAAC,EAAE,EACV,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,CAAC,GAC/C,CAAC,EAAE,CAEL;AAED;;;;;GAKG;AACH,wBAAgB,IAAI,CAAC,CAAC,EACpB,KAAK,EAAE,CAAC,EAAE,EACV,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,OAAO,GACrD,OAAO,CAET"}

package/dist/src/functions/benchmark.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"benchmark.d.ts","sourceRoot":"","sources":["../../../src/functions/benchmark.ts"],"names":[],"mappings":";AAEA;;;;;;;;;;;;GAYG;AACH,wBAAgB,SAAS,CACvB,SAAS,EAAE,GAAG,EACd,GAAG,SAAS,EAAE,KAAK,CAAC,MAAM,IAAI,CAAC,GAC9B,GAAG,EAAE,CAsBP"}

package/dist/src/functions/benchmark.lua

@@ -1,43 +0,0 @@
-local ____lualib = require("lualib_bundle")
-local __TS__ArrayEntries = ____lualib.__TS__ArrayEntries
-local __TS__Iterator = ____lualib.__TS__Iterator
-local ____exports = {}
-local ____log = require("src.functions.log")
-local log = ____log.log
---- Helper function to benchmark the performance of a function.
--- 
--- This function is variadic, which means that you can supply as many functions as you want to
--- benchmark.
--- 
--- This function uses the `Isaac.GetTime` method to record how long the function took to execute.
--- This method only reports time in milliseconds. For this reason, if you are benchmarking smaller
--- functions, then you should provide a very high value for the number of trials.
--- 
--- @returns An array containing the average time in milliseconds for each function. (This will also
--- be printed to the log.)
-function ____exports.benchmark(self, numTrials, ...)
-    local functions = {...}
-    log(((("Benchmarking " .. tostring(#functions)) .. " function(s) with ") .. tostring(numTrials)) .. " trials.")
-    local averages = {}
-    for ____, ____value in __TS__Iterator(__TS__ArrayEntries(functions)) do
-        local i = ____value[1]
-        local func = ____value[2]
-        local totalTimeMilliseconds = 0
-        do
-            local j = 0
-            while j < numTrials do
-                local startTimeMilliseconds = Isaac.GetTime()
-                func(nil)
-                local endTimeMilliseconds = Isaac.GetTime()
-                local elapsedTimeMilliseconds = endTimeMilliseconds - startTimeMilliseconds
-                totalTimeMilliseconds = totalTimeMilliseconds + elapsedTimeMilliseconds
-                j = j + 1
-            end
-        end
-        local averageTimeMilliseconds = totalTimeMilliseconds / numTrials
-        log(((("The average time of the function at index " .. tostring(i)) .. " is: ") .. tostring(averageTimeMilliseconds)) .. " milliseconds")
-        averages[#averages + 1] = averageTimeMilliseconds
-    end
-    return averages
-end
-return ____exports

package/dist/src/functions/bitSet128.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"bitSet128.d.ts","sourceRoot":"","sources":["../../../src/functions/bitSet128.ts"],"names":[],"mappings":";AAAA,OAAO,KAAK,EAAE,yBAAyB,EAAE,MAAM,8BAA8B,CAAC;AAW9E,MAAM,MAAM,mBAAmB,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG;IAC1D,QAAQ,CAAC,0BAA0B,EAAE,MAAM,CAAC;IAC5C,QAAQ,CAAC,MAAM,EAAE,yBAAyB,CAAC,WAAW,CAAC;CACxD,CAAC;AAKF,6DAA6D;AAC7D,wBAAgB,aAAa,CAAC,SAAS,EAAE,SAAS,GAAG,SAAS,CAW7D;AAED;;;GAGG;AACH,wBAAgB,oBAAoB,CAClC,SAAS,EAAE,mBAAmB,GAC7B,SAAS,CAmBX;AAED,mFAAmF;AACnF,wBAAgB,WAAW,CAAC,MAAM,EAAE,OAAO,GAAG,MAAM,IAAI,SAAS,CAEhE;AAED;;;GAGG;AACH,wBAAgB,qBAAqB,CACnC,MAAM,EAAE,OAAO,GACd,MAAM,IAAI,mBAAmB,CAQ/B;AAED;;;GAGG;AACH,wBAAgB,kBAAkB,CAAC,SAAS,EAAE,SAAS,GAAG,mBAAmB,CAW5E"}