@sapphire/iterator-utilities 1.0.0

package/dist/cjs/index.cjs

@@ -0,0 +1,385 @@
+'use strict';
+
+var append_cjs = require('./lib/append.cjs');
+var at_cjs = require('./lib/at.cjs');
+var average_cjs = require('./lib/average.cjs');
+var chain_cjs = require('./lib/chain.cjs');
+var chunk_cjs = require('./lib/chunk.cjs');
+var compact_cjs = require('./lib/compact.cjs');
+var compress_cjs = require('./lib/compress.cjs');
+var contains_cjs = require('./lib/contains.cjs');
+var count_cjs = require('./lib/count.cjs');
+var cycle_cjs = require('./lib/cycle.cjs');
+var difference_cjs = require('./lib/difference.cjs');
+var drop_cjs = require('./lib/drop.cjs');
+var dropLast_cjs = require('./lib/dropLast.cjs');
+var dropWhile_cjs = require('./lib/dropWhile.cjs');
+var empty_cjs = require('./lib/empty.cjs');
+var enumerate_cjs = require('./lib/enumerate.cjs');
+var every_cjs = require('./lib/every.cjs');
+var filter_cjs = require('./lib/filter.cjs');
+var find_cjs = require('./lib/find.cjs');
+var findIndex_cjs = require('./lib/findIndex.cjs');
+var first_cjs = require('./lib/first.cjs');
+var flat_cjs = require('./lib/flat.cjs');
+var flatMap_cjs = require('./lib/flatMap.cjs');
+var forEach_cjs = require('./lib/forEach.cjs');
+var from_cjs = require('./lib/from.cjs');
+var indexOf_cjs = require('./lib/indexOf.cjs');
+var intersect_cjs = require('./lib/intersect.cjs');
+var isEmpty_cjs = require('./lib/isEmpty.cjs');
+var last_cjs = require('./lib/last.cjs');
+var map_cjs = require('./lib/map.cjs');
+var max_cjs = require('./lib/max.cjs');
+var min_cjs = require('./lib/min.cjs');
+var partition_cjs = require('./lib/partition.cjs');
+var peekable_cjs = require('./lib/peekable.cjs');
+var prepend_cjs = require('./lib/prepend.cjs');
+var product_cjs = require('./lib/product.cjs');
+var range_cjs = require('./lib/range.cjs');
+var reduce_cjs = require('./lib/reduce.cjs');
+var repeat_cjs = require('./lib/repeat.cjs');
+var reverse_cjs = require('./lib/reverse.cjs');
+var slice_cjs = require('./lib/slice.cjs');
+var some_cjs = require('./lib/some.cjs');
+var sorted_cjs = require('./lib/sorted.cjs');
+var starMap_cjs = require('./lib/starMap.cjs');
+var sum_cjs = require('./lib/sum.cjs');
+var take_cjs = require('./lib/take.cjs');
+var takeLast_cjs = require('./lib/takeLast.cjs');
+var tee_cjs = require('./lib/tee.cjs');
+var toArray_cjs = require('./lib/toArray.cjs');
+var toIterableIterator_cjs = require('./lib/toIterableIterator.cjs');
+var union_cjs = require('./lib/union.cjs');
+var unique_cjs = require('./lib/unique.cjs');
+var unzip_cjs = require('./lib/unzip.cjs');
+var zip_cjs = require('./lib/zip.cjs');
+
+
+
+Object.keys(append_cjs).forEach(function (k) {
+	if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
+		enumerable: true,
+		get: function () { return append_cjs[k]; }
+	});
+});
+Object.keys(at_cjs).forEach(function (k) {
+	if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
+		enumerable: true,
+		get: function () { return at_cjs[k]; }
+	});
+});
+Object.keys(average_cjs).forEach(function (k) {
+	if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
+		enumerable: true,
+		get: function () { return average_cjs[k]; }
+	});
+});
+Object.keys(chain_cjs).forEach(function (k) {
+	if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
+		enumerable: true,
+		get: function () { return chain_cjs[k]; }
+	});
+});
+Object.keys(chunk_cjs).forEach(function (k) {
+	if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
+		enumerable: true,
+		get: function () { return chunk_cjs[k]; }
+	});
+});
+Object.keys(compact_cjs).forEach(function (k) {
+	if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
+		enumerable: true,
+		get: function () { return compact_cjs[k]; }
+	});
+});
+Object.keys(compress_cjs).forEach(function (k) {
+	if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
+		enumerable: true,
+		get: function () { return compress_cjs[k]; }
+	});
+});
+Object.keys(contains_cjs).forEach(function (k) {
+	if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
+		enumerable: true,
+		get: function () { return contains_cjs[k]; }
+	});
+});
+Object.keys(count_cjs).forEach(function (k) {
+	if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
+		enumerable: true,
+		get: function () { return count_cjs[k]; }
+	});
+});
+Object.keys(cycle_cjs).forEach(function (k) {
+	if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
+		enumerable: true,
+		get: function () { return cycle_cjs[k]; }
+	});
+});
+Object.keys(difference_cjs).forEach(function (k) {
+	if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
+		enumerable: true,
+		get: function () { return difference_cjs[k]; }
+	});
+});
+Object.keys(drop_cjs).forEach(function (k) {
+	if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
+		enumerable: true,
+		get: function () { return drop_cjs[k]; }
+	});
+});
+Object.keys(dropLast_cjs).forEach(function (k) {
+	if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
+		enumerable: true,
+		get: function () { return dropLast_cjs[k]; }
+	});
+});
+Object.keys(dropWhile_cjs).forEach(function (k) {
+	if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
+		enumerable: true,
+		get: function () { return dropWhile_cjs[k]; }
+	});
+});
+Object.keys(empty_cjs).forEach(function (k) {
+	if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
+		enumerable: true,
+		get: function () { return empty_cjs[k]; }
+	});
+});
+Object.keys(enumerate_cjs).forEach(function (k) {
+	if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
+		enumerable: true,
+		get: function () { return enumerate_cjs[k]; }
+	});
+});
+Object.keys(every_cjs).forEach(function (k) {
+	if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
+		enumerable: true,
+		get: function () { return every_cjs[k]; }
+	});
+});
+Object.keys(filter_cjs).forEach(function (k) {
+	if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
+		enumerable: true,
+		get: function () { return filter_cjs[k]; }
+	});
+});
+Object.keys(find_cjs).forEach(function (k) {
+	if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
+		enumerable: true,
+		get: function () { return find_cjs[k]; }
+	});
+});
+Object.keys(findIndex_cjs).forEach(function (k) {
+	if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
+		enumerable: true,
+		get: function () { return findIndex_cjs[k]; }
+	});
+});
+Object.keys(first_cjs).forEach(function (k) {
+	if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
+		enumerable: true,
+		get: function () { return first_cjs[k]; }
+	});
+});
+Object.keys(flat_cjs).forEach(function (k) {
+	if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
+		enumerable: true,
+		get: function () { return flat_cjs[k]; }
+	});
+});
+Object.keys(flatMap_cjs).forEach(function (k) {
+	if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
+		enumerable: true,
+		get: function () { return flatMap_cjs[k]; }
+	});
+});
+Object.keys(forEach_cjs).forEach(function (k) {
+	if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
+		enumerable: true,
+		get: function () { return forEach_cjs[k]; }
+	});
+});
+Object.keys(from_cjs).forEach(function (k) {
+	if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
+		enumerable: true,
+		get: function () { return from_cjs[k]; }
+	});
+});
+Object.keys(indexOf_cjs).forEach(function (k) {
+	if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
+		enumerable: true,
+		get: function () { return indexOf_cjs[k]; }
+	});
+});
+Object.keys(intersect_cjs).forEach(function (k) {
+	if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
+		enumerable: true,
+		get: function () { return intersect_cjs[k]; }
+	});
+});
+Object.keys(isEmpty_cjs).forEach(function (k) {
+	if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
+		enumerable: true,
+		get: function () { return isEmpty_cjs[k]; }
+	});
+});
+Object.keys(last_cjs).forEach(function (k) {
+	if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
+		enumerable: true,
+		get: function () { return last_cjs[k]; }
+	});
+});
+Object.keys(map_cjs).forEach(function (k) {
+	if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
+		enumerable: true,
+		get: function () { return map_cjs[k]; }
+	});
+});
+Object.keys(max_cjs).forEach(function (k) {
+	if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
+		enumerable: true,
+		get: function () { return max_cjs[k]; }
+	});
+});
+Object.keys(min_cjs).forEach(function (k) {
+	if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
+		enumerable: true,
+		get: function () { return min_cjs[k]; }
+	});
+});
+Object.keys(partition_cjs).forEach(function (k) {
+	if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
+		enumerable: true,
+		get: function () { return partition_cjs[k]; }
+	});
+});
+Object.keys(peekable_cjs).forEach(function (k) {
+	if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
+		enumerable: true,
+		get: function () { return peekable_cjs[k]; }
+	});
+});
+Object.keys(prepend_cjs).forEach(function (k) {
+	if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
+		enumerable: true,
+		get: function () { return prepend_cjs[k]; }
+	});
+});
+Object.keys(product_cjs).forEach(function (k) {
+	if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
+		enumerable: true,
+		get: function () { return product_cjs[k]; }
+	});
+});
+Object.keys(range_cjs).forEach(function (k) {
+	if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
+		enumerable: true,
+		get: function () { return range_cjs[k]; }
+	});
+});
+Object.keys(reduce_cjs).forEach(function (k) {
+	if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
+		enumerable: true,
+		get: function () { return reduce_cjs[k]; }
+	});
+});
+Object.keys(repeat_cjs).forEach(function (k) {
+	if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
+		enumerable: true,
+		get: function () { return repeat_cjs[k]; }
+	});
+});
+Object.keys(reverse_cjs).forEach(function (k) {
+	if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
+		enumerable: true,
+		get: function () { return reverse_cjs[k]; }
+	});
+});
+Object.keys(slice_cjs).forEach(function (k) {
+	if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
+		enumerable: true,
+		get: function () { return slice_cjs[k]; }
+	});
+});
+Object.keys(some_cjs).forEach(function (k) {
+	if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
+		enumerable: true,
+		get: function () { return some_cjs[k]; }
+	});
+});
+Object.keys(sorted_cjs).forEach(function (k) {
+	if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
+		enumerable: true,
+		get: function () { return sorted_cjs[k]; }
+	});
+});
+Object.keys(starMap_cjs).forEach(function (k) {
+	if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
+		enumerable: true,
+		get: function () { return starMap_cjs[k]; }
+	});
+});
+Object.keys(sum_cjs).forEach(function (k) {
+	if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
+		enumerable: true,
+		get: function () { return sum_cjs[k]; }
+	});
+});
+Object.keys(take_cjs).forEach(function (k) {
+	if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
+		enumerable: true,
+		get: function () { return take_cjs[k]; }
+	});
+});
+Object.keys(takeLast_cjs).forEach(function (k) {
+	if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
+		enumerable: true,
+		get: function () { return takeLast_cjs[k]; }
+	});
+});
+Object.keys(tee_cjs).forEach(function (k) {
+	if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
+		enumerable: true,
+		get: function () { return tee_cjs[k]; }
+	});
+});
+Object.keys(toArray_cjs).forEach(function (k) {
+	if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
+		enumerable: true,
+		get: function () { return toArray_cjs[k]; }
+	});
+});
+Object.keys(toIterableIterator_cjs).forEach(function (k) {
+	if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
+		enumerable: true,
+		get: function () { return toIterableIterator_cjs[k]; }
+	});
+});
+Object.keys(union_cjs).forEach(function (k) {
+	if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
+		enumerable: true,
+		get: function () { return union_cjs[k]; }
+	});
+});
+Object.keys(unique_cjs).forEach(function (k) {
+	if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
+		enumerable: true,
+		get: function () { return unique_cjs[k]; }
+	});
+});
+Object.keys(unzip_cjs).forEach(function (k) {
+	if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
+		enumerable: true,
+		get: function () { return unzip_cjs[k]; }
+	});
+});
+Object.keys(zip_cjs).forEach(function (k) {
+	if (k !== 'default' && !Object.prototype.hasOwnProperty.call(exports, k)) Object.defineProperty(exports, k, {
+		enumerable: true,
+		get: function () { return zip_cjs[k]; }
+	});
+});
+//# sourceMappingURL=out.js.map
+//# sourceMappingURL=index.cjs.map

