@abp/utils 9.3.0-rc.4 → 9.3.0
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/dist/{fesm2015/abp-utils.js → fesm2022/abp-utils.mjs} +294 -291
- package/dist/fesm2022/abp-utils.mjs.map +1 -0
- package/dist/{lib/linked-list.d.ts → index.d.ts} +83 -80
- package/package.json +19 -23
- package/dist/abp-utils.d.ts +0 -4
- package/dist/abp-utils.metadata.json +0 -1
- package/dist/bundles/abp-utils.umd.js +0 -694
- package/dist/bundles/abp-utils.umd.js.map +0 -1
- package/dist/bundles/abp-utils.umd.min.js +0 -2
- package/dist/bundles/abp-utils.umd.min.js.map +0 -1
- package/dist/esm2015/abp-utils.js +0 -5
- package/dist/esm2015/lib/linked-list.js +0 -289
- package/dist/esm2015/public-api.js +0 -5
- package/dist/fesm2015/abp-utils.js.map +0 -1
- package/dist/package.json +0 -42
- package/dist/public-api.d.ts +0 -1
- package/ngcc.config.js +0 -6
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"abp-utils.mjs","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,CAAA;AAGS,IAAA,KAAA;AAF5B,IAAA,IAAI;AACJ,IAAA,QAAQ;AACR,IAAA,WAAA,CAA4B,KAAQ,EAAA;QAAR,IAAA,CAAA,KAAK,GAAL,KAAK;IAAM;AACxC;MAEY,UAAU,CAAA;AACb,IAAA,KAAK;AACL,IAAA,IAAI;IACJ,IAAI,GAAG,CAAC;AAEhB,IAAA,IAAI,IAAI,GAAA;QACN,OAAO,IAAI,CAAC,KAAK;IACnB;AACA,IAAA,IAAI,IAAI,GAAA;QACN,OAAO,IAAI,CAAC,IAAI;IAClB;AACA,IAAA,IAAI,MAAM,GAAA;QACR,OAAO,IAAI,CAAC,IAAI;IAClB;AAEQ,IAAA,MAAM,CACZ,KAAQ,EACR,YAAqC,EACrC,QAAiC,EAAA;AAEjC,QAAA,IAAI,CAAC,YAAY;AAAE,YAAA,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC;AAE7C,QAAA,IAAI,CAAC,QAAQ;AAAE,YAAA,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC;AAEzC,QAAA,MAAM,IAAI,GAAG,IAAI,QAAQ,CAAC,KAAK,CAAC;AAChC,QAAA,IAAI,CAAC,QAAQ,GAAG,YAAY;AAC5B,QAAA,YAAY,CAAC,IAAI,GAAG,IAAI;AACxB,QAAA,IAAI,CAAC,IAAI,GAAG,QAAQ;AACpB,QAAA,QAAQ,CAAC,QAAQ,GAAG,IAAI;QAExB,IAAI,CAAC,IAAI,EAAE;AAEX,QAAA,OAAO,IAAI;IACb;AAEQ,IAAA,UAAU,CAChB,MAAW,EACX,YAAqC,EACrC,QAAiC,EAAA;QAEjC,IAAI,CAAC,MAAM,CAAC,MAAM;AAAE,YAAA,OAAO,EAAE;AAE7B,QAAA,IAAI,CAAC,YAAY;AAAE,YAAA,OAAO,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC;AAElD,QAAA,IAAI,CAAC,QAAQ;AAAE,YAAA,OAAO,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC;AAE9C,QAAA,MAAM,IAAI,GAAG,IAAI,UAAU,EAAK;AAChC,QAAA,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC;AACxB,QAAA,IAAI,CAAC,KAAM,CAAC,QAAQ,GAAG,YAAY;AACnC,QAAA,YAAY,CAAC,IAAI,GAAG,IAAI,CAAC,KAAK;AAC9B,QAAA,IAAI,CAAC,IAAK,CAAC,IAAI,GAAG,QAAQ;AAC1B,QAAA,QAAQ,CAAC,QAAQ,GAAG,IAAI,CAAC,IAAI;AAE7B,QAAA,IAAI,CAAC,IAAI,IAAI,MAAM,CAAC,MAAM;AAE1B,QAAA,OAAO,IAAI,CAAC,WAAW,EAAE;IAC3B;AAEQ,IAAA,MAAM,CAAC,IAAiB,EAAA;QAC9B,IAAI,CAAC,IAAI,CAAC,QAAQ;AAAE,YAAA,OAAO,IAAI,CAAC,QAAQ,EAAE;QAE1C,IAAI,CAAC,IAAI,CAAC,IAAI;AAAE,YAAA,OAAO,IAAI,CAAC,QAAQ,EAAE;QAEtC,IAAI,CAAC,QAAQ,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI;QAC9B,IAAI,CAAC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ;QAElC,IAAI,CAAC,IAAI,EAAE;AAEX,QAAA,OAAO,IAAI;IACb;AAEA,IAAA,GAAG,CAAC,KAAQ,EAAA;QACV,OAAO;AACL,YAAA,KAAK,EAAE,CAAC,GAAG,MAAwC,KACjD,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,MAAM,CAAC;AAC5C,YAAA,MAAM,EAAE,CAAC,GAAG,MAAwC,KAClD,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,MAAM,CAAC;AAC7C,YAAA,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;IACH;AAEA,IAAA,OAAO,CAAC,MAAW,EAAA;QACjB,OAAO;AACL,YAAA,KAAK,EAAE,CAAC,GAAG,MAAwC,KACjD,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,MAAM,CAAC;AACjD,YAAA,MAAM,EAAE,CAAC,GAAG,MAAwC,KAClD,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,MAAM,CAAC;AAClD,YAAA,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;IACH;AAIA,IAAA,QAAQ,CAAC,KAAQ,EAAE,aAAkB,EAAE,YAAiC,OAAO,EAAA;AAC7E,QAAA,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,SAAS,CAAC,IAAI,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC;QAExE,OAAO,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,QAAQ,EAAE,QAAQ,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC;IACrF;AAIA,IAAA,SAAS,CAAC,KAAQ,EAAE,SAAc,EAAE,YAAiC,OAAO,EAAA;AAC1E,QAAA,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,SAAS,CAAC,IAAI,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;QAEhE,OAAO,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC;IAC7E;IAEA,UAAU,CAAC,KAAQ,EAAE,QAAgB,EAAA;QACnC,IAAI,QAAQ,GAAG,CAAC;AAAE,YAAA,QAAQ,IAAI,IAAI,CAAC,IAAI;AAClC,aAAA,IAAI,QAAQ,IAAI,IAAI,CAAC,IAAI;AAAE,YAAA,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC;QAE1D,IAAI,QAAQ,IAAI,CAAC;AAAE,YAAA,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC;QAE7C,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAE;AAEhC,QAAA,OAAO,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC;IAChD;AAEA,IAAA,OAAO,CAAC,KAAQ,EAAA;AACd,QAAA,MAAM,IAAI,GAAG,IAAI,QAAQ,CAAC,KAAK,CAAC;AAEhC,QAAA,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,KAAK;QAEtB,IAAI,IAAI,CAAC,KAAK;AAAE,YAAA,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,IAAI;;AACrC,YAAA,IAAI,CAAC,IAAI,GAAG,IAAI;AAErB,QAAA,IAAI,CAAC,KAAK,GAAG,IAAI;QACjB,IAAI,CAAC,IAAI,EAAE;AAEX,QAAA,OAAO,IAAI;IACb;AAEA,IAAA,OAAO,CAAC,KAAQ,EAAA;AACd,QAAA,MAAM,IAAI,GAAG,IAAI,QAAQ,CAAC,KAAK,CAAC;AAEhC,QAAA,IAAI,IAAI,CAAC,KAAK,EAAE;AACd,YAAA,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,IAAI;AACzB,YAAA,IAAI,CAAC,IAAK,CAAC,IAAI,GAAG,IAAI;AACtB,YAAA,IAAI,CAAC,IAAI,GAAG,IAAI;QAClB;aAAO;AACL,YAAA,IAAI,CAAC,KAAK,GAAG,IAAI;AACjB,YAAA,IAAI,CAAC,IAAI,GAAG,IAAI;QAClB;QAEA,IAAI,CAAC,IAAI,EAAE;AAEX,QAAA,OAAO,IAAI;IACb;AAIA,IAAA,YAAY,CACV,MAAW,EACX,aAAkB,EAClB,YAAiC,OAAO,EAAA;AAExC,QAAA,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,SAAS,CAAC,IAAI,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC;QAExE,OAAO,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,QAAQ,EAAE,QAAQ,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC;IAC/F;AAIA,IAAA,aAAa,CACX,MAAW,EACX,SAAc,EACd,YAAiC,OAAO,EAAA;AAExC,QAAA,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,SAAS,CAAC,IAAI,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;QAEhE,OAAO,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC;IACvF;IAEA,cAAc,CAAC,MAAW,EAAE,QAAgB,EAAA;QAC1C,IAAI,QAAQ,GAAG,CAAC;AAAE,YAAA,QAAQ,IAAI,IAAI,CAAC,IAAI;QAEvC,IAAI,QAAQ,IAAI,CAAC;AAAE,YAAA,OAAO,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC;AAElD,QAAA,IAAI,QAAQ,IAAI,IAAI,CAAC,IAAI;AAAE,YAAA,OAAO,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC;QAE1D,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAE;AAEhC,QAAA,OAAO,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC;IACrD;AAEA,IAAA,WAAW,CAAC,MAAW,EAAA;QACrB,OAAO,MAAM,CAAC,WAAW,CAAgB,CAAC,KAAK,EAAE,KAAK,KAAI;YACxD,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;AAClC,YAAA,OAAO,KAAK;QACd,CAAC,EAAE,EAAE,CAAC;IACR;AAEA,IAAA,WAAW,CAAC,MAAW,EAAA;AACrB,QAAA,OAAO,MAAM,CAAC,GAAG,CAAC,KAAK,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IACjD;IAEA,IAAI,GAAA;QACF,OAAO;YACL,OAAO,EAAE,CAAC,QAAgB,KAAK,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC;AACzD,YAAA,OAAO,EAAE,CAAC,GAAG,MAAwC,KACnD,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,IAAI,EAAE,MAAM,CAAC;AACtC,YAAA,UAAU,EAAE,CAAC,GAAG,MAAwC,KACtD,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,IAAI,EAAE,MAAM,CAAC;AACzC,YAAA,IAAI,EAAE,MAAM,IAAI,CAAC,QAAQ,EAAE;AAC3B,YAAA,IAAI,EAAE,MAAM,IAAI,CAAC,QAAQ,EAAE;SAC5B;IACH;AAEA,IAAA,QAAQ,CAAC,KAAa,EAAA;QACpB,OAAO;AACL,YAAA,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;IACH;AAEA,IAAA,WAAW,CAAC,QAAgB,EAAA;QAC1B,IAAI,QAAQ,GAAG,CAAC;AAAE,YAAA,QAAQ,IAAI,IAAI,CAAC,IAAI;QAEvC,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC;AAElC,QAAA,OAAO,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG,SAAS;IACnD;AAIA,IAAA,WAAW,CAAC,KAAU,EAAE,SAAA,GAAiC,OAAO,EAAA;AAC9D,QAAA,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,IAAI,SAAS,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;AAErE,QAAA,OAAO,QAAQ,GAAG,CAAC,GAAG,SAAS,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC;IAC9D;AAIA,IAAA,cAAc,CAAC,KAAU,EAAE,SAAA,GAAiC,OAAO,EAAA;QACjE,MAAM,OAAO,GAAkB,EAAE;QAEjC,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;AACnC,gBAAA,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,GAAG,OAAO,CAAC,MAAM,CAAE,CAAC;YAC5D;QACF;AAEA,QAAA,OAAO,OAAO;IAChB;IAEA,QAAQ,GAAA;AACN,QAAA,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK;QAEvB,IAAI,IAAI,EAAE;AACR,YAAA,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI;YAEtB,IAAI,IAAI,CAAC,KAAK;AAAE,gBAAA,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,SAAS;;AAC1C,gBAAA,IAAI,CAAC,IAAI,GAAG,SAAS;YAE1B,IAAI,CAAC,IAAI,EAAE;AAEX,YAAA,OAAO,IAAI;QACb;AAEA,QAAA,OAAO,SAAS;IAClB;IAEA,QAAQ,GAAA;AACN,QAAA,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI;QAEtB,IAAI,IAAI,EAAE;AACR,YAAA,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,QAAQ;YAEzB,IAAI,IAAI,CAAC,IAAI;AAAE,gBAAA,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,SAAS;;AACpC,gBAAA,IAAI,CAAC,KAAK,GAAG,SAAS;YAE3B,IAAI,CAAC,IAAI,EAAE;AAEX,YAAA,OAAO,IAAI;QACb;AAEA,QAAA,OAAO,SAAS;IAClB;IAEA,eAAe,CAAC,KAAa,EAAE,QAAgB,EAAA;QAC7C,IAAI,KAAK,IAAI,CAAC;AAAE,YAAA,OAAO,EAAE;QAEzB,IAAI,QAAQ,GAAG,CAAC;AAAE,YAAA,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;AACzD,aAAA,IAAI,QAAQ,IAAI,IAAI,CAAC,IAAI;AAAE,YAAA,OAAO,EAAE;AAEzC,QAAA,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,GAAG,QAAQ,CAAC;QAE7C,MAAM,OAAO,GAAkB,EAAE;QAEjC,OAAO,KAAK,EAAE,EAAE;YACd,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC;YAClC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,OAAQ,CAAE,CAAC;QACtC;AAEA,QAAA,OAAO,OAAO;IAChB;AAEA,IAAA,YAAY,CAAC,KAAyB,EAAA;QACpC,IAAI,KAAK,IAAI,CAAC;AAAE,YAAA,OAAO,EAAE;QAEzB,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC;QAElC,MAAM,OAAO,GAAkB,EAAE;AAEjC,QAAA,OAAO,KAAK,EAAE;YAAE,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,EAAG,CAAC;AAEjD,QAAA,OAAO,OAAO;IAChB;AAEA,IAAA,YAAY,CAAC,KAAyB,EAAA;QACpC,IAAI,KAAK,IAAI,CAAC;AAAE,YAAA,OAAO,EAAE;QAEzB,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC;QAElC,MAAM,OAAO,GAAkB,EAAE;AAEjC,QAAA,OAAO,KAAK,EAAE;YAAE,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAG,CAAC;AAE9C,QAAA,OAAO,OAAO;IAChB;AAEA,IAAA,IAAI,CAAC,SAA4B,EAAA;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;AACxF,YAAA,IAAI,SAAS,CAAC,OAAO,EAAE,QAAQ,EAAE,IAAI,CAAC;AAAE,gBAAA,OAAO,OAAO;QACxD;AAEA,QAAA,OAAO,SAAS;IAClB;AAEA,IAAA,SAAS,CAAC,SAA4B,EAAA;QACpC,KAAK,IAAI,OAAO,GAAG,IAAI,CAAC,KAAK,EAAE,QAAQ,GAAG,CAAC,EAAE,OAAO,EAAE,QAAQ,EAAE,EAAE,OAAO,GAAG,OAAO,CAAC,IAAI,EAAE;AACxF,YAAA,IAAI,SAAS,CAAC,OAAO,EAAE,QAAQ,EAAE,IAAI,CAAC;AAAE,gBAAA,OAAO,QAAQ;QACzD;QAEA,OAAO,CAAC,CAAC;IACX;AAEA,IAAA,OAAO,CAAc,UAAgC,EAAA;QACnD,KAAK,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,EAAE,QAAQ,GAAG,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,EAAE,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE;AAC5E,YAAA,UAAU,CAAC,IAAI,EAAE,QAAQ,EAAE,IAAI,CAAC;QAClC;IACF;AAEA,IAAA,GAAG,CAAC,QAAgB,EAAA;AAClB,QAAA,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,KAAK,KAAK,QAAQ,KAAK,KAAK,CAAC;IACpD;AAIA,IAAA,OAAO,CAAC,KAAU,EAAE,SAAA,GAAiC,OAAO,EAAA;AAC1D,QAAA,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,IAAI,SAAS,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IAC7D;IAEA,OAAO,GAAA;QACL,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC;QAElC,IAAI,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,KAAK,MAAM,KAAK,CAAC,KAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;AAE3D,QAAA,OAAO,KAAK;IACd;IAEA,WAAW,GAAA;QACT,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC;AAElC,QAAA,IAAI,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,KAAK,MAAM,KAAK,CAAC,KAAM,CAAC,GAAG,IAAI,CAAC,CAAC;AAErD,QAAA,OAAO,KAAK;IACd;AAEA,IAAA,QAAQ,CAAC,QAAA,GAA4B,IAAI,CAAC,SAAS,EAAA;QACjD,OAAO,IAAI,CAAC,OAAO;aAChB,GAAG,CAAC,KAAK,IAAI,QAAQ,CAAC,KAAK,CAAC;aAC5B,IAAI,CAAC,OAAO,CAAC;IAClB;;AAGA,IAAA,EAAE,MAAM,CAAC,QAAQ,CAAC,GAAA;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;QAClB;IACF;AACD;;AC5YD;;AAEG;;ACFH;;AAEG;;;;"}
|
|
@@ -1,80 +1,83 @@
|
|
|
1
|
-
|
|
2
|
-
readonly value: T;
|
|
3
|
-
next: ListNode | undefined;
|
|
4
|
-
previous: ListNode | undefined;
|
|
5
|
-
constructor(value: T);
|
|
6
|
-
}
|
|
7
|
-
|
|
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
|
-
|
|
79
|
-
|
|
80
|
-
|
|
1
|
+
declare class ListNode<T = any> {
|
|
2
|
+
readonly value: T;
|
|
3
|
+
next: ListNode | undefined;
|
|
4
|
+
previous: ListNode | undefined;
|
|
5
|
+
constructor(value: T);
|
|
6
|
+
}
|
|
7
|
+
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
|
+
type ListMapperFn<T = any> = (value: T) => any;
|
|
79
|
+
type ListComparisonFn<T = any> = (value1: T, value2: any) => boolean;
|
|
80
|
+
type ListIteratorFn<T = any, R = boolean> = (node: ListNode<T>, index?: number, list?: LinkedList) => R;
|
|
81
|
+
|
|
82
|
+
export { LinkedList, ListNode };
|
|
83
|
+
export type { ListComparisonFn, ListIteratorFn, ListMapperFn };
|
package/package.json
CHANGED
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
{
|
|
2
2
|
"name": "@abp/utils",
|
|
3
|
-
"version": "9.3.0
|
|
3
|
+
"version": "9.3.0",
|
|
4
4
|
"scripts": {
|
|
5
5
|
"prepublishOnly": "yarn install --ignore-scripts && node prepublish.js",
|
|
6
6
|
"ng": "ng",
|
|
@@ -19,40 +19,36 @@
|
|
|
19
19
|
"directory": "npm/packs/utils"
|
|
20
20
|
},
|
|
21
21
|
"module": "dist/fesm2015/abp-utils.js",
|
|
22
|
-
"es2015_ivy_ngcc": "__ivy_ngcc__/dist/fesm2015/abp-utils.js",
|
|
23
22
|
"es2015": "dist/fesm2015/abp-utils.js",
|
|
24
23
|
"esm2015": "dist/esm2015/abp-utils.js",
|
|
25
|
-
"fesm2015_ivy_ngcc": "__ivy_ngcc__/dist/fesm2015/abp-utils.js",
|
|
26
24
|
"fesm2015": "dist/fesm2015/abp-utils.js",
|
|
27
25
|
"typings": "dist/abp-utils.d.ts",
|
|
28
26
|
"metadata": "dist/abp-utils.metadata.json",
|
|
29
27
|
"sideEffects": false,
|
|
30
28
|
"devDependencies": {
|
|
31
|
-
"@angular-builders/jest": "
|
|
32
|
-
"@angular-devkit/build-
|
|
33
|
-
"@angular/cli": "~
|
|
34
|
-
"@angular/common": "~
|
|
35
|
-
"@angular/compiler": "~
|
|
36
|
-
"@angular/compiler-cli": "~
|
|
37
|
-
"@angular/core": "~
|
|
38
|
-
"@angular/platform-browser": "~
|
|
39
|
-
"@angular/platform-browser-dynamic": "~
|
|
40
|
-
"@types/
|
|
41
|
-
"@types/
|
|
42
|
-
"@types/jest": "^25.1.4",
|
|
29
|
+
"@angular-builders/jest": "~20.0.0",
|
|
30
|
+
"@angular-devkit/build-angular": "~20.0.0",
|
|
31
|
+
"@angular/cli": "~20.0.0",
|
|
32
|
+
"@angular/common": "~20.0.0",
|
|
33
|
+
"@angular/compiler": "~20.0.0",
|
|
34
|
+
"@angular/compiler-cli": "~20.0.0",
|
|
35
|
+
"@angular/core": "~20.0.0",
|
|
36
|
+
"@angular/platform-browser": "~20.0.0",
|
|
37
|
+
"@angular/platform-browser-dynamic": "~20.0.0",
|
|
38
|
+
"@types/fs-extra": "~11.0.0",
|
|
39
|
+
"@types/jest": "^29.0.0",
|
|
43
40
|
"@types/node": "^12.11.1",
|
|
44
41
|
"codelyzer": "^5.1.2",
|
|
45
|
-
"execa": "
|
|
46
|
-
"fs-extra": "
|
|
47
|
-
"jest": "^
|
|
48
|
-
"jest-preset-angular": "^
|
|
49
|
-
"ng-packagr": "
|
|
50
|
-
"protractor": "^7.0.0",
|
|
42
|
+
"execa": "~9.6.0",
|
|
43
|
+
"fs-extra": "~9.0.0",
|
|
44
|
+
"jest": "^29.0.0",
|
|
45
|
+
"jest-preset-angular": "^13.0.0",
|
|
46
|
+
"ng-packagr": "~20.0.0",
|
|
51
47
|
"ts-node": "~8.3.0",
|
|
52
48
|
"tslib": "~2.0.0",
|
|
53
49
|
"tslint": "^6.1.0",
|
|
54
|
-
"typescript": "~
|
|
55
|
-
"zone.js": "~0.
|
|
50
|
+
"typescript": "~5.8.0",
|
|
51
|
+
"zone.js": "~0.15.0"
|
|
56
52
|
},
|
|
57
53
|
"dependencies": {
|
|
58
54
|
"just-compare": "^2.3.0"
|
package/dist/abp-utils.d.ts
DELETED
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"__symbolic":"module","version":4,"metadata":{"ListNode":{"__symbolic":"class","arity":1,"members":{"__ctor__":[{"__symbolic":"constructor","parameters":[{"__symbolic":"error","message":"Could not resolve type","line":7,"character":37,"context":{"typeName":"T"},"module":"./lib/linked-list"}]}]}},"LinkedList":{"__symbolic":"class","arity":1,"members":{"attach":[{"__symbolic":"method"}],"attachMany":[{"__symbolic":"method"}],"detach":[{"__symbolic":"method"}],"add":[{"__symbolic":"method"}],"addMany":[{"__symbolic":"method"}],"addAfter":[{"__symbolic":"method"},{"__symbolic":"method"},{"__symbolic":"method"}],"addBefore":[{"__symbolic":"method"},{"__symbolic":"method"},{"__symbolic":"method"}],"addByIndex":[{"__symbolic":"method"}],"addHead":[{"__symbolic":"method"}],"addTail":[{"__symbolic":"method"}],"addManyAfter":[{"__symbolic":"method"},{"__symbolic":"method"},{"__symbolic":"method"}],"addManyBefore":[{"__symbolic":"method"},{"__symbolic":"method"},{"__symbolic":"method"}],"addManyByIndex":[{"__symbolic":"method"}],"addManyHead":[{"__symbolic":"method"}],"addManyTail":[{"__symbolic":"method"}],"drop":[{"__symbolic":"method"}],"dropMany":[{"__symbolic":"method"}],"dropByIndex":[{"__symbolic":"method"}],"dropByValue":[{"__symbolic":"method"},{"__symbolic":"method"},{"__symbolic":"method"}],"dropByValueAll":[{"__symbolic":"method"},{"__symbolic":"method"},{"__symbolic":"method"}],"dropHead":[{"__symbolic":"method"}],"dropTail":[{"__symbolic":"method"}],"dropManyByIndex":[{"__symbolic":"method"}],"dropManyHead":[{"__symbolic":"method"}],"dropManyTail":[{"__symbolic":"method"}],"find":[{"__symbolic":"method"}],"findIndex":[{"__symbolic":"method"}],"forEach":[{"__symbolic":"method"}],"get":[{"__symbolic":"method"}],"indexOf":[{"__symbolic":"method"},{"__symbolic":"method"},{"__symbolic":"method"}],"toArray":[{"__symbolic":"method"}],"toNodeArray":[{"__symbolic":"method"}],"toString":[{"__symbolic":"method"}]}},"ListMapperFn":{"__symbolic":"interface"},"ListComparisonFn":{"__symbolic":"interface"},"ListIteratorFn":{"__symbolic":"interface"}},"origins":{"ListNode":"./lib/linked-list","LinkedList":"./lib/linked-list","ListMapperFn":"./lib/linked-list","ListComparisonFn":"./lib/linked-list","ListIteratorFn":"./lib/linked-list"},"importAs":"@abp/utils"}
|