@rocicorp/zero 0.26.1 → 0.26.2-canary.1

package/out/zql/src/ivm/skip.js

@@ -1,106 +1,93 @@
-import { maybeSplitAndPushEditChange } from "./maybe-split-and-push-edit-change.js";
 import { throwOutput } from "./operator.js";
-class Skip {
-  #input;
-  #bound;
-  #comparator;
-  #output = throwOutput;
-  constructor(input, bound) {
-    this.#input = input;
-    this.#bound = bound;
-    this.#comparator = input.getSchema().compareRows;
-    input.setOutput(this);
-  }
-  getSchema() {
-    return this.#input.getSchema();
-  }
-  *fetch(req) {
-    const start = this.#getStart(req);
-    if (start === "empty") {
-      return;
-    }
-    const nodes = this.#input.fetch({ ...req, start });
-    if (!req.reverse) {
-      yield* nodes;
-      return;
-    }
-    for (const node of nodes) {
-      if (node === "yield") {
-        yield node;
-        continue;
-      }
-      if (!this.#shouldBePresent(node.row)) {
-        return;
-      }
-      yield node;
-    }
-  }
-  setOutput(output) {
-    this.#output = output;
-  }
-  destroy() {
-    this.#input.destroy();
-  }
-  #shouldBePresent(row) {
-    const cmp = this.#comparator(this.#bound.row, row);
-    return cmp < 0 || cmp === 0 && !this.#bound.exclusive;
-  }
-  *push(change) {
-    const shouldBePresent = (row) => this.#shouldBePresent(row);
-    if (change.type === "edit") {
-      yield* maybeSplitAndPushEditChange(
-        change,
-        shouldBePresent,
-        this.#output,
-        this
-      );
-      return;
-    }
-    if (shouldBePresent(change.node.row)) {
-      yield* this.#output.push(change, this);
-    }
-  }
-  #getStart(req) {
-    const boundStart = {
-      row: this.#bound.row,
-      basis: this.#bound.exclusive ? "after" : "at"
-    };
-    if (!req.start) {
-      if (req.reverse) {
-        return void 0;
-      }
-      return boundStart;
-    }
-    const cmp = this.#comparator(this.#bound.row, req.start.row);
-    if (!req.reverse) {
-      if (cmp > 0) {
-        return boundStart;
-      }
-      if (cmp === 0) {
-        if (this.#bound.exclusive || req.start.basis === "after") {
-          return {
-            row: this.#bound.row,
-            basis: "after"
-          };
-        }
-        return boundStart;
-      }
-      return req.start;
-    }
-    req.reverse;
-    if (cmp > 0) {
-      return "empty";
-    }
-    if (cmp === 0) {
-      if (!this.#bound.exclusive && req.start.basis === "at") {
-        return boundStart;
-      }
-      return "empty";
-    }
-    return req.start;
-  }
-}
-export {
-  Skip
+import { maybeSplitAndPushEditChange } from "./maybe-split-and-push-edit-change.js";
+//#region ../zql/src/ivm/skip.ts
+/**
+* Skip sets the start position for the pipeline. No rows before the bound will
+* be output.
+*/
+var Skip = class {
+	#input;
+	#bound;
+	#comparator;
+	#output = throwOutput;
+	constructor(input, bound) {
+		this.#input = input;
+		this.#bound = bound;
+		this.#comparator = input.getSchema().compareRows;
+		input.setOutput(this);
+	}
+	getSchema() {
+		return this.#input.getSchema();
+	}
+	*fetch(req) {
+		const start = this.#getStart(req);
+		if (start === "empty") return;
+		const nodes = this.#input.fetch({
+			...req,
+			start
+		});
+		if (!req.reverse) {
+			yield* nodes;
+			return;
+		}
+		for (const node of nodes) {
+			if (node === "yield") {
+				yield node;
+				continue;
+			}
+			if (!this.#shouldBePresent(node.row)) return;
+			yield node;
+		}
+	}
+	setOutput(output) {
+		this.#output = output;
+	}
+	destroy() {
+		this.#input.destroy();
+	}
+	#shouldBePresent(row) {
+		const cmp = this.#comparator(this.#bound.row, row);
+		return cmp < 0 || cmp === 0 && !this.#bound.exclusive;
+	}
+	*push(change) {
+		const shouldBePresent = (row) => this.#shouldBePresent(row);
+		if (change.type === "edit") {
+			yield* maybeSplitAndPushEditChange(change, shouldBePresent, this.#output, this);
+			return;
+		}
+		if (shouldBePresent(change.node.row)) yield* this.#output.push(change, this);
+	}
+	#getStart(req) {
+		const boundStart = {
+			row: this.#bound.row,
+			basis: this.#bound.exclusive ? "after" : "at"
+		};
+		if (!req.start) {
+			if (req.reverse) return;
+			return boundStart;
+		}
+		const cmp = this.#comparator(this.#bound.row, req.start.row);
+		if (!req.reverse) {
+			if (cmp > 0) return boundStart;
+			if (cmp === 0) {
+				if (this.#bound.exclusive || req.start.basis === "after") return {
+					row: this.#bound.row,
+					basis: "after"
+				};
+				return boundStart;
+			}
+			return req.start;
+		}
+		req.reverse;
+		if (cmp > 0) return "empty";
+		if (cmp === 0) {
+			if (!this.#bound.exclusive && req.start.basis === "at") return boundStart;
+			return "empty";
+		}
+		return req.start;
+	}
 };
