Merge branch 'main' of github.com:dankogai/js-combinatorics

Author: dankogai

.github/workflows/node.js.yml

@@ -4,6 +4,7 @@
 name: CI via GitHub Actions
 
 on:
+  workflow_dispatch:
   push:
     branches: [ main ]
   pull_request:
@@ -14,9 +15,9 @@ jobs:
     runs-on: ubuntu-latest
     strategy:
       matrix:
-        node-version: [18, 16]
+        node-version: [22, 20, 18]
     steps:
-      - uses: actions/checkout@v3
+      - uses: actions/checkout@v4
       - uses: actions/setup-node@v3
         with:
           node-version: ${{ matrix.node-version }}

Makefile

@@ -11,13 +11,13 @@ UMD=$(UMD_DIR)/$(JS)
 all: $(PJ) $(JS) $(COMMONJS) $(UMD)
 
 $(JS): $(PJ) $(TS)
-	tsc -d --target es2020 $(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)
+	-tsc --module umd --outDir $(UMD_DIR) --target es2020 $(TS) > /dev/null
 
 test: all
 	mocha

README.md

@@ -47,7 +47,7 @@ import { Combination, Permutation }  from './combinatorics.js';
 You don't even have to install if you `import` from CDNs.
 
 ```javascript
-import * as $C from 'https://cdn.jsdelivr.net/npm/js-combinatorics@2.1.1/combinatorics.min.js';
+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.
@@ -84,7 +84,7 @@ undefined
   factorial: [Function: factorial],
   permutation: [Function: permutation],
   randomInteger: [Function: randomInteger],
-  version: '2.1.1'
+  version: '2.1.2'
 }
 > [...new $C.Permutation('abcd')]
 [

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.1";
+export declare const version = "2.1.2";
 /**
  * BigInt Workaround
  *

combinatorics.js

@@ -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.1';
+export const version = '2.1.2';
 /**
  * calculates `P(n, k)`.
  *
@@ -218,6 +218,18 @@ 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
      */
@@ -264,6 +276,7 @@ export class Permutation extends _CBase {
  * Combination
  */
 export class Combination extends _CBase {
+    comb;
     constructor(seed, size = 0) {
         super();
         this.seed = [...seed];
@@ -317,6 +330,7 @@ export class Combination extends _CBase {
  * Base N
  */
 export class BaseN extends _CBase {
+    base;
     constructor(seed, size = 1) {
         if (size < 1)
             throw new RangeError(`${size} is out of range`);

combinatorics.ts

@@ -1,6 +1,3 @@
-import { doesNotThrow } from "assert";
-import { type } from "os";
-
 /**
  * combinatorics.js
  *
@@ -15,7 +12,7 @@ import { type } from "os";
  *  @link: http://en.wikipedia.org/wiki/Factorial_number_system
  *  @link: https://en.wikipedia.org/wiki/Combinatorial_number_system
  */
-export const version = '2.1.1';
+export const version = '2.1.2';
 /**
  * BigInt Workaround
  * 

commonjs/combinatorics.js

@@ -15,7 +15,7 @@ exports.CartesianProduct = exports.PowerSet = exports.BaseN = exports.Combinatio
  *  @link: http://en.wikipedia.org/wiki/Factorial_number_system
  *  @link: https://en.wikipedia.org/wiki/Combinatorial_number_system
  */
-exports.version = '2.1.1';
+exports.version = '2.1.2';
 /**
  * calculates `P(n, k)`.
  *

package.json

@@ -1,6 +1,6 @@
 {
   "name": "js-combinatorics",
-  "version": "2.1.1",
+  "version": "2.1.2",
   "description": "Simple combinatorics like power set, combination, and permutation in JavaScript",
   "main": "combinatorics.js",
   "module": "combinatorics.js",
@@ -18,9 +18,9 @@
   ],
   "runkitExample": "require=require(\"esm\")(module);\nvar Combinatorics=require(\"js-combinatorics\");\n",
   "devDependencies": {
-    "typescript": "^3.9.7",
-    "@types/node": "^14.0.26",
-    "mocha": "^8.0.0",
+    "typescript": "^5.0.0",
+    "@types/node": "^20.9.0",
+    "mocha": "^10.0.0",
     "chai": "^4.2.0"
   },
   "scripts": {

umd/combinatorics.js

@@ -24,7 +24,7 @@
      *  @link: http://en.wikipedia.org/wiki/Factorial_number_system
      *  @link: https://en.wikipedia.org/wiki/Combinatorial_number_system
      */
-    exports.version = '2.1.1';
+    exports.version = '2.1.2';
     /**
      * calculates `P(n, k)`.
      *