package/dist/cjs/index.cjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../src/index.ts"],"names":[],"mappings":";AAAA,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc","sourcesContent":["export * from './lib/append';\nexport * from './lib/at';\nexport * from './lib/average';\nexport * from './lib/chain';\nexport * from './lib/chunk';\nexport * from './lib/compact';\nexport * from './lib/compress';\nexport * from './lib/contains';\nexport * from './lib/count';\nexport * from './lib/cycle';\nexport * from './lib/difference';\nexport * from './lib/drop';\nexport * from './lib/dropLast';\nexport * from './lib/dropWhile';\nexport * from './lib/empty';\nexport * from './lib/enumerate';\nexport * from './lib/every';\nexport * from './lib/filter';\nexport * from './lib/find';\nexport * from './lib/findIndex';\nexport * from './lib/first';\nexport * from './lib/flat';\nexport * from './lib/flatMap';\nexport * from './lib/forEach';\nexport * from './lib/from';\nexport * from './lib/indexOf';\nexport * from './lib/intersect';\nexport * from './lib/isEmpty';\nexport * from './lib/last';\nexport * from './lib/map';\nexport * from './lib/max';\nexport * from './lib/min';\nexport * from './lib/partition';\nexport * from './lib/peekable';\nexport * from './lib/prepend';\nexport * from './lib/product';\nexport * from './lib/range';\nexport * from './lib/reduce';\nexport * from './lib/repeat';\nexport * from './lib/reverse';\nexport * from './lib/slice';\nexport * from './lib/some';\nexport * from './lib/sorted';\nexport * from './lib/starMap';\nexport * from './lib/sum';\nexport * from './lib/take';\nexport * from './lib/takeLast';\nexport * from './lib/tee';\nexport * from './lib/toArray';\nexport * from './lib/toIterableIterator';\nexport * from './lib/union';\nexport * from './lib/unique';\nexport * from './lib/unzip';\nexport * from './lib/zip';\n"]}