-//# sourceMappingURL=skip.js.map
+//#endregion
+export { Skip };
+
+//# sourceMappingURL=skip.js.map

package/out/zql/src/ivm/skip.js.map

@@ -1 +1 @@
-{"version":3,"file":"skip.js","sources":["../../../../../zql/src/ivm/skip.ts"],"sourcesContent":["import type {Row} from '../../../zero-protocol/src/data.ts';\nimport type {AddChange, Change, ChildChange, RemoveChange} from './change.ts';\nimport type {Comparator, Node} from './data.ts';\nimport {maybeSplitAndPushEditChange} from './maybe-split-and-push-edit-change.ts';\nimport {\n  throwOutput,\n  type FetchRequest,\n  type Input,\n  type Operator,\n  type Output,\n  type Start,\n} from './operator.ts';\nimport type {SourceSchema} from './schema.ts';\nimport type {Stream} from './stream.ts';\n\nexport type Bound = {\n  row: Row;\n  exclusive: boolean;\n};\n\n/**\n * Skip sets the start position for the pipeline. No rows before the bound will\n * be output.\n */\nexport class Skip implements Operator {\n  readonly #input: Input;\n  readonly #bound: Bound;\n  readonly #comparator: Comparator;\n\n  #output: Output = throwOutput;\n\n  constructor(input: Input, bound: Bound) {\n    this.#input = input;\n    this.#bound = bound;\n    this.#comparator = input.getSchema().compareRows;\n    input.setOutput(this);\n  }\n\n  getSchema(): SourceSchema {\n    return this.#input.getSchema();\n  }\n\n  *fetch(req: FetchRequest): Stream<Node | 'yield'> {\n    const start = this.#getStart(req);\n    if (start === 'empty') {\n      return;\n    }\n    const nodes = this.#input.fetch({...req, start});\n    if (!req.reverse) {\n      yield* nodes;\n      return;\n    }\n    for (const node of nodes) {\n      if (node === 'yield') {\n        yield node;\n        continue;\n      }\n      if (!this.#shouldBePresent(node.row)) {\n        return;\n      }\n      yield node;\n    }\n  }\n\n  setOutput(output: Output): void {\n    this.#output = output;\n  }\n\n  destroy(): void {\n    this.#input.destroy();\n  }\n\n  #shouldBePresent(row: Row): boolean {\n    const cmp = this.#comparator(this.#bound.row, row);\n    return cmp < 0 || (cmp === 0 && !this.#bound.exclusive);\n  }\n\n  *push(change: Change): Stream<'yield'> {\n    const shouldBePresent = (row: Row) => this.#shouldBePresent(row);\n    if (change.type === 'edit') {\n      yield* maybeSplitAndPushEditChange(\n        change,\n        shouldBePresent,\n        this.#output,\n        this,\n      );\n      return;\n    }\n\n    change satisfies AddChange | RemoveChange | ChildChange;\n\n    if (shouldBePresent(change.node.row)) {\n      yield* this.#output.push(change, this);\n    }\n  }\n\n  #getStart(req: FetchRequest): Start | undefined | 'empty' {\n    const boundStart = {\n      row: this.#bound.row,\n      basis: this.#bound.exclusive ? 'after' : 'at',\n    } as const;\n\n    if (!req.start) {\n      if (req.reverse) {\n        return undefined;\n      }\n      return boundStart;\n    }\n\n    const cmp = this.#comparator(this.#bound.row, req.start.row);\n\n    if (!req.reverse) {\n      // The skip bound is after the requested bound. The requested bound cannot\n      // be relevant because even if it was basis: 'after', the skip bound is\n      // itself after the requested bound. Return the skip bound.\n      if (cmp > 0) {\n        return boundStart;\n      }\n\n      // The skip bound and requested bound are equal. If either is exclusive,\n      // return that bound with exclusive. Otherwise, return the skip bound.\n      if (cmp === 0) {\n        if (this.#bound.exclusive || req.start.basis === 'after') {\n          return {\n            row: this.#bound.row,\n            basis: 'after',\n          };\n        }\n        return boundStart;\n      }\n\n      return req.start;\n    }\n\n    req.reverse satisfies true;\n\n    // bound is after the start, but request is for reverse so results\n    // must be empty\n    if (cmp > 0) {\n      return 'empty';\n    }\n\n    if (cmp === 0) {\n      // if both are inclusive, the result can be the single row at bound\n      // return it as start\n      if (!this.#bound.exclusive && req.start.basis === 'at') {\n        return boundStart;\n      }\n      // otherwise the results must be empty, one or both are exclusive\n      // in opposite directions\n      return 'empty';\n    }\n\n    // bound is before the start, return start\n    return req.start;\n  }\n}\n"],"names":[],"mappings":";;AAwBO,MAAM,KAAyB;AAAA,EAC3B;AAAA,EACA;AAAA,EACA;AAAA,EAET,UAAkB;AAAA,EAElB,YAAY,OAAc,OAAc;AACtC,SAAK,SAAS;AACd,SAAK,SAAS;AACd,SAAK,cAAc,MAAM,UAAA,EAAY;AACrC,UAAM,UAAU,IAAI;AAAA,EACtB;AAAA,EAEA,YAA0B;AACxB,WAAO,KAAK,OAAO,UAAA;AAAA,EACrB;AAAA,EAEA,CAAC,MAAM,KAA2C;AAChD,UAAM,QAAQ,KAAK,UAAU,GAAG;AAChC,QAAI,UAAU,SAAS;AACrB;AAAA,IACF;AACA,UAAM,QAAQ,KAAK,OAAO,MAAM,EAAC,GAAG,KAAK,OAAM;AAC/C,QAAI,CAAC,IAAI,SAAS;AAChB,aAAO;AACP;AAAA,IACF;AACA,eAAW,QAAQ,OAAO;AACxB,UAAI,SAAS,SAAS;AACpB,cAAM;AACN;AAAA,MACF;AACA,UAAI,CAAC,KAAK,iBAAiB,KAAK,GAAG,GAAG;AACpC;AAAA,MACF;AACA,YAAM;AAAA,IACR;AAAA,EACF;AAAA,EAEA,UAAU,QAAsB;AAC9B,SAAK,UAAU;AAAA,EACjB;AAAA,EAEA,UAAgB;AACd,SAAK,OAAO,QAAA;AAAA,EACd;AAAA,EAEA,iBAAiB,KAAmB;AAClC,UAAM,MAAM,KAAK,YAAY,KAAK,OAAO,KAAK,GAAG;AACjD,WAAO,MAAM,KAAM,QAAQ,KAAK,CAAC,KAAK,OAAO;AAAA,EAC/C;AAAA,EAEA,CAAC,KAAK,QAAiC;AACrC,UAAM,kBAAkB,CAAC,QAAa,KAAK,iBAAiB,GAAG;AAC/D,QAAI,OAAO,SAAS,QAAQ;AAC1B,aAAO;AAAA,QACL;AAAA,QACA;AAAA,QACA,KAAK;AAAA,QACL;AAAA,MAAA;AAEF;AAAA,IACF;AAIA,QAAI,gBAAgB,OAAO,KAAK,GAAG,GAAG;AACpC,aAAO,KAAK,QAAQ,KAAK,QAAQ,IAAI;AAAA,IACvC;AAAA,EACF;AAAA,EAEA,UAAU,KAAgD;AACxD,UAAM,aAAa;AAAA,MACjB,KAAK,KAAK,OAAO;AAAA,MACjB,OAAO,KAAK,OAAO,YAAY,UAAU;AAAA,IAAA;AAG3C,QAAI,CAAC,IAAI,OAAO;AACd,UAAI,IAAI,SAAS;AACf,eAAO;AAAA,MACT;AACA,aAAO;AAAA,IACT;AAEA,UAAM,MAAM,KAAK,YAAY,KAAK,OAAO,KAAK,IAAI,MAAM,GAAG;AAE3D,QAAI,CAAC,IAAI,SAAS;AAIhB,UAAI,MAAM,GAAG;AACX,eAAO;AAAA,MACT;AAIA,UAAI,QAAQ,GAAG;AACb,YAAI,KAAK,OAAO,aAAa,IAAI,MAAM,UAAU,SAAS;AACxD,iBAAO;AAAA,YACL,KAAK,KAAK,OAAO;AAAA,YACjB,OAAO;AAAA,UAAA;AAAA,QAEX;AACA,eAAO;AAAA,MACT;AAEA,aAAO,IAAI;AAAA,IACb;AAEA,QAAI;AAIJ,QAAI,MAAM,GAAG;AACX,aAAO;AAAA,IACT;AAEA,QAAI,QAAQ,GAAG;AAGb,UAAI,CAAC,KAAK,OAAO,aAAa,IAAI,MAAM,UAAU,MAAM;AACtD,eAAO;AAAA,MACT;AAGA,aAAO;AAAA,IACT;AAGA,WAAO,IAAI;AAAA,EACb;AACF;"}
+{"version":3,"file":"skip.js","names":["#input","#bound","#comparator","#getStart","#shouldBePresent","#output"],"sources":["../../../../../zql/src/ivm/skip.ts"],"sourcesContent":["import type {Row} from '../../../zero-protocol/src/data.ts';\nimport type {AddChange, Change, ChildChange, RemoveChange} from './change.ts';\nimport type {Comparator, Node} from './data.ts';\nimport {maybeSplitAndPushEditChange} from './maybe-split-and-push-edit-change.ts';\nimport {\n  throwOutput,\n  type FetchRequest,\n  type Input,\n  type Operator,\n  type Output,\n  type Start,\n} from './operator.ts';\nimport type {SourceSchema} from './schema.ts';\nimport type {Stream} from './stream.ts';\n\nexport type Bound = {\n  row: Row;\n  exclusive: boolean;\n};\n\n/**\n * Skip sets the start position for the pipeline. No rows before the bound will\n * be output.\n */\nexport class Skip implements Operator {\n  readonly #input: Input;\n  readonly #bound: Bound;\n  readonly #comparator: Comparator;\n\n  #output: Output = throwOutput;\n\n  constructor(input: Input, bound: Bound) {\n    this.#input = input;\n    this.#bound = bound;\n    this.#comparator = input.getSchema().compareRows;\n    input.setOutput(this);\n  }\n\n  getSchema(): SourceSchema {\n    return this.#input.getSchema();\n  }\n\n  *fetch(req: FetchRequest): Stream<Node | 'yield'> {\n    const start = this.#getStart(req);\n    if (start === 'empty') {\n      return;\n    }\n    const nodes = this.#input.fetch({...req, start});\n    if (!req.reverse) {\n      yield* nodes;\n      return;\n    }\n    for (const node of nodes) {\n      if (node === 'yield') {\n        yield node;\n        continue;\n      }\n      if (!this.#shouldBePresent(node.row)) {\n        return;\n      }\n      yield node;\n    }\n  }\n\n  setOutput(output: Output): void {\n    this.#output = output;\n  }\n\n  destroy(): void {\n    this.#input.destroy();\n  }\n\n  #shouldBePresent(row: Row): boolean {\n    const cmp = this.#comparator(this.#bound.row, row);\n    return cmp < 0 || (cmp === 0 && !this.#bound.exclusive);\n  }\n\n  *push(change: Change): Stream<'yield'> {\n    const shouldBePresent = (row: Row) => this.#shouldBePresent(row);\n    if (change.type === 'edit') {\n      yield* maybeSplitAndPushEditChange(\n        change,\n        shouldBePresent,\n        this.#output,\n        this,\n      );\n      return;\n    }\n\n    change satisfies AddChange | RemoveChange | ChildChange;\n\n    if (shouldBePresent(change.node.row)) {\n      yield* this.#output.push(change, this);\n    }\n  }\n\n  #getStart(req: FetchRequest): Start | undefined | 'empty' {\n    const boundStart = {\n      row: this.#bound.row,\n      basis: this.#bound.exclusive ? 'after' : 'at',\n    } as const;\n\n    if (!req.start) {\n      if (req.reverse) {\n        return undefined;\n      }\n      return boundStart;\n    }\n\n    const cmp = this.#comparator(this.#bound.row, req.start.row);\n\n    if (!req.reverse) {\n      // The skip bound is after the requested bound. The requested bound cannot\n      // be relevant because even if it was basis: 'after', the skip bound is\n      // itself after the requested bound. Return the skip bound.\n      if (cmp > 0) {\n        return boundStart;\n      }\n\n      // The skip bound and requested bound are equal. If either is exclusive,\n      // return that bound with exclusive. Otherwise, return the skip bound.\n      if (cmp === 0) {\n        if (this.#bound.exclusive || req.start.basis === 'after') {\n          return {\n            row: this.#bound.row,\n            basis: 'after',\n          };\n        }\n        return boundStart;\n      }\n\n      return req.start;\n    }\n\n    req.reverse satisfies true;\n\n    // bound is after the start, but request is for reverse so results\n    // must be empty\n    if (cmp > 0) {\n      return 'empty';\n    }\n\n    if (cmp === 0) {\n      // if both are inclusive, the result can be the single row at bound\n      // return it as start\n      if (!this.#bound.exclusive && req.start.basis === 'at') {\n        return boundStart;\n      }\n      // otherwise the results must be empty, one or both are exclusive\n      // in opposite directions\n      return 'empty';\n    }\n\n    // bound is before the start, return start\n    return req.start;\n  }\n}\n"],"mappings":";;;;;;;AAwBA,IAAa,OAAb,MAAsC;CACpC;CACA;CACA;CAEA,UAAkB;CAElB,YAAY,OAAc,OAAc;AACtC,QAAA,QAAc;AACd,QAAA,QAAc;AACd,QAAA,aAAmB,MAAM,WAAW,CAAC;AACrC,QAAM,UAAU,KAAK;;CAGvB,YAA0B;AACxB,SAAO,MAAA,MAAY,WAAW;;CAGhC,CAAC,MAAM,KAA2C;EAChD,MAAM,QAAQ,MAAA,SAAe,IAAI;AACjC,MAAI,UAAU,QACZ;EAEF,MAAM,QAAQ,MAAA,MAAY,MAAM;GAAC,GAAG;GAAK;GAAM,CAAC;AAChD,MAAI,CAAC,IAAI,SAAS;AAChB,UAAO;AACP;;AAEF,OAAK,MAAM,QAAQ,OAAO;AACxB,OAAI,SAAS,SAAS;AACpB,UAAM;AACN;;AAEF,OAAI,CAAC,MAAA,gBAAsB,KAAK,IAAI,CAClC;AAEF,SAAM;;;CAIV,UAAU,QAAsB;AAC9B,QAAA,SAAe;;CAGjB,UAAgB;AACd,QAAA,MAAY,SAAS;;CAGvB,iBAAiB,KAAmB;EAClC,MAAM,MAAM,MAAA,WAAiB,MAAA,MAAY,KAAK,IAAI;AAClD,SAAO,MAAM,KAAM,QAAQ,KAAK,CAAC,MAAA,MAAY;;CAG/C,CAAC,KAAK,QAAiC;EACrC,MAAM,mBAAmB,QAAa,MAAA,gBAAsB,IAAI;AAChE,MAAI,OAAO,SAAS,QAAQ;AAC1B,UAAO,4BACL,QACA,iBACA,MAAA,QACA,KACD;AACD;;AAKF,MAAI,gBAAgB,OAAO,KAAK,IAAI,CAClC,QAAO,MAAA,OAAa,KAAK,QAAQ,KAAK;;CAI1C,UAAU,KAAgD;EACxD,MAAM,aAAa;GACjB,KAAK,MAAA,MAAY;GACjB,OAAO,MAAA,MAAY,YAAY,UAAU;GAC1C;AAED,MAAI,CAAC,IAAI,OAAO;AACd,OAAI,IAAI,QACN;AAEF,UAAO;;EAGT,MAAM,MAAM,MAAA,WAAiB,MAAA,MAAY,KAAK,IAAI,MAAM,IAAI;AAE5D,MAAI,CAAC,IAAI,SAAS;AAIhB,OAAI,MAAM,EACR,QAAO;AAKT,OAAI,QAAQ,GAAG;AACb,QAAI,MAAA,MAAY,aAAa,IAAI,MAAM,UAAU,QAC/C,QAAO;KACL,KAAK,MAAA,MAAY;KACjB,OAAO;KACR;AAEH,WAAO;;AAGT,UAAO,IAAI;;AAGb,MAAI;AAIJ,MAAI,MAAM,EACR,QAAO;AAGT,MAAI,QAAQ,GAAG;AAGb,OAAI,CAAC,MAAA,MAAY,aAAa,IAAI,MAAM,UAAU,KAChD,QAAO;AAIT,UAAO;;AAIT,SAAO,IAAI"}

