@libraz/libcantus 0.9.3 → 0.9.5

package/dist/chunk-MTMZTMWM.cjs

@@ -0,0 +1,53 @@
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});
+
+
+
+
+var _chunkPI3UXRWKcjs = require('./chunk-PI3UXRWK.cjs');
+
+// src/core/random/index.ts
+function createRng(seed) {
+  _chunkPI3UXRWKcjs.assertInteger.call(void 0, seed, "seed", 0, 4294967295);
+  let state = seed >>> 0;
+  const next = () => {
+    state = state + 1831565813 >>> 0;
+    let t = state;
+    t = Math.imul(t ^ t >>> 15, t | 1);
+    t ^= t + Math.imul(t ^ t >>> 7, t | 61);
+    return ((t ^ t >>> 14) >>> 0) / 4294967296;
+  };
+  return {
+    next,
+    prob: (p) => {
+      _chunkPI3UXRWKcjs.assertRange.call(void 0, p, 0, 1, "probability");
+      return next() < p;
+    },
+    range: (lo, hi) => {
+      _chunkPI3UXRWKcjs.assertInteger.call(void 0, lo, "range lower bound");
+      _chunkPI3UXRWKcjs.assertInteger.call(void 0, hi, "range upper bound");
+      if (lo > hi) {
+        throw new (0, _chunkPI3UXRWKcjs.InvalidInputError)(
+          `range lower bound must not exceed upper bound; received ${lo} > ${hi}`
+        );
+      }
+      _chunkPI3UXRWKcjs.assertInteger.call(void 0, hi - lo, "range span", 0);
+      return lo + Math.floor(next() * (hi - lo + 1));
+    },
+    float: (lo, hi) => {
+      _chunkPI3UXRWKcjs.assertFiniteNumber.call(void 0, lo, "float lower bound");
+      _chunkPI3UXRWKcjs.assertFiniteNumber.call(void 0, hi, "float upper bound");
+      if (lo > hi) {
+        throw new (0, _chunkPI3UXRWKcjs.InvalidInputError)(
+          `float lower bound must not exceed upper bound; received ${lo} > ${hi}`
+        );
+      }
+      _chunkPI3UXRWKcjs.assertFiniteNumber.call(void 0, hi - lo, "float span");
+      return lo + next() * (hi - lo);
+    }
+  };
+}
+
+
+
+exports.createRng = createRng;
+//# sourceMappingURL=chunk-MTMZTMWM.cjs.map

