isaacscript-common 67.0.0 → 67.1.0

package/dist/index.rollup.d.ts

@@ -1862,7 +1862,7 @@ export declare function countEntities(entityType?: EntityType | -1, variant?: nu
  * Helper function to count the number of bits that are set to 1 in a binary representation of a
  * number.
  */
-export declare function countSetBits(n: int): int;
+export declare function countSetBits(num: int): int;
 
 /**
  * The base class for a custom callback. Individual custom callbacks (and validation callbacks) will
@@ -16091,7 +16091,7 @@ export declare function renderTextOnEntity(entity: Entity | GridEntity, text: st
  * });
  * ```
  */
-export declare function repeat(n: int, func: (i: int) => void): void;
+export declare function repeat(num: int, func: (i: int) => void): void;
 
 /**
  * Helper function to reroll an enemy. Use this instead of the vanilla "Game.RerollEnemy" function
@@ -17947,6 +17947,22 @@ export declare function spawnVoidPortal(gridIndex: int): GridEntity | undefined;
  */
 export declare function spawnWithSeed(entityType: EntityType, variant: int, subType: int, positionOrGridIndex: Vector | int, seedOrRNG: Seed | RNG, velocity?: Vector, spawner?: Entity | undefined): Entity;
 
+/**
+ * Breaks a number into chunks of a given size. This is similar to the `String.split` method, but
+ * for a number instead of a string.
+ *
+ * For example, `splitNumber(90, 25)` would return an array with four elements:
+ *
+ * - [1, 25]
+ * - [26, 50]
+ * - [51, 75]
+ * - [76, 90]
+ *
+ * @param num The number to split into chunks. This must be a positive integer.
+ * @param size The size of each chunk. This must be a positive integer.
+ */
+export declare function splitNumber(num: int, size: int): Array<[min: int, max: int]>;
+
 /**
  * Helper function to check if two sprite layers have the same sprite sheet by using the
  * `Sprite.GetTexel` method.

package/dist/isaacscript-common.lua

@@ -1,6 +1,6 @@
 --[[
 
-isaacscript-common 67.0.0
+isaacscript-common 67.1.0
 
 This is the "isaacscript-common" library, which was created with the IsaacScript tool.
 
@@ -16336,10 +16336,10 @@ function ____exports.isRepentance(self)
     local getAnimation = classTable.GetAnimation
     return isFunction(nil, getAnimation)
 end
-____exports["repeat"] = function(self, n, func)
+____exports["repeat"] = function(self, num, func)
     do
         local i = 0
-        while i < n do
+        while i < num do
             func(nil, i)
             i = i + 1
         end
@@ -20285,6 +20285,22 @@ function ____exports.sign(self, n)
     end
     return 0
 end
+function ____exports.splitNumber(self, num, size)
+    if num <= 0 then
+        error("The number to split needs to be a positive number and is instead: " .. tostring(num))
+    end
+    if size <= 0 then
+        error("The size to split needs to be a positive number and is instead: " .. tostring(num))
+    end
+    local chunks = {}
+    local min = 1
+    while min <= num do
+        local max = math.min(min + size - 1, num)
+        chunks[#chunks + 1] = {min, max}
+        min = max + 1
+    end
+    return chunks
+end
 function ____exports.tanh(self, x)
     return (math.exp(x) - math.exp(-x)) / (math.exp(x) + math.exp(-x))
 end
@@ -20642,10 +20658,10 @@ function ____exports.convertDecimalToBinary(self, num, minLength)
     end
     return bits
 end
-function ____exports.countSetBits(self, n)
+function ____exports.countSetBits(self, num)
     local count = 0
-    while n > 0 do
-        n = n & n - 1
+    while num > 0 do
+        num = num & num - 1
         count = count + 1
     end
     return count

package/dist/src/functions/bitwise.d.ts

@@ -20,7 +20,7 @@ export declare function convertDecimalToBinary(num: number, minLength?: int): in
  * Helper function to count the number of bits that are set to 1 in a binary representation of a
  * number.
  */
-export declare function countSetBits(n: int): int;
+export declare function countSetBits(num: int): int;
 /** Helper function to get the value of a specific but in a binary representation of a number. */
 export declare function getKBitOfN(k: int, n: int): int;
 /** Helper function to get the number of bits in a binary representation of a number. */

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

@@ -1 +1 @@
-{"version":3,"file":"bitwise.d.ts","sourceRoot":"","sources":["../../../src/functions/bitwise.ts"],"names":[],"mappings":";;;;AAGA,+EAA+E;AAC/E,wBAAgB,eAAe,CAAC,CAAC,SAAS,OAAO,GAAG,UAAU,EAC5D,KAAK,EAAE,CAAC,EAAE,GAAG,SAAS,CAAC,EAAE,GACxB,QAAQ,CAAC,CAAC,CAAC,CAOb;AAED,mFAAmF;AACnF,wBAAgB,sBAAsB,CAAC,IAAI,EAAE,GAAG,EAAE,GAAG,MAAM,CAG1D;AAED;;;;;;;;GAQG;AACH,wBAAgB,sBAAsB,CAAC,GAAG,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,GAAG,GAAG,GAAG,EAAE,CAqB1E;AAED;;;GAGG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,GAAG,GAAG,GAAG,CASxC;AAED,iGAAiG;AACjG,wBAAgB,UAAU,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,GAAG,GAAG,CAE9C;AAED,wFAAwF;AACxF,wBAAgB,aAAa,CAAC,CAAC,EAAE,GAAG,GAAG,GAAG,CAQzC;AAED,+EAA+E;AAC/E,wBAAgB,aAAa,CAAC,CAAC,SAAS,OAAO,GAAG,UAAU,EAC1D,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,GAC3B,QAAQ,CAAC,CAAC,CAAC,CAOb"}
+{"version":3,"file":"bitwise.d.ts","sourceRoot":"","sources":["../../../src/functions/bitwise.ts"],"names":[],"mappings":";;;;AAGA,+EAA+E;AAC/E,wBAAgB,eAAe,CAAC,CAAC,SAAS,OAAO,GAAG,UAAU,EAC5D,KAAK,EAAE,CAAC,EAAE,GAAG,SAAS,CAAC,EAAE,GACxB,QAAQ,CAAC,CAAC,CAAC,CAOb;AAED,mFAAmF;AACnF,wBAAgB,sBAAsB,CAAC,IAAI,EAAE,GAAG,EAAE,GAAG,MAAM,CAG1D;AAED;;;;;;;;GAQG;AACH,wBAAgB,sBAAsB,CAAC,GAAG,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,GAAG,GAAG,GAAG,EAAE,CAqB1E;AAED;;;GAGG;AACH,wBAAgB,YAAY,CAAC,GAAG,EAAE,GAAG,GAAG,GAAG,CAS1C;AAED,iGAAiG;AACjG,wBAAgB,UAAU,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,GAAG,GAAG,CAE9C;AAED,wFAAwF;AACxF,wBAAgB,aAAa,CAAC,CAAC,EAAE,GAAG,GAAG,GAAG,CAQzC;AAED,+EAA+E;AAC/E,wBAAgB,aAAa,CAAC,CAAC,SAAS,OAAO,GAAG,UAAU,EAC1D,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,GAC3B,QAAQ,CAAC,CAAC,CAAC,CAOb"}

package/dist/src/functions/bitwise.lua

@@ -49,10 +49,10 @@ function ____exports.convertDecimalToBinary(self, num, minLength)
 end
 --- Helper function to count the number of bits that are set to 1 in a binary representation of a
 -- number.
-function ____exports.countSetBits(self, n)
+function ____exports.countSetBits(self, num)
     local count = 0
-    while n > 0 do
-        n = n & n - 1
+    while num > 0 do
+        num = num & num - 1
         count = count + 1
     end
     return count

package/dist/src/functions/math.d.ts

@@ -46,5 +46,20 @@ export declare function lerpAngleDegrees(aStart: number, aEnd: number, percent:
 export declare function round(num: float, numDecimalPlaces?: number): float;
 /** @returns 1 if n is positive, -1 if n is negative, or 0 if n is 0. */
 export declare function sign(n: number): int;
+/**
+ * Breaks a number into chunks of a given size. This is similar to the `String.split` method, but
+ * for a number instead of a string.
+ *
+ * For example, `splitNumber(90, 25)` would return an array with four elements:
+ *
+ * - [1, 25]
+ * - [26, 50]
+ * - [51, 75]
+ * - [76, 90]
+ *
+ * @param num The number to split into chunks. This must be a positive integer.
+ * @param size The size of each chunk. This must be a positive integer.
+ */
+export declare function splitNumber(num: int, size: int): Array<[min: int, max: int]>;
 export declare function tanh(x: number): number;
 //# sourceMappingURL=math.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"math.d.ts","sourceRoot":"","sources":["../../../src/functions/math.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,MAAM,8BAA8B,CAAC;AAGzD;;;;;GAKG;AACH,wBAAgB,KAAK,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,GAAG,GAAG,CAEvD;AAED,wBAAgB,kBAAkB,CAAC,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,GAAG,KAAK,CAGtE;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,0BAA0B,CACxC,SAAS,EAAE,MAAM,EACjB,MAAM,EAAE,KAAK,EACb,SAAS,EAAE,GAAG,EACd,WAAW,SAAI,EACf,WAAW,SAAI,EACf,gBAAgB,YAAe,GAC9B,MAAM,EAAE,CAaV;AAED;;;;;GAKG;AACH,wBAAgB,WAAW,CACzB,QAAQ,EAAE,MAAM,EAChB,OAAO,EAAE,MAAM,EACf,WAAW,EAAE,MAAM,GAClB,OAAO,CAOT;AAED;;GAEG;AACH,wBAAgB,6BAA6B,CAC3C,YAAY,EAAE,MAAM,EACpB,YAAY,EAAE,KAAK,EACnB,gBAAgB,EAAE,MAAM,EACxB,oBAAoB,EAAE,MAAM,GAC3B,OAAO,CAgBT;AAED,wBAAgB,MAAM,CAAC,GAAG,EAAE,GAAG,GAAG,OAAO,CAGxC;AAED,wBAAgB,KAAK,CAAC,GAAG,EAAE,GAAG,GAAG,OAAO,CAGvC;AAED,wBAAgB,IAAI,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,KAAK,GAAG,MAAM,CAE7D;AAED,wBAAgB,gBAAgB,CAC9B,MAAM,EAAE,MAAM,EACd,IAAI,EAAE,MAAM,EACZ,OAAO,EAAE,KAAK,GACb,MAAM,CAER;AAED;;;;;;;GAOG;AACH,wBAAgB,KAAK,CAAC,GAAG,EAAE,KAAK,EAAE,gBAAgB,SAAI,GAAG,KAAK,CAG7D;AAED,wEAAwE;AACxE,wBAAgB,IAAI,CAAC,CAAC,EAAE,MAAM,GAAG,GAAG,CAUnC;AAED,wBAAgB,IAAI,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAEtC"}
+{"version":3,"file":"math.d.ts","sourceRoot":"","sources":["../../../src/functions/math.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,MAAM,8BAA8B,CAAC;AAGzD;;;;;GAKG;AACH,wBAAgB,KAAK,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,GAAG,GAAG,CAEvD;AAED,wBAAgB,kBAAkB,CAAC,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,GAAG,KAAK,CAGtE;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,0BAA0B,CACxC,SAAS,EAAE,MAAM,EACjB,MAAM,EAAE,KAAK,EACb,SAAS,EAAE,GAAG,EACd,WAAW,SAAI,EACf,WAAW,SAAI,EACf,gBAAgB,YAAe,GAC9B,MAAM,EAAE,CAaV;AAED;;;;;GAKG;AACH,wBAAgB,WAAW,CACzB,QAAQ,EAAE,MAAM,EAChB,OAAO,EAAE,MAAM,EACf,WAAW,EAAE,MAAM,GAClB,OAAO,CAOT;AAED;;GAEG;AACH,wBAAgB,6BAA6B,CAC3C,YAAY,EAAE,MAAM,EACpB,YAAY,EAAE,KAAK,EACnB,gBAAgB,EAAE,MAAM,EACxB,oBAAoB,EAAE,MAAM,GAC3B,OAAO,CAgBT;AAED,wBAAgB,MAAM,CAAC,GAAG,EAAE,GAAG,GAAG,OAAO,CAGxC;AAED,wBAAgB,KAAK,CAAC,GAAG,EAAE,GAAG,GAAG,OAAO,CAGvC;AAED,wBAAgB,IAAI,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,KAAK,GAAG,MAAM,CAE7D;AAED,wBAAgB,gBAAgB,CAC9B,MAAM,EAAE,MAAM,EACd,IAAI,EAAE,MAAM,EACZ,OAAO,EAAE,KAAK,GACb,MAAM,CAER;AAED;;;;;;;GAOG;AACH,wBAAgB,KAAK,CAAC,GAAG,EAAE,KAAK,EAAE,gBAAgB,SAAI,GAAG,KAAK,CAG7D;AAED,wEAAwE;AACxE,wBAAgB,IAAI,CAAC,CAAC,EAAE,MAAM,GAAG,GAAG,CAUnC;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAgB,WAAW,CAAC,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,GAAG,KAAK,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAuB5E;AAED,wBAAgB,IAAI,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAEtC"}

package/dist/src/functions/math.lua

@@ -113,6 +113,34 @@ function ____exports.sign(self, n)
     end
     return 0
 end
+--- Breaks a number into chunks of a given size. This is similar to the `String.split` method, but
+-- for a number instead of a string.
+-- 
+-- For example, `splitNumber(90, 25)` would return an array with four elements:
+-- 
+-- - [1, 25]
+-- - [26, 50]
+-- - [51, 75]
+-- - [76, 90]
+-- 
+-- @param num The number to split into chunks. This must be a positive integer.
+-- @param size The size of each chunk. This must be a positive integer.
+function ____exports.splitNumber(self, num, size)
+    if num <= 0 then
+        error("The number to split needs to be a positive number and is instead: " .. tostring(num))
+    end
+    if size <= 0 then
+        error("The size to split needs to be a positive number and is instead: " .. tostring(num))
+    end
+    local chunks = {}
+    local min = 1
+    while min <= num do
+        local max = math.min(min + size - 1, num)
+        chunks[#chunks + 1] = {min, max}
+        min = max + 1
+    end
+    return chunks
+end
 function ____exports.tanh(self, x)
     return (math.exp(x) - math.exp(-x)) / (math.exp(x) + math.exp(-x))
 end

package/dist/src/functions/utils.d.ts

@@ -115,7 +115,7 @@ export declare function isRepentance(): boolean;
  * });
  * ```
  */
-export declare function repeat(n: int, func: (i: int) => void): void;
+export declare function repeat(num: int, func: (i: int) => void): void;
 /**
  * Helper function to signify that the enclosing code block is not yet complete. Using this function
  * is similar to writing a "TODO" comment, but it has the benefit of preventing ESLint errors due to

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

@@ -1 +1 @@
-{"version":3,"file":"utils.d.ts","sourceRoot":"","sources":["../../../src/functions/utils.ts"],"names":[],"mappings":";AAIA;;;;;GAKG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAC7B,KAAK,EAAE,CAAC,EACR,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,GAC7B,CAAC,MAAM,CAAC,GACR;IACE,iFAAiF;CAClF,GACJ,OAAO,CAAC,KAAK,IAAI,OAAO,CAAC,CAAC,EAAE,SAAS,CAAC,CAIxC;AAED;;;;;GAKG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAC7B,KAAK,EAAE,CAAC,EACR,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,GACxB,CAAC,MAAM,CAAC,GACR;IACE,4EAA4E;CAC7E,GACJ,OAAO,CAAC,KAAK,IAAI,OAAO,CAAC,CAAC,EAAE,IAAI,CAAC,CAInC;AAED;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,wBAAgB,MAAM,CAAC,KAAK,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,SAAS,SAAI,GAAG,GAAG,EAAE,CAkBlE;AAED;;;GAGG;AACH,wBAAgB,uBAAuB,CACrC,GAAG,EAAE,OAAO,EACZ,oBAAoB,EAAE,MAAM,GAC3B,MAAM,CAQR;AAED;;;;;;;;;;;;;;;;;;;GAmBG;AACH,wBAAgB,MAAM,CAAC,KAAK,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,SAAS,SAAI,GAAG,GAAG,EAAE,CAQlE;AAED;;;;;;;;;GASG;AACH,wBAAgB,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,GAAG,OAAO,CAE/D;AAED;;;;;;;;GAQG;AACH,wBAAgB,aAAa,IAAI,OAAO,CAMvC;AAED;;;;;;;GAOG;AACH,wBAAgB,YAAY,IAAI,OAAO,CAiBtC;AAED;;;;;;;;;;;;;;;;;;;GAmBG;AACH,wBAAgB,MAAM,CAAC,CAAC,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,GAAG,KAAK,IAAI,GAAG,IAAI,CAI3D;AAED;;;;;;;;;;;;;;GAcG;AAEH,wBAAgB,IAAI,CAAC,GAAG,IAAI,EAAE,OAAO,EAAE,GAAG,IAAI,CAAG"}
+{"version":3,"file":"utils.d.ts","sourceRoot":"","sources":["../../../src/functions/utils.ts"],"names":[],"mappings":";AAIA;;;;;GAKG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAC7B,KAAK,EAAE,CAAC,EACR,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,GAC7B,CAAC,MAAM,CAAC,GACR;IACE,iFAAiF;CAClF,GACJ,OAAO,CAAC,KAAK,IAAI,OAAO,CAAC,CAAC,EAAE,SAAS,CAAC,CAIxC;AAED;;;;;GAKG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAC7B,KAAK,EAAE,CAAC,EACR,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,GACxB,CAAC,MAAM,CAAC,GACR;IACE,4EAA4E;CAC7E,GACJ,OAAO,CAAC,KAAK,IAAI,OAAO,CAAC,CAAC,EAAE,IAAI,CAAC,CAInC;AAED;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,wBAAgB,MAAM,CAAC,KAAK,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,SAAS,SAAI,GAAG,GAAG,EAAE,CAkBlE;AAED;;;GAGG;AACH,wBAAgB,uBAAuB,CACrC,GAAG,EAAE,OAAO,EACZ,oBAAoB,EAAE,MAAM,GAC3B,MAAM,CAQR;AAED;;;;;;;;;;;;;;;;;;;GAmBG;AACH,wBAAgB,MAAM,CAAC,KAAK,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,SAAS,SAAI,GAAG,GAAG,EAAE,CAQlE;AAED;;;;;;;;;GASG;AACH,wBAAgB,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,GAAG,OAAO,CAE/D;AAED;;;;;;;;GAQG;AACH,wBAAgB,aAAa,IAAI,OAAO,CAMvC;AAED;;;;;;;GAOG;AACH,wBAAgB,YAAY,IAAI,OAAO,CAiBtC;AAED;;;;;;;;;;;;;;;;;;;GAmBG;AACH,wBAAgB,MAAM,CAAC,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,GAAG,KAAK,IAAI,GAAG,IAAI,CAI7D;AAED;;;;;;;;;;;;;;GAcG;AAEH,wBAAgB,IAAI,CAAC,GAAG,IAAI,EAAE,OAAO,EAAE,GAAG,IAAI,CAAG"}

package/dist/src/functions/utils.lua

@@ -175,10 +175,10 @@ end
 --   print(i); // Prints "0", "1", "2"
 -- });
 -- ```
-____exports["repeat"] = function(self, n, func)
+____exports["repeat"] = function(self, num, func)
     do
         local i = 0
-        while i < n do
+        while i < num do
             func(nil, i)
             i = i + 1
         end

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "isaacscript-common",
-  "version": "67.0.0",
+  "version": "67.1.0",
   "description": "Helper functions and features for IsaacScript mods.",
   "keywords": [
     "isaac",

package/src/functions/bitwise.ts

@@ -55,11 +55,11 @@ export function convertDecimalToBinary(num: number, minLength?: int): int[] {
  * Helper function to count the number of bits that are set to 1 in a binary representation of a
  * number.
  */
-export function countSetBits(n: int): int {
+export function countSetBits(num: int): int {
   let count = 0;
 
-  while (n > 0) {
-    n &= n - 1;
+  while (num > 0) {
+    num &= num - 1;
     count++;
   }
 

package/src/functions/math.ts

@@ -143,6 +143,45 @@ export function sign(n: number): int {
   return 0;
 }
 
+/**
+ * Breaks a number into chunks of a given size. This is similar to the `String.split` method, but
+ * for a number instead of a string.
+ *
+ * For example, `splitNumber(90, 25)` would return an array with four elements:
+ *
+ * - [1, 25]
+ * - [26, 50]
+ * - [51, 75]
+ * - [76, 90]
+ *
+ * @param num The number to split into chunks. This must be a positive integer.
+ * @param size The size of each chunk. This must be a positive integer.
+ */
+export function splitNumber(num: int, size: int): Array<[min: int, max: int]> {
+  if (num <= 0) {
+    error(
+      `The number to split needs to be a positive number and is instead: ${num}`,
+    );
+  }
+
+  if (size <= 0) {
+    error(
+      `The size to split needs to be a positive number and is instead: ${num}`,
+    );
+  }
+
+  const chunks: Array<[number, number]> = [];
+  let min = 1;
+
+  while (min <= num) {
+    const max = Math.min(min + size - 1, num);
+    chunks.push([min, max]);
+    min = max + 1;
+  }
+
+  return chunks;
+}
+
 export function tanh(x: number): number {
   return (Math.exp(x) - Math.exp(-x)) / (Math.exp(x) + Math.exp(-x));
 }

package/src/functions/utils.ts

@@ -206,8 +206,8 @@ export function isRepentance(): boolean {
  * });
  * ```
  */
-export function repeat(n: int, func: (i: int) => void): void {
-  for (let i = 0; i < n; i++) {
+export function repeat(num: int, func: (i: int) => void): void {
+  for (let i = 0; i < num; i++) {
     func(i);
   }
 }