synstate 3.3.0 → 4.0.0

package/src/core/utils/utils.mts

@@ -1,56 +0,0 @@
-import { Arr, asSafeInt, asUint32, SafeInt } from 'ts-data-forge';
-import type { NegativeInt32, Uint32 } from 'ts-type-forge';
-
-export const halfInt = (x: SafeInt): SafeInt =>
-  x % 2 === 0
-    ? SafeInt.div(x, 2)
-    : x > 0
-      ? SafeInt.div(SafeInt.sub(x, 1), 2) // (x-1) / 2. e.g. 3 -> 1, 5 -> 2
-      : SafeInt.div(SafeInt.add(x, 1), 2); // (x+1) / 2. e.g. -3 -> -1, -5 -> -2
-
-/** Returns the position where x should be inserted in a sorted array. */
-export const binarySearch = <N extends number>(
-  sortedArray: readonly N[],
-  x: N,
-): NegativeInt32 | Uint32 => {
-  const uint32Result = asUint32(0);
-
-  if (Arr.isEmpty(sortedArray)) {
-    return uint32Result;
-  }
-
-  const left0 = asSafeInt(0);
-
-  let mut_left: SafeInt = left0;
-
-  let mut_right: SafeInt = SafeInt.sub(Arr.length(sortedArray), 1);
-
-  let mut_mid: SafeInt = SafeInt.add(
-    mut_left,
-    halfInt(SafeInt.sub(mut_right, mut_left)),
-  );
-
-  // loop while x is in the range of [left, right)
-  while (mut_left <= mut_right) {
-    const curr = sortedArray[mut_mid];
-
-    if (x === curr) {
-      break;
-    }
-
-    if (curr === undefined) {
-      break;
-    }
-
-    if (curr > x) {
-      mut_right = SafeInt.sub(mut_mid, 1);
-    } else {
-      mut_left = SafeInt.add(mut_mid, 1);
-    }
-
-    mut_mid = SafeInt.add(mut_left, halfInt(SafeInt.sub(mut_right, mut_left)));
-  }
-
-  // @sumi-expect-error banned-syntax/no-unsafe-type-assertion
-  return mut_mid as NegativeInt32 | Uint32;
-};

package/src/core/utils/utils.test.mts

@@ -1,88 +0,0 @@
-import { asSafeInt } from 'ts-data-forge';
-import { binarySearch, halfInt } from './utils.mjs';
-
-describe(halfInt, () => {
-  test('case: even number', () => {
-    expect(halfInt(asSafeInt(2))).toBe(1);
-  });
-
-  test('case: odd positive number', () => {
-    expect(halfInt(asSafeInt(3))).toBe(1);
-  });
-
-  test('case: odd negative number', () => {
-    expect(halfInt(asSafeInt(-3))).toBe(-1);
-  });
-});
-
-describe(binarySearch, () => {
-  test('empty array', () => {
-    expect(binarySearch([], 0)).toBe(0);
-  });
-
-  test('1 element array (1)', () => {
-    expect(binarySearch([1], 0)).toBe(0);
-  });
-
-  test('1 element array (2)', () => {
-    expect(binarySearch([-1], 0)).toBe(1);
-  });
-
-  test('2 element array (1)', () => {
-    expect(binarySearch([-1, 1], 0)).toBe(1);
-  });
-
-  test('2 element array (2)', () => {
-    expect(binarySearch([1, 2], 0)).toBe(0);
-  });
-
-  test('2 element array (3)', () => {
-    expect(binarySearch([-2, -1], 0)).toBe(2);
-  });
-
-  test('array with same value (1)', () => {
-    expect([0, 1]).toContain(binarySearch([0], 0));
-  });
-
-  test('array with same value (2)', () => {
-    expect([0, 1, 2]).toContain(binarySearch([0, 0], 0));
-  });
-
-  test('array with same value (3)', () => {
-    expect([0, 1, 2, 3]).toContain(binarySearch([0, 0, 0], 0));
-  });
-
-  test('complicated example 1', () => {
-    expect([2, 3]).toContain(binarySearch([1, 3, 4, 6, 7, 8], 4));
-  });
-
-  test('complicated example 2', () => {
-    expect([2, 3, 4]).toContain(binarySearch([1, 3, 4, 4, 6, 7, 8], 4));
-  });
-
-  test('complicated example 3', () => {
-    expect(binarySearch([1, 3, 4, 4, 6, 7, 8], 0)).toBe(0);
-  });
-
-  test('complicated example 4', () => {
-    expect([0, 1]).toContain(binarySearch([1, 3, 4, 4, 6, 7, 8], 1));
-  });
-
-  test('complicated example 5', () => {
-    expect([0, 1, 2, 3]).toContain(
-      binarySearch([1, 1, 1, 3, 4, 4, 6, 7, 8], 1),
-    );
-  });
-
-  test('complicated example 6', () => {
-    expect([5, 6]).toContain(binarySearch([1, 3, 4, 4, 6, 7, 8], 7));
-  });
-
-  test('complicated example 7', () => {
-    expect([6, 7]).toContain(binarySearch([1, 3, 4, 4, 6, 7, 8], 8));
-  });
-
-  test('complicated example 8', () => {
-    expect(binarySearch([1, 3, 4, 4, 6, 7, 8], 9)).toBe(7);
-  });
-});