@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
|
@@ -1,1171 +0,0 @@
|
|
|
1
|
-
var SapphireIteratorUtilities = (function (exports) {
|
|
2
|
-
'use strict';
|
|
3
|
-
|
|
4
|
-
var __defProp = Object.defineProperty;
|
|
5
|
-
var __name = (target, value) => __defProp(target, "name", { value, configurable: true });
|
|
6
|
-
|
|
7
|
-
// src/lib/shared/_assertFunction.ts
|
|
8
|
-
function assertFunction(value) {
|
|
9
|
-
if (typeof value !== "function") {
|
|
10
|
-
throw new TypeError(`${value} must be a function`);
|
|
11
|
-
}
|
|
12
|
-
return value;
|
|
13
|
-
}
|
|
14
|
-
__name(assertFunction, "assertFunction");
|
|
15
|
-
|
|
16
|
-
// src/lib/from.ts
|
|
17
|
-
function from(value) {
|
|
18
|
-
if (typeof value === "object" && value !== null) {
|
|
19
|
-
if (typeof value[Symbol.iterator] === "function") {
|
|
20
|
-
return value[Symbol.iterator]();
|
|
21
|
-
}
|
|
22
|
-
if (typeof value.next === "function") {
|
|
23
|
-
return value;
|
|
24
|
-
}
|
|
25
|
-
}
|
|
26
|
-
if (typeof value === "string") {
|
|
27
|
-
return value[Symbol.iterator]();
|
|
28
|
-
}
|
|
29
|
-
throw new TypeError(`${String(value)} cannot be converted to an iterable`);
|
|
30
|
-
}
|
|
31
|
-
__name(from, "from");
|
|
32
|
-
|
|
33
|
-
// src/lib/shared/_makeIterableIterator.ts
|
|
34
|
-
function makeIterableIterator(next) {
|
|
35
|
-
return {
|
|
36
|
-
next,
|
|
37
|
-
[Symbol.iterator]() {
|
|
38
|
-
return this;
|
|
39
|
-
}
|
|
40
|
-
};
|
|
41
|
-
}
|
|
42
|
-
__name(makeIterableIterator, "makeIterableIterator");
|
|
43
|
-
|
|
44
|
-
// src/lib/toIterableIterator.ts
|
|
45
|
-
function toIterableIterator(iterable) {
|
|
46
|
-
const resolvedIterable = from(iterable);
|
|
47
|
-
if (Symbol.iterator in resolvedIterable) {
|
|
48
|
-
return resolvedIterable;
|
|
49
|
-
}
|
|
50
|
-
return makeIterableIterator(() => resolvedIterable.next());
|
|
51
|
-
}
|
|
52
|
-
__name(toIterableIterator, "toIterableIterator");
|
|
53
|
-
|
|
54
|
-
// src/lib/every.ts
|
|
55
|
-
function every(iterable, callbackFn) {
|
|
56
|
-
callbackFn = assertFunction(callbackFn);
|
|
57
|
-
let index = 0;
|
|
58
|
-
for (const value of toIterableIterator(iterable)) {
|
|
59
|
-
if (!callbackFn(value, index++)) return false;
|
|
60
|
-
}
|
|
61
|
-
return true;
|
|
62
|
-
}
|
|
63
|
-
__name(every, "every");
|
|
64
|
-
|
|
65
|
-
// src/lib/some.ts
|
|
66
|
-
function some(iterable, callbackFn) {
|
|
67
|
-
callbackFn = assertFunction(callbackFn);
|
|
68
|
-
let index = 0;
|
|
69
|
-
for (const value of toIterableIterator(iterable)) {
|
|
70
|
-
if (callbackFn(value, index++)) {
|
|
71
|
-
return true;
|
|
72
|
-
}
|
|
73
|
-
}
|
|
74
|
-
return false;
|
|
75
|
-
}
|
|
76
|
-
__name(some, "some");
|
|
77
|
-
|
|
78
|
-
// src/lib/chain.ts
|
|
79
|
-
function* chain(...iterables) {
|
|
80
|
-
for (const iterable of iterables) {
|
|
81
|
-
yield* toIterableIterator(iterable);
|
|
82
|
-
}
|
|
83
|
-
}
|
|
84
|
-
__name(chain, "chain");
|
|
85
|
-
|
|
86
|
-
// src/lib/append.ts
|
|
87
|
-
function append(iterable, ...iterables) {
|
|
88
|
-
return chain(iterable, ...iterables);
|
|
89
|
-
}
|
|
90
|
-
__name(append, "append");
|
|
91
|
-
|
|
92
|
-
// src/lib/empty.ts
|
|
93
|
-
function empty() {
|
|
94
|
-
return makeIterableIterator(() => ({ done: true, value: void 0 }));
|
|
95
|
-
}
|
|
96
|
-
__name(empty, "empty");
|
|
97
|
-
|
|
98
|
-
// src/lib/shared/_assertNotNegative.ts
|
|
99
|
-
function assertNotNegative(value, original) {
|
|
100
|
-
if (value < 0) {
|
|
101
|
-
throw new RangeError(`${original} must be a non-negative number`);
|
|
102
|
-
}
|
|
103
|
-
return value;
|
|
104
|
-
}
|
|
105
|
-
__name(assertNotNegative, "assertNotNegative");
|
|
106
|
-
|
|
107
|
-
// src/lib/shared/_toNumberOrThrow.ts
|
|
108
|
-
function toNumberOrThrow(value) {
|
|
109
|
-
switch (typeof value) {
|
|
110
|
-
case "bigint":
|
|
111
|
-
throw new TypeError("Cannot convert a BigInt value to a number");
|
|
112
|
-
case "symbol":
|
|
113
|
-
throw new TypeError("Cannot convert a Symbol value to a number");
|
|
114
|
-
case "boolean":
|
|
115
|
-
return value ? 1 : 0;
|
|
116
|
-
case "number":
|
|
117
|
-
return assertNumber(value, value);
|
|
118
|
-
case "undefined":
|
|
119
|
-
throw new TypeError("Cannot convert an undefined value to a number");
|
|
120
|
-
default:
|
|
121
|
-
return assertNumber(Number(value), value);
|
|
122
|
-
}
|
|
123
|
-
}
|
|
124
|
-
__name(toNumberOrThrow, "toNumberOrThrow");
|
|
125
|
-
function assertNumber(value, original) {
|
|
126
|
-
if (Number.isNaN(value)) {
|
|
127
|
-
throw new RangeError(`${original} must be a non-NaN number`);
|
|
128
|
-
}
|
|
129
|
-
return value;
|
|
130
|
-
}
|
|
131
|
-
__name(assertNumber, "assertNumber");
|
|
132
|
-
|
|
133
|
-
// src/lib/shared/_toIntegerOrInfinityOrThrow.ts
|
|
134
|
-
function toIntegerOrInfinityOrThrow(value) {
|
|
135
|
-
const number = toNumberOrThrow(value);
|
|
136
|
-
if (Number.isNaN(number) || number === 0) return 0;
|
|
137
|
-
if (number === Number.POSITIVE_INFINITY) return Number.POSITIVE_INFINITY;
|
|
138
|
-
if (number === Number.NEGATIVE_INFINITY) return Number.NEGATIVE_INFINITY;
|
|
139
|
-
return Math.trunc(number);
|
|
140
|
-
}
|
|
141
|
-
__name(toIntegerOrInfinityOrThrow, "toIntegerOrInfinityOrThrow");
|
|
142
|
-
|
|
143
|
-
// src/lib/drop.ts
|
|
144
|
-
function drop(iterable, count2) {
|
|
145
|
-
count2 = assertNotNegative(toIntegerOrInfinityOrThrow(count2), count2);
|
|
146
|
-
const resolvedIterable = toIterableIterator(iterable);
|
|
147
|
-
if (count2 === 0) return resolvedIterable;
|
|
148
|
-
if (count2 === Number.POSITIVE_INFINITY) return empty();
|
|
149
|
-
for (let i = 0; i < count2; i++) {
|
|
150
|
-
if (resolvedIterable.next().done) break;
|
|
151
|
-
}
|
|
152
|
-
return resolvedIterable;
|
|
153
|
-
}
|
|
154
|
-
__name(drop, "drop");
|
|
155
|
-
|
|
156
|
-
// src/lib/first.ts
|
|
157
|
-
function first(iterable) {
|
|
158
|
-
return from(iterable).next().value;
|
|
159
|
-
}
|
|
160
|
-
__name(first, "first");
|
|
161
|
-
|
|
162
|
-
// src/lib/at.ts
|
|
163
|
-
function at(iterable, index) {
|
|
164
|
-
index = assertNotNegative(toIntegerOrInfinityOrThrow(index), index);
|
|
165
|
-
return first(index === 0 ? iterable : drop(iterable, index));
|
|
166
|
-
}
|
|
167
|
-
__name(at, "at");
|
|
168
|
-
|
|
169
|
-
// src/lib/map.ts
|
|
170
|
-
function* map(iterable, callbackFn) {
|
|
171
|
-
callbackFn = assertFunction(callbackFn);
|
|
172
|
-
let index = 0;
|
|
173
|
-
for (const element of toIterableIterator(iterable)) {
|
|
174
|
-
yield callbackFn(element, index++);
|
|
175
|
-
}
|
|
176
|
-
}
|
|
177
|
-
__name(map, "map");
|
|
178
|
-
|
|
179
|
-
// src/lib/average.ts
|
|
180
|
-
function average(iterable) {
|
|
181
|
-
let sum2 = 0;
|
|
182
|
-
let total = 0;
|
|
183
|
-
for (const value of map(iterable, toNumberOrThrow)) {
|
|
184
|
-
sum2 += value;
|
|
185
|
-
total++;
|
|
186
|
-
}
|
|
187
|
-
return total === 0 ? null : sum2 / total;
|
|
188
|
-
}
|
|
189
|
-
__name(average, "average");
|
|
190
|
-
|
|
191
|
-
// src/lib/shared/_assertPositive.ts
|
|
192
|
-
function assertPositive(value, original) {
|
|
193
|
-
if (value <= 0) {
|
|
194
|
-
throw new RangeError(`${original} must be a positive number`);
|
|
195
|
-
}
|
|
196
|
-
return value;
|
|
197
|
-
}
|
|
198
|
-
__name(assertPositive, "assertPositive");
|
|
199
|
-
|
|
200
|
-
// src/lib/shared/_toIntegerOrThrow.ts
|
|
201
|
-
function toIntegerOrThrow(value) {
|
|
202
|
-
const number = toNumberOrThrow(value);
|
|
203
|
-
if (Number.isNaN(number) || number === 0) return 0;
|
|
204
|
-
if (number === Number.POSITIVE_INFINITY) throw new RangeError("+Infinity cannot be represented as an integer");
|
|
205
|
-
if (number === Number.NEGATIVE_INFINITY) throw new RangeError("-Infinity cannot be represented as an integer");
|
|
206
|
-
return Math.trunc(number);
|
|
207
|
-
}
|
|
208
|
-
__name(toIntegerOrThrow, "toIntegerOrThrow");
|
|
209
|
-
|
|
210
|
-
// src/lib/chunk.ts
|
|
211
|
-
function* chunk(iterable, size) {
|
|
212
|
-
size = assertPositive(toIntegerOrThrow(size), size);
|
|
213
|
-
let buffer = [];
|
|
214
|
-
for (const element of toIterableIterator(iterable)) {
|
|
215
|
-
buffer.push(element);
|
|
216
|
-
if (buffer.length === size) {
|
|
217
|
-
yield buffer;
|
|
218
|
-
buffer = [];
|
|
219
|
-
}
|
|
220
|
-
}
|
|
221
|
-
if (buffer.length) {
|
|
222
|
-
yield buffer;
|
|
223
|
-
}
|
|
224
|
-
}
|
|
225
|
-
__name(chunk, "chunk");
|
|
226
|
-
|
|
227
|
-
// src/lib/toArray.ts
|
|
228
|
-
function toArray(iterable) {
|
|
229
|
-
return [...toIterableIterator(iterable)];
|
|
230
|
-
}
|
|
231
|
-
__name(toArray, "toArray");
|
|
232
|
-
|
|
233
|
-
// src/lib/collectInto.ts
|
|
234
|
-
function collectInto(iterable, output) {
|
|
235
|
-
for (const value of toIterableIterator(iterable)) {
|
|
236
|
-
output.push(value);
|
|
237
|
-
}
|
|
238
|
-
return output;
|
|
239
|
-
}
|
|
240
|
-
__name(collectInto, "collectInto");
|
|
241
|
-
|
|
242
|
-
// src/lib/filter.ts
|
|
243
|
-
function* filter(iterable, callbackFn) {
|
|
244
|
-
callbackFn = assertFunction(callbackFn);
|
|
245
|
-
let index = 0;
|
|
246
|
-
for (const value of toIterableIterator(iterable)) {
|
|
247
|
-
if (callbackFn(value, index++)) yield value;
|
|
248
|
-
}
|
|
249
|
-
}
|
|
250
|
-
__name(filter, "filter");
|
|
251
|
-
|
|
252
|
-
// src/lib/compact.ts
|
|
253
|
-
function compact(iterable) {
|
|
254
|
-
return filter(iterable, (value) => value !== null && value !== void 0);
|
|
255
|
-
}
|
|
256
|
-
__name(compact, "compact");
|
|
257
|
-
|
|
258
|
-
// src/lib/shared/_compare.ts
|
|
259
|
-
function compareIteratorElements(x, y, comparator) {
|
|
260
|
-
if (typeof x === "undefined") {
|
|
261
|
-
if (typeof y === "undefined") return 0;
|
|
262
|
-
return 1;
|
|
263
|
-
}
|
|
264
|
-
if (typeof y === "undefined") {
|
|
265
|
-
return -1;
|
|
266
|
-
}
|
|
267
|
-
return comparator(x, y);
|
|
268
|
-
}
|
|
269
|
-
__name(compareIteratorElements, "compareIteratorElements");
|
|
270
|
-
function orderingIsLess(ordering) {
|
|
271
|
-
return ordering < 0;
|
|
272
|
-
}
|
|
273
|
-
__name(orderingIsLess, "orderingIsLess");
|
|
274
|
-
function orderingIsEqual(ordering) {
|
|
275
|
-
return ordering === 0;
|
|
276
|
-
}
|
|
277
|
-
__name(orderingIsEqual, "orderingIsEqual");
|
|
278
|
-
function orderingIsGreater(ordering) {
|
|
279
|
-
return ordering > 0;
|
|
280
|
-
}
|
|
281
|
-
__name(orderingIsGreater, "orderingIsGreater");
|
|
282
|
-
|
|
283
|
-
// src/lib/compareBy.ts
|
|
284
|
-
function compareBy(iterable, other, comparator) {
|
|
285
|
-
const iterator1 = from(other);
|
|
286
|
-
for (const x of toIterableIterator(iterable)) {
|
|
287
|
-
const result1 = iterator1.next();
|
|
288
|
-
if (result1.done) return 1;
|
|
289
|
-
const y = result1.value;
|
|
290
|
-
const comparison = compareIteratorElements(x, y, comparator);
|
|
291
|
-
if (!orderingIsEqual(comparison)) {
|
|
292
|
-
return orderingIsLess(comparison) ? -1 : 1;
|
|
293
|
-
}
|
|
294
|
-
}
|
|
295
|
-
return iterator1.next().done ? 0 : -1;
|
|
296
|
-
}
|
|
297
|
-
__name(compareBy, "compareBy");
|
|
298
|
-
|
|
299
|
-
// src/lib/shared/comparators.ts
|
|
300
|
-
function swap(cb) {
|
|
301
|
-
return (x, y) => 0 - cb(x, y);
|
|
302
|
-
}
|
|
303
|
-
__name(swap, "swap");
|
|
304
|
-
function defaultCompare(x, y) {
|
|
305
|
-
return ascNumber(String(x), String(y));
|
|
306
|
-
}
|
|
307
|
-
__name(defaultCompare, "defaultCompare");
|
|
308
|
-
var descString = swap(defaultCompare);
|
|
309
|
-
function ascNumber(x, y) {
|
|
310
|
-
return (x > y) - (x < y);
|
|
311
|
-
}
|
|
312
|
-
__name(ascNumber, "ascNumber");
|
|
313
|
-
var descNumber = swap(ascNumber);
|
|
314
|
-
|
|
315
|
-
// src/lib/compare.ts
|
|
316
|
-
function compare(iterable, other) {
|
|
317
|
-
return compareBy(iterable, other, defaultCompare);
|
|
318
|
-
}
|
|
319
|
-
__name(compare, "compare");
|
|
320
|
-
|
|
321
|
-
// src/lib/compress.ts
|
|
322
|
-
function* compress(iterable, selectors) {
|
|
323
|
-
const resolvedSelectors = from(selectors);
|
|
324
|
-
for (const resolvedIterableResult of toIterableIterator(iterable)) {
|
|
325
|
-
const selectorResult = resolvedSelectors.next();
|
|
326
|
-
if (selectorResult.done) {
|
|
327
|
-
return;
|
|
328
|
-
}
|
|
329
|
-
if (selectorResult.value) {
|
|
330
|
-
yield resolvedIterableResult;
|
|
331
|
-
}
|
|
332
|
-
}
|
|
333
|
-
}
|
|
334
|
-
__name(compress, "compress");
|
|
335
|
-
|
|
336
|
-
// src/lib/contains.ts
|
|
337
|
-
function contains(iterable, value) {
|
|
338
|
-
for (const element of toIterableIterator(iterable)) {
|
|
339
|
-
if (element === value) return true;
|
|
340
|
-
}
|
|
341
|
-
return false;
|
|
342
|
-
}
|
|
343
|
-
__name(contains, "contains");
|
|
344
|
-
|
|
345
|
-
// src/lib/count.ts
|
|
346
|
-
function count(iterable) {
|
|
347
|
-
let count2 = 0;
|
|
348
|
-
const resolvedIterable = from(iterable);
|
|
349
|
-
while (!resolvedIterable.next().done) {
|
|
350
|
-
count2++;
|
|
351
|
-
}
|
|
352
|
-
return count2;
|
|
353
|
-
}
|
|
354
|
-
__name(count, "count");
|
|
355
|
-
|
|
356
|
-
// src/lib/cycle.ts
|
|
357
|
-
function* cycle(iterable) {
|
|
358
|
-
const results = [];
|
|
359
|
-
for (const element of toIterableIterator(iterable)) {
|
|
360
|
-
yield element;
|
|
361
|
-
results.push(element);
|
|
362
|
-
}
|
|
363
|
-
while (results.length > 0) {
|
|
364
|
-
for (const element of results) {
|
|
365
|
-
yield element;
|
|
366
|
-
}
|
|
367
|
-
}
|
|
368
|
-
}
|
|
369
|
-
__name(cycle, "cycle");
|
|
370
|
-
|
|
371
|
-
// src/lib/difference.ts
|
|
372
|
-
function difference(first2, second) {
|
|
373
|
-
const set = new Set(toIterableIterator(second));
|
|
374
|
-
return filter(first2, (value) => !set.has(value));
|
|
375
|
-
}
|
|
376
|
-
__name(difference, "difference");
|
|
377
|
-
|
|
378
|
-
// src/lib/take.ts
|
|
379
|
-
function take(iterable, count2) {
|
|
380
|
-
count2 = assertNotNegative(toIntegerOrInfinityOrThrow(count2), count2);
|
|
381
|
-
if (count2 === 0) return empty();
|
|
382
|
-
let i = 0;
|
|
383
|
-
const resolvedIterable = from(iterable);
|
|
384
|
-
return makeIterableIterator(
|
|
385
|
-
() => i >= count2 ? { done: true, value: void 0 } : (i++, resolvedIterable.next())
|
|
386
|
-
);
|
|
387
|
-
}
|
|
388
|
-
__name(take, "take");
|
|
389
|
-
|
|
390
|
-
// src/lib/dropLast.ts
|
|
391
|
-
function dropLast(iterable, count2) {
|
|
392
|
-
count2 = assertNotNegative(toIntegerOrInfinityOrThrow(count2), count2);
|
|
393
|
-
const array = toArray(iterable);
|
|
394
|
-
if (array.length <= count2) return empty();
|
|
395
|
-
return take(array.values(), array.length - count2);
|
|
396
|
-
}
|
|
397
|
-
__name(dropLast, "dropLast");
|
|
398
|
-
|
|
399
|
-
// src/lib/dropWhile.ts
|
|
400
|
-
function* dropWhile(iterable, callbackFn) {
|
|
401
|
-
callbackFn = assertFunction(callbackFn);
|
|
402
|
-
let index = 0;
|
|
403
|
-
for (const value of toIterableIterator(iterable)) {
|
|
404
|
-
if (!callbackFn(value, index++)) {
|
|
405
|
-
yield value;
|
|
406
|
-
}
|
|
407
|
-
}
|
|
408
|
-
}
|
|
409
|
-
__name(dropWhile, "dropWhile");
|
|
410
|
-
|
|
411
|
-
// src/lib/enumerate.ts
|
|
412
|
-
function* enumerate(iterable) {
|
|
413
|
-
let index = 0;
|
|
414
|
-
for (const value of toIterableIterator(iterable)) {
|
|
415
|
-
yield [index++, value];
|
|
416
|
-
}
|
|
417
|
-
}
|
|
418
|
-
__name(enumerate, "enumerate");
|
|
419
|
-
|
|
420
|
-
// src/lib/equalBy.ts
|
|
421
|
-
function equalBy(iterable, other, callbackFn) {
|
|
422
|
-
callbackFn = assertFunction(callbackFn);
|
|
423
|
-
const iterator1 = from(other);
|
|
424
|
-
for (const value0 of toIterableIterator(iterable)) {
|
|
425
|
-
const result1 = iterator1.next();
|
|
426
|
-
if (result1.done || !callbackFn(value0, result1.value)) return false;
|
|
427
|
-
}
|
|
428
|
-
return iterator1.next().done === true;
|
|
429
|
-
}
|
|
430
|
-
__name(equalBy, "equalBy");
|
|
431
|
-
|
|
432
|
-
// src/lib/equal.ts
|
|
433
|
-
function equal(iterable, other) {
|
|
434
|
-
return equalBy(iterable, other, (a, b) => a === b);
|
|
435
|
-
}
|
|
436
|
-
__name(equal, "equal");
|
|
437
|
-
|
|
438
|
-
// src/lib/find.ts
|
|
439
|
-
function find(iterable, callbackFn) {
|
|
440
|
-
return first(filter(iterable, callbackFn));
|
|
441
|
-
}
|
|
442
|
-
__name(find, "find");
|
|
443
|
-
|
|
444
|
-
// src/lib/findIndex.ts
|
|
445
|
-
function findIndex(iterable, callbackFn) {
|
|
446
|
-
callbackFn = assertFunction(callbackFn);
|
|
447
|
-
let index = 0;
|
|
448
|
-
for (const element of toIterableIterator(iterable)) {
|
|
449
|
-
if (callbackFn(element, index)) {
|
|
450
|
-
return index;
|
|
451
|
-
}
|
|
452
|
-
index++;
|
|
453
|
-
}
|
|
454
|
-
return -1;
|
|
455
|
-
}
|
|
456
|
-
__name(findIndex, "findIndex");
|
|
457
|
-
|
|
458
|
-
// src/lib/flat.ts
|
|
459
|
-
function* flat(iterables) {
|
|
460
|
-
for (const value of toIterableIterator(iterables)) {
|
|
461
|
-
yield* toIterableIterator(value);
|
|
462
|
-
}
|
|
463
|
-
}
|
|
464
|
-
__name(flat, "flat");
|
|
465
|
-
|
|
466
|
-
// src/lib/flatMap.ts
|
|
467
|
-
function* flatMap(iterable, callbackFn) {
|
|
468
|
-
callbackFn = assertFunction(callbackFn);
|
|
469
|
-
let index = 0;
|
|
470
|
-
for (const value of toIterableIterator(iterable)) {
|
|
471
|
-
yield* toIterableIterator(callbackFn(value, index++));
|
|
472
|
-
}
|
|
473
|
-
}
|
|
474
|
-
__name(flatMap, "flatMap");
|
|
475
|
-
|
|
476
|
-
// src/lib/forEach.ts
|
|
477
|
-
function forEach(iterable, callbackFn) {
|
|
478
|
-
callbackFn = assertFunction(callbackFn);
|
|
479
|
-
let index = 0;
|
|
480
|
-
for (const element of toIterableIterator(iterable)) {
|
|
481
|
-
callbackFn(element, index++);
|
|
482
|
-
}
|
|
483
|
-
}
|
|
484
|
-
__name(forEach, "forEach");
|
|
485
|
-
|
|
486
|
-
// src/lib/fuse.ts
|
|
487
|
-
function fuse(iterable) {
|
|
488
|
-
let ended = false;
|
|
489
|
-
const iterator = toIterableIterator(iterable);
|
|
490
|
-
return makeIterableIterator(() => {
|
|
491
|
-
if (ended) {
|
|
492
|
-
return { done: true, value: void 0 };
|
|
493
|
-
}
|
|
494
|
-
const result = iterator.next();
|
|
495
|
-
if (result.done) {
|
|
496
|
-
ended = true;
|
|
497
|
-
}
|
|
498
|
-
return result;
|
|
499
|
-
});
|
|
500
|
-
}
|
|
501
|
-
__name(fuse, "fuse");
|
|
502
|
-
|
|
503
|
-
// src/lib/greaterOrEqualThan.ts
|
|
504
|
-
function greaterOrEqualThan(iterable, other) {
|
|
505
|
-
const result = compare(iterable, other);
|
|
506
|
-
return !orderingIsLess(result);
|
|
507
|
-
}
|
|
508
|
-
__name(greaterOrEqualThan, "greaterOrEqualThan");
|
|
509
|
-
|
|
510
|
-
// src/lib/greaterThan.ts
|
|
511
|
-
function greaterThan(iterable, other) {
|
|
512
|
-
const result = compare(iterable, other);
|
|
513
|
-
return orderingIsGreater(result);
|
|
514
|
-
}
|
|
515
|
-
__name(greaterThan, "greaterThan");
|
|
516
|
-
|
|
517
|
-
// src/lib/indexOf.ts
|
|
518
|
-
function indexOf(iterable, value) {
|
|
519
|
-
let index = 0;
|
|
520
|
-
for (const element of toIterableIterator(iterable)) {
|
|
521
|
-
if (element === value) {
|
|
522
|
-
return index;
|
|
523
|
-
}
|
|
524
|
-
index++;
|
|
525
|
-
}
|
|
526
|
-
return -1;
|
|
527
|
-
}
|
|
528
|
-
__name(indexOf, "indexOf");
|
|
529
|
-
|
|
530
|
-
// src/lib/inspect.ts
|
|
531
|
-
function inspect(iterable, callbackFn) {
|
|
532
|
-
callbackFn = assertFunction(callbackFn);
|
|
533
|
-
let index = 0;
|
|
534
|
-
const iterator = from(iterable);
|
|
535
|
-
return makeIterableIterator(() => {
|
|
536
|
-
const result = iterator.next();
|
|
537
|
-
if (!result.done) {
|
|
538
|
-
callbackFn(result.value, index++);
|
|
539
|
-
}
|
|
540
|
-
return result;
|
|
541
|
-
});
|
|
542
|
-
}
|
|
543
|
-
__name(inspect, "inspect");
|
|
544
|
-
|
|
545
|
-
// src/lib/intersect.ts
|
|
546
|
-
function intersect(first2, second) {
|
|
547
|
-
const set = new Set(toIterableIterator(second));
|
|
548
|
-
return filter(first2, (value) => set.has(value));
|
|
549
|
-
}
|
|
550
|
-
__name(intersect, "intersect");
|
|
551
|
-
|
|
552
|
-
// src/lib/intersperse.ts
|
|
553
|
-
function intersperse(iterable, separator) {
|
|
554
|
-
let started = false;
|
|
555
|
-
let nextItem;
|
|
556
|
-
let nextItemTaken = false;
|
|
557
|
-
const iterator = from(iterable);
|
|
558
|
-
return makeIterableIterator(() => {
|
|
559
|
-
if (started) {
|
|
560
|
-
if (nextItemTaken) {
|
|
561
|
-
nextItemTaken = false;
|
|
562
|
-
return { done: false, value: nextItem };
|
|
563
|
-
}
|
|
564
|
-
const result = iterator.next();
|
|
565
|
-
if (result.done) {
|
|
566
|
-
return { done: true, value: void 0 };
|
|
567
|
-
}
|
|
568
|
-
nextItem = result.value;
|
|
569
|
-
nextItemTaken = true;
|
|
570
|
-
return { done: false, value: separator };
|
|
571
|
-
}
|
|
572
|
-
started = true;
|
|
573
|
-
return iterator.next();
|
|
574
|
-
});
|
|
575
|
-
}
|
|
576
|
-
__name(intersperse, "intersperse");
|
|
577
|
-
|
|
578
|
-
// src/lib/isEmpty.ts
|
|
579
|
-
function isEmpty(iterable) {
|
|
580
|
-
return from(iterable).next().done ?? false;
|
|
581
|
-
}
|
|
582
|
-
__name(isEmpty, "isEmpty");
|
|
583
|
-
|
|
584
|
-
// src/lib/isSortedBy.ts
|
|
585
|
-
function isSortedBy(iterable, comparator) {
|
|
586
|
-
comparator = assertFunction(comparator);
|
|
587
|
-
const iterator = toIterableIterator(iterable);
|
|
588
|
-
const result = iterator.next();
|
|
589
|
-
if (result.done) return true;
|
|
590
|
-
let previous = result.value;
|
|
591
|
-
for (const current of iterator) {
|
|
592
|
-
const comparison = compareIteratorElements(previous, current, comparator);
|
|
593
|
-
if (orderingIsGreater(comparison)) return false;
|
|
594
|
-
previous = current;
|
|
595
|
-
}
|
|
596
|
-
return true;
|
|
597
|
-
}
|
|
598
|
-
__name(isSortedBy, "isSortedBy");
|
|
599
|
-
|
|
600
|
-
// src/lib/isSorted.ts
|
|
601
|
-
function isSorted(iterable) {
|
|
602
|
-
return isSortedBy(iterable, defaultCompare);
|
|
603
|
-
}
|
|
604
|
-
__name(isSorted, "isSorted");
|
|
605
|
-
|
|
606
|
-
// src/lib/isSortedByKey.ts
|
|
607
|
-
function isSortedByKey(iterable, callbackFn, comparator = defaultCompare) {
|
|
608
|
-
callbackFn = assertFunction(callbackFn);
|
|
609
|
-
const iterator = toIterableIterator(iterable);
|
|
610
|
-
const result = iterator.next();
|
|
611
|
-
if (result.done) return true;
|
|
612
|
-
let previousKey = callbackFn(result.value, 0);
|
|
613
|
-
let index = 1;
|
|
614
|
-
for (const current of iterator) {
|
|
615
|
-
const currentKey = callbackFn(current, index++);
|
|
616
|
-
const comparison = compareIteratorElements(previousKey, currentKey, comparator);
|
|
617
|
-
if (orderingIsGreater(comparison)) return false;
|
|
618
|
-
previousKey = currentKey;
|
|
619
|
-
}
|
|
620
|
-
return true;
|
|
621
|
-
}
|
|
622
|
-
__name(isSortedByKey, "isSortedByKey");
|
|
623
|
-
|
|
624
|
-
// src/lib/last.ts
|
|
625
|
-
function last(iterable) {
|
|
626
|
-
let last2;
|
|
627
|
-
for (const value of toIterableIterator(iterable)) {
|
|
628
|
-
last2 = value;
|
|
629
|
-
}
|
|
630
|
-
return last2;
|
|
631
|
-
}
|
|
632
|
-
__name(last, "last");
|
|
633
|
-
|
|
634
|
-
// src/lib/lessOrEqualThan.ts
|
|
635
|
-
function lessOrEqualThan(iterable, other) {
|
|
636
|
-
const result = compare(iterable, other);
|
|
637
|
-
return !orderingIsGreater(result);
|
|
638
|
-
}
|
|
639
|
-
__name(lessOrEqualThan, "lessOrEqualThan");
|
|
640
|
-
|
|
641
|
-
// src/lib/lessThan.ts
|
|
642
|
-
function lessThan(iterable, other) {
|
|
643
|
-
const result = compare(iterable, other);
|
|
644
|
-
return orderingIsLess(result);
|
|
645
|
-
}
|
|
646
|
-
__name(lessThan, "lessThan");
|
|
647
|
-
|
|
648
|
-
// src/lib/maxBy.ts
|
|
649
|
-
function maxBy(iterable, comparator) {
|
|
650
|
-
comparator = assertFunction(comparator);
|
|
651
|
-
const iterator = toIterableIterator(iterable);
|
|
652
|
-
const first2 = iterator.next();
|
|
653
|
-
if (first2.done) return null;
|
|
654
|
-
let maximum = first2.value;
|
|
655
|
-
for (const value of iterator) {
|
|
656
|
-
const comparison = compareIteratorElements(value, maximum, comparator);
|
|
657
|
-
if (!orderingIsLess(comparison)) {
|
|
658
|
-
maximum = value;
|
|
659
|
-
}
|
|
660
|
-
}
|
|
661
|
-
return maximum;
|
|
662
|
-
}
|
|
663
|
-
__name(maxBy, "maxBy");
|
|
664
|
-
|
|
665
|
-
// src/lib/max.ts
|
|
666
|
-
function max(iterable) {
|
|
667
|
-
return maxBy(iterable, defaultCompare);
|
|
668
|
-
}
|
|
669
|
-
__name(max, "max");
|
|
670
|
-
|
|
671
|
-
// src/lib/maxByKey.ts
|
|
672
|
-
function maxByKey(iterable, callbackFn, comparator = defaultCompare) {
|
|
673
|
-
callbackFn = assertFunction(callbackFn);
|
|
674
|
-
const iterator = toIterableIterator(iterable);
|
|
675
|
-
const first2 = iterator.next();
|
|
676
|
-
if (first2.done) return null;
|
|
677
|
-
let maximum = first2.value;
|
|
678
|
-
let maximumKey = callbackFn(maximum, 0);
|
|
679
|
-
let index = 1;
|
|
680
|
-
for (const value of iterator) {
|
|
681
|
-
const key = callbackFn(value, index++);
|
|
682
|
-
const comparison = compareIteratorElements(maximumKey, key, comparator);
|
|
683
|
-
if (!orderingIsGreater(comparison)) {
|
|
684
|
-
maximum = value;
|
|
685
|
-
maximumKey = key;
|
|
686
|
-
}
|
|
687
|
-
}
|
|
688
|
-
return maximum;
|
|
689
|
-
}
|
|
690
|
-
__name(maxByKey, "maxByKey");
|
|
691
|
-
|
|
692
|
-
// src/lib/minBy.ts
|
|
693
|
-
function minBy(iterable, comparator) {
|
|
694
|
-
comparator = assertFunction(comparator);
|
|
695
|
-
const iterator = toIterableIterator(iterable);
|
|
696
|
-
const first2 = iterator.next();
|
|
697
|
-
if (first2.done) return null;
|
|
698
|
-
let minimum = first2.value;
|
|
699
|
-
for (const value of iterator) {
|
|
700
|
-
const comparison = compareIteratorElements(value, minimum, comparator);
|
|
701
|
-
if (!orderingIsGreater(comparison)) {
|
|
702
|
-
minimum = value;
|
|
703
|
-
}
|
|
704
|
-
}
|
|
705
|
-
return minimum;
|
|
706
|
-
}
|
|
707
|
-
__name(minBy, "minBy");
|
|
708
|
-
|
|
709
|
-
// src/lib/min.ts
|
|
710
|
-
function min(iterable) {
|
|
711
|
-
return minBy(iterable, defaultCompare);
|
|
712
|
-
}
|
|
713
|
-
__name(min, "min");
|
|
714
|
-
|
|
715
|
-
// src/lib/minByKey.ts
|
|
716
|
-
function minByKey(iterable, callbackFn, comparator = defaultCompare) {
|
|
717
|
-
callbackFn = assertFunction(callbackFn);
|
|
718
|
-
const iterator = toIterableIterator(iterable);
|
|
719
|
-
const first2 = iterator.next();
|
|
720
|
-
if (first2.done) return null;
|
|
721
|
-
let minimum = first2.value;
|
|
722
|
-
let minimumKey = callbackFn(minimum, 0);
|
|
723
|
-
let index = 1;
|
|
724
|
-
for (const value of iterator) {
|
|
725
|
-
const key = callbackFn(value, index++);
|
|
726
|
-
const comparison = compareIteratorElements(minimumKey, key, comparator);
|
|
727
|
-
if (!orderingIsLess(comparison)) {
|
|
728
|
-
minimum = value;
|
|
729
|
-
minimumKey = key;
|
|
730
|
-
}
|
|
731
|
-
}
|
|
732
|
-
return minimum;
|
|
733
|
-
}
|
|
734
|
-
__name(minByKey, "minByKey");
|
|
735
|
-
|
|
736
|
-
// src/lib/notEqual.ts
|
|
737
|
-
function notEqual(iterable, other) {
|
|
738
|
-
return !equal(iterable, other);
|
|
739
|
-
}
|
|
740
|
-
__name(notEqual, "notEqual");
|
|
741
|
-
|
|
742
|
-
// src/lib/partition.ts
|
|
743
|
-
function partition(iterable, predicate) {
|
|
744
|
-
predicate = assertFunction(predicate);
|
|
745
|
-
const bufferLeft = [];
|
|
746
|
-
const bufferRight = [];
|
|
747
|
-
let index = 0;
|
|
748
|
-
for (const value of toIterableIterator(iterable)) {
|
|
749
|
-
if (predicate(value, index++)) {
|
|
750
|
-
bufferLeft.push(value);
|
|
751
|
-
} else {
|
|
752
|
-
bufferRight.push(value);
|
|
753
|
-
}
|
|
754
|
-
}
|
|
755
|
-
return [bufferLeft, bufferRight];
|
|
756
|
-
}
|
|
757
|
-
__name(partition, "partition");
|
|
758
|
-
|
|
759
|
-
// src/lib/peekable.ts
|
|
760
|
-
function peekable(iterable) {
|
|
761
|
-
const resolvedIterable = from(iterable);
|
|
762
|
-
let peeked;
|
|
763
|
-
return {
|
|
764
|
-
next() {
|
|
765
|
-
if (peeked) {
|
|
766
|
-
const value = peeked;
|
|
767
|
-
peeked = void 0;
|
|
768
|
-
return value;
|
|
769
|
-
}
|
|
770
|
-
return resolvedIterable.next();
|
|
771
|
-
},
|
|
772
|
-
peek() {
|
|
773
|
-
return peeked ??= resolvedIterable.next();
|
|
774
|
-
},
|
|
775
|
-
[Symbol.iterator]() {
|
|
776
|
-
return this;
|
|
777
|
-
}
|
|
778
|
-
};
|
|
779
|
-
}
|
|
780
|
-
__name(peekable, "peekable");
|
|
781
|
-
|
|
782
|
-
// src/lib/prepend.ts
|
|
783
|
-
function* prepend(iterable, ...iterables) {
|
|
784
|
-
for (const iterable2 of iterables) {
|
|
785
|
-
yield* toIterableIterator(iterable2);
|
|
786
|
-
}
|
|
787
|
-
yield* toIterableIterator(iterable);
|
|
788
|
-
}
|
|
789
|
-
__name(prepend, "prepend");
|
|
790
|
-
|
|
791
|
-
// src/lib/product.ts
|
|
792
|
-
function product(iterable) {
|
|
793
|
-
let result = 1;
|
|
794
|
-
for (const value of map(iterable, toNumberOrThrow)) {
|
|
795
|
-
result *= value;
|
|
796
|
-
}
|
|
797
|
-
return result;
|
|
798
|
-
}
|
|
799
|
-
__name(product, "product");
|
|
800
|
-
|
|
801
|
-
// src/lib/range.ts
|
|
802
|
-
function* range(start, end, step) {
|
|
803
|
-
start = toNumberOrThrow(start);
|
|
804
|
-
end = toNumberOrThrow(end);
|
|
805
|
-
if (step === void 0) {
|
|
806
|
-
step = start < end ? 1 : -1;
|
|
807
|
-
} else {
|
|
808
|
-
step = toNumberOrThrow(step);
|
|
809
|
-
if (step === 0) {
|
|
810
|
-
throw new RangeError("Step cannot be zero");
|
|
811
|
-
}
|
|
812
|
-
if (step > 0 && start > end) {
|
|
813
|
-
throw new RangeError("Start must be less than end when step is positive");
|
|
814
|
-
} else if (step < 0 && start < end) {
|
|
815
|
-
throw new RangeError("Start must be greater than end when step is negative");
|
|
816
|
-
}
|
|
817
|
-
}
|
|
818
|
-
if (start < end) {
|
|
819
|
-
for (let i = start; i < end; i += step) {
|
|
820
|
-
yield i;
|
|
821
|
-
}
|
|
822
|
-
} else {
|
|
823
|
-
for (let i = start; i > end; i += step) {
|
|
824
|
-
yield i;
|
|
825
|
-
}
|
|
826
|
-
}
|
|
827
|
-
}
|
|
828
|
-
__name(range, "range");
|
|
829
|
-
|
|
830
|
-
// src/lib/reduce.ts
|
|
831
|
-
function reduce(iterable, callbackFn, initialValue) {
|
|
832
|
-
callbackFn = assertFunction(callbackFn);
|
|
833
|
-
let index;
|
|
834
|
-
let accumulator;
|
|
835
|
-
const resolvedIterable = toIterableIterator(iterable);
|
|
836
|
-
if (arguments.length < 3) {
|
|
837
|
-
const firstValue = resolvedIterable.next();
|
|
838
|
-
if (firstValue.done) throw new TypeError("Reduce of empty iterator with no initial value");
|
|
839
|
-
index = 1;
|
|
840
|
-
accumulator = firstValue.value;
|
|
841
|
-
} else {
|
|
842
|
-
index = 0;
|
|
843
|
-
accumulator = initialValue;
|
|
844
|
-
}
|
|
845
|
-
for (const value of resolvedIterable) {
|
|
846
|
-
accumulator = callbackFn(accumulator, value, index++);
|
|
847
|
-
}
|
|
848
|
-
return accumulator;
|
|
849
|
-
}
|
|
850
|
-
__name(reduce, "reduce");
|
|
851
|
-
|
|
852
|
-
// src/lib/repeat.ts
|
|
853
|
-
function repeat(value, count2) {
|
|
854
|
-
count2 = assertNotNegative(toNumberOrThrow(count2), count2);
|
|
855
|
-
let i = 0;
|
|
856
|
-
return makeIterableIterator(
|
|
857
|
-
() => i >= count2 ? { done: true, value: void 0 } : (i++, { done: false, value })
|
|
858
|
-
);
|
|
859
|
-
}
|
|
860
|
-
__name(repeat, "repeat");
|
|
861
|
-
|
|
862
|
-
// src/lib/reverse.ts
|
|
863
|
-
function* reverse(iterable) {
|
|
864
|
-
const items = toArray(iterable);
|
|
865
|
-
for (let i = items.length - 1; i >= 0; i--) {
|
|
866
|
-
yield items[i];
|
|
867
|
-
}
|
|
868
|
-
}
|
|
869
|
-
__name(reverse, "reverse");
|
|
870
|
-
|
|
871
|
-
// src/lib/takeLast.ts
|
|
872
|
-
function takeLast(iterable, count2) {
|
|
873
|
-
count2 = assertNotNegative(toIntegerOrInfinityOrThrow(count2), count2);
|
|
874
|
-
if (count2 === 0) return empty();
|
|
875
|
-
if (count2 === Number.POSITIVE_INFINITY) return toIterableIterator(iterable);
|
|
876
|
-
const array = toArray(iterable);
|
|
877
|
-
let i = Math.max(0, array.length - count2);
|
|
878
|
-
return makeIterableIterator(() => {
|
|
879
|
-
if (i >= array.length) {
|
|
880
|
-
return { done: true, value: void 0 };
|
|
881
|
-
}
|
|
882
|
-
return { done: false, value: array[i++] };
|
|
883
|
-
});
|
|
884
|
-
}
|
|
885
|
-
__name(takeLast, "takeLast");
|
|
886
|
-
|
|
887
|
-
// src/lib/slice.ts
|
|
888
|
-
function slice(iterable, start, end) {
|
|
889
|
-
start = toIntegerOrInfinityOrThrow(start ?? 0);
|
|
890
|
-
if (start === Number.NEGATIVE_INFINITY) {
|
|
891
|
-
start = 0;
|
|
892
|
-
}
|
|
893
|
-
if (end === void 0) {
|
|
894
|
-
return start >= 0 ? drop(iterable, start) : takeLast(iterable, -start);
|
|
895
|
-
}
|
|
896
|
-
end = toIntegerOrInfinityOrThrow(end);
|
|
897
|
-
if (end < 0) {
|
|
898
|
-
if (end === Number.NEGATIVE_INFINITY) {
|
|
899
|
-
return empty();
|
|
900
|
-
}
|
|
901
|
-
if (start === 0) {
|
|
902
|
-
return dropLast(iterable, -end);
|
|
903
|
-
}
|
|
904
|
-
if (start >= 0) {
|
|
905
|
-
return dropLast(drop(iterable, start), -end);
|
|
906
|
-
}
|
|
907
|
-
if (start >= end) {
|
|
908
|
-
return empty();
|
|
909
|
-
}
|
|
910
|
-
return take(takeLast(iterable, -start), end - start);
|
|
911
|
-
}
|
|
912
|
-
if (start >= end) return empty();
|
|
913
|
-
return end === Number.POSITIVE_INFINITY ? drop(iterable, start) : take(drop(iterable, start), end - start);
|
|
914
|
-
}
|
|
915
|
-
__name(slice, "slice");
|
|
916
|
-
|
|
917
|
-
// src/lib/sorted.ts
|
|
918
|
-
function sorted(iterable, compareFn) {
|
|
919
|
-
return toArray(iterable).sort(compareFn).values();
|
|
920
|
-
}
|
|
921
|
-
__name(sorted, "sorted");
|
|
922
|
-
|
|
923
|
-
// src/lib/starMap.ts
|
|
924
|
-
function* starMap(iterable, callbackFn) {
|
|
925
|
-
callbackFn = assertFunction(callbackFn);
|
|
926
|
-
for (const value of toIterableIterator(iterable)) {
|
|
927
|
-
yield callbackFn(...toIterableIterator(value));
|
|
928
|
-
}
|
|
929
|
-
}
|
|
930
|
-
__name(starMap, "starMap");
|
|
931
|
-
|
|
932
|
-
// src/lib/stepBy.ts
|
|
933
|
-
function stepBy(iterable, step) {
|
|
934
|
-
step = assertPositive(toIntegerOrInfinityOrThrow(step), step);
|
|
935
|
-
const iterator = from(iterable);
|
|
936
|
-
return makeIterableIterator(() => {
|
|
937
|
-
const result = iterator.next();
|
|
938
|
-
if (result.done) {
|
|
939
|
-
return { done: true, value: void 0 };
|
|
940
|
-
}
|
|
941
|
-
for (let i = 0; i < step - 1; i++) {
|
|
942
|
-
const result2 = iterator.next();
|
|
943
|
-
if (result2.done) break;
|
|
944
|
-
}
|
|
945
|
-
return { done: false, value: result.value };
|
|
946
|
-
});
|
|
947
|
-
}
|
|
948
|
-
__name(stepBy, "stepBy");
|
|
949
|
-
|
|
950
|
-
// src/lib/sum.ts
|
|
951
|
-
function sum(iterable) {
|
|
952
|
-
let sum2 = 0;
|
|
953
|
-
for (const value of map(iterable, toNumberOrThrow)) {
|
|
954
|
-
sum2 += value;
|
|
955
|
-
}
|
|
956
|
-
return sum2;
|
|
957
|
-
}
|
|
958
|
-
__name(sum, "sum");
|
|
959
|
-
|
|
960
|
-
// src/lib/tee.ts
|
|
961
|
-
function tee(iterable, count2) {
|
|
962
|
-
count2 = assertNotNegative(toIntegerOrThrow(count2), count2);
|
|
963
|
-
if (count2 === 0) return [];
|
|
964
|
-
const entries = [];
|
|
965
|
-
const indexes = toArray(repeat(0, count2));
|
|
966
|
-
const resolvedIterable = from(iterable);
|
|
967
|
-
const iterables = [];
|
|
968
|
-
for (let i = 0; i < count2; i++) {
|
|
969
|
-
const iterable2 = makeIterableIterator(() => {
|
|
970
|
-
if (indexes[i] >= entries.length) {
|
|
971
|
-
const result = resolvedIterable.next();
|
|
972
|
-
if (result.done) {
|
|
973
|
-
return { done: true, value: void 0 };
|
|
974
|
-
}
|
|
975
|
-
entries.push(result.value);
|
|
976
|
-
}
|
|
977
|
-
return { done: false, value: entries[indexes[i]++] };
|
|
978
|
-
});
|
|
979
|
-
iterables.push(iterable2);
|
|
980
|
-
}
|
|
981
|
-
return iterables;
|
|
982
|
-
}
|
|
983
|
-
__name(tee, "tee");
|
|
984
|
-
|
|
985
|
-
// src/lib/union.ts
|
|
986
|
-
function* union(...iterables) {
|
|
987
|
-
const seen = /* @__PURE__ */ new Set();
|
|
988
|
-
for (const iterator of iterables) {
|
|
989
|
-
for (const value of toIterableIterator(iterator)) {
|
|
990
|
-
if (!seen.has(value)) {
|
|
991
|
-
seen.add(value);
|
|
992
|
-
yield value;
|
|
993
|
-
}
|
|
994
|
-
}
|
|
995
|
-
}
|
|
996
|
-
}
|
|
997
|
-
__name(union, "union");
|
|
998
|
-
|
|
999
|
-
// src/lib/unique.ts
|
|
1000
|
-
function unique(iterable) {
|
|
1001
|
-
return union(iterable);
|
|
1002
|
-
}
|
|
1003
|
-
__name(unique, "unique");
|
|
1004
|
-
|
|
1005
|
-
// src/lib/unzip.ts
|
|
1006
|
-
function unzip(iterable) {
|
|
1007
|
-
const resolvedIterable = toIterableIterator(iterable);
|
|
1008
|
-
const firstResult = resolvedIterable.next();
|
|
1009
|
-
if (firstResult.done) {
|
|
1010
|
-
throw new Error("Cannot unzip an empty iterable");
|
|
1011
|
-
}
|
|
1012
|
-
if (!Array.isArray(firstResult.value)) {
|
|
1013
|
-
throw new Error("Cannot unzip an iterable that does not yield an array");
|
|
1014
|
-
}
|
|
1015
|
-
const size = firstResult.value.length;
|
|
1016
|
-
const results = [];
|
|
1017
|
-
for (let i = 0; i < size; i++) results.push([firstResult.value[i]]);
|
|
1018
|
-
for (const entries of resolvedIterable) {
|
|
1019
|
-
if (!Array.isArray(entries)) {
|
|
1020
|
-
throw new Error("Cannot unzip an iterable that does not yield an array");
|
|
1021
|
-
}
|
|
1022
|
-
if (entries.length !== size) {
|
|
1023
|
-
throw new Error("Cannot unzip an iterable that yields arrays of different sizes");
|
|
1024
|
-
}
|
|
1025
|
-
for (let i = 0; i < size; i++) {
|
|
1026
|
-
results[i].push(entries[i]);
|
|
1027
|
-
}
|
|
1028
|
-
}
|
|
1029
|
-
return results;
|
|
1030
|
-
}
|
|
1031
|
-
__name(unzip, "unzip");
|
|
1032
|
-
|
|
1033
|
-
// src/lib/windows.ts
|
|
1034
|
-
function windows(iterable, count2) {
|
|
1035
|
-
count2 = assertPositive(toIntegerOrInfinityOrThrow(count2), count2);
|
|
1036
|
-
const buffer = [];
|
|
1037
|
-
const resolvedIterable = from(iterable);
|
|
1038
|
-
return makeIterableIterator(() => {
|
|
1039
|
-
while (buffer.length !== count2) {
|
|
1040
|
-
const result = resolvedIterable.next();
|
|
1041
|
-
if (result.done) return { done: true, value: void 0 };
|
|
1042
|
-
buffer.push(result.value);
|
|
1043
|
-
}
|
|
1044
|
-
const value = buffer.slice();
|
|
1045
|
-
buffer.shift();
|
|
1046
|
-
return { done: false, value };
|
|
1047
|
-
});
|
|
1048
|
-
}
|
|
1049
|
-
__name(windows, "windows");
|
|
1050
|
-
|
|
1051
|
-
// src/lib/zip.ts
|
|
1052
|
-
function* zip(...iterables) {
|
|
1053
|
-
const resolvedIterables = iterables.map((iterable) => from(iterable));
|
|
1054
|
-
while (true) {
|
|
1055
|
-
const results = [];
|
|
1056
|
-
for (const resolvedIterable of resolvedIterables) {
|
|
1057
|
-
const result = resolvedIterable.next();
|
|
1058
|
-
if (result.done) return;
|
|
1059
|
-
results.push(result.value);
|
|
1060
|
-
}
|
|
1061
|
-
yield results;
|
|
1062
|
-
}
|
|
1063
|
-
}
|
|
1064
|
-
__name(zip, "zip");
|
|
1065
|
-
|
|
1066
|
-
exports.all = every;
|
|
1067
|
-
exports.any = some;
|
|
1068
|
-
exports.append = append;
|
|
1069
|
-
exports.ascNumber = ascNumber;
|
|
1070
|
-
exports.ascString = defaultCompare;
|
|
1071
|
-
exports.at = at;
|
|
1072
|
-
exports.average = average;
|
|
1073
|
-
exports.chain = chain;
|
|
1074
|
-
exports.chunk = chunk;
|
|
1075
|
-
exports.collect = toArray;
|
|
1076
|
-
exports.collectInto = collectInto;
|
|
1077
|
-
exports.compact = compact;
|
|
1078
|
-
exports.compare = compare;
|
|
1079
|
-
exports.compareBy = compareBy;
|
|
1080
|
-
exports.compress = compress;
|
|
1081
|
-
exports.concat = append;
|
|
1082
|
-
exports.contains = contains;
|
|
1083
|
-
exports.count = count;
|
|
1084
|
-
exports.cycle = cycle;
|
|
1085
|
-
exports.defaultCompare = defaultCompare;
|
|
1086
|
-
exports.descNumber = descNumber;
|
|
1087
|
-
exports.descString = descString;
|
|
1088
|
-
exports.difference = difference;
|
|
1089
|
-
exports.drop = drop;
|
|
1090
|
-
exports.dropLast = dropLast;
|
|
1091
|
-
exports.dropWhile = dropWhile;
|
|
1092
|
-
exports.empty = empty;
|
|
1093
|
-
exports.enumerate = enumerate;
|
|
1094
|
-
exports.eq = equal;
|
|
1095
|
-
exports.eqBy = equalBy;
|
|
1096
|
-
exports.equal = equal;
|
|
1097
|
-
exports.equalBy = equalBy;
|
|
1098
|
-
exports.every = every;
|
|
1099
|
-
exports.except = difference;
|
|
1100
|
-
exports.filter = filter;
|
|
1101
|
-
exports.find = find;
|
|
1102
|
-
exports.findIndex = findIndex;
|
|
1103
|
-
exports.first = first;
|
|
1104
|
-
exports.flat = flat;
|
|
1105
|
-
exports.flatMap = flatMap;
|
|
1106
|
-
exports.forEach = forEach;
|
|
1107
|
-
exports.from = from;
|
|
1108
|
-
exports.fuse = fuse;
|
|
1109
|
-
exports.ge = greaterOrEqualThan;
|
|
1110
|
-
exports.greaterOrEqualThan = greaterOrEqualThan;
|
|
1111
|
-
exports.greaterThan = greaterThan;
|
|
1112
|
-
exports.gt = greaterThan;
|
|
1113
|
-
exports.indexOf = indexOf;
|
|
1114
|
-
exports.inspect = inspect;
|
|
1115
|
-
exports.intersect = intersect;
|
|
1116
|
-
exports.intersperse = intersperse;
|
|
1117
|
-
exports.isEmpty = isEmpty;
|
|
1118
|
-
exports.isSorted = isSorted;
|
|
1119
|
-
exports.isSortedBy = isSortedBy;
|
|
1120
|
-
exports.isSortedByKey = isSortedByKey;
|
|
1121
|
-
exports.last = last;
|
|
1122
|
-
exports.le = lessOrEqualThan;
|
|
1123
|
-
exports.lessOrEqualThan = lessOrEqualThan;
|
|
1124
|
-
exports.lessThan = lessThan;
|
|
1125
|
-
exports.lt = lessThan;
|
|
1126
|
-
exports.map = map;
|
|
1127
|
-
exports.max = max;
|
|
1128
|
-
exports.maxBy = maxBy;
|
|
1129
|
-
exports.maxByKey = maxByKey;
|
|
1130
|
-
exports.min = min;
|
|
1131
|
-
exports.minBy = minBy;
|
|
1132
|
-
exports.minByKey = minByKey;
|
|
1133
|
-
exports.ne = notEqual;
|
|
1134
|
-
exports.notEqual = notEqual;
|
|
1135
|
-
exports.nth = at;
|
|
1136
|
-
exports.omit = difference;
|
|
1137
|
-
exports.partition = partition;
|
|
1138
|
-
exports.peekable = peekable;
|
|
1139
|
-
exports.position = indexOf;
|
|
1140
|
-
exports.prepend = prepend;
|
|
1141
|
-
exports.product = product;
|
|
1142
|
-
exports.range = range;
|
|
1143
|
-
exports.reduce = reduce;
|
|
1144
|
-
exports.repeat = repeat;
|
|
1145
|
-
exports.reverse = reverse;
|
|
1146
|
-
exports.skip = drop;
|
|
1147
|
-
exports.skipLast = dropLast;
|
|
1148
|
-
exports.skipWhile = dropWhile;
|
|
1149
|
-
exports.slice = slice;
|
|
1150
|
-
exports.some = some;
|
|
1151
|
-
exports.sorted = sorted;
|
|
1152
|
-
exports.starMap = starMap;
|
|
1153
|
-
exports.stepBy = stepBy;
|
|
1154
|
-
exports.sum = sum;
|
|
1155
|
-
exports.take = take;
|
|
1156
|
-
exports.takeLast = takeLast;
|
|
1157
|
-
exports.takeWhile = filter;
|
|
1158
|
-
exports.tee = tee;
|
|
1159
|
-
exports.toArray = toArray;
|
|
1160
|
-
exports.toIterableIterator = toIterableIterator;
|
|
1161
|
-
exports.union = union;
|
|
1162
|
-
exports.unique = unique;
|
|
1163
|
-
exports.unzip = unzip;
|
|
1164
|
-
exports.windows = windows;
|
|
1165
|
-
exports.zip = zip;
|
|
1166
|
-
|
|
1167
|
-
return exports;
|
|
1168
|
-
|
|
1169
|
-
})({});
|
|
1170
|
-
//# sourceMappingURL=index.global.js.map
|
|
1171
|
-
//# sourceMappingURL=index.global.js.map
|