@sapphire/iterator-utilities 1.0.3-next.fc35dd86 → 2.0.0-next.09afdaab
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/cjs/index.cjs +217 -0
- package/dist/cjs/index.d.cts +32 -9
- package/dist/cjs/lib/all.cjs +12 -0
- package/dist/cjs/lib/all.cjs.map +1 -0
- package/dist/cjs/lib/all.d.cts +2 -0
- package/dist/cjs/lib/any.cjs +12 -0
- package/dist/cjs/lib/any.cjs.map +1 -0
- package/dist/cjs/lib/any.d.cts +2 -0
- package/dist/cjs/lib/append.cjs.map +1 -1
- package/dist/cjs/lib/at.cjs.map +1 -1
- package/dist/cjs/lib/average.cjs.map +1 -1
- package/dist/cjs/lib/chain.cjs.map +1 -1
- package/dist/cjs/lib/chunk.cjs.map +1 -1
- package/dist/cjs/lib/collect.cjs +12 -0
- package/dist/cjs/lib/collect.cjs.map +1 -0
- package/dist/cjs/lib/collect.d.cts +2 -0
- package/dist/cjs/lib/collectInto.cjs +17 -0
- package/dist/cjs/lib/collectInto.cjs.map +1 -0
- package/dist/cjs/lib/collectInto.d.cts +29 -0
- package/dist/cjs/lib/compact.cjs.map +1 -1
- package/dist/cjs/lib/compare.cjs +15 -0
- package/dist/cjs/lib/compare.cjs.map +1 -0
- package/dist/cjs/lib/compare.d.cts +32 -0
- package/dist/cjs/lib/compareBy.cjs +26 -0
- package/dist/cjs/lib/compareBy.cjs.map +1 -0
- package/dist/cjs/lib/compareBy.d.cts +31 -0
- package/dist/cjs/lib/compress.cjs.map +1 -1
- package/dist/cjs/lib/contains.cjs.map +1 -1
- package/dist/cjs/lib/count.cjs.map +1 -1
- package/dist/cjs/lib/cycle.cjs.map +1 -1
- package/dist/cjs/lib/difference.cjs.map +1 -1
- package/dist/cjs/lib/drop.cjs +0 -1
- package/dist/cjs/lib/drop.cjs.map +1 -1
- package/dist/cjs/lib/drop.d.cts +1 -1
- package/dist/cjs/lib/dropLast.cjs +0 -1
- package/dist/cjs/lib/dropLast.cjs.map +1 -1
- package/dist/cjs/lib/dropLast.d.cts +1 -1
- package/dist/cjs/lib/dropWhile.cjs +0 -1
- package/dist/cjs/lib/dropWhile.cjs.map +1 -1
- package/dist/cjs/lib/dropWhile.d.cts +1 -1
- package/dist/cjs/lib/empty.cjs.map +1 -1
- package/dist/cjs/lib/enumerate.cjs.map +1 -1
- package/dist/cjs/lib/equal.cjs +15 -0
- package/dist/cjs/lib/equal.cjs.map +1 -0
- package/dist/cjs/lib/equal.d.cts +26 -0
- package/dist/cjs/lib/equalBy.cjs +23 -0
- package/dist/cjs/lib/equalBy.cjs.map +1 -0
- package/dist/cjs/lib/equalBy.d.cts +27 -0
- package/dist/cjs/lib/every.cjs.map +1 -1
- package/dist/cjs/lib/filter.cjs +0 -1
- package/dist/cjs/lib/filter.cjs.map +1 -1
- package/dist/cjs/lib/filter.d.cts +1 -1
- package/dist/cjs/lib/find.cjs.map +1 -1
- package/dist/cjs/lib/findIndex.cjs.map +1 -1
- package/dist/cjs/lib/first.cjs.map +1 -1
- package/dist/cjs/lib/flat.cjs.map +1 -1
- package/dist/cjs/lib/flatMap.cjs.map +1 -1
- package/dist/cjs/lib/forEach.cjs.map +1 -1
- package/dist/cjs/lib/from.cjs.map +1 -1
- package/dist/cjs/lib/fuse.cjs +26 -0
- package/dist/cjs/lib/fuse.cjs.map +1 -0
- package/dist/cjs/lib/fuse.d.cts +47 -0
- package/dist/cjs/lib/greaterOrEqualThan.cjs +17 -0
- package/dist/cjs/lib/greaterOrEqualThan.cjs.map +1 -0
- package/dist/cjs/lib/greaterOrEqualThan.d.cts +32 -0
- package/dist/cjs/lib/greaterThan.cjs +17 -0
- package/dist/cjs/lib/greaterThan.cjs.map +1 -0
- package/dist/cjs/lib/greaterThan.d.cts +32 -0
- package/dist/cjs/lib/indexOf.cjs +0 -1
- package/dist/cjs/lib/indexOf.cjs.map +1 -1
- package/dist/cjs/lib/indexOf.d.cts +1 -1
- package/dist/cjs/lib/inspect.cjs +25 -0
- package/dist/cjs/lib/inspect.cjs.map +1 -0
- package/dist/cjs/lib/inspect.d.cts +39 -0
- package/dist/cjs/lib/intersect.cjs.map +1 -1
- package/dist/cjs/lib/intersperse.cjs +35 -0
- package/dist/cjs/lib/intersperse.cjs.map +1 -0
- package/dist/cjs/lib/intersperse.d.cts +30 -0
- package/dist/cjs/lib/isEmpty.cjs.map +1 -1
- package/dist/cjs/lib/isSorted.cjs +15 -0
- package/dist/cjs/lib/isSorted.cjs.map +1 -0
- package/dist/cjs/lib/isSorted.d.cts +35 -0
- package/dist/cjs/lib/isSortedBy.cjs +26 -0
- package/dist/cjs/lib/isSortedBy.cjs.map +1 -0
- package/dist/cjs/lib/isSortedBy.d.cts +32 -0
- package/dist/cjs/lib/isSortedByKey.cjs +29 -0
- package/dist/cjs/lib/isSortedByKey.cjs.map +1 -0
- package/dist/cjs/lib/isSortedByKey.d.cts +30 -0
- package/dist/cjs/lib/last.cjs.map +1 -1
- package/dist/cjs/lib/lessOrEqualThan.cjs +17 -0
- package/dist/cjs/lib/lessOrEqualThan.cjs.map +1 -0
- package/dist/cjs/lib/lessOrEqualThan.d.cts +32 -0
- package/dist/cjs/lib/lessThan.cjs +17 -0
- package/dist/cjs/lib/lessThan.cjs.map +1 -0
- package/dist/cjs/lib/lessThan.d.cts +32 -0
- package/dist/cjs/lib/map.cjs.map +1 -1
- package/dist/cjs/lib/max.cjs +3 -7
- package/dist/cjs/lib/max.cjs.map +1 -1
- package/dist/cjs/lib/max.d.cts +8 -3
- package/dist/cjs/lib/maxBy.cjs +27 -0
- package/dist/cjs/lib/maxBy.cjs.map +1 -0
- package/dist/cjs/lib/maxBy.d.cts +31 -0
- package/dist/cjs/lib/maxByKey.cjs +32 -0
- package/dist/cjs/lib/maxByKey.cjs.map +1 -0
- package/dist/cjs/lib/maxByKey.d.cts +32 -0
- package/dist/cjs/lib/min.cjs +3 -7
- package/dist/cjs/lib/min.cjs.map +1 -1
- package/dist/cjs/lib/min.d.cts +8 -3
- package/dist/cjs/lib/minBy.cjs +27 -0
- package/dist/cjs/lib/minBy.cjs.map +1 -0
- package/dist/cjs/lib/minBy.d.cts +31 -0
- package/dist/cjs/lib/minByKey.cjs +32 -0
- package/dist/cjs/lib/minByKey.cjs.map +1 -0
- package/dist/cjs/lib/minByKey.d.cts +31 -0
- package/dist/cjs/lib/notEqual.cjs +15 -0
- package/dist/cjs/lib/notEqual.cjs.map +1 -0
- package/dist/cjs/lib/notEqual.d.cts +26 -0
- package/dist/cjs/lib/nth.cjs +12 -0
- package/dist/cjs/lib/nth.cjs.map +1 -0
- package/dist/cjs/lib/nth.d.cts +2 -0
- package/dist/cjs/lib/partition.cjs.map +1 -1
- package/dist/cjs/lib/peekable.cjs.map +1 -1
- package/dist/cjs/lib/position.cjs +12 -0
- package/dist/cjs/lib/position.cjs.map +1 -0
- package/dist/cjs/lib/position.d.cts +2 -0
- package/dist/cjs/lib/prepend.cjs.map +1 -1
- package/dist/cjs/lib/product.cjs.map +1 -1
- package/dist/cjs/lib/range.cjs.map +1 -1
- package/dist/cjs/lib/reduce.cjs.map +1 -1
- package/dist/cjs/lib/repeat.cjs.map +1 -1
- package/dist/cjs/lib/reverse.cjs +2 -5
- package/dist/cjs/lib/reverse.cjs.map +1 -1
- package/dist/cjs/lib/shared/_assertFunction.cjs.map +1 -1
- package/dist/cjs/lib/shared/_assertNotNegative.cjs.map +1 -1
- package/dist/cjs/lib/shared/_assertPositive.cjs.map +1 -1
- package/dist/cjs/lib/shared/_compare.cjs +36 -0
- package/dist/cjs/lib/shared/_compare.cjs.map +1 -0
- package/dist/cjs/lib/shared/_compare.d.cts +20 -0
- package/dist/cjs/lib/shared/_makeIterableIterator.cjs.map +1 -1
- package/dist/cjs/lib/shared/_toIntegerOrInfinityOrThrow.cjs.map +1 -1
- package/dist/cjs/lib/shared/_toIntegerOrThrow.cjs.map +1 -1
- package/dist/cjs/lib/shared/_toNumberOrThrow.cjs.map +1 -1
- package/dist/cjs/lib/shared/comparators.cjs +28 -0
- package/dist/cjs/lib/shared/comparators.cjs.map +1 -0
- package/dist/cjs/lib/shared/comparators.d.cts +34 -0
- package/dist/cjs/lib/skip.cjs +12 -0
- package/dist/cjs/lib/skip.cjs.map +1 -0
- package/dist/cjs/lib/skip.d.cts +2 -0
- package/dist/cjs/lib/skipLast.cjs +12 -0
- package/dist/cjs/lib/skipLast.cjs.map +1 -0
- package/dist/cjs/lib/skipLast.d.cts +2 -0
- package/dist/cjs/lib/skipWhile.cjs +12 -0
- package/dist/cjs/lib/skipWhile.cjs.map +1 -0
- package/dist/cjs/lib/skipWhile.d.cts +2 -0
- package/dist/cjs/lib/slice.cjs.map +1 -1
- package/dist/cjs/lib/some.cjs.map +1 -1
- package/dist/cjs/lib/sorted.cjs.map +1 -1
- package/dist/cjs/lib/starMap.cjs.map +1 -1
- package/dist/cjs/lib/stepBy.cjs +29 -0
- package/dist/cjs/lib/stepBy.cjs.map +1 -0
- package/dist/cjs/lib/stepBy.d.cts +24 -0
- package/dist/cjs/lib/sum.cjs.map +1 -1
- package/dist/cjs/lib/take.cjs.map +1 -1
- package/dist/cjs/lib/takeLast.cjs.map +1 -1
- package/dist/cjs/lib/takeWhile.cjs +12 -0
- package/dist/cjs/lib/takeWhile.cjs.map +1 -0
- package/dist/cjs/lib/takeWhile.d.cts +2 -0
- package/dist/cjs/lib/tee.cjs.map +1 -1
- package/dist/cjs/lib/toArray.cjs.map +1 -1
- package/dist/cjs/lib/toIterableIterator.cjs.map +1 -1
- package/dist/cjs/lib/union.cjs.map +1 -1
- package/dist/cjs/lib/unique.cjs.map +1 -1
- package/dist/cjs/lib/unzip.cjs.map +1 -1
- package/dist/cjs/lib/zip.cjs.map +1 -1
- package/dist/esm/index.d.mts +32 -9
- package/dist/esm/index.mjs +31 -0
- package/dist/esm/lib/all.d.mts +2 -0
- package/dist/esm/lib/all.mjs +4 -0
- package/dist/esm/lib/all.mjs.map +1 -0
- package/dist/esm/lib/any.d.mts +2 -0
- package/dist/esm/lib/any.mjs +4 -0
- package/dist/esm/lib/any.mjs.map +1 -0
- package/dist/esm/lib/append.mjs.map +1 -1
- package/dist/esm/lib/at.mjs.map +1 -1
- package/dist/esm/lib/average.mjs.map +1 -1
- package/dist/esm/lib/chain.mjs.map +1 -1
- package/dist/esm/lib/chunk.mjs.map +1 -1
- package/dist/esm/lib/collect.d.mts +2 -0
- package/dist/esm/lib/collect.mjs +4 -0
- package/dist/esm/lib/collect.mjs.map +1 -0
- package/dist/esm/lib/collectInto.d.mts +29 -0
- package/dist/esm/lib/collectInto.mjs +14 -0
- package/dist/esm/lib/collectInto.mjs.map +1 -0
- package/dist/esm/lib/compact.mjs.map +1 -1
- package/dist/esm/lib/compare.d.mts +32 -0
- package/dist/esm/lib/compare.mjs +12 -0
- package/dist/esm/lib/compare.mjs.map +1 -0
- package/dist/esm/lib/compareBy.d.mts +31 -0
- package/dist/esm/lib/compareBy.mjs +23 -0
- package/dist/esm/lib/compareBy.mjs.map +1 -0
- package/dist/esm/lib/compress.mjs.map +1 -1
- package/dist/esm/lib/contains.mjs.map +1 -1
- package/dist/esm/lib/count.mjs.map +1 -1
- package/dist/esm/lib/cycle.mjs.map +1 -1
- package/dist/esm/lib/difference.mjs.map +1 -1
- package/dist/esm/lib/drop.d.mts +1 -1
- package/dist/esm/lib/drop.mjs +1 -1
- package/dist/esm/lib/drop.mjs.map +1 -1
- package/dist/esm/lib/dropLast.d.mts +1 -1
- package/dist/esm/lib/dropLast.mjs +1 -1
- package/dist/esm/lib/dropLast.mjs.map +1 -1
- package/dist/esm/lib/dropWhile.d.mts +1 -1
- package/dist/esm/lib/dropWhile.mjs +1 -1
- package/dist/esm/lib/dropWhile.mjs.map +1 -1
- package/dist/esm/lib/empty.mjs.map +1 -1
- package/dist/esm/lib/enumerate.mjs.map +1 -1
- package/dist/esm/lib/equal.d.mts +26 -0
- package/dist/esm/lib/equal.mjs +11 -0
- package/dist/esm/lib/equal.mjs.map +1 -0
- package/dist/esm/lib/equalBy.d.mts +27 -0
- package/dist/esm/lib/equalBy.mjs +19 -0
- package/dist/esm/lib/equalBy.mjs.map +1 -0
- package/dist/esm/lib/every.mjs.map +1 -1
- package/dist/esm/lib/filter.d.mts +1 -1
- package/dist/esm/lib/filter.mjs +1 -1
- package/dist/esm/lib/filter.mjs.map +1 -1
- package/dist/esm/lib/find.mjs.map +1 -1
- package/dist/esm/lib/findIndex.mjs.map +1 -1
- package/dist/esm/lib/first.mjs.map +1 -1
- package/dist/esm/lib/flat.mjs.map +1 -1
- package/dist/esm/lib/flatMap.mjs.map +1 -1
- package/dist/esm/lib/forEach.mjs.map +1 -1
- package/dist/esm/lib/from.mjs.map +1 -1
- package/dist/esm/lib/fuse.d.mts +47 -0
- package/dist/esm/lib/fuse.mjs +23 -0
- package/dist/esm/lib/fuse.mjs.map +1 -0
- package/dist/esm/lib/greaterOrEqualThan.d.mts +32 -0
- package/dist/esm/lib/greaterOrEqualThan.mjs +13 -0
- package/dist/esm/lib/greaterOrEqualThan.mjs.map +1 -0
- package/dist/esm/lib/greaterThan.d.mts +32 -0
- package/dist/esm/lib/greaterThan.mjs +13 -0
- package/dist/esm/lib/greaterThan.mjs.map +1 -0
- package/dist/esm/lib/indexOf.d.mts +1 -1
- package/dist/esm/lib/indexOf.mjs +1 -1
- package/dist/esm/lib/indexOf.mjs.map +1 -1
- package/dist/esm/lib/inspect.d.mts +39 -0
- package/dist/esm/lib/inspect.mjs +22 -0
- package/dist/esm/lib/inspect.mjs.map +1 -0
- package/dist/esm/lib/intersect.mjs.map +1 -1
- package/dist/esm/lib/intersperse.d.mts +30 -0
- package/dist/esm/lib/intersperse.mjs +32 -0
- package/dist/esm/lib/intersperse.mjs.map +1 -0
- package/dist/esm/lib/isEmpty.mjs.map +1 -1
- package/dist/esm/lib/isSorted.d.mts +35 -0
- package/dist/esm/lib/isSorted.mjs +12 -0
- package/dist/esm/lib/isSorted.mjs.map +1 -0
- package/dist/esm/lib/isSortedBy.d.mts +32 -0
- package/dist/esm/lib/isSortedBy.mjs +23 -0
- package/dist/esm/lib/isSortedBy.mjs.map +1 -0
- package/dist/esm/lib/isSortedByKey.d.mts +30 -0
- package/dist/esm/lib/isSortedByKey.mjs +26 -0
- package/dist/esm/lib/isSortedByKey.mjs.map +1 -0
- package/dist/esm/lib/last.mjs.map +1 -1
- package/dist/esm/lib/lessOrEqualThan.d.mts +32 -0
- package/dist/esm/lib/lessOrEqualThan.mjs +13 -0
- package/dist/esm/lib/lessOrEqualThan.mjs.map +1 -0
- package/dist/esm/lib/lessThan.d.mts +32 -0
- package/dist/esm/lib/lessThan.mjs +13 -0
- package/dist/esm/lib/lessThan.mjs.map +1 -0
- package/dist/esm/lib/map.mjs.map +1 -1
- package/dist/esm/lib/max.d.mts +8 -3
- package/dist/esm/lib/max.mjs +3 -7
- package/dist/esm/lib/max.mjs.map +1 -1
- package/dist/esm/lib/maxBy.d.mts +31 -0
- package/dist/esm/lib/maxBy.mjs +24 -0
- package/dist/esm/lib/maxBy.mjs.map +1 -0
- package/dist/esm/lib/maxByKey.d.mts +32 -0
- package/dist/esm/lib/maxByKey.mjs +29 -0
- package/dist/esm/lib/maxByKey.mjs.map +1 -0
- package/dist/esm/lib/min.d.mts +8 -3
- package/dist/esm/lib/min.mjs +3 -7
- package/dist/esm/lib/min.mjs.map +1 -1
- package/dist/esm/lib/minBy.d.mts +31 -0
- package/dist/esm/lib/minBy.mjs +24 -0
- package/dist/esm/lib/minBy.mjs.map +1 -0
- package/dist/esm/lib/minByKey.d.mts +31 -0
- package/dist/esm/lib/minByKey.mjs +29 -0
- package/dist/esm/lib/minByKey.mjs.map +1 -0
- package/dist/esm/lib/notEqual.d.mts +26 -0
- package/dist/esm/lib/notEqual.mjs +11 -0
- package/dist/esm/lib/notEqual.mjs.map +1 -0
- package/dist/esm/lib/nth.d.mts +2 -0
- package/dist/esm/lib/nth.mjs +4 -0
- package/dist/esm/lib/nth.mjs.map +1 -0
- package/dist/esm/lib/partition.mjs.map +1 -1
- package/dist/esm/lib/peekable.mjs.map +1 -1
- package/dist/esm/lib/position.d.mts +2 -0
- package/dist/esm/lib/position.mjs +4 -0
- package/dist/esm/lib/position.mjs.map +1 -0
- package/dist/esm/lib/prepend.mjs.map +1 -1
- package/dist/esm/lib/product.mjs.map +1 -1
- package/dist/esm/lib/range.mjs.map +1 -1
- package/dist/esm/lib/reduce.mjs.map +1 -1
- package/dist/esm/lib/repeat.mjs.map +1 -1
- package/dist/esm/lib/reverse.mjs +2 -5
- package/dist/esm/lib/reverse.mjs.map +1 -1
- package/dist/esm/lib/shared/_assertFunction.mjs.map +1 -1
- package/dist/esm/lib/shared/_assertNotNegative.mjs.map +1 -1
- package/dist/esm/lib/shared/_assertPositive.mjs.map +1 -1
- package/dist/esm/lib/shared/_compare.d.mts +20 -0
- package/dist/esm/lib/shared/_compare.mjs +30 -0
- package/dist/esm/lib/shared/_compare.mjs.map +1 -0
- package/dist/esm/lib/shared/_makeIterableIterator.mjs.map +1 -1
- package/dist/esm/lib/shared/_toIntegerOrInfinityOrThrow.mjs.map +1 -1
- package/dist/esm/lib/shared/_toIntegerOrThrow.mjs.map +1 -1
- package/dist/esm/lib/shared/_toNumberOrThrow.mjs.map +1 -1
- package/dist/esm/lib/shared/comparators.d.mts +34 -0
- package/dist/esm/lib/shared/comparators.mjs +21 -0
- package/dist/esm/lib/shared/comparators.mjs.map +1 -0
- package/dist/esm/lib/skip.d.mts +2 -0
- package/dist/esm/lib/skip.mjs +4 -0
- package/dist/esm/lib/skip.mjs.map +1 -0
- package/dist/esm/lib/skipLast.d.mts +2 -0
- package/dist/esm/lib/skipLast.mjs +4 -0
- package/dist/esm/lib/skipLast.mjs.map +1 -0
- package/dist/esm/lib/skipWhile.d.mts +2 -0
- package/dist/esm/lib/skipWhile.mjs +4 -0
- package/dist/esm/lib/skipWhile.mjs.map +1 -0
- package/dist/esm/lib/slice.mjs.map +1 -1
- package/dist/esm/lib/some.mjs.map +1 -1
- package/dist/esm/lib/sorted.mjs.map +1 -1
- package/dist/esm/lib/starMap.mjs.map +1 -1
- package/dist/esm/lib/stepBy.d.mts +24 -0
- package/dist/esm/lib/stepBy.mjs +26 -0
- package/dist/esm/lib/stepBy.mjs.map +1 -0
- package/dist/esm/lib/sum.mjs.map +1 -1
- package/dist/esm/lib/take.mjs.map +1 -1
- package/dist/esm/lib/takeLast.mjs.map +1 -1
- package/dist/esm/lib/takeWhile.d.mts +2 -0
- package/dist/esm/lib/takeWhile.mjs +4 -0
- package/dist/esm/lib/takeWhile.mjs.map +1 -0
- package/dist/esm/lib/tee.mjs.map +1 -1
- package/dist/esm/lib/toArray.mjs.map +1 -1
- package/dist/esm/lib/toIterableIterator.mjs.map +1 -1
- package/dist/esm/lib/union.mjs.map +1 -1
- package/dist/esm/lib/unique.mjs.map +1 -1
- package/dist/esm/lib/unzip.mjs.map +1 -1
- package/dist/esm/lib/zip.mjs.map +1 -1
- package/dist/iife/index.global.js +391 -49
- package/dist/iife/index.global.js.map +1 -1
- package/package.json +295 -25
package/dist/cjs/index.cjs
CHANGED
|
@@ -1,11 +1,17 @@
|
|
|
1
1
|
'use strict';
|
|
2
2
|
|
|
3
|
+
var all_cjs = require('./lib/all.cjs');
|
|
4
|
+
var any_cjs = require('./lib/any.cjs');
|
|
3
5
|
var append_cjs = require('./lib/append.cjs');
|
|
4
6
|
var at_cjs = require('./lib/at.cjs');
|
|
5
7
|
var average_cjs = require('./lib/average.cjs');
|
|
6
8
|
var chain_cjs = require('./lib/chain.cjs');
|
|
7
9
|
var chunk_cjs = require('./lib/chunk.cjs');
|
|
10
|
+
var collect_cjs = require('./lib/collect.cjs');
|
|
11
|
+
var collectInto_cjs = require('./lib/collectInto.cjs');
|
|
8
12
|
var compact_cjs = require('./lib/compact.cjs');
|
|
13
|
+
var compare_cjs = require('./lib/compare.cjs');
|
|
14
|
+
var compareBy_cjs = require('./lib/compareBy.cjs');
|
|
9
15
|
var compress_cjs = require('./lib/compress.cjs');
|
|
10
16
|
var contains_cjs = require('./lib/contains.cjs');
|
|
11
17
|
var count_cjs = require('./lib/count.cjs');
|
|
@@ -16,6 +22,8 @@ var dropLast_cjs = require('./lib/dropLast.cjs');
|
|
|
16
22
|
var dropWhile_cjs = require('./lib/dropWhile.cjs');
|
|
17
23
|
var empty_cjs = require('./lib/empty.cjs');
|
|
18
24
|
var enumerate_cjs = require('./lib/enumerate.cjs');
|
|
25
|
+
var equal_cjs = require('./lib/equal.cjs');
|
|
26
|
+
var equalBy_cjs = require('./lib/equalBy.cjs');
|
|
19
27
|
var every_cjs = require('./lib/every.cjs');
|
|
20
28
|
var filter_cjs = require('./lib/filter.cjs');
|
|
21
29
|
var find_cjs = require('./lib/find.cjs');
|
|
@@ -25,28 +33,51 @@ var flat_cjs = require('./lib/flat.cjs');
|
|
|
25
33
|
var flatMap_cjs = require('./lib/flatMap.cjs');
|
|
26
34
|
var forEach_cjs = require('./lib/forEach.cjs');
|
|
27
35
|
var from_cjs = require('./lib/from.cjs');
|
|
36
|
+
var fuse_cjs = require('./lib/fuse.cjs');
|
|
37
|
+
var greaterOrEqualThan_cjs = require('./lib/greaterOrEqualThan.cjs');
|
|
38
|
+
var greaterThan_cjs = require('./lib/greaterThan.cjs');
|
|
28
39
|
var indexOf_cjs = require('./lib/indexOf.cjs');
|
|
40
|
+
var inspect_cjs = require('./lib/inspect.cjs');
|
|
29
41
|
var intersect_cjs = require('./lib/intersect.cjs');
|
|
42
|
+
var intersperse_cjs = require('./lib/intersperse.cjs');
|
|
30
43
|
var isEmpty_cjs = require('./lib/isEmpty.cjs');
|
|
44
|
+
var isSorted_cjs = require('./lib/isSorted.cjs');
|
|
45
|
+
var isSortedBy_cjs = require('./lib/isSortedBy.cjs');
|
|
46
|
+
var isSortedByKey_cjs = require('./lib/isSortedByKey.cjs');
|
|
31
47
|
var last_cjs = require('./lib/last.cjs');
|
|
48
|
+
var lessOrEqualThan_cjs = require('./lib/lessOrEqualThan.cjs');
|
|
49
|
+
var lessThan_cjs = require('./lib/lessThan.cjs');
|
|
32
50
|
var map_cjs = require('./lib/map.cjs');
|
|
33
51
|
var max_cjs = require('./lib/max.cjs');
|
|
52
|
+
var maxBy_cjs = require('./lib/maxBy.cjs');
|
|
53
|
+
var maxByKey_cjs = require('./lib/maxByKey.cjs');
|
|
34
54
|
var min_cjs = require('./lib/min.cjs');
|
|
55
|
+
var minBy_cjs = require('./lib/minBy.cjs');
|
|
56
|
+
var minByKey_cjs = require('./lib/minByKey.cjs');
|
|
57
|
+
var notEqual_cjs = require('./lib/notEqual.cjs');
|
|
58
|
+
var nth_cjs = require('./lib/nth.cjs');
|
|
35
59
|
var partition_cjs = require('./lib/partition.cjs');
|
|
36
60
|
var peekable_cjs = require('./lib/peekable.cjs');
|
|
61
|
+
var position_cjs = require('./lib/position.cjs');
|
|
37
62
|
var prepend_cjs = require('./lib/prepend.cjs');
|
|
38
63
|
var product_cjs = require('./lib/product.cjs');
|
|
39
64
|
var range_cjs = require('./lib/range.cjs');
|
|
40
65
|
var reduce_cjs = require('./lib/reduce.cjs');
|
|
41
66
|
var repeat_cjs = require('./lib/repeat.cjs');
|
|
42
67
|
var reverse_cjs = require('./lib/reverse.cjs');
|
|
68
|
+
var comparators_cjs = require('./lib/shared/comparators.cjs');
|
|
69
|
+
var skip_cjs = require('./lib/skip.cjs');
|
|
70
|
+
var skipLast_cjs = require('./lib/skipLast.cjs');
|
|
71
|
+
var skipWhile_cjs = require('./lib/skipWhile.cjs');
|
|
43
72
|
var slice_cjs = require('./lib/slice.cjs');
|
|
44
73
|
var some_cjs = require('./lib/some.cjs');
|
|
45
74
|
var sorted_cjs = require('./lib/sorted.cjs');
|
|
46
75
|
var starMap_cjs = require('./lib/starMap.cjs');
|
|
76
|
+
var stepBy_cjs = require('./lib/stepBy.cjs');
|
|
47
77
|
var sum_cjs = require('./lib/sum.cjs');
|
|
48
78
|
var take_cjs = require('./lib/take.cjs');
|
|
49
79
|
var takeLast_cjs = require('./lib/takeLast.cjs');
|
|
80
|
+
var takeWhile_cjs = require('./lib/takeWhile.cjs');
|
|
50
81
|
var tee_cjs = require('./lib/tee.cjs');
|
|
51
82
|
var toArray_cjs = require('./lib/toArray.cjs');
|
|
52
83
|
var toIterableIterator_cjs = require('./lib/toIterableIterator.cjs');
|
|
@@ -57,6 +88,18 @@ var zip_cjs = require('./lib/zip.cjs');
|
|
|
57
88
|
|
|
58
89
|
|
|
59
90
|
|
|
91
|
+
Object.keys(all_cjs).forEach(function (k) {
|
|
92
|
+
if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
|
|
93
|
+
enumerable: true,
|
|
94
|
+
get: function () { return all_cjs[k]; }
|
|
95
|
+
});
|
|
96
|
+
});
|
|
97
|
+
Object.keys(any_cjs).forEach(function (k) {
|
|
98
|
+
if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
|
|
99
|
+
enumerable: true,
|
|
100
|
+
get: function () { return any_cjs[k]; }
|
|
101
|
+
});
|
|
102
|
+
});
|
|
60
103
|
Object.keys(append_cjs).forEach(function (k) {
|
|
61
104
|
if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
|
|
62
105
|
enumerable: true,
|
|
@@ -87,12 +130,36 @@ Object.keys(chunk_cjs).forEach(function (k) {
|
|
|
87
130
|
get: function () { return chunk_cjs[k]; }
|
|
88
131
|
});
|
|
89
132
|
});
|
|
133
|
+
Object.keys(collect_cjs).forEach(function (k) {
|
|
134
|
+
if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
|
|
135
|
+
enumerable: true,
|
|
136
|
+
get: function () { return collect_cjs[k]; }
|
|
137
|
+
});
|
|
138
|
+
});
|
|
139
|
+
Object.keys(collectInto_cjs).forEach(function (k) {
|
|
140
|
+
if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
|
|
141
|
+
enumerable: true,
|
|
142
|
+
get: function () { return collectInto_cjs[k]; }
|
|
143
|
+
});
|
|
144
|
+
});
|
|
90
145
|
Object.keys(compact_cjs).forEach(function (k) {
|
|
91
146
|
if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
|
|
92
147
|
enumerable: true,
|
|
93
148
|
get: function () { return compact_cjs[k]; }
|
|
94
149
|
});
|
|
95
150
|
});
|
|
151
|
+
Object.keys(compare_cjs).forEach(function (k) {
|
|
152
|
+
if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
|
|
153
|
+
enumerable: true,
|
|
154
|
+
get: function () { return compare_cjs[k]; }
|
|
155
|
+
});
|
|
156
|
+
});
|
|
157
|
+
Object.keys(compareBy_cjs).forEach(function (k) {
|
|
158
|
+
if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
|
|
159
|
+
enumerable: true,
|
|
160
|
+
get: function () { return compareBy_cjs[k]; }
|
|
161
|
+
});
|
|
162
|
+
});
|
|
96
163
|
Object.keys(compress_cjs).forEach(function (k) {
|
|
97
164
|
if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
|
|
98
165
|
enumerable: true,
|
|
@@ -153,6 +220,18 @@ Object.keys(enumerate_cjs).forEach(function (k) {
|
|
|
153
220
|
get: function () { return enumerate_cjs[k]; }
|
|
154
221
|
});
|
|
155
222
|
});
|
|
223
|
+
Object.keys(equal_cjs).forEach(function (k) {
|
|
224
|
+
if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
|
|
225
|
+
enumerable: true,
|
|
226
|
+
get: function () { return equal_cjs[k]; }
|
|
227
|
+
});
|
|
228
|
+
});
|
|
229
|
+
Object.keys(equalBy_cjs).forEach(function (k) {
|
|
230
|
+
if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
|
|
231
|
+
enumerable: true,
|
|
232
|
+
get: function () { return equalBy_cjs[k]; }
|
|
233
|
+
});
|
|
234
|
+
});
|
|
156
235
|
Object.keys(every_cjs).forEach(function (k) {
|
|
157
236
|
if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
|
|
158
237
|
enumerable: true,
|
|
@@ -207,30 +286,90 @@ Object.keys(from_cjs).forEach(function (k) {
|
|
|
207
286
|
get: function () { return from_cjs[k]; }
|
|
208
287
|
});
|
|
209
288
|
});
|
|
289
|
+
Object.keys(fuse_cjs).forEach(function (k) {
|
|
290
|
+
if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
|
|
291
|
+
enumerable: true,
|
|
292
|
+
get: function () { return fuse_cjs[k]; }
|
|
293
|
+
});
|
|
294
|
+
});
|
|
295
|
+
Object.keys(greaterOrEqualThan_cjs).forEach(function (k) {
|
|
296
|
+
if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
|
|
297
|
+
enumerable: true,
|
|
298
|
+
get: function () { return greaterOrEqualThan_cjs[k]; }
|
|
299
|
+
});
|
|
300
|
+
});
|
|
301
|
+
Object.keys(greaterThan_cjs).forEach(function (k) {
|
|
302
|
+
if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
|
|
303
|
+
enumerable: true,
|
|
304
|
+
get: function () { return greaterThan_cjs[k]; }
|
|
305
|
+
});
|
|
306
|
+
});
|
|
210
307
|
Object.keys(indexOf_cjs).forEach(function (k) {
|
|
211
308
|
if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
|
|
212
309
|
enumerable: true,
|
|
213
310
|
get: function () { return indexOf_cjs[k]; }
|
|
214
311
|
});
|
|
215
312
|
});
|
|
313
|
+
Object.keys(inspect_cjs).forEach(function (k) {
|
|
314
|
+
if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
|
|
315
|
+
enumerable: true,
|
|
316
|
+
get: function () { return inspect_cjs[k]; }
|
|
317
|
+
});
|
|
318
|
+
});
|
|
216
319
|
Object.keys(intersect_cjs).forEach(function (k) {
|
|
217
320
|
if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
|
|
218
321
|
enumerable: true,
|
|
219
322
|
get: function () { return intersect_cjs[k]; }
|
|
220
323
|
});
|
|
221
324
|
});
|
|
325
|
+
Object.keys(intersperse_cjs).forEach(function (k) {
|
|
326
|
+
if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
|
|
327
|
+
enumerable: true,
|
|
328
|
+
get: function () { return intersperse_cjs[k]; }
|
|
329
|
+
});
|
|
330
|
+
});
|
|
222
331
|
Object.keys(isEmpty_cjs).forEach(function (k) {
|
|
223
332
|
if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
|
|
224
333
|
enumerable: true,
|
|
225
334
|
get: function () { return isEmpty_cjs[k]; }
|
|
226
335
|
});
|
|
227
336
|
});
|
|
337
|
+
Object.keys(isSorted_cjs).forEach(function (k) {
|
|
338
|
+
if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
|
|
339
|
+
enumerable: true,
|
|
340
|
+
get: function () { return isSorted_cjs[k]; }
|
|
341
|
+
});
|
|
342
|
+
});
|
|
343
|
+
Object.keys(isSortedBy_cjs).forEach(function (k) {
|
|
344
|
+
if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
|
|
345
|
+
enumerable: true,
|
|
346
|
+
get: function () { return isSortedBy_cjs[k]; }
|
|
347
|
+
});
|
|
348
|
+
});
|
|
349
|
+
Object.keys(isSortedByKey_cjs).forEach(function (k) {
|
|
350
|
+
if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
|
|
351
|
+
enumerable: true,
|
|
352
|
+
get: function () { return isSortedByKey_cjs[k]; }
|
|
353
|
+
});
|
|
354
|
+
});
|
|
228
355
|
Object.keys(last_cjs).forEach(function (k) {
|
|
229
356
|
if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
|
|
230
357
|
enumerable: true,
|
|
231
358
|
get: function () { return last_cjs[k]; }
|
|
232
359
|
});
|
|
233
360
|
});
|
|
361
|
+
Object.keys(lessOrEqualThan_cjs).forEach(function (k) {
|
|
362
|
+
if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
|
|
363
|
+
enumerable: true,
|
|
364
|
+
get: function () { return lessOrEqualThan_cjs[k]; }
|
|
365
|
+
});
|
|
366
|
+
});
|
|
367
|
+
Object.keys(lessThan_cjs).forEach(function (k) {
|
|
368
|
+
if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
|
|
369
|
+
enumerable: true,
|
|
370
|
+
get: function () { return lessThan_cjs[k]; }
|
|
371
|
+
});
|
|
372
|
+
});
|
|
234
373
|
Object.keys(map_cjs).forEach(function (k) {
|
|
235
374
|
if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
|
|
236
375
|
enumerable: true,
|
|
@@ -243,12 +382,48 @@ Object.keys(max_cjs).forEach(function (k) {
|
|
|
243
382
|
get: function () { return max_cjs[k]; }
|
|
244
383
|
});
|
|
245
384
|
});
|
|
385
|
+
Object.keys(maxBy_cjs).forEach(function (k) {
|
|
386
|
+
if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
|
|
387
|
+
enumerable: true,
|
|
388
|
+
get: function () { return maxBy_cjs[k]; }
|
|
389
|
+
});
|
|
390
|
+
});
|
|
391
|
+
Object.keys(maxByKey_cjs).forEach(function (k) {
|
|
392
|
+
if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
|
|
393
|
+
enumerable: true,
|
|
394
|
+
get: function () { return maxByKey_cjs[k]; }
|
|
395
|
+
});
|
|
396
|
+
});
|
|
246
397
|
Object.keys(min_cjs).forEach(function (k) {
|
|
247
398
|
if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
|
|
248
399
|
enumerable: true,
|
|
249
400
|
get: function () { return min_cjs[k]; }
|
|
250
401
|
});
|
|
251
402
|
});
|
|
403
|
+
Object.keys(minBy_cjs).forEach(function (k) {
|
|
404
|
+
if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
|
|
405
|
+
enumerable: true,
|
|
406
|
+
get: function () { return minBy_cjs[k]; }
|
|
407
|
+
});
|
|
408
|
+
});
|
|
409
|
+
Object.keys(minByKey_cjs).forEach(function (k) {
|
|
410
|
+
if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
|
|
411
|
+
enumerable: true,
|
|
412
|
+
get: function () { return minByKey_cjs[k]; }
|
|
413
|
+
});
|
|
414
|
+
});
|
|
415
|
+
Object.keys(notEqual_cjs).forEach(function (k) {
|
|
416
|
+
if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
|
|
417
|
+
enumerable: true,
|
|
418
|
+
get: function () { return notEqual_cjs[k]; }
|
|
419
|
+
});
|
|
420
|
+
});
|
|
421
|
+
Object.keys(nth_cjs).forEach(function (k) {
|
|
422
|
+
if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
|
|
423
|
+
enumerable: true,
|
|
424
|
+
get: function () { return nth_cjs[k]; }
|
|
425
|
+
});
|
|
426
|
+
});
|
|
252
427
|
Object.keys(partition_cjs).forEach(function (k) {
|
|
253
428
|
if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
|
|
254
429
|
enumerable: true,
|
|
@@ -261,6 +436,12 @@ Object.keys(peekable_cjs).forEach(function (k) {
|
|
|
261
436
|
get: function () { return peekable_cjs[k]; }
|
|
262
437
|
});
|
|
263
438
|
});
|
|
439
|
+
Object.keys(position_cjs).forEach(function (k) {
|
|
440
|
+
if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
|
|
441
|
+
enumerable: true,
|
|
442
|
+
get: function () { return position_cjs[k]; }
|
|
443
|
+
});
|
|
444
|
+
});
|
|
264
445
|
Object.keys(prepend_cjs).forEach(function (k) {
|
|
265
446
|
if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
|
|
266
447
|
enumerable: true,
|
|
@@ -297,6 +478,30 @@ Object.keys(reverse_cjs).forEach(function (k) {
|
|
|
297
478
|
get: function () { return reverse_cjs[k]; }
|
|
298
479
|
});
|
|
299
480
|
});
|
|
481
|
+
Object.keys(comparators_cjs).forEach(function (k) {
|
|
482
|
+
if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
|
|
483
|
+
enumerable: true,
|
|
484
|
+
get: function () { return comparators_cjs[k]; }
|
|
485
|
+
});
|
|
486
|
+
});
|
|
487
|
+
Object.keys(skip_cjs).forEach(function (k) {
|
|
488
|
+
if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
|
|
489
|
+
enumerable: true,
|
|
490
|
+
get: function () { return skip_cjs[k]; }
|
|
491
|
+
});
|
|
492
|
+
});
|
|
493
|
+
Object.keys(skipLast_cjs).forEach(function (k) {
|
|
494
|
+
if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
|
|
495
|
+
enumerable: true,
|
|
496
|
+
get: function () { return skipLast_cjs[k]; }
|
|
497
|
+
});
|
|
498
|
+
});
|
|
499
|
+
Object.keys(skipWhile_cjs).forEach(function (k) {
|
|
500
|
+
if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
|
|
501
|
+
enumerable: true,
|
|
502
|
+
get: function () { return skipWhile_cjs[k]; }
|
|
503
|
+
});
|
|
504
|
+
});
|
|
300
505
|
Object.keys(slice_cjs).forEach(function (k) {
|
|
301
506
|
if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
|
|
302
507
|
enumerable: true,
|
|
@@ -321,6 +526,12 @@ Object.keys(starMap_cjs).forEach(function (k) {
|
|
|
321
526
|
get: function () { return starMap_cjs[k]; }
|
|
322
527
|
});
|
|
323
528
|
});
|
|
529
|
+
Object.keys(stepBy_cjs).forEach(function (k) {
|
|
530
|
+
if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
|
|
531
|
+
enumerable: true,
|
|
532
|
+
get: function () { return stepBy_cjs[k]; }
|
|
533
|
+
});
|
|
534
|
+
});
|
|
324
535
|
Object.keys(sum_cjs).forEach(function (k) {
|
|
325
536
|
if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
|
|
326
537
|
enumerable: true,
|
|
@@ -339,6 +550,12 @@ Object.keys(takeLast_cjs).forEach(function (k) {
|
|
|
339
550
|
get: function () { return takeLast_cjs[k]; }
|
|
340
551
|
});
|
|
341
552
|
});
|
|
553
|
+
Object.keys(takeWhile_cjs).forEach(function (k) {
|
|
554
|
+
if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
|
|
555
|
+
enumerable: true,
|
|
556
|
+
get: function () { return takeWhile_cjs[k]; }
|
|
557
|
+
});
|
|
558
|
+
});
|
|
342
559
|
Object.keys(tee_cjs).forEach(function (k) {
|
|
343
560
|
if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
|
|
344
561
|
enumerable: true,
|
package/dist/cjs/index.d.cts
CHANGED
|
@@ -1,21 +1,28 @@
|
|
|
1
|
+
export { every as all, every } from './lib/every.cjs';
|
|
2
|
+
export { some as any, some } from './lib/some.cjs';
|
|
1
3
|
export { concat as append, concat } from './lib/append.cjs';
|
|
2
|
-
export { at } from './lib/at.cjs';
|
|
4
|
+
export { at, at as nth } from './lib/at.cjs';
|
|
3
5
|
export { average } from './lib/average.cjs';
|
|
4
6
|
export { chain } from './lib/chain.cjs';
|
|
5
7
|
export { chunk } from './lib/chunk.cjs';
|
|
8
|
+
export { toArray as collect, toArray } from './lib/toArray.cjs';
|
|
9
|
+
export { collectInto } from './lib/collectInto.cjs';
|
|
6
10
|
export { compact } from './lib/compact.cjs';
|
|
11
|
+
export { compare } from './lib/compare.cjs';
|
|
12
|
+
export { compareBy } from './lib/compareBy.cjs';
|
|
7
13
|
export { compress } from './lib/compress.cjs';
|
|
8
14
|
export { contains } from './lib/contains.cjs';
|
|
9
15
|
export { count } from './lib/count.cjs';
|
|
10
16
|
export { cycle } from './lib/cycle.cjs';
|
|
11
17
|
export { except as difference, except, except as omit } from './lib/difference.cjs';
|
|
12
|
-
export {
|
|
13
|
-
export {
|
|
14
|
-
export {
|
|
18
|
+
export { drop, drop as skip } from './lib/drop.cjs';
|
|
19
|
+
export { dropLast, dropLast as skipLast } from './lib/dropLast.cjs';
|
|
20
|
+
export { dropWhile, dropWhile as skipWhile } from './lib/dropWhile.cjs';
|
|
15
21
|
export { empty } from './lib/empty.cjs';
|
|
16
22
|
export { enumerate } from './lib/enumerate.cjs';
|
|
17
|
-
export {
|
|
18
|
-
export {
|
|
23
|
+
export { eq, eq as equal } from './lib/equal.cjs';
|
|
24
|
+
export { eqBy, eqBy as equalBy } from './lib/equalBy.cjs';
|
|
25
|
+
export { filter, filter as takeWhile } from './lib/filter.cjs';
|
|
19
26
|
export { find } from './lib/find.cjs';
|
|
20
27
|
export { findIndex } from './lib/findIndex.cjs';
|
|
21
28
|
export { first } from './lib/first.cjs';
|
|
@@ -23,13 +30,28 @@ export { flat } from './lib/flat.cjs';
|
|
|
23
30
|
export { flatMap } from './lib/flatMap.cjs';
|
|
24
31
|
export { forEach } from './lib/forEach.cjs';
|
|
25
32
|
export { IterableResolvable, IterableResolved, from } from './lib/from.cjs';
|
|
26
|
-
export {
|
|
33
|
+
export { fuse } from './lib/fuse.cjs';
|
|
34
|
+
export { ge, ge as greaterOrEqualThan } from './lib/greaterOrEqualThan.cjs';
|
|
35
|
+
export { gt as greaterThan, gt } from './lib/greaterThan.cjs';
|
|
36
|
+
export { indexOf, indexOf as position } from './lib/indexOf.cjs';
|
|
37
|
+
export { inspect } from './lib/inspect.cjs';
|
|
27
38
|
export { intersect } from './lib/intersect.cjs';
|
|
39
|
+
export { intersperse } from './lib/intersperse.cjs';
|
|
28
40
|
export { isEmpty } from './lib/isEmpty.cjs';
|
|
41
|
+
export { isSorted } from './lib/isSorted.cjs';
|
|
42
|
+
export { isSortedBy } from './lib/isSortedBy.cjs';
|
|
43
|
+
export { isSortedByKey } from './lib/isSortedByKey.cjs';
|
|
29
44
|
export { last } from './lib/last.cjs';
|
|
45
|
+
export { le, le as lessOrEqualThan } from './lib/lessOrEqualThan.cjs';
|
|
46
|
+
export { lt as lessThan, lt } from './lib/lessThan.cjs';
|
|
30
47
|
export { map } from './lib/map.cjs';
|
|
31
48
|
export { max } from './lib/max.cjs';
|
|
49
|
+
export { maxBy } from './lib/maxBy.cjs';
|
|
50
|
+
export { maxByKey } from './lib/maxByKey.cjs';
|
|
32
51
|
export { min } from './lib/min.cjs';
|
|
52
|
+
export { minBy } from './lib/minBy.cjs';
|
|
53
|
+
export { minByKey } from './lib/minByKey.cjs';
|
|
54
|
+
export { ne, ne as notEqual } from './lib/notEqual.cjs';
|
|
33
55
|
export { partition } from './lib/partition.cjs';
|
|
34
56
|
export { Peekable, peekable } from './lib/peekable.cjs';
|
|
35
57
|
export { prepend } from './lib/prepend.cjs';
|
|
@@ -38,16 +60,17 @@ export { range } from './lib/range.cjs';
|
|
|
38
60
|
export { reduce } from './lib/reduce.cjs';
|
|
39
61
|
export { repeat } from './lib/repeat.cjs';
|
|
40
62
|
export { reverse } from './lib/reverse.cjs';
|
|
63
|
+
export { CompareByComparator, LexicographicComparison } from './lib/shared/_compare.js';
|
|
41
64
|
export { NumberResolvable } from './lib/shared/_toNumberOrThrow.js';
|
|
65
|
+
export { ascNumber, ascString, ascString as defaultCompare, descNumber, descString } from './lib/shared/comparators.js';
|
|
42
66
|
export { slice } from './lib/slice.cjs';
|
|
43
|
-
export { some } from './lib/some.cjs';
|
|
44
67
|
export { sorted } from './lib/sorted.cjs';
|
|
45
68
|
export { StarMapParameters, starMap } from './lib/starMap.cjs';
|
|
69
|
+
export { stepBy } from './lib/stepBy.cjs';
|
|
46
70
|
export { sum } from './lib/sum.cjs';
|
|
47
71
|
export { take } from './lib/take.cjs';
|
|
48
72
|
export { takeLast } from './lib/takeLast.cjs';
|
|
49
73
|
export { tee } from './lib/tee.cjs';
|
|
50
|
-
export { toArray } from './lib/toArray.cjs';
|
|
51
74
|
export { toIterableIterator } from './lib/toIterableIterator.cjs';
|
|
52
75
|
export { union } from './lib/union.cjs';
|
|
53
76
|
export { unique } from './lib/unique.cjs';
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"sources":[],"names":[],"mappings":"","file":"all.cjs","sourcesContent":[]}
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"sources":[],"names":[],"mappings":"","file":"any.cjs","sourcesContent":[]}
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"sources":["../../../src/lib/append.ts"],"names":["chain"],"mappings":";;;;;;AAmBO,SAAS,MAAA,CACf,aACG,SAC6B,EAAA;AAChC,EAAO,OAAAA,eAAA,CAAM,QAAU,EAAA,GAAG,SAAS,CAAA
|
|
1
|
+
{"version":3,"sources":["../../../src/lib/append.ts"],"names":["chain"],"mappings":";;;;;;AAmBO,SAAS,MAAA,CACf,aACG,SAC6B,EAAA;AAChC,EAAO,OAAAA,eAAA,CAAM,QAAU,EAAA,GAAG,SAAS,CAAA;AACpC;AALgB,MAAA,CAAA,MAAA,EAAA,QAAA,CAAA","file":"append.cjs","sourcesContent":["import { chain } from './chain';\nimport type { IterableResolvable } from './from';\n\n/**\n * Appends iterables to the end of the first iterable, returning a new iterable combining all of them. It's similar to concatenating arrays or doing `[...a, ...b, ...c]`.\n *\n * @param iterable The iterator to append values to.\n * @param iterables The iterables to append to the iterator.\n * @returns An iterator that yields the values of the provided iterator followed by the values of the provided iterables.\n *\n * @example\n * ```typescript\n * import { append } from '@sapphire/iterator-utilities';\n *\n * const iterable = append([1, 2, 3], [4, 5, 6], [7, 8, 9]);\n * console.log([...iterable]);\n * // Output: [1, 2, 3, 4, 5, 6, 7, 8, 9]\n * ```\n */\nexport function append<const ElementType>(\n\titerable: IterableResolvable<ElementType>,\n\t...iterables: IterableResolvable<ElementType>[]\n): IterableIterator<ElementType> {\n\treturn chain(iterable, ...iterables);\n}\n\nexport { append as concat };\n"]}
|
package/dist/cjs/lib/at.cjs.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"sources":["../../../src/lib/at.ts"],"names":["assertNotNegative","toIntegerOrInfinityOrThrow","first","drop"],"mappings":";;;;;;;;;AA0BO,SAAS,EAAA,CAAsB,UAA2C,KAAwC,EAAA;AACxH,EAAA,KAAA,GAAQA,wCAAkB,CAAAC,0DAAA,CAA2B,KAAK,CAAA,EAAG,KAAK,CAAA
|
|
1
|
+
{"version":3,"sources":["../../../src/lib/at.ts"],"names":["assertNotNegative","toIntegerOrInfinityOrThrow","first","drop"],"mappings":";;;;;;;;;AA0BO,SAAS,EAAA,CAAsB,UAA2C,KAAwC,EAAA;AACxH,EAAA,KAAA,GAAQA,wCAAkB,CAAAC,0DAAA,CAA2B,KAAK,CAAA,EAAG,KAAK,CAAA;AAClE,EAAA,OAAOC,gBAAM,KAAU,KAAA,CAAA,GAAI,WAAWC,aAAK,CAAA,QAAA,EAAU,KAAK,CAAC,CAAA;AAC5D;AAHgB,MAAA,CAAA,EAAA,EAAA,IAAA,CAAA","file":"at.cjs","sourcesContent":["import { drop } from './drop';\nimport { first } from './first';\nimport type { IterableResolvable } from './from';\nimport { assertNotNegative } from './shared/_assertNotNegative';\nimport { toIntegerOrInfinityOrThrow } from './shared/_toIntegerOrInfinityOrThrow';\n\n/**\n * Advances the iterable to the `n`th element and returns it. If the iterable is exhausted before reaching the `n`th element, it returns `undefined`.\n *\n * @param iterable An iterator to return an element from.\n * @param index The index of the element to retrieve.\n * @returns The element at the specified index, or `undefined` if the index is out of range.\n *\n * @example\n * ```typescript\n * import { at } from '@sapphire/iterator-utilities';\n *\n * const iterable = [1, 2, 3, 4, 5];\n * console.log(at(iterable, 2));\n * // Output: 3\n * ```\n *\n * @remarks\n *\n * This function consumes the input iterator up to the specified index.\n */\nexport function at<const ElementType>(iterable: IterableResolvable<ElementType>, index: number): ElementType | undefined {\n\tindex = assertNotNegative(toIntegerOrInfinityOrThrow(index), index);\n\treturn first(index === 0 ? iterable : drop(iterable, index));\n}\n"]}
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"sources":["../../../src/lib/average.ts"],"names":["map","toNumberOrThrow"],"mappings":";;;;;;;AAuBO,SAAS,QAAQ,QAA+D,EAAA;AACtF,EAAA,IAAI,GAAM,GAAA,CAAA
|
|
1
|
+
{"version":3,"sources":["../../../src/lib/average.ts"],"names":["map","toNumberOrThrow"],"mappings":";;;;;;;AAuBO,SAAS,QAAQ,QAA+D,EAAA;AACtF,EAAA,IAAI,GAAM,GAAA,CAAA;AACV,EAAA,IAAI,KAAQ,GAAA,CAAA;AACZ,EAAA,KAAA,MAAW,KAAS,IAAAA,WAAA,CAAI,QAAU,EAAAC,oCAAe,CAAG,EAAA;AACnD,IAAO,GAAA,IAAA,KAAA;AACP,IAAA,KAAA,EAAA;AAAA;AAGD,EAAO,OAAA,KAAA,KAAU,CAAI,GAAA,IAAA,GAAO,GAAM,GAAA,KAAA;AACnC;AATgB,MAAA,CAAA,OAAA,EAAA,SAAA,CAAA","file":"average.cjs","sourcesContent":["import type { IterableResolvable } from './from';\nimport { map } from './map';\nimport { toNumberOrThrow, type NumberResolvable } from './shared/_toNumberOrThrow';\n\n/**\n * Consumes the iterable and returns the average value of all the elements. If the iterable is empty, it returns `null`.\n *\n * @param iterable The iterator to calculate the average of.\n * @returns The average of the sequence of numbers, or `null` if the sequence is empty or contains only non-number values.\n *\n * @example\n * ```typescript\n * import { average } from '@sapphire/iterator-utilities';\n *\n * const iterable = [1, 2, 3, 4, 5];\n * console.log(average(iterable));\n * // Output: 3\n * ```\n *\n * @remarks\n *\n * This function consumes the entire iterator.\n */\nexport function average(iterable: IterableResolvable<NumberResolvable>): number | null {\n\tlet sum = 0;\n\tlet total = 0;\n\tfor (const value of map(iterable, toNumberOrThrow)) {\n\t\tsum += value;\n\t\ttotal++;\n\t}\n\n\treturn total === 0 ? null : sum / total;\n}\n"]}
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"sources":["../../../src/lib/chain.ts"],"names":["toIterableIterator"],"mappings":";;;;;;AAkBO,UAAU,SAA4B,SAA6E,EAAA;AACzH,EAAA,KAAA,MAAW,YAAY,SAAW,EAAA;AACjC,IAAA,OAAOA,0CAAmB,QAAQ,CAAA
|
|
1
|
+
{"version":3,"sources":["../../../src/lib/chain.ts"],"names":["toIterableIterator"],"mappings":";;;;;;AAkBO,UAAU,SAA4B,SAA6E,EAAA;AACzH,EAAA,KAAA,MAAW,YAAY,SAAW,EAAA;AACjC,IAAA,OAAOA,0CAAmB,QAAQ,CAAA;AAAA;AAEpC;AAJiB,MAAA,CAAA,KAAA,EAAA,OAAA,CAAA","file":"chain.cjs","sourcesContent":["import type { IterableResolvable } from './from';\nimport { toIterableIterator } from './toIterableIterator';\n\n/**\n * Similar to `append`, but takes an iterable of iterables and chains them together.\n *\n * @param iterables The iterators to chain together.\n * @returns An iterator that yields the values of the provided iterators in order.\n *\n * @example\n * ```typescript\n * import { chain } from '@sapphire/iterator-utilities';\n *\n * const iterable = chain([1, 2, 3], [4, 5, 6], [7, 8, 9]);\n * console.log([...iterable]);\n * // Output: [1, 2, 3, 4, 5, 6, 7, 8, 9]\n * ```\n */\nexport function* chain<const ElementType>(...iterables: IterableResolvable<ElementType>[]): IterableIterator<ElementType> {\n\tfor (const iterable of iterables) {\n\t\tyield* toIterableIterator(iterable);\n\t}\n}\n"]}
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"sources":["../../../src/lib/chunk.ts"],"names":["assertPositive","toIntegerOrThrow","toIterableIterator"],"mappings":";;;;;;;;AAoBO,UAAU,KAAA,CAAyB,UAA2C,IAA+C,EAAA;AACnI,EAAA,IAAA,GAAOA,kCAAe,CAAAC,sCAAA,CAAiB,IAAI,CAAA,EAAG,IAAI,CAAA
|
|
1
|
+
{"version":3,"sources":["../../../src/lib/chunk.ts"],"names":["assertPositive","toIntegerOrThrow","toIterableIterator"],"mappings":";;;;;;;;AAoBO,UAAU,KAAA,CAAyB,UAA2C,IAA+C,EAAA;AACnI,EAAA,IAAA,GAAOA,kCAAe,CAAAC,sCAAA,CAAiB,IAAI,CAAA,EAAG,IAAI,CAAA;AAElD,EAAA,IAAI,SAAwB,EAAC;AAC7B,EAAW,KAAA,MAAA,OAAA,IAAWC,yCAAmB,CAAA,QAAQ,CAAG,EAAA;AACnD,IAAA,MAAA,CAAO,KAAK,OAAO,CAAA;AAEnB,IAAI,IAAA,MAAA,CAAO,WAAW,IAAM,EAAA;AAC3B,MAAM,MAAA,MAAA;AACN,MAAA,MAAA,GAAS,EAAC;AAAA;AACX;AAGD,EAAA,IAAI,OAAO,MAAQ,EAAA;AAClB,IAAM,MAAA,MAAA;AAAA;AAER;AAhBiB,MAAA,CAAA,KAAA,EAAA,OAAA,CAAA","file":"chunk.cjs","sourcesContent":["import type { IterableResolvable } from './from';\nimport { assertPositive } from './shared/_assertPositive';\nimport { toIntegerOrThrow } from './shared/_toIntegerOrThrow';\nimport { toIterableIterator } from './toIterableIterator';\n\n/**\n * Chunks the iterable into arrays of at most `size` elements.\n *\n * @param iterable The iterator whose elements to chunk.\n * @param size The maximum size of each chunk.\n *\n * @example\n * ```typescript\n * import { chunk } from '@sapphire/iterator-utilities';\n *\n * const iterable = [1, 2, 3, 4, 5];\n * console.log([...chunk(iterable, 2)]);\n * // Output: [[1, 2], [3, 4], [5]]\n * ```\n */\nexport function* chunk<const ElementType>(iterable: IterableResolvable<ElementType>, size: number): IterableIterator<ElementType[]> {\n\tsize = assertPositive(toIntegerOrThrow(size), size);\n\n\tlet buffer: ElementType[] = [];\n\tfor (const element of toIterableIterator(iterable)) {\n\t\tbuffer.push(element);\n\n\t\tif (buffer.length === size) {\n\t\t\tyield buffer;\n\t\t\tbuffer = [];\n\t\t}\n\t}\n\n\tif (buffer.length) {\n\t\tyield buffer;\n\t}\n}\n"]}
|
|
@@ -0,0 +1,12 @@
|
|
|
1
|
+
'use strict';
|
|
2
|
+
|
|
3
|
+
var toArray_cjs = require('./toArray.cjs');
|
|
4
|
+
|
|
5
|
+
|
|
6
|
+
|
|
7
|
+
Object.defineProperty(exports, "collect", {
|
|
8
|
+
enumerable: true,
|
|
9
|
+
get: function () { return toArray_cjs.toArray; }
|
|
10
|
+
});
|
|
11
|
+
//# sourceMappingURL=collect.cjs.map
|
|
12
|
+
//# sourceMappingURL=collect.cjs.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"sources":[],"names":[],"mappings":"","file":"collect.cjs","sourcesContent":[]}
|
|
@@ -0,0 +1,17 @@
|
|
|
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 collectInto(iterable, output) {
|
|
8
|
+
for (const value of toIterableIterator_cjs.toIterableIterator(iterable)) {
|
|
9
|
+
output.push(value);
|
|
10
|
+
}
|
|
11
|
+
return output;
|
|
12
|
+
}
|
|
13
|
+
__name(collectInto, "collectInto");
|
|
14
|
+
|
|
15
|
+
exports.collectInto = collectInto;
|
|
16
|
+
//# sourceMappingURL=collectInto.cjs.map
|
|
17
|
+
//# sourceMappingURL=collectInto.cjs.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"sources":["../../../src/lib/collectInto.ts"],"names":["toIterableIterator"],"mappings":";;;;;;AA2BO,SAAS,WAAA,CAA+B,UAA2C,MAAsC,EAAA;AAC/H,EAAW,KAAA,MAAA,KAAA,IAASA,yCAAmB,CAAA,QAAQ,CAAG,EAAA;AACjD,IAAA,MAAA,CAAO,KAAK,KAAK,CAAA;AAAA;AAGlB,EAAO,OAAA,MAAA;AACR;AANgB,MAAA,CAAA,WAAA,EAAA,aAAA,CAAA","file":"collectInto.cjs","sourcesContent":["import type { IterableResolvable } from './from';\nimport { toIterableIterator } from './toIterableIterator';\n\n/**\n * Collects all the items from an iterator into an array.\n *\n * This method consumes the iterator and adds all its items to the passed array. The array is then returned, so the call\n * chain can be continued.\n *\n * This is useful when you already have a collection and want to add the iterator items to it.\n *\n * @param iterable An iterator to fuse.\n *\n * @example\n * ```typescript\n * import { collectInto, map } from '@sapphire/iterator-utilities';\n *\n * const iterable = [1, 2, 3];\n * const output = [0, 1];\n *\n * collectInto(map(iterable, (value) => value * 2), output);\n * collectInto(map(iterable, (value) => value * 10), output);\n *\n * console.log(output);\n * // Output: [0, 1, 2, 4, 6, 10, 20, 30]\n * ```\n */\nexport function collectInto<const ElementType>(iterable: IterableResolvable<ElementType>, output: ElementType[]): ElementType[] {\n\tfor (const value of toIterableIterator(iterable)) {\n\t\toutput.push(value);\n\t}\n\n\treturn output;\n}\n"]}
|
|
@@ -0,0 +1,29 @@
|
|
|
1
|
+
import { IterableResolvable } from './from.cjs';
|
|
2
|
+
|
|
3
|
+
/**
|
|
4
|
+
* Collects all the items from an iterator into an array.
|
|
5
|
+
*
|
|
6
|
+
* This method consumes the iterator and adds all its items to the passed array. The array is then returned, so the call
|
|
7
|
+
* chain can be continued.
|
|
8
|
+
*
|
|
9
|
+
* This is useful when you already have a collection and want to add the iterator items to it.
|
|
10
|
+
*
|
|
11
|
+
* @param iterable An iterator to fuse.
|
|
12
|
+
*
|
|
13
|
+
* @example
|
|
14
|
+
* ```typescript
|
|
15
|
+
* import { collectInto, map } from '@sapphire/iterator-utilities';
|
|
16
|
+
*
|
|
17
|
+
* const iterable = [1, 2, 3];
|
|
18
|
+
* const output = [0, 1];
|
|
19
|
+
*
|
|
20
|
+
* collectInto(map(iterable, (value) => value * 2), output);
|
|
21
|
+
* collectInto(map(iterable, (value) => value * 10), output);
|
|
22
|
+
*
|
|
23
|
+
* console.log(output);
|
|
24
|
+
* // Output: [0, 1, 2, 4, 6, 10, 20, 30]
|
|
25
|
+
* ```
|
|
26
|
+
*/
|
|
27
|
+
declare function collectInto<const ElementType>(iterable: IterableResolvable<ElementType>, output: ElementType[]): ElementType[];
|
|
28
|
+
|
|
29
|
+
export { collectInto };
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"sources":["../../../src/lib/compact.ts"],"names":["filter"],"mappings":";;;;;;AAiBO,SAAS,QAA2B,QAA6F,EAAA;AACvI,EAAA,OAAOA,kBAAO,QAAU,EAAA,CAAC,UAAgC,KAAU,KAAA,IAAA,IAAQ,UAAU,KAAS,CAAA,CAAA
|
|
1
|
+
{"version":3,"sources":["../../../src/lib/compact.ts"],"names":["filter"],"mappings":";;;;;;AAiBO,SAAS,QAA2B,QAA6F,EAAA;AACvI,EAAA,OAAOA,kBAAO,QAAU,EAAA,CAAC,UAAgC,KAAU,KAAA,IAAA,IAAQ,UAAU,KAAS,CAAA,CAAA;AAC/F;AAFgB,MAAA,CAAA,OAAA,EAAA,SAAA,CAAA","file":"compact.cjs","sourcesContent":["import { filter } from './filter';\nimport type { IterableResolvable } from './from';\n\n/**\n * Creates a new iterable that yields all the non-nullish values (`null` and `undefined`) from the iterable.\n *\n * @param iterable An iterator that contains elements to be compacted.\n *\n * @example\n * ```typescript\n * import { compact } from '@sapphire/iterator-utilities';\n *\n * const iterable = [1, null, 2, undefined, 3];\n * console.log([...compact(iterable)]);\n * // Output: [1, 2, 3]\n * ```\n */\nexport function compact<const ElementType>(iterable: IterableResolvable<ElementType | null | undefined>): IterableIterator<ElementType> {\n\treturn filter(iterable, (value): value is ElementType => value !== null && value !== undefined);\n}\n"]}
|
|
@@ -0,0 +1,15 @@
|
|
|
1
|
+
'use strict';
|
|
2
|
+
|
|
3
|
+
var compareBy_cjs = require('./compareBy.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 compare(iterable, other) {
|
|
9
|
+
return compareBy_cjs.compareBy(iterable, other, comparators_cjs.defaultCompare);
|
|
10
|
+
}
|
|
11
|
+
__name(compare, "compare");
|
|
12
|
+
|
|
13
|
+
exports.compare = compare;
|
|
14
|
+
//# sourceMappingURL=compare.cjs.map
|
|
15
|
+
//# sourceMappingURL=compare.cjs.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"sources":["../../../src/lib/compare.ts"],"names":["compareBy","defaultCompare"],"mappings":";;;;;;;AA+BO,SAAS,OAAA,CACf,UACA,KAC0B,EAAA;AAC1B,EAAO,OAAAA,uBAAA,CAAU,QAAU,EAAA,KAAA,EAAOC,8BAAc,CAAA;AACjD;AALgB,MAAA,CAAA,OAAA,EAAA,SAAA,CAAA","file":"compare.cjs","sourcesContent":["import { compareBy } from './compareBy';\nimport type { IterableResolvable } from './from';\nimport type { LexicographicComparison } from './shared/_compare';\nimport { defaultCompare } from './shared/comparators';\n\n/**\n * {@link LexicographicComparison Lexicographically} compares the elements of both iterators are equal.\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 compareBy} instead.\n *\n * @param iterable The iterator to compare.\n * @param other The iterator to compare against.\n * @returns Whether the two iterators are equal.\n *\n * @example\n * ```typescript\n * import { compare } from '@sapphire/iterator-utilities';\n *\n * console.log(compare([1], [1]));\n * // Output: 0\n * console.log(compare([1], [1, 2]));\n * // Output: -1\n * console.log(compare([1, 2], [1]));\n * // Output: 1\n * ```\n *\n * @remarks\n *\n * This function consumes the entire iterator.\n */\nexport function compare<const ElementType>(\n\titerable: IterableResolvable<ElementType>,\n\tother: IterableResolvable<ElementType>\n): LexicographicComparison {\n\treturn compareBy(iterable, other, defaultCompare);\n}\n"]}
|