Refactor exports in combinatorics.js to improve readability and maintainability

Author: dankogai

.gitignore

@@ -41,8 +41,8 @@ build/Release
 node_modules/
 jspm_packages/
 
-# TypeScript v1 declaration files
-typings/
+# Snowpack dependency directory (https://snowpack.dev/)
+web_modules/
 
 # TypeScript cache
 *.tsbuildinfo
@@ -53,11 +53,8 @@ typings/
 # Optional eslint cache
 .eslintcache
 
-# Microbundle cache
-.rpt2_cache/
-.rts2_cache_cjs/
-.rts2_cache_es/
-.rts2_cache_umd/
+# Optional stylelint cache
+.stylelintcache
 
 # Optional REPL history
 .node_repl_history
@@ -68,29 +65,48 @@ typings/
 # Yarn Integrity file
 .yarn-integrity
 
-# dotenv environment variables file
+# dotenv environment variable files
 .env
-.env.test
+.env.*
+!.env.example
 
 # parcel-bundler cache (https://parceljs.org/)
 .cache
+.parcel-cache
 
 # Next.js build output
 .next
+out
 
 # Nuxt.js build / generate output
 .nuxt
 dist
+.output
 
 # Gatsby files
 .cache/
-# Comment in the public line in if your project uses Gatsby and *not* Next.js
+# Comment in the public line in if your project uses Gatsby and not Next.js
 # https://nextjs.org/blog/next-9-1#public-directory-support
 # public
 
 # vuepress build output
 .vuepress/dist
 
+# vuepress v2.x temp directory
+.temp
+
+# Sveltekit cache directory
+.svelte-kit/
+
+# vitepress build output
+**/.vitepress/dist
+
+# vitepress cache directory
+**/.vitepress/cache
+
+# Docusaurus cache and generated files
+.docusaurus
+
 # Serverless directories
 .serverless/
 
@@ -100,8 +116,41 @@ dist
 # DynamoDB Local files
 .dynamodb/
 
+# Firebase cache directory
+.firebase/
+
 # TernJS port file
 .tern-port
 
-# ignore all . folders but include . files
-.*/
+# Stores VSCode versions used for testing VSCode extensions
+.vscode-test
+
+# pnpm
+.pnpm-store
+
+# yarn v3
+.pnp.*
+.yarn/*
+!.yarn/patches
+!.yarn/plugins
+!.yarn/releases
+!.yarn/sdks
+!.yarn/versions
+
+# Vite files
+vite.config.js.timestamp-*
+vite.config.ts.timestamp-*
+.vite/
+
+# Good Old File Extensions
+*,v
+*.bak
+
+# VSCode
+.vscode/
+
+# Claude Code
+.claude/
+
+# Anything out of the sight of git
+.attic/

commonjs/combinatorics.js

@@ -1,6 +1,12 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.CartesianProduct = exports.PowerSet = exports.BaseN = exports.Combination = exports.Permutation = exports.randomInteger = exports.combinadic = exports.factoradic = exports.factorial = exports.combination = exports.permutation = exports.version = void 0;
+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;
 /**
  * combinatorics.js
  *
@@ -35,7 +41,6 @@ function permutation(n, k) {
         bp *= bn--;
     return bp;
 }
-exports.permutation = permutation;
 /**
  * calculates `C(n, k)`.
  *
@@ -50,7 +55,6 @@ function combination(n, k) {
         return 0n;
     return permutation(n, k) / permutation(k, k);
 }
-exports.combination = combination;
 /**
  * calculates `n!` === `P(n, n)`.
  *
@@ -59,7 +63,6 @@ exports.combination = combination;
 function factorial(n) {
     return permutation(n, n);
 }
-exports.factorial = factorial;
 /**
  * returns the factoradic representation of `n`, least significant order.
  *
@@ -86,7 +89,6 @@ function factoradic(n, l = 0) {
     }
     return digits;
 }
-exports.factoradic = factoradic;
 /**
  * `combinadic(n, k)` returns a function
  * that takes `m` as an argument and
@@ -114,7 +116,6 @@ function combinadic(n, k) {
         return digits;
     };
 }
-exports.combinadic = combinadic;
 /**
  *
  */
@@ -150,7 +151,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);
 }
-exports.randomInteger = randomInteger;
 ;
 /**
  * Base Class of `js-combinatorics`

umd/combinatorics.js

@@ -9,7 +9,13 @@
 })(function (require, exports) {
     "use strict";
     Object.defineProperty(exports, "__esModule", { value: true });
-    exports.CartesianProduct = exports.PowerSet = exports.BaseN = exports.Combination = exports.Permutation = exports.randomInteger = exports.combinadic = exports.factoradic = exports.factorial = exports.combination = exports.permutation = exports.version = void 0;
+    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;
     /**
      * combinatorics.js
      *
@@ -44,7 +50,6 @@
             bp *= bn--;
         return bp;
     }
-    exports.permutation = permutation;
     /**
      * calculates `C(n, k)`.
      *
@@ -59,7 +64,6 @@
             return 0n;
         return permutation(n, k) / permutation(k, k);
     }
-    exports.combination = combination;
     /**
      * calculates `n!` === `P(n, n)`.
      *
@@ -68,7 +72,6 @@
     function factorial(n) {
         return permutation(n, n);
     }
-    exports.factorial = factorial;
     /**
      * returns the factoradic representation of `n`, least significant order.
      *
@@ -95,7 +98,6 @@
         }
         return digits;
     }
-    exports.factoradic = factoradic;
     /**
      * `combinadic(n, k)` returns a function
      * that takes `m` as an argument and
@@ -123,7 +125,6 @@
             return digits;
         };
     }
-    exports.combinadic = combinadic;
     /**
      *
      */
@@ -159,7 +160,6 @@
         const rnd = u8s.reduce((a, v) => ((a << ctor(8)) + ctor(v)), ctor(0));
         return ((ctor(rnd) * mag) >> ctor(len * 8)) + ctor(min);
     }
-    exports.randomInteger = randomInteger;
     ;
     /**
      * Base Class of `js-combinatorics`