@rian8337/osu-base 4.0.0-beta.85 → 4.0.0-beta.87

package/dist/index.js

@@ -132,6 +132,16 @@ class MathUtils {
     static logistic(exponent, maxValue = 1) {
         return maxValue / (1 + Math.exp(exponent));
     }
+    /**
+     * Calculates the p-norm of an n-dimensional vector.
+     *
+     * @param p The order of the norm.
+     * @param coefficients The coefficients of the vector.
+     * @returns The p-norm of the vector.
+     */
+    static norm(p, ...coefficients) {
+        return Math.pow(coefficients.reduce((a, v) => a + Math.pow(v, p), 0), 1 / p);
+    }
     /**
      * Calculates an S-shaped {@link https://en.wikipedia.org/wiki/Logistic_function logistic function}
      * with offset at `x`.
@@ -404,7 +414,7 @@ class BankHitSampleInfo extends HitSampleInfo {
                 break;
         }
         if (this.customSampleBank >= 2) {
-            names.push(`${prefix}-${this.name}${this.customSampleBank}`);
+            names.push(`${prefix}-${this.name}${this.customSampleBank.toString()}`);
         }
         names.push(`${prefix}-${this.name}`, this.name);
         return names;
@@ -573,6 +583,7 @@ class PreciseDroidHitWindow extends HitWindow {
     }
 }
 
+/* eslint-disable @typescript-eslint/prefer-literal-enum-member */
 /**
  * Bitmask constant of object types. This is needed as osu! uses bits to determine object types.
  */
@@ -713,7 +724,7 @@ class Vector2 {
      * Returns a string representation of the vector.
      */
     toString() {
-        return `${this.x},${this.y}`;
+        return `${this.x.toString()},${this.y.toString()}`;
     }
 }
 
@@ -741,6 +752,7 @@ class BeatmapDifficulty {
      * @param min Minimum of the resulting range which will be achieved by a difficulty value of 0.
      * @param mid Midpoint of the resulting range which will be achieved by a difficulty value of 5.
      * @param max Maximum of the resulting range which will be achieved by a difficulty value of 10.
+     * @returns The value to which the difficulty value maps in the specified range.
      */
     static difficultyRange(difficulty, min, mid, max) {
         switch (true) {
@@ -752,6 +764,19 @@ class BeatmapDifficulty {
                 return mid;
         }
     }
+    /**
+     * Maps a difficulty value [0, 10] to a two-piece linear range of values. Floors the value to an integer,
+     * usually to match osu!stable specifications.
+     *
+     * @param difficulty The difficulty value to be mapped.
+     * @param min Minimum of the resulting range which will be achieved by a difficulty value of 0.
+     * @param mid Midpoint of the resulting range which will be achieved by a difficulty value of 5.
+     * @param max Maximum of the resulting range which will be achieved by a difficulty value of 10.
+     * @returns The value to which the difficulty value maps in the specified range.
+     */
+    static difficultyRangeInt(difficulty, min, mid, max) {
+        return Math.trunc(BeatmapDifficulty.difficultyRange(difficulty, min, mid, max));
+    }
     /**
      * Inverse function to `difficultyRange`. Maps a value returned by the function back to the
      * difficulty that produced it.
@@ -1169,7 +1194,7 @@ class HitObject {
         if (this.hitWindow) {
             this.hitWindow.overallDifficulty = difficulty.od;
         }
-        this.timePreempt = BeatmapDifficulty.difficultyRange(difficulty.ar, HitObject.preemptMax, HitObject.preemptMid, HitObject.preemptMin);
+        this.timePreempt = BeatmapDifficulty.difficultyRangeInt(difficulty.ar, HitObject.preemptMax, HitObject.preemptMid, HitObject.preemptMin);
         // Preempt time can go below 450ms. Normally, this is achieved via the DT mod which uniformly speeds up all animations game wide regardless of AR.
         // This uniform speedup is hard to match 1:1, however we can at least make AR>10 (via mods) feel good by extending the upper linear function above.
         // Note that this doesn't exactly match the AR>10 visuals as they're classically known, but it feels good.
@@ -1370,6 +1395,7 @@ class ModSetting {
         /**
          * The formatter to display the value of this `ModSetting`.
          */
+        // eslint-disable-next-line @typescript-eslint/restrict-template-expressions
         this.displayFormatter = (v) => `${v}`;
         this.valueChangedListeners = new Set();
         this.name = name;
@@ -1618,7 +1644,7 @@ class SliderNestedHitObject extends HitObject {
         this.spanStartTime = values.spanStartTime;
     }
     toString() {
-        return `Position: [${this._position.x}, ${this._position.y}], span index: ${this.spanIndex}, span start time: ${this.spanStartTime}`;
+        return `Position: [${this.position.x.toString()}, ${this.position.y.toString()}], span index: ${this.spanIndex.toString()}, span start time: ${this.spanStartTime.toString()}`;
     }
 }
 
@@ -2016,7 +2042,9 @@ class Slider extends HitObject {
                 this.tickDistanceMultiplier
             : Number.POSITIVE_INFINITY;
         this.createNestedHitObjects(controlPoints);
-        this.nestedHitObjects.forEach((v) => v.applyDefaults(controlPoints, difficulty, mode));
+        this.nestedHitObjects.forEach((v) => {
+            v.applyDefaults(controlPoints, difficulty, mode);
+        });
     }
     applySamples(controlPoints) {
         super.applySamples(controlPoints);
@@ -2219,7 +2247,7 @@ class Slider extends HitObject {
         });
     }
     toString() {
-        return `Position: [${this.position.x}, ${this.position.y}], distance: ${this.path.expectedDistance}, repeat count: ${this.repeatCount}, slider ticks: ${this.nestedHitObjects.filter((v) => v instanceof SliderTick).length}`;
+        return `Position: [${this.position.x.toString()}, ${this.position.y.toString()}], distance: ${this.path.expectedDistance.toString()}, repeat count: ${this.repeatCount.toString()}, slider ticks: ${this.ticks.toString()}`;
     }
 }
 Slider.baseNormalSlideSample = new BankHitSampleInfo("sliderslide");
@@ -2227,43 +2255,6 @@ Slider.baseWhistleSlideSample = new BankHitSampleInfo("sliderwhistle");
 Slider.baseTickSample = new BankHitSampleInfo("slidertick");
 Slider.legacyLastTickOffset = 36;
 
-/**
- * Represents the Freeze Frame mod.
- */
-class ModFreezeFrame extends Mod {
-    constructor() {
-        super();
-        this.name = "Freeze Frame";
-        this.acronym = "FR";
-        this.droidRanked = false;
-        this.isDroidRelevant = true;
-        this.droidScoreMultiplier = 1;
-        this.osuRanked = false;
-        this.isOsuRelevant = true;
-        this.osuScoreMultiplier = 1;
-        this.lastNewComboTime = 0;
-        this.incompatibleMods.add(ModApproachDifferent);
-    }
-    applyToBeatmap(beatmap) {
-        this.lastNewComboTime = 0;
-        for (const hitObject of beatmap.hitObjects) {
-            if (hitObject.isNewCombo) {
-                this.lastNewComboTime = hitObject.startTime;
-            }
-            this.applyFadeInAdjustment(hitObject);
-        }
-    }
-    applyFadeInAdjustment(hitObject) {
-        hitObject.timePreempt += hitObject.startTime - this.lastNewComboTime;
-        if (hitObject instanceof Slider) {
-            // Freezing slider ticks doesn't play well with snaking sliders, and slider repeats will not
-            // layer correctly if its preempt is changed.
-            this.applyFadeInAdjustment(hitObject.head);
-            this.applyFadeInAdjustment(hitObject.tail);
-        }
-    }
-}
-
 /**
  * Represents the Traceable mod.
  */
