@sparted/shared-library 0.0.15 → 0.0.17
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/linked-list/create-linked-list.js +8 -8
- package/linked-list/create-linked-list.js.map +1 -1
- package/linked-list/find-linked-list.d.ts +2 -2
- package/linked-list/find-linked-list.js.map +1 -1
- package/linked-list/get-linked-list.d.ts +2 -2
- package/linked-list/get-linked-list.js.map +1 -1
- package/linked-list/insert-linked-list.js +6 -5
- package/linked-list/insert-linked-list.js.map +1 -1
- package/linked-list/linked-list-utils.d.ts +4 -4
- package/linked-list/linked-list-utils.js +11 -12
- package/linked-list/linked-list-utils.js.map +1 -1
- package/linked-list/reduce-linked-list.d.ts +2 -2
- package/linked-list/reduce-linked-list.js.map +1 -1
- package/linked-list/remove-linked-list.js +2 -1
- package/linked-list/remove-linked-list.js.map +1 -1
- package/linked-list/type.d.ts +6 -5
- package/linked-list/while-linked-list.d.ts +2 -2
- package/linked-list/while-linked-list.js.map +1 -1
- package/package.json +1 -1
- package/linked-list/walk-list-item-record.d.ts +0 -15
|
@@ -18,23 +18,23 @@ const createLinkedList = (headId, items) => {
|
|
|
18
18
|
throw new Error('Cannot find the head.');
|
|
19
19
|
}
|
|
20
20
|
const list = { headId, items };
|
|
21
|
-
const {
|
|
21
|
+
const { format, count } = linkedListUtils.walkListItemRecord((acc, current) => {
|
|
22
22
|
const newCount = acc.count + 1;
|
|
23
|
-
const
|
|
24
|
-
const incompatibleFormats = acc.
|
|
25
|
-
if (incompatibleFormats || (
|
|
23
|
+
const currentNodeFormat = current.previousId !== undefined ? 'double' : 'single';
|
|
24
|
+
const incompatibleFormats = acc.format !== null && acc.format !== currentNodeFormat;
|
|
25
|
+
if (incompatibleFormats || (currentNodeFormat === 'double' && current.previousId !== acc.previousId)) {
|
|
26
26
|
throw new Error('Invalid previous node in the linked list');
|
|
27
27
|
}
|
|
28
28
|
return {
|
|
29
29
|
result: {
|
|
30
30
|
previousId: current.id,
|
|
31
|
+
format: currentNodeFormat,
|
|
31
32
|
count: newCount,
|
|
32
|
-
isDoubleLinked,
|
|
33
33
|
}
|
|
34
34
|
};
|
|
35
35
|
}, {
|
|
36
36
|
initValue: {
|
|
37
|
-
|
|
37
|
+
format: null,
|
|
38
38
|
count: 0,
|
|
39
39
|
previousId: null,
|
|
40
40
|
},
|
|
@@ -46,14 +46,14 @@ const createLinkedList = (headId, items) => {
|
|
|
46
46
|
/**
|
|
47
47
|
* At this point isDoubleLinked cannot be undefined
|
|
48
48
|
*/
|
|
49
|
-
|
|
49
|
+
format,
|
|
50
50
|
list,
|
|
51
51
|
};
|
|
52
52
|
const linkedList = {
|
|
53
53
|
head,
|
|
54
54
|
items,
|
|
55
|
+
format,
|
|
55
56
|
size: count,
|
|
56
|
-
isDoubleLinked: isDoubleLinked,
|
|
57
57
|
reduce: (cb, initValue) => reduceLinkedList.reduceLinkedList(cb, initValue, list),
|
|
58
58
|
find: (predicate) => findLinkedList.findLinkedList(predicate, list),
|
|
59
59
|
while: (predicate, startId) => whileLinkedList.whileLinkedList(predicate, list, startId),
|
|
@@ -1 +1 @@
|
|
|
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
|
|
1
|
+
{"version":3,"file":"create-linked-list.js","sources":["../../src/linked-list/create-linked-list.ts"],"sourcesContent":["import { LinkedListItem, LinkedList, ManipulationConfig, LinkedListFormat } 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 format: LinkedListFormat | null,\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 { format, count } = walkListItemRecord((acc, current) => {\n const newCount = acc.count + 1;\n const currentNodeFormat: LinkedListFormat = current.previousId !== undefined ? 'double' : 'single';\n const incompatibleFormats = acc.format !== null && acc.format !== currentNodeFormat;\n\n if (incompatibleFormats || (currentNodeFormat === 'double' && 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 format: currentNodeFormat,\n count: newCount,\n }\n }\n }, {\n initValue: {\n format: null,\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 format,\n list,\n };\n\n const linkedList: LinkedList<T> = {\n head,\n items,\n format,\n size: count,\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":["walkListItemRecord","reduceLinkedList","findLinkedList","whileLinkedList","removeLinkedList","insertLinkedList","getLinkedList","updateLinkedList","applyDiffLinkedList"],"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,MAAM,EAAE,KAAK,EAAE,GAAGA,kCAAkB,CAAC,CAAC,GAAG,EAAE,OAAO,KAAI;AAC5D,QAAA,MAAM,QAAQ,GAAG,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC;AAC/B,QAAA,MAAM,iBAAiB,GAAqB,OAAO,CAAC,UAAU,KAAK,SAAS,GAAG,QAAQ,GAAG,QAAQ,CAAC;AACnG,QAAA,MAAM,mBAAmB,GAAG,GAAG,CAAC,MAAM,KAAK,IAAI,IAAI,GAAG,CAAC,MAAM,KAAK,iBAAiB,CAAC;AAEpF,QAAA,IAAI,mBAAmB,KAAK,iBAAiB,KAAK,QAAQ,IAAI,OAAO,CAAC,UAAU,KAAK,GAAG,CAAC,UAAU,CAAC,EAAE;AACpG,YAAA,MAAM,IAAI,KAAK,CAAC,0CAA0C,CAAC,CAAC;AAC7D,SAAA;QAED,OAAO;AACL,YAAA,MAAM,EAAE;gBACN,UAAU,EAAE,OAAO,CAAC,EAAE;AACtB,gBAAA,MAAM,EAAE,iBAAiB;AACzB,gBAAA,KAAK,EAAE,QAAQ;AAChB,aAAA;SACF,CAAA;AACH,KAAC,EAAE;AACD,QAAA,SAAS,EAAE;AACT,YAAA,MAAM,EAAE,IAAI;AACZ,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;QACH,MAAM;QACN,IAAI;KACL,CAAC;AAEF,IAAA,MAAM,UAAU,GAAkB;QAChC,IAAI;QACJ,KAAK;QACL,MAAM;AACN,QAAA,IAAI,EAAE,KAAK;AACX,QAAA,MAAM,EAAE,CAAC,EAAE,EAAE,SAAS,KAAKC,iCAAgB,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,CAAC;QAChE,IAAI,EAAE,CAAC,SAAS,KAAKC,6BAAc,CAAC,SAAS,EAAE,IAAI,CAAC;AACpD,QAAA,KAAK,EAAE,CAAC,SAAS,EAAE,OAAO,KAAKC,+BAAe,CAAC,SAAS,EAAE,IAAI,EAAE,OAAO,CAAC;QACxE,MAAM,EAAE,CAAC,EAAE,KAAKC,iCAAgB,CAAC,EAAE,EAAE,kBAAkB,CAAC;QACxD,MAAM,EAAE,CAAC,IAAI,KAAKC,iCAAgB,CAAC,IAAI,EAAE,kBAAkB,CAAC;QAC5D,GAAG,EAAE,CAAC,EAAE,KAAKC,2BAAa,CAAC,EAAE,EAAE,IAAI,CAAC;QACpC,MAAM,EAAE,CAAC,IAAI,KAAKC,iCAAgB,CAAC,IAAI,EAAE,kBAAkB,CAAC;AAC5D,QAAA,SAAS,EAAE,CAAC,MAAM,EAAE,KAAK,KAAKC,uCAAmB,CAAC,MAAM,EAAE,KAAK,EAAE,UAAU,CAAC;KAC7E,CAAC;AAEF,IAAA,OAAO,UAAU,CAAC;AACpB;;;;"}
|
|
@@ -1,2 +1,2 @@
|
|
|
1
|
-
import { LinkedListItem, ItemPredicate,
|
|
2
|
-
export declare const findLinkedList: <Item extends LinkedListItem>(predicate: ItemPredicate<Item>, list:
|
|
1
|
+
import { LinkedListItem, ItemPredicate, SimpleLinkedList } from './type';
|
|
2
|
+
export declare const findLinkedList: <Item extends LinkedListItem>(predicate: ItemPredicate<Item>, list: SimpleLinkedList<Item>) => Item | null;
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"find-linked-list.js","sources":["../../src/linked-list/find-linked-list.ts"],"sourcesContent":["import { LinkedListItem, ItemPredicate,
|
|
1
|
+
{"version":3,"file":"find-linked-list.js","sources":["../../src/linked-list/find-linked-list.ts"],"sourcesContent":["import { LinkedListItem, ItemPredicate, SimpleLinkedList } from './type';\nimport { walkListItemRecord } from './linked-list-utils';\n\nexport const findLinkedList = <Item extends LinkedListItem>(\n predicate: ItemPredicate<Item>,\n list: SimpleLinkedList<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":["walkListItemRecord"],"mappings":";;;;;;MAGa,cAAc,GAAG,CAC5B,SAA8B,EAC9B,IAA4B,KACb;AAGf,IAAA,OAAOA,kCAAkB,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;;;;"}
|
|
@@ -1,2 +1,2 @@
|
|
|
1
|
-
import {
|
|
2
|
-
export declare const getLinkedList: <T extends LinkedListItem>(id: string, list:
|
|
1
|
+
import { SimpleLinkedList, LinkedListItem } from './type';
|
|
2
|
+
export declare const getLinkedList: <T extends LinkedListItem>(id: string, list: SimpleLinkedList<T>) => T | null;
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"get-linked-list.js","sources":["../../src/linked-list/get-linked-list.ts"],"sourcesContent":["import {
|
|
1
|
+
{"version":3,"file":"get-linked-list.js","sources":["../../src/linked-list/get-linked-list.ts"],"sourcesContent":["import { SimpleLinkedList, LinkedListItem } from './type';\n\nexport const getLinkedList = <T extends LinkedListItem>(id: string, list: SimpleLinkedList<T>) => {\n if (list.items[id]) {\n return list.items[id];\n }\n\n return null;\n}\n"],"names":[],"mappings":";;;;MAEa,aAAa,GAAG,CAA2B,EAAU,EAAE,IAAyB,KAAI;AAC/F,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;;;;"}
|
|
@@ -5,11 +5,12 @@ Object.defineProperty(exports, '__esModule', { value: true });
|
|
|
5
5
|
var linkedListUtils = require('./linked-list-utils.js');
|
|
6
6
|
|
|
7
7
|
const insertLinkedList = (item, config) => {
|
|
8
|
-
const {
|
|
9
|
-
linkedListUtils.assertItemCompatibility(item,
|
|
8
|
+
const { format, list, factory } = config;
|
|
9
|
+
linkedListUtils.assertItemCompatibility(item, format);
|
|
10
10
|
linkedListUtils.assertPresence(item.nextId, list.items);
|
|
11
11
|
linkedListUtils.assertPresence(item.previousId, list.items);
|
|
12
|
-
const
|
|
12
|
+
const hasPrevious = item.previousId !== undefined;
|
|
13
|
+
const previousId = hasPrevious
|
|
13
14
|
? item.previousId
|
|
14
15
|
: linkedListUtils.findPreviousId(item.nextId, list);
|
|
15
16
|
linkedListUtils.assertNewNodePosition(item, {
|
|
@@ -19,8 +20,8 @@ const insertLinkedList = (item, config) => {
|
|
|
19
20
|
const newHeadId = item.nextId === list.headId ? item.id : list.headId;
|
|
20
21
|
const newItems = Object.assign(Object.assign(Object.assign(Object.assign({}, list.items), (previousId ? {
|
|
21
22
|
[previousId]: Object.assign(Object.assign({}, list.items[previousId]), { nextId: item.id }),
|
|
22
|
-
} : {})), (
|
|
23
|
-
[item.nextId]: Object.assign(Object.assign({}, list.items[item.nextId]), (
|
|
23
|
+
} : {})), (hasPrevious && item.nextId ? {
|
|
24
|
+
[item.nextId]: Object.assign(Object.assign({}, list.items[item.nextId]), (hasPrevious ? { previousId: item.id } : {})),
|
|
24
25
|
} : {})), { [item.id]: item });
|
|
25
26
|
return factory({
|
|
26
27
|
headId: newHeadId,
|
|
@@ -1 +1 @@
|
|
|
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 {
|
|
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 { format, list, factory } = config;\n\n assertItemCompatibility(item, format);\n assertPresence(item.nextId, list.items);\n assertPresence(item.previousId, list.items);\n\n const hasPrevious = item.previousId !== undefined;\n\n const previousId = hasPrevious\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 ...(hasPrevious && item.nextId ? {\n [item.nextId]: {\n ...list.items[item.nextId],\n ...(hasPrevious ? { previousId: item.id } : {}),\n },\n } : {}),\n [item.id]: item,\n };\n\n return factory({\n headId: newHeadId,\n items: newItems,\n });\n};\n"],"names":["assertItemCompatibility","assertPresence","findPreviousId","assertNewNodePosition"],"mappings":";;;;;;MASa,gBAAgB,GAAG,CAA2B,IAAO,EAAE,MAA6B,KAAI;IACnG,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,MAAM,CAAC;AAEzC,IAAAA,uCAAuB,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IACtCC,8BAAc,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;IACxCA,8BAAc,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;AAE5C,IAAA,MAAM,WAAW,GAAG,IAAI,CAAC,UAAU,KAAK,SAAS,CAAC;IAElD,MAAM,UAAU,GAAG,WAAW;UAC1B,IAAI,CAAC,UAAW;UAChBC,8BAAc,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;IAEtCC,qCAAqB,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,WAAW,IAAI,IAAI,CAAC,MAAM,GAAG;AAC/B,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,WAAW,GAAG,EAAE,UAAU,EAAE,IAAI,CAAC,EAAE,EAAE,GAAG,EAAE,EAC/C;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;;;;"}
|
|
@@ -1,4 +1,4 @@
|
|
|
1
|
-
import { LinkedListItem,
|
|
1
|
+
import { LinkedListFormat, LinkedListItem, SimpleLinkedList } from './type';
|
|
2
2
|
export declare type WalkConfig<T extends LinkedListItem, Result> = {
|
|
3
3
|
startId: string | null;
|
|
4
4
|
items: Record<string, T>;
|
|
@@ -12,12 +12,12 @@ declare type WalkCallbackResult<R> = {
|
|
|
12
12
|
};
|
|
13
13
|
export declare type WalkCallback<Item, Result> = (accumulator: Result, current: Item) => WalkCallbackResult<Result>;
|
|
14
14
|
export declare const walkListItemRecord: <T extends LinkedListItem, Result>(callback: WalkCallback<T, Result>, config: WalkConfig<T, Result>) => Result;
|
|
15
|
-
export declare const findPreviousId: <T extends LinkedListItem>(id: string | null, list:
|
|
16
|
-
export declare const assertItemCompatibility: <T extends LinkedListItem>(item: T,
|
|
15
|
+
export declare const findPreviousId: <T extends LinkedListItem>(id: string | null, list: SimpleLinkedList<T>) => string | null;
|
|
16
|
+
export declare const assertItemCompatibility: <T extends LinkedListItem>(item: T, format: LinkedListFormat | null) => void;
|
|
17
17
|
export declare const assertPresence: (id: string | null | undefined, items: Record<string, unknown>) => void;
|
|
18
18
|
declare type PositionAssertionConfig = {
|
|
19
19
|
previousId: string | null;
|
|
20
|
-
list:
|
|
20
|
+
list: SimpleLinkedList<LinkedListItem>;
|
|
21
21
|
};
|
|
22
22
|
export declare const assertNewNodePosition: <T extends LinkedListItem>(item: T, config: PositionAssertionConfig) => void;
|
|
23
23
|
export {};
|
|
@@ -5,11 +5,10 @@ Object.defineProperty(exports, '__esModule', { value: true });
|
|
|
5
5
|
var runWhile = require('../fp/run-while.js');
|
|
6
6
|
|
|
7
7
|
const walkListItemRecord = (callback, config) => {
|
|
8
|
-
var _a;
|
|
9
8
|
const { items, startId, initValue } = config;
|
|
10
9
|
const visited = new Set();
|
|
11
10
|
const totalNodes = Object.keys(items).length;
|
|
12
|
-
const {
|
|
11
|
+
const { result } = runWhile.runWhile({
|
|
13
12
|
iterationLimit: totalNodes + 1,
|
|
14
13
|
initialValue: {
|
|
15
14
|
currentId: startId,
|
|
@@ -43,13 +42,6 @@ const walkListItemRecord = (callback, config) => {
|
|
|
43
42
|
};
|
|
44
43
|
},
|
|
45
44
|
});
|
|
46
|
-
/**
|
|
47
|
-
* When force stopping the walk, we will always have unvisited
|
|
48
|
-
* nodes, so we skip this check.
|
|
49
|
-
*/
|
|
50
|
-
if (iterationCount !== totalNodes && ((_a = result.control) === null || _a === void 0 ? void 0 : _a.stop) !== true) {
|
|
51
|
-
throw new Error('Isolated nodes found');
|
|
52
|
-
}
|
|
53
45
|
return result.accumulator;
|
|
54
46
|
};
|
|
55
47
|
const findPreviousId = (id, list) => {
|
|
@@ -74,9 +66,16 @@ const findPreviousId = (id, list) => {
|
|
|
74
66
|
items: list.items,
|
|
75
67
|
});
|
|
76
68
|
};
|
|
77
|
-
const assertItemCompatibility = (item,
|
|
78
|
-
|
|
79
|
-
|
|
69
|
+
const assertItemCompatibility = (item, format) => {
|
|
70
|
+
/**
|
|
71
|
+
* An empty linked list won't have any format yet, it will be
|
|
72
|
+
* determined by the first item inserted in the list.
|
|
73
|
+
*/
|
|
74
|
+
if (format === null) {
|
|
75
|
+
return;
|
|
76
|
+
}
|
|
77
|
+
const incompatibleWithDoubleLinks = item.previousId === undefined && format === 'double';
|
|
78
|
+
const incompatibleWithSingleLink = item.previousId !== undefined && format === 'single';
|
|
80
79
|
if (incompatibleWithDoubleLinks || incompatibleWithSingleLink) {
|
|
81
80
|
throw new Error(`Node is incompatible with the list (id: ${item.id})`);
|
|
82
81
|
}
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"linked-list-utils.js","sources":["../../src/linked-list/linked-list-utils.ts"],"sourcesContent":["import { runWhile } from '../fp';\nimport { LinkedListItem,
|
|
1
|
+
{"version":3,"file":"linked-list-utils.js","sources":["../../src/linked-list/linked-list-utils.ts"],"sourcesContent":["import { runWhile } from '../fp';\nimport { LinkedListFormat, LinkedListItem, SimpleLinkedList } 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 { 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 return result.accumulator;\n};\n\nexport const findPreviousId = <T extends LinkedListItem>(id: string | null, list: SimpleLinkedList<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, format: LinkedListFormat | null) => {\n /**\n * An empty linked list won't have any format yet, it will be\n * determined by the first item inserted in the list.\n */\n if (format === null) {\n return;\n }\n\n const incompatibleWithDoubleLinks = item.previousId === undefined && format === 'double';\n const incompatibleWithSingleLink = item.previousId !== undefined && format === 'single';\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: SimpleLinkedList<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":["runWhile"],"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,MAAM,EAAE,GAAGA,iBAAQ,CAAC;QAC1B,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;IAEH,OAAO,MAAM,CAAC,WAAW,CAAC;AAC5B,EAAE;MAEW,cAAc,GAAG,CAA2B,EAAiB,EAAE,IAAyB,KAAI;AACvG,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,MAA+B,KAAI;AAC5G;;;AAGG;IACH,IAAI,MAAM,KAAK,IAAI,EAAE;QACnB,OAAO;AACR,KAAA;IAED,MAAM,2BAA2B,GAAG,IAAI,CAAC,UAAU,KAAK,SAAS,IAAI,MAAM,KAAK,QAAQ,CAAC;IACzF,MAAM,0BAA0B,GAAG,IAAI,CAAC,UAAU,KAAK,SAAS,IAAI,MAAM,KAAK,QAAQ,CAAC;IAExF,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;;;;;;;;"}
|
|
@@ -1,2 +1,2 @@
|
|
|
1
|
-
import { ReduceCallback, LinkedListItem,
|
|
2
|
-
export declare const reduceLinkedList: <Item extends LinkedListItem, Result>(cb: ReduceCallback<Item, Result>, initValue: Result, list:
|
|
1
|
+
import { ReduceCallback, LinkedListItem, SimpleLinkedList } from './type';
|
|
2
|
+
export declare const reduceLinkedList: <Item extends LinkedListItem, Result>(cb: ReduceCallback<Item, Result>, initValue: Result, list: SimpleLinkedList<Item>) => Result;
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"reduce-linked-list.js","sources":["../../src/linked-list/reduce-linked-list.ts"],"sourcesContent":["import { ReduceCallback, LinkedListItem,
|
|
1
|
+
{"version":3,"file":"reduce-linked-list.js","sources":["../../src/linked-list/reduce-linked-list.ts"],"sourcesContent":["import { ReduceCallback, LinkedListItem, SimpleLinkedList } 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: SimpleLinkedList<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":["walkListItemRecord"],"mappings":";;;;;;AAGa,MAAA,gBAAgB,GAAG,CAC9B,EAAgC,EAChC,SAAiB,EACjB,IAA4B,KAClB;AACV,IAAA,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC;AAE/B,IAAA,OAAOA,kCAAkB,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;;;;"}
|
|
@@ -6,9 +6,10 @@ var _tslib = require('../_virtual/_tslib.js');
|
|
|
6
6
|
var linkedListUtils = require('./linked-list-utils.js');
|
|
7
7
|
|
|
8
8
|
const removeLinkedList = (id, config) => {
|
|
9
|
-
const {
|
|
9
|
+
const { format, list, factory } = config;
|
|
10
10
|
const _a = list.items, _b = id, itemToDelete = _a[_b], otherItems = _tslib.__rest(_a, [typeof _b === "symbol" ? _b : _b + ""]);
|
|
11
11
|
linkedListUtils.assertPresence(id, list.items);
|
|
12
|
+
const isDoubleLinkList = format === 'double';
|
|
12
13
|
const previousId = isDoubleLinkList
|
|
13
14
|
? itemToDelete.previousId
|
|
14
15
|
: linkedListUtils.findPreviousId(id, list);
|
|
@@ -1 +1 @@
|
|
|
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 {
|
|
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 { format, list, factory } = config;\n const { [id]: itemToDelete, ...otherItems } = list.items;\n\n assertPresence(id, list.items);\n\n const isDoubleLinkList = format === 'double';\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":["__rest","assertPresence","findPreviousId"],"mappings":";;;;;;;MAGa,gBAAgB,GAAG,CAA2B,EAAU,EAAE,MAA6B,KAAI;IACtG,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,MAAM,CAAC;AACzC,IAAA,MAA8C,EAAA,GAAA,IAAI,CAAC,KAAK,EAAhD,EAAC,GAAA,EAAG,EAAE,YAAY,SAAA,EAAK,UAAU,GAAnCA,aAAA,CAAA,EAAA,EAAA,CAAA,OAAA,EAAA,KAAA,QAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,CAAqC,CAAa,CAAC;AAEzD,IAAAC,8BAAc,CAAC,EAAE,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;AAE/B,IAAA,MAAM,gBAAgB,GAAG,MAAM,KAAK,QAAQ,CAAC;IAC7C,MAAM,UAAU,GAAG,gBAAgB;UAC/B,YAAY,CAAC,UAAW;AAC1B,UAAEC,8BAAc,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
CHANGED
|
@@ -3,7 +3,7 @@ export declare type LinkedListItem = {
|
|
|
3
3
|
nextId: string | null;
|
|
4
4
|
previousId?: string | null;
|
|
5
5
|
};
|
|
6
|
-
export declare type
|
|
6
|
+
export declare type SimpleLinkedList<T extends LinkedListItem> = {
|
|
7
7
|
headId: string | null;
|
|
8
8
|
items: {
|
|
9
9
|
[id: string]: T;
|
|
@@ -11,10 +11,11 @@ export declare type HeadAndItems<T extends LinkedListItem> = {
|
|
|
11
11
|
};
|
|
12
12
|
export declare type ReduceCallback<Item, Result> = (accumulator: Result, current: Item) => Result;
|
|
13
13
|
export declare type ItemPredicate<Item> = (item: Item) => boolean;
|
|
14
|
+
export declare type LinkedListFormat = 'double' | 'single';
|
|
14
15
|
export declare type ManipulationConfig<T extends LinkedListItem> = {
|
|
15
|
-
|
|
16
|
-
list:
|
|
17
|
-
factory: (list:
|
|
16
|
+
format: LinkedListFormat | null;
|
|
17
|
+
list: SimpleLinkedList<T>;
|
|
18
|
+
factory: (list: SimpleLinkedList<T>) => LinkedList<T>;
|
|
18
19
|
};
|
|
19
20
|
export declare type LinkedList<T extends LinkedListItem> = {
|
|
20
21
|
readonly head: T | null;
|
|
@@ -22,7 +23,7 @@ export declare type LinkedList<T extends LinkedListItem> = {
|
|
|
22
23
|
[id: string]: T;
|
|
23
24
|
};
|
|
24
25
|
readonly size: number;
|
|
25
|
-
readonly
|
|
26
|
+
readonly format: LinkedListFormat | null;
|
|
26
27
|
readonly reduce: <Result>(cb: ReduceCallback<T, Result>, init: Result) => Result;
|
|
27
28
|
readonly find: (predicate: ItemPredicate<T>) => T | null;
|
|
28
29
|
readonly while: (predicate: ItemPredicate<T>, startId?: string) => string[];
|
|
@@ -1,2 +1,2 @@
|
|
|
1
|
-
import { LinkedListItem, ItemPredicate,
|
|
2
|
-
export declare const whileLinkedList: <Item extends LinkedListItem>(predicate: ItemPredicate<Item>, list:
|
|
1
|
+
import { LinkedListItem, ItemPredicate, SimpleLinkedList } from './type';
|
|
2
|
+
export declare const whileLinkedList: <Item extends LinkedListItem>(predicate: ItemPredicate<Item>, list: SimpleLinkedList<Item>, startId?: string) => string[];
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"while-linked-list.js","sources":["../../src/linked-list/while-linked-list.ts"],"sourcesContent":["\n\nimport { LinkedListItem, ItemPredicate,
|
|
1
|
+
{"version":3,"file":"while-linked-list.js","sources":["../../src/linked-list/while-linked-list.ts"],"sourcesContent":["\n\nimport { LinkedListItem, ItemPredicate, SimpleLinkedList } from './type';\nimport { walkListItemRecord } from './linked-list-utils';\n\nexport const whileLinkedList = <Item extends LinkedListItem>(\n predicate: ItemPredicate<Item>,\n list: SimpleLinkedList<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":["walkListItemRecord"],"mappings":";;;;;;AAKa,MAAA,eAAe,GAAG,CAC7B,SAA8B,EAC9B,IAA4B,EAC5B,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,OAAOA,kCAAkB,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/package.json
CHANGED
|
@@ -1,15 +0,0 @@
|
|
|
1
|
-
import { LinkedListItem } from './type';
|
|
2
|
-
export declare type WalkConfig<T extends LinkedListItem, Result> = {
|
|
3
|
-
startId: string | null;
|
|
4
|
-
items: Record<string, T>;
|
|
5
|
-
initValue: Result;
|
|
6
|
-
};
|
|
7
|
-
declare type WalkCallbackResult<R> = {
|
|
8
|
-
result: R;
|
|
9
|
-
control?: {
|
|
10
|
-
stop?: boolean;
|
|
11
|
-
};
|
|
12
|
-
};
|
|
13
|
-
export declare type WalkCallback<Item, Result> = (accumulator: Result, current: Item) => WalkCallbackResult<Result>;
|
|
14
|
-
export declare const walkListItemRecord: <T extends LinkedListItem, Result>(callback: WalkCallback<T, Result>, config: WalkConfig<T, Result>) => Result;
|
|
15
|
-
export {};
|