@gkucmierz/utils 1.9.0 → 1.10.0

package/package-lock.json

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

package/package.json

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

package/spec/factors.spec.mjs

@@ -0,0 +1,35 @@
+
+import {
+  factors,
+  factorsBI,
+} from '../src/factors.mjs';
+
+describe('factors', () => {
+  it('Number', () => {
+    expect(factors(0)).toEqual([]);
+    expect(factors(1)).toEqual([]);
+    expect(factors(2)).toEqual([2]);
+    expect(factors(3)).toEqual([3]);
+    expect(factors(4)).toEqual([2, 2]);
+    expect(factors(5)).toEqual([5]);
+    expect(factors(6)).toEqual([2, 3]);
+    expect(factors(7)).toEqual([7]);
+    expect(factors(8)).toEqual([2, 2, 2]);
+    expect(factors(9)).toEqual([3, 3]);
+    expect(factors(10)).toEqual([2, 5]);
+  });
+
+  it('BigInt', () => {
+    expect(factorsBI(0n)).toEqual([]);
+    expect(factorsBI(1n)).toEqual([]);
+    expect(factorsBI(2n)).toEqual([2n]);
+    expect(factorsBI(3n)).toEqual([3n]);
+    expect(factorsBI(4n)).toEqual([2n, 2n]);
+    expect(factorsBI(5n)).toEqual([5n]);
+    expect(factorsBI(6n)).toEqual([2n, 3n]);
+    expect(factorsBI(7n)).toEqual([7n]);
+    expect(factorsBI(8n)).toEqual([2n, 2n, 2n]);
+    expect(factorsBI(9n)).toEqual([3n, 3n]);
+    expect(factorsBI(10n)).toEqual([2n, 5n]);
+  });
+});

package/src/factors.mjs

@@ -0,0 +1,31 @@
+
+
+export const factors = n => {
+  if (n < 2) return [];
+  const res = [];
+  let max = Math.floor(Math.sqrt(n));
+  for (let i = 2; i <= max; ++i) {
+    if (n % i === 0) {
+      res.push(i);
+      n /= i;
+      max = Math.floor(Math.sqrt(n));
+      i = (Math.min(...res) || 2) - 1;
+    }
+  }
+  res.push(n);
+  return res;
+};
+
+export const factorsBI = n => {
+  if (n < 2n) return [];
+  const res = [];
+  for (let i = 2n; i * i <= n; ++i) {
+    if (n % i === 0n) {
+      res.push(i);
+      n /= i;
+      i = 1n;
+    }
+  }
+  res.push(n);
+  return res;
+};