Build with rollup like js-base64

One TypeScript source now yields all three formats via rollup:
combinatorics.js (ESM), commonjs/combinatorics.js and
umd/combinatorics.js -- the UMD build now provides a proper
window.Combinatorics browser global. The version string is injected
from package.json at build time, and the npm version hook keeps
README CDN URLs in sync.

Co-Authored-By: Claude Fable 5 <noreply@anthropic.com>

Author: dankogai

Makefile

@@ -1,27 +1,10 @@
-PJ=package.json
-TS=combinatorics.ts
-JS=combinatorics.js
-MJS=combinatorics.mjs
-DTS=combinatorics.d.ts
-COMMONJS_DIR=commonjs
-COMMONJS=$(COMMONJS_DIR)/$(JS)
-UMD_DIR=umd
-UMD=$(UMD_DIR)/$(JS)
+all:
+	npm run build
 
-all: $(PJ) $(JS) $(COMMONJS) $(UMD)
-
-$(JS): $(PJ) $(TS)
-	tsc -d --module nodenext $(TS)
-
-$(COMMONJS): $(PJ) $(TS)
-	tsc --module commonjs --outDir $(COMMONJS_DIR) --target es2020 $(TS)
-
-$(UMD): $(PJ) $(TS)
-	-tsc --module umd --outDir $(UMD_DIR) --target es2020 $(TS) > /dev/null
-
-test: all
-	mocha
+test:
+	npm test
 
 clean:
-	-rm $(DTS) $(MJS) $(JS) $(COMMONJS) $(UMD)
+	npm run clean
 
+.PHONY: all test clean

README.md

@@ -50,13 +50,10 @@ You don't even have to install if you `import` from CDNs.
 import * as $C from 'https://cdn.jsdelivr.net/npm/js-combinatorics@2.1.2/combinatorics.min.js';
 ```
 
-Since this is an ES6 module, `type="module"` is required the `<script>` tags. of your HTML files. But you can make it globally available as follows.
+Or plain old `<script>` tags — the UMD version `umd/combinatorics.js` makes `Combinatorics` globally available.
 
 ```html
-<script type="module">
-  import * as $C from 'combinatorics.js';
-  window.Combinatorics = $C;
-</script>
+<script src="https://cdn.jsdelivr.net/npm/js-combinatorics@2.1.2/umd/combinatorics.min.js"></script>
 <script>
   // now you can access Combinatorics
   let c = new Combinatorics.Combination('abcdefgh', 4);
@@ -581,7 +578,7 @@ ditto
 * module. `import` instead of `require`.
 * `BigInt` where possible
 
-And from version 1.2 it is written in TypeScript.  `combinatorics.js` and  `combinatorics.d.ts` are compiled from `combinatorics.ts`.
+And from version 1.2 it is written in TypeScript.  `combinatorics.js` and `combinatorics.d.ts` are compiled from `combinatorics.ts`.
 
 APIs will change accordingly.  Old versions are available in the `version0` branch.
 

combinatorics.d.ts

@@ -12,7 +12,7 @@
  *  @link: http://en.wikipedia.org/wiki/Factorial_number_system
  *  @link: https://en.wikipedia.org/wiki/Combinatorial_number_system
  */
-export declare const version = "2.1.2";
+export declare const version: string;
 /**
  * BigInt Workaround
  *

combinatorics.js

@@ -1,3 +1,6 @@
+//
+// THIS FILE IS AUTOMATICALLY GENERATED! DO NOT EDIT BY HAND!
+//
 /**
  * combinatorics.js
  *
@@ -12,13 +15,13 @@
  *  @link: http://en.wikipedia.org/wiki/Factorial_number_system
  *  @link: https://en.wikipedia.org/wiki/Combinatorial_number_system
  */
-export const version = '2.1.2';
+const version = '2.1.2';
 /**
  * calculates `P(n, k)`.
  *
  * @link https://en.wikipedia.org/wiki/Permutation
  */
