@gkucmierz/utils 1.6.0 → 1.7.0

package/package-lock.json

@@ -1,12 +1,12 @@
 {
   "name": "@gkucmierz/utils",
-  "version": "1.6.0",
+  "version": "1.7.0",
   "lockfileVersion": 2,
   "requires": true,
   "packages": {
     "": {
       "name": "@gkucmierz/utils",
-      "version": "1.6.0",
+      "version": "1.7.0",
       "license": "MIT",
       "devDependencies": {
         "husky": "^8.0.1",

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@gkucmierz/utils",
-  "version": "1.6.0",
+  "version": "1.7.0",
   "description": "Usefull functions for solving programming tasks",
   "main": "src/main.mjs",
   "scripts": {

package/spec/pow-mod.spec.mjs

@@ -0,0 +1,21 @@
+
+import {
+  powMod,
+  powModBI,
+} from '../src/pow-mod.mjs';
+
+describe('pow-mod', () => {
+  it('powMod', () => {
+    expect(powMod(2, 1)).toEqual(2);
+    expect(powMod(2, 1, 10)).toEqual(2);
+    expect(powMod(2, 1, 2)).toEqual(0);
+    expect(powMod(2, 0, 2)).toEqual(1);
+  });
+
+  it('powModBI', () => {
+    expect(powModBI(2n, 1n)).toEqual(2n);
+    expect(powModBI(2n, 1n, 10n)).toEqual(2n);
+    expect(powModBI(2n, 1n, 2n)).toEqual(0n);
+    expect(powModBI(2n, 0n, 2n)).toEqual(1n);
+  });
+});

package/src/pow-mod.mjs

@@ -1,30 +1,23 @@
 
 // implementation of power function with modulus like native python pow
 
-export const powMod = (base, exponent, modulus) => {
-  if (modulus === 1) return 0;
-  let result = 1;
-  base = base % modulus;
-  while (exponent > 0) {
-    if (exponent % 2 === 1) {
-      result = (result * base) % modulus;
+const getPowMod = (ZERO, ONE, TWO, floor) => {
+  return (base, exponent, modulus = null) => {
+    if (modulus === null) return base ** exponent;
+    if (modulus === ONE) return ZERO;
+    let result = ONE;
+    base = base % modulus;
+    while (exponent > ZERO) {
+      if (exponent % TWO === ONE) {
+        result = (result * base) % modulus;
+      }
+      exponent = floor(exponent / TWO);
+      base = (base * base) % modulus;
     }
-    exponent = exponent >> 1;
-    base = (base * base) % modulus;
-  }
-  return result;
+    return result;
+  };
 };
 
-export const powModBI = (base, exponent, modulus) => {
-  if (modulus === 1n) return 0n;
-  let result = 1n;
-  base = base % modulus;
-  while (exponent > 0n) {
-    if (exponent % 2n === 1n) {
-      result = (result * base) % modulus;
-    }
-    exponent = exponent / 2n;
-    base = (base * base) % modulus;
-  }
-  return result;
-};
+export const powMod = getPowMod(0, 1, 2, n => Math.floor(n));
+
+export const powModBI = getPowMod(0n, 1n, 2n, n => n);