@inglorious/utils 3.7.0 → 3.7.2

package/src/data-structures/array.test.js

@@ -1,206 +0,0 @@
-import { expect, test } from "vitest"
-
-import {
-  contains,
-  ensureArray,
-  isArray,
-  max,
-  min,
-  pop,
-  push,
-  remove,
-} from "./array.js"
-
-test("it should check if an array contains a value", () => {
-  const arr = [3, 2, 6, 1, 7, 4, 5]
-  const item = 1
-  const expectedResult = true
-
-  expect(contains(arr, item)).toBe(expectedResult)
-})
-
-test("it should check if an array contains an object", () => {
-  const arr = [
-    { value: 3 },
-    { value: 2 },
-    { value: 6 },
-    { value: 1 },
-    { value: 7 },
-    { value: 4 },
-    { value: 5 },
-  ]
-  const item = arr[3]
-  const expectedResult = true
-
-  expect(contains(arr, item)).toBe(expectedResult)
-})
-
-test("it should return the same array if the value is already an array", () => {
-  const arr = [1, "two", { three: 3 }]
-
-  expect(ensureArray(arr)).toBe(arr)
-})
-
-test("it should wrap the value in an array if it is not an array", () => {
-  const str = "hello"
-
-  expect(ensureArray(str)).toStrictEqual([str])
-})
-
-test("it should correctly identify an array", () => {
-  const arr = [1, "two", { three: 3 }]
-
-  expect(isArray(arr)).toBe(true)
-})
-
-test("it should correctly identify a non-array", () => {
-  const str = "hello"
-
-  expect(isArray(str)).toBe(false)
-})
-
-test("it should find the maximum value of an array", () => {
-  const arr = [3, 2, 6, 1, 7, 4, 5]
-  const expectedResult = 7
-
-  expect(max(arr)).toBe(expectedResult)
-})
-
-test("it should find the maximum value in an array of objects", () => {
-  const arr = [
-    { value: 3 },
-    { value: 2 },
-    { value: 6 },
-    { value: 1 },
-    { value: 7 },
-    { value: 4 },
-    { value: 5 },
-  ]
-  const comparator = (a, b) => b.value - a.value
-  const expectedResult = { value: 7 }
-
-  expect(max(arr, comparator)).toStrictEqual(expectedResult)
-})
-
-test("it should find the minimum value of an array", () => {
-  const arr = [3, 2, 6, 1, 7, 4, 5]
-  const expectedResult = 1
-
-  expect(min(arr)).toBe(expectedResult)
-})
-
-test("it should find the minimum value in an array of objects", () => {
-  const arr = [
-    { value: 3 },
-    { value: 2 },
-    { value: 6 },
-    { value: 1 },
-    { value: 7 },
-    { value: 4 },
-    { value: 5 },
-  ]
-  const comparator = (a, b) => b.value - a.value
-  const expectedResult = { value: 1 }
-
-  expect(min(arr, comparator)).toStrictEqual(expectedResult)
-})
-
-test("it should remove the minimum value from an array", () => {
-  const arr = [3, 2, 6, 1, 7, 4, 5]
-  const expectedResult = [3, 2, 6, 7, 4, 5]
-
-  expect(pop(arr)).toStrictEqual(expectedResult)
-})
-
-test("it should remove the minimum object from an array", () => {
-  const arr = [
-    { value: 3 },
-    { value: 2 },
-    { value: 6 },
-    { value: 1 },
-    { value: 7 },
-    { value: 4 },
-    { value: 5 },
-  ]
-  const comparator = (a, b) => b.value - a.value
-  const expectedResult = [
-    { value: 3 },
-    { value: 2 },
-    { value: 6 },
-    { value: 7 },
-    { value: 4 },
-    { value: 5 },
-  ]
-
-  expect(pop(arr, comparator)).toStrictEqual(expectedResult)
-})
-
-test("it should remove the maximum value from an array", () => {
-  const arr = [3, 2, 6, 1, 7, 4, 5]
-  const comparator = (a, b) => a - b
-  const expectedResult = [3, 2, 6, 1, 4, 5]
-
-  expect(pop(arr, comparator)).toStrictEqual(expectedResult)
-})
-
-test("it should remove the maximum object from an array", () => {
-  const arr = [
-    { value: 3 },
-    { value: 2 },
-    { value: 6 },
-    { value: 1 },
-    { value: 7 },
-    { value: 4 },
-    { value: 5 },
-  ]
-  const comparator = (a, b) => a.value - b.value
-  const expectedResult = [
-    { value: 3 },
-    { value: 2 },
-    { value: 6 },
-    { value: 1 },
-    { value: 4 },
-    { value: 5 },
-  ]
-
-  expect(pop(arr, comparator)).toStrictEqual(expectedResult)
-})
-
-test("it should add a value at the end of the array", () => {
-  const arr = [3, 2, 6, 1, 7, 4]
-  const item = 5
-  const expectedResult = [3, 2, 6, 1, 7, 4, 5]
-
-  expect(push(arr, item)).toStrictEqual(expectedResult)
-})
-
-test("it should remove a primitive value from an array", () => {
-  const arr = [3, 2, 6, 1, 7, 4, 5]
-  const item = 1
-  const expectedResult = [3, 2, 6, 7, 4, 5]
-
-  expect(remove(arr, item)).toStrictEqual(expectedResult)
-})
-
-test("it should remove an object from an array", () => {
-  const arr = [
-    { value: 3 },
-    { value: 2 },
-    { value: 6 },
-    { value: 1 },
-    { value: 7 },
-    { value: 4 },
-    { value: 5 },
-  ]
-  const item = arr[3]
-  const expectedResult = [
-    { value: 3 },
-    { value: 2 },
-    { value: 6 },
-    { value: 7 },
-    { value: 4 },
-    { value: 5 },
-  ]
-
-  expect(remove(arr, item)).toStrictEqual(expectedResult)
-})