@@ -2315,7 +2306,10 @@ class ModHidden extends Mod {
          * The main object body will not fade when enabled.
          */
         this.onlyFadeApproachCircles = new BooleanModSetting("Only fade approach circles", "The main object body will not fade when enabled.", false);
-        this.incompatibleMods.add(ModTraceable).add(ModApproachDifferent);
+        this.incompatibleMods
+            .add(ModTraceable)
+            .add(ModApproachDifferent)
+            .add(ModFreezeFrame);
     }
     get droidScoreMultiplier() {
         return this.usesDefaultSettings ? 1.06 : 1;
@@ -2354,6 +2348,43 @@ class ModHidden extends Mod {
 ModHidden.fadeInDurationMultiplier = 0.4;
 ModHidden.fadeOutDurationMultiplier = 0.3;
 
+/**
+ * Represents the Freeze Frame mod.
+ */
+class ModFreezeFrame extends Mod {
+    constructor() {
+        super();
+        this.name = "Freeze Frame";
+        this.acronym = "FR";
+        this.droidRanked = false;
+        this.isDroidRelevant = true;
+        this.droidScoreMultiplier = 1;
+        this.osuRanked = false;
+        this.isOsuRelevant = true;
+        this.osuScoreMultiplier = 1;
+        this.lastNewComboTime = 0;
+        this.incompatibleMods.add(ModApproachDifferent).add(ModHidden);
+    }
+    applyToBeatmap(beatmap) {
+        this.lastNewComboTime = 0;
+        for (const hitObject of beatmap.hitObjects) {
+            if (hitObject.isNewCombo) {
+                this.lastNewComboTime = hitObject.startTime;
+            }
+            this.applyFadeInAdjustment(hitObject);
+        }
+    }
+    applyFadeInAdjustment(hitObject) {
+        hitObject.timePreempt += hitObject.startTime - this.lastNewComboTime;
+        if (hitObject instanceof Slider) {
+            // Freezing slider ticks doesn't play well with snaking sliders, and slider repeats will not
+            // layer correctly if its preempt is changed.
+            this.applyFadeInAdjustment(hitObject.head);
+            this.applyFadeInAdjustment(hitObject.tail);
+        }
+    }
+}
+
 /**
  * Represents a `Mod` specific setting that is constrained to a range of values.
  */
@@ -2410,13 +2441,13 @@ class NumberModSetting extends RangeConstrainedModSetting {
         super(name, description, defaultValue, min, max, step);
         this.displayFormatter = (v) => v.toString();
         if (min > max) {
-            throw new RangeError(`The minimum value (${min}) must be less than or equal to the maximum value (${max}).`);
+            throw new RangeError(`The minimum value (${min.toString()}) must be less than or equal to the maximum value (${max.toString()}).`);
         }
         if (step < 0) {
-            throw new RangeError(`The step size (${step}) must be greater than or equal to 0.`);
+            throw new RangeError(`The step size (${step.toString()}) must be greater than or equal to 0.`);
         }
         if (defaultValue < min || defaultValue > max) {
-            throw new RangeError(`The default value (${defaultValue}) must be between the minimum (${min}) and maximum (${max}) values.`);
+            throw new RangeError(`The default value (${defaultValue.toString()}) must be between the minimum (${min.toString()}) and maximum (${max.toString()}) values.`);
         }
     }
     processValue(value) {
@@ -2438,7 +2469,7 @@ class DecimalModSetting extends NumberModSetting {
     }
     set precision(value) {
         if (value !== null && value < 0) {
-            throw new RangeError(`The precision (${value}) must be greater than or equal to 0.`);
+            throw new RangeError(`The precision (${value.toString()}) must be greater than or equal to 0.`);
         }
         this._precision = value;
         if (value !== null) {
@@ -2454,7 +2485,7 @@ class DecimalModSetting extends NumberModSetting {
             return super.toDisplayString();
         };
         if (precision !== null && precision < 0) {
-            throw new RangeError(`The precision (${precision}) must be greater than or equal to 0.`);
+            throw new RangeError(`The precision (${precision.toString()}) must be greater than or equal to 0.`);
         }
         this._precision = precision;
     }
@@ -2807,11 +2838,8 @@ class ModDeflate extends ModObjectScaleTween {
  * rectangle).
  */
 class Circle extends HitObject {
-    constructor(values) {
-        super(values);
-    }
     toString() {
-        return `Position: [${this._position.x}, ${this._position.y}]`;
+        return `Position: [${this.position.x.toString()}, ${this.position.y.toString()}]`;
     }
 }
 
@@ -2862,7 +2890,7 @@ class Spinner extends HitObject {
         return new EmptyHitWindow();
     }
     toString() {
-        return `Position: [${this._position.x}, ${this._position.y}], duration: ${this.duration}`;
+        return `Position: [${this.position.x.toString()}, ${this.position.y.toString()}], duration: ${this.duration.toString()}`;
     }
 }
 Spinner.baseSpinnerSpinSample = new BankHitSampleInfo("spinnerspin");
@@ -2992,26 +3020,15 @@ class HitObjectPositionInfo {
  * Precision utilities.
  */
 class Precision {
-    /**
-     * Checks if two numbers are equal with a given tolerance.
-     *
-     * @param value1 The first number.
-     * @param value2 The second number.
-     * @param acceptableDifference The acceptable difference as threshold. Default is `Precision.FLOAT_EPSILON = 1e-3`.
-     */
-    static almostEqualsNumber(value1, value2, acceptableDifference = this.FLOAT_EPSILON) {
-        return Math.abs(value1 - value2) <= acceptableDifference;
-    }
-    /**
-     * Checks if two vectors are equal with a given tolerance.
-     *
-     * @param vec1 The first vector.
-     * @param vec2 The second vector.
-     * @param acceptableDifference The acceptable difference as threshold. Default is `Precision.FLOAT_EPSILON = 1e-3`.
-     */
-    static almostEqualsVector(vec1, vec2, acceptableDifference = this.FLOAT_EPSILON) {
-        return (this.almostEqualsNumber(vec1.x, vec2.x, acceptableDifference) &&
-            this.almostEqualsNumber(vec1.y, vec2.y, acceptableDifference));
+    static almostEquals(value1, value2, acceptableDifference = this.FLOAT_EPSILON) {
+        if (value1 instanceof Vector2 && value2 instanceof Vector2) {
+            return (this.almostEquals(value1.x, value2.x, acceptableDifference) &&
+                this.almostEquals(value1.y, value2.y, acceptableDifference));
+        }
+        else {
+            return (Math.abs(value1 - value2) <=
+                acceptableDifference);
+        }
     }
     /**
      * Checks whether two real numbers are almost equal.
@@ -3161,7 +3178,7 @@ class PathApproximator {
         const c = controlPoints[2];
         // If we have a degenerate triangle where a side-length is almost zero, then give up and fall
         // back to a more numerically stable method.
-        if (Precision.almostEqualsNumber(0, (b.y - a.y) * (c.x - a.x) - (b.x - a.x) * (c.y - a.y))) {
+        if (Precision.almostEquals(0, (b.y - a.y) * (c.x - a.x) - (b.x - a.x) * (c.y - a.y))) {
             return this.approximateBezier(controlPoints);
         }
         // See: https://en.wikipedia.org/wiki/Circumscribed_circle#Cartesian_coordinates_2
@@ -3516,7 +3533,7 @@ class SliderPath {
         const d0 = this.cumulativeLength[i - 1];
         const d1 = this.cumulativeLength[i];
         // Avoid division by and almost-zero number in case two points are extremely close to each other.
-        if (Precision.almostEqualsNumber(d0, d1)) {
+        if (Precision.almostEquals(d0, d1)) {
             return p0;
         }
         const w = (d - d0) / (d1 - d0);
@@ -3758,7 +3775,7 @@ class HitObjectGenerationUtils {
     /**
      * Determines whether a {@link HitObject} is on a beat.
      *
-     * @param beatmap The {@link Beatmap} the {@link HitObject} is a part of.
+     * @param beatmap The {@link IBeatmap} the {@link HitObject} is a part of.
      * @param hitObject The {@link HitObject} to check.
      * @param downbeatsOnly If `true`, whether this method only returns `true` is on a downbeat.
      * @return `true` if the {@link HitObject} is on a (down-)beat, `false` otherwise.
@@ -3866,7 +3883,7 @@ class HitObjectGenerationUtils {
             this.getSliderRotation(current.hitObject)));
         const relativeRotation = Math.atan2(centerOfMassModified.y, centerOfMassModified.x) -
             Math.atan2(centerOfMassOriginal.y, centerOfMassOriginal.x);
-        if (!Precision.almostEqualsNumber(relativeRotation, 0)) {
+        if (!Precision.almostEquals(relativeRotation, 0)) {
             this.rotateSlider(current.hitObject, relativeRotation);
         }
     }
@@ -4327,7 +4344,7 @@ class NullableDecimalModSetting extends RangeConstrainedModSetting {
     }
     set precision(value) {
         if (value !== null && value < 0) {
-            throw new RangeError(`The precision (${value}) must be greater than or equal to 0.`);
+            throw new RangeError(`The precision (${value.toString()}) must be greater than or equal to 0.`);
         }
         this._precision = value;
         if (value !== null) {
@@ -4346,14 +4363,14 @@ class NullableDecimalModSetting extends RangeConstrainedModSetting {
             return super.toDisplayString();
         };
         if (min > max) {
-            throw new RangeError(`The minimum value (${min}) must be less than or equal to the maximum value (${max}).`);
+            throw new RangeError(`The minimum value (${min.toString()}) must be less than or equal to the maximum value (${max.toString()}).`);
         }
         if (step < 0) {
-            throw new RangeError(`The step size (${step}) must be greater than or equal to 0.`);
+            throw new RangeError(`The step size (${step.toString()}) must be greater than or equal to 0.`);
         }
         if (defaultValue !== null &&
             (defaultValue < min || defaultValue > max)) {
-            throw new RangeError(`The default value (${defaultValue}) must be between the minimum (${min}) and maximum (${max}) values.`);
+            throw new RangeError(`The default value (${defaultValue.toString()}) must be between the minimum (${min.toString()}) and maximum (${max.toString()}) values.`);
         }
         this._precision = precision;
     }
@@ -4943,11 +4960,11 @@ class NullableIntegerModSetting extends RangeConstrainedModSetting {
         super(name, description, defaultValue, min, max, 1);
         this.displayFormatter = (v) => { var _a; return (_a = v === null || v === void 0 ? void 0 : v.toString()) !== null && _a !== void 0 ? _a : "None"; };
         if (min > max) {
-            throw new RangeError(`The minimum value (${min}) must be less than or equal to the maximum value (${max}).`);
+            throw new RangeError(`The minimum value (${min.toString()}) must be less than or equal to the maximum value (${max.toString()}).`);
         }
         if (defaultValue !== null &&
             (defaultValue < min || defaultValue > max)) {
-            throw new RangeError(`The default value (${defaultValue}) must be between the minimum (${min}) and maximum (${max}) values.`);
+            throw new RangeError(`The default value (${defaultValue.toString()}) must be between the minimum (${min.toString()}) and maximum (${max.toString()}) values.`);
         }
     }
     processValue(value) {
@@ -5107,7 +5124,7 @@ class ModRandom extends Mod {
     toString() {
         const settings = [];
         if (this.seed.value !== null) {
-            settings.push(`seed: ${this.seed.value}`);
+            settings.push(`seed: ${this.seed.value.toString()}`);
         }
         settings.push(`angle sharpness: ${this.angleSharpness.toDisplayString()}`);
         return `${super.toString()} (${settings.join(", ")})`;
@@ -5143,12 +5160,8 @@ class ModSpunOut extends Mod {
         this.name = "SpunOut";
         this.osuRanked = true;
         this.bitwise = 1 << 12;
-    }
-    get isOsuRelevant() {
-        return true;
-    }
-    get osuScoreMultiplier() {
-        return 0.9;
+        this.isOsuRelevant = true;
+        this.osuScoreMultiplier = 0.9;
     }
 }
 
@@ -5179,12 +5192,8 @@ class ModTouchDevice extends Mod {
         this.name = "TouchDevice";
         this.osuRanked = true;
         this.bitwise = 1 << 2;
-    }
-    get isOsuRelevant() {
-        return true;
-    }
-    get osuScoreMultiplier() {
-        return 1;
+        this.isOsuRelevant = true;
+        this.osuScoreMultiplier = 1;
     }
 }
 
@@ -6144,8 +6153,7 @@ class BeatmapProcessor {
                     if (objectN instanceof Spinner) {
                         break;
                     }
-                    const stackThreshold = objectN.timePreempt *
-                        this.beatmap.general.stackLeniency;
+                    const stackThreshold = this.calculateStackThreshold(objectN);
                     if (objectN.startTime - stackBaseObject.endTime >
                         stackThreshold) {
                         // We are no longer within stacking range of the next object.
@@ -6187,7 +6195,7 @@ class BeatmapProcessor {
             if (objectI.stackHeight !== 0 || objectI instanceof Spinner) {
                 continue;
             }
-            const stackThreshold = objectI.timePreempt * this.beatmap.general.stackLeniency;
+            const stackThreshold = this.calculateStackThreshold(objectI);
             // If this object is a hit circle, then we enter this "special" case.
             // It either ends with a stack of hit circles only, or a stack of hit circles that are underneath a slider.
             // Any other case is handled by the "instanceof Slider" code below this.
@@ -6197,7 +6205,11 @@ class BeatmapProcessor {
                     if (objectN instanceof Spinner) {
                         continue;
                     }
-                    if (objectI.startTime - objectN.endTime > stackThreshold) {
+                    // Truncation to integer is required to match osu!stable - both quantities being subtracted there
+                    // are integers.
+                    if (Math.trunc(objectI.startTime) -
+                        Math.trunc(objectN.endTime) >
+                        stackThreshold) {
                         // We are no longer within stacking range of the previous object.
                         break;
                     }
@@ -6266,7 +6278,7 @@ class BeatmapProcessor {
             }
             let startTime = currentObject.endTime;
             let sliderStack = 0;
-            const stackThreshold = currentObject.timePreempt * this.beatmap.general.stackLeniency;
+            const stackThreshold = this.calculateStackThreshold(currentObject);
             for (let j = i + 1; j < objects.length; ++j) {
                 if (objects[j].startTime - stackThreshold > startTime) {
                     break;
@@ -6294,6 +6306,18 @@ class BeatmapProcessor {
             }
         }
     }
+    /**
+     * Truncation of {@link HitObject.timePreempt} to an integer, as well as keeping the result as a float,
+     * are both done for the purposes of osu!stable compatibility.
+     *
+     * Note that top-level objects {@link HitObject.timePreempt} is supposed to be integral anyway; see
+     * {@link HitObject.applyDefaults} using `BeatmapDifficulty.difficultyRangeInt` when calculating it.
+     *
+     * Slider ticks and end circles are the exception to that, but they do not matter for stacking.
+     */
+    calculateStackThreshold(object) {
+        return (Math.trunc(object.timePreempt) * this.beatmap.general.stackLeniency);
+    }
 }
 BeatmapProcessor.stackDistance = 3;
 
@@ -6393,13 +6417,13 @@ class TimingControlPoint extends ControlPoint {
     }
     toString() {
         return ("{ time: " +
-            this.time +
+            this.time.toString() +
             ", " +
             "ms_per_beat: " +
             this.msPerBeat.toFixed(2) +
             ", " +
             "timeSignature: " +
-            this.timeSignature +
+            this.timeSignature.toString() +
             " }");
     }
 }
@@ -6611,12 +6635,12 @@ class DifficultyControlPoint extends ControlPoint {
     }
     toString() {
         return ("{ time: " +
-            this.time +
+            this.time.toString() +
             ", " +
             "speed multiplier: " +
             this.speedMultiplier.toFixed(2) +
             ", generate ticks: " +
-            this.generateTicks +
+            this.generateTicks.toString() +
             " }");
     }
 }
@@ -6651,7 +6675,12 @@ class EffectControlPoint extends ControlPoint {
         return this.isKiai === existing.isKiai;
     }
     toString() {
-        return "{ time: " + this.time + ", " + "kiai: " + this.isKiai + " }";
+        return ("{ time: " +
+            this.time.toString() +
+            ", " +
+            "kiai: " +
+            this.isKiai.toString() +
+            " }");
     }
 }
 
@@ -6712,13 +6741,13 @@ class SampleControlPoint extends ControlPoint {
     }
     toString() {
         return ("{ time: " +
-            this.time +
+            this.time.toString() +
             ", " +
             "sample bank: " +
-            this.sampleBank +
+            this.sampleBank.toString() +
             ", " +
             "sample volume: " +
-            this.sampleVolume +
+            this.sampleVolume.toString() +
             " }");
     }
 }
@@ -6774,6 +6803,7 @@ class BeatmapControlPoints {
     }
 }
 