package/dist/cjs/index.d.cts

@@ -0,0 +1,55 @@
+export { concat as append, concat } from './lib/append.cjs';
+export { at } from './lib/at.cjs';
+export { average } from './lib/average.cjs';
+export { chain } from './lib/chain.cjs';
+export { chunk } from './lib/chunk.cjs';
+export { compact } from './lib/compact.cjs';
+export { compress } from './lib/compress.cjs';
+export { contains } from './lib/contains.cjs';
+export { count } from './lib/count.cjs';
+export { cycle } from './lib/cycle.cjs';
+export { except as difference, except, except as omit } from './lib/difference.cjs';
+export { skip as drop, skip } from './lib/drop.cjs';
+export { skipLast as dropLast, skipLast } from './lib/dropLast.cjs';
+export { skipWhile as dropWhile, skipWhile } from './lib/dropWhile.cjs';
+export { empty } from './lib/empty.cjs';
+export { enumerate } from './lib/enumerate.cjs';
+export { every } from './lib/every.cjs';
+export { takeWhile as filter, takeWhile } from './lib/filter.cjs';
+export { find } from './lib/find.cjs';
+export { findIndex } from './lib/findIndex.cjs';
+export { first } from './lib/first.cjs';
+export { flat } from './lib/flat.cjs';
+export { flatMap } from './lib/flatMap.cjs';
+export { forEach } from './lib/forEach.cjs';
+export { IterableResolvable, IterableResolved, from } from './lib/from.cjs';
+export { position as indexOf, position } from './lib/indexOf.cjs';
+export { intersect } from './lib/intersect.cjs';
+export { isEmpty } from './lib/isEmpty.cjs';
+export { last } from './lib/last.cjs';
+export { map } from './lib/map.cjs';
+export { max } from './lib/max.cjs';
+export { min } from './lib/min.cjs';
+export { partition } from './lib/partition.cjs';
+export { Peekable, peekable } from './lib/peekable.cjs';
+export { prepend } from './lib/prepend.cjs';
+export { product } from './lib/product.cjs';
+export { range } from './lib/range.cjs';
+export { reduce } from './lib/reduce.cjs';
+export { repeat } from './lib/repeat.cjs';
+export { reverse } from './lib/reverse.cjs';
+export { slice } from './lib/slice.cjs';
+export { some } from './lib/some.cjs';
+export { sorted } from './lib/sorted.cjs';
+export { StarMapParameters, starMap } from './lib/starMap.cjs';
+export { sum } from './lib/sum.cjs';
+export { take } from './lib/take.cjs';
+export { takeLast } from './lib/takeLast.cjs';
+export { tee } from './lib/tee.cjs';
+export { toArray } from './lib/toArray.cjs';
+export { toIterableIterator } from './lib/toIterableIterator.cjs';
+export { union } from './lib/union.cjs';
+export { unique } from './lib/unique.cjs';
+export { UnzipIterable, unzip } from './lib/unzip.cjs';
+export { ZipIterators, zip } from './lib/zip.cjs';
+import './lib/shared/_toNumberOrThrow.js';

