@rocicorp/zero 0.26.1 → 0.26.2-canary.1

package/out/zql/src/planner/planner-builder.js

@@ -6,266 +6,161 @@ import { PlannerFanOut } from "./planner-fan-out.js";
 import { PlannerGraph } from "./planner-graph.js";
 import { PlannerJoin } from "./planner-join.js";
 import { PlannerTerminus } from "./planner-terminus.js";
+//#region ../zql/src/planner/planner-builder.ts
 function wireOutput(from, to) {
-  switch (from.kind) {
-    case "connection":
-    case "join":
-    case "fan-in":
-      from.setOutput(to);
-      break;
-    case "fan-out":
-      from.addOutput(to);
-      break;
-    case "terminus":
-      assert(false, "Terminus nodes cannot have outputs");
-  }
+	switch (from.kind) {
+		case "connection":
+		case "join":
+		case "fan-in":
+			from.setOutput(to);
+			break;
+		case "fan-out":
+			from.addOutput(to);
+			break;
+		case "terminus": assert(false, "Terminus nodes cannot have outputs");
+	}
 }
 function buildPlanGraph(ast, model, isRoot, baseConstraints) {
-  const graph = new PlannerGraph();
-  let nextPlanId = 0;
-  const source = graph.addSource(ast.table, model);
-  const connection = source.connect(
-    ast.orderBy ?? [],
-    ast.where,
-    isRoot,
-    baseConstraints,
-    ast.limit
-  );
-  graph.connections.push(connection);
-  let end = connection;
-  if (ast.where) {
-    end = processCondition(
-      ast.where,
-      end,
-      graph,
-      model,
-      ast.table,
-      () => nextPlanId++
-    );
-  }
-  const terminus = new PlannerTerminus(end);
-  wireOutput(end, terminus);
-  graph.setTerminus(terminus);
-  const subPlans = {};
-  if (ast.related) {
-    for (const csq of ast.related) {
-      const alias = must(
-        csq.subquery.alias,
-        "Related subquery must have alias"
-      );
-      const childConstraints = extractConstraint(
-        csq.correlation.childField,
-        csq.subquery.table
-      );
-      subPlans[alias] = buildPlanGraph(
-        csq.subquery,
-        model,
-        true,
-        childConstraints
-      );
-    }
-  }
-  return { plan: graph, subPlans };
+	const graph = new PlannerGraph();
+	let nextPlanId = 0;
+	const connection = graph.addSource(ast.table, model).connect(ast.orderBy ?? [], ast.where, isRoot, baseConstraints, ast.limit);
+	graph.connections.push(connection);
+	let end = connection;
+	if (ast.where) end = processCondition(ast.where, end, graph, model, ast.table, () => nextPlanId++);
+	const terminus = new PlannerTerminus(end);
+	wireOutput(end, terminus);
+	graph.setTerminus(terminus);
+	const subPlans = {};
+	if (ast.related) for (const csq of ast.related) {
+		const alias = must(csq.subquery.alias, "Related subquery must have alias");
+		const childConstraints = extractConstraint(csq.correlation.childField, csq.subquery.table);
+		subPlans[alias] = buildPlanGraph(csq.subquery, model, true, childConstraints);
+	}
+	return {
+		plan: graph,
+		subPlans
+	};
 }
 function processCondition(condition, input, graph, model, parentTable, getPlanId) {
-  switch (condition.type) {
-    case "simple":
-      return input;
-    case "and":
-      return processAnd(condition, input, graph, model, parentTable, getPlanId);
-    case "or":
-      return processOr(condition, input, graph, model, parentTable, getPlanId);
-    case "correlatedSubquery":
-      return processCorrelatedSubquery(
-        condition,
-        input,
-        graph,
-        model,
-        parentTable,
-        getPlanId
-      );
-  }
+	switch (condition.type) {
+		case "simple": return input;
+		case "and": return processAnd(condition, input, graph, model, parentTable, getPlanId);
+		case "or": return processOr(condition, input, graph, model, parentTable, getPlanId);
+		case "correlatedSubquery": return processCorrelatedSubquery(condition, input, graph, model, parentTable, getPlanId);
+	}
 }
 function processAnd(condition, input, graph, model, parentTable, getPlanId) {
-  let end = input;
-  for (const subCondition of condition.conditions) {
-    end = processCondition(
-      subCondition,
-      end,
-      graph,
-      model,
-      parentTable,
-      getPlanId
-    );
-  }
-  return end;
+	let end = input;
+	for (const subCondition of condition.conditions) end = processCondition(subCondition, end, graph, model, parentTable, getPlanId);
+	return end;
 }
 function processOr(condition, input, graph, model, parentTable, getPlanId) {
-  const subqueryConditions = condition.conditions.filter(
-    (c) => c.type === "correlatedSubquery" || hasCorrelatedSubquery(c)
-  );
-  if (subqueryConditions.length === 0) {
-    return input;
-  }
-  const fanOut = new PlannerFanOut(input);
-  graph.fanOuts.push(fanOut);
-  wireOutput(input, fanOut);
-  const branches = [];
-  for (const subCondition of subqueryConditions) {
-    const branch = processCondition(
-      subCondition,
-      fanOut,
-      graph,
-      model,
-      parentTable,
-      getPlanId
-    );
-    branches.push(branch);
-    fanOut.addOutput(branch);
-  }
-  const fanIn = new PlannerFanIn(branches);
-  graph.fanIns.push(fanIn);
-  for (const branch of branches) {
-    wireOutput(branch, fanIn);
-  }
-  return fanIn;
+	const subqueryConditions = condition.conditions.filter((c) => c.type === "correlatedSubquery" || hasCorrelatedSubquery(c));
+	if (subqueryConditions.length === 0) return input;
+	const fanOut = new PlannerFanOut(input);
+	graph.fanOuts.push(fanOut);
+	wireOutput(input, fanOut);
+	const branches = [];
+	for (const subCondition of subqueryConditions) {
+		const branch = processCondition(subCondition, fanOut, graph, model, parentTable, getPlanId);
+		branches.push(branch);
+		fanOut.addOutput(branch);
+	}
+	const fanIn = new PlannerFanIn(branches);
+	graph.fanIns.push(fanIn);
+	for (const branch of branches) wireOutput(branch, fanIn);
+	return fanIn;
 }
 function processCorrelatedSubquery(condition, input, graph, model, parentTable, getPlanId) {
-  const { related } = condition;
-  const childTable = related.subquery.table;
-  const childSource = graph.hasSource(childTable) ? graph.getSource(childTable) : graph.addSource(childTable, model);
-  const childConnection = childSource.connect(
-    related.subquery.orderBy ?? [],
-    related.subquery.where,
-    false,
-    void 0,
-    // no base constraints for EXISTS/NOT EXISTS
-    condition.op === "EXISTS" ? 1 : void 0
-  );
-  graph.connections.push(childConnection);
-  let childEnd = childConnection;
-  if (related.subquery.where) {
-    childEnd = processCondition(
-      related.subquery.where,
-      childEnd,
-      graph,
-      model,
-      childTable,
-      getPlanId
-    );
-  }
-  const parentConstraint = extractConstraint(
-    related.correlation.parentField
-  );
-  const childConstraint = extractConstraint(
-    related.correlation.childField
-  );
-  const planId = getPlanId();
-  condition[planIdSymbol] = planId;
-  const isNotExists = condition.op === "NOT EXISTS";
-  const manualFlip = condition.flip;
-  let flippable;
-  let initialType;
-  if (isNotExists) {
-    flippable = false;
-    initialType = "semi";
-  } else if (manualFlip === true) {
-    flippable = false;
-    initialType = "flipped";
-  } else if (manualFlip === false) {
-    flippable = false;
-    initialType = "semi";
-  } else {
-    flippable = true;
-    initialType = "semi";
-  }
-  const join = new PlannerJoin(
-    input,
-    childEnd,
-    parentConstraint,
-    childConstraint,
-    flippable,
-    planId,
-    initialType
-  );
-  graph.joins.push(join);
-  wireOutput(input, join);
-  wireOutput(childEnd, join);
-  return join;
+	const { related } = condition;
+	const childTable = related.subquery.table;
+	const childConnection = (graph.hasSource(childTable) ? graph.getSource(childTable) : graph.addSource(childTable, model)).connect(related.subquery.orderBy ?? [], related.subquery.where, false, void 0, condition.op === "EXISTS" ? 1 : void 0);
+	graph.connections.push(childConnection);
+	let childEnd = childConnection;
+	if (related.subquery.where) childEnd = processCondition(related.subquery.where, childEnd, graph, model, childTable, getPlanId);
+	const parentConstraint = extractConstraint(related.correlation.parentField, parentTable);
+	const childConstraint = extractConstraint(related.correlation.childField, childTable);
+	const planId = getPlanId();
+	condition[planIdSymbol] = planId;
+	const isNotExists = condition.op === "NOT EXISTS";
+	const manualFlip = condition.flip;
+	let flippable;
+	let initialType;
+	if (isNotExists) {
+		flippable = false;
+		initialType = "semi";
+	} else if (manualFlip === true) {
+		flippable = false;
+		initialType = "flipped";
+	} else if (manualFlip === false) {
+		flippable = false;
+		initialType = "semi";
+	} else {
+		flippable = true;
+		initialType = "semi";
+	}
+	const join = new PlannerJoin(input, childEnd, parentConstraint, childConstraint, flippable, planId, initialType);
+	graph.joins.push(join);
+	wireOutput(input, join);
+	wireOutput(childEnd, join);
+	return join;
 }
 function hasCorrelatedSubquery(condition) {
-  if (condition.type === "correlatedSubquery") {
-    return true;
-  }
-  if (condition.type === "and" || condition.type === "or") {
-    return condition.conditions.some(hasCorrelatedSubquery);
-  }
-  return false;
+	if (condition.type === "correlatedSubquery") return true;
+	if (condition.type === "and" || condition.type === "or") return condition.conditions.some(hasCorrelatedSubquery);
+	return false;
 }
 function extractConstraint(fields, _tableName) {
-  return Object.fromEntries(fields.map((field) => [field, void 0]));
+	return Object.fromEntries(fields.map((field) => [field, void 0]));
 }
 function planRecursively(plans, planDebugger, lc) {
-  for (const subPlan of Object.values(plans.subPlans)) {
-    planRecursively(subPlan, planDebugger, lc);
-  }
-  plans.plan.plan(planDebugger, lc);
+	for (const subPlan of Object.values(plans.subPlans)) planRecursively(subPlan, planDebugger, lc);
+	plans.plan.plan(planDebugger, lc);
 }
 function planQuery(ast, model, planDebugger, lc) {
-  const plans = buildPlanGraph(ast, model, true);
-  planRecursively(plans, planDebugger, lc);
-  return applyPlansToAST(ast, plans);
+	const plans = buildPlanGraph(ast, model, true);
+	planRecursively(plans, planDebugger, lc);
+	return applyPlansToAST(ast, plans);
 }
 function applyToCondition(condition, flippedIds) {
-  if (condition.type === "simple") {
-    return condition;
-  }
-  if (condition.type === "correlatedSubquery") {
-    const planId = condition[planIdSymbol];
-    const shouldFlip = planId !== void 0 && flippedIds.has(planId);
-    return {
-      ...condition,
-      flip: shouldFlip,
-      related: {
-        ...condition.related,
-        subquery: {
-          ...condition.related.subquery,
-          where: condition.related.subquery.where ? applyToCondition(condition.related.subquery.where, flippedIds) : void 0
-        }
-      }
-    };
-  }
-  return {
-    ...condition,
-    conditions: condition.conditions.map((c) => applyToCondition(c, flippedIds))
-  };
+	if (condition.type === "simple") return condition;
+	if (condition.type === "correlatedSubquery") {
+		const planId = condition[planIdSymbol];
+		const shouldFlip = planId !== void 0 && flippedIds.has(planId);
+		return {
+			...condition,
+			flip: shouldFlip,
+			related: {
+				...condition.related,
+				subquery: {
+					...condition.related.subquery,
+					where: condition.related.subquery.where ? applyToCondition(condition.related.subquery.where, flippedIds) : void 0
+				}
+			}
+		};
+	}
+	return {
+		...condition,
+		conditions: condition.conditions.map((c) => applyToCondition(c, flippedIds))
+	};
 }
 function applyPlansToAST(ast, plans) {
-  const flippedIds = /* @__PURE__ */ new Set();
-  for (const join of plans.plan.joins) {
-    if (join.type === "flipped" && join.planId !== void 0) {
-      flippedIds.add(join.planId);
-    }
-  }
-  return {
-    ...ast,
-    where: ast.where ? applyToCondition(ast.where, flippedIds) : void 0,
-    related: ast.related?.map((csq) => {
-      const alias = must(
-        csq.subquery.alias,
-        "Related subquery must have alias"
-      );
-      const subPlan = plans.subPlans[alias];
-      return {
-        ...csq,
-        subquery: subPlan ? applyPlansToAST(csq.subquery, subPlan) : csq.subquery
-      };
-    })
-  };
+	const flippedIds = /* @__PURE__ */ new Set();
+	for (const join of plans.plan.joins) if (join.type === "flipped" && join.planId !== void 0) flippedIds.add(join.planId);
+	return {
+		...ast,
+		where: ast.where ? applyToCondition(ast.where, flippedIds) : void 0,
+		related: ast.related?.map((csq) => {
+			const alias = must(csq.subquery.alias, "Related subquery must have alias");
+			const subPlan = plans.subPlans[alias];
+			return {
+				...csq,
+				subquery: subPlan ? applyPlansToAST(csq.subquery, subPlan) : csq.subquery
+			};
+		})
+	};
 }
