@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
package/dist/cjs/lib/inspect.cjs
DELETED
|
@@ -1,25 +0,0 @@
|
|
|
1
|
-
'use strict';
|
|
2
|
-
|
|
3
|
-
var from_cjs = require('./from.cjs');
|
|
4
|
-
var _assertFunction_cjs = require('./shared/_assertFunction.cjs');
|
|
5
|
-
var _makeIterableIterator_cjs = require('./shared/_makeIterableIterator.cjs');
|
|
6
|
-
|
|
7
|
-
var __defProp = Object.defineProperty;
|
|
8
|
-
var __name = (target, value) => __defProp(target, "name", { value, configurable: true });
|
|
9
|
-
function inspect(iterable, callbackFn) {
|
|
10
|
-
callbackFn = _assertFunction_cjs.assertFunction(callbackFn);
|
|
11
|
-
let index = 0;
|
|
12
|
-
const iterator = from_cjs.from(iterable);
|
|
13
|
-
return _makeIterableIterator_cjs.makeIterableIterator(() => {
|
|
14
|
-
const result = iterator.next();
|
|
15
|
-
if (!result.done) {
|
|
16
|
-
callbackFn(result.value, index++);
|
|
17
|
-
}
|
|
18
|
-
return result;
|
|
19
|
-
});
|
|
20
|
-
}
|
|
21
|
-
__name(inspect, "inspect");
|
|
22
|
-
|
|
23
|
-
exports.inspect = inspect;
|
|
24
|
-
//# sourceMappingURL=inspect.cjs.map
|
|
25
|
-
//# sourceMappingURL=inspect.cjs.map
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"sources":["../../../src/lib/inspect.ts"],"names":["assertFunction","from","makeIterableIterator"],"mappings":";;;;;;;;AAsCO,SAAS,OAAA,CACf,UACA,UAAA,EACgC;AAChC,EAAA,UAAA,GAAaA,mCAAe,UAAU,CAAA;AAEtC,EAAA,IAAI,KAAA,GAAQ,CAAA;AACZ,EAAA,MAAM,QAAA,GAAWC,cAAK,QAAQ,CAAA;AAC9B,EAAA,OAAOC,+CAAkC,MAAM;AAC9C,IAAA,MAAM,MAAA,GAAS,SAAS,IAAA,EAAK;AAC7B,IAAA,IAAI,CAAC,OAAO,IAAA,EAAM;AACjB,MAAA,UAAA,CAAW,MAAA,CAAO,OAAO,KAAA,EAAO,CAAA;AAAA,IACjC;AAEA,IAAA,OAAO,MAAA;AAAA,EACR,CAAC,CAAA;AACF;AAhBgB,MAAA,CAAA,OAAA,EAAA,SAAA,CAAA","file":"inspect.cjs","sourcesContent":["import { from, type IterableResolvable } from './from';\nimport { assertFunction } from './shared/_assertFunction';\nimport { makeIterableIterator } from './shared/_makeIterableIterator';\n\n/**\n * Does something with each element of an iterator, passing the value on.\n *\n * When using iterators, you'll often chain several of them together. While working on such code, you might want to\n * check out what's happening at various parts in the pipeline. To do that, insert a call to this function.\n *\n * It's more common for this function to be used as a debugging tool than to exist in your final code, but applications\n * may find it useful in certain situations when errors need to be logged before being discarded.\n *\n * @param iterable An iterator to inspect.\n *\n * @example\n * ```typescript\n * import { inspect } from '@sapphire/iterator-utilities';\n *\n * const iterable = [1, 4, 2, 3];\n *\n * let iter = inspect(iter, (value) => console.log(`about to filter: ${value}`));\n * iter = filter(iterable, (value) => value % 2 === 0);\n * iter = inspect(iter, (value) => console.log(`made it through filter: ${value}`));\n *\n * const sum = reduce(iter, (acc, value) => acc + value, 0);\n * console.log(sum);\n *\n * // Output:\n * // about to filter: 1\n * // about to filter: 4\n * // made it through filter: 4\n * // about to filter: 2\n * // made it through filter: 2\n * // about to filter: 3\n * // 6\n * ```\n */\nexport function inspect<const ElementType>(\n\titerable: IterableResolvable<ElementType>,\n\tcallbackFn: (element: ElementType, index: number) => void\n): IterableIterator<ElementType> {\n\tcallbackFn = assertFunction(callbackFn);\n\n\tlet index = 0;\n\tconst iterator = from(iterable);\n\treturn makeIterableIterator<ElementType>(() => {\n\t\tconst result = iterator.next();\n\t\tif (!result.done) {\n\t\t\tcallbackFn(result.value, index++);\n\t\t}\n\n\t\treturn result;\n\t});\n}\n"]}
|
|
@@ -1,39 +0,0 @@
|
|
|
1
|
-
import { IterableResolvable } from './from.cjs';
|
|
2
|
-
|
|
3
|
-
/**
|
|
4
|
-
* Does something with each element of an iterator, passing the value on.
|
|
5
|
-
*
|
|
6
|
-
* When using iterators, you'll often chain several of them together. While working on such code, you might want to
|
|
7
|
-
* check out what's happening at various parts in the pipeline. To do that, insert a call to this function.
|
|
8
|
-
*
|
|
9
|
-
* It's more common for this function to be used as a debugging tool than to exist in your final code, but applications
|
|
10
|
-
* may find it useful in certain situations when errors need to be logged before being discarded.
|
|
11
|
-
*
|
|
12
|
-
* @param iterable An iterator to inspect.
|
|
13
|
-
*
|
|
14
|
-
* @example
|
|
15
|
-
* ```typescript
|
|
16
|
-
* import { inspect } from '@sapphire/iterator-utilities';
|
|
17
|
-
*
|
|
18
|
-
* const iterable = [1, 4, 2, 3];
|
|
19
|
-
*
|
|
20
|
-
* let iter = inspect(iter, (value) => console.log(`about to filter: ${value}`));
|
|
21
|
-
* iter = filter(iterable, (value) => value % 2 === 0);
|
|
22
|
-
* iter = inspect(iter, (value) => console.log(`made it through filter: ${value}`));
|
|
23
|
-
*
|
|
24
|
-
* const sum = reduce(iter, (acc, value) => acc + value, 0);
|
|
25
|
-
* console.log(sum);
|
|
26
|
-
*
|
|
27
|
-
* // Output:
|
|
28
|
-
* // about to filter: 1
|
|
29
|
-
* // about to filter: 4
|
|
30
|
-
* // made it through filter: 4
|
|
31
|
-
* // about to filter: 2
|
|
32
|
-
* // made it through filter: 2
|
|
33
|
-
* // about to filter: 3
|
|
34
|
-
* // 6
|
|
35
|
-
* ```
|
|
36
|
-
*/
|
|
37
|
-
declare function inspect<const ElementType>(iterable: IterableResolvable<ElementType>, callbackFn: (element: ElementType, index: number) => void): IterableIterator<ElementType>;
|
|
38
|
-
|
|
39
|
-
export { inspect };
|
|
@@ -1,16 +0,0 @@
|
|
|
1
|
-
'use strict';
|
|
2
|
-
|
|
3
|
-
var filter_cjs = require('./filter.cjs');
|
|
4
|
-
var toIterableIterator_cjs = require('./toIterableIterator.cjs');
|
|
5
|
-
|
|
6
|
-
var __defProp = Object.defineProperty;
|
|
7
|
-
var __name = (target, value) => __defProp(target, "name", { value, configurable: true });
|
|
8
|
-
function intersect(first, second) {
|
|
9
|
-
const set = new Set(toIterableIterator_cjs.toIterableIterator(second));
|
|
10
|
-
return filter_cjs.filter(first, (value) => set.has(value));
|
|
11
|
-
}
|
|
12
|
-
__name(intersect, "intersect");
|
|
13
|
-
|
|
14
|
-
exports.intersect = intersect;
|
|
15
|
-
//# sourceMappingURL=intersect.cjs.map
|
|
16
|
-
//# sourceMappingURL=intersect.cjs.map
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"sources":["../../../src/lib/intersect.ts"],"names":["toIterableIterator","filter"],"mappings":";;;;;;;AAyBO,SAAS,SAAA,CACf,OACA,MAAA,EACgC;AAChC,EAAA,MAAM,GAAA,GAAM,IAAI,GAAA,CAAIA,yCAAA,CAAmB,MAAM,CAAC,CAAA;AAC9C,EAAA,OAAOC,kBAAO,KAAA,EAAO,CAAC,UAAU,GAAA,CAAI,GAAA,CAAI,KAAK,CAAC,CAAA;AAC/C;AANgB,MAAA,CAAA,SAAA,EAAA,WAAA,CAAA","file":"intersect.cjs","sourcesContent":["import { filter } from './filter';\nimport type { IterableResolvable } from './from';\nimport { toIterableIterator } from './toIterableIterator';\n\n/**\n * Creates an iterable with the elements that are in both input iterables.\n *\n * @param first An iterator to return elements from.\n * @param second An iterator that contains elements to include in the result.\n *\n * @example\n * ```typescript\n * import { intersect } from '@sapphire/iterator-utilities';\n *\n * const iterable = intersect([1, 2, 3, 4, 5], [3, 4, 5, 6, 7]);\n * console.log([...iterable]);\n * // Output: [3, 4, 5]\n * ```\n *\n * @remarks\n *\n * This function consumes the entire `second` iterator to build the set of elements to intersect with `first`.\n *\n * @seealso {@link difference} for the opposite behavior.\n */\nexport function intersect<const ElementType>(\n\tfirst: IterableResolvable<ElementType>,\n\tsecond: IterableResolvable<ElementType>\n): IterableIterator<ElementType> {\n\tconst set = new Set(toIterableIterator(second));\n\treturn filter(first, (value) => set.has(value));\n}\n"]}
|
|
@@ -1,26 +0,0 @@
|
|
|
1
|
-
import { IterableResolvable } from './from.cjs';
|
|
2
|
-
|
|
3
|
-
/**
|
|
4
|
-
* Creates an iterable with the elements that are in both input iterables.
|
|
5
|
-
*
|
|
6
|
-
* @param first An iterator to return elements from.
|
|
7
|
-
* @param second An iterator that contains elements to include in the result.
|
|
8
|
-
*
|
|
9
|
-
* @example
|
|
10
|
-
* ```typescript
|
|
11
|
-
* import { intersect } from '@sapphire/iterator-utilities';
|
|
12
|
-
*
|
|
13
|
-
* const iterable = intersect([1, 2, 3, 4, 5], [3, 4, 5, 6, 7]);
|
|
14
|
-
* console.log([...iterable]);
|
|
15
|
-
* // Output: [3, 4, 5]
|
|
16
|
-
* ```
|
|
17
|
-
*
|
|
18
|
-
* @remarks
|
|
19
|
-
*
|
|
20
|
-
* This function consumes the entire `second` iterator to build the set of elements to intersect with `first`.
|
|
21
|
-
*
|
|
22
|
-
* @seealso {@link difference} for the opposite behavior.
|
|
23
|
-
*/
|
|
24
|
-
declare function intersect<const ElementType>(first: IterableResolvable<ElementType>, second: IterableResolvable<ElementType>): IterableIterator<ElementType>;
|
|
25
|
-
|
|
26
|
-
export { intersect };
|
|
@@ -1,35 +0,0 @@
|
|
|
1
|
-
'use strict';
|
|
2
|
-
|
|
3
|
-
var from_cjs = require('./from.cjs');
|
|
4
|
-
var _makeIterableIterator_cjs = require('./shared/_makeIterableIterator.cjs');
|
|
5
|
-
|
|
6
|
-
var __defProp = Object.defineProperty;
|
|
7
|
-
var __name = (target, value) => __defProp(target, "name", { value, configurable: true });
|
|
8
|
-
function intersperse(iterable, separator) {
|
|
9
|
-
let started = false;
|
|
10
|
-
let nextItem;
|
|
11
|
-
let nextItemTaken = false;
|
|
12
|
-
const iterator = from_cjs.from(iterable);
|
|
13
|
-
return _makeIterableIterator_cjs.makeIterableIterator(() => {
|
|
14
|
-
if (started) {
|
|
15
|
-
if (nextItemTaken) {
|
|
16
|
-
nextItemTaken = false;
|
|
17
|
-
return { done: false, value: nextItem };
|
|
18
|
-
}
|
|
19
|
-
const result = iterator.next();
|
|
20
|
-
if (result.done) {
|
|
21
|
-
return { done: true, value: void 0 };
|
|
22
|
-
}
|
|
23
|
-
nextItem = result.value;
|
|
24
|
-
nextItemTaken = true;
|
|
25
|
-
return { done: false, value: separator };
|
|
26
|
-
}
|
|
27
|
-
started = true;
|
|
28
|
-
return iterator.next();
|
|
29
|
-
});
|
|
30
|
-
}
|
|
31
|
-
__name(intersperse, "intersperse");
|
|
32
|
-
|
|
33
|
-
exports.intersperse = intersperse;
|
|
34
|
-
//# sourceMappingURL=intersperse.cjs.map
|
|
35
|
-
//# sourceMappingURL=intersperse.cjs.map
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"sources":["../../../src/lib/intersperse.ts"],"names":["from","makeIterableIterator"],"mappings":";;;;;;;AA4BO,SAAS,WAAA,CAA+B,UAA2C,SAAA,EAAuD;AAChJ,EAAA,IAAI,OAAA,GAAU,KAAA;AACd,EAAA,IAAI,QAAA;AACJ,EAAA,IAAI,aAAA,GAAgB,KAAA;AAEpB,EAAA,MAAM,QAAA,GAAWA,cAAK,QAAQ,CAAA;AAC9B,EAAA,OAAOC,+CAAkC,MAAM;AAC9C,IAAA,IAAI,OAAA,EAAS;AACZ,MAAA,IAAI,aAAA,EAAe;AAClB,QAAA,aAAA,GAAgB,KAAA;AAChB,QAAA,OAAO,EAAE,IAAA,EAAM,KAAA,EAAO,KAAA,EAAO,QAAA,EAAS;AAAA,MACvC;AAEA,MAAA,MAAM,MAAA,GAAS,SAAS,IAAA,EAAK;AAC7B,MAAA,IAAI,OAAO,IAAA,EAAM;AAChB,QAAA,OAAO,EAAE,IAAA,EAAM,IAAA,EAAM,KAAA,EAAO,MAAA,EAAU;AAAA,MACvC;AAEA,MAAA,QAAA,GAAW,MAAA,CAAO,KAAA;AAClB,MAAA,aAAA,GAAgB,IAAA;AAChB,MAAA,OAAO,EAAE,IAAA,EAAM,KAAA,EAAO,KAAA,EAAO,SAAA,EAAU;AAAA,IACxC;AAEA,IAAA,OAAA,GAAU,IAAA;AACV,IAAA,OAAO,SAAS,IAAA,EAAK;AAAA,EACtB,CAAC,CAAA;AACF;AA1BgB,MAAA,CAAA,WAAA,EAAA,aAAA,CAAA","file":"intersperse.cjs","sourcesContent":["import { from, type IterableResolvable } from './from';\nimport { makeIterableIterator } from './shared/_makeIterableIterator';\n\n/**\n * Creates a new iterator which places `separator` between adjacent items of the original iterator.\n *\n * @param iterable An iterator to map over.\n * @param separator The separator to place between adjacent items.\n *\n * @example\n * ```typescript\n * import { intersperse } from '@sapphire/iterator-utilities';\n *\n * const iterable = [0, 1, 2];\n * console.log([...intersperse(iterable, 100)]);\n * // Output: [0, 100, 1, 100, 2]\n * ```\n *\n * @example\n * `intersperse` can be very useful to join an iterator's items using a common element:\n * ```typescript\n * import { intersperse } from '@sapphire/iterator-utilities';\n *\n * const iterable = ['Hello', 'World', '!'];\n * console.log([...intersperse(iterable, ', ')].join(''));\n * // Output: 'Hello, World, !'\n * ```\n */\nexport function intersperse<const ElementType>(iterable: IterableResolvable<ElementType>, separator: ElementType): IterableIterator<ElementType> {\n\tlet started = false;\n\tlet nextItem: ElementType;\n\tlet nextItemTaken = false;\n\n\tconst iterator = from(iterable);\n\treturn makeIterableIterator<ElementType>(() => {\n\t\tif (started) {\n\t\t\tif (nextItemTaken) {\n\t\t\t\tnextItemTaken = false;\n\t\t\t\treturn { done: false, value: nextItem };\n\t\t\t}\n\n\t\t\tconst result = iterator.next();\n\t\t\tif (result.done) {\n\t\t\t\treturn { done: true, value: undefined };\n\t\t\t}\n\n\t\t\tnextItem = result.value;\n\t\t\tnextItemTaken = true;\n\t\t\treturn { done: false, value: separator };\n\t\t}\n\n\t\tstarted = true;\n\t\treturn iterator.next();\n\t});\n}\n"]}
|
|
@@ -1,30 +0,0 @@
|
|
|
1
|
-
import { IterableResolvable } from './from.cjs';
|
|
2
|
-
|
|
3
|
-
/**
|
|
4
|
-
* Creates a new iterator which places `separator` between adjacent items of the original iterator.
|
|
5
|
-
*
|
|
6
|
-
* @param iterable An iterator to map over.
|
|
7
|
-
* @param separator The separator to place between adjacent items.
|
|
8
|
-
*
|
|
9
|
-
* @example
|
|
10
|
-
* ```typescript
|
|
11
|
-
* import { intersperse } from '@sapphire/iterator-utilities';
|
|
12
|
-
*
|
|
13
|
-
* const iterable = [0, 1, 2];
|
|
14
|
-
* console.log([...intersperse(iterable, 100)]);
|
|
15
|
-
* // Output: [0, 100, 1, 100, 2]
|
|
16
|
-
* ```
|
|
17
|
-
*
|
|
18
|
-
* @example
|
|
19
|
-
* `intersperse` can be very useful to join an iterator's items using a common element:
|
|
20
|
-
* ```typescript
|
|
21
|
-
* import { intersperse } from '@sapphire/iterator-utilities';
|
|
22
|
-
*
|
|
23
|
-
* const iterable = ['Hello', 'World', '!'];
|
|
24
|
-
* console.log([...intersperse(iterable, ', ')].join(''));
|
|
25
|
-
* // Output: 'Hello, World, !'
|
|
26
|
-
* ```
|
|
27
|
-
*/
|
|
28
|
-
declare function intersperse<const ElementType>(iterable: IterableResolvable<ElementType>, separator: ElementType): IterableIterator<ElementType>;
|
|
29
|
-
|
|
30
|
-
export { intersperse };
|
package/dist/cjs/lib/isEmpty.cjs
DELETED
|
@@ -1,14 +0,0 @@
|
|
|
1
|
-
'use strict';
|
|
2
|
-
|
|
3
|
-
var from_cjs = require('./from.cjs');
|
|
4
|
-
|
|
5
|
-
var __defProp = Object.defineProperty;
|
|
6
|
-
var __name = (target, value) => __defProp(target, "name", { value, configurable: true });
|
|
7
|
-
function isEmpty(iterable) {
|
|
8
|
-
return from_cjs.from(iterable).next().done ?? false;
|
|
9
|
-
}
|
|
10
|
-
__name(isEmpty, "isEmpty");
|
|
11
|
-
|
|
12
|
-
exports.isEmpty = isEmpty;
|
|
13
|
-
//# sourceMappingURL=isEmpty.cjs.map
|
|
14
|
-
//# sourceMappingURL=isEmpty.cjs.map
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"sources":["../../../src/lib/isEmpty.ts"],"names":["from"],"mappings":";;;;;;AAuBO,SAAS,QAA2B,QAAA,EAAoD;AAC9F,EAAA,OAAOA,aAAA,CAAK,QAAQ,CAAA,CAAE,IAAA,GAAO,IAAA,IAAQ,KAAA;AACtC;AAFgB,MAAA,CAAA,OAAA,EAAA,SAAA,CAAA","file":"isEmpty.cjs","sourcesContent":["import { from, type IterableResolvable } from './from';\n\n/**\n * Advances the iterable once, returning `true` if it's exhausted and `false` otherwise.\n *\n * @param iterable The iterator to check for emptiness.\n * @returns `true` if the iterator is empty; otherwise, `false`.\n *\n * @example\n * ```typescript\n * import { isEmpty } from '@sapphire/iterator-utilities';\n *\n * console.log(isEmpty([]));\n * // Output: true\n *\n * console.log(isEmpty([1, 2, 3, 4, 5]));\n * // Output: false\n * ```\n *\n * @remarks\n *\n * This function consumes the first value of the iterator.\n */\nexport function isEmpty<const ElementType>(iterable: IterableResolvable<ElementType>): boolean {\n\treturn from(iterable).next().done ?? false;\n}\n"]}
|
|
@@ -1,26 +0,0 @@
|
|
|
1
|
-
import { IterableResolvable } from './from.cjs';
|
|
2
|
-
|
|
3
|
-
/**
|
|
4
|
-
* Advances the iterable once, returning `true` if it's exhausted and `false` otherwise.
|
|
5
|
-
*
|
|
6
|
-
* @param iterable The iterator to check for emptiness.
|
|
7
|
-
* @returns `true` if the iterator is empty; otherwise, `false`.
|
|
8
|
-
*
|
|
9
|
-
* @example
|
|
10
|
-
* ```typescript
|
|
11
|
-
* import { isEmpty } from '@sapphire/iterator-utilities';
|
|
12
|
-
*
|
|
13
|
-
* console.log(isEmpty([]));
|
|
14
|
-
* // Output: true
|
|
15
|
-
*
|
|
16
|
-
* console.log(isEmpty([1, 2, 3, 4, 5]));
|
|
17
|
-
* // Output: false
|
|
18
|
-
* ```
|
|
19
|
-
*
|
|
20
|
-
* @remarks
|
|
21
|
-
*
|
|
22
|
-
* This function consumes the first value of the iterator.
|
|
23
|
-
*/
|
|
24
|
-
declare function isEmpty<const ElementType>(iterable: IterableResolvable<ElementType>): boolean;
|
|
25
|
-
|
|
26
|
-
export { isEmpty };
|
|
@@ -1,15 +0,0 @@
|
|
|
1
|
-
'use strict';
|
|
2
|
-
|
|
3
|
-
var isSortedBy_cjs = require('./isSortedBy.cjs');
|
|
4
|
-
var comparators_cjs = require('./shared/comparators.cjs');
|
|
5
|
-
|
|
6
|
-
var __defProp = Object.defineProperty;
|
|
7
|
-
var __name = (target, value) => __defProp(target, "name", { value, configurable: true });
|
|
8
|
-
function isSorted(iterable) {
|
|
9
|
-
return isSortedBy_cjs.isSortedBy(iterable, comparators_cjs.defaultCompare);
|
|
10
|
-
}
|
|
11
|
-
__name(isSorted, "isSorted");
|
|
12
|
-
|
|
13
|
-
exports.isSorted = isSorted;
|
|
14
|
-
//# sourceMappingURL=isSorted.cjs.map
|
|
15
|
-
//# sourceMappingURL=isSorted.cjs.map
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"sources":["../../../src/lib/isSorted.ts"],"names":["isSortedBy","defaultCompare"],"mappings":";;;;;;;AAmCO,SAAS,SAA4B,QAAA,EAAoD;AAC/F,EAAA,OAAOA,yBAAA,CAAW,UAAUC,8BAAc,CAAA;AAC3C;AAFgB,MAAA,CAAA,QAAA,EAAA,UAAA,CAAA","file":"isSorted.cjs","sourcesContent":["import type { IterableResolvable } from './from';\nimport { isSortedBy } from './isSortedBy';\nimport type { isSortedByKey } from './isSortedByKey';\nimport { defaultCompare } from './shared/comparators';\n\n/**\n * Checks if the elements of this iterator are sorted in ascending order.\n *\n * That is, for each element `a` and its following element `b`, `a <= b` must hold. If the iterator yields exactly zero\n * or one element, `true` is returned.\n *\n * This function uses the default comparator (lexicographically), which means it will compare the elements as strings.\n * If this is undesirable, use {@link isSortedBy} instead.\n *\n * @seealso {@link isSortedBy} for a version that allows custom comparators.\n * @seealso {@link isSortedByKey} for a version that allows custom key extractors.\n *\n * @param iterable The iterator to compare.\n *\n * @example\n * ```typescript\n * import { isSorted } from '@sapphire/iterator-utilities';\n *\n * assert(isSorted([1, 2, 2, 9]);\n * assert(!isSorted([1, 3, 2, 4]);\n *\n * assert(isSorted([0]);\n * assert(isSorted([]);\n * assert(isSorted([0, 1, NaN]);\n * ```\n *\n * @remarks\n *\n * This function consumes the entire iterator.\n */\nexport function isSorted<const ElementType>(iterable: IterableResolvable<ElementType>): boolean {\n\treturn isSortedBy(iterable, defaultCompare);\n}\n"]}
|
|
@@ -1,35 +0,0 @@
|
|
|
1
|
-
import { IterableResolvable } from './from.cjs';
|
|
2
|
-
|
|
3
|
-
/**
|
|
4
|
-
* Checks if the elements of this iterator are sorted in ascending order.
|
|
5
|
-
*
|
|
6
|
-
* That is, for each element `a` and its following element `b`, `a <= b` must hold. If the iterator yields exactly zero
|
|
7
|
-
* or one element, `true` is returned.
|
|
8
|
-
*
|
|
9
|
-
* This function uses the default comparator (lexicographically), which means it will compare the elements as strings.
|
|
10
|
-
* If this is undesirable, use {@link isSortedBy} instead.
|
|
11
|
-
*
|
|
12
|
-
* @seealso {@link isSortedBy} for a version that allows custom comparators.
|
|
13
|
-
* @seealso {@link isSortedByKey} for a version that allows custom key extractors.
|
|
14
|
-
*
|
|
15
|
-
* @param iterable The iterator to compare.
|
|
16
|
-
*
|
|
17
|
-
* @example
|
|
18
|
-
* ```typescript
|
|
19
|
-
* import { isSorted } from '@sapphire/iterator-utilities';
|
|
20
|
-
*
|
|
21
|
-
* assert(isSorted([1, 2, 2, 9]);
|
|
22
|
-
* assert(!isSorted([1, 3, 2, 4]);
|
|
23
|
-
*
|
|
24
|
-
* assert(isSorted([0]);
|
|
25
|
-
* assert(isSorted([]);
|
|
26
|
-
* assert(isSorted([0, 1, NaN]);
|
|
27
|
-
* ```
|
|
28
|
-
*
|
|
29
|
-
* @remarks
|
|
30
|
-
*
|
|
31
|
-
* This function consumes the entire iterator.
|
|
32
|
-
*/
|
|
33
|
-
declare function isSorted<const ElementType>(iterable: IterableResolvable<ElementType>): boolean;
|
|
34
|
-
|
|
35
|
-
export { isSorted };
|
|
@@ -1,26 +0,0 @@
|
|
|
1
|
-
'use strict';
|
|
2
|
-
|
|
3
|
-
var _assertFunction_cjs = require('./shared/_assertFunction.cjs');
|
|
4
|
-
var _compare_cjs = require('./shared/_compare.cjs');
|
|
5
|
-
var toIterableIterator_cjs = require('./toIterableIterator.cjs');
|
|
6
|
-
|
|
7
|
-
var __defProp = Object.defineProperty;
|
|
8
|
-
var __name = (target, value) => __defProp(target, "name", { value, configurable: true });
|
|
9
|
-
function isSortedBy(iterable, comparator) {
|
|
10
|
-
comparator = _assertFunction_cjs.assertFunction(comparator);
|
|
11
|
-
const iterator = toIterableIterator_cjs.toIterableIterator(iterable);
|
|
12
|
-
const result = iterator.next();
|
|
13
|
-
if (result.done) return true;
|
|
14
|
-
let previous = result.value;
|
|
15
|
-
for (const current of iterator) {
|
|
16
|
-
const comparison = _compare_cjs.compareIteratorElements(previous, current, comparator);
|
|
17
|
-
if (_compare_cjs.orderingIsGreater(comparison)) return false;
|
|
18
|
-
previous = current;
|
|
19
|
-
}
|
|
20
|
-
return true;
|
|
21
|
-
}
|
|
22
|
-
__name(isSortedBy, "isSortedBy");
|
|
23
|
-
|
|
24
|
-
exports.isSortedBy = isSortedBy;
|
|
25
|
-
//# sourceMappingURL=isSortedBy.cjs.map
|
|
26
|
-
//# sourceMappingURL=isSortedBy.cjs.map
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"sources":["../../../src/lib/isSortedBy.ts"],"names":["assertFunction","toIterableIterator","compareIteratorElements","orderingIsGreater"],"mappings":";;;;;;;;AAiCO,SAAS,UAAA,CAA8B,UAA2C,UAAA,EAAuD;AAC/I,EAAA,UAAA,GAAaA,mCAAe,UAAU,CAAA;AAEtC,EAAA,MAAM,QAAA,GAAWC,0CAAmB,QAAQ,CAAA;AAC5C,EAAA,MAAM,MAAA,GAAS,SAAS,IAAA,EAAK;AAC7B,EAAA,IAAI,MAAA,CAAO,MAAM,OAAO,IAAA;AAExB,EAAA,IAAI,WAAW,MAAA,CAAO,KAAA;AACtB,EAAA,KAAA,MAAW,WAAW,QAAA,EAAU;AAC/B,IAAA,MAAM,UAAA,GAAaC,oCAAA,CAAqC,QAAA,EAAU,OAAA,EAAS,UAAU,CAAA;AACrF,IAAA,IAAIC,8BAAA,CAAkB,UAAU,CAAA,EAAG,OAAO,KAAA;AAE1C,IAAA,QAAA,GAAW,OAAA;AAAA,EACZ;AAEA,EAAA,OAAO,IAAA;AACR;AAhBgB,MAAA,CAAA,UAAA,EAAA,YAAA,CAAA","file":"isSortedBy.cjs","sourcesContent":["import type { IterableResolvable } from './from';\nimport type { isSorted } from './isSorted';\nimport type { isSortedByKey } from './isSortedByKey';\nimport { assertFunction } from './shared/_assertFunction';\nimport { compareIteratorElements, orderingIsGreater, type CompareByComparator } from './shared/_compare';\nimport { toIterableIterator } from './toIterableIterator';\n\n/**\n * Checks if the elements of this iterator are sorted using the given comparator function.\n *\n * @seealso {@link isSorted} for a version that uses the default comparator.\n * @seealso {@link isSortedByKey} for a version that allows custom key extractors.\n *\n * @param iterable The iterator to compare.\n *\n * @example\n * ```typescript\n * import { ascNumber, isSortedBy } from '@sapphire/iterator-utilities';\n *\n * assert(isSortedBy([1, 2, 2, 9], ascNumber));\n * assert(!isSortedBy([1, 2, 2, 9], ascNumber));\n *\n * assert(isSortedBy([0], () => true));\n * assert(isSortedBy([0], () => false));\n *\n * assert(isSortedBy([], () => true));\n * assert(isSortedBy([], () => false));\n * ```\n *\n * @remarks\n *\n * This function consumes the entire iterator.\n */\nexport function isSortedBy<const ElementType>(iterable: IterableResolvable<ElementType>, comparator: CompareByComparator<ElementType>): boolean {\n\tcomparator = assertFunction(comparator);\n\n\tconst iterator = toIterableIterator(iterable);\n\tconst result = iterator.next();\n\tif (result.done) return true;\n\n\tlet previous = result.value;\n\tfor (const current of iterator) {\n\t\tconst comparison = compareIteratorElements<ElementType>(previous, current, comparator);\n\t\tif (orderingIsGreater(comparison)) return false;\n\n\t\tprevious = current;\n\t}\n\n\treturn true;\n}\n"]}
|
|
@@ -1,32 +0,0 @@
|
|
|
1
|
-
import { IterableResolvable } from './from.cjs';
|
|
2
|
-
import { CompareByComparator } from './shared/_compare.js';
|
|
3
|
-
|
|
4
|
-
/**
|
|
5
|
-
* Checks if the elements of this iterator are sorted using the given comparator function.
|
|
6
|
-
*
|
|
7
|
-
* @seealso {@link isSorted} for a version that uses the default comparator.
|
|
8
|
-
* @seealso {@link isSortedByKey} for a version that allows custom key extractors.
|
|
9
|
-
*
|
|
10
|
-
* @param iterable The iterator to compare.
|
|
11
|
-
*
|
|
12
|
-
* @example
|
|
13
|
-
* ```typescript
|
|
14
|
-
* import { ascNumber, isSortedBy } from '@sapphire/iterator-utilities';
|
|
15
|
-
*
|
|
16
|
-
* assert(isSortedBy([1, 2, 2, 9], ascNumber));
|
|
17
|
-
* assert(!isSortedBy([1, 2, 2, 9], ascNumber));
|
|
18
|
-
*
|
|
19
|
-
* assert(isSortedBy([0], () => true));
|
|
20
|
-
* assert(isSortedBy([0], () => false));
|
|
21
|
-
*
|
|
22
|
-
* assert(isSortedBy([], () => true));
|
|
23
|
-
* assert(isSortedBy([], () => false));
|
|
24
|
-
* ```
|
|
25
|
-
*
|
|
26
|
-
* @remarks
|
|
27
|
-
*
|
|
28
|
-
* This function consumes the entire iterator.
|
|
29
|
-
*/
|
|
30
|
-
declare function isSortedBy<const ElementType>(iterable: IterableResolvable<ElementType>, comparator: CompareByComparator<ElementType>): boolean;
|
|
31
|
-
|
|
32
|
-
export { isSortedBy };
|
|
@@ -1,29 +0,0 @@
|
|
|
1
|
-
'use strict';
|
|
2
|
-
|
|
3
|
-
var _assertFunction_cjs = require('./shared/_assertFunction.cjs');
|
|
4
|
-
var _compare_cjs = require('./shared/_compare.cjs');
|
|
5
|
-
var comparators_cjs = require('./shared/comparators.cjs');
|
|
6
|
-
var toIterableIterator_cjs = require('./toIterableIterator.cjs');
|
|
7
|
-
|
|
8
|
-
var __defProp = Object.defineProperty;
|
|
9
|
-
var __name = (target, value) => __defProp(target, "name", { value, configurable: true });
|
|
10
|
-
function isSortedByKey(iterable, callbackFn, comparator = comparators_cjs.defaultCompare) {
|
|
11
|
-
callbackFn = _assertFunction_cjs.assertFunction(callbackFn);
|
|
12
|
-
const iterator = toIterableIterator_cjs.toIterableIterator(iterable);
|
|
13
|
-
const result = iterator.next();
|
|
14
|
-
if (result.done) return true;
|
|
15
|
-
let previousKey = callbackFn(result.value, 0);
|
|
16
|
-
let index = 1;
|
|
17
|
-
for (const current of iterator) {
|
|
18
|
-
const currentKey = callbackFn(current, index++);
|
|
19
|
-
const comparison = _compare_cjs.compareIteratorElements(previousKey, currentKey, comparator);
|
|
20
|
-
if (_compare_cjs.orderingIsGreater(comparison)) return false;
|
|
21
|
-
previousKey = currentKey;
|
|
22
|
-
}
|
|
23
|
-
return true;
|
|
24
|
-
}
|
|
25
|
-
__name(isSortedByKey, "isSortedByKey");
|
|
26
|
-
|
|
27
|
-
exports.isSortedByKey = isSortedByKey;
|
|
28
|
-
//# sourceMappingURL=isSortedByKey.cjs.map
|
|
29
|
-
//# sourceMappingURL=isSortedByKey.cjs.map
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"sources":["../../../src/lib/isSortedByKey.ts"],"names":["defaultCompare","assertFunction","toIterableIterator","compareIteratorElements","orderingIsGreater"],"mappings":";;;;;;;;;AAgCO,SAAS,aAAA,CACf,QAAA,EACA,UAAA,EACA,UAAA,GAA8CA,8BAAA,EACpC;AACV,EAAA,UAAA,GAAaC,mCAAe,UAAU,CAAA;AAEtC,EAAA,MAAM,QAAA,GAAWC,0CAAmB,QAAQ,CAAA;AAC5C,EAAA,MAAM,MAAA,GAAS,SAAS,IAAA,EAAK;AAC7B,EAAA,IAAI,MAAA,CAAO,MAAM,OAAO,IAAA;AAExB,EAAA,IAAI,WAAA,GAAc,UAAA,CAAW,MAAA,CAAO,KAAA,EAAO,CAAC,CAAA;AAC5C,EAAA,IAAI,KAAA,GAAQ,CAAA;AACZ,EAAA,KAAA,MAAW,WAAW,QAAA,EAAU;AAC/B,IAAA,MAAM,UAAA,GAAa,UAAA,CAAW,OAAA,EAAS,KAAA,EAAO,CAAA;AAC9C,IAAA,MAAM,UAAA,GAAaC,oCAAA,CAAoC,WAAA,EAAa,UAAA,EAAY,UAAU,CAAA;AAC1F,IAAA,IAAIC,8BAAA,CAAkB,UAAU,CAAA,EAAG,OAAO,KAAA;AAE1C,IAAA,WAAA,GAAc,UAAA;AAAA,EACf;AAEA,EAAA,OAAO,IAAA;AACR;AAtBgB,MAAA,CAAA,aAAA,EAAA,eAAA,CAAA","file":"isSortedByKey.cjs","sourcesContent":["import type { IterableResolvable } from './from';\nimport type { isSorted } from './isSorted';\nimport type { isSortedBy } from './isSortedBy';\nimport { assertFunction } from './shared/_assertFunction';\nimport { compareIteratorElements, orderingIsGreater, type CompareByComparator } from './shared/_compare';\nimport { defaultCompare } from './shared/comparators';\nimport { toIterableIterator } from './toIterableIterator';\n\n/**\n * Checks if the elements of this iterator are sorted using the given key extraction function.\n *\n * Instead of comparing the iterator's elements directly, this function compares the keys of the elements, as determined\n * by `callbackFn`. Apart from that, it's equivalent to {@link isSorted}; see its documentation for more information.\n *\n * @seealso {@link isSorted} for a version that uses the default comparator.\n * @seealso {@link isSortedBy} for a version that allows custom comparators.\n *\n * @param iterable The iterator to compare.\n * @param callbackFn The function to extract the key from an element.\n *\n * @example\n * ```typescript\n * import { isSortedByKey } from '@sapphire/iterator-utilities';\n *\n * assert(isSortedByKey(['c', 'bb', 'aaa'], (s) => s.length));\n * assert(!isSortedBy([-2, -1, 0, 3], (n) => Math.abs(n)));\n * ```\n *\n * @remarks\n *\n * This function consumes the entire iterator.\n */\nexport function isSortedByKey<const ElementType, const MappedType>(\n\titerable: IterableResolvable<ElementType>,\n\tcallbackFn: (a: ElementType, index: number) => MappedType,\n\tcomparator: CompareByComparator<MappedType> = defaultCompare\n): boolean {\n\tcallbackFn = assertFunction(callbackFn);\n\n\tconst iterator = toIterableIterator(iterable);\n\tconst result = iterator.next();\n\tif (result.done) return true;\n\n\tlet previousKey = callbackFn(result.value, 0);\n\tlet index = 1;\n\tfor (const current of iterator) {\n\t\tconst currentKey = callbackFn(current, index++);\n\t\tconst comparison = compareIteratorElements<MappedType>(previousKey, currentKey, comparator);\n\t\tif (orderingIsGreater(comparison)) return false;\n\n\t\tpreviousKey = currentKey;\n\t}\n\n\treturn true;\n}\n"]}
|
|
@@ -1,30 +0,0 @@
|
|
|
1
|
-
import { IterableResolvable } from './from.cjs';
|
|
2
|
-
import { CompareByComparator } from './shared/_compare.js';
|
|
3
|
-
|
|
4
|
-
/**
|
|
5
|
-
* Checks if the elements of this iterator are sorted using the given key extraction function.
|
|
6
|
-
*
|
|
7
|
-
* Instead of comparing the iterator's elements directly, this function compares the keys of the elements, as determined
|
|
8
|
-
* by `callbackFn`. Apart from that, it's equivalent to {@link isSorted}; see its documentation for more information.
|
|
9
|
-
*
|
|
10
|
-
* @seealso {@link isSorted} for a version that uses the default comparator.
|
|
11
|
-
* @seealso {@link isSortedBy} for a version that allows custom comparators.
|
|
12
|
-
*
|
|
13
|
-
* @param iterable The iterator to compare.
|
|
14
|
-
* @param callbackFn The function to extract the key from an element.
|
|
15
|
-
*
|
|
16
|
-
* @example
|
|
17
|
-
* ```typescript
|
|
18
|
-
* import { isSortedByKey } from '@sapphire/iterator-utilities';
|
|
19
|
-
*
|
|
20
|
-
* assert(isSortedByKey(['c', 'bb', 'aaa'], (s) => s.length));
|
|
21
|
-
* assert(!isSortedBy([-2, -1, 0, 3], (n) => Math.abs(n)));
|
|
22
|
-
* ```
|
|
23
|
-
*
|
|
24
|
-
* @remarks
|
|
25
|
-
*
|
|
26
|
-
* This function consumes the entire iterator.
|
|
27
|
-
*/
|
|
28
|
-
declare function isSortedByKey<const ElementType, const MappedType>(iterable: IterableResolvable<ElementType>, callbackFn: (a: ElementType, index: number) => MappedType, comparator?: CompareByComparator<MappedType>): boolean;
|
|
29
|
-
|
|
30
|
-
export { isSortedByKey };
|
package/dist/cjs/lib/last.cjs
DELETED
|
@@ -1,18 +0,0 @@
|
|
|
1
|
-
'use strict';
|
|
2
|
-
|
|
3
|
-
var toIterableIterator_cjs = require('./toIterableIterator.cjs');
|
|
4
|
-
|
|
5
|
-
var __defProp = Object.defineProperty;
|
|
6
|
-
var __name = (target, value) => __defProp(target, "name", { value, configurable: true });
|
|
7
|
-
function last(iterable) {
|
|
8
|
-
let last2;
|
|
9
|
-
for (const value of toIterableIterator_cjs.toIterableIterator(iterable)) {
|
|
10
|
-
last2 = value;
|
|
11
|
-
}
|
|
12
|
-
return last2;
|
|
13
|
-
}
|
|
14
|
-
__name(last, "last");
|
|
15
|
-
|
|
16
|
-
exports.last = last;
|
|
17
|
-
//# sourceMappingURL=last.cjs.map
|
|
18
|
-
//# sourceMappingURL=last.cjs.map
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"sources":["../../../src/lib/last.ts"],"names":["last","toIterableIterator"],"mappings":";;;;;;AAsBO,SAAS,KAAwB,QAAA,EAAoE;AAC3G,EAAA,IAAIA,KAAAA;AACJ,EAAA,KAAA,MAAW,KAAA,IAASC,yCAAA,CAAmB,QAAQ,CAAA,EAAG;AACjD,IAAAD,KAAAA,GAAO,KAAA;AAAA,EACR;AAEA,EAAA,OAAOA,KAAAA;AACR;AAPgB,MAAA,CAAA,IAAA,EAAA,MAAA,CAAA","file":"last.cjs","sourcesContent":["import type { IterableResolvable } from './from';\nimport { toIterableIterator } from './toIterableIterator';\n\n/**\n * Consumes the iterable until it's exhausted, returning the last element.\n *\n * @param iterable An iterator to return the last value of.\n * @returns The value at the last position in the source iterator, or `undefined` if the iterator is empty.\n *\n * @example\n * ```typescript\n * import { last } from '@sapphire/iterator-utilities';\n *\n * const iterable = [1, 2, 3, 4, 5];\n * console.log(last(iterable));\n * // Output: 5\n * ```\n *\n * @remarks\n *\n * This function consumes the entire iterator to find the last value.\n */\nexport function last<const ElementType>(iterable: IterableResolvable<ElementType>): ElementType | undefined {\n\tlet last: ElementType | undefined;\n\tfor (const value of toIterableIterator(iterable)) {\n\t\tlast = value;\n\t}\n\n\treturn last;\n}\n"]}
|
package/dist/cjs/lib/last.d.cts
DELETED
|
@@ -1,24 +0,0 @@
|
|
|
1
|
-
import { IterableResolvable } from './from.cjs';
|
|
2
|
-
|
|
3
|
-
/**
|
|
4
|
-
* Consumes the iterable until it's exhausted, returning the last element.
|
|
5
|
-
*
|
|
6
|
-
* @param iterable An iterator to return the last value of.
|
|
7
|
-
* @returns The value at the last position in the source iterator, or `undefined` if the iterator is empty.
|
|
8
|
-
*
|
|
9
|
-
* @example
|
|
10
|
-
* ```typescript
|
|
11
|
-
* import { last } from '@sapphire/iterator-utilities';
|
|
12
|
-
*
|
|
13
|
-
* const iterable = [1, 2, 3, 4, 5];
|
|
14
|
-
* console.log(last(iterable));
|
|
15
|
-
* // Output: 5
|
|
16
|
-
* ```
|
|
17
|
-
*
|
|
18
|
-
* @remarks
|
|
19
|
-
*
|
|
20
|
-
* This function consumes the entire iterator to find the last value.
|
|
21
|
-
*/
|
|
22
|
-
declare function last<const ElementType>(iterable: IterableResolvable<ElementType>): ElementType | undefined;
|
|
23
|
-
|
|
24
|
-
export { last };
|
|
@@ -1,17 +0,0 @@
|
|
|
1
|
-
'use strict';
|
|
2
|
-
|
|
3
|
-
var compare_cjs = require('./compare.cjs');
|
|
4
|
-
var _compare_cjs = require('./shared/_compare.cjs');
|
|
5
|
-
|
|
6
|
-
var __defProp = Object.defineProperty;
|
|
7
|
-
var __name = (target, value) => __defProp(target, "name", { value, configurable: true });
|
|
8
|
-
function lessOrEqualThan(iterable, other) {
|
|
9
|
-
const result = compare_cjs.compare(iterable, other);
|
|
10
|
-
return !_compare_cjs.orderingIsGreater(result);
|
|
11
|
-
}
|
|
12
|
-
__name(lessOrEqualThan, "lessOrEqualThan");
|
|
13
|
-
|
|
14
|
-
exports.le = lessOrEqualThan;
|
|
15
|
-
exports.lessOrEqualThan = lessOrEqualThan;
|
|
16
|
-
//# sourceMappingURL=lessOrEqualThan.cjs.map
|
|
17
|
-
//# sourceMappingURL=lessOrEqualThan.cjs.map
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"sources":["../../../src/lib/lessOrEqualThan.ts"],"names":["compare","orderingIsGreater"],"mappings":";;;;;;;AA+BO,SAAS,eAAA,CAAmC,UAA2C,KAAA,EAAiD;AAC9I,EAAA,MAAM,MAAA,GAASA,mBAAA,CAAQ,QAAA,EAAU,KAAK,CAAA;AACtC,EAAA,OAAO,CAACC,+BAAkB,MAAM,CAAA;AACjC;AAHgB,MAAA,CAAA,eAAA,EAAA,iBAAA,CAAA","file":"lessOrEqualThan.cjs","sourcesContent":["import { compare } from './compare';\nimport type { IterableResolvable } from './from';\nimport { orderingIsGreater, type LexicographicComparison } from './shared/_compare';\n\n/**\n * Determines if the elements of `iterable` are {@link LexicographicComparison lexicographically} less or equal than\n * those of another.\n *\n * @param iterable The iterator to compare.\n * @param other The iterator to compare against.\n *\n * @example\n * ```typescript\n * import { lessOrEqualThan } from '@sapphire/iterator-utilities';\n *\n * const x = [1, 2, 3, 4];\n * const y = [1, 4, 9, 16];\n * console.log(lessOrEqualThan([1], [1]));\n * // Output: false\n * console.log(lessOrEqualThan([1], [1, 2]));\n * // Output: true\n * console.log(lessOrEqualThan([1, 2], [1]));\n * // Output: false\n * console.log(lessOrEqualThan([1, 2], [1, 2]));\n * // Output: true\n * ```\n *\n * @remarks\n *\n * This function consumes the entire iterator.\n */\nexport function lessOrEqualThan<const ElementType>(iterable: IterableResolvable<ElementType>, other: IterableResolvable<ElementType>): boolean {\n\tconst result = compare(iterable, other);\n\treturn !orderingIsGreater(result);\n}\n\nexport { lessOrEqualThan as le };\n"]}
|
|
@@ -1,32 +0,0 @@
|
|
|
1
|
-
import { IterableResolvable } from './from.cjs';
|
|
2
|
-
|
|
3
|
-
/**
|
|
4
|
-
* Determines if the elements of `iterable` are {@link LexicographicComparison lexicographically} less or equal than
|
|
5
|
-
* those of another.
|
|
6
|
-
*
|
|
7
|
-
* @param iterable The iterator to compare.
|
|
8
|
-
* @param other The iterator to compare against.
|
|
9
|
-
*
|
|
10
|
-
* @example
|
|
11
|
-
* ```typescript
|
|
12
|
-
* import { lessOrEqualThan } from '@sapphire/iterator-utilities';
|
|
13
|
-
*
|
|
14
|
-
* const x = [1, 2, 3, 4];
|
|
15
|
-
* const y = [1, 4, 9, 16];
|
|
16
|
-
* console.log(lessOrEqualThan([1], [1]));
|
|
17
|
-
* // Output: false
|
|
18
|
-
* console.log(lessOrEqualThan([1], [1, 2]));
|
|
19
|
-
* // Output: true
|
|
20
|
-
* console.log(lessOrEqualThan([1, 2], [1]));
|
|
21
|
-
* // Output: false
|
|
22
|
-
* console.log(lessOrEqualThan([1, 2], [1, 2]));
|
|
23
|
-
* // Output: true
|
|
24
|
-
* ```
|
|
25
|
-
*
|
|
26
|
-
* @remarks
|
|
27
|
-
*
|
|
28
|
-
* This function consumes the entire iterator.
|
|
29
|
-
*/
|
|
30
|
-
declare function lessOrEqualThan<const ElementType>(iterable: IterableResolvable<ElementType>, other: IterableResolvable<ElementType>): boolean;
|
|
31
|
-
|
|
32
|
-
export { lessOrEqualThan as le, lessOrEqualThan };
|
|
@@ -1,17 +0,0 @@
|
|
|
1
|
-
'use strict';
|
|
2
|
-
|
|
3
|
-
var compare_cjs = require('./compare.cjs');
|
|
4
|
-
var _compare_cjs = require('./shared/_compare.cjs');
|
|
5
|
-
|
|
6
|
-
var __defProp = Object.defineProperty;
|
|
7
|
-
var __name = (target, value) => __defProp(target, "name", { value, configurable: true });
|
|
8
|
-
function lessThan(iterable, other) {
|
|
9
|
-
const result = compare_cjs.compare(iterable, other);
|
|
10
|
-
return _compare_cjs.orderingIsLess(result);
|
|
11
|
-
}
|
|
12
|
-
__name(lessThan, "lessThan");
|
|
13
|
-
|
|
14
|
-
exports.lessThan = lessThan;
|
|
15
|
-
exports.lt = lessThan;
|
|
16
|
-
//# sourceMappingURL=lessThan.cjs.map
|
|
17
|
-
//# sourceMappingURL=lessThan.cjs.map
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"sources":["../../../src/lib/lessThan.ts"],"names":["compare","orderingIsLess"],"mappings":";;;;;;;AA+BO,SAAS,QAAA,CAA4B,UAA2C,KAAA,EAAiD;AACvI,EAAA,MAAM,MAAA,GAASA,mBAAA,CAAQ,QAAA,EAAU,KAAK,CAAA;AACtC,EAAA,OAAOC,4BAAe,MAAM,CAAA;AAC7B;AAHgB,MAAA,CAAA,QAAA,EAAA,UAAA,CAAA","file":"lessThan.cjs","sourcesContent":["import { compare } from './compare';\nimport type { IterableResolvable } from './from';\nimport { orderingIsLess, type LexicographicComparison } from './shared/_compare';\n\n/**\n * Determines if the elements of `iterable` are {@link LexicographicComparison lexicographically} less than those of\n * another.\n *\n * @param iterable The iterator to compare.\n * @param other The iterator to compare against.\n *\n * @example\n * ```typescript\n * import { lessThan } from '@sapphire/iterator-utilities';\n *\n * const x = [1, 2, 3, 4];\n * const y = [1, 4, 9, 16];\n * console.log(lessThan([1], [1]));\n * // Output: false\n * console.log(lessThan([1], [1, 2]));\n * // Output: true\n * console.log(lessThan([1, 2], [1]));\n * // Output: false\n * console.log(lessThan([1, 2], [1, 2]));\n * // Output: false\n * ```\n *\n * @remarks\n *\n * This function consumes the entire iterator.\n */\nexport function lessThan<const ElementType>(iterable: IterableResolvable<ElementType>, other: IterableResolvable<ElementType>): boolean {\n\tconst result = compare(iterable, other);\n\treturn orderingIsLess(result);\n}\n\nexport { lessThan as lt };\n"]}
|
|
@@ -1,32 +0,0 @@
|
|
|
1
|
-
import { IterableResolvable } from './from.cjs';
|
|
2
|
-
|
|
3
|
-
/**
|
|
4
|
-
* Determines if the elements of `iterable` are {@link LexicographicComparison lexicographically} less than those of
|
|
5
|
-
* another.
|
|
6
|
-
*
|
|
7
|
-
* @param iterable The iterator to compare.
|
|
8
|
-
* @param other The iterator to compare against.
|
|
9
|
-
*
|
|
10
|
-
* @example
|
|
11
|
-
* ```typescript
|
|
12
|
-
* import { lessThan } from '@sapphire/iterator-utilities';
|
|
13
|
-
*
|
|
14
|
-
* const x = [1, 2, 3, 4];
|
|
15
|
-
* const y = [1, 4, 9, 16];
|
|
16
|
-
* console.log(lessThan([1], [1]));
|
|
17
|
-
* // Output: false
|
|
18
|
-
* console.log(lessThan([1], [1, 2]));
|
|
19
|
-
* // Output: true
|
|
20
|
-
* console.log(lessThan([1, 2], [1]));
|
|
21
|
-
* // Output: false
|
|
22
|
-
* console.log(lessThan([1, 2], [1, 2]));
|
|
23
|
-
* // Output: false
|
|
24
|
-
* ```
|
|
25
|
-
*
|
|
26
|
-
* @remarks
|
|
27
|
-
*
|
|
28
|
-
* This function consumes the entire iterator.
|
|
29
|
-
*/
|
|
30
|
-
declare function lessThan<const ElementType>(iterable: IterableResolvable<ElementType>, other: IterableResolvable<ElementType>): boolean;
|
|
31
|
-
|
|
32
|
-
export { lessThan, lessThan as lt };
|
package/dist/cjs/lib/map.cjs
DELETED
|
@@ -1,19 +0,0 @@
|
|
|
1
|
-
'use strict';
|
|
2
|
-
|
|
3
|
-
var _assertFunction_cjs = require('./shared/_assertFunction.cjs');
|
|
4
|
-
var toIterableIterator_cjs = require('./toIterableIterator.cjs');
|
|
5
|
-
|
|
6
|
-
var __defProp = Object.defineProperty;
|
|
7
|
-
var __name = (target, value) => __defProp(target, "name", { value, configurable: true });
|
|
8
|
-
function* map(iterable, callbackFn) {
|
|
9
|
-
callbackFn = _assertFunction_cjs.assertFunction(callbackFn);
|
|
10
|
-
let index = 0;
|
|
11
|
-
for (const element of toIterableIterator_cjs.toIterableIterator(iterable)) {
|
|
12
|
-
yield callbackFn(element, index++);
|
|
13
|
-
}
|
|
14
|
-
}
|
|
15
|
-
__name(map, "map");
|
|
16
|
-
|
|
17
|
-
exports.map = map;
|
|
18
|
-
//# sourceMappingURL=map.cjs.map
|
|
19
|
-
//# sourceMappingURL=map.cjs.map
|
package/dist/cjs/lib/map.cjs.map
DELETED
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"sources":["../../../src/lib/map.ts"],"names":["assertFunction","toIterableIterator"],"mappings":";;;;;;;AAmBO,UAAU,GAAA,CAChB,UACA,UAAA,EAC+B;AAC/B,EAAA,UAAA,GAAaA,mCAAe,UAAU,CAAA;AAEtC,EAAA,IAAI,KAAA,GAAQ,CAAA;AACZ,EAAA,KAAA,MAAW,OAAA,IAAWC,yCAAA,CAAmB,QAAQ,CAAA,EAAG;AACnD,IAAA,MAAM,UAAA,CAAW,SAAS,KAAA,EAAO,CAAA;AAAA,EAClC;AACD;AAViB,MAAA,CAAA,GAAA,EAAA,KAAA,CAAA","file":"map.cjs","sourcesContent":["import type { IterableResolvable } from './from';\nimport { assertFunction } from './shared/_assertFunction';\nimport { toIterableIterator } from './toIterableIterator';\n\n/**\n * Creates an iterable with the results of calling a provided function on each element.\n *\n * @param iterable An iterator to map over.\n * @param callbackFn A function to execute for each element produced by the iterator. Its return value is yielded by the iterator helper.\n *\n * @example\n * ```typescript\n * import { map } from '@sapphire/iterator-utilities';\n *\n * const iterable = [1, 2, 3, 4, 5];\n * console.log([...map(iterable, (value) => value * 2)]);\n * // Output: [2, 4, 6, 8, 10]\n * ```\n */\nexport function* map<const ElementType, const MappedType>(\n\titerable: IterableResolvable<ElementType>,\n\tcallbackFn: (element: ElementType, index: number) => MappedType\n): IterableIterator<MappedType> {\n\tcallbackFn = assertFunction(callbackFn);\n\n\tlet index = 0;\n\tfor (const element of toIterableIterator(iterable)) {\n\t\tyield callbackFn(element, index++);\n\t}\n}\n"]}
|