@abp/utils 5.0.10 → 5.1.3
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/abp.resourcemapping.js +5 -5
- package/dist/abp-utils.d.ts +4 -4
- package/dist/bundles/abp-utils.umd.js +671 -671
- package/dist/bundles/abp-utils.umd.js.map +1 -1
- package/dist/bundles/abp-utils.umd.min.js.map +1 -1
- package/dist/esm2015/abp-utils.js +4 -4
- package/dist/esm2015/lib/linked-list.js +289 -289
- package/dist/esm2015/public-api.js +5 -5
- package/dist/fesm2015/abp-utils.js +290 -290
- package/dist/fesm2015/abp-utils.js.map +1 -1
- package/dist/lib/linked-list.d.ts +80 -80
- package/dist/package.json +1 -1
- package/dist/public-api.d.ts +1 -1
- package/ngcc.config.js +6 -6
- package/package.json +1 -1
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"abp-utils.js","sources":["../../projects/utils/src/lib/linked-list.ts","../../projects/utils/src/public-api.ts","../../projects/utils/src/abp-utils.ts"],"sourcesContent":["/* tslint:disable:no-non-null-assertion */\n\nimport compare from 'just-compare';\n\nexport class ListNode<T = any> {\n next: ListNode | undefined;\n previous: ListNode | undefined;\n constructor(public readonly value: T) {}\n}\n\nexport class LinkedList<T = any> {\n private first: ListNode<T> | undefined;\n private last: ListNode<T> | undefined;\n private size = 0;\n\n get head(): ListNode<T> | undefined {\n return this.first;\n }\n get tail(): ListNode<T> | undefined {\n return this.last;\n }\n get length(): number {\n return this.size;\n }\n\n private attach(\n value: T,\n previousNode: ListNode<T> | undefined,\n nextNode: ListNode<T> | undefined,\n ): ListNode<T> {\n if (!previousNode) return this.addHead(value);\n\n if (!nextNode) return this.addTail(value);\n\n const node = new ListNode(value);\n node.previous = previousNode;\n previousNode.next = node;\n node.next = nextNode;\n nextNode.previous = node;\n\n this.size++;\n\n return node;\n }\n\n private attachMany(\n values: T[],\n previousNode: ListNode<T> | undefined,\n nextNode: ListNode<T> | undefined,\n ): ListNode<T>[] {\n if (!values.length) return [];\n\n if (!previousNode) return this.addManyHead(values);\n\n if (!nextNode) return this.addManyTail(values);\n\n const list = new LinkedList<T>();\n list.addManyTail(values);\n list.first!.previous = previousNode;\n previousNode.next = list.first;\n list.last!.next = nextNode;\n nextNode.previous = list.last;\n\n this.size += values.length;\n\n return list.toNodeArray();\n }\n\n private detach(node: ListNode<T>) {\n if (!node.previous) return this.dropHead();\n\n if (!node.next) return this.dropTail();\n\n node.previous.next = node.next;\n node.next.previous = node.previous;\n\n this.size--;\n\n return node;\n }\n\n add(value: T) {\n return {\n after: (...params: [T] | [any, ListComparisonFn<T>]) =>\n this.addAfter.call(this, value, ...params),\n before: (...params: [T] | [any, ListComparisonFn<T>]) =>\n this.addBefore.call(this, value, ...params),\n byIndex: (position: number) => this.addByIndex(value, position),\n head: () => this.addHead(value),\n tail: () => this.addTail(value),\n };\n }\n\n addMany(values: T[]) {\n return {\n after: (...params: [T] | [any, ListComparisonFn<T>]) =>\n this.addManyAfter.call(this, values, ...params),\n before: (...params: [T] | [any, ListComparisonFn<T>]) =>\n this.addManyBefore.call(this, values, ...params),\n byIndex: (position: number) => this.addManyByIndex(values, position),\n head: () => this.addManyHead(values),\n tail: () => this.addManyTail(values),\n };\n }\n\n addAfter(value: T, previousValue: T): ListNode<T>;\n addAfter(value: T, previousValue: any, compareFn: ListComparisonFn<T>): ListNode<T>;\n addAfter(value: T, previousValue: any, compareFn: ListComparisonFn<T> = compare): ListNode<T> {\n const previous = this.find(node => compareFn(node.value, previousValue));\n\n return previous ? this.attach(value, previous, previous.next) : this.addTail(value);\n }\n\n addBefore(value: T, nextValue: T): ListNode<T>;\n addBefore(value: T, nextValue: any, compareFn: ListComparisonFn<T>): ListNode<T>;\n addBefore(value: T, nextValue: any, compareFn: ListComparisonFn<T> = compare): ListNode<T> {\n const next = this.find(node => compareFn(node.value, nextValue));\n\n return next ? this.attach(value, next.previous, next) : this.addHead(value);\n }\n\n addByIndex(value: T, position: number): ListNode<T> {\n if (position < 0) position += this.size;\n else if (position >= this.size) return this.addTail(value);\n\n if (position <= 0) return this.addHead(value);\n\n const next = this.get(position)!;\n\n return this.attach(value, next.previous, next);\n }\n\n addHead(value: T): ListNode<T> {\n const node = new ListNode(value);\n\n node.next = this.first;\n\n if (this.first) this.first.previous = node;\n else this.last = node;\n\n this.first = node;\n this.size++;\n\n return node;\n }\n\n addTail(value: T): ListNode<T> {\n const node = new ListNode(value);\n\n if (this.first) {\n node.previous = this.last;\n this.last!.next = node;\n this.last = node;\n } else {\n this.first = node;\n this.last = node;\n }\n\n this.size++;\n\n return node;\n }\n\n addManyAfter(values: T[], previousValue: T): ListNode<T>[];\n addManyAfter(values: T[], previousValue: any, compareFn: ListComparisonFn<T>): ListNode<T>[];\n addManyAfter(\n values: T[],\n previousValue: any,\n compareFn: ListComparisonFn<T> = compare,\n ): ListNode<T>[] {\n const previous = this.find(node => compareFn(node.value, previousValue));\n\n return previous ? this.attachMany(values, previous, previous.next) : this.addManyTail(values);\n }\n\n addManyBefore(values: T[], nextValue: T): ListNode<T>[];\n addManyBefore(values: T[], nextValue: any, compareFn: ListComparisonFn<T>): ListNode<T>[];\n addManyBefore(\n values: T[],\n nextValue: any,\n compareFn: ListComparisonFn<T> = compare,\n ): ListNode<T>[] {\n const next = this.find(node => compareFn(node.value, nextValue));\n\n return next ? this.attachMany(values, next.previous, next) : this.addManyHead(values);\n }\n\n addManyByIndex(values: T[], position: number): ListNode<T>[] {\n if (position < 0) position += this.size;\n\n if (position <= 0) return this.addManyHead(values);\n\n if (position >= this.size) return this.addManyTail(values);\n\n const next = this.get(position)!;\n\n return this.attachMany(values, next.previous, next);\n }\n\n addManyHead(values: T[]): ListNode<T>[] {\n return values.reduceRight<ListNode<T>[]>((nodes, value) => {\n nodes.unshift(this.addHead(value));\n return nodes;\n }, []);\n }\n\n addManyTail(values: T[]): ListNode<T>[] {\n return values.map(value => this.addTail(value));\n }\n\n drop() {\n return {\n byIndex: (position: number) => this.dropByIndex(position),\n byValue: (...params: [T] | [any, ListComparisonFn<T>]) =>\n this.dropByValue.apply(this, params),\n byValueAll: (...params: [T] | [any, ListComparisonFn<T>]) =>\n this.dropByValueAll.apply(this, params),\n head: () => this.dropHead(),\n tail: () => this.dropTail(),\n };\n }\n\n dropMany(count: number) {\n return {\n byIndex: (position: number) => this.dropManyByIndex(count, position),\n head: () => this.dropManyHead(count),\n tail: () => this.dropManyTail(count),\n };\n }\n\n dropByIndex(position: number): ListNode<T> | undefined {\n if (position < 0) position += this.size;\n\n const current = this.get(position);\n\n return current ? this.detach(current) : undefined;\n }\n\n dropByValue(value: T): ListNode<T> | undefined;\n dropByValue(value: any, compareFn: ListComparisonFn<T>): ListNode<T> | undefined;\n dropByValue(value: any, compareFn: ListComparisonFn<T> = compare): ListNode<T> | undefined {\n const position = this.findIndex(node => compareFn(node.value, value));\n\n return position < 0 ? undefined : this.dropByIndex(position);\n }\n\n dropByValueAll(value: T): ListNode<T>[];\n dropByValueAll(value: any, compareFn: ListComparisonFn<T>): ListNode<T>[];\n dropByValueAll(value: any, compareFn: ListComparisonFn<T> = compare): ListNode<T>[] {\n const dropped: ListNode<T>[] = [];\n\n for (let current = this.first, position = 0; current; position++, current = current.next) {\n if (compareFn(current.value, value)) {\n dropped.push(this.dropByIndex(position - dropped.length)!);\n }\n }\n\n return dropped;\n }\n\n dropHead(): ListNode<T> | undefined {\n const head = this.first;\n\n if (head) {\n this.first = head.next;\n\n if (this.first) this.first.previous = undefined;\n else this.last = undefined;\n\n this.size--;\n\n return head;\n }\n\n return undefined;\n }\n\n dropTail(): ListNode<T> | undefined {\n const tail = this.last;\n\n if (tail) {\n this.last = tail.previous;\n\n if (this.last) this.last.next = undefined;\n else this.first = undefined;\n\n this.size--;\n\n return tail;\n }\n\n return undefined;\n }\n\n dropManyByIndex(count: number, position: number): ListNode<T>[] {\n if (count <= 0) return [];\n\n if (position < 0) position = Math.max(position + this.size, 0);\n else if (position >= this.size) return [];\n\n count = Math.min(count, this.size - position);\n\n const dropped: ListNode<T>[] = [];\n\n while (count--) {\n const current = this.get(position);\n dropped.push(this.detach(current!)!);\n }\n\n return dropped;\n }\n\n dropManyHead(count: Exclude<number, 0>): ListNode<T>[] {\n if (count <= 0) return [];\n\n count = Math.min(count, this.size);\n\n const dropped: ListNode<T>[] = [];\n\n while (count--) dropped.unshift(this.dropHead()!);\n\n return dropped;\n }\n\n dropManyTail(count: Exclude<number, 0>): ListNode<T>[] {\n if (count <= 0) return [];\n\n count = Math.min(count, this.size);\n\n const dropped: ListNode<T>[] = [];\n\n while (count--) dropped.push(this.dropTail()!);\n\n return dropped;\n }\n\n find(predicate: ListIteratorFn<T>): ListNode<T> | undefined {\n for (let current = this.first, position = 0; current; position++, current = current.next) {\n if (predicate(current, position, this)) return current;\n }\n\n return undefined;\n }\n\n findIndex(predicate: ListIteratorFn<T>): number {\n for (let current = this.first, position = 0; current; position++, current = current.next) {\n if (predicate(current, position, this)) return position;\n }\n\n return -1;\n }\n\n forEach<R = boolean>(iteratorFn: ListIteratorFn<T, R>) {\n for (let node = this.first, position = 0; node; position++, node = node.next) {\n iteratorFn(node, position, this);\n }\n }\n\n get(position: number): ListNode<T> | undefined {\n return this.find((_, index) => position === index);\n }\n\n indexOf(value: T): number;\n indexOf(value: any, compareFn: ListComparisonFn<T>): number;\n indexOf(value: any, compareFn: ListComparisonFn<T> = compare): number {\n return this.findIndex(node => compareFn(node.value, value));\n }\n\n toArray(): T[] {\n const array = new Array(this.size);\n\n this.forEach((node, index) => (array[index!] = node.value));\n\n return array;\n }\n\n toNodeArray(): ListNode<T>[] {\n const array = new Array(this.size);\n\n this.forEach((node, index) => (array[index!] = node));\n\n return array;\n }\n\n toString(mapperFn: ListMapperFn<T> = JSON.stringify): string {\n return this.toArray()\n .map(value => mapperFn(value))\n .join(' <-> ');\n }\n\n // Cannot use Generator type because of ng-packagr\n *[Symbol.iterator](): any {\n for (let node = this.first, position = 0; node; position++, node = node.next) {\n yield node.value;\n }\n }\n}\n\nexport type ListMapperFn<T = any> = (value: T) => any;\n\nexport type ListComparisonFn<T = any> = (value1: T, value2: any) => boolean;\n\nexport type ListIteratorFn<T = any, R = boolean> = (\n node: ListNode<T>,\n index?: number,\n list?: LinkedList,\n) => R;\n","/*\n * Public API Surface of utils\n */\n\nexport * from './lib/linked-list';\n","/**\n * Generated bundle index. Do not edit.\n */\n\nexport * from './public-api';\n"],"names":[],"mappings":";;AAAA;MAIa,QAAQ;IAGnB,YAA4B,KAAQ;QAAR,UAAK,GAAL,KAAK,CAAG;KAAI;CACzC;MAEY,UAAU;IAAvB;QAGU,SAAI,GAAG,CAAC,CAAC;KA+XlB;IA7XC,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAC;KACnB;IACD,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,IAAI,CAAC;KAClB;IACD,IAAI,MAAM;QACR,OAAO,IAAI,CAAC,IAAI,CAAC;KAClB;IAEO,MAAM,CACZ,KAAQ,EACR,YAAqC,EACrC,QAAiC;QAEjC,IAAI,CAAC,YAAY;YAAE,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QAE9C,IAAI,CAAC,QAAQ;YAAE,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QAE1C,MAAM,IAAI,GAAG,IAAI,QAAQ,CAAC,KAAK,CAAC,CAAC;QACjC,IAAI,CAAC,QAAQ,GAAG,YAAY,CAAC;QAC7B,YAAY,CAAC,IAAI,GAAG,IAAI,CAAC;QACzB,IAAI,CAAC,IAAI,GAAG,QAAQ,CAAC;QACrB,QAAQ,CAAC,QAAQ,GAAG,IAAI,CAAC;QAEzB,IAAI,CAAC,IAAI,EAAE,CAAC;QAEZ,OAAO,IAAI,CAAC;KACb;IAEO,UAAU,CAChB,MAAW,EACX,YAAqC,EACrC,QAAiC;QAEjC,IAAI,CAAC,MAAM,CAAC,MAAM;YAAE,OAAO,EAAE,CAAC;QAE9B,IAAI,CAAC,YAAY;YAAE,OAAO,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QAEnD,IAAI,CAAC,QAAQ;YAAE,OAAO,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QAE/C,MAAM,IAAI,GAAG,IAAI,UAAU,EAAK,CAAC;QACjC,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QACzB,IAAI,CAAC,KAAM,CAAC,QAAQ,GAAG,YAAY,CAAC;QACpC,YAAY,CAAC,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QAC/B,IAAI,CAAC,IAAK,CAAC,IAAI,GAAG,QAAQ,CAAC;QAC3B,QAAQ,CAAC,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC;QAE9B,IAAI,CAAC,IAAI,IAAI,MAAM,CAAC,MAAM,CAAC;QAE3B,OAAO,IAAI,CAAC,WAAW,EAAE,CAAC;KAC3B;IAEO,MAAM,CAAC,IAAiB;QAC9B,IAAI,CAAC,IAAI,CAAC,QAAQ;YAAE,OAAO,IAAI,CAAC,QAAQ,EAAE,CAAC;QAE3C,IAAI,CAAC,IAAI,CAAC,IAAI;YAAE,OAAO,IAAI,CAAC,QAAQ,EAAE,CAAC;QAEvC,IAAI,CAAC,QAAQ,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QAC/B,IAAI,CAAC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;QAEnC,IAAI,CAAC,IAAI,EAAE,CAAC;QAEZ,OAAO,IAAI,CAAC;KACb;IAED,GAAG,CAAC,KAAQ;QACV,OAAO;YACL,KAAK,EAAE,CAAC,GAAG,MAAwC,KACjD,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,MAAM,CAAC;YAC5C,MAAM,EAAE,CAAC,GAAG,MAAwC,KAClD,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,MAAM,CAAC;YAC7C,OAAO,EAAE,CAAC,QAAgB,KAAK,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,QAAQ,CAAC;YAC/D,IAAI,EAAE,MAAM,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC;YAC/B,IAAI,EAAE,MAAM,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC;SAChC,CAAC;KACH;IAED,OAAO,CAAC,MAAW;QACjB,OAAO;YACL,KAAK,EAAE,CAAC,GAAG,MAAwC,KACjD,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,MAAM,CAAC;YACjD,MAAM,EAAE,CAAC,GAAG,MAAwC,KAClD,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,MAAM,CAAC;YAClD,OAAO,EAAE,CAAC,QAAgB,KAAK,IAAI,CAAC,cAAc,CAAC,MAAM,EAAE,QAAQ,CAAC;YACpE,IAAI,EAAE,MAAM,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC;YACpC,IAAI,EAAE,MAAM,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC;SACrC,CAAC;KACH;IAID,QAAQ,CAAC,KAAQ,EAAE,aAAkB,EAAE,YAAiC,OAAO;QAC7E,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,SAAS,CAAC,IAAI,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC;QAEzE,OAAO,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,QAAQ,EAAE,QAAQ,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;KACrF;IAID,SAAS,CAAC,KAAQ,EAAE,SAAc,EAAE,YAAiC,OAAO;QAC1E,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,SAAS,CAAC,IAAI,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC;QAEjE,OAAO,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;KAC7E;IAED,UAAU,CAAC,KAAQ,EAAE,QAAgB;QACnC,IAAI,QAAQ,GAAG,CAAC;YAAE,QAAQ,IAAI,IAAI,CAAC,IAAI,CAAC;aACnC,IAAI,QAAQ,IAAI,IAAI,CAAC,IAAI;YAAE,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QAE3D,IAAI,QAAQ,IAAI,CAAC;YAAE,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QAE9C,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC;QAEjC,OAAO,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;KAChD;IAED,OAAO,CAAC,KAAQ;QACd,MAAM,IAAI,GAAG,IAAI,QAAQ,CAAC,KAAK,CAAC,CAAC;QAEjC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QAEvB,IAAI,IAAI,CAAC,KAAK;YAAE,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,IAAI,CAAC;;YACtC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QAEtB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,IAAI,EAAE,CAAC;QAEZ,OAAO,IAAI,CAAC;KACb;IAED,OAAO,CAAC,KAAQ;QACd,MAAM,IAAI,GAAG,IAAI,QAAQ,CAAC,KAAK,CAAC,CAAC;QAEjC,IAAI,IAAI,CAAC,KAAK,EAAE;YACd,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC;YAC1B,IAAI,CAAC,IAAK,CAAC,IAAI,GAAG,IAAI,CAAC;YACvB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;SAClB;aAAM;YACL,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;YAClB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;SAClB;QAED,IAAI,CAAC,IAAI,EAAE,CAAC;QAEZ,OAAO,IAAI,CAAC;KACb;IAID,YAAY,CACV,MAAW,EACX,aAAkB,EAClB,YAAiC,OAAO;QAExC,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,SAAS,CAAC,IAAI,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC;QAEzE,OAAO,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,QAAQ,EAAE,QAAQ,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;KAC/F;IAID,aAAa,CACX,MAAW,EACX,SAAc,EACd,YAAiC,OAAO;QAExC,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,SAAS,CAAC,IAAI,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC;QAEjE,OAAO,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;KACvF;IAED,cAAc,CAAC,MAAW,EAAE,QAAgB;QAC1C,IAAI,QAAQ,GAAG,CAAC;YAAE,QAAQ,IAAI,IAAI,CAAC,IAAI,CAAC;QAExC,IAAI,QAAQ,IAAI,CAAC;YAAE,OAAO,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QAEnD,IAAI,QAAQ,IAAI,IAAI,CAAC,IAAI;YAAE,OAAO,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QAE3D,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC;QAEjC,OAAO,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;KACrD;IAED,WAAW,CAAC,MAAW;QACrB,OAAO,MAAM,CAAC,WAAW,CAAgB,CAAC,KAAK,EAAE,KAAK;YACpD,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC;YACnC,OAAO,KAAK,CAAC;SACd,EAAE,EAAE,CAAC,CAAC;KACR;IAED,WAAW,CAAC,MAAW;QACrB,OAAO,MAAM,CAAC,GAAG,CAAC,KAAK,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC;KACjD;IAED,IAAI;QACF,OAAO;YACL,OAAO,EAAE,CAAC,QAAgB,KAAK,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC;YACzD,OAAO,EAAE,CAAC,GAAG,MAAwC,KACnD,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,IAAI,EAAE,MAAM,CAAC;YACtC,UAAU,EAAE,CAAC,GAAG,MAAwC,KACtD,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,IAAI,EAAE,MAAM,CAAC;YACzC,IAAI,EAAE,MAAM,IAAI,CAAC,QAAQ,EAAE;YAC3B,IAAI,EAAE,MAAM,IAAI,CAAC,QAAQ,EAAE;SAC5B,CAAC;KACH;IAED,QAAQ,CAAC,KAAa;QACpB,OAAO;YACL,OAAO,EAAE,CAAC,QAAgB,KAAK,IAAI,CAAC,eAAe,CAAC,KAAK,EAAE,QAAQ,CAAC;YACpE,IAAI,EAAE,MAAM,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC;YACpC,IAAI,EAAE,MAAM,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC;SACrC,CAAC;KACH;IAED,WAAW,CAAC,QAAgB;QAC1B,IAAI,QAAQ,GAAG,CAAC;YAAE,QAAQ,IAAI,IAAI,CAAC,IAAI,CAAC;QAExC,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAEnC,OAAO,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG,SAAS,CAAC;KACnD;IAID,WAAW,CAAC,KAAU,EAAE,YAAiC,OAAO;QAC9D,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,IAAI,SAAS,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;QAEtE,OAAO,QAAQ,GAAG,CAAC,GAAG,SAAS,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;KAC9D;IAID,cAAc,CAAC,KAAU,EAAE,YAAiC,OAAO;QACjE,MAAM,OAAO,GAAkB,EAAE,CAAC;QAElC,KAAK,IAAI,OAAO,GAAG,IAAI,CAAC,KAAK,EAAE,QAAQ,GAAG,CAAC,EAAE,OAAO,EAAE,QAAQ,EAAE,EAAE,OAAO,GAAG,OAAO,CAAC,IAAI,EAAE;YACxF,IAAI,SAAS,CAAC,OAAO,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE;gBACnC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,GAAG,OAAO,CAAC,MAAM,CAAE,CAAC,CAAC;aAC5D;SACF;QAED,OAAO,OAAO,CAAC;KAChB;IAED,QAAQ;QACN,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QAExB,IAAI,IAAI,EAAE;YACR,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC;YAEvB,IAAI,IAAI,CAAC,KAAK;gBAAE,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,SAAS,CAAC;;gBAC3C,IAAI,CAAC,IAAI,GAAG,SAAS,CAAC;YAE3B,IAAI,CAAC,IAAI,EAAE,CAAC;YAEZ,OAAO,IAAI,CAAC;SACb;QAED,OAAO,SAAS,CAAC;KAClB;IAED,QAAQ;QACN,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QAEvB,IAAI,IAAI,EAAE;YACR,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC;YAE1B,IAAI,IAAI,CAAC,IAAI;gBAAE,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,SAAS,CAAC;;gBACrC,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC;YAE5B,IAAI,CAAC,IAAI,EAAE,CAAC;YAEZ,OAAO,IAAI,CAAC;SACb;QAED,OAAO,SAAS,CAAC;KAClB;IAED,eAAe,CAAC,KAAa,EAAE,QAAgB;QAC7C,IAAI,KAAK,IAAI,CAAC;YAAE,OAAO,EAAE,CAAC;QAE1B,IAAI,QAAQ,GAAG,CAAC;YAAE,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;aAC1D,IAAI,QAAQ,IAAI,IAAI,CAAC,IAAI;YAAE,OAAO,EAAE,CAAC;QAE1C,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,GAAG,QAAQ,CAAC,CAAC;QAE9C,MAAM,OAAO,GAAkB,EAAE,CAAC;QAElC,OAAO,KAAK,EAAE,EAAE;YACd,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YACnC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,OAAQ,CAAE,CAAC,CAAC;SACtC;QAED,OAAO,OAAO,CAAC;KAChB;IAED,YAAY,CAAC,KAAyB;QACpC,IAAI,KAAK,IAAI,CAAC;YAAE,OAAO,EAAE,CAAC;QAE1B,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;QAEnC,MAAM,OAAO,GAAkB,EAAE,CAAC;QAElC,OAAO,KAAK,EAAE;YAAE,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,EAAG,CAAC,CAAC;QAElD,OAAO,OAAO,CAAC;KAChB;IAED,YAAY,CAAC,KAAyB;QACpC,IAAI,KAAK,IAAI,CAAC;YAAE,OAAO,EAAE,CAAC;QAE1B,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;QAEnC,MAAM,OAAO,GAAkB,EAAE,CAAC;QAElC,OAAO,KAAK,EAAE;YAAE,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAG,CAAC,CAAC;QAE/C,OAAO,OAAO,CAAC;KAChB;IAED,IAAI,CAAC,SAA4B;QAC/B,KAAK,IAAI,OAAO,GAAG,IAAI,CAAC,KAAK,EAAE,QAAQ,GAAG,CAAC,EAAE,OAAO,EAAE,QAAQ,EAAE,EAAE,OAAO,GAAG,OAAO,CAAC,IAAI,EAAE;YACxF,IAAI,SAAS,CAAC,OAAO,EAAE,QAAQ,EAAE,IAAI,CAAC;gBAAE,OAAO,OAAO,CAAC;SACxD;QAED,OAAO,SAAS,CAAC;KAClB;IAED,SAAS,CAAC,SAA4B;QACpC,KAAK,IAAI,OAAO,GAAG,IAAI,CAAC,KAAK,EAAE,QAAQ,GAAG,CAAC,EAAE,OAAO,EAAE,QAAQ,EAAE,EAAE,OAAO,GAAG,OAAO,CAAC,IAAI,EAAE;YACxF,IAAI,SAAS,CAAC,OAAO,EAAE,QAAQ,EAAE,IAAI,CAAC;gBAAE,OAAO,QAAQ,CAAC;SACzD;QAED,OAAO,CAAC,CAAC,CAAC;KACX;IAED,OAAO,CAAc,UAAgC;QACnD,KAAK,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,EAAE,QAAQ,GAAG,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,EAAE,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE;YAC5E,UAAU,CAAC,IAAI,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAC;SAClC;KACF;IAED,GAAG,CAAC,QAAgB;QAClB,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,KAAK,KAAK,QAAQ,KAAK,KAAK,CAAC,CAAC;KACpD;IAID,OAAO,CAAC,KAAU,EAAE,YAAiC,OAAO;QAC1D,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,IAAI,SAAS,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;KAC7D;IAED,OAAO;QACL,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAEnC,IAAI,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,KAAK,MAAM,KAAK,CAAC,KAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;QAE5D,OAAO,KAAK,CAAC;KACd;IAED,WAAW;QACT,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAEnC,IAAI,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,KAAK,MAAM,KAAK,CAAC,KAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;QAEtD,OAAO,KAAK,CAAC;KACd;IAED,QAAQ,CAAC,WAA4B,IAAI,CAAC,SAAS;QACjD,OAAO,IAAI,CAAC,OAAO,EAAE;aAClB,GAAG,CAAC,KAAK,IAAI,QAAQ,CAAC,KAAK,CAAC,CAAC;aAC7B,IAAI,CAAC,OAAO,CAAC,CAAC;KAClB;;IAGD,EAAE,MAAM,CAAC,QAAQ,CAAC;QAChB,KAAK,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,EAAE,QAAQ,GAAG,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,EAAE,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE;YAC5E,MAAM,IAAI,CAAC,KAAK,CAAC;SAClB;KACF;;;AC3YH;;;;ACAA;;;;;;"}
|
|
1
|
+
{"version":3,"file":"abp-utils.js","sources":["../../projects/utils/src/lib/linked-list.ts","../../projects/utils/src/public-api.ts","../../projects/utils/src/abp-utils.ts"],"sourcesContent":["/* tslint:disable:no-non-null-assertion */\r\n\r\nimport compare from 'just-compare';\r\n\r\nexport class ListNode<T = any> {\r\n next: ListNode | undefined;\r\n previous: ListNode | undefined;\r\n constructor(public readonly value: T) {}\r\n}\r\n\r\nexport class LinkedList<T = any> {\r\n private first: ListNode<T> | undefined;\r\n private last: ListNode<T> | undefined;\r\n private size = 0;\r\n\r\n get head(): ListNode<T> | undefined {\r\n return this.first;\r\n }\r\n get tail(): ListNode<T> | undefined {\r\n return this.last;\r\n }\r\n get length(): number {\r\n return this.size;\r\n }\r\n\r\n private attach(\r\n value: T,\r\n previousNode: ListNode<T> | undefined,\r\n nextNode: ListNode<T> | undefined,\r\n ): ListNode<T> {\r\n if (!previousNode) return this.addHead(value);\r\n\r\n if (!nextNode) return this.addTail(value);\r\n\r\n const node = new ListNode(value);\r\n node.previous = previousNode;\r\n previousNode.next = node;\r\n node.next = nextNode;\r\n nextNode.previous = node;\r\n\r\n this.size++;\r\n\r\n return node;\r\n }\r\n\r\n private attachMany(\r\n values: T[],\r\n previousNode: ListNode<T> | undefined,\r\n nextNode: ListNode<T> | undefined,\r\n ): ListNode<T>[] {\r\n if (!values.length) return [];\r\n\r\n if (!previousNode) return this.addManyHead(values);\r\n\r\n if (!nextNode) return this.addManyTail(values);\r\n\r\n const list = new LinkedList<T>();\r\n list.addManyTail(values);\r\n list.first!.previous = previousNode;\r\n previousNode.next = list.first;\r\n list.last!.next = nextNode;\r\n nextNode.previous = list.last;\r\n\r\n this.size += values.length;\r\n\r\n return list.toNodeArray();\r\n }\r\n\r\n private detach(node: ListNode<T>) {\r\n if (!node.previous) return this.dropHead();\r\n\r\n if (!node.next) return this.dropTail();\r\n\r\n node.previous.next = node.next;\r\n node.next.previous = node.previous;\r\n\r\n this.size--;\r\n\r\n return node;\r\n }\r\n\r\n add(value: T) {\r\n return {\r\n after: (...params: [T] | [any, ListComparisonFn<T>]) =>\r\n this.addAfter.call(this, value, ...params),\r\n before: (...params: [T] | [any, ListComparisonFn<T>]) =>\r\n this.addBefore.call(this, value, ...params),\r\n byIndex: (position: number) => this.addByIndex(value, position),\r\n head: () => this.addHead(value),\r\n tail: () => this.addTail(value),\r\n };\r\n }\r\n\r\n addMany(values: T[]) {\r\n return {\r\n after: (...params: [T] | [any, ListComparisonFn<T>]) =>\r\n this.addManyAfter.call(this, values, ...params),\r\n before: (...params: [T] | [any, ListComparisonFn<T>]) =>\r\n this.addManyBefore.call(this, values, ...params),\r\n byIndex: (position: number) => this.addManyByIndex(values, position),\r\n head: () => this.addManyHead(values),\r\n tail: () => this.addManyTail(values),\r\n };\r\n }\r\n\r\n addAfter(value: T, previousValue: T): ListNode<T>;\r\n addAfter(value: T, previousValue: any, compareFn: ListComparisonFn<T>): ListNode<T>;\r\n addAfter(value: T, previousValue: any, compareFn: ListComparisonFn<T> = compare): ListNode<T> {\r\n const previous = this.find(node => compareFn(node.value, previousValue));\r\n\r\n return previous ? this.attach(value, previous, previous.next) : this.addTail(value);\r\n }\r\n\r\n addBefore(value: T, nextValue: T): ListNode<T>;\r\n addBefore(value: T, nextValue: any, compareFn: ListComparisonFn<T>): ListNode<T>;\r\n addBefore(value: T, nextValue: any, compareFn: ListComparisonFn<T> = compare): ListNode<T> {\r\n const next = this.find(node => compareFn(node.value, nextValue));\r\n\r\n return next ? this.attach(value, next.previous, next) : this.addHead(value);\r\n }\r\n\r\n addByIndex(value: T, position: number): ListNode<T> {\r\n if (position < 0) position += this.size;\r\n else if (position >= this.size) return this.addTail(value);\r\n\r\n if (position <= 0) return this.addHead(value);\r\n\r\n const next = this.get(position)!;\r\n\r\n return this.attach(value, next.previous, next);\r\n }\r\n\r\n addHead(value: T): ListNode<T> {\r\n const node = new ListNode(value);\r\n\r\n node.next = this.first;\r\n\r\n if (this.first) this.first.previous = node;\r\n else this.last = node;\r\n\r\n this.first = node;\r\n this.size++;\r\n\r\n return node;\r\n }\r\n\r\n addTail(value: T): ListNode<T> {\r\n const node = new ListNode(value);\r\n\r\n if (this.first) {\r\n node.previous = this.last;\r\n this.last!.next = node;\r\n this.last = node;\r\n } else {\r\n this.first = node;\r\n this.last = node;\r\n }\r\n\r\n this.size++;\r\n\r\n return node;\r\n }\r\n\r\n addManyAfter(values: T[], previousValue: T): ListNode<T>[];\r\n addManyAfter(values: T[], previousValue: any, compareFn: ListComparisonFn<T>): ListNode<T>[];\r\n addManyAfter(\r\n values: T[],\r\n previousValue: any,\r\n compareFn: ListComparisonFn<T> = compare,\r\n ): ListNode<T>[] {\r\n const previous = this.find(node => compareFn(node.value, previousValue));\r\n\r\n return previous ? this.attachMany(values, previous, previous.next) : this.addManyTail(values);\r\n }\r\n\r\n addManyBefore(values: T[], nextValue: T): ListNode<T>[];\r\n addManyBefore(values: T[], nextValue: any, compareFn: ListComparisonFn<T>): ListNode<T>[];\r\n addManyBefore(\r\n values: T[],\r\n nextValue: any,\r\n compareFn: ListComparisonFn<T> = compare,\r\n ): ListNode<T>[] {\r\n const next = this.find(node => compareFn(node.value, nextValue));\r\n\r\n return next ? this.attachMany(values, next.previous, next) : this.addManyHead(values);\r\n }\r\n\r\n addManyByIndex(values: T[], position: number): ListNode<T>[] {\r\n if (position < 0) position += this.size;\r\n\r\n if (position <= 0) return this.addManyHead(values);\r\n\r\n if (position >= this.size) return this.addManyTail(values);\r\n\r\n const next = this.get(position)!;\r\n\r\n return this.attachMany(values, next.previous, next);\r\n }\r\n\r\n addManyHead(values: T[]): ListNode<T>[] {\r\n return values.reduceRight<ListNode<T>[]>((nodes, value) => {\r\n nodes.unshift(this.addHead(value));\r\n return nodes;\r\n }, []);\r\n }\r\n\r\n addManyTail(values: T[]): ListNode<T>[] {\r\n return values.map(value => this.addTail(value));\r\n }\r\n\r\n drop() {\r\n return {\r\n byIndex: (position: number) => this.dropByIndex(position),\r\n byValue: (...params: [T] | [any, ListComparisonFn<T>]) =>\r\n this.dropByValue.apply(this, params),\r\n byValueAll: (...params: [T] | [any, ListComparisonFn<T>]) =>\r\n this.dropByValueAll.apply(this, params),\r\n head: () => this.dropHead(),\r\n tail: () => this.dropTail(),\r\n };\r\n }\r\n\r\n dropMany(count: number) {\r\n return {\r\n byIndex: (position: number) => this.dropManyByIndex(count, position),\r\n head: () => this.dropManyHead(count),\r\n tail: () => this.dropManyTail(count),\r\n };\r\n }\r\n\r\n dropByIndex(position: number): ListNode<T> | undefined {\r\n if (position < 0) position += this.size;\r\n\r\n const current = this.get(position);\r\n\r\n return current ? this.detach(current) : undefined;\r\n }\r\n\r\n dropByValue(value: T): ListNode<T> | undefined;\r\n dropByValue(value: any, compareFn: ListComparisonFn<T>): ListNode<T> | undefined;\r\n dropByValue(value: any, compareFn: ListComparisonFn<T> = compare): ListNode<T> | undefined {\r\n const position = this.findIndex(node => compareFn(node.value, value));\r\n\r\n return position < 0 ? undefined : this.dropByIndex(position);\r\n }\r\n\r\n dropByValueAll(value: T): ListNode<T>[];\r\n dropByValueAll(value: any, compareFn: ListComparisonFn<T>): ListNode<T>[];\r\n dropByValueAll(value: any, compareFn: ListComparisonFn<T> = compare): ListNode<T>[] {\r\n const dropped: ListNode<T>[] = [];\r\n\r\n for (let current = this.first, position = 0; current; position++, current = current.next) {\r\n if (compareFn(current.value, value)) {\r\n dropped.push(this.dropByIndex(position - dropped.length)!);\r\n }\r\n }\r\n\r\n return dropped;\r\n }\r\n\r\n dropHead(): ListNode<T> | undefined {\r\n const head = this.first;\r\n\r\n if (head) {\r\n this.first = head.next;\r\n\r\n if (this.first) this.first.previous = undefined;\r\n else this.last = undefined;\r\n\r\n this.size--;\r\n\r\n return head;\r\n }\r\n\r\n return undefined;\r\n }\r\n\r\n dropTail(): ListNode<T> | undefined {\r\n const tail = this.last;\r\n\r\n if (tail) {\r\n this.last = tail.previous;\r\n\r\n if (this.last) this.last.next = undefined;\r\n else this.first = undefined;\r\n\r\n this.size--;\r\n\r\n return tail;\r\n }\r\n\r\n return undefined;\r\n }\r\n\r\n dropManyByIndex(count: number, position: number): ListNode<T>[] {\r\n if (count <= 0) return [];\r\n\r\n if (position < 0) position = Math.max(position + this.size, 0);\r\n else if (position >= this.size) return [];\r\n\r\n count = Math.min(count, this.size - position);\r\n\r\n const dropped: ListNode<T>[] = [];\r\n\r\n while (count--) {\r\n const current = this.get(position);\r\n dropped.push(this.detach(current!)!);\r\n }\r\n\r\n return dropped;\r\n }\r\n\r\n dropManyHead(count: Exclude<number, 0>): ListNode<T>[] {\r\n if (count <= 0) return [];\r\n\r\n count = Math.min(count, this.size);\r\n\r\n const dropped: ListNode<T>[] = [];\r\n\r\n while (count--) dropped.unshift(this.dropHead()!);\r\n\r\n return dropped;\r\n }\r\n\r\n dropManyTail(count: Exclude<number, 0>): ListNode<T>[] {\r\n if (count <= 0) return [];\r\n\r\n count = Math.min(count, this.size);\r\n\r\n const dropped: ListNode<T>[] = [];\r\n\r\n while (count--) dropped.push(this.dropTail()!);\r\n\r\n return dropped;\r\n }\r\n\r\n find(predicate: ListIteratorFn<T>): ListNode<T> | undefined {\r\n for (let current = this.first, position = 0; current; position++, current = current.next) {\r\n if (predicate(current, position, this)) return current;\r\n }\r\n\r\n return undefined;\r\n }\r\n\r\n findIndex(predicate: ListIteratorFn<T>): number {\r\n for (let current = this.first, position = 0; current; position++, current = current.next) {\r\n if (predicate(current, position, this)) return position;\r\n }\r\n\r\n return -1;\r\n }\r\n\r\n forEach<R = boolean>(iteratorFn: ListIteratorFn<T, R>) {\r\n for (let node = this.first, position = 0; node; position++, node = node.next) {\r\n iteratorFn(node, position, this);\r\n }\r\n }\r\n\r\n get(position: number): ListNode<T> | undefined {\r\n return this.find((_, index) => position === index);\r\n }\r\n\r\n indexOf(value: T): number;\r\n indexOf(value: any, compareFn: ListComparisonFn<T>): number;\r\n indexOf(value: any, compareFn: ListComparisonFn<T> = compare): number {\r\n return this.findIndex(node => compareFn(node.value, value));\r\n }\r\n\r\n toArray(): T[] {\r\n const array = new Array(this.size);\r\n\r\n this.forEach((node, index) => (array[index!] = node.value));\r\n\r\n return array;\r\n }\r\n\r\n toNodeArray(): ListNode<T>[] {\r\n const array = new Array(this.size);\r\n\r\n this.forEach((node, index) => (array[index!] = node));\r\n\r\n return array;\r\n }\r\n\r\n toString(mapperFn: ListMapperFn<T> = JSON.stringify): string {\r\n return this.toArray()\r\n .map(value => mapperFn(value))\r\n .join(' <-> ');\r\n }\r\n\r\n // Cannot use Generator type because of ng-packagr\r\n *[Symbol.iterator](): any {\r\n for (let node = this.first, position = 0; node; position++, node = node.next) {\r\n yield node.value;\r\n }\r\n }\r\n}\r\n\r\nexport type ListMapperFn<T = any> = (value: T) => any;\r\n\r\nexport type ListComparisonFn<T = any> = (value1: T, value2: any) => boolean;\r\n\r\nexport type ListIteratorFn<T = any, R = boolean> = (\r\n node: ListNode<T>,\r\n index?: number,\r\n list?: LinkedList,\r\n) => R;\r\n","/*\r\n * Public API Surface of utils\r\n */\r\n\r\nexport * from './lib/linked-list';\r\n","/**\n * Generated bundle index. Do not edit.\n */\n\nexport * from './public-api';\n"],"names":[],"mappings":";;AAAA;MAIa,QAAQ;IAGnB,YAA4B,KAAQ;QAAR,UAAK,GAAL,KAAK,CAAG;KAAI;CACzC;MAEY,UAAU;IAAvB;QAGU,SAAI,GAAG,CAAC,CAAC;KA+XlB;IA7XC,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAC;KACnB;IACD,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,IAAI,CAAC;KAClB;IACD,IAAI,MAAM;QACR,OAAO,IAAI,CAAC,IAAI,CAAC;KAClB;IAEO,MAAM,CACZ,KAAQ,EACR,YAAqC,EACrC,QAAiC;QAEjC,IAAI,CAAC,YAAY;YAAE,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QAE9C,IAAI,CAAC,QAAQ;YAAE,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QAE1C,MAAM,IAAI,GAAG,IAAI,QAAQ,CAAC,KAAK,CAAC,CAAC;QACjC,IAAI,CAAC,QAAQ,GAAG,YAAY,CAAC;QAC7B,YAAY,CAAC,IAAI,GAAG,IAAI,CAAC;QACzB,IAAI,CAAC,IAAI,GAAG,QAAQ,CAAC;QACrB,QAAQ,CAAC,QAAQ,GAAG,IAAI,CAAC;QAEzB,IAAI,CAAC,IAAI,EAAE,CAAC;QAEZ,OAAO,IAAI,CAAC;KACb;IAEO,UAAU,CAChB,MAAW,EACX,YAAqC,EACrC,QAAiC;QAEjC,IAAI,CAAC,MAAM,CAAC,MAAM;YAAE,OAAO,EAAE,CAAC;QAE9B,IAAI,CAAC,YAAY;YAAE,OAAO,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QAEnD,IAAI,CAAC,QAAQ;YAAE,OAAO,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QAE/C,MAAM,IAAI,GAAG,IAAI,UAAU,EAAK,CAAC;QACjC,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QACzB,IAAI,CAAC,KAAM,CAAC,QAAQ,GAAG,YAAY,CAAC;QACpC,YAAY,CAAC,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QAC/B,IAAI,CAAC,IAAK,CAAC,IAAI,GAAG,QAAQ,CAAC;QAC3B,QAAQ,CAAC,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC;QAE9B,IAAI,CAAC,IAAI,IAAI,MAAM,CAAC,MAAM,CAAC;QAE3B,OAAO,IAAI,CAAC,WAAW,EAAE,CAAC;KAC3B;IAEO,MAAM,CAAC,IAAiB;QAC9B,IAAI,CAAC,IAAI,CAAC,QAAQ;YAAE,OAAO,IAAI,CAAC,QAAQ,EAAE,CAAC;QAE3C,IAAI,CAAC,IAAI,CAAC,IAAI;YAAE,OAAO,IAAI,CAAC,QAAQ,EAAE,CAAC;QAEvC,IAAI,CAAC,QAAQ,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QAC/B,IAAI,CAAC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;QAEnC,IAAI,CAAC,IAAI,EAAE,CAAC;QAEZ,OAAO,IAAI,CAAC;KACb;IAED,GAAG,CAAC,KAAQ;QACV,OAAO;YACL,KAAK,EAAE,CAAC,GAAG,MAAwC,KACjD,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,MAAM,CAAC;YAC5C,MAAM,EAAE,CAAC,GAAG,MAAwC,KAClD,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,MAAM,CAAC;YAC7C,OAAO,EAAE,CAAC,QAAgB,KAAK,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,QAAQ,CAAC;YAC/D,IAAI,EAAE,MAAM,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC;YAC/B,IAAI,EAAE,MAAM,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC;SAChC,CAAC;KACH;IAED,OAAO,CAAC,MAAW;QACjB,OAAO;YACL,KAAK,EAAE,CAAC,GAAG,MAAwC,KACjD,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,MAAM,CAAC;YACjD,MAAM,EAAE,CAAC,GAAG,MAAwC,KAClD,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,MAAM,CAAC;YAClD,OAAO,EAAE,CAAC,QAAgB,KAAK,IAAI,CAAC,cAAc,CAAC,MAAM,EAAE,QAAQ,CAAC;YACpE,IAAI,EAAE,MAAM,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC;YACpC,IAAI,EAAE,MAAM,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC;SACrC,CAAC;KACH;IAID,QAAQ,CAAC,KAAQ,EAAE,aAAkB,EAAE,YAAiC,OAAO;QAC7E,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,SAAS,CAAC,IAAI,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC;QAEzE,OAAO,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,QAAQ,EAAE,QAAQ,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;KACrF;IAID,SAAS,CAAC,KAAQ,EAAE,SAAc,EAAE,YAAiC,OAAO;QAC1E,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,SAAS,CAAC,IAAI,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC;QAEjE,OAAO,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;KAC7E;IAED,UAAU,CAAC,KAAQ,EAAE,QAAgB;QACnC,IAAI,QAAQ,GAAG,CAAC;YAAE,QAAQ,IAAI,IAAI,CAAC,IAAI,CAAC;aACnC,IAAI,QAAQ,IAAI,IAAI,CAAC,IAAI;YAAE,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QAE3D,IAAI,QAAQ,IAAI,CAAC;YAAE,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QAE9C,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC;QAEjC,OAAO,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;KAChD;IAED,OAAO,CAAC,KAAQ;QACd,MAAM,IAAI,GAAG,IAAI,QAAQ,CAAC,KAAK,CAAC,CAAC;QAEjC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QAEvB,IAAI,IAAI,CAAC,KAAK;YAAE,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,IAAI,CAAC;;YACtC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QAEtB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,IAAI,EAAE,CAAC;QAEZ,OAAO,IAAI,CAAC;KACb;IAED,OAAO,CAAC,KAAQ;QACd,MAAM,IAAI,GAAG,IAAI,QAAQ,CAAC,KAAK,CAAC,CAAC;QAEjC,IAAI,IAAI,CAAC,KAAK,EAAE;YACd,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC;YAC1B,IAAI,CAAC,IAAK,CAAC,IAAI,GAAG,IAAI,CAAC;YACvB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;SAClB;aAAM;YACL,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;YAClB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;SAClB;QAED,IAAI,CAAC,IAAI,EAAE,CAAC;QAEZ,OAAO,IAAI,CAAC;KACb;IAID,YAAY,CACV,MAAW,EACX,aAAkB,EAClB,YAAiC,OAAO;QAExC,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,SAAS,CAAC,IAAI,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC;QAEzE,OAAO,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,QAAQ,EAAE,QAAQ,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;KAC/F;IAID,aAAa,CACX,MAAW,EACX,SAAc,EACd,YAAiC,OAAO;QAExC,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,SAAS,CAAC,IAAI,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC;QAEjE,OAAO,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;KACvF;IAED,cAAc,CAAC,MAAW,EAAE,QAAgB;QAC1C,IAAI,QAAQ,GAAG,CAAC;YAAE,QAAQ,IAAI,IAAI,CAAC,IAAI,CAAC;QAExC,IAAI,QAAQ,IAAI,CAAC;YAAE,OAAO,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QAEnD,IAAI,QAAQ,IAAI,IAAI,CAAC,IAAI;YAAE,OAAO,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QAE3D,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC;QAEjC,OAAO,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;KACrD;IAED,WAAW,CAAC,MAAW;QACrB,OAAO,MAAM,CAAC,WAAW,CAAgB,CAAC,KAAK,EAAE,KAAK;YACpD,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC;YACnC,OAAO,KAAK,CAAC;SACd,EAAE,EAAE,CAAC,CAAC;KACR;IAED,WAAW,CAAC,MAAW;QACrB,OAAO,MAAM,CAAC,GAAG,CAAC,KAAK,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC;KACjD;IAED,IAAI;QACF,OAAO;YACL,OAAO,EAAE,CAAC,QAAgB,KAAK,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC;YACzD,OAAO,EAAE,CAAC,GAAG,MAAwC,KACnD,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,IAAI,EAAE,MAAM,CAAC;YACtC,UAAU,EAAE,CAAC,GAAG,MAAwC,KACtD,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,IAAI,EAAE,MAAM,CAAC;YACzC,IAAI,EAAE,MAAM,IAAI,CAAC,QAAQ,EAAE;YAC3B,IAAI,EAAE,MAAM,IAAI,CAAC,QAAQ,EAAE;SAC5B,CAAC;KACH;IAED,QAAQ,CAAC,KAAa;QACpB,OAAO;YACL,OAAO,EAAE,CAAC,QAAgB,KAAK,IAAI,CAAC,eAAe,CAAC,KAAK,EAAE,QAAQ,CAAC;YACpE,IAAI,EAAE,MAAM,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC;YACpC,IAAI,EAAE,MAAM,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC;SACrC,CAAC;KACH;IAED,WAAW,CAAC,QAAgB;QAC1B,IAAI,QAAQ,GAAG,CAAC;YAAE,QAAQ,IAAI,IAAI,CAAC,IAAI,CAAC;QAExC,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAEnC,OAAO,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG,SAAS,CAAC;KACnD;IAID,WAAW,CAAC,KAAU,EAAE,YAAiC,OAAO;QAC9D,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,IAAI,SAAS,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;QAEtE,OAAO,QAAQ,GAAG,CAAC,GAAG,SAAS,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;KAC9D;IAID,cAAc,CAAC,KAAU,EAAE,YAAiC,OAAO;QACjE,MAAM,OAAO,GAAkB,EAAE,CAAC;QAElC,KAAK,IAAI,OAAO,GAAG,IAAI,CAAC,KAAK,EAAE,QAAQ,GAAG,CAAC,EAAE,OAAO,EAAE,QAAQ,EAAE,EAAE,OAAO,GAAG,OAAO,CAAC,IAAI,EAAE;YACxF,IAAI,SAAS,CAAC,OAAO,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE;gBACnC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,GAAG,OAAO,CAAC,MAAM,CAAE,CAAC,CAAC;aAC5D;SACF;QAED,OAAO,OAAO,CAAC;KAChB;IAED,QAAQ;QACN,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QAExB,IAAI,IAAI,EAAE;YACR,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC;YAEvB,IAAI,IAAI,CAAC,KAAK;gBAAE,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,SAAS,CAAC;;gBAC3C,IAAI,CAAC,IAAI,GAAG,SAAS,CAAC;YAE3B,IAAI,CAAC,IAAI,EAAE,CAAC;YAEZ,OAAO,IAAI,CAAC;SACb;QAED,OAAO,SAAS,CAAC;KAClB;IAED,QAAQ;QACN,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QAEvB,IAAI,IAAI,EAAE;YACR,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC;YAE1B,IAAI,IAAI,CAAC,IAAI;gBAAE,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,SAAS,CAAC;;gBACrC,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC;YAE5B,IAAI,CAAC,IAAI,EAAE,CAAC;YAEZ,OAAO,IAAI,CAAC;SACb;QAED,OAAO,SAAS,CAAC;KAClB;IAED,eAAe,CAAC,KAAa,EAAE,QAAgB;QAC7C,IAAI,KAAK,IAAI,CAAC;YAAE,OAAO,EAAE,CAAC;QAE1B,IAAI,QAAQ,GAAG,CAAC;YAAE,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;aAC1D,IAAI,QAAQ,IAAI,IAAI,CAAC,IAAI;YAAE,OAAO,EAAE,CAAC;QAE1C,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,GAAG,QAAQ,CAAC,CAAC;QAE9C,MAAM,OAAO,GAAkB,EAAE,CAAC;QAElC,OAAO,KAAK,EAAE,EAAE;YACd,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YACnC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,OAAQ,CAAE,CAAC,CAAC;SACtC;QAED,OAAO,OAAO,CAAC;KAChB;IAED,YAAY,CAAC,KAAyB;QACpC,IAAI,KAAK,IAAI,CAAC;YAAE,OAAO,EAAE,CAAC;QAE1B,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;QAEnC,MAAM,OAAO,GAAkB,EAAE,CAAC;QAElC,OAAO,KAAK,EAAE;YAAE,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,EAAG,CAAC,CAAC;QAElD,OAAO,OAAO,CAAC;KAChB;IAED,YAAY,CAAC,KAAyB;QACpC,IAAI,KAAK,IAAI,CAAC;YAAE,OAAO,EAAE,CAAC;QAE1B,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;QAEnC,MAAM,OAAO,GAAkB,EAAE,CAAC;QAElC,OAAO,KAAK,EAAE;YAAE,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAG,CAAC,CAAC;QAE/C,OAAO,OAAO,CAAC;KAChB;IAED,IAAI,CAAC,SAA4B;QAC/B,KAAK,IAAI,OAAO,GAAG,IAAI,CAAC,KAAK,EAAE,QAAQ,GAAG,CAAC,EAAE,OAAO,EAAE,QAAQ,EAAE,EAAE,OAAO,GAAG,OAAO,CAAC,IAAI,EAAE;YACxF,IAAI,SAAS,CAAC,OAAO,EAAE,QAAQ,EAAE,IAAI,CAAC;gBAAE,OAAO,OAAO,CAAC;SACxD;QAED,OAAO,SAAS,CAAC;KAClB;IAED,SAAS,CAAC,SAA4B;QACpC,KAAK,IAAI,OAAO,GAAG,IAAI,CAAC,KAAK,EAAE,QAAQ,GAAG,CAAC,EAAE,OAAO,EAAE,QAAQ,EAAE,EAAE,OAAO,GAAG,OAAO,CAAC,IAAI,EAAE;YACxF,IAAI,SAAS,CAAC,OAAO,EAAE,QAAQ,EAAE,IAAI,CAAC;gBAAE,OAAO,QAAQ,CAAC;SACzD;QAED,OAAO,CAAC,CAAC,CAAC;KACX;IAED,OAAO,CAAc,UAAgC;QACnD,KAAK,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,EAAE,QAAQ,GAAG,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,EAAE,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE;YAC5E,UAAU,CAAC,IAAI,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAC;SAClC;KACF;IAED,GAAG,CAAC,QAAgB;QAClB,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,KAAK,KAAK,QAAQ,KAAK,KAAK,CAAC,CAAC;KACpD;IAID,OAAO,CAAC,KAAU,EAAE,YAAiC,OAAO;QAC1D,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,IAAI,SAAS,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;KAC7D;IAED,OAAO;QACL,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAEnC,IAAI,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,KAAK,MAAM,KAAK,CAAC,KAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;QAE5D,OAAO,KAAK,CAAC;KACd;IAED,WAAW;QACT,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAEnC,IAAI,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,KAAK,MAAM,KAAK,CAAC,KAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;QAEtD,OAAO,KAAK,CAAC;KACd;IAED,QAAQ,CAAC,WAA4B,IAAI,CAAC,SAAS;QACjD,OAAO,IAAI,CAAC,OAAO,EAAE;aAClB,GAAG,CAAC,KAAK,IAAI,QAAQ,CAAC,KAAK,CAAC,CAAC;aAC7B,IAAI,CAAC,OAAO,CAAC,CAAC;KAClB;;IAGD,EAAE,MAAM,CAAC,QAAQ,CAAC;QAChB,KAAK,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,EAAE,QAAQ,GAAG,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,EAAE,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE;YAC5E,MAAM,IAAI,CAAC,KAAK,CAAC;SAClB;KACF;;;AC3YH;;;;ACAA;;;;;;"}
|
|
@@ -1,80 +1,80 @@
|
|
|
1
|
-
export declare class ListNode<T = any> {
|
|
2
|
-
readonly value: T;
|
|
3
|
-
next: ListNode | undefined;
|
|
4
|
-
previous: ListNode | undefined;
|
|
5
|
-
constructor(value: T);
|
|
6
|
-
}
|
|
7
|
-
export declare class LinkedList<T = any> {
|
|
8
|
-
private first;
|
|
9
|
-
private last;
|
|
10
|
-
private size;
|
|
11
|
-
get head(): ListNode<T> | undefined;
|
|
12
|
-
get tail(): ListNode<T> | undefined;
|
|
13
|
-
get length(): number;
|
|
14
|
-
private attach;
|
|
15
|
-
private attachMany;
|
|
16
|
-
private detach;
|
|
17
|
-
add(value: T): {
|
|
18
|
-
after: (...params: [T] | [any, ListComparisonFn<T>]) => ListNode<T>;
|
|
19
|
-
before: (...params: [T] | [any, ListComparisonFn<T>]) => ListNode<T>;
|
|
20
|
-
byIndex: (position: number) => ListNode<T>;
|
|
21
|
-
head: () => ListNode<T>;
|
|
22
|
-
tail: () => ListNode<T>;
|
|
23
|
-
};
|
|
24
|
-
addMany(values: T[]): {
|
|
25
|
-
after: (...params: [T] | [any, ListComparisonFn<T>]) => ListNode<T>[];
|
|
26
|
-
before: (...params: [T] | [any, ListComparisonFn<T>]) => ListNode<T>[];
|
|
27
|
-
byIndex: (position: number) => ListNode<T>[];
|
|
28
|
-
head: () => ListNode<T>[];
|
|
29
|
-
tail: () => ListNode<T>[];
|
|
30
|
-
};
|
|
31
|
-
addAfter(value: T, previousValue: T): ListNode<T>;
|
|
32
|
-
addAfter(value: T, previousValue: any, compareFn: ListComparisonFn<T>): ListNode<T>;
|
|
33
|
-
addBefore(value: T, nextValue: T): ListNode<T>;
|
|
34
|
-
addBefore(value: T, nextValue: any, compareFn: ListComparisonFn<T>): ListNode<T>;
|
|
35
|
-
addByIndex(value: T, position: number): ListNode<T>;
|
|
36
|
-
addHead(value: T): ListNode<T>;
|
|
37
|
-
addTail(value: T): ListNode<T>;
|
|
38
|
-
addManyAfter(values: T[], previousValue: T): ListNode<T>[];
|
|
39
|
-
addManyAfter(values: T[], previousValue: any, compareFn: ListComparisonFn<T>): ListNode<T>[];
|
|
40
|
-
addManyBefore(values: T[], nextValue: T): ListNode<T>[];
|
|
41
|
-
addManyBefore(values: T[], nextValue: any, compareFn: ListComparisonFn<T>): ListNode<T>[];
|
|
42
|
-
addManyByIndex(values: T[], position: number): ListNode<T>[];
|
|
43
|
-
addManyHead(values: T[]): ListNode<T>[];
|
|
44
|
-
addManyTail(values: T[]): ListNode<T>[];
|
|
45
|
-
drop(): {
|
|
46
|
-
byIndex: (position: number) => ListNode<T>;
|
|
47
|
-
byValue: (...params: [T] | [any, ListComparisonFn<T>]) => ListNode<T>;
|
|
48
|
-
byValueAll: (...params: [T] | [any, ListComparisonFn<T>]) => ListNode<T>[];
|
|
49
|
-
head: () => ListNode<T>;
|
|
50
|
-
tail: () => ListNode<T>;
|
|
51
|
-
};
|
|
52
|
-
dropMany(count: number): {
|
|
53
|
-
byIndex: (position: number) => ListNode<T>[];
|
|
54
|
-
head: () => ListNode<T>[];
|
|
55
|
-
tail: () => ListNode<T>[];
|
|
56
|
-
};
|
|
57
|
-
dropByIndex(position: number): ListNode<T> | undefined;
|
|
58
|
-
dropByValue(value: T): ListNode<T> | undefined;
|
|
59
|
-
dropByValue(value: any, compareFn: ListComparisonFn<T>): ListNode<T> | undefined;
|
|
60
|
-
dropByValueAll(value: T): ListNode<T>[];
|
|
61
|
-
dropByValueAll(value: any, compareFn: ListComparisonFn<T>): ListNode<T>[];
|
|
62
|
-
dropHead(): ListNode<T> | undefined;
|
|
63
|
-
dropTail(): ListNode<T> | undefined;
|
|
64
|
-
dropManyByIndex(count: number, position: number): ListNode<T>[];
|
|
65
|
-
dropManyHead(count: Exclude<number, 0>): ListNode<T>[];
|
|
66
|
-
dropManyTail(count: Exclude<number, 0>): ListNode<T>[];
|
|
67
|
-
find(predicate: ListIteratorFn<T>): ListNode<T> | undefined;
|
|
68
|
-
findIndex(predicate: ListIteratorFn<T>): number;
|
|
69
|
-
forEach<R = boolean>(iteratorFn: ListIteratorFn<T, R>): void;
|
|
70
|
-
get(position: number): ListNode<T> | undefined;
|
|
71
|
-
indexOf(value: T): number;
|
|
72
|
-
indexOf(value: any, compareFn: ListComparisonFn<T>): number;
|
|
73
|
-
toArray(): T[];
|
|
74
|
-
toNodeArray(): ListNode<T>[];
|
|
75
|
-
toString(mapperFn?: ListMapperFn<T>): string;
|
|
76
|
-
[Symbol.iterator](): any;
|
|
77
|
-
}
|
|
78
|
-
export declare type ListMapperFn<T = any> = (value: T) => any;
|
|
79
|
-
export declare type ListComparisonFn<T = any> = (value1: T, value2: any) => boolean;
|
|
80
|
-
export declare type ListIteratorFn<T = any, R = boolean> = (node: ListNode<T>, index?: number, list?: LinkedList) => R;
|
|
1
|
+
export declare class ListNode<T = any> {
|
|
2
|
+
readonly value: T;
|
|
3
|
+
next: ListNode | undefined;
|
|
4
|
+
previous: ListNode | undefined;
|
|
5
|
+
constructor(value: T);
|
|
6
|
+
}
|
|
7
|
+
export declare class LinkedList<T = any> {
|
|
8
|
+
private first;
|
|
9
|
+
private last;
|
|
10
|
+
private size;
|
|
11
|
+
get head(): ListNode<T> | undefined;
|
|
12
|
+
get tail(): ListNode<T> | undefined;
|
|
13
|
+
get length(): number;
|
|
14
|
+
private attach;
|
|
15
|
+
private attachMany;
|
|
16
|
+
private detach;
|
|
17
|
+
add(value: T): {
|
|
18
|
+
after: (...params: [T] | [any, ListComparisonFn<T>]) => ListNode<T>;
|
|
19
|
+
before: (...params: [T] | [any, ListComparisonFn<T>]) => ListNode<T>;
|
|
20
|
+
byIndex: (position: number) => ListNode<T>;
|
|
21
|
+
head: () => ListNode<T>;
|
|
22
|
+
tail: () => ListNode<T>;
|
|
23
|
+
};
|
|
24
|
+
addMany(values: T[]): {
|
|
25
|
+
after: (...params: [T] | [any, ListComparisonFn<T>]) => ListNode<T>[];
|
|
26
|
+
before: (...params: [T] | [any, ListComparisonFn<T>]) => ListNode<T>[];
|
|
27
|
+
byIndex: (position: number) => ListNode<T>[];
|
|
28
|
+
head: () => ListNode<T>[];
|
|
29
|
+
tail: () => ListNode<T>[];
|
|
30
|
+
};
|
|
31
|
+
addAfter(value: T, previousValue: T): ListNode<T>;
|
|
32
|
+
addAfter(value: T, previousValue: any, compareFn: ListComparisonFn<T>): ListNode<T>;
|
|
33
|
+
addBefore(value: T, nextValue: T): ListNode<T>;
|
|
34
|
+
addBefore(value: T, nextValue: any, compareFn: ListComparisonFn<T>): ListNode<T>;
|
|
35
|
+
addByIndex(value: T, position: number): ListNode<T>;
|
|
36
|
+
addHead(value: T): ListNode<T>;
|
|
37
|
+
addTail(value: T): ListNode<T>;
|
|
38
|
+
addManyAfter(values: T[], previousValue: T): ListNode<T>[];
|
|
39
|
+
addManyAfter(values: T[], previousValue: any, compareFn: ListComparisonFn<T>): ListNode<T>[];
|
|
40
|
+
addManyBefore(values: T[], nextValue: T): ListNode<T>[];
|
|
41
|
+
addManyBefore(values: T[], nextValue: any, compareFn: ListComparisonFn<T>): ListNode<T>[];
|
|
42
|
+
addManyByIndex(values: T[], position: number): ListNode<T>[];
|
|
43
|
+
addManyHead(values: T[]): ListNode<T>[];
|
|
44
|
+
addManyTail(values: T[]): ListNode<T>[];
|
|
45
|
+
drop(): {
|
|
46
|
+
byIndex: (position: number) => ListNode<T>;
|
|
47
|
+
byValue: (...params: [T] | [any, ListComparisonFn<T>]) => ListNode<T>;
|
|
48
|
+
byValueAll: (...params: [T] | [any, ListComparisonFn<T>]) => ListNode<T>[];
|
|
49
|
+
head: () => ListNode<T>;
|
|
50
|
+
tail: () => ListNode<T>;
|
|
51
|
+
};
|
|
52
|
+
dropMany(count: number): {
|
|
53
|
+
byIndex: (position: number) => ListNode<T>[];
|
|
54
|
+
head: () => ListNode<T>[];
|
|
55
|
+
tail: () => ListNode<T>[];
|
|
56
|
+
};
|
|
57
|
+
dropByIndex(position: number): ListNode<T> | undefined;
|
|
58
|
+
dropByValue(value: T): ListNode<T> | undefined;
|
|
59
|
+
dropByValue(value: any, compareFn: ListComparisonFn<T>): ListNode<T> | undefined;
|
|
60
|
+
dropByValueAll(value: T): ListNode<T>[];
|
|
61
|
+
dropByValueAll(value: any, compareFn: ListComparisonFn<T>): ListNode<T>[];
|
|
62
|
+
dropHead(): ListNode<T> | undefined;
|
|
63
|
+
dropTail(): ListNode<T> | undefined;
|
|
64
|
+
dropManyByIndex(count: number, position: number): ListNode<T>[];
|
|
65
|
+
dropManyHead(count: Exclude<number, 0>): ListNode<T>[];
|
|
66
|
+
dropManyTail(count: Exclude<number, 0>): ListNode<T>[];
|
|
67
|
+
find(predicate: ListIteratorFn<T>): ListNode<T> | undefined;
|
|
68
|
+
findIndex(predicate: ListIteratorFn<T>): number;
|
|
69
|
+
forEach<R = boolean>(iteratorFn: ListIteratorFn<T, R>): void;
|
|
70
|
+
get(position: number): ListNode<T> | undefined;
|
|
71
|
+
indexOf(value: T): number;
|
|
72
|
+
indexOf(value: any, compareFn: ListComparisonFn<T>): number;
|
|
73
|
+
toArray(): T[];
|
|
74
|
+
toNodeArray(): ListNode<T>[];
|
|
75
|
+
toString(mapperFn?: ListMapperFn<T>): string;
|
|
76
|
+
[Symbol.iterator](): any;
|
|
77
|
+
}
|
|
78
|
+
export declare type ListMapperFn<T = any> = (value: T) => any;
|
|
79
|
+
export declare type ListComparisonFn<T = any> = (value1: T, value2: any) => boolean;
|
|
80
|
+
export declare type ListIteratorFn<T = any, R = boolean> = (node: ListNode<T>, index?: number, list?: LinkedList) => R;
|
package/dist/package.json
CHANGED
package/dist/public-api.d.ts
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
export * from './lib/linked-list';
|
|
1
|
+
export * from './lib/linked-list';
|
package/ngcc.config.js
CHANGED
|
@@ -1,6 +1,6 @@
|
|
|
1
|
-
module.exports = {
|
|
2
|
-
entryPoints: {
|
|
3
|
-
'.': { ignore: true },
|
|
4
|
-
'./dist': {},
|
|
5
|
-
},
|
|
6
|
-
};
|
|
1
|
+
module.exports = {
|
|
2
|
+
entryPoints: {
|
|
3
|
+
'.': { ignore: true },
|
|
4
|
+
'./dist': {},
|
|
5
|
+
},
|
|
6
|
+
};
|