package/dist/cjs/lib/append.cjs

@@ -0,0 +1,15 @@
+'use strict';
+
+var chain_cjs = require('./chain.cjs');
+
+var __defProp = Object.defineProperty;
+var __name = (target, value) => __defProp(target, "name", { value, configurable: true });
+function append(iterable, ...iterables) {
+  return chain_cjs.chain(iterable, ...iterables);
+}
+__name(append, "append");
+
+exports.append = append;
+exports.concat = append;
+//# sourceMappingURL=out.js.map
+//# sourceMappingURL=append.cjs.map

package/dist/cjs/lib/append.cjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../src/lib/append.ts"],"names":[],"mappings":";;;;AAAA,SAAS,aAAa;AAmBf,SAAS,OACf,aACG,WAC6B;AAChC,SAAO,MAAM,UAAU,GAAG,SAAS;AACpC;AALgB","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/append.d.cts

@@ -0,0 +1,21 @@
+import { IterableResolvable } from './from.cjs';
+
+/**
+ * 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]`.
+ *
+ * @param iterable The iterator to append values to.
+ * @param iterables The iterables to append to the iterator.
+ * @returns An iterator that yields the values of the provided iterator followed by the values of the provided iterables.
+ *
+ * @example
+ * ```typescript
+ * import { append } from '@sapphire/iterator-utilities';
+ *
+ * const iterable = append([1, 2, 3], [4, 5, 6], [7, 8, 9]);
+ * console.log([...iterable]);
+ * // Output: [1, 2, 3, 4, 5, 6, 7, 8, 9]
+ * ```
+ */
+declare function append<const ElementType>(iterable: IterableResolvable<ElementType>, ...iterables: IterableResolvable<ElementType>[]): IterableIterator<ElementType>;
+
+export { append, append as concat };

