itertools 2.0.0-beta1 → 2.1.0

package/README.md

@@ -1,6 +1,5 @@
 [![npm](https://img.shields.io/npm/v/itertools.svg)](https://www.npmjs.com/package/itertools)
 [![Build Status](https://github.com/nvie/itertools.js/workflows/test/badge.svg)](https://github.com/nvie/itertools.js/actions)
-[![Coverage Status](https://img.shields.io/coveralls/nvie/itertools.js/master.svg)](https://coveralls.io/github/nvie/itertools.js?branch=master)
 [![Minified Size](https://badgen.net/bundlephobia/minzip/itertools)](https://bundlephobia.com/result?p=itertools)
 
 A JavaScript port of Python's awesome
@@ -8,7 +7,7 @@ A JavaScript port of Python's awesome
 
 Usage example:
 
-```javascript
+```ts
 >>> import { izip, cycle } from 'itertools';
 >>>
 >>> const xs = [1, 2, 3, 4];
@@ -46,7 +45,7 @@ The rationale for this flipping of argument order is because in practice, the
 function bodies can span multiple lines, in which case the following block will
 remaing aesthetically pleasing:
 
-```javascript
+```ts
 import { map } from 'itertools';
 
 const numbers = [1, 2, 3];
@@ -73,8 +72,8 @@ The `itertools` package consists of a few building blocks:
 
 ### Ports of builtins
 
-* [all](#all)
-* [any](#any)
+* [every](#every)
+* [some](#some)
 * [contains](#contains)
 * [enumerate](#enumerate)
 * [filter](#filter)
@@ -84,65 +83,64 @@ The `itertools` package consists of a few building blocks:
 * [min](#min)
 * [range](#range)
 * [reduce](#reduce)
-* [reduce\_](#reduce_)
 * [sorted](#sorted)
 * [sum](#sum)
 * [zip](#zip)
 * [zip3](#zip3)
 
-<a name="all" href="#all">#</a> <b>all</b>(iterable: <i>Iterable&lt;T&gt;</i>, keyFn?: <i>Predicate&lt;T&gt;</i>): <i>boolean</i> [&lt;&gt;](https://github.com/nvie/itertools.js/blob/master/src/builtins.js "Source")
+<a name="every" href="#every">#</a> <b>every</b>(iterable: <i>Iterable&lt;T&gt;</i>, keyFn?: <i>Predicate&lt;T&gt;</i>): <i>boolean</i> [&lt;&gt;](https://github.com/nvie/itertools.js/blob/master/src/builtins.js "Source")
 
-Returns true when all of the items in iterable are truthy.  An optional key
+Returns true when every of the items in iterable are truthy.  An optional key
 function can be used to define what truthiness means for this specific
 collection.
 
 Examples:
 
-```javascript
-all([])                           // => true
-all([0])                          // => false
-all([0, 1, 2])                    // => false
-all([1, 2, 3])                    // => true
+```ts
+every([])                           // => true
+every([0])                          // => false
+every([0, 1, 2])                    // => false
+every([1, 2, 3])                    // => true
 ```
 
 Examples with using a key function:
 
-```javascript
-all([2, 4, 6], n => n % 2 === 0)  // => true
-all([2, 4, 5], n => n % 2 === 0)  // => false
+```ts
+every([2, 4, 6], n => n % 2 === 0)  // => true
+every([2, 4, 5], n => n % 2 === 0)  // => false
 ```
 
 
-<a name="any" href="#any">#</a> <b>any</b>(iterable: <i>Iterable&lt;T&gt;</i>, keyFn?: <i>Predicate&lt;T&gt;</i>): <i>boolean</i> [&lt;&gt;](https://github.com/nvie/itertools.js/blob/master/src/builtins.js "Source")
+<a name="some" href="#some">#</a> <b>some</b>(iterable: <i>Iterable&lt;T&gt;</i>, keyFn?: <i>Predicate&lt;T&gt;</i>): <i>boolean</i> [&lt;&gt;](https://github.com/nvie/itertools.js/blob/master/src/builtins.js "Source")
 
-Returns true when any of the items in iterable are truthy.  An optional key
+Returns true when some of the items in iterable are truthy.  An optional key
 function can be used to define what truthiness means for this specific
 collection.
 
 Examples:
 
-```javascript
-any([])                           // => false
-any([0])                          // => false
-any([0, 1, null, undefined])      // => true
+```ts
+some([])                           // => false
+some([0])                          // => false
+some([0, 1, null, undefined])      // => true
 ```
 
 Examples with using a key function:
 
-```javascript
-any([1, 4, 5], n => n % 2 === 0)  // => true
-any([{name: 'Bob'}, {name: 'Alice'}], person => person.name.startsWith('C'))  // => false
+```ts
+some([1, 4, 5], n => n % 2 === 0)  // => true
+some([{name: 'Bob'}, {name: 'Alice'}], person => person.name.startsWith('C'))  // => false
 ```
 
 
 <a name="contains" href="#contains">#</a> <b>contains</b>(haystack: <i>Iterable&lt;T&gt;</i>, needle: <i>T</i>): <i>boolean</i> [&lt;&gt;](https://github.com/nvie/itertools.js/blob/master/src/builtins.js "Source")
 
-Returns true when any of the items in the iterable are equal to the target
+Returns true when some of the items in the iterable are equal to the target
 object.
 
 Examples:
 
-```javascript
+```ts
 contains([], 'whatever')         // => false
 contains([3], 42)                // => false
 contains([3], 3)                 // => true
@@ -159,7 +157,7 @@ the values obtained from iterating over given iterable.
 
 Example:
 
-```javascript
+```ts
 import { enumerate } from 'itertools';
 
 console.log([...enumerate(['hello', 'world'])]);
@@ -210,7 +208,7 @@ If multiple items are minimal, the function returns either one of them, but
 which one is not defined.
 
 
-<a name="range" href="#range">#</a> <b>range</b>(start: <i>number</i>): <i>Iterable&lt;number&gt;</i> [&lt;&gt;](https://github.com/nvie/itertools.js/blob/master/src/builtins.js "Source")<br />
+<a name="range" href="#range">#</a> <b>range</b>(stop: <i>number</i>): <i>Iterable&lt;number&gt;</i> [&lt;&gt;](https://github.com/nvie/itertools.js/blob/master/src/builtins.js "Source")<br />
 <a name="range" href="#range">#</a> <b>range</b>(start: <i>number</i>, stop: <i>number</i>, step: <i>number</i> = 1): <i>Iterable&lt;number&gt;</i> [&lt;&gt;](https://github.com/nvie/itertools.js/blob/master/src/builtins.js "Source")
 
 Returns an iterator producing all the numbers in the given range one by one,
@@ -238,27 +236,39 @@ meet the value constraint.
 
 
 <a name="reduce" href="#reduce">#</a> <b>reduce</b>(iterable: <i>Iterable&lt;T&gt;</i>, reducer: <i>(O, T, number) =&gt; O</i>, start: <i>O</i>): <i>O</i> [&lt;&gt;](https://github.com/nvie/itertools.js/blob/master/src/builtins.js "Source")<br />
-<a name="reduce_" href="#reduce_">#</a> <b>reduce\_</b>(iterable: <i>Iterable&lt;T&gt;</i>, reducer: <i>(T, T, number) =&gt; T</i>): <i>Maybe&lt;T&gt;</i> [&lt;&gt;](https://github.com/nvie/itertools.js/blob/master/src/builtins.js "Source")
+<a name="reduce" href="#reduce">#</a> <b>reduce</b>(iterable: <i>Iterable&lt;T&gt;</i>, reducer: <i>(T, T, number) =&gt; T</i>): <i>Maybe&lt;T&gt;</i> [&lt;&gt;](https://github.com/nvie/itertools.js/blob/master/src/builtins.js "Source")
 
 Apply function of two arguments cumulatively to the items of sequence, from
 left to right, so as to reduce the sequence to a single value.  For example:
 
-    reduce([1, 2, 3, 4, 5], (x, y) => x + y, 0)
+```ts
+reduce(
+  [1, 2, 3, 4, 5],
+  (total, x) => total + x,
+  0
+)
+```
 
 calculates
 
     (((((0+1)+2)+3)+4)+5)
 
-The left argument, `x`, is the accumulated value and the right argument, `y`,
-is the update value from the sequence.
+The left argument, `total`, is the accumulated value and the right argument,
+`x`, is the update value from the sequence.
+
+Without an explicit initializer arg:
+
+```ts
+reduce(
+  [1, 2, 3, 4, 5],
+  (total, x) => total + x
+)
+```
+
+it calculates
+
+    ((((1+2)+3)+4)+5)
 
-**Difference between `reduce()` and `reduce\_()`**:  `reduce()` requires an
-explicit initializer, whereas `reduce_()` will automatically use the first item
-in the given iterable as the initializer.  When using `reduce()`, the
-initializer value is placed before the items of the sequence in the
-calculation, and serves as a default when the sequence is empty.  When using
-`reduce_()`, and the given iterable is empty, then no default value can be
-derived and `undefined` will be returned.
 
 
 <a name="sorted" href="#sorted">#</a> <b>sorted</b>(iterable: <i>Iterable&lt;T&gt;</i>, keyFn?: <i>T =&gt; Primitive</i></i>, reverse?: <i>boolean</i>): <i>Array&lt;T&gt;</i> [&lt;&gt;](https://github.com/nvie/itertools.js/blob/master/src/builtins.js "Source")
@@ -573,6 +583,7 @@ Yields elements in order, ignoring serial duplicates.
 
 * [compact](#compact)
 * [compactObject](#compactObject)
+* [find](#find)
 * [first](#first)
 * [flatmap](#flatmap)
 * [icompact](#icompact)
@@ -592,13 +603,22 @@ Removes all undefined values from the given object.  Returns a new object.
     { a: 1, c: 0, d: null }
 
 
-<a name="first" href="#first">#</a> <b>first</b>(iterable: <i>Iterable&lt;T&gt;</i>, keyFn?: <i>Predicate&lt;T&gt;</i>): <i>Maybe&lt;T&gt;</i> [&lt;&gt;](https://github.com/nvie/itertools.js/blob/master/src/custom.js "Source")
+<a name="find" href="#find">#</a> <b>find</b>(iterable: <i>Iterable&lt;T&gt;</i>, keyFn?: <i>Predicate&lt;T&gt;</i>): <i>Maybe&lt;T&gt;</i> [&lt;&gt;](https://github.com/nvie/itertools.js/blob/master/src/custom.js "Source")
 
 Returns the first item in the iterable for which the predicate holds, if any.
 If no such item exists, `undefined` is returned.  The default predicate is any
 defined value.
 
 
+<a name="first" href="#first">#</a> <b>first</b>(iterable: <i>Iterable&lt;T&gt;</i>, keyFn?: <i>Predicate&lt;T&gt;</i>): <i>Maybe&lt;T&gt;</i> [&lt;&gt;](https://github.com/nvie/itertools.js/blob/master/src/custom.js "Source")
+
+Almost the same as `find()`, except when no explicit predicate function is
+given. `find()` will always return the first value in the iterable, whereas
+`first()` will return the first non-undefined value in the iterable.
+
+Prefer using `find()`, as its behavior is more intuitive and predictable.
+
+
 <a name="flatmap" href="#flatmap">#</a> <b>flatmap</b>(iterable: <i>Iterable&lt;T&gt;</i>, mapper: <i>T =&gt; Iterable&lt;S&gt;</i>): <i>Iterable&lt;S&gt;</i> [&lt;&gt;](https://github.com/nvie/itertools.js/blob/master/src/custom.js "Source")
 
 Returns 0 or more values for every value in the given iterable.  Technically,

package/dist/index.d.ts

@@ -19,7 +19,7 @@ declare type Primitive = string | number | boolean;
  *     all([2, 4, 5], n => n % 2 === 0)  // => false
  *
  */
-declare function all<T>(iterable: Iterable<T>, keyFn?: Predicate<T>): boolean;
+declare function every<T>(iterable: Iterable<T>, keyFn?: Predicate<T>): boolean;
 /**
  * Returns true when any of the items in iterable are truthy.  An optional key
  * function can be used to define what truthiness means for this specific
@@ -37,7 +37,15 @@ declare function all<T>(iterable: Iterable<T>, keyFn?: Predicate<T>): boolean;
  *     any([{name: 'Bob'}, {name: 'Alice'}], person => person.name.startsWith('C'))  // => false
  *
  */
-declare function any<T>(iterable: Iterable<T>, keyFn?: Predicate<T>): boolean;
+declare function some<T>(iterable: Iterable<T>, keyFn?: Predicate<T>): boolean;
+/**
+ * Alias of `every()`.
+ */
+declare const all: typeof every;
+/**
+ * Alias of `some()`.
+ */
+declare const any: typeof some;
 /**
  * Returns true when any of the items in the iterable are equal to the target object.
  *
@@ -67,6 +75,7 @@ declare function enumerate<T>(iterable: Iterable<T>, start?: number): Iterable<[
 /**
  * Non-lazy version of ifilter().
  */
+declare function filter<T, N extends T>(iterable: Iterable<T>, predicate: (item: T) => item is N): N[];
 declare function filter<T>(iterable: Iterable<T>, predicate: Predicate<T>): T[];
 /**
  * Returns an iterator object for the given iterable.  This can be used to
@@ -127,7 +136,8 @@ declare function min<T>(iterable: Iterable<T>, keyFn?: (item: T) => number): T |
  * The produced range will be empty if the first value to produce already does
  * not meet the value constraint.
  */
-declare function range(a: number, ...rest: number[]): Iterable<number>;
+declare function range(stop: number): Iterable<number>;
+declare function range(start: number, stop: number, step?: number): Iterable<number>;
 /**
  * Apply function of two arguments cumulatively to the items of sequence, from
  * left to right, so as to reduce the sequence to a single value.  For example:
@@ -149,6 +159,7 @@ declare function range(a: number, ...rest: number[]): Iterable<number>;
  * `reduce_()`, and the given iterable is empty, then no default value can be
  * derived and `undefined` will be returned.
  */
+declare function reduce<T>(iterable: Iterable<T>, reducer: (agg: T, item: T, index: number) => T): T | undefined;
 declare function reduce<T, O>(iterable: Iterable<T>, reducer: (agg: O, item: T, index: number) => O, start: O): O;
 /**
  * Return a new sorted list from the items in iterable.
@@ -219,6 +230,7 @@ declare function icompress<T>(data: Iterable<T>, selectors: Iterable<boolean>):
  * Returns an iterator that filters elements from iterable returning only those
  * for which the predicate is true.
  */
+declare function ifilter<T, N extends T>(iterable: Iterable<T>, predicate: (item: T) => item is N): Iterable<N>;
 declare function ifilter<T>(iterable: Iterable<T>, predicate: Predicate<T>): Iterable<T>;
 /**
  * Returns an iterator that computes the given mapper function using arguments
@@ -337,6 +349,7 @@ declare function pairwise<T>(iterable: Iterable<T>): Iterable<[T, T]>;
  *     [0, 2, 4, 6, 8]
  *
  */
+declare function partition<T, N extends T>(iterable: Iterable<T>, predicate: (item: T) => item is N): [N[], Exclude<T, N>[]];
 declare function partition<T>(iterable: Iterable<T>, predicate: Predicate<T>): [T[], T[]];
 /**
  * Yields the next item from each iterable in turn, alternating between them.
@@ -404,16 +417,14 @@ declare function compact<T>(iterable: Iterable<T | null | undefined>): T[];
 declare function compactObject<K extends string, V>(obj: Record<K, V | null | undefined>): Record<K, V>;
 /**
  * Returns the first item in the iterable for which the predicate holds, if
- * any.  If no such item exists, `undefined` is returned.  The default
- * predicate is any defined value.
+ * any. If no predicate is given, it will return the first value returned by
+ * the iterable.
  */
 declare function find<T>(iterable: Iterable<T>, keyFn?: Predicate<T>): T | undefined;
 /**
- * Returns the first item in the iterable for which the predicate holds, if
- * any.  If no such item exists, `undefined` is returned.  The default
- * predicate is any defined value.
+ * Almost an alias of find(). The key difference is that if an empty
  */
-declare const first: typeof find;
+declare function first<T>(iterable: Iterable<T>, keyFn?: Predicate<T>): T | undefined;
 /**
  * Returns 0 or more values for every value in the given iterable.
  * Technically, it's just calling map(), followed by flatten(), but it's a very
@@ -430,4 +441,4 @@ declare const first: typeof find;
  */
 declare function flatmap<T, S>(iterable: Iterable<T>, mapper: (item: T) => Iterable<S>): Iterable<S>;
 
-export { Predicate, Primitive, all, any, chain, chunked, compact, compactObject, compress, contains, count, cycle, dropwhile, enumerate, filter, first, flatmap, flatten, groupby, heads, icompact, icompress, ifilter, imap, islice, itake, iter, izip, izip2, izip3, izipLongest, izipMany, map, max, min, pairwise, partition, permutations, range, reduce, roundrobin, sorted, sum, take, takewhile, uniqueEverseen, uniqueJustseen, zip, zip3, zipLongest, zipMany };
+export { Predicate, Primitive, all, any, chain, chunked, compact, compactObject, compress, contains, count, cycle, dropwhile, enumerate, every, filter, find, first, flatmap, flatten, groupby, heads, icompact, icompress, ifilter, imap, islice, itake, iter, izip, izip2, izip3, izipLongest, izipMany, map, max, min, pairwise, partition, permutations, range, reduce, roundrobin, some, sorted, sum, take, takewhile, uniqueEverseen, uniqueJustseen, zip, zip3, zipLongest, zipMany };

package/dist/index.js

@@ -1,2 +1,4 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});function V(e){return(r,t)=>{let n=e(r),o=e(t);return typeof n=="boolean"&&typeof o=="boolean"?n===o?0:!n&&o?-1:1:typeof n=="number"&&typeof o=="number"?n-o:typeof n=="string"&&typeof o=="string"?n===o?0:n<o?-1:1:-1}}function y(e){return!!e}function x(e){if(typeof e!="number")throw new Error("Inputs must be numbers");return e}function s(e){if(typeof e!="string"&&typeof e!="number"&&typeof e!="boolean")throw new Error("Please provide a key function that can establish object identity");return e}function*J(e,r){let t=a(e),n=t.next();if(n.done)return;let o=[n.value];for(let i of t)o.push(i),o.length===r&&(yield o,o=[]);o.length>0&&(yield o)}function*T(e){for(let r of e)for(let t of r)yield t}function*K(e,r){let t=a(r),n=e;for(;n-- >0;){let o=t.next();if(!o.done)yield o.value;else return}}function*N(e){let r=a(e),t=r.next();if(t.done)return;let n=t.value;for(let o of r)yield[n,o],n=o}function B(e,r){let t=[],n=[];for(let o of e)r(o)?t.push(o):n.push(o);return[t,n]}function*H(...e){let r=m(e,a);for(;r.length>0;){let t=0;for(;t<r.length;){let o=r[t].next();o.done?r.splice(t,1):(yield o.value,t++)}}}function*Q(...e){let r=m(e,a);for(;r.length>0;){let t=0,n=[];for(;t<r.length;){let i=r[t].next();i.done?r.splice(t,1):(n.push(i.value),t++)}n.length>0&&(yield n)}}function U(e,r){return Array.from(K(e,r))}function*W(e,r=s){let t=new Set;for(let n of e){let o=r(n);t.has(o)||(t.add(o),yield n)}}function*X(e,r=s){let t;for(let n of e){let o=r(n);o!==t&&(yield n,t=o)}}var E=Symbol();function L(e,r){return t=>e(t)&&r(t)}function Y(e,r,t){if(e<0)throw new Error("start cannot be negative");if(r!==null&&r<0)throw new Error("stop cannot be negative");if(t<0)throw new Error("step cannot be negative");let n=e,o=r;o===void 0&&([n,o]=[0,n]);let i=l=>l>=n;if(o!==null){let l=o;i=L(i,u=>u<l)}return t>1&&(i=L(i,l=>(l-n)%t===0)),i}function Z(...e){return T(e)}function*v(e=0,r=1){let t=e;for(;;)yield t,t+=r}function $(e,r){return Array.from(_(e,r))}function*F(e){let r=[];for(let t of e)yield t,r.push(t);for(;r.length>0;)for(let t of r)yield t}function*ee(e,r){let t=a(e);for(let n of t)if(!r(n)){yield n;break}for(let n of t)yield n}function*te(e,r=s){let t=a(e),n,o=E,i=o,l=function*(c){for(;o===c;){yield n;let f=t.next();if(f.done)return;n=f.value,o=r(n)}};for(;;){for(;o===i;){let u=t.next();if(u.done){o=E;return}n=u.value,o=r(n)}i=o,yield[o,l(i)]}}function*_(e,r){for(let[t,n]of d(e,r))n&&(yield t)}function*h(e,r){for(let t of e)r(t)&&(yield t)}function*b(e,r){for(let t of e)yield r(t)}function*re(e,r,t,n=1){let o,i;t!==void 0?(o=r,i=t):(o=0,i=r);let l=Y(o,i,n);for(let[u,c]of I(e))l(u)&&(yield c)}function*O(e,r){let t=a(e),n=a(r);for(;;){let o=t.next(),i=n.next();if(!o.done&&!i.done)yield[o.value,i.value];else return}}function*g(e,r,t){let n=a(e),o=a(r),i=a(t);for(;;){let l=n.next(),u=o.next(),c=i.next();if(!l.done&&!u.done&&!c.done)yield[l.value,u.value,c.value];else return}}var d=O;function*S(e,r,t){let n=t,o=a(e),i=a(r);for(;;){let l=o.next(),u=i.next();if(l.done&&u.done)return;yield[l.done?n:l.value,u.done?n:u.value]}}function*j(...e){let r=e.map(a);for(;;){let t=r.map(n=>n.next());if(P(t,n=>!n.done))yield t.map(n=>n.value);else return}}function*ne(e,r){let t=Array.from(e),n=t.length,o=r===void 0?n:r;if(o>n)return;let i=Array.from(p(n)),l=Array.from(p(n,n-o,-1)),u=c=>t[c];for(yield i.slice(0,o).map(u);n>0;){let c=!0;for(let f of p(o-1,-1,-1))if(l[f]-=1,l[f]===0)i=i.slice(0,f).concat(i.slice(f+1)).concat(i.slice(f,f+1)),l[f]=n-f;else{let D=l[f],[R,G]=[i[i.length-D],i[f]];i[f]=R,i[i.length-D]=G,yield i.slice(0,o).map(u),c=!1;break}if(c)return}}function*w(e,r){for(let t of e){if(!r(t))return;yield t}}function oe(e,r,t){return Array.from(S(e,r,t))}var ie=S,le= exports.zipLongest =oe;function ae(...e){return Array.from(j(...e))}function ue(e){return e!==void 0}function*q(e){for(let r of e)r!=null&&(yield r)}function fe(e){return Array.from(q(e))}function ce(e){let r={};for(let[t,n]of Object.entries(e)){let o=n;o!=null&&(r[t]=o)}return r}function se(e,r){let t=r||ue;for(let n of e)if(t(n))return n}var z=se;function Te(e,r){return T(b(e,r))}function P(e,r=y){for(let t of e)if(!r(t))return!1;return!0}function C(e,r=y){for(let t of e)if(r(t))return!0;return!1}function pe(e,r){return C(e,t=>t===r)}function*I(e,r=0){let t=r;for(let n of e)yield[t++,n]}function be(e,r){return Array.from(h(e,r))}function a(e){return e[Symbol.iterator]()}function m(e,r){return Array.from(b(e,r))}function me(e,r=x){return M(e,(t,n)=>r(t)>r(n)?t:n)}function de(e,r=x){return M(e,(t,n)=>r(t)<r(n)?t:n)}function A(e,r,t){let n=v(e,t),o=t>=0?i=>i<r:i=>i>r;return w(n,o)}function p(e,...r){let t=[e,...r];switch(t.length){case 1:return A(0,t[0],1);case 2:return A(t[0],t[1],1);case 3:return A(t[0],t[1],t[2]);default:throw new Error("invalid number of arguments")}}function k(e,r,t){let n=a(e),o=t;for(let[i,l]of I(n))o=r(o,l,i);return o}function M(e,r){let t=a(e),n=z(t);if(n!==void 0)return k(t,r,n)}function Ie(e,r=s,t=!1){let n=Array.from(e);return n.sort(V(r)),t&&n.reverse(),n}function ye(e){return k(e,(r,t)=>r+t,0)}function xe(e,r){return Array.from(d(e,r))}function ve(e,r,t){return Array.from(g(e,r,t))}exports.all = P; exports.any = C; exports.chain = Z; exports.chunked = J; exports.compact = fe; exports.compactObject = ce; exports.compress = $; exports.contains = pe; exports.count = v; exports.cycle = F; exports.dropwhile = ee; exports.enumerate = I; exports.filter = be; exports.first = z; exports.flatmap = Te; exports.flatten = T; exports.groupby = te; exports.heads = Q; exports.icompact = q; exports.icompress = _; exports.ifilter = h; exports.imap = b; exports.islice = re; exports.itake = K; exports.iter = a; exports.izip = d; exports.izip2 = O; exports.izip3 = g; exports.izipLongest = ie; exports.izipMany = j; exports.map = m; exports.max = me; exports.min = de; exports.pairwise = N; exports.partition = B; exports.permutations = ne; exports.range = p; exports.reduce = k; exports.roundrobin = H; exports.sorted = Ie; exports.sum = ye; exports.take = U; exports.takewhile = w; exports.uniqueEverseen = W; exports.uniqueJustseen = X; exports.zip = xe; exports.zip3 = ve; exports.zipLongest = le; exports.zipMany = ae;
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});function k(t){return(e,r)=>{let n=t(e),i=t(r);return typeof n=="boolean"&&typeof i=="boolean"?n===i?0:!n&&i?-1:1:typeof n=="number"&&typeof i=="number"?n-i:typeof n=="string"&&typeof i=="string"?n===i?0:n<i?-1:1:-1}}function I(t){return!!t}function x(t){if(typeof t!="number")throw new Error("Inputs must be numbers");return t}function T(t){if(typeof t!="string"&&typeof t!="number"&&typeof t!="boolean")throw new Error("Please provide a key function that can establish object identity");return t}function*Q(t,e){if(e<1)throw new Error(`Invalid chunk size: ${e}`);let r=a(t);for(;;){let n=V(e,r);if(n.length>0&&(yield n),n.length<e)return}}function*s(t){for(let e of t)for(let r of e)yield r}function*O(t,e){let r=a(e),n=t;for(;n-- >0;){let i=r.next();if(!i.done)yield i.value;else return}}function*U(t){let e=a(t),r=e.next();if(r.done)return;let n=r.value;for(let i of e)yield[n,i],n=i}function W(t,e){let r=[],n=[];for(let i of t)e(i)?r.push(i):n.push(i);return[r,n]}function*X(...t){let e=m(t,a);for(;e.length>0;){let r=0;for(;r<e.length;){let i=e[r].next();i.done?e.splice(r,1):(yield i.value,r++)}}}function*Y(...t){let e=m(t,a);for(;e.length>0;){let r=0,n=[];for(;r<e.length;){let o=e[r].next();o.done?e.splice(r,1):(n.push(o.value),r++)}n.length>0&&(yield n)}}function V(t,e){return Array.from(O(t,e))}function*Z(t,e=T){let r=new Set;for(let n of t){let i=e(n);r.has(i)||(r.add(i),yield n)}}function*F(t,e=T){let r;for(let n of t){let i=e(n);i!==r&&(yield n,r=i)}}var K=Symbol();function E(t,e){return r=>t(r)&&e(r)}function ee(t,e,r){if(t<0)throw new Error("start cannot be negative");if(e!==null&&e<0)throw new Error("stop cannot be negative");if(r<0)throw new Error("step cannot be negative");let n=i=>i>=t;if(e!==null){let i=e;n=E(n,o=>o<i)}return r>1&&(n=E(n,i=>(i-t)%r===0)),n}function te(...t){return s(t)}function*y(t=0,e=1){let r=t;for(;;)yield r,r+=e}function re(t,e){return Array.from(N(t,e))}function*ne(t){let e=[];for(let r of t)yield r,e.push(r);for(;e.length>0;)for(let r of e)yield r}function*ie(t,e){let r=a(t);for(let n of r)if(!e(n)){yield n;break}for(let n of r)yield n}function*oe(t,e=T){let r=a(t),n,i=K,o=i,l=function*(c){for(;i===c;){yield n;let f=r.next();if(f.done)return;n=f.value,i=e(n)}};for(;;){for(;i===o;){let u=r.next();if(u.done){i=K;return}n=u.value,i=e(n)}o=i,yield[i,l(o)]}}function*N(t,e){for(let[r,n]of d(t,e))n&&(yield r)}function*v(t,e){for(let r of t)e(r)&&(yield r)}function*p(t,e){for(let r of t)yield e(r)}function*ae(t,e,r,n=1){let i,o;r!==void 0?(i=e,o=r):(i=0,o=e);let l=ee(i,o,n);for(let[u,c]of w(t))l(u)&&(yield c)}function*L(t,e){let r=a(t),n=a(e);for(;;){let i=r.next(),o=n.next();if(!i.done&&!o.done)yield[i.value,o.value];else return}}function*g(t,e,r){let n=a(t),i=a(e),o=a(r);for(;;){let l=n.next(),u=i.next(),c=o.next();if(!l.done&&!u.done&&!c.done)yield[l.value,u.value,c.value];else return}}var d=L;function*j(t,e,r){let n=r,i=a(t),o=a(e);for(;;){let l=i.next(),u=o.next();if(l.done&&u.done)return;yield[l.done?n:l.value,u.done?n:u.value]}}function*q(...t){let e=t.map(a);for(;;){let r=e.map(n=>n.next());if(P(r,n=>!n.done))yield r.map(n=>n.value);else return}}function*le(t,e){let r=Array.from(t),n=r.length,i=e===void 0?n:e;if(i>n)return;let o=Array.from(b(n)),l=Array.from(b(n,n-i,-1)),u=c=>r[c];for(yield o.slice(0,i).map(u);n>0;){let c=!0;for(let f of b(i-1,-1,-1))if(l[f]-=1,l[f]===0)o=o.slice(0,f).concat(o.slice(f+1)).concat(o.slice(f,f+1)),l[f]=n-f;else{let D=l[f],[B,H]=[o[o.length-D],o[f]];o[f]=B,o[o.length-D]=H,yield o.slice(0,i).map(u),c=!1;break}if(c)return}}function*h(t,e){for(let r of t){if(!e(r))return;yield r}}function ue(t,e,r){return Array.from(j(t,e,r))}var fe=j,ce= exports.zipLongest =ue;function Te(...t){return Array.from(q(...t))}function se(t){return t!==void 0}function*_(t){for(let e of t)e!=null&&(yield e)}function be(t){return Array.from(_(t))}function pe(t){let e={};for(let[r,n]of Object.entries(t)){let i=n;i!=null&&(e[r]=i)}return e}function C(t,e){if(e===void 0){for(let r of t)return r;return}else{for(let r of t)if(e(r))return r;return}}function z(t,e){return C(t,e!=null?e:se)}function me(t,e){return s(p(t,e))}function R(t,e=I){for(let r of t)if(!e(r))return!1;return!0}function S(t,e=I){for(let r of t)if(e(r))return!0;return!1}var P=R,G= exports.any =S;function de(t,e){return G(t,r=>r===e)}function*w(t,e=0){let r=e;for(let n of t)yield[r++,n]}function Ie(t,e){return Array.from(v(t,e))}function a(t){return t[Symbol.iterator]()}function m(t,e){return Array.from(p(t,e))}function xe(t,e=x){return A(t,(r,n)=>e(r)>e(n)?r:n)}function ye(t,e=x){return A(t,(r,n)=>e(r)<e(n)?r:n)}function M(t,e,r){let n=y(t,r),i=r>=0?o=>o<e:o=>o>e;return h(n,i)}function b(t,e,r=1){return e!==void 0?M(t,e,r):M(0,t,r)}function J(t,e,r){return r===void 0?A(t,e):$(t,e,r)}function $(t,e,r){let n=r,i=0;for(let o of t)n=e(n,o,i++);return n}function A(t,e){let r=a(t),n=z(r);if(n!==void 0)return $(r,e,n)}function ve(t,e=T,r=!1){let n=Array.from(t);return n.sort(k(e)),r&&n.reverse(),n}function ge(t){return J(t,(e,r)=>e+r,0)}function he(t,e){return Array.from(d(t,e))}function Pe(t,e,r){return Array.from(g(t,e,r))}exports.all = P; exports.any = G; exports.chain = te; exports.chunked = Q; exports.compact = be; exports.compactObject = pe; exports.compress = re; exports.contains = de; exports.count = y; exports.cycle = ne; exports.dropwhile = ie; exports.enumerate = w; exports.every = R; exports.filter = Ie; exports.find = C; exports.first = z; exports.flatmap = me; exports.flatten = s; exports.groupby = oe; exports.heads = Y; exports.icompact = _; exports.icompress = N; exports.ifilter = v; exports.imap = p; exports.islice = ae; exports.itake = O; exports.iter = a; exports.izip = d; exports.izip2 = L; exports.izip3 = g; exports.izipLongest = fe; exports.izipMany = q; exports.map = m; exports.max = xe; exports.min = ye; exports.pairwise = U; exports.partition = W; exports.permutations = le; exports.range = b; exports.reduce = J; exports.roundrobin = X; exports.some = S; exports.sorted = ve; exports.sum = ge; exports.take = V; exports.takewhile = h; exports.uniqueEverseen = Z; exports.uniqueJustseen = F; exports.zip = he; exports.zip3 = Pe; exports.zipLongest = ce; exports.zipMany = Te;
+// istanbul ignore else -- @preserve
+// istanbul ignore if -- @preserve
 //# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/utils.ts","../src/more-itertools.ts","../src/itertools.ts","../src/custom.ts","../src/builtins.ts"],"names":["keyToCmp","keyFn","a","b","ka","kb","identityPredicate","x","numberIdentity","primitiveIdentity","chunked","iterable","size","it","iter","r1","chunk","item","flatten","iterableOfIterables","itake","n","count","s","pairwise","first","r2","partition","predicate","good","bad","roundrobin","iters","iterables","map","index","result","heads","round","take","uniqueEverseen","seen","key","uniqueJustseen","last","SENTINEL","composeAnd","f1","f2","slicePredicate","start","stop","step","_start","_stop","pred","definedStop","chain","compress","data","selectors","icompress","cycle","saved","element","dropwhile","value","groupby","currentValue","currentKey","targetKey","grouper","tgtKey","nextVal","d","izip","ifilter","imap","mapper","islice","stopOrStart","possiblyStop","i","enumerate","izip2","xs","ys","ixs","iys","y","izip3","zs","izs","z","izipLongest2","filler","filler_","izipMany","all","h","permutations","pool","indices","range","cycles","poolgetter","cleanExit","j","p","q","takewhile","zipLongest2","izipLongest","zipLongest","zipMany","isDefined","icompact","compact","compactObject","obj","value_","find","fn","flatmap","any","contains","haystack","needle","filter","max","reduce_","min","_range","counter","rest","args","reduce","reducer","output","sorted","reverse","sum","zip","zip3"],"mappings":"AAIO,SAASA,EAAYC,EAAyC,CACjE,MAAO,CAACC,EAAMC,IAAS,CACnB,IAAMC,EAAKH,EAAMC,CAAC,EACZG,EAAKJ,EAAME,CAAC,EAElB,OAAI,OAAOC,GAAO,WAAa,OAAOC,GAAO,UAClCD,IAAOC,EAAK,EAAI,CAACD,GAAMC,EAAK,GAAK,EACjC,OAAOD,GAAO,UAAY,OAAOC,GAAO,SACxCD,EAAKC,EACL,OAAOD,GAAO,UAAY,OAAOC,GAAO,SACxCD,IAAOC,EAAK,EAAID,EAAKC,EAAK,GAAK,EAE/B,EAEf,CACJ,CAEO,SAASC,EAAkBC,EAAqB,CACnD,MAAO,CAAC,CAACA,CACb,CAEO,SAASC,EAAeD,EAAoB,CAE/C,GAAI,OAAOA,GAAM,SACb,MAAM,IAAI,MAAM,wBAAwB,EAE5C,OAAOA,CACX,CAIO,SAASE,EAAkBF,EAAuB,CAErD,GAAI,OAAOA,GAAM,UAAY,OAAOA,GAAM,UAAY,OAAOA,GAAM,UAC/D,MAAM,IAAI,MAAM,kEAAkE,EAEtF,OAAOA,CACX,CCxBO,SAAUG,EAAWC,EAAuBC,EAA6B,CAC5E,IAAMC,EAAKC,EAAKH,CAAQ,EAClBI,EAAKF,EAAG,KAAK,EACnB,GAAIE,EAAG,KACH,OAGJ,IAAIC,EAAQ,CAACD,EAAG,KAAK,EAErB,QAAWE,KAAQJ,EACfG,EAAM,KAAKC,CAAI,EAEXD,EAAM,SAAWJ,IACjB,MAAMI,EACNA,EAAQ,CAAC,GAKbA,EAAM,OAAS,IACf,MAAMA,EAEd,CASO,SAAUE,EAAWC,EAAyD,CACjF,QAAWR,KAAYQ,EACnB,QAAWF,KAAQN,EACf,MAAMM,CAGlB,CAmBO,SAAUG,EAASC,EAAWV,EAAoC,CACrE,IAAME,EAAKC,EAAKH,CAAQ,EACpBW,EAAQD,EACZ,KAAOC,KAAU,GAAG,CAChB,IAAMC,EAAIV,EAAG,KAAK,EAClB,GAAI,CAACU,EAAE,KACH,MAAMA,EAAE,UAGR,QAGZ,CAWO,SAAUC,EAAYb,EAAyC,CAClE,IAAME,EAAKC,EAAKH,CAAQ,EAClBc,EAAQZ,EAAG,KAAK,EACtB,GAAIY,EAAM,KACN,OAGJ,IAAIV,EAAQU,EAAM,MAClB,QAAWC,KAAMb,EACb,KAAM,CAACE,EAAIW,CAAE,EACbX,EAAKW,CAEb,CAgBO,SAASC,EAAahB,EAAuBiB,EAAqC,CACrF,IAAMC,EAAO,CAAC,EACRC,EAAM,CAAC,EAEb,QAAWb,KAAQN,EACXiB,EAAUX,CAAI,EACdY,EAAK,KAAKZ,CAAI,EAEda,EAAI,KAAKb,CAAI,EAIrB,MAAO,CAACY,EAAMC,CAAG,CACrB,CASO,SAAUC,KAAiBC,EAAmC,CAKjE,IAAMC,EAAgCC,EAAIF,EAAOlB,CAAI,EAErD,KAAOmB,EAAU,OAAS,GAAG,CACzB,IAAIE,EAAQ,EACZ,KAAOA,EAAQF,EAAU,QAAQ,CAE7B,IAAMG,EADKH,EAAUE,CAAK,EACR,KAAK,EAElBC,EAAO,KAORH,EAAU,OAAOE,EAAO,CAAC,GANzB,MAAMC,EAAO,MACbD,MAShB,CAaO,SAAUE,KAAYL,EAA0C,CAKnE,IAAMC,EAAgCC,EAAIF,EAAOlB,CAAI,EAErD,KAAOmB,EAAU,OAAS,GAAG,CACzB,IAAIE,EAAQ,EACNG,EAAQ,CAAC,EACf,KAAOH,EAAQF,EAAU,QAAQ,CAE7B,IAAMG,EADKH,EAAUE,CAAK,EACR,KAAK,EAElBC,EAAO,KAORH,EAAU,OAAOE,EAAO,CAAC,GANzBG,EAAM,KAAKF,EAAO,KAAK,EACvBD,KAQJG,EAAM,OAAS,IACf,MAAMA,GAGlB,CAKO,SAASC,EAAQlB,EAAWV,EAA4B,CAC3D,OAAO,MAAM,KAAKS,EAAMC,EAAGV,CAAQ,CAAC,CACxC,CAWO,SAAU6B,EACb7B,EACAV,EAAgCQ,EACrB,CACX,IAAMgC,EAAO,IAAI,IACjB,QAAWxB,KAAQN,EAAU,CACzB,IAAM+B,EAAMzC,EAAMgB,CAAI,EACjBwB,EAAK,IAAIC,CAAG,IACbD,EAAK,IAAIC,CAAG,EACZ,MAAMzB,GAGlB,CAWO,SAAU0B,EACbhC,EACAV,EAAgCQ,EACrB,CACX,IAAImC,EACJ,QAAW3B,KAAQN,EAAU,CACzB,IAAM+B,EAAMzC,EAAMgB,CAAI,EAClByB,IAAQE,IACR,MAAM3B,EACN2B,EAAOF,GAGnB,CCnQA,IAAMG,EAAW,OAAO,EAExB,SAASC,EAAWC,EAA6BC,EAAsD,CACnG,OAAQ3B,GAAc0B,EAAG1B,CAAC,GAAK2B,EAAG3B,CAAC,CACvC,CAEA,SAAS4B,EAAeC,EAAeC,EAAqBC,EAAc,CAEtE,GAAIF,EAAQ,EAAG,MAAM,IAAI,MAAM,0BAA0B,EAEzD,GAAIC,IAAS,MAAQA,EAAO,EAAG,MAAM,IAAI,MAAM,yBAAyB,EAExE,GAAIC,EAAO,EAAG,MAAM,IAAI,MAAM,yBAAyB,EAGvD,IAAIC,EAASH,EACTI,EAAQH,EACRG,IAAU,SACV,CAACD,EAAQC,CAAK,EAAI,CAAC,EAAGD,CAAM,GAGhC,IAAIE,EAAQlC,GAAcA,GAAKgC,EAE/B,GAAIC,IAAU,KAAM,CAChB,IAAME,EAAcF,EACpBC,EAAOT,EAAWS,EAAOlC,GAAcA,EAAImC,CAAW,EAG1D,OAAIJ,EAAO,IACPG,EAAOT,EAAWS,EAAOlC,IAAeA,EAAIgC,GAAUD,IAAS,CAAC,GAG7DG,CACX,CAQO,SAASE,KAAYxB,EAAuC,CAC/D,OAAOf,EAAQe,CAAS,CAC5B,CAOO,SAAUX,EAAM4B,EAAQ,EAAGE,EAAO,EAAqB,CAC1D,IAAI/B,EAAI6B,EACR,OACI,MAAM7B,EACNA,GAAK+B,CAEb,CAKO,SAASM,EAAYC,EAAmBC,EAAmC,CAC9E,OAAO,MAAM,KAAKC,EAAUF,EAAMC,CAAS,CAAC,CAChD,CAOO,SAAUE,EAASnD,EAAoC,CAC1D,IAAMoD,EAAQ,CAAC,EACf,QAAWC,KAAWrD,EAClB,MAAMqD,EACND,EAAM,KAAKC,CAAO,EAGtB,KAAOD,EAAM,OAAS,GAClB,QAAWC,KAAWD,EAClB,MAAMC,CAGlB,CAQO,SAAUC,GAAatD,EAAuBiB,EAAsC,CACvF,IAAMf,EAAKC,EAAKH,CAAQ,EACxB,QAAWuD,KAASrD,EAChB,GAAI,CAACe,EAAUsC,CAAK,EAAG,CACnB,MAAMA,EACN,MAIR,QAAWA,KAASrD,EAChB,MAAMqD,CAEd,CAEO,SAAUC,GACbxD,EACAV,EAAwBQ,EAC0B,CAClD,IAAMI,EAAKC,EAAKH,CAAQ,EAEpByD,EACAC,EAAgBxB,EAEhByB,EAAeD,EAEbE,EAAU,UAAkBC,EAAoC,CAClE,KAAOH,IAAeG,GAAQ,CAC1B,MAAMJ,EAEN,IAAMK,EAAU5D,EAAG,KAAK,EACxB,GAAI4D,EAAQ,KAAM,OAClBL,EAAeK,EAAQ,MACvBJ,EAAapE,EAAMmE,CAAY,EAEvC,EAEA,OAAS,CACL,KAAOC,IAAeC,GAAW,CAC7B,IAAMG,EAAU5D,EAAG,KAAK,EACxB,GAAI4D,EAAQ,KAAM,CACdJ,EAAaxB,EAEb,OAEJuB,EAAeK,EAAQ,MACvBJ,EAAapE,EAAMmE,CAAY,EAGnCE,EAAYD,EACZ,KAAM,CAACA,EAAYE,EAAQD,CAAS,CAAC,EAE7C,CAOO,SAAUT,EAAaF,EAAmBC,EAA2C,CACxF,OAAW,CAACc,EAAGnD,CAAC,IAAKoD,EAAKhB,EAAMC,CAAS,EACjCrC,IACA,MAAMmD,EAGlB,CAMO,SAAUE,EAAWjE,EAAuBiB,EAAsC,CACrF,QAAWsC,KAASvD,EACZiB,EAAUsC,CAAK,IACf,MAAMA,EAGlB,CAMO,SAAUW,EAAWlE,EAAuBmE,EAAqC,CACpF,QAAWZ,KAASvD,EAChB,MAAMmE,EAAOZ,CAAK,CAE1B,CAaO,SAAUa,GACbpE,EACAqE,EACAC,EACA7B,EAAO,EACI,CACX,IAAIF,EAAOC,EACP8B,IAAiB,QAEjB/B,EAAQ8B,EACR7B,EAAO8B,IAGP/B,EAAQ,EACRC,EAAO6B,GAGX,IAAMzB,EAAON,EAAeC,EAAOC,EAAMC,CAAI,EAC7C,OAAW,CAAC8B,EAAGhB,CAAK,IAAKiB,EAAUxE,CAAQ,EACnC4C,EAAK2B,CAAC,IACN,MAAMhB,EAGlB,CAQO,SAAUkB,EAAcC,EAAkBC,EAAsC,CACnF,IAAMC,EAAMzE,EAAKuE,CAAE,EACbG,EAAM1E,EAAKwE,CAAE,EACnB,OAAS,CACL,IAAM/E,EAAIgF,EAAI,KAAK,EACbE,EAAID,EAAI,KAAK,EACnB,GAAI,CAACjF,EAAE,MAAQ,CAACkF,EAAE,KACd,KAAM,CAAClF,EAAE,MAAOkF,EAAE,KAAK,MAGvB,QAGZ,CAKO,SAAUC,EAAkBL,EAAkBC,EAAkBK,EAA0C,CAC7G,IAAMJ,EAAMzE,EAAKuE,CAAE,EACbG,EAAM1E,EAAKwE,CAAE,EACbM,EAAM9E,EAAK6E,CAAE,EACnB,OAAS,CACL,IAAMpF,EAAIgF,EAAI,KAAK,EACbE,EAAID,EAAI,KAAK,EACbK,EAAID,EAAI,KAAK,EACnB,GAAI,CAACrF,EAAE,MAAQ,CAACkF,EAAE,MAAQ,CAACI,EAAE,KACzB,KAAM,CAACtF,EAAE,MAAOkF,EAAE,MAAOI,EAAE,KAAK,MAGhC,QAGZ,CAEO,IAAMlB,EAAOS,EAOb,SAAUU,EAAwBT,EAAkBC,EAAkBS,EAAwC,CACjH,IAAMC,EAAUD,EACVR,EAAMzE,EAAKuE,CAAE,EACbG,EAAM1E,EAAKwE,CAAE,EACnB,OAAS,CACL,IAAM/E,EAAIgF,EAAI,KAAK,EACbE,EAAID,EAAI,KAAK,EACnB,GAAIjF,EAAE,MAAQkF,EAAE,KAEZ,OAEA,KAAM,CAAElF,EAAE,KAAiByF,EAAVzF,EAAE,MAAkBkF,EAAE,KAAiBO,EAAVP,EAAE,KAAe,EAG3E,CAoCO,SAAUQ,KAAejE,EAAqC,CAEjE,IAAMC,EAAYD,EAAM,IAAIlB,CAAI,EAEhC,OAAS,CACL,IAAMuB,EAA6CJ,EAAU,IAAKoD,GAAOA,EAAG,KAAK,CAAC,EAClF,GAAIa,EAAI7D,EAAQ8D,GAAM,CAACA,EAAE,IAAI,EACzB,MAAM9D,EAAM,IAAK8D,GAAMA,EAAE,KAAU,MAGnC,QAGZ,CAeO,SAAUC,GAAgBzF,EAAuB,EAA2B,CAC/E,IAAM0F,EAAO,MAAM,KAAK1F,CAAQ,EAC1B,EAAI0F,EAAK,OACT9F,EAAI,IAAM,OAAY,EAAI,EAEhC,GAAIA,EAAI,EACJ,OAGJ,IAAI+F,EAAoB,MAAM,KAAKC,EAAM,CAAC,CAAC,EACrCC,EAAmB,MAAM,KAAKD,EAAM,EAAG,EAAIhG,EAAG,EAAE,CAAC,EACjDkG,EAAcvB,GAAcmB,EAAKnB,CAAC,EAIxC,IAFA,MAAMoB,EAAQ,MAAM,EAAG/F,CAAC,EAAE,IAAIkG,CAAU,EAEjC,EAAI,GAAG,CACV,IAAIC,EAAY,GAChB,QAAWxB,KAAKqB,EAAMhG,EAAI,EAAG,GAAI,EAAE,EAE/B,GADAiG,EAAOtB,CAAC,GAAK,EACTsB,EAAOtB,CAAC,IAAM,EACdoB,EAAUA,EACL,MAAM,EAAGpB,CAAC,EACV,OAAOoB,EAAQ,MAAMpB,EAAI,CAAC,CAAC,EAC3B,OAAOoB,EAAQ,MAAMpB,EAAGA,EAAI,CAAC,CAAC,EACnCsB,EAAOtB,CAAC,EAAI,EAAIA,MACb,CACH,IAAMyB,EAAYH,EAAOtB,CAAC,EAEpB,CAAC0B,EAAGC,CAAC,EAAI,CAACP,EAAQA,EAAQ,OAASK,CAAC,EAAGL,EAAQpB,CAAC,CAAC,EACvDoB,EAAQpB,CAAC,EAAI0B,EACbN,EAAQA,EAAQ,OAASK,CAAC,EAAIE,EAC9B,MAAMP,EAAQ,MAAM,EAAG/F,CAAC,EAAE,IAAIkG,CAAU,EACxCC,EAAY,GACZ,MAIR,GAAIA,EACA,OAGZ,CAsBO,SAAUI,EAAanG,EAAuBiB,EAAsC,CACvF,QAAWsC,KAASvD,EAAU,CAC1B,GAAI,CAACiB,EAAUsC,CAAK,EAAG,OACvB,MAAMA,EAEd,CAEO,SAAS6C,GAAuB1B,EAAkBC,EAAkBS,EAAqC,CAC5G,OAAO,MAAM,KAAKD,EAAaT,EAAIC,EAAIS,CAAM,CAAC,CAClD,CAWO,IAAMiB,GAAclB,EACdmB,GAAaF,GAEnB,SAASG,MAAclF,EAA6B,CACvD,OAAO,MAAM,KAAKiE,EAAS,GAAGjE,CAAK,CAAC,CACxC,CC7aA,SAASmF,GAAa5G,EAAe,CACjC,OAAOA,IAAM,MACjB,CAQO,SAAU6G,EAAYzG,EAAuD,CAChF,QAAWM,KAAQN,EACXM,GAAQ,OACR,MAAMA,EAGlB,CAKO,SAASoG,GAAW1G,EAA+C,CACtE,OAAO,MAAM,KAAKyG,EAASzG,CAAQ,CAAC,CACxC,CASO,SAAS2G,GAAmCC,EAAoD,CACnG,IAAMnF,EAAS,CAAC,EAChB,OAAW,CAACM,EAAK8E,CAAM,IAAK,OAAO,QAAQD,CAAG,EAAG,CAC7C,IAAMrD,EAAQsD,EACVtD,GAAS,OACT9B,EAAOM,CAAQ,EAAIwB,GAG3B,OAAO9B,CACX,CAOO,SAASqF,GAAQ9G,EAAuBV,EAAqC,CAChF,IAAMyH,EAAKzH,GAASkH,GACpB,QAAWjD,KAASvD,EAChB,GAAI+G,EAAGxD,CAAK,EACR,OAAOA,CAInB,CAOO,IAAMzC,EAAQgG,GAgBd,SAASE,GAAchH,EAAuBmE,EAA+C,CAChG,OAAO5D,EAAQ2D,EAAKlE,EAAUmE,CAAM,CAAC,CACzC,CC9DO,SAASoB,EAAOvF,EAAuBV,EAAsBK,EAA4B,CAC5F,QAAWW,KAAQN,EACf,GAAI,CAACV,EAAMgB,CAAI,EACX,MAAO,GAIf,MAAO,EACX,CAmBO,SAAS2G,EAAOjH,EAAuBV,EAAsBK,EAA4B,CAC5F,QAAWW,KAAQN,EACf,GAAIV,EAAMgB,CAAI,EACV,MAAO,GAIf,MAAO,EACX,CAaO,SAAS4G,GAAYC,EAAuBC,EAAoB,CACnE,OAAOH,EAAIE,EAAWvH,GAAMA,IAAMwH,CAAM,CAC5C,CAeO,SAAU5C,EAAaxE,EAAuBuC,EAAQ,EAA0B,CACnF,IAAIf,EAAgBe,EACpB,QAAWgB,KAASvD,EAChB,KAAM,CAACwB,IAAS+B,CAAK,CAE7B,CAKO,SAAS8D,GAAUrH,EAAuBiB,EAA8B,CAC3E,OAAO,MAAM,KAAKgD,EAAQjE,EAAUiB,CAAS,CAAC,CAClD,CAQO,SAASd,EAAQH,EAA4C,CAehE,OAAOA,EAAS,OAAO,QAAQ,EAAE,CAErC,CAKO,SAASuB,EAAUvB,EAAuBmE,EAA6B,CAC1E,OAAO,MAAM,KAAKD,EAAKlE,EAAUmE,CAAM,CAAC,CAC5C,CAaO,SAASmD,GAAOtH,EAAuBV,EAA6BO,EAA+B,CACtG,OAAO0H,EAAQvH,EAAU,CAACJ,EAAGkF,IAAOxF,EAAMM,CAAC,EAAIN,EAAMwF,CAAC,EAAIlF,EAAIkF,CAAE,CACpE,CAaO,SAAS0C,GAAOxH,EAAuBV,EAA6BO,EAA+B,CACtG,OAAO0H,EAAQvH,EAAU,CAACJ,EAAGkF,IAAOxF,EAAMM,CAAC,EAAIN,EAAMwF,CAAC,EAAIlF,EAAIkF,CAAE,CACpE,CAKA,SAAS2C,EAAOlF,EAAeC,EAAcC,EAAgC,CACzE,IAAMiF,EAAU/G,EAAM4B,EAAOE,CAAI,EAC3BG,EAAOH,GAAQ,EAAK/B,GAAcA,EAAI8B,EAAQ9B,GAAcA,EAAI8B,EACtE,OAAO2D,EAAUuB,EAAS9E,CAAI,CAClC,CA0BO,SAASgD,EAAMrG,KAAcoI,EAAkC,CAClE,IAAMC,EAAO,CAACrI,EAAG,GAAGoI,CAAI,EACxB,OAAQC,EAAK,OAAQ,CACjB,IAAK,GACD,OAAOH,EAAO,EAAGG,EAAK,CAAC,EAAG,CAAC,EAC/B,IAAK,GACD,OAAOH,EAAOG,EAAK,CAAC,EAAGA,EAAK,CAAC,EAAG,CAAC,EACrC,IAAK,GACD,OAAOH,EAAOG,EAAK,CAAC,EAAGA,EAAK,CAAC,EAAGA,EAAK,CAAC,CAAC,EAE3C,QAEI,MAAM,IAAI,MAAM,6BAA6B,CACrD,CACJ,CAuBO,SAASC,EAAa7H,EAAuB8H,EAAgDvF,EAAa,CAC7G,IAAMrC,EAAKC,EAAKH,CAAQ,EACpB+H,EAASxF,EACb,OAAW,CAACf,EAAOlB,CAAI,IAAKkE,EAAUtE,CAAE,EACpC6H,EAASD,EAAQC,EAAQzH,EAAMkB,CAAK,EAExC,OAAOuG,CACX,CAKO,SAASR,EAAWvH,EAAuB8H,EAA+D,CAC7G,IAAM5H,EAAKC,EAAKH,CAAQ,EAClBuC,EAAQzB,EAAMZ,CAAE,EACtB,GAAIqC,IAAU,OAGV,OAAOsF,EAAO3H,EAAI4H,EAASvF,CAAK,CAExC,CAeO,SAASyF,GACZhI,EACAV,EAAgCQ,EAChCmI,EAAU,GACP,CACH,IAAMxG,EAAS,MAAM,KAAKzB,CAAQ,EAClC,OAAAyB,EAAO,KAAKpC,EAASC,CAAK,CAAC,EAEvB2I,GACAxG,EAAO,QAAQ,EAGZA,CACX,CAMO,SAASyG,GAAIlI,EAAoC,CACpD,OAAO6H,EAAO7H,EAAU,CAACJ,EAAGkF,IAAMlF,EAAIkF,EAAG,CAAC,CAC9C,CAKO,SAASqD,GAAYzD,EAAkBC,EAAmC,CAC7E,OAAO,MAAM,KAAKX,EAAKU,EAAIC,CAAE,CAAC,CAClC,CAKO,SAASyD,GAAiB1D,EAAkBC,EAAkBK,EAAuC,CACxG,OAAO,MAAM,KAAKD,EAAML,EAAIC,EAAIK,CAAE,CAAC,CACvC","sourcesContent":["import type { Primitive } from './types';\n\ntype CmpFn<T> = (a: T, b: T) => number;\n\nexport function keyToCmp<T>(keyFn: (item: T) => Primitive): CmpFn<T> {\n    return (a: T, b: T) => {\n        const ka = keyFn(a);\n        const kb = keyFn(b);\n        // istanbul ignore else\n        if (typeof ka === 'boolean' && typeof kb === 'boolean') {\n            return ka === kb ? 0 : !ka && kb ? -1 : 1;\n        } else if (typeof ka === 'number' && typeof kb === 'number') {\n            return ka - kb;\n        } else if (typeof ka === 'string' && typeof kb === 'string') {\n            return ka === kb ? 0 : ka < kb ? -1 : 1;\n        } else {\n            return -1;\n        }\n    };\n}\n\nexport function identityPredicate(x: unknown): boolean {\n    return !!x;\n}\n\nexport function numberIdentity(x: unknown): number {\n    /* istanbul ignore if */\n    if (typeof x !== 'number') {\n        throw new Error('Inputs must be numbers');\n    }\n    return x;\n}\n\nexport function primitiveIdentity<P extends Primitive>(x: P): P;\nexport function primitiveIdentity(x: unknown): Primitive;\nexport function primitiveIdentity(x: unknown): Primitive {\n    /* istanbul ignore if */\n    if (typeof x !== 'string' && typeof x !== 'number' && typeof x !== 'boolean') {\n        throw new Error('Please provide a key function that can establish object identity');\n    }\n    return x;\n}\n","import { iter, map } from './builtins';\nimport { izip, repeat } from './itertools';\nimport type { Predicate, Primitive } from './types';\nimport { primitiveIdentity } from './utils';\n\n/**\n * Break iterable into lists of length `size`:\n *\n *     [...chunked([1, 2, 3, 4, 5, 6], 3)]\n *     // [[1, 2, 3], [4, 5, 6]]\n *\n * If the length of iterable is not evenly divisible by `size`, the last returned\n * list will be shorter:\n *\n *     [...chunked([1, 2, 3, 4, 5, 6, 7, 8], 3)]\n *     // [[1, 2, 3], [4, 5, 6], [7, 8]]\n */\nexport function* chunked<T>(iterable: Iterable<T>, size: number): Iterable<T[]> {\n    const it = iter(iterable);\n    const r1 = it.next();\n    if (r1.done) {\n        return;\n    }\n\n    let chunk = [r1.value];\n\n    for (const item of it) {\n        chunk.push(item);\n\n        if (chunk.length === size) {\n            yield chunk;\n            chunk = [];\n        }\n    }\n\n    // Yield the remainder, if there is any\n    if (chunk.length > 0) {\n        yield chunk;\n    }\n}\n\n/**\n * Return an iterator flattening one level of nesting in a list of lists:\n *\n *     [...flatten([[0, 1], [2, 3]])]\n *     // [0, 1, 2, 3]\n *\n */\nexport function* flatten<T>(iterableOfIterables: Iterable<Iterable<T>>): Iterable<T> {\n    for (const iterable of iterableOfIterables) {\n        for (const item of iterable) {\n            yield item;\n        }\n    }\n}\n\n/**\n * Intersperse filler element `value` among the items in `iterable`.\n *\n *     >>> [...intersperse(-1, range(1, 5))]\n *     [1, -1, 2, -1, 3, -1, 4]\n *\n */\nexport function intersperse<T, V>(value: V, iterable: Iterable<T>): Iterable<T | V> {\n    const stream = flatten(izip(repeat(value), iterable));\n    take(1, stream); // eat away and discard the first value from the output\n    return stream;\n}\n\n/**\n * Returns an iterable containing only the first `n` elements of the given\n * iterable.\n */\nexport function* itake<T>(n: number, iterable: Iterable<T>): Iterable<T> {\n    const it = iter(iterable);\n    let count = n;\n    while (count-- > 0) {\n        const s = it.next();\n        if (!s.done) {\n            yield s.value;\n        } else {\n            // Iterable exhausted, quit early\n            return;\n        }\n    }\n}\n\n/**\n * Returns an iterator of paired items, overlapping, from the original.  When\n * the input iterable has a finite number of items `n`, the outputted iterable\n * will have `n - 1` items.\n *\n *     >>> pairwise([8, 2, 0, 7])\n *     [(8, 2), (2, 0), (0, 7)]\n *\n */\nexport function* pairwise<T>(iterable: Iterable<T>): Iterable<[T, T]> {\n    const it = iter(iterable);\n    const first = it.next();\n    if (first.done) {\n        return;\n    }\n\n    let r1: T = first.value;\n    for (const r2 of it) {\n        yield [r1, r2];\n        r1 = r2;\n    }\n}\n\n/**\n * Returns a 2-tuple of arrays.  Splits the elements in the input iterable into\n * either of the two arrays.  Will fully exhaust the input iterable.  The first\n * array contains all items that match the predicate, the second the rest:\n *\n *     >>> const isOdd = x => x % 2 !== 0;\n *     >>> const iterable = range(10);\n *     >>> const [odds, evens] = partition(iterable, isOdd);\n *     >>> odds\n *     [1, 3, 5, 7, 9]\n *     >>> evens\n *     [0, 2, 4, 6, 8]\n *\n */\nexport function partition<T>(iterable: Iterable<T>, predicate: Predicate<T>): [T[], T[]] {\n    const good = [];\n    const bad = [];\n\n    for (const item of iterable) {\n        if (predicate(item)) {\n            good.push(item);\n        } else {\n            bad.push(item);\n        }\n    }\n\n    return [good, bad];\n}\n\n/**\n * Yields the next item from each iterable in turn, alternating between them.\n * Continues until all items are exhausted.\n *\n *     >>> [...roundrobin([1, 2, 3], [4], [5, 6, 7, 8])]\n *     [1, 4, 5, 2, 6, 3, 7, 8]\n */\nexport function* roundrobin<T>(...iters: Iterable<T>[]): Iterable<T> {\n    // We'll only keep lazy versions of the input iterables in here that we'll\n    // slowly going to exhaust.  Once an iterable is exhausted, it will be\n    // removed from this list.  Once the entire list is empty, this algorithm\n    // ends.\n    const iterables: Array<Iterator<T>> = map(iters, iter);\n\n    while (iterables.length > 0) {\n        let index = 0;\n        while (index < iterables.length) {\n            const it = iterables[index];\n            const result = it.next();\n\n            if (!result.done) {\n                yield result.value;\n                index++;\n            } else {\n                // This iterable is exhausted, make sure to remove it from the\n                // list of iterables.  We'll splice the array from under our\n                // feet, and NOT advancing the index counter.\n                iterables.splice(index, 1); // intentional side-effect!\n            }\n        }\n    }\n}\n\n/**\n * Yields the heads of all of the given iterables.  This is almost like\n * `roundrobin()`, except that the yielded outputs are grouped in to the\n * \"rounds\":\n *\n *     >>> [...heads([1, 2, 3], [4], [5, 6, 7, 8])]\n *     [[1, 4, 5], [2, 6], [3, 7], [8]]\n *\n * This is also different from `zipLongest()`, since the number of items in\n * each round can decrease over time, rather than being filled with a filler.\n */\nexport function* heads<T>(...iters: Array<Iterable<T>>): Iterable<T[]> {\n    // We'll only keep lazy versions of the input iterables in here that we'll\n    // slowly going to exhaust.  Once an iterable is exhausted, it will be\n    // removed from this list.  Once the entire list is empty, this algorithm\n    // ends.\n    const iterables: Array<Iterator<T>> = map(iters, iter);\n\n    while (iterables.length > 0) {\n        let index = 0;\n        const round = [];\n        while (index < iterables.length) {\n            const it = iterables[index];\n            const result = it.next();\n\n            if (!result.done) {\n                round.push(result.value);\n                index++;\n            } else {\n                // This iterable is exhausted, make sure to remove it from the\n                // list of iterables.  We'll splice the array from under our\n                // feet, and NOT advancing the index counter.\n                iterables.splice(index, 1); // intentional side-effect!\n            }\n        }\n        if (round.length > 0) {\n            yield round;\n        }\n    }\n}\n\n/**\n * Non-lazy version of itake().\n */\nexport function take<T>(n: number, iterable: Iterable<T>): T[] {\n    return Array.from(itake(n, iterable));\n}\n\n/**\n * Yield unique elements, preserving order.\n *\n *     >>> [...uniqueEverseen('AAAABBBCCDAABBB')]\n *     ['A', 'B', 'C', 'D']\n *     >>> [...uniqueEverseen('AbBCcAB', s => s.toLowerCase())]\n *     ['A', 'b', 'C']\n *\n */\nexport function* uniqueEverseen<T>(\n    iterable: Iterable<T>,\n    keyFn: (item: T) => Primitive = primitiveIdentity\n): Iterable<T> {\n    const seen = new Set();\n    for (const item of iterable) {\n        const key = keyFn(item);\n        if (!seen.has(key)) {\n            seen.add(key);\n            yield item;\n        }\n    }\n}\n\n/**\n * Yields elements in order, ignoring serial duplicates.\n *\n *     >>> [...uniqueJustseen('AAAABBBCCDAABBB')]\n *     ['A', 'B', 'C', 'D', 'A', 'B']\n *     >>> [...uniqueJustseen('AbBCcAB', s => s.toLowerCase())]\n *     ['A', 'b', 'C', 'A', 'B']\n *\n */\nexport function* uniqueJustseen<T>(\n    iterable: Iterable<T>,\n    keyFn: (item: T) => Primitive = primitiveIdentity\n): Iterable<T> {\n    let last = undefined;\n    for (const item of iterable) {\n        const key = keyFn(item);\n        if (key !== last) {\n            yield item;\n            last = key;\n        }\n    }\n}\n","import { all, enumerate, iter, range } from './builtins';\nimport { flatten } from './more-itertools';\nimport type { Predicate, Primitive } from './types';\nimport { primitiveIdentity } from './utils';\n\nconst SENTINEL = Symbol();\n\nfunction composeAnd(f1: (v1: number) => boolean, f2: (v2: number) => boolean): (v3: number) => boolean {\n    return (n: number) => f1(n) && f2(n);\n}\n\nfunction slicePredicate(start: number, stop: number | null, step: number) {\n    /* istanbul ignore if */\n    if (start < 0) throw new Error('start cannot be negative');\n    /* istanbul ignore if */\n    if (stop !== null && stop < 0) throw new Error('stop cannot be negative');\n    /* istanbul ignore if */\n    if (step < 0) throw new Error('step cannot be negative');\n\n    // If stop is not provided (= undefined), then interpret the start value as the stop value\n    let _start = start,\n        _stop = stop;\n    if (_stop === undefined) {\n        [_start, _stop] = [0, _start];\n    }\n\n    let pred = (n: number) => n >= _start;\n\n    if (_stop !== null) {\n        const definedStop = _stop;\n        pred = composeAnd(pred, (n: number) => n < definedStop);\n    }\n\n    if (step > 1) {\n        pred = composeAnd(pred, (n: number) => (n - _start) % step === 0);\n    }\n\n    return pred;\n}\n\n/**\n * Returns an iterator that returns elements from the first iterable until it\n * is exhausted, then proceeds to the next iterable, until all of the iterables\n * are exhausted.  Used for treating consecutive sequences as a single\n * sequence.\n */\nexport function chain<T>(...iterables: Iterable<T>[]): Iterable<T> {\n    return flatten(iterables);\n}\n\n/**\n * Returns an iterator that counts up values starting with number `start`\n * (default 0), incrementing by `step`.  To decrement, use a negative step\n * number.\n */\nexport function* count(start = 0, step = 1): Iterable<number> {\n    let n = start;\n    for (;;) {\n        yield n;\n        n += step;\n    }\n}\n\n/**\n * Non-lazy version of icompress().\n */\nexport function compress<T>(data: Iterable<T>, selectors: Iterable<boolean>): T[] {\n    return Array.from(icompress(data, selectors));\n}\n\n/**\n * Returns an iterator producing elements from the iterable and saving a copy\n * of each.  When the iterable is exhausted, return elements from the saved\n * copy.  Repeats indefinitely.\n */\nexport function* cycle<T>(iterable: Iterable<T>): Iterable<T> {\n    const saved = [];\n    for (const element of iterable) {\n        yield element;\n        saved.push(element);\n    }\n\n    while (saved.length > 0) {\n        for (const element of saved) {\n            yield element;\n        }\n    }\n}\n\n/**\n * Returns an iterator that drops elements from the iterable as long as the\n * predicate is true; afterwards, returns every remaining element.  Note, the\n * iterator does not produce any output until the predicate first becomes\n * false.\n */\nexport function* dropwhile<T>(iterable: Iterable<T>, predicate: Predicate<T>): Iterable<T> {\n    const it = iter(iterable);\n    for (const value of it) {\n        if (!predicate(value)) {\n            yield value;\n            break;\n        }\n    }\n\n    for (const value of it) {\n        yield value;\n    }\n}\n\nexport function* groupby<T, K extends Primitive>(\n    iterable: Iterable<T>,\n    keyFn: (item: T) => K = primitiveIdentity\n): Generator<[K, Generator<T, undefined>], undefined> {\n    const it = iter(iterable);\n\n    let currentValue: T;\n    let currentKey: K = SENTINEL as unknown as K;\n    //                           ^^^^^^^^^^^^^^^ Hack!\n    let targetKey: K = currentKey;\n\n    const grouper = function* grouper(tgtKey: K): Generator<T, undefined> {\n        while (currentKey === tgtKey) {\n            yield currentValue;\n\n            const nextVal = it.next();\n            if (nextVal.done) return;\n            currentValue = nextVal.value;\n            currentKey = keyFn(currentValue);\n        }\n    };\n\n    for (;;) {\n        while (currentKey === targetKey) {\n            const nextVal = it.next();\n            if (nextVal.done) {\n                currentKey = SENTINEL as unknown as K;\n                //                    ^^^^^^^^^^^^^^^ Hack!\n                return;\n            }\n            currentValue = nextVal.value;\n            currentKey = keyFn(currentValue);\n        }\n\n        targetKey = currentKey;\n        yield [currentKey, grouper(targetKey)];\n    }\n}\n\n/**\n * Returns an iterator that filters elements from data returning only those\n * that have a corresponding element in selectors that evaluates to `true`.\n * Stops when either the data or selectors iterables has been exhausted.\n */\nexport function* icompress<T>(data: Iterable<T>, selectors: Iterable<boolean>): Iterable<T> {\n    for (const [d, s] of izip(data, selectors)) {\n        if (s) {\n            yield d;\n        }\n    }\n}\n\n/**\n * Returns an iterator that filters elements from iterable returning only those\n * for which the predicate is true.\n */\nexport function* ifilter<T>(iterable: Iterable<T>, predicate: Predicate<T>): Iterable<T> {\n    for (const value of iterable) {\n        if (predicate(value)) {\n            yield value;\n        }\n    }\n}\n\n/**\n * Returns an iterator that computes the given mapper function using arguments\n * from each of the iterables.\n */\nexport function* imap<T, V>(iterable: Iterable<T>, mapper: (item: T) => V): Iterable<V> {\n    for (const value of iterable) {\n        yield mapper(value);\n    }\n}\n\n/**\n * Returns an iterator that returns selected elements from the iterable.  If\n * `start` is non-zero, then elements from the iterable are skipped until start\n * is reached.  Then, elements are returned by making steps of `step` (defaults\n * to 1).  If set to higher than 1, items will be skipped.  If `stop` is\n * provided, then iteration continues until the iterator reached that index,\n * otherwise, the iterable will be fully exhausted.  `islice()` does not\n * support negative values for `start`, `stop`, or `step`.\n */\nexport function islice<T>(iterable: Iterable<T>, stop: number): Iterable<T>;\nexport function islice<T>(iterable: Iterable<T>, start: number, stop?: number | null, step?: number): Iterable<T>;\nexport function* islice<T>(\n    iterable: Iterable<T>,\n    stopOrStart: number,\n    possiblyStop?: number | null,\n    step = 1\n): Iterable<T> {\n    let start, stop;\n    if (possiblyStop !== undefined) {\n        // islice(iterable, start, stop[, step])\n        start = stopOrStart;\n        stop = possiblyStop;\n    } else {\n        // islice(iterable, stop)\n        start = 0;\n        stop = stopOrStart;\n    }\n\n    const pred = slicePredicate(start, stop, step);\n    for (const [i, value] of enumerate(iterable)) {\n        if (pred(i)) {\n            yield value;\n        }\n    }\n}\n\n/**\n * Returns an iterator that aggregates elements from each of the iterables.\n * Used for lock-step iteration over several iterables at a time.  When\n * iterating over two iterables, use `izip2`.  When iterating over three\n * iterables, use `izip3`, etc.  `izip` is an alias for `izip2`.\n */\nexport function* izip2<T1, T2>(xs: Iterable<T1>, ys: Iterable<T2>): Iterable<[T1, T2]> {\n    const ixs = iter(xs);\n    const iys = iter(ys);\n    for (;;) {\n        const x = ixs.next();\n        const y = iys.next();\n        if (!x.done && !y.done) {\n            yield [x.value, y.value];\n        } else {\n            // One of the iterables exhausted\n            return;\n        }\n    }\n}\n\n/**\n * Like izip2, but for three input iterables.\n */\nexport function* izip3<T1, T2, T3>(xs: Iterable<T1>, ys: Iterable<T2>, zs: Iterable<T3>): Iterable<[T1, T2, T3]> {\n    const ixs = iter(xs);\n    const iys = iter(ys);\n    const izs = iter(zs);\n    for (;;) {\n        const x = ixs.next();\n        const y = iys.next();\n        const z = izs.next();\n        if (!x.done && !y.done && !z.done) {\n            yield [x.value, y.value, z.value];\n        } else {\n            // One of the iterables exhausted\n            return;\n        }\n    }\n}\n\nexport const izip = izip2;\n\n/**\n * Returns an iterator that aggregates elements from each of the iterables.  If\n * the iterables are of uneven length, missing values are filled-in with\n * fillvalue.  Iteration continues until the longest iterable is exhausted.\n */\nexport function* izipLongest2<T1, T2, D>(xs: Iterable<T1>, ys: Iterable<T2>, filler?: D): Iterable<[T1 | D, T2 | D]> {\n    const filler_ = filler as D;\n    const ixs = iter(xs);\n    const iys = iter(ys);\n    for (;;) {\n        const x = ixs.next();\n        const y = iys.next();\n        if (x.done && y.done) {\n            // All iterables exhausted\n            return;\n        } else {\n            yield [!x.done ? x.value : filler_, !y.done ? y.value : filler_];\n        }\n    }\n}\n\n/**\n * See izipLongest2, but for three.\n */\nexport function* izipLongest3<T1, T2, T3, D = undefined>(\n    xs: Iterable<T1>,\n    ys: Iterable<T2>,\n    zs: Iterable<T3>,\n    filler?: D\n): Iterable<[T1 | D, T2 | D, T3 | D]> {\n    const filler_ = filler as D;\n    const ixs = iter(xs);\n    const iys = iter(ys);\n    const izs = iter(zs);\n    for (;;) {\n        const x = ixs.next();\n        const y = iys.next();\n        const z = izs.next();\n        if (x.done && y.done && z.done) {\n            // All iterables exhausted\n            return;\n        } else {\n            yield [!x.done ? x.value : filler_, !y.done ? y.value : filler_, !z.done ? z.value : filler_];\n        }\n    }\n}\n\n/**\n * Like the other izips (`izip`, `izip3`, etc), but generalized to take an\n * unlimited amount of input iterables.  Think `izip(*iterables)` in Python.\n *\n * **Note:** Due to Flow type system limitations, you can only \"generially\" zip\n * iterables with homogeneous types, so you cannot mix types like <A, B> like\n * you can with izip2().\n */\nexport function* izipMany<T>(...iters: Iterable<T>[]): Iterable<T[]> {\n    // Make them all iterables\n    const iterables = iters.map(iter);\n\n    for (;;) {\n        const heads: Array<IteratorResult<T, undefined>> = iterables.map((xs) => xs.next());\n        if (all(heads, (h) => !h.done)) {\n            yield heads.map((h) => h.value as T);\n        } else {\n            // One of the iterables exhausted\n            return;\n        }\n    }\n}\n\n/**\n * Return successive `r`-length permutations of elements in the iterable.\n *\n * If `r` is not specified, then `r` defaults to the length of the iterable and\n * all possible full-length permutations are generated.\n *\n * Permutations are emitted in lexicographic sort order.  So, if the input\n * iterable is sorted, the permutation tuples will be produced in sorted order.\n *\n * Elements are treated as unique based on their position, not on their value.\n * So if the input elements are unique, there will be no repeat values in each\n * permutation.\n */\nexport function* permutations<T>(iterable: Iterable<T>, r?: number): Iterable<T[]> {\n    const pool = Array.from(iterable);\n    const n = pool.length;\n    const x = r === undefined ? n : r;\n\n    if (x > n) {\n        return;\n    }\n\n    let indices: number[] = Array.from(range(n));\n    const cycles: number[] = Array.from(range(n, n - x, -1));\n    const poolgetter = (i: number) => pool[i];\n\n    yield indices.slice(0, x).map(poolgetter);\n\n    while (n > 0) {\n        let cleanExit = true;\n        for (const i of range(x - 1, -1, -1)) {\n            cycles[i] -= 1;\n            if (cycles[i] === 0) {\n                indices = indices\n                    .slice(0, i)\n                    .concat(indices.slice(i + 1))\n                    .concat(indices.slice(i, i + 1));\n                cycles[i] = n - i;\n            } else {\n                const j: number = cycles[i];\n\n                const [p, q] = [indices[indices.length - j], indices[i]];\n                indices[i] = p;\n                indices[indices.length - j] = q;\n                yield indices.slice(0, x).map(poolgetter);\n                cleanExit = false;\n                break;\n            }\n        }\n\n        if (cleanExit) {\n            return;\n        }\n    }\n}\n\n/**\n * Returns an iterator that produces values over and over again.  Runs\n * indefinitely unless the times argument is specified.\n */\nexport function* repeat<T>(thing: T, times?: number): Iterable<T> {\n    if (times === undefined) {\n        for (;;) {\n            yield thing;\n        }\n    } else {\n        for (const _ of range(times)) {\n            yield thing;\n        }\n    }\n}\n\n/**\n * Returns an iterator that produces elements from the iterable as long as the\n * predicate is true.\n */\nexport function* takewhile<T>(iterable: Iterable<T>, predicate: Predicate<T>): Iterable<T> {\n    for (const value of iterable) {\n        if (!predicate(value)) return;\n        yield value;\n    }\n}\n\nexport function zipLongest2<T1, T2, D>(xs: Iterable<T1>, ys: Iterable<T2>, filler?: D): Array<[T1 | D, T2 | D]> {\n    return Array.from(izipLongest2(xs, ys, filler));\n}\n\nexport function zipLongest3<T1, T2, T3, D>(\n    xs: Iterable<T1>,\n    ys: Iterable<T2>,\n    zs: Iterable<T3>,\n    filler?: D\n): Array<[T1 | D, T2 | D, T3 | D]> {\n    return Array.from(izipLongest3(xs, ys, zs, filler));\n}\n\nexport const izipLongest = izipLongest2;\nexport const zipLongest = zipLongest2;\n\nexport function zipMany<T>(...iters: Iterable<T>[]): T[][] {\n    return Array.from(izipMany(...iters));\n}\n","import { imap } from './itertools';\nimport { flatten } from './more-itertools';\nimport type { Predicate } from './types';\n\nfunction isDefined<T>(x: T): boolean {\n    return x !== undefined;\n}\n\n/**\n * Returns an iterable, filtering out any `undefined` values from the iterable.\n *\n *     >>> compact([1, 2, undefined, 3])\n *     [1, 2, 3]\n */\nexport function* icompact<T>(iterable: Iterable<T | null | undefined>): Iterable<T> {\n    for (const item of iterable) {\n        if (item != null) {\n            yield item;\n        }\n    }\n}\n\n/**\n * See icompact().\n */\nexport function compact<T>(iterable: Iterable<T | null | undefined>): T[] {\n    return Array.from(icompact(iterable));\n}\n\n/**\n * Removes all undefined values from the given object.  Returns a new object.\n *\n *     >>> compactObject({ a: 1, b: undefined, c: 0 })\n *     { a: 1, c: 0 }\n *\n */\nexport function compactObject<K extends string, V>(obj: Record<K, V | null | undefined>): Record<K, V> {\n    const result = {} as Record<K, V>;\n    for (const [key, value_] of Object.entries(obj)) {\n        const value = value_ as V | null | undefined;\n        if (value != null) {\n            result[key as K] = value;\n        }\n    }\n    return result;\n}\n\n/**\n * Returns the first item in the iterable for which the predicate holds, if\n * any.  If no such item exists, `undefined` is returned.  The default\n * predicate is any defined value.\n */\nexport function find<T>(iterable: Iterable<T>, keyFn?: Predicate<T>): T | undefined {\n    const fn = keyFn || isDefined;\n    for (const value of iterable) {\n        if (fn(value)) {\n            return value;\n        }\n    }\n    return undefined;\n}\n\n/**\n * Returns the first item in the iterable for which the predicate holds, if\n * any.  If no such item exists, `undefined` is returned.  The default\n * predicate is any defined value.\n */\nexport const first = find;\n\n/**\n * Returns 0 or more values for every value in the given iterable.\n * Technically, it's just calling map(), followed by flatten(), but it's a very\n * useful operation if you want to map over a structure, but not have a 1:1\n * input-output mapping.  Instead, if you want to potentially return 0 or more\n * values per input element, use flatmap():\n *\n * For example, to return all numbers `n` in the input iterable `n` times:\n *\n *     >>> const repeatN = n => repeat(n, n);\n *     >>> [...flatmap([0, 1, 2, 3, 4], repeatN)]\n *     [1, 2, 2, 3, 3, 3, 4, 4, 4, 4]  // note: no 0\n *\n */\nexport function flatmap<T, S>(iterable: Iterable<T>, mapper: (item: T) => Iterable<S>): Iterable<S> {\n    return flatten(imap(iterable, mapper));\n}\n","import { first } from './custom';\nimport { count, ifilter, imap, izip, izip3, takewhile } from './itertools';\nimport type { Predicate, Primitive } from './types';\nimport { identityPredicate, keyToCmp, numberIdentity, primitiveIdentity } from './utils';\n\n/**\n * Returns true when all of the items in iterable are truthy.  An optional key\n * function can be used to define what truthiness means for this specific\n * collection.\n *\n * Examples:\n *\n *     all([])                           // => true\n *     all([0])                          // => false\n *     all([0, 1, 2])                    // => false\n *     all([1, 2, 3])                    // => true\n *\n * Examples with using a key function:\n *\n *     all([2, 4, 6], n => n % 2 === 0)  // => true\n *     all([2, 4, 5], n => n % 2 === 0)  // => false\n *\n */\nexport function all<T>(iterable: Iterable<T>, keyFn: Predicate<T> = identityPredicate): boolean {\n    for (const item of iterable) {\n        if (!keyFn(item)) {\n            return false;\n        }\n    }\n\n    return true;\n}\n\n/**\n * Returns true when any of the items in iterable are truthy.  An optional key\n * function can be used to define what truthiness means for this specific\n * collection.\n *\n * Examples:\n *\n *     any([])                           // => false\n *     any([0])                          // => false\n *     any([0, 1, null, undefined])      // => true\n *\n * Examples with using a key function:\n *\n *     any([1, 4, 5], n => n % 2 === 0)  // => true\n *     any([{name: 'Bob'}, {name: 'Alice'}], person => person.name.startsWith('C'))  // => false\n *\n */\nexport function any<T>(iterable: Iterable<T>, keyFn: Predicate<T> = identityPredicate): boolean {\n    for (const item of iterable) {\n        if (keyFn(item)) {\n            return true;\n        }\n    }\n\n    return false;\n}\n\n/**\n * Returns true when any of the items in the iterable are equal to the target object.\n *\n * Examples:\n *\n *     contains([], 'whatever')         // => false\n *     contains([3], 42)                // => false\n *     contains([3], 3)                 // => true\n *     contains([0, 1, 2], 2)           // => true\n *\n */\nexport function contains<T>(haystack: Iterable<T>, needle: T): boolean {\n    return any(haystack, (x) => x === needle);\n}\n\n/**\n * Returns an iterable of enumeration pairs.  Iterable must be a sequence, an\n * iterator, or some other object which supports iteration.  The elements\n * produced by returns a tuple containing a counter value (starting from 0 by\n * default) and the values obtained from iterating over given iterable.\n *\n * Example:\n *\n *     import { enumerate } from 'itertools';\n *\n *     console.log([...enumerate(['hello', 'world'])]);\n *     // [0, 'hello'], [1, 'world']]\n */\nexport function* enumerate<T>(iterable: Iterable<T>, start = 0): Iterable<[number, T]> {\n    let index: number = start;\n    for (const value of iterable) {\n        yield [index++, value];\n    }\n}\n\n/**\n * Non-lazy version of ifilter().\n */\nexport function filter<T>(iterable: Iterable<T>, predicate: Predicate<T>): T[] {\n    return Array.from(ifilter(iterable, predicate));\n}\n\n/**\n * Returns an iterator object for the given iterable.  This can be used to\n * manually get an iterator for any iterable datastructure.  The purpose and\n * main use case of this function is to get a single iterator (a thing with\n * state, think of it as a \"cursor\") which can only be consumed once.\n */\nexport function iter<T>(iterable: Iterable<T>): IterableIterator<T> {\n    // class SelfIter implements IterableIterator<T> {\n    //     #iterator: Iterator<T>;\n    //     constructor(orig: Iterable<T>) {\n    //         this.#iterator = orig[Symbol.iterator]();\n    //     }\n    //     [Symbol.iterator]() {\n    //         return this;\n    //     }\n    //     next() {\n    //         return this.#iterator.next();\n    //     }\n    // }\n    // return new SelfIter(iterable);\n\n    return iterable[Symbol.iterator]() as IterableIterator<T>;\n    //                                 ^^^^^^^^^^^^^^^^^^^^^^ Not safe!\n}\n\n/**\n * Non-lazy version of imap().\n */\nexport function map<T, V>(iterable: Iterable<T>, mapper: (item: T) => V): V[] {\n    return Array.from(imap(iterable, mapper));\n}\n\n/**\n * Return the largest item in an iterable.  Only works for numbers, as ordering\n * is pretty poorly defined on any other data type in JS.  The optional `keyFn`\n * argument specifies a one-argument ordering function like that used for\n * sorted().\n *\n * If the iterable is empty, `undefined` is returned.\n *\n * If multiple items are maximal, the function returns either one of them, but\n * which one is not defined.\n */\nexport function max<T>(iterable: Iterable<T>, keyFn: (item: T) => number = numberIdentity): T | undefined {\n    return reduce_(iterable, (x, y) => (keyFn(x) > keyFn(y) ? x : y));\n}\n\n/**\n * Return the smallest item in an iterable.  Only works for numbers, as\n * ordering is pretty poorly defined on any other data type in JS.  The\n * optional `keyFn` argument specifies a one-argument ordering function like\n * that used for sorted().\n *\n * If the iterable is empty, `undefined` is returned.\n *\n * If multiple items are minimal, the function returns either one of them, but\n * which one is not defined.\n */\nexport function min<T>(iterable: Iterable<T>, keyFn: (item: T) => number = numberIdentity): T | undefined {\n    return reduce_(iterable, (x, y) => (keyFn(x) < keyFn(y) ? x : y));\n}\n\n/**\n * Internal helper for the range function\n */\nfunction _range(start: number, stop: number, step: number): Iterable<number> {\n    const counter = count(start, step);\n    const pred = step >= 0 ? (n: number) => n < stop : (n: number) => n > stop;\n    return takewhile(counter, pred);\n}\n\n/**\n * Returns an iterator producing all the numbers in the given range one by one,\n * starting from `start` (default 0), as long as `i < stop`, in increments of\n * `step` (default 1).\n *\n * `range(a)` is a convenient shorthand for `range(0, a)`.\n *\n * Various valid invocations:\n *\n *     range(5)           // [0, 1, 2, 3, 4]\n *     range(2, 5)        // [2, 3, 4]\n *     range(0, 5, 2)     // [0, 2, 4]\n *     range(5, 0, -1)    // [5, 4, 3, 2, 1]\n *     range(-3)          // []\n *\n * For a positive `step`, the iterator will keep producing values `n` as long\n * as the stop condition `n < stop` is satisfied.\n *\n * For a negative `step`, the iterator will keep producing values `n` as long\n * as the stop condition `n > stop` is satisfied.\n *\n * The produced range will be empty if the first value to produce already does\n * not meet the value constraint.\n */\nexport function range(a: number, ...rest: number[]): Iterable<number> {\n    const args = [a, ...rest]; // \"a\" was only used by Flow to make at least one value mandatory\n    switch (args.length) {\n        case 1:\n            return _range(0, args[0], 1);\n        case 2:\n            return _range(args[0], args[1], 1);\n        case 3:\n            return _range(args[0], args[1], args[2]);\n\n        default:\n            /* c8 ignore next */\n            throw new Error('invalid number of arguments');\n    }\n}\n\n/**\n * Apply function of two arguments cumulatively to the items of sequence, from\n * left to right, so as to reduce the sequence to a single value.  For example:\n *\n *     reduce([1, 2, 3, 4, 5], (x, y) => x + y, 0)\n *\n * calculates\n *\n *     (((((0+1)+2)+3)+4)+5)\n *\n * The left argument, `x`, is the accumulated value and the right argument,\n * `y`, is the update value from the sequence.\n *\n * **Difference between `reduce()` and `reduce\\_()`**:  `reduce()` requires an\n * explicit initializer, whereas `reduce_()` will automatically use the first\n * item in the given iterable as the initializer.  When using `reduce()`, the\n * initializer value is placed before the items of the sequence in the\n * calculation, and serves as a default when the sequence is empty.  When using\n * `reduce_()`, and the given iterable is empty, then no default value can be\n * derived and `undefined` will be returned.\n */\nexport function reduce<T, O>(iterable: Iterable<T>, reducer: (agg: O, item: T, index: number) => O, start: O): O {\n    const it = iter(iterable);\n    let output = start;\n    for (const [index, item] of enumerate(it)) {\n        output = reducer(output, item, index);\n    }\n    return output;\n}\n\n/**\n * See reduce().\n */\nexport function reduce_<T>(iterable: Iterable<T>, reducer: (agg: T, item: T, index: number) => T): T | undefined {\n    const it = iter(iterable);\n    const start = first(it);\n    if (start === undefined) {\n        return undefined;\n    } else {\n        return reduce(it, reducer, start);\n    }\n}\n\n/**\n * Return a new sorted list from the items in iterable.\n *\n * Has two optional arguments:\n *\n * * `keyFn` specifies a function of one argument providing a primitive\n *   identity for each element in the iterable.  that will be used to compare.\n *   The default value is to use a default identity function that is only\n *   defined for primitive types.\n *\n * * `reverse` is a boolean value.  If `true`, then the list elements are\n *   sorted as if each comparison were reversed.\n */\nexport function sorted<T>(\n    iterable: Iterable<T>,\n    keyFn: (item: T) => Primitive = primitiveIdentity,\n    reverse = false\n): T[] {\n    const result = Array.from(iterable);\n    result.sort(keyToCmp(keyFn)); // sort in-place\n\n    if (reverse) {\n        result.reverse(); // reverse in-place\n    }\n\n    return result;\n}\n\n/**\n * Sums the items of an iterable from left to right and returns the total.  The\n * sum will defaults to 0 if the iterable is empty.\n */\nexport function sum(iterable: Iterable<number>): number {\n    return reduce(iterable, (x, y) => x + y, 0);\n}\n\n/**\n * See izip.\n */\nexport function zip<T1, T2>(xs: Iterable<T1>, ys: Iterable<T2>): Array<[T1, T2]> {\n    return Array.from(izip(xs, ys));\n}\n\n/**\n * See izip3.\n */\nexport function zip3<T1, T2, T3>(xs: Iterable<T1>, ys: Iterable<T2>, zs: Iterable<T3>): Array<[T1, T2, T3]> {\n    return Array.from(izip3(xs, ys, zs));\n}\n"]}
+{"version":3,"sources":["../src/utils.ts","../src/more-itertools.ts","../src/itertools.ts","../src/custom.ts","../src/builtins.ts"],"names":["keyToCmp","keyFn","a","b","ka","kb","identityPredicate","x","numberIdentity","primitiveIdentity","chunked","iterable","size","it","iter","chunk","take","flatten","iterableOfIterables","item","itake","n","count","s","pairwise","first","r1","r2","partition","predicate","good","bad","roundrobin","iters","iterables","map","index","result","heads","round","uniqueEverseen","seen","key","uniqueJustseen","last","SENTINEL","composeAnd","f1","f2","slicePredicate","start","stop","step","pred","definedStop","chain","compress","data","selectors","icompress","cycle","saved","element","dropwhile","value","groupby","currentValue","currentKey","targetKey","grouper","tgtKey","nextVal","d","izip","ifilter","imap","mapper","islice","stopOrStart","possiblyStop","i","enumerate","izip2","xs","ys","ixs","iys","y","izip3","zs","izs","z","izipLongest2","filler","filler_","izipMany","all","h","permutations","r","pool","indices","range","cycles","poolgetter","cleanExit","j","p","q","takewhile","zipLongest2","izipLongest","zipLongest","zipMany","isDefined","icompact","compact","compactObject","obj","value_","find","flatmap","every","some","any","contains","haystack","needle","filter","max","reduce2","min","range_","counter","startOrStop","definitelyStop","reduce","reducer","reduce3","output","sorted","reverse","sum","zip","zip3"],"mappings":"AAIO,SAASA,EAAYC,EAAyC,CACjE,MAAO,CAACC,EAAMC,IAAS,CACnB,IAAMC,EAAKH,EAAMC,CAAC,EACZG,EAAKJ,EAAME,CAAC,EAElB,OAAI,OAAOC,GAAO,WAAa,OAAOC,GAAO,UAClCD,IAAOC,EAAK,EAAI,CAACD,GAAMC,EAAK,GAAK,EACjC,OAAOD,GAAO,UAAY,OAAOC,GAAO,SACxCD,EAAKC,EACL,OAAOD,GAAO,UAAY,OAAOC,GAAO,SACxCD,IAAOC,EAAK,EAAID,EAAKC,EAAK,GAAK,EAE/B,EAEf,CACJ,CAEO,SAASC,EAAkBC,EAAqB,CACnD,MAAO,CAAC,CAACA,CACb,CAEO,SAASC,EAAeD,EAAoB,CAE/C,GAAI,OAAOA,GAAM,SACb,MAAM,IAAI,MAAM,wBAAwB,EAE5C,OAAOA,CACX,CAIO,SAASE,EAAkBF,EAAuB,CAErD,GAAI,OAAOA,GAAM,UAAY,OAAOA,GAAM,UAAY,OAAOA,GAAM,UAC/D,MAAM,IAAI,MAAM,kEAAkE,EAEtF,OAAOA,CACX,CCxBO,SAAUG,EAAWC,EAAuBC,EAA6B,CAC5E,GAAIA,EAAO,EACP,MAAM,IAAI,MAAM,uBAAuBA,GAAM,EAGjD,IAAMC,EAAKC,EAAKH,CAAQ,EACxB,OAAS,CACL,IAAMI,EAAQC,EAAKJ,EAAMC,CAAE,EAI3B,GAHIE,EAAM,OAAS,IACf,MAAMA,GAENA,EAAM,OAASH,EACf,OAGZ,CASO,SAAUK,EAAWC,EAAyD,CACjF,QAAWP,KAAYO,EACnB,QAAWC,KAAQR,EACf,MAAMQ,CAGlB,CAmBO,SAAUC,EAASC,EAAWV,EAAoC,CACrE,IAAME,EAAKC,EAAKH,CAAQ,EACpBW,EAAQD,EACZ,KAAOC,KAAU,GAAG,CAChB,IAAMC,EAAIV,EAAG,KAAK,EAClB,GAAI,CAACU,EAAE,KACH,MAAMA,EAAE,UAGR,QAGZ,CAWO,SAAUC,EAAYb,EAAyC,CAClE,IAAME,EAAKC,EAAKH,CAAQ,EAClBc,EAAQZ,EAAG,KAAK,EACtB,GAAIY,EAAM,KACN,OAGJ,IAAIC,EAAQD,EAAM,MAClB,QAAWE,KAAMd,EACb,KAAM,CAACa,EAAIC,CAAE,EACbD,EAAKC,CAEb,CAqBO,SAASC,EAAajB,EAAuBkB,EAAqC,CACrF,IAAMC,EAAO,CAAC,EACRC,EAAM,CAAC,EAEb,QAAWZ,KAAQR,EACXkB,EAAUV,CAAI,EACdW,EAAK,KAAKX,CAAI,EAEdY,EAAI,KAAKZ,CAAI,EAIrB,MAAO,CAACW,EAAMC,CAAG,CACrB,CASO,SAAUC,KAAiBC,EAAmC,CAKjE,IAAMC,EAAgCC,EAAIF,EAAOnB,CAAI,EAErD,KAAOoB,EAAU,OAAS,GAAG,CACzB,IAAIE,EAAQ,EACZ,KAAOA,EAAQF,EAAU,QAAQ,CAE7B,IAAMG,EADKH,EAAUE,CAAK,EACR,KAAK,EAElBC,EAAO,KAORH,EAAU,OAAOE,EAAO,CAAC,GANzB,MAAMC,EAAO,MACbD,MAShB,CAaO,SAAUE,KAAYL,EAA0C,CAKnE,IAAMC,EAAgCC,EAAIF,EAAOnB,CAAI,EAErD,KAAOoB,EAAU,OAAS,GAAG,CACzB,IAAIE,EAAQ,EACNG,EAAQ,CAAC,EACf,KAAOH,EAAQF,EAAU,QAAQ,CAE7B,IAAMG,EADKH,EAAUE,CAAK,EACR,KAAK,EAElBC,EAAO,KAORH,EAAU,OAAOE,EAAO,CAAC,GANzBG,EAAM,KAAKF,EAAO,KAAK,EACvBD,KAQJG,EAAM,OAAS,IACf,MAAMA,GAGlB,CAKO,SAASvB,EAAQK,EAAWV,EAA4B,CAC3D,OAAO,MAAM,KAAKS,EAAMC,EAAGV,CAAQ,CAAC,CACxC,CAWO,SAAU6B,EACb7B,EACAV,EAAgCQ,EACrB,CACX,IAAMgC,EAAO,IAAI,IACjB,QAAWtB,KAAQR,EAAU,CACzB,IAAM+B,EAAMzC,EAAMkB,CAAI,EACjBsB,EAAK,IAAIC,CAAG,IACbD,EAAK,IAAIC,CAAG,EACZ,MAAMvB,GAGlB,CAWO,SAAUwB,EACbhC,EACAV,EAAgCQ,EACrB,CACX,IAAImC,EACJ,QAAWzB,KAAQR,EAAU,CACzB,IAAM+B,EAAMzC,EAAMkB,CAAI,EAClBuB,IAAQE,IACR,MAAMzB,EACNyB,EAAOF,GAGnB,CCjQA,IAAMG,EAAW,OAAO,EAExB,SAASC,EAAWC,EAA6BC,EAAsD,CACnG,OAAQ3B,GAAc0B,EAAG1B,CAAC,GAAK2B,EAAG3B,CAAC,CACvC,CAEA,SAAS4B,GAAeC,EAAeC,EAAqBC,EAAc,CAEtE,GAAIF,EAAQ,EAAG,MAAM,IAAI,MAAM,0BAA0B,EAEzD,GAAIC,IAAS,MAAQA,EAAO,EAAG,MAAM,IAAI,MAAM,yBAAyB,EAExE,GAAIC,EAAO,EAAG,MAAM,IAAI,MAAM,yBAAyB,EAEvD,IAAIC,EAAQhC,GAAcA,GAAK6B,EAE/B,GAAIC,IAAS,KAAM,CACf,IAAMG,EAAcH,EACpBE,EAAOP,EAAWO,EAAOhC,GAAcA,EAAIiC,CAAW,EAG1D,OAAIF,EAAO,IACPC,EAAOP,EAAWO,EAAOhC,IAAeA,EAAI6B,GAASE,IAAS,CAAC,GAG5DC,CACX,CAQO,SAASE,MAAYrB,EAAuC,CAC/D,OAAOjB,EAAQiB,CAAS,CAC5B,CAOO,SAAUZ,EAAM4B,EAAQ,EAAGE,EAAO,EAAqB,CAC1D,IAAI/B,EAAI6B,EACR,OACI,MAAM7B,EACNA,GAAK+B,CAEb,CAKO,SAASI,GAAYC,EAAmBC,EAAmC,CAC9E,OAAO,MAAM,KAAKC,EAAUF,EAAMC,CAAS,CAAC,CAChD,CAOO,SAAUE,GAASjD,EAAoC,CAC1D,IAAMkD,EAAQ,CAAC,EACf,QAAWC,KAAWnD,EAClB,MAAMmD,EACND,EAAM,KAAKC,CAAO,EAGtB,KAAOD,EAAM,OAAS,GAClB,QAAWC,KAAWD,EAClB,MAAMC,CAGlB,CAQO,SAAUC,GAAapD,EAAuBkB,EAAsC,CACvF,IAAMhB,EAAKC,EAAKH,CAAQ,EACxB,QAAWqD,KAASnD,EAChB,GAAI,CAACgB,EAAUmC,CAAK,EAAG,CACnB,MAAMA,EACN,MAIR,QAAWA,KAASnD,EAChB,MAAMmD,CAEd,CAEO,SAAUC,GACbtD,EACAV,EAAwBQ,EAC0B,CAClD,IAAMI,EAAKC,EAAKH,CAAQ,EAEpBuD,EACAC,EAAgBtB,EAEhBuB,EAAeD,EAEbE,EAAU,UAAkBC,EAAoC,CAClE,KAAOH,IAAeG,GAAQ,CAC1B,MAAMJ,EAEN,IAAMK,EAAU1D,EAAG,KAAK,EACxB,GAAI0D,EAAQ,KAAM,OAClBL,EAAeK,EAAQ,MACvBJ,EAAalE,EAAMiE,CAAY,EAEvC,EAEA,OAAS,CACL,KAAOC,IAAeC,GAAW,CAC7B,IAAMG,EAAU1D,EAAG,KAAK,EACxB,GAAI0D,EAAQ,KAAM,CACdJ,EAAatB,EAEb,OAEJqB,EAAeK,EAAQ,MACvBJ,EAAalE,EAAMiE,CAAY,EAGnCE,EAAYD,EACZ,KAAM,CAACA,EAAYE,EAAQD,CAAS,CAAC,EAE7C,CAOO,SAAUT,EAAaF,EAAmBC,EAA2C,CACxF,OAAW,CAACc,EAAGjD,CAAC,IAAKkD,EAAKhB,EAAMC,CAAS,EACjCnC,IACA,MAAMiD,EAGlB,CAQO,SAAUE,EAAW/D,EAAuBkB,EAAsC,CACrF,QAAWmC,KAASrD,EACZkB,EAAUmC,CAAK,IACf,MAAMA,EAGlB,CAMO,SAAUW,EAAWhE,EAAuBiE,EAAqC,CACpF,QAAWZ,KAASrD,EAChB,MAAMiE,EAAOZ,CAAK,CAE1B,CAaO,SAAUa,GACblE,EACAmE,EACAC,EACA3B,EAAO,EACI,CACX,IAAIF,EAAOC,EACP4B,IAAiB,QAEjB7B,EAAQ4B,EACR3B,EAAO4B,IAGP7B,EAAQ,EACRC,EAAO2B,GAGX,IAAMzB,EAAOJ,GAAeC,EAAOC,EAAMC,CAAI,EAC7C,OAAW,CAAC4B,EAAGhB,CAAK,IAAKiB,EAAUtE,CAAQ,EACnC0C,EAAK2B,CAAC,IACN,MAAMhB,EAGlB,CAQO,SAAUkB,EAAcC,EAAkBC,EAAsC,CACnF,IAAMC,EAAMvE,EAAKqE,CAAE,EACbG,EAAMxE,EAAKsE,CAAE,EACnB,OAAS,CACL,IAAM7E,EAAI8E,EAAI,KAAK,EACbE,EAAID,EAAI,KAAK,EACnB,GAAI,CAAC/E,EAAE,MAAQ,CAACgF,EAAE,KACd,KAAM,CAAChF,EAAE,MAAOgF,EAAE,KAAK,MAGvB,QAGZ,CAKO,SAAUC,EAAkBL,EAAkBC,EAAkBK,EAA0C,CAC7G,IAAMJ,EAAMvE,EAAKqE,CAAE,EACbG,EAAMxE,EAAKsE,CAAE,EACbM,EAAM5E,EAAK2E,CAAE,EACnB,OAAS,CACL,IAAMlF,EAAI8E,EAAI,KAAK,EACbE,EAAID,EAAI,KAAK,EACbK,EAAID,EAAI,KAAK,EACnB,GAAI,CAACnF,EAAE,MAAQ,CAACgF,EAAE,MAAQ,CAACI,EAAE,KACzB,KAAM,CAACpF,EAAE,MAAOgF,EAAE,MAAOI,EAAE,KAAK,MAGhC,QAGZ,CAEO,IAAMlB,EAAOS,EAOb,SAAUU,EAAwBT,EAAkBC,EAAkBS,EAAwC,CACjH,IAAMC,EAAUD,EACVR,EAAMvE,EAAKqE,CAAE,EACbG,EAAMxE,EAAKsE,CAAE,EACnB,OAAS,CACL,IAAM7E,EAAI8E,EAAI,KAAK,EACbE,EAAID,EAAI,KAAK,EACnB,GAAI/E,EAAE,MAAQgF,EAAE,KAEZ,OAEA,KAAM,CAAEhF,EAAE,KAAiBuF,EAAVvF,EAAE,MAAkBgF,EAAE,KAAiBO,EAAVP,EAAE,KAAe,EAG3E,CAoCO,SAAUQ,KAAe9D,EAAqC,CAEjE,IAAMC,EAAYD,EAAM,IAAInB,CAAI,EAEhC,OAAS,CACL,IAAMwB,EAA6CJ,EAAU,IAAKiD,GAAOA,EAAG,KAAK,CAAC,EAClF,GAAIa,EAAI1D,EAAQ2D,GAAM,CAACA,EAAE,IAAI,EACzB,MAAM3D,EAAM,IAAK2D,GAAMA,EAAE,KAAU,MAGnC,QAGZ,CAeO,SAAUC,GAAgBvF,EAAuBwF,EAA2B,CAC/E,IAAMC,EAAO,MAAM,KAAKzF,CAAQ,EAC1B,EAAIyF,EAAK,OACT7F,EAAI4F,IAAM,OAAY,EAAIA,EAEhC,GAAI5F,EAAI,EACJ,OAGJ,IAAI8F,EAAoB,MAAM,KAAKC,EAAM,CAAC,CAAC,EACrCC,EAAmB,MAAM,KAAKD,EAAM,EAAG,EAAI/F,EAAG,EAAE,CAAC,EACjDiG,EAAcxB,GAAcoB,EAAKpB,CAAC,EAIxC,IAFA,MAAMqB,EAAQ,MAAM,EAAG9F,CAAC,EAAE,IAAIiG,CAAU,EAEjC,EAAI,GAAG,CACV,IAAIC,EAAY,GAChB,QAAWzB,KAAKsB,EAAM/F,EAAI,EAAG,GAAI,EAAE,EAE/B,GADAgG,EAAOvB,CAAC,GAAK,EACTuB,EAAOvB,CAAC,IAAM,EACdqB,EAAUA,EACL,MAAM,EAAGrB,CAAC,EACV,OAAOqB,EAAQ,MAAMrB,EAAI,CAAC,CAAC,EAC3B,OAAOqB,EAAQ,MAAMrB,EAAGA,EAAI,CAAC,CAAC,EACnCuB,EAAOvB,CAAC,EAAI,EAAIA,MACb,CACH,IAAM0B,EAAYH,EAAOvB,CAAC,EAEpB,CAAC2B,EAAGC,CAAC,EAAI,CAACP,EAAQA,EAAQ,OAASK,CAAC,EAAGL,EAAQrB,CAAC,CAAC,EACvDqB,EAAQrB,CAAC,EAAI2B,EACbN,EAAQA,EAAQ,OAASK,CAAC,EAAIE,EAC9B,MAAMP,EAAQ,MAAM,EAAG9F,CAAC,EAAE,IAAIiG,CAAU,EACxCC,EAAY,GACZ,MAIR,GAAIA,EACA,OAGZ,CAsBO,SAAUI,EAAalG,EAAuBkB,EAAsC,CACvF,QAAWmC,KAASrD,EAAU,CAC1B,GAAI,CAACkB,EAAUmC,CAAK,EAAG,OACvB,MAAMA,EAEd,CAEO,SAAS8C,GAAuB3B,EAAkBC,EAAkBS,EAAqC,CAC5G,OAAO,MAAM,KAAKD,EAAaT,EAAIC,EAAIS,CAAM,CAAC,CAClD,CAWO,IAAMkB,GAAcnB,EACdoB,GAAaF,GAEnB,SAASG,MAAchF,EAA6B,CACvD,OAAO,MAAM,KAAK8D,EAAS,GAAG9D,CAAK,CAAC,CACxC,CCxaA,SAASiF,GAAa3G,EAAe,CACjC,OAAOA,IAAM,MACjB,CAQO,SAAU4G,EAAYxG,EAAuD,CAChF,QAAWQ,KAAQR,EACXQ,GAAQ,OACR,MAAMA,EAGlB,CAKO,SAASiG,GAAWzG,EAA+C,CACtE,OAAO,MAAM,KAAKwG,EAASxG,CAAQ,CAAC,CACxC,CASO,SAAS0G,GAAmCC,EAAoD,CACnG,IAAMjF,EAAS,CAAC,EAChB,OAAW,CAACK,EAAK6E,CAAM,IAAK,OAAO,QAAQD,CAAG,EAAG,CAC7C,IAAMtD,EAAQuD,EACVvD,GAAS,OACT3B,EAAOK,CAAQ,EAAIsB,GAG3B,OAAO3B,CACX,CAOO,SAASmF,EAAQ7G,EAAuBV,EAAqC,CAChF,GAAIA,IAAU,OAAW,CACrB,QAAW+D,KAASrD,EAChB,OAAOqD,EAEX,WACG,CACH,QAAWA,KAASrD,EAChB,GAAIV,EAAM+D,CAAK,EACX,OAAOA,EAGf,OAER,CAKO,SAASvC,EAASd,EAAuBV,EAAqC,CACjF,OAAOuH,EAAK7G,EAAUV,GAAA,KAAAA,EAASiH,EAAS,CAC5C,CAgBO,SAASO,GAAc9G,EAAuBiE,EAA+C,CAChG,OAAO3D,EAAQ0D,EAAKhE,EAAUiE,CAAM,CAAC,CACzC,CCpEO,SAAS8C,EAAS/G,EAAuBV,EAAsBK,EAA4B,CAC9F,QAAWa,KAAQR,EACf,GAAI,CAACV,EAAMkB,CAAI,EACX,MAAO,GAIf,MAAO,EACX,CAmBO,SAASwG,EAAQhH,EAAuBV,EAAsBK,EAA4B,CAC7F,QAAWa,KAAQR,EACf,GAAIV,EAAMkB,CAAI,EACV,MAAO,GAIf,MAAO,EACX,CAKO,IAAM6E,EAAM0B,EAKNE,EAAMD,EAaZ,SAASE,GAAYC,EAAuBC,EAAoB,CACnE,OAAOH,EAAIE,EAAWvH,GAAMA,IAAMwH,CAAM,CAC5C,CAeO,SAAU9C,EAAatE,EAAuBuC,EAAQ,EAA0B,CACnF,IAAId,EAAgBc,EACpB,QAAWc,KAASrD,EAChB,KAAM,CAACyB,IAAS4B,CAAK,CAE7B,CAOO,SAASgE,GAAUrH,EAAuBkB,EAA8B,CAC3E,OAAO,MAAM,KAAK6C,EAAQ/D,EAAUkB,CAAS,CAAC,CAClD,CAQO,SAASf,EAAQH,EAA4C,CAehE,OAAOA,EAAS,OAAO,QAAQ,EAAE,CAErC,CAKO,SAASwB,EAAUxB,EAAuBiE,EAA6B,CAC1E,OAAO,MAAM,KAAKD,EAAKhE,EAAUiE,CAAM,CAAC,CAC5C,CAaO,SAASqD,GAAOtH,EAAuBV,EAA6BO,EAA+B,CACtG,OAAO0H,EAAQvH,EAAU,CAACJ,EAAGgF,IAAOtF,EAAMM,CAAC,EAAIN,EAAMsF,CAAC,EAAIhF,EAAIgF,CAAE,CACpE,CAaO,SAAS4C,GAAOxH,EAAuBV,EAA6BO,EAA+B,CACtG,OAAO0H,EAAQvH,EAAU,CAACJ,EAAGgF,IAAOtF,EAAMM,CAAC,EAAIN,EAAMsF,CAAC,EAAIhF,EAAIgF,CAAE,CACpE,CAKA,SAAS6C,EAAOlF,EAAeC,EAAcC,EAAgC,CACzE,IAAMiF,EAAU/G,EAAM4B,EAAOE,CAAI,EAC3BC,EAAOD,GAAQ,EAAK/B,GAAcA,EAAI8B,EAAQ9B,GAAcA,EAAI8B,EACtE,OAAO0D,EAAUwB,EAAShF,CAAI,CAClC,CA6BO,SAASiD,EAAMgC,EAAqBC,EAAyBnF,EAAO,EAAqB,CAC5F,OAAImF,IAAmB,OACZH,EAAOE,EAA4BC,EAAgBnF,CAAI,EAEvDgF,EAAO,EAAGE,EAA2BlF,CAAI,CAExD,CAyBO,SAASoF,EACZ7H,EACA8H,EACAvF,EACmB,CACnB,OAAIA,IAAU,OACHgF,EAAQvH,EAAU8H,CAAgD,EAElEC,EAAQ/H,EAAU8H,EAAkDvF,CAAK,CAExF,CAEA,SAASwF,EAAc/H,EAAuB8H,EAAgDvF,EAAa,CACvG,IAAIyF,EAASzF,EACTd,EAAQ,EACZ,QAAWjB,KAAQR,EACfgI,EAASF,EAAQE,EAAQxH,EAAMiB,GAAO,EAE1C,OAAOuG,CACX,CAEA,SAAST,EAAWvH,EAAuB8H,EAA+D,CACtG,IAAM5H,EAAKC,EAAKH,CAAQ,EAClBuC,EAAQzB,EAAMZ,CAAE,EACtB,GAAIqC,IAAU,OAGV,OAAOwF,EAAQ7H,EAAI4H,EAASvF,CAAK,CAEzC,CAeO,SAAS0F,GACZjI,EACAV,EAAgCQ,EAChCoI,EAAU,GACP,CACH,IAAMxG,EAAS,MAAM,KAAK1B,CAAQ,EAClC,OAAA0B,EAAO,KAAKrC,EAASC,CAAK,CAAC,EAEvB4I,GACAxG,EAAO,QAAQ,EAGZA,CACX,CAMO,SAASyG,GAAInI,EAAoC,CACpD,OAAO6H,EAAO7H,EAAU,CAACJ,EAAGgF,IAAMhF,EAAIgF,EAAG,CAAC,CAC9C,CAKO,SAASwD,GAAY5D,EAAkBC,EAAmC,CAC7E,OAAO,MAAM,KAAKX,EAAKU,EAAIC,CAAE,CAAC,CAClC,CAKO,SAAS4D,GAAiB7D,EAAkBC,EAAkBK,EAAuC,CACxG,OAAO,MAAM,KAAKD,EAAML,EAAIC,EAAIK,CAAE,CAAC,CACvC","sourcesContent":["import type { Primitive } from './types';\n\ntype CmpFn<T> = (a: T, b: T) => number;\n\nexport function keyToCmp<T>(keyFn: (item: T) => Primitive): CmpFn<T> {\n    return (a: T, b: T) => {\n        const ka = keyFn(a);\n        const kb = keyFn(b);\n        // istanbul ignore else -- @preserve\n        if (typeof ka === 'boolean' && typeof kb === 'boolean') {\n            return ka === kb ? 0 : !ka && kb ? -1 : 1;\n        } else if (typeof ka === 'number' && typeof kb === 'number') {\n            return ka - kb;\n        } else if (typeof ka === 'string' && typeof kb === 'string') {\n            return ka === kb ? 0 : ka < kb ? -1 : 1;\n        } else {\n            return -1;\n        }\n    };\n}\n\nexport function identityPredicate(x: unknown): boolean {\n    return !!x;\n}\n\nexport function numberIdentity(x: unknown): number {\n    // istanbul ignore if -- @preserve\n    if (typeof x !== 'number') {\n        throw new Error('Inputs must be numbers');\n    }\n    return x;\n}\n\nexport function primitiveIdentity<P extends Primitive>(x: P): P;\nexport function primitiveIdentity(x: unknown): Primitive;\nexport function primitiveIdentity(x: unknown): Primitive {\n    // istanbul ignore if -- @preserve\n    if (typeof x !== 'string' && typeof x !== 'number' && typeof x !== 'boolean') {\n        throw new Error('Please provide a key function that can establish object identity');\n    }\n    return x;\n}\n","import { iter, map } from './builtins';\nimport { izip, repeat } from './itertools';\nimport type { Predicate, Primitive } from './types';\nimport { primitiveIdentity } from './utils';\n\n/**\n * Break iterable into lists of length `size`:\n *\n *     [...chunked([1, 2, 3, 4, 5, 6], 3)]\n *     // [[1, 2, 3], [4, 5, 6]]\n *\n * If the length of iterable is not evenly divisible by `size`, the last returned\n * list will be shorter:\n *\n *     [...chunked([1, 2, 3, 4, 5, 6, 7, 8], 3)]\n *     // [[1, 2, 3], [4, 5, 6], [7, 8]]\n */\nexport function* chunked<T>(iterable: Iterable<T>, size: number): Iterable<T[]> {\n    if (size < 1) {\n        throw new Error(`Invalid chunk size: ${size}`);\n    }\n\n    const it = iter(iterable);\n    for (;;) {\n        const chunk = take(size, it);\n        if (chunk.length > 0) {\n            yield chunk;\n        }\n        if (chunk.length < size) {\n            return;\n        }\n    }\n}\n\n/**\n * Return an iterator flattening one level of nesting in a list of lists:\n *\n *     [...flatten([[0, 1], [2, 3]])]\n *     // [0, 1, 2, 3]\n *\n */\nexport function* flatten<T>(iterableOfIterables: Iterable<Iterable<T>>): Iterable<T> {\n    for (const iterable of iterableOfIterables) {\n        for (const item of iterable) {\n            yield item;\n        }\n    }\n}\n\n/**\n * Intersperse filler element `value` among the items in `iterable`.\n *\n *     >>> [...intersperse(-1, range(1, 5))]\n *     [1, -1, 2, -1, 3, -1, 4]\n *\n */\nexport function intersperse<T, V>(value: V, iterable: Iterable<T>): Iterable<T | V> {\n    const stream = flatten(izip(repeat(value), iterable));\n    take(1, stream); // eat away and discard the first value from the output\n    return stream;\n}\n\n/**\n * Returns an iterable containing only the first `n` elements of the given\n * iterable.\n */\nexport function* itake<T>(n: number, iterable: Iterable<T>): Iterable<T> {\n    const it = iter(iterable);\n    let count = n;\n    while (count-- > 0) {\n        const s = it.next();\n        if (!s.done) {\n            yield s.value;\n        } else {\n            // Iterable exhausted, quit early\n            return;\n        }\n    }\n}\n\n/**\n * Returns an iterator of paired items, overlapping, from the original.  When\n * the input iterable has a finite number of items `n`, the outputted iterable\n * will have `n - 1` items.\n *\n *     >>> pairwise([8, 2, 0, 7])\n *     [(8, 2), (2, 0), (0, 7)]\n *\n */\nexport function* pairwise<T>(iterable: Iterable<T>): Iterable<[T, T]> {\n    const it = iter(iterable);\n    const first = it.next();\n    if (first.done) {\n        return;\n    }\n\n    let r1: T = first.value;\n    for (const r2 of it) {\n        yield [r1, r2];\n        r1 = r2;\n    }\n}\n\n/**\n * Returns a 2-tuple of arrays.  Splits the elements in the input iterable into\n * either of the two arrays.  Will fully exhaust the input iterable.  The first\n * array contains all items that match the predicate, the second the rest:\n *\n *     >>> const isOdd = x => x % 2 !== 0;\n *     >>> const iterable = range(10);\n *     >>> const [odds, evens] = partition(iterable, isOdd);\n *     >>> odds\n *     [1, 3, 5, 7, 9]\n *     >>> evens\n *     [0, 2, 4, 6, 8]\n *\n */\nexport function partition<T, N extends T>(\n    iterable: Iterable<T>,\n    predicate: (item: T) => item is N\n): [N[], Exclude<T, N>[]];\nexport function partition<T>(iterable: Iterable<T>, predicate: Predicate<T>): [T[], T[]];\nexport function partition<T>(iterable: Iterable<T>, predicate: Predicate<T>): [T[], T[]] {\n    const good = [];\n    const bad = [];\n\n    for (const item of iterable) {\n        if (predicate(item)) {\n            good.push(item);\n        } else {\n            bad.push(item);\n        }\n    }\n\n    return [good, bad];\n}\n\n/**\n * Yields the next item from each iterable in turn, alternating between them.\n * Continues until all items are exhausted.\n *\n *     >>> [...roundrobin([1, 2, 3], [4], [5, 6, 7, 8])]\n *     [1, 4, 5, 2, 6, 3, 7, 8]\n */\nexport function* roundrobin<T>(...iters: Iterable<T>[]): Iterable<T> {\n    // We'll only keep lazy versions of the input iterables in here that we'll\n    // slowly going to exhaust.  Once an iterable is exhausted, it will be\n    // removed from this list.  Once the entire list is empty, this algorithm\n    // ends.\n    const iterables: Array<Iterator<T>> = map(iters, iter);\n\n    while (iterables.length > 0) {\n        let index = 0;\n        while (index < iterables.length) {\n            const it = iterables[index];\n            const result = it.next();\n\n            if (!result.done) {\n                yield result.value;\n                index++;\n            } else {\n                // This iterable is exhausted, make sure to remove it from the\n                // list of iterables.  We'll splice the array from under our\n                // feet, and NOT advancing the index counter.\n                iterables.splice(index, 1); // intentional side-effect!\n            }\n        }\n    }\n}\n\n/**\n * Yields the heads of all of the given iterables.  This is almost like\n * `roundrobin()`, except that the yielded outputs are grouped in to the\n * \"rounds\":\n *\n *     >>> [...heads([1, 2, 3], [4], [5, 6, 7, 8])]\n *     [[1, 4, 5], [2, 6], [3, 7], [8]]\n *\n * This is also different from `zipLongest()`, since the number of items in\n * each round can decrease over time, rather than being filled with a filler.\n */\nexport function* heads<T>(...iters: Array<Iterable<T>>): Iterable<T[]> {\n    // We'll only keep lazy versions of the input iterables in here that we'll\n    // slowly going to exhaust.  Once an iterable is exhausted, it will be\n    // removed from this list.  Once the entire list is empty, this algorithm\n    // ends.\n    const iterables: Array<Iterator<T>> = map(iters, iter);\n\n    while (iterables.length > 0) {\n        let index = 0;\n        const round = [];\n        while (index < iterables.length) {\n            const it = iterables[index];\n            const result = it.next();\n\n            if (!result.done) {\n                round.push(result.value);\n                index++;\n            } else {\n                // This iterable is exhausted, make sure to remove it from the\n                // list of iterables.  We'll splice the array from under our\n                // feet, and NOT advancing the index counter.\n                iterables.splice(index, 1); // intentional side-effect!\n            }\n        }\n        if (round.length > 0) {\n            yield round;\n        }\n    }\n}\n\n/**\n * Non-lazy version of itake().\n */\nexport function take<T>(n: number, iterable: Iterable<T>): T[] {\n    return Array.from(itake(n, iterable));\n}\n\n/**\n * Yield unique elements, preserving order.\n *\n *     >>> [...uniqueEverseen('AAAABBBCCDAABBB')]\n *     ['A', 'B', 'C', 'D']\n *     >>> [...uniqueEverseen('AbBCcAB', s => s.toLowerCase())]\n *     ['A', 'b', 'C']\n *\n */\nexport function* uniqueEverseen<T>(\n    iterable: Iterable<T>,\n    keyFn: (item: T) => Primitive = primitiveIdentity\n): Iterable<T> {\n    const seen = new Set();\n    for (const item of iterable) {\n        const key = keyFn(item);\n        if (!seen.has(key)) {\n            seen.add(key);\n            yield item;\n        }\n    }\n}\n\n/**\n * Yields elements in order, ignoring serial duplicates.\n *\n *     >>> [...uniqueJustseen('AAAABBBCCDAABBB')]\n *     ['A', 'B', 'C', 'D', 'A', 'B']\n *     >>> [...uniqueJustseen('AbBCcAB', s => s.toLowerCase())]\n *     ['A', 'b', 'C', 'A', 'B']\n *\n */\nexport function* uniqueJustseen<T>(\n    iterable: Iterable<T>,\n    keyFn: (item: T) => Primitive = primitiveIdentity\n): Iterable<T> {\n    let last = undefined;\n    for (const item of iterable) {\n        const key = keyFn(item);\n        if (key !== last) {\n            yield item;\n            last = key;\n        }\n    }\n}\n","import { all, enumerate, iter, range } from './builtins';\nimport { flatten } from './more-itertools';\nimport type { Predicate, Primitive } from './types';\nimport { primitiveIdentity } from './utils';\n\nconst SENTINEL = Symbol();\n\nfunction composeAnd(f1: (v1: number) => boolean, f2: (v2: number) => boolean): (v3: number) => boolean {\n    return (n: number) => f1(n) && f2(n);\n}\n\nfunction slicePredicate(start: number, stop: number | null, step: number) {\n    // istanbul ignore if -- @preserve\n    if (start < 0) throw new Error('start cannot be negative');\n    // istanbul ignore if -- @preserve\n    if (stop !== null && stop < 0) throw new Error('stop cannot be negative');\n    // istanbul ignore if -- @preserve\n    if (step < 0) throw new Error('step cannot be negative');\n\n    let pred = (n: number) => n >= start;\n\n    if (stop !== null) {\n        const definedStop = stop;\n        pred = composeAnd(pred, (n: number) => n < definedStop);\n    }\n\n    if (step > 1) {\n        pred = composeAnd(pred, (n: number) => (n - start) % step === 0);\n    }\n\n    return pred;\n}\n\n/**\n * Returns an iterator that returns elements from the first iterable until it\n * is exhausted, then proceeds to the next iterable, until all of the iterables\n * are exhausted.  Used for treating consecutive sequences as a single\n * sequence.\n */\nexport function chain<T>(...iterables: Iterable<T>[]): Iterable<T> {\n    return flatten(iterables);\n}\n\n/**\n * Returns an iterator that counts up values starting with number `start`\n * (default 0), incrementing by `step`.  To decrement, use a negative step\n * number.\n */\nexport function* count(start = 0, step = 1): Iterable<number> {\n    let n = start;\n    for (;;) {\n        yield n;\n        n += step;\n    }\n}\n\n/**\n * Non-lazy version of icompress().\n */\nexport function compress<T>(data: Iterable<T>, selectors: Iterable<boolean>): T[] {\n    return Array.from(icompress(data, selectors));\n}\n\n/**\n * Returns an iterator producing elements from the iterable and saving a copy\n * of each.  When the iterable is exhausted, return elements from the saved\n * copy.  Repeats indefinitely.\n */\nexport function* cycle<T>(iterable: Iterable<T>): Iterable<T> {\n    const saved = [];\n    for (const element of iterable) {\n        yield element;\n        saved.push(element);\n    }\n\n    while (saved.length > 0) {\n        for (const element of saved) {\n            yield element;\n        }\n    }\n}\n\n/**\n * Returns an iterator that drops elements from the iterable as long as the\n * predicate is true; afterwards, returns every remaining element.  Note, the\n * iterator does not produce any output until the predicate first becomes\n * false.\n */\nexport function* dropwhile<T>(iterable: Iterable<T>, predicate: Predicate<T>): Iterable<T> {\n    const it = iter(iterable);\n    for (const value of it) {\n        if (!predicate(value)) {\n            yield value;\n            break;\n        }\n    }\n\n    for (const value of it) {\n        yield value;\n    }\n}\n\nexport function* groupby<T, K extends Primitive>(\n    iterable: Iterable<T>,\n    keyFn: (item: T) => K = primitiveIdentity\n): Generator<[K, Generator<T, undefined>], undefined> {\n    const it = iter(iterable);\n\n    let currentValue: T;\n    let currentKey: K = SENTINEL as unknown as K;\n    //                           ^^^^^^^^^^^^^^^ Hack!\n    let targetKey: K = currentKey;\n\n    const grouper = function* grouper(tgtKey: K): Generator<T, undefined> {\n        while (currentKey === tgtKey) {\n            yield currentValue;\n\n            const nextVal = it.next();\n            if (nextVal.done) return;\n            currentValue = nextVal.value;\n            currentKey = keyFn(currentValue);\n        }\n    };\n\n    for (;;) {\n        while (currentKey === targetKey) {\n            const nextVal = it.next();\n            if (nextVal.done) {\n                currentKey = SENTINEL as unknown as K;\n                //                    ^^^^^^^^^^^^^^^ Hack!\n                return;\n            }\n            currentValue = nextVal.value;\n            currentKey = keyFn(currentValue);\n        }\n\n        targetKey = currentKey;\n        yield [currentKey, grouper(targetKey)];\n    }\n}\n\n/**\n * Returns an iterator that filters elements from data returning only those\n * that have a corresponding element in selectors that evaluates to `true`.\n * Stops when either the data or selectors iterables has been exhausted.\n */\nexport function* icompress<T>(data: Iterable<T>, selectors: Iterable<boolean>): Iterable<T> {\n    for (const [d, s] of izip(data, selectors)) {\n        if (s) {\n            yield d;\n        }\n    }\n}\n\n/**\n * Returns an iterator that filters elements from iterable returning only those\n * for which the predicate is true.\n */\nexport function ifilter<T, N extends T>(iterable: Iterable<T>, predicate: (item: T) => item is N): Iterable<N>;\nexport function ifilter<T>(iterable: Iterable<T>, predicate: Predicate<T>): Iterable<T>;\nexport function* ifilter<T>(iterable: Iterable<T>, predicate: Predicate<T>): Iterable<T> {\n    for (const value of iterable) {\n        if (predicate(value)) {\n            yield value;\n        }\n    }\n}\n\n/**\n * Returns an iterator that computes the given mapper function using arguments\n * from each of the iterables.\n */\nexport function* imap<T, V>(iterable: Iterable<T>, mapper: (item: T) => V): Iterable<V> {\n    for (const value of iterable) {\n        yield mapper(value);\n    }\n}\n\n/**\n * Returns an iterator that returns selected elements from the iterable.  If\n * `start` is non-zero, then elements from the iterable are skipped until start\n * is reached.  Then, elements are returned by making steps of `step` (defaults\n * to 1).  If set to higher than 1, items will be skipped.  If `stop` is\n * provided, then iteration continues until the iterator reached that index,\n * otherwise, the iterable will be fully exhausted.  `islice()` does not\n * support negative values for `start`, `stop`, or `step`.\n */\nexport function islice<T>(iterable: Iterable<T>, stop: number): Iterable<T>;\nexport function islice<T>(iterable: Iterable<T>, start: number, stop?: number | null, step?: number): Iterable<T>;\nexport function* islice<T>(\n    iterable: Iterable<T>,\n    stopOrStart: number,\n    possiblyStop?: number | null,\n    step = 1\n): Iterable<T> {\n    let start, stop;\n    if (possiblyStop !== undefined) {\n        // islice(iterable, start, stop[, step])\n        start = stopOrStart;\n        stop = possiblyStop;\n    } else {\n        // islice(iterable, stop)\n        start = 0;\n        stop = stopOrStart;\n    }\n\n    const pred = slicePredicate(start, stop, step);\n    for (const [i, value] of enumerate(iterable)) {\n        if (pred(i)) {\n            yield value;\n        }\n    }\n}\n\n/**\n * Returns an iterator that aggregates elements from each of the iterables.\n * Used for lock-step iteration over several iterables at a time.  When\n * iterating over two iterables, use `izip2`.  When iterating over three\n * iterables, use `izip3`, etc.  `izip` is an alias for `izip2`.\n */\nexport function* izip2<T1, T2>(xs: Iterable<T1>, ys: Iterable<T2>): Iterable<[T1, T2]> {\n    const ixs = iter(xs);\n    const iys = iter(ys);\n    for (;;) {\n        const x = ixs.next();\n        const y = iys.next();\n        if (!x.done && !y.done) {\n            yield [x.value, y.value];\n        } else {\n            // One of the iterables exhausted\n            return;\n        }\n    }\n}\n\n/**\n * Like izip2, but for three input iterables.\n */\nexport function* izip3<T1, T2, T3>(xs: Iterable<T1>, ys: Iterable<T2>, zs: Iterable<T3>): Iterable<[T1, T2, T3]> {\n    const ixs = iter(xs);\n    const iys = iter(ys);\n    const izs = iter(zs);\n    for (;;) {\n        const x = ixs.next();\n        const y = iys.next();\n        const z = izs.next();\n        if (!x.done && !y.done && !z.done) {\n            yield [x.value, y.value, z.value];\n        } else {\n            // One of the iterables exhausted\n            return;\n        }\n    }\n}\n\nexport const izip = izip2;\n\n/**\n * Returns an iterator that aggregates elements from each of the iterables.  If\n * the iterables are of uneven length, missing values are filled-in with\n * fillvalue.  Iteration continues until the longest iterable is exhausted.\n */\nexport function* izipLongest2<T1, T2, D>(xs: Iterable<T1>, ys: Iterable<T2>, filler?: D): Iterable<[T1 | D, T2 | D]> {\n    const filler_ = filler as D;\n    const ixs = iter(xs);\n    const iys = iter(ys);\n    for (;;) {\n        const x = ixs.next();\n        const y = iys.next();\n        if (x.done && y.done) {\n            // All iterables exhausted\n            return;\n        } else {\n            yield [!x.done ? x.value : filler_, !y.done ? y.value : filler_];\n        }\n    }\n}\n\n/**\n * See izipLongest2, but for three.\n */\nexport function* izipLongest3<T1, T2, T3, D = undefined>(\n    xs: Iterable<T1>,\n    ys: Iterable<T2>,\n    zs: Iterable<T3>,\n    filler?: D\n): Iterable<[T1 | D, T2 | D, T3 | D]> {\n    const filler_ = filler as D;\n    const ixs = iter(xs);\n    const iys = iter(ys);\n    const izs = iter(zs);\n    for (;;) {\n        const x = ixs.next();\n        const y = iys.next();\n        const z = izs.next();\n        if (x.done && y.done && z.done) {\n            // All iterables exhausted\n            return;\n        } else {\n            yield [!x.done ? x.value : filler_, !y.done ? y.value : filler_, !z.done ? z.value : filler_];\n        }\n    }\n}\n\n/**\n * Like the other izips (`izip`, `izip3`, etc), but generalized to take an\n * unlimited amount of input iterables.  Think `izip(*iterables)` in Python.\n *\n * **Note:** Due to Flow type system limitations, you can only \"generially\" zip\n * iterables with homogeneous types, so you cannot mix types like <A, B> like\n * you can with izip2().\n */\nexport function* izipMany<T>(...iters: Iterable<T>[]): Iterable<T[]> {\n    // Make them all iterables\n    const iterables = iters.map(iter);\n\n    for (;;) {\n        const heads: Array<IteratorResult<T, undefined>> = iterables.map((xs) => xs.next());\n        if (all(heads, (h) => !h.done)) {\n            yield heads.map((h) => h.value as T);\n        } else {\n            // One of the iterables exhausted\n            return;\n        }\n    }\n}\n\n/**\n * Return successive `r`-length permutations of elements in the iterable.\n *\n * If `r` is not specified, then `r` defaults to the length of the iterable and\n * all possible full-length permutations are generated.\n *\n * Permutations are emitted in lexicographic sort order.  So, if the input\n * iterable is sorted, the permutation tuples will be produced in sorted order.\n *\n * Elements are treated as unique based on their position, not on their value.\n * So if the input elements are unique, there will be no repeat values in each\n * permutation.\n */\nexport function* permutations<T>(iterable: Iterable<T>, r?: number): Iterable<T[]> {\n    const pool = Array.from(iterable);\n    const n = pool.length;\n    const x = r === undefined ? n : r;\n\n    if (x > n) {\n        return;\n    }\n\n    let indices: number[] = Array.from(range(n));\n    const cycles: number[] = Array.from(range(n, n - x, -1));\n    const poolgetter = (i: number) => pool[i];\n\n    yield indices.slice(0, x).map(poolgetter);\n\n    while (n > 0) {\n        let cleanExit = true;\n        for (const i of range(x - 1, -1, -1)) {\n            cycles[i] -= 1;\n            if (cycles[i] === 0) {\n                indices = indices\n                    .slice(0, i)\n                    .concat(indices.slice(i + 1))\n                    .concat(indices.slice(i, i + 1));\n                cycles[i] = n - i;\n            } else {\n                const j: number = cycles[i];\n\n                const [p, q] = [indices[indices.length - j], indices[i]];\n                indices[i] = p;\n                indices[indices.length - j] = q;\n                yield indices.slice(0, x).map(poolgetter);\n                cleanExit = false;\n                break;\n            }\n        }\n\n        if (cleanExit) {\n            return;\n        }\n    }\n}\n\n/**\n * Returns an iterator that produces values over and over again.  Runs\n * indefinitely unless the times argument is specified.\n */\nexport function* repeat<T>(thing: T, times?: number): Iterable<T> {\n    if (times === undefined) {\n        for (;;) {\n            yield thing;\n        }\n    } else {\n        for (const _ of range(times)) {\n            yield thing;\n        }\n    }\n}\n\n/**\n * Returns an iterator that produces elements from the iterable as long as the\n * predicate is true.\n */\nexport function* takewhile<T>(iterable: Iterable<T>, predicate: Predicate<T>): Iterable<T> {\n    for (const value of iterable) {\n        if (!predicate(value)) return;\n        yield value;\n    }\n}\n\nexport function zipLongest2<T1, T2, D>(xs: Iterable<T1>, ys: Iterable<T2>, filler?: D): Array<[T1 | D, T2 | D]> {\n    return Array.from(izipLongest2(xs, ys, filler));\n}\n\nexport function zipLongest3<T1, T2, T3, D>(\n    xs: Iterable<T1>,\n    ys: Iterable<T2>,\n    zs: Iterable<T3>,\n    filler?: D\n): Array<[T1 | D, T2 | D, T3 | D]> {\n    return Array.from(izipLongest3(xs, ys, zs, filler));\n}\n\nexport const izipLongest = izipLongest2;\nexport const zipLongest = zipLongest2;\n\nexport function zipMany<T>(...iters: Iterable<T>[]): T[][] {\n    return Array.from(izipMany(...iters));\n}\n","import { imap } from './itertools';\nimport { flatten } from './more-itertools';\nimport type { Predicate } from './types';\n\nfunction isDefined<T>(x: T): boolean {\n    return x !== undefined;\n}\n\n/**\n * Returns an iterable, filtering out any `undefined` values from the iterable.\n *\n *     >>> compact([1, 2, undefined, 3])\n *     [1, 2, 3]\n */\nexport function* icompact<T>(iterable: Iterable<T | null | undefined>): Iterable<T> {\n    for (const item of iterable) {\n        if (item != null) {\n            yield item;\n        }\n    }\n}\n\n/**\n * See icompact().\n */\nexport function compact<T>(iterable: Iterable<T | null | undefined>): T[] {\n    return Array.from(icompact(iterable));\n}\n\n/**\n * Removes all undefined values from the given object.  Returns a new object.\n *\n *     >>> compactObject({ a: 1, b: undefined, c: 0 })\n *     { a: 1, c: 0 }\n *\n */\nexport function compactObject<K extends string, V>(obj: Record<K, V | null | undefined>): Record<K, V> {\n    const result = {} as Record<K, V>;\n    for (const [key, value_] of Object.entries(obj)) {\n        const value = value_ as V | null | undefined;\n        if (value != null) {\n            result[key as K] = value;\n        }\n    }\n    return result;\n}\n\n/**\n * Returns the first item in the iterable for which the predicate holds, if\n * any. If no predicate is given, it will return the first value returned by\n * the iterable.\n */\nexport function find<T>(iterable: Iterable<T>, keyFn?: Predicate<T>): T | undefined {\n    if (keyFn === undefined) {\n        for (const value of iterable) {\n            return value;\n        }\n        return undefined;\n    } else {\n        for (const value of iterable) {\n            if (keyFn(value)) {\n                return value;\n            }\n        }\n        return undefined;\n    }\n}\n\n/**\n * Almost an alias of find(). The key difference is that if an empty\n */\nexport function first<T>(iterable: Iterable<T>, keyFn?: Predicate<T>): T | undefined {\n    return find(iterable, keyFn ?? isDefined);\n}\n\n/**\n * Returns 0 or more values for every value in the given iterable.\n * Technically, it's just calling map(), followed by flatten(), but it's a very\n * useful operation if you want to map over a structure, but not have a 1:1\n * input-output mapping.  Instead, if you want to potentially return 0 or more\n * values per input element, use flatmap():\n *\n * For example, to return all numbers `n` in the input iterable `n` times:\n *\n *     >>> const repeatN = n => repeat(n, n);\n *     >>> [...flatmap([0, 1, 2, 3, 4], repeatN)]\n *     [1, 2, 2, 3, 3, 3, 4, 4, 4, 4]  // note: no 0\n *\n */\nexport function flatmap<T, S>(iterable: Iterable<T>, mapper: (item: T) => Iterable<S>): Iterable<S> {\n    return flatten(imap(iterable, mapper));\n}\n","import { first } from './custom';\nimport { count, ifilter, imap, izip, izip3, takewhile } from './itertools';\nimport type { Predicate, Primitive } from './types';\nimport { identityPredicate, keyToCmp, numberIdentity, primitiveIdentity } from './utils';\n\n/**\n * Returns true when all of the items in iterable are truthy.  An optional key\n * function can be used to define what truthiness means for this specific\n * collection.\n *\n * Examples:\n *\n *     all([])                           // => true\n *     all([0])                          // => false\n *     all([0, 1, 2])                    // => false\n *     all([1, 2, 3])                    // => true\n *\n * Examples with using a key function:\n *\n *     all([2, 4, 6], n => n % 2 === 0)  // => true\n *     all([2, 4, 5], n => n % 2 === 0)  // => false\n *\n */\nexport function every<T>(iterable: Iterable<T>, keyFn: Predicate<T> = identityPredicate): boolean {\n    for (const item of iterable) {\n        if (!keyFn(item)) {\n            return false;\n        }\n    }\n\n    return true;\n}\n\n/**\n * Returns true when any of the items in iterable are truthy.  An optional key\n * function can be used to define what truthiness means for this specific\n * collection.\n *\n * Examples:\n *\n *     any([])                           // => false\n *     any([0])                          // => false\n *     any([0, 1, null, undefined])      // => true\n *\n * Examples with using a key function:\n *\n *     any([1, 4, 5], n => n % 2 === 0)  // => true\n *     any([{name: 'Bob'}, {name: 'Alice'}], person => person.name.startsWith('C'))  // => false\n *\n */\nexport function some<T>(iterable: Iterable<T>, keyFn: Predicate<T> = identityPredicate): boolean {\n    for (const item of iterable) {\n        if (keyFn(item)) {\n            return true;\n        }\n    }\n\n    return false;\n}\n\n/**\n * Alias of `every()`.\n */\nexport const all = every;\n\n/**\n * Alias of `some()`.\n */\nexport const any = some;\n\n/**\n * Returns true when any of the items in the iterable are equal to the target object.\n *\n * Examples:\n *\n *     contains([], 'whatever')         // => false\n *     contains([3], 42)                // => false\n *     contains([3], 3)                 // => true\n *     contains([0, 1, 2], 2)           // => true\n *\n */\nexport function contains<T>(haystack: Iterable<T>, needle: T): boolean {\n    return any(haystack, (x) => x === needle);\n}\n\n/**\n * Returns an iterable of enumeration pairs.  Iterable must be a sequence, an\n * iterator, or some other object which supports iteration.  The elements\n * produced by returns a tuple containing a counter value (starting from 0 by\n * default) and the values obtained from iterating over given iterable.\n *\n * Example:\n *\n *     import { enumerate } from 'itertools';\n *\n *     console.log([...enumerate(['hello', 'world'])]);\n *     // [0, 'hello'], [1, 'world']]\n */\nexport function* enumerate<T>(iterable: Iterable<T>, start = 0): Iterable<[number, T]> {\n    let index: number = start;\n    for (const value of iterable) {\n        yield [index++, value];\n    }\n}\n\n/**\n * Non-lazy version of ifilter().\n */\nexport function filter<T, N extends T>(iterable: Iterable<T>, predicate: (item: T) => item is N): N[];\nexport function filter<T>(iterable: Iterable<T>, predicate: Predicate<T>): T[];\nexport function filter<T>(iterable: Iterable<T>, predicate: Predicate<T>): T[] {\n    return Array.from(ifilter(iterable, predicate));\n}\n\n/**\n * Returns an iterator object for the given iterable.  This can be used to\n * manually get an iterator for any iterable datastructure.  The purpose and\n * main use case of this function is to get a single iterator (a thing with\n * state, think of it as a \"cursor\") which can only be consumed once.\n */\nexport function iter<T>(iterable: Iterable<T>): IterableIterator<T> {\n    // class SelfIter implements IterableIterator<T> {\n    //     #iterator: Iterator<T>;\n    //     constructor(orig: Iterable<T>) {\n    //         this.#iterator = orig[Symbol.iterator]();\n    //     }\n    //     [Symbol.iterator]() {\n    //         return this;\n    //     }\n    //     next() {\n    //         return this.#iterator.next();\n    //     }\n    // }\n    // return new SelfIter(iterable);\n\n    return iterable[Symbol.iterator]() as IterableIterator<T>;\n    //                                 ^^^^^^^^^^^^^^^^^^^^^^ Not safe!\n}\n\n/**\n * Non-lazy version of imap().\n */\nexport function map<T, V>(iterable: Iterable<T>, mapper: (item: T) => V): V[] {\n    return Array.from(imap(iterable, mapper));\n}\n\n/**\n * Return the largest item in an iterable.  Only works for numbers, as ordering\n * is pretty poorly defined on any other data type in JS.  The optional `keyFn`\n * argument specifies a one-argument ordering function like that used for\n * sorted().\n *\n * If the iterable is empty, `undefined` is returned.\n *\n * If multiple items are maximal, the function returns either one of them, but\n * which one is not defined.\n */\nexport function max<T>(iterable: Iterable<T>, keyFn: (item: T) => number = numberIdentity): T | undefined {\n    return reduce2(iterable, (x, y) => (keyFn(x) > keyFn(y) ? x : y));\n}\n\n/**\n * Return the smallest item in an iterable.  Only works for numbers, as\n * ordering is pretty poorly defined on any other data type in JS.  The\n * optional `keyFn` argument specifies a one-argument ordering function like\n * that used for sorted().\n *\n * If the iterable is empty, `undefined` is returned.\n *\n * If multiple items are minimal, the function returns either one of them, but\n * which one is not defined.\n */\nexport function min<T>(iterable: Iterable<T>, keyFn: (item: T) => number = numberIdentity): T | undefined {\n    return reduce2(iterable, (x, y) => (keyFn(x) < keyFn(y) ? x : y));\n}\n\n/**\n * Internal helper for the range function\n */\nfunction range_(start: number, stop: number, step: number): Iterable<number> {\n    const counter = count(start, step);\n    const pred = step >= 0 ? (n: number) => n < stop : (n: number) => n > stop;\n    return takewhile(counter, pred);\n}\n\n/**\n * Returns an iterator producing all the numbers in the given range one by one,\n * starting from `start` (default 0), as long as `i < stop`, in increments of\n * `step` (default 1).\n *\n * `range(a)` is a convenient shorthand for `range(0, a)`.\n *\n * Various valid invocations:\n *\n *     range(5)           // [0, 1, 2, 3, 4]\n *     range(2, 5)        // [2, 3, 4]\n *     range(0, 5, 2)     // [0, 2, 4]\n *     range(5, 0, -1)    // [5, 4, 3, 2, 1]\n *     range(-3)          // []\n *\n * For a positive `step`, the iterator will keep producing values `n` as long\n * as the stop condition `n < stop` is satisfied.\n *\n * For a negative `step`, the iterator will keep producing values `n` as long\n * as the stop condition `n > stop` is satisfied.\n *\n * The produced range will be empty if the first value to produce already does\n * not meet the value constraint.\n */\n\nexport function range(stop: number): Iterable<number>;\nexport function range(start: number, stop: number, step?: number): Iterable<number>;\nexport function range(startOrStop: number, definitelyStop?: number, step = 1): Iterable<number> {\n    if (definitelyStop !== undefined) {\n        return range_(startOrStop /* as start */, definitelyStop, step);\n    } else {\n        return range_(0, startOrStop /* as stop */, step);\n    }\n}\n\n/**\n * Apply function of two arguments cumulatively to the items of sequence, from\n * left to right, so as to reduce the sequence to a single value.  For example:\n *\n *     reduce([1, 2, 3, 4, 5], (x, y) => x + y, 0)\n *\n * calculates\n *\n *     (((((0+1)+2)+3)+4)+5)\n *\n * The left argument, `x`, is the accumulated value and the right argument,\n * `y`, is the update value from the sequence.\n *\n * **Difference between `reduce()` and `reduce\\_()`**:  `reduce()` requires an\n * explicit initializer, whereas `reduce_()` will automatically use the first\n * item in the given iterable as the initializer.  When using `reduce()`, the\n * initializer value is placed before the items of the sequence in the\n * calculation, and serves as a default when the sequence is empty.  When using\n * `reduce_()`, and the given iterable is empty, then no default value can be\n * derived and `undefined` will be returned.\n */\nexport function reduce<T>(iterable: Iterable<T>, reducer: (agg: T, item: T, index: number) => T): T | undefined;\nexport function reduce<T, O>(iterable: Iterable<T>, reducer: (agg: O, item: T, index: number) => O, start: O): O;\nexport function reduce<T, O>(\n    iterable: Iterable<T>,\n    reducer: ((agg: T, item: T, index: number) => T) | ((agg: O, item: T, index: number) => O),\n    start?: O\n): O | (T | undefined) {\n    if (start === undefined) {\n        return reduce2(iterable, reducer as (agg: T, item: T, index: number) => T);\n    } else {\n        return reduce3(iterable, reducer as (agg: O, item: T, index: number) => O, start);\n    }\n}\n\nfunction reduce3<T, O>(iterable: Iterable<T>, reducer: (agg: O, item: T, index: number) => O, start: O): O {\n    let output = start;\n    let index = 0;\n    for (const item of iterable) {\n        output = reducer(output, item, index++);\n    }\n    return output;\n}\n\nfunction reduce2<T>(iterable: Iterable<T>, reducer: (agg: T, item: T, index: number) => T): T | undefined {\n    const it = iter(iterable);\n    const start = first(it);\n    if (start === undefined) {\n        return undefined;\n    } else {\n        return reduce3(it, reducer, start);\n    }\n}\n\n/**\n * Return a new sorted list from the items in iterable.\n *\n * Has two optional arguments:\n *\n * * `keyFn` specifies a function of one argument providing a primitive\n *   identity for each element in the iterable.  that will be used to compare.\n *   The default value is to use a default identity function that is only\n *   defined for primitive types.\n *\n * * `reverse` is a boolean value.  If `true`, then the list elements are\n *   sorted as if each comparison were reversed.\n */\nexport function sorted<T>(\n    iterable: Iterable<T>,\n    keyFn: (item: T) => Primitive = primitiveIdentity,\n    reverse = false\n): T[] {\n    const result = Array.from(iterable);\n    result.sort(keyToCmp(keyFn)); // sort in-place\n\n    if (reverse) {\n        result.reverse(); // reverse in-place\n    }\n\n    return result;\n}\n\n/**\n * Sums the items of an iterable from left to right and returns the total.  The\n * sum will defaults to 0 if the iterable is empty.\n */\nexport function sum(iterable: Iterable<number>): number {\n    return reduce(iterable, (x, y) => x + y, 0);\n}\n\n/**\n * See izip.\n */\nexport function zip<T1, T2>(xs: Iterable<T1>, ys: Iterable<T2>): Array<[T1, T2]> {\n    return Array.from(izip(xs, ys));\n}\n\n/**\n * See izip3.\n */\nexport function zip3<T1, T2, T3>(xs: Iterable<T1>, ys: Iterable<T2>, zs: Iterable<T3>): Array<[T1, T2, T3]> {\n    return Array.from(izip3(xs, ys, zs));\n}\n"]}

package/dist/index.mjs

@@ -1,2 +1,4 @@
-function V(e){return(r,t)=>{let n=e(r),o=e(t);return typeof n=="boolean"&&typeof o=="boolean"?n===o?0:!n&&o?-1:1:typeof n=="number"&&typeof o=="number"?n-o:typeof n=="string"&&typeof o=="string"?n===o?0:n<o?-1:1:-1}}function y(e){return!!e}function x(e){if(typeof e!="number")throw new Error("Inputs must be numbers");return e}function s(e){if(typeof e!="string"&&typeof e!="number"&&typeof e!="boolean")throw new Error("Please provide a key function that can establish object identity");return e}function*J(e,r){let t=a(e),n=t.next();if(n.done)return;let o=[n.value];for(let i of t)o.push(i),o.length===r&&(yield o,o=[]);o.length>0&&(yield o)}function*T(e){for(let r of e)for(let t of r)yield t}function*K(e,r){let t=a(r),n=e;for(;n-- >0;){let o=t.next();if(!o.done)yield o.value;else return}}function*N(e){let r=a(e),t=r.next();if(t.done)return;let n=t.value;for(let o of r)yield[n,o],n=o}function B(e,r){let t=[],n=[];for(let o of e)r(o)?t.push(o):n.push(o);return[t,n]}function*H(...e){let r=m(e,a);for(;r.length>0;){let t=0;for(;t<r.length;){let o=r[t].next();o.done?r.splice(t,1):(yield o.value,t++)}}}function*Q(...e){let r=m(e,a);for(;r.length>0;){let t=0,n=[];for(;t<r.length;){let i=r[t].next();i.done?r.splice(t,1):(n.push(i.value),t++)}n.length>0&&(yield n)}}function U(e,r){return Array.from(K(e,r))}function*W(e,r=s){let t=new Set;for(let n of e){let o=r(n);t.has(o)||(t.add(o),yield n)}}function*X(e,r=s){let t;for(let n of e){let o=r(n);o!==t&&(yield n,t=o)}}var E=Symbol();function L(e,r){return t=>e(t)&&r(t)}function Y(e,r,t){if(e<0)throw new Error("start cannot be negative");if(r!==null&&r<0)throw new Error("stop cannot be negative");if(t<0)throw new Error("step cannot be negative");let n=e,o=r;o===void 0&&([n,o]=[0,n]);let i=l=>l>=n;if(o!==null){let l=o;i=L(i,u=>u<l)}return t>1&&(i=L(i,l=>(l-n)%t===0)),i}function Z(...e){return T(e)}function*v(e=0,r=1){let t=e;for(;;)yield t,t+=r}function $(e,r){return Array.from(_(e,r))}function*F(e){let r=[];for(let t of e)yield t,r.push(t);for(;r.length>0;)for(let t of r)yield t}function*ee(e,r){let t=a(e);for(let n of t)if(!r(n)){yield n;break}for(let n of t)yield n}function*te(e,r=s){let t=a(e),n,o=E,i=o,l=function*(c){for(;o===c;){yield n;let f=t.next();if(f.done)return;n=f.value,o=r(n)}};for(;;){for(;o===i;){let u=t.next();if(u.done){o=E;return}n=u.value,o=r(n)}i=o,yield[o,l(i)]}}function*_(e,r){for(let[t,n]of d(e,r))n&&(yield t)}function*h(e,r){for(let t of e)r(t)&&(yield t)}function*b(e,r){for(let t of e)yield r(t)}function*re(e,r,t,n=1){let o,i;t!==void 0?(o=r,i=t):(o=0,i=r);let l=Y(o,i,n);for(let[u,c]of I(e))l(u)&&(yield c)}function*O(e,r){let t=a(e),n=a(r);for(;;){let o=t.next(),i=n.next();if(!o.done&&!i.done)yield[o.value,i.value];else return}}function*g(e,r,t){let n=a(e),o=a(r),i=a(t);for(;;){let l=n.next(),u=o.next(),c=i.next();if(!l.done&&!u.done&&!c.done)yield[l.value,u.value,c.value];else return}}var d=O;function*S(e,r,t){let n=t,o=a(e),i=a(r);for(;;){let l=o.next(),u=i.next();if(l.done&&u.done)return;yield[l.done?n:l.value,u.done?n:u.value]}}function*j(...e){let r=e.map(a);for(;;){let t=r.map(n=>n.next());if(P(t,n=>!n.done))yield t.map(n=>n.value);else return}}function*ne(e,r){let t=Array.from(e),n=t.length,o=r===void 0?n:r;if(o>n)return;let i=Array.from(p(n)),l=Array.from(p(n,n-o,-1)),u=c=>t[c];for(yield i.slice(0,o).map(u);n>0;){let c=!0;for(let f of p(o-1,-1,-1))if(l[f]-=1,l[f]===0)i=i.slice(0,f).concat(i.slice(f+1)).concat(i.slice(f,f+1)),l[f]=n-f;else{let D=l[f],[R,G]=[i[i.length-D],i[f]];i[f]=R,i[i.length-D]=G,yield i.slice(0,o).map(u),c=!1;break}if(c)return}}function*w(e,r){for(let t of e){if(!r(t))return;yield t}}function oe(e,r,t){return Array.from(S(e,r,t))}var ie=S,le=oe;function ae(...e){return Array.from(j(...e))}function ue(e){return e!==void 0}function*q(e){for(let r of e)r!=null&&(yield r)}function fe(e){return Array.from(q(e))}function ce(e){let r={};for(let[t,n]of Object.entries(e)){let o=n;o!=null&&(r[t]=o)}return r}function se(e,r){let t=r||ue;for(let n of e)if(t(n))return n}var z=se;function Te(e,r){return T(b(e,r))}function P(e,r=y){for(let t of e)if(!r(t))return!1;return!0}function C(e,r=y){for(let t of e)if(r(t))return!0;return!1}function pe(e,r){return C(e,t=>t===r)}function*I(e,r=0){let t=r;for(let n of e)yield[t++,n]}function be(e,r){return Array.from(h(e,r))}function a(e){return e[Symbol.iterator]()}function m(e,r){return Array.from(b(e,r))}function me(e,r=x){return M(e,(t,n)=>r(t)>r(n)?t:n)}function de(e,r=x){return M(e,(t,n)=>r(t)<r(n)?t:n)}function A(e,r,t){let n=v(e,t),o=t>=0?i=>i<r:i=>i>r;return w(n,o)}function p(e,...r){let t=[e,...r];switch(t.length){case 1:return A(0,t[0],1);case 2:return A(t[0],t[1],1);case 3:return A(t[0],t[1],t[2]);default:throw new Error("invalid number of arguments")}}function k(e,r,t){let n=a(e),o=t;for(let[i,l]of I(n))o=r(o,l,i);return o}function M(e,r){let t=a(e),n=z(t);if(n!==void 0)return k(t,r,n)}function Ie(e,r=s,t=!1){let n=Array.from(e);return n.sort(V(r)),t&&n.reverse(),n}function ye(e){return k(e,(r,t)=>r+t,0)}function xe(e,r){return Array.from(d(e,r))}function ve(e,r,t){return Array.from(g(e,r,t))}export{P as all,C as any,Z as chain,J as chunked,fe as compact,ce as compactObject,$ as compress,pe as contains,v as count,F as cycle,ee as dropwhile,I as enumerate,be as filter,z as first,Te as flatmap,T as flatten,te as groupby,Q as heads,q as icompact,_ as icompress,h as ifilter,b as imap,re as islice,K as itake,a as iter,d as izip,O as izip2,g as izip3,ie as izipLongest,j as izipMany,m as map,me as max,de as min,N as pairwise,B as partition,ne as permutations,p as range,k as reduce,H as roundrobin,Ie as sorted,ye as sum,U as take,w as takewhile,W as uniqueEverseen,X as uniqueJustseen,xe as zip,ve as zip3,le as zipLongest,ae as zipMany};
+function k(t){return(e,r)=>{let n=t(e),i=t(r);return typeof n=="boolean"&&typeof i=="boolean"?n===i?0:!n&&i?-1:1:typeof n=="number"&&typeof i=="number"?n-i:typeof n=="string"&&typeof i=="string"?n===i?0:n<i?-1:1:-1}}function I(t){return!!t}function x(t){if(typeof t!="number")throw new Error("Inputs must be numbers");return t}function T(t){if(typeof t!="string"&&typeof t!="number"&&typeof t!="boolean")throw new Error("Please provide a key function that can establish object identity");return t}function*Q(t,e){if(e<1)throw new Error(`Invalid chunk size: ${e}`);let r=a(t);for(;;){let n=V(e,r);if(n.length>0&&(yield n),n.length<e)return}}function*s(t){for(let e of t)for(let r of e)yield r}function*O(t,e){let r=a(e),n=t;for(;n-- >0;){let i=r.next();if(!i.done)yield i.value;else return}}function*U(t){let e=a(t),r=e.next();if(r.done)return;let n=r.value;for(let i of e)yield[n,i],n=i}function W(t,e){let r=[],n=[];for(let i of t)e(i)?r.push(i):n.push(i);return[r,n]}function*X(...t){let e=m(t,a);for(;e.length>0;){let r=0;for(;r<e.length;){let i=e[r].next();i.done?e.splice(r,1):(yield i.value,r++)}}}function*Y(...t){let e=m(t,a);for(;e.length>0;){let r=0,n=[];for(;r<e.length;){let o=e[r].next();o.done?e.splice(r,1):(n.push(o.value),r++)}n.length>0&&(yield n)}}function V(t,e){return Array.from(O(t,e))}function*Z(t,e=T){let r=new Set;for(let n of t){let i=e(n);r.has(i)||(r.add(i),yield n)}}function*F(t,e=T){let r;for(let n of t){let i=e(n);i!==r&&(yield n,r=i)}}var K=Symbol();function E(t,e){return r=>t(r)&&e(r)}function ee(t,e,r){if(t<0)throw new Error("start cannot be negative");if(e!==null&&e<0)throw new Error("stop cannot be negative");if(r<0)throw new Error("step cannot be negative");let n=i=>i>=t;if(e!==null){let i=e;n=E(n,o=>o<i)}return r>1&&(n=E(n,i=>(i-t)%r===0)),n}function te(...t){return s(t)}function*y(t=0,e=1){let r=t;for(;;)yield r,r+=e}function re(t,e){return Array.from(N(t,e))}function*ne(t){let e=[];for(let r of t)yield r,e.push(r);for(;e.length>0;)for(let r of e)yield r}function*ie(t,e){let r=a(t);for(let n of r)if(!e(n)){yield n;break}for(let n of r)yield n}function*oe(t,e=T){let r=a(t),n,i=K,o=i,l=function*(c){for(;i===c;){yield n;let f=r.next();if(f.done)return;n=f.value,i=e(n)}};for(;;){for(;i===o;){let u=r.next();if(u.done){i=K;return}n=u.value,i=e(n)}o=i,yield[i,l(o)]}}function*N(t,e){for(let[r,n]of d(t,e))n&&(yield r)}function*v(t,e){for(let r of t)e(r)&&(yield r)}function*p(t,e){for(let r of t)yield e(r)}function*ae(t,e,r,n=1){let i,o;r!==void 0?(i=e,o=r):(i=0,o=e);let l=ee(i,o,n);for(let[u,c]of w(t))l(u)&&(yield c)}function*L(t,e){let r=a(t),n=a(e);for(;;){let i=r.next(),o=n.next();if(!i.done&&!o.done)yield[i.value,o.value];else return}}function*g(t,e,r){let n=a(t),i=a(e),o=a(r);for(;;){let l=n.next(),u=i.next(),c=o.next();if(!l.done&&!u.done&&!c.done)yield[l.value,u.value,c.value];else return}}var d=L;function*j(t,e,r){let n=r,i=a(t),o=a(e);for(;;){let l=i.next(),u=o.next();if(l.done&&u.done)return;yield[l.done?n:l.value,u.done?n:u.value]}}function*q(...t){let e=t.map(a);for(;;){let r=e.map(n=>n.next());if(P(r,n=>!n.done))yield r.map(n=>n.value);else return}}function*le(t,e){let r=Array.from(t),n=r.length,i=e===void 0?n:e;if(i>n)return;let o=Array.from(b(n)),l=Array.from(b(n,n-i,-1)),u=c=>r[c];for(yield o.slice(0,i).map(u);n>0;){let c=!0;for(let f of b(i-1,-1,-1))if(l[f]-=1,l[f]===0)o=o.slice(0,f).concat(o.slice(f+1)).concat(o.slice(f,f+1)),l[f]=n-f;else{let D=l[f],[B,H]=[o[o.length-D],o[f]];o[f]=B,o[o.length-D]=H,yield o.slice(0,i).map(u),c=!1;break}if(c)return}}function*h(t,e){for(let r of t){if(!e(r))return;yield r}}function ue(t,e,r){return Array.from(j(t,e,r))}var fe=j,ce=ue;function Te(...t){return Array.from(q(...t))}function se(t){return t!==void 0}function*_(t){for(let e of t)e!=null&&(yield e)}function be(t){return Array.from(_(t))}function pe(t){let e={};for(let[r,n]of Object.entries(t)){let i=n;i!=null&&(e[r]=i)}return e}function C(t,e){if(e===void 0){for(let r of t)return r;return}else{for(let r of t)if(e(r))return r;return}}function z(t,e){return C(t,e!=null?e:se)}function me(t,e){return s(p(t,e))}function R(t,e=I){for(let r of t)if(!e(r))return!1;return!0}function S(t,e=I){for(let r of t)if(e(r))return!0;return!1}var P=R,G=S;function de(t,e){return G(t,r=>r===e)}function*w(t,e=0){let r=e;for(let n of t)yield[r++,n]}function Ie(t,e){return Array.from(v(t,e))}function a(t){return t[Symbol.iterator]()}function m(t,e){return Array.from(p(t,e))}function xe(t,e=x){return A(t,(r,n)=>e(r)>e(n)?r:n)}function ye(t,e=x){return A(t,(r,n)=>e(r)<e(n)?r:n)}function M(t,e,r){let n=y(t,r),i=r>=0?o=>o<e:o=>o>e;return h(n,i)}function b(t,e,r=1){return e!==void 0?M(t,e,r):M(0,t,r)}function J(t,e,r){return r===void 0?A(t,e):$(t,e,r)}function $(t,e,r){let n=r,i=0;for(let o of t)n=e(n,o,i++);return n}function A(t,e){let r=a(t),n=z(r);if(n!==void 0)return $(r,e,n)}function ve(t,e=T,r=!1){let n=Array.from(t);return n.sort(k(e)),r&&n.reverse(),n}function ge(t){return J(t,(e,r)=>e+r,0)}function he(t,e){return Array.from(d(t,e))}function Pe(t,e,r){return Array.from(g(t,e,r))}export{P as all,G as any,te as chain,Q as chunked,be as compact,pe as compactObject,re as compress,de as contains,y as count,ne as cycle,ie as dropwhile,w as enumerate,R as every,Ie as filter,C as find,z as first,me as flatmap,s as flatten,oe as groupby,Y as heads,_ as icompact,N as icompress,v as ifilter,p as imap,ae as islice,O as itake,a as iter,d as izip,L as izip2,g as izip3,fe as izipLongest,q as izipMany,m as map,xe as max,ye as min,U as pairwise,W as partition,le as permutations,b as range,J as reduce,X as roundrobin,S as some,ve as sorted,ge as sum,V as take,h as takewhile,Z as uniqueEverseen,F as uniqueJustseen,he as zip,Pe as zip3,ce as zipLongest,Te as zipMany};
+// istanbul ignore else -- @preserve
+// istanbul ignore if -- @preserve
 //# sourceMappingURL=index.mjs.map

package/dist/index.mjs.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/utils.ts","../src/more-itertools.ts","../src/itertools.ts","../src/custom.ts","../src/builtins.ts"],"sourcesContent":["import type { Primitive } from './types';\n\ntype CmpFn<T> = (a: T, b: T) => number;\n\nexport function keyToCmp<T>(keyFn: (item: T) => Primitive): CmpFn<T> {\n    return (a: T, b: T) => {\n        const ka = keyFn(a);\n        const kb = keyFn(b);\n        // istanbul ignore else\n        if (typeof ka === 'boolean' && typeof kb === 'boolean') {\n            return ka === kb ? 0 : !ka && kb ? -1 : 1;\n        } else if (typeof ka === 'number' && typeof kb === 'number') {\n            return ka - kb;\n        } else if (typeof ka === 'string' && typeof kb === 'string') {\n            return ka === kb ? 0 : ka < kb ? -1 : 1;\n        } else {\n            return -1;\n        }\n    };\n}\n\nexport function identityPredicate(x: unknown): boolean {\n    return !!x;\n}\n\nexport function numberIdentity(x: unknown): number {\n    /* istanbul ignore if */\n    if (typeof x !== 'number') {\n        throw new Error('Inputs must be numbers');\n    }\n    return x;\n}\n\nexport function primitiveIdentity<P extends Primitive>(x: P): P;\nexport function primitiveIdentity(x: unknown): Primitive;\nexport function primitiveIdentity(x: unknown): Primitive {\n    /* istanbul ignore if */\n    if (typeof x !== 'string' && typeof x !== 'number' && typeof x !== 'boolean') {\n        throw new Error('Please provide a key function that can establish object identity');\n    }\n    return x;\n}\n","import { iter, map } from './builtins';\nimport { izip, repeat } from './itertools';\nimport type { Predicate, Primitive } from './types';\nimport { primitiveIdentity } from './utils';\n\n/**\n * Break iterable into lists of length `size`:\n *\n *     [...chunked([1, 2, 3, 4, 5, 6], 3)]\n *     // [[1, 2, 3], [4, 5, 6]]\n *\n * If the length of iterable is not evenly divisible by `size`, the last returned\n * list will be shorter:\n *\n *     [...chunked([1, 2, 3, 4, 5, 6, 7, 8], 3)]\n *     // [[1, 2, 3], [4, 5, 6], [7, 8]]\n */\nexport function* chunked<T>(iterable: Iterable<T>, size: number): Iterable<T[]> {\n    const it = iter(iterable);\n    const r1 = it.next();\n    if (r1.done) {\n        return;\n    }\n\n    let chunk = [r1.value];\n\n    for (const item of it) {\n        chunk.push(item);\n\n        if (chunk.length === size) {\n            yield chunk;\n            chunk = [];\n        }\n    }\n\n    // Yield the remainder, if there is any\n    if (chunk.length > 0) {\n        yield chunk;\n    }\n}\n\n/**\n * Return an iterator flattening one level of nesting in a list of lists:\n *\n *     [...flatten([[0, 1], [2, 3]])]\n *     // [0, 1, 2, 3]\n *\n */\nexport function* flatten<T>(iterableOfIterables: Iterable<Iterable<T>>): Iterable<T> {\n    for (const iterable of iterableOfIterables) {\n        for (const item of iterable) {\n            yield item;\n        }\n    }\n}\n\n/**\n * Intersperse filler element `value` among the items in `iterable`.\n *\n *     >>> [...intersperse(-1, range(1, 5))]\n *     [1, -1, 2, -1, 3, -1, 4]\n *\n */\nexport function intersperse<T, V>(value: V, iterable: Iterable<T>): Iterable<T | V> {\n    const stream = flatten(izip(repeat(value), iterable));\n    take(1, stream); // eat away and discard the first value from the output\n    return stream;\n}\n\n/**\n * Returns an iterable containing only the first `n` elements of the given\n * iterable.\n */\nexport function* itake<T>(n: number, iterable: Iterable<T>): Iterable<T> {\n    const it = iter(iterable);\n    let count = n;\n    while (count-- > 0) {\n        const s = it.next();\n        if (!s.done) {\n            yield s.value;\n        } else {\n            // Iterable exhausted, quit early\n            return;\n        }\n    }\n}\n\n/**\n * Returns an iterator of paired items, overlapping, from the original.  When\n * the input iterable has a finite number of items `n`, the outputted iterable\n * will have `n - 1` items.\n *\n *     >>> pairwise([8, 2, 0, 7])\n *     [(8, 2), (2, 0), (0, 7)]\n *\n */\nexport function* pairwise<T>(iterable: Iterable<T>): Iterable<[T, T]> {\n    const it = iter(iterable);\n    const first = it.next();\n    if (first.done) {\n        return;\n    }\n\n    let r1: T = first.value;\n    for (const r2 of it) {\n        yield [r1, r2];\n        r1 = r2;\n    }\n}\n\n/**\n * Returns a 2-tuple of arrays.  Splits the elements in the input iterable into\n * either of the two arrays.  Will fully exhaust the input iterable.  The first\n * array contains all items that match the predicate, the second the rest:\n *\n *     >>> const isOdd = x => x % 2 !== 0;\n *     >>> const iterable = range(10);\n *     >>> const [odds, evens] = partition(iterable, isOdd);\n *     >>> odds\n *     [1, 3, 5, 7, 9]\n *     >>> evens\n *     [0, 2, 4, 6, 8]\n *\n */\nexport function partition<T>(iterable: Iterable<T>, predicate: Predicate<T>): [T[], T[]] {\n    const good = [];\n    const bad = [];\n\n    for (const item of iterable) {\n        if (predicate(item)) {\n            good.push(item);\n        } else {\n            bad.push(item);\n        }\n    }\n\n    return [good, bad];\n}\n\n/**\n * Yields the next item from each iterable in turn, alternating between them.\n * Continues until all items are exhausted.\n *\n *     >>> [...roundrobin([1, 2, 3], [4], [5, 6, 7, 8])]\n *     [1, 4, 5, 2, 6, 3, 7, 8]\n */\nexport function* roundrobin<T>(...iters: Iterable<T>[]): Iterable<T> {\n    // We'll only keep lazy versions of the input iterables in here that we'll\n    // slowly going to exhaust.  Once an iterable is exhausted, it will be\n    // removed from this list.  Once the entire list is empty, this algorithm\n    // ends.\n    const iterables: Array<Iterator<T>> = map(iters, iter);\n\n    while (iterables.length > 0) {\n        let index = 0;\n        while (index < iterables.length) {\n            const it = iterables[index];\n            const result = it.next();\n\n            if (!result.done) {\n                yield result.value;\n                index++;\n            } else {\n                // This iterable is exhausted, make sure to remove it from the\n                // list of iterables.  We'll splice the array from under our\n                // feet, and NOT advancing the index counter.\n                iterables.splice(index, 1); // intentional side-effect!\n            }\n        }\n    }\n}\n\n/**\n * Yields the heads of all of the given iterables.  This is almost like\n * `roundrobin()`, except that the yielded outputs are grouped in to the\n * \"rounds\":\n *\n *     >>> [...heads([1, 2, 3], [4], [5, 6, 7, 8])]\n *     [[1, 4, 5], [2, 6], [3, 7], [8]]\n *\n * This is also different from `zipLongest()`, since the number of items in\n * each round can decrease over time, rather than being filled with a filler.\n */\nexport function* heads<T>(...iters: Array<Iterable<T>>): Iterable<T[]> {\n    // We'll only keep lazy versions of the input iterables in here that we'll\n    // slowly going to exhaust.  Once an iterable is exhausted, it will be\n    // removed from this list.  Once the entire list is empty, this algorithm\n    // ends.\n    const iterables: Array<Iterator<T>> = map(iters, iter);\n\n    while (iterables.length > 0) {\n        let index = 0;\n        const round = [];\n        while (index < iterables.length) {\n            const it = iterables[index];\n            const result = it.next();\n\n            if (!result.done) {\n                round.push(result.value);\n                index++;\n            } else {\n                // This iterable is exhausted, make sure to remove it from the\n                // list of iterables.  We'll splice the array from under our\n                // feet, and NOT advancing the index counter.\n                iterables.splice(index, 1); // intentional side-effect!\n            }\n        }\n        if (round.length > 0) {\n            yield round;\n        }\n    }\n}\n\n/**\n * Non-lazy version of itake().\n */\nexport function take<T>(n: number, iterable: Iterable<T>): T[] {\n    return Array.from(itake(n, iterable));\n}\n\n/**\n * Yield unique elements, preserving order.\n *\n *     >>> [...uniqueEverseen('AAAABBBCCDAABBB')]\n *     ['A', 'B', 'C', 'D']\n *     >>> [...uniqueEverseen('AbBCcAB', s => s.toLowerCase())]\n *     ['A', 'b', 'C']\n *\n */\nexport function* uniqueEverseen<T>(\n    iterable: Iterable<T>,\n    keyFn: (item: T) => Primitive = primitiveIdentity\n): Iterable<T> {\n    const seen = new Set();\n    for (const item of iterable) {\n        const key = keyFn(item);\n        if (!seen.has(key)) {\n            seen.add(key);\n            yield item;\n        }\n    }\n}\n\n/**\n * Yields elements in order, ignoring serial duplicates.\n *\n *     >>> [...uniqueJustseen('AAAABBBCCDAABBB')]\n *     ['A', 'B', 'C', 'D', 'A', 'B']\n *     >>> [...uniqueJustseen('AbBCcAB', s => s.toLowerCase())]\n *     ['A', 'b', 'C', 'A', 'B']\n *\n */\nexport function* uniqueJustseen<T>(\n    iterable: Iterable<T>,\n    keyFn: (item: T) => Primitive = primitiveIdentity\n): Iterable<T> {\n    let last = undefined;\n    for (const item of iterable) {\n        const key = keyFn(item);\n        if (key !== last) {\n            yield item;\n            last = key;\n        }\n    }\n}\n","import { all, enumerate, iter, range } from './builtins';\nimport { flatten } from './more-itertools';\nimport type { Predicate, Primitive } from './types';\nimport { primitiveIdentity } from './utils';\n\nconst SENTINEL = Symbol();\n\nfunction composeAnd(f1: (v1: number) => boolean, f2: (v2: number) => boolean): (v3: number) => boolean {\n    return (n: number) => f1(n) && f2(n);\n}\n\nfunction slicePredicate(start: number, stop: number | null, step: number) {\n    /* istanbul ignore if */\n    if (start < 0) throw new Error('start cannot be negative');\n    /* istanbul ignore if */\n    if (stop !== null && stop < 0) throw new Error('stop cannot be negative');\n    /* istanbul ignore if */\n    if (step < 0) throw new Error('step cannot be negative');\n\n    // If stop is not provided (= undefined), then interpret the start value as the stop value\n    let _start = start,\n        _stop = stop;\n    if (_stop === undefined) {\n        [_start, _stop] = [0, _start];\n    }\n\n    let pred = (n: number) => n >= _start;\n\n    if (_stop !== null) {\n        const definedStop = _stop;\n        pred = composeAnd(pred, (n: number) => n < definedStop);\n    }\n\n    if (step > 1) {\n        pred = composeAnd(pred, (n: number) => (n - _start) % step === 0);\n    }\n\n    return pred;\n}\n\n/**\n * Returns an iterator that returns elements from the first iterable until it\n * is exhausted, then proceeds to the next iterable, until all of the iterables\n * are exhausted.  Used for treating consecutive sequences as a single\n * sequence.\n */\nexport function chain<T>(...iterables: Iterable<T>[]): Iterable<T> {\n    return flatten(iterables);\n}\n\n/**\n * Returns an iterator that counts up values starting with number `start`\n * (default 0), incrementing by `step`.  To decrement, use a negative step\n * number.\n */\nexport function* count(start = 0, step = 1): Iterable<number> {\n    let n = start;\n    for (;;) {\n        yield n;\n        n += step;\n    }\n}\n\n/**\n * Non-lazy version of icompress().\n */\nexport function compress<T>(data: Iterable<T>, selectors: Iterable<boolean>): T[] {\n    return Array.from(icompress(data, selectors));\n}\n\n/**\n * Returns an iterator producing elements from the iterable and saving a copy\n * of each.  When the iterable is exhausted, return elements from the saved\n * copy.  Repeats indefinitely.\n */\nexport function* cycle<T>(iterable: Iterable<T>): Iterable<T> {\n    const saved = [];\n    for (const element of iterable) {\n        yield element;\n        saved.push(element);\n    }\n\n    while (saved.length > 0) {\n        for (const element of saved) {\n            yield element;\n        }\n    }\n}\n\n/**\n * Returns an iterator that drops elements from the iterable as long as the\n * predicate is true; afterwards, returns every remaining element.  Note, the\n * iterator does not produce any output until the predicate first becomes\n * false.\n */\nexport function* dropwhile<T>(iterable: Iterable<T>, predicate: Predicate<T>): Iterable<T> {\n    const it = iter(iterable);\n    for (const value of it) {\n        if (!predicate(value)) {\n            yield value;\n            break;\n        }\n    }\n\n    for (const value of it) {\n        yield value;\n    }\n}\n\nexport function* groupby<T, K extends Primitive>(\n    iterable: Iterable<T>,\n    keyFn: (item: T) => K = primitiveIdentity\n): Generator<[K, Generator<T, undefined>], undefined> {\n    const it = iter(iterable);\n\n    let currentValue: T;\n    let currentKey: K = SENTINEL as unknown as K;\n    //                           ^^^^^^^^^^^^^^^ Hack!\n    let targetKey: K = currentKey;\n\n    const grouper = function* grouper(tgtKey: K): Generator<T, undefined> {\n        while (currentKey === tgtKey) {\n            yield currentValue;\n\n            const nextVal = it.next();\n            if (nextVal.done) return;\n            currentValue = nextVal.value;\n            currentKey = keyFn(currentValue);\n        }\n    };\n\n    for (;;) {\n        while (currentKey === targetKey) {\n            const nextVal = it.next();\n            if (nextVal.done) {\n                currentKey = SENTINEL as unknown as K;\n                //                    ^^^^^^^^^^^^^^^ Hack!\n                return;\n            }\n            currentValue = nextVal.value;\n            currentKey = keyFn(currentValue);\n        }\n\n        targetKey = currentKey;\n        yield [currentKey, grouper(targetKey)];\n    }\n}\n\n/**\n * Returns an iterator that filters elements from data returning only those\n * that have a corresponding element in selectors that evaluates to `true`.\n * Stops when either the data or selectors iterables has been exhausted.\n */\nexport function* icompress<T>(data: Iterable<T>, selectors: Iterable<boolean>): Iterable<T> {\n    for (const [d, s] of izip(data, selectors)) {\n        if (s) {\n            yield d;\n        }\n    }\n}\n\n/**\n * Returns an iterator that filters elements from iterable returning only those\n * for which the predicate is true.\n */\nexport function* ifilter<T>(iterable: Iterable<T>, predicate: Predicate<T>): Iterable<T> {\n    for (const value of iterable) {\n        if (predicate(value)) {\n            yield value;\n        }\n    }\n}\n\n/**\n * Returns an iterator that computes the given mapper function using arguments\n * from each of the iterables.\n */\nexport function* imap<T, V>(iterable: Iterable<T>, mapper: (item: T) => V): Iterable<V> {\n    for (const value of iterable) {\n        yield mapper(value);\n    }\n}\n\n/**\n * Returns an iterator that returns selected elements from the iterable.  If\n * `start` is non-zero, then elements from the iterable are skipped until start\n * is reached.  Then, elements are returned by making steps of `step` (defaults\n * to 1).  If set to higher than 1, items will be skipped.  If `stop` is\n * provided, then iteration continues until the iterator reached that index,\n * otherwise, the iterable will be fully exhausted.  `islice()` does not\n * support negative values for `start`, `stop`, or `step`.\n */\nexport function islice<T>(iterable: Iterable<T>, stop: number): Iterable<T>;\nexport function islice<T>(iterable: Iterable<T>, start: number, stop?: number | null, step?: number): Iterable<T>;\nexport function* islice<T>(\n    iterable: Iterable<T>,\n    stopOrStart: number,\n    possiblyStop?: number | null,\n    step = 1\n): Iterable<T> {\n    let start, stop;\n    if (possiblyStop !== undefined) {\n        // islice(iterable, start, stop[, step])\n        start = stopOrStart;\n        stop = possiblyStop;\n    } else {\n        // islice(iterable, stop)\n        start = 0;\n        stop = stopOrStart;\n    }\n\n    const pred = slicePredicate(start, stop, step);\n    for (const [i, value] of enumerate(iterable)) {\n        if (pred(i)) {\n            yield value;\n        }\n    }\n}\n\n/**\n * Returns an iterator that aggregates elements from each of the iterables.\n * Used for lock-step iteration over several iterables at a time.  When\n * iterating over two iterables, use `izip2`.  When iterating over three\n * iterables, use `izip3`, etc.  `izip` is an alias for `izip2`.\n */\nexport function* izip2<T1, T2>(xs: Iterable<T1>, ys: Iterable<T2>): Iterable<[T1, T2]> {\n    const ixs = iter(xs);\n    const iys = iter(ys);\n    for (;;) {\n        const x = ixs.next();\n        const y = iys.next();\n        if (!x.done && !y.done) {\n            yield [x.value, y.value];\n        } else {\n            // One of the iterables exhausted\n            return;\n        }\n    }\n}\n\n/**\n * Like izip2, but for three input iterables.\n */\nexport function* izip3<T1, T2, T3>(xs: Iterable<T1>, ys: Iterable<T2>, zs: Iterable<T3>): Iterable<[T1, T2, T3]> {\n    const ixs = iter(xs);\n    const iys = iter(ys);\n    const izs = iter(zs);\n    for (;;) {\n        const x = ixs.next();\n        const y = iys.next();\n        const z = izs.next();\n        if (!x.done && !y.done && !z.done) {\n            yield [x.value, y.value, z.value];\n        } else {\n            // One of the iterables exhausted\n            return;\n        }\n    }\n}\n\nexport const izip = izip2;\n\n/**\n * Returns an iterator that aggregates elements from each of the iterables.  If\n * the iterables are of uneven length, missing values are filled-in with\n * fillvalue.  Iteration continues until the longest iterable is exhausted.\n */\nexport function* izipLongest2<T1, T2, D>(xs: Iterable<T1>, ys: Iterable<T2>, filler?: D): Iterable<[T1 | D, T2 | D]> {\n    const filler_ = filler as D;\n    const ixs = iter(xs);\n    const iys = iter(ys);\n    for (;;) {\n        const x = ixs.next();\n        const y = iys.next();\n        if (x.done && y.done) {\n            // All iterables exhausted\n            return;\n        } else {\n            yield [!x.done ? x.value : filler_, !y.done ? y.value : filler_];\n        }\n    }\n}\n\n/**\n * See izipLongest2, but for three.\n */\nexport function* izipLongest3<T1, T2, T3, D = undefined>(\n    xs: Iterable<T1>,\n    ys: Iterable<T2>,\n    zs: Iterable<T3>,\n    filler?: D\n): Iterable<[T1 | D, T2 | D, T3 | D]> {\n    const filler_ = filler as D;\n    const ixs = iter(xs);\n    const iys = iter(ys);\n    const izs = iter(zs);\n    for (;;) {\n        const x = ixs.next();\n        const y = iys.next();\n        const z = izs.next();\n        if (x.done && y.done && z.done) {\n            // All iterables exhausted\n            return;\n        } else {\n            yield [!x.done ? x.value : filler_, !y.done ? y.value : filler_, !z.done ? z.value : filler_];\n        }\n    }\n}\n\n/**\n * Like the other izips (`izip`, `izip3`, etc), but generalized to take an\n * unlimited amount of input iterables.  Think `izip(*iterables)` in Python.\n *\n * **Note:** Due to Flow type system limitations, you can only \"generially\" zip\n * iterables with homogeneous types, so you cannot mix types like <A, B> like\n * you can with izip2().\n */\nexport function* izipMany<T>(...iters: Iterable<T>[]): Iterable<T[]> {\n    // Make them all iterables\n    const iterables = iters.map(iter);\n\n    for (;;) {\n        const heads: Array<IteratorResult<T, undefined>> = iterables.map((xs) => xs.next());\n        if (all(heads, (h) => !h.done)) {\n            yield heads.map((h) => h.value as T);\n        } else {\n            // One of the iterables exhausted\n            return;\n        }\n    }\n}\n\n/**\n * Return successive `r`-length permutations of elements in the iterable.\n *\n * If `r` is not specified, then `r` defaults to the length of the iterable and\n * all possible full-length permutations are generated.\n *\n * Permutations are emitted in lexicographic sort order.  So, if the input\n * iterable is sorted, the permutation tuples will be produced in sorted order.\n *\n * Elements are treated as unique based on their position, not on their value.\n * So if the input elements are unique, there will be no repeat values in each\n * permutation.\n */\nexport function* permutations<T>(iterable: Iterable<T>, r?: number): Iterable<T[]> {\n    const pool = Array.from(iterable);\n    const n = pool.length;\n    const x = r === undefined ? n : r;\n\n    if (x > n) {\n        return;\n    }\n\n    let indices: number[] = Array.from(range(n));\n    const cycles: number[] = Array.from(range(n, n - x, -1));\n    const poolgetter = (i: number) => pool[i];\n\n    yield indices.slice(0, x).map(poolgetter);\n\n    while (n > 0) {\n        let cleanExit = true;\n        for (const i of range(x - 1, -1, -1)) {\n            cycles[i] -= 1;\n            if (cycles[i] === 0) {\n                indices = indices\n                    .slice(0, i)\n                    .concat(indices.slice(i + 1))\n                    .concat(indices.slice(i, i + 1));\n                cycles[i] = n - i;\n            } else {\n                const j: number = cycles[i];\n\n                const [p, q] = [indices[indices.length - j], indices[i]];\n                indices[i] = p;\n                indices[indices.length - j] = q;\n                yield indices.slice(0, x).map(poolgetter);\n                cleanExit = false;\n                break;\n            }\n        }\n\n        if (cleanExit) {\n            return;\n        }\n    }\n}\n\n/**\n * Returns an iterator that produces values over and over again.  Runs\n * indefinitely unless the times argument is specified.\n */\nexport function* repeat<T>(thing: T, times?: number): Iterable<T> {\n    if (times === undefined) {\n        for (;;) {\n            yield thing;\n        }\n    } else {\n        for (const _ of range(times)) {\n            yield thing;\n        }\n    }\n}\n\n/**\n * Returns an iterator that produces elements from the iterable as long as the\n * predicate is true.\n */\nexport function* takewhile<T>(iterable: Iterable<T>, predicate: Predicate<T>): Iterable<T> {\n    for (const value of iterable) {\n        if (!predicate(value)) return;\n        yield value;\n    }\n}\n\nexport function zipLongest2<T1, T2, D>(xs: Iterable<T1>, ys: Iterable<T2>, filler?: D): Array<[T1 | D, T2 | D]> {\n    return Array.from(izipLongest2(xs, ys, filler));\n}\n\nexport function zipLongest3<T1, T2, T3, D>(\n    xs: Iterable<T1>,\n    ys: Iterable<T2>,\n    zs: Iterable<T3>,\n    filler?: D\n): Array<[T1 | D, T2 | D, T3 | D]> {\n    return Array.from(izipLongest3(xs, ys, zs, filler));\n}\n\nexport const izipLongest = izipLongest2;\nexport const zipLongest = zipLongest2;\n\nexport function zipMany<T>(...iters: Iterable<T>[]): T[][] {\n    return Array.from(izipMany(...iters));\n}\n","import { imap } from './itertools';\nimport { flatten } from './more-itertools';\nimport type { Predicate } from './types';\n\nfunction isDefined<T>(x: T): boolean {\n    return x !== undefined;\n}\n\n/**\n * Returns an iterable, filtering out any `undefined` values from the iterable.\n *\n *     >>> compact([1, 2, undefined, 3])\n *     [1, 2, 3]\n */\nexport function* icompact<T>(iterable: Iterable<T | null | undefined>): Iterable<T> {\n    for (const item of iterable) {\n        if (item != null) {\n            yield item;\n        }\n    }\n}\n\n/**\n * See icompact().\n */\nexport function compact<T>(iterable: Iterable<T | null | undefined>): T[] {\n    return Array.from(icompact(iterable));\n}\n\n/**\n * Removes all undefined values from the given object.  Returns a new object.\n *\n *     >>> compactObject({ a: 1, b: undefined, c: 0 })\n *     { a: 1, c: 0 }\n *\n */\nexport function compactObject<K extends string, V>(obj: Record<K, V | null | undefined>): Record<K, V> {\n    const result = {} as Record<K, V>;\n    for (const [key, value_] of Object.entries(obj)) {\n        const value = value_ as V | null | undefined;\n        if (value != null) {\n            result[key as K] = value;\n        }\n    }\n    return result;\n}\n\n/**\n * Returns the first item in the iterable for which the predicate holds, if\n * any.  If no such item exists, `undefined` is returned.  The default\n * predicate is any defined value.\n */\nexport function find<T>(iterable: Iterable<T>, keyFn?: Predicate<T>): T | undefined {\n    const fn = keyFn || isDefined;\n    for (const value of iterable) {\n        if (fn(value)) {\n            return value;\n        }\n    }\n    return undefined;\n}\n\n/**\n * Returns the first item in the iterable for which the predicate holds, if\n * any.  If no such item exists, `undefined` is returned.  The default\n * predicate is any defined value.\n */\nexport const first = find;\n\n/**\n * Returns 0 or more values for every value in the given iterable.\n * Technically, it's just calling map(), followed by flatten(), but it's a very\n * useful operation if you want to map over a structure, but not have a 1:1\n * input-output mapping.  Instead, if you want to potentially return 0 or more\n * values per input element, use flatmap():\n *\n * For example, to return all numbers `n` in the input iterable `n` times:\n *\n *     >>> const repeatN = n => repeat(n, n);\n *     >>> [...flatmap([0, 1, 2, 3, 4], repeatN)]\n *     [1, 2, 2, 3, 3, 3, 4, 4, 4, 4]  // note: no 0\n *\n */\nexport function flatmap<T, S>(iterable: Iterable<T>, mapper: (item: T) => Iterable<S>): Iterable<S> {\n    return flatten(imap(iterable, mapper));\n}\n","import { first } from './custom';\nimport { count, ifilter, imap, izip, izip3, takewhile } from './itertools';\nimport type { Predicate, Primitive } from './types';\nimport { identityPredicate, keyToCmp, numberIdentity, primitiveIdentity } from './utils';\n\n/**\n * Returns true when all of the items in iterable are truthy.  An optional key\n * function can be used to define what truthiness means for this specific\n * collection.\n *\n * Examples:\n *\n *     all([])                           // => true\n *     all([0])                          // => false\n *     all([0, 1, 2])                    // => false\n *     all([1, 2, 3])                    // => true\n *\n * Examples with using a key function:\n *\n *     all([2, 4, 6], n => n % 2 === 0)  // => true\n *     all([2, 4, 5], n => n % 2 === 0)  // => false\n *\n */\nexport function all<T>(iterable: Iterable<T>, keyFn: Predicate<T> = identityPredicate): boolean {\n    for (const item of iterable) {\n        if (!keyFn(item)) {\n            return false;\n        }\n    }\n\n    return true;\n}\n\n/**\n * Returns true when any of the items in iterable are truthy.  An optional key\n * function can be used to define what truthiness means for this specific\n * collection.\n *\n * Examples:\n *\n *     any([])                           // => false\n *     any([0])                          // => false\n *     any([0, 1, null, undefined])      // => true\n *\n * Examples with using a key function:\n *\n *     any([1, 4, 5], n => n % 2 === 0)  // => true\n *     any([{name: 'Bob'}, {name: 'Alice'}], person => person.name.startsWith('C'))  // => false\n *\n */\nexport function any<T>(iterable: Iterable<T>, keyFn: Predicate<T> = identityPredicate): boolean {\n    for (const item of iterable) {\n        if (keyFn(item)) {\n            return true;\n        }\n    }\n\n    return false;\n}\n\n/**\n * Returns true when any of the items in the iterable are equal to the target object.\n *\n * Examples:\n *\n *     contains([], 'whatever')         // => false\n *     contains([3], 42)                // => false\n *     contains([3], 3)                 // => true\n *     contains([0, 1, 2], 2)           // => true\n *\n */\nexport function contains<T>(haystack: Iterable<T>, needle: T): boolean {\n    return any(haystack, (x) => x === needle);\n}\n\n/**\n * Returns an iterable of enumeration pairs.  Iterable must be a sequence, an\n * iterator, or some other object which supports iteration.  The elements\n * produced by returns a tuple containing a counter value (starting from 0 by\n * default) and the values obtained from iterating over given iterable.\n *\n * Example:\n *\n *     import { enumerate } from 'itertools';\n *\n *     console.log([...enumerate(['hello', 'world'])]);\n *     // [0, 'hello'], [1, 'world']]\n */\nexport function* enumerate<T>(iterable: Iterable<T>, start = 0): Iterable<[number, T]> {\n    let index: number = start;\n    for (const value of iterable) {\n        yield [index++, value];\n    }\n}\n\n/**\n * Non-lazy version of ifilter().\n */\nexport function filter<T>(iterable: Iterable<T>, predicate: Predicate<T>): T[] {\n    return Array.from(ifilter(iterable, predicate));\n}\n\n/**\n * Returns an iterator object for the given iterable.  This can be used to\n * manually get an iterator for any iterable datastructure.  The purpose and\n * main use case of this function is to get a single iterator (a thing with\n * state, think of it as a \"cursor\") which can only be consumed once.\n */\nexport function iter<T>(iterable: Iterable<T>): IterableIterator<T> {\n    // class SelfIter implements IterableIterator<T> {\n    //     #iterator: Iterator<T>;\n    //     constructor(orig: Iterable<T>) {\n    //         this.#iterator = orig[Symbol.iterator]();\n    //     }\n    //     [Symbol.iterator]() {\n    //         return this;\n    //     }\n    //     next() {\n    //         return this.#iterator.next();\n    //     }\n    // }\n    // return new SelfIter(iterable);\n\n    return iterable[Symbol.iterator]() as IterableIterator<T>;\n    //                                 ^^^^^^^^^^^^^^^^^^^^^^ Not safe!\n}\n\n/**\n * Non-lazy version of imap().\n */\nexport function map<T, V>(iterable: Iterable<T>, mapper: (item: T) => V): V[] {\n    return Array.from(imap(iterable, mapper));\n}\n\n/**\n * Return the largest item in an iterable.  Only works for numbers, as ordering\n * is pretty poorly defined on any other data type in JS.  The optional `keyFn`\n * argument specifies a one-argument ordering function like that used for\n * sorted().\n *\n * If the iterable is empty, `undefined` is returned.\n *\n * If multiple items are maximal, the function returns either one of them, but\n * which one is not defined.\n */\nexport function max<T>(iterable: Iterable<T>, keyFn: (item: T) => number = numberIdentity): T | undefined {\n    return reduce_(iterable, (x, y) => (keyFn(x) > keyFn(y) ? x : y));\n}\n\n/**\n * Return the smallest item in an iterable.  Only works for numbers, as\n * ordering is pretty poorly defined on any other data type in JS.  The\n * optional `keyFn` argument specifies a one-argument ordering function like\n * that used for sorted().\n *\n * If the iterable is empty, `undefined` is returned.\n *\n * If multiple items are minimal, the function returns either one of them, but\n * which one is not defined.\n */\nexport function min<T>(iterable: Iterable<T>, keyFn: (item: T) => number = numberIdentity): T | undefined {\n    return reduce_(iterable, (x, y) => (keyFn(x) < keyFn(y) ? x : y));\n}\n\n/**\n * Internal helper for the range function\n */\nfunction _range(start: number, stop: number, step: number): Iterable<number> {\n    const counter = count(start, step);\n    const pred = step >= 0 ? (n: number) => n < stop : (n: number) => n > stop;\n    return takewhile(counter, pred);\n}\n\n/**\n * Returns an iterator producing all the numbers in the given range one by one,\n * starting from `start` (default 0), as long as `i < stop`, in increments of\n * `step` (default 1).\n *\n * `range(a)` is a convenient shorthand for `range(0, a)`.\n *\n * Various valid invocations:\n *\n *     range(5)           // [0, 1, 2, 3, 4]\n *     range(2, 5)        // [2, 3, 4]\n *     range(0, 5, 2)     // [0, 2, 4]\n *     range(5, 0, -1)    // [5, 4, 3, 2, 1]\n *     range(-3)          // []\n *\n * For a positive `step`, the iterator will keep producing values `n` as long\n * as the stop condition `n < stop` is satisfied.\n *\n * For a negative `step`, the iterator will keep producing values `n` as long\n * as the stop condition `n > stop` is satisfied.\n *\n * The produced range will be empty if the first value to produce already does\n * not meet the value constraint.\n */\nexport function range(a: number, ...rest: number[]): Iterable<number> {\n    const args = [a, ...rest]; // \"a\" was only used by Flow to make at least one value mandatory\n    switch (args.length) {\n        case 1:\n            return _range(0, args[0], 1);\n        case 2:\n            return _range(args[0], args[1], 1);\n        case 3:\n            return _range(args[0], args[1], args[2]);\n\n        default:\n            /* c8 ignore next */\n            throw new Error('invalid number of arguments');\n    }\n}\n\n/**\n * Apply function of two arguments cumulatively to the items of sequence, from\n * left to right, so as to reduce the sequence to a single value.  For example:\n *\n *     reduce([1, 2, 3, 4, 5], (x, y) => x + y, 0)\n *\n * calculates\n *\n *     (((((0+1)+2)+3)+4)+5)\n *\n * The left argument, `x`, is the accumulated value and the right argument,\n * `y`, is the update value from the sequence.\n *\n * **Difference between `reduce()` and `reduce\\_()`**:  `reduce()` requires an\n * explicit initializer, whereas `reduce_()` will automatically use the first\n * item in the given iterable as the initializer.  When using `reduce()`, the\n * initializer value is placed before the items of the sequence in the\n * calculation, and serves as a default when the sequence is empty.  When using\n * `reduce_()`, and the given iterable is empty, then no default value can be\n * derived and `undefined` will be returned.\n */\nexport function reduce<T, O>(iterable: Iterable<T>, reducer: (agg: O, item: T, index: number) => O, start: O): O {\n    const it = iter(iterable);\n    let output = start;\n    for (const [index, item] of enumerate(it)) {\n        output = reducer(output, item, index);\n    }\n    return output;\n}\n\n/**\n * See reduce().\n */\nexport function reduce_<T>(iterable: Iterable<T>, reducer: (agg: T, item: T, index: number) => T): T | undefined {\n    const it = iter(iterable);\n    const start = first(it);\n    if (start === undefined) {\n        return undefined;\n    } else {\n        return reduce(it, reducer, start);\n    }\n}\n\n/**\n * Return a new sorted list from the items in iterable.\n *\n * Has two optional arguments:\n *\n * * `keyFn` specifies a function of one argument providing a primitive\n *   identity for each element in the iterable.  that will be used to compare.\n *   The default value is to use a default identity function that is only\n *   defined for primitive types.\n *\n * * `reverse` is a boolean value.  If `true`, then the list elements are\n *   sorted as if each comparison were reversed.\n */\nexport function sorted<T>(\n    iterable: Iterable<T>,\n    keyFn: (item: T) => Primitive = primitiveIdentity,\n    reverse = false\n): T[] {\n    const result = Array.from(iterable);\n    result.sort(keyToCmp(keyFn)); // sort in-place\n\n    if (reverse) {\n        result.reverse(); // reverse in-place\n    }\n\n    return result;\n}\n\n/**\n * Sums the items of an iterable from left to right and returns the total.  The\n * sum will defaults to 0 if the iterable is empty.\n */\nexport function sum(iterable: Iterable<number>): number {\n    return reduce(iterable, (x, y) => x + y, 0);\n}\n\n/**\n * See izip.\n */\nexport function zip<T1, T2>(xs: Iterable<T1>, ys: Iterable<T2>): Array<[T1, T2]> {\n    return Array.from(izip(xs, ys));\n}\n\n/**\n * See izip3.\n */\nexport function zip3<T1, T2, T3>(xs: Iterable<T1>, ys: Iterable<T2>, zs: Iterable<T3>): Array<[T1, T2, T3]> {\n    return Array.from(izip3(xs, ys, zs));\n}\n"],"mappings":"AAIO,SAASA,EAAYC,EAAyC,CACjE,MAAO,CAACC,EAAMC,IAAS,CACnB,IAAMC,EAAKH,EAAMC,CAAC,EACZG,EAAKJ,EAAME,CAAC,EAElB,OAAI,OAAOC,GAAO,WAAa,OAAOC,GAAO,UAClCD,IAAOC,EAAK,EAAI,CAACD,GAAMC,EAAK,GAAK,EACjC,OAAOD,GAAO,UAAY,OAAOC,GAAO,SACxCD,EAAKC,EACL,OAAOD,GAAO,UAAY,OAAOC,GAAO,SACxCD,IAAOC,EAAK,EAAID,EAAKC,EAAK,GAAK,EAE/B,EAEf,CACJ,CAEO,SAASC,EAAkBC,EAAqB,CACnD,MAAO,CAAC,CAACA,CACb,CAEO,SAASC,EAAeD,EAAoB,CAE/C,GAAI,OAAOA,GAAM,SACb,MAAM,IAAI,MAAM,wBAAwB,EAE5C,OAAOA,CACX,CAIO,SAASE,EAAkBF,EAAuB,CAErD,GAAI,OAAOA,GAAM,UAAY,OAAOA,GAAM,UAAY,OAAOA,GAAM,UAC/D,MAAM,IAAI,MAAM,kEAAkE,EAEtF,OAAOA,CACX,CCxBO,SAAUG,EAAWC,EAAuBC,EAA6B,CAC5E,IAAMC,EAAKC,EAAKH,CAAQ,EAClBI,EAAKF,EAAG,KAAK,EACnB,GAAIE,EAAG,KACH,OAGJ,IAAIC,EAAQ,CAACD,EAAG,KAAK,EAErB,QAAWE,KAAQJ,EACfG,EAAM,KAAKC,CAAI,EAEXD,EAAM,SAAWJ,IACjB,MAAMI,EACNA,EAAQ,CAAC,GAKbA,EAAM,OAAS,IACf,MAAMA,EAEd,CASO,SAAUE,EAAWC,EAAyD,CACjF,QAAWR,KAAYQ,EACnB,QAAWF,KAAQN,EACf,MAAMM,CAGlB,CAmBO,SAAUG,EAASC,EAAWC,EAAoC,CACrE,IAAMC,EAAKC,EAAKF,CAAQ,EACpBG,EAAQJ,EACZ,KAAOI,KAAU,GAAG,CAChB,IAAMC,EAAIH,EAAG,KAAK,EAClB,GAAI,CAACG,EAAE,KACH,MAAMA,EAAE,UAGR,QAGZ,CAWO,SAAUC,EAAYL,EAAyC,CAClE,IAAMC,EAAKC,EAAKF,CAAQ,EAClBM,EAAQL,EAAG,KAAK,EACtB,GAAIK,EAAM,KACN,OAGJ,IAAIC,EAAQD,EAAM,MAClB,QAAWE,KAAMP,EACb,KAAM,CAACM,EAAIC,CAAE,EACbD,EAAKC,CAEb,CAgBO,SAASC,EAAaT,EAAuBU,EAAqC,CACrF,IAAMC,EAAO,CAAC,EACRC,EAAM,CAAC,EAEb,QAAWC,KAAQb,EACXU,EAAUG,CAAI,EACdF,EAAK,KAAKE,CAAI,EAEdD,EAAI,KAAKC,CAAI,EAIrB,MAAO,CAACF,EAAMC,CAAG,CACrB,CASO,SAAUE,KAAiBC,EAAmC,CAKjE,IAAMC,EAAgCC,EAAIF,EAAOb,CAAI,EAErD,KAAOc,EAAU,OAAS,GAAG,CACzB,IAAIE,EAAQ,EACZ,KAAOA,EAAQF,EAAU,QAAQ,CAE7B,IAAMG,EADKH,EAAUE,CAAK,EACR,KAAK,EAElBC,EAAO,KAORH,EAAU,OAAOE,EAAO,CAAC,GANzB,MAAMC,EAAO,MACbD,MAShB,CAaO,SAAUE,KAAYL,EAA0C,CAKnE,IAAMC,EAAgCC,EAAIF,EAAOb,CAAI,EAErD,KAAOc,EAAU,OAAS,GAAG,CACzB,IAAIE,EAAQ,EACNG,EAAQ,CAAC,EACf,KAAOH,EAAQF,EAAU,QAAQ,CAE7B,IAAMG,EADKH,EAAUE,CAAK,EACR,KAAK,EAElBC,EAAO,KAORH,EAAU,OAAOE,EAAO,CAAC,GANzBG,EAAM,KAAKF,EAAO,KAAK,EACvBD,KAQJG,EAAM,OAAS,IACf,MAAMA,GAGlB,CAKO,SAASC,EAAQvB,EAAWC,EAA4B,CAC3D,OAAO,MAAM,KAAKF,EAAMC,EAAGC,CAAQ,CAAC,CACxC,CAWO,SAAUuB,EACbvB,EACAwB,EAAgCC,EACrB,CACX,IAAMC,EAAO,IAAI,IACjB,QAAWb,KAAQb,EAAU,CACzB,IAAM2B,EAAMH,EAAMX,CAAI,EACjBa,EAAK,IAAIC,CAAG,IACbD,EAAK,IAAIC,CAAG,EACZ,MAAMd,GAGlB,CAWO,SAAUe,EACb5B,EACAwB,EAAgCC,EACrB,CACX,IAAII,EACJ,QAAWhB,KAAQb,EAAU,CACzB,IAAM2B,EAAMH,EAAMX,CAAI,EAClBc,IAAQE,IACR,MAAMhB,EACNgB,EAAOF,GAGnB,CCnQA,IAAMG,EAAW,OAAO,EAExB,SAASC,EAAWC,EAA6BC,EAAsD,CACnG,OAAQC,GAAcF,EAAGE,CAAC,GAAKD,EAAGC,CAAC,CACvC,CAEA,SAASC,EAAeC,EAAeC,EAAqBC,EAAc,CAEtE,GAAIF,EAAQ,EAAG,MAAM,IAAI,MAAM,0BAA0B,EAEzD,GAAIC,IAAS,MAAQA,EAAO,EAAG,MAAM,IAAI,MAAM,yBAAyB,EAExE,GAAIC,EAAO,EAAG,MAAM,IAAI,MAAM,yBAAyB,EAGvD,IAAIC,EAASH,EACTI,EAAQH,EACRG,IAAU,SACV,CAACD,EAAQC,CAAK,EAAI,CAAC,EAAGD,CAAM,GAGhC,IAAIE,EAAQP,GAAcA,GAAKK,EAE/B,GAAIC,IAAU,KAAM,CAChB,IAAME,EAAcF,EACpBC,EAAOV,EAAWU,EAAOP,GAAcA,EAAIQ,CAAW,EAG1D,OAAIJ,EAAO,IACPG,EAAOV,EAAWU,EAAOP,IAAeA,EAAIK,GAAUD,IAAS,CAAC,GAG7DG,CACX,CAQO,SAASE,KAAYC,EAAuC,CAC/D,OAAOC,EAAQD,CAAS,CAC5B,CAOO,SAAUE,EAAMV,EAAQ,EAAGE,EAAO,EAAqB,CAC1D,IAAIJ,EAAIE,EACR,OACI,MAAMF,EACNA,GAAKI,CAEb,CAKO,SAASS,EAAYC,EAAmBC,EAAmC,CAC9E,OAAO,MAAM,KAAKC,EAAUF,EAAMC,CAAS,CAAC,CAChD,CAOO,SAAUE,EAASC,EAAoC,CAC1D,IAAMC,EAAQ,CAAC,EACf,QAAWC,KAAWF,EAClB,MAAME,EACND,EAAM,KAAKC,CAAO,EAGtB,KAAOD,EAAM,OAAS,GAClB,QAAWC,KAAWD,EAClB,MAAMC,CAGlB,CAQO,SAAUC,GAAaH,EAAuBI,EAAsC,CACvF,IAAMC,EAAKC,EAAKN,CAAQ,EACxB,QAAWO,KAASF,EAChB,GAAI,CAACD,EAAUG,CAAK,EAAG,CACnB,MAAMA,EACN,MAIR,QAAWA,KAASF,EAChB,MAAME,CAEd,CAEO,SAAUC,GACbR,EACAS,EAAwBC,EAC0B,CAClD,IAAML,EAAKC,EAAKN,CAAQ,EAEpBW,EACAC,EAAgBlC,EAEhBmC,EAAeD,EAEbE,EAAU,UAAkBC,EAAoC,CAClE,KAAOH,IAAeG,GAAQ,CAC1B,MAAMJ,EAEN,IAAMK,EAAUX,EAAG,KAAK,EACxB,GAAIW,EAAQ,KAAM,OAClBL,EAAeK,EAAQ,MACvBJ,EAAaH,EAAME,CAAY,EAEvC,EAEA,OAAS,CACL,KAAOC,IAAeC,GAAW,CAC7B,IAAMG,EAAUX,EAAG,KAAK,EACxB,GAAIW,EAAQ,KAAM,CACdJ,EAAalC,EAEb,OAEJiC,EAAeK,EAAQ,MACvBJ,EAAaH,EAAME,CAAY,EAGnCE,EAAYD,EACZ,KAAM,CAACA,EAAYE,EAAQD,CAAS,CAAC,EAE7C,CAOO,SAAUf,EAAaF,EAAmBC,EAA2C,CACxF,OAAW,CAACoB,EAAGC,CAAC,IAAKC,EAAKvB,EAAMC,CAAS,EACjCqB,IACA,MAAMD,EAGlB,CAMO,SAAUG,EAAWpB,EAAuBI,EAAsC,CACrF,QAAWG,KAASP,EACZI,EAAUG,CAAK,IACf,MAAMA,EAGlB,CAMO,SAAUc,EAAWrB,EAAuBsB,EAAqC,CACpF,QAAWf,KAASP,EAChB,MAAMsB,EAAOf,CAAK,CAE1B,CAaO,SAAUgB,GACbvB,EACAwB,EACAC,EACAvC,EAAO,EACI,CACX,IAAIF,EAAOC,EACPwC,IAAiB,QAEjBzC,EAAQwC,EACRvC,EAAOwC,IAGPzC,EAAQ,EACRC,EAAOuC,GAGX,IAAMnC,EAAON,EAAeC,EAAOC,EAAMC,CAAI,EAC7C,OAAW,CAACwC,EAAGnB,CAAK,IAAKoB,EAAU3B,CAAQ,EACnCX,EAAKqC,CAAC,IACN,MAAMnB,EAGlB,CAQO,SAAUqB,EAAcC,EAAkBC,EAAsC,CACnF,IAAMC,EAAMzB,EAAKuB,CAAE,EACbG,EAAM1B,EAAKwB,CAAE,EACnB,OAAS,CACL,IAAMG,EAAIF,EAAI,KAAK,EACbG,EAAIF,EAAI,KAAK,EACnB,GAAI,CAACC,EAAE,MAAQ,CAACC,EAAE,KACd,KAAM,CAACD,EAAE,MAAOC,EAAE,KAAK,MAGvB,QAGZ,CAKO,SAAUC,EAAkBN,EAAkBC,EAAkBM,EAA0C,CAC7G,IAAML,EAAMzB,EAAKuB,CAAE,EACbG,EAAM1B,EAAKwB,CAAE,EACbO,EAAM/B,EAAK8B,CAAE,EACnB,OAAS,CACL,IAAMH,EAAIF,EAAI,KAAK,EACbG,EAAIF,EAAI,KAAK,EACbM,EAAID,EAAI,KAAK,EACnB,GAAI,CAACJ,EAAE,MAAQ,CAACC,EAAE,MAAQ,CAACI,EAAE,KACzB,KAAM,CAACL,EAAE,MAAOC,EAAE,MAAOI,EAAE,KAAK,MAGhC,QAGZ,CAEO,IAAMnB,EAAOS,EAOb,SAAUW,EAAwBV,EAAkBC,EAAkBU,EAAwC,CACjH,IAAMC,EAAUD,EACVT,EAAMzB,EAAKuB,CAAE,EACbG,EAAM1B,EAAKwB,CAAE,EACnB,OAAS,CACL,IAAMG,EAAIF,EAAI,KAAK,EACbG,EAAIF,EAAI,KAAK,EACnB,GAAIC,EAAE,MAAQC,EAAE,KAEZ,OAEA,KAAM,CAAED,EAAE,KAAiBQ,EAAVR,EAAE,MAAkBC,EAAE,KAAiBO,EAAVP,EAAE,KAAe,EAG3E,CAoCO,SAAUQ,KAAeC,EAAqC,CAEjE,IAAMC,EAAYD,EAAM,IAAIE,CAAI,EAEhC,OAAS,CACL,IAAMC,EAA6CF,EAAU,IAAKG,GAAOA,EAAG,KAAK,CAAC,EAClF,GAAIC,EAAIF,EAAQG,GAAM,CAACA,EAAE,IAAI,EACzB,MAAMH,EAAM,IAAKG,GAAMA,EAAE,KAAU,MAGnC,QAGZ,CAeO,SAAUC,GAAgBC,EAAuB,EAA2B,CAC/E,IAAMC,EAAO,MAAM,KAAKD,CAAQ,EAC1B,EAAIC,EAAK,OACTC,EAAI,IAAM,OAAY,EAAI,EAEhC,GAAIA,EAAI,EACJ,OAGJ,IAAIC,EAAoB,MAAM,KAAKC,EAAM,CAAC,CAAC,EACrCC,EAAmB,MAAM,KAAKD,EAAM,EAAG,EAAIF,EAAG,EAAE,CAAC,EACjDI,EAAcC,GAAcN,EAAKM,CAAC,EAIxC,IAFA,MAAMJ,EAAQ,MAAM,EAAGD,CAAC,EAAE,IAAII,CAAU,EAEjC,EAAI,GAAG,CACV,IAAIE,EAAY,GAChB,QAAWD,KAAKH,EAAMF,EAAI,EAAG,GAAI,EAAE,EAE/B,GADAG,EAAOE,CAAC,GAAK,EACTF,EAAOE,CAAC,IAAM,EACdJ,EAAUA,EACL,MAAM,EAAGI,CAAC,EACV,OAAOJ,EAAQ,MAAMI,EAAI,CAAC,CAAC,EAC3B,OAAOJ,EAAQ,MAAMI,EAAGA,EAAI,CAAC,CAAC,EACnCF,EAAOE,CAAC,EAAI,EAAIA,MACb,CACH,IAAME,EAAYJ,EAAOE,CAAC,EAEpB,CAACG,EAAGC,CAAC,EAAI,CAACR,EAAQA,EAAQ,OAASM,CAAC,EAAGN,EAAQI,CAAC,CAAC,EACvDJ,EAAQI,CAAC,EAAIG,EACbP,EAAQA,EAAQ,OAASM,CAAC,EAAIE,EAC9B,MAAMR,EAAQ,MAAM,EAAGD,CAAC,EAAE,IAAII,CAAU,EACxCE,EAAY,GACZ,MAIR,GAAIA,EACA,OAGZ,CAsBO,SAAUI,EAAaC,EAAuBC,EAAsC,CACvF,QAAWC,KAASF,EAAU,CAC1B,GAAI,CAACC,EAAUC,CAAK,EAAG,OACvB,MAAMA,EAEd,CAEO,SAASC,GAAuBC,EAAkBC,EAAkBC,EAAqC,CAC5G,OAAO,MAAM,KAAKC,EAAaH,EAAIC,EAAIC,CAAM,CAAC,CAClD,CAWO,IAAME,GAAcC,EACdC,GAAaC,GAEnB,SAASC,MAAcC,EAA6B,CACvD,OAAO,MAAM,KAAKC,EAAS,GAAGD,CAAK,CAAC,CACxC,CC7aA,SAASE,GAAaC,EAAe,CACjC,OAAOA,IAAM,MACjB,CAQO,SAAUC,EAAYC,EAAuD,CAChF,QAAWC,KAAQD,EACXC,GAAQ,OACR,MAAMA,EAGlB,CAKO,SAASC,GAAWF,EAA+C,CACtE,OAAO,MAAM,KAAKD,EAASC,CAAQ,CAAC,CACxC,CASO,SAASG,GAAmCC,EAAoD,CACnG,IAAMC,EAAS,CAAC,EAChB,OAAW,CAACC,EAAKC,CAAM,IAAK,OAAO,QAAQH,CAAG,EAAG,CAC7C,IAAMI,EAAQD,EACVC,GAAS,OACTH,EAAOC,CAAQ,EAAIE,GAG3B,OAAOH,CACX,CAOO,SAASI,GAAQT,EAAuBU,EAAqC,CAChF,IAAMC,EAAKD,GAASb,GACpB,QAAWW,KAASR,EAChB,GAAIW,EAAGH,CAAK,EACR,OAAOA,CAInB,CAOO,IAAMI,EAAQH,GAgBd,SAASI,GAAcb,EAAuBc,EAA+C,CAChG,OAAOC,EAAQC,EAAKhB,EAAUc,CAAM,CAAC,CACzC,CC9DO,SAASG,EAAOC,EAAuBC,EAAsBC,EAA4B,CAC5F,QAAWC,KAAQH,EACf,GAAI,CAACC,EAAME,CAAI,EACX,MAAO,GAIf,MAAO,EACX,CAmBO,SAASC,EAAOJ,EAAuBC,EAAsBC,EAA4B,CAC5F,QAAWC,KAAQH,EACf,GAAIC,EAAME,CAAI,EACV,MAAO,GAIf,MAAO,EACX,CAaO,SAASE,GAAYC,EAAuBC,EAAoB,CACnE,OAAOH,EAAIE,EAAWE,GAAMA,IAAMD,CAAM,CAC5C,CAeO,SAAUE,EAAaT,EAAuBU,EAAQ,EAA0B,CACnF,IAAIC,EAAgBD,EACpB,QAAWE,KAASZ,EAChB,KAAM,CAACW,IAASC,CAAK,CAE7B,CAKO,SAASC,GAAUb,EAAuBc,EAA8B,CAC3E,OAAO,MAAM,KAAKC,EAAQf,EAAUc,CAAS,CAAC,CAClD,CAQO,SAASE,EAAQhB,EAA4C,CAehE,OAAOA,EAAS,OAAO,QAAQ,EAAE,CAErC,CAKO,SAASiB,EAAUjB,EAAuBkB,EAA6B,CAC1E,OAAO,MAAM,KAAKC,EAAKnB,EAAUkB,CAAM,CAAC,CAC5C,CAaO,SAASE,GAAOpB,EAAuBC,EAA6BoB,EAA+B,CACtG,OAAOC,EAAQtB,EAAU,CAACQ,EAAGe,IAAOtB,EAAMO,CAAC,EAAIP,EAAMsB,CAAC,EAAIf,EAAIe,CAAE,CACpE,CAaO,SAASC,GAAOxB,EAAuBC,EAA6BoB,EAA+B,CACtG,OAAOC,EAAQtB,EAAU,CAACQ,EAAGe,IAAOtB,EAAMO,CAAC,EAAIP,EAAMsB,CAAC,EAAIf,EAAIe,CAAE,CACpE,CAKA,SAASE,EAAOf,EAAegB,EAAcC,EAAgC,CACzE,IAAMC,EAAUC,EAAMnB,EAAOiB,CAAI,EAC3BG,EAAOH,GAAQ,EAAKI,GAAcA,EAAIL,EAAQK,GAAcA,EAAIL,EACtE,OAAOM,EAAUJ,EAASE,CAAI,CAClC,CA0BO,SAASG,EAAMC,KAAcC,EAAkC,CAClE,IAAMC,EAAO,CAACF,EAAG,GAAGC,CAAI,EACxB,OAAQC,EAAK,OAAQ,CACjB,IAAK,GACD,OAAOX,EAAO,EAAGW,EAAK,CAAC,EAAG,CAAC,EAC/B,IAAK,GACD,OAAOX,EAAOW,EAAK,CAAC,EAAGA,EAAK,CAAC,EAAG,CAAC,EACrC,IAAK,GACD,OAAOX,EAAOW,EAAK,CAAC,EAAGA,EAAK,CAAC,EAAGA,EAAK,CAAC,CAAC,EAE3C,QAEI,MAAM,IAAI,MAAM,6BAA6B,CACrD,CACJ,CAuBO,SAASC,EAAarC,EAAuBsC,EAAgD5B,EAAa,CAC7G,IAAM6B,EAAKvB,EAAKhB,CAAQ,EACpBwC,EAAS9B,EACb,OAAW,CAACC,EAAOR,CAAI,IAAKM,EAAU8B,CAAE,EACpCC,EAASF,EAAQE,EAAQrC,EAAMQ,CAAK,EAExC,OAAO6B,CACX,CAKO,SAASlB,EAAWtB,EAAuBsC,EAA+D,CAC7G,IAAMC,EAAKvB,EAAKhB,CAAQ,EAClBU,EAAQ+B,EAAMF,CAAE,EACtB,GAAI7B,IAAU,OAGV,OAAO2B,EAAOE,EAAID,EAAS5B,CAAK,CAExC,CAeO,SAASgC,GACZ1C,EACAC,EAAgC0C,EAChCC,EAAU,GACP,CACH,IAAMC,EAAS,MAAM,KAAK7C,CAAQ,EAClC,OAAA6C,EAAO,KAAKC,EAAS7C,CAAK,CAAC,EAEvB2C,GACAC,EAAO,QAAQ,EAGZA,CACX,CAMO,SAASE,GAAI/C,EAAoC,CACpD,OAAOqC,EAAOrC,EAAU,CAACQ,EAAGe,IAAMf,EAAIe,EAAG,CAAC,CAC9C,CAKO,SAASyB,GAAYC,EAAkBC,EAAmC,CAC7E,OAAO,MAAM,KAAKC,EAAKF,EAAIC,CAAE,CAAC,CAClC,CAKO,SAASE,GAAiBH,EAAkBC,EAAkBG,EAAuC,CACxG,OAAO,MAAM,KAAKC,EAAML,EAAIC,EAAIG,CAAE,CAAC,CACvC","names":["keyToCmp","keyFn","a","b","ka","kb","identityPredicate","x","numberIdentity","primitiveIdentity","chunked","iterable","size","it","iter","r1","chunk","item","flatten","iterableOfIterables","itake","n","iterable","it","iter","count","s","pairwise","first","r1","r2","partition","predicate","good","bad","item","roundrobin","iters","iterables","map","index","result","heads","round","take","uniqueEverseen","keyFn","primitiveIdentity","seen","key","uniqueJustseen","last","SENTINEL","composeAnd","f1","f2","n","slicePredicate","start","stop","step","_start","_stop","pred","definedStop","chain","iterables","flatten","count","compress","data","selectors","icompress","cycle","iterable","saved","element","dropwhile","predicate","it","iter","value","groupby","keyFn","primitiveIdentity","currentValue","currentKey","targetKey","grouper","tgtKey","nextVal","d","s","izip","ifilter","imap","mapper","islice","stopOrStart","possiblyStop","i","enumerate","izip2","xs","ys","ixs","iys","x","y","izip3","zs","izs","z","izipLongest2","filler","filler_","izipMany","iters","iterables","iter","heads","xs","all","h","permutations","iterable","pool","x","indices","range","cycles","poolgetter","i","cleanExit","j","p","q","takewhile","iterable","predicate","value","zipLongest2","xs","ys","filler","izipLongest2","izipLongest","izipLongest2","zipLongest","zipLongest2","zipMany","iters","izipMany","isDefined","x","icompact","iterable","item","compact","compactObject","obj","result","key","value_","value","find","keyFn","fn","first","flatmap","mapper","flatten","imap","all","iterable","keyFn","identityPredicate","item","any","contains","haystack","needle","x","enumerate","start","index","value","filter","predicate","ifilter","iter","map","mapper","imap","max","numberIdentity","reduce_","y","min","_range","stop","step","counter","count","pred","n","takewhile","range","a","rest","args","reduce","reducer","it","output","first","sorted","primitiveIdentity","reverse","result","keyToCmp","sum","zip","xs","ys","izip","zip3","zs","izip3"]}
+{"version":3,"sources":["../src/utils.ts","../src/more-itertools.ts","../src/itertools.ts","../src/custom.ts","../src/builtins.ts"],"sourcesContent":["import type { Primitive } from './types';\n\ntype CmpFn<T> = (a: T, b: T) => number;\n\nexport function keyToCmp<T>(keyFn: (item: T) => Primitive): CmpFn<T> {\n    return (a: T, b: T) => {\n        const ka = keyFn(a);\n        const kb = keyFn(b);\n        // istanbul ignore else -- @preserve\n        if (typeof ka === 'boolean' && typeof kb === 'boolean') {\n            return ka === kb ? 0 : !ka && kb ? -1 : 1;\n        } else if (typeof ka === 'number' && typeof kb === 'number') {\n            return ka - kb;\n        } else if (typeof ka === 'string' && typeof kb === 'string') {\n            return ka === kb ? 0 : ka < kb ? -1 : 1;\n        } else {\n            return -1;\n        }\n    };\n}\n\nexport function identityPredicate(x: unknown): boolean {\n    return !!x;\n}\n\nexport function numberIdentity(x: unknown): number {\n    // istanbul ignore if -- @preserve\n    if (typeof x !== 'number') {\n        throw new Error('Inputs must be numbers');\n    }\n    return x;\n}\n\nexport function primitiveIdentity<P extends Primitive>(x: P): P;\nexport function primitiveIdentity(x: unknown): Primitive;\nexport function primitiveIdentity(x: unknown): Primitive {\n    // istanbul ignore if -- @preserve\n    if (typeof x !== 'string' && typeof x !== 'number' && typeof x !== 'boolean') {\n        throw new Error('Please provide a key function that can establish object identity');\n    }\n    return x;\n}\n","import { iter, map } from './builtins';\nimport { izip, repeat } from './itertools';\nimport type { Predicate, Primitive } from './types';\nimport { primitiveIdentity } from './utils';\n\n/**\n * Break iterable into lists of length `size`:\n *\n *     [...chunked([1, 2, 3, 4, 5, 6], 3)]\n *     // [[1, 2, 3], [4, 5, 6]]\n *\n * If the length of iterable is not evenly divisible by `size`, the last returned\n * list will be shorter:\n *\n *     [...chunked([1, 2, 3, 4, 5, 6, 7, 8], 3)]\n *     // [[1, 2, 3], [4, 5, 6], [7, 8]]\n */\nexport function* chunked<T>(iterable: Iterable<T>, size: number): Iterable<T[]> {\n    if (size < 1) {\n        throw new Error(`Invalid chunk size: ${size}`);\n    }\n\n    const it = iter(iterable);\n    for (;;) {\n        const chunk = take(size, it);\n        if (chunk.length > 0) {\n            yield chunk;\n        }\n        if (chunk.length < size) {\n            return;\n        }\n    }\n}\n\n/**\n * Return an iterator flattening one level of nesting in a list of lists:\n *\n *     [...flatten([[0, 1], [2, 3]])]\n *     // [0, 1, 2, 3]\n *\n */\nexport function* flatten<T>(iterableOfIterables: Iterable<Iterable<T>>): Iterable<T> {\n    for (const iterable of iterableOfIterables) {\n        for (const item of iterable) {\n            yield item;\n        }\n    }\n}\n\n/**\n * Intersperse filler element `value` among the items in `iterable`.\n *\n *     >>> [...intersperse(-1, range(1, 5))]\n *     [1, -1, 2, -1, 3, -1, 4]\n *\n */\nexport function intersperse<T, V>(value: V, iterable: Iterable<T>): Iterable<T | V> {\n    const stream = flatten(izip(repeat(value), iterable));\n    take(1, stream); // eat away and discard the first value from the output\n    return stream;\n}\n\n/**\n * Returns an iterable containing only the first `n` elements of the given\n * iterable.\n */\nexport function* itake<T>(n: number, iterable: Iterable<T>): Iterable<T> {\n    const it = iter(iterable);\n    let count = n;\n    while (count-- > 0) {\n        const s = it.next();\n        if (!s.done) {\n            yield s.value;\n        } else {\n            // Iterable exhausted, quit early\n            return;\n        }\n    }\n}\n\n/**\n * Returns an iterator of paired items, overlapping, from the original.  When\n * the input iterable has a finite number of items `n`, the outputted iterable\n * will have `n - 1` items.\n *\n *     >>> pairwise([8, 2, 0, 7])\n *     [(8, 2), (2, 0), (0, 7)]\n *\n */\nexport function* pairwise<T>(iterable: Iterable<T>): Iterable<[T, T]> {\n    const it = iter(iterable);\n    const first = it.next();\n    if (first.done) {\n        return;\n    }\n\n    let r1: T = first.value;\n    for (const r2 of it) {\n        yield [r1, r2];\n        r1 = r2;\n    }\n}\n\n/**\n * Returns a 2-tuple of arrays.  Splits the elements in the input iterable into\n * either of the two arrays.  Will fully exhaust the input iterable.  The first\n * array contains all items that match the predicate, the second the rest:\n *\n *     >>> const isOdd = x => x % 2 !== 0;\n *     >>> const iterable = range(10);\n *     >>> const [odds, evens] = partition(iterable, isOdd);\n *     >>> odds\n *     [1, 3, 5, 7, 9]\n *     >>> evens\n *     [0, 2, 4, 6, 8]\n *\n */\nexport function partition<T, N extends T>(\n    iterable: Iterable<T>,\n    predicate: (item: T) => item is N\n): [N[], Exclude<T, N>[]];\nexport function partition<T>(iterable: Iterable<T>, predicate: Predicate<T>): [T[], T[]];\nexport function partition<T>(iterable: Iterable<T>, predicate: Predicate<T>): [T[], T[]] {\n    const good = [];\n    const bad = [];\n\n    for (const item of iterable) {\n        if (predicate(item)) {\n            good.push(item);\n        } else {\n            bad.push(item);\n        }\n    }\n\n    return [good, bad];\n}\n\n/**\n * Yields the next item from each iterable in turn, alternating between them.\n * Continues until all items are exhausted.\n *\n *     >>> [...roundrobin([1, 2, 3], [4], [5, 6, 7, 8])]\n *     [1, 4, 5, 2, 6, 3, 7, 8]\n */\nexport function* roundrobin<T>(...iters: Iterable<T>[]): Iterable<T> {\n    // We'll only keep lazy versions of the input iterables in here that we'll\n    // slowly going to exhaust.  Once an iterable is exhausted, it will be\n    // removed from this list.  Once the entire list is empty, this algorithm\n    // ends.\n    const iterables: Array<Iterator<T>> = map(iters, iter);\n\n    while (iterables.length > 0) {\n        let index = 0;\n        while (index < iterables.length) {\n            const it = iterables[index];\n            const result = it.next();\n\n            if (!result.done) {\n                yield result.value;\n                index++;\n            } else {\n                // This iterable is exhausted, make sure to remove it from the\n                // list of iterables.  We'll splice the array from under our\n                // feet, and NOT advancing the index counter.\n                iterables.splice(index, 1); // intentional side-effect!\n            }\n        }\n    }\n}\n\n/**\n * Yields the heads of all of the given iterables.  This is almost like\n * `roundrobin()`, except that the yielded outputs are grouped in to the\n * \"rounds\":\n *\n *     >>> [...heads([1, 2, 3], [4], [5, 6, 7, 8])]\n *     [[1, 4, 5], [2, 6], [3, 7], [8]]\n *\n * This is also different from `zipLongest()`, since the number of items in\n * each round can decrease over time, rather than being filled with a filler.\n */\nexport function* heads<T>(...iters: Array<Iterable<T>>): Iterable<T[]> {\n    // We'll only keep lazy versions of the input iterables in here that we'll\n    // slowly going to exhaust.  Once an iterable is exhausted, it will be\n    // removed from this list.  Once the entire list is empty, this algorithm\n    // ends.\n    const iterables: Array<Iterator<T>> = map(iters, iter);\n\n    while (iterables.length > 0) {\n        let index = 0;\n        const round = [];\n        while (index < iterables.length) {\n            const it = iterables[index];\n            const result = it.next();\n\n            if (!result.done) {\n                round.push(result.value);\n                index++;\n            } else {\n                // This iterable is exhausted, make sure to remove it from the\n                // list of iterables.  We'll splice the array from under our\n                // feet, and NOT advancing the index counter.\n                iterables.splice(index, 1); // intentional side-effect!\n            }\n        }\n        if (round.length > 0) {\n            yield round;\n        }\n    }\n}\n\n/**\n * Non-lazy version of itake().\n */\nexport function take<T>(n: number, iterable: Iterable<T>): T[] {\n    return Array.from(itake(n, iterable));\n}\n\n/**\n * Yield unique elements, preserving order.\n *\n *     >>> [...uniqueEverseen('AAAABBBCCDAABBB')]\n *     ['A', 'B', 'C', 'D']\n *     >>> [...uniqueEverseen('AbBCcAB', s => s.toLowerCase())]\n *     ['A', 'b', 'C']\n *\n */\nexport function* uniqueEverseen<T>(\n    iterable: Iterable<T>,\n    keyFn: (item: T) => Primitive = primitiveIdentity\n): Iterable<T> {\n    const seen = new Set();\n    for (const item of iterable) {\n        const key = keyFn(item);\n        if (!seen.has(key)) {\n            seen.add(key);\n            yield item;\n        }\n    }\n}\n\n/**\n * Yields elements in order, ignoring serial duplicates.\n *\n *     >>> [...uniqueJustseen('AAAABBBCCDAABBB')]\n *     ['A', 'B', 'C', 'D', 'A', 'B']\n *     >>> [...uniqueJustseen('AbBCcAB', s => s.toLowerCase())]\n *     ['A', 'b', 'C', 'A', 'B']\n *\n */\nexport function* uniqueJustseen<T>(\n    iterable: Iterable<T>,\n    keyFn: (item: T) => Primitive = primitiveIdentity\n): Iterable<T> {\n    let last = undefined;\n    for (const item of iterable) {\n        const key = keyFn(item);\n        if (key !== last) {\n            yield item;\n            last = key;\n        }\n    }\n}\n","import { all, enumerate, iter, range } from './builtins';\nimport { flatten } from './more-itertools';\nimport type { Predicate, Primitive } from './types';\nimport { primitiveIdentity } from './utils';\n\nconst SENTINEL = Symbol();\n\nfunction composeAnd(f1: (v1: number) => boolean, f2: (v2: number) => boolean): (v3: number) => boolean {\n    return (n: number) => f1(n) && f2(n);\n}\n\nfunction slicePredicate(start: number, stop: number | null, step: number) {\n    // istanbul ignore if -- @preserve\n    if (start < 0) throw new Error('start cannot be negative');\n    // istanbul ignore if -- @preserve\n    if (stop !== null && stop < 0) throw new Error('stop cannot be negative');\n    // istanbul ignore if -- @preserve\n    if (step < 0) throw new Error('step cannot be negative');\n\n    let pred = (n: number) => n >= start;\n\n    if (stop !== null) {\n        const definedStop = stop;\n        pred = composeAnd(pred, (n: number) => n < definedStop);\n    }\n\n    if (step > 1) {\n        pred = composeAnd(pred, (n: number) => (n - start) % step === 0);\n    }\n\n    return pred;\n}\n\n/**\n * Returns an iterator that returns elements from the first iterable until it\n * is exhausted, then proceeds to the next iterable, until all of the iterables\n * are exhausted.  Used for treating consecutive sequences as a single\n * sequence.\n */\nexport function chain<T>(...iterables: Iterable<T>[]): Iterable<T> {\n    return flatten(iterables);\n}\n\n/**\n * Returns an iterator that counts up values starting with number `start`\n * (default 0), incrementing by `step`.  To decrement, use a negative step\n * number.\n */\nexport function* count(start = 0, step = 1): Iterable<number> {\n    let n = start;\n    for (;;) {\n        yield n;\n        n += step;\n    }\n}\n\n/**\n * Non-lazy version of icompress().\n */\nexport function compress<T>(data: Iterable<T>, selectors: Iterable<boolean>): T[] {\n    return Array.from(icompress(data, selectors));\n}\n\n/**\n * Returns an iterator producing elements from the iterable and saving a copy\n * of each.  When the iterable is exhausted, return elements from the saved\n * copy.  Repeats indefinitely.\n */\nexport function* cycle<T>(iterable: Iterable<T>): Iterable<T> {\n    const saved = [];\n    for (const element of iterable) {\n        yield element;\n        saved.push(element);\n    }\n\n    while (saved.length > 0) {\n        for (const element of saved) {\n            yield element;\n        }\n    }\n}\n\n/**\n * Returns an iterator that drops elements from the iterable as long as the\n * predicate is true; afterwards, returns every remaining element.  Note, the\n * iterator does not produce any output until the predicate first becomes\n * false.\n */\nexport function* dropwhile<T>(iterable: Iterable<T>, predicate: Predicate<T>): Iterable<T> {\n    const it = iter(iterable);\n    for (const value of it) {\n        if (!predicate(value)) {\n            yield value;\n            break;\n        }\n    }\n\n    for (const value of it) {\n        yield value;\n    }\n}\n\nexport function* groupby<T, K extends Primitive>(\n    iterable: Iterable<T>,\n    keyFn: (item: T) => K = primitiveIdentity\n): Generator<[K, Generator<T, undefined>], undefined> {\n    const it = iter(iterable);\n\n    let currentValue: T;\n    let currentKey: K = SENTINEL as unknown as K;\n    //                           ^^^^^^^^^^^^^^^ Hack!\n    let targetKey: K = currentKey;\n\n    const grouper = function* grouper(tgtKey: K): Generator<T, undefined> {\n        while (currentKey === tgtKey) {\n            yield currentValue;\n\n            const nextVal = it.next();\n            if (nextVal.done) return;\n            currentValue = nextVal.value;\n            currentKey = keyFn(currentValue);\n        }\n    };\n\n    for (;;) {\n        while (currentKey === targetKey) {\n            const nextVal = it.next();\n            if (nextVal.done) {\n                currentKey = SENTINEL as unknown as K;\n                //                    ^^^^^^^^^^^^^^^ Hack!\n                return;\n            }\n            currentValue = nextVal.value;\n            currentKey = keyFn(currentValue);\n        }\n\n        targetKey = currentKey;\n        yield [currentKey, grouper(targetKey)];\n    }\n}\n\n/**\n * Returns an iterator that filters elements from data returning only those\n * that have a corresponding element in selectors that evaluates to `true`.\n * Stops when either the data or selectors iterables has been exhausted.\n */\nexport function* icompress<T>(data: Iterable<T>, selectors: Iterable<boolean>): Iterable<T> {\n    for (const [d, s] of izip(data, selectors)) {\n        if (s) {\n            yield d;\n        }\n    }\n}\n\n/**\n * Returns an iterator that filters elements from iterable returning only those\n * for which the predicate is true.\n */\nexport function ifilter<T, N extends T>(iterable: Iterable<T>, predicate: (item: T) => item is N): Iterable<N>;\nexport function ifilter<T>(iterable: Iterable<T>, predicate: Predicate<T>): Iterable<T>;\nexport function* ifilter<T>(iterable: Iterable<T>, predicate: Predicate<T>): Iterable<T> {\n    for (const value of iterable) {\n        if (predicate(value)) {\n            yield value;\n        }\n    }\n}\n\n/**\n * Returns an iterator that computes the given mapper function using arguments\n * from each of the iterables.\n */\nexport function* imap<T, V>(iterable: Iterable<T>, mapper: (item: T) => V): Iterable<V> {\n    for (const value of iterable) {\n        yield mapper(value);\n    }\n}\n\n/**\n * Returns an iterator that returns selected elements from the iterable.  If\n * `start` is non-zero, then elements from the iterable are skipped until start\n * is reached.  Then, elements are returned by making steps of `step` (defaults\n * to 1).  If set to higher than 1, items will be skipped.  If `stop` is\n * provided, then iteration continues until the iterator reached that index,\n * otherwise, the iterable will be fully exhausted.  `islice()` does not\n * support negative values for `start`, `stop`, or `step`.\n */\nexport function islice<T>(iterable: Iterable<T>, stop: number): Iterable<T>;\nexport function islice<T>(iterable: Iterable<T>, start: number, stop?: number | null, step?: number): Iterable<T>;\nexport function* islice<T>(\n    iterable: Iterable<T>,\n    stopOrStart: number,\n    possiblyStop?: number | null,\n    step = 1\n): Iterable<T> {\n    let start, stop;\n    if (possiblyStop !== undefined) {\n        // islice(iterable, start, stop[, step])\n        start = stopOrStart;\n        stop = possiblyStop;\n    } else {\n        // islice(iterable, stop)\n        start = 0;\n        stop = stopOrStart;\n    }\n\n    const pred = slicePredicate(start, stop, step);\n    for (const [i, value] of enumerate(iterable)) {\n        if (pred(i)) {\n            yield value;\n        }\n    }\n}\n\n/**\n * Returns an iterator that aggregates elements from each of the iterables.\n * Used for lock-step iteration over several iterables at a time.  When\n * iterating over two iterables, use `izip2`.  When iterating over three\n * iterables, use `izip3`, etc.  `izip` is an alias for `izip2`.\n */\nexport function* izip2<T1, T2>(xs: Iterable<T1>, ys: Iterable<T2>): Iterable<[T1, T2]> {\n    const ixs = iter(xs);\n    const iys = iter(ys);\n    for (;;) {\n        const x = ixs.next();\n        const y = iys.next();\n        if (!x.done && !y.done) {\n            yield [x.value, y.value];\n        } else {\n            // One of the iterables exhausted\n            return;\n        }\n    }\n}\n\n/**\n * Like izip2, but for three input iterables.\n */\nexport function* izip3<T1, T2, T3>(xs: Iterable<T1>, ys: Iterable<T2>, zs: Iterable<T3>): Iterable<[T1, T2, T3]> {\n    const ixs = iter(xs);\n    const iys = iter(ys);\n    const izs = iter(zs);\n    for (;;) {\n        const x = ixs.next();\n        const y = iys.next();\n        const z = izs.next();\n        if (!x.done && !y.done && !z.done) {\n            yield [x.value, y.value, z.value];\n        } else {\n            // One of the iterables exhausted\n            return;\n        }\n    }\n}\n\nexport const izip = izip2;\n\n/**\n * Returns an iterator that aggregates elements from each of the iterables.  If\n * the iterables are of uneven length, missing values are filled-in with\n * fillvalue.  Iteration continues until the longest iterable is exhausted.\n */\nexport function* izipLongest2<T1, T2, D>(xs: Iterable<T1>, ys: Iterable<T2>, filler?: D): Iterable<[T1 | D, T2 | D]> {\n    const filler_ = filler as D;\n    const ixs = iter(xs);\n    const iys = iter(ys);\n    for (;;) {\n        const x = ixs.next();\n        const y = iys.next();\n        if (x.done && y.done) {\n            // All iterables exhausted\n            return;\n        } else {\n            yield [!x.done ? x.value : filler_, !y.done ? y.value : filler_];\n        }\n    }\n}\n\n/**\n * See izipLongest2, but for three.\n */\nexport function* izipLongest3<T1, T2, T3, D = undefined>(\n    xs: Iterable<T1>,\n    ys: Iterable<T2>,\n    zs: Iterable<T3>,\n    filler?: D\n): Iterable<[T1 | D, T2 | D, T3 | D]> {\n    const filler_ = filler as D;\n    const ixs = iter(xs);\n    const iys = iter(ys);\n    const izs = iter(zs);\n    for (;;) {\n        const x = ixs.next();\n        const y = iys.next();\n        const z = izs.next();\n        if (x.done && y.done && z.done) {\n            // All iterables exhausted\n            return;\n        } else {\n            yield [!x.done ? x.value : filler_, !y.done ? y.value : filler_, !z.done ? z.value : filler_];\n        }\n    }\n}\n\n/**\n * Like the other izips (`izip`, `izip3`, etc), but generalized to take an\n * unlimited amount of input iterables.  Think `izip(*iterables)` in Python.\n *\n * **Note:** Due to Flow type system limitations, you can only \"generially\" zip\n * iterables with homogeneous types, so you cannot mix types like <A, B> like\n * you can with izip2().\n */\nexport function* izipMany<T>(...iters: Iterable<T>[]): Iterable<T[]> {\n    // Make them all iterables\n    const iterables = iters.map(iter);\n\n    for (;;) {\n        const heads: Array<IteratorResult<T, undefined>> = iterables.map((xs) => xs.next());\n        if (all(heads, (h) => !h.done)) {\n            yield heads.map((h) => h.value as T);\n        } else {\n            // One of the iterables exhausted\n            return;\n        }\n    }\n}\n\n/**\n * Return successive `r`-length permutations of elements in the iterable.\n *\n * If `r` is not specified, then `r` defaults to the length of the iterable and\n * all possible full-length permutations are generated.\n *\n * Permutations are emitted in lexicographic sort order.  So, if the input\n * iterable is sorted, the permutation tuples will be produced in sorted order.\n *\n * Elements are treated as unique based on their position, not on their value.\n * So if the input elements are unique, there will be no repeat values in each\n * permutation.\n */\nexport function* permutations<T>(iterable: Iterable<T>, r?: number): Iterable<T[]> {\n    const pool = Array.from(iterable);\n    const n = pool.length;\n    const x = r === undefined ? n : r;\n\n    if (x > n) {\n        return;\n    }\n\n    let indices: number[] = Array.from(range(n));\n    const cycles: number[] = Array.from(range(n, n - x, -1));\n    const poolgetter = (i: number) => pool[i];\n\n    yield indices.slice(0, x).map(poolgetter);\n\n    while (n > 0) {\n        let cleanExit = true;\n        for (const i of range(x - 1, -1, -1)) {\n            cycles[i] -= 1;\n            if (cycles[i] === 0) {\n                indices = indices\n                    .slice(0, i)\n                    .concat(indices.slice(i + 1))\n                    .concat(indices.slice(i, i + 1));\n                cycles[i] = n - i;\n            } else {\n                const j: number = cycles[i];\n\n                const [p, q] = [indices[indices.length - j], indices[i]];\n                indices[i] = p;\n                indices[indices.length - j] = q;\n                yield indices.slice(0, x).map(poolgetter);\n                cleanExit = false;\n                break;\n            }\n        }\n\n        if (cleanExit) {\n            return;\n        }\n    }\n}\n\n/**\n * Returns an iterator that produces values over and over again.  Runs\n * indefinitely unless the times argument is specified.\n */\nexport function* repeat<T>(thing: T, times?: number): Iterable<T> {\n    if (times === undefined) {\n        for (;;) {\n            yield thing;\n        }\n    } else {\n        for (const _ of range(times)) {\n            yield thing;\n        }\n    }\n}\n\n/**\n * Returns an iterator that produces elements from the iterable as long as the\n * predicate is true.\n */\nexport function* takewhile<T>(iterable: Iterable<T>, predicate: Predicate<T>): Iterable<T> {\n    for (const value of iterable) {\n        if (!predicate(value)) return;\n        yield value;\n    }\n}\n\nexport function zipLongest2<T1, T2, D>(xs: Iterable<T1>, ys: Iterable<T2>, filler?: D): Array<[T1 | D, T2 | D]> {\n    return Array.from(izipLongest2(xs, ys, filler));\n}\n\nexport function zipLongest3<T1, T2, T3, D>(\n    xs: Iterable<T1>,\n    ys: Iterable<T2>,\n    zs: Iterable<T3>,\n    filler?: D\n): Array<[T1 | D, T2 | D, T3 | D]> {\n    return Array.from(izipLongest3(xs, ys, zs, filler));\n}\n\nexport const izipLongest = izipLongest2;\nexport const zipLongest = zipLongest2;\n\nexport function zipMany<T>(...iters: Iterable<T>[]): T[][] {\n    return Array.from(izipMany(...iters));\n}\n","import { imap } from './itertools';\nimport { flatten } from './more-itertools';\nimport type { Predicate } from './types';\n\nfunction isDefined<T>(x: T): boolean {\n    return x !== undefined;\n}\n\n/**\n * Returns an iterable, filtering out any `undefined` values from the iterable.\n *\n *     >>> compact([1, 2, undefined, 3])\n *     [1, 2, 3]\n */\nexport function* icompact<T>(iterable: Iterable<T | null | undefined>): Iterable<T> {\n    for (const item of iterable) {\n        if (item != null) {\n            yield item;\n        }\n    }\n}\n\n/**\n * See icompact().\n */\nexport function compact<T>(iterable: Iterable<T | null | undefined>): T[] {\n    return Array.from(icompact(iterable));\n}\n\n/**\n * Removes all undefined values from the given object.  Returns a new object.\n *\n *     >>> compactObject({ a: 1, b: undefined, c: 0 })\n *     { a: 1, c: 0 }\n *\n */\nexport function compactObject<K extends string, V>(obj: Record<K, V | null | undefined>): Record<K, V> {\n    const result = {} as Record<K, V>;\n    for (const [key, value_] of Object.entries(obj)) {\n        const value = value_ as V | null | undefined;\n        if (value != null) {\n            result[key as K] = value;\n        }\n    }\n    return result;\n}\n\n/**\n * Returns the first item in the iterable for which the predicate holds, if\n * any. If no predicate is given, it will return the first value returned by\n * the iterable.\n */\nexport function find<T>(iterable: Iterable<T>, keyFn?: Predicate<T>): T | undefined {\n    if (keyFn === undefined) {\n        for (const value of iterable) {\n            return value;\n        }\n        return undefined;\n    } else {\n        for (const value of iterable) {\n            if (keyFn(value)) {\n                return value;\n            }\n        }\n        return undefined;\n    }\n}\n\n/**\n * Almost an alias of find(). The key difference is that if an empty\n */\nexport function first<T>(iterable: Iterable<T>, keyFn?: Predicate<T>): T | undefined {\n    return find(iterable, keyFn ?? isDefined);\n}\n\n/**\n * Returns 0 or more values for every value in the given iterable.\n * Technically, it's just calling map(), followed by flatten(), but it's a very\n * useful operation if you want to map over a structure, but not have a 1:1\n * input-output mapping.  Instead, if you want to potentially return 0 or more\n * values per input element, use flatmap():\n *\n * For example, to return all numbers `n` in the input iterable `n` times:\n *\n *     >>> const repeatN = n => repeat(n, n);\n *     >>> [...flatmap([0, 1, 2, 3, 4], repeatN)]\n *     [1, 2, 2, 3, 3, 3, 4, 4, 4, 4]  // note: no 0\n *\n */\nexport function flatmap<T, S>(iterable: Iterable<T>, mapper: (item: T) => Iterable<S>): Iterable<S> {\n    return flatten(imap(iterable, mapper));\n}\n","import { first } from './custom';\nimport { count, ifilter, imap, izip, izip3, takewhile } from './itertools';\nimport type { Predicate, Primitive } from './types';\nimport { identityPredicate, keyToCmp, numberIdentity, primitiveIdentity } from './utils';\n\n/**\n * Returns true when all of the items in iterable are truthy.  An optional key\n * function can be used to define what truthiness means for this specific\n * collection.\n *\n * Examples:\n *\n *     all([])                           // => true\n *     all([0])                          // => false\n *     all([0, 1, 2])                    // => false\n *     all([1, 2, 3])                    // => true\n *\n * Examples with using a key function:\n *\n *     all([2, 4, 6], n => n % 2 === 0)  // => true\n *     all([2, 4, 5], n => n % 2 === 0)  // => false\n *\n */\nexport function every<T>(iterable: Iterable<T>, keyFn: Predicate<T> = identityPredicate): boolean {\n    for (const item of iterable) {\n        if (!keyFn(item)) {\n            return false;\n        }\n    }\n\n    return true;\n}\n\n/**\n * Returns true when any of the items in iterable are truthy.  An optional key\n * function can be used to define what truthiness means for this specific\n * collection.\n *\n * Examples:\n *\n *     any([])                           // => false\n *     any([0])                          // => false\n *     any([0, 1, null, undefined])      // => true\n *\n * Examples with using a key function:\n *\n *     any([1, 4, 5], n => n % 2 === 0)  // => true\n *     any([{name: 'Bob'}, {name: 'Alice'}], person => person.name.startsWith('C'))  // => false\n *\n */\nexport function some<T>(iterable: Iterable<T>, keyFn: Predicate<T> = identityPredicate): boolean {\n    for (const item of iterable) {\n        if (keyFn(item)) {\n            return true;\n        }\n    }\n\n    return false;\n}\n\n/**\n * Alias of `every()`.\n */\nexport const all = every;\n\n/**\n * Alias of `some()`.\n */\nexport const any = some;\n\n/**\n * Returns true when any of the items in the iterable are equal to the target object.\n *\n * Examples:\n *\n *     contains([], 'whatever')         // => false\n *     contains([3], 42)                // => false\n *     contains([3], 3)                 // => true\n *     contains([0, 1, 2], 2)           // => true\n *\n */\nexport function contains<T>(haystack: Iterable<T>, needle: T): boolean {\n    return any(haystack, (x) => x === needle);\n}\n\n/**\n * Returns an iterable of enumeration pairs.  Iterable must be a sequence, an\n * iterator, or some other object which supports iteration.  The elements\n * produced by returns a tuple containing a counter value (starting from 0 by\n * default) and the values obtained from iterating over given iterable.\n *\n * Example:\n *\n *     import { enumerate } from 'itertools';\n *\n *     console.log([...enumerate(['hello', 'world'])]);\n *     // [0, 'hello'], [1, 'world']]\n */\nexport function* enumerate<T>(iterable: Iterable<T>, start = 0): Iterable<[number, T]> {\n    let index: number = start;\n    for (const value of iterable) {\n        yield [index++, value];\n    }\n}\n\n/**\n * Non-lazy version of ifilter().\n */\nexport function filter<T, N extends T>(iterable: Iterable<T>, predicate: (item: T) => item is N): N[];\nexport function filter<T>(iterable: Iterable<T>, predicate: Predicate<T>): T[];\nexport function filter<T>(iterable: Iterable<T>, predicate: Predicate<T>): T[] {\n    return Array.from(ifilter(iterable, predicate));\n}\n\n/**\n * Returns an iterator object for the given iterable.  This can be used to\n * manually get an iterator for any iterable datastructure.  The purpose and\n * main use case of this function is to get a single iterator (a thing with\n * state, think of it as a \"cursor\") which can only be consumed once.\n */\nexport function iter<T>(iterable: Iterable<T>): IterableIterator<T> {\n    // class SelfIter implements IterableIterator<T> {\n    //     #iterator: Iterator<T>;\n    //     constructor(orig: Iterable<T>) {\n    //         this.#iterator = orig[Symbol.iterator]();\n    //     }\n    //     [Symbol.iterator]() {\n    //         return this;\n    //     }\n    //     next() {\n    //         return this.#iterator.next();\n    //     }\n    // }\n    // return new SelfIter(iterable);\n\n    return iterable[Symbol.iterator]() as IterableIterator<T>;\n    //                                 ^^^^^^^^^^^^^^^^^^^^^^ Not safe!\n}\n\n/**\n * Non-lazy version of imap().\n */\nexport function map<T, V>(iterable: Iterable<T>, mapper: (item: T) => V): V[] {\n    return Array.from(imap(iterable, mapper));\n}\n\n/**\n * Return the largest item in an iterable.  Only works for numbers, as ordering\n * is pretty poorly defined on any other data type in JS.  The optional `keyFn`\n * argument specifies a one-argument ordering function like that used for\n * sorted().\n *\n * If the iterable is empty, `undefined` is returned.\n *\n * If multiple items are maximal, the function returns either one of them, but\n * which one is not defined.\n */\nexport function max<T>(iterable: Iterable<T>, keyFn: (item: T) => number = numberIdentity): T | undefined {\n    return reduce2(iterable, (x, y) => (keyFn(x) > keyFn(y) ? x : y));\n}\n\n/**\n * Return the smallest item in an iterable.  Only works for numbers, as\n * ordering is pretty poorly defined on any other data type in JS.  The\n * optional `keyFn` argument specifies a one-argument ordering function like\n * that used for sorted().\n *\n * If the iterable is empty, `undefined` is returned.\n *\n * If multiple items are minimal, the function returns either one of them, but\n * which one is not defined.\n */\nexport function min<T>(iterable: Iterable<T>, keyFn: (item: T) => number = numberIdentity): T | undefined {\n    return reduce2(iterable, (x, y) => (keyFn(x) < keyFn(y) ? x : y));\n}\n\n/**\n * Internal helper for the range function\n */\nfunction range_(start: number, stop: number, step: number): Iterable<number> {\n    const counter = count(start, step);\n    const pred = step >= 0 ? (n: number) => n < stop : (n: number) => n > stop;\n    return takewhile(counter, pred);\n}\n\n/**\n * Returns an iterator producing all the numbers in the given range one by one,\n * starting from `start` (default 0), as long as `i < stop`, in increments of\n * `step` (default 1).\n *\n * `range(a)` is a convenient shorthand for `range(0, a)`.\n *\n * Various valid invocations:\n *\n *     range(5)           // [0, 1, 2, 3, 4]\n *     range(2, 5)        // [2, 3, 4]\n *     range(0, 5, 2)     // [0, 2, 4]\n *     range(5, 0, -1)    // [5, 4, 3, 2, 1]\n *     range(-3)          // []\n *\n * For a positive `step`, the iterator will keep producing values `n` as long\n * as the stop condition `n < stop` is satisfied.\n *\n * For a negative `step`, the iterator will keep producing values `n` as long\n * as the stop condition `n > stop` is satisfied.\n *\n * The produced range will be empty if the first value to produce already does\n * not meet the value constraint.\n */\n\nexport function range(stop: number): Iterable<number>;\nexport function range(start: number, stop: number, step?: number): Iterable<number>;\nexport function range(startOrStop: number, definitelyStop?: number, step = 1): Iterable<number> {\n    if (definitelyStop !== undefined) {\n        return range_(startOrStop /* as start */, definitelyStop, step);\n    } else {\n        return range_(0, startOrStop /* as stop */, step);\n    }\n}\n\n/**\n * Apply function of two arguments cumulatively to the items of sequence, from\n * left to right, so as to reduce the sequence to a single value.  For example:\n *\n *     reduce([1, 2, 3, 4, 5], (x, y) => x + y, 0)\n *\n * calculates\n *\n *     (((((0+1)+2)+3)+4)+5)\n *\n * The left argument, `x`, is the accumulated value and the right argument,\n * `y`, is the update value from the sequence.\n *\n * **Difference between `reduce()` and `reduce\\_()`**:  `reduce()` requires an\n * explicit initializer, whereas `reduce_()` will automatically use the first\n * item in the given iterable as the initializer.  When using `reduce()`, the\n * initializer value is placed before the items of the sequence in the\n * calculation, and serves as a default when the sequence is empty.  When using\n * `reduce_()`, and the given iterable is empty, then no default value can be\n * derived and `undefined` will be returned.\n */\nexport function reduce<T>(iterable: Iterable<T>, reducer: (agg: T, item: T, index: number) => T): T | undefined;\nexport function reduce<T, O>(iterable: Iterable<T>, reducer: (agg: O, item: T, index: number) => O, start: O): O;\nexport function reduce<T, O>(\n    iterable: Iterable<T>,\n    reducer: ((agg: T, item: T, index: number) => T) | ((agg: O, item: T, index: number) => O),\n    start?: O\n): O | (T | undefined) {\n    if (start === undefined) {\n        return reduce2(iterable, reducer as (agg: T, item: T, index: number) => T);\n    } else {\n        return reduce3(iterable, reducer as (agg: O, item: T, index: number) => O, start);\n    }\n}\n\nfunction reduce3<T, O>(iterable: Iterable<T>, reducer: (agg: O, item: T, index: number) => O, start: O): O {\n    let output = start;\n    let index = 0;\n    for (const item of iterable) {\n        output = reducer(output, item, index++);\n    }\n    return output;\n}\n\nfunction reduce2<T>(iterable: Iterable<T>, reducer: (agg: T, item: T, index: number) => T): T | undefined {\n    const it = iter(iterable);\n    const start = first(it);\n    if (start === undefined) {\n        return undefined;\n    } else {\n        return reduce3(it, reducer, start);\n    }\n}\n\n/**\n * Return a new sorted list from the items in iterable.\n *\n * Has two optional arguments:\n *\n * * `keyFn` specifies a function of one argument providing a primitive\n *   identity for each element in the iterable.  that will be used to compare.\n *   The default value is to use a default identity function that is only\n *   defined for primitive types.\n *\n * * `reverse` is a boolean value.  If `true`, then the list elements are\n *   sorted as if each comparison were reversed.\n */\nexport function sorted<T>(\n    iterable: Iterable<T>,\n    keyFn: (item: T) => Primitive = primitiveIdentity,\n    reverse = false\n): T[] {\n    const result = Array.from(iterable);\n    result.sort(keyToCmp(keyFn)); // sort in-place\n\n    if (reverse) {\n        result.reverse(); // reverse in-place\n    }\n\n    return result;\n}\n\n/**\n * Sums the items of an iterable from left to right and returns the total.  The\n * sum will defaults to 0 if the iterable is empty.\n */\nexport function sum(iterable: Iterable<number>): number {\n    return reduce(iterable, (x, y) => x + y, 0);\n}\n\n/**\n * See izip.\n */\nexport function zip<T1, T2>(xs: Iterable<T1>, ys: Iterable<T2>): Array<[T1, T2]> {\n    return Array.from(izip(xs, ys));\n}\n\n/**\n * See izip3.\n */\nexport function zip3<T1, T2, T3>(xs: Iterable<T1>, ys: Iterable<T2>, zs: Iterable<T3>): Array<[T1, T2, T3]> {\n    return Array.from(izip3(xs, ys, zs));\n}\n"],"mappings":"AAIO,SAASA,EAAYC,EAAyC,CACjE,MAAO,CAACC,EAAMC,IAAS,CACnB,IAAMC,EAAKH,EAAMC,CAAC,EACZG,EAAKJ,EAAME,CAAC,EAElB,OAAI,OAAOC,GAAO,WAAa,OAAOC,GAAO,UAClCD,IAAOC,EAAK,EAAI,CAACD,GAAMC,EAAK,GAAK,EACjC,OAAOD,GAAO,UAAY,OAAOC,GAAO,SACxCD,EAAKC,EACL,OAAOD,GAAO,UAAY,OAAOC,GAAO,SACxCD,IAAOC,EAAK,EAAID,EAAKC,EAAK,GAAK,EAE/B,EAEf,CACJ,CAEO,SAASC,EAAkBC,EAAqB,CACnD,MAAO,CAAC,CAACA,CACb,CAEO,SAASC,EAAeD,EAAoB,CAE/C,GAAI,OAAOA,GAAM,SACb,MAAM,IAAI,MAAM,wBAAwB,EAE5C,OAAOA,CACX,CAIO,SAASE,EAAkBF,EAAuB,CAErD,GAAI,OAAOA,GAAM,UAAY,OAAOA,GAAM,UAAY,OAAOA,GAAM,UAC/D,MAAM,IAAI,MAAM,kEAAkE,EAEtF,OAAOA,CACX,CCxBO,SAAUG,EAAWC,EAAuBC,EAA6B,CAC5E,GAAIA,EAAO,EACP,MAAM,IAAI,MAAM,uBAAuBA,GAAM,EAGjD,IAAMC,EAAKC,EAAKH,CAAQ,EACxB,OAAS,CACL,IAAMI,EAAQC,EAAKJ,EAAMC,CAAE,EAI3B,GAHIE,EAAM,OAAS,IACf,MAAMA,GAENA,EAAM,OAASH,EACf,OAGZ,CASO,SAAUK,EAAWC,EAAyD,CACjF,QAAWP,KAAYO,EACnB,QAAWC,KAAQR,EACf,MAAMQ,CAGlB,CAmBO,SAAUC,EAASC,EAAWC,EAAoC,CACrE,IAAMC,EAAKC,EAAKF,CAAQ,EACpBG,EAAQJ,EACZ,KAAOI,KAAU,GAAG,CAChB,IAAMC,EAAIH,EAAG,KAAK,EAClB,GAAI,CAACG,EAAE,KACH,MAAMA,EAAE,UAGR,QAGZ,CAWO,SAAUC,EAAYL,EAAyC,CAClE,IAAMC,EAAKC,EAAKF,CAAQ,EAClBM,EAAQL,EAAG,KAAK,EACtB,GAAIK,EAAM,KACN,OAGJ,IAAIC,EAAQD,EAAM,MAClB,QAAWE,KAAMP,EACb,KAAM,CAACM,EAAIC,CAAE,EACbD,EAAKC,CAEb,CAqBO,SAASC,EAAaT,EAAuBU,EAAqC,CACrF,IAAMC,EAAO,CAAC,EACRC,EAAM,CAAC,EAEb,QAAWC,KAAQb,EACXU,EAAUG,CAAI,EACdF,EAAK,KAAKE,CAAI,EAEdD,EAAI,KAAKC,CAAI,EAIrB,MAAO,CAACF,EAAMC,CAAG,CACrB,CASO,SAAUE,KAAiBC,EAAmC,CAKjE,IAAMC,EAAgCC,EAAIF,EAAOb,CAAI,EAErD,KAAOc,EAAU,OAAS,GAAG,CACzB,IAAIE,EAAQ,EACZ,KAAOA,EAAQF,EAAU,QAAQ,CAE7B,IAAMG,EADKH,EAAUE,CAAK,EACR,KAAK,EAElBC,EAAO,KAORH,EAAU,OAAOE,EAAO,CAAC,GANzB,MAAMC,EAAO,MACbD,MAShB,CAaO,SAAUE,KAAYL,EAA0C,CAKnE,IAAMC,EAAgCC,EAAIF,EAAOb,CAAI,EAErD,KAAOc,EAAU,OAAS,GAAG,CACzB,IAAIE,EAAQ,EACNG,EAAQ,CAAC,EACf,KAAOH,EAAQF,EAAU,QAAQ,CAE7B,IAAMG,EADKH,EAAUE,CAAK,EACR,KAAK,EAElBC,EAAO,KAORH,EAAU,OAAOE,EAAO,CAAC,GANzBG,EAAM,KAAKF,EAAO,KAAK,EACvBD,KAQJG,EAAM,OAAS,IACf,MAAMA,GAGlB,CAKO,SAASC,EAAQvB,EAAWC,EAA4B,CAC3D,OAAO,MAAM,KAAKF,EAAMC,EAAGC,CAAQ,CAAC,CACxC,CAWO,SAAUuB,EACbvB,EACAwB,EAAgCC,EACrB,CACX,IAAMC,EAAO,IAAI,IACjB,QAAWb,KAAQb,EAAU,CACzB,IAAM2B,EAAMH,EAAMX,CAAI,EACjBa,EAAK,IAAIC,CAAG,IACbD,EAAK,IAAIC,CAAG,EACZ,MAAMd,GAGlB,CAWO,SAAUe,EACb5B,EACAwB,EAAgCC,EACrB,CACX,IAAII,EACJ,QAAWhB,KAAQb,EAAU,CACzB,IAAM2B,EAAMH,EAAMX,CAAI,EAClBc,IAAQE,IACR,MAAMhB,EACNgB,EAAOF,GAGnB,CCjQA,IAAMG,EAAW,OAAO,EAExB,SAASC,EAAWC,EAA6BC,EAAsD,CACnG,OAAQC,GAAcF,EAAGE,CAAC,GAAKD,EAAGC,CAAC,CACvC,CAEA,SAASC,GAAeC,EAAeC,EAAqBC,EAAc,CAEtE,GAAIF,EAAQ,EAAG,MAAM,IAAI,MAAM,0BAA0B,EAEzD,GAAIC,IAAS,MAAQA,EAAO,EAAG,MAAM,IAAI,MAAM,yBAAyB,EAExE,GAAIC,EAAO,EAAG,MAAM,IAAI,MAAM,yBAAyB,EAEvD,IAAIC,EAAQL,GAAcA,GAAKE,EAE/B,GAAIC,IAAS,KAAM,CACf,IAAMG,EAAcH,EACpBE,EAAOR,EAAWQ,EAAOL,GAAcA,EAAIM,CAAW,EAG1D,OAAIF,EAAO,IACPC,EAAOR,EAAWQ,EAAOL,IAAeA,EAAIE,GAASE,IAAS,CAAC,GAG5DC,CACX,CAQO,SAASE,MAAYC,EAAuC,CAC/D,OAAOC,EAAQD,CAAS,CAC5B,CAOO,SAAUE,EAAMR,EAAQ,EAAGE,EAAO,EAAqB,CAC1D,IAAIJ,EAAIE,EACR,OACI,MAAMF,EACNA,GAAKI,CAEb,CAKO,SAASO,GAAYC,EAAmBC,EAAmC,CAC9E,OAAO,MAAM,KAAKC,EAAUF,EAAMC,CAAS,CAAC,CAChD,CAOO,SAAUE,GAASC,EAAoC,CAC1D,IAAMC,EAAQ,CAAC,EACf,QAAWC,KAAWF,EAClB,MAAME,EACND,EAAM,KAAKC,CAAO,EAGtB,KAAOD,EAAM,OAAS,GAClB,QAAWC,KAAWD,EAClB,MAAMC,CAGlB,CAQO,SAAUC,GAAaH,EAAuBI,EAAsC,CACvF,IAAMC,EAAKC,EAAKN,CAAQ,EACxB,QAAWO,KAASF,EAChB,GAAI,CAACD,EAAUG,CAAK,EAAG,CACnB,MAAMA,EACN,MAIR,QAAWA,KAASF,EAChB,MAAME,CAEd,CAEO,SAAUC,GACbR,EACAS,EAAwBC,EAC0B,CAClD,IAAML,EAAKC,EAAKN,CAAQ,EAEpBW,EACAC,EAAgBhC,EAEhBiC,EAAeD,EAEbE,EAAU,UAAkBC,EAAoC,CAClE,KAAOH,IAAeG,GAAQ,CAC1B,MAAMJ,EAEN,IAAMK,EAAUX,EAAG,KAAK,EACxB,GAAIW,EAAQ,KAAM,OAClBL,EAAeK,EAAQ,MACvBJ,EAAaH,EAAME,CAAY,EAEvC,EAEA,OAAS,CACL,KAAOC,IAAeC,GAAW,CAC7B,IAAMG,EAAUX,EAAG,KAAK,EACxB,GAAIW,EAAQ,KAAM,CACdJ,EAAahC,EAEb,OAEJ+B,EAAeK,EAAQ,MACvBJ,EAAaH,EAAME,CAAY,EAGnCE,EAAYD,EACZ,KAAM,CAACA,EAAYE,EAAQD,CAAS,CAAC,EAE7C,CAOO,SAAUf,EAAaF,EAAmBC,EAA2C,CACxF,OAAW,CAACoB,EAAGC,CAAC,IAAKC,EAAKvB,EAAMC,CAAS,EACjCqB,IACA,MAAMD,EAGlB,CAQO,SAAUG,EAAWpB,EAAuBI,EAAsC,CACrF,QAAWG,KAASP,EACZI,EAAUG,CAAK,IACf,MAAMA,EAGlB,CAMO,SAAUc,EAAWrB,EAAuBsB,EAAqC,CACpF,QAAWf,KAASP,EAChB,MAAMsB,EAAOf,CAAK,CAE1B,CAaO,SAAUgB,GACbvB,EACAwB,EACAC,EACArC,EAAO,EACI,CACX,IAAIF,EAAOC,EACPsC,IAAiB,QAEjBvC,EAAQsC,EACRrC,EAAOsC,IAGPvC,EAAQ,EACRC,EAAOqC,GAGX,IAAMnC,EAAOJ,GAAeC,EAAOC,EAAMC,CAAI,EAC7C,OAAW,CAACsC,EAAGnB,CAAK,IAAKoB,EAAU3B,CAAQ,EACnCX,EAAKqC,CAAC,IACN,MAAMnB,EAGlB,CAQO,SAAUqB,EAAcC,EAAkBC,EAAsC,CACnF,IAAMC,EAAMzB,EAAKuB,CAAE,EACbG,EAAM1B,EAAKwB,CAAE,EACnB,OAAS,CACL,IAAMG,EAAIF,EAAI,KAAK,EACbG,EAAIF,EAAI,KAAK,EACnB,GAAI,CAACC,EAAE,MAAQ,CAACC,EAAE,KACd,KAAM,CAACD,EAAE,MAAOC,EAAE,KAAK,MAGvB,QAGZ,CAKO,SAAUC,EAAkBN,EAAkBC,EAAkBM,EAA0C,CAC7G,IAAML,EAAMzB,EAAKuB,CAAE,EACbG,EAAM1B,EAAKwB,CAAE,EACbO,EAAM/B,EAAK8B,CAAE,EACnB,OAAS,CACL,IAAMH,EAAIF,EAAI,KAAK,EACbG,EAAIF,EAAI,KAAK,EACbM,EAAID,EAAI,KAAK,EACnB,GAAI,CAACJ,EAAE,MAAQ,CAACC,EAAE,MAAQ,CAACI,EAAE,KACzB,KAAM,CAACL,EAAE,MAAOC,EAAE,MAAOI,EAAE,KAAK,MAGhC,QAGZ,CAEO,IAAMnB,EAAOS,EAOb,SAAUW,EAAwBV,EAAkBC,EAAkBU,EAAwC,CACjH,IAAMC,EAAUD,EACVT,EAAMzB,EAAKuB,CAAE,EACbG,EAAM1B,EAAKwB,CAAE,EACnB,OAAS,CACL,IAAMG,EAAIF,EAAI,KAAK,EACbG,EAAIF,EAAI,KAAK,EACnB,GAAIC,EAAE,MAAQC,EAAE,KAEZ,OAEA,KAAM,CAAED,EAAE,KAAiBQ,EAAVR,EAAE,MAAkBC,EAAE,KAAiBO,EAAVP,EAAE,KAAe,EAG3E,CAoCO,SAAUQ,KAAeC,EAAqC,CAEjE,IAAMC,EAAYD,EAAM,IAAIE,CAAI,EAEhC,OAAS,CACL,IAAMC,EAA6CF,EAAU,IAAKG,GAAOA,EAAG,KAAK,CAAC,EAClF,GAAIC,EAAIF,EAAQG,GAAM,CAACA,EAAE,IAAI,EACzB,MAAMH,EAAM,IAAKG,GAAMA,EAAE,KAAU,MAGnC,QAGZ,CAeO,SAAUC,GAAgBC,EAAuBC,EAA2B,CAC/E,IAAMC,EAAO,MAAM,KAAKF,CAAQ,EAC1B,EAAIE,EAAK,OACTC,EAAIF,IAAM,OAAY,EAAIA,EAEhC,GAAIE,EAAI,EACJ,OAGJ,IAAIC,EAAoB,MAAM,KAAKC,EAAM,CAAC,CAAC,EACrCC,EAAmB,MAAM,KAAKD,EAAM,EAAG,EAAIF,EAAG,EAAE,CAAC,EACjDI,EAAcC,GAAcN,EAAKM,CAAC,EAIxC,IAFA,MAAMJ,EAAQ,MAAM,EAAGD,CAAC,EAAE,IAAII,CAAU,EAEjC,EAAI,GAAG,CACV,IAAIE,EAAY,GAChB,QAAWD,KAAKH,EAAMF,EAAI,EAAG,GAAI,EAAE,EAE/B,GADAG,EAAOE,CAAC,GAAK,EACTF,EAAOE,CAAC,IAAM,EACdJ,EAAUA,EACL,MAAM,EAAGI,CAAC,EACV,OAAOJ,EAAQ,MAAMI,EAAI,CAAC,CAAC,EAC3B,OAAOJ,EAAQ,MAAMI,EAAGA,EAAI,CAAC,CAAC,EACnCF,EAAOE,CAAC,EAAI,EAAIA,MACb,CACH,IAAME,EAAYJ,EAAOE,CAAC,EAEpB,CAACG,EAAGC,CAAC,EAAI,CAACR,EAAQA,EAAQ,OAASM,CAAC,EAAGN,EAAQI,CAAC,CAAC,EACvDJ,EAAQI,CAAC,EAAIG,EACbP,EAAQA,EAAQ,OAASM,CAAC,EAAIE,EAC9B,MAAMR,EAAQ,MAAM,EAAGD,CAAC,EAAE,IAAII,CAAU,EACxCE,EAAY,GACZ,MAIR,GAAIA,EACA,OAGZ,CAsBO,SAAUI,EAAaC,EAAuBC,EAAsC,CACvF,QAAWC,KAASF,EAAU,CAC1B,GAAI,CAACC,EAAUC,CAAK,EAAG,OACvB,MAAMA,EAEd,CAEO,SAASC,GAAuBC,EAAkBC,EAAkBC,EAAqC,CAC5G,OAAO,MAAM,KAAKC,EAAaH,EAAIC,EAAIC,CAAM,CAAC,CAClD,CAWO,IAAME,GAAcC,EACdC,GAAaC,GAEnB,SAASC,MAAcC,EAA6B,CACvD,OAAO,MAAM,KAAKC,EAAS,GAAGD,CAAK,CAAC,CACxC,CCxaA,SAASE,GAAaC,EAAe,CACjC,OAAOA,IAAM,MACjB,CAQO,SAAUC,EAAYC,EAAuD,CAChF,QAAWC,KAAQD,EACXC,GAAQ,OACR,MAAMA,EAGlB,CAKO,SAASC,GAAWF,EAA+C,CACtE,OAAO,MAAM,KAAKD,EAASC,CAAQ,CAAC,CACxC,CASO,SAASG,GAAmCC,EAAoD,CACnG,IAAMC,EAAS,CAAC,EAChB,OAAW,CAACC,EAAKC,CAAM,IAAK,OAAO,QAAQH,CAAG,EAAG,CAC7C,IAAMI,EAAQD,EACVC,GAAS,OACTH,EAAOC,CAAQ,EAAIE,GAG3B,OAAOH,CACX,CAOO,SAASI,EAAQT,EAAuBU,EAAqC,CAChF,GAAIA,IAAU,OAAW,CACrB,QAAWF,KAASR,EAChB,OAAOQ,EAEX,WACG,CACH,QAAWA,KAASR,EAChB,GAAIU,EAAMF,CAAK,EACX,OAAOA,EAGf,OAER,CAKO,SAASG,EAASX,EAAuBU,EAAqC,CACjF,OAAOD,EAAKT,EAAUU,GAAA,KAAAA,EAASb,EAAS,CAC5C,CAgBO,SAASe,GAAcZ,EAAuBa,EAA+C,CAChG,OAAOC,EAAQC,EAAKf,EAAUa,CAAM,CAAC,CACzC,CCpEO,SAASG,EAASC,EAAuBC,EAAsBC,EAA4B,CAC9F,QAAWC,KAAQH,EACf,GAAI,CAACC,EAAME,CAAI,EACX,MAAO,GAIf,MAAO,EACX,CAmBO,SAASC,EAAQJ,EAAuBC,EAAsBC,EAA4B,CAC7F,QAAWC,KAAQH,EACf,GAAIC,EAAME,CAAI,EACV,MAAO,GAIf,MAAO,EACX,CAKO,IAAME,EAAMN,EAKNO,EAAMF,EAaZ,SAASG,GAAYC,EAAuBC,EAAoB,CACnE,OAAOH,EAAIE,EAAWE,GAAMA,IAAMD,CAAM,CAC5C,CAeO,SAAUE,EAAaX,EAAuBY,EAAQ,EAA0B,CACnF,IAAIC,EAAgBD,EACpB,QAAWE,KAASd,EAChB,KAAM,CAACa,IAASC,CAAK,CAE7B,CAOO,SAASC,GAAUf,EAAuBgB,EAA8B,CAC3E,OAAO,MAAM,KAAKC,EAAQjB,EAAUgB,CAAS,CAAC,CAClD,CAQO,SAASE,EAAQlB,EAA4C,CAehE,OAAOA,EAAS,OAAO,QAAQ,EAAE,CAErC,CAKO,SAASmB,EAAUnB,EAAuBoB,EAA6B,CAC1E,OAAO,MAAM,KAAKC,EAAKrB,EAAUoB,CAAM,CAAC,CAC5C,CAaO,SAASE,GAAOtB,EAAuBC,EAA6BsB,EAA+B,CACtG,OAAOC,EAAQxB,EAAU,CAACU,EAAGe,IAAOxB,EAAMS,CAAC,EAAIT,EAAMwB,CAAC,EAAIf,EAAIe,CAAE,CACpE,CAaO,SAASC,GAAO1B,EAAuBC,EAA6BsB,EAA+B,CACtG,OAAOC,EAAQxB,EAAU,CAACU,EAAGe,IAAOxB,EAAMS,CAAC,EAAIT,EAAMwB,CAAC,EAAIf,EAAIe,CAAE,CACpE,CAKA,SAASE,EAAOf,EAAegB,EAAcC,EAAgC,CACzE,IAAMC,EAAUC,EAAMnB,EAAOiB,CAAI,EAC3BG,EAAOH,GAAQ,EAAKI,GAAcA,EAAIL,EAAQK,GAAcA,EAAIL,EACtE,OAAOM,EAAUJ,EAASE,CAAI,CAClC,CA6BO,SAASG,EAAMC,EAAqBC,EAAyBR,EAAO,EAAqB,CAC5F,OAAIQ,IAAmB,OACZV,EAAOS,EAA4BC,EAAgBR,CAAI,EAEvDF,EAAO,EAAGS,EAA2BP,CAAI,CAExD,CAyBO,SAASS,EACZtC,EACAuC,EACA3B,EACmB,CACnB,OAAIA,IAAU,OACHY,EAAQxB,EAAUuC,CAAgD,EAElEC,EAAQxC,EAAUuC,EAAkD3B,CAAK,CAExF,CAEA,SAAS4B,EAAcxC,EAAuBuC,EAAgD3B,EAAa,CACvG,IAAI6B,EAAS7B,EACTC,EAAQ,EACZ,QAAWV,KAAQH,EACfyC,EAASF,EAAQE,EAAQtC,EAAMU,GAAO,EAE1C,OAAO4B,CACX,CAEA,SAASjB,EAAWxB,EAAuBuC,EAA+D,CACtG,IAAMG,EAAKxB,EAAKlB,CAAQ,EAClBY,EAAQ+B,EAAMD,CAAE,EACtB,GAAI9B,IAAU,OAGV,OAAO4B,EAAQE,EAAIH,EAAS3B,CAAK,CAEzC,CAeO,SAASgC,GACZ5C,EACAC,EAAgC4C,EAChCC,EAAU,GACP,CACH,IAAMC,EAAS,MAAM,KAAK/C,CAAQ,EAClC,OAAA+C,EAAO,KAAKC,EAAS/C,CAAK,CAAC,EAEvB6C,GACAC,EAAO,QAAQ,EAGZA,CACX,CAMO,SAASE,GAAIjD,EAAoC,CACpD,OAAOsC,EAAOtC,EAAU,CAACU,EAAGe,IAAMf,EAAIe,EAAG,CAAC,CAC9C,CAKO,SAASyB,GAAYC,EAAkBC,EAAmC,CAC7E,OAAO,MAAM,KAAKC,EAAKF,EAAIC,CAAE,CAAC,CAClC,CAKO,SAASE,GAAiBH,EAAkBC,EAAkBG,EAAuC,CACxG,OAAO,MAAM,KAAKC,EAAML,EAAIC,EAAIG,CAAE,CAAC,CACvC","names":["keyToCmp","keyFn","a","b","ka","kb","identityPredicate","x","numberIdentity","primitiveIdentity","chunked","iterable","size","it","iter","chunk","take","flatten","iterableOfIterables","item","itake","n","iterable","it","iter","count","s","pairwise","first","r1","r2","partition","predicate","good","bad","item","roundrobin","iters","iterables","map","index","result","heads","round","take","uniqueEverseen","keyFn","primitiveIdentity","seen","key","uniqueJustseen","last","SENTINEL","composeAnd","f1","f2","n","slicePredicate","start","stop","step","pred","definedStop","chain","iterables","flatten","count","compress","data","selectors","icompress","cycle","iterable","saved","element","dropwhile","predicate","it","iter","value","groupby","keyFn","primitiveIdentity","currentValue","currentKey","targetKey","grouper","tgtKey","nextVal","d","s","izip","ifilter","imap","mapper","islice","stopOrStart","possiblyStop","i","enumerate","izip2","xs","ys","ixs","iys","x","y","izip3","zs","izs","z","izipLongest2","filler","filler_","izipMany","iters","iterables","iter","heads","xs","all","h","permutations","iterable","r","pool","x","indices","range","cycles","poolgetter","i","cleanExit","j","p","q","takewhile","iterable","predicate","value","zipLongest2","xs","ys","filler","izipLongest2","izipLongest","izipLongest2","zipLongest","zipLongest2","zipMany","iters","izipMany","isDefined","x","icompact","iterable","item","compact","compactObject","obj","result","key","value_","value","find","keyFn","first","flatmap","mapper","flatten","imap","every","iterable","keyFn","identityPredicate","item","some","all","any","contains","haystack","needle","x","enumerate","start","index","value","filter","predicate","ifilter","iter","map","mapper","imap","max","numberIdentity","reduce2","y","min","range_","stop","step","counter","count","pred","n","takewhile","range","startOrStop","definitelyStop","reduce","reducer","reduce3","output","it","first","sorted","primitiveIdentity","reverse","result","keyToCmp","sum","zip","xs","ys","izip","zip3","zs","izip3"]}

package/package.json

@@ -1,16 +1,16 @@
 {
     "name": "itertools",
-    "version": "2.0.0-beta1",
+    "version": "2.1.0",
     "description": "A JavaScript port of Python's awesome itertools standard library",
     "license": "MIT",
     "repository": {
         "type": "git",
-        "url": "git+https://github.com/nvie/itertools.js.git"
+        "url": "git+https://github.com/nvie/itertools.git"
     },
     "author": "Vincent Driessen",
-    "homepage": "https://github.com/nvie/itertools.js#readme",
+    "homepage": "https://github.com/nvie/itertools#readme",
     "bugs": {
-        "url": "https://github.com/nvie/itertools.js/issues"
+        "url": "https://github.com/nvie/itertools/issues"
     },
     "types": "./dist/index.d.ts",
     "main": "./dist/index.js",
@@ -51,14 +51,15 @@
         "@types/jest": "^29.5.0",
         "@typescript-eslint/eslint-plugin": "^5.57.1",
         "@typescript-eslint/parser": "^5.57.1",
-        "@vitest/coverage-c8": "^0.29.8",
+        "@vitest/coverage-istanbul": "^0.29.8",
         "eslint": "^8.38.0",
+        "fast-check": "^3.8.0",
         "in-publish": "^2.0.1",
         "prettier": "^2.8.7",
         "tsup": "^6.7.0",
         "typescript": "^4.3.5",
         "vitest": "^0.29.8"
     },
-    "githubUrl": "https://github.com/nvie/itertools.js",
+    "githubUrl": "https://github.com/nvie/itertools",
     "sideEffects": false
 }