+/* eslint-disable @typescript-eslint/prefer-literal-enum-member */
 /**
  * Represents the grid size setting in the editor.
  */
@@ -7060,7 +7090,7 @@ class Beatmap {
         var _a, _b, _c, _d, _e;
         // The last playable time in the beatmap - the last timing point extends to this time.
         // Note: This is more accurate and may present different results because osu-stable didn't have the ability to calculate slider durations in this context.
-        const lastTime = (_d = (_b = (_a = this.hitObjects.objects[this.hitObjects.objects.length - 1]) === null || _a === void 0 ? void 0 : _a.endTime) !== null && _b !== void 0 ? _b : (_c = this.controlPoints.timing.points[this.controlPoints.timing.points.length - 1]) === null || _c === void 0 ? void 0 : _c.time) !== null && _d !== void 0 ? _d : 0;
+        const lastTime = (_d = (_b = (_a = this.hitObjects.objects.at(-1)) === null || _a === void 0 ? void 0 : _a.endTime) !== null && _b !== void 0 ? _b : (_c = this.controlPoints.timing.points.at(-1)) === null || _c === void 0 ? void 0 : _c.time) !== null && _d !== void 0 ? _d : 0;
         const mostCommon = 
         // Construct a set of {beatLength, duration} objects for each individual timing point.
         this.controlPoints.timing.points
@@ -7076,8 +7106,9 @@ class Beatmap {
                 duration: nextTime - currentTime,
             };
         })