-export function permutation(n, k) {
+function permutation(n, k) {
     if (n < 0)
         throw new RangeError(`${n} is out of range`);
     if (k < 0)
@@ -37,7 +40,7 @@ export function permutation(n, k) {
  *
  * @link https://en.wikipedia.org/wiki/Combination
  */
-export function combination(n, k) {
+function combination(n, k) {
     if (0 == k)
         return 1n;
     if (n == k)
@@ -51,7 +54,7 @@ export function combination(n, k) {
  *
  * @link https://en.wikipedia.org/wiki/Factorial
  */
-export function factorial(n) {
+function factorial(n) {
     return permutation(n, n);
 }
 /**
@@ -60,7 +63,7 @@ export function factorial(n) {
  * @link https://en.wikipedia.org/wiki/Factorial_number_system
  * @param {number} l the number of digits
  */
-export function factoradic(n, l = 0) {
+function factoradic(n, l = 0) {
     if (n < 0)
         throw new RangeError(`${n} is out of range`);
     let [bn, bf] = [BigInt(n), 1n];
@@ -87,7 +90,7 @@ export function factoradic(n, l = 0) {
  *
  * @link https://en.wikipedia.org/wiki/Combinatorial_number_system
  */
-export function combinadic(n, k) {
+function combinadic(n, k) {
     const count = combination(n, k);
     const [bn, bk] = [BigInt(n), BigInt(k)];
     return (m) => {
@@ -124,7 +127,7 @@ const _randomBytes = typeof _crypto['randomBytes'] === 'function'
  * @param {anyint} min
  * @param {anyint} max
  */
-export function randomInteger(min = 0, max = Math.pow(2, 53)) {
+function randomInteger(min = 0, max = Math.pow(2, 53)) {
     let ctor = min.constructor;
     if (arguments.length === 0) {
         return Math.floor(Math.random() * ctor(max));
@@ -142,7 +145,6 @@ export function randomInteger(min = 0, max = Math.pow(2, 53)) {
     const rnd = u8s.reduce((a, v) => ((a << ctor(8)) + ctor(v)), ctor(0));
     return ((ctor(rnd) * mag) >> ctor(len * 8)) + ctor(min);
 }
-;
 /**
  * Base Class of `js-combinatorics`
  */
@@ -218,18 +220,6 @@ class _CBase {
      * an alias of `at`
      */
     nth(n) { return this.at(n); }
-    /**
-     * the seed iterable
-     */
-    seed;
-    /**
-     * the size (# of elements) of each element.
-     */
-    size;
-    /**
-     * the number of elements
-     */
-    length;
     /**
      * pick random element
      */
@@ -249,7 +239,7 @@ class _CBase {
 /**
  * Permutation
  */
-export class Permutation extends _CBase {
+class Permutation extends _CBase {
     constructor(seed, size = 0) {
         super();
         this.seed = [...seed];
@@ -275,8 +265,7 @@ export class Permutation extends _CBase {
 /**
  * Combination
  */
-export class Combination extends _CBase {
-    comb;
+class Combination extends _CBase {
     constructor(seed, size = 0) {
         super();
         this.seed = [...seed];
@@ -329,8 +318,7 @@ export class Combination extends _CBase {
 /**
  * Base N
  */
-export class BaseN extends _CBase {
-    base;
+class BaseN extends _CBase {
     constructor(seed, size = 1) {
         if (size < 1)
             throw new RangeError(`${size} is out of range`);
@@ -361,7 +349,7 @@ export class BaseN extends _CBase {
 /**
  * Power Set
  */
-export class PowerSet extends _CBase {
+class PowerSet extends _CBase {
     constructor(seed) {
         super();
         this.seed = [...seed];
@@ -384,7 +372,7 @@ export class PowerSet extends _CBase {
 /**
  * Cartesian Product
  */
-export class CartesianProduct extends _CBase {
+class CartesianProduct extends _CBase {
     constructor(...args) {
         super();
         this.seed = args.map(v => [...v]);
@@ -410,3 +398,5 @@ export class CartesianProduct extends _CBase {
         return result;
     }
 }
+
+export { BaseN, CartesianProduct, Combination, Permutation, PowerSet, combinadic, combination, factoradic, factorial, permutation, randomInteger, version };

combinatorics.ts

@@ -12,7 +12,7 @@
  *  @link: http://en.wikipedia.org/wiki/Factorial_number_system
  *  @link: https://en.wikipedia.org/wiki/Combinatorial_number_system
  */
-export const version = '2.1.2';
+export const version: string = '__VERSION__';
 /**
  * BigInt Workaround
  * 

commonjs/combinatorics.js

@@ -1,12 +1,8 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.CartesianProduct = exports.PowerSet = exports.BaseN = exports.Combination = exports.Permutation = exports.version = void 0;
-exports.permutation = permutation;
-exports.combination = combination;
-exports.factorial = factorial;
-exports.factoradic = factoradic;
-exports.combinadic = combinadic;
-exports.randomInteger = randomInteger;
+//
+// THIS FILE IS AUTOMATICALLY GENERATED! DO NOT EDIT BY HAND!
+//
+'use strict';
+
 /**
  * combinatorics.js
  *
@@ -21,7 +17,7 @@ exports.randomInteger = randomInteger;
  *  @link: http://en.wikipedia.org/wiki/Factorial_number_system
  *  @link: https://en.wikipedia.org/wiki/Combinatorial_number_system
  */
-exports.version = '2.1.2';
+const version = '2.1.2';
 /**
  * calculates `P(n, k)`.
  *
@@ -151,7 +147,6 @@ function randomInteger(min = 0, max = Math.pow(2, 53)) {
     const rnd = u8s.reduce((a, v) => ((a << ctor(8)) + ctor(v)), ctor(0));
     return ((ctor(rnd) * mag) >> ctor(len * 8)) + ctor(min);
 }
-;
 /**
  * Base Class of `js-combinatorics`
  */
@@ -269,7 +264,6 @@ class Permutation extends _CBase {
         return result;
     }
 }
-exports.Permutation = Permutation;
 /**
  * Combination
  */
@@ -323,7 +317,6 @@ class Combination extends _CBase {
         return result;
     }
 }
-exports.Combination = Combination;
 /**
  * Base N
  */
@@ -355,7 +348,6 @@ class BaseN extends _CBase {
         return result;
     }
 }
-exports.BaseN = BaseN;
 /**
  * Power Set
  */
@@ -379,7 +371,6 @@ class PowerSet extends _CBase {
         return result;
     }
 }
-exports.PowerSet = PowerSet;
 /**
  * Cartesian Product
  */
@@ -409,4 +400,16 @@ class CartesianProduct extends _CBase {
         return result;
     }
 }
+
+exports.BaseN = BaseN;
 exports.CartesianProduct = CartesianProduct;
+exports.Combination = Combination;
+exports.Permutation = Permutation;
+exports.PowerSet = PowerSet;
+exports.combinadic = combinadic;
+exports.combination = combination;
+exports.factoradic = factoradic;
+exports.factorial = factorial;
+exports.permutation = permutation;
+exports.randomInteger = randomInteger;
+exports.version = version;

package.json

@@ -5,26 +5,34 @@
   "main": "combinatorics.js",
   "module": "combinatorics.js",
   "type": "module",
-  "exports": {
-    "import": "./combinatorics.js",
-    "require": "./commonjs/combinatorics.js"
-  },
   "types": "combinatorics.d.ts",
+  "sideEffects": false,
   "files": [
     "combinatorics.d.ts",
     "combinatorics.js",
     "umd",
     "commonjs"
   ],
-  "runkitExample": "require=require(\"esm\")(module);\nvar Combinatorics=require(\"js-combinatorics\");\n",
+  "exports": {
+    "import": "./combinatorics.js",
+    "require": "./commonjs/combinatorics.js"
+  },
+  "scripts": {
+    "build": "rollup -c && tsc -p . --declaration --emitDeclarationOnly",
+    "clean": "node -e \"['combinatorics.js','combinatorics.d.ts','umd/combinatorics.js','commonjs/combinatorics.js'].forEach(f=>require('fs').rmSync(f,{force:true}))\"",
+    "test": "npm run build && mocha",
+    "version": "npm run build && node util/sync-version.js && git add combinatorics.js combinatorics.d.ts umd/combinatorics.js commonjs/combinatorics.js README.md"
+  },
+  "runkitExample": "var Combinatorics=require(\"js-combinatorics\");\n",
   "devDependencies": {
-    "typescript": "^5.0.0",
+    "@rollup/plugin-replace": "^6.0.3",
+    "@rollup/plugin-typescript": "^12.3.0",
     "@types/node": "^20.9.0",
+    "chai": "^4.2.0",
     "mocha": "^10.0.0",
-    "chai": "^4.2.0"
-  },
-  "scripts": {
-    "test": "make clean && make test"
+    "rollup": "^4.62.3",
+    "tslib": "^2.8.1",
+    "typescript": "^5.0.0"
   },
   "repository": {
     "type": "git",
@@ -37,6 +45,5 @@
   ],
   "author": "Dan Kogai",
   "license": "MIT",
-  "readmeFilename": "README.md",
-  "gitHead": "e3684eb54f7c6fbb24bb7a4d08d88671ce12e9eb"
+  "readmeFilename": "README.md"
 }