@sparted/shared-library 0.0.12 → 0.0.14

package/linked-list/apply-diff-linked-list.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"apply-diff-linked-list.js","sources":["../../src/linked-list/apply-diff-linked-list.ts"],"sourcesContent":["import { LinkedList, LinkedListItem, ManipulationConfig } from './type';\n\nexport const applyDiffLinkedList = <T extends LinkedListItem>(\n  before: T | null,\n  after: T | null,\n  list: LinkedList<T>,\n) => {\n  // Delete\n  if (!after && before) {\n    return list.remove(before.id);\n  }\n\n  // Insert\n  if (!before && after) {\n    return list.insert(after);\n  }\n\n  // For the following commands, none of the 2 items can be null\n  // We dont use && because checks are already done above, but ts cannot infer that they cannot be null afterwards\n  if (!before || !after) {\n    throw new Error('Cannot have both before & after as null');\n  }\n\n  if (before.id !== after.id) {\n    throw new Error('Cannot change id of a ListNode');\n  }\n\n  const listWithPotentialReorder = before.nextId === after.nextId\n    ? list\n    : list\n      .remove(before.id)\n      .insert(after);\n\n  return listWithPotentialReorder.update(after);\n};"],"names":[],"mappings":"AAEa,MAAA,mBAAmB,GAAG,CACjC,MAAgB,EAChB,KAAe,EACf,IAAmB,KACjB;;AAEF,IAAA,IAAI,CAAC,KAAK,IAAI,MAAM,EAAE;QACpB,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;AAC/B,KAAA;;AAGD,IAAA,IAAI,CAAC,MAAM,IAAI,KAAK,EAAE;AACpB,QAAA,OAAO,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;AAC3B,KAAA;;;AAID,IAAA,IAAI,CAAC,MAAM,IAAI,CAAC,KAAK,EAAE;AACrB,QAAA,MAAM,IAAI,KAAK,CAAC,yCAAyC,CAAC,CAAC;AAC5D,KAAA;AAED,IAAA,IAAI,MAAM,CAAC,EAAE,KAAK,KAAK,CAAC,EAAE,EAAE;AAC1B,QAAA,MAAM,IAAI,KAAK,CAAC,gCAAgC,CAAC,CAAC;AACnD,KAAA;IAED,MAAM,wBAAwB,GAAG,MAAM,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM;AAC7D,UAAE,IAAI;AACN,UAAE,IAAI;AACH,aAAA,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC;aACjB,MAAM,CAAC,KAAK,CAAC,CAAC;AAEnB,IAAA,OAAO,wBAAwB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;AAChD;;;;"}

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

@@ -0,0 +1,2 @@
+import { LinkedListItem, LinkedList } from './type';
+export declare const createLinkedList: <T extends LinkedListItem>(headId: string | null, items: Record<string, T>) => LinkedList<T>;

package/linked-list/create-linked-list.js

