@sparted/shared-library 1.9.5 → 1.9.6

package/src/linked-list/__tests__/while-linked-list.test.ts

@@ -1,58 +0,0 @@
-import { whileLinkedList } from '../while-linked-list';
-
-describe('whileLinkedList', () => {
-  it('should return every ids while the predicate is true', () => {
-    const list = {
-      headId: '3',
-      items: {
-        3: {
-          id: '3',
-          nextId: '2',
-        },
-        1: {
-          id: '1',
-          nextId: null,
-        },
-        2: {
-          id: '2',
-          nextId: '1',
-        },
-      },
-    };
-
-    const ids = whileLinkedList(
-      (item) => item.id !== '1',
-      list,
-    );
-
-    expect(ids).toStrictEqual(['3', '2']);
-  });
-
-  it('should return every ids while the predicate is true with a start id', () => {
-    const list = {
-      headId: '3',
-      items: {
-        3: {
-          id: '3',
-          nextId: '2',
-        },
-        1: {
-          id: '1',
-          nextId: null,
-        },
-        2: {
-          id: '2',
-          nextId: '1',
-        },
-      },
-    };
-
-    const ids = whileLinkedList(
-      (item) => item.id !== '1',
-      list,
-      '2',
-    );
-
-    expect(ids).toStrictEqual(['2']);
-  });
-});

package/src/linked-list/apply-diff-linked-list.ts

@@ -1,35 +0,0 @@
-import { LinkedList, LinkedListItem } from './type';
-
-export const applyDiffLinkedList = <T extends LinkedListItem>(
-  before: T | null,
-  after: T | null,
-  list: LinkedList<T>,
-) => {
-  // Delete
-  if (!after && before) {
-    return list.remove(before.id);
-  }
-
-  // Insert
-  if (!before && after) {
-    return list.insert(after);
-  }
-
-  // For the following commands, none of the 2 items can be null
-  // We dont use && because checks are already done above, but ts cannot infer that they cannot be null afterwards
-  if (!before || !after) {
-    throw new Error('Cannot have both before & after as null');
-  }
-
-  if (before.id !== after.id) {
-    throw new Error('Cannot change id of a ListNode');
-  }
-
-  const listWithPotentialReorder = before.nextId === after.nextId
-    ? list
-    : list
-      .remove(before.id)
-      .insert(after);
-
-  return listWithPotentialReorder.update(after);
-};

package/src/linked-list/create-linked-list.ts

@@ -1,79 +0,0 @@
-import { LinkedListItem, LinkedList, ManipulationConfig, LinkedListFormat } from './type';
-
-import { reduceLinkedList } from './reduce-linked-list';
-import { findLinkedList } from './find-linked-list';
-import { whileLinkedList } from './while-linked-list';
-import { walkListItemRecord } from './linked-list-utils';
-import { removeLinkedList } from './remove-linked-list';
-import { insertLinkedList } from './insert-linked-list';
-import { getLinkedList } from './get-linked-list';
-import { updateLinkedList } from './update-linked-list';
-import { applyDiffLinkedList } from './apply-diff-linked-list';
-
-type LinkedListValidation = {
-  format: LinkedListFormat | null,
-  previousId: null | string,
-  count: number,
-};
-
-export const createLinkedList = <T extends LinkedListItem>(headId: string | null, items: Record<string, T>): LinkedList<T> => {
-  const head = headId ? items[headId] : null;
-
-  if (head === undefined) {
-    throw new Error('Cannot find the head.');
-  }
-
-  const list = { headId, items };
-
-  const { format, count } = walkListItemRecord((acc, current) => {
-    const newCount = acc.count + 1;
-    const currentNodeFormat: LinkedListFormat = current.previousId !== undefined ? 'double' : 'single';
-    const incompatibleFormats = acc.format !== null && acc.format !== currentNodeFormat;
-
-    if (incompatibleFormats || (currentNodeFormat === 'double' && current.previousId !== acc.previousId)) {
-      throw new Error('Invalid previous node in the linked list');
-    }
-
-    return {
-      result: {
-        previousId: current.id,
-        format: currentNodeFormat,
-        count: newCount,
-      },
-    };
-  }, {
-    initValue: {
-      format: null,
-      count: 0,
-      previousId: null,
-    } as LinkedListValidation,
-    startId: headId,
-    items,
-  });
-
-  const manipulationConfig: ManipulationConfig<T> = {
-    factory: (newList) => createLinkedList(newList.headId, newList.items),
-    /**
-     * At this point isDoubleLinked cannot be undefined
-     */
-    format,
-    list,
-  };
-
-  const linkedList: LinkedList<T> = {
-    head,
-    items,
-    format,
-    size: count,
-    reduce: (cb, initValue) => reduceLinkedList(cb, initValue, list),
-    find: (predicate) => findLinkedList(predicate, list),
-    while: (predicate, startId) => whileLinkedList(predicate, list, startId),
-    remove: (id) => removeLinkedList(id, manipulationConfig),
-    insert: (item) => insertLinkedList(item, manipulationConfig),
-    get: (id) => getLinkedList(id, list),
-    update: (item) => updateLinkedList(item, manipulationConfig),
-    applyDiff: (before, after) => applyDiffLinkedList(before, after, linkedList),
-  };
-
-  return linkedList;
-};

