isaacscript-common 87.9.7 → 87.9.8

package/dist/functions/array.js

@@ -1,45 +1,14 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.arrayEquals = arrayEquals;
-exports.arrayRemove = arrayRemove;
-exports.arrayRemoveAllInPlace = arrayRemoveAllInPlace;
-exports.arrayRemoveIndex = arrayRemoveIndex;
-exports.arrayRemoveIndexInPlace = arrayRemoveIndexInPlace;
-exports.arrayRemoveInPlace = arrayRemoveInPlace;
-exports.arrayToString = arrayToString;
-exports.combineArrays = combineArrays;
-exports.copyArray = copyArray;
-exports.emptyArray = emptyArray;
-exports.filterMap = filterMap;
-exports.getArrayCombinations = getArrayCombinations;
-exports.getArrayDuplicateElements = getArrayDuplicateElements;
-exports.getArrayIndexes = getArrayIndexes;
-exports.getHighestArrayElement = getHighestArrayElement;
-exports.getLowestArrayElement = getLowestArrayElement;
-exports.getRandomArrayElement = getRandomArrayElement;
-exports.getRandomArrayElementAndRemove = getRandomArrayElementAndRemove;
-exports.getRandomArrayIndex = getRandomArrayIndex;
-exports.includes = includes;
-exports.isArray = isArray;
-exports.isArrayContiguous = isArrayContiguous;
-exports.isArrayElementsUnique = isArrayElementsUnique;
-exports.isArrayInArray = isArrayInArray;
-exports.setAllArrayElements = setAllArrayElements;
-exports.shuffleArray = shuffleArray;
-exports.shuffleArrayInPlace = shuffleArrayInPlace;
-exports.sumArray = sumArray;
-exports.swapArrayElements = swapArrayElements;
-const ReadonlySet_1 = require("../types/ReadonlySet");
-const random_1 = require("./random");
-const rng_1 = require("./rng");
-const sort_1 = require("./sort");
-const types_1 = require("./types");
-const utils_1 = require("./utils");
+import { ReadonlySet } from "../types/ReadonlySet";
+import { getRandomInt } from "./random";
+import { isRNG, newRNG } from "./rng";
+import { sortNormal } from "./sort";
+import { isNumber, isTable } from "./types";
+import { assertDefined, eRange } from "./utils";
 /**
  * Helper function for determining if two arrays contain the exact same elements. Note that this
  * only performs a shallow comparison.
  */
