@sapphire/iterator-utilities 2.1.0-next.fff340cc → 3.0.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/CHANGELOG.md +48 -0
- package/README.md +65 -66
- package/dist/index.d.mts +80 -0
- package/dist/index.mjs +79 -0
- package/dist/lib/all.d.mts +2 -0
- package/dist/lib/all.mjs +3 -0
- package/dist/lib/any.d.mts +2 -0
- package/dist/lib/any.mjs +3 -0
- package/dist/lib/append.d.mts +19 -0
- package/dist/lib/append.d.mts.map +1 -0
- package/dist/lib/append.mjs +24 -0
- package/dist/lib/append.mjs.map +1 -0
- package/dist/lib/at.d.mts +21 -0
- package/dist/lib/at.d.mts.map +1 -0
- package/dist/lib/at.mjs +31 -0
- package/dist/lib/at.mjs.map +1 -0
- package/dist/lib/average.d.mts +21 -0
- package/dist/lib/average.d.mts.map +1 -0
- package/dist/lib/average.mjs +33 -0
- package/dist/lib/average.mjs.map +1 -0
- package/dist/lib/chain.d.mts +17 -0
- package/dist/lib/chain.d.mts.map +1 -0
- package/dist/lib/chain.mjs +23 -0
- package/dist/lib/chain.mjs.map +1 -0
- package/dist/lib/chunk.d.mts +17 -0
- package/dist/lib/chunk.d.mts.map +1 -0
- package/dist/lib/chunk.mjs +34 -0
- package/dist/lib/chunk.mjs.map +1 -0
- package/dist/lib/collect.d.mts +2 -0
- package/dist/lib/collect.mjs +3 -0
- package/dist/lib/collectInto.d.mts +26 -0
- package/dist/lib/collectInto.d.mts.map +1 -0
- package/dist/lib/collectInto.mjs +33 -0
- package/dist/lib/collectInto.mjs.map +1 -0
- package/dist/lib/compact.d.mts +16 -0
- package/dist/lib/compact.d.mts.map +1 -0
- package/dist/lib/compact.mjs +22 -0
- package/dist/lib/compact.mjs.map +1 -0
- package/dist/lib/compare.d.mts +28 -0
- package/dist/lib/compare.d.mts.map +1 -0
- package/dist/lib/compare.mjs +34 -0
- package/dist/lib/compare.mjs.map +1 -0
- package/dist/lib/compareBy.d.mts +27 -0
- package/dist/lib/compareBy.d.mts.map +1 -0
- package/dist/lib/compareBy.mjs +42 -0
- package/dist/lib/compareBy.mjs.map +1 -0
- package/dist/lib/compress.d.mts +22 -0
- package/dist/lib/compress.d.mts.map +1 -0
- package/dist/lib/compress.mjs +34 -0
- package/dist/lib/compress.mjs.map +1 -0
- package/dist/lib/contains.d.mts +21 -0
- package/dist/lib/contains.d.mts.map +1 -0
- package/dist/lib/contains.mjs +28 -0
- package/dist/lib/contains.mjs.map +1 -0
- package/dist/lib/count.d.mts +20 -0
- package/dist/lib/count.d.mts.map +1 -0
- package/dist/lib/count.mjs +29 -0
- package/dist/lib/count.mjs.map +1 -0
- package/dist/lib/cycle.d.mts +18 -0
- package/dist/lib/cycle.d.mts.map +1 -0
- package/dist/lib/cycle.mjs +29 -0
- package/dist/lib/cycle.mjs.map +1 -0
- package/dist/lib/difference.d.mts +22 -0
- package/dist/lib/difference.d.mts.map +1 -0
- package/dist/lib/difference.mjs +29 -0
- package/dist/lib/difference.mjs.map +1 -0
- package/dist/lib/drop.d.mts +18 -0
- package/dist/lib/drop.d.mts.map +1 -0
- package/dist/lib/drop.mjs +32 -0
- package/dist/lib/drop.mjs.map +1 -0
- package/dist/lib/dropLast.d.mts +21 -0
- package/dist/lib/dropLast.d.mts.map +1 -0
- package/dist/lib/dropLast.mjs +34 -0
- package/dist/lib/dropLast.mjs.map +1 -0
- package/dist/lib/dropWhile.d.mts +20 -0
- package/dist/lib/dropWhile.d.mts.map +1 -0
- package/dist/lib/dropWhile.mjs +12 -0
- package/dist/lib/dropWhile.mjs.map +1 -0
- package/dist/lib/empty.d.mts +15 -0
- package/dist/lib/empty.d.mts.map +1 -0
- package/dist/lib/empty.mjs +25 -0
- package/dist/lib/empty.mjs.map +1 -0
- package/dist/lib/enumerate.d.mts +21 -0
- package/dist/lib/enumerate.d.mts.map +1 -0
- package/dist/lib/enumerate.mjs +28 -0
- package/dist/lib/enumerate.mjs.map +1 -0
- package/dist/lib/equal.d.mts +23 -0
- package/dist/lib/equal.d.mts.map +1 -0
- package/dist/lib/equal.mjs +28 -0
- package/dist/lib/equal.mjs.map +1 -0
- package/dist/lib/equalBy.d.mts +24 -0
- package/dist/lib/equalBy.d.mts.map +1 -0
- package/dist/lib/equalBy.mjs +37 -0
- package/dist/lib/equalBy.mjs.map +1 -0
- package/dist/lib/every.d.mts +25 -0
- package/dist/lib/every.d.mts.map +1 -0
- package/dist/lib/every.mjs +13 -0
- package/dist/lib/every.mjs.map +1 -0
- package/dist/lib/filter.d.mts +19 -0
- package/dist/lib/filter.d.mts.map +1 -0
- package/dist/lib/filter.mjs +12 -0
- package/dist/lib/filter.mjs.map +1 -0
- package/dist/lib/find.d.mts +22 -0
- package/dist/lib/find.d.mts.map +1 -0
- package/dist/lib/find.mjs +10 -0
- package/dist/lib/find.mjs.map +1 -0
- package/dist/lib/findIndex.d.mts +21 -0
- package/dist/lib/findIndex.d.mts.map +1 -0
- package/dist/lib/findIndex.mjs +34 -0
- package/dist/lib/findIndex.mjs.map +1 -0
- package/dist/lib/first.d.mts +20 -0
- package/dist/lib/first.d.mts.map +1 -0
- package/dist/lib/first.mjs +26 -0
- package/dist/lib/first.mjs.map +1 -0
- package/dist/lib/flat.d.mts +17 -0
- package/dist/lib/flat.d.mts.map +1 -0
- package/dist/lib/flat.mjs +23 -0
- package/dist/lib/flat.mjs.map +1 -0
- package/dist/lib/flatMap.d.mts +18 -0
- package/dist/lib/flatMap.d.mts.map +1 -0
- package/dist/lib/flatMap.mjs +27 -0
- package/dist/lib/flatMap.mjs.map +1 -0
- package/dist/lib/forEach.d.mts +20 -0
- package/dist/lib/forEach.d.mts.map +1 -0
- package/dist/lib/forEach.mjs +29 -0
- package/dist/lib/forEach.mjs.map +1 -0
- package/dist/lib/from.d.mts +19 -0
- package/dist/lib/from.d.mts.map +1 -0
- package/dist/lib/from.mjs +12 -0
- package/dist/lib/from.mjs.map +1 -0
- package/dist/lib/fuse.d.mts +44 -0
- package/dist/lib/fuse.d.mts.map +1 -0
- package/dist/lib/fuse.mjs +61 -0
- package/dist/lib/fuse.mjs.map +1 -0
- package/dist/lib/greaterOrEqualThan.d.mts +29 -0
- package/dist/lib/greaterOrEqualThan.d.mts.map +1 -0
- package/dist/lib/greaterOrEqualThan.mjs +36 -0
- package/dist/lib/greaterOrEqualThan.mjs.map +1 -0
- package/dist/lib/greaterThan.d.mts +29 -0
- package/dist/lib/greaterThan.d.mts.map +1 -0
- package/dist/lib/greaterThan.mjs +36 -0
- package/dist/lib/greaterThan.mjs.map +1 -0
- package/dist/lib/indexOf.d.mts +21 -0
- package/dist/lib/indexOf.d.mts.map +1 -0
- package/dist/lib/indexOf.mjs +32 -0
- package/dist/lib/indexOf.mjs.map +1 -0
- package/dist/lib/inspect.d.mts +36 -0
- package/dist/lib/inspect.d.mts.map +1 -0
- package/dist/lib/inspect.mjs +51 -0
- package/dist/lib/inspect.mjs.map +1 -0
- package/dist/lib/intersect.d.mts +21 -0
- package/dist/lib/intersect.d.mts.map +1 -0
- package/dist/lib/intersect.mjs +29 -0
- package/dist/lib/intersect.mjs.map +1 -0
- package/dist/lib/intersperse.d.mts +26 -0
- package/dist/lib/intersperse.d.mts.map +1 -0
- package/dist/lib/intersperse.mjs +60 -0
- package/dist/lib/intersperse.mjs.map +1 -0
- package/dist/lib/isEmpty.d.mts +22 -0
- package/dist/lib/isEmpty.d.mts.map +1 -0
- package/dist/lib/isEmpty.mjs +28 -0
- package/dist/lib/isEmpty.mjs.map +1 -0
- package/dist/lib/isSorted.d.mts +30 -0
- package/dist/lib/isSorted.d.mts.map +1 -0
- package/dist/lib/isSorted.mjs +37 -0
- package/dist/lib/isSorted.mjs.map +1 -0
- package/dist/lib/isSortedBy.d.mts +27 -0
- package/dist/lib/isSortedBy.d.mts.map +1 -0
- package/dist/lib/isSortedBy.mjs +44 -0
- package/dist/lib/isSortedBy.mjs.map +1 -0
- package/dist/lib/isSortedByKey.d.mts +25 -0
- package/dist/lib/isSortedByKey.d.mts.map +1 -0
- package/dist/lib/isSortedByKey.mjs +45 -0
- package/dist/lib/isSortedByKey.mjs.map +1 -0
- package/dist/lib/last.d.mts +20 -0
- package/dist/lib/last.d.mts.map +1 -0
- package/dist/lib/last.mjs +28 -0
- package/dist/lib/last.mjs.map +1 -0
- package/dist/lib/lessOrEqualThan.d.mts +29 -0
- package/dist/lib/lessOrEqualThan.d.mts.map +1 -0
- package/dist/lib/lessOrEqualThan.mjs +36 -0
- package/dist/lib/lessOrEqualThan.mjs.map +1 -0
- package/dist/lib/lessThan.d.mts +29 -0
- package/dist/lib/lessThan.d.mts.map +1 -0
- package/dist/lib/lessThan.mjs +36 -0
- package/dist/lib/lessThan.mjs.map +1 -0
- package/dist/lib/map.d.mts +17 -0
- package/dist/lib/map.d.mts.map +1 -0
- package/dist/lib/map.mjs +26 -0
- package/dist/lib/map.mjs.map +1 -0
- package/dist/lib/max.d.mts +25 -0
- package/dist/lib/max.d.mts.map +1 -0
- package/dist/lib/max.mjs +32 -0
- package/dist/lib/max.mjs.map +1 -0
- package/dist/lib/maxBy.d.mts +26 -0
- package/dist/lib/maxBy.d.mts.map +1 -0
- package/dist/lib/maxBy.mjs +42 -0
- package/dist/lib/maxBy.mjs.map +1 -0
- package/dist/lib/maxByKey.d.mts +27 -0
- package/dist/lib/maxByKey.d.mts.map +1 -0
- package/dist/lib/maxByKey.mjs +50 -0
- package/dist/lib/maxByKey.mjs.map +1 -0
- package/dist/lib/min.d.mts +25 -0
- package/dist/lib/min.d.mts.map +1 -0
- package/dist/lib/min.mjs +32 -0
- package/dist/lib/min.mjs.map +1 -0
- package/dist/lib/minBy.d.mts +26 -0
- package/dist/lib/minBy.d.mts.map +1 -0
- package/dist/lib/minBy.mjs +42 -0
- package/dist/lib/minBy.mjs.map +1 -0
- package/dist/lib/minByKey.d.mts +26 -0
- package/dist/lib/minByKey.d.mts.map +1 -0
- package/dist/lib/minByKey.mjs +49 -0
- package/dist/lib/minByKey.mjs.map +1 -0
- package/dist/lib/notEqual.d.mts +23 -0
- package/dist/lib/notEqual.d.mts.map +1 -0
- package/dist/lib/notEqual.mjs +28 -0
- package/dist/lib/notEqual.mjs.map +1 -0
- package/dist/lib/nth.d.mts +2 -0
- package/dist/lib/nth.mjs +3 -0
- package/dist/lib/partition.d.mts +29 -0
- package/dist/lib/partition.d.mts.map +1 -0
- package/dist/lib/partition.mjs +16 -0
- package/dist/lib/partition.mjs.map +1 -0
- package/dist/lib/peekable.d.mts +32 -0
- package/dist/lib/peekable.d.mts.map +1 -0
- package/dist/lib/peekable.mjs +52 -0
- package/dist/lib/peekable.mjs.map +1 -0
- package/dist/lib/position.d.mts +2 -0
- package/dist/lib/position.mjs +3 -0
- package/dist/lib/prepend.d.mts +18 -0
- package/dist/lib/prepend.d.mts.map +1 -0
- package/dist/lib/prepend.mjs +25 -0
- package/dist/lib/prepend.mjs.map +1 -0
- package/dist/lib/product.d.mts +21 -0
- package/dist/lib/product.d.mts.map +1 -0
- package/dist/lib/product.mjs +30 -0
- package/dist/lib/product.mjs.map +1 -0
- package/dist/lib/range.d.mts +29 -0
- package/dist/lib/range.d.mts.map +1 -0
- package/dist/lib/range.mjs +46 -0
- package/dist/lib/range.mjs.map +1 -0
- package/dist/lib/reduce.d.mts +29 -0
- package/dist/lib/reduce.d.mts.map +1 -0
- package/dist/lib/reduce.mjs +50 -0
- package/dist/lib/reduce.mjs.map +1 -0
- package/dist/lib/repeat.d.mts +17 -0
- package/dist/lib/repeat.d.mts.map +1 -0
- package/dist/lib/repeat.mjs +34 -0
- package/dist/lib/repeat.mjs.map +1 -0
- package/dist/lib/reverse.d.mts +22 -0
- package/dist/lib/reverse.d.mts.map +1 -0
- package/dist/lib/reverse.mjs +29 -0
- package/dist/lib/reverse.mjs.map +1 -0
- package/dist/lib/shared/_assertFunction.d.mts +2 -0
- package/dist/lib/shared/_assertFunction.d.mts.map +1 -0
- package/dist/lib/shared/_assertFunction.mjs +8 -0
- package/dist/lib/shared/_assertFunction.mjs.map +1 -0
- package/dist/lib/shared/_assertNotNegative.d.mts +2 -0
- package/dist/lib/shared/_assertNotNegative.d.mts.map +1 -0
- package/dist/lib/shared/_assertNotNegative.mjs +8 -0
- package/dist/lib/shared/_assertNotNegative.mjs.map +1 -0
- package/dist/lib/shared/_assertPositive.d.mts +2 -0
- package/dist/lib/shared/_assertPositive.d.mts.map +1 -0
- package/dist/lib/shared/_assertPositive.mjs +8 -0
- package/dist/lib/shared/_assertPositive.mjs.map +1 -0
- package/dist/lib/shared/_compare.d.mts +19 -0
- package/dist/lib/shared/_compare.d.mts.map +1 -0
- package/dist/lib/shared/_compare.mjs +21 -0
- package/dist/lib/shared/_compare.mjs.map +1 -0
- package/dist/lib/shared/_makeIterableIterator.d.mts +2 -0
- package/dist/lib/shared/_makeIterableIterator.d.mts.map +1 -0
- package/dist/lib/shared/_makeIterableIterator.mjs +12 -0
- package/dist/lib/shared/_makeIterableIterator.mjs.map +1 -0
- package/dist/lib/shared/_toIntegerOrInfinityOrThrow.d.mts +2 -0
- package/dist/lib/shared/_toIntegerOrInfinityOrThrow.d.mts.map +1 -0
- package/dist/lib/shared/_toIntegerOrInfinityOrThrow.mjs +13 -0
- package/dist/lib/shared/_toIntegerOrInfinityOrThrow.mjs.map +1 -0
- package/dist/lib/shared/_toIntegerOrThrow.d.mts +2 -0
- package/dist/lib/shared/_toIntegerOrThrow.d.mts.map +1 -0
- package/dist/lib/shared/_toIntegerOrThrow.mjs +13 -0
- package/dist/lib/shared/_toIntegerOrThrow.mjs.map +1 -0
- package/dist/lib/shared/_toNumberOrThrow.d.mts +7 -0
- package/dist/lib/shared/_toNumberOrThrow.d.mts.map +1 -0
- package/dist/lib/shared/_toNumberOrThrow.mjs +18 -0
- package/dist/lib/shared/_toNumberOrThrow.mjs.map +1 -0
- package/dist/lib/shared/comparators.d.mts +30 -0
- package/dist/lib/shared/comparators.d.mts.map +1 -0
- package/dist/lib/shared/comparators.mjs +38 -0
- package/dist/lib/shared/comparators.mjs.map +1 -0
- package/dist/lib/skip.d.mts +2 -0
- package/dist/lib/skip.mjs +3 -0
- package/dist/lib/skipLast.d.mts +2 -0
- package/dist/lib/skipLast.mjs +3 -0
- package/dist/lib/skipWhile.d.mts +2 -0
- package/dist/lib/skipWhile.mjs +3 -0
- package/dist/lib/slice.d.mts +53 -0
- package/dist/lib/slice.d.mts.map +1 -0
- package/dist/lib/slice.mjs +76 -0
- package/dist/lib/slice.mjs.map +1 -0
- package/dist/lib/some.d.mts +28 -0
- package/dist/lib/some.d.mts.map +1 -0
- package/dist/lib/some.mjs +38 -0
- package/dist/lib/some.mjs.map +1 -0
- package/dist/lib/sorted.d.mts +21 -0
- package/dist/lib/sorted.d.mts.map +1 -0
- package/dist/lib/sorted.mjs +27 -0
- package/dist/lib/sorted.mjs.map +1 -0
- package/dist/lib/starMap.d.mts +24 -0
- package/dist/lib/starMap.d.mts.map +1 -0
- package/dist/lib/starMap.mjs +31 -0
- package/dist/lib/starMap.mjs.map +1 -0
- package/dist/lib/stepBy.d.mts +20 -0
- package/dist/lib/stepBy.d.mts.map +1 -0
- package/dist/lib/stepBy.mjs +42 -0
- package/dist/lib/stepBy.mjs.map +1 -0
- package/dist/lib/sum.d.mts +21 -0
- package/dist/lib/sum.d.mts.map +1 -0
- package/dist/lib/sum.mjs +29 -0
- package/dist/lib/sum.mjs.map +1 -0
- package/dist/lib/take.d.mts +18 -0
- package/dist/lib/take.d.mts.map +1 -0
- package/dist/lib/take.mjs +35 -0
- package/dist/lib/take.mjs.map +1 -0
- package/dist/lib/takeLast.d.mts +21 -0
- package/dist/lib/takeLast.d.mts.map +1 -0
- package/dist/lib/takeLast.mjs +46 -0
- package/dist/lib/takeLast.mjs.map +1 -0
- package/dist/lib/takeWhile.d.mts +2 -0
- package/dist/lib/takeWhile.mjs +3 -0
- package/dist/lib/tee.d.mts +22 -0
- package/dist/lib/tee.d.mts.map +1 -0
- package/dist/lib/tee.mjs +56 -0
- package/dist/lib/tee.mjs.map +1 -0
- package/dist/lib/toArray.d.mts +32 -0
- package/dist/lib/toArray.d.mts.map +1 -0
- package/dist/lib/toArray.mjs +38 -0
- package/dist/lib/toArray.mjs.map +1 -0
- package/dist/lib/toIterableIterator.d.mts +29 -0
- package/dist/lib/toIterableIterator.d.mts.map +1 -0
- package/dist/lib/toIterableIterator.mjs +38 -0
- package/dist/lib/toIterableIterator.mjs.map +1 -0
- package/dist/lib/union.d.mts +18 -0
- package/dist/lib/union.d.mts.map +1 -0
- package/dist/lib/union.mjs +28 -0
- package/dist/lib/union.mjs.map +1 -0
- package/dist/lib/unique.d.mts +17 -0
- package/dist/lib/unique.d.mts.map +1 -0
- package/dist/lib/unique.mjs +23 -0
- package/dist/lib/unique.mjs.map +1 -0
- package/dist/lib/unzip.d.mts +26 -0
- package/dist/lib/unzip.d.mts.map +1 -0
- package/dist/lib/unzip.mjs +43 -0
- package/dist/lib/unzip.mjs.map +1 -0
- package/dist/lib/windows.d.mts +18 -0
- package/dist/lib/windows.d.mts.map +1 -0
- package/dist/lib/windows.mjs +45 -0
- package/dist/lib/windows.mjs.map +1 -0
- package/dist/lib/zip.d.mts +25 -0
- package/dist/lib/zip.d.mts.map +1 -0
- package/dist/lib/zip.mjs +39 -0
- package/dist/lib/zip.mjs.map +1 -0
- package/package.json +199 -751
- package/dist/cjs/index.cjs +0 -609
- package/dist/cjs/index.cjs.map +0 -1
- package/dist/cjs/index.d.cts +0 -79
- package/dist/cjs/lib/all.cjs +0 -12
- package/dist/cjs/lib/all.cjs.map +0 -1
- package/dist/cjs/lib/all.d.cts +0 -2
- package/dist/cjs/lib/any.cjs +0 -12
- package/dist/cjs/lib/any.cjs.map +0 -1
- package/dist/cjs/lib/any.d.cts +0 -2
- package/dist/cjs/lib/append.cjs +0 -15
- package/dist/cjs/lib/append.cjs.map +0 -1
- package/dist/cjs/lib/append.d.cts +0 -21
- package/dist/cjs/lib/at.cjs +0 -18
- package/dist/cjs/lib/at.cjs.map +0 -1
- package/dist/cjs/lib/at.d.cts +0 -25
- package/dist/cjs/lib/average.cjs +0 -21
- package/dist/cjs/lib/average.cjs.map +0 -1
- package/dist/cjs/lib/average.d.cts +0 -25
- package/dist/cjs/lib/chain.cjs +0 -16
- package/dist/cjs/lib/chain.cjs.map +0 -1
- package/dist/cjs/lib/chain.d.cts +0 -20
- package/dist/cjs/lib/chunk.cjs +0 -27
- package/dist/cjs/lib/chunk.cjs.map +0 -1
- package/dist/cjs/lib/chunk.d.cts +0 -20
- package/dist/cjs/lib/collect.cjs +0 -12
- package/dist/cjs/lib/collect.cjs.map +0 -1
- package/dist/cjs/lib/collect.d.cts +0 -2
- package/dist/cjs/lib/collectInto.cjs +0 -17
- package/dist/cjs/lib/collectInto.cjs.map +0 -1
- package/dist/cjs/lib/collectInto.d.cts +0 -29
- package/dist/cjs/lib/compact.cjs +0 -14
- package/dist/cjs/lib/compact.cjs.map +0 -1
- package/dist/cjs/lib/compact.d.cts +0 -19
- package/dist/cjs/lib/compare.cjs +0 -15
- package/dist/cjs/lib/compare.cjs.map +0 -1
- package/dist/cjs/lib/compare.d.cts +0 -32
- package/dist/cjs/lib/compareBy.cjs +0 -26
- package/dist/cjs/lib/compareBy.cjs.map +0 -1
- package/dist/cjs/lib/compareBy.d.cts +0 -31
- package/dist/cjs/lib/compress.cjs +0 -24
- package/dist/cjs/lib/compress.cjs.map +0 -1
- package/dist/cjs/lib/compress.d.cts +0 -26
- package/dist/cjs/lib/contains.cjs +0 -17
- package/dist/cjs/lib/contains.cjs.map +0 -1
- package/dist/cjs/lib/contains.d.cts +0 -25
- package/dist/cjs/lib/count.cjs +0 -19
- package/dist/cjs/lib/count.cjs.map +0 -1
- package/dist/cjs/lib/count.d.cts +0 -24
- package/dist/cjs/lib/cycle.cjs +0 -23
- package/dist/cjs/lib/cycle.cjs.map +0 -1
- package/dist/cjs/lib/cycle.d.cts +0 -21
- package/dist/cjs/lib/difference.cjs +0 -18
- package/dist/cjs/lib/difference.cjs.map +0 -1
- package/dist/cjs/lib/difference.d.cts +0 -25
- package/dist/cjs/lib/drop.cjs +0 -24
- package/dist/cjs/lib/drop.cjs.map +0 -1
- package/dist/cjs/lib/drop.d.cts +0 -21
- package/dist/cjs/lib/dropLast.cjs +0 -21
- package/dist/cjs/lib/dropLast.cjs.map +0 -1
- package/dist/cjs/lib/dropLast.d.cts +0 -25
- package/dist/cjs/lib/dropWhile.cjs +0 -21
- package/dist/cjs/lib/dropWhile.cjs.map +0 -1
- package/dist/cjs/lib/dropWhile.d.cts +0 -24
- package/dist/cjs/lib/empty.cjs +0 -14
- package/dist/cjs/lib/empty.cjs.map +0 -1
- package/dist/cjs/lib/empty.d.cts +0 -17
- package/dist/cjs/lib/enumerate.cjs +0 -17
- package/dist/cjs/lib/enumerate.cjs.map +0 -1
- package/dist/cjs/lib/enumerate.d.cts +0 -24
- package/dist/cjs/lib/equal.cjs +0 -15
- package/dist/cjs/lib/equal.cjs.map +0 -1
- package/dist/cjs/lib/equal.d.cts +0 -26
- package/dist/cjs/lib/equalBy.cjs +0 -23
- package/dist/cjs/lib/equalBy.cjs.map +0 -1
- package/dist/cjs/lib/equalBy.d.cts +0 -27
- package/dist/cjs/lib/every.cjs +0 -20
- package/dist/cjs/lib/every.cjs.map +0 -1
- package/dist/cjs/lib/every.d.cts +0 -29
- package/dist/cjs/lib/filter.cjs +0 -19
- package/dist/cjs/lib/filter.cjs.map +0 -1
- package/dist/cjs/lib/filter.d.cts +0 -22
- package/dist/cjs/lib/find.cjs +0 -15
- package/dist/cjs/lib/find.cjs.map +0 -1
- package/dist/cjs/lib/find.d.cts +0 -26
- package/dist/cjs/lib/findIndex.cjs +0 -23
- package/dist/cjs/lib/findIndex.cjs.map +0 -1
- package/dist/cjs/lib/findIndex.d.cts +0 -25
- package/dist/cjs/lib/first.cjs +0 -14
- package/dist/cjs/lib/first.cjs.map +0 -1
- package/dist/cjs/lib/first.d.cts +0 -24
- package/dist/cjs/lib/flat.cjs +0 -16
- package/dist/cjs/lib/flat.cjs.map +0 -1
- package/dist/cjs/lib/flat.d.cts +0 -20
- package/dist/cjs/lib/flatMap.cjs +0 -19
- package/dist/cjs/lib/flatMap.cjs.map +0 -1
- package/dist/cjs/lib/flatMap.d.cts +0 -21
- package/dist/cjs/lib/forEach.cjs +0 -19
- package/dist/cjs/lib/forEach.cjs.map +0 -1
- package/dist/cjs/lib/forEach.d.cts +0 -24
- package/dist/cjs/lib/from.cjs +0 -25
- package/dist/cjs/lib/from.cjs.map +0 -1
- package/dist/cjs/lib/from.d.cts +0 -21
- package/dist/cjs/lib/fuse.cjs +0 -26
- package/dist/cjs/lib/fuse.cjs.map +0 -1
- package/dist/cjs/lib/fuse.d.cts +0 -47
- package/dist/cjs/lib/greaterOrEqualThan.cjs +0 -17
- package/dist/cjs/lib/greaterOrEqualThan.cjs.map +0 -1
- package/dist/cjs/lib/greaterOrEqualThan.d.cts +0 -32
- package/dist/cjs/lib/greaterThan.cjs +0 -17
- package/dist/cjs/lib/greaterThan.cjs.map +0 -1
- package/dist/cjs/lib/greaterThan.d.cts +0 -32
- package/dist/cjs/lib/indexOf.cjs +0 -21
- package/dist/cjs/lib/indexOf.cjs.map +0 -1
- package/dist/cjs/lib/indexOf.d.cts +0 -25
- package/dist/cjs/lib/inspect.cjs +0 -25
- package/dist/cjs/lib/inspect.cjs.map +0 -1
- package/dist/cjs/lib/inspect.d.cts +0 -39
- package/dist/cjs/lib/intersect.cjs +0 -16
- package/dist/cjs/lib/intersect.cjs.map +0 -1
- package/dist/cjs/lib/intersect.d.cts +0 -26
- package/dist/cjs/lib/intersperse.cjs +0 -35
- package/dist/cjs/lib/intersperse.cjs.map +0 -1
- package/dist/cjs/lib/intersperse.d.cts +0 -30
- package/dist/cjs/lib/isEmpty.cjs +0 -14
- package/dist/cjs/lib/isEmpty.cjs.map +0 -1
- package/dist/cjs/lib/isEmpty.d.cts +0 -26
- package/dist/cjs/lib/isSorted.cjs +0 -15
- package/dist/cjs/lib/isSorted.cjs.map +0 -1
- package/dist/cjs/lib/isSorted.d.cts +0 -35
- package/dist/cjs/lib/isSortedBy.cjs +0 -26
- package/dist/cjs/lib/isSortedBy.cjs.map +0 -1
- package/dist/cjs/lib/isSortedBy.d.cts +0 -32
- package/dist/cjs/lib/isSortedByKey.cjs +0 -29
- package/dist/cjs/lib/isSortedByKey.cjs.map +0 -1
- package/dist/cjs/lib/isSortedByKey.d.cts +0 -30
- package/dist/cjs/lib/last.cjs +0 -18
- package/dist/cjs/lib/last.cjs.map +0 -1
- package/dist/cjs/lib/last.d.cts +0 -24
- package/dist/cjs/lib/lessOrEqualThan.cjs +0 -17
- package/dist/cjs/lib/lessOrEqualThan.cjs.map +0 -1
- package/dist/cjs/lib/lessOrEqualThan.d.cts +0 -32
- package/dist/cjs/lib/lessThan.cjs +0 -17
- package/dist/cjs/lib/lessThan.cjs.map +0 -1
- package/dist/cjs/lib/lessThan.d.cts +0 -32
- package/dist/cjs/lib/map.cjs +0 -19
- package/dist/cjs/lib/map.cjs.map +0 -1
- package/dist/cjs/lib/map.d.cts +0 -20
- package/dist/cjs/lib/max.cjs +0 -15
- package/dist/cjs/lib/max.cjs.map +0 -1
- package/dist/cjs/lib/max.d.cts +0 -30
- package/dist/cjs/lib/maxBy.cjs +0 -27
- package/dist/cjs/lib/maxBy.cjs.map +0 -1
- package/dist/cjs/lib/maxBy.d.cts +0 -31
- package/dist/cjs/lib/maxByKey.cjs +0 -32
- package/dist/cjs/lib/maxByKey.cjs.map +0 -1
- package/dist/cjs/lib/maxByKey.d.cts +0 -32
- package/dist/cjs/lib/min.cjs +0 -15
- package/dist/cjs/lib/min.cjs.map +0 -1
- package/dist/cjs/lib/min.d.cts +0 -30
- package/dist/cjs/lib/minBy.cjs +0 -27
- package/dist/cjs/lib/minBy.cjs.map +0 -1
- package/dist/cjs/lib/minBy.d.cts +0 -31
- package/dist/cjs/lib/minByKey.cjs +0 -32
- package/dist/cjs/lib/minByKey.cjs.map +0 -1
- package/dist/cjs/lib/minByKey.d.cts +0 -31
- package/dist/cjs/lib/notEqual.cjs +0 -15
- package/dist/cjs/lib/notEqual.cjs.map +0 -1
- package/dist/cjs/lib/notEqual.d.cts +0 -26
- package/dist/cjs/lib/nth.cjs +0 -12
- package/dist/cjs/lib/nth.cjs.map +0 -1
- package/dist/cjs/lib/nth.d.cts +0 -2
- package/dist/cjs/lib/partition.cjs +0 -26
- package/dist/cjs/lib/partition.cjs.map +0 -1
- package/dist/cjs/lib/partition.d.cts +0 -33
- package/dist/cjs/lib/peekable.cjs +0 -31
- package/dist/cjs/lib/peekable.cjs.map +0 -1
- package/dist/cjs/lib/peekable.d.cts +0 -35
- package/dist/cjs/lib/position.cjs +0 -12
- package/dist/cjs/lib/position.cjs.map +0 -1
- package/dist/cjs/lib/position.d.cts +0 -2
- package/dist/cjs/lib/prepend.cjs +0 -17
- package/dist/cjs/lib/prepend.cjs.map +0 -1
- package/dist/cjs/lib/prepend.d.cts +0 -22
- package/dist/cjs/lib/product.cjs +0 -19
- package/dist/cjs/lib/product.cjs.map +0 -1
- package/dist/cjs/lib/product.d.cts +0 -24
- package/dist/cjs/lib/range.cjs +0 -37
- package/dist/cjs/lib/range.cjs.map +0 -1
- package/dist/cjs/lib/range.d.cts +0 -33
- package/dist/cjs/lib/reduce.cjs +0 -31
- package/dist/cjs/lib/reduce.cjs.map +0 -1
- package/dist/cjs/lib/reduce.d.cts +0 -33
- package/dist/cjs/lib/repeat.cjs +0 -20
- package/dist/cjs/lib/repeat.cjs.map +0 -1
- package/dist/cjs/lib/repeat.d.cts +0 -20
- package/dist/cjs/lib/reverse.cjs +0 -17
- package/dist/cjs/lib/reverse.cjs.map +0 -1
- package/dist/cjs/lib/reverse.d.cts +0 -26
- package/dist/cjs/lib/shared/_assertFunction.cjs +0 -17
- package/dist/cjs/lib/shared/_assertFunction.cjs.map +0 -1
- package/dist/cjs/lib/shared/_assertFunction.d.cts +0 -3
- package/dist/cjs/lib/shared/_assertNotNegative.cjs +0 -17
- package/dist/cjs/lib/shared/_assertNotNegative.cjs.map +0 -1
- package/dist/cjs/lib/shared/_assertNotNegative.d.cts +0 -3
- package/dist/cjs/lib/shared/_assertPositive.cjs +0 -17
- package/dist/cjs/lib/shared/_assertPositive.cjs.map +0 -1
- package/dist/cjs/lib/shared/_assertPositive.d.cts +0 -3
- package/dist/cjs/lib/shared/_compare.cjs +0 -36
- package/dist/cjs/lib/shared/_compare.cjs.map +0 -1
- package/dist/cjs/lib/shared/_compare.d.cts +0 -20
- package/dist/cjs/lib/shared/_makeIterableIterator.cjs +0 -19
- package/dist/cjs/lib/shared/_makeIterableIterator.cjs.map +0 -1
- package/dist/cjs/lib/shared/_makeIterableIterator.d.cts +0 -3
- package/dist/cjs/lib/shared/_toIntegerOrInfinityOrThrow.cjs +0 -18
- package/dist/cjs/lib/shared/_toIntegerOrInfinityOrThrow.cjs.map +0 -1
- package/dist/cjs/lib/shared/_toIntegerOrInfinityOrThrow.d.cts +0 -3
- package/dist/cjs/lib/shared/_toIntegerOrThrow.cjs +0 -18
- package/dist/cjs/lib/shared/_toIntegerOrThrow.cjs.map +0 -1
- package/dist/cjs/lib/shared/_toIntegerOrThrow.d.cts +0 -3
- package/dist/cjs/lib/shared/_toNumberOrThrow.cjs +0 -34
- package/dist/cjs/lib/shared/_toNumberOrThrow.cjs.map +0 -1
- package/dist/cjs/lib/shared/_toNumberOrThrow.d.cts +0 -8
- package/dist/cjs/lib/shared/comparators.cjs +0 -28
- package/dist/cjs/lib/shared/comparators.cjs.map +0 -1
- package/dist/cjs/lib/shared/comparators.d.cts +0 -34
- package/dist/cjs/lib/skip.cjs +0 -12
- package/dist/cjs/lib/skip.cjs.map +0 -1
- package/dist/cjs/lib/skip.d.cts +0 -2
- package/dist/cjs/lib/skipLast.cjs +0 -12
- package/dist/cjs/lib/skipLast.cjs.map +0 -1
- package/dist/cjs/lib/skipLast.d.cts +0 -2
- package/dist/cjs/lib/skipWhile.cjs +0 -12
- package/dist/cjs/lib/skipWhile.cjs.map +0 -1
- package/dist/cjs/lib/skipWhile.d.cts +0 -2
- package/dist/cjs/lib/slice.cjs +0 -43
- package/dist/cjs/lib/slice.cjs.map +0 -1
- package/dist/cjs/lib/slice.d.cts +0 -62
- package/dist/cjs/lib/some.cjs +0 -22
- package/dist/cjs/lib/some.cjs.map +0 -1
- package/dist/cjs/lib/some.d.cts +0 -33
- package/dist/cjs/lib/sorted.cjs +0 -14
- package/dist/cjs/lib/sorted.cjs.map +0 -1
- package/dist/cjs/lib/sorted.d.cts +0 -25
- package/dist/cjs/lib/starMap.cjs +0 -19
- package/dist/cjs/lib/starMap.cjs.map +0 -1
- package/dist/cjs/lib/starMap.d.cts +0 -28
- package/dist/cjs/lib/stepBy.cjs +0 -29
- package/dist/cjs/lib/stepBy.cjs.map +0 -1
- package/dist/cjs/lib/stepBy.d.cts +0 -24
- package/dist/cjs/lib/sum.cjs +0 -19
- package/dist/cjs/lib/sum.cjs.map +0 -1
- package/dist/cjs/lib/sum.d.cts +0 -25
- package/dist/cjs/lib/take.cjs +0 -24
- package/dist/cjs/lib/take.cjs.map +0 -1
- package/dist/cjs/lib/take.d.cts +0 -21
- package/dist/cjs/lib/takeLast.cjs +0 -29
- package/dist/cjs/lib/takeLast.cjs.map +0 -1
- package/dist/cjs/lib/takeLast.d.cts +0 -25
- package/dist/cjs/lib/takeWhile.cjs +0 -12
- package/dist/cjs/lib/takeWhile.cjs.map +0 -1
- package/dist/cjs/lib/takeWhile.d.cts +0 -2
- package/dist/cjs/lib/tee.cjs +0 -38
- package/dist/cjs/lib/tee.cjs.map +0 -1
- package/dist/cjs/lib/tee.d.cts +0 -25
- package/dist/cjs/lib/toArray.cjs +0 -14
- package/dist/cjs/lib/toArray.cjs.map +0 -1
- package/dist/cjs/lib/toArray.d.cts +0 -36
- package/dist/cjs/lib/toIterableIterator.cjs +0 -19
- package/dist/cjs/lib/toIterableIterator.cjs.map +0 -1
- package/dist/cjs/lib/toIterableIterator.d.cts +0 -32
- package/dist/cjs/lib/union.cjs +0 -22
- package/dist/cjs/lib/union.cjs.map +0 -1
- package/dist/cjs/lib/union.d.cts +0 -21
- package/dist/cjs/lib/unique.cjs +0 -14
- package/dist/cjs/lib/unique.cjs.map +0 -1
- package/dist/cjs/lib/unique.d.cts +0 -20
- package/dist/cjs/lib/unzip.cjs +0 -36
- package/dist/cjs/lib/unzip.cjs.map +0 -1
- package/dist/cjs/lib/unzip.d.cts +0 -32
- package/dist/cjs/lib/windows.cjs +0 -29
- package/dist/cjs/lib/windows.cjs.map +0 -1
- package/dist/cjs/lib/windows.d.cts +0 -21
- package/dist/cjs/lib/zip.cjs +0 -23
- package/dist/cjs/lib/zip.cjs.map +0 -1
- package/dist/cjs/lib/zip.d.cts +0 -30
- package/dist/esm/chunk-PAWJFY3S.mjs +0 -6
- package/dist/esm/chunk-PAWJFY3S.mjs.map +0 -1
- package/dist/esm/index.d.mts +0 -79
- package/dist/esm/index.mjs +0 -88
- package/dist/esm/index.mjs.map +0 -1
- package/dist/esm/lib/all.d.mts +0 -2
- package/dist/esm/lib/all.mjs +0 -4
- package/dist/esm/lib/all.mjs.map +0 -1
- package/dist/esm/lib/any.d.mts +0 -2
- package/dist/esm/lib/any.mjs +0 -4
- package/dist/esm/lib/any.mjs.map +0 -1
- package/dist/esm/lib/append.d.mts +0 -21
- package/dist/esm/lib/append.mjs +0 -11
- package/dist/esm/lib/append.mjs.map +0 -1
- package/dist/esm/lib/at.d.mts +0 -25
- package/dist/esm/lib/at.mjs +0 -15
- package/dist/esm/lib/at.mjs.map +0 -1
- package/dist/esm/lib/average.d.mts +0 -25
- package/dist/esm/lib/average.mjs +0 -18
- package/dist/esm/lib/average.mjs.map +0 -1
- package/dist/esm/lib/chain.d.mts +0 -20
- package/dist/esm/lib/chain.mjs +0 -13
- package/dist/esm/lib/chain.mjs.map +0 -1
- package/dist/esm/lib/chunk.d.mts +0 -20
- package/dist/esm/lib/chunk.mjs +0 -24
- package/dist/esm/lib/chunk.mjs.map +0 -1
- package/dist/esm/lib/collect.d.mts +0 -2
- package/dist/esm/lib/collect.mjs +0 -4
- package/dist/esm/lib/collect.mjs.map +0 -1
- package/dist/esm/lib/collectInto.d.mts +0 -29
- package/dist/esm/lib/collectInto.mjs +0 -14
- package/dist/esm/lib/collectInto.mjs.map +0 -1
- package/dist/esm/lib/compact.d.mts +0 -19
- package/dist/esm/lib/compact.mjs +0 -11
- package/dist/esm/lib/compact.mjs.map +0 -1
- package/dist/esm/lib/compare.d.mts +0 -32
- package/dist/esm/lib/compare.mjs +0 -12
- package/dist/esm/lib/compare.mjs.map +0 -1
- package/dist/esm/lib/compareBy.d.mts +0 -31
- package/dist/esm/lib/compareBy.mjs +0 -23
- package/dist/esm/lib/compareBy.mjs.map +0 -1
- package/dist/esm/lib/compress.d.mts +0 -26
- package/dist/esm/lib/compress.mjs +0 -21
- package/dist/esm/lib/compress.mjs.map +0 -1
- package/dist/esm/lib/contains.d.mts +0 -25
- package/dist/esm/lib/contains.mjs +0 -14
- package/dist/esm/lib/contains.mjs.map +0 -1
- package/dist/esm/lib/count.d.mts +0 -24
- package/dist/esm/lib/count.mjs +0 -16
- package/dist/esm/lib/count.mjs.map +0 -1
- package/dist/esm/lib/cycle.d.mts +0 -21
- package/dist/esm/lib/cycle.mjs +0 -20
- package/dist/esm/lib/cycle.mjs.map +0 -1
- package/dist/esm/lib/difference.d.mts +0 -25
- package/dist/esm/lib/difference.mjs +0 -13
- package/dist/esm/lib/difference.mjs.map +0 -1
- package/dist/esm/lib/drop.d.mts +0 -21
- package/dist/esm/lib/drop.mjs +0 -21
- package/dist/esm/lib/drop.mjs.map +0 -1
- package/dist/esm/lib/dropLast.d.mts +0 -25
- package/dist/esm/lib/dropLast.mjs +0 -18
- package/dist/esm/lib/dropLast.mjs.map +0 -1
- package/dist/esm/lib/dropWhile.d.mts +0 -24
- package/dist/esm/lib/dropWhile.mjs +0 -18
- package/dist/esm/lib/dropWhile.mjs.map +0 -1
- package/dist/esm/lib/empty.d.mts +0 -17
- package/dist/esm/lib/empty.mjs +0 -11
- package/dist/esm/lib/empty.mjs.map +0 -1
- package/dist/esm/lib/enumerate.d.mts +0 -24
- package/dist/esm/lib/enumerate.mjs +0 -14
- package/dist/esm/lib/enumerate.mjs.map +0 -1
- package/dist/esm/lib/equal.d.mts +0 -26
- package/dist/esm/lib/equal.mjs +0 -11
- package/dist/esm/lib/equal.mjs.map +0 -1
- package/dist/esm/lib/equalBy.d.mts +0 -27
- package/dist/esm/lib/equalBy.mjs +0 -19
- package/dist/esm/lib/equalBy.mjs.map +0 -1
- package/dist/esm/lib/every.d.mts +0 -29
- package/dist/esm/lib/every.mjs +0 -17
- package/dist/esm/lib/every.mjs.map +0 -1
- package/dist/esm/lib/filter.d.mts +0 -22
- package/dist/esm/lib/filter.mjs +0 -16
- package/dist/esm/lib/filter.mjs.map +0 -1
- package/dist/esm/lib/find.d.mts +0 -26
- package/dist/esm/lib/find.mjs +0 -12
- package/dist/esm/lib/find.mjs.map +0 -1
- package/dist/esm/lib/findIndex.d.mts +0 -25
- package/dist/esm/lib/findIndex.mjs +0 -20
- package/dist/esm/lib/findIndex.mjs.map +0 -1
- package/dist/esm/lib/first.d.mts +0 -24
- package/dist/esm/lib/first.mjs +0 -11
- package/dist/esm/lib/first.mjs.map +0 -1
- package/dist/esm/lib/flat.d.mts +0 -20
- package/dist/esm/lib/flat.mjs +0 -13
- package/dist/esm/lib/flat.mjs.map +0 -1
- package/dist/esm/lib/flatMap.d.mts +0 -21
- package/dist/esm/lib/flatMap.mjs +0 -16
- package/dist/esm/lib/flatMap.mjs.map +0 -1
- package/dist/esm/lib/forEach.d.mts +0 -24
- package/dist/esm/lib/forEach.mjs +0 -16
- package/dist/esm/lib/forEach.mjs.map +0 -1
- package/dist/esm/lib/from.d.mts +0 -21
- package/dist/esm/lib/from.mjs +0 -22
- package/dist/esm/lib/from.mjs.map +0 -1
- package/dist/esm/lib/fuse.d.mts +0 -47
- package/dist/esm/lib/fuse.mjs +0 -23
- package/dist/esm/lib/fuse.mjs.map +0 -1
- package/dist/esm/lib/greaterOrEqualThan.d.mts +0 -32
- package/dist/esm/lib/greaterOrEqualThan.mjs +0 -13
- package/dist/esm/lib/greaterOrEqualThan.mjs.map +0 -1
- package/dist/esm/lib/greaterThan.d.mts +0 -32
- package/dist/esm/lib/greaterThan.mjs +0 -13
- package/dist/esm/lib/greaterThan.mjs.map +0 -1
- package/dist/esm/lib/indexOf.d.mts +0 -25
- package/dist/esm/lib/indexOf.mjs +0 -18
- package/dist/esm/lib/indexOf.mjs.map +0 -1
- package/dist/esm/lib/inspect.d.mts +0 -39
- package/dist/esm/lib/inspect.mjs +0 -22
- package/dist/esm/lib/inspect.mjs.map +0 -1
- package/dist/esm/lib/intersect.d.mts +0 -26
- package/dist/esm/lib/intersect.mjs +0 -13
- package/dist/esm/lib/intersect.mjs.map +0 -1
- package/dist/esm/lib/intersperse.d.mts +0 -30
- package/dist/esm/lib/intersperse.mjs +0 -32
- package/dist/esm/lib/intersperse.mjs.map +0 -1
- package/dist/esm/lib/isEmpty.d.mts +0 -26
- package/dist/esm/lib/isEmpty.mjs +0 -11
- package/dist/esm/lib/isEmpty.mjs.map +0 -1
- package/dist/esm/lib/isSorted.d.mts +0 -35
- package/dist/esm/lib/isSorted.mjs +0 -12
- package/dist/esm/lib/isSorted.mjs.map +0 -1
- package/dist/esm/lib/isSortedBy.d.mts +0 -32
- package/dist/esm/lib/isSortedBy.mjs +0 -23
- package/dist/esm/lib/isSortedBy.mjs.map +0 -1
- package/dist/esm/lib/isSortedByKey.d.mts +0 -30
- package/dist/esm/lib/isSortedByKey.mjs +0 -26
- package/dist/esm/lib/isSortedByKey.mjs.map +0 -1
- package/dist/esm/lib/last.d.mts +0 -24
- package/dist/esm/lib/last.mjs +0 -15
- package/dist/esm/lib/last.mjs.map +0 -1
- package/dist/esm/lib/lessOrEqualThan.d.mts +0 -32
- package/dist/esm/lib/lessOrEqualThan.mjs +0 -13
- package/dist/esm/lib/lessOrEqualThan.mjs.map +0 -1
- package/dist/esm/lib/lessThan.d.mts +0 -32
- package/dist/esm/lib/lessThan.mjs +0 -13
- package/dist/esm/lib/lessThan.mjs.map +0 -1
- package/dist/esm/lib/map.d.mts +0 -20
- package/dist/esm/lib/map.mjs +0 -16
- package/dist/esm/lib/map.mjs.map +0 -1
- package/dist/esm/lib/max.d.mts +0 -30
- package/dist/esm/lib/max.mjs +0 -12
- package/dist/esm/lib/max.mjs.map +0 -1
- package/dist/esm/lib/maxBy.d.mts +0 -31
- package/dist/esm/lib/maxBy.mjs +0 -24
- package/dist/esm/lib/maxBy.mjs.map +0 -1
- package/dist/esm/lib/maxByKey.d.mts +0 -32
- package/dist/esm/lib/maxByKey.mjs +0 -29
- package/dist/esm/lib/maxByKey.mjs.map +0 -1
- package/dist/esm/lib/min.d.mts +0 -30
- package/dist/esm/lib/min.mjs +0 -12
- package/dist/esm/lib/min.mjs.map +0 -1
- package/dist/esm/lib/minBy.d.mts +0 -31
- package/dist/esm/lib/minBy.mjs +0 -24
- package/dist/esm/lib/minBy.mjs.map +0 -1
- package/dist/esm/lib/minByKey.d.mts +0 -31
- package/dist/esm/lib/minByKey.mjs +0 -29
- package/dist/esm/lib/minByKey.mjs.map +0 -1
- package/dist/esm/lib/notEqual.d.mts +0 -26
- package/dist/esm/lib/notEqual.mjs +0 -11
- package/dist/esm/lib/notEqual.mjs.map +0 -1
- package/dist/esm/lib/nth.d.mts +0 -2
- package/dist/esm/lib/nth.mjs +0 -4
- package/dist/esm/lib/nth.mjs.map +0 -1
- package/dist/esm/lib/partition.d.mts +0 -33
- package/dist/esm/lib/partition.mjs +0 -23
- package/dist/esm/lib/partition.mjs.map +0 -1
- package/dist/esm/lib/peekable.d.mts +0 -35
- package/dist/esm/lib/peekable.mjs +0 -28
- package/dist/esm/lib/peekable.mjs.map +0 -1
- package/dist/esm/lib/position.d.mts +0 -2
- package/dist/esm/lib/position.mjs +0 -4
- package/dist/esm/lib/position.mjs.map +0 -1
- package/dist/esm/lib/prepend.d.mts +0 -22
- package/dist/esm/lib/prepend.mjs +0 -14
- package/dist/esm/lib/prepend.mjs.map +0 -1
- package/dist/esm/lib/product.d.mts +0 -24
- package/dist/esm/lib/product.mjs +0 -16
- package/dist/esm/lib/product.mjs.map +0 -1
- package/dist/esm/lib/range.d.mts +0 -33
- package/dist/esm/lib/range.mjs +0 -34
- package/dist/esm/lib/range.mjs.map +0 -1
- package/dist/esm/lib/reduce.d.mts +0 -33
- package/dist/esm/lib/reduce.mjs +0 -28
- package/dist/esm/lib/reduce.mjs.map +0 -1
- package/dist/esm/lib/repeat.d.mts +0 -20
- package/dist/esm/lib/repeat.mjs +0 -17
- package/dist/esm/lib/repeat.mjs.map +0 -1
- package/dist/esm/lib/reverse.d.mts +0 -26
- package/dist/esm/lib/reverse.mjs +0 -14
- package/dist/esm/lib/reverse.mjs.map +0 -1
- package/dist/esm/lib/shared/_assertFunction.d.mts +0 -3
- package/dist/esm/lib/shared/_assertFunction.mjs +0 -14
- package/dist/esm/lib/shared/_assertFunction.mjs.map +0 -1
- package/dist/esm/lib/shared/_assertNotNegative.d.mts +0 -3
- package/dist/esm/lib/shared/_assertNotNegative.mjs +0 -14
- package/dist/esm/lib/shared/_assertNotNegative.mjs.map +0 -1
- package/dist/esm/lib/shared/_assertPositive.d.mts +0 -3
- package/dist/esm/lib/shared/_assertPositive.mjs +0 -14
- package/dist/esm/lib/shared/_assertPositive.mjs.map +0 -1
- package/dist/esm/lib/shared/_compare.d.mts +0 -20
- package/dist/esm/lib/shared/_compare.mjs +0 -30
- package/dist/esm/lib/shared/_compare.mjs.map +0 -1
- package/dist/esm/lib/shared/_makeIterableIterator.d.mts +0 -3
- package/dist/esm/lib/shared/_makeIterableIterator.mjs +0 -16
- package/dist/esm/lib/shared/_makeIterableIterator.mjs.map +0 -1
- package/dist/esm/lib/shared/_toIntegerOrInfinityOrThrow.d.mts +0 -3
- package/dist/esm/lib/shared/_toIntegerOrInfinityOrThrow.mjs +0 -15
- package/dist/esm/lib/shared/_toIntegerOrInfinityOrThrow.mjs.map +0 -1
- package/dist/esm/lib/shared/_toIntegerOrThrow.d.mts +0 -3
- package/dist/esm/lib/shared/_toIntegerOrThrow.mjs +0 -15
- package/dist/esm/lib/shared/_toIntegerOrThrow.mjs.map +0 -1
- package/dist/esm/lib/shared/_toNumberOrThrow.d.mts +0 -8
- package/dist/esm/lib/shared/_toNumberOrThrow.mjs +0 -31
- package/dist/esm/lib/shared/_toNumberOrThrow.mjs.map +0 -1
- package/dist/esm/lib/shared/comparators.d.mts +0 -34
- package/dist/esm/lib/shared/comparators.mjs +0 -21
- package/dist/esm/lib/shared/comparators.mjs.map +0 -1
- package/dist/esm/lib/skip.d.mts +0 -2
- package/dist/esm/lib/skip.mjs +0 -4
- package/dist/esm/lib/skip.mjs.map +0 -1
- package/dist/esm/lib/skipLast.d.mts +0 -2
- package/dist/esm/lib/skipLast.mjs +0 -4
- package/dist/esm/lib/skipLast.mjs.map +0 -1
- package/dist/esm/lib/skipWhile.d.mts +0 -2
- package/dist/esm/lib/skipWhile.mjs +0 -4
- package/dist/esm/lib/skipWhile.mjs.map +0 -1
- package/dist/esm/lib/slice.d.mts +0 -62
- package/dist/esm/lib/slice.mjs +0 -40
- package/dist/esm/lib/slice.mjs.map +0 -1
- package/dist/esm/lib/some.d.mts +0 -33
- package/dist/esm/lib/some.mjs +0 -19
- package/dist/esm/lib/some.mjs.map +0 -1
- package/dist/esm/lib/sorted.d.mts +0 -25
- package/dist/esm/lib/sorted.mjs +0 -11
- package/dist/esm/lib/sorted.mjs.map +0 -1
- package/dist/esm/lib/starMap.d.mts +0 -28
- package/dist/esm/lib/starMap.mjs +0 -16
- package/dist/esm/lib/starMap.mjs.map +0 -1
- package/dist/esm/lib/stepBy.d.mts +0 -24
- package/dist/esm/lib/stepBy.mjs +0 -26
- package/dist/esm/lib/stepBy.mjs.map +0 -1
- package/dist/esm/lib/sum.d.mts +0 -25
- package/dist/esm/lib/sum.mjs +0 -16
- package/dist/esm/lib/sum.mjs.map +0 -1
- package/dist/esm/lib/take.d.mts +0 -21
- package/dist/esm/lib/take.mjs +0 -21
- package/dist/esm/lib/take.mjs.map +0 -1
- package/dist/esm/lib/takeLast.d.mts +0 -25
- package/dist/esm/lib/takeLast.mjs +0 -26
- package/dist/esm/lib/takeLast.mjs.map +0 -1
- package/dist/esm/lib/takeWhile.d.mts +0 -2
- package/dist/esm/lib/takeWhile.mjs +0 -4
- package/dist/esm/lib/takeWhile.mjs.map +0 -1
- package/dist/esm/lib/tee.d.mts +0 -25
- package/dist/esm/lib/tee.mjs +0 -35
- package/dist/esm/lib/tee.mjs.map +0 -1
- package/dist/esm/lib/toArray.d.mts +0 -36
- package/dist/esm/lib/toArray.mjs +0 -11
- package/dist/esm/lib/toArray.mjs.map +0 -1
- package/dist/esm/lib/toIterableIterator.d.mts +0 -32
- package/dist/esm/lib/toIterableIterator.mjs +0 -16
- package/dist/esm/lib/toIterableIterator.mjs.map +0 -1
- package/dist/esm/lib/union.d.mts +0 -21
- package/dist/esm/lib/union.mjs +0 -19
- package/dist/esm/lib/union.mjs.map +0 -1
- package/dist/esm/lib/unique.d.mts +0 -20
- package/dist/esm/lib/unique.mjs +0 -11
- package/dist/esm/lib/unique.mjs.map +0 -1
- package/dist/esm/lib/unzip.d.mts +0 -32
- package/dist/esm/lib/unzip.mjs +0 -33
- package/dist/esm/lib/unzip.mjs.map +0 -1
- package/dist/esm/lib/windows.d.mts +0 -21
- package/dist/esm/lib/windows.mjs +0 -26
- package/dist/esm/lib/windows.mjs.map +0 -1
- package/dist/esm/lib/zip.d.mts +0 -30
- package/dist/esm/lib/zip.mjs +0 -20
- package/dist/esm/lib/zip.mjs.map +0 -1
- package/dist/iife/index.global.js +0 -1171
- package/dist/iife/index.global.js.map +0 -1
|
@@ -0,0 +1,49 @@
|
|
|
1
|
+
import { assertFunction } from "./shared/_assertFunction.mjs";
|
|
2
|
+
import { compareIteratorElements, orderingIsLess } from "./shared/_compare.mjs";
|
|
3
|
+
import { ascString as defaultCompare } from "./shared/comparators.mjs";
|
|
4
|
+
import { toIterableIterator } from "./toIterableIterator.mjs";
|
|
5
|
+
|
|
6
|
+
// src/lib/minByKey.ts
|
|
7
|
+
/**
|
|
8
|
+
* Returns the element that gives the minimum value from the specified function.
|
|
9
|
+
*
|
|
10
|
+
* If several elements are equally minimum, the last element is returned. If the iterator is empty, `null` is returned.
|
|
11
|
+
*
|
|
12
|
+
* @see {@link min} for a version that uses the default comparator.
|
|
13
|
+
* @see {@link minBy} for a version that allows custom comparators.
|
|
14
|
+
* @param iterable - An iterator of number values to determine the minimum value of.
|
|
15
|
+
* @param callbackFn - A function to execute for each element produced by the iterator. It should return a number value.
|
|
16
|
+
* @returns The element that gives the minimum value from the specified function, or `null` if the iterator is empty.
|
|
17
|
+
* @example
|
|
18
|
+
* ```typescript
|
|
19
|
+
* import { minByKey } from '@sapphire/iterator-utilities';
|
|
20
|
+
*
|
|
21
|
+
* const iterable = [-3, 0, 1, 5, -10];
|
|
22
|
+
* console.log(minByKey(iterable, (value) => Math.abs(value)));
|
|
23
|
+
* // Output: 0
|
|
24
|
+
* ```
|
|
25
|
+
* @remarks
|
|
26
|
+
*
|
|
27
|
+
* This function consumes the entire iterator.
|
|
28
|
+
*/
|
|
29
|
+
function minByKey(iterable, callbackFn, comparator = defaultCompare) {
|
|
30
|
+
callbackFn = assertFunction(callbackFn);
|
|
31
|
+
const iterator = toIterableIterator(iterable);
|
|
32
|
+
const first = iterator.next();
|
|
33
|
+
if (first.done) return null;
|
|
34
|
+
let minimum = first.value;
|
|
35
|
+
let minimumKey = callbackFn(minimum, 0);
|
|
36
|
+
let index = 1;
|
|
37
|
+
for (const value of iterator) {
|
|
38
|
+
const key = callbackFn(value, index++);
|
|
39
|
+
const comparison = compareIteratorElements(minimumKey, key, comparator);
|
|
40
|
+
if (!orderingIsLess(comparison)) {
|
|
41
|
+
minimum = value;
|
|
42
|
+
minimumKey = key;
|
|
43
|
+
}
|
|
44
|
+
}
|
|
45
|
+
return minimum;
|
|
46
|
+
}
|
|
47
|
+
|
|
48
|
+
export { minByKey };
|
|
49
|
+
//# sourceMappingURL=minByKey.mjs.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"minByKey.mjs","names":[],"sources":["../../src/lib/minByKey.ts"],"sourcesContent":["import type { IterableResolvable } from './from';\nimport type { min } from './min';\nimport type { minBy } from './minBy';\nimport { assertFunction } from './shared/_assertFunction';\nimport { compareIteratorElements, orderingIsLess, type CompareByComparator } from './shared/_compare';\nimport { defaultCompare } from './shared/comparators';\nimport { toIterableIterator } from './toIterableIterator';\n\n/**\n * Returns the element that gives the minimum value from the specified function.\n *\n * If several elements are equally minimum, the last element is returned. If the iterator is empty, `null` is returned.\n *\n * @see {@link min} for a version that uses the default comparator.\n * @see {@link minBy} for a version that allows custom comparators.\n * @param iterable - An iterator of number values to determine the minimum value of.\n * @param callbackFn - A function to execute for each element produced by the iterator. It should return a number value.\n * @returns The element that gives the minimum value from the specified function, or `null` if the iterator is empty.\n * @example\n * ```typescript\n * import { minByKey } from '@sapphire/iterator-utilities';\n *\n * const iterable = [-3, 0, 1, 5, -10];\n * console.log(minByKey(iterable, (value) => Math.abs(value)));\n * // Output: 0\n * ```\n * @remarks\n *\n * This function consumes the entire iterator.\n */\nexport function minByKey<const ElementType, const MappedType>(\n\titerable: IterableResolvable<ElementType>,\n\tcallbackFn: (element: ElementType, index: number) => MappedType,\n\tcomparator: CompareByComparator<MappedType> = defaultCompare\n): ElementType | null {\n\t// eslint-disable-next-line no-param-reassign\n\tcallbackFn = assertFunction(callbackFn);\n\n\tconst iterator = toIterableIterator(iterable);\n\tconst first = iterator.next();\n\tif (first.done) return null;\n\n\tlet minimum = first.value;\n\tlet minimumKey = callbackFn(minimum, 0);\n\tlet index = 1;\n\tfor (const value of iterator) {\n\t\tconst key = callbackFn(value, index++);\n\t\tconst comparison = compareIteratorElements<MappedType>(minimumKey, key, comparator);\n\n\t\tif (!orderingIsLess(comparison)) {\n\t\t\tminimum = value;\n\t\t\tminimumKey = key;\n\t\t}\n\t}\n\n\treturn minimum;\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;AA8BA,SAAgB,SACf,UACA,YACA,aAA8C,gBACzB;CAErB,aAAa,eAAe,UAAU;CAEtC,MAAM,WAAW,mBAAmB,QAAQ;CAC5C,MAAM,QAAQ,SAAS,KAAK;CAC5B,IAAI,MAAM,MAAM,OAAO;CAEvB,IAAI,UAAU,MAAM;CACpB,IAAI,aAAa,WAAW,SAAS,CAAC;CACtC,IAAI,QAAQ;CACZ,KAAK,MAAM,SAAS,UAAU;EAC7B,MAAM,MAAM,WAAW,OAAO,OAAO;EACrC,MAAM,aAAa,wBAAoC,YAAY,KAAK,UAAU;EAElF,IAAI,CAAC,eAAe,UAAU,GAAG;GAChC,UAAU;GACV,aAAa;EACd;CACD;CAEA,OAAO;AACR"}
|
|
@@ -0,0 +1,23 @@
|
|
|
1
|
+
import { IterableResolvable } from "./from.mjs";
|
|
2
|
+
/**
|
|
3
|
+
* Determines if the elements of both iterators are not equal.
|
|
4
|
+
*
|
|
5
|
+
* @param iterable - The iterator to compare.
|
|
6
|
+
* @param other - The iterator to compare against.
|
|
7
|
+
* @returns Whether the two iterators are not equal.
|
|
8
|
+
* @example
|
|
9
|
+
* ```typescript
|
|
10
|
+
* import { notEqual } from '@sapphire/iterator-utilities';
|
|
11
|
+
*
|
|
12
|
+
* console.log(notEqual([1], [1]));
|
|
13
|
+
* // Output: false
|
|
14
|
+
* console.log(notEqual([1], [1, 2]));
|
|
15
|
+
* // Output: true
|
|
16
|
+
* ```
|
|
17
|
+
* @remarks
|
|
18
|
+
*
|
|
19
|
+
* This function consumes the entire iterator.
|
|
20
|
+
*/
|
|
21
|
+
export declare function notEqual<const ElementType>(iterable: IterableResolvable<ElementType>, other: IterableResolvable<ElementType>): boolean;
|
|
22
|
+
export { notEqual as ne };
|
|
23
|
+
//# sourceMappingURL=notEqual.d.mts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"notEqual.d.mts","names":[],"sources":["../../src/lib/notEqual.ts"],"mappings":";;;;;;;;;;;;;;;;;;;;wBAsBgB,eAAe,aAAa,UAAU,mBAAmB,cAAc,OAAO,mBAAmB"}
|
|
@@ -0,0 +1,28 @@
|
|
|
1
|
+
import { eq as equal } from "./equal.mjs";
|
|
2
|
+
|
|
3
|
+
// src/lib/notEqual.ts
|
|
4
|
+
/**
|
|
5
|
+
* Determines if the elements of both iterators are not equal.
|
|
6
|
+
*
|
|
7
|
+
* @param iterable - The iterator to compare.
|
|
8
|
+
* @param other - The iterator to compare against.
|
|
9
|
+
* @returns Whether the two iterators are not equal.
|
|
10
|
+
* @example
|
|
11
|
+
* ```typescript
|
|
12
|
+
* import { notEqual } from '@sapphire/iterator-utilities';
|
|
13
|
+
*
|
|
14
|
+
* console.log(notEqual([1], [1]));
|
|
15
|
+
* // Output: false
|
|
16
|
+
* console.log(notEqual([1], [1, 2]));
|
|
17
|
+
* // Output: true
|
|
18
|
+
* ```
|
|
19
|
+
* @remarks
|
|
20
|
+
*
|
|
21
|
+
* This function consumes the entire iterator.
|
|
22
|
+
*/
|
|
23
|
+
function notEqual(iterable, other) {
|
|
24
|
+
return !equal(iterable, other);
|
|
25
|
+
}
|
|
26
|
+
|
|
27
|
+
export { notEqual as ne, notEqual };
|
|
28
|
+
//# sourceMappingURL=notEqual.mjs.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"notEqual.mjs","names":[],"sources":["../../src/lib/notEqual.ts"],"sourcesContent":["import { equal } from './equal';\nimport type { IterableResolvable } from './from';\n\n/**\n * Determines if the elements of both iterators are not equal.\n *\n * @param iterable - The iterator to compare.\n * @param other - The iterator to compare against.\n * @returns Whether the two iterators are not equal.\n * @example\n * ```typescript\n * import { notEqual } from '@sapphire/iterator-utilities';\n *\n * console.log(notEqual([1], [1]));\n * // Output: false\n * console.log(notEqual([1], [1, 2]));\n * // Output: true\n * ```\n * @remarks\n *\n * This function consumes the entire iterator.\n */\nexport function notEqual<const ElementType>(iterable: IterableResolvable<ElementType>, other: IterableResolvable<ElementType>): boolean {\n\treturn !equal(iterable, other);\n}\n\nexport { notEqual as ne };\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;AAsBA,SAAgB,SAA4B,UAA2C,OAAiD;CACvI,OAAO,CAAC,MAAM,UAAU,KAAK;AAC9B"}
|
package/dist/lib/nth.mjs
ADDED
|
@@ -0,0 +1,29 @@
|
|
|
1
|
+
import { IterableResolvable } from "./from.mjs";
|
|
2
|
+
/**
|
|
3
|
+
* Consumes the iterable and creates two arrays, one with the elements that pass the test and another with the elements that don't.
|
|
4
|
+
*
|
|
5
|
+
* @param iterable - An iterator to partition.
|
|
6
|
+
* @param predicate - A function that determines which partition an element belongs to.
|
|
7
|
+
* @returns An array containing two iterators. The first iterator contains elements that satisfy the predicate, and the
|
|
8
|
+
* second iterator contains elements that do not.
|
|
9
|
+
* @example
|
|
10
|
+
* ```typescript
|
|
11
|
+
* import { partition } from '@sapphire/iterator-utilities';
|
|
12
|
+
*
|
|
13
|
+
* const iterable = [1, 2, 3, 4, 5];
|
|
14
|
+
* const [even, odd] = partition(iterable, (value) => value % 2 === 0);
|
|
15
|
+
*
|
|
16
|
+
* console.log(even);
|
|
17
|
+
* // Output: [2, 4]
|
|
18
|
+
*
|
|
19
|
+
* console.log(odd);
|
|
20
|
+
* // Output: [1, 3, 5]
|
|
21
|
+
* ```
|
|
22
|
+
* @remarks
|
|
23
|
+
*
|
|
24
|
+
* This function collects all elements of the provided iterator into two arrays based on the predicate before returning
|
|
25
|
+
* them, which may not be desirable for large iterators.
|
|
26
|
+
*/
|
|
27
|
+
export declare function partition<const ElementType, const FilteredType extends ElementType>(iterable: IterableResolvable<ElementType>, predicate: (value: ElementType, index: number) => value is FilteredType): [FilteredType[], Exclude<ElementType, FilteredType>[]];
|
|
28
|
+
export declare function partition<const ElementType>(iterable: IterableResolvable<ElementType>, predicate: (value: ElementType, index: number) => boolean): [ElementType[], ElementType[]];
|
|
29
|
+
//# sourceMappingURL=partition.d.mts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"partition.d.mts","names":[],"sources":["../../src/lib/partition.ts"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;wBA6BgB,gBAAgB,mBAAmB,qBAAqB,aACvE,UAAU,mBAAmB,cAC7B,YAAY,OAAO,aAAa,kBAAkB,SAAS,gBACxD,gBAAgB,QAAQ,aAAa;wBACzB,gBAAgB,aAC/B,UAAU,mBAAmB,cAC7B,YAAY,OAAO,aAAa,6BAC7B,eAAe"}
|
|
@@ -0,0 +1,16 @@
|
|
|
1
|
+
import { assertFunction } from "./shared/_assertFunction.mjs";
|
|
2
|
+
import { toIterableIterator } from "./toIterableIterator.mjs";
|
|
3
|
+
|
|
4
|
+
// src/lib/partition.ts
|
|
5
|
+
function partition(iterable, predicate) {
|
|
6
|
+
predicate = assertFunction(predicate);
|
|
7
|
+
const bufferLeft = [];
|
|
8
|
+
const bufferRight = [];
|
|
9
|
+
let index = 0;
|
|
10
|
+
for (const value of toIterableIterator(iterable)) if (predicate(value, index++)) bufferLeft.push(value);
|
|
11
|
+
else bufferRight.push(value);
|
|
12
|
+
return [bufferLeft, bufferRight];
|
|
13
|
+
}
|
|
14
|
+
|
|
15
|
+
export { partition };
|
|
16
|
+
//# sourceMappingURL=partition.mjs.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"partition.mjs","names":[],"sources":["../../src/lib/partition.ts"],"sourcesContent":["import type { IterableResolvable } from './from';\nimport { assertFunction } from './shared/_assertFunction';\nimport { toIterableIterator } from './toIterableIterator';\n\n/**\n * Consumes the iterable and creates two arrays, one with the elements that pass the test and another with the elements that don't.\n *\n * @param iterable - An iterator to partition.\n * @param predicate - A function that determines which partition an element belongs to.\n * @returns An array containing two iterators. The first iterator contains elements that satisfy the predicate, and the\n * second iterator contains elements that do not.\n * @example\n * ```typescript\n * import { partition } from '@sapphire/iterator-utilities';\n *\n * const iterable = [1, 2, 3, 4, 5];\n * const [even, odd] = partition(iterable, (value) => value % 2 === 0);\n *\n * console.log(even);\n * // Output: [2, 4]\n *\n * console.log(odd);\n * // Output: [1, 3, 5]\n * ```\n * @remarks\n *\n * This function collects all elements of the provided iterator into two arrays based on the predicate before returning\n * them, which may not be desirable for large iterators.\n */\nexport function partition<const ElementType, const FilteredType extends ElementType>(\n\titerable: IterableResolvable<ElementType>,\n\tpredicate: (value: ElementType, index: number) => value is FilteredType\n): [FilteredType[], Exclude<ElementType, FilteredType>[]];\nexport function partition<const ElementType>(\n\titerable: IterableResolvable<ElementType>,\n\tpredicate: (value: ElementType, index: number) => boolean\n): [ElementType[], ElementType[]];\n\nexport function partition<const ElementType>(\n\titerable: IterableResolvable<ElementType>,\n\tpredicate: (value: ElementType, index: number) => boolean\n): [ElementType[], ElementType[]] {\n\t// eslint-disable-next-line no-param-reassign\n\tpredicate = assertFunction(predicate);\n\n\tconst bufferLeft: ElementType[] = [];\n\tconst bufferRight: ElementType[] = [];\n\n\tlet index = 0;\n\tfor (const value of toIterableIterator(iterable)) {\n\t\tif (predicate(value, index++)) {\n\t\t\tbufferLeft.push(value);\n\t\t} else {\n\t\t\tbufferRight.push(value);\n\t\t}\n\t}\n\n\treturn [bufferLeft, bufferRight];\n}\n"],"mappings":";;;;AAsCA,SAAgB,UACf,UACA,WACiC;CAEjC,YAAY,eAAe,SAAS;CAEpC,MAAM,aAA4B,CAAC;CACnC,MAAM,cAA6B,CAAC;CAEpC,IAAI,QAAQ;CACZ,KAAK,MAAM,SAAS,mBAAmB,QAAQ,GAC9C,IAAI,UAAU,OAAO,OAAO,GAC3B,WAAW,KAAK,KAAK;MAErB,YAAY,KAAK,KAAK;CAIxB,OAAO,CAAC,YAAY,WAAW;AAChC"}
|
|
@@ -0,0 +1,32 @@
|
|
|
1
|
+
import { IterableResolvable } from "./from.mjs";
|
|
2
|
+
/**
|
|
3
|
+
* Creates an iterator that allows you to peek at the next element without advancing the iterator.
|
|
4
|
+
*
|
|
5
|
+
* @typeParam ElementType - The type of elements in the iterable.
|
|
6
|
+
* @param iterable - The iterable to create a peekable iterator from.
|
|
7
|
+
* @returns A new peekable iterator.
|
|
8
|
+
* @example
|
|
9
|
+
* ```typescript
|
|
10
|
+
* import { peekable } from '@sapphire/iterator-utilities';
|
|
11
|
+
*
|
|
12
|
+
* const iterable = [1, 2, 3, 4, 5];
|
|
13
|
+
* const peekableIterator = peekable(iterable);
|
|
14
|
+
*
|
|
15
|
+
* console.log(peekableIterator.next());
|
|
16
|
+
* // Output: { value: 1, done: false }
|
|
17
|
+
*
|
|
18
|
+
* console.log(peekableIterator.peek());
|
|
19
|
+
* // Output: { value: 2, done: false }
|
|
20
|
+
*
|
|
21
|
+
* console.log(peekableIterator.next());
|
|
22
|
+
* // Output: { value: 2, done: false }
|
|
23
|
+
*
|
|
24
|
+
* console.log(peekableIterator.next());
|
|
25
|
+
* // Output: { value: 3, done: false }
|
|
26
|
+
* ```
|
|
27
|
+
*/
|
|
28
|
+
export declare function peekable<const ElementType>(iterable: IterableResolvable<ElementType>): Peekable<ElementType>;
|
|
29
|
+
export interface Peekable<T> extends IterableIterator<T> {
|
|
30
|
+
peek(): IteratorResult<T>;
|
|
31
|
+
}
|
|
32
|
+
//# sourceMappingURL=peekable.d.mts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"peekable.d.mts","names":[],"sources":["../../src/lib/peekable.ts"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;wBA4BgB,eAAe,aAAa,UAAU,mBAAmB,eAAe,SAAS;iBAsBhF,SAAS,WAAW,iBAAiB;EACrD,QAAQ,eAAe"}
|
|
@@ -0,0 +1,52 @@
|
|
|
1
|
+
import { from } from "./from.mjs";
|
|
2
|
+
|
|
3
|
+
// src/lib/peekable.ts
|
|
4
|
+
/**
|
|
5
|
+
* Creates an iterator that allows you to peek at the next element without advancing the iterator.
|
|
6
|
+
*
|
|
7
|
+
* @typeParam ElementType - The type of elements in the iterable.
|
|
8
|
+
* @param iterable - The iterable to create a peekable iterator from.
|
|
9
|
+
* @returns A new peekable iterator.
|
|
10
|
+
* @example
|
|
11
|
+
* ```typescript
|
|
12
|
+
* import { peekable } from '@sapphire/iterator-utilities';
|
|
13
|
+
*
|
|
14
|
+
* const iterable = [1, 2, 3, 4, 5];
|
|
15
|
+
* const peekableIterator = peekable(iterable);
|
|
16
|
+
*
|
|
17
|
+
* console.log(peekableIterator.next());
|
|
18
|
+
* // Output: { value: 1, done: false }
|
|
19
|
+
*
|
|
20
|
+
* console.log(peekableIterator.peek());
|
|
21
|
+
* // Output: { value: 2, done: false }
|
|
22
|
+
*
|
|
23
|
+
* console.log(peekableIterator.next());
|
|
24
|
+
* // Output: { value: 2, done: false }
|
|
25
|
+
*
|
|
26
|
+
* console.log(peekableIterator.next());
|
|
27
|
+
* // Output: { value: 3, done: false }
|
|
28
|
+
* ```
|
|
29
|
+
*/
|
|
30
|
+
function peekable(iterable) {
|
|
31
|
+
const resolvedIterable = from(iterable);
|
|
32
|
+
let peeked;
|
|
33
|
+
return {
|
|
34
|
+
next() {
|
|
35
|
+
if (peeked) {
|
|
36
|
+
const value = peeked;
|
|
37
|
+
peeked = void 0;
|
|
38
|
+
return value;
|
|
39
|
+
}
|
|
40
|
+
return resolvedIterable.next();
|
|
41
|
+
},
|
|
42
|
+
peek() {
|
|
43
|
+
return peeked ??= resolvedIterable.next();
|
|
44
|
+
},
|
|
45
|
+
[Symbol.iterator]() {
|
|
46
|
+
return this;
|
|
47
|
+
}
|
|
48
|
+
};
|
|
49
|
+
}
|
|
50
|
+
|
|
51
|
+
export { peekable };
|
|
52
|
+
//# sourceMappingURL=peekable.mjs.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"peekable.mjs","names":[],"sources":["../../src/lib/peekable.ts"],"sourcesContent":["import { from, type IterableResolvable } from './from';\n\n/**\n * Creates an iterator that allows you to peek at the next element without advancing the iterator.\n *\n * @typeParam ElementType - The type of elements in the iterable.\n * @param iterable - The iterable to create a peekable iterator from.\n * @returns A new peekable iterator.\n * @example\n * ```typescript\n * import { peekable } from '@sapphire/iterator-utilities';\n *\n * const iterable = [1, 2, 3, 4, 5];\n * const peekableIterator = peekable(iterable);\n *\n * console.log(peekableIterator.next());\n * // Output: { value: 1, done: false }\n *\n * console.log(peekableIterator.peek());\n * // Output: { value: 2, done: false }\n *\n * console.log(peekableIterator.next());\n * // Output: { value: 2, done: false }\n *\n * console.log(peekableIterator.next());\n * // Output: { value: 3, done: false }\n * ```\n */\nexport function peekable<const ElementType>(iterable: IterableResolvable<ElementType>): Peekable<ElementType> {\n\tconst resolvedIterable = from(iterable);\n\tlet peeked: IteratorResult<ElementType> | undefined;\n\treturn {\n\t\tnext() {\n\t\t\tif (peeked) {\n\t\t\t\tconst value = peeked;\n\t\t\t\tpeeked = undefined;\n\t\t\t\treturn value;\n\t\t\t}\n\n\t\t\treturn resolvedIterable.next();\n\t\t},\n\t\tpeek() {\n\t\t\treturn (peeked ??= resolvedIterable.next());\n\t\t},\n\t\t[Symbol.iterator]() {\n\t\t\treturn this as IterableIterator<ElementType>;\n\t\t}\n\t};\n}\n\nexport interface Peekable<T> extends IterableIterator<T> {\n\tpeek(): IteratorResult<T>;\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA4BA,SAAgB,SAA4B,UAAkE;CAC7G,MAAM,mBAAmB,KAAK,QAAQ;CACtC,IAAI;CACJ,OAAO;EACN,OAAO;GACN,IAAI,QAAQ;IACX,MAAM,QAAQ;IACd,SAAS;IACT,OAAO;GACR;GAEA,OAAO,iBAAiB,KAAK;EAC9B;EACA,OAAO;GACN,OAAQ,WAAW,iBAAiB,KAAK;EAC1C;EACA,CAAC,OAAO,YAAY;GACnB,OAAO;EACR;CACD;AACD"}
|
|
@@ -0,0 +1,18 @@
|
|
|
1
|
+
import { IterableResolvable } from "./from.mjs";
|
|
2
|
+
/**
|
|
3
|
+
* Creates an iterator with the provided iterables prepended to the first iterable.
|
|
4
|
+
*
|
|
5
|
+
* @param iterable - The iterator to prepend values to.
|
|
6
|
+
* @param iterables - The iterables to prepend to the iterator.
|
|
7
|
+
* @returns An iterator that yields the values of the provided iterator followed by the values of the provided iterables.
|
|
8
|
+
* @example
|
|
9
|
+
* ```typescript
|
|
10
|
+
* import { prepend } from '@sapphire/iterator-utilities';
|
|
11
|
+
*
|
|
12
|
+
* console.log([...prepend([3, 4, 5], [1, 2])]);
|
|
13
|
+
* // Output: [1, 2, 3, 4, 5]
|
|
14
|
+
* ```
|
|
15
|
+
* @see `append` to append values to the end of an iterator.
|
|
16
|
+
*/
|
|
17
|
+
export declare function prepend<const ElementType>(iterable: IterableResolvable<ElementType>, ...iterables: IterableResolvable<ElementType>[]): IterableIterator<ElementType>;
|
|
18
|
+
//# sourceMappingURL=prepend.d.mts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"prepend.d.mts","names":[],"sources":["../../src/lib/prepend.ts"],"mappings":";;;;;;;;;;;;;;;;wBAkBiB,cAAc,aAC9B,UAAU,mBAAmB,iBAC1B,WAAW,mBAAmB,iBAC/B,iBAAiB"}
|
|
@@ -0,0 +1,25 @@
|
|
|
1
|
+
import { toIterableIterator } from "./toIterableIterator.mjs";
|
|
2
|
+
|
|
3
|
+
// src/lib/prepend.ts
|
|
4
|
+
/**
|
|
5
|
+
* Creates an iterator with the provided iterables prepended to the first iterable.
|
|
6
|
+
*
|
|
7
|
+
* @param iterable - The iterator to prepend values to.
|
|
8
|
+
* @param iterables - The iterables to prepend to the iterator.
|
|
9
|
+
* @returns An iterator that yields the values of the provided iterator followed by the values of the provided iterables.
|
|
10
|
+
* @example
|
|
11
|
+
* ```typescript
|
|
12
|
+
* import { prepend } from '@sapphire/iterator-utilities';
|
|
13
|
+
*
|
|
14
|
+
* console.log([...prepend([3, 4, 5], [1, 2])]);
|
|
15
|
+
* // Output: [1, 2, 3, 4, 5]
|
|
16
|
+
* ```
|
|
17
|
+
* @see `append` to append values to the end of an iterator.
|
|
18
|
+
*/
|
|
19
|
+
function* prepend(iterable, ...iterables) {
|
|
20
|
+
for (const iterable of iterables) yield* toIterableIterator(iterable);
|
|
21
|
+
yield* toIterableIterator(iterable);
|
|
22
|
+
}
|
|
23
|
+
|
|
24
|
+
export { prepend };
|
|
25
|
+
//# sourceMappingURL=prepend.mjs.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"prepend.mjs","names":[],"sources":["../../src/lib/prepend.ts"],"sourcesContent":["import type { IterableResolvable } from './from';\nimport { toIterableIterator } from './toIterableIterator';\n\n/**\n * Creates an iterator with the provided iterables prepended to the first iterable.\n *\n * @param iterable - The iterator to prepend values to.\n * @param iterables - The iterables to prepend to the iterator.\n * @returns An iterator that yields the values of the provided iterator followed by the values of the provided iterables.\n * @example\n * ```typescript\n * import { prepend } from '@sapphire/iterator-utilities';\n *\n * console.log([...prepend([3, 4, 5], [1, 2])]);\n * // Output: [1, 2, 3, 4, 5]\n * ```\n * @see `append` to append values to the end of an iterator.\n */\nexport function* prepend<const ElementType>(\n\titerable: IterableResolvable<ElementType>,\n\t...iterables: IterableResolvable<ElementType>[]\n): IterableIterator<ElementType> {\n\tfor (const iterable of iterables) {\n\t\tyield* toIterableIterator(iterable);\n\t}\n\n\tyield* toIterableIterator(iterable);\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;AAkBA,UAAiB,QAChB,UACA,GAAG,WAC6B;CAChC,KAAK,MAAM,YAAY,WACtB,OAAO,mBAAmB,QAAQ;CAGnC,OAAO,mBAAmB,QAAQ;AACnC"}
|
|
@@ -0,0 +1,21 @@
|
|
|
1
|
+
import { IterableResolvable } from "./from.mjs";
|
|
2
|
+
/**
|
|
3
|
+
* Consumes the iterable and returns the product of all the elements. If the iterable is empty, it returns `1`.
|
|
4
|
+
*
|
|
5
|
+
* @param iterable - An iterator to calculate the product of.
|
|
6
|
+
* @returns The product of the elements in the input iterator.
|
|
7
|
+
* @example
|
|
8
|
+
* ```typescript
|
|
9
|
+
* import { product } from '@sapphire/iterator-utilities';
|
|
10
|
+
*
|
|
11
|
+
* const iterable = [1, 2, 3, 4, 5];
|
|
12
|
+
* console.log(product(iterable));
|
|
13
|
+
* // Output: 120
|
|
14
|
+
*
|
|
15
|
+
* const iterable = [1, 2, 3, 4, 5, 0];
|
|
16
|
+
* console.log(product(iterable));
|
|
17
|
+
* // Output: 0
|
|
18
|
+
* ```
|
|
19
|
+
*/
|
|
20
|
+
export declare function product(iterable: IterableResolvable<number>): number;
|
|
21
|
+
//# sourceMappingURL=product.d.mts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"product.d.mts","names":[],"sources":["../../src/lib/product.ts"],"mappings":";;;;;;;;;;;;;;;;;;;wBAsBgB,QAAQ,UAAU"}
|
|
@@ -0,0 +1,30 @@
|
|
|
1
|
+
import { map } from "./map.mjs";
|
|
2
|
+
import { toNumberOrThrow } from "./shared/_toNumberOrThrow.mjs";
|
|
3
|
+
|
|
4
|
+
// src/lib/product.ts
|
|
5
|
+
/**
|
|
6
|
+
* Consumes the iterable and returns the product of all the elements. If the iterable is empty, it returns `1`.
|
|
7
|
+
*
|
|
8
|
+
* @param iterable - An iterator to calculate the product of.
|
|
9
|
+
* @returns The product of the elements in the input iterator.
|
|
10
|
+
* @example
|
|
11
|
+
* ```typescript
|
|
12
|
+
* import { product } from '@sapphire/iterator-utilities';
|
|
13
|
+
*
|
|
14
|
+
* const iterable = [1, 2, 3, 4, 5];
|
|
15
|
+
* console.log(product(iterable));
|
|
16
|
+
* // Output: 120
|
|
17
|
+
*
|
|
18
|
+
* const iterable = [1, 2, 3, 4, 5, 0];
|
|
19
|
+
* console.log(product(iterable));
|
|
20
|
+
* // Output: 0
|
|
21
|
+
* ```
|
|
22
|
+
*/
|
|
23
|
+
function product(iterable) {
|
|
24
|
+
let result = 1;
|
|
25
|
+
for (const value of map(iterable, toNumberOrThrow)) result *= value;
|
|
26
|
+
return result;
|
|
27
|
+
}
|
|
28
|
+
|
|
29
|
+
export { product };
|
|
30
|
+
//# sourceMappingURL=product.mjs.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"product.mjs","names":[],"sources":["../../src/lib/product.ts"],"sourcesContent":["import type { IterableResolvable } from './from';\nimport { map } from './map';\nimport { toNumberOrThrow } from './shared/_toNumberOrThrow';\n\n/**\n * Consumes the iterable and returns the product of all the elements. If the iterable is empty, it returns `1`.\n *\n * @param iterable - An iterator to calculate the product of.\n * @returns The product of the elements in the input iterator.\n * @example\n * ```typescript\n * import { product } from '@sapphire/iterator-utilities';\n *\n * const iterable = [1, 2, 3, 4, 5];\n * console.log(product(iterable));\n * // Output: 120\n *\n * const iterable = [1, 2, 3, 4, 5, 0];\n * console.log(product(iterable));\n * // Output: 0\n * ```\n */\nexport function product(iterable: IterableResolvable<number>): number {\n\tlet result = 1;\n\tfor (const value of map(iterable, toNumberOrThrow)) {\n\t\tresult *= value;\n\t}\n\n\treturn result;\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;AAsBA,SAAgB,QAAQ,UAA8C;CACrE,IAAI,SAAS;CACb,KAAK,MAAM,SAAS,IAAI,UAAU,eAAe,GAChD,UAAU;CAGX,OAAO;AACR"}
|
|
@@ -0,0 +1,29 @@
|
|
|
1
|
+
/**
|
|
2
|
+
* Creates an iterable with the numbers from `start` to `stop` (exclusive) with an optional step.
|
|
3
|
+
*
|
|
4
|
+
* @param start - The value of the first number in the range.
|
|
5
|
+
* @param end - The end value of the range.
|
|
6
|
+
* @param step - The amount to increment the range by.
|
|
7
|
+
* @example
|
|
8
|
+
* ```typescript
|
|
9
|
+
* import { range } from '@sapphire/iterator-utilities';
|
|
10
|
+
*
|
|
11
|
+
* const iterable = range(0, 5);
|
|
12
|
+
* console.log([...iterable]);
|
|
13
|
+
* // Output: [0, 1, 2, 3, 4]
|
|
14
|
+
* ```
|
|
15
|
+
* @example
|
|
16
|
+
* ```typescript
|
|
17
|
+
* const iterable = range(5, 0);
|
|
18
|
+
* console.log([...iterable]);
|
|
19
|
+
* // Output: [5, 4, 3, 2, 1]
|
|
20
|
+
* ```
|
|
21
|
+
* @example
|
|
22
|
+
* ```typescript
|
|
23
|
+
* const iterable = range(0, 5, 2);
|
|
24
|
+
* console.log([...iterable]);
|
|
25
|
+
* // Output: [0, 2, 4]
|
|
26
|
+
* ```
|
|
27
|
+
*/
|
|
28
|
+
export declare function range(start: number, end: number, step?: number): IterableIterator<number>;
|
|
29
|
+
//# sourceMappingURL=range.d.mts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"range.d.mts","names":[],"sources":["../../src/lib/range.ts"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;wBA6BiB,MAAM,eAAe,aAAa,gBAAgB"}
|
|
@@ -0,0 +1,46 @@
|
|
|
1
|
+
import { toNumberOrThrow } from "./shared/_toNumberOrThrow.mjs";
|
|
2
|
+
|
|
3
|
+
// src/lib/range.ts
|
|
4
|
+
/**
|
|
5
|
+
* Creates an iterable with the numbers from `start` to `stop` (exclusive) with an optional step.
|
|
6
|
+
*
|
|
7
|
+
* @param start - The value of the first number in the range.
|
|
8
|
+
* @param end - The end value of the range.
|
|
9
|
+
* @param step - The amount to increment the range by.
|
|
10
|
+
* @example
|
|
11
|
+
* ```typescript
|
|
12
|
+
* import { range } from '@sapphire/iterator-utilities';
|
|
13
|
+
*
|
|
14
|
+
* const iterable = range(0, 5);
|
|
15
|
+
* console.log([...iterable]);
|
|
16
|
+
* // Output: [0, 1, 2, 3, 4]
|
|
17
|
+
* ```
|
|
18
|
+
* @example
|
|
19
|
+
* ```typescript
|
|
20
|
+
* const iterable = range(5, 0);
|
|
21
|
+
* console.log([...iterable]);
|
|
22
|
+
* // Output: [5, 4, 3, 2, 1]
|
|
23
|
+
* ```
|
|
24
|
+
* @example
|
|
25
|
+
* ```typescript
|
|
26
|
+
* const iterable = range(0, 5, 2);
|
|
27
|
+
* console.log([...iterable]);
|
|
28
|
+
* // Output: [0, 2, 4]
|
|
29
|
+
* ```
|
|
30
|
+
*/
|
|
31
|
+
function* range(start, end, step) {
|
|
32
|
+
start = toNumberOrThrow(start);
|
|
33
|
+
end = toNumberOrThrow(end);
|
|
34
|
+
if (step === void 0) step = start < end ? 1 : -1;
|
|
35
|
+
else {
|
|
36
|
+
step = toNumberOrThrow(step);
|
|
37
|
+
if (step === 0) throw new RangeError("Step cannot be zero");
|
|
38
|
+
if (step > 0 && start > end) throw new RangeError("Start must be less than end when step is positive");
|
|
39
|
+
else if (step < 0 && start < end) throw new RangeError("Start must be greater than end when step is negative");
|
|
40
|
+
}
|
|
41
|
+
if (start < end) for (let idx = start; idx < end; idx += step) yield idx;
|
|
42
|
+
else for (let idx = start; idx > end; idx += step) yield idx;
|
|
43
|
+
}
|
|
44
|
+
|
|
45
|
+
export { range };
|
|
46
|
+
//# sourceMappingURL=range.mjs.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"range.mjs","names":[],"sources":["../../src/lib/range.ts"],"sourcesContent":["import { toNumberOrThrow } from './shared/_toNumberOrThrow';\n\n/**\n * Creates an iterable with the numbers from `start` to `stop` (exclusive) with an optional step.\n *\n * @param start - The value of the first number in the range.\n * @param end - The end value of the range.\n * @param step - The amount to increment the range by.\n * @example\n * ```typescript\n * import { range } from '@sapphire/iterator-utilities';\n *\n * const iterable = range(0, 5);\n * console.log([...iterable]);\n * // Output: [0, 1, 2, 3, 4]\n * ```\n * @example\n * ```typescript\n * const iterable = range(5, 0);\n * console.log([...iterable]);\n * // Output: [5, 4, 3, 2, 1]\n * ```\n * @example\n * ```typescript\n * const iterable = range(0, 5, 2);\n * console.log([...iterable]);\n * // Output: [0, 2, 4]\n * ```\n */\nexport function* range(start: number, end: number, step?: number): IterableIterator<number> {\n\t// eslint-disable-next-line no-param-reassign\n\tstart = toNumberOrThrow(start);\n\t// eslint-disable-next-line no-param-reassign\n\tend = toNumberOrThrow(end);\n\n\tif (step === undefined) {\n\t\t// eslint-disable-next-line no-param-reassign\n\t\tstep = start < end ? 1 : -1;\n\t} else {\n\t\t// eslint-disable-next-line no-param-reassign\n\t\tstep = toNumberOrThrow(step);\n\n\t\t// Prevent infinite loops.\n\t\tif (step === 0) {\n\t\t\tthrow new RangeError('Step cannot be zero');\n\t\t}\n\n\t\t// If the step is positive, the start must be less than the end.\n\t\tif (step > 0 && start > end) {\n\t\t\tthrow new RangeError('Start must be less than end when step is positive');\n\t\t} else if (step < 0 && start < end) {\n\t\t\tthrow new RangeError('Start must be greater than end when step is negative');\n\t\t}\n\t}\n\n\tif (start < end) {\n\t\tfor (let idx = start; idx < end; idx += step) {\n\t\t\tyield idx;\n\t\t}\n\t} else {\n\t\tfor (let idx = start; idx > end; idx += step) {\n\t\t\tyield idx;\n\t\t}\n\t}\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA6BA,UAAiB,MAAM,OAAe,KAAa,MAAyC;CAE3F,QAAQ,gBAAgB,KAAK;CAE7B,MAAM,gBAAgB,GAAG;CAEzB,IAAI,SAAS,QAEZ,OAAO,QAAQ,MAAM,IAAI;MACnB;EAEN,OAAO,gBAAgB,IAAI;EAG3B,IAAI,SAAS,GACZ,MAAM,IAAI,WAAW,qBAAqB;EAI3C,IAAI,OAAO,KAAK,QAAQ,KACvB,MAAM,IAAI,WAAW,mDAAmD;OAClE,IAAI,OAAO,KAAK,QAAQ,KAC9B,MAAM,IAAI,WAAW,sDAAsD;CAE7E;CAEA,IAAI,QAAQ,KACX,KAAK,IAAI,MAAM,OAAO,MAAM,KAAK,OAAO,MACvC,MAAM;MAGP,KAAK,IAAI,MAAM,OAAO,MAAM,KAAK,OAAO,MACvC,MAAM;AAGT"}
|
|
@@ -0,0 +1,29 @@
|
|
|
1
|
+
import { IterableResolvable } from "./from.mjs";
|
|
2
|
+
/**
|
|
3
|
+
* Consumes the iterable and reduces it to the reducer function's result.
|
|
4
|
+
*
|
|
5
|
+
* @param iterable - An iterator to reduce.
|
|
6
|
+
* @param callbackFn - A function to execute for each element produced by the iterator. Its return value becomes the value
|
|
7
|
+
* of the `accumulator` parameter on the next invocation of `callbackFn`. For the last invocation, the return value
|
|
8
|
+
* becomes the return value of `reduce()`.
|
|
9
|
+
* @param initialValue - A value to which `accumulator` is initialized the first time the callback is called. If
|
|
10
|
+
* `initialValue` is specified, `callbackFn` starts executing with the first element as `currentValue`. If
|
|
11
|
+
* `initialValue` is not specified, `accumulator` is initialized to the first element, and `callbackFn` starts executing
|
|
12
|
+
* with the second element as `currentValue`. In this case, if the iterator is empty (so that there's no first value to
|
|
13
|
+
* return as `accumulator`), an error is thrown.
|
|
14
|
+
* @returns
|
|
15
|
+
* @example
|
|
16
|
+
* ```typescript
|
|
17
|
+
* import { reduce } from '@sapphire/iterator-utilities';
|
|
18
|
+
*
|
|
19
|
+
* const iterable = [1, 2, 3, 4, 5];
|
|
20
|
+
* console.log(reduce(iterable, (accumulator, currentValue) => accumulator + currentValue));
|
|
21
|
+
* // Output: 15
|
|
22
|
+
* ```
|
|
23
|
+
* @remarks
|
|
24
|
+
*
|
|
25
|
+
* If `initialValue` is not provided, the first element of the iterator is used as the initial value of `accumulator`,
|
|
26
|
+
* consuming the first element.
|
|
27
|
+
*/
|
|
28
|
+
export declare function reduce<const ElementType, const MappedType>(iterable: IterableResolvable<ElementType>, callbackFn: (accumulator: MappedType, currentValue: ElementType, currentIndex: number) => MappedType, initialValue?: MappedType): MappedType;
|
|
29
|
+
//# sourceMappingURL=reduce.d.mts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"reduce.d.mts","names":[],"sources":["../../src/lib/reduce.ts"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;wBA8BgB,aAAa,mBAAmB,YAC/C,UAAU,mBAAmB,cAC7B,aAAa,aAAa,YAAY,cAAc,aAAa,yBAAyB,YAC1F,eAAe,aACb"}
|
|
@@ -0,0 +1,50 @@
|
|
|
1
|
+
import { assertFunction } from "./shared/_assertFunction.mjs";
|
|
2
|
+
import { toIterableIterator } from "./toIterableIterator.mjs";
|
|
3
|
+
|
|
4
|
+
// src/lib/reduce.ts
|
|
5
|
+
/**
|
|
6
|
+
* Consumes the iterable and reduces it to the reducer function's result.
|
|
7
|
+
*
|
|
8
|
+
* @param iterable - An iterator to reduce.
|
|
9
|
+
* @param callbackFn - A function to execute for each element produced by the iterator. Its return value becomes the value
|
|
10
|
+
* of the `accumulator` parameter on the next invocation of `callbackFn`. For the last invocation, the return value
|
|
11
|
+
* becomes the return value of `reduce()`.
|
|
12
|
+
* @param initialValue - A value to which `accumulator` is initialized the first time the callback is called. If
|
|
13
|
+
* `initialValue` is specified, `callbackFn` starts executing with the first element as `currentValue`. If
|
|
14
|
+
* `initialValue` is not specified, `accumulator` is initialized to the first element, and `callbackFn` starts executing
|
|
15
|
+
* with the second element as `currentValue`. In this case, if the iterator is empty (so that there's no first value to
|
|
16
|
+
* return as `accumulator`), an error is thrown.
|
|
17
|
+
* @returns
|
|
18
|
+
* @example
|
|
19
|
+
* ```typescript
|
|
20
|
+
* import { reduce } from '@sapphire/iterator-utilities';
|
|
21
|
+
*
|
|
22
|
+
* const iterable = [1, 2, 3, 4, 5];
|
|
23
|
+
* console.log(reduce(iterable, (accumulator, currentValue) => accumulator + currentValue));
|
|
24
|
+
* // Output: 15
|
|
25
|
+
* ```
|
|
26
|
+
* @remarks
|
|
27
|
+
*
|
|
28
|
+
* If `initialValue` is not provided, the first element of the iterator is used as the initial value of `accumulator`,
|
|
29
|
+
* consuming the first element.
|
|
30
|
+
*/
|
|
31
|
+
function reduce(iterable, callbackFn, initialValue) {
|
|
32
|
+
callbackFn = assertFunction(callbackFn);
|
|
33
|
+
let index;
|
|
34
|
+
let accumulator;
|
|
35
|
+
const resolvedIterable = toIterableIterator(iterable);
|
|
36
|
+
if (arguments.length < 3) {
|
|
37
|
+
const firstValue = resolvedIterable.next();
|
|
38
|
+
if (firstValue.done) throw new TypeError("Reduce of empty iterator with no initial value");
|
|
39
|
+
index = 1;
|
|
40
|
+
accumulator = firstValue.value;
|
|
41
|
+
} else {
|
|
42
|
+
index = 0;
|
|
43
|
+
accumulator = initialValue;
|
|
44
|
+
}
|
|
45
|
+
for (const value of resolvedIterable) accumulator = callbackFn(accumulator, value, index++);
|
|
46
|
+
return accumulator;
|
|
47
|
+
}
|
|
48
|
+
|
|
49
|
+
export { reduce };
|
|
50
|
+
//# sourceMappingURL=reduce.mjs.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"reduce.mjs","names":[],"sources":["../../src/lib/reduce.ts"],"sourcesContent":["import type { IterableResolvable } from './from';\nimport { assertFunction } from './shared/_assertFunction';\nimport { toIterableIterator } from './toIterableIterator';\n\n/**\n * Consumes the iterable and reduces it to the reducer function's result.\n *\n * @param iterable - An iterator to reduce.\n * @param callbackFn - A function to execute for each element produced by the iterator. Its return value becomes the value\n * of the `accumulator` parameter on the next invocation of `callbackFn`. For the last invocation, the return value\n * becomes the return value of `reduce()`.\n * @param initialValue - A value to which `accumulator` is initialized the first time the callback is called. If\n * `initialValue` is specified, `callbackFn` starts executing with the first element as `currentValue`. If\n * `initialValue` is not specified, `accumulator` is initialized to the first element, and `callbackFn` starts executing\n * with the second element as `currentValue`. In this case, if the iterator is empty (so that there's no first value to\n * return as `accumulator`), an error is thrown.\n * @returns\n * @example\n * ```typescript\n * import { reduce } from '@sapphire/iterator-utilities';\n *\n * const iterable = [1, 2, 3, 4, 5];\n * console.log(reduce(iterable, (accumulator, currentValue) => accumulator + currentValue));\n * // Output: 15\n * ```\n * @remarks\n *\n * If `initialValue` is not provided, the first element of the iterator is used as the initial value of `accumulator`,\n * consuming the first element.\n */\nexport function reduce<const ElementType, const MappedType>(\n\titerable: IterableResolvable<ElementType>,\n\tcallbackFn: (accumulator: MappedType, currentValue: ElementType, currentIndex: number) => MappedType,\n\tinitialValue?: MappedType\n): MappedType {\n\t// eslint-disable-next-line no-param-reassign\n\tcallbackFn = assertFunction(callbackFn);\n\n\tlet index: number;\n\tlet accumulator: MappedType;\n\tconst resolvedIterable = toIterableIterator(iterable);\n\tif (arguments.length < 3) {\n\t\tconst firstValue = resolvedIterable.next();\n\t\tif (firstValue.done) throw new TypeError('Reduce of empty iterator with no initial value');\n\n\t\tindex = 1;\n\t\taccumulator = firstValue.value! as MappedType;\n\t} else {\n\t\tindex = 0;\n\t\taccumulator = initialValue!;\n\t}\n\n\tfor (const value of resolvedIterable) {\n\t\taccumulator = callbackFn(accumulator, value, index++);\n\t}\n\n\treturn accumulator;\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA8BA,SAAgB,OACf,UACA,YACA,cACa;CAEb,aAAa,eAAe,UAAU;CAEtC,IAAI;CACJ,IAAI;CACJ,MAAM,mBAAmB,mBAAmB,QAAQ;CACpD,IAAI,UAAU,SAAS,GAAG;EACzB,MAAM,aAAa,iBAAiB,KAAK;EACzC,IAAI,WAAW,MAAM,MAAM,IAAI,UAAU,gDAAgD;EAEzF,QAAQ;EACR,cAAc,WAAW;CAC1B,OAAO;EACN,QAAQ;EACR,cAAc;CACf;CAEA,KAAK,MAAM,SAAS,kBACnB,cAAc,WAAW,aAAa,OAAO,OAAO;CAGrD,OAAO;AACR"}
|
|
@@ -0,0 +1,17 @@
|
|
|
1
|
+
/**
|
|
2
|
+
* Creates an iterable that repeats the input iterable `count` times.
|
|
3
|
+
*
|
|
4
|
+
* @param value - The value to be repeated.
|
|
5
|
+
* @param count - The number of times to repeat the value.
|
|
6
|
+
* @example
|
|
7
|
+
* ```typescript
|
|
8
|
+
* import { repeat } from '@sapphire/iterator-utilities';
|
|
9
|
+
*
|
|
10
|
+
* const iterator = repeat('Hello, world!', 3);
|
|
11
|
+
* console.log([...iterator]);
|
|
12
|
+
* // Output: ['Hello, world!', 'Hello, world!', 'Hello, world!']
|
|
13
|
+
* ```
|
|
14
|
+
* @remarks This function does not clone `value`, it will be repeated as a reference.
|
|
15
|
+
*/
|
|
16
|
+
export declare function repeat<const ElementType>(value: ElementType, count: number): IterableIterator<ElementType>;
|
|
17
|
+
//# sourceMappingURL=repeat.d.mts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"repeat.d.mts","names":[],"sources":["../../src/lib/repeat.ts"],"mappings":";;;;;;;;;;;;;;;wBAmBgB,aAAa,aAAa,OAAO,aAAa,gBAAgB,iBAAiB"}
|