package/dist/cjs/lib/at.cjs

@@ -0,0 +1,18 @@
+'use strict';
+
+var drop_cjs = require('./drop.cjs');
+var first_cjs = require('./first.cjs');
+var _assertNotNegative_cjs = require('./shared/_assertNotNegative.cjs');
+var _toIntegerOrInfinityOrThrow_cjs = require('./shared/_toIntegerOrInfinityOrThrow.cjs');
+
+var __defProp = Object.defineProperty;
+var __name = (target, value) => __defProp(target, "name", { value, configurable: true });
+function at(iterable, index) {
+  index = _assertNotNegative_cjs.assertNotNegative(_toIntegerOrInfinityOrThrow_cjs.toIntegerOrInfinityOrThrow(index), index);
+  return first_cjs.first(index === 0 ? iterable : drop_cjs.drop(iterable, index));
+}
+__name(at, "at");
+
+exports.at = at;
+//# sourceMappingURL=out.js.map
+//# sourceMappingURL=at.cjs.map

package/dist/cjs/lib/at.cjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../src/lib/at.ts"],"names":[],"mappings":";;;;AAAA,SAAS,YAAY;AACrB,SAAS,aAAa;AAEtB,SAAS,yBAAyB;AAClC,SAAS,kCAAkC;AAsBpC,SAAS,GAAsB,UAA2C,OAAwC;AACxH,UAAQ,kBAAkB,2BAA2B,KAAK,GAAG,KAAK;AAClE,SAAO,MAAM,UAAU,IAAI,WAAW,KAAK,UAAU,KAAK,CAAC;AAC5D;AAHgB","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"]}

package/dist/cjs/lib/at.d.cts

@@ -0,0 +1,25 @@
+import { IterableResolvable } from './from.cjs';
+
+/**
+ * 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`.
+ *
+ * @param iterable An iterator to return an element from.
+ * @param index The index of the element to retrieve.
+ * @returns The element at the specified index, or `undefined` if the index is out of range.
+ *
+ * @example
+ * ```typescript
+ * import { at } from '@sapphire/iterator-utilities';
+ *
+ * const iterable = [1, 2, 3, 4, 5];
+ * console.log(at(iterable, 2));
+ * // Output: 3
+ * ```
+ *
+ * @remarks
+ *
+ * This function consumes the input iterator up to the specified index.
+ */
+declare function at<const ElementType>(iterable: IterableResolvable<ElementType>, index: number): ElementType | undefined;
+
+export { at };