package/dist/chunk-MTMZTMWM.cjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["/home/runner/work/libcantus/libcantus/dist/chunk-MTMZTMWM.cjs","../src/core/random/index.ts"],"names":[],"mappings":"AAAA;AACE;AACA;AACA;AACA;AACF,wDAA6B;AAC7B;AACA;ACiCO,SAAS,SAAA,CAAU,IAAA,EAAmB;AAG3C,EAAA,6CAAA,IAAc,EAAM,MAAA,EAAQ,CAAA,EAAG,UAAU,CAAA;AACzC,EAAA,IAAI,MAAA,EAAQ,KAAA,IAAS,CAAA;AACrB,EAAA,MAAM,KAAA,EAAO,CAAA,EAAA,GAAM;AACjB,IAAA,MAAA,EAAS,MAAA,EAAQ,WAAA,IAAgB,CAAA;AACjC,IAAA,IAAI,EAAA,EAAI,KAAA;AACR,IAAA,EAAA,EAAI,IAAA,CAAK,IAAA,CAAK,EAAA,EAAK,EAAA,IAAM,EAAA,EAAK,EAAA,EAAI,CAAC,CAAA;AACnC,IAAA,EAAA,GAAK,EAAA,EAAI,IAAA,CAAK,IAAA,CAAK,EAAA,EAAK,EAAA,IAAM,CAAA,EAAI,EAAA,EAAI,EAAE,CAAA;AACxC,IAAA,OAAA,CAAA,CAAS,EAAA,EAAK,EAAA,IAAM,EAAA,EAAA,IAAS,CAAA,EAAA,EAAK,UAAA;AAAA,EACpC,CAAA;AACA,EAAA,OAAO;AAAA,IACL,IAAA;AAAA,IACA,IAAA,EAAM,CAAC,CAAA,EAAA,GAAM;AAIX,MAAA,2CAAA,CAAY,EAAG,CAAA,EAAG,CAAA,EAAG,aAAa,CAAA;AAClC,MAAA,OAAO,IAAA,CAAK,EAAA,EAAI,CAAA;AAAA,IAClB,CAAA;AAAA,IACA,KAAA,EAAO,CAAC,EAAA,EAAI,EAAA,EAAA,GAAO;AACjB,MAAA,6CAAA,EAAc,EAAI,mBAAmB,CAAA;AACrC,MAAA,6CAAA,EAAc,EAAI,mBAAmB,CAAA;AACrC,MAAA,GAAA,CAAI,GAAA,EAAK,EAAA,EAAI;AACX,QAAA,MAAM,IAAI,wCAAA;AAAA,UACR,CAAA,wDAAA,EAA2D,EAAE,CAAA,GAAA,EAAM,EAAE,CAAA;AAAA,QAAA;AACvE,MAAA;AAEF,MAAA;AACA,MAAA;AAA6C,IAAA;AAC/C,IAAA;AAEE,MAAA;AACA,MAAA;AACA,MAAA;AACE,QAAA;AAAU,UAAA;AAC6D,QAAA;AACvE,MAAA;AAEF,MAAA;AACA,MAAA;AAA2B,IAAA;AAC7B,EAAA;AAEJ;ADpCA;AACA;AACA;AACA","file":"/home/runner/work/libcantus/libcantus/dist/chunk-MTMZTMWM.cjs","sourcesContent":[null,"/**\n * Deterministic seeded pseudo-random number generation shared across the\n * generative modules (rhythm, drums, bass, groove, counter-melody). A single\n * mulberry32 core exposes the small set of samplers those modules need; given a\n * seed the stream is fully reproducible.\n */\n\nimport { InvalidInputError } from '../errors/index.js';\nimport { assertFiniteNumber, assertInteger, assertRange } from '../validation/index.js';\n\n/**\n * A deterministic PRNG with the sampling helpers the generators need.\n *\n * @category Utilities\n */\nexport type Rng = {\n  /** Next float in [0, 1). */\n  next: () => number;\n  /** True with probability `p`. */\n  prob: (p: number) => boolean;\n  /** Integer in the inclusive range [lo, hi]. */\n  range: (lo: number, hi: number) => number;\n  /** Float in [lo, hi). */\n  float: (lo: number, hi: number) => number;\n};\n\n/**\n * Create a seeded PRNG (mulberry32) exposing the shared samplers.\n *\n * @param seed The 32-bit seed; the same seed always yields the same stream.\n * @returns The seeded generator.\n * @example\n * ```ts\n * import { createRng } from '@libraz/libcantus';\n * const rng = createRng(42);\n * rng.next(); // deterministic float in [0, 1)\n * rng.range(1, 6); // deterministic integer in [1, 6]\n * ```\n * @category Utilities\n */\nexport function createRng(seed: number): Rng {\n  // The state is 32 bits, so a wider or fractional seed would be truncated —\n  // silently mapping distinct seeds onto one sequence.\n  assertInteger(seed, 'seed', 0, 0xffffffff);\n  let state = seed >>> 0;\n  const next = () => {\n    state = (state + 0x6d2b79f5) >>> 0;\n    let t = state;\n    t = Math.imul(t ^ (t >>> 15), t | 1);\n    t ^= t + Math.imul(t ^ (t >>> 7), t | 61);\n    return ((t ^ (t >>> 14)) >>> 0) / 4294967296;\n  };\n  return {\n    next,\n    prob: (p) => {\n      // Validate first: a draw consumed by a rejected call shifts the stream,\n      // so a caller who catches the error gets a different sequence than one\n      // who never made the call.\n      assertRange(p, 0, 1, 'probability');\n      return next() < p;\n    },\n    range: (lo, hi) => {\n      assertInteger(lo, 'range lower bound');\n      assertInteger(hi, 'range upper bound');\n      if (lo > hi) {\n        throw new InvalidInputError(\n          `range lower bound must not exceed upper bound; received ${lo} > ${hi}`,\n        );\n      }\n      assertInteger(hi - lo, 'range span', 0);\n      return lo + Math.floor(next() * (hi - lo + 1));\n    },\n    float: (lo, hi) => {\n      assertFiniteNumber(lo, 'float lower bound');\n      assertFiniteNumber(hi, 'float upper bound');\n      if (lo > hi) {\n        throw new InvalidInputError(\n          `float lower bound must not exceed upper bound; received ${lo} > ${hi}`,\n        );\n      }\n      assertFiniteNumber(hi - lo, 'float span');\n      return lo + next() * (hi - lo);\n    },\n  };\n}\n"]}