isaacscript-common 9.18.4 → 9.19.2

package/dist/features/taintedLazarusPlayers.lua

@@ -1,72 +0,0 @@
-local ____lualib = require("lualib_bundle")
-local Map = ____lualib.Map
-local __TS__New = ____lualib.__TS__New
-local ____exports = {}
-local postPlayerInit, checkDequeue, v
-local ____isaac_2Dtypescript_2Ddefinitions = require("isaac-typescript-definitions")
-local ModCallback = ____isaac_2Dtypescript_2Ddefinitions.ModCallback
-local PlayerType = ____isaac_2Dtypescript_2Ddefinitions.PlayerType
-local ____featuresInitialized = require("featuresInitialized")
-local errorIfFeaturesNotInitialized = ____featuresInitialized.errorIfFeaturesNotInitialized
-local ____log = require("functions.log")
-local logError = ____log.logError
-local ____exports = require("features.saveDataManager.exports")
-local saveDataManager = ____exports.saveDataManager
-function postPlayerInit(self, player)
-    local character = player:GetPlayerType()
-    if character == PlayerType.LAZARUS_B then
-        local ____v_run_queuedTaintedLazarus_0 = v.run.queuedTaintedLazarus
-        ____v_run_queuedTaintedLazarus_0[#____v_run_queuedTaintedLazarus_0 + 1] = player
-    elseif character == PlayerType.LAZARUS_2_B then
-        local ____v_run_queuedDeadTaintedLazarus_1 = v.run.queuedDeadTaintedLazarus
-        ____v_run_queuedDeadTaintedLazarus_1[#____v_run_queuedDeadTaintedLazarus_1 + 1] = player
-    else
-        return
-    end
-    checkDequeue(nil)
-end
-function checkDequeue(self)
-    if #v.run.queuedTaintedLazarus == 0 or #v.run.queuedDeadTaintedLazarus == 0 then
-        return
-    end
-    local taintedLazarus = table.remove(v.run.queuedTaintedLazarus, 1)
-    local deadTaintedLazarus = table.remove(v.run.queuedDeadTaintedLazarus, 1)
-    if taintedLazarus == nil or deadTaintedLazarus == nil then
-        return
-    end
-    local taintedLazarusPtrHash = GetPtrHash(taintedLazarus)
-    local deadTaintedLazarusPtrHash = GetPtrHash(deadTaintedLazarus)
-    if taintedLazarusPtrHash == deadTaintedLazarusPtrHash then
-        logError(nil, "Failed to cache the Tainted Lazarus player objects, since the hash for Tainted Lazarus and Dead Tainted Lazarus were the same.")
-        return
-    end
-    v.run.subPlayerMap:set(taintedLazarusPtrHash, deadTaintedLazarus)
-    v.run.subPlayerMap:set(deadTaintedLazarusPtrHash, taintedLazarus)
-end
-local FEATURE_NAME = "taintedLazarusPlayers"
-v = {run = {
-    queuedTaintedLazarus = {},
-    queuedDeadTaintedLazarus = {},
-    subPlayerMap = __TS__New(Map)
-}}
----
--- @internal
-function ____exports.taintedLazarusPlayersInit(self, mod)
-    saveDataManager(nil, FEATURE_NAME, v, false)
-    mod:AddCallback(ModCallback.POST_PLAYER_INIT, postPlayerInit)
-end
---- Helper function to get the other version of Tainted Lazarus.
--- 
--- - On Tainted Lazarus, returns the player object for Dead Tainted Lazarus.
--- - On Dead Tainted Lazarus, returns the player object for Tainted Lazarus.
--- - Returns undefined if player object retrieval failed for any reason.
--- 
--- If you call the `EntityPlayer.Exists` method on the returned object, it will return false.
--- However, you can still call the other methods like you normally would (e.g.
--- `EntityPlayer.AddCollectible`).
-function ____exports.getTaintedLazarusSubPlayer(self, player)
-    errorIfFeaturesNotInitialized(nil, FEATURE_NAME)
-    local ptrHash = GetPtrHash(player)
-    return v.run.subPlayerMap:get(ptrHash)
-end
-return ____exports

package/dist/featuresInitialized.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"featuresInitialized.d.ts","sourceRoot":"","sources":["../src/featuresInitialized.ts"],"names":[],"mappings":"AAEA,wBAAgB,sBAAsB,IAAI,OAAO,CAEhD;AAED,wBAAgB,6BAA6B,CAAC,WAAW,EAAE,MAAM,GAAG,IAAI,CAMvE;AAED,wBAAgB,sBAAsB,IAAI,IAAI,CAE7C"}

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

@@ -1 +0,0 @@
-{"version":3,"file":"ambush.d.ts","sourceRoot":"","sources":["../../src/functions/ambush.ts"],"names":[],"mappings":"AAQA;;;;;GAKG;AACH,wBAAgB,WAAW,IAAI,IAAI,CA8BlC"}

package/dist/functions/ambush.lua

@@ -1,43 +0,0 @@
-local ____lualib = require("lualib_bundle")
-local __TS__ArrayFilter = ____lualib.__TS__ArrayFilter
-local ____exports = {}
-local ____isaac_2Dtypescript_2Ddefinitions = require("isaac-typescript-definitions")
-local SackSubType = ____isaac_2Dtypescript_2Ddefinitions.SackSubType
-local ____runInNFrames = require("features.runInNFrames")
-local runNextGameFrame = ____runInNFrames.runNextGameFrame
-local ____entities = require("functions.entities")
-local removeEntities = ____entities.removeEntities
-local ____pickupsSpecific = require("functions.pickupsSpecific")
-local getCoins = ____pickupsSpecific.getCoins
-local spawnSackWithSeed = ____pickupsSpecific.spawnSackWithSeed
---- Hard-coding this makes it easier to clean up the pickups afterwards.
-local SACK_SEED_THAT_SPAWNS_TWO_COINS = 6
---- Helper function to start a Challenge Room or the Boss Rush.
--- 
--- Specifically, this is performed by spawning a sack on top of the player, waiting a game frame,
--- and then removing the sack and the pickups that the sack dropped.
-function ____exports.startAmbush(self)
-    local player = Isaac.GetPlayer()
-    local sack = spawnSackWithSeed(nil, SackSubType.NULL, player.Position, SACK_SEED_THAT_SPAWNS_TWO_COINS)
-    local sprite = sack:GetSprite()
-    sprite:Stop()
-    local sackPtr = EntityPtr(sack)
-    runNextGameFrame(
-        nil,
-        function()
-            local futureSack = sackPtr.Ref
-            if futureSack == nil then
-                return
-            end
-            futureSack:Remove()
-            local sackPtrHash = GetPtrHash(futureSack)
-            local coins = getCoins(nil)
-            local coinsFromSack = __TS__ArrayFilter(
-                coins,
-                function(____, pickup) return pickup.SpawnerEntity ~= nil and GetPtrHash(pickup.SpawnerEntity) == sackPtrHash end
-            )
-            removeEntities(nil, coinsFromSack)
-        end
-    )
-end
-return ____exports

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

@@ -1 +0,0 @@
-{"version":3,"file":"array.d.ts","sourceRoot":"","sources":["../../src/functions/array.ts"],"names":[],"mappings":";;;AAKA;;;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,OAAO,CAWT;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;;;;;;;;GAQG;AACH,wBAAgB,uBAAuB,CAAC,CAAC,EACvC,KAAK,EAAE,CAAC,EAAE,EACV,GAAG,eAAe,EAAE,GAAG,EAAE,GACxB,OAAO,CAeT;AAED,wBAAgB,aAAa,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,SAAS,CAAC,EAAE,GAAG,MAAM,CAQlE;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;;;;;;;;;;;;;;;;;;;;;;;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,CA0C7B;AAED;;;;GAIG;AACH,wBAAgB,eAAe,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,SAAS,CAAC,EAAE,GAAG,GAAG,EAAE,CAEnE;AAED;;;;GAIG;AACH,wBAAgB,cAAc,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,CAAC,GAAG,SAAS,CAE3D;AAED;;;;;;;GAOG;AACH,wBAAgB,qBAAqB,CAAC,CAAC,EACrC,KAAK,EAAE,CAAC,EAAE,GAAG,SAAS,CAAC,EAAE,EACzB,SAAS,GAAE,IAAI,GAAG,GAAqB,EACvC,UAAU,GAAE,CAAC,EAAE,GAAG,SAAS,CAAC,EAAO,GAClC,CAAC,CAiBH;AAED;;;;;;;;GAQG;AACH,wBAAgB,8BAA8B,CAAC,CAAC,EAC9C,KAAK,EAAE,CAAC,EAAE,EACV,SAAS,GAAE,IAAI,GAAG,GAAqB,EACvC,UAAU,GAAE,CAAC,EAAE,GAAG,SAAS,CAAC,EAAO,GAClC,CAAC,CAQH;AAED;;;;;;;;GAQG;AACH,wBAAgB,mBAAmB,CAAC,CAAC,EACnC,KAAK,EAAE,CAAC,EAAE,GAAG,SAAS,CAAC,EAAE,EACzB,SAAS,GAAE,IAAI,GAAG,GAAqB,EACvC,UAAU,GAAE,GAAG,EAAE,GAAG,SAAS,GAAG,EAAO,GACtC,GAAG,CAQL;AAED;;;;;;GAMG;AACH,wBAAgB,OAAO,CAAC,MAAM,EAAE,OAAO,GAAG,MAAM,IAAI,OAAO,EAAE,CAkC5D;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;;;;;;;;GAQG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAC5B,aAAa,EAAE,CAAC,EAAE,GAAG,SAAS,CAAC,EAAE,EACjC,SAAS,GAAE,IAAI,GAAG,GAAqB,GACtC,CAAC,EAAE,CAKL;AAED;;;;;;;;GAQG;AACH,wBAAgB,mBAAmB,CAAC,CAAC,EACnC,KAAK,EAAE,CAAC,EAAE,EACV,SAAS,GAAE,IAAI,GAAG,GAAqB,GACtC,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/functions/array.lua

@@ -1,481 +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 Set = ____lualib.Set
-local __TS__New = ____lualib.__TS__New
-local __TS__ArrayForEach = ____lualib.__TS__ArrayForEach
-local __TS__ArrayFilter = ____lualib.__TS__ArrayFilter
-local __TS__ArraySort = ____lualib.__TS__ArraySort
-local __TS__ArrayMap = ____lualib.__TS__ArrayMap
-local __TS__ArraySlice = ____lualib.__TS__ArraySlice
-local __TS__ArrayConcat = ____lualib.__TS__ArrayConcat
-local __TS__ArrayUnshift = ____lualib.__TS__ArrayUnshift
-local __TS__ObjectKeys = ____lualib.__TS__ObjectKeys
-local __TS__ArraySome = ____lualib.__TS__ArraySome
-local __TS__ArrayReduce = ____lualib.__TS__ArrayReduce
-local ____exports = {}
-local ____random = require("functions.random")
-local getRandomInt = ____random.getRandomInt
-local ____rng = require("functions.rng")
-local getRandomSeed = ____rng.getRandomSeed
-local isRNG = ____rng.isRNG
-local newRNG = ____rng.newRNG
-local ____types = require("functions.types")
-local isNumber = ____types.isNumber
-local isTable = ____types.isTable
-local ____utils = require("functions.utils")
-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 True if one or more elements were removed, false otherwise.
-function ____exports.arrayRemoveInPlace(self, array, ...)
-    local elementsToRemove = {...}
-    local removedOneOrMoreElements = false
-    for ____, element in ipairs(elementsToRemove) do
-        local index = __TS__ArrayIndexOf(array, element)
-        if index > -1 then
-            removedOneOrMoreElements = true
-            __TS__ArraySplice(array, index, 1)
-        end
-    end
-    return removedOneOrMoreElements
-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
-        numElements = #oldArray
-    end
-    local newArray = {}
-    do
-        local i = 0
-        while i < numElements do
-            local oldElement = oldArray[i + 1]
-            if oldElement ~= nil then
-                newArray[#newArray + 1] = oldElement
-            end
-            i = i + 1
-        end
-    end
-    return newArray
-end
---- Helper function to get a random index from the provided array.
--- 
--- @param array The array to get the index from.
--- @param seedOrRNG Optional. The `Seed` or `RNG` object to use. If an `RNG` object is provided, the
--- `RNG.Next` method will be called. Default is `getRandomSeed()`.
--- @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 seedOrRNG == nil then
-        seedOrRNG = getRandomSeed(nil)
-    end
-    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.
--- 
--- From: https://stackoverflow.com/questions/2450954/how-to-randomize-shuffle-a-javascript-array
--- 
--- @param array The array to shuffle.
--- @param seedOrRNG Optional. The `Seed` or `RNG` object to use. If an `RNG` object is provided, the
--- `RNG.Next` method will be called. Default is `getRandomSeed()`.
-function ____exports.shuffleArrayInPlace(self, array, seedOrRNG)
-    if seedOrRNG == nil then
-        seedOrRNG = getRandomSeed(nil)
-    end
-    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(Set, indexesToRemove)
-    local array = {}
-    __TS__ArrayForEach(
-        originalArray,
-        function(____, element, i)
-            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. Returns true if one or more elements were
--- removed.
--- 
--- This function is variadic, meaning that you can specify N arguments to remove N elements.
--- 
--- @returns Whether or not any array elements were removed.
-function ____exports.arrayRemoveIndexInPlace(self, array, ...)
-    local indexesToRemove = {...}
-    local legalIndexes = __TS__ArrayFilter(
-        indexesToRemove,
-        function(____, i) return i >= 0 and i < #array end
-    )
-    __TS__ArraySort(legalIndexes)
-    if #legalIndexes == 0 then
-        return false
-    end
-    do
-        local i = #array - 1
-        while i >= 0 do
-            __TS__ArraySplice(array, i, 1)
-            i = i - 1
-        end
-    end
-    return true
-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 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 or not 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 addCombinations
-    addCombinations = function(____, n, src, got, all)
-        if n == 0 then
-            if #got > 0 then
-                all[#all + 1] = got
-            end
-            return
-        end
-        do
-            local j = 0
-            while j < #src do
-                local value = src[j + 1]
-                addCombinations(
-                    nil,
-                    n - 1,
-                    __TS__ArraySlice(src, j + 1),
-                    __TS__ArrayConcat(got, {value}),
-                    all
-                )
-                j = j + 1
-            end
-        end
-    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]`.
-function ____exports.getArrayIndexes(self, array)
-    return erange(nil, #array)
-end
---- Helper function to return the last element of an array.
--- 
--- If the array is empty, this will return undefined.
-function ____exports.getLastElement(self, array)
-    return array[#array]
-end
---- Helper function to get a random element from the provided array.
--- 
--- @param array The array to get an element from.
--- @param seedOrRNG Optional. The `Seed` or `RNG` object to use. If an `RNG` object is provided, the
--- `RNG.Next` method will be called. Default is `getRandomSeed()`.
--- @param exceptions Optional. An array of elements to skip over if selected.
-function ____exports.getRandomArrayElement(self, array, seedOrRNG, exceptions)
-    if seedOrRNG == nil then
-        seedOrRNG = getRandomSeed(nil)
-    end
-    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 arrayWithoutExceptions = ____exports.arrayRemove(
-        nil,
-        array,
-        table.unpack(exceptions)
-    )
-    local randomIndex = ____exports.getRandomArrayIndex(nil, arrayWithoutExceptions, seedOrRNG)
-    local randomElement = arrayWithoutExceptions[randomIndex + 1]
-    if randomElement == nil then
-        error(("Failed to get a random array element since the random index of " .. tostring(randomIndex)) .. " was not valid.")
-    end
-    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).
--- 
--- @param array The array to get an element from.
--- @param seedOrRNG Optional. The `Seed` or `RNG` object to use. If an `RNG` object is provided, the
--- `RNG.Next` method will be called. Default is `getRandomSeed()`.
--- @param exceptions Optional. An array of elements to skip over if selected.
-function ____exports.getRandomArrayElementAndRemove(self, array, seedOrRNG, exceptions)
-    if seedOrRNG == nil then
-        seedOrRNG = getRandomSeed(nil)
-    end
-    if exceptions == nil then
-        exceptions = {}
-    end
-    local randomArrayElement = ____exports.getRandomArrayElement(nil, array, seedOrRNG, exceptions)
-    ____exports.arrayRemoveInPlace(nil, array, randomArrayElement)
-    return randomArrayElement
-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)
-function ____exports.isArray(self, object)
-    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)
-    local hasAllNumberKeys = __TS__ArrayEvery(
-        keys,
-        function(____, key) return isNumber(nil, key) end
-    )
-    if not hasAllNumberKeys then
-        return false
-    end
-    local tableLength = #__TS__ObjectKeys(object)
-    if tableLength == 0 then
-        return true
-    end
-    do
-        local i = 1
-        while i <= tableLength do
-            local element = object[i]
-            if element == nil then
-                return false
-            end
-            i = i + 1
-        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
---- Shallow copies and shuffles the array using the Fisher-Yates algorithm. Returns the copied array.
--- 
--- From: https://stackoverflow.com/questions/2450954/how-to-randomize-shuffle-a-javascript-array
--- 
--- @param originalArray The array to shuffle.
--- @param seedOrRNG Optional. The `Seed` or `RNG` object to use. If an `RNG` object is provided, the
--- `RNG.Next` method will be called. Default is `getRandomSeed()`.
-function ____exports.shuffleArray(self, originalArray, seedOrRNG)
-    if seedOrRNG == nil then
-        seedOrRNG = getRandomSeed(nil)
-    end
-    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
-    )
-end
-return ____exports

package/dist/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/functions/benchmark.lua

@@ -1,49 +0,0 @@
-local ____lualib = require("lualib_bundle")
-local __TS__ArrayForEach = ____lualib.__TS__ArrayForEach
-local ____exports = {}
-local ____log = require("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(
-        nil,
-        ((("Benchmarking " .. tostring(#functions)) .. " function(s) with ") .. tostring(numTrials)) .. " trials."
-    )
-    local averages = {}
-    __TS__ArrayForEach(
-        functions,
-        function(____, func, i)
-            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(
-                nil,
-                ((("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/functions/bitSet128.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"bitSet128.d.ts","sourceRoot":"","sources":["../../src/functions/bitSet128.ts"],"names":[],"mappings":";;AAKA,oBAAY,mBAAmB,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG;IAC1D,QAAQ,CAAC,0BAA0B,EAAE,MAAM,CAAC;CAC7C,CAAC;AAKF,6DAA6D;AAC7D,wBAAgB,aAAa,CAAC,SAAS,EAAE,SAAS,GAAG,SAAS,CAW7D;AAED;;;GAGG;AACH,wBAAgB,oBAAoB,CAClC,SAAS,EAAE,mBAAmB,GAC7B,SAAS,CAqBX;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"}