package/dist/cjs/lib/average.cjs

@@ -0,0 +1,21 @@
+'use strict';
+
+var map_cjs = require('./map.cjs');
+var _toNumberOrThrow_cjs = require('./shared/_toNumberOrThrow.cjs');
+
+var __defProp = Object.defineProperty;
+var __name = (target, value) => __defProp(target, "name", { value, configurable: true });
+function average(iterable) {
+  let sum = 0;
+  let total = 0;
+  for (const value of map_cjs.map(iterable, _toNumberOrThrow_cjs.toNumberOrThrow)) {
+    sum += value;
+    total++;
+  }
+  return total === 0 ? null : sum / total;
+}
+__name(average, "average");
+
+exports.average = average;
+//# sourceMappingURL=out.js.map
+//# sourceMappingURL=average.cjs.map

package/dist/cjs/lib/average.cjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../src/lib/average.ts"],"names":[],"mappings":";;;;AACA,SAAS,WAAW;AACpB,SAAS,uBAA8C;AAqBhD,SAAS,QAAQ,UAA+D;AACtF,MAAI,MAAM;AACV,MAAI,QAAQ;AACZ,aAAW,SAAS,IAAI,UAAU,eAAe,GAAG;AACnD,WAAO;AACP;AAAA,EACD;AAEA,SAAO,UAAU,IAAI,OAAO,MAAM;AACnC;AATgB","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"]}

package/dist/cjs/lib/average.d.cts

@@ -0,0 +1,25 @@
+import { IterableResolvable } from './from.cjs';
+import { NumberResolvable } from './shared/_toNumberOrThrow.js';
+
+/**
+ * Consumes the iterable and returns the average value of all the elements. If the iterable is empty, it returns `null`.
+ *
+ * @param iterable The iterator to calculate the average of.
+ * @returns The average of the sequence of numbers, or `null` if the sequence is empty or contains only non-number values.
+ *
+ * @example
+ * ```typescript
+ * import { average } from '@sapphire/iterator-utilities';
+ *
+ * const iterable = [1, 2, 3, 4, 5];
+ * console.log(average(iterable));
+ * // Output: 3
+ * ```
+ *
+ * @remarks
+ *
+ * This function consumes the entire iterator.
+ */
+declare function average(iterable: IterableResolvable<NumberResolvable>): number | null;
+
+export { average };

package/dist/cjs/lib/chain.cjs

@@ -0,0 +1,16 @@
+'use strict';
+
+var toIterableIterator_cjs = require('./toIterableIterator.cjs');
+
+var __defProp = Object.defineProperty;
+var __name = (target, value) => __defProp(target, "name", { value, configurable: true });
+function* chain(...iterables) {
+  for (const iterable of iterables) {
+    yield* toIterableIterator_cjs.toIterableIterator(iterable);
+  }
+}
+__name(chain, "chain");
+
+exports.chain = chain;
+//# sourceMappingURL=out.js.map
+//# sourceMappingURL=chain.cjs.map

package/dist/cjs/lib/chain.cjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../src/lib/chain.ts"],"names":[],"mappings":";;;;AACA,SAAS,0BAA0B;AAiB5B,UAAU,SAA4B,WAA6E;AACzH,aAAW,YAAY,WAAW;AACjC,WAAO,mBAAmB,QAAQ;AAAA,EACnC;AACD;AAJiB","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"]}

package/dist/cjs/lib/chain.d.cts

@@ -0,0 +1,20 @@
+import { IterableResolvable } from './from.cjs';
+
+/**
+ * Similar to `append`, but takes an iterable of iterables and chains them together.
+ *
+ * @param iterables The iterators to chain together.
+ * @returns An iterator that yields the values of the provided iterators in order.
+ *
+ * @example
+ * ```typescript
+ * import { chain } from '@sapphire/iterator-utilities';
+ *
+ * const iterable = chain([1, 2, 3], [4, 5, 6], [7, 8, 9]);
+ * console.log([...iterable]);
+ * // Output: [1, 2, 3, 4, 5, 6, 7, 8, 9]
+ * ```
+ */
+declare function chain<const ElementType>(...iterables: IterableResolvable<ElementType>[]): IterableIterator<ElementType>;
+
+export { chain };