-            // Get the most common one, or 0 as a suitable default.
-            .sort((a, b) => b.duration - a.duration)[0];
+            .sort((a, b) => b.duration - a.duration)
+            .at(0);
+        // Get the most common one, or 0 as a suitable default.
         return (_e = mostCommon === null || mostCommon === void 0 ? void 0 : mostCommon.beatLength) !== null && _e !== void 0 ? _e : 0;
     }
     getOffsetTime(time) {
@@ -7232,7 +7263,9 @@ class Beatmap {
         const processor = new BeatmapProcessor(converted);
         processor.preProcess();
         // Compute default values for hit objects, including creating nested hit objects in-case they're needed.
-        converted.hitObjects.objects.forEach((hitObject) => hitObject.applyDefaults(converted.controlPoints, converted.difficulty, mode));
+        converted.hitObjects.objects.forEach((hitObject) => {
+            hitObject.applyDefaults(converted.controlPoints, converted.difficulty, mode);
+        });
         mods.forEach((mod) => {
             if (mod.isApplicableToHitObject()) {
                 for (const hitObject of converted.hitObjects.objects) {
@@ -7275,25 +7308,25 @@ class Beatmap {
                 "\n" +
                 "\n" +
                 "AR" +
-                MathUtils.round(this.difficulty.ar, 2) +
+                MathUtils.round(this.difficulty.ar, 2).toString() +
                 " " +
                 "OD" +
-                MathUtils.round(this.difficulty.od, 2) +
+                MathUtils.round(this.difficulty.od, 2).toString() +
                 " " +
                 "CS" +
-                MathUtils.round(this.difficulty.cs, 2) +
+                MathUtils.round(this.difficulty.cs, 2).toString() +
                 " " +
                 "HP" +
-                MathUtils.round(this.difficulty.hp, 2) +
+                MathUtils.round(this.difficulty.hp, 2).toString() +
                 "\n" +
-                this.hitObjects.circles +
+                this.hitObjects.circles.toString() +
                 " circles, " +
-                this.hitObjects.sliders +
+                this.hitObjects.sliders.toString() +
                 " sliders, " +
-                this.hitObjects.spinners +
+                this.hitObjects.spinners.toString() +
                 " spinners" +
                 "\n" +
-                this.maxCombo +
+                this.maxCombo.toString() +
                 " max combo";
         return res;
     }
@@ -7309,6 +7342,7 @@ class BeatmapBackground {
     }
 }
 
+/* eslint-disable @typescript-eslint/prefer-literal-enum-member */
 /**
  * Represents available hitsound types.
  */
@@ -7321,6 +7355,7 @@ exports.HitSoundType = void 0;
     HitSoundType[HitSoundType["clap"] = 8] = "clap";
 })(exports.HitSoundType || (exports.HitSoundType = {}));
 
+/* eslint-disable @typescript-eslint/no-duplicate-enum-values */
 /**
  * Constants for beatmap parser.
  */
@@ -7403,7 +7438,7 @@ class Decoder {
      * @returns The current decoder instance.
      */
     decode(str) {
-        var _a;
+        var _a, _b;
         this.reset();
         for (let line of str.split("\n")) {
             this.currentLine = line;
@@ -7424,7 +7459,7 @@ class Decoder {
             if (line.startsWith("[") && line.endsWith("]")) {
                 const section = line.substring(1, line.length - 1);
                 if (!Object.values(BeatmapSection).includes(section)) {
-                    console.warn(`Unknown section "${line}" at line ${this.line}`);
+                    console.warn(`Unknown section "${line}" at line ${this.line.toString()}`);
                     continue;
                 }
                 this.section = section;
@@ -7443,7 +7478,7 @@ class Decoder {
             }
             catch (e) {
                 console.error(e);
-                console.error(`at line ${this.line}\n${(_a = this.decoders[this.section]) === null || _a === void 0 ? void 0 : _a.logExceptionPosition()}`);
+                console.error(`at line ${this.line.toString()}\n${(_b = (_a = this.decoders[this.section]) === null || _a === void 0 ? void 0 : _a.logExceptionPosition()) !== null && _b !== void 0 ? _b : ""}`);
             }
         }
         return this;
@@ -7533,7 +7568,7 @@ class SectionDecoder {
      * @param str The string to parse.
      * @param min The minimum threshold. Defaults to `-ParserConstants.MAX_PARSE_VALUE`.
      * @param max The maximum threshold. Defaults to `ParserConstants.MAX_PARSE_VALUE`.
-     * @param allowNaN Whether to allow NaN.
+     * @param allowNaN Whether to allow NaN. Defaults to `false`.
      * @returns The parsed integer.
      */
     tryParseInt(str, min = -ParserConstants.MAX_PARSE_VALUE, max = ParserConstants.MAX_PARSE_VALUE, allowNaN = false) {
@@ -7557,7 +7592,7 @@ class SectionDecoder {
      * @param str The string to parse.
      * @param min The minimum threshold. Defaults to `-ParserConstants.MAX_PARSE_VALUE`.
      * @param max The maximum threshold. Defaults to `ParserConstants.MAX_PARSE_VALUE`.
-     * @param allowNaN Whether to allow NaN.
+     * @param allowNaN Whether to allow NaN. Defaults to `false`.
      * @returns The parsed float.
      */
     tryParseFloat(str, min = -ParserConstants.MAX_PARSE_VALUE, max = ParserConstants.MAX_PARSE_VALUE, allowNaN = false) {
@@ -7662,7 +7697,7 @@ class BeatmapHitObjectsDecoder extends SectionDecoder {
                     if (points.length !== 3) {
                         pathType = exports.PathType.Bezier;
                     }
-                    else if (Precision.almostEqualsNumber(0, (points[1].y - points[0].y) *
+                    else if (Precision.almostEquals(0, (points[1].y - points[0].y) *
                         (points[2].x - points[0].x) -
                         (points[1].x - points[0].x) *
                             (points[2].y - points[0].y))) {
@@ -7835,7 +7870,7 @@ class BeatmapGeneralDecoder extends SectionDecoder {
                 this.target.general.previewTime = this.tryParseInt(p[1]);
                 break;
             case "Countdown":
-                this.target.general.countdown = (this.tryParseInt(p[1]));
+                this.target.general.countdown = this.tryParseInt(p[1]);
                 break;
             case "SampleSet":
                 switch (p[1]) {
@@ -7866,7 +7901,8 @@ class BeatmapGeneralDecoder extends SectionDecoder {
                 this.target.general.useSkinSprites = !!this.tryParseInt(p[1]);
                 break;
             case "OverlayPosition":
-                this.target.general.overlayPosition = (p[1]);
+                this.target.general.overlayPosition =
+                    p[1];
                 break;
             case "SkinPreference":
                 this.target.general.skinPreference = (_a = p[1]) !== null && _a !== void 0 ? _a : "";
@@ -7889,6 +7925,7 @@ class BeatmapGeneralDecoder extends SectionDecoder {
                 this.target.editor.bookmarks = p[1]
                     .split(",")
                     .map((v) => this.tryParseInt(v));
+                break;
         }
     }
 }
@@ -7912,7 +7949,7 @@ class BeatmapEditorDecoder extends SectionDecoder {
                 this.target.editor.beatDivisor = this.tryParseFloat(p[1]);
                 break;
             case "GridSize":
-                this.target.editor.gridSize = (this.tryParseInt(p[1]));
+                this.target.editor.gridSize = this.tryParseInt(p[1]);
                 break;
             case "TimelineZoom":
                 this.target.editor.timelineZoom = this.tryParseFloat(p[1]);
@@ -7942,15 +7979,15 @@ class BreakPoint {
     get duration() {
         return this.endTime - this.startTime;
     }
-    constructor(values) {
-        this.startTime = values.startTime;
-        this.endTime = values.endTime;
+    constructor(startTime, endTime) {
+        this.startTime = startTime;
+        this.endTime = endTime;
     }
     /**
      * Returns a string representation of the class.
      */
     toString() {
-        return `Start time: ${this.startTime}, end time: ${this.endTime}, duration: ${this.duration}`;
+        return `Start time: ${this.startTime.toString()}, end time: ${this.endTime.toString()}, duration: ${this.duration.toString()}`;
     }
     /**
      * Whether this break period contains a specified time.
@@ -8003,10 +8040,7 @@ class BeatmapEventsDecoder extends SectionDecoder {
         this.target.events.video = new BeatmapVideo(this.tryParseInt(this.setPosition(s[1])), this.setPosition(s[2]).replace(/"/g, ""), new Vector2(this.tryParseFloat(this.setPosition((_a = s[3]) !== null && _a !== void 0 ? _a : "0")), this.tryParseFloat(this.setPosition((_b = s[4]) !== null && _b !== void 0 ? _b : "0"))));
     }
     parseBreak(s) {
-        this.target.events.breaks.push(new BreakPoint({
-            startTime: this.target.getOffsetTime(this.tryParseInt(this.setPosition(s[1]))),
-            endTime: this.target.getOffsetTime(this.tryParseInt(this.setPosition(s[2]))),
-        }));
+        this.target.events.breaks.push(new BreakPoint(this.target.getOffsetTime(this.tryParseInt(this.setPosition(s[1]))), this.target.getOffsetTime(this.tryParseInt(this.setPosition(s[2])))));
     }
 }
 
@@ -8079,6 +8113,7 @@ class BeatmapMetadataDecoder extends SectionDecoder {
     }
 }
 
+/* eslint-disable @typescript-eslint/prefer-literal-enum-member */
 /**
  * Effects that can occur in an effect control point.
  */
@@ -8177,10 +8212,10 @@ class RGBColor {
      */
     toString() {
         if (this.a === 1) {
-            return `${this.r},${this.g},${this.b}`;
+            return `${this.r.toString()},${this.g.toString()},${this.b.toString()}`;
         }
         else {
-            return `${this.r},${this.g},${this.b},${this.a}`;
+            return `${this.r.toString()},${this.g.toString()},${this.b.toString()},${this.a.toString()}`;
         }
     }
     /**
@@ -8462,7 +8497,8 @@ class Command {
         return this.parameterType !== undefined;
     }
     toString() {
-        return `${this.startTime} -> ${this.endTime}, ${this.startValue} -> ${this.endValue} ${this.easing}`;
+        // eslint-disable-next-line @typescript-eslint/restrict-template-expressions
+        return `${this.startTime.toString()} -> ${this.endTime.toString()}, ${this.startValue} -> ${this.endValue} ${this.easing.toString()}`;
     }
 }
 
@@ -8684,7 +8720,7 @@ class CommandLoop extends CommandTimelineGroup {
         return commands;
     }
     toString() {
-        return `${this.loopStartTime} x${this.totalIterations}`;
+        return `${this.loopStartTime.toString()} x${this.totalIterations.toString()}`;
     }
 }
 
@@ -8700,7 +8736,7 @@ class CommandTrigger extends CommandTimelineGroup {
         this.groupNumber = groupNumber;
     }
     toString() {
-        return `${this.triggerName} ${this.triggerStartTime} -> ${this.triggerEndTime} (${this.groupNumber})`;
+        return `${this.triggerName} ${this.triggerStartTime.toString()} -> ${this.triggerEndTime.toString()} (${this.groupNumber.toString()})`;
     }
 }
 
@@ -8736,7 +8772,7 @@ class StoryboardSprite extends StoryboardElement {
         // You can imagine that the first command of each type decides that type's start value, so if the initial alpha is zero,
         // anything before that point can be ignored (the sprite is not visible after all).
         const alphaCommands = [];
-        let command = this.timelineGroup.alpha.commands[0];
+        let command = this.timelineGroup.alpha.commands.at(0);
         if (command) {
             alphaCommands.push({
                 startTime: command.startTime,
@@ -8744,7 +8780,7 @@ class StoryboardSprite extends StoryboardElement {
             });
         }
         for (const l of this.loops) {
-            command = l.alpha.commands[0];
+            command = l.alpha.commands.at(0);
             if (command) {
                 alphaCommands.push({
                     startTime: command.startTime + l.loopStartTime,
@@ -8826,7 +8862,7 @@ class StoryboardSprite extends StoryboardElement {
         return trigger;
     }
     toString() {
-        return `${this.path}, ${this.origin}, ${this.initialPosition}`;
+        return `${this.path}, ${this.origin}, ${this.initialPosition.toString()}`;
     }
 }
 
@@ -8963,7 +8999,7 @@ class StoryboardEventsDecoder extends SectionDecoder {
                     if (!s[3]) {
                         s[3] = this.setPosition(s[2]);
                     }
-                    const easing = (this.tryParseInt(this.setPosition(s[1])));
+                    const easing = this.tryParseInt(this.setPosition(s[1]));
                     const startTime = this.tryParseInt(this.setPosition(s[2]));
                     const endTime = this.tryParseInt(this.setPosition(s[3]));
                     switch (s[0]) {
@@ -9221,13 +9257,13 @@ class BeatmapDecoder extends Decoder {
     /**
      * @param str The string to decode.
      * @param mode The mode to parse the beatmap as. Defaults to osu!standard.
-     * @param parseStoryboard Whether to parse the beatmap's storyboard.
+     * @param parseStoryboard Whether to parse the beatmap's storyboard. Defaults to `true`.
      */
     decode(str, mode = exports.Modes.osu, parseStoryboard = true) {
         super.decode(str);
         this.finalResult.mode = mode;
         if (parseStoryboard) {
-            const eventsDecoder = (this.decoders[BeatmapSection.events]);
+            const eventsDecoder = this.decoders[BeatmapSection.events];
             if (eventsDecoder.storyboardLines.length > 0) {
                 this.finalResult.events.storyboard = new StoryboardDecoder(this.finalResult.formatVersion).decode(eventsDecoder.storyboardLines.join("\n")).result;
             }
@@ -9315,6 +9351,9 @@ class Encoder {
  * The base of all encoders.
  */
 class BaseEncoder {
+    /**
+     * @param encodeSections Whether sections should be encoded. Defaults to `true`.
+     */
     constructor(encodeSections = true) {
         /**
          * The target of the encoding process.
@@ -9393,10 +9432,10 @@ class BeatmapColorEncoder extends BeatmapBaseEncoder {
         }
         for (let i = 0; i < colors.combo.length; ++i) {
             const color = colors.combo[i];
-            this.write(`Combo${i + 1}: `);
-            this.write(`${color.r},`);
-            this.write(`${color.g},`);
-            this.write(`${color.b}`);
+            this.write(`Combo${(i + 1).toString()}: `);
+            this.write(`${color.r.toString()},`);
+            this.write(`${color.g.toString()},`);
+            this.write(color.b.toString());
             this.writeLine();
         }
     }
@@ -9429,14 +9468,14 @@ class BeatmapControlPointsEncoder extends BeatmapBaseEncoder {
         for (const group of Object.values(this.controlPointGroups).sort((a, b) => a.time - b.time)) {
             // If the group contains a timing control point, it needs to be output separately.
             if (group.timing) {
-                this.write(`${group.timing.time},`);
-                this.write(`${group.timing.msPerBeat},`);
+                this.write(`${group.timing.time.toString()},`);
+                this.write(`${group.timing.msPerBeat.toString()},`);
                 this.outputControlPointGroup(group, true);
             }
             // Output any remaining effects as secondary non-timing control point.
-            this.write(`${group.time},`);
+            this.write(`${group.time.toString()},`);
             const difficultyPoint = (_a = group.difficulty) !== null && _a !== void 0 ? _a : this.map.controlPoints.difficulty.controlPointAt(group.time);
-            this.write(`${-100 / difficultyPoint.speedMultiplier},`);
+            this.write(`${(-100 / difficultyPoint.speedMultiplier).toString()},`);
             this.outputControlPointGroup(group, false);
         }
     }
@@ -9484,7 +9523,7 @@ class BeatmapControlPointsEncoder extends BeatmapBaseEncoder {
         if (effectPoint.omitFirstBarLine) {
             effectFlags |= EffectFlags.omitFirstBarLine;
         }
-        this.write(`${((_c = group.timing) !== null && _c !== void 0 ? _c : this.map.controlPoints.timing.controlPointAt(group.time)).timeSignature},`);
+        this.write(`${((_c = group.timing) !== null && _c !== void 0 ? _c : this.map.controlPoints.timing.controlPointAt(group.time)).timeSignature.toString()},`);
         this.write(`${samplePoint.sampleBank.toString()},`);
         this.write(`${samplePoint.customSampleBank.toString()},`);
         this.write(`${samplePoint.sampleVolume.toString()},`);
@@ -9503,12 +9542,12 @@ class BeatmapDifficultyEncoder extends BeatmapBaseEncoder {
             this.writeLine("[Difficulty]");
         }
         const { difficulty } = this.map;
-        this.writeLine(`HPDrainRate: ${difficulty.hp}`);
-        this.writeLine(`CircleSize: ${difficulty.cs}`);
-        this.writeLine(`OverallDifficulty: ${difficulty.od}`);
-        this.writeLine(`ApproachRate: ${difficulty.ar}`);
-        this.writeLine(`SliderMultiplier: ${difficulty.sliderMultiplier}`);
-        this.writeLine(`SliderTickRate: ${difficulty.sliderTickRate}`);
+        this.writeLine(`HPDrainRate: ${difficulty.hp.toString()}`);
+        this.writeLine(`CircleSize: ${difficulty.cs.toString()}`);
+        this.writeLine(`OverallDifficulty: ${difficulty.od.toString()}`);
+        this.writeLine(`ApproachRate: ${difficulty.ar.toString()}`);
+        this.writeLine(`SliderMultiplier: ${difficulty.sliderMultiplier.toString()}`);
+        this.writeLine(`SliderTickRate: ${difficulty.sliderTickRate.toString()}`);
     }
 }
 
@@ -9524,10 +9563,10 @@ class BeatmapEditorEncoder extends BeatmapBaseEncoder {
         if (editor.bookmarks.length > 0) {
             this.writeLine(editor.bookmarks.join());
         }
-        this.writeLine(`DistanceSpacing: ${editor.distanceSnap}`);
-        this.writeLine(`BeatDivisor: ${editor.beatDivisor}`);
-        this.writeLine(`GridSize: ${editor.gridSize}`);
-        this.writeLine(`TimelineZoom: ${editor.timelineZoom}`);
+        this.writeLine(`DistanceSpacing: ${editor.distanceSnap.toString()}`);
+        this.writeLine(`BeatDivisor: ${editor.beatDivisor.toString()}`);
+        this.writeLine(`GridSize: ${editor.gridSize.toString()}`);
+        this.writeLine(`TimelineZoom: ${editor.timelineZoom.toString()}`);
     }
 }
 
@@ -9584,10 +9623,10 @@ class StoryboardEventsEncoder extends StoryboardBaseEncoder {
                 this.write(`${layerType},`);
                 this.write(`${element.origin},`);
                 this.write(`"${element.path}",`);
-                this.write(`${element.initialPosition},`);
-                this.write(`${element.frameCount},`);
-                this.write(`${element.frameDelay},`);
-                this.writeLine(`${element.loopType}`);
+                this.write(`${element.initialPosition.toString()},`);
+                this.write(`${element.frameCount.toString()},`);
+                this.write(`${element.frameDelay.toString()},`);
+                this.writeLine(element.loopType.toString());
                 this.encodeElement(element);
             }
             else if (element instanceof StoryboardSprite) {
@@ -9595,15 +9634,15 @@ class StoryboardEventsEncoder extends StoryboardBaseEncoder {
                 this.write(`${layerType},`);
                 this.write(`${element.origin},`);
                 this.write(`"${element.path}",`);
-                this.writeLine(`${element.initialPosition}`);
+                this.writeLine(element.initialPosition.toString());
                 this.encodeElement(element);
             }
             else if (element instanceof StoryboardSample) {
                 this.write(`${exports.StoryboardEventType.sample},`);
-                this.write(`${element.startTime},`);
+                this.write(`${element.startTime.toString()},`);
                 this.write(`${layerType},`);
                 this.write(`"${element.path}",`);
-                this.writeLine(`${element.volume}`);
+                this.writeLine(element.volume.toString());
             }
         }
     }
@@ -9620,21 +9659,21 @@ class StoryboardEventsEncoder extends StoryboardBaseEncoder {
         if (group instanceof CommandLoop) {
             this.write(" ");
             this.write(`${exports.StoryboardCommandType.loop},`);
-            this.write(`${group.startTime},`);
-            this.write(`${group.totalIterations}`);
+            this.write(`${group.startTime.toString()},`);
+            this.write(group.totalIterations.toString());
         }
         else if (group instanceof CommandTrigger) {
             this.write(" ");
             this.write(`${exports.StoryboardCommandType.trigger},`);
-            this.write(`${group.triggerName}`);
+            this.write(group.triggerName);
             if (group.triggerEndTime !== Number.MAX_SAFE_INTEGER) {
                 this.write(",");
-                this.write(`${group.triggerStartTime},`);
-                this.write(`${group.triggerEndTime}`);
+                this.write(`${group.triggerStartTime.toString()},`);
+                this.write(group.triggerEndTime.toString());
             }
             if (group.groupNumber !== 0) {
                 this.write(",");
-                this.write(`${group.groupNumber}`);
+                this.write(group.groupNumber.toString());
             }
         }
         this.encodeTimeline(group.alpha);
@@ -9655,9 +9694,11 @@ class StoryboardEventsEncoder extends StoryboardBaseEncoder {
     encodeCommand(command) {
         this.write(" ");
         this.write(`${command.type},`);
-        this.write(`${command.easing},`);
-        this.write(`${command.startTime},`);
-        this.write(command.startTime !== command.endTime ? `${command.endTime}` : "");
+        this.write(`${command.easing.toString()},`);
+        this.write(`${command.startTime.toString()},`);
+        this.write(command.startTime !== command.endTime
+            ? command.endTime.toString()
+            : "");
         this.write(",");
         if (command.startValue instanceof Vector2 &&
             command.endValue instanceof Vector2) {
@@ -9752,14 +9793,14 @@ class BeatmapEventsEncoder extends BeatmapBaseEncoder {
         this.writeLine("//Background and Video Events");
         const { events } = this.map;
         if (events.background) {
-            this.writeLine(`0,0,"${events.background.filename}",${events.background.offset.x},${events.background.offset.y}`);
+            this.writeLine(`0,0,"${events.background.filename}",${events.background.offset.x.toString()},${events.background.offset.y.toString()}`);
         }
         if (events.video) {
-            this.writeLine(`Video,${events.video.startTime},"${events.video.filename}",${events.video.offset.x},${events.video.offset.y}`);
+            this.writeLine(`Video,${events.video.startTime.toString()},"${events.video.filename}",${events.video.offset.x.toString()},${events.video.offset.y.toString()}`);
         }
         this.writeLine("//Break Periods");
         for (const b of events.breaks) {
-            this.writeLine(`2,${b.startTime},${b.endTime}`);
+            this.writeLine(`2,${b.startTime.toString()},${b.endTime.toString()}`);
         }
         if (this.map.events.storyboard) {
             this.writeLine(new StoryboardEncoder(this.map.events.storyboard, false).encode().result);
@@ -9787,20 +9828,20 @@ class BeatmapGeneralEncoder extends BeatmapBaseEncoder {
         if (general.audioFilename) {
             this.writeLine(`AudioFilename: ${general.audioFilename}`);
         }
-        this.writeLine(`AudioLeadIn: ${general.audioLeadIn}`);
-        this.writeLine(`PreviewTime: ${general.previewTime}`);
-        this.writeLine(`Countdown: ${general.countdown}`);
+        this.writeLine(`AudioLeadIn: ${general.audioLeadIn.toString()}`);
+        this.writeLine(`PreviewTime: ${general.previewTime.toString()}`);
+        this.writeLine(`Countdown: ${general.countdown.toString()}`);
         this.writeLine(`SampleSet: ${this.sampleBankToString(general.sampleBank)}`);
-        this.writeLine(`StackLeniency: ${general.stackLeniency}`);
-        this.writeLine(`Mode: ${general.mode}`);
-        this.writeLine(`LetterboxInBreaks: ${general.letterBoxInBreaks ? 1 : 0}`);
+        this.writeLine(`StackLeniency: ${general.stackLeniency.toString()}`);
+        this.writeLine(`Mode: ${general.mode.toString()}`);
+        this.writeLine(`LetterboxInBreaks: ${general.letterBoxInBreaks ? "1" : "0"}`);
         if (general.epilepsyWarning) {
             this.writeLine("EpilepsyWarning: 1");
         }
         if (general.countdownOffset > 0) {
-            this.writeLine(`CountdownOffset: ${general.countdownOffset}`);
+            this.writeLine(`CountdownOffset: ${general.countdownOffset.toString()}`);
         }
-        this.writeLine(`WidescreenStoryboard: ${general.widescreenStoryboard ? 1 : 0}`);
+        this.writeLine(`WidescreenStoryboard: ${general.widescreenStoryboard ? "1" : "0"}`);
         if (general.samplesMatchPlaybackRate) {
             this.writeLine("SamplesMatchPlaybackRate: 1");
         }
@@ -9820,10 +9861,10 @@ class BeatmapHitObjectsEncoder extends BeatmapBaseEncoder {
         }
     }
     encodeHitObject(object) {
-        this.write(`${object.position.x},`);
-        this.write(`${object.position.y},`);
-        this.write(`${object.startTime},`);
-        this.write(`${object.type},`);
+        this.write(`${object.position.x.toString()},`);
+        this.write(`${object.position.y.toString()},`);
+        this.write(`${object.startTime.toString()},`);
+        this.write(`${object.type.toString()},`);
         this.write(`${this.samplesToHitSoundType(object.samples).toString()},`);
         if (object instanceof Slider) {
             this.addSliderPath(object);
@@ -9831,7 +9872,7 @@ class BeatmapHitObjectsEncoder extends BeatmapBaseEncoder {
         }
         else {
             if (object instanceof Spinner) {
-                this.write(`${object.endTime},`);
+                this.write(`${object.endTime.toString()},`);
             }
             this.write(this.getSampleBank(object.samples));
         }
@@ -9864,11 +9905,11 @@ class BeatmapHitObjectsEncoder extends BeatmapBaseEncoder {
         // start position of the slider.
         for (let i = 1; i < slider.path.controlPoints.length; ++i) {
             const realPosition = slider.path.controlPoints[i].add(slider.position);
-            this.write(`${realPosition.x}:${realPosition.y}`);
+            this.write(`${realPosition.x.toString()}:${realPosition.y.toString()}`);
             this.write(i != slider.path.controlPoints.length - 1 ? "|" : ",");
         }
-        this.write(`${slider.repeatCount + 1},`);
-        this.write(`${slider.path.expectedDistance},`);
+        this.write(`${slider.spanCount.toString()},`);
+        this.write(`${slider.path.expectedDistance.toString()},`);
         // edgeSamples
         for (let i = 0; i < slider.nodeSamples.length; ++i) {
             this.write(this.samplesToHitSoundType(slider.nodeSamples[i]).toString());
@@ -9887,14 +9928,14 @@ class BeatmapHitObjectsEncoder extends BeatmapBaseEncoder {
         const addBank = (_d = (_c = samples.find((s) => s instanceof BankHitSampleInfo &&
             s.name &&
             s.name !== BankHitSampleInfo.HIT_NORMAL)) === null || _c === void 0 ? void 0 : _c.bank) !== null && _d !== void 0 ? _d : exports.SampleBank.none;
-        let sampleBankString = `${normalBank}:${addBank}`;
+        let sampleBankString = `${normalBank.toString()}:${addBank.toString()}`;
         if (!banksOnly) {
-            const firstSample = samples[0];
+            const firstSample = samples.at(0);
             sampleBankString += ":";
             sampleBankString += `${firstSample instanceof BankHitSampleInfo
-                ? firstSample.customSampleBank
-                : 0}:`;
-            sampleBankString += `${(_e = firstSample === null || firstSample === void 0 ? void 0 : firstSample.volume) !== null && _e !== void 0 ? _e : 100}:`;
+                ? firstSample.customSampleBank.toString()
+                : "0"}:`;
+            sampleBankString += `${((_e = firstSample === null || firstSample === void 0 ? void 0 : firstSample.volume) !== null && _e !== void 0 ? _e : 100).toString()}:`;
             if (firstSample instanceof FileHitSampleInfo) {
                 sampleBankString += `${this.sampleBankToString(exports.SampleBank.none)}-${firstSample.filename}`;
             }
@@ -9916,7 +9957,6 @@ class BeatmapHitObjectsEncoder extends BeatmapBaseEncoder {
  */
 class BeatmapMetadataEncoder extends BeatmapBaseEncoder {
     encodeInternal() {
-        var _a, _b;
         if (this.encodeSections) {
             this.writeLine("[Metadata]");
         }
@@ -9937,11 +9977,11 @@ class BeatmapMetadataEncoder extends BeatmapBaseEncoder {
         if (metadata.tags.length > 0) {
             this.writeLine(`Tags: ${metadata.tags.join(" ")}`);
         }
-        if (((_a = metadata.beatmapId) !== null && _a !== void 0 ? _a : -1) > 0) {
-            this.writeLine(`BeatmapID: ${metadata.beatmapId}`);
+        if (metadata.beatmapId !== undefined && metadata.beatmapId > 0) {
+            this.writeLine(`BeatmapID: ${metadata.beatmapId.toString()}`);
         }
-        if (((_b = metadata.beatmapSetId) !== null && _b !== void 0 ? _b : -1) > 0) {
-            this.writeLine(`BeatmapSetID: ${metadata.beatmapSetId}`);
+        if (metadata.beatmapSetId !== undefined && metadata.beatmapSetId > 0) {
+            this.writeLine(`BeatmapSetID: ${metadata.beatmapSetId.toString()}`);
         }
     }
 }
@@ -9959,7 +9999,7 @@ class BeatmapEncoder extends Encoder {
         this.latestVersion = 14;
     }
     encodeInternal() {
-        this.writeLine(`osu file format v${this.latestVersion}`);
+        this.writeLine(`osu file format v${this.latestVersion.toString()}`);
         this.writeLine();
         super.encodeInternal();
     }
@@ -10024,6 +10064,56 @@ exports.BeatmapLanguage = void 0;
     BeatmapLanguage[BeatmapLanguage["other"] = 14] = "other";
 })(exports.BeatmapLanguage || (exports.BeatmapLanguage = {}));
 
+class Bin {
+    constructor() {
+        this.difficulty = 0;
+        this.time = 0;
+        this.noteCount = 0;
+    }
+    /**
+     * Creates a 2D grid of bins using bilinear interpolation.
+     *
+     * Notes are distributed across neighboring bins weighted by their fractional position.
+     */
+    static createBins(difficulties, times, difficultyDimensionLength, timeDimensionLength) {
+        const maxDifficulty = MathUtils.max(difficulties);
+        const endTime = MathUtils.max(times);
+        const bins = Utils.initializeArray(timeDimensionLength * difficultyDimensionLength, () => new Bin());
+        for (let timeIndex = 0; timeIndex < timeDimensionLength; ++timeIndex) {
+            const time = (endTime * timeIndex) / (timeDimensionLength - 1);
+            for (let diffIndex = 0; diffIndex < difficultyDimensionLength; ++diffIndex) {
+                const binIndex = difficultyDimensionLength * timeIndex + diffIndex;
+                bins[binIndex].time = time;
+                // We do not create a 0 difficulty bin because 0 difficulty notes do not contribute to star rating.
+                bins[binIndex].difficulty =
+                    (maxDifficulty * (diffIndex + 1)) /
+                        difficultyDimensionLength;
+            }
+        }
+        for (let noteIndex = 0; noteIndex < difficulties.length; ++noteIndex) {
+            const timeBinIndex = timeDimensionLength * (times[noteIndex] / endTime);
+            const difficultyBinIndex = difficultyDimensionLength *
+                (difficulties[noteIndex] / maxDifficulty) -
+                1;
+            const timeLower = Math.min(Math.trunc(timeBinIndex), timeDimensionLength - 1);
+            const timeUpper = Math.min(timeLower + 1, timeDimensionLength - 1);
+            const timeWeight = timeBinIndex - timeLower;
+            const difficultyLower = Math.floor(difficultyBinIndex);
+            const difficultyUpper = Math.min(difficultyLower + 1, difficultyDimensionLength - 1);
+            const difficultyWeight = difficultyBinIndex - difficultyLower;
+            // The lower bound of difficulty can be -1, corresponding to buckets with 0 difficulty.
+            // We do not store those since they do not contribute to star rating.
+            if (difficultyLower >= 0) {
+                bins[difficultyDimensionLength * timeLower + difficultyLower].noteCount += (1 - timeWeight) * (1 - difficultyWeight);
+                bins[difficultyDimensionLength * timeUpper + difficultyLower].noteCount += timeWeight * (1 - difficultyWeight);
+            }
+            bins[difficultyDimensionLength * timeLower + difficultyUpper].noteCount += (1 - timeWeight) * difficultyWeight;
+            bins[difficultyDimensionLength * timeUpper + difficultyUpper].noteCount += timeWeight * difficultyWeight;
+        }
+        return bins;
+    }
+}
+
 class ZeroCrossingBracketing {
     /**
      * Detect a range containing at least one root.
@@ -10254,6 +10344,93 @@ class Brent {
     }
 }
 
+/**
+ * {@link https://www.sciencedirect.com/science/article/abs/pii/S0965997896000518?via%3Dihub Chandrupatla}'s root-finding algorithm.
+ */
+class Chandrupatla {
+    /**
+     * Finds the root of a function using {@link https://www.sciencedirect.com/science/article/abs/pii/S0965997896000518?via%3Dihub Chandrupatla}'s
+     * method, expanding the bounds if the root is not located within.
+     *
+     * Expansion only occurs for the upward bound, as this function is optimized for functions of range [0, x), which is
+     * useful for finding positive roots.
+     *
+     * @param f The function of which to find the root.
+     * @param guessLowerBound The lower bound of the function inputs.
+     * @param guessUpperBound The upper bound of the function inputs.
+     * @param options Options for the root-finding algorithm.
+     * @returns The root of the function.
+     */
+    static findRootExpand(f, guessLowerBound, guessUpperBound, options) {
+        const { maxIterations = 25, accuracy = 1e-6, expansionFactor = 2, maxExpansions = 32, } = options !== null && options !== void 0 ? options : {};
+        let a = guessLowerBound;
+        let b = guessUpperBound;
+        let fa = f(a);
+        let fb = f(b);
+        let expansions = 0;
+        while (fa * fb > 0) {
+            a = b;
+            b *= expansionFactor;
+            fa = fb;
+            fb = f(b);
+            ++expansions;
+            if (expansions > maxExpansions) {
+                throw new Error("Chandrupatla: Maximum number of expansions exceeded.");
+            }
+        }
+        let t = 0.5;
+        for (let i = 0; i < maxIterations; ++i) {
+            const xt = a + t * (b - a);
+            const ft = f(xt);
+            let c;
+            let fc;
+            if (Math.sign(ft) == Math.sign(fa)) {
+                c = a;
+                fc = fa;
+            }
+            else {
+                c = b;
+                b = a;
+                fc = fb;
+                fb = fa;
+            }
+            a = xt;
+            fa = ft;
+            let xm;
+            let fm;
+            if (Math.abs(fa) < Math.abs(fb)) {
+                xm = a;
+                fm = fa;
+            }
+            else {
+                xm = b;
+                fm = fb;
+            }
+            if (fm == 0) {
+                return xm;
+            }
+            const tol = 2 * accuracy * Math.abs(xm) + 2 * accuracy;
+            const tlim = tol / Math.abs(b - c);
+            if (tlim > 0.5) {
+                return xm;
+            }
+            const chi = (a - b) / (c - b);
+            const phi = (fa - fb) / (fc - fb);
+            const iqi = phi * phi < chi && (1 - phi) * (1 - phi) < chi;
+            if (iqi) {
+                t =
+                    ((fa / (fb - fa)) * fc) / (fb - fc) +
+                        (((((c - a) / (b - a)) * fa) / (fc - fa)) * fb) / (fc - fb);
+            }
+            else {
+                t = 0.5;
+            }
+            t = Math.min(1 - tlim, Math.max(tlim, t));
+        }
+        return 0;
+    }
+}
+
 /******************************************************************************
 Copyright (c) Microsoft Corporation.
 
@@ -10268,7 +10445,7 @@ LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR
 OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
 PERFORMANCE OF THIS SOFTWARE.
 ***************************************************************************** */
-/* global Reflect, Promise, SuppressedError, Symbol */
+/* global Reflect, Promise, SuppressedError, Symbol, Iterator */
 
 
 function __awaiter(thisArg, _arguments, P, generator) {
@@ -10289,6 +10466,7 @@ typeof SuppressedError === "function" ? SuppressedError : function (error, suppr
 /**
  * The base of API request builders.
  */
+// eslint-disable-next-line @typescript-eslint/no-unnecessary-type-parameters
 class APIRequestBuilder {
     constructor() {
         /**
@@ -10357,22 +10535,24 @@ class APIRequestBuilder {
                 .then((res) => __awaiter(this, void 0, void 0, function* () {
                 ++this.fetchAttempts;
                 if (res.status >= 500 && this.fetchAttempts < 5) {
-                    console.error(`Request to ${url} failed with the following error: ${yield res.text()}; ${this.fetchAttempts} attempts so far; retrying`);
-                    return resolve(this.sendRequest());
+                    console.error(`Request to ${url} failed with the following error: ${yield res.text()}; ${this.fetchAttempts.toString()} attempts so far; retrying`);
+                    resolve(this.sendRequest());
+                    return;
                 }
                 this.fetchAttempts = 0;
-                return resolve({
+                resolve({
                     data: Buffer.from(yield res.arrayBuffer()),
                     statusCode: res.status,
                 });
             }))
                 .catch((e) => {
-                console.error(`Request to ${url} failed with the following error: ${e.message}; ${this.fetchAttempts} attempts so far; aborting`);
+                console.error(`Request to ${url} failed with the following error: ${e.message}; ${this.fetchAttempts.toString()} attempts so far; aborting`);
                 this.fetchAttempts = 0;
-                return resolve({
+                resolve({
                     data: Buffer.from([]),
                     statusCode: 400,
                 });
+                return;
             });
         });
     }
@@ -10581,6 +10761,196 @@ class Polynomial {
         }
         return sum;
     }
+    /**
+     * Solve for the exact real roots of any polynomial up to degree 4.
+     *
+     * @param coefficients The coefficients of the polynomial, in ascending order ([1, 3, 5] -> x^2 + 3x + 5).
+     * @returns The real roots of the polynomial, and `null` if the root does not exist.
+     */
+    static solve(coefficients) {
+        let xVals = [];
+        switch (coefficients.length) {
+            case 5:
+                xVals = this.solveP4(coefficients[0], coefficients[1], coefficients[2], coefficients[3], coefficients[4]).roots;
+                break;
+            case 4:
+                xVals = this.solveP3(coefficients[0], coefficients[1], coefficients[2], coefficients[3]).roots;
+                break;
+            case 3:
+                xVals = this.solveP2(coefficients[0], coefficients[1], coefficients[2]).roots;
+                break;
+            case 2:
+                xVals = this.solveP2(0, coefficients[0], coefficients[1]).roots;
+                break;
+        }
+        return xVals;
+    }
+    // https://github.com/sasamil/Quartic/blob/master/quartic.cpp
+    static solveP4(a, b, c, d, e) {
+        const result = {
+            count: 0,
+            roots: new Array(4),
+        };
+        if (a === 0) {
+            const xValsCubic = this.solveP3(b, c, d, e);
+            result.count = xValsCubic.count;
+            result.roots[0] = xValsCubic.roots[0];
+            result.roots[1] = xValsCubic.roots[1];
+            result.roots[2] = xValsCubic.roots[2];
+            result.roots[3] = null;
+            return result;
+        }
+        b /= a;
+        c /= a;
+        d /= a;
+        e /= a;
+        const a3 = -c;
+        const b3 = b * d - 4 * e;
+        const c3 = -b * b * e - d * d + 4 * c * e;
+        const x3 = this.solveP3(1, a3, b3, c3);
+        let q1;
+        let q2;
+        let p1;
+        let p2;
+        let sqD;
+        let y = x3.roots[0];
+        // Get the y value with the highest absolute value.
+        if (x3.count !== 1) {
+            if (Math.abs(x3.roots[1]) > Math.abs(y)) {
+                y = x3.roots[1];
+            }
+            if (Math.abs(x3.roots[2]) > Math.abs(y)) {
+                y = x3.roots[2];
+            }
+        }
+        let upperD = y * y - 4 * e;
+        if (Precision.almostEquals(upperD, 0)) {
+            q1 = q2 = y * 0.5;
+            upperD = b * b - 4 * (c - y);
+            if (Precision.almostEquals(upperD, 0)) {
+                p1 = p2 = b * 0.5;
+            }
+            else {
+                sqD = Math.sqrt(upperD);
+                p1 = (b + sqD) * 0.5;
+                p2 = (b - sqD) * 0.5;
+            }
+        }
+        else {
+            sqD = Math.sqrt(upperD);
+            q1 = (y + sqD) * 0.5;
+            q2 = (y - sqD) * 0.5;
+            p1 = (b * q1 - d) / (q1 - q2);
+            p2 = (d - b * q2) / (q1 - q2);
+        }
+        // Solving quadratic eq. - x^2 + p1*x + q1 = 0.
+        upperD = p1 * p1 - 4 * q1;
+        if (upperD >= 0) {
+            result.count += 2;
+            sqD = Math.sqrt(upperD);
+            result.roots[0] = (-p1 + sqD) * 0.5;
+            result.roots[1] = (-p1 - sqD) * 0.5;
+        }
+        // Solving quadratic eq. - x^2 + p2*x + q2 = 0.
+        upperD = p2 * p2 - 4 * q2;
+        if (upperD >= 0) {
+            result.count += 2;
+            sqD = Math.sqrt(upperD);
+            result.roots[2] = (-p2 + sqD) * 0.5;
+            result.roots[3] = (-p2 - sqD) * 0.5;
+        }
+        // Put the null roots at the end of the array.
+        result.roots.sort((a, b) => {
+            if (a === null && b === null) {
+                return 0;
+            }
+            if (a === null) {
+                return 1;
+            }
+            if (b === null) {
+                return -1;
+            }
+            return 0;
+        });
+        return result;
+    }
+    static solveP3(a, b, c, d) {
+        const result = {
+            count: 0,
+            roots: new Array(3),
+        };
+        if (a === 0) {
+            const xValsQuadratic = this.solveP2(b, c, d);
+            result.count = xValsQuadratic.count;
+            result.roots[0] = xValsQuadratic.roots[0];
+            result.roots[1] = xValsQuadratic.roots[1];
+            result.roots[2] = null;
+            return result;
+        }
+        b /= a;
+        c /= a;
+        d /= a;
+        const a2 = b * b;
+        let q = (a2 - 3 * c) / 9;
+        const q3 = q * q * q;
+        const r = (b * (2 * a2 - 9 * c) + 27 * d) / 54;
+        const r2 = r * r;
+        if (r2 < q3) {
+            let t = r / Math.sqrt(q3);
+            t = MathUtils.clamp(t, -1, 1);
+            t = Math.acos(t);
+            b /= 3;
+            q = -2 * Math.sqrt(q);
+            result.count = 3;
+            result.roots[0] = q * Math.cos(t / 3) - b;
+            result.roots[1] = q * Math.cos((t + Math.PI * 2) / 3) - b;
+            result.roots[2] = q * Math.cos((t - Math.PI * 2) / 3) - b;
+            return result;
+        }
+        let upperA = -Math.cbrt(Math.abs(r) + Math.sqrt(r2 - q3));
+        if (r < 0) {
+            upperA = -upperA;
+        }
+        const upperB = upperA == 0 ? 0 : q / upperA;
+        b /= 3;
+        result.count = 1;
+        result.roots[0] = upperA + upperB - b;
+        if (Precision.almostEquals(0.5 * Math.sqrt(3) * (upperA - upperB), 0)) {
+            result.count = 2;
+            result.roots[1] = -0.5 * (upperA + upperB) - b;
+            return result;
+        }
+        return result;
+    }
+    static solveP2(a, b, c) {
+        const result = {
+            count: 0,
+            roots: new Array(2),
+        };
+        if (a === 0) {
+            if (b === 0) {
+                return result;
+            }
+            result.count = 1;
+            result.roots[0] = -c / b;
+        }
+        const discriminant = b * b - 4 * a * c;
+        if (discriminant < 0) {
+            return result;
+        }
+        switch (discriminant) {
+            case 0:
+                result.count = 1;
+                result.roots[0] = -b / (2 * a);
+                break;
+            default:
+                result.count = 2;
+                result.roots[0] = (-b + Math.sqrt(discriminant)) / (2 * a);
+                result.roots[1] = (-b - Math.sqrt(discriminant)) / (2 * a);
+                break;
+        }
+        return result;
+    }
 }
 
 /**
@@ -10976,7 +11346,7 @@ class ErrorFunction {
  * calculation for erf(x) in the interval [1e-10, 0.5].
  */
 ErrorFunction.erfImpAn = [
-    0.003379167095512574, -0.0007369565304816795, -0.37473233739291961,
+    0.003379167095512574, -7369565304816795e-19, -0.3747323373929196,
     0.0817442448733587, -0.04210893199365486, 0.007016570951209576,
     -0.004950912559824351, 0.0008716465990379225,
 ];
@@ -10987,7 +11357,7 @@ ErrorFunction.erfImpAn = [
 ErrorFunction.erfImpAd = [
     1, -0.2180882180879246, 0.4125429727254421, -0.08418911478731068,
     0.0655338856400242, -0.01200196044549418, 0.00408165558926174,
-    -0.0006159007215577697,
+    -6159007215577697e-19,
 ];
 /**
  * Polynomial coefficients for a numerator in erfImp
@@ -11038,7 +11408,7 @@ ErrorFunction.erfImpDn = [
 ErrorFunction.erfImpDd = [
     1, 1.7596709814716753, 1.3288357143796112, 0.5525285965087576,
     0.1337930569413329, 0.017950964517628076, 0.001047124400199374,
-    -0.10664038182035734e-7,
+    -1.0664038182035734e-8,
 ];
 /**
  * Polynomial coefficients for a numerator in erfImp
@@ -11073,7 +11443,7 @@ ErrorFunction.erfImpFn = [
 ErrorFunction.erfImpFd = [
     1, 1.210196977736308, 0.6209146682211439, 0.1730384306611428,
     0.0276550813773432, 0.002406259744243097, 0.8918118172513366e-4,
-    -0.4655288362833827e-11,
+    -4655288362833827e-27,
 ];
 /**
  * Polynomial coefficients for a numerator in erfImp
@@ -11112,7 +11482,7 @@ ErrorFunction.erfImpHd = [
  * calculation for erfc(x) in the interval [11.5, 17].
  */
 ErrorFunction.erfImpIn = [
-    -0.0005690799360109496, 0.0001694985403737623, 0.5184723545811009e-4,
+    -5690799360109496e-19, 0.0001694985403737623, 0.5184723545811009e-4,
     0.38281931223192885e-5, 0.8249899312818944e-7,
 ];
 /**
@@ -11121,14 +11491,14 @@ ErrorFunction.erfImpIn = [
  */
 ErrorFunction.erfImpId = [
     1, 0.3396372500511393, 0.04347264787031066, 0.002485493352246371,
-    0.5356333053371529e-4, -0.11749094440545958e-12,
+    0.5356333053371529e-4, -11749094440545958e-29,
 ];
 /**
  * Polynomial coefficients for a numerator in erfImp
  * calculation for erfc(x) in the interval [17, 24].
  */
 ErrorFunction.erfImpJn = [
-    -0.000241313599483991337, 0.5742249752025015e-4, 0.11599896292738377e-4,
+    -24131359948399134e-20, 0.5742249752025015e-4, 0.11599896292738377e-4,
     0.581762134402594e-6, 0.8539715550856736e-8,
 ];
 /**
@@ -11144,7 +11514,7 @@ ErrorFunction.erfImpJd = [
  * calculation for erfc(x) in the interval [24, 38].
  */
 ErrorFunction.erfImpKn = [
-    -0.00014667469927776036, 0.1626665521122805e-4, 0.26911624850916523e-5,
+    -14667469927776036e-20, 0.1626665521122805e-4, 0.26911624850916523e-5,
     0.979584479468092e-7, 0.10199464762572346e-8,
 ];
 /**
@@ -11160,7 +11530,7 @@ ErrorFunction.erfImpKd = [
  * calculation for erfc(x) in the interval [38, 60].
  */
 ErrorFunction.erfImpLn = [
-    -0.5839057976297718e-4, 0.4125103251054962e-5, 0.43179092242025094e-6,
+    -5839057976297718e-20, 0.4125103251054962e-5, 0.43179092242025094e-6,
     0.9933651555900132e-8, 0.653480510020105e-10,
 ];
 /**
@@ -11176,7 +11546,7 @@ ErrorFunction.erfImpLd = [
  * calculation for erfc(x) in the interval [60, 85].
  */
 ErrorFunction.erfImpMn = [
-    -0.196457797609229579e-4, 0.1572438876668007e-5, 0.5439025111927009e-7,
+    -19645779760922958e-21, 0.1572438876668007e-5, 0.5439025111927009e-7,
     0.3174724923691177e-9,
 ];
 /**
@@ -11192,7 +11562,7 @@ ErrorFunction.erfImpMd = [
  * calculation for erfc(x) in the interval [85, 110].
  */
 ErrorFunction.erfImpNn = [
-    -0.789224703978723e-5, 0.622088451660987e-6, 0.1457284456768824e-7,
+    -789224703978723e-20, 0.622088451660987e-6, 0.1457284456768824e-7,
     0.603715505542715e-10,
 ];
 /**
@@ -11209,7 +11579,7 @@ ErrorFunction.erfImpNd = [
  * calculation for erf^-1(z) in the interval [0, 0.5].
  */
 ErrorFunction.ervInvImpAn = [
-    -0.0005087819496582806, -0.0083687481974173677, 0.033480662540974461,
+    -5087819496582806e-19, -0.008368748197417368, 0.033480662540974461,
     -0.012692614766297402, -0.03656379714117627, 0.02198786811111689,
     0.008226878746769157, -0.005387729650712429,
 ];
@@ -11247,8 +11617,8 @@ ErrorFunction.ervInvImpBd = [
 ErrorFunction.ervInvImpCn = [
     -0.1311027816799519, -0.1637940471933171, 0.11703015634199525,
     0.387079738972604337, 0.3377855389120359, 0.1428695344081572,
-    0.029015791000532906, 0.002145589953888053, -0.6794655751811264e-6,
-    0.2852253317822171e-7, -0.681149956853777e-9,
+    0.029015791000532906, 0.002145589953888053, -6.794655751811264e-7,
+    0.2852253317822171e-7, -681149956853777e-24,
 ];
 /**
  * Polynomial coefficients for a denominator of erfInvImp
@@ -11266,7 +11636,7 @@ ErrorFunction.ervInvImpCd = [
 ErrorFunction.ervInvImpDn = [
     -0.0350353787183178, -0.002224265292134479, 0.018557330651423107,
     0.009508047013259196, 0.001871234928195592, 0.00015754461742496055,
-    0.460469890584318e-5, -0.2304047769118826e-9, 0.266339227425782e-11,
+    0.460469890584318e-5, -2304047769118826e-25, 0.266339227425782e-11,
 ];
 /**
  * Polynomial coefficients for a denominator of erfInvImp
@@ -11283,7 +11653,7 @@ ErrorFunction.ervInvImpDd = [
 ErrorFunction.ervInvImpEn = [
     -0.016743100507663373, -0.001129514387455803, 0.001056288621524929,
     0.0002093863174875881, 0.14962478375834237e-4, 0.4496967899277065e-6,
-    0.4625961635228786e-8, -0.281128735628831791e-13,
+    0.4625961635228786e-8, -2811287356288318e-29,
     0.9905570997331033e-16,
 ];
 /**
@@ -11299,9 +11669,9 @@ ErrorFunction.ervInvImpEd = [
  * calculation for erf^-1(z) in the interval [0.75, 1] with x between 18 and 44.
  */
 ErrorFunction.ervInvImpFn = [
-    -0.0024978212791898131, -0.779190719229054e-5, 0.2547230374130275e-4,
+    -0.002497821279189813, -779190719229054e-20, 0.2547230374130275e-4,
     0.1623977773425109e-5, 0.3963410113048011685e-7, 0.4116328311909442e-9,
-    0.145596286718675e-11, -0.11676501239718427e-17,
+    0.145596286718675e-11, -11676501239718427e-34,
 ];
 /**
  * Polynomial coefficients for a denominator of erfInvImp
@@ -11316,9 +11686,9 @@ ErrorFunction.ervInvImpFd = [
  * calculation for erf^-1(z) in the interval [0.75, 1] with x greater than 44.
  */
 ErrorFunction.ervInvImpGn = [
-    -0.0005390429110190786, -0.2839875900472772e-6, 0.8994651148922914e-6,
+    -5390429110190786e-19, -2.839875900472772e-7, 0.8994651148922914e-6,
     0.2293458592659209e-7, 0.2255614448635001e-9, 0.9478466275030226e-12,
-    0.13588013010892486e-14, -0.3488903933999489e-21,
+    0.13588013010892486e-14, -3488903933999489e-37,
 ];
 /**
  * Polynomial coefficients for a denominator of erfInvImp
@@ -11329,6 +11699,132 @@ ErrorFunction.ervInvImpGd = [
     0.3999688121938621e-6, 0.1618092908879045e-8, 0.2315586083102596e-11,
 ];
 
+/**
+ * Continuous Univariate Normal distribution, also known as Gaussian distribution.
+ *
+ * For details about this distribution, see {@link http://en.wikipedia.org/wiki/Normal_distribution Wikipedia - Normal distribution}.
+ *
+ * This class shares the same implementation as {@link https://numerics.mathdotnet.com/ Math.NET Numerics}.
+ */
+class NormalDistribution {
+    /**
+     * Computes the cumulative distribution function (CDF) of the distribution at x, i.e. P(X ≤ x).
+     *
+     * @param mean The mean (μ) of the normal distribution.
+     * @param stdDev The standard deviation (σ) of the normal distribution. Range: σ ≥ 0.
+     * @param x The location at which to compute the cumulative distribution function.
+     * @returns The cumulative distribution at {@link x}.
+     */
+    static cdf(mean, stdDev, x) {
+        if (stdDev < 0) {
+            throw new RangeError("Invalid parametrization for the distribution.");
+        }
+        if (mean === x && stdDev === 0) {
+            return 0;
+        }
+        return 0.5 * ErrorFunction.erfc((mean - x) / (stdDev * Math.SQRT2));
+    }
+    /**
+     * Computes the probability density of the distribution (PDF) at x, i.e. ∂P(X ≤ x)/∂x.
+     *
+     * In MATLAB, this is known as `normpdf`.
+     *
+     * @param mean The mean (μ) of the normal distribution.
+     * @param stdDev The standard deviation (σ) of the normal distribution. Range: σ ≥ 0.
+     * @param x The location at which to compute the density.
+     * @returns The density at {@link x}.
+     */
+    static pdf(mean, stdDev, x) {
+        if (stdDev < 0) {
+            throw new RangeError("Invalid parametrization for the distribution.");
+        }
+        const d = (x - mean) / stdDev;
+        return Math.exp(-0.5 * d * d) / (stdDev * Math.sqrt(2 * Math.PI));
+    }
+    /**
+     * Computes the inverse of the cumulative distribution function (InvCDF) for the distribution
+     * at the given probability. This is also known as the quantile or percent point function.
+     *
+     * @param mean The mean (μ) of the normal distribution.
+     * @param stdDev The standard deviation (σ) of the normal distribution. Range: σ ≥ 0.
+     * @param p The location at which to compute the inverse cumulative density.
+     * @returns The inverse cumulative density at `p`.
+     */
+    static invCDF(mean, stdDev, p) {
+        if (stdDev < 0) {
+            throw new RangeError("Invalid parametrization for the distribution.");
+        }
+        return mean - stdDev * Math.SQRT2 * ErrorFunction.erfcInv(2 * p);
+    }
+}
+
+/**
+ * Approximation of the {@link https://en.wikipedia.org/wiki/Poisson_binomial_distribution Poisson binomial distribution}, which can be
+ * updated iteratively.
+ *
+ * For the approximation method, see "Refined Normal Approximation (RNA)" from:
+ *
+ * {@link https://www.researchgate.net/publication/257017356_On_computing_the_distribution_function_for_the_Poisson_binomial_distribution Hong, Y. (2013). On computing the distribution function for the Poisson binomial distribution. Computational Statistics and Data Analysis, Vol. 59, pp. 41-51}.
+ *
+ * This has been verified against a reference implementation provided by the authors in the R package "poibin",
+ * which can be viewed {@link https://rdrr.io/cran/poibin/man/poibin-package.html here}.
+ */
+class IterativePoissonBinomial {
+    constructor() {
+        this.mu = 0;
+        this.var = 0;
+        this.gamma = 0;
+    }
+    /**
+     * Adds a new trial with the provided probability of success to the distribution.
+     *
+     * @param p The probability of success for the new trial.
+     */
+    addProbability(p) {
+        this.mu += p;
+        this.var += p * (1 - p);
+        this.gamma += p * (1 - p) * (1 - 2 * p);
+    }
+    /**
+     * Adds multiple trials with the same probability of success to the distribution.
+     *
+     * @param p The probability of success for the new trials.
+     * @param count The number of trials to add.
+     */
+    addBinnedProbabilities(p, count) {
+        this.mu += p * count;
+        this.var += p * (1 - p) * count;
+        this.gamma += p * (1 - p) * (1 - 2 * p) * count;
+    }
+    /**
+     * Computes the value of the cumulative distribution function for this distribution.
+     *
+     * @param count The argument of the CDF to sample the distribution for. In the discrete case (when it is a whole number),
+     * this corresponds to the number of successful Bernoulli trials to query the CDF for.
+     * @returns The value of CDF at {@link count}. In the discrete case, this corresponds to the probability that at most
+     * {@link count} Bernoulli trials ended in a success.
+     */
+    cdf(count) {
+        if (this.var === 0) {
+            return this.mu <= count ? 1 : 0;
+        }
+        const sigma = Math.sqrt(this.var);
+        const v = this.gamma / (6 * Math.pow(sigma, 3));
+        const k = (count + 0.5 - this.mu) / sigma;
+        const result = NormalDistribution.cdf(0, 1, k) +
+            v * (1 - k * k) * NormalDistribution.pdf(0, 1, k);
+        return MathUtils.clamp(result, 0, 1);
+    }
+    /**
+     * Resets the distribution to an empty state.
+     */
+    reset() {
+        this.mu = 0;
+        this.var = 0;
+        this.gamma = 0;
+    }
+}
+
 /**
  * Ranking status of a beatmap.
  */
@@ -11553,13 +12049,13 @@ class MapInfo {
      * The osu! site link to this beatmap.
      */
     get beatmapLink() {
-        return `https://osu.ppy.sh/b/${this.beatmapId}`;
+        return `https://osu.ppy.sh/b/${this.beatmapId.toString()}`;
     }
     /**
      * The osu! site link to this beatmapset.
      */
     get beatmapSetLink() {
-        return `https://osu.ppy.sh/s/${this.beatmapSetId}`;
+        return `https://osu.ppy.sh/s/${this.beatmapSetId.toString()}`;
     }
     static getInformation(beatmapIdOrHash, downloadBeatmap) {
         return __awaiter(this, void 0, void 0, function* () {
@@ -11570,7 +12066,7 @@ class MapInfo {
             if (result.statusCode !== 200) {
                 throw new Error("osu! API error");
             }
-            const mapinfo = JSON.parse(result.data.toString("utf-8"))[0];
+            const mapinfo = JSON.parse(result.data.toString("utf-8")).at(0);
             if (!mapinfo) {
                 return null;
             }
@@ -11655,7 +12151,7 @@ class MapInfo {
     toAPIResponse() {
         var _a, _b, _c, _d, _e, _f, _g, _h;
         const padDateNumber = (num) => num.toString().padStart(2, "0");
-        const convertDate = (date) => `${date.getUTCFullYear()}-${padDateNumber(date.getUTCMonth() + 1)}-${padDateNumber(date.getUTCDate())} ${padDateNumber(date.getUTCHours())}:${padDateNumber(date.getUTCMinutes())}:${padDateNumber(date.getUTCSeconds())}`;
+        const convertDate = (date) => `${date.getUTCFullYear().toString()}-${padDateNumber(date.getUTCMonth() + 1)}-${padDateNumber(date.getUTCDate())} ${padDateNumber(date.getUTCHours())}:${padDateNumber(date.getUTCMinutes())}:${padDateNumber(date.getUTCSeconds())}`;
         return {
             approved: this.approved.toString(),
             submit_date: convertDate(this.submitDate),
@@ -11667,7 +12163,7 @@ class MapInfo {
             beatmap_id: this.beatmapId.toString(),
             beatmapset_id: this.beatmapSetId.toString(),
             bpm: this.bpm.toString(),
-            creator: this.creator.toString(),
+            creator: this.creator,
             creator_id: this.creatorId.toString(),
             difficultyrating: (_b = (_a = this.totalDifficulty) === null || _a === void 0 ? void 0 : _a.toString()) !== null && _b !== void 0 ? _b : null,
             diff_aim: (_d = (_c = this.aimDifficulty) === null || _c === void 0 ? void 0 : _c.toString()) !== null && _d !== void 0 ? _d : null,
@@ -11677,13 +12173,13 @@ class MapInfo {
             diff_approach: this.ar.toString(),
             diff_drain: this.hp.toString(),
             hit_length: this.hitLength.toString(),
-            source: this.source.toString(),
+            source: this.source,
             genre_id: this.genre.toString(),
             language_id: this.language.toString(),
-            title: this.title.toString(),
+            title: this.title,
             total_length: this.totalLength.toString(),
-            version: this.version.toString(),
-            file_md5: this.hash.toString(),
+            version: this.version,
+            file_md5: this.hash,
             // Guaranteed to be osu!standard for the time being.
             mode: "0",
             tags: this.tags.join(" "),
@@ -11720,7 +12216,7 @@ class MapInfo {
             if (this.hasDownloadedBeatmap() && !force) {
                 return;
             }
-            const url = `https://osu.ppy.sh/osu/${this.beatmapId}`;
+            const url = `https://osu.ppy.sh/osu/${this.beatmapId.toString()}`;
             return fetch(url)
                 .then((res) => __awaiter(this, void 0, void 0, function* () {
                 const text = yield res.text();
@@ -11730,7 +12226,7 @@ class MapInfo {
                 this.cachedBeatmap = new BeatmapDecoder().decode(text).result;
             }))
                 .catch((e) => {
-                console.error(`Request to ${url} failed with the following error: ${e.message}; aborting`);
+                console.error(`Request to ${url} failed with an error, aborting`, e);
             });
         });
     }
@@ -11748,7 +12244,8 @@ class MapInfo {
      * Returns a string representative of the class.
      */
     toString() {
-        return `${this.fullTitle}\nCS: ${this.cs} - AR: ${this.ar} - OD: ${this.od} - HP: ${this.hp}\nBPM: ${this.bpm} - Length: ${this.hitLength}/${this.totalLength} - Max Combo: ${this.maxCombo}\nLast Update: ${this.lastUpdate}`;
+        var _a, _b;
+        return `${this.fullTitle}\nCS: ${this.cs.toString()} - AR: ${this.ar.toString()} - OD: ${this.od.toString()} - HP: ${this.hp.toString()}\nBPM: ${this.bpm.toString()} - Length: ${this.hitLength.toString()}/${this.totalLength.toString()} - Max Combo: ${(_b = (_a = this.maxCombo) === null || _a === void 0 ? void 0 : _a.toString()) !== null && _b !== void 0 ? _b : "N/A"}\nLast Update: ${this.lastUpdate.toUTCString()}`;
     }
 }
 
@@ -11787,27 +12284,62 @@ class ModOldNightCore extends ModNightCore {
 }
 
 /**
- * Continuous Univariate Normal distribution, also known as Gaussian distribution.
+ * Approximation of the {@link https://en.wikipedia.org/wiki/Poisson_binomial_distribution Poisson binomial distribution}.
  *
- * For details about this distribution, see {@link http://en.wikipedia.org/wiki/Normal_distribution Wikipedia - Normal distribution}.
+ * For the approximation method, see "Refined Normal Approximation (RNA)" from:
  *
- * This class shares the same implementation as {@link https://numerics.mathdotnet.com/ Math.NET Numerics}.
+ * {@link https://www.researchgate.net/publication/257017356_On_computing_the_distribution_function_for_the_Poisson_binomial_distribution Hong, Y. (2013). On computing the distribution function for the Poisson binomial distribution. Computational Statistics and Data Analysis, Vol. 59, pp. 41-51}.
+ *
+ * This has been verified against a reference implementation provided by the authors in the R package "poibin",
+ * which can be viewed {@link https://rdrr.io/cran/poibin/man/poibin-package.html here}.
  */
-class NormalDistribution {
+class PoissonBinomial {
     /**
-     * Computes the inverse of the cumulative distribution function (InvCDF) for the distribution
-     * at the given probability. This is also known as the quantile or percent point function.
+     * Creates a new Poisson binomial distribution based on N trials with the provided list or bins of
+     * difficulties, skill, and method for getting the miss probabilities.
      *
-     * @param mean The mean (μ) of the normal distribution.
-     * @param stdDev The standard deviation (σ) of the normal distribution. Range: σ ≥ 0.
-     * @param p The location at which to compute the inverse cumulative density.
-     * @returns The inverse cumulative density at `p`.
+     * @param difficulties The list or bins of difficulties.
+     * @param skill The skill level to get the miss probabilities with.
+     * @param hitProbability The method for converting difficulties and skill into miss probabilities.
      */
-    static invCDF(mean, stdDev, p) {
-        if (stdDev < 0) {
-            throw new RangeError("Invalid parametrization for the distribution.");
+    constructor(difficulties, skill, hitProbability) {
+        this.mu = 0;
+        let variance = 0;
+        let gamma = 0;
+        for (const d of difficulties) {
+            if (d instanceof Bin) {
+                const p = 1 - hitProbability(skill, d.difficulty);
+                this.mu += p * d.noteCount;
+                variance += p * (1 - p) * d.noteCount;
+                gamma += p * (1 - p) * (1 - 2 * p) * d.noteCount;
+            }
+            else {
+                const p = 1 - hitProbability(skill, d);
+                this.mu += p;
+                variance += p * (1 - p);
+                gamma += p * (1 - p) * (1 - 2 * p);
+            }
         }
-        return mean - stdDev * Math.SQRT2 * ErrorFunction.erfcInv(2 * p);
+        this.sigma = Math.sqrt(variance);
+        this.v = gamma / (6 * Math.pow(this.sigma, 3));
+    }
+    /**
+     * Computes the value of the cumulative distribution function for this distribution.
+     *
+     * @param count The argument of the CDF to sample the distribution for. In the discrete case (when it is a whole number),
+     * this corresponds to the number of successful Bernoulli trials to query the CDF for.
+     * @returns The value of CDF at {@link count}. In the discrete case, this corresponds to the probability that at most
+     * {@link count} Bernoulli trials ended in a success.
+     */
+    cdf(count) {
+        if (this.sigma === 0) {
+            return 1;
+        }
+        const k = (count + 0.5 - this.mu) / this.sigma;
+        // See equation (14) of the cited paper.
+        const result = NormalDistribution.cdf(0, 1, k) +
+            this.v * (1 - k * k) * NormalDistribution.pdf(0, 1, k);
+        return MathUtils.clamp(result, 0, 1);
     }
 }
 
@@ -11828,10 +12360,12 @@ exports.BeatmapHitObjects = BeatmapHitObjects;
 exports.BeatmapMetadata = BeatmapMetadata;
 exports.BeatmapProcessor = BeatmapProcessor;
 exports.BeatmapVideo = BeatmapVideo;
+exports.Bin = Bin;
 exports.BlendingParameters = BlendingParameters;
 exports.BooleanModSetting = BooleanModSetting;
 exports.BreakPoint = BreakPoint;
 exports.Brent = Brent;
+exports.Chandrupatla = Chandrupatla;
 exports.Circle = Circle;
 exports.CircleSizeCalculator = CircleSizeCalculator;
 exports.Command = Command;
@@ -11858,6 +12392,7 @@ exports.HitSampleInfo = HitSampleInfo;
 exports.HitWindow = HitWindow;
 exports.IntegerModSetting = IntegerModSetting;
 exports.Interpolation = Interpolation;
+exports.IterativePoissonBinomial = IterativePoissonBinomial;
 exports.MapInfo = MapInfo;
 exports.MathUtils = MathUtils;
 exports.Mod = Mod;
@@ -11913,6 +12448,7 @@ exports.OsuPlayableBeatmap = OsuPlayableBeatmap;
 exports.PathApproximator = PathApproximator;
 exports.PlayableBeatmap = PlayableBeatmap;
 exports.Playfield = Playfield;
+exports.PoissonBinomial = PoissonBinomial;
 exports.Polynomial = Polynomial;
 exports.PreciseDroidHitWindow = PreciseDroidHitWindow;
 exports.Precision = Precision;