@tim-code/my-util 0.5.6 → 0.5.7

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@tim-code/my-util",
-  "version": "0.5.6",
+  "version": "0.5.7",
   "description": "",
   "type": "module",
   "author": "Tim Sprowl",

package/src/array.js

@@ -185,3 +185,65 @@ export function multilevel(...comparators) {
     return 0
   }
 }
+
+function siftDown(heap, i, compare) {
+  const n = heap.length
+  // eslint-disable-next-line no-constant-condition
+  while (true) {
+    const left = 2 * i + 1
+    const right = left + 1
+    let largest = i
+    if (left < n && compare(heap[left], heap[largest]) > 0) {
+      largest = left
+    }
+    if (right < n && compare(heap[right], heap[largest]) > 0) {
+      largest = right
+    }
+    if (largest === i) {
+      break
+    }
+    const swap = heap[largest]
+    heap[largest] = heap[i]
+    heap[i] = swap
+    i = largest
+  }
+}
+
+function maxHeapify(heap, compare) {
+  // (heap.length >>> 1) is equivalent to Math.floor(heap.length / 2)
+  // eslint-disable-next-line no-bitwise
+  for (let i = (heap.length >>> 1) - 1; i >= 0; i--) {
+    siftDown(heap, i, compare)
+  }
+}
+
+/**
+ * Get the first N elements of the sorted array efficiently.
+ * @template T
+ * @param {Array<T>} array
+ * @param {number} N
+ * @param {Function} compare
+ * @returns {Array<T>}
+ */
+export function sortN(array, N, compare = ascending()) {
+  if (N <= 0) {
+    return []
+  }
+  if (N >= array.length) {
+    return [...array].sort(compare)
+  }
+  if (array.length <= 100 && N / array.length >= 0.1) {
+    // seems to be faster to do it the "normal" way in this case
+    return [...array].sort(compare).slice(0, N)
+  }
+  const heap = array.slice(0, N)
+  maxHeapify(heap, compare)
+  for (let i = N; i < array.length; i++) {
+    const element = array[i]
+    if (compare(element, heap[0]) < 0) {
+      heap[0] = element
+      siftDown(heap, 0, compare)
+    }
+  }
+  return heap.sort(compare)
+}

package/src/array.test.js

@@ -1,7 +1,7 @@
 /* eslint-disable no-restricted-syntax */
 import { describe, expect, it, jest } from "@jest/globals"
 
-const { chunk, unique, duplicates, ascending, descending, multilevel } = await import(
+const { chunk, unique, duplicates, ascending, descending, multilevel, sortN } = await import(
   "./array.js"
 )
 
@@ -511,3 +511,41 @@ describe("multilevel", () => {
     expect(cmp("a", "b")).toBe(0)
   })
 })
+
+describe("sortN", () => {
+  it("returns empty array when N <= 0", () => {
+    expect(sortN([1, 2, 3], 0)).toEqual([])
+    expect(sortN([1, 2, 3], -5)).toEqual([])
+  })
+
+  it("returns the entire array sorted when N >= array.length and does not mutate original", () => {
+    const arr = [3, 1, 2]
+    const result = sortN(arr, 10)
+    expect(result).toEqual([1, 2, 3])
+    expect(arr).toEqual([3, 1, 2])
+    expect(result).not.toBe(arr)
+  })
+
+  it("returns the first N smallest elements (default ascending comparator)", () => {
+    expect(sortN([5, 1, 3, 2, 4], 3)).toEqual([1, 2, 3])
+    expect(sortN([3, 1, 3, 2, 2], 4)).toEqual([1, 2, 2, 3])
+  })
+
+  it("respects a descending comparator (returns top N largest)", () => {
+    const arr = [5, 1, 3, 2, 4]
+    expect(sortN(arr, 2, descending())).toEqual([5, 4])
+  })
+
+  it("works with key-based comparator and defers undefined/null values to the end", () => {
+    const arr = [{ v: 3 }, {}, { v: 1 }, { v: null }, { v: 2 }, { v: undefined }]
+    const out = sortN(arr, 3, ascending("v"))
+    expect(out.map((o) => o.v)).toEqual([1, 2, 3])
+  })
+
+  it("does not mutate the original array when N < array.length", () => {
+    const arr = [5, 1, 3, 2, 4]
+    const out = sortN(arr, 3)
+    expect(out).toEqual([1, 2, 3])
+    expect(arr).toEqual([5, 1, 3, 2, 4])
+  })
+})