package/src/linked-list/find-linked-list.ts

@@ -1,26 +0,0 @@
-import { LinkedListItem, ItemPredicate, SimpleLinkedList } from './type';
-import { walkListItemRecord } from './linked-list-utils';
-
-export const findLinkedList = <Item extends LinkedListItem>(
-  predicate: ItemPredicate<Item>,
-  list: SimpleLinkedList<Item>,
-): Item | null => (
-    walkListItemRecord((acc, item) => {
-      if (predicate(item)) {
-        return {
-          result: item,
-          control: {
-            stop: true,
-          },
-        };
-      }
-
-      return {
-        result: acc,
-      };
-    }, {
-      initValue: null as Item | null,
-      items: list.items,
-      startId: list.headId,
-    })
-  );

package/src/linked-list/get-linked-list.ts

@@ -1,9 +0,0 @@
-import { SimpleLinkedList, LinkedListItem } from './type';
-
-export const getLinkedList = <T extends LinkedListItem>(id: string, list: SimpleLinkedList<T>) => {
-  if (list.items[id]) {
-    return list.items[id];
-  }
-
-  return null;
-};

package/src/linked-list/index.ts

@@ -1,2 +0,0 @@
-export * from './create-linked-list';
-export * from './type';

package/src/linked-list/insert-linked-list.ts

@@ -1,50 +0,0 @@
-import { ManipulationConfig, LinkedListItem } from './type';
-
-import {
-  findPreviousId,
-  assertItemCompatibility,
-  assertPresence,
-  assertNewNodePosition,
-} from './linked-list-utils';
-
-export const insertLinkedList = <T extends LinkedListItem>(item: T, config: ManipulationConfig<T>) => {
-  const { format, list, factory } = config;
-
-  assertItemCompatibility(item, format);
-  assertPresence(item.nextId, list.items);
-  assertPresence(item.previousId, list.items);
-
-  const hasPrevious = item.previousId !== undefined;
-
-  const previousId = hasPrevious
-    ? item.previousId!
-    : findPreviousId(item.nextId, list);
-
-  assertNewNodePosition(item, {
-    previousId,
-    list,
-  });
-
-  const newHeadId = item.nextId === list.headId ? item.id : list.headId;
-  const newItems = {
-    ...list.items,
-    ...(previousId ? {
-      [previousId]: {
-        ...list.items[previousId],
-        nextId: item.id,
-      },
-    } : {}),
-    ...(hasPrevious && item.nextId ? {
-      [item.nextId]: {
-        ...list.items[item.nextId],
-        ...(hasPrevious ? { previousId: item.id } : {}),
-      },
-    } : {}),
-    [item.id]: item,
-  };
-
-  return factory({
-    headId: newHeadId,
-    items: newItems,
-  });
-};

package/src/linked-list/linked-list-utils.ts