@@ -0,0 +1,66 @@
+import { reduceLinkedList } from './reduce-linked-list.js';
+import { findLinkedList } from './find-linked-list.js';
+import { whileLinkedList } from './while-linked-list.js';
+import { walkListItemRecord } from './linked-list-utils.js';
+import { removeLinkedList } from './remove-linked-list.js';
+import { insertLinkedList } from './insert-linked-list.js';
+import { getLinkedList } from './get-linked-list.js';
+import { updateLinkedList } from './update-linked-list.js';
+import { applyDiffLinkedList } from './apply-diff-linked-list.js';
+
+const createLinkedList = (headId, items) => {
+    const head = headId ? items[headId] : null;
+    if (head === undefined) {
+        throw new Error('Cannot find the head.');
+    }
+    const list = { headId, items };
+    const { isDoubleLinked, count } = walkListItemRecord((acc, current) => {
+        const newCount = acc.count + 1;
+        const isDoubleLinked = current.previousId !== undefined;
+        const incompatibleFormats = acc.isDoubleLinked !== undefined && acc.isDoubleLinked !== isDoubleLinked;
+        if (incompatibleFormats || (isDoubleLinked && current.previousId !== acc.previousId)) {
+            throw new Error('Invalid previous node in the linked list');
+        }
+        return {
+            result: {
+                previousId: current.id,
+                count: newCount,
+                isDoubleLinked,
+            }
+        };
+    }, {
+        initValue: {
+            isDoubleLinked: undefined,
+            count: 0,
+            previousId: null,
+        },
+        startId: headId,
+        items,
+    });
+    const manipulationConfig = {
+        factory: (list) => createLinkedList(list.headId, list.items),
+        /**
+         * At this point isDoubleLinked cannot be undefined
+         */
+        isDoubleLinkList: isDoubleLinked,
+        list,
+    };
+    const linkedList = {
+        head,
+        items,
+        size: count,
+        isDoubleLinked: isDoubleLinked,
+        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;
+};
+
+export { createLinkedList };
+//# sourceMappingURL=create-linked-list.js.map

package/linked-list/create-linked-list.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"create-linked-list.js","sources":["../../src/linked-list/create-linked-list.ts"],"sourcesContent":["import { LinkedListItem, LinkedList, ManipulationConfig } from './type';\n\nimport { reduceLinkedList } from './reduce-linked-list';\nimport { findLinkedList } from './find-linked-list';\nimport { whileLinkedList } from './while-linked-list';\nimport { walkListItemRecord } from './linked-list-utils';\nimport { removeLinkedList } from './remove-linked-list';\nimport { insertLinkedList } from './insert-linked-list';\nimport { getLinkedList } from './get-linked-list';\nimport { updateLinkedList } from './update-linked-list';\nimport { applyDiffLinkedList } from './apply-diff-linked-list';\n\ntype LinkedListValidation = {\n  isDoubleLinked?: boolean,\n  previousId: null | string,\n  count: number,\n}\n\nexport const createLinkedList = <T extends LinkedListItem>(headId: string | null, items: Record<string, T>): LinkedList<T> => {\n  const head = headId ? items[headId] : null;\n\n  if (head === undefined) {\n    throw new Error('Cannot find the head.');\n  }\n\n  const list = { headId, items };\n\n  const { isDoubleLinked, count } = walkListItemRecord((acc, current) => {\n    const newCount = acc.count + 1;\n    const isDoubleLinked = current.previousId !== undefined;\n    const incompatibleFormats = acc.isDoubleLinked !== undefined && acc.isDoubleLinked !== isDoubleLinked;\n\n    if (incompatibleFormats || (isDoubleLinked && current.previousId !== acc.previousId)) {\n      throw new Error('Invalid previous node in the linked list');\n    }\n\n    return {\n      result: {\n        previousId: current.id,\n        count: newCount,\n        isDoubleLinked,\n      }\n    }\n  }, {\n    initValue: {\n      isDoubleLinked: undefined,\n      count: 0,\n      previousId: null,\n    } as LinkedListValidation,\n    startId: headId,\n    items,\n  });\n\n  const manipulationConfig: ManipulationConfig<T> = {\n    factory: (list) => createLinkedList(list.headId, list.items),\n    /**\n     * At this point isDoubleLinked cannot be undefined\n     */\n    isDoubleLinkList: isDoubleLinked!,\n    list,\n  };\n\n  const linkedList: LinkedList<T> = {\n    head,\n    items,\n    size: count,\n    isDoubleLinked: isDoubleLinked!,\n    reduce: (cb, initValue) => reduceLinkedList(cb, initValue, list),\n    find: (predicate) => findLinkedList(predicate, list),\n    while: (predicate, startId) => whileLinkedList(predicate, list, startId),\n    remove: (id) => removeLinkedList(id, manipulationConfig),\n    insert: (item) => insertLinkedList(item, manipulationConfig),\n    get: (id) => getLinkedList(id, list),\n    update: (item) => updateLinkedList(item, manipulationConfig),\n    applyDiff: (before, after) => applyDiffLinkedList(before, after, linkedList),\n  };\n\n  return linkedList;\n};"],"names":[],"mappings":";;;;;;;;;;MAkBa,gBAAgB,GAAG,CAA2B,MAAqB,EAAE,KAAwB,KAAmB;AAC3H,IAAA,MAAM,IAAI,GAAG,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC;IAE3C,IAAI,IAAI,KAAK,SAAS,EAAE;AACtB,QAAA,MAAM,IAAI,KAAK,CAAC,uBAAuB,CAAC,CAAC;AAC1C,KAAA;AAED,IAAA,MAAM,IAAI,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC;AAE/B,IAAA,MAAM,EAAE,cAAc,EAAE,KAAK,EAAE,GAAG,kBAAkB,CAAC,CAAC,GAAG,EAAE,OAAO,KAAI;AACpE,QAAA,MAAM,QAAQ,GAAG,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC;AAC/B,QAAA,MAAM,cAAc,GAAG,OAAO,CAAC,UAAU,KAAK,SAAS,CAAC;AACxD,QAAA,MAAM,mBAAmB,GAAG,GAAG,CAAC,cAAc,KAAK,SAAS,IAAI,GAAG,CAAC,cAAc,KAAK,cAAc,CAAC;AAEtG,QAAA,IAAI,mBAAmB,KAAK,cAAc,IAAI,OAAO,CAAC,UAAU,KAAK,GAAG,CAAC,UAAU,CAAC,EAAE;AACpF,YAAA,MAAM,IAAI,KAAK,CAAC,0CAA0C,CAAC,CAAC;AAC7D,SAAA;QAED,OAAO;AACL,YAAA,MAAM,EAAE;gBACN,UAAU,EAAE,OAAO,CAAC,EAAE;AACtB,gBAAA,KAAK,EAAE,QAAQ;gBACf,cAAc;AACf,aAAA;SACF,CAAA;AACH,KAAC,EAAE;AACD,QAAA,SAAS,EAAE;AACT,YAAA,cAAc,EAAE,SAAS;AACzB,YAAA,KAAK,EAAE,CAAC;AACR,YAAA,UAAU,EAAE,IAAI;AACO,SAAA;AACzB,QAAA,OAAO,EAAE,MAAM;QACf,KAAK;AACN,KAAA,CAAC,CAAC;AAEH,IAAA,MAAM,kBAAkB,GAA0B;AAChD,QAAA,OAAO,EAAE,CAAC,IAAI,KAAK,gBAAgB,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC;AAC5D;;AAEG;AACH,QAAA,gBAAgB,EAAE,cAAe;QACjC,IAAI;KACL,CAAC;AAEF,IAAA,MAAM,UAAU,GAAkB;QAChC,IAAI;QACJ,KAAK;AACL,QAAA,IAAI,EAAE,KAAK;AACX,QAAA,cAAc,EAAE,cAAe;AAC/B,QAAA,MAAM,EAAE,CAAC,EAAE,EAAE,SAAS,KAAK,gBAAgB,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,CAAC;QAChE,IAAI,EAAE,CAAC,SAAS,KAAK,cAAc,CAAC,SAAS,EAAE,IAAI,CAAC;AACpD,QAAA,KAAK,EAAE,CAAC,SAAS,EAAE,OAAO,KAAK,eAAe,CAAC,SAAS,EAAE,IAAI,EAAE,OAAO,CAAC;QACxE,MAAM,EAAE,CAAC,EAAE,KAAK,gBAAgB,CAAC,EAAE,EAAE,kBAAkB,CAAC;QACxD,MAAM,EAAE,CAAC,IAAI,KAAK,gBAAgB,CAAC,IAAI,EAAE,kBAAkB,CAAC;QAC5D,GAAG,EAAE,CAAC,EAAE,KAAK,aAAa,CAAC,EAAE,EAAE,IAAI,CAAC;QACpC,MAAM,EAAE,CAAC,IAAI,KAAK,gBAAgB,CAAC,IAAI,EAAE,kBAAkB,CAAC;AAC5D,QAAA,SAAS,EAAE,CAAC,MAAM,EAAE,KAAK,KAAK,mBAAmB,CAAC,MAAM,EAAE,KAAK,EAAE,UAAU,CAAC;KAC7E,CAAC;AAEF,IAAA,OAAO,UAAU,CAAC;AACpB;;;;"}

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

@@ -0,0 +1,2 @@
+import { LinkedListItem, ItemPredicate, HeadAndItems } from './type';
+export declare const findLinkedList: <Item extends LinkedListItem>(predicate: ItemPredicate<Item>, list: HeadAndItems<Item>) => Item | null;

package/linked-list/find-linked-list.js

@@ -0,0 +1,24 @@
+import { walkListItemRecord } from './linked-list-utils.js';
+
+const findLinkedList = (predicate, list) => {
+    return walkListItemRecord((acc, item) => {
+        if (predicate(item)) {
+            return {
+                result: item,
+                control: {
+                    stop: true,
+                },
+            };
+        }
+        return {
+            result: acc,
+        };
+    }, {
+        initValue: null,
+        items: list.items,
+        startId: list.headId,
+    });
+};
+
+export { findLinkedList };
+//# sourceMappingURL=find-linked-list.js.map

package/linked-list/find-linked-list.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"find-linked-list.js","sources":["../../src/linked-list/find-linked-list.ts"],"sourcesContent":["import { LinkedListItem, ItemPredicate, HeadAndItems } from './type';\nimport { walkListItemRecord } from './linked-list-utils';\n\nexport const findLinkedList = <Item extends LinkedListItem>(\n  predicate: ItemPredicate<Item>,\n  list: HeadAndItems<Item>,\n): Item | null => {\n  const { headId } = list;\n\n  return walkListItemRecord(\n    (acc, item) => {\n      if (predicate(item)) {\n        return {\n          result: item,\n          control: {\n            stop: true,\n          },\n        };\n      };\n\n      return {\n        result: acc,\n      };\n    }, {\n      initValue: null as Item | null,\n      items: list.items,\n      startId: list.headId,\n    },\n  );\n};\n"],"names":[],"mappings":";;MAGa,cAAc,GAAG,CAC5B,SAA8B,EAC9B,IAAwB,KACT;AAGf,IAAA,OAAO,kBAAkB,CACvB,CAAC,GAAG,EAAE,IAAI,KAAI;AACZ,QAAA,IAAI,SAAS,CAAC,IAAI,CAAC,EAAE;YACnB,OAAO;AACL,gBAAA,MAAM,EAAE,IAAI;AACZ,gBAAA,OAAO,EAAE;AACP,oBAAA,IAAI,EAAE,IAAI;AACX,iBAAA;aACF,CAAC;AACH,SAAA;QAED,OAAO;AACL,YAAA,MAAM,EAAE,GAAG;SACZ,CAAC;AACJ,KAAC,EAAE;AACD,QAAA,SAAS,EAAE,IAAmB;QAC9B,KAAK,EAAE,IAAI,CAAC,KAAK;QACjB,OAAO,EAAE,IAAI,CAAC,MAAM;AACrB,KAAA,CACF,CAAC;AACJ;;;;"}

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

