@gkucmierz/utils 1.10.0 → 1.11.0

package/package-lock.json

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

package/package.json

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

package/spec/mod.spec.mjs

@@ -9,6 +9,8 @@ describe('mod', () => {
     expect(mod(4, 100)).toEqual(4);
     expect(mod(104, 100)).toEqual(4);
     expect(mod(4 - 100, 100)).toEqual(4);
+    expect(mod(4 + 96, 100)).toEqual(0);
+    expect(mod(-4 - 96, 100)).toEqual(0);
   });
 
   it('mod sign', () => {
@@ -24,6 +26,8 @@ describe('mod BI', () => {
     expect(modBI(4n, 100n)).toEqual(4n);
     expect(modBI(104n, 100n)).toEqual(4n);
     expect(modBI(4n - 100n, 100n)).toEqual(4n);
+    expect(modBI(4n + 96n, 100n)).toEqual(0n);
+    expect(modBI(-4n - 96n, 100n)).toEqual(0n);
   });
 
   it('mod sign', () => {

package/spec/phi.spec.mjs

@@ -0,0 +1,60 @@
+
+import {
+  phi,
+  phiBI,
+} from '../src/phi.mjs';
+
+describe('phi', () => {
+  it('Number x1', () => {
+    expect(phi(1)).toBe(1);
+    expect(phi(11)).toBe(10);
+    expect(phi(21)).toBe(12);
+    expect(phi(31)).toBe(30);
+    expect(phi(41)).toBe(40);
+    expect(phi(51)).toBe(32);
+    expect(phi(61)).toBe(60);
+    expect(phi(71)).toBe(70);
+    expect(phi(81)).toBe(54);
+    expect(phi(91)).toBe(72);
+  });
+
+  it('Number x5', () => {
+    expect(phi(5)).toBe(4);
+    expect(phi(15)).toBe(8);
+    expect(phi(25)).toBe(20);
+    expect(phi(35)).toBe(24);
+    expect(phi(45)).toBe(24);
+    expect(phi(55)).toBe(40);
+    expect(phi(65)).toBe(48);
+    expect(phi(75)).toBe(40);
+    expect(phi(85)).toBe(64);
+    expect(phi(95)).toBe(72);
+  });
+
+  it('BigInt x1', () => {
+    expect(phiBI(1n)).toBe(1n);
+    expect(phiBI(11n)).toBe(10n);
+    expect(phiBI(21n)).toBe(12n);
+    expect(phiBI(31n)).toBe(30n);
+    expect(phiBI(41n)).toBe(40n);
+    expect(phiBI(51n)).toBe(32n);
+    expect(phiBI(61n)).toBe(60n);
+    expect(phiBI(71n)).toBe(70n);
+    expect(phiBI(81n)).toBe(54n);
+    expect(phiBI(91n)).toBe(72n);
+  });
+
+  it('BigInt x5', () => {
+    expect(phiBI(5n)).toBe(4n);
+    expect(phiBI(15n)).toBe(8n);
+    expect(phiBI(25n)).toBe(20n);
+    expect(phiBI(35n)).toBe(24n);
+    expect(phiBI(45n)).toBe(24n);
+    expect(phiBI(55n)).toBe(40n);
+    expect(phiBI(65n)).toBe(48n);
+    expect(phiBI(75n)).toBe(40n);
+    expect(phiBI(85n)).toBe(64n);
+    expect(phiBI(95n)).toBe(72n);
+  });
+});
+

package/src/mod.mjs

@@ -4,7 +4,8 @@
 const getMod = ZERO => {
   return (dividend, divisor) => {
     if ((dividend < ZERO) ^ (divisor < ZERO)) {
-      return divisor - (-dividend % divisor);
+      const res = -dividend % divisor;
+      return res === ZERO ? ZERO : divisor - res;
     }
     return dividend % divisor;
   };

package/src/phi.mjs

@@ -0,0 +1,22 @@
+
+import {
+  gcd,
+  gcdBI,
+} from './gcd.mjs';
+
+// Euler's Totient Function
+
+const getPhi = (ONE, TWO, gcd) => {
+  return n => {
+    let result = ONE;
+    for (let i = TWO; i < n; ++i) {
+      if (gcd(i, n) === ONE) {
+        result++;
+      }
+    }
+    return result;
+  };
+}
+
+export const phi = getPhi(1, 2, gcd);
+export const phiBI = getPhi(1n, 2n, gcdBI);