@yipe/dice 0.1.0 → 0.1.1

package/dist/index.d.cts

@@ -572,7 +572,7 @@ declare class DiceQuery {
      * const bonusAttack = parse("(d20 + 3 AC 15) * (1d6 + 1)");
      * const bothAttacks = mainAttack.convolve(bonusAttack);
      */
-    convolve(other: DiceQuery, eps?: number): DiceQuery;
+    convolve(other: DiceQuery): DiceQuery;
     /**
      * First-success split over an ordered list of DISTINCT single-swing PMFs.
      * Each PMF may have different success/subset probabilities (from labels).
@@ -635,7 +635,7 @@ declare class PMF {
     constructor(map?: Map<number, Bin>, epsilon?: number, normalized?: boolean, identifier?: string, _preservedProvidence?: boolean);
     static empty(epsilon?: number, identifier?: string): PMF;
     static zero(epsilon?: number): PMF;
-    static emptyMass(epsilon?: number): PMF;
+    static emptyMass(): PMF;
     [Symbol.iterator](): IterableIterator<[number, Bin]>;
     static clearCache(): void;
     /**
@@ -741,7 +741,7 @@ declare class PMF {
      * If you want to query any atLeast probabilities, you should use the DiceQuery class instead without power().
      */
     power(n: number, eps?: number): PMF;
-    replicate(n: number, eps?: number): PMF[];
+    replicate(n: number): PMF[];
     mass(): number;
     outcomeMass(outcome: string): number;
     faceTotal(): number;

package/dist/index.d.ts

@@ -572,7 +572,7 @@ declare class DiceQuery {
      * const bonusAttack = parse("(d20 + 3 AC 15) * (1d6 + 1)");
      * const bothAttacks = mainAttack.convolve(bonusAttack);
      */
-    convolve(other: DiceQuery, eps?: number): DiceQuery;
+    convolve(other: DiceQuery): DiceQuery;
     /**
      * First-success split over an ordered list of DISTINCT single-swing PMFs.
      * Each PMF may have different success/subset probabilities (from labels).
@@ -635,7 +635,7 @@ declare class PMF {
     constructor(map?: Map<number, Bin>, epsilon?: number, normalized?: boolean, identifier?: string, _preservedProvidence?: boolean);
     static empty(epsilon?: number, identifier?: string): PMF;
     static zero(epsilon?: number): PMF;
-    static emptyMass(epsilon?: number): PMF;
+    static emptyMass(): PMF;
     [Symbol.iterator](): IterableIterator<[number, Bin]>;
     static clearCache(): void;
     /**
@@ -741,7 +741,7 @@ declare class PMF {
      * If you want to query any atLeast probabilities, you should use the DiceQuery class instead without power().
      */
     power(n: number, eps?: number): PMF;
-    replicate(n: number, eps?: number): PMF[];
+    replicate(n: number): PMF[];
     mass(): number;
     outcomeMass(outcome: string): number;
     faceTotal(): number;

package/dist/index.js

@@ -1,8 +1,12 @@
+var __defProp = Object.defineProperty;
+var __defNormalProp = (obj, key, value) => key in obj ? __defProp(obj, key, { enumerable: true, configurable: true, writable: true, value }) : obj[key] = value;
+var __publicField = (obj, key, value) => __defNormalProp(obj, typeof key !== "symbol" ? key + "" : key, value);
+
 // src/lru-cache.ts
 var LRUCache = class {
   constructor(maxSize = 1e3) {
     this.maxSize = maxSize;
-    this.cache = /* @__PURE__ */ new Map();
+    __publicField(this, "cache", /* @__PURE__ */ new Map());
   }
   get(key) {
     const value = this.cache.get(key);
@@ -47,6 +51,8 @@ var TEST_EPS = 1e-10;
 // src/query.ts
 var _DiceQuery = class _DiceQuery {
   constructor(singles, combined) {
+    __publicField(this, "singles");
+    __publicField(this, "combined");
     this.singles = Array.isArray(singles) ? singles : [singles];
     const c = combined ?? PMF.convolveMany(this.singles);
     this.combined = Math.abs(c.mass() - 1) <= 1e-12 ? c : c.normalize();
@@ -993,7 +999,7 @@ var _DiceQuery = class _DiceQuery {
   outcomeTotals(outcomes = this.outcomeKeys()) {
     const totals = /* @__PURE__ */ new Map();
     outcomes.forEach((o) => totals.set(o, 0));
-    for (const [x, row] of this.combined.map) {
+    for (const [, row] of this.combined.map) {
       for (const o of outcomes) {
         const p = row.count[o] || 0;
         totals.set(o, (totals.get(o) || 0) + p);
@@ -1208,7 +1214,7 @@ var _DiceQuery = class _DiceQuery {
    * const bonusAttack = parse("(d20 + 3 AC 15) * (1d6 + 1)");
    * const bothAttacks = mainAttack.convolve(bonusAttack);
    */
-  convolve(other, eps) {
+  convolve(other) {
     const singles = [...this.singles, ...other.singles];
     return new _DiceQuery(singles);
   }
@@ -1264,11 +1270,11 @@ var _DiceQuery = class _DiceQuery {
     return [a, b, any, none];
   }
 };
-_DiceQuery.DEFAULT_OUTCOMES = [
+__publicField(_DiceQuery, "DEFAULT_OUTCOMES", [
   "hit",
   "crit",
   "missNone"
-];
+]);
 var DiceQuery = _DiceQuery;
 var EPSILON = COMPUTATIONAL_EPS;
 var pmfCache = new LRUCache(1e3);
@@ -1279,6 +1285,14 @@ var _PMF = class _PMF {
     this.normalized = normalized;
     this.identifier = identifier;
     this._preservedProvidence = _preservedProvidence;
+    // Cached computed values
+    __publicField(this, "_support");
+    __publicField(this, "_min");
+    __publicField(this, "_max");
+    __publicField(this, "_totalMass");
+    __publicField(this, "_mean");
+    __publicField(this, "_variance");
+    __publicField(this, "_stdev");
   }
   static empty(epsilon = EPSILON, identifier = "empty") {
     return new _PMF(/* @__PURE__ */ new Map(), epsilon, false, identifier);
@@ -1290,7 +1304,7 @@ var _PMF = class _PMF {
     return new _PMF(m, epsilon, false, "zero");
   }
   // This creates a single bin at value 0, but with weight 0.
-  static emptyMass(epsilon = EPSILON) {
+  static emptyMass() {
     return _PMF.zero().scaleMass(0);
   }
   //  Makes PMF iterable over [damage, bin] pairs.
@@ -1498,7 +1512,7 @@ var _PMF = class _PMF {
   /*
    * Helper for chaining multiple identical attacks
    */
-  replicate(n, eps = this.epsilon) {
+  replicate(n) {
     if (!Number.isInteger(n) || n <= 0) {
       throw new Error("combineN(n): n must be a positive integer");
     }
@@ -2096,7 +2110,7 @@ var _PMF = class _PMF {
   }
 };
 // Unique ID generator for anonymous PMFs to avoid cache key collisions
-_PMF.__anonIdCounter = 1;
+__publicField(_PMF, "__anonIdCounter", 1);
 var PMF = _PMF;
 function getPowerCacheKey(base, n, eps) {
   const id = base.identifier;
@@ -2108,10 +2122,11 @@ function getPowerCacheKey(base, n, eps) {
 // src/dice.ts
 var Dice = class _Dice {
   constructor(x = 0) {
-    this.faces = {};
-    this.privateData = {};
-    this.outcomeData = {};
-    this.hasHitDistributionCalculated = false;
+    __publicField(this, "faces", {});
+    __publicField(this, "privateData", {});
+    __publicField(this, "outcomeData", {});
+    __publicField(this, "hasHitDistributionCalculated", false);
+    __publicField(this, "identifier");
     if (x <= 0) return;
     for (let i = 1; i <= x; i++) {
       this.faces[i] = 1;
@@ -2780,20 +2795,12 @@ function parseArgumentInternal(s, n) {
     case "k":
       assertToken(s, "k");
       return parseKeep(s, n);
-    case "0":
-    case "1":
-    case "2":
-    case "3":
-    case "4":
-    case "5":
-    case "6":
-    case "7":
-    case "8":
-    case "9":
     case "n":
       return parseNumber(s, n);
+    default:
+      if (isDigit(c)) return parseNumber(s, n);
+      return;
   }
-  return;
 }
 function parseBinaryArgument(arg, arr, n) {
   if (arr.length >= 4 && arr[0] === "h" && peek(arr, "half")) {