package/out/zql/src/ivm/stream.js

@@ -1,14 +1,14 @@
+//#region ../zql/src/ivm/stream.ts
 function first(stream) {
-  const it = stream[Symbol.iterator]();
-  const { value } = it.next();
-  it.return?.();
-  return value;
+	const it = stream[Symbol.iterator]();
+	const { value } = it.next();
+	it.return?.();
+	return value;
 }
 function consume(stream) {
-  for (const _ of stream) ;
+	for (const _ of stream);
 }
-export {
-  consume,
-  first
-};
-//# sourceMappingURL=stream.js.map
+//#endregion
+export { consume, first };
+
+//# sourceMappingURL=stream.js.map

package/out/zql/src/ivm/stream.js.map

@@ -1 +1 @@
-{"version":3,"file":"stream.js","sources":["../../../../../zql/src/ivm/stream.ts"],"sourcesContent":["/**\n * streams are lazy forward-only iterables.\n * Once a stream reaches the end it can't be restarted.\n * They are iterable, not iterator, so that they can be used in for-each,\n * and so that we know when consumer has stopped iterating the stream. This allows us\n * to clean up resources like sql statements.\n */\nexport type Stream<T> = Iterable<T>;\n\nexport function* take<T>(stream: Stream<T>, limit: number): Stream<T> {\n  if (limit < 1) {\n    return;\n  }\n  let count = 0;\n  for (const v of stream) {\n    yield v;\n    if (++count === limit) {\n      break;\n    }\n  }\n}\n\nexport function first<T>(stream: Stream<T>): T | undefined {\n  const it = stream[Symbol.iterator]();\n  const {value} = it.next();\n  it.return?.();\n  return value;\n}\n\nexport function consume<T>(stream: Stream<T>): void {\n  // Required to prevent some minifiers (e.g. Terser) from removing this empty loop\n  for (const _ of stream);\n}\n\nexport function drainGenerator<Yield, Return>(\n  gen: Generator<Yield, Return, unknown>,\n): Return {\n  let result = gen.next();\n  while (!result.done) {\n    result = gen.next();\n  }\n  return result.value;\n}\n"],"names":[],"mappings":"AAsBO,SAAS,MAAS,QAAkC;AACzD,QAAM,KAAK,OAAO,OAAO,QAAQ,EAAA;AACjC,QAAM,EAAC,MAAA,IAAS,GAAG,KAAA;AACnB,KAAG,SAAA;AACH,SAAO;AACT;AAEO,SAAS,QAAW,QAAyB;AAElD,aAAW,KAAK,OAAO;AACzB;"}
+{"version":3,"file":"stream.js","names":[],"sources":["../../../../../zql/src/ivm/stream.ts"],"sourcesContent":["/**\n * streams are lazy forward-only iterables.\n * Once a stream reaches the end it can't be restarted.\n * They are iterable, not iterator, so that they can be used in for-each,\n * and so that we know when consumer has stopped iterating the stream. This allows us\n * to clean up resources like sql statements.\n */\nexport type Stream<T> = Iterable<T>;\n\nexport function* take<T>(stream: Stream<T>, limit: number): Stream<T> {\n  if (limit < 1) {\n    return;\n  }\n  let count = 0;\n  for (const v of stream) {\n    yield v;\n    if (++count === limit) {\n      break;\n    }\n  }\n}\n\nexport function first<T>(stream: Stream<T>): T | undefined {\n  const it = stream[Symbol.iterator]();\n  const {value} = it.next();\n  it.return?.();\n  return value;\n}\n\nexport function consume<T>(stream: Stream<T>): void {\n  // Required to prevent some minifiers (e.g. Terser) from removing this empty loop\n  for (const _ of stream);\n}\n\nexport function drainGenerator<Yield, Return>(\n  gen: Generator<Yield, Return, unknown>,\n): Return {\n  let result = gen.next();\n  while (!result.done) {\n    result = gen.next();\n  }\n  return result.value;\n}\n"],"mappings":";AAsBA,SAAgB,MAAS,QAAkC;CACzD,MAAM,KAAK,OAAO,OAAO,WAAW;CACpC,MAAM,EAAC,UAAS,GAAG,MAAM;AACzB,IAAG,UAAU;AACb,QAAO;;AAGT,SAAgB,QAAW,QAAyB;AAElD,MAAK,MAAM,KAAK"}