@@ -1,143 +0,0 @@
-import { runWhile } from '../fp';
-import { LinkedListFormat, LinkedListItem, SimpleLinkedList } from './type';
-
-export type WalkConfig<T extends LinkedListItem, Result> = {
-  startId: string | null,
-  items: Record<string, T>,
-  initValue: Result,
-};
-
-type WalkCallbackResult<R> = {
-  result: R,
-  control?: {
-    stop?: boolean,
-  },
-};
-
-export type WalkCallback<Item, Result> = (accumulator: Result, current: Item) => WalkCallbackResult<Result>;
-
-type RunWhileValue<T> = {
-  currentId: string | null,
-  accumulator: T,
-  control: WalkCallbackResult<any>['control'],
-};
-
-export const walkListItemRecord = <T extends LinkedListItem, Result>(
-  callback: WalkCallback<T, Result>,
-  config: WalkConfig<T, Result>,
-) => {
-  const { items, startId, initValue } = config;
-  const visited = new Set();
-  const totalNodes = Object.keys(items).length;
-
-  const { result } = runWhile({
-    iterationLimit: totalNodes + 1,
-    initialValue: {
-      currentId: startId,
-      accumulator: initValue,
-      control: {
-        stop: false,
-      },
-    } as RunWhileValue<Result>,
-    predicate: ({ control, currentId }) => {
-      const stop = control?.stop;
-      const forcedStop = stop === undefined ? false : stop;
-
-      /**
-       * Stop early or when the end is reached
-       */
-      return !forcedStop && currentId !== null;
-    },
-    callback: (current) => {
-      if (visited.has(current.currentId)) {
-        throw new Error('Infinite loop found');
-      }
-
-      visited.add(current.currentId);
-
-      const currentItem = items[current.currentId!];
-
-      if (!currentItem) {
-        throw new Error('Cul de sac detected');
-      }
-
-      const { result: currentResult, control } = callback(current.accumulator, currentItem);
-
-      return {
-        accumulator: currentResult,
-        currentId: currentItem.nextId,
-        control,
-      };
-    },
-  });
-
-  return result.accumulator;
-};
-
-export const findPreviousId = <T extends LinkedListItem>(id: string | null, list: SimpleLinkedList<T>) => {
-  if (id === list.headId) {
-    return null;
-  }
-
-  return walkListItemRecord(
-    (acc, current) => {
-      if (current.nextId === id) {
-        return {
-          result: current.id,
-          control: {
-            stop: true,
-          },
-        };
-      }
-
-      return {
-        result: acc,
-      };
-    },
-    {
-      initValue: null as null | string,
-      startId: list.headId,
-      items: list.items,
-    },
-  );
-};
-
-export const assertItemCompatibility = <T extends LinkedListItem>(item: T, format: LinkedListFormat | null) => {
-  /**
-   * An empty linked list won't have any format yet, it will be
-   * determined by the first item inserted in the list.
-   */
-  if (format === null) {
-    return;
-  }
-
-  const incompatibleWithDoubleLinks = item.previousId === undefined && format === 'double';
-  const incompatibleWithSingleLink = item.previousId !== undefined && format === 'single';
-
-  if (incompatibleWithDoubleLinks || incompatibleWithSingleLink) {
-    throw new Error(`Node is incompatible with the list (id: ${item.id})`);
-  }
-};
-
-export const assertPresence = (id: string | null | undefined, items: Record<string, unknown>) => {
-  if (id && !items[id]) {
-    throw new Error(`Node not found in the list (id: ${id})`);
-  }
-};
-
-type PositionAssertionConfig = {
-  previousId: string | null,
-  list: SimpleLinkedList<LinkedListItem>,
-};
-
-export const assertNewNodePosition = <T extends LinkedListItem>(item: T, config: PositionAssertionConfig) => {
-  const { previousId, list } = config;
-
-  const insertionMiddleError = previousId && list.items[previousId].nextId !== item.nextId;
-  const insertionTailError = previousId && item.nextId === null && list.items[previousId].nextId !== null;
-  const insertionHeadError = previousId === null && item.nextId !== list.headId;
-
-  if (insertionMiddleError || insertionTailError || insertionHeadError) {
-    throw new Error(`Invalid position for given node (id: ${item.id})`);
-  }
-};

package/src/linked-list/reduce-linked-list.ts