-function arrayEquals(array1, array2) {
+export function arrayEquals(array1, array2) {
     if (array1.length !== array2.length) {
         return false;
     }
@@ -57,10 +26,10 @@ function arrayEquals(array1, array2) {
  *
  * This function is variadic, meaning that you can specify N arguments to remove N elements.
  */
-function arrayRemove(originalArray, ...elementsToRemove
+export function arrayRemove(originalArray, ...elementsToRemove
 // eslint-disable-next-line complete/no-mutable-return
 ) {
-    const elementsToRemoveSet = new ReadonlySet_1.ReadonlySet(elementsToRemove);
+    const elementsToRemoveSet = new ReadonlySet(elementsToRemove);
     const array = [];
     for (const element of originalArray) {
         if (!elementsToRemoveSet.has(element)) {
@@ -81,7 +50,7 @@ function arrayRemove(originalArray, ...elementsToRemove
  *
  * @returns True if one or more elements were removed, false otherwise.
  */
-function arrayRemoveAllInPlace(
+export function arrayRemoveAllInPlace(
 // eslint-disable-next-line complete/prefer-readonly-parameter-types
 array, ...elementsToRemove) {
     let removedOneOrMoreElements = false;
@@ -104,10 +73,10 @@ array, ...elementsToRemove) {
  *
  * This function is variadic, meaning that you can specify N arguments to remove N elements.
  */
-function arrayRemoveIndex(originalArray, ...indexesToRemove
+export function arrayRemoveIndex(originalArray, ...indexesToRemove
 // eslint-disable-next-line complete/no-mutable-return
 ) {
-    const indexesToRemoveSet = new ReadonlySet_1.ReadonlySet(indexesToRemove);
+    const indexesToRemoveSet = new ReadonlySet(indexesToRemove);
     const array = [];
     for (const [i, element] of originalArray.entries()) {
         if (!indexesToRemoveSet.has(i)) {
@@ -124,7 +93,7 @@ function arrayRemoveIndex(originalArray, ...indexesToRemove
  *
  * @returns The removed elements. This will be an empty array if no elements were removed.
  */
-function arrayRemoveIndexInPlace(
+export function arrayRemoveIndexInPlace(
 // eslint-disable-next-line complete/prefer-readonly-parameter-types
 array, ...indexesToRemove
 // eslint-disable-next-line complete/no-mutable-return
@@ -133,7 +102,7 @@ array, ...indexesToRemove
     if (legalIndexes.length === 0) {
         return [];
     }
-    const legalIndexesSet = new ReadonlySet_1.ReadonlySet(legalIndexes);
+    const legalIndexesSet = new ReadonlySet(legalIndexes);
     const removedElements = [];
     for (let i = array.length - 1; i >= 0; i--) {
         if (!legalIndexesSet.has(i)) {
@@ -156,7 +125,7 @@ array, ...indexesToRemove
  *
  * @returns The removed elements. This will be an empty array if no elements were removed.
  */
-function arrayRemoveInPlace(
+export function arrayRemoveInPlace(
 // eslint-disable-next-line complete/prefer-readonly-parameter-types
 array, ...elementsToRemove
 // eslint-disable-next-line complete/no-mutable-return
@@ -171,7 +140,7 @@ array, ...elementsToRemove
     }
     return removedElements;
 }
-function arrayToString(array) {
+export function arrayToString(array) {
     if (array.length === 0) {
         return "[]";
     }
@@ -187,7 +156,7 @@ function arrayToString(array) {
  * that this will only perform a shallow copy of the array elements.
  */
 // eslint-disable-next-line complete/no-mutable-return
-function combineArrays(...arrays) {
+export function combineArrays(...arrays) {
     const elements = [];
     for (const array of arrays) {
         for (const element of array) {
@@ -204,7 +173,7 @@ function combineArrays(...arrays) {
  *                    entire array will be copied.
  */
 // eslint-disable-next-line complete/no-mutable-return
-function copyArray(oldArray, numElements) {
+export function copyArray(oldArray, numElements) {
     // Using the spread operator was benchmarked to be faster than manually creating an array using
     // the below algorithm.
     if (numElements === undefined) {
@@ -219,7 +188,7 @@ function copyArray(oldArray, numElements) {
 }
 /** Helper function to remove all of the elements in an array in-place. */
 // eslint-disable-next-line complete/prefer-readonly-parameter-types
-function emptyArray(array) {
+export function emptyArray(array) {
     array.length = 0;
 }
 /**
@@ -233,7 +202,7 @@ function emptyArray(array) {
  * This is named `filterMap` after the Rust function:
  * https://doc.rust-lang.org/std/iter/struct.FilterMap.html
  */
-function filterMap(array, func) {
+export function filterMap(array, func) {
     const filteredArray = [];
     for (const element of array) {
         const newElement = func(element);
@@ -267,7 +236,7 @@ function filterMap(array, func) {
  * @param max Optional. The maximum number of elements to include in each combination. Default is
  *            the length of the array.
  */
-function getArrayCombinations(array, includeEmptyArray, min, max) {
+export function getArrayCombinations(array, includeEmptyArray, min, max) {
     if (min === undefined || min <= 0) {
         min = 1;
     }
@@ -292,7 +261,7 @@ function getArrayCombinations(array, includeEmptyArray, min, max) {
  * Helper function to get the duplicate elements in an array. Only one element for each value will
  * be returned. The elements will be sorted before they are returned.
  */
-function getArrayDuplicateElements(array) {
+export function getArrayDuplicateElements(array) {
     const duplicateElements = new Set();
     const set = new Set();
     for (const element of array) {
@@ -302,7 +271,7 @@ function getArrayDuplicateElements(array) {
         set.add(element);
     }
     const values = [...duplicateElements];
-    return values.toSorted(sort_1.sortNormal);
+    return values.toSorted(sortNormal);
 }
 /**
  * Helper function to get an array containing the indexes of an array.
@@ -313,14 +282,14 @@ function getArrayDuplicateElements(array) {
  * 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 getArrayIndexes(array) {
-    return (0, utils_1.eRange)(array.length);
+export function getArrayIndexes(array) {
+    return eRange(array.length);
 }
 /**
  * Helper function to get the highest value in an array. Returns undefined if there were no elements
  * in the array.
  */
-function getHighestArrayElement(array) {
+export function getHighestArrayElement(array) {
     if (array.length === 0) {
         return undefined;
     }
@@ -336,7 +305,7 @@ function getHighestArrayElement(array) {
  * Helper function to get the lowest value in an array. Returns undefined if there were no elements
  * in the array.
  */
-function getLowestArrayElement(array) {
+export function getLowestArrayElement(array) {
     if (array.length === 0) {
         return undefined;
     }
@@ -360,14 +329,14 @@ function getLowestArrayElement(array) {
  *                  a random seed.
  * @param exceptions Optional. An array of elements to skip over if selected.
  */
-function getRandomArrayElement(array, seedOrRNG, exceptions = []) {
+export function getRandomArrayElement(array, seedOrRNG, exceptions = []) {
     if (array.length === 0) {
         error("Failed to get a random array element since the provided array is empty.");
     }
     const arrayToUse = exceptions.length > 0 ? arrayRemove(array, ...exceptions) : array;
     const randomIndex = getRandomArrayIndex(arrayToUse, seedOrRNG);
     const randomElement = arrayToUse[randomIndex];
-    (0, utils_1.assertDefined)(randomElement, `Failed to get a random array element since the random index of ${randomIndex} was not valid.`);
+    assertDefined(randomElement, `Failed to get a random array element since the random index of ${randomIndex} was not valid.`);
     return randomElement;
 }
 /**
@@ -383,7 +352,7 @@ function getRandomArrayElement(array, seedOrRNG, exceptions = []) {
  *                  a random seed.
  * @param exceptions Optional. An array of elements to skip over if selected.
  */
-function getRandomArrayElementAndRemove(
+export function getRandomArrayElementAndRemove(
 // eslint-disable-next-line complete/prefer-readonly-parameter-types
 array, seedOrRNG, exceptions = []) {
     const randomArrayElement = getRandomArrayElement(array, seedOrRNG, exceptions);
@@ -403,11 +372,11 @@ array, seedOrRNG, exceptions = []) {
  * @param exceptions Optional. An array of indexes that will be skipped over when getting the random
  *                   index. Default is an empty array.
  */
-function getRandomArrayIndex(array, seedOrRNG, exceptions = []) {
+export function getRandomArrayIndex(array, seedOrRNG, exceptions = []) {
     if (array.length === 0) {
         error("Failed to get a random array index since the provided array is empty.");
     }
-    return (0, random_1.getRandomInt)(0, array.length - 1, seedOrRNG, exceptions);
+    return getRandomInt(0, array.length - 1, seedOrRNG, exceptions);
 }
 /**
  * Similar to the `Array.includes` method, but works on a widened version of the array.
@@ -415,7 +384,7 @@ function getRandomArrayIndex(array, seedOrRNG, exceptions = []) {
  * This is useful when the normal `Array.includes` produces a type error from an array that uses an
  * `as const` assertion.
  */
-function includes(array, searchElement) {
+export function includes(array, searchElement) {
     const widenedArray = array;
     return widenedArray.includes(searchElement);
 }
@@ -430,8 +399,8 @@ function includes(array, searchElement) {
  * @param ensureContiguousValues Optional. Whether the Lua table has to have all contiguous keys in
  *                               order to be considered an array. Default is true.
  */
-function isArray(object, ensureContiguousValues = true) {
-    if (!(0, types_1.isTable)(object)) {
+export function isArray(object, ensureContiguousValues = true) {
+    if (!isTable(object)) {
         return false;
     }
     // First, if there is a metatable, this cannot be a simple array and must be a more complex
@@ -446,7 +415,7 @@ function isArray(object, ensureContiguousValues = true) {
         return true;
     }
     // Third, handle the case of non-numerical keys.
-    const hasAllNumberKeys = keys.every((key) => (0, types_1.isNumber)(key));
+    const hasAllNumberKeys = keys.every((key) => isNumber(key));
     if (!hasAllNumberKeys) {
         return false;
     }
@@ -466,7 +435,7 @@ function isArray(object, ensureContiguousValues = true) {
  *
  * For example, `[2, 3, 4]` would return true, and `[2, 3, 5]` would return false.
  */
-function isArrayContiguous(array) {
+export function isArrayContiguous(array) {
     let lastValue;
     for (const element of array) {
         lastValue ??= element - 1;
@@ -481,17 +450,17 @@ function isArrayContiguous(array) {
  *
  * Under the hood, this is performed by converting the array to a set.
  */
-function isArrayElementsUnique(array) {
+export function isArrayElementsUnique(array) {
     const set = new Set(array);
     return set.size === array.length;
 }
 /** Checks if an array is in the provided 2-dimensional array. */
-function isArrayInArray(arrayToMatch, parentArray) {
+export function isArrayInArray(arrayToMatch, parentArray) {
     return parentArray.some((element) => arrayEquals(element, arrayToMatch));
 }
 /** Helper function to set every element in an array to a specific value. */
 // eslint-disable-next-line complete/prefer-readonly-parameter-types
-function setAllArrayElements(array, value) {
+export function setAllArrayElements(array, value) {
     for (let i = 0; i < array.length; i++) {
         array[i] = value;
     }
@@ -509,7 +478,7 @@ function setAllArrayElements(array, value) {
  *                  `RNG.Next` method will be called. If `undefined` is provided, it will default to
  *                  a random seed.
  */
-function shuffleArray(originalArray, seedOrRNG) {
+export function shuffleArray(originalArray, seedOrRNG) {
     const array = copyArray(originalArray);
     shuffleArrayInPlace(array, seedOrRNG);
     return array;
@@ -527,11 +496,11 @@ function shuffleArray(originalArray, seedOrRNG) {
  *                  `RNG.Next` method will be called. If `undefined` is provided, it will default to
  *                  a random seed.
  */
-function shuffleArrayInPlace(
+export function shuffleArrayInPlace(
 // eslint-disable-next-line complete/prefer-readonly-parameter-types
 array, seedOrRNG) {
     let currentIndex = array.length;
-    const rng = (0, rng_1.isRNG)(seedOrRNG) ? seedOrRNG : (0, rng_1.newRNG)(seedOrRNG);
+    const rng = isRNG(seedOrRNG) ? seedOrRNG : newRNG(seedOrRNG);
     while (currentIndex > 0) {
         currentIndex--;
         const randomIndex = getRandomArrayIndex(array, rng);
@@ -539,13 +508,13 @@ array, seedOrRNG) {
     }
 }
 /** Helper function to sum every value in an array together. */
-function sumArray(array) {
+export function sumArray(array) {
     return array.reduce((accumulator, element) => accumulator + element, 0);
 }
 /**
  * Helper function to swap two different array elements. (The elements will be swapped in-place.)
  */
-function swapArrayElements(
+export function swapArrayElements(
 // eslint-disable-next-line complete/prefer-readonly-parameter-types
 array, i, j) {
     const value1 = array[i]; // eslint-disable-line @typescript-eslint/no-non-null-assertion

package/dist/functions/arrayLua.js

@@ -1,4 +1,3 @@
-"use strict";
 /**
  * These are a collection of functions for non-TypeScript users so that they can access some of
  * useful methods offered on the `Array` class in the JavaScript standard library.
@@ -8,21 +7,13 @@
  *
  * @module
  */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.every = every;
-exports.filter = filter;
-exports.find = find;
-exports.forEach = forEach;
-exports.join = join;
-exports.map = map;
-exports.some = some;
 /**
  * Helper function for non-TypeScript users to check if every element in the array is equal to a
  * condition.
  *
  * Internally, this just calls `Array.every`.
  */
-function every(array, func) {
+export function every(array, func) {
     return array.every(func);
 }
 /**
@@ -31,7 +22,7 @@ function every(array, func) {
  *
  * Internally, this just calls `Array.filter`.
  */
-function filter(array, func) {
+export function filter(array, func) {
     return array.filter(func);
 }
 /**
@@ -39,7 +30,7 @@ function filter(array, func) {
  *
  * Internally, this just calls `Array.find`.
  */
-function find(array, func) {
+export function find(array, func) {
     return array.find(func);
 }
 /**
@@ -47,7 +38,7 @@ function find(array, func) {
  *
  * Internally, this just calls `Array.forEach`.
  */
-function forEach(array, func) {
+export function forEach(array, func) {
     array.forEach(func); // eslint-disable-line unicorn/no-for-each
 }
 // `includes` is not included since there is a normal array helper function of that name.
@@ -57,7 +48,7 @@ function forEach(array, func) {
  *
  * Internally, this just calls `Array.join`.
  */
-function join(array, separator) {
+export function join(array, separator) {
     return array.join(separator);
 }
 /**
@@ -66,7 +57,7 @@ function join(array, separator) {
  *
  * Internally, this just calls `Array.map`.
  */
-function map(array, func) {
+export function map(array, func) {
     return array.map(func);
 }
 /**
@@ -75,6 +66,6 @@ function map(array, func) {
  *
  * Internally, this just calls `Array.some`.
  */
-function some(array, func) {
+export function some(array, func) {
     return array.some(func);
 }

package/dist/functions/benchmark.js

@@ -1,7 +1,4 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.benchmark = benchmark;
-const log_1 = require("./log");
+import { log } from "./log";
 /**
  * Helper function to benchmark the performance of a function.
  *
@@ -15,8 +12,8 @@ const log_1 = require("./log");
  * @returns An array containing the average time in milliseconds for each function. (This will also
  *          be printed to the log.)
  */
-function benchmark(numTrials, ...functions) {
-    (0, log_1.log)(`Benchmarking ${functions.length} function(s) with ${numTrials} trials.`);
+export function benchmark(numTrials, ...functions) {
+    log(`Benchmarking ${functions.length} function(s) with ${numTrials} trials.`);
     const averages = [];
     for (const [i, func] of functions.entries()) {
         let totalTimeMilliseconds = 0;
@@ -28,7 +25,7 @@ function benchmark(numTrials, ...functions) {
             totalTimeMilliseconds += elapsedTimeMilliseconds;
         }
         const averageTimeMilliseconds = totalTimeMilliseconds / numTrials;
-        (0, log_1.log)(`The average time of the function at index ${i} is: ${averageTimeMilliseconds} milliseconds`);
+        log(`The average time of the function at index ${i} is: ${averageTimeMilliseconds} milliseconds`);
         averages.push(averageTimeMilliseconds);
     }
     return averages;

package/dist/functions/bitSet128.js

@@ -1,19 +1,12 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.copyBitSet128 = copyBitSet128;
-exports.deserializeBitSet128 = deserializeBitSet128;
-exports.isBitSet128 = isBitSet128;
-exports.isSerializedBitSet128 = isSerializedBitSet128;
-exports.serializeBitSet128 = serializeBitSet128;
-const SerializationBrand_1 = require("../enums/private/SerializationBrand");
-const isaacAPIClass_1 = require("./isaacAPIClass");
-const table_1 = require("./table");
-const types_1 = require("./types");
-const utils_1 = require("./utils");
+import { SerializationBrand } from "../enums/private/SerializationBrand";
+import { isIsaacAPIClassOfType } from "./isaacAPIClass";
+import { copyUserdataValuesToTable, getNumbersFromTable, tableHasKeys, } from "./table";
+import { isTable } from "./types";
+import { assertDefined } from "./utils";
 const OBJECT_NAME = "BitSet128";
 const KEYS = ["l", "h"];
 /** Helper function to copy a `BitSet128` Isaac API class. */
-function copyBitSet128(bitSet128) {
+export function copyBitSet128(bitSet128) {
     if (!isBitSet128(bitSet128)) {
         error(`Failed to copy a ${OBJECT_NAME} object since the provided object was not a userdata ${OBJECT_NAME} class.`);
     }
@@ -25,39 +18,39 @@ function copyBitSet128(bitSet128) {
  * Helper function to convert a `SerializedBitSet128` object to a normal `BitSet128` object. (This
  * is used by the save data manager when reading data from the "save#.dat" file.)
  */
-function deserializeBitSet128(bitSet128) {
-    if (!(0, types_1.isTable)(bitSet128)) {
+export function deserializeBitSet128(bitSet128) {
+    if (!isTable(bitSet128)) {
         error(`Failed to deserialize a ${OBJECT_NAME} object since the provided object was not a Lua table.`);
     }
-    const [l, h] = (0, table_1.getNumbersFromTable)(bitSet128, OBJECT_NAME, ...KEYS);
-    (0, utils_1.assertDefined)(l, `Failed to deserialize a ${OBJECT_NAME} object since the provided object did not have a value for: l`);
-    (0, utils_1.assertDefined)(h, `Failed to deserialize a ${OBJECT_NAME} object since the provided object did not have a value for: h`);
+    const [l, h] = getNumbersFromTable(bitSet128, OBJECT_NAME, ...KEYS);
+    assertDefined(l, `Failed to deserialize a ${OBJECT_NAME} object since the provided object did not have a value for: l`);
+    assertDefined(h, `Failed to deserialize a ${OBJECT_NAME} object since the provided object did not have a value for: h`);
     return BitSet128(l, h);
 }
 /** Helper function to check if something is an instantiated `BitSet128` object. */
-function isBitSet128(object) {
-    return (0, isaacAPIClass_1.isIsaacAPIClassOfType)(object, OBJECT_NAME);
+export function isBitSet128(object) {
+    return isIsaacAPIClassOfType(object, OBJECT_NAME);
 }
 /**
  * Used to determine is the given table is a serialized `BitSet128` object created by the `deepCopy`
  * function.
  */
-function isSerializedBitSet128(object) {
-    if (!(0, types_1.isTable)(object)) {
+export function isSerializedBitSet128(object) {
+    if (!isTable(object)) {
         return false;
     }
-    return ((0, table_1.tableHasKeys)(object, ...KEYS) && object.has(SerializationBrand_1.SerializationBrand.BIT_SET_128));
+    return (tableHasKeys(object, ...KEYS) && object.has(SerializationBrand.BIT_SET_128));
 }
 /**
  * Helper function to convert a `BitSet128` object to a `SerializedBitSet128` object. (This is used
  * by the save data manager when writing data from the "save#.dat" file.)
  */
-function serializeBitSet128(bitSet128) {
+export function serializeBitSet128(bitSet128) {
     if (!isBitSet128(bitSet128)) {
         error(`Failed to serialize a ${OBJECT_NAME} object since the provided object was not a userdata ${OBJECT_NAME} class.`);
     }
     const bitSet128Table = new LuaMap();
-    (0, table_1.copyUserdataValuesToTable)(bitSet128, KEYS, bitSet128Table);
-    bitSet128Table.set(SerializationBrand_1.SerializationBrand.BIT_SET_128, "");
+    copyUserdataValuesToTable(bitSet128, KEYS, bitSet128Table);
+    bitSet128Table.set(SerializationBrand.BIT_SET_128, "");
     return bitSet128Table;
 }

package/dist/functions/bitwise.js

@@ -1,25 +1,16 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.arrayToBitFlags = arrayToBitFlags;
-exports.convertBinaryToDecimal = convertBinaryToDecimal;
-exports.convertDecimalToBinary = convertDecimalToBinary;
-exports.countSetBits = countSetBits;
-exports.getKBitOfN = getKBitOfN;
-exports.getNumBitsOfN = getNumBitsOfN;
-exports.setToBitFlags = setToBitFlags;
-const flag_1 = require("./flag");
-const types_1 = require("./types");
-const utils_1 = require("./utils");
+import { addFlag } from "./flag";
+import { parseIntSafe } from "./types";
+import { assertDefined } from "./utils";
 /** Helper function to convert a set of flags to a single `BitFlags` object. */
-function arrayToBitFlags(array) {
+export function arrayToBitFlags(array) {
     let flags = 0;
     for (const flag of array) {
-        flags = (0, flag_1.addFlag)(flags, flag);
+        flags = addFlag(flags, flag);
     }
     return flags;
 }
 /** Helper function to convert an array of bits to the resulting decimal number. */
-function convertBinaryToDecimal(bits) {
+export function convertBinaryToDecimal(bits) {
     const bitsString = bits.join("");
     return Number.parseInt(bitsString, 2);
 }
@@ -32,12 +23,12 @@ function convertBinaryToDecimal(bits) {
  *                  side until the minimum length is met. Default is undefined (which will not cause
  *                  any padding).
  */
-function convertDecimalToBinary(num, minLength) {
+export function convertDecimalToBinary(num, minLength) {
     const bits = [];
     const bitsString = num.toString(2);
     for (const bitString of bitsString) {
-        const bit = (0, types_1.parseIntSafe)(bitString);
-        (0, utils_1.assertDefined)(bit, `Failed to convert the following number to binary: ${num}`);
+        const bit = parseIntSafe(bitString);
+        assertDefined(bit, `Failed to convert the following number to binary: ${num}`);
         bits.push(bit);
     }
     if (minLength !== undefined) {
@@ -52,7 +43,7 @@ function convertDecimalToBinary(num, minLength) {
  * Helper function to count the number of bits that are set to 1 in a binary representation of a
  * number.
  */
-function countSetBits(num) {
+export function countSetBits(num) {
     let count = 0;
     while (num > 0) {
         num &= num - 1;
@@ -61,11 +52,11 @@ function countSetBits(num) {
     return count;
 }
 /** Helper function to get the value of a specific but in a binary representation of a number. */
-function getKBitOfN(k, n) {
+export function getKBitOfN(k, n) {
     return (n >>> k) & 1;
 }
 /** Helper function to get the number of bits in a binary representation of a number. */
-function getNumBitsOfN(n) {
+export function getNumBitsOfN(n) {
     let numBits = 0;
     while (n > 0) {
         numBits++;
@@ -74,10 +65,10 @@ function getNumBitsOfN(n) {
     return numBits;
 }
 /** Helper function to convert a set of flags to a single `BitFlags` object. */
-function setToBitFlags(set) {
+export function setToBitFlags(set) {
     let flags = 0;
     for (const flag of set) {
-        flags = (0, flag_1.addFlag)(flags, flag);
+        flags = addFlag(flags, flag);
     }
     return flags;
 }

package/dist/functions/bombs.js

@@ -1,8 +1,5 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.getBombRadiusFromDamage = getBombRadiusFromDamage;
 /** Helper function to find out how large a bomb explosion is based on the damage inflicted. */
-function getBombRadiusFromDamage(damage) {
+export function getBombRadiusFromDamage(damage) {
     if (damage > 175) {
         return 105;
     }