@yipe/dice 0.1.1 → 0.1.2

package/dist/index.d.cts

@@ -1,9 +1,24 @@
+/**
+ * Simple LRU cache implementation
+ */
+declare class LRUCache<K, V> {
+    private readonly maxSize;
+    private cache;
+    constructor(maxSize?: number);
+    get(key: K): V | undefined;
+    delete(key: K): void;
+    set(key: K, value: V): this;
+    clear(): void;
+    get size(): number;
+    has(key: K): boolean;
+    keys(): IterableIterator<K>;
+    values(): IterableIterator<V>;
+}
+
 /** Mapping from outcome label to probability mass or damage attribution. */
 type OutcomeLabelMap = Partial<Record<string, number>>;
 /** Computational epsilon for pruning negligible probabilities. */
-declare const COMPUTATIONAL_EPS = 1e-40;
-/** Test tolerance for floating-point precision errors. */
-declare const TEST_EPS = 1e-10;
+declare const EPS = 1e-12;
 /** A probability bin for a specific damage value. */
 interface Bin {
     /** Total probability mass at this damage value. */
@@ -604,6 +619,7 @@ type Snapshot = {
     outcomes: Map<OutcomeType, OutcomeSnapshot>;
 };
 
+declare const pmfCache: LRUCache<string, PMF>;
 /**
  * Probability Mass Function for discrete damage distributions.
  *
@@ -730,6 +746,7 @@ declare class PMF {
     static mixN(weights: [number, PMF][]): PMF;
     private setPreservedProvidence;
     preservedProvidence(): boolean;
+    private getPowerCacheKey;
     /**
      * Efficiently computes this PMF convolved with itself `n` times.
      * Uses exponentiation by squaring to reduce total convolutions.
@@ -864,7 +881,6 @@ declare class PMF {
     };
     query(): DiceQuery;
 }
-declare function getPowerCacheKey(base: PMF, n: number, eps: number): string;
 
 /**
  * @internal
@@ -925,23 +941,6 @@ declare class Dice {
 }
 type _DiceInternal = never;
 
-/**
- * Simple LRU cache implementation
- */
-declare class LRUCache<K, V> {
-    private readonly maxSize;
-    private cache;
-    constructor(maxSize?: number);
-    get(key: K): V | undefined;
-    delete(key: K): void;
-    set(key: K, value: V): this;
-    clear(): void;
-    get size(): number;
-    has(key: K): boolean;
-    keys(): IterableIterator<K>;
-    values(): IterableIterator<V>;
-}
-
 /** Enable or disable the internal parse cache. */
 declare function setCachingEnabled(enabled: boolean): void;
 /** Returns whether the internal parse cache is currently enabled. */
@@ -955,4 +954,4 @@ declare function clearParserCache(): void;
  */
 declare function parse(expression: string, n?: number): PMF;
 
-export { type Bin, COMPUTATIONAL_EPS, type DamageDistribution, Dice, DiceQuery, LRUCache, type OutcomeLabelMap, type OutcomeSnapshot, type OutcomeType, PMF, type Snapshot, TEST_EPS, type _DiceInternal, clearParserCache, getCachingEnabled, getPowerCacheKey, parse, setCachingEnabled };
+export { type Bin, type DamageDistribution, Dice, DiceQuery, EPS, LRUCache, type OutcomeLabelMap, type OutcomeSnapshot, type OutcomeType, PMF, type Snapshot, type _DiceInternal, clearParserCache, getCachingEnabled, parse, pmfCache, setCachingEnabled };

package/dist/index.d.ts

@@ -1,9 +1,24 @@
+/**
+ * Simple LRU cache implementation
+ */
+declare class LRUCache<K, V> {
+    private readonly maxSize;
+    private cache;
+    constructor(maxSize?: number);
+    get(key: K): V | undefined;
+    delete(key: K): void;
+    set(key: K, value: V): this;
+    clear(): void;
+    get size(): number;
+    has(key: K): boolean;
+    keys(): IterableIterator<K>;
+    values(): IterableIterator<V>;
+}
+
 /** Mapping from outcome label to probability mass or damage attribution. */
 type OutcomeLabelMap = Partial<Record<string, number>>;
 /** Computational epsilon for pruning negligible probabilities. */
-declare const COMPUTATIONAL_EPS = 1e-40;
-/** Test tolerance for floating-point precision errors. */
-declare const TEST_EPS = 1e-10;
+declare const EPS = 1e-12;
 /** A probability bin for a specific damage value. */
 interface Bin {
     /** Total probability mass at this damage value. */
@@ -604,6 +619,7 @@ type Snapshot = {
     outcomes: Map<OutcomeType, OutcomeSnapshot>;
 };
 
+declare const pmfCache: LRUCache<string, PMF>;
 /**
  * Probability Mass Function for discrete damage distributions.
  *
@@ -730,6 +746,7 @@ declare class PMF {
     static mixN(weights: [number, PMF][]): PMF;
     private setPreservedProvidence;
     preservedProvidence(): boolean;
+    private getPowerCacheKey;
     /**
      * Efficiently computes this PMF convolved with itself `n` times.
      * Uses exponentiation by squaring to reduce total convolutions.
@@ -864,7 +881,6 @@ declare class PMF {
     };
     query(): DiceQuery;
 }
-declare function getPowerCacheKey(base: PMF, n: number, eps: number): string;
 
 /**
  * @internal
@@ -925,23 +941,6 @@ declare class Dice {
 }
 type _DiceInternal = never;
 
-/**
- * Simple LRU cache implementation
- */
-declare class LRUCache<K, V> {
-    private readonly maxSize;
-    private cache;
-    constructor(maxSize?: number);
-    get(key: K): V | undefined;
-    delete(key: K): void;
-    set(key: K, value: V): this;
-    clear(): void;
-    get size(): number;
-    has(key: K): boolean;
-    keys(): IterableIterator<K>;
-    values(): IterableIterator<V>;
-}
-
 /** Enable or disable the internal parse cache. */
 declare function setCachingEnabled(enabled: boolean): void;
 /** Returns whether the internal parse cache is currently enabled. */
@@ -955,4 +954,4 @@ declare function clearParserCache(): void;
  */
 declare function parse(expression: string, n?: number): PMF;
 
-export { type Bin, COMPUTATIONAL_EPS, type DamageDistribution, Dice, DiceQuery, LRUCache, type OutcomeLabelMap, type OutcomeSnapshot, type OutcomeType, PMF, type Snapshot, TEST_EPS, type _DiceInternal, clearParserCache, getCachingEnabled, getPowerCacheKey, parse, setCachingEnabled };
+export { type Bin, type DamageDistribution, Dice, DiceQuery, EPS, LRUCache, type OutcomeLabelMap, type OutcomeSnapshot, type OutcomeType, PMF, type Snapshot, type _DiceInternal, clearParserCache, getCachingEnabled, parse, pmfCache, setCachingEnabled };

package/dist/index.js

@@ -45,8 +45,7 @@ var LRUCache = class {
 };
 
 // src/types.ts
-var COMPUTATIONAL_EPS = 1e-40;
-var TEST_EPS = 1e-10;
+var EPS = 1e-12;
 
 // src/query.ts
 var _DiceQuery = class _DiceQuery {
@@ -1227,7 +1226,7 @@ var _DiceQuery = class _DiceQuery {
    *
    * Returns tuple: [pFirstNonSubset, pFirstSubset, pAnySuccess, pNone]
    */
-  firstSuccessSplit(successOutcome, subsetOutcome, eps = COMPUTATIONAL_EPS) {
+  firstSuccessSplit(successOutcome, subsetOutcome, eps = EPS) {
     const pmfs = this.singles;
     if (!pmfs.length) {
       throw new Error("firstSuccessSplitFromPMFs: pmfs must be non-empty");
@@ -1276,10 +1275,9 @@ __publicField(_DiceQuery, "DEFAULT_OUTCOMES", [
   "missNone"
 ]);
 var DiceQuery = _DiceQuery;
-var EPSILON = COMPUTATIONAL_EPS;
 var pmfCache = new LRUCache(1e3);
 var _PMF = class _PMF {
-  constructor(map = /* @__PURE__ */ new Map(), epsilon = EPSILON, normalized = false, identifier = `anon#${_PMF.__anonIdCounter++}`, _preservedProvidence = true) {
+  constructor(map = /* @__PURE__ */ new Map(), epsilon = EPS, normalized = false, identifier = `anon#${_PMF.__anonIdCounter++}`, _preservedProvidence = true) {
     this.map = map;
     this.epsilon = epsilon;
     this.normalized = normalized;
@@ -1294,11 +1292,11 @@ var _PMF = class _PMF {
     __publicField(this, "_variance");
     __publicField(this, "_stdev");
   }
-  static empty(epsilon = EPSILON, identifier = "empty") {
+  static empty(epsilon = EPS, identifier = "empty") {
     return new _PMF(/* @__PURE__ */ new Map(), epsilon, false, identifier);
   }
   // This has a single bin at value 0, mass of 1
-  static zero(epsilon = EPSILON) {
+  static zero(epsilon = EPS) {
     const m = /* @__PURE__ */ new Map();
     m.set(0, { p: 1, count: { miss: 1 }, attr: {} });
     return new _PMF(m, epsilon, false, "zero");
@@ -1470,6 +1468,12 @@ var _PMF = class _PMF {
   preservedProvidence() {
     return this._preservedProvidence;
   }
+  getPowerCacheKey(n, eps) {
+    const id = this.identifier;
+    let key = `${id}`;
+    for (let i = 1; i < n; i++) key += `+${id}`;
+    return `${key}@${eps}`;
+  }
   /**
    * Efficiently computes this PMF convolved with itself `n` times.
    * Uses exponentiation by squaring to reduce total convolutions.
@@ -1486,7 +1490,7 @@ var _PMF = class _PMF {
     }
     if (n === 1) return this;
     const epsilon = eps ?? this.epsilon;
-    const key = getPowerCacheKey(this, n, epsilon);
+    const key = this.getPowerCacheKey(n, epsilon);
     {
       const cached = pmfCache?.get(key);
       if (cached) return cached;
@@ -1885,7 +1889,7 @@ var _PMF = class _PMF {
    * - Similar PMF lists share common prefixes (A+B, (A+B)+C, etc.)
    * - Order-independent cache keys work better with consistent build patterns
    */
-  static convolveMany(pmfList, eps = EPSILON) {
+  static convolveMany(pmfList, eps = EPS) {
     if (pmfList.length === 0) return _PMF.empty(eps);
     if (pmfList.length === 1) return pmfList[0];
     return _PMF.reduceConvolveLeft(pmfList, eps);
@@ -1900,7 +1904,7 @@ var _PMF = class _PMF {
   static fromJSON(jsonData) {
     return new _PMF(
       new Map(jsonData.bins),
-      EPSILON,
+      EPS,
       !!jsonData.normalized,
       jsonData.identifier || "fromJSON"
     );
@@ -2112,12 +2116,6 @@ var _PMF = class _PMF {
 // Unique ID generator for anonymous PMFs to avoid cache key collisions
 __publicField(_PMF, "__anonIdCounter", 1);
 var PMF = _PMF;
-function getPowerCacheKey(base, n, eps) {
-  const id = base.identifier;
-  let key = `${id}`;
-  for (let i = 1; i < n; i++) key += `+${id}`;
-  return `${key}@${eps}`;
-}
 
 // src/dice.ts
 var Dice = class _Dice {
@@ -2433,7 +2431,7 @@ var Dice = class _Dice {
    * Convert dice to PMF using OutcomeType labels directly from damage distribution.
    * This is much cleaner than the original complex distribution conversion.
    */
-  toPMF(numEpsilon = COMPUTATIONAL_EPS) {
+  toPMF(numEpsilon = EPS) {
     const total = this.total();
     if (total === 0) return PMF.empty(numEpsilon);
     this.ensureHitDistribution();
@@ -2946,6 +2944,6 @@ function parseOperation(s) {
   return;
 }
 
-export { COMPUTATIONAL_EPS, Dice, DiceQuery, LRUCache, PMF, TEST_EPS, clearParserCache, getCachingEnabled, getPowerCacheKey, parse, setCachingEnabled };
+export { Dice, DiceQuery, EPS, LRUCache, PMF, clearParserCache, getCachingEnabled, parse, pmfCache, setCachingEnabled };
 //# sourceMappingURL=index.js.map
 //# sourceMappingURL=index.js.map