@@ -1,18 +0,0 @@
-import { ReduceCallback, LinkedListItem, SimpleLinkedList } from './type';
-import { walkListItemRecord } from './linked-list-utils';
-
-export const reduceLinkedList = <Item extends LinkedListItem, Result>(
-  cb: ReduceCallback<Item, Result>,
-  initValue: Result,
-  list: SimpleLinkedList<Item>,
-): Result => {
-  const { items, headId } = list;
-
-  return walkListItemRecord((acc, current) => ({
-    result: cb(acc, current),
-  }), {
-    startId: headId,
-    items,
-    initValue,
-  });
-};

package/src/linked-list/remove-linked-list.ts

@@ -1,36 +0,0 @@
-import { ManipulationConfig, LinkedListItem } from './type';
-import { assertPresence, findPreviousId } from './linked-list-utils';
-
-export const removeLinkedList = <T extends LinkedListItem>(id: string, config: ManipulationConfig<T>) => {
-  const { format, list, factory } = config;
-  const { [id]: itemToDelete, ...otherItems } = list.items;
-
-  assertPresence(id, list.items);
-
-  const isDoubleLinkList = format === 'double';
-  const previousId = isDoubleLinkList
-    ? itemToDelete.previousId!
-    : findPreviousId(id, list);
-
-  const newHeadId = previousId === null ? itemToDelete.nextId : list.headId;
-  const newItems = {
-    ...otherItems,
-    ...(previousId ? {
-      [previousId]: {
-        ...otherItems[previousId],
-        nextId: itemToDelete.nextId,
-      },
-    } : {}),
-    ...(isDoubleLinkList && itemToDelete.nextId ? {
-      [itemToDelete.nextId]: {
-        ...otherItems[itemToDelete.nextId],
-        ...(isDoubleLinkList ? { previousId } : {}),
-      },
-    } : {}),
-  };
-
-  return factory({
-    headId: newHeadId,
-    items: newItems,
-  });
-};

package/src/linked-list/type.ts

@@ -1,38 +0,0 @@
-export type LinkedListItem = {
-  id: string,
-  nextId: string | null,
-  previousId?: string | null,
-};
-
-export type SimpleLinkedList<T extends LinkedListItem> = {
-  headId: string | null,
-  items: {
-    [id: string]: T,
-  },
-};
-
-export type ReduceCallback<Item, Result> = (accumulator: Result, current: Item) => Result;
-export type ItemPredicate<Item> = (item: Item) => boolean;
-export type LinkedListFormat = 'double' | 'single';
-export type ManipulationConfig<T extends LinkedListItem> = {
-  format: LinkedListFormat | null,
-  list: SimpleLinkedList<T>,
-  factory: (list: SimpleLinkedList<T>) => LinkedList<T>,
-};
-
-export type LinkedList<T extends LinkedListItem> = {
-  readonly head: T | null,
-  readonly items: {
-    [id: string]: T,
-  },
-  readonly size: number,
-  readonly format: LinkedListFormat | null,
-  readonly reduce: <Result>(cb: ReduceCallback<T, Result>, init: Result) => Result,
-  readonly find: (predicate: ItemPredicate<T>) => T | null,
-  readonly while: (predicate: ItemPredicate<T>, startId?: string) => string[],
-  readonly remove: (id: string) => LinkedList<T>,
-  readonly insert: (item: T) => LinkedList<T>,
-  readonly get: (id: string) => T | null,
-  readonly update: (item: T) => LinkedList<T>,
-  readonly applyDiff: (before: T | null, after: T | null) => LinkedList<T>,
-};

package/src/linked-list/update-linked-list.ts

@@ -1,30 +0,0 @@
-import { ManipulationConfig, LinkedListItem } from './type';
-import { assertPresence } from './linked-list-utils';
-
-export const updateLinkedList = <T extends LinkedListItem>(item: T, config: ManipulationConfig<T>) => {
-  const { list, factory } = config;
-
-  assertPresence(item.id, list.items);
-
-  /**
-   * This method should not update any ids, this is why they are removed from the item.
-   */
-  // eslint-disable-next-line @typescript-eslint/no-unused-vars
-  const { nextId, previousId, id, ...updatedProperties } = item;
-  const currentItem = list.items[item.id];
-
-  const newItems = {
-    ...list.items,
-    [item.id]: {
-      nextId: currentItem.nextId,
-      previousId: currentItem.previousId,
-      id: currentItem.id,
-      ...updatedProperties,
-    } as T,
-  };
-
-  return factory({
-    headId: list.headId,
-    items: newItems,
-  });
-};