package/src/data-structures/board.test.js

@@ -1,242 +0,0 @@
-import { expect, test } from "vitest"
-
-import { mod } from "../math/numbers.js"
-import {
-  createBoard,
-  down,
-  downLeft,
-  downRight,
-  left,
-  right,
-  toString,
-  up,
-  upLeft,
-  upRight,
-} from "./board.js"
-
-test("it should create an empty board", () => {
-  const size = [4, 4]
-  const expectedResult = [
-    null,
-    null,
-    null,
-    null,
-    null,
-    null,
-    null,
-    null,
-    null,
-    null,
-    null,
-    null,
-    null,
-    null,
-    null,
-    null,
-  ]
-
-  expect(createBoard(size)).toStrictEqual(expectedResult)
-})
-
-test("it should create a checkerboard", () => {
-  const size = [4, 4]
-  const filler = (i, j) => (!mod(i + j, 2) ? 1 : 0)
-  const expectedResult = [1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1]
-
-  expect(createBoard(size, filler)).toStrictEqual(expectedResult)
-})
-
-test("it should return the coordinates of the cell downward", () => {
-  const size = [8, 8]
-  const coordinates = [3, 4]
-  const expectedResult = [4, 4]
-
-  expect(down(coordinates, size)).toStrictEqual(expectedResult)
-})
-
-test("it should throw going down if cell is downmost", () => {
-  const size = [8, 8]
-  const coordinates = [7, 4]
-
-  expect(() => down(coordinates, size)).toThrow()
-})
-
-test("it should return the coordinates of the cell down left", () => {
-  const size = [8, 8]
-  const coordinates = [3, 4]
-  const expectedResult = [4, 3]
-
-  expect(downLeft(coordinates, size)).toStrictEqual(expectedResult)
-})
-
-test("it should throw going down left if cell is downmost", () => {
-  const size = [8, 8]
-  const coordinates = [7, 4]
-
-  expect(() => downLeft(coordinates, size)).toThrow()
-})
-
-test("it should throw going down left if cell is downmost", () => {
-  const size = [8, 8]
-  const coordinates = [3, 0]
-
-  expect(() => downLeft(coordinates, size)).toThrow()
-})
-
-test("it should throw going down left if cell is on the angle", () => {
-  const size = [8, 8]
-  const coordinates = [7, 0]
-
-  expect(() => downLeft(coordinates, size)).toThrow()
-})
-
-test("it should return the coordinates of the cell down right", () => {
-  const size = [8, 8]
-  const coordinates = [3, 4]
-  const expectedResult = [4, 5]
-
-  expect(downRight(coordinates, size)).toStrictEqual(expectedResult)
-})
-
-test("it should throw going down right if cell is downmost", () => {
-  const size = [8, 8]
-  const coordinates = [7, 4]
-
-  expect(() => downRight(coordinates, size)).toThrow()
-})
-
-test("it should throw going down right if cell is downmost", () => {
-  const size = [8, 8]
-  const coordinates = [3, 7]
-
-  expect(() => downRight(coordinates, size)).toThrow()
-})
-
-test("it should throw going down right if cell is on the angle", () => {
-  const size = [8, 8]
-  const coordinates = [7, 7]
-
-  expect(() => downRight(coordinates, size)).toThrow()
-})
-
-test("it should return the coordinates of the cell to the left", () => {
-  const size = [8, 8]
-  const coordinates = [3, 4]
-  const expectedResult = [3, 3]
-
-  expect(left(coordinates, size)).toStrictEqual(expectedResult)
-})
-
-test("it should not return coordinates to the left if cell is leftmost", () => {
-  const size = [8, 8]
-  const coordinates = [3, 0]
-
-  expect(() => left(coordinates, size)).toThrow()
-})
-
-test("it should return the coordinates of the cell to the right", () => {
-  const size = [8, 8]
-  const coordinates = [3, 4]
-  const expectedResult = [3, 5]
-
-  expect(right(coordinates, size)).toStrictEqual(expectedResult)
-})
-
-test("it should not return coordinates to the right if cell is rightmost", () => {
-  const size = [8, 8]
-  const coordinates = [3, 7]
-
-  expect(() => right(coordinates, size)).toThrow()
-})
-
-test("it should return a string representation of the given board", () => {
-  const board = [1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1]
-
-  expect(toString(board, [4, 4])).toBe(`1 0 1 0
-0 1 0 1
-1 0 1 0
-0 1 0 1`)
-})
-
-test("it should return a custom string representation of the given board", () => {
-  const board = [1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1]
-  const cellToString = (cell) => cell.toFixed(1)
-
-  expect(toString(board, [4, 4], cellToString)).toBe(`1.0 0.0 1.0 0.0
-0.0 1.0 0.0 1.0
-1.0 0.0 1.0 0.0
-0.0 1.0 0.0 1.0`)
-})
-
-test("it should return the coordinates of the cell upward", () => {
-  const size = [8, 8]
-  const coordinates = [3, 4]
-  const expectedResult = [2, 4]
-
-  expect(up(coordinates, size)).toStrictEqual(expectedResult)
-})
-
-test("it should throw going upward if cell is topmost", () => {
-  const size = [8, 8]
-  const coordinates = [0, 4]
-
-  expect(() => up(coordinates, size)).toThrow()
-})
-
-test("it should return the coordinates of the cell up left", () => {
-  const size = [8, 8]
-  const coordinates = [3, 4]
-  const expectedResult = [2, 3]
-
-  expect(upLeft(coordinates, size)).toStrictEqual(expectedResult)
-})
-
-test("it should throw going up left if cell is upmost", () => {
-  const size = [8, 8]
-  const coordinates = [0, 4]
-
-  expect(() => upLeft(coordinates, size)).toThrow()
-})
-
-test("it should throw going up left if cell is leftmost", () => {
-  const size = [8, 8]
-  const coordinates = [3, 0]
-
-  expect(() => upLeft(coordinates, size)).toThrow()
-})
-
-test("it should throw going up left if cell is on the angle", () => {
-  const size = [8, 8]
-  const coordinates = [0, 0]
-
-  expect(() => upLeft(coordinates, size)).toThrow()
-})
-
-test("it should return the coordinates of the cell up right", () => {
-  const size = [8, 8]
-  const coordinates = [3, 4]
-  const expectedResult = [2, 5]
-
-  expect(upRight(coordinates, size)).toStrictEqual(expectedResult)
-})
-
-test("it should throw going up right if cell is upmost", () => {
-  const size = [8, 8]
-  const coordinates = [0, 4]
-
-  expect(() => upRight(coordinates, size)).toThrow()
-})
-
-test("it should throw going down right if cell is rightmost", () => {
-  const size = [8, 8]
-  const coordinates = [3, 7]
-
-  expect(() => upRight(coordinates, size)).toThrow()
-})
-
-test("it should throw going down right if cell is on the angle", () => {
-  const size = [8, 8]
-  const coordinates = [0, 7]
-
-  expect(() => upRight(coordinates, size)).toThrow()
-})