-export {
-  applyPlansToAST,
-  buildPlanGraph,
-  planQuery
-};
-//# sourceMappingURL=planner-builder.js.map
+//#endregion
+export { planQuery };
+
+//# sourceMappingURL=planner-builder.js.map

package/out/zql/src/planner/planner-builder.js.map

@@ -1 +1 @@
-{"version":3,"file":"planner-builder.js","sources":["../../../../../zql/src/planner/planner-builder.ts"],"sourcesContent":["import type {LogContext} from '@rocicorp/logger';\nimport {assert} from '../../../shared/src/asserts.ts';\nimport {must} from '../../../shared/src/must.ts';\nimport type {\n  AST,\n  Condition,\n  Conjunction,\n  CorrelatedSubqueryCondition,\n  Disjunction,\n} from '../../../zero-protocol/src/ast.ts';\nimport {planIdSymbol} from '../../../zero-protocol/src/ast.ts';\nimport type {ConnectionCostModel} from './planner-connection.ts';\nimport type {PlannerConstraint} from './planner-constraint.ts';\nimport type {PlanDebugger} from './planner-debug.ts';\nimport {PlannerFanIn} from './planner-fan-in.ts';\nimport {PlannerFanOut} from './planner-fan-out.ts';\nimport {PlannerGraph} from './planner-graph.ts';\nimport {PlannerJoin} from './planner-join.ts';\nimport type {PlannerNode} from './planner-node.ts';\nimport {PlannerTerminus} from './planner-terminus.ts';\n\nfunction wireOutput(from: PlannerNode, to: PlannerNode): void {\n  switch (from.kind) {\n    case 'connection':\n    case 'join':\n    case 'fan-in':\n      from.setOutput(to);\n      break;\n    case 'fan-out':\n      from.addOutput(to);\n      break;\n    case 'terminus':\n      assert(false, 'Terminus nodes cannot have outputs');\n  }\n}\n\nexport type Plans = {\n  plan: PlannerGraph;\n  subPlans: {[key: string]: Plans};\n};\n\nexport function buildPlanGraph(\n  ast: AST,\n  model: ConnectionCostModel,\n  isRoot: boolean,\n  baseConstraints?: PlannerConstraint,\n): Plans {\n  const graph = new PlannerGraph();\n  let nextPlanId = 0;\n\n  const source = graph.addSource(ast.table, model);\n  const connection = source.connect(\n    ast.orderBy ?? [],\n    ast.where,\n    isRoot,\n    baseConstraints,\n    ast.limit,\n  );\n  graph.connections.push(connection);\n\n  let end: PlannerNode = connection;\n  if (ast.where) {\n    end = processCondition(\n      ast.where,\n      end,\n      graph,\n      model,\n      ast.table,\n      () => nextPlanId++,\n    );\n  }\n\n  const terminus = new PlannerTerminus(end);\n  wireOutput(end, terminus);\n  graph.setTerminus(terminus);\n\n  const subPlans: {[key: string]: Plans} = {};\n  if (ast.related) {\n    for (const csq of ast.related) {\n      const alias = must(\n        csq.subquery.alias,\n        'Related subquery must have alias',\n      );\n      const childConstraints = extractConstraint(\n        csq.correlation.childField,\n        csq.subquery.table,\n      );\n      subPlans[alias] = buildPlanGraph(\n        csq.subquery,\n        model,\n        true,\n        childConstraints,\n      );\n    }\n  }\n\n  return {plan: graph, subPlans};\n}\n\nfunction processCondition(\n  condition: Condition,\n  input: Exclude<PlannerNode, PlannerTerminus>,\n  graph: PlannerGraph,\n  model: ConnectionCostModel,\n  parentTable: string,\n  getPlanId: () => number,\n): Exclude<PlannerNode, PlannerTerminus> {\n  switch (condition.type) {\n    case 'simple':\n      return input;\n    case 'and':\n      return processAnd(condition, input, graph, model, parentTable, getPlanId);\n    case 'or':\n      return processOr(condition, input, graph, model, parentTable, getPlanId);\n    case 'correlatedSubquery':\n      return processCorrelatedSubquery(\n        condition,\n        input,\n        graph,\n        model,\n        parentTable,\n        getPlanId,\n      );\n  }\n}\n\nfunction processAnd(\n  condition: Conjunction,\n  input: Exclude<PlannerNode, PlannerTerminus>,\n  graph: PlannerGraph,\n  model: ConnectionCostModel,\n  parentTable: string,\n  getPlanId: () => number,\n): Exclude<PlannerNode, PlannerTerminus> {\n  let end = input;\n  for (const subCondition of condition.conditions) {\n    end = processCondition(\n      subCondition,\n      end,\n      graph,\n      model,\n      parentTable,\n      getPlanId,\n    );\n  }\n  return end;\n}\n\nfunction processOr(\n  condition: Disjunction,\n  input: Exclude<PlannerNode, PlannerTerminus>,\n  graph: PlannerGraph,\n  model: ConnectionCostModel,\n  parentTable: string,\n  getPlanId: () => number,\n): Exclude<PlannerNode, PlannerTerminus> {\n  const subqueryConditions = condition.conditions.filter(\n    c => c.type === 'correlatedSubquery' || hasCorrelatedSubquery(c),\n  );\n\n  if (subqueryConditions.length === 0) {\n    return input;\n  }\n\n  const fanOut = new PlannerFanOut(input);\n  graph.fanOuts.push(fanOut);\n  wireOutput(input, fanOut);\n\n  const branches: Exclude<PlannerNode, PlannerTerminus>[] = [];\n  for (const subCondition of subqueryConditions) {\n    const branch = processCondition(\n      subCondition,\n      fanOut,\n      graph,\n      model,\n      parentTable,\n      getPlanId,\n    );\n    branches.push(branch);\n    fanOut.addOutput(branch);\n  }\n\n  const fanIn = new PlannerFanIn(branches);\n  graph.fanIns.push(fanIn);\n  for (const branch of branches) {\n    wireOutput(branch, fanIn);\n  }\n\n  return fanIn;\n}\n\nfunction processCorrelatedSubquery(\n  condition: CorrelatedSubqueryCondition,\n  input: Exclude<PlannerNode, PlannerTerminus>,\n  graph: PlannerGraph,\n  model: ConnectionCostModel,\n  parentTable: string,\n  getPlanId: () => number,\n): Exclude<PlannerNode, PlannerTerminus> {\n  const {related} = condition;\n  const childTable = related.subquery.table;\n\n  const childSource = graph.hasSource(childTable)\n    ? graph.getSource(childTable)\n    : graph.addSource(childTable, model);\n\n  const childConnection = childSource.connect(\n    related.subquery.orderBy ?? [],\n    related.subquery.where,\n    false,\n    undefined, // no base constraints for EXISTS/NOT EXISTS\n    condition.op === 'EXISTS' ? 1 : undefined,\n  );\n  graph.connections.push(childConnection);\n\n  let childEnd: PlannerNode = childConnection;\n  if (related.subquery.where) {\n    childEnd = processCondition(\n      related.subquery.where,\n      childEnd,\n      graph,\n      model,\n      childTable,\n      getPlanId,\n    );\n  }\n\n  const parentConstraint = extractConstraint(\n    related.correlation.parentField,\n    parentTable,\n  );\n  const childConstraint = extractConstraint(\n    related.correlation.childField,\n    childTable,\n  );\n\n  const planId = getPlanId();\n  condition[planIdSymbol] = planId;\n\n  // Determine flippability and initial type based on flip flag and operator\n  const isNotExists = condition.op === 'NOT EXISTS';\n  const manualFlip = condition.flip;\n\n  let flippable: boolean;\n  let initialType: 'semi' | 'flipped';\n\n  if (isNotExists) {\n    // NOT EXISTS joins can never be flipped\n    flippable = false;\n    initialType = 'semi';\n  } else if (manualFlip === true) {\n    // User explicitly requested flip=true: start flipped, don't allow planner to change\n    flippable = false;\n    initialType = 'flipped';\n  } else if (manualFlip === false) {\n    // User explicitly requested flip=false: start semi, don't allow planner to change\n    flippable = false;\n    initialType = 'semi';\n  } else {\n    // flip is undefined: planner can decide\n    flippable = true;\n    initialType = 'semi';\n  }\n\n  const join = new PlannerJoin(\n    input,\n    childEnd,\n    parentConstraint,\n    childConstraint,\n    flippable,\n    planId,\n    initialType,\n  );\n  graph.joins.push(join);\n\n  wireOutput(input, join);\n  wireOutput(childEnd, join);\n\n  return join;\n}\n\nfunction hasCorrelatedSubquery(condition: Condition): boolean {\n  if (condition.type === 'correlatedSubquery') {\n    return true;\n  }\n  if (condition.type === 'and' || condition.type === 'or') {\n    return condition.conditions.some(hasCorrelatedSubquery);\n  }\n  // simple conditions don't contain correlated subqueries\n  return false;\n}\n\nfunction extractConstraint(\n  fields: readonly string[],\n  _tableName: string,\n): PlannerConstraint {\n  return Object.fromEntries(fields.map(field => [field, undefined]));\n}\n\nfunction planRecursively(\n  plans: Plans,\n  planDebugger?: PlanDebugger,\n  lc?: LogContext,\n): void {\n  for (const subPlan of Object.values(plans.subPlans)) {\n    planRecursively(subPlan, planDebugger, lc);\n  }\n  plans.plan.plan(planDebugger, lc);\n}\n\nexport function planQuery(\n  ast: AST,\n  model: ConnectionCostModel,\n  planDebugger?: PlanDebugger,\n  lc?: LogContext,\n): AST {\n  const plans = buildPlanGraph(ast, model, true);\n  planRecursively(plans, planDebugger, lc);\n  return applyPlansToAST(ast, plans);\n}\n\nfunction applyToCondition(\n  condition: Condition,\n  flippedIds: Set<number>,\n): Condition {\n  if (condition.type === 'simple') {\n    return condition;\n  }\n\n  if (condition.type === 'correlatedSubquery') {\n    const planId = (condition as unknown as Record<symbol, number>)[\n      planIdSymbol\n    ];\n    const shouldFlip = planId !== undefined && flippedIds.has(planId);\n\n    return {\n      ...condition,\n      flip: shouldFlip,\n      related: {\n        ...condition.related,\n        subquery: {\n          ...condition.related.subquery,\n          where: condition.related.subquery.where\n            ? applyToCondition(condition.related.subquery.where, flippedIds)\n            : undefined,\n        },\n      },\n    };\n  }\n\n  return {\n    ...condition,\n    conditions: condition.conditions.map(c => applyToCondition(c, flippedIds)),\n  };\n}\n\nexport function applyPlansToAST(ast: AST, plans: Plans): AST {\n  const flippedIds = new Set<number>();\n  for (const join of plans.plan.joins) {\n    if (join.type === 'flipped' && join.planId !== undefined) {\n      flippedIds.add(join.planId);\n    }\n  }\n\n  return {\n    ...ast,\n    where: ast.where ? applyToCondition(ast.where, flippedIds) : undefined,\n    related: ast.related?.map(csq => {\n      const alias = must(\n        csq.subquery.alias,\n        'Related subquery must have alias',\n      );\n      const subPlan = plans.subPlans[alias];\n      return {\n        ...csq,\n        subquery: subPlan\n          ? applyPlansToAST(csq.subquery, subPlan)\n          : csq.subquery,\n      };\n    }),\n  };\n}\n"],"names":[],"mappings":";;;;;;;;AAqBA,SAAS,WAAW,MAAmB,IAAuB;AAC5D,UAAQ,KAAK,MAAA;AAAA,IACX,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AACH,WAAK,UAAU,EAAE;AACjB;AAAA,IACF,KAAK;AACH,WAAK,UAAU,EAAE;AACjB;AAAA,IACF,KAAK;AACH,aAAO,OAAO,oCAAoC;AAAA,EAAA;AAExD;AAOO,SAAS,eACd,KACA,OACA,QACA,iBACO;AACP,QAAM,QAAQ,IAAI,aAAA;AAClB,MAAI,aAAa;AAEjB,QAAM,SAAS,MAAM,UAAU,IAAI,OAAO,KAAK;AAC/C,QAAM,aAAa,OAAO;AAAA,IACxB,IAAI,WAAW,CAAA;AAAA,IACf,IAAI;AAAA,IACJ;AAAA,IACA;AAAA,IACA,IAAI;AAAA,EAAA;AAEN,QAAM,YAAY,KAAK,UAAU;AAEjC,MAAI,MAAmB;AACvB,MAAI,IAAI,OAAO;AACb,UAAM;AAAA,MACJ,IAAI;AAAA,MACJ;AAAA,MACA;AAAA,MACA;AAAA,MACA,IAAI;AAAA,MACJ,MAAM;AAAA,IAAA;AAAA,EAEV;AAEA,QAAM,WAAW,IAAI,gBAAgB,GAAG;AACxC,aAAW,KAAK,QAAQ;AACxB,QAAM,YAAY,QAAQ;AAE1B,QAAM,WAAmC,CAAA;AACzC,MAAI,IAAI,SAAS;AACf,eAAW,OAAO,IAAI,SAAS;AAC7B,YAAM,QAAQ;AAAA,QACZ,IAAI,SAAS;AAAA,QACb;AAAA,MAAA;AAEF,YAAM,mBAAmB;AAAA,QACvB,IAAI,YAAY;AAAA,QAChB,IAAI,SAAS;AAAA,MAAA;AAEf,eAAS,KAAK,IAAI;AAAA,QAChB,IAAI;AAAA,QACJ;AAAA,QACA;AAAA,QACA;AAAA,MAAA;AAAA,IAEJ;AAAA,EACF;AAEA,SAAO,EAAC,MAAM,OAAO,SAAA;AACvB;AAEA,SAAS,iBACP,WACA,OACA,OACA,OACA,aACA,WACuC;AACvC,UAAQ,UAAU,MAAA;AAAA,IAChB,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO,WAAW,WAAW,OAAO,OAAO,OAAO,aAAa,SAAS;AAAA,IAC1E,KAAK;AACH,aAAO,UAAU,WAAW,OAAO,OAAO,OAAO,aAAa,SAAS;AAAA,IACzE,KAAK;AACH,aAAO;AAAA,QACL;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MAAA;AAAA,EACF;AAEN;AAEA,SAAS,WACP,WACA,OACA,OACA,OACA,aACA,WACuC;AACvC,MAAI,MAAM;AACV,aAAW,gBAAgB,UAAU,YAAY;AAC/C,UAAM;AAAA,MACJ;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IAAA;AAAA,EAEJ;AACA,SAAO;AACT;AAEA,SAAS,UACP,WACA,OACA,OACA,OACA,aACA,WACuC;AACvC,QAAM,qBAAqB,UAAU,WAAW;AAAA,IAC9C,CAAA,MAAK,EAAE,SAAS,wBAAwB,sBAAsB,CAAC;AAAA,EAAA;AAGjE,MAAI,mBAAmB,WAAW,GAAG;AACnC,WAAO;AAAA,EACT;AAEA,QAAM,SAAS,IAAI,cAAc,KAAK;AACtC,QAAM,QAAQ,KAAK,MAAM;AACzB,aAAW,OAAO,MAAM;AAExB,QAAM,WAAoD,CAAA;AAC1D,aAAW,gBAAgB,oBAAoB;AAC7C,UAAM,SAAS;AAAA,MACb;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IAAA;AAEF,aAAS,KAAK,MAAM;AACpB,WAAO,UAAU,MAAM;AAAA,EACzB;AAEA,QAAM,QAAQ,IAAI,aAAa,QAAQ;AACvC,QAAM,OAAO,KAAK,KAAK;AACvB,aAAW,UAAU,UAAU;AAC7B,eAAW,QAAQ,KAAK;AAAA,EAC1B;AAEA,SAAO;AACT;AAEA,SAAS,0BACP,WACA,OACA,OACA,OACA,aACA,WACuC;AACvC,QAAM,EAAC,YAAW;AAClB,QAAM,aAAa,QAAQ,SAAS;AAEpC,QAAM,cAAc,MAAM,UAAU,UAAU,IAC1C,MAAM,UAAU,UAAU,IAC1B,MAAM,UAAU,YAAY,KAAK;AAErC,QAAM,kBAAkB,YAAY;AAAA,IAClC,QAAQ,SAAS,WAAW,CAAA;AAAA,IAC5B,QAAQ,SAAS;AAAA,IACjB;AAAA,IACA;AAAA;AAAA,IACA,UAAU,OAAO,WAAW,IAAI;AAAA,EAAA;AAElC,QAAM,YAAY,KAAK,eAAe;AAEtC,MAAI,WAAwB;AAC5B,MAAI,QAAQ,SAAS,OAAO;AAC1B,eAAW;AAAA,MACT,QAAQ,SAAS;AAAA,MACjB;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IAAA;AAAA,EAEJ;AAEA,QAAM,mBAAmB;AAAA,IACvB,QAAQ,YAAY;AAAA,EAEtB;AACA,QAAM,kBAAkB;AAAA,IACtB,QAAQ,YAAY;AAAA,EAEtB;AAEA,QAAM,SAAS,UAAA;AACf,YAAU,YAAY,IAAI;AAG1B,QAAM,cAAc,UAAU,OAAO;AACrC,QAAM,aAAa,UAAU;AAE7B,MAAI;AACJ,MAAI;AAEJ,MAAI,aAAa;AAEf,gBAAY;AACZ,kBAAc;AAAA,EAChB,WAAW,eAAe,MAAM;AAE9B,gBAAY;AACZ,kBAAc;AAAA,EAChB,WAAW,eAAe,OAAO;AAE/B,gBAAY;AACZ,kBAAc;AAAA,EAChB,OAAO;AAEL,gBAAY;AACZ,kBAAc;AAAA,EAChB;AAEA,QAAM,OAAO,IAAI;AAAA,IACf;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EAAA;AAEF,QAAM,MAAM,KAAK,IAAI;AAErB,aAAW,OAAO,IAAI;AACtB,aAAW,UAAU,IAAI;AAEzB,SAAO;AACT;AAEA,SAAS,sBAAsB,WAA+B;AAC5D,MAAI,UAAU,SAAS,sBAAsB;AAC3C,WAAO;AAAA,EACT;AACA,MAAI,UAAU,SAAS,SAAS,UAAU,SAAS,MAAM;AACvD,WAAO,UAAU,WAAW,KAAK,qBAAqB;AAAA,EACxD;AAEA,SAAO;AACT;AAEA,SAAS,kBACP,QACA,YACmB;AACnB,SAAO,OAAO,YAAY,OAAO,IAAI,WAAS,CAAC,OAAO,MAAS,CAAC,CAAC;AACnE;AAEA,SAAS,gBACP,OACA,cACA,IACM;AACN,aAAW,WAAW,OAAO,OAAO,MAAM,QAAQ,GAAG;AACnD,oBAAgB,SAAS,cAAc,EAAE;AAAA,EAC3C;AACA,QAAM,KAAK,KAAK,cAAc,EAAE;AAClC;AAEO,SAAS,UACd,KACA,OACA,cACA,IACK;AACL,QAAM,QAAQ,eAAe,KAAK,OAAO,IAAI;AAC7C,kBAAgB,OAAO,cAAc,EAAE;AACvC,SAAO,gBAAgB,KAAK,KAAK;AACnC;AAEA,SAAS,iBACP,WACA,YACW;AACX,MAAI,UAAU,SAAS,UAAU;AAC/B,WAAO;AAAA,EACT;AAEA,MAAI,UAAU,SAAS,sBAAsB;AAC3C,UAAM,SAAU,UACd,YACF;AACA,UAAM,aAAa,WAAW,UAAa,WAAW,IAAI,MAAM;AAEhE,WAAO;AAAA,MACL,GAAG;AAAA,MACH,MAAM;AAAA,MACN,SAAS;AAAA,QACP,GAAG,UAAU;AAAA,QACb,UAAU;AAAA,UACR,GAAG,UAAU,QAAQ;AAAA,UACrB,OAAO,UAAU,QAAQ,SAAS,QAC9B,iBAAiB,UAAU,QAAQ,SAAS,OAAO,UAAU,IAC7D;AAAA,QAAA;AAAA,MACN;AAAA,IACF;AAAA,EAEJ;AAEA,SAAO;AAAA,IACL,GAAG;AAAA,IACH,YAAY,UAAU,WAAW,IAAI,OAAK,iBAAiB,GAAG,UAAU,CAAC;AAAA,EAAA;AAE7E;AAEO,SAAS,gBAAgB,KAAU,OAAmB;AAC3D,QAAM,iCAAiB,IAAA;AACvB,aAAW,QAAQ,MAAM,KAAK,OAAO;AACnC,QAAI,KAAK,SAAS,aAAa,KAAK,WAAW,QAAW;AACxD,iBAAW,IAAI,KAAK,MAAM;AAAA,IAC5B;AAAA,EACF;AAEA,SAAO;AAAA,IACL,GAAG;AAAA,IACH,OAAO,IAAI,QAAQ,iBAAiB,IAAI,OAAO,UAAU,IAAI;AAAA,IAC7D,SAAS,IAAI,SAAS,IAAI,CAAA,QAAO;AAC/B,YAAM,QAAQ;AAAA,QACZ,IAAI,SAAS;AAAA,QACb;AAAA,MAAA;AAEF,YAAM,UAAU,MAAM,SAAS,KAAK;AACpC,aAAO;AAAA,QACL,GAAG;AAAA,QACH,UAAU,UACN,gBAAgB,IAAI,UAAU,OAAO,IACrC,IAAI;AAAA,MAAA;AAAA,IAEZ,CAAC;AAAA,EAAA;AAEL;"}
+{"version":3,"file":"planner-builder.js","names":[],"sources":["../../../../../zql/src/planner/planner-builder.ts"],"sourcesContent":["import type {LogContext} from '@rocicorp/logger';\nimport {assert} from '../../../shared/src/asserts.ts';\nimport {must} from '../../../shared/src/must.ts';\nimport type {\n  AST,\n  Condition,\n  Conjunction,\n  CorrelatedSubqueryCondition,\n  Disjunction,\n} from '../../../zero-protocol/src/ast.ts';\nimport {planIdSymbol} from '../../../zero-protocol/src/ast.ts';\nimport type {ConnectionCostModel} from './planner-connection.ts';\nimport type {PlannerConstraint} from './planner-constraint.ts';\nimport type {PlanDebugger} from './planner-debug.ts';\nimport {PlannerFanIn} from './planner-fan-in.ts';\nimport {PlannerFanOut} from './planner-fan-out.ts';\nimport {PlannerGraph} from './planner-graph.ts';\nimport {PlannerJoin} from './planner-join.ts';\nimport type {PlannerNode} from './planner-node.ts';\nimport {PlannerTerminus} from './planner-terminus.ts';\n\nfunction wireOutput(from: PlannerNode, to: PlannerNode): void {\n  switch (from.kind) {\n    case 'connection':\n    case 'join':\n    case 'fan-in':\n      from.setOutput(to);\n      break;\n    case 'fan-out':\n      from.addOutput(to);\n      break;\n    case 'terminus':\n      assert(false, 'Terminus nodes cannot have outputs');\n  }\n}\n\nexport type Plans = {\n  plan: PlannerGraph;\n  subPlans: {[key: string]: Plans};\n};\n\nexport function buildPlanGraph(\n  ast: AST,\n  model: ConnectionCostModel,\n  isRoot: boolean,\n  baseConstraints?: PlannerConstraint,\n): Plans {\n  const graph = new PlannerGraph();\n  let nextPlanId = 0;\n\n  const source = graph.addSource(ast.table, model);\n  const connection = source.connect(\n    ast.orderBy ?? [],\n    ast.where,\n    isRoot,\n    baseConstraints,\n    ast.limit,\n  );\n  graph.connections.push(connection);\n\n  let end: PlannerNode = connection;\n  if (ast.where) {\n    end = processCondition(\n      ast.where,\n      end,\n      graph,\n      model,\n      ast.table,\n      () => nextPlanId++,\n    );\n  }\n\n  const terminus = new PlannerTerminus(end);\n  wireOutput(end, terminus);\n  graph.setTerminus(terminus);\n\n  const subPlans: {[key: string]: Plans} = {};\n  if (ast.related) {\n    for (const csq of ast.related) {\n      const alias = must(\n        csq.subquery.alias,\n        'Related subquery must have alias',\n      );\n      const childConstraints = extractConstraint(\n        csq.correlation.childField,\n        csq.subquery.table,\n      );\n      subPlans[alias] = buildPlanGraph(\n        csq.subquery,\n        model,\n        true,\n        childConstraints,\n      );\n    }\n  }\n\n  return {plan: graph, subPlans};\n}\n\nfunction processCondition(\n  condition: Condition,\n  input: Exclude<PlannerNode, PlannerTerminus>,\n  graph: PlannerGraph,\n  model: ConnectionCostModel,\n  parentTable: string,\n  getPlanId: () => number,\n): Exclude<PlannerNode, PlannerTerminus> {\n  switch (condition.type) {\n    case 'simple':\n      return input;\n    case 'and':\n      return processAnd(condition, input, graph, model, parentTable, getPlanId);\n    case 'or':\n      return processOr(condition, input, graph, model, parentTable, getPlanId);\n    case 'correlatedSubquery':\n      return processCorrelatedSubquery(\n        condition,\n        input,\n        graph,\n        model,\n        parentTable,\n        getPlanId,\n      );\n  }\n}\n\nfunction processAnd(\n  condition: Conjunction,\n  input: Exclude<PlannerNode, PlannerTerminus>,\n  graph: PlannerGraph,\n  model: ConnectionCostModel,\n  parentTable: string,\n  getPlanId: () => number,\n): Exclude<PlannerNode, PlannerTerminus> {\n  let end = input;\n  for (const subCondition of condition.conditions) {\n    end = processCondition(\n      subCondition,\n      end,\n      graph,\n      model,\n      parentTable,\n      getPlanId,\n    );\n  }\n  return end;\n}\n\nfunction processOr(\n  condition: Disjunction,\n  input: Exclude<PlannerNode, PlannerTerminus>,\n  graph: PlannerGraph,\n  model: ConnectionCostModel,\n  parentTable: string,\n  getPlanId: () => number,\n): Exclude<PlannerNode, PlannerTerminus> {\n  const subqueryConditions = condition.conditions.filter(\n    c => c.type === 'correlatedSubquery' || hasCorrelatedSubquery(c),\n  );\n\n  if (subqueryConditions.length === 0) {\n    return input;\n  }\n\n  const fanOut = new PlannerFanOut(input);\n  graph.fanOuts.push(fanOut);\n  wireOutput(input, fanOut);\n\n  const branches: Exclude<PlannerNode, PlannerTerminus>[] = [];\n  for (const subCondition of subqueryConditions) {\n    const branch = processCondition(\n      subCondition,\n      fanOut,\n      graph,\n      model,\n      parentTable,\n      getPlanId,\n    );\n    branches.push(branch);\n    fanOut.addOutput(branch);\n  }\n\n  const fanIn = new PlannerFanIn(branches);\n  graph.fanIns.push(fanIn);\n  for (const branch of branches) {\n    wireOutput(branch, fanIn);\n  }\n\n  return fanIn;\n}\n\nfunction processCorrelatedSubquery(\n  condition: CorrelatedSubqueryCondition,\n  input: Exclude<PlannerNode, PlannerTerminus>,\n  graph: PlannerGraph,\n  model: ConnectionCostModel,\n  parentTable: string,\n  getPlanId: () => number,\n): Exclude<PlannerNode, PlannerTerminus> {\n  const {related} = condition;\n  const childTable = related.subquery.table;\n\n  const childSource = graph.hasSource(childTable)\n    ? graph.getSource(childTable)\n    : graph.addSource(childTable, model);\n\n  const childConnection = childSource.connect(\n    related.subquery.orderBy ?? [],\n    related.subquery.where,\n    false,\n    undefined, // no base constraints for EXISTS/NOT EXISTS\n    condition.op === 'EXISTS' ? 1 : undefined,\n  );\n  graph.connections.push(childConnection);\n\n  let childEnd: PlannerNode = childConnection;\n  if (related.subquery.where) {\n    childEnd = processCondition(\n      related.subquery.where,\n      childEnd,\n      graph,\n      model,\n      childTable,\n      getPlanId,\n    );\n  }\n\n  const parentConstraint = extractConstraint(\n    related.correlation.parentField,\n    parentTable,\n  );\n  const childConstraint = extractConstraint(\n    related.correlation.childField,\n    childTable,\n  );\n\n  const planId = getPlanId();\n  condition[planIdSymbol] = planId;\n\n  // Determine flippability and initial type based on flip flag and operator\n  const isNotExists = condition.op === 'NOT EXISTS';\n  const manualFlip = condition.flip;\n\n  let flippable: boolean;\n  let initialType: 'semi' | 'flipped';\n\n  if (isNotExists) {\n    // NOT EXISTS joins can never be flipped\n    flippable = false;\n    initialType = 'semi';\n  } else if (manualFlip === true) {\n    // User explicitly requested flip=true: start flipped, don't allow planner to change\n    flippable = false;\n    initialType = 'flipped';\n  } else if (manualFlip === false) {\n    // User explicitly requested flip=false: start semi, don't allow planner to change\n    flippable = false;\n    initialType = 'semi';\n  } else {\n    // flip is undefined: planner can decide\n    flippable = true;\n    initialType = 'semi';\n  }\n\n  const join = new PlannerJoin(\n    input,\n    childEnd,\n    parentConstraint,\n    childConstraint,\n    flippable,\n    planId,\n    initialType,\n  );\n  graph.joins.push(join);\n\n  wireOutput(input, join);\n  wireOutput(childEnd, join);\n\n  return join;\n}\n\nfunction hasCorrelatedSubquery(condition: Condition): boolean {\n  if (condition.type === 'correlatedSubquery') {\n    return true;\n  }\n  if (condition.type === 'and' || condition.type === 'or') {\n    return condition.conditions.some(hasCorrelatedSubquery);\n  }\n  // simple conditions don't contain correlated subqueries\n  return false;\n}\n\nfunction extractConstraint(\n  fields: readonly string[],\n  _tableName: string,\n): PlannerConstraint {\n  return Object.fromEntries(fields.map(field => [field, undefined]));\n}\n\nfunction planRecursively(\n  plans: Plans,\n  planDebugger?: PlanDebugger,\n  lc?: LogContext,\n): void {\n  for (const subPlan of Object.values(plans.subPlans)) {\n    planRecursively(subPlan, planDebugger, lc);\n  }\n  plans.plan.plan(planDebugger, lc);\n}\n\nexport function planQuery(\n  ast: AST,\n  model: ConnectionCostModel,\n  planDebugger?: PlanDebugger,\n  lc?: LogContext,\n): AST {\n  const plans = buildPlanGraph(ast, model, true);\n  planRecursively(plans, planDebugger, lc);\n  return applyPlansToAST(ast, plans);\n}\n\nfunction applyToCondition(\n  condition: Condition,\n  flippedIds: Set<number>,\n): Condition {\n  if (condition.type === 'simple') {\n    return condition;\n  }\n\n  if (condition.type === 'correlatedSubquery') {\n    const planId = (condition as unknown as Record<symbol, number>)[\n      planIdSymbol\n    ];\n    const shouldFlip = planId !== undefined && flippedIds.has(planId);\n\n    return {\n      ...condition,\n      flip: shouldFlip,\n      related: {\n        ...condition.related,\n        subquery: {\n          ...condition.related.subquery,\n          where: condition.related.subquery.where\n            ? applyToCondition(condition.related.subquery.where, flippedIds)\n            : undefined,\n        },\n      },\n    };\n  }\n\n  return {\n    ...condition,\n    conditions: condition.conditions.map(c => applyToCondition(c, flippedIds)),\n  };\n}\n\nexport function applyPlansToAST(ast: AST, plans: Plans): AST {\n  const flippedIds = new Set<number>();\n  for (const join of plans.plan.joins) {\n    if (join.type === 'flipped' && join.planId !== undefined) {\n      flippedIds.add(join.planId);\n    }\n  }\n\n  return {\n    ...ast,\n    where: ast.where ? applyToCondition(ast.where, flippedIds) : undefined,\n    related: ast.related?.map(csq => {\n      const alias = must(\n        csq.subquery.alias,\n        'Related subquery must have alias',\n      );\n      const subPlan = plans.subPlans[alias];\n      return {\n        ...csq,\n        subquery: subPlan\n          ? applyPlansToAST(csq.subquery, subPlan)\n          : csq.subquery,\n      };\n    }),\n  };\n}\n"],"mappings":";;;;;;;;;AAqBA,SAAS,WAAW,MAAmB,IAAuB;AAC5D,SAAQ,KAAK,MAAb;EACE,KAAK;EACL,KAAK;EACL,KAAK;AACH,QAAK,UAAU,GAAG;AAClB;EACF,KAAK;AACH,QAAK,UAAU,GAAG;AAClB;EACF,KAAK,WACH,QAAO,OAAO,qCAAqC;;;AASzD,SAAgB,eACd,KACA,OACA,QACA,iBACO;CACP,MAAM,QAAQ,IAAI,cAAc;CAChC,IAAI,aAAa;CAGjB,MAAM,aADS,MAAM,UAAU,IAAI,OAAO,MAAM,CACtB,QACxB,IAAI,WAAW,EAAE,EACjB,IAAI,OACJ,QACA,iBACA,IAAI,MACL;AACD,OAAM,YAAY,KAAK,WAAW;CAElC,IAAI,MAAmB;AACvB,KAAI,IAAI,MACN,OAAM,iBACJ,IAAI,OACJ,KACA,OACA,OACA,IAAI,aACE,aACP;CAGH,MAAM,WAAW,IAAI,gBAAgB,IAAI;AACzC,YAAW,KAAK,SAAS;AACzB,OAAM,YAAY,SAAS;CAE3B,MAAM,WAAmC,EAAE;AAC3C,KAAI,IAAI,QACN,MAAK,MAAM,OAAO,IAAI,SAAS;EAC7B,MAAM,QAAQ,KACZ,IAAI,SAAS,OACb,mCACD;EACD,MAAM,mBAAmB,kBACvB,IAAI,YAAY,YAChB,IAAI,SAAS,MACd;AACD,WAAS,SAAS,eAChB,IAAI,UACJ,OACA,MACA,iBACD;;AAIL,QAAO;EAAC,MAAM;EAAO;EAAS;;AAGhC,SAAS,iBACP,WACA,OACA,OACA,OACA,aACA,WACuC;AACvC,SAAQ,UAAU,MAAlB;EACE,KAAK,SACH,QAAO;EACT,KAAK,MACH,QAAO,WAAW,WAAW,OAAO,OAAO,OAAO,aAAa,UAAU;EAC3E,KAAK,KACH,QAAO,UAAU,WAAW,OAAO,OAAO,OAAO,aAAa,UAAU;EAC1E,KAAK,qBACH,QAAO,0BACL,WACA,OACA,OACA,OACA,aACA,UACD;;;AAIP,SAAS,WACP,WACA,OACA,OACA,OACA,aACA,WACuC;CACvC,IAAI,MAAM;AACV,MAAK,MAAM,gBAAgB,UAAU,WACnC,OAAM,iBACJ,cACA,KACA,OACA,OACA,aACA,UACD;AAEH,QAAO;;AAGT,SAAS,UACP,WACA,OACA,OACA,OACA,aACA,WACuC;CACvC,MAAM,qBAAqB,UAAU,WAAW,QAC9C,MAAK,EAAE,SAAS,wBAAwB,sBAAsB,EAAE,CACjE;AAED,KAAI,mBAAmB,WAAW,EAChC,QAAO;CAGT,MAAM,SAAS,IAAI,cAAc,MAAM;AACvC,OAAM,QAAQ,KAAK,OAAO;AAC1B,YAAW,OAAO,OAAO;CAEzB,MAAM,WAAoD,EAAE;AAC5D,MAAK,MAAM,gBAAgB,oBAAoB;EAC7C,MAAM,SAAS,iBACb,cACA,QACA,OACA,OACA,aACA,UACD;AACD,WAAS,KAAK,OAAO;AACrB,SAAO,UAAU,OAAO;;CAG1B,MAAM,QAAQ,IAAI,aAAa,SAAS;AACxC,OAAM,OAAO,KAAK,MAAM;AACxB,MAAK,MAAM,UAAU,SACnB,YAAW,QAAQ,MAAM;AAG3B,QAAO;;AAGT,SAAS,0BACP,WACA,OACA,OACA,OACA,aACA,WACuC;CACvC,MAAM,EAAC,YAAW;CAClB,MAAM,aAAa,QAAQ,SAAS;CAMpC,MAAM,mBAJc,MAAM,UAAU,WAAW,GAC3C,MAAM,UAAU,WAAW,GAC3B,MAAM,UAAU,YAAY,MAAM,EAEF,QAClC,QAAQ,SAAS,WAAW,EAAE,EAC9B,QAAQ,SAAS,OACjB,OACA,KAAA,GACA,UAAU,OAAO,WAAW,IAAI,KAAA,EACjC;AACD,OAAM,YAAY,KAAK,gBAAgB;CAEvC,IAAI,WAAwB;AAC5B,KAAI,QAAQ,SAAS,MACnB,YAAW,iBACT,QAAQ,SAAS,OACjB,UACA,OACA,OACA,YACA,UACD;CAGH,MAAM,mBAAmB,kBACvB,QAAQ,YAAY,aACpB,YACD;CACD,MAAM,kBAAkB,kBACtB,QAAQ,YAAY,YACpB,WACD;CAED,MAAM,SAAS,WAAW;AAC1B,WAAU,gBAAgB;CAG1B,MAAM,cAAc,UAAU,OAAO;CACrC,MAAM,aAAa,UAAU;CAE7B,IAAI;CACJ,IAAI;AAEJ,KAAI,aAAa;AAEf,cAAY;AACZ,gBAAc;YACL,eAAe,MAAM;AAE9B,cAAY;AACZ,gBAAc;YACL,eAAe,OAAO;AAE/B,cAAY;AACZ,gBAAc;QACT;AAEL,cAAY;AACZ,gBAAc;;CAGhB,MAAM,OAAO,IAAI,YACf,OACA,UACA,kBACA,iBACA,WACA,QACA,YACD;AACD,OAAM,MAAM,KAAK,KAAK;AAEtB,YAAW,OAAO,KAAK;AACvB,YAAW,UAAU,KAAK;AAE1B,QAAO;;AAGT,SAAS,sBAAsB,WAA+B;AAC5D,KAAI,UAAU,SAAS,qBACrB,QAAO;AAET,KAAI,UAAU,SAAS,SAAS,UAAU,SAAS,KACjD,QAAO,UAAU,WAAW,KAAK,sBAAsB;AAGzD,QAAO;;AAGT,SAAS,kBACP,QACA,YACmB;AACnB,QAAO,OAAO,YAAY,OAAO,KAAI,UAAS,CAAC,OAAO,KAAA,EAAU,CAAC,CAAC;;AAGpE,SAAS,gBACP,OACA,cACA,IACM;AACN,MAAK,MAAM,WAAW,OAAO,OAAO,MAAM,SAAS,CACjD,iBAAgB,SAAS,cAAc,GAAG;AAE5C,OAAM,KAAK,KAAK,cAAc,GAAG;;AAGnC,SAAgB,UACd,KACA,OACA,cACA,IACK;CACL,MAAM,QAAQ,eAAe,KAAK,OAAO,KAAK;AAC9C,iBAAgB,OAAO,cAAc,GAAG;AACxC,QAAO,gBAAgB,KAAK,MAAM;;AAGpC,SAAS,iBACP,WACA,YACW;AACX,KAAI,UAAU,SAAS,SACrB,QAAO;AAGT,KAAI,UAAU,SAAS,sBAAsB;EAC3C,MAAM,SAAU,UACd;EAEF,MAAM,aAAa,WAAW,KAAA,KAAa,WAAW,IAAI,OAAO;AAEjE,SAAO;GACL,GAAG;GACH,MAAM;GACN,SAAS;IACP,GAAG,UAAU;IACb,UAAU;KACR,GAAG,UAAU,QAAQ;KACrB,OAAO,UAAU,QAAQ,SAAS,QAC9B,iBAAiB,UAAU,QAAQ,SAAS,OAAO,WAAW,GAC9D,KAAA;KACL;IACF;GACF;;AAGH,QAAO;EACL,GAAG;EACH,YAAY,UAAU,WAAW,KAAI,MAAK,iBAAiB,GAAG,WAAW,CAAC;EAC3E;;AAGH,SAAgB,gBAAgB,KAAU,OAAmB;CAC3D,MAAM,6BAAa,IAAI,KAAa;AACpC,MAAK,MAAM,QAAQ,MAAM,KAAK,MAC5B,KAAI,KAAK,SAAS,aAAa,KAAK,WAAW,KAAA,EAC7C,YAAW,IAAI,KAAK,OAAO;AAI/B,QAAO;EACL,GAAG;EACH,OAAO,IAAI,QAAQ,iBAAiB,IAAI,OAAO,WAAW,GAAG,KAAA;EAC7D,SAAS,IAAI,SAAS,KAAI,QAAO;GAC/B,MAAM,QAAQ,KACZ,IAAI,SAAS,OACb,mCACD;GACD,MAAM,UAAU,MAAM,SAAS;AAC/B,UAAO;IACL,GAAG;IACH,UAAU,UACN,gBAAgB,IAAI,UAAU,QAAQ,GACtC,IAAI;IACT;IACD;EACH"}