@@ -0,0 +1,2 @@
+import { HeadAndItems, LinkedListItem } from './type';
+export declare const getLinkedList: <T extends LinkedListItem>(id: string, list: HeadAndItems<T>) => T | null;

package/linked-list/get-linked-list.js

@@ -0,0 +1,9 @@
+const getLinkedList = (id, list) => {
+    if (list.items[id]) {
+        return list.items[id];
+    }
+    return null;
+};
+
+export { getLinkedList };
+//# sourceMappingURL=get-linked-list.js.map

package/linked-list/get-linked-list.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"get-linked-list.js","sources":["../../src/linked-list/get-linked-list.ts"],"sourcesContent":["import { HeadAndItems, LinkedListItem } from './type';\n\nexport const getLinkedList = <T extends LinkedListItem>(id: string, list: HeadAndItems<T>) => {\n  if (list.items[id]) {\n    return list.items[id];\n  }\n\n  return null;\n}"],"names":[],"mappings":"MAEa,aAAa,GAAG,CAA2B,EAAU,EAAE,IAAqB,KAAI;AAC3F,IAAA,IAAI,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE;AAClB,QAAA,OAAO,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;AACvB,KAAA;AAED,IAAA,OAAO,IAAI,CAAC;AACd;;;;"}

package/linked-list/index.d.ts

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

package/linked-list/index.js

@@ -0,0 +1,2 @@
+export { createLinkedList } from './create-linked-list.js';
+//# sourceMappingURL=index.js.map

package/linked-list/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":[],"sourcesContent":[],"names":[],"mappings":""}

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

@@ -0,0 +1,2 @@
+import { ManipulationConfig, LinkedListItem } from './type';
+export declare const insertLinkedList: <T extends LinkedListItem>(item: T, config: ManipulationConfig<T>) => import("./type").LinkedList<T>;

package/linked-list/insert-linked-list.js

@@ -0,0 +1,28 @@
+import { assertItemCompatibility, assertPresence, findPreviousId, assertNewNodePosition } from './linked-list-utils.js';
+
+const insertLinkedList = (item, config) => {
+    const { isDoubleLinkList, list, factory } = config;
+    assertItemCompatibility(item, isDoubleLinkList);
+    assertPresence(item.nextId, list.items);
+    assertPresence(item.previousId, list.items);
+    const previousId = isDoubleLinkList
+        ? item.previousId
+        : findPreviousId(item.nextId, list);
+    assertNewNodePosition(item, {
+        previousId,
+        list,
+    });
+    const newHeadId = item.nextId === list.headId ? item.id : list.headId;
+    const newItems = Object.assign(Object.assign(Object.assign(Object.assign({}, list.items), (previousId ? {
+        [previousId]: Object.assign(Object.assign({}, list.items[previousId]), { nextId: item.id }),
+    } : {})), (isDoubleLinkList && item.nextId ? {
+        [item.nextId]: Object.assign(Object.assign({}, list.items[item.nextId]), (isDoubleLinkList ? { previousId: item.id } : {})),
+    } : {})), { [item.id]: item });
+    return factory({
+        headId: newHeadId,
+        items: newItems,
+    });
+};
+
+export { insertLinkedList };
+//# sourceMappingURL=insert-linked-list.js.map

package/linked-list/insert-linked-list.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"insert-linked-list.js","sources":["../../src/linked-list/insert-linked-list.ts"],"sourcesContent":["import { ManipulationConfig, LinkedListItem } from './type';\n\nimport {\n  findPreviousId,\n  assertItemCompatibility,\n  assertPresence,\n  assertNewNodePosition,\n} from './linked-list-utils';\n\nexport const insertLinkedList = <T extends LinkedListItem>(item: T, config: ManipulationConfig<T>) => {\n  const { isDoubleLinkList, list, factory } = config;\n\n  assertItemCompatibility(item, isDoubleLinkList);\n  assertPresence(item.nextId, list.items);\n  assertPresence(item.previousId, list.items);\n\n  const previousId = isDoubleLinkList\n    ? item.previousId!\n    : findPreviousId(item.nextId, list);\n\n  assertNewNodePosition(item, {\n    previousId,\n    list,\n  });\n\n  const newHeadId = item.nextId === list.headId ? item.id : list.headId;\n  const newItems = {\n    ...list.items,\n    ...(previousId ? {\n      [previousId]: {\n        ...list.items[previousId],\n        nextId: item.id,\n      },\n    } : {}),\n    ...(isDoubleLinkList && item.nextId ? {\n      [item.nextId]: {\n        ...list.items[item.nextId],\n        ...(isDoubleLinkList ? { previousId: item.id } : {}),\n      },\n    } : {}),\n    [item.id]: item,\n  };\n\n  return factory({\n    headId: newHeadId,\n    items: newItems,\n  });\n};\n"],"names":[],"mappings":";;MASa,gBAAgB,GAAG,CAA2B,IAAO,EAAE,MAA6B,KAAI;IACnG,MAAM,EAAE,gBAAgB,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,MAAM,CAAC;AAEnD,IAAA,uBAAuB,CAAC,IAAI,EAAE,gBAAgB,CAAC,CAAC;IAChD,cAAc,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;IACxC,cAAc,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;IAE5C,MAAM,UAAU,GAAG,gBAAgB;UAC/B,IAAI,CAAC,UAAW;UAChB,cAAc,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;IAEtC,qBAAqB,CAAC,IAAI,EAAE;QAC1B,UAAU;QACV,IAAI;AACL,KAAA,CAAC,CAAC;IAEH,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC;IACtE,MAAM,QAAQ,GACT,MAAA,CAAA,MAAA,CAAA,MAAA,CAAA,MAAA,CAAA,MAAA,CAAA,MAAA,CAAA,MAAA,CAAA,MAAA,CAAA,EAAA,EAAA,IAAI,CAAC,KAAK,IACT,UAAU,GAAG;AACf,QAAA,CAAC,UAAU,GACN,MAAA,CAAA,MAAA,CAAA,MAAA,CAAA,MAAA,CAAA,EAAA,EAAA,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,KACzB,MAAM,EAAE,IAAI,CAAC,EAAE,EAChB,CAAA;AACF,KAAA,GAAG,EAAE,EACH,GAAC,gBAAgB,IAAI,IAAI,CAAC,MAAM,GAAG;AACpC,QAAA,CAAC,IAAI,CAAC,MAAM,GACP,MAAA,CAAA,MAAA,CAAA,MAAA,CAAA,MAAA,CAAA,EAAA,EAAA,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CACvB,GAAC,gBAAgB,GAAG,EAAE,UAAU,EAAE,IAAI,CAAC,EAAE,EAAE,GAAG,EAAE,EACpD;AACF,KAAA,GAAG,EAAE,EACN,EAAA,EAAA,CAAC,IAAI,CAAC,EAAE,GAAG,IAAI,GAChB,CAAC;AAEF,IAAA,OAAO,OAAO,CAAC;AACb,QAAA,MAAM,EAAE,SAAS;AACjB,QAAA,KAAK,EAAE,QAAQ;AAChB,KAAA,CAAC,CAAC;AACL;;;;"}

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