package/src/data-structures/heap.test.js

@@ -1,103 +0,0 @@
-import { expect, test } from "vitest"
-
-import { contains, heapify, pop, push, remove, root } from "./heap.js"
-
-test("it should check if a heap contains a value", () => {
-  const heap = [3, 2, 6, 1, 7, 4, 5]
-  const item = 1
-  const expectedResult = true
-
-  expect(contains(heap, item)).toBe(expectedResult)
-})
-
-test("it should check if a heap contains an object", () => {
-  const heap = [
-    { value: 3 },
-    { value: 2 },
-    { value: 6 },
-    { value: 1 },
-    { value: 7 },
-    { value: 4 },
-    { value: 5 },
-  ]
-  const item = heap[3]
-  const expectedResult = true
-
-  expect(contains(heap, item)).toBe(expectedResult)
-})
-
-test("it should not convert an array in existing heap form into a heap", () => {
-  const arr = [1, 2, 3, 4, 5, 6, 7]
-  const expectedResult = [1, 2, 3, 4, 5, 6, 7]
-
-  expect(heapify(arr)).toStrictEqual(expectedResult)
-})
-
-test("it should convert an array into a heap", () => {
-  const arr = [7, 6, 5, 4, 3, 2, 1]
-  const expectedResult = [1, 4, 2, 7, 5, 6, 3]
-
-  expect(heapify(arr)).toStrictEqual(expectedResult)
-})
-
-test("it should convert an array into a maxheap", () => {
-  const arr = [1, 2, 3, 4, 5, 6, 7]
-  const comparator = (a, b) => a - b
-  const expectedResult = [7, 4, 6, 1, 3, 2, 5]
-
-  expect(heapify(arr, comparator)).toStrictEqual(expectedResult)
-})
-
-test("it should find the minimum value in a min heap", () => {
-  const heap = [1, 4, 2, 7, 5, 6, 3]
-  const expectedResult = 1
-
-  expect(root(heap)).toBe(expectedResult)
-})
-
-test("it should push the first element of the heap", () => {
-  const heap = []
-  const value = 7
-  const expectedResult = [7]
-
-  expect(push(heap, value)).toStrictEqual(expectedResult)
-})
-
-test("it should push the biggest value at the end of the heap", () => {
-  const heap = [3, 13, 19, 33, 42, 23, 21]
-  const value = 50
-  const expectedResult = [3, 13, 19, 33, 42, 23, 21, 50]
-
-  expect(push(heap, value)).toStrictEqual(expectedResult)
-})
-
-test("it should push a value in the right spot of a heap", () => {
-  const heap = [3, 13, 19, 33, 42, 23, 21]
-  const value = 7
-  const expectedResult = [3, 7, 19, 13, 42, 23, 21, 33]
-
-  expect(push(heap, value)).toStrictEqual(expectedResult)
-})
-
-test("it should pop the lowest value from the end of the heap", () => {
-  const heap = [3, 13, 19, 33, 42, 23, 21]
-  const expectedResult = [13, 21, 19, 33, 42, 23]
-
-  expect(pop(heap)).toStrictEqual(expectedResult)
-})
-
-test("it should push the biggest value at the beginning of a maxheap", () => {
-  const heap = [3, 13, 19, 33, 42, 23, 21]
-  const comparator = (a, b) => a - b
-  const value = 50
-  const expectedResult = [50, 3, 19, 13, 42, 23, 21, 33]
-
-  expect(push(heap, value, comparator)).toStrictEqual(expectedResult)
-})
-
-test("it should remove the heap's root element", () => {
-  const heap = [3, 13, 19, 33, 42, 23, 21]
-  const expectedResult = [13, 21, 19, 33, 42, 23]
-
-  expect(remove(heap)).toStrictEqual(expectedResult)
-})