@gkucmierz/utils 1.19.0 → 1.21.0

package/main.mjs

@@ -23,12 +23,18 @@ import {
 import {
   gpn, gpnBI
 } from './src/gpn.mjs'
+import {
+  Heap
+} from './src/heap.mjs'
 import {
   heronsFormula, heronsFormulaBI
 } from './src/herons-formula.mjs'
 import {
   lcm, lcmBI
 } from './src/lcm.mjs'
+import {
+  ListNode
+} from './src/list-node.mjs'
 import {
   memoize
 } from './src/memoize.mjs'
@@ -59,8 +65,10 @@ export * from './src/factors.mjs';
 export * from './src/gcd.mjs';
 export * from './src/get-type.mjs';
 export * from './src/gpn.mjs';
+export * from './src/heap.mjs';
 export * from './src/herons-formula.mjs';
 export * from './src/lcm.mjs';
+export * from './src/list-node.mjs';
 export * from './src/memoize.mjs';
 export * from './src/mod.mjs';
 export * from './src/phi.mjs';
@@ -70,5 +78,5 @@ export * from './src/square-root.mjs';
 export * from './src/tonelli-shanks.mjs';
 
 export default [
-  SetCnt, fromBase64, fromBase64Url, toBase64, toBase64Url, bijective2num, bijective2numBI, num2bijective, num2bijectiveBI, egcd, factors, factorsBI, gcd, gcdBI, getType, gpn, gpnBI, heronsFormula, heronsFormulaBI, lcm, lcmBI, memoize, mod, modBI, phi, phiBI, powMod, powModBI, array2range, range2array, squareRoot, squareRootBI, tonelliShanksBI
+  SetCnt, fromBase64, fromBase64Url, toBase64, toBase64Url, bijective2num, bijective2numBI, num2bijective, num2bijectiveBI, egcd, factors, factorsBI, gcd, gcdBI, getType, gpn, gpnBI, Heap, heronsFormula, heronsFormulaBI, lcm, lcmBI, ListNode, memoize, mod, modBI, phi, phiBI, powMod, powModBI, array2range, range2array, squareRoot, squareRootBI, tonelliShanksBI
 ];

package/package-lock.json

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

package/package.json

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

package/spec/heap.spec.mjs

@@ -0,0 +1,32 @@
+
+import { Heap } from '../src/heap.mjs';
+
+describe('Heap', () => {
+  it('size', () => {
+    const heap = Heap();
+    expect(heap.size()).toBe(0);
+    heap.add(1);
+    expect(heap.size()).toBe(1);
+    heap.add(1);
+    heap.add(1);
+    expect(heap.size()).toBe(3);
+  });
+
+  it('take', () => {
+    const heap = Heap();
+    heap.add(2);
+    heap.add(1);
+    heap.add(3);
+    expect(heap.take()).toBe(1);
+    expect(heap.take()).toBe(2);
+    expect(heap.take()).toBe(3);
+  });
+
+  it('valFn', () => {
+    const heap = Heap(obj => obj.value);
+    heap.add({ value: 42, other: 'second' });
+    heap.add({ value: 23, other: 'first' });
+    expect(heap.take().other).toBe('first');
+    expect(heap.take().other).toBe('second');
+  });
+});

package/spec/list-node.spec.mjs

@@ -0,0 +1,27 @@
+
+import { ListNode } from '../src/list-node.mjs';
+
+describe('ListNode', () => {
+  it('constructor', () => {
+    expect(new ListNode().val).toEqual(0);
+    expect(new ListNode().next).toEqual(null);
+    expect(new ListNode(123).val).toEqual(123);
+    expect(new ListNode(123).next).toEqual(null);
+    expect(new ListNode(123, 'next').next).toEqual('next');
+  });
+
+  it('toArr', () => {
+    expect(new ListNode().toArr()).toEqual([0]);
+    expect(new ListNode(123).toArr()).toEqual([123]);
+    expect(new ListNode(1, new ListNode(2)).toArr()).toEqual([1, 2]);
+  });
+
+  it('fromArr', () => {
+    expect(ListNode.fromArr([1, 2])).toEqual(new ListNode(1, new ListNode(2)));
+  });
+
+  it('both', () => {
+    const arr = [1, 2, 3, 4, 5];
+    expect(ListNode.fromArr(arr).toArr()).toEqual(arr);
+  });
+});

package/src/heap.mjs

@@ -0,0 +1,46 @@
+
+export const Heap = (valFn = n => n) => {
+  const arr = [-1];
+
+  const up = idx => {
+    while (idx > 1) {
+      const ni = idx / 2 | 0;
+      if (valFn(arr[idx]) < valFn(arr[ni])) {
+        [arr[idx], arr[ni]] = [arr[ni], arr[idx]];
+      }
+      idx = ni;
+    }
+    return idx;
+  };
+  
+  return {
+    add: el => up(arr.push(el) - 1),
+    take: () => {
+      const len = arr.length;
+      if (len <= 1) return [][0];
+      let idx = 1;
+      const res = arr[idx];
+      while (idx < len) {
+        const ia = idx * 2;
+        const ib = idx * 2 + 1;
+        if (ia >= len) break;
+        if (ib >= len || valFn(arr[ia]) < valFn(arr[ib])) {
+          arr[idx] = arr[ia];
+          idx = ia;
+        } else {
+          arr[idx] = arr[ib];
+          idx = ib;
+        }
+      }
+      if (idx === arr.length - 1) {
+        arr.pop();
+      } else {
+        arr[idx] = arr.pop();
+        up(idx);
+      }
+      return res;
+    },
+    size: () => arr.length - 1,
+    data: () => arr.slice(1),
+  };
+};

package/src/list-node.mjs

@@ -0,0 +1,28 @@
+
+
+export class ListNode {
+  constructor(val = 0, next = null) {
+    this.val = val;
+    this.next = next;
+  }
+  
+  toArr() {
+    const ret = [];
+    let node = this;
+    while (node) {
+      ret.push(node.val);
+      node = node.next;
+    }
+    return ret;
+  }
+  
+  static fromArr(iter) {
+    const head = new ListNode;
+    let node = head;
+    for (let val of iter) {
+      node.next = new ListNode(val);
+      node = node.next;
+    }
+    return head.next;
+  }
+};