@@ -0,0 +1,23 @@
+import { LinkedListItem, HeadAndItems } from './type';
+export declare type WalkConfig<T extends LinkedListItem, Result> = {
+    startId: string | null;
+    items: Record<string, T>;
+    initValue: Result;
+};
+declare type WalkCallbackResult<R> = {
+    result: R;
+    control?: {
+        stop?: boolean;
+    };
+};
+export declare type WalkCallback<Item, Result> = (accumulator: Result, current: Item) => WalkCallbackResult<Result>;
+export declare const walkListItemRecord: <T extends LinkedListItem, Result>(callback: WalkCallback<T, Result>, config: WalkConfig<T, Result>) => Result;
+export declare const findPreviousId: <T extends LinkedListItem>(id: string | null, list: HeadAndItems<T>) => string | null;
+export declare const assertItemCompatibility: <T extends LinkedListItem>(item: T, isDoubleLinkList: boolean) => void;
+export declare const assertPresence: (id: string | null | undefined, items: Record<string, unknown>) => void;
+declare type PositionAssertionConfig = {
+    previousId: string | null;
+    list: HeadAndItems<LinkedListItem>;
+};
+export declare const assertNewNodePosition: <T extends LinkedListItem>(item: T, config: PositionAssertionConfig) => void;
+export {};

package/linked-list/linked-list-utils.js