package/src/linked-list/while-linked-list.ts

@@ -1,33 +0,0 @@
-import { LinkedListItem, ItemPredicate, SimpleLinkedList } from './type';
-import { walkListItemRecord } from './linked-list-utils';
-
-export const whileLinkedList = <Item extends LinkedListItem>(
-  predicate: ItemPredicate<Item>,
-  list: SimpleLinkedList<Item>,
-  startId?: string,
-): string[] => {
-  if (startId && !list.items[startId]) {
-    throw new Error('Cannot start from a node that does not exist');
-  }
-
-  return walkListItemRecord((acc, item) => {
-    const itemMatched = predicate(item);
-
-    if (itemMatched) {
-      return {
-        result: [...acc, item.id],
-      };
-    }
-
-    return {
-      result: acc,
-      control: {
-        stop: true,
-      },
-    };
-  }, {
-    initValue: [] as string[],
-    startId: startId || list.headId,
-    items: list.items,
-  });
-};

package/src/math/__tests__/clamp-number.test.ts

@@ -1,30 +0,0 @@
-import { clampNumber } from '../clamp-number';
-
-describe('clampNumber', () => {
-  it('should not return number below the min', () => {
-    const result = clampNumber(-51, {
-      min: -9,
-      max: -1,
-    });
-
-    expect(result).toStrictEqual(-9);
-  });
-
-  it('should return the same number because it is inside the range', () => {
-    const result = clampNumber(128, {
-      min: 100,
-      max: 200,
-    });
-
-    expect(result).toStrictEqual(128);
-  });
-
-  it('should not return number above the max', () => {
-    const result = clampNumber(128, {
-      min: -100,
-      max: -8,
-    });
-
-    expect(result).toStrictEqual(-8);
-  });
-});

package/src/math/__tests__/interpolate.test.ts

@@ -1,28 +0,0 @@
-import { interpolate, RangeArray } from '../interpolate';
-
-describe('interpolate', () => {
-  it('should throw if input range is x2 < x1 in input range', () => {
-    expect(
-      () => interpolate(100, [1, 0], [0, 1]),
-    ).toThrowError('interpolate: inputRange[0] should not be superior to inputRange[1]');
-  });
-
-  it('should throw if input number is not in input range', () => {
-    expect(
-      () => interpolate(100, [0, 1], [1, 0]),
-    ).toThrowError('interpolate: input number {100} is not in range of {0}-{1}');
-  });
-
-  it('should return the correct interpolated number', () => {
-    const set: { num: number, result: number, inputRange: RangeArray, outputRange: RangeArray }[] = [
-      { num: 50, inputRange: [0, 100], outputRange: [0, 1], result: 0.5 },
-      { num: 15.5, inputRange: [0, 100], outputRange: [0, 1], result: 0.155 },
-      { num: 15.5, inputRange: [0, 100], outputRange: [0, 1000], result: 155 },
-      { num: 75, inputRange: [0, 100], outputRange: [-100, 0], result: -25 },
-    ];
-
-    set.forEach(({ num, inputRange, outputRange, result }) => expect(
-      interpolate(num, inputRange, outputRange),
-    ).toStrictEqual(result));
-  });
-});

package/src/math/__tests__/median.test.ts

@@ -1,27 +0,0 @@
-import { median } from '../median';
-
-describe('median', () => {
-  it('should return the middle value if the array has an odd number of elements', () => {
-    expect(median([1, 2, 3])).toStrictEqual(2);
-  });
-
-  it('should return the average of the middle two values if the array has an even number of elements', () => {
-    expect(median([1, 2, 3, 4])).toStrictEqual(2.5);
-  });
-
-  it('should handle an empty array', () => {
-    expect(median([])).toBeNull();
-  });
-
-  it('should handle array with duplicate values', () => {
-    expect(median([4, 7, 2, 4, 9])).toStrictEqual(4);
-  });
-
-  it('should handle array with negative values', () => {
-    expect(median([-1, -5, -3, -2, -4])).toStrictEqual(-3);
-  });
-
-  it('should overwrite the default value if the array is empty', () => {
-    expect(median([], 0)).toStrictEqual(0);
-  });
-});