@@ -0,0 +1,96 @@
+import { runWhile } from '../fp/run-while.js';
+
+const walkListItemRecord = (callback, config) => {
+    var _a;
+    const { items, startId, initValue } = config;
+    const visited = new Set();
+    const totalNodes = Object.keys(items).length;
+    const { iterationCount, result } = runWhile({
+        iterationLimit: totalNodes + 1,
+        initialValue: {
+            currentId: startId,
+            accumulator: initValue,
+            control: {
+                stop: false,
+            },
+        },
+        predicate: ({ control, currentId }) => {
+            const stop = control === null || control === void 0 ? void 0 : 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, control } = callback(current.accumulator, currentItem);
+            return {
+                accumulator: result,
+                currentId: currentItem.nextId,
+                control: control,
+            };
+        },
+    });
+    /**
+     * When force stopping the walk, we will always have unvisited
+     * nodes, so we skip this check.
+     */
+    if (iterationCount !== totalNodes && ((_a = result.control) === null || _a === void 0 ? void 0 : _a.stop) !== true) {
+        throw new Error('Isolated nodes found');
+    }
+    return result.accumulator;
+};
+const findPreviousId = (id, list) => {
+    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,
+        startId: list.headId,
+        items: list.items,
+    });
+};
+const assertItemCompatibility = (item, isDoubleLinkList) => {
+    const incompatibleWithDoubleLinks = item.previousId === undefined && isDoubleLinkList;
+    const incompatibleWithSingleLink = item.previousId !== undefined && !isDoubleLinkList;
+    if (incompatibleWithDoubleLinks || incompatibleWithSingleLink) {
+        throw new Error(`Node is incompatible with the list (id: ${item.id})`);
+    }
+};
+const assertPresence = (id, items) => {
+    if (id && !items[id]) {
+        throw new Error(`Node not found in the list (id: ${id})`);
+    }
+};
+const assertNewNodePosition = (item, config) => {
+    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})`);
+    }
+};
+
+export { assertItemCompatibility, assertNewNodePosition, assertPresence, findPreviousId, walkListItemRecord };
+//# sourceMappingURL=linked-list-utils.js.map

package/linked-list/linked-list-utils.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"linked-list-utils.js","sources":["../../src/linked-list/linked-list-utils.ts"],"sourcesContent":["import { runWhile } from '../fp';\nimport { LinkedListItem, HeadAndItems} from './type';\n\nexport type WalkConfig<T extends LinkedListItem, Result> = {\n  startId: string | null,\n  items: Record<string, T>,\n  initValue: Result,\n}\n\ntype WalkCallbackResult<R> = {\n  result: R,\n  control?: {\n    stop?: boolean,\n  },\n};\n\nexport type WalkCallback<Item, Result> = (accumulator: Result, current: Item) => WalkCallbackResult<Result>;\n\ntype RunWhileValue<T> = {\n  currentId: string | null,\n  accumulator: T,\n  control: WalkCallbackResult<any>['control'],\n}\n\nexport const walkListItemRecord = <T extends LinkedListItem, Result>(\n  callback: WalkCallback<T, Result>,\n  config: WalkConfig<T, Result>,\n) => {\n  const { items, startId, initValue } = config;\n  const visited = new Set();\n  const totalNodes = Object.keys(items).length;\n\n  const { iterationCount, result } = runWhile({\n    iterationLimit: totalNodes + 1,\n    initialValue: {\n      currentId: startId, \n      accumulator: initValue,\n      control: {\n        stop: false,\n      },\n    } as RunWhileValue<Result>,\n    predicate: ({ control, currentId }) => {\n      const stop = control?.stop;\n      const forcedStop = stop === undefined ? false : stop;\n\n      /**\n       * Stop early or when the end is reached\n       */\n      return !forcedStop && currentId !== null;\n    },\n    callback: (current) => {\n      if (visited.has(current.currentId)) {\n        throw new Error('Infinite loop found');\n      }\n\n      visited.add(current.currentId);\n\n      const currentItem = items[current.currentId!];\n\n      if (!currentItem) {\n        throw new Error('Cul de sac detected');\n      }\n\n      const { result, control } = callback(current.accumulator, currentItem);\n\n      return {\n        accumulator: result,\n        currentId: currentItem.nextId,\n        control: control,\n      };\n    },\n  });\n\n  /**\n   * When force stopping the walk, we will always have unvisited\n   * nodes, so we skip this check.\n   */\n  if (iterationCount !== totalNodes && result.control?.stop !== true) {\n    throw new Error('Isolated nodes found');\n  }\n\n  return result.accumulator;\n};\n\nexport const findPreviousId = <T extends LinkedListItem>(id: string | null, list: HeadAndItems<T>) => {\n  if (id === list.headId) {\n    return null;\n  }\n\n  return walkListItemRecord(\n    (acc, current) => {\n      if (current.nextId === id) {\n        return {\n          result: current.id,\n          control: {\n            stop: true,\n          },\n        };\n      }\n\n      return {\n        result: acc,\n      }\n    },\n    {\n      initValue: null as null | string,\n      startId: list.headId,\n      items: list.items,\n    }\n  )\n};\n\nexport const assertItemCompatibility = <T extends LinkedListItem>(item: T, isDoubleLinkList: boolean) => {\n  const incompatibleWithDoubleLinks = item.previousId === undefined && isDoubleLinkList;\n  const incompatibleWithSingleLink = item.previousId !== undefined && !isDoubleLinkList;\n\n  if (incompatibleWithDoubleLinks || incompatibleWithSingleLink) {\n    throw new Error(`Node is incompatible with the list (id: ${item.id})`);\n  }\n}\n\nexport const assertPresence = (id: string | null | undefined, items: Record<string, unknown>) => {\n  if (id && !items[id]) {\n    throw new Error(`Node not found in the list (id: ${id})`);\n  }\n}\n\ntype PositionAssertionConfig = {\n  previousId: string | null,\n  list: HeadAndItems<LinkedListItem>,\n};\n\nexport const assertNewNodePosition = <T extends LinkedListItem>(item: T, config: PositionAssertionConfig) => {\n  const { previousId, list } = config;\n\n  const insertionMiddleError = previousId && list.items[previousId].nextId !== item.nextId;\n  const insertionTailError = previousId && item.nextId === null && list.items[previousId].nextId !== null;\n  const insertionHeadError = previousId === null && item.nextId !== list.headId;\n\n  if (insertionMiddleError || insertionTailError || insertionHeadError) {\n    throw new Error(`Invalid position for given node (id: ${item.id})`);\n  }\n}"],"names":[],"mappings":";;MAwBa,kBAAkB,GAAG,CAChC,QAAiC,EACjC,MAA6B,KAC3B;;IACF,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,SAAS,EAAE,GAAG,MAAM,CAAC;AAC7C,IAAA,MAAM,OAAO,GAAG,IAAI,GAAG,EAAE,CAAC;IAC1B,MAAM,UAAU,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC;AAE7C,IAAA,MAAM,EAAE,cAAc,EAAE,MAAM,EAAE,GAAG,QAAQ,CAAC;QAC1C,cAAc,EAAE,UAAU,GAAG,CAAC;AAC9B,QAAA,YAAY,EAAE;AACZ,YAAA,SAAS,EAAE,OAAO;AAClB,YAAA,WAAW,EAAE,SAAS;AACtB,YAAA,OAAO,EAAE;AACP,gBAAA,IAAI,EAAE,KAAK;AACZ,aAAA;AACuB,SAAA;QAC1B,SAAS,EAAE,CAAC,EAAE,OAAO,EAAE,SAAS,EAAE,KAAI;YACpC,MAAM,IAAI,GAAG,OAAO,KAAA,IAAA,IAAP,OAAO,KAAP,KAAA,CAAA,GAAA,KAAA,CAAA,GAAA,OAAO,CAAE,IAAI,CAAC;AAC3B,YAAA,MAAM,UAAU,GAAG,IAAI,KAAK,SAAS,GAAG,KAAK,GAAG,IAAI,CAAC;AAErD;;AAEG;AACH,YAAA,OAAO,CAAC,UAAU,IAAI,SAAS,KAAK,IAAI,CAAC;SAC1C;AACD,QAAA,QAAQ,EAAE,CAAC,OAAO,KAAI;YACpB,IAAI,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE;AAClC,gBAAA,MAAM,IAAI,KAAK,CAAC,qBAAqB,CAAC,CAAC;AACxC,aAAA;AAED,YAAA,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;YAE/B,MAAM,WAAW,GAAG,KAAK,CAAC,OAAO,CAAC,SAAU,CAAC,CAAC;YAE9C,IAAI,CAAC,WAAW,EAAE;AAChB,gBAAA,MAAM,IAAI,KAAK,CAAC,qBAAqB,CAAC,CAAC;AACxC,aAAA;AAED,YAAA,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,GAAG,QAAQ,CAAC,OAAO,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC;YAEvE,OAAO;AACL,gBAAA,WAAW,EAAE,MAAM;gBACnB,SAAS,EAAE,WAAW,CAAC,MAAM;AAC7B,gBAAA,OAAO,EAAE,OAAO;aACjB,CAAC;SACH;AACF,KAAA,CAAC,CAAC;AAEH;;;AAGG;AACH,IAAA,IAAI,cAAc,KAAK,UAAU,IAAI,CAAA,CAAA,EAAA,GAAA,MAAM,CAAC,OAAO,MAAA,IAAA,IAAA,EAAA,KAAA,KAAA,CAAA,GAAA,KAAA,CAAA,GAAA,EAAA,CAAE,IAAI,MAAK,IAAI,EAAE;AAClE,QAAA,MAAM,IAAI,KAAK,CAAC,sBAAsB,CAAC,CAAC;AACzC,KAAA;IAED,OAAO,MAAM,CAAC,WAAW,CAAC;AAC5B,EAAE;MAEW,cAAc,GAAG,CAA2B,EAAiB,EAAE,IAAqB,KAAI;AACnG,IAAA,IAAI,EAAE,KAAK,IAAI,CAAC,MAAM,EAAE;AACtB,QAAA,OAAO,IAAI,CAAC;AACb,KAAA;AAED,IAAA,OAAO,kBAAkB,CACvB,CAAC,GAAG,EAAE,OAAO,KAAI;AACf,QAAA,IAAI,OAAO,CAAC,MAAM,KAAK,EAAE,EAAE;YACzB,OAAO;gBACL,MAAM,EAAE,OAAO,CAAC,EAAE;AAClB,gBAAA,OAAO,EAAE;AACP,oBAAA,IAAI,EAAE,IAAI;AACX,iBAAA;aACF,CAAC;AACH,SAAA;QAED,OAAO;AACL,YAAA,MAAM,EAAE,GAAG;SACZ,CAAA;AACH,KAAC,EACD;AACE,QAAA,SAAS,EAAE,IAAqB;QAChC,OAAO,EAAE,IAAI,CAAC,MAAM;QACpB,KAAK,EAAE,IAAI,CAAC,KAAK;AAClB,KAAA,CACF,CAAA;AACH,EAAE;MAEW,uBAAuB,GAAG,CAA2B,IAAO,EAAE,gBAAyB,KAAI;IACtG,MAAM,2BAA2B,GAAG,IAAI,CAAC,UAAU,KAAK,SAAS,IAAI,gBAAgB,CAAC;IACtF,MAAM,0BAA0B,GAAG,IAAI,CAAC,UAAU,KAAK,SAAS,IAAI,CAAC,gBAAgB,CAAC;IAEtF,IAAI,2BAA2B,IAAI,0BAA0B,EAAE;QAC7D,MAAM,IAAI,KAAK,CAAC,CAAA,wCAAA,EAA2C,IAAI,CAAC,EAAE,CAAG,CAAA,CAAA,CAAC,CAAC;AACxE,KAAA;AACH,EAAC;MAEY,cAAc,GAAG,CAAC,EAA6B,EAAE,KAA8B,KAAI;AAC9F,IAAA,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE;AACpB,QAAA,MAAM,IAAI,KAAK,CAAC,mCAAmC,EAAE,CAAA,CAAA,CAAG,CAAC,CAAC;AAC3D,KAAA;AACH,EAAC;MAOY,qBAAqB,GAAG,CAA2B,IAAO,EAAE,MAA+B,KAAI;AAC1G,IAAA,MAAM,EAAE,UAAU,EAAE,IAAI,EAAE,GAAG,MAAM,CAAC;AAEpC,IAAA,MAAM,oBAAoB,GAAG,UAAU,IAAI,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM,CAAC;IACzF,MAAM,kBAAkB,GAAG,UAAU,IAAI,IAAI,CAAC,MAAM,KAAK,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,MAAM,KAAK,IAAI,CAAC;AACxG,IAAA,MAAM,kBAAkB,GAAG,UAAU,KAAK,IAAI,IAAI,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM,CAAC;AAE9E,IAAA,IAAI,oBAAoB,IAAI,kBAAkB,IAAI,kBAAkB,EAAE;QACpE,MAAM,IAAI,KAAK,CAAC,CAAA,qCAAA,EAAwC,IAAI,CAAC,EAAE,CAAG,CAAA,CAAA,CAAC,CAAC;AACrE,KAAA;AACH;;;;"}

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

@@ -0,0 +1,2 @@
+import { ReduceCallback, LinkedListItem, HeadAndItems } from './type';
+export declare const reduceLinkedList: <Item extends LinkedListItem, Result>(cb: ReduceCallback<Item, Result>, initValue: Result, list: HeadAndItems<Item>) => Result;

package/linked-list/reduce-linked-list.js

@@ -0,0 +1,17 @@
+import { walkListItemRecord } from './linked-list-utils.js';
+
+const reduceLinkedList = (cb, initValue, list) => {
+    const { items, headId } = list;
+    return walkListItemRecord((acc, current) => {
+        return {
+            result: cb(acc, current),
+        };
+    }, {
+        startId: headId,
+        items,
+        initValue,
+    });
+};
+
+export { reduceLinkedList };
+//# sourceMappingURL=reduce-linked-list.js.map

package/linked-list/reduce-linked-list.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"reduce-linked-list.js","sources":["../../src/linked-list/reduce-linked-list.ts"],"sourcesContent":["import { ReduceCallback, LinkedListItem, HeadAndItems } from './type';\nimport { walkListItemRecord } from './linked-list-utils';\n\nexport const reduceLinkedList = <Item extends LinkedListItem, Result>(\n  cb: ReduceCallback<Item, Result>,\n  initValue: Result,\n  list: HeadAndItems<Item>,\n): Result => {\n  const { items, headId } = list;\n\n  return walkListItemRecord((acc, current) => {\n    return {\n      result: cb(acc, current),\n    };\n  }, {\n    startId: headId,\n    items,\n    initValue,\n  });\n};\n"],"names":[],"mappings":";;AAGa,MAAA,gBAAgB,GAAG,CAC9B,EAAgC,EAChC,SAAiB,EACjB,IAAwB,KACd;AACV,IAAA,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC;AAE/B,IAAA,OAAO,kBAAkB,CAAC,CAAC,GAAG,EAAE,OAAO,KAAI;QACzC,OAAO;AACL,YAAA,MAAM,EAAE,EAAE,CAAC,GAAG,EAAE,OAAO,CAAC;SACzB,CAAC;AACJ,KAAC,EAAE;AACD,QAAA,OAAO,EAAE,MAAM;QACf,KAAK;QACL,SAAS;AACV,KAAA,CAAC,CAAC;AACL;;;;"}

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

@@ -0,0 +1,2 @@
+import { ManipulationConfig, LinkedListItem } from './type';
+export declare const removeLinkedList: <T extends LinkedListItem>(id: string, config: ManipulationConfig<T>) => import("./type").LinkedList<T>;

package/linked-list/remove-linked-list.js

@@ -0,0 +1,24 @@
+import { __rest } from '../_virtual/_tslib.js';
+import { assertPresence, findPreviousId } from './linked-list-utils.js';
+
+const removeLinkedList = (id, config) => {
+    const { isDoubleLinkList, list, factory } = config;
+    const _a = list.items, _b = id, itemToDelete = _a[_b], otherItems = __rest(_a, [typeof _b === "symbol" ? _b : _b + ""]);
+    assertPresence(id, list.items);
+    const previousId = isDoubleLinkList
+        ? itemToDelete.previousId
+        : findPreviousId(id, list);
+    const newHeadId = previousId === null ? itemToDelete.nextId : list.headId;
+    const newItems = Object.assign(Object.assign(Object.assign({}, otherItems), (previousId ? {
+        [previousId]: Object.assign(Object.assign({}, otherItems[previousId]), { nextId: itemToDelete.nextId }),
+    } : {})), (isDoubleLinkList && itemToDelete.nextId ? {
+        [itemToDelete.nextId]: Object.assign(Object.assign({}, otherItems[itemToDelete.nextId]), (isDoubleLinkList ? { previousId } : {}))
+    } : {}));
+    return factory({
+        headId: newHeadId,
+        items: newItems,
+    });
+};
+
+export { removeLinkedList };
+//# sourceMappingURL=remove-linked-list.js.map

package/linked-list/remove-linked-list.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"remove-linked-list.js","sources":["../../src/linked-list/remove-linked-list.ts"],"sourcesContent":["import { ManipulationConfig, LinkedListItem } from './type';\nimport { assertPresence, findPreviousId } from './linked-list-utils';\n\nexport const removeLinkedList = <T extends LinkedListItem>(id: string, config: ManipulationConfig<T>) => {\n  const { isDoubleLinkList, list, factory } = config;\n  const { [id]: itemToDelete, ...otherItems } = list.items;\n\n  assertPresence(id, list.items);\n\n  const previousId = isDoubleLinkList\n    ? itemToDelete.previousId!\n    : findPreviousId(id, list);\n\n  const newHeadId = previousId === null ? itemToDelete.nextId : list.headId;\n  const newItems = {\n    ...otherItems,\n    ...(previousId ? {\n      [previousId]: {\n        ...otherItems[previousId],\n        nextId: itemToDelete.nextId,\n      },\n    } : {}),\n    ...(isDoubleLinkList && itemToDelete.nextId ? {\n      [itemToDelete.nextId]: {\n        ...otherItems[itemToDelete.nextId],\n        ...(isDoubleLinkList ? { previousId } : {}),\n      }\n    } : {}),\n  };\n\n  return factory({\n    headId: newHeadId,\n    items: newItems,\n  });\n};"],"names":[],"mappings":";;;MAGa,gBAAgB,GAAG,CAA2B,EAAU,EAAE,MAA6B,KAAI;IACtG,MAAM,EAAE,gBAAgB,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,MAAM,CAAC;AACnD,IAAA,MAA8C,EAAA,GAAA,IAAI,CAAC,KAAK,EAAhD,EAAC,GAAA,EAAG,EAAE,YAAY,SAAA,EAAK,UAAU,GAAnC,MAAA,CAAA,EAAA,EAAA,CAAA,OAAA,EAAA,KAAA,QAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,CAAqC,CAAa,CAAC;AAEzD,IAAA,cAAc,CAAC,EAAE,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;IAE/B,MAAM,UAAU,GAAG,gBAAgB;UAC/B,YAAY,CAAC,UAAW;AAC1B,UAAE,cAAc,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;AAE7B,IAAA,MAAM,SAAS,GAAG,UAAU,KAAK,IAAI,GAAG,YAAY,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;IAC1E,MAAM,QAAQ,iDACT,UAAU,CAAA,GACT,UAAU,GAAG;AACf,QAAA,CAAC,UAAU,GACN,MAAA,CAAA,MAAA,CAAA,MAAA,CAAA,MAAA,CAAA,EAAA,EAAA,UAAU,CAAC,UAAU,CAAC,CAAA,EAAA,EACzB,MAAM,EAAE,YAAY,CAAC,MAAM,EAC5B,CAAA;AACF,KAAA,GAAG,EAAE,EACH,GAAC,gBAAgB,IAAI,YAAY,CAAC,MAAM,GAAG;QAC5C,CAAC,YAAY,CAAC,MAAM,GAAC,MAAA,CAAA,MAAA,CAAA,MAAA,CAAA,MAAA,CAAA,EAAA,EAChB,UAAU,CAAC,YAAY,CAAC,MAAM,CAAC,CAAA,GAC9B,gBAAgB,GAAG,EAAE,UAAU,EAAE,GAAG,EAAE,EAC3C;AACF,KAAA,GAAG,EAAE,EACP,CAAC;AAEF,IAAA,OAAO,OAAO,CAAC;AACb,QAAA,MAAM,EAAE,SAAS;AACjB,QAAA,KAAK,EAAE,QAAQ;AAChB,KAAA,CAAC,CAAC;AACL;;;;"}

package/linked-list/type.d.ts

@@ -0,0 +1,34 @@
+export declare type LinkedListItem = {
+    id: string;
+    nextId: string | null;
+    previousId?: string | null;
+};
+export declare type HeadAndItems<T extends LinkedListItem> = {
+    headId: string | null;
+    items: {
+        [id: string]: T;
+    };
+};
+export declare type ReduceCallback<Item, Result> = (accumulator: Result, current: Item) => Result;
+export declare type ItemPredicate<Item> = (item: Item) => boolean;
+export declare type ManipulationConfig<T extends LinkedListItem> = {
+    isDoubleLinkList: boolean;
+    list: HeadAndItems<T>;
+    factory: (list: HeadAndItems<T>) => LinkedList<T>;
+};
+export declare type LinkedList<T extends LinkedListItem> = {
+    readonly head: T | null;
+    readonly items: {
+        [id: string]: T;
+    };
+    readonly size: number;
+    readonly isDoubleLinked: boolean;
+    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/linked-list/update-linked-list.d.ts

@@ -0,0 +1,2 @@
+import { ManipulationConfig, LinkedListItem } from './type';
+export declare const updateLinkedList: <T extends LinkedListItem>(item: T, config: ManipulationConfig<T>) => import("./type").LinkedList<T>;

package/linked-list/update-linked-list.js

@@ -0,0 +1,20 @@
+import { __rest } from '../_virtual/_tslib.js';
+import { assertPresence } from './linked-list-utils.js';
+
+const updateLinkedList = (item, config) => {
+    const { list, factory } = config;
+    assertPresence(item.id, list.items);
+    /**
+     * This method should not update any ids.
+     */
+    const updatableProperties = __rest(item, ["nextId", "previousId", "id"]);
+    const currentItem = list.items[item.id];
+    const newItems = Object.assign(Object.assign({}, list.items), { [item.id]: Object.assign(Object.assign({}, currentItem), updatableProperties) });
+    return factory({
+        headId: list.headId,
+        items: newItems,
+    });
+};
+
+export { updateLinkedList };
+//# sourceMappingURL=update-linked-list.js.map

package/linked-list/update-linked-list.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"update-linked-list.js","sources":["../../src/linked-list/update-linked-list.ts"],"sourcesContent":["import { ManipulationConfig, LinkedListItem } from './type';\nimport { assertPresence } from './linked-list-utils';\n\nexport const updateLinkedList = <T extends LinkedListItem>(item: T,  config: ManipulationConfig<T>) => {\n  const { list, factory } = config;\n\n  assertPresence(item.id, list.items);\n\n  /**\n   * This method should not update any ids.\n   */\n  const { nextId, previousId, id, ...updatableProperties } = item;\n  const currentItem = list.items[item.id];\n\n  const newItems = {\n    ...list.items,\n    [item.id]: {\n      ...currentItem,\n      ...updatableProperties,\n    },\n  };\n\n  return factory({\n    headId: list.headId,\n    items: newItems,\n  });\n};\n"],"names":[],"mappings":";;;MAGa,gBAAgB,GAAG,CAA2B,IAAO,EAAG,MAA6B,KAAI;AACpG,IAAA,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,MAAM,CAAC;IAEjC,cAAc,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;AAEpC;;AAEG;AACH,IAAA,MAAmC,mBAAmB,GAAK,MAAA,CAAA,IAAI,EAAzD,CAAA,QAAA,EAAA,YAAA,EAAA,IAAA,CAAkD,EAAQ;IAChE,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;AAExC,IAAA,MAAM,QAAQ,GACT,MAAA,CAAA,MAAA,CAAA,MAAA,CAAA,MAAA,CAAA,EAAA,EAAA,IAAI,CAAC,KAAK,KACb,CAAC,IAAI,CAAC,EAAE,GACH,MAAA,CAAA,MAAA,CAAA,MAAA,CAAA,MAAA,CAAA,EAAA,EAAA,WAAW,CACX,EAAA,mBAAmB,IAEzB,CAAC;AAEF,IAAA,OAAO,OAAO,CAAC;QACb,MAAM,EAAE,IAAI,CAAC,MAAM;AACnB,QAAA,KAAK,EAAE,QAAQ;AAChB,KAAA,CAAC,CAAC;AACL;;;;"}

package/linked-list/walk-list-item-record.d.ts

@@ -0,0 +1,15 @@
+import { LinkedListItem } from './type';
+export declare type WalkConfig<T extends LinkedListItem, Result> = {
+    startId: string | null;
+    items: Record<string, T>;
+    initValue: Result;
+};
+declare type WalkCallbackResult<R> = {
+    result: R;
+    control?: {
+        stop?: boolean;
+    };
+};
+export declare type WalkCallback<Item, Result> = (accumulator: Result, current: Item) => WalkCallbackResult<Result>;
+export declare const walkListItemRecord: <T extends LinkedListItem, Result>(callback: WalkCallback<T, Result>, config: WalkConfig<T, Result>) => Result;
+export {};

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

@@ -0,0 +1,2 @@
+import { LinkedListItem, ItemPredicate, HeadAndItems } from './type';
+export declare const whileLinkedList: <Item extends LinkedListItem>(predicate: ItemPredicate<Item>, list: HeadAndItems<Item>, startId?: string) => string[];

package/linked-list/while-linked-list.js

@@ -0,0 +1,28 @@
+import { walkListItemRecord } from './linked-list-utils.js';
+
+const whileLinkedList = (predicate, list, startId) => {
+    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: [],
+        startId: startId || list.headId,
+        items: list.items,
+    });
+};
+
+export { whileLinkedList };
+//# sourceMappingURL=while-linked-list.js.map

package/linked-list/while-linked-list.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"while-linked-list.js","sources":["../../src/linked-list/while-linked-list.ts"],"sourcesContent":["\n\nimport { LinkedListItem, ItemPredicate, HeadAndItems } from './type';\nimport { walkListItemRecord } from './linked-list-utils';\n\nexport const whileLinkedList = <Item extends LinkedListItem>(\n  predicate: ItemPredicate<Item>,\n  list: HeadAndItems<Item>,\n  startId?: string,\n): string[] => {\n  if (startId && !list.items[startId]) {\n    throw new Error('Cannot start from a node that does not exist');\n  }\n\n  return walkListItemRecord(\n    (acc, item) => {\n      const itemMatched = predicate(item);\n\n      if (itemMatched) {\n        return {\n          result: [...acc, item.id],\n        };\n      }\n\n      return {\n        result: acc,\n        control: {\n          stop: true,\n        },\n      };\n    }, {\n      initValue: [] as string[],\n      startId: startId || list.headId,\n      items: list.items,\n    },\n  );\n};\n"],"names":[],"mappings":";;AAKa,MAAA,eAAe,GAAG,CAC7B,SAA8B,EAC9B,IAAwB,EACxB,OAAgB,KACJ;IACZ,IAAI,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE;AACnC,QAAA,MAAM,IAAI,KAAK,CAAC,8CAA8C,CAAC,CAAC;AACjE,KAAA;AAED,IAAA,OAAO,kBAAkB,CACvB,CAAC,GAAG,EAAE,IAAI,KAAI;AACZ,QAAA,MAAM,WAAW,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;AAEpC,QAAA,IAAI,WAAW,EAAE;YACf,OAAO;gBACL,MAAM,EAAE,CAAC,GAAG,GAAG,EAAE,IAAI,CAAC,EAAE,CAAC;aAC1B,CAAC;AACH,SAAA;QAED,OAAO;AACL,YAAA,MAAM,EAAE,GAAG;AACX,YAAA,OAAO,EAAE;AACP,gBAAA,IAAI,EAAE,IAAI;AACX,aAAA;SACF,CAAC;AACJ,KAAC,EAAE;AACD,QAAA,SAAS,EAAE,EAAc;AACzB,QAAA,OAAO,EAAE,OAAO,IAAI,IAAI,CAAC,MAAM;QAC/B,KAAK,EAAE,IAAI,CAAC,KAAK;AAClB,KAAA,CACF,CAAC;AACJ;;;;"}

package/math/clamp-number.d.ts

@@ -0,0 +1,2 @@
+import type { NumberRange } from './number-range';
+export declare const clampNumber: (num: number, { min, max }: NumberRange) => number;

package/math/clamp-number.js

@@ -0,0 +1,9 @@
+import { assertNumberRange } from './number-range.js';
+
+const clampNumber = (num, { min, max }) => {
+    assertNumberRange({ min, max });
+    return Math.min(Math.max(num, min), max);
+};
+
+export { clampNumber };
+//# sourceMappingURL=clamp-number.js.map

package/math/clamp-number.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"clamp-number.js","sources":["../../src/math/clamp-number.ts"],"sourcesContent":["import { assertNumberRange } from './number-range';\nimport type { NumberRange } from './number-range';\n\nexport const clampNumber = (num: number, { min, max }: NumberRange) => {\n  assertNumberRange({ min, max });\n\n  return Math.min(Math.max(num, min), max);\n};"],"names":[],"mappings":";;AAGO,MAAM,WAAW,GAAG,CAAC,GAAW,EAAE,EAAE,GAAG,EAAE,GAAG,EAAe,KAAI;AACpE,IAAA,iBAAiB,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;AAEhC,IAAA,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC;AAC3C;;;;"}

package/math/index.d.ts

@@ -0,0 +1,4 @@
+export * from './clamp-number';
+export * from './interpolate';
+export * from './number-range';
+export * from './random-number';

package/math/index.js

@@ -0,0 +1,5 @@
+export { clampNumber } from './clamp-number.js';
+export { interpolate } from './interpolate.js';
+export { assertNumberRange, isNumberInRange } from './number-range.js';
+export { randomNumber } from './random-number.js';
+//# sourceMappingURL=index.js.map

package/math/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":[],"sourcesContent":[],"names":[],"mappings":";;;"}

package/math/interpolate.d.ts

@@ -0,0 +1,2 @@
+export declare type RangeArray = [number, number];
+export declare const interpolate: (num: number, inputRange: RangeArray, outputRange: RangeArray) => number;

package/math/interpolate.js

@@ -0,0 +1,16 @@
+import { isNumberInRange } from './number-range.js';
+
+const interpolate = (num, inputRange, outputRange) => {
+    const [x1, x2] = inputRange;
+    const [y1, y2] = outputRange;
+    if (x1 > x2) {
+        throw new Error('interpolate: inputRange[0] should not be superior to inputRange[1]');
+    }
+    if (!isNumberInRange(num, { min: x1, max: x2 })) {
+        throw new Error(`interpolate: input number {${num}} is not in range of {${x1}}-{${x2}}`);
+    }
+    return y1 + ((num - x1) / (x2 - x1)) * (y2 - y1);
+};
+
+export { interpolate };
+//# sourceMappingURL=interpolate.js.map

package/math/interpolate.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"interpolate.js","sources":["../../src/math/interpolate.ts"],"sourcesContent":["import { isNumberInRange } from './number-range';\n\nexport type RangeArray = [number, number];\n\nexport const interpolate = (num: number, inputRange: RangeArray, outputRange: RangeArray) => {\n  const [x1, x2] = inputRange;\n  const [y1, y2] = outputRange;\n\n  if (x1 > x2) {\n    throw new Error('interpolate: inputRange[0] should not be superior to inputRange[1]');\n  }\n\n  if (!isNumberInRange(num, { min: x1, max: x2 })) {\n    throw new Error(`interpolate: input number {${num}} is not in range of {${x1}}-{${x2}}`);\n  }\n\n  return y1 + ((num - x1) / (x2 - x1)) * (y2 - y1);\n};"],"names":[],"mappings":";;AAIa,MAAA,WAAW,GAAG,CAAC,GAAW,EAAE,UAAsB,EAAE,WAAuB,KAAI;AAC1F,IAAA,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,UAAU,CAAC;AAC5B,IAAA,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,WAAW,CAAC;IAE7B,IAAI,EAAE,GAAG,EAAE,EAAE;AACX,QAAA,MAAM,IAAI,KAAK,CAAC,oEAAoE,CAAC,CAAC;AACvF,KAAA;AAED,IAAA,IAAI,CAAC,eAAe,CAAC,GAAG,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,EAAE;QAC/C,MAAM,IAAI,KAAK,CAAC,CAA8B,2BAAA,EAAA,GAAG,CAAyB,sBAAA,EAAA,EAAE,CAAM,GAAA,EAAA,EAAE,CAAG,CAAA,CAAA,CAAC,CAAC;AAC1F,KAAA;IAED,OAAO,EAAE,GAAG,CAAC,CAAC,GAAG,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC;AACnD;;;;"}

package/math/number-range.d.ts

@@ -0,0 +1,6 @@
+export declare type NumberRange = {
+    min: number;
+    max: number;
+};
+export declare const assertNumberRange: (range: NumberRange) => void;
+export declare const isNumberInRange: (num: number, { min, max }: NumberRange) => boolean;

package/math/number-range.js

@@ -0,0 +1,12 @@
+const assertNumberRange = (range) => {
+    if (range.min > range.max) {
+        throw new Error('Invalid number range: min must be lower than or equal to max');
+    }
+};
+const isNumberInRange = (num, { min, max }) => {
+    assertNumberRange({ min, max });
+    return num >= min && num <= max;
+};
+
+export { assertNumberRange, isNumberInRange };
+//# sourceMappingURL=number-range.js.map

package/math/number-range.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"number-range.js","sources":["../../src/math/number-range.ts"],"sourcesContent":["export type NumberRange = {\n  min: number,\n  max: number,\n};\n\nexport const assertNumberRange = (range: NumberRange) => {\n  if (range.min > range.max) {\n    throw new Error('Invalid number range: min must be lower than or equal to max');\n  }\n};\n\nexport const isNumberInRange = (num: number, { min, max }: NumberRange) => {\n  assertNumberRange({ min, max });\n\n  return num >= min && num <= max;\n};\n"],"names":[],"mappings":"AAKa,MAAA,iBAAiB,GAAG,CAAC,KAAkB,KAAI;AACtD,IAAA,IAAI,KAAK,CAAC,GAAG,GAAG,KAAK,CAAC,GAAG,EAAE;AACzB,QAAA,MAAM,IAAI,KAAK,CAAC,8DAA8D,CAAC,CAAC;AACjF,KAAA;AACH,EAAE;AAEK,MAAM,eAAe,GAAG,CAAC,GAAW,EAAE,EAAE,GAAG,EAAE,GAAG,EAAe,KAAI;AACxE,IAAA,iBAAiB,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;AAEhC,IAAA,OAAO,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,CAAC;AAClC;;;;"}

package/math/random-number.d.ts

@@ -0,0 +1,2 @@
+import type { NumberRange } from './number-range';
+export declare const randomNumber: ({ min, max }: NumberRange) => number;