npm - @hockeymask/core - Versions diffs - 0.1.0 → 0.1.1 - Mend

@hockeymask/core 0.1.0 → 0.1.1

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (4) hide show

package/dist/index.mjs.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"index.mjs","names":["pad","SAMPLES","params","params","params","params","scalar","params","params","params","index","params","params","params","params","params","SCALAR","params","params","params","params","truncate","params","all","truncate","params","params","params","params"],"sources":["../src/connector.ts","../src/mapping/context.ts","../src/mapping/result.ts","../src/mapping/time.ts","../src/mapping/types.ts","../src/mapping/values.ts","../src/mapping/predicate.ts","../src/mapping/expect.ts","../src/mapping/nodes/def.ts","../src/mapping/nodes/aggregate.ts","../src/mapping/ops/def.ts","../src/mapping/document.ts","../src/mapping/nodes/assert.ts","../src/mapping/nodes/distinct.ts","../src/mapping/jsonschema.ts","../src/mapping/nodes/source.ts","../src/mapping/nodes/filter.ts","../src/mapping/nodes/join.ts","../src/mapping/ops/access.ts","../src/mapping/ops/convert.ts","../src/mapping/ops/date.ts","../src/mapping/ops/fn.ts","../src/mapping/ops/list.ts","../src/mapping/ops/lookup.ts","../src/mapping/ops/nulls.ts","../src/mapping/units.ts","../src/mapping/ops/numeric.ts","../src/mapping/ops/string.ts","../src/mapping/ops/when.ts","../src/mapping/ops/index.ts","../src/mapping/sugar.ts","../src/mapping/pipeline.ts","../src/mapping/nodes/map.ts","../src/mapping/nodes/metrics.ts","../src/mapping/nodes/sink.ts","../src/mapping/nodes/transform.ts","../src/mapping/nodes/union.ts","../src/mapping/nodes/index.ts","../src/mapping/graph.ts","../src/mapping/compile.ts","../src/mapping/execute.ts","../src/mapping/examples.ts","../src/mapping/check.ts","../src/mapping/edit.ts","../src/schema.ts"],"sourcesContent":["/*\n The contract every source connector fulfils: the brief's \"list tables, read column names\n * and types, sample rows\", plus a full `read` and a native `query`. Concrete connectors live\n * with the host that reaches its systems (the demo's NetSuite and Snowflake clients are in\n * apps/spherecast-api); the mapping engine only ever sees rows.\n \n Connectors decode the wire format (numbers sent as strings, dates as epoch days or in the\n * account's date format) but never interpret values: a NetSuite checkbox still arrives as\n * 'T' / 'F', a sentinel date still arrives as '9999-01-01'. Interpretation is the mapping's job.\n /\n\nimport type { Row, RowSet, Table, TableRef } from './schema'\n\nexport interface Connector {\n /* Name of the source system, e.g. \"NetSuite\"; becomes `source_system` on imported rows. /\n readonly system: string\n /* Language `query` accepts, e.g. \"suiteql\" or \"snowflake\". /\n readonly dialect: string\n listTables(): Promise<TableRef[]>\n describe(table: string): Promise<Table>\n sample(table: string, limit?: number): Promise<RowSet>\n read(table: string, options?: { batchSize?: number }): AsyncIterable<Row[]>\n query(sql: string, options?: { limit?: number }): Promise<RowSet>\n}\n\n/* The source rejected a request; the message is safe to show to the user. /\nexport class ConnectorError extends Error {\n override name = 'ConnectorError'\n}\n\n/* The source could not be reached at all (network, DNS, timeout). /\nexport class SourceUnavailable extends ConnectorError {\n override name = 'SourceUnavailable'\n}\n","/\n Contexts: the only channel through which a node or step learns anything not in its input\n * (arch.md, \"Contexts\"). They hold frozen data, never clocks, clients or handles.\n \n `RunContext` / `RecordContext` exist at sync time. `GraphEnv` (from the host) and\n * `RecordEnv` (built by the compiler) exist at compile time.\n /\n\nimport type { TargetSchema } from '../schema'\nimport type { Result, StepError } from './result'\nimport type { Instant } from './time'\nimport type { MType, RecordType } from './types'\nimport type { Json, Rec, Relation, Val } from './values'\n\nexport interface RunContext {\n /* Clock frozen at the start of the run. The only source of \"now\". /\n readonly now: Instant\n readonly tz: string\n readonly locale: string\n /* Every source, read once at run start and frozen, keyed by `source` node id. /\n readonly snapshot: Readonly<Record<string, Relation>>\n /* Named constants of the version. /\n readonly params: Readonly<Record<string, Json>>\n /* Static lookup tables of the version, for the `lookup` op. /\n readonly tables: Readonly<Record<string, Readonly<Record<string, Json>>>>\n readonly run: { readonly syncRunId: string; readonly mappingVersionId: string }\n}\n\nexport interface RecordContext extends RunContext {\n /* The record under mapping inside a `map` node. /\n readonly record: Rec\n}\n\n/* A reviewed, version-pinned record function for the `fn` op (escape hatch). /\nexport interface FnDef {\n /* Accepted input type; omitted means any. /\n readonly input?: MType\n readonly output: MType\n /* Whether it can return an error. Defaults to true. /\n readonly fallible?: boolean\n readonly run: (value: Val, ctx: RecordContext) => Result<Val, StepError>\n}\n\n/* A reviewed, version-pinned collection function for the `transform` node (escape hatch). /\nexport interface TransformDef {\n readonly run: (inputs: readonly Relation[], ctx: RunContext) => Result<Relation, string>\n}\n\n/* What the host supplies to compile a version. /\nexport interface GraphEnv {\n /* The internal model sinks write to; also the schema of `system: \"internal\"` sources. /\n readonly targets: TargetSchema\n readonly functions?: Readonly<Record<string, FnDef>>\n readonly transforms?: Readonly<Record<string, TransformDef>>\n}\n\n/* Compile-time view of a record scope: field pipelines, predicates. /\nexport interface RecordEnv {\n /* Type of the current record, against which `extract` and `path` are checked. /\n readonly record: RecordType\n readonly params: Readonly<Record<string, Json>>\n readonly tables: Readonly<Record<string, Readonly<Record<string, Json>>>>\n readonly functions: Readonly<Record<string, FnDef>>\n /* `each` nesting depth; capped at 1. /\n readonly depth: number\n /* Set when anything resolves against the run clock (`today`, `now`). /\n readonly clock: { used: boolean }\n}\n\n/* Type of a record field, or an error naming the missing field. /\nexport function fieldType(record: RecordType, path: string): Result<MType, string> {\n const type = Object.hasOwn(record.fields, path) ? record.fields[path] : undefined\n return type\n ? { ok: true, value: type }\n : {\n ok: false,\n error: `unknown field '${path}' (record has ${Object.keys(record.fields).join(', ') \|\| 'no fields'})`,\n }\n}\n\nexport function recordEnv(\n record: RecordType,\n from: Partial<Omit<RecordEnv, 'record'>> = {},\n): RecordEnv {\n return {\n record,\n params: from.params ?? {},\n tables: from.tables ?? {},\n functions: from.functions ?? {},\n depth: from.depth ?? 0,\n clock: from.clock ?? { used: false },\n }\n}\n","/\n Failure as a value. Steps, nodes and the compiler return `Result` instead of throwing, so\n * the executor can apply each node's failure policy (arch.md, \"Step signature\").\n /\n\nexport type Result<T, E> =\n \| { readonly ok: true; readonly value: T }\n \| { readonly ok: false; readonly error: E }\n\nexport function ok<T>(value: T): { readonly ok: true; readonly value: T } {\n return { ok: true, value }\n}\n\n/* The value of a result the caller has already checked, e.g. by `signature` before `run`. /\nexport function expectOk<T>(result: Result<T, unknown>): T {\n if (!result.ok) throw new Error(`unexpected failure: ${JSON.stringify(result.error)}`)\n return result.value\n}\n\nexport function err<E>(error: E): { readonly ok: false; readonly error: E } {\n return { ok: false, error }\n}\n\n/* What a failing record op reports. The pipeline adds the op and step, the map the node. /\nexport type ErrorCode =\n \| 'type_mismatch'\n \| 'parse_failed'\n \| 'unknown_unit'\n \| 'lookup_miss'\n \| 'required_null'\n \| 'domain_error'\n \| 'fn_failed'\n\nexport interface StepError {\n readonly code: ErrorCode\n readonly detail: string\n}\n\n/* A runtime failure located in the graph (arch.md `MappingError`). /\nexport interface MappingError extends StepError {\n readonly node: string\n readonly op: string\n readonly step?: number\n readonly key?: string\n}\n\nexport function stepError(code: ErrorCode, detail: string): { ok: false; error: StepError } {\n return err({ code, detail })\n}\n\n/* A problem found while checking a version, located as precisely as possible. /\nexport interface CompileIssue {\n readonly code: CompileCode\n readonly message: string\n readonly node?: string\n /* The `map` field key, aggregate field name, or expectation clause. /\n readonly field?: string\n /* Index of the step inside the field pipeline. /\n readonly step?: number\n}\n\nexport type CompileCode =\n \| 'invalid_params'\n \| 'unknown_op'\n \| 'type_error'\n \| 'duplicate_id'\n \| 'dangling_ref'\n \| 'missing_input'\n \| 'cycle'\n \| 'dead_node'\n \| 'missing_schema'\n \| 'duplicate_sink'\n \| 'skip_tolerance'\n \| 'missing_expectation'\n \| 'invalid_expectation'\n \| 'unknown_reference'\n \| 'example_failed'\n","/\n Dates without a wall clock.\n \n The runtime value of the `date` type is an `Instant`: a frozen point in time in epoch\n * milliseconds. Calendar math (\"+10y\", \"start of day\") happens in an IANA time zone, using\n * `Intl.DateTimeFormat` to move between instants and wall-clock time. \"now\" only ever comes\n * from the run context (arch.md limitation #10), never from `Date.now()`.\n /\n\nimport { err, ok, type Result } from './result'\n\nexport class Instant {\n private constructor(readonly epochMs: number) {\n Object.freeze(this)\n }\n\n static ofEpochMs(epochMs: number): Instant {\n if (!Number.isFinite(epochMs)) throw new RangeError(`invalid epoch milliseconds ${epochMs}`)\n return new Instant(epochMs)\n }\n\n /* Strict ISO 8601 with an offset or `Z`, e.g. `2026-10-04T12:00:00Z`. /\n static parse(iso: string): Instant \| undefined {\n if (!ISO_INSTANT.test(iso)) return undefined\n const ms = Date.parse(iso)\n return Number.isNaN(ms) ? undefined : new Instant(ms)\n }\n\n toISOString(): string {\n return new Date(this.epochMs).toISOString()\n }\n\n toJSON(): string {\n return this.toISOString()\n }\n\n toString(): string {\n return this.toISOString()\n }\n}\n\nconst ISO_INSTANT = /^\\d{4}-\\d{2}-\\d{2}T\\d{2}:\\d{2}(:\\d{2}(\\.\\d{1,3})?)?(Z\|[+-]\\d{2}:\\d{2})$/\n\n// --- time zones ---------------------------------------------------------------------------\n\n/* Wall-clock fields in some time zone. Months are 1-12. /\nexport interface WallClock {\n readonly year: number\n readonly month: number\n readonly day: number\n readonly hour: number\n readonly minute: number\n readonly second: number\n readonly ms: number\n}\n\nconst formatters = new Map<string, Intl.DateTimeFormat>()\n\nfunction formatter(tz: string): Intl.DateTimeFormat {\n let f = formatters.get(tz)\n if (!f) {\n f = new Intl.DateTimeFormat('en-US', {\n timeZone: tz,\n hourCycle: 'h23',\n year: 'numeric',\n month: 'numeric',\n day: 'numeric',\n hour: 'numeric',\n minute: 'numeric',\n second: 'numeric',\n })\n formatters.set(tz, f)\n }\n return f\n}\n\nexport function isTimeZone(tz: string): boolean {\n try {\n formatter(tz)\n return true\n } catch {\n return false\n }\n}\n\n/* The wall clock in `tz` at `instant`. /\nexport function toWallClock(instant: Instant, tz: string): WallClock {\n const parts: Record<string, number> = {}\n for (const p of formatter(tz).formatToParts(new Date(instant.epochMs))) {\n if (p.type !== 'literal') parts[p.type] = Number(p.value)\n }\n return {\n year: parts.year as number,\n month: parts.month as number,\n day: parts.day as number,\n hour: parts.hour as number,\n minute: parts.minute as number,\n second: parts.second as number,\n ms: ((instant.epochMs % 1000) + 1000) % 1000,\n }\n}\n\nfunction wallAsUtc(w: WallClock): number {\n // Date.UTC maps years 0-99 to 1900-1999; setUTCFullYear does not.\n const d = new Date(Date.UTC(2000, w.month - 1, w.day, w.hour, w.minute, w.second, w.ms))\n d.setUTCFullYear(w.year)\n return d.getTime()\n}\n\n/* Offset of `tz` from UTC at `epochMs`, in milliseconds. /\nfunction offsetAt(epochMs: number, tz: string): number {\n return wallAsUtc(toWallClock(Instant.ofEpochMs(epochMs), tz)) - epochMs\n}\n\n/\n The instant at which the wall clock in `tz` shows `w`. A wall time skipped by a DST\n * transition resolves after the gap; an ambiguous one resolves to the earlier instant.\n /\nexport function fromWallClock(w: WallClock, tz: string): Instant {\n const local = wallAsUtc(w)\n // The offsets in force a day before and a day after cover both sides of any transition.\n const before = offsetAt(local - 86_400_000, tz)\n const after = offsetAt(local + 86_400_000, tz)\n const shows = (c: number) => wallAsUtc(toWallClock(Instant.ofEpochMs(c), tz)) === local\n const candidates = [local - before, local - after].filter(shows)\n // Inside a gap neither matches: keep the earlier offset, which lands after the gap.\n return Instant.ofEpochMs(candidates.length > 0 ? Math.min(...candidates) : local - before)\n}\n\nexport function daysInMonth(year: number, month: number): number {\n if (month === 2) return (year % 4 === 0 && year % 100 !== 0) \|\| year % 400 === 0 ? 29 : 28\n return [4, 6, 9, 11].includes(month) ? 30 : 31\n}\n\n// --- calendar math --------------------------------------------------------------------------\n\nexport type DurationUnit = 'y' \| 'mo' \| 'w' \| 'd' \| 'h'\n\nexport interface Duration {\n readonly amount: number\n readonly unit: DurationUnit\n}\n\nconst DURATION_PART = /([+-])(\\d+)(y\|mo\|w\|d\|h)/gy\n\n/* `+10y`, `-30d`, `+1y-2mo`: one or more signed amounts. /\nexport function parseDuration(text: string): Result<readonly Duration[], string> {\n const parts: Duration[] = []\n DURATION_PART.lastIndex = 0\n let at = 0\n while (at < text.length) {\n DURATION_PART.lastIndex = at\n const m = DURATION_PART.exec(text)\n if (!m) return err(`invalid duration '${text}', expected e.g. '+10y' or '-30d'`)\n const [, sign, digits, unit] = m\n parts.push({ amount: Number(digits) (sign === '-' ? -1 : 1), unit: unit as DurationUnit })\n at = DURATION_PART.lastIndex\n }\n if (parts.length === 0) return err(`invalid duration '${text}', expected e.g. '+10y' or '-30d'`)\n return ok(parts)\n}\n\n/** A duration already validated by `parseDuration` (e.g. by a params schema). /\nexport function duration(text: string): readonly Duration[] {\n const parsed = parseDuration(text)\n if (!parsed.ok) throw new Error(parsed.error)\n return parsed.value\n}\n\n/* Shift by calendar units in `tz`. Month ends clamp: Feb 29 + 1y is Feb 28. /\nexport function shift(instant: Instant, by: readonly Duration[], tz: string): Instant {\n let current = instant\n for (const { amount, unit } of by) {\n if (unit === 'h') {\n current = Instant.ofEpochMs(current.epochMs + amount 3_600_000)\n continue\n }\n const w = toWallClock(current, tz)\n if (unit === 'y' \|\| unit === 'mo') {\n const months = w.year * 12 + (w.month - 1) + (unit === 'y' ? amount * 12 : amount)\n const year = Math.floor(months / 12)\n const month = (months % 12) + 1\n current = fromWallClock(\n { ...w, year, month, day: Math.min(w.day, daysInMonth(year, month)) },\n tz,\n )\n } else {\n const days = unit === 'w' ? amount * 7 : amount\n const d = new Date(wallAsUtc({ ...w, hour: 0, minute: 0, second: 0, ms: 0 }))\n d.setUTCDate(d.getUTCDate() + days)\n current = fromWallClock(\n { ...w, year: d.getUTCFullYear(), month: d.getUTCMonth() + 1, day: d.getUTCDate() },\n tz,\n )\n }\n }\n return current\n}\n\nexport type TruncateUnit = 'day' \| 'month' \| 'year'\n\n/** Start of the day, month or year containing `instant`, in `tz`. /\nexport function truncate(instant: Instant, unit: TruncateUnit, tz: string): Instant {\n const w = toWallClock(instant, tz)\n return fromWallClock(\n {\n year: w.year,\n month: unit === 'year' ? 1 : w.month,\n day: unit === 'day' ? w.day : 1,\n hour: 0,\n minute: 0,\n second: 0,\n ms: 0,\n },\n tz,\n )\n}\n\n// --- date expressions -------------------------------------------------------------------------\n\n/\n A comparison date in a predicate: `today` or `now` plus durations (resolved against the\n * run's frozen clock), or a literal ISO date or instant.\n /\nexport type DateExpr =\n \| {\n readonly kind: 'relative'\n readonly anchor: 'today' \| 'now'\n readonly by: readonly Duration[]\n }\n \| { readonly kind: 'date'; readonly wall: WallClock }\n \| { readonly kind: 'instant'; readonly instant: Instant }\n\nconst RELATIVE = /^(today\|now)(.)$/\n\nexport function parseDateExpr(text: string): Result<DateExpr, string> {\n const rel = RELATIVE.exec(text)\n if (rel) {\n const anchor = rel[1] as 'today' \| 'now'\n if (rel[2] === '') return ok({ kind: 'relative', anchor, by: [] })\n const by = parseDuration(rel[2] as string)\n return by.ok ? ok({ kind: 'relative', anchor, by: by.value }) : by\n }\n const wall = parseWithFormat(text, DATE_ONLY)\n if (wall) return ok({ kind: 'date', wall })\n const instant = Instant.parse(text)\n if (instant) return ok({ kind: 'instant', instant })\n return err(\n `invalid date '${text}', expected 'today+10y', 'now-1d', 'YYYY-MM-DD' or an ISO instant`,\n )\n}\n\n/** Whether the expression reads the run clock (fixtures must then pin `now`). /\nexport function usesClock(expr: DateExpr): boolean {\n return expr.kind === 'relative'\n}\n\nexport function resolveDateExpr(expr: DateExpr, clock: { now: Instant; tz: string }): Instant {\n switch (expr.kind) {\n case 'instant':\n return expr.instant\n case 'date':\n return fromWallClock(expr.wall, clock.tz)\n case 'relative': {\n const anchor = expr.anchor === 'today' ? truncate(clock.now, 'day', clock.tz) : clock.now\n return shift(anchor, expr.by, clock.tz)\n }\n }\n}\n\n// --- formats ------------------------------------------------------------------------------------\n\n/\n A date format: `iso`, `epoch_ms`, `epoch_s`, or a pattern of the tokens `YYYY MM DD HH mm ss`\n * with any other characters taken literally.\n /\nexport type DateFormat =\n \| { readonly kind: 'iso' }\n \| { readonly kind: 'epoch'; readonly unit: 'ms' \| 's' }\n \| { readonly kind: 'pattern'; readonly tokens: readonly string[]; readonly regex: RegExp }\n\nconst TOKENS = ['YYYY', 'MM', 'DD', 'HH', 'mm', 'ss'] as const\nconst TOKEN_SPLIT = /(YYYY\|MM\|DD\|HH\|mm\|ss)/\n\nexport function parseDateFormat(text: string): Result<DateFormat, string> {\n if (text === 'iso') return ok({ kind: 'iso' })\n if (text === 'epoch_ms') return ok({ kind: 'epoch', unit: 'ms' })\n if (text === 'epoch_s') return ok({ kind: 'epoch', unit: 's' })\n const tokens = text.split(TOKEN_SPLIT).filter((p) => p !== '')\n const used = tokens.filter((p) => (TOKENS as readonly string[]).includes(p))\n if (used.length === 0) return err(`date format '${text}' has none of ${TOKENS.join(' ')}`)\n if (new Set(used).size !== used.length) return err(`date format '${text}' repeats a token`)\n const source = tokens\n .map((p) => {\n if (p === 'YYYY') return '(\\\\d{4})'\n if ((TOKENS as readonly string[]).includes(p)) return '(\\\\d{2})'\n return p.replace(/[.+?^${}()\|[\\]\\\\]/g, '\\\\$&')\n })\n .join('')\n return ok({ kind: 'pattern', tokens, regex: new RegExp(`^${source}$`) })\n}\n\n/** A format already validated by `parseDateFormat` (e.g. by a params schema). /\nexport function dateFormat(text: string): DateFormat {\n const format = parseDateFormat(text)\n if (!format.ok) throw new Error(format.error)\n return format.value\n}\n\nconst DATE_ONLY = parseDateFormat('YYYY-MM-DD')\nconst DATE_TIME = parseDateFormat('YYYY-MM-DDTHH:mm:ss')\n\n/* Whether a pattern format names a full calendar date (needed to parse, not to format). /\nexport function hasFullDate(format: DateFormat): boolean {\n return format.kind !== 'pattern' \|\| ['YYYY', 'MM', 'DD'].every((x) => format.tokens.includes(x))\n}\n\nfunction parseWithFormat(text: string, format: Result<DateFormat, string>): WallClock \| undefined {\n if (!format.ok \|\| format.value.kind !== 'pattern') return undefined\n const m = format.value.regex.exec(text)\n if (!m) return undefined\n const fields: Record<string, number> = { YYYY: 1970, MM: 1, DD: 1, HH: 0, mm: 0, ss: 0 }\n let group = 1\n for (const token of format.value.tokens) {\n if ((TOKENS as readonly string[]).includes(token)) fields[token] = Number(m[group++])\n }\n const w: WallClock = {\n year: fields.YYYY as number,\n month: fields.MM as number,\n day: fields.DD as number,\n hour: fields.HH as number,\n minute: fields.mm as number,\n second: fields.ss as number,\n ms: 0,\n }\n const valid =\n w.month >= 1 &&\n w.month <= 12 &&\n w.day >= 1 &&\n w.day <= daysInMonth(w.year, w.month) &&\n w.hour <= 23 &&\n w.minute <= 59 &&\n w.second <= 59\n return valid ? w : undefined\n}\n\n/\n Parse a source value. Pattern and ISO strings without an offset are wall-clock times in\n * `tz`; epoch formats take a number or a numeric string. Undefined when it does not parse.\n /\nexport function parseDateValue(\n input: string \| number,\n format: DateFormat,\n tz: string,\n): Instant \| undefined {\n if (format.kind === 'epoch') {\n const n = typeof input === 'number' ? input : /^-?\\d+$/.test(input) ? Number(input) : Number.NaN\n return Number.isFinite(n) ? Instant.ofEpochMs(format.unit === 's' ? n 1000 : n) : undefined\n }\n if (typeof input !== 'string') return undefined\n if (format.kind === 'pattern') {\n const w = parseWithFormat(input, ok(format))\n return w && fromWallClock(w, tz)\n }\n const wall = parseWithFormat(input, DATE_ONLY) ?? parseWithFormat(input, DATE_TIME)\n return wall ? fromWallClock(wall, tz) : Instant.parse(input)\n}\n\nconst pad = (n: number, width = 2) => String(n).padStart(width, '0')\n\n/** Format an instant. `iso` is UTC (`...Z`); patterns and epoch formats as named. /\nexport function formatDate(instant: Instant, format: DateFormat, tz: string): string {\n if (format.kind === 'iso') return instant.toISOString()\n if (format.kind === 'epoch') {\n return String(format.unit === 's' ? Math.floor(instant.epochMs / 1000) : instant.epochMs)\n }\n const w = toWallClock(instant, tz)\n const values: Record<string, string> = {\n YYYY: pad(w.year, 4),\n MM: pad(w.month),\n DD: pad(w.day),\n HH: pad(w.hour),\n mm: pad(w.minute),\n ss: pad(w.second),\n }\n return format.tokens.map((p) => values[p] ?? p).join('')\n}\n\n/* `YYYY-MM-DD` of the instant in `tz`, how `date` target fields are written. /\nexport function toDateString(instant: Instant, tz: string): string {\n const w = toWallClock(instant, tz)\n return `${pad(w.year, 4)}-${pad(w.month)}-${pad(w.day)}`\n}\n","/\n The mapping language's type algebra (arch.md, \"Type algebra\").\n \n Nullability is part of the type, so the pipeline compiler (not each op) implements null\n * short-circuiting. `Rel` (a collection) is deliberately not an `MType`: a record field can be\n * a list, never a collection.\n \n Three kinds exist only for the checker: `unit` is the input of a pipeline's first step,\n * `unknown` is a value nothing is known about (top), and `never` is the bottom type, used for\n * the element of `[]` and, as `t.null = nullable(never)`, for a literal `null`.\n /\n\nimport type { LogicalType } from '../schema'\nimport { err, ok, type Result } from './result'\n\nexport type NonNull =\n \| { readonly kind: 'string' }\n \| { readonly kind: 'number' }\n \| { readonly kind: 'boolean' }\n \| { readonly kind: 'date' }\n \| { readonly kind: 'list'; readonly of: MType }\n \| { readonly kind: 'tuple'; readonly of: readonly MType[] }\n \| { readonly kind: 'record'; readonly fields: Readonly<Record<string, MType>> }\n \| { readonly kind: 'unit' }\n \| { readonly kind: 'unknown' }\n \| { readonly kind: 'never' }\n\nexport type NullableType = { readonly kind: 'nullable'; readonly of: NonNull }\n\nexport type MType = NonNull \| NullableType\n\nexport type RecordType = Extract<NonNull, { kind: 'record' }>\nexport type ListType = Extract<NonNull, { kind: 'list' }>\nexport type TupleType = Extract<NonNull, { kind: 'tuple' }>\n\n/* Type constructors. `t.nullable` flattens, so `nullable(nullable(x))` is `nullable(x)`. /\nexport const t = {\n string: { kind: 'string' },\n number: { kind: 'number' },\n boolean: { kind: 'boolean' },\n date: { kind: 'date' },\n unit: { kind: 'unit' },\n unknown: { kind: 'unknown' },\n never: { kind: 'never' },\n null: { kind: 'nullable', of: { kind: 'never' } },\n list: (of: MType): MType => ({ kind: 'list', of }),\n tuple: (of: readonly MType[]): MType => ({ kind: 'tuple', of }),\n record: (fields: Readonly<Record<string, MType>>): RecordType => ({ kind: 'record', fields }),\n nullable: (of: MType): MType => (of.kind === 'nullable' ? of : { kind: 'nullable', of }),\n} as const satisfies Record<string, MType \| ((...args: never[]) => MType)>\n\nexport function isNullable(type: MType): type is NullableType {\n return type.kind === 'nullable'\n}\n\n/* The type without its null. /\nexport function stripNull(type: MType): NonNull {\n return type.kind === 'nullable' ? type.of : type\n}\n\n/* Whether a value of this type can be null at runtime (`unknown` can be anything). /\nexport function mayBeNull(type: MType): boolean {\n return type.kind === 'nullable' \|\| type.kind === 'unknown'\n}\n\n/* `nullable(x)` when `when` is true, else `x`. /\nexport function nullableIf(type: MType, when: boolean): MType {\n return when ? t.nullable(type) : type\n}\n\n/* Human-readable form used in every type error: `number?`, `list<string>`, `(number, string)`. /\nexport function show(type: MType): string {\n switch (type.kind) {\n case 'nullable':\n return type.of.kind === 'never' ? 'null' : `${show(type.of)}?`\n case 'list':\n return `list<${show(type.of)}>`\n case 'tuple':\n return `(${type.of.map(show).join(', ')})`\n case 'record':\n return `{ ${Object.entries(type.fields)\n .map(([k, v]) => `${k}: ${show(v)}`)\n .join(', ')} }`\n case 'unit':\n return '()'\n default:\n return type.kind\n }\n}\n\nexport function equalTypes(a: MType, b: MType): boolean {\n return show(a) === show(b)\n}\n\n/* Can a value of type `from` be used where `to` is expected? /\nexport function assignable(from: MType, to: MType): boolean {\n if (to.kind === 'unknown') return true\n if (from.kind === 'never') return true\n if (from.kind === 'nullable') {\n return to.kind === 'nullable' && assignable(from.of, to.of)\n }\n if (to.kind === 'nullable') return assignable(from, to.of)\n switch (from.kind) {\n case 'list':\n return to.kind === 'list' && assignable(from.of, to.of)\n case 'tuple':\n return (\n to.kind === 'tuple' &&\n to.of.length === from.of.length &&\n from.of.every((f, i) => assignable(f, to.of[i] as MType))\n )\n case 'record':\n return (\n to.kind === 'record' &&\n Object.entries(to.fields).every(\n ([k, v]) => k in from.fields && assignable(from.fields[k] as MType, v),\n )\n )\n default:\n return from.kind === to.kind\n }\n}\n\nconst SCALAR_KINDS = new Set(['string', 'number', 'boolean', 'date'])\n\n/* Can values of these types be compared for equality (join keys, `eq`, `in`)? /\nexport function comparable(a: MType, b: MType): boolean {\n const x = stripNull(a)\n const y = stripNull(b)\n if (x.kind === 'unknown' \|\| y.kind === 'unknown') return true\n if (x.kind === 'never' \|\| y.kind === 'never') return true\n if (x.kind === 'list' && y.kind === 'list') return comparable(x.of, y.of)\n return SCALAR_KINDS.has(x.kind) && x.kind === y.kind\n}\n\n/* Can values of this type be ordered (`lt`, `min`, sorting)? /\nexport function orderable(type: MType): boolean {\n const kind = stripNull(type).kind\n return kind === 'number' \|\| kind === 'date' \|\| kind === 'string'\n}\n\n/\n The common type of two branches (`when` cases, `coalesce`, `union` inputs): equal modulo\n * nullability, nullable when either side is. `never` unifies with anything.\n /\nexport function unify(a: MType, b: MType): Result<MType, string> {\n const nullable = isNullable(a) \|\| isNullable(b)\n const x = stripNull(a)\n const y = stripNull(b)\n const base = unifyNonNull(x, y)\n if (!base.ok) return base\n return ok(nullableIf(base.value, nullable))\n}\n\nfunction unifyNonNull(x: NonNull, y: NonNull): Result<MType, string> {\n const mismatch = () => err(`${show(x)} and ${show(y)} have no common type`)\n if (x.kind === 'never') return ok(y)\n if (y.kind === 'never') return ok(x)\n if (x.kind === 'unknown' \|\| y.kind === 'unknown') return ok(t.unknown)\n if (x.kind === 'list' && y.kind === 'list') {\n const of = unify(x.of, y.of)\n return of.ok ? ok(t.list(of.value)) : mismatch()\n }\n if (x.kind === 'tuple' && y.kind === 'tuple') {\n if (x.of.length !== y.of.length) return mismatch()\n const of: MType[] = []\n for (const [i, a] of x.of.entries()) {\n const u = unify(a, y.of[i] as MType)\n if (!u.ok) return mismatch()\n of.push(u.value)\n }\n return ok(t.tuple(of))\n }\n if (x.kind === 'record' && y.kind === 'record') {\n const keys = Object.keys(x.fields)\n if (keys.length !== Object.keys(y.fields).length) return mismatch()\n const fields: Record<string, MType> = {}\n for (const k of keys) {\n const other = y.fields[k]\n if (!other) return mismatch()\n const u = unify(x.fields[k] as MType, other)\n if (!u.ok) return mismatch()\n fields[k] = u.value\n }\n return ok(t.record(fields))\n }\n return x.kind === y.kind ? ok(x) : mismatch()\n}\n\n/* Unify a non-empty list of types, left to right. /\nexport function unifyAll(types: readonly MType[]): Result<MType, string> {\n let acc: MType = t.never\n for (const type of types) {\n const u = unify(acc, type)\n if (!u.ok) return u\n acc = u.value\n }\n return ok(acc)\n}\n\n/* Static type of a JSON literal: `null` is `t.null`, `[]` is `list<never>`. /\nexport function typeOfJson(value: unknown): MType {\n if (value === null) return t.null\n switch (typeof value) {\n case 'string':\n return t.string\n case 'number':\n return t.number\n case 'boolean':\n return t.boolean\n }\n if (Array.isArray(value)) {\n const element = unifyAll(value.map(typeOfJson))\n return t.list(element.ok ? element.value : t.unknown)\n }\n if (typeof value === 'object') {\n return t.record(\n Object.fromEntries(Object.entries(value as object).map(([k, v]) => [k, typeOfJson(v)])),\n )\n }\n return t.unknown\n}\n\n/* A connector/target logical type as an `MType`. References are opaque ids. /\nexport function fromLogicalType(logical: LogicalType): NonNull {\n switch (logical) {\n case 'string':\n return t.string\n case 'integer':\n case 'decimal':\n return t.number\n case 'boolean':\n return t.boolean\n case 'date':\n case 'timestamp':\n return t.date\n default:\n return t.unknown\n }\n}\n\n/\n Parse a type name as written in `assert_type`: `string`, `number`, `boolean`, `date`,\n * `list<T>`, and a trailing `?` for nullable.\n /\nexport function parseTypeName(text: string): Result<MType, string> {\n const source = text.replace(/\\s+/g, '')\n const parse = (s: string): MType \| undefined => {\n if (s.endsWith('?')) {\n const inner = parse(s.slice(0, -1))\n return inner && inner.kind !== 'nullable' ? t.nullable(inner) : undefined\n }\n if (s.startsWith('list<') && s.endsWith('>')) {\n const inner = parse(s.slice(5, -1))\n return inner && t.list(inner)\n }\n switch (s) {\n case 'string':\n return t.string\n case 'number':\n return t.number\n case 'boolean':\n return t.boolean\n case 'date':\n return t.date\n default:\n return undefined\n }\n }\n const type = parse(source)\n return type ? ok(type) : err(`unknown type '${text}'`)\n}\n\n/* A type name already validated by `parseTypeName` (e.g. by a params schema). /\nexport function typeName(text: string): MType {\n const type = parseTypeName(text)\n if (!type.ok) throw new Error(type.error)\n return type.value\n}\n","/\n Runtime values and the relations that carry them.\n \n A record is a plain frozen-by-convention object; an absent key reads as null (that is how\n * `omit_if_null` and `skip_field` leave a field out of a write). Nothing here depends on\n * insertion order: hashing and sorting go through `canonicalKey` and `compareVals`, so two\n * runs over the same snapshot produce identical output (arch.md limitation #17).\n /\n\nimport { Instant } from './time'\n\nexport type Val =\n \| null\n \| string\n \| number\n \| boolean\n \| Instant\n \| readonly Val[]\n \| { readonly [key: string]: Val }\n\nexport type Rec = Readonly<Record<string, Val>>\n\n/* A collection: records of one record type, in no meaningful order. /\nexport type Relation = readonly Rec[]\n\n/* JSON as stored in a version (params, tables, literals, fixtures). /\nexport type Json =\n \| null\n \| string\n \| number\n \| boolean\n \| readonly Json[]\n \| { readonly [key: string]: Json }\n\n/* Returned by a step to leave its field out of the record entirely (`omit_if_null`). /\nexport const OMIT: unique symbol = Symbol('omit')\nexport type Omitted = typeof OMIT\n\nexport function isRecordVal(v: Val): v is { readonly [key: string]: Val } {\n return typeof v === 'object' && v !== null && !Array.isArray(v) && !(v instanceof Instant)\n}\n\n/* A string that is equal for equal values, used for hashing (joins, distinct, union, groups). /\nexport function canonicalKey(v: Val): string {\n if (v === null) return 'n'\n switch (typeof v) {\n case 'string':\n return `s${JSON.stringify(v)}`\n case 'number':\n return `d${Object.is(v, -0) ? 0 : v}`\n case 'boolean':\n return v ? 't' : 'f'\n }\n if (v instanceof Instant) return `i${v.epochMs}`\n if (Array.isArray(v)) return `[${(v as readonly Val[]).map(canonicalKey).join(',')}]`\n const rec = v as { readonly [key: string]: Val }\n return `{${Object.keys(rec)\n .sort()\n .map((k) => `${JSON.stringify(k)}:${canonicalKey(rec[k] as Val)}`)\n .join(',')}}`\n}\n\n/* Canonical key of a tuple of fields of a record; absent fields count as null. /\nexport function keyOf(rec: Rec, fields: readonly string[]): string {\n return canonicalKey(fields.map((f) => rec[f] ?? null))\n}\n\nconst rank = (v: Val): number => {\n if (v === null) return 0\n switch (typeof v) {\n case 'boolean':\n return 1\n case 'number':\n return 2\n case 'string':\n return 3\n }\n if (v instanceof Instant) return 4\n return Array.isArray(v) ? 5 : 6\n}\n\n/\n A total order over values: null first, then booleans, numbers, strings (by UTF-16 code\n * unit, never locale), dates, lists (lexicographic), records (by canonical key).\n /\nexport function compareVals(a: Val, b: Val): number {\n const ra = rank(a)\n const rb = rank(b)\n if (ra !== rb) return ra - rb\n switch (ra) {\n case 0:\n return 0\n case 1:\n case 2:\n return Number(a) - Number(b)\n case 3:\n return a === b ? 0 : (a as string) < (b as string) ? -1 : 1\n case 4:\n return (a as Instant).epochMs - (b as Instant).epochMs\n case 5: {\n const x = a as readonly Val[]\n const y = b as readonly Val[]\n for (let i = 0; i < Math.min(x.length, y.length); i++) {\n const c = compareVals(x[i] as Val, y[i] as Val)\n if (c !== 0) return c\n }\n return x.length - y.length\n }\n default: {\n const x = canonicalKey(a)\n const y = canonicalKey(b)\n return x === y ? 0 : x < y ? -1 : 1\n }\n }\n}\n\nexport function valEquals(a: Val, b: Val): boolean {\n return compareVals(a, b) === 0\n}\n\n/* Values as JSON: dates become ISO strings. For fixtures, metrics and diagnostics. /\nexport function toJson(v: Val): Json {\n if (v instanceof Instant) return v.toISOString()\n if (Array.isArray(v)) return (v as readonly Val[]).map(toJson)\n if (isRecordVal(v)) return Object.fromEntries(Object.entries(v).map(([k, x]) => [k, toJson(x)]))\n return v as Json\n}\n\n/* Sort records by the values of `fields`, ties by whole-record canonical key. /\nexport function sortRecords(rows: readonly Rec[], fields: readonly string[]): Rec[] {\n return [...rows].sort((a, b) => {\n for (const f of fields) {\n const c = compareVals(a[f] ?? null, b[f] ?? null)\n if (c !== 0) return c\n }\n const x = canonicalKey(a)\n const y = canonicalKey(b)\n return x === y ? 0 : x < y ? -1 : 1\n })\n}\n","/\n The one predicate vocabulary (arch.md, \"Conditional\"), shared by `when`, `filter_list`,\n * the `filter` node, join `where`, aggregate `where`, and `rows` expectations.\n \n Shape: `{ path?, <predicate>: operand }` with exactly one predicate key, or a composition\n * `{ all: { of: [...] } }`, `{ any: { of: [...] } }`, `{ not: cond }`. Without `path` the\n * predicate tests the piped value. An operand is a literal, `{ ref: field }` or\n * `{ param: name }`.\n \n Null never compares: ordering and equality with a null side are false, `neq` and `not_in`\n * are their negations and so hold for null (arch.md L366).\n /\n\nimport { fieldType, type RecordEnv, type RunContext } from './context'\nimport { err, ok, type Result } from './result'\nimport { type DateExpr, Instant, parseDateExpr, resolveDateExpr, usesClock } from './time'\nimport { comparable, type MType, orderable, show, stripNull, t, typeOfJson } from './types'\nimport { compareVals, type Json, type Rec, type Val } from './values'\n\nexport type Test = (piped: Val, record: Rec, ctx: RunContext) => boolean\n\nconst COMPARISONS = ['eq', 'neq', 'lt', 'lte', 'gt', 'gte', 'before', 'after'] as const\nconst MEMBERSHIP = ['in', 'not_in'] as const\nconst PRESENCE = ['is_null', 'is_blank'] as const\nconst COMPOSITION = ['all', 'any', 'not'] as const\n\n/* Every predicate name; the `if_<name>` sugar is derived from the non-composite ones. /\nexport const PREDICATES = [\n ...COMPARISONS,\n ...MEMBERSHIP,\n 'matches',\n ...PRESENCE,\n ...COMPOSITION,\n] as const\nexport type PredicateName = (typeof PREDICATES)[number]\n\n/* Predicate JSON, loosely typed: validated by `compilePredicate`. /\nexport type Predicate = { readonly [key: string]: unknown }\n\nexport type Getter = (piped: Val, record: Rec, ctx: RunContext) => Val\n\nexport interface Operand {\n readonly type: MType\n readonly get: Getter\n}\n\n/\n Compile a predicate. `piped` is the type of the piped value, or undefined where there is\n * none (`filter`, join `where`, aggregate `where`), in which case `path` is required.\n /\nexport function compilePredicate(\n raw: unknown,\n env: RecordEnv,\n piped?: MType,\n): Result<Test, string> {\n if (typeof raw !== 'object' \|\| raw === null \|\| Array.isArray(raw)) {\n return err('a condition must be an object such as { \"eq\": 1 }')\n }\n const cond = raw as Predicate\n const keys = Object.keys(cond).filter((k) => k !== 'path')\n if (keys.length !== 1) {\n return err(\n `a condition needs exactly one predicate, got ${keys.length ? keys.join(', ') : 'none'}`,\n )\n }\n const name = keys[0] as string\n if (!(PREDICATES as readonly string[]).includes(name)) return err(`unknown predicate '${name}'`)\n const value = cond[name]\n\n if ((COMPOSITION as readonly string[]).includes(name)) {\n if ('path' in cond) return err(`'${name}' does not take a path; put paths on its conditions`)\n return compileComposition(name as (typeof COMPOSITION)[number], value, env, piped)\n }\n\n const subject = compileSubject(cond.path, env, piped)\n if (!subject.ok) return subject\n const { type, get } = subject.value\n const base = stripNull(type)\n\n switch (name) {\n case 'is_null':\n case 'is_blank': {\n if (typeof value !== 'boolean') return err(`'${name}' takes true or false`)\n if (name === 'is_blank' && base.kind !== 'string' && base.kind !== 'unknown') {\n return err(`is_blank applies to strings, not ${show(type)}`)\n }\n const blank =\n name === 'is_null'\n ? (v: Val) => v === null\n : (v: Val) => v === null \|\| (typeof v === 'string' && v.trim() === '')\n return ok((p, r, c) => blank(get(p, r, c)) === value)\n }\n case 'matches': {\n if (typeof value !== 'string') return err('matches takes a regular expression string')\n if (base.kind !== 'string' && base.kind !== 'unknown') {\n return err(`matches applies to strings, not ${show(type)}`)\n }\n const regex = compileRegex(value)\n if (!regex.ok) return regex\n const re = regex.value\n return ok((p, r, c) => {\n const v = get(p, r, c)\n return typeof v === 'string' && re.test(v)\n })\n }\n case 'in':\n case 'not_in': {\n const operand = compileOperand(value, env, base.kind === 'date')\n if (!operand.ok) return operand\n const listType = stripNull(operand.value.type)\n if (listType.kind !== 'list')\n return err(`'${name}' takes a list, got ${show(operand.value.type)}`)\n if (!comparable(type, listType.of)) {\n return err(`cannot test ${show(type)} for membership in ${show(listType)}`)\n }\n const list = operand.value.get\n const member: Test = (p, r, c) => {\n const v = get(p, r, c)\n const values = list(p, r, c)\n if (v === null \|\| !Array.isArray(values)) return false\n return (values as readonly Val[]).some((x) => x !== null && compareVals(v, x) === 0)\n }\n return ok(name === 'in' ? member : (p, r, c) => !member(p, r, c))\n }\n }\n\n // Comparisons.\n const isDate = name === 'before' \|\| name === 'after'\n if (isDate && base.kind !== 'date' && base.kind !== 'unknown') {\n return err(`'${name}' applies to dates, not ${show(type)}`)\n }\n if (!isDate && name !== 'eq' && name !== 'neq' && !orderable(base) && base.kind !== 'unknown') {\n return err(`'${name}' applies to numbers, strings and dates, not ${show(type)}`)\n }\n if (value === null) return err(`'${name}' cannot compare with null; use is_null`)\n const operand = compileOperand(value, env, base.kind === 'date' \|\| isDate)\n if (!operand.ok) return operand\n if (!comparable(type, operand.value.type)) {\n return err(`cannot compare ${show(type)} with ${show(operand.value.type)}`)\n }\n const other = operand.value.get\n const test = COMPARE[name as (typeof COMPARISONS)[number]]\n return ok((p, r, c) => {\n const a = get(p, r, c)\n const b = other(p, r, c)\n const holds = a !== null && b !== null && test(compareVals(a, b))\n return name === 'neq' ? !holds : holds\n })\n}\n\nconst COMPARE: Record<(typeof COMPARISONS)[number], (c: number) => boolean> = {\n eq: (c) => c === 0,\n neq: (c) => c === 0, // negated by the caller, so null sides make `neq` true\n lt: (c) => c < 0,\n lte: (c) => c <= 0,\n gt: (c) => c > 0,\n gte: (c) => c >= 0,\n before: (c) => c < 0,\n after: (c) => c > 0,\n}\n\nfunction compileComposition(\n name: (typeof COMPOSITION)[number],\n value: unknown,\n env: RecordEnv,\n piped: MType \| undefined,\n): Result<Test, string> {\n if (name === 'not') {\n const inner = compilePredicate(value, env, piped)\n if (!inner.ok) return inner\n const test = inner.value\n return ok((p, r, c) => !test(p, r, c))\n }\n const of = (value as { of?: unknown } \| null)?.of\n if (\n typeof value !== 'object' \|\|\n value === null \|\|\n Object.keys(value).length !== 1 \|\|\n !Array.isArray(of)\n ) {\n return err(`'${name}' takes { \"of\": [conditions] }`)\n }\n const tests: Test[] = []\n for (const [i, c] of of.entries()) {\n const compiled = compilePredicate(c, env, piped)\n if (!compiled.ok) return err(`${name}.of[${i}]: ${compiled.error}`)\n tests.push(compiled.value)\n }\n return ok(\n name === 'all'\n ? (p, r, c) => tests.every((x) => x(p, r, c))\n : (p, r, c) => tests.some((x) => x(p, r, c)),\n )\n}\n\nfunction compileSubject(\n path: unknown,\n env: RecordEnv,\n piped: MType \| undefined,\n): Result<{ type: MType; get: Getter }, string> {\n if (path !== undefined) {\n if (typeof path !== 'string') return err('path must be a field name')\n const type = fieldType(env.record, path)\n if (!type.ok) return type\n return ok({ type: type.value, get: (_p, r) => r[path] ?? null })\n }\n if (!piped \|\| piped.kind === 'unit') {\n return err('this condition has no piped value to test; give it a \"path\"')\n }\n return ok({ type: piped, get: (p) => p })\n}\n\n/* Literal, `{ ref }` or `{ param }`. Strings compared with a date are date expressions. /\nexport function compileOperand(\n value: unknown,\n env: RecordEnv,\n asDate: boolean,\n): Result<Operand, string> {\n if (typeof value === 'object' && value !== null && !Array.isArray(value)) {\n const keys = Object.keys(value)\n const o = value as { ref?: unknown; param?: unknown }\n if (keys.length === 1 && typeof o.ref === 'string') {\n const ref = o.ref\n const type = fieldType(env.record, ref)\n if (!type.ok) return type\n return ok({ type: type.value, get: (_p, r) => r[ref] ?? null })\n }\n if (keys.length === 1 && typeof o.param === 'string') {\n const name = o.param\n if (!Object.hasOwn(env.params, name)) return err(`unknown param '${name}'`)\n return literal(env.params[name] as Json, env, asDate)\n }\n return err('a comparison value is a literal, { \"ref\": field } or { \"param\": name }')\n }\n return literal(value as Json, env, asDate)\n}\n\nfunction literal(value: Json, env: RecordEnv, asDate: boolean): Result<Operand, string> {\n if (asDate && typeof value === 'string') {\n const expr = parseDateExpr(value)\n if (!expr.ok) return expr\n if (usesClock(expr.value)) env.clock.used = true\n return ok({ type: t.date, get: dateGetter(expr.value) })\n }\n if (asDate && Array.isArray(value) && value.every((v) => typeof v === 'string')) {\n const exprs: DateExpr[] = []\n for (const v of value as string[]) {\n const expr = parseDateExpr(v)\n if (!expr.ok) return expr\n if (usesClock(expr.value)) env.clock.used = true\n exprs.push(expr.value)\n }\n const getters = exprs.map(dateGetter)\n return ok({ type: t.list(t.date), get: (p, r, c) => getters.map((g) => g(p, r, c)) })\n }\n const constant = value as Val\n return ok({ type: typeOfJson(value), get: () => constant })\n}\n\n/* Resolve a date expression against the run clock, once per distinct clock. /\nfunction dateGetter(expr: DateExpr): Getter {\n let key = ''\n let cached: Instant = Instant.ofEpochMs(0)\n return (_p, _r, ctx) => {\n const k = `${ctx.now.epochMs}\|${ctx.tz}`\n if (k !== key) {\n cached = resolveDateExpr(expr, ctx)\n key = k\n }\n return cached\n }\n}\n\nexport function compileRegex(pattern: string): Result<RegExp, string> {\n try {\n return ok(new RegExp(pattern, 'u'))\n } catch (e) {\n return err(`invalid regular expression: ${(e as Error).message}`)\n }\n}\n\n/\n Fields a passing record is known to have non-null: `{ path, is_null: false }` at the top\n * level or inside `all`. The `filter` node narrows its output type with these.\n /\nexport function nonNullPaths(raw: unknown): string[] {\n if (typeof raw !== 'object' \|\| raw === null) return []\n const cond = raw as Predicate\n if (typeof cond.path === 'string' && cond.is_null === false) return [cond.path]\n const of = (cond.all as { of?: unknown } \| undefined)?.of\n return Array.isArray(of) ? of.flatMap(nonNullPaths) : []\n}\n","/\n Node expectations and the action building blocks (arch.md, \"Actions for expect and\n * assert\"), shared by the version's `expect` block and `assert` nodes.\n \n Every clause is detected on the node's raw output first; then `drop_rows` removes the\n * rows it names, then `set_null` / `set_default` repair the remaining violating rows. So\n * the order clauses are written in never matters. Every breach is reported as an issue,\n * whatever its action.\n /\n\nimport type { RecordEnv, RunContext } from './context'\nimport type { Action, ActionSpec, Bound, Clause, NodeExpectation } from './document'\nimport type { NodeIssue, NodeOutput, RunIssue } from './nodes/def'\nimport { compilePredicate, type Test } from './predicate'\nimport { err, ok, type Result } from './result'\nimport {\n assignable,\n comparable,\n type MType,\n type RecordType,\n show,\n stripNull,\n t,\n typeOfJson,\n} from './types'\nimport { type Json, keyOf, type Rec, type Relation, toJson, type Val } from './values'\n\ntype ActionName = 'alert' \| 'drop_rows' \| 'set_null' \| 'set_default' \| 'skip_downstream' \| 'stop'\n\nconst VALID: Readonly<Record<Clause \| 'acyclic', readonly ActionName[]>> = {\n count: ['alert', 'skip_downstream', 'stop'],\n unique: ['alert', 'drop_rows', 'skip_downstream', 'stop'],\n keyed: ['alert', 'skip_downstream', 'stop'],\n rows: ['alert', 'drop_rows', 'set_null', 'set_default', 'skip_downstream', 'stop'],\n acyclic: ['alert', 'skip_downstream', 'stop'],\n}\n\nexport function actionName(action: Action): ActionName {\n if (typeof action === 'string') return action\n return 'set_null' in action ? 'set_null' : 'set_default'\n}\n\n/* Precedence: a bound's own action, then the clause's, then `default`, then the plain spec. /\nexport function resolveAction(spec: ActionSpec \| undefined, clause: Clause, own?: Action): Action {\n if (own !== undefined) return own\n if (spec === undefined) return 'alert'\n if (typeof spec === 'string' \|\| 'set_null' in spec \|\| 'set_default' in spec) return spec as Action\n const keyed = spec as Partial<Record<Clause \| 'default', Action>>\n return keyed[clause] ?? keyed.default ?? 'alert'\n}\n\n/* Check an action fits its check and the output type; returns the repaired output type. /\nexport function checkAction(\n action: Action,\n check: Clause \| 'acyclic',\n output: NodeOutput,\n): Result<NodeOutput, string> {\n const name = actionName(action)\n if (!VALID[check].includes(name)) return err(`action ${name} does not apply to ${check}`)\n if (typeof action === 'string') return ok(output)\n const fields = 'set_null' in action ? action.set_null : Object.keys(action.set_default)\n const unknown = fields.filter((f) => !Object.hasOwn(output.type.fields, f))\n if (unknown.length) return err(`${name} names unknown fields: ${unknown.join(', ')}`)\n if ('set_default' in action) {\n for (const [f, v] of Object.entries(action.set_default)) {\n const type = output.type.fields[f] as MType\n if (v === null \|\| !assignable(typeOfJson(v), stripNull(type))) {\n return err(`set_default ${f}: ${JSON.stringify(v)} is not a ${show(stripNull(type))}`)\n }\n }\n return ok(output)\n }\n // set_null widens the repaired fields, so every consumer is checked against nulls there.\n const widened = { ...output.type.fields }\n for (const f of action.set_null) widened[f] = t.nullable(widened[f] as MType)\n return ok({ ...output, type: t.record(widened) })\n}\n\nexport interface Violation {\n readonly clause: string\n readonly action: Action\n readonly message: string\n readonly count: number\n readonly samples: readonly Json[]\n /* Positions of the violating rows, for row actions. /\n readonly rows?: readonly number[]\n}\n\nexport interface Outcome {\n readonly rows: Relation\n readonly changed: number\n readonly issues: readonly RunIssue[]\n readonly stop: boolean\n readonly skipDownstream: boolean\n}\n\n/* Apply the actions of the detected violations to `rows`, reporting each as an issue. /\nexport function applyViolations(\n node: string,\n code: string,\n rows: Relation,\n violations: readonly Violation[],\n): Outcome {\n const dropped = new Set<number>()\n for (const v of violations) {\n if (actionName(v.action) === 'drop_rows') for (const i of v.rows ?? []) dropped.add(i)\n }\n const patches = new Map<number, Record<string, Val>>()\n for (const v of violations) {\n if (typeof v.action === 'string') continue\n const patch: Record<string, Val> =\n 'set_null' in v.action\n ? Object.fromEntries(v.action.set_null.map((f) => [f, null]))\n : (v.action.set_default as Record<string, Val>)\n for (const i of v.rows ?? []) {\n if (!dropped.has(i)) patches.set(i, { ...patches.get(i), ...patch })\n }\n }\n const out: Rec[] = []\n for (const [i, row] of rows.entries()) {\n if (dropped.has(i)) continue\n const patch = patches.get(i)\n out.push(patch ? { ...row, ...patch } : row)\n }\n const affected = (v: Violation) =>\n actionName(v.action) === 'drop_rows'\n ? (v.rows ?? []).length\n : typeof v.action === 'string'\n ? undefined\n : (v.rows ?? []).filter((i) => !dropped.has(i)).length\n return {\n rows: out,\n changed: dropped.size + patches.size,\n stop: violations.some((v) => v.action === 'stop'),\n skipDownstream: violations.some((v) => v.action === 'skip_downstream'),\n issues: violations.map((v) => ({\n node,\n code,\n clause: v.clause,\n action: v.action,\n message: v.message,\n count: v.count,\n samples: v.samples,\n ...(affected(v) === undefined ? {} : { rowsAffected: affected(v) }),\n })),\n }\n}\n\nconst SAMPLES = 5\n\nexport function countViolation(\n count: number,\n bound: Bound & { readonly shiftRatio?: Bound },\n action: Action,\n baseline: number \| undefined,\n): Violation \| undefined {\n const problems: string[] = []\n if (bound.min !== undefined && count < bound.min)\n problems.push(`count ${count} below ${bound.min}`)\n if (bound.max !== undefined && count > bound.max)\n problems.push(`count ${count} above ${bound.max}`)\n const shift = bound.shiftRatio\n if (shift && baseline !== undefined && baseline > 0) {\n const ratio = count / baseline\n if (\n (shift.min !== undefined && ratio < shift.min) \|\|\n (shift.max !== undefined && ratio > shift.max)\n ) {\n problems.push(`count ${count} is ${ratio.toFixed(2)}x the baseline ${baseline}`)\n }\n }\n return problems.length\n ? { clause: 'count', action, message: problems.join('; '), count: 1, samples: [count] }\n : undefined\n}\n\nexport function uniqueViolation(\n rows: Relation,\n keys: readonly string[],\n action: Action,\n): Violation \| undefined {\n const groups = new Map<string, number[]>()\n for (const [i, row] of rows.entries()) {\n const k = keyOf(row, keys)\n const g = groups.get(k)\n if (g) g.push(i)\n else groups.set(k, [i])\n }\n const duplicates = [...groups.values()].filter((g) => g.length > 1)\n if (duplicates.length === 0) return undefined\n return {\n clause: 'unique',\n action,\n message: `${keys.join(', ')} not unique: ${duplicates.length} duplicated keys`,\n count: duplicates.length,\n samples: duplicates\n .slice(0, SAMPLES)\n .map((g) => keys.map((k) => toJson((rows[g[0] as number] as Rec)[k] ?? null))),\n rows: duplicates.flat(),\n }\n}\n\nexport function rowsViolation(\n rows: Relation,\n test: Test,\n ctx: RunContext,\n action: Action,\n): Violation \| undefined {\n const bad: number[] = []\n for (const [i, row] of rows.entries()) if (!test(null, row, ctx)) bad.push(i)\n if (bad.length === 0) return undefined\n return {\n clause: 'rows',\n action,\n message: `${bad.length} rows fail the row condition`,\n count: bad.length,\n samples: bad.slice(0, SAMPLES).map((i) => toJson(rows[i] as Rec)),\n rows: bad,\n }\n}\n\ntype Keyed = NonNullable<NodeExpectation['keyed']>\n\n/* A key with no row counts as 0, so it fails a positive `min` and passes any `max`. /\nexport function keyedViolations(\n rows: Relation,\n keyed: Keyed,\n spec: ActionSpec \| undefined,\n): Violation[] {\n const values = new Map<string, Val>()\n for (const row of rows) {\n const by = row[keyed.by] ?? null\n const k = typeof by === 'string' ? by : JSON.stringify(toJson(by))\n if (!values.has(k)) values.set(k, row[keyed.value] ?? null)\n }\n const out: Violation[] = []\n for (const [key, bound] of Object.entries(keyed.bounds)) {\n const raw = values.get(key)\n const value = typeof raw === 'number' ? raw : 0\n const low = bound.min !== undefined && value < bound.min\n const high = bound.max !== undefined && value > bound.max\n if (low \|\| high) {\n out.push({\n clause: 'keyed',\n action: resolveAction(spec, 'keyed', bound.onFail),\n message: `${keyed.by} ${key}: ${keyed.value} ${value} ${low ? `below ${bound.min}` : `above ${bound.max}`}`,\n count: 1,\n samples: [key],\n })\n }\n }\n return out\n}\n\nexport interface CheckOptions {\n /* Previous count of this node, for `count.shiftRatio`. /\n readonly baseline?: number\n /* Fixtures run at sample scale, so production `count` envelopes are skipped. /\n readonly skipCount?: boolean\n}\n\nexport type Checker = (rows: Relation, ctx: RunContext, options: CheckOptions) => Outcome\n\n/* Compile a node's `expect` entry against its output; returns the repaired output type. /\nexport function compileExpectation(\n node: string,\n exp: NodeExpectation,\n output: NodeOutput,\n renv: (record: RecordType) => RecordEnv,\n): Result<{ output: NodeOutput; check: Checker }, readonly NodeIssue[]> {\n const issues: NodeIssue[] = []\n const issue = (field: Clause, message: string) =>\n issues.push({ message, field, code: 'invalid_expectation' })\n let repaired = output\n const fields = output.type.fields\n const missing = (names: readonly string[]) => names.filter((f) => !Object.hasOwn(fields, f))\n\n for (const clause of ['count', 'unique', 'keyed', 'rows'] as const) {\n if (exp[clause] === undefined) continue\n const action = resolveAction(exp.onFail, clause)\n const checked = checkAction(action, clause, repaired)\n if (checked.ok) repaired = checked.value\n else issue(clause, checked.error)\n }\n if (exp.unique && missing(exp.unique).length) {\n issue('unique', `unknown fields: ${missing(exp.unique).join(', ')}`)\n }\n if (exp.keyed) {\n const keyed = exp.keyed\n if (missing([keyed.by, keyed.value]).length) {\n issue('keyed', `unknown fields: ${missing([keyed.by, keyed.value]).join(', ')}`)\n } else if (!comparable(fields[keyed.value] as MType, t.number)) {\n issue('keyed', `${keyed.value} must be a number`)\n }\n for (const bound of Object.values(keyed.bounds)) {\n if (bound.onFail === undefined) continue\n const checked = checkAction(bound.onFail, 'keyed', repaired)\n if (!checked.ok) issue('keyed', checked.error)\n }\n }\n let test: Test \| undefined\n if (exp.rows) {\n const compiled = compilePredicate(exp.rows.cond, renv(output.type))\n if (compiled.ok) test = compiled.value\n else issue('rows', compiled.error)\n }\n if (issues.length) return { ok: false, error: issues }\n\n const check: Checker = (rows, ctx, options) => {\n const violations: Violation[] = []\n const push = (v: Violation \| undefined) => v && violations.push(v)\n if (exp.count && !options.skipCount) {\n push(\n countViolation(\n rows.length,\n exp.count,\n resolveAction(exp.onFail, 'count'),\n options.baseline,\n ),\n )\n }\n if (exp.unique) push(uniqueViolation(rows, exp.unique, resolveAction(exp.onFail, 'unique')))\n if (exp.keyed) violations.push(...keyedViolations(rows, exp.keyed, exp.onFail))\n if (test) push(rowsViolation(rows, test, ctx, resolveAction(exp.onFail, 'rows')))\n return applyViolations(node, 'expectation', rows, violations)\n }\n return ok({ output: repaired, check })\n}\n","/\n Collection node definitions (arch.md, \"Node definition, collection scope\").\n \n A node definition compiles itself: from its params and the types of its inputs it returns\n * its output type and a closure, in one step, so type checking and compilation stay the same\n * pass. Nodes reference their inputs by id; `slots` say which params hold those ids, which is\n * all the graph utilities and the editor need to know about edges.\n /\n\nimport { z } from 'zod'\nimport type { GraphEnv, RecordEnv, RunContext } from '../context'\nimport type { Action, JsonSchema, MappingVersion, NodeExpectation } from '../document'\nimport type { CompileCode, Result } from '../result'\nimport type { MType, RecordType } from '../types'\nimport type { Json, Relation } from '../values'\n\n/* Where a field's value was produced, so a sink can blame the right `map` field. /\nexport interface Origin {\n readonly node: string\n readonly field: string\n /* The field may be absent from a record (`omit_if_null`, `on_error: skip_field`). /\n readonly omittable: boolean\n /* Type of the value when present; set exactly for omittable fields. /\n readonly present?: MType\n}\n\n/\n Compile-time output of a node: its record type plus per-field provenance. Invariants: every\n * field has an origin, and an omittable field is typed nullable (an absent field reads null).\n /\nexport interface NodeOutput {\n readonly type: RecordType\n readonly origins: Readonly<Record<string, Origin>>\n /* Can drop records on a failed field (limitation #20). /\n readonly canSkip?: boolean\n}\n\n/* An input slot: the param path that holds an upstream node id. /\nexport interface Slot {\n readonly id: string\n readonly label: string\n readonly path: readonly string[]\n /* Holds a list of ids (`union.inputs`). /\n readonly multiple?: boolean\n readonly optional?: boolean\n}\n\nexport type NodeCategory = 'source' \| 'transform' \| 'target' \| 'check'\n\n/* What a node definition sees while compiling. /\nexport interface NodeEnv {\n readonly id: string\n readonly graph: GraphEnv\n readonly version: Pick<\n MappingVersion,\n 'params' \| 'tables' \| 'expectedSchema' \| 'onError' \| 'expect'\n >\n /* This node's entry in the version's `expect` block. /\n readonly expect?: NodeExpectation\n readonly clock: { used: boolean }\n /* Output of an upstream node; the compiler only calls `compile` once all inputs exist. /\n input(id: string): NodeOutput\n recordEnv(record: RecordType): RecordEnv\n}\n\nexport interface NodeIssue {\n readonly message: string\n readonly code?: CompileCode\n /* Blame another node, e.g. the `map` that produced a field a sink rejects. /\n readonly node?: string\n readonly field?: string\n readonly step?: number\n}\n\n/* A problem found while running, reported on the run rather than failing it. /\nexport interface RunIssue {\n readonly node: string\n readonly code: string\n readonly message: string\n readonly field?: string\n readonly clause?: string\n readonly action?: Action\n readonly count?: number\n readonly rowsAffected?: number\n readonly samples?: readonly Json[]\n}\n\nexport interface SinkWrite {\n readonly sink: string\n readonly target: string\n /* Target paths of the upsert key. /\n readonly key: readonly string[]\n /* Rows by target path, sorted by key. Dates are `YYYY-MM-DD`, timestamps ISO. /\n readonly rows: readonly Readonly<Record<string, Json>>[]\n readonly write?: Readonly<Record<string, WritePolicy>>\n /\n Reference fields written as natural keys, by target path. The host resolves each value\n * (one field of `by`, or a list in `by` order) to the id of the `entity` row it names.\n /\n readonly refs?: Readonly<Record<string, SinkRef>>\n /\n The rows are the complete set of the target for the company (and source system, where\n * the identity has one): the host calls `synchronize_all(rows, scope)`, deleting rows not\n * written. Writes of one run go in one transaction, inserts parent-first and deletes\n * child-first (exclusions before the lanes they reference). A sink that does not write\n * (held, stopped, failed) deletes nothing.\n /\n readonly mode?: 'replace'\n}\n\nexport type WritePolicy = 'overwrite' \| 'fill_if_null' \| 'never'\n\nexport interface SinkRef {\n readonly entity: string\n readonly by: readonly string[]\n}\n\nexport interface Metric {\n readonly node: string\n readonly name: string\n readonly rows: readonly Readonly<Record<string, Json>>[]\n}\n\nexport interface NodeRun {\n readonly rows: Relation\n /* Records a `map` dropped under `skip_record`. /\n readonly skipped?: number\n /* Rows dropped or repaired by an action. /\n readonly changed?: number\n readonly issues?: readonly RunIssue[]\n readonly stop?: boolean\n readonly skipDownstream?: boolean\n readonly write?: SinkWrite\n readonly metric?: Metric\n}\n\nexport interface NodeFailure {\n readonly code: string\n readonly message: string\n /* Halts the run (`on_error: fail_sync`). /\n readonly stop?: boolean\n readonly issues?: readonly RunIssue[]\n readonly samples?: readonly Json[]\n}\n\nexport type Inputs = (id: string) => Relation\n\nexport interface RunOptions {\n /* Previous output count of this node, for `count.shiftRatio`. /\n readonly baseline?: number\n /* Fixture runs are sample-sized, so production `count` envelopes are skipped. /\n readonly skipCount?: boolean\n}\n\nexport interface CompiledNode {\n /* Null for a node without an output relation (`sink`); `metrics` types what it reports. /\n readonly output: NodeOutput \| null\n /* Target entities a sink writes (one sink per entity, structural rule 3). /\n readonly writes?: readonly string[]\n readonly run: (\n inputs: Inputs,\n ctx: RunContext,\n options?: RunOptions,\n ) => Result<NodeRun, NodeFailure>\n}\n\nexport interface NodeDef<P = unknown> {\n readonly op: string\n readonly label: string\n readonly category: NodeCategory\n readonly description: string\n readonly slots: readonly Slot[]\n /* Has an output edge. /\n readonly output: boolean\n /* Has an effect: a write, a metric, or a check. Every node must reach one. /\n readonly effect?: 'sink' \| 'metrics' \| 'check'\n /* Params a new node starts with in the editor. /\n readonly defaults: () => Record<string, unknown>\n /* Parses the node object without `id`, `op` and `label`. /\n readonly params: z.ZodType<P>\n /* Accepts `tolerate_skips` (limitation #20). /\n readonly toleratesSkips?: (params: P) => boolean\n readonly compile: (params: P, env: NodeEnv) => Result<CompiledNode, readonly NodeIssue[]>\n}\n\nexport function defineNode<P>(def: NodeDef<P>): NodeDef<P> {\n return def\n}\n\nexport const nodeId = z.string().min(1)\n\n/* Origins for fields a node produces itself. /\nexport function ownOrigins(node: string, type: RecordType): Record<string, Origin> {\n return Object.fromEntries(\n Object.keys(type.fields).map((field) => [field, { node, field, omittable: false }]),\n )\n}\n\n/* Shorthand for a single issue result. /\nexport function fail(message: string, extra: Omit<NodeIssue, 'message'> = {}) {\n return { ok: false as const, error: [{ message, ...extra }] as readonly NodeIssue[] }\n}\n\nexport type { JsonSchema }\n","/\n `aggregate`: one record per group of `group_by` (one record overall for `group_by: []`,\n * even on empty input). Every aggregation takes an optional `where`, making it a filtered\n * aggregate. Results never depend on input order: `sum` adds in sorted order, `collect_set`\n * is sorted, and `collect_list`, `first`, `last` require `order_by` (limitation #17).\n /\n\nimport { z } from 'zod'\nimport type { RunContext } from '../context'\nimport { compilePredicate, type Test } from '../predicate'\nimport { ok } from '../result'\nimport { type MType, orderable, type RecordType, show, stripNull, t } from '../types'\nimport {\n canonicalKey,\n compareVals,\n keyOf,\n type Rec,\n type Relation,\n sortRecords,\n type Val,\n} from '../values'\nimport { defineNode, type NodeEnv, nodeId, type NodeIssue, type Origin, ownOrigins } from './def'\n\nconst orderBy = z\n .array(\n z.union([\n z.string().min(1),\n z.strictObject({ path: z.string().min(1), desc: z.boolean().optional() }),\n ]),\n )\n .min(1)\n\nconst agg = z.strictObject({\n agg: z.enum([\n 'count',\n 'count_distinct',\n 'sum',\n 'min',\n 'max',\n 'collect_set',\n 'collect_list',\n 'first',\n 'last',\n 'any',\n 'all',\n ]),\n path: z.string().min(1).optional(),\n where: z.unknown().optional(),\n order_by: orderBy.optional(),\n cond: z.unknown().optional(),\n})\ntype Agg = z.infer<typeof agg>\n\nconst params = z.strictObject({\n in: nodeId,\n group_by: z.array(z.string().min(1)),\n fields: z\n .record(z.string().min(1), agg)\n .refine((f) => Object.keys(f).length > 0, 'needs at least one field'),\n tolerate_skips: z.boolean().optional(),\n})\n\nconst NEEDS_PATH = new Set([\n 'count_distinct',\n 'sum',\n 'min',\n 'max',\n 'collect_set',\n 'collect_list',\n 'first',\n 'last',\n])\nconst NEEDS_ORDER = new Set(['collect_list', 'first', 'last'])\nconst NEEDS_COND = new Set(['any', 'all'])\n\ntype Compute = (rows: Relation, ctx: RunContext) => Val\n\nfunction compileAgg(\n name: string,\n spec: Agg,\n input: RecordType,\n env: NodeEnv,\n): { type: MType; compute: Compute } \| NodeIssue {\n const issue = (message: string): NodeIssue => ({ message, field: name })\n const renv = env.recordEnv(input)\n if (NEEDS_PATH.has(spec.agg) !== (spec.path !== undefined)) {\n return issue(\n NEEDS_PATH.has(spec.agg) ? `${spec.agg} needs a path` : `${spec.agg} takes no path`,\n )\n }\n if (NEEDS_ORDER.has(spec.agg) !== (spec.order_by !== undefined)) {\n return issue(\n NEEDS_ORDER.has(spec.agg) ? `${spec.agg} needs order_by` : `${spec.agg} takes no order_by`,\n )\n }\n if (NEEDS_COND.has(spec.agg) !== (spec.cond !== undefined)) {\n return issue(\n NEEDS_COND.has(spec.agg) ? `${spec.agg} needs a cond` : `${spec.agg} takes no cond`,\n )\n }\n const path = spec.path\n const fieldType = path === undefined ? undefined : input.fields[path]\n if (path !== undefined && !fieldType) return issue(`unknown field '${path}'`)\n const order = (spec.order_by ?? []).map((o) =>\n typeof o === 'string' ? { path: o, desc: false } : { desc: false, ...o },\n )\n const unknownOrder = order.filter((o) => !Object.hasOwn(input.fields, o.path))\n if (unknownOrder.length)\n return issue(`order_by: unknown field '${(unknownOrder[0] as { path: string }).path}'`)\n\n let where: Test \| undefined\n if (spec.where !== undefined) {\n const w = compilePredicate(spec.where, renv)\n if (!w.ok) return issue(`where: ${w.error}`)\n where = w.value\n }\n let cond: Test \| undefined\n if (spec.cond !== undefined) {\n const c = compilePredicate(spec.cond, renv)\n if (!c.ok) return issue(`cond: ${c.error}`)\n cond = c.value\n }\n\n const values = (rows: Relation) => rows.map((r) => r[path as string] ?? null)\n const nonNull = (rows: Relation) => values(rows).filter((v) => v !== null)\n const sorted = (rows: Relation) =>\n [...rows].sort((a, b) => {\n for (const o of order) {\n const c = compareVals(a[o.path] ?? null, b[o.path] ?? null)\n if (c !== 0) return o.desc ? -c : c\n }\n return compareVals(canonicalKey(a), canonicalKey(b))\n })\n const base = fieldType ? stripNull(fieldType) : t.unknown\n\n let type: MType\n let compute: Compute\n switch (spec.agg) {\n case 'count':\n type = t.number\n compute = (rows) => rows.length\n break\n case 'count_distinct':\n type = t.number\n compute = (rows) => new Set(nonNull(rows).map(canonicalKey)).size\n break\n case 'sum':\n if (base.kind !== 'number')\n return issue(`sum needs a number field, ${path} is ${show(fieldType as MType)}`)\n type = t.nullable(t.number)\n compute = (rows) => {\n const xs = (nonNull(rows) as number[]).sort((a, b) => a - b)\n return xs.length === 0 ? null : xs.reduce((a, b) => a + b, 0)\n }\n break\n case 'min':\n case 'max': {\n if (!orderable(base))\n return issue(\n `${spec.agg} needs a number, string or date field, ${path} is ${show(fieldType as MType)}`,\n )\n type = t.nullable(base)\n const sign = spec.agg === 'min' ? 1 : -1\n compute = (rows) => nonNull(rows).sort((a, b) => sign compareVals(a, b))[0] ?? null\n break\n }\n case 'collect_set':\n type = t.list(base)\n compute = (rows) => {\n const seen = new Map<string, Val>()\n for (const v of nonNull(rows)) seen.set(canonicalKey(v), v)\n return [...seen.values()].sort(compareVals)\n }\n break\n case 'collect_list':\n type = t.list(fieldType as MType)\n compute = (rows) => sorted(rows).map((r) => r[path as string] ?? null)\n break\n case 'first':\n case 'last': {\n type = t.nullable(fieldType as MType)\n const pick = spec.agg === 'first' ? 0 : -1\n compute = (rows) => sorted(rows).at(pick)?.[path as string] ?? null\n break\n }\n default: {\n type = t.boolean\n const test = cond as Test\n compute =\n spec.agg === 'any'\n ? (rows, ctx) => rows.some((r) => test(null, r, ctx))\n : (rows, ctx) => rows.every((r) => test(null, r, ctx))\n }\n }\n if (where) {\n const w = where\n const inner = compute\n compute = (rows, ctx) =>\n inner(\n rows.filter((r) => w(null, r, ctx)),\n ctx,\n )\n }\n return { type, compute }\n}\n\nexport const aggregateNode = defineNode({\n op: 'aggregate',\n label: 'Aggregate',\n category: 'transform',\n description: 'One record per group, with counts, sums, sets and other aggregates.',\n slots: [{ id: 'in', label: 'In', path: ['in'] }],\n output: true,\n defaults: () => ({ in: '', group_by: [], fields: {} }),\n params,\n toleratesSkips: (p) => p.tolerate_skips === true,\n compile: (p, env) => {\n const input = env.input(p.in)\n const issues: NodeIssue[] = []\n const fields: Record<string, MType> = {}\n for (const g of p.group_by) {\n const type = input.type.fields[g]\n if (type) fields[g] = type\n else issues.push({ message: `group_by: unknown field '${g}'` })\n }\n const aggs: { name: string; compute: Compute }[] = []\n for (const [name, spec] of Object.entries(p.fields)) {\n if (p.group_by.includes(name)) {\n issues.push({ message: `'${name}' is both a group key and an aggregate`, field: name })\n continue\n }\n const compiled = compileAgg(name, spec, input.type, env)\n if ('message' in compiled) issues.push(compiled)\n else {\n fields[name] = compiled.type\n aggs.push({ name, compute: compiled.compute })\n }\n }\n if (issues.length) return { ok: false, error: issues }\n\n const type = t.record(fields)\n return ok({\n output: {\n type,\n origins: {\n ...ownOrigins(env.id, type),\n ...Object.fromEntries(p.group_by.map((g) => [g, input.origins[g] as Origin])),\n },\n },\n run: (inputs, ctx) => {\n const groups = new Map<string, Rec[]>()\n // `group_by: []` yields one record even for empty input.\n if (p.group_by.length === 0) groups.set(keyOf({}, []), [])\n for (const row of inputs(p.in)) {\n const k = keyOf(row, p.group_by)\n const g = groups.get(k)\n if (g) g.push(row)\n else groups.set(k, [row])\n }\n const rows: Rec[] = []\n for (const members of groups.values()) {\n const out: Record<string, Val> = {}\n const sample = members[0]\n for (const g of p.group_by) out[g] = (sample as Rec)[g] ?? null\n for (const a of aggs) out[a.name] = a.compute(members, ctx)\n rows.push(out)\n }\n return ok({ rows: sortRecords(rows, p.group_by) })\n },\n })\n },\n})\n","/*\n Record op definitions (arch.md, \"Op definition, record scope\").\n \n An op is a params schema, a type function and a curried implementation. `signature` is\n * the validator's half; `run` binds params once per compiled version and returns the\n * per-record step. With `nulls: 'propagate'` the pipeline compiler handles a null input, so\n * `run` never sees null and `signature` never sees a nullable type.\n /\n\nimport { z } from 'zod'\nimport type { RecordContext, RecordEnv } from '../context'\nimport { err, ok, type Result, type StepError } from '../result'\nimport type { MType } from '../types'\nimport type { Omitted, Val } from '../values'\n\nexport type StepResult = Result<Val \| Omitted, StepError>\n\nexport type Step = (input: Val, ctx: RecordContext) => StepResult\n\nexport interface OpDef<P = unknown> {\n readonly name: string\n /* Parses the step object without its `op` key. Unknown keys are rejected. /\n readonly params: z.ZodType<P>\n /* Who handles a null input: the compiler ('propagate') or this op ('consume'). /\n readonly nulls: 'propagate' \| 'consume'\n /\n What the op reads: 'value' (default) needs a piped value; 'none' starts a pipeline and\n * takes no piped input (`()` in arch.md signatures); 'any' accepts either (`when`).\n /\n readonly input?: 'value' \| 'none' \| 'any'\n /* Must be the last step (`omit_if_null`). /\n readonly terminal?: boolean\n /* Whether this op can return an error at runtime, given its params (limitation #20). /\n readonly fallible: (params: P, env: RecordEnv, input: MType) => boolean\n /* Output type for an input type; an error message when the input is not accepted. /\n readonly signature: (input: MType, params: P, env: RecordEnv) => Result<MType, string>\n /* Bind params once; `input` is the (null-stripped) input type `signature` accepted. /\n readonly run: (params: P, env: RecordEnv, input: MType) => Step\n}\n\n/* Identity function that keeps `P` inferred from the params schema. /\nexport function defineOp<P>(def: OpDef<P>): OpDef<P> {\n return def\n}\n\nexport const never = () => false\nexport const always = () => true\n\n/* Expect an exact non-null kind. /\nexport function expectKind(\n input: MType,\n kinds: readonly MType['kind'][],\n op: string,\n): Result<MType, string> {\n return kinds.includes(input.kind)\n ? ok(input)\n : err(`${op} expects ${kinds.join(' or ')}, got ${showKind(input)}`)\n}\n\nfunction showKind(input: MType): string {\n return input.kind === 'nullable'\n ? `${input.of.kind}?`\n : input.kind === 'unit'\n ? 'no input'\n : input.kind\n}\n\n/* JSON literal accepted in params. /\nexport const json: z.ZodType<import('../values').Json> = z.lazy(() =>\n z.union([\n z.string(),\n z.number(),\n z.boolean(),\n z.null(),\n z.array(json),\n z.record(z.string(), json),\n ]),\n)\n\n/* Strict object schema, so a typo'd param is an error rather than ignored. /\nexport const params = <S extends z.ZodRawShape>(shape: S) => z.strictObject(shape)\n","/\n The mapping document (arch.md, \"The mapping document\"): one version of a mapping, stored as\n * JSON. It carries the graph (`nodes`), the assumptions about each source (`expectedSchema`,\n * which is also the type environment), expectations about what nodes produce (`expect`),\n * named constants (`params`), lookup tables (`tables`) and fixtures (`examples`).\n \n Nodes are flat objects, `{ id, op, ...params }`, and reference their inputs by id; there is\n * no edge list. Node params are validated by the node's definition when the version compiles,\n * so a draft with a half-edited node still parses. `layout` is editor state only.\n /\n\nimport { z } from 'zod'\nimport { json } from './ops/def'\n\nexport const OnError = z.enum(['null', 'skip_field', 'skip_record', 'fail_sync'])\nexport type OnError = z.infer<typeof OnError>\n\nexport const Action = z.union([\n z.enum(['alert', 'drop_rows', 'skip_downstream', 'stop']),\n z.strictObject({ set_null: z.array(z.string().min(1)).min(1) }),\n z.strictObject({ set_default: z.record(z.string(), json) }),\n])\nexport type Action = z.infer<typeof Action>\n\nexport const CLAUSES = ['count', 'unique', 'keyed', 'rows'] as const\nexport type Clause = (typeof CLAUSES)[number]\n\n/* One action for every clause, or one per clause with a fallback. /\nexport const ActionSpec = z.union([\n Action,\n z.strictObject({\n default: Action.optional(),\n count: Action.optional(),\n unique: Action.optional(),\n keyed: Action.optional(),\n rows: Action.optional(),\n }),\n])\nexport type ActionSpec = z.infer<typeof ActionSpec>\n\nexport const Bound = z.strictObject({ min: z.number().optional(), max: z.number().optional() })\nexport type Bound = z.infer<typeof Bound>\n\nexport const NodeExpectation = z.strictObject({\n /* Absolute bounds, and drift relative to a baseline the host passes per run. /\n count: Bound.extend({ shiftRatio: Bound.optional() }).optional(),\n /* Fields whose combination must be unique in the node's output. /\n unique: z.array(z.string().min(1)).min(1).optional(),\n /* Bounds on individual rows of a small keyed relation, typically counters. /\n keyed: z\n .strictObject({\n by: z.string().min(1),\n value: z.string().min(1),\n bounds: z.record(z.string(), Bound.extend({ onFail: Action.optional() })),\n })\n .optional(),\n /* A predicate every row must satisfy. /\n rows: z.strictObject({ cond: z.unknown() }).optional(),\n onFail: ActionSpec.optional(),\n note: z.string().optional(),\n})\nexport type NodeExpectation = z.infer<typeof NodeExpectation>\n\nconst Rows = z.array(z.record(z.string(), json))\n\n/* A fixture: relations in, keyed by source node id; relations out, keyed by any node id. /\nexport const Example = z.strictObject({\n name: z.string().optional(),\n sources: z.record(z.string(), Rows).default({}),\n expect: z.record(z.string(), Rows).default({}),\n /* Frozen clock for the fixture run (ISO instant); required if the graph reads the clock. /\n now: z.string().optional(),\n tz: z.string().optional(),\n})\nexport type Example = z.infer<typeof Example>\n\nexport const NodeJson = z.looseObject({\n id: z.string().min(1),\n op: z.string().min(1),\n label: z.string().optional(),\n})\nexport type NodeJson = z.infer<typeof NodeJson>\n\nexport const Position = z.object({ x: z.number(), y: z.number() })\nexport type Position = z.infer<typeof Position>\n\n/* One JSON Schema document per source node, describing one record of that source. /\nexport const JsonSchema = z.record(z.string(), z.unknown())\nexport type JsonSchema = Readonly<Record<string, unknown>>\n\nexport const MappingVersion = z.object({\n id: z.string().min(1),\n name: z.string().optional(),\n version: z.number().int().min(1).default(1),\n status: z.enum(['draft', 'published']).default('draft'),\n /* Default `on_error` of `map` nodes; a node's own `on_error` overrides it. /\n onError: OnError.optional(),\n unknownFields: z.enum(['ignore', 'notify']).optional(),\n params: z.record(z.string(), json).default({}),\n tables: z.record(z.string(), z.record(z.string(), json)).default({}),\n expectedSchema: z.record(z.string(), JsonSchema).default({}),\n nodes: z.array(NodeJson).default([]),\n expect: z.record(z.string(), NodeExpectation).default({}),\n examples: z.array(Example).default([]),\n layout: z.record(z.string(), Position).optional(),\n})\nexport type MappingVersion = z.infer<typeof MappingVersion>\n/* A version as authored, before defaults are filled in. /\nexport type MappingVersionInput = z.input<typeof MappingVersion>\n\n/* Parse untrusted JSON into a version; throws a zod error with paths on failure. /\nexport function parseVersion(input: unknown): MappingVersion {\n return MappingVersion.parse(input)\n}\n\nexport function emptyVersion(id: string, name?: string): MappingVersion {\n return parseVersion(name === undefined ? { id } : { id, name })\n}\n\n/* JSON Schema of the mapping document, for tools and models that produce mappings. /\nexport function versionJsonSchema(): Record<string, unknown> {\n return z.toJSONSchema(MappingVersion, { io: 'input' }) as Record<string, unknown>\n}\n","/\n `assert`: a named built-in check on its `in` relation, which it passes through (repaired, if\n * the chosen action repairs rows), so it can guard a flow or end a branch. `on_fail` is one\n * of the expectation actions, `alert` by default.\n \n - `count`: `min` / `max` rows.\n * - `unique`: `keys` unique.\n * - `rows`: every row satisfies `cond`.\n * - `acyclic`: the edges `edge.from -> edge.to` of `in` contain no cycle. With `edge.key` the\n * edges belong to groups (an article's own routing graph) and each group is checked on its\n * own; with `per`, every distinct `per.key` of `per.in` is checked against all edges. Either\n * way a group's rows of `remove.in` are taken out first. Cycle detection is iterative, so\n * it is engine code rather than a composition of DAG nodes.\n /\n\nimport { z } from 'zod'\nimport type { RunContext } from '../context'\nimport { Action } from '../document'\nimport {\n applyViolations,\n checkAction,\n countViolation,\n rowsViolation,\n uniqueViolation,\n type Violation,\n} from '../expect'\nimport { compilePredicate, type Test } from '../predicate'\nimport { ok } from '../result'\nimport { comparable, type MType, show } from '../types'\nimport { canonicalKey, compareVals, type Json, type Relation, toJson, type Val } from '../values'\nimport { defineNode, type NodeEnv, nodeId, type NodeIssue, type NodeOutput } from './def'\n\nconst common = { in: nodeId, on_fail: Action.optional() }\n\nconst params = z.discriminatedUnion('check', [\n z.strictObject({\n ...common,\n check: z.literal('count'),\n min: z.number().optional(),\n max: z.number().optional(),\n }),\n z.strictObject({\n ...common,\n check: z.literal('unique'),\n keys: z.array(z.string().min(1)).min(1),\n }),\n z.strictObject({ ...common, check: z.literal('rows'), cond: z.unknown() }),\n z.strictObject({\n ...common,\n check: z.literal('acyclic'),\n edge: z.strictObject({\n from: z.string().min(1),\n to: z.string().min(1),\n key: z.string().min(1).optional(),\n }),\n per: z.strictObject({ in: nodeId, key: z.string().min(1) }).optional(),\n remove: z\n .strictObject({\n in: nodeId,\n key: z.string().min(1),\n from: z.string().min(1),\n to: z.string().min(1),\n where: z.unknown().optional(),\n })\n .optional(),\n }),\n])\ntype Params = z.infer<typeof params>\ntype Acyclic = Extract<Params, { check: 'acyclic' }>\n\n/* One cycle as a path (first node repeated at the end), or undefined. /\nexport function findCycle(edges: readonly (readonly [string, string])[]): string[] \| undefined {\n const next = new Map<string, string[]>()\n for (const [from, to] of edges) next.set(from, [...(next.get(from) ?? []), to])\n const state = new Map<string, 'open' \| 'done'>()\n const path: string[] = []\n const visit = (node: string): string[] \| undefined => {\n state.set(node, 'open')\n path.push(node)\n for (const to of next.get(node) ?? []) {\n if (state.get(to) === 'open') return [...path.slice(path.indexOf(to)), to]\n if (!state.has(to)) {\n const cycle = visit(to)\n if (cycle) return cycle\n }\n }\n path.pop()\n state.set(node, 'done')\n return undefined\n }\n for (const node of [...next.keys()].sort()) {\n if (state.has(node)) continue\n const cycle = visit(node)\n if (cycle) return cycle\n }\n return undefined\n}\n\nfunction fieldIssues(output: NodeOutput, fields: readonly string[], where: string): NodeIssue[] {\n return fields\n .filter((f) => !Object.hasOwn(output.type.fields, f))\n .map((f) => ({ message: `${where}: unknown field '${f}'` }))\n}\n\nfunction compileAcyclic(p: Acyclic, input: NodeOutput, env: NodeEnv) {\n const issues = fieldIssues(\n input,\n [p.edge.from, p.edge.to, ...(p.edge.key ? [p.edge.key] : [])],\n 'edge',\n )\n const edgeType = input.type.fields[p.edge.from]\n let removeWhere: Test \| undefined\n if (p.per) issues.push(...fieldIssues(env.input(p.per.in), [p.per.key], 'per'))\n // A group without edges cannot have a cycle, so per adds nothing to grouped edges.\n if (p.edge.key && p.per) issues.push({ message: 'edge.key groups the edges itself; drop per' })\n const groupType = p.edge.key\n ? input.type.fields[p.edge.key]\n : p.per && env.input(p.per.in).type.fields[p.per.key]\n if (p.remove) {\n if (!p.per && !p.edge.key) issues.push({ message: 'remove needs per or edge.key' })\n const removal = env.input(p.remove.in)\n issues.push(...fieldIssues(removal, [p.remove.key, p.remove.from, p.remove.to], 'remove'))\n const checks: [string, MType \| undefined, MType \| undefined][] = [\n [`remove.from`, removal.type.fields[p.remove.from], edgeType],\n [`remove.to`, removal.type.fields[p.remove.to], edgeType],\n [`remove.key`, removal.type.fields[p.remove.key], groupType],\n ]\n for (const [name, a, b] of checks) {\n if (a && b && !comparable(a, b)) issues.push({ message: `${name}: ${show(a)} vs ${show(b)}` })\n }\n if (p.remove.where !== undefined) {\n const w = compilePredicate(p.remove.where, env.recordEnv(removal.type))\n if (w.ok) removeWhere = w.value\n else issues.push({ message: `remove.where: ${w.error}` })\n }\n }\n const toType = input.type.fields[p.edge.to]\n if (edgeType && toType && !comparable(edgeType, toType)) {\n issues.push({ message: `edge: ${show(edgeType)} vs ${show(toType)}` })\n }\n return { issues, removeWhere }\n}\n\nconst str = (v: Val) => (typeof v === 'string' ? v : canonicalKey(v))\n\ntype Edge = readonly [string, string]\n\nfunction acyclicViolation(\n p: Acyclic,\n inputs: (id: string) => Relation,\n ctx: RunContext,\n removeWhere: Test \| undefined,\n action: Action,\n): Violation \| undefined {\n const keyed = p.edge.key\n const grouped = keyed !== undefined \|\| p.per !== undefined\n // Edges by canonical group key: by `edge.key`, or one set every group shares under null.\n const edgesOf = new Map<string, Map<string, Edge>>()\n const keys = new Map<string, Val>()\n for (const row of inputs(p.in)) {\n const from = row[p.edge.from] ?? null\n const to = row[p.edge.to] ?? null\n const k = keyed ? (row[keyed] ?? null) : null\n if (from === null \|\| to === null \|\| (keyed && k === null)) continue\n const g = canonicalKey(k)\n keys.set(g, k)\n const edges = edgesOf.get(g) ?? new Map<string, Edge>()\n edges.set(canonicalKey([from, to]), [str(from), str(to)])\n edgesOf.set(g, edges)\n }\n let groups: Val[] = [null]\n if (keyed) groups = [...keys.values()].sort(compareVals)\n else if (p.per) {\n const seen = new Map<string, Val>()\n for (const row of inputs(p.per.in)) {\n const k = row[p.per.key] ?? null\n if (k !== null) seen.set(canonicalKey(k), k)\n }\n groups = [...seen.values()].sort(compareVals)\n }\n const removals = new Map<string, Set<string>>()\n if (p.remove) {\n for (const row of inputs(p.remove.in)) {\n if (removeWhere && !removeWhere(null, row, ctx)) continue\n const g = canonicalKey(row[p.remove.key] ?? null)\n const set = removals.get(g) ?? new Set<string>()\n set.add(canonicalKey([row[p.remove.from] ?? null, row[p.remove.to] ?? null]))\n removals.set(g, set)\n }\n }\n // With shared edges most groups remove the same ones (often none), so cycles are cached\n // by removal set; a group with edges of its own is small and checked directly.\n const cache = new Map<string, string[] \| undefined>()\n const failing: Json[] = []\n let count = 0\n for (const g of groups) {\n const removed = removals.get(canonicalKey(g)) ?? new Set<string>()\n const edges = edgesOf.get(canonicalKey(keyed ? g : null)) ?? new Map<string, Edge>()\n const kept = () => [...edges].filter(([k]) => !removed.has(k)).map(([, e]) => e)\n let cycle: string[] \| undefined\n if (keyed) cycle = findCycle(kept())\n else {\n const signature = [...removed].sort().join('\|')\n if (!cache.has(signature)) cache.set(signature, findCycle(kept()))\n cycle = cache.get(signature)\n }\n if (cycle) {\n count += 1\n if (failing.length < 5) failing.push({ group: toJson(g), cycle })\n }\n }\n if (count === 0) return undefined\n const first = failing[0] as { group: Json; cycle: string[] }\n return {\n clause: 'acyclic',\n action,\n message: `${count} ${grouped ? 'groups have' : 'graph has'} a cycle, e.g. ${grouped ? `${typeof first.group === 'string' ? first.group : JSON.stringify(first.group)}: ` : ''}${first.cycle.join(' -> ')}`,\n count,\n samples: failing,\n }\n}\n\nexport const assertNode = defineNode({\n op: 'assert',\n label: 'Assert',\n category: 'check',\n description: 'A built-in check (count, unique, rows, acyclic) that passes its input through.',\n slots: [\n { id: 'in', label: 'In', path: ['in'] },\n { id: 'per', label: 'Per', path: ['per', 'in'], optional: true },\n { id: 'remove', label: 'Remove', path: ['remove', 'in'], optional: true },\n ],\n output: true,\n effect: 'check',\n defaults: () => ({ in: '', check: 'count' }),\n params,\n compile: (p: Params, env) => {\n const input = env.input(p.in)\n const action = p.on_fail ?? 'alert'\n const checked = checkAction(action, p.check, input)\n const issues: NodeIssue[] = checked.ok ? [] : [{ message: `on_fail: ${checked.error}` }]\n let test: Test \| undefined\n let removeWhere: Test \| undefined\n switch (p.check) {\n case 'unique':\n issues.push(...fieldIssues(input, p.keys, 'keys'))\n break\n case 'rows': {\n const compiled = compilePredicate(p.cond, env.recordEnv(input.type))\n if (compiled.ok) test = compiled.value\n else issues.push({ message: `cond: ${compiled.error}` })\n break\n }\n case 'acyclic': {\n const compiled = compileAcyclic(p, input, env)\n issues.push(...compiled.issues)\n removeWhere = compiled.removeWhere\n break\n }\n }\n if (!checked.ok \|\| issues.length > 0) return { ok: false, error: issues }\n\n return ok({\n output: checked.value,\n run: (inputs, ctx, options = {}) => {\n const rows = inputs(p.in)\n let violation: Violation \| undefined\n switch (p.check) {\n case 'count':\n violation = options.skipCount\n ? undefined\n : countViolation(rows.length, p, action, undefined)\n break\n case 'unique':\n violation = uniqueViolation(rows, p.keys, action)\n break\n case 'rows':\n violation = rowsViolation(rows, test as Test, ctx, action)\n break\n default:\n violation = acyclicViolation(p, inputs, ctx, removeWhere, action)\n }\n return ok(applyViolations(env.id, 'assert', rows, violation ? [violation] : []))\n },\n })\n },\n})\n","/* `distinct`: deduplicates on `keys` and projects to them. /\n\nimport { z } from 'zod'\nimport { ok } from '../result'\nimport { type MType, t } from '../types'\nimport { keyOf, type Rec, type Val } from '../values'\nimport { defineNode, fail, nodeId, type Origin } from './def'\n\nconst params = z.strictObject({ in: nodeId, keys: z.array(z.string().min(1)).min(1) })\n\nexport const distinctNode = defineNode({\n op: 'distinct',\n label: 'Distinct',\n category: 'transform',\n description: 'One record per distinct combination of the key fields.',\n slots: [{ id: 'in', label: 'In', path: ['in'] }],\n output: true,\n defaults: () => ({ in: '', keys: [] }),\n params,\n compile: (p, env) => {\n const input = env.input(p.in)\n const unknown = p.keys.filter((k) => !Object.hasOwn(input.type.fields, k))\n if (unknown.length) return fail(`unknown keys: ${unknown.join(', ')}`)\n const fields: Record<string, MType> = {}\n const origins: Record<string, Origin> = {}\n for (const k of p.keys) {\n fields[k] = input.type.fields[k] as MType\n origins[k] = input.origins[k] as Origin\n }\n return ok({\n output: { type: t.record(fields), origins },\n run: (inputs) => {\n const seen = new Set<string>()\n const rows: Rec[] = []\n for (const row of inputs(p.in)) {\n const k = keyOf(row, p.keys)\n if (seen.has(k)) continue\n seen.add(k)\n rows.push(Object.fromEntries(p.keys.map((f) => [f, (row[f] ?? null) as Val])))\n }\n return ok({ rows })\n },\n })\n },\n})\n","/\n `expectedSchema` as JSON Schema (arch.md, \"expectedSchema as JSON Schema\").\n \n The stored schema of a source is its type environment: `sourceRecordType` derives the\n * record type a `source` node emits. `format` stays a validation constraint, never a type: a\n * `{ \"type\": \"string\", \"format\": \"date\" }` field is a `string`, and `to_date` makes a date.\n \n Until per-record contract validation (Ajv) exists, `conformRows` is the runtime guard: it\n * projects rows onto the declared fields and checks every value against its declared type.\n /\n\nimport type { Column, LogicalType, Table, TargetEntity } from '../schema'\nimport type { JsonSchema } from './document'\nimport { err, ok, type Result } from './result'\nimport { Instant } from './time'\nimport { type MType, type NonNull, type RecordType, show, t } from './types'\nimport { isRecordVal, type Json, type Rec, type Val } from './values'\n\ntype Node = Readonly<Record<string, unknown>>\n\nconst DIALECT = 'https://json-schema.org/draft/2020-12/schema'\n\n/* The record type of a source's schema. Optional fields read as null, so are nullable. /\nexport function sourceRecordType(schema: JsonSchema): Result<RecordType, string> {\n const properties = schema.properties as Readonly<Record<string, Node>> \| undefined\n if (schema.type !== 'object' \|\| typeof properties !== 'object' \|\| properties === null) {\n return err(\n 'a source schema must describe one object record (\"type\": \"object\" with \"properties\")',\n )\n }\n const required = new Set(Array.isArray(schema.required) ? (schema.required as string[]) : [])\n const fields: Record<string, MType> = {}\n for (const [name, node] of Object.entries(properties)) {\n const type = toMType(node)\n fields[name] = required.has(name) ? type : t.nullable(type)\n }\n return ok(t.record(fields))\n}\n\nfunction toMType(node: Node): MType {\n const union = (node.anyOf ?? node.oneOf) as readonly Node[] \| undefined\n if (Array.isArray(union)) {\n const nonNull = union.filter((m) => m.type !== 'null')\n const inner = nonNull.length === 1 ? toMType(nonNull[0] as Node) : t.unknown\n return union.length > nonNull.length ? t.nullable(inner) : inner\n }\n if (Array.isArray(node.type)) {\n const types = node.type as readonly string[]\n const nonNull = types.filter((x) => x !== 'null')\n const inner = nonNull.length === 1 ? toMType({ ...node, type: nonNull[0] }) : t.unknown\n return nonNull.length < types.length ? t.nullable(inner) : inner\n }\n if (Array.isArray(node.enum)) {\n const kinds = new Set(\n (node.enum as readonly unknown[]).map((v) => (v === null ? 'null' : typeof v)),\n )\n const hasNull = kinds.delete('null')\n const inner: MType = kinds.size === 1 ? scalar([...kinds][0] as string) : t.unknown\n return hasNull ? t.nullable(inner) : inner\n }\n switch (node.type) {\n case 'string':\n case 'number':\n case 'boolean':\n return scalar(node.type)\n case 'integer':\n return t.number\n case 'array':\n return t.list(\n typeof node.items === 'object' && node.items ? toMType(node.items as Node) : t.unknown,\n )\n case 'object': {\n const props = (node.properties ?? {}) as Readonly<Record<string, Node>>\n return t.record(Object.fromEntries(Object.entries(props).map(([k, v]) => [k, toMType(v)])))\n }\n default:\n return t.unknown\n }\n}\n\nfunction scalar(kind: string): NonNull {\n switch (kind) {\n case 'string':\n return t.string\n case 'number':\n return t.number\n case 'boolean':\n return t.boolean\n default:\n return t.unknown\n }\n}\n\nfunction logicalSchema(logical: LogicalType): Record<string, Json> {\n switch (logical) {\n case 'string':\n return { type: 'string' }\n case 'integer':\n return { type: 'integer' }\n case 'decimal':\n return { type: 'number' }\n case 'boolean':\n return { type: 'boolean' }\n case 'date':\n return { type: 'string', format: 'date' }\n case 'timestamp':\n return { type: 'string', format: 'date-time' }\n default:\n return {}\n }\n}\n\nfunction fieldSchema(logical: LogicalType, nullable: boolean, description?: string \| null) {\n const base = logicalSchema(logical)\n const typed =\n nullable && typeof base.type === 'string' ? { ...base, type: [base.type, 'null'] } : base\n return description ? { ...typed, description } : typed\n}\n\nfunction objectSchema(\n id: string,\n fields: readonly {\n name: string\n logical: LogicalType\n nullable: boolean\n description?: string \| null\n }[],\n): JsonSchema {\n return {\n $schema: DIALECT,\n $id: id,\n type: 'object',\n required: fields.filter((f) => !f.nullable).map((f) => f.name),\n properties: Object.fromEntries(\n fields.map((f) => [f.name, fieldSchema(f.logical, f.nullable, f.description)]),\n ),\n additionalProperties: true,\n }\n}\n\n/* A starting `expectedSchema` for a source table, from what its connector describes. /\nexport function tableJsonSchema(table: Table, system?: string): JsonSchema {\n return objectSchema(\n system ? `${system}.${table.name}` : table.name,\n table.columns.map((c: Column) => ({\n name: c.name,\n logical: c.logicalType,\n nullable: c.nullable,\n description: c.description,\n })),\n )\n}\n\n/* The pinned schema of an internal entity read as a source (structural rule 4). /\nexport function entityJsonSchema(entity: TargetEntity): JsonSchema {\n return objectSchema(\n `internal.${entity.name}`,\n entity.fields.map((f) => ({\n name: f.name,\n logical: f.logicalType,\n nullable: f.nullable,\n description: f.description,\n })),\n )\n}\n\n/* Does a runtime value inhabit this type? /\nexport function conforms(value: Val, type: MType): boolean {\n if (value === null) return type.kind === 'nullable' \|\| type.kind === 'unknown'\n switch (type.kind) {\n case 'nullable':\n return conforms(value, type.of)\n case 'unknown':\n return true\n case 'string':\n return typeof value === 'string'\n case 'number':\n return typeof value === 'number' && Number.isFinite(value)\n case 'boolean':\n return typeof value === 'boolean'\n case 'date':\n return value instanceof Instant\n case 'list':\n return Array.isArray(value) && (value as readonly Val[]).every((v) => conforms(v, type.of))\n case 'tuple':\n return (\n Array.isArray(value) &&\n value.length === type.of.length &&\n type.of.every((x, i) => conforms((value as readonly Val[])[i] as Val, x))\n )\n case 'record':\n return (\n isRecordVal(value) &&\n Object.entries(type.fields).every(([k, v]) => conforms(value[k] ?? null, v))\n )\n default:\n return false\n }\n}\n\nexport interface FieldViolation {\n readonly field: string\n readonly expected: string\n readonly count: number\n /* Row positions of the first violations. /\n readonly samples: readonly number[]\n}\n\n/* Project rows onto the declared fields and check each value; one violation per field. /\nexport function conformRows(\n rows: readonly Readonly<Record<string, unknown>>[],\n type: RecordType,\n): { rows: Rec[]; violations: FieldViolation[] } {\n const fields = Object.entries(type.fields)\n const counts = new Map<string, { count: number; samples: number[] }>()\n const out: Rec[] = []\n for (const [i, row] of rows.entries()) {\n const rec: Record<string, Val> = {}\n for (const [name, fieldType] of fields) {\n const value = (row[name] ?? null) as Val\n if (!conforms(value, fieldType)) {\n const v = counts.get(name) ?? { count: 0, samples: [] }\n v.count += 1\n if (v.samples.length < 5) v.samples.push(i)\n counts.set(name, v)\n }\n rec[name] = value\n }\n out.push(rec)\n }\n return {\n rows: out,\n violations: [...counts].map(([field, v]) => ({\n field,\n expected: show(type.fields[field] as MType),\n ...v,\n })),\n }\n}\n","/\n `source`: one entity of an external or internal system, read once per run into the\n * snapshot. Its record type comes from the version's `expectedSchema` entry for this node.\n * Loading checks every value against that type; a violation fails the node, so nothing\n * downstream runs on data the version never claimed to handle.\n /\n\nimport { z } from 'zod'\nimport { conformRows, type FieldViolation, sourceRecordType } from '../jsonschema'\nimport { compilePredicate, nonNullPaths, type Test } from '../predicate'\nimport { err, ok, type Result } from '../result'\nimport { type MType, type RecordType, stripNull, t } from '../types'\nimport type { Rec, Relation } from '../values'\nimport {\n defineNode,\n fail,\n type NodeFailure,\n type NodeIssue,\n type NodeOutput,\n type Origin,\n ownOrigins,\n type RunIssue,\n} from './def'\n\nconst params = z.strictObject({\n system: z.string().min(1),\n entity: z.string().min(1),\n filter: z.unknown().optional(),\n})\n\n/\n Narrow the fields a passing filter guarantees are non-null (and so present). The condition\n * has compiled against `output`, so every path it names exists.\n /\nexport function narrow(output: NodeOutput, cond: unknown): NodeOutput {\n const fields = { ...output.type.fields }\n const origins = { ...output.origins }\n for (const path of nonNullPaths(cond)) {\n fields[path] = stripNull(fields[path] as MType)\n const origin = origins[path] as Origin\n origins[path] = { node: origin.node, field: origin.field, omittable: false }\n }\n return { ...output, type: t.record(fields), origins }\n}\n\n/* Shared by `source` and `transform`: conform rows, or fail with one issue per field. /\nexport function loadRows(\n node: string,\n rows: readonly Readonly<Record<string, unknown>>[],\n type: RecordType,\n): Result<Rec[], NodeFailure> {\n const loaded = conformRows(rows, type)\n if (loaded.violations.length === 0) return ok(loaded.rows)\n const issues: RunIssue[] = loaded.violations.map((v: FieldViolation) => ({\n node,\n code: 'schema_violation',\n field: v.field,\n message: `${v.field}: ${v.count} values are not ${v.expected}`,\n count: v.count,\n samples: v.samples,\n }))\n return err({\n code: 'schema_violation',\n message: `${loaded.violations.length} fields do not match the declared schema`,\n issues,\n })\n}\n\nexport const sourceNode = defineNode({\n op: 'source',\n label: 'Source',\n category: 'source',\n description: 'Reads one entity of a source system into the run snapshot.',\n slots: [],\n output: true,\n defaults: () => ({ system: '', entity: '' }),\n params,\n compile: (p, env) => {\n const schema = env.version.expectedSchema[env.id]\n if (!schema) {\n return fail(`no expectedSchema for source '${env.id}'`, { code: 'missing_schema' })\n }\n const declared = sourceRecordType(schema)\n if (!declared.ok) return fail(declared.error, { code: 'missing_schema' })\n const type = declared.value\n\n let test: Test \| undefined\n if (p.filter !== undefined) {\n const compiled = compilePredicate(p.filter, env.recordEnv(type))\n if (!compiled.ok)\n return { ok: false, error: [{ message: `filter: ${compiled.error}` }] as NodeIssue[] }\n test = compiled.value\n }\n const declaredOutput: NodeOutput = { type, origins: ownOrigins(env.id, type) }\n const output = test ? narrow(declaredOutput, p.filter) : declaredOutput\n\n return ok({\n output,\n run: (_inputs, ctx) => {\n const loaded = loadRows(env.id, ctx.snapshot[env.id] ?? [], type)\n if (!loaded.ok) return loaded\n const rows: Relation = test\n ? loaded.value.filter((r) => (test as Test)(null, r, ctx))\n : loaded.value\n return ok({ rows })\n },\n })\n },\n})\n","/\n `filter`: keeps records where the predicate holds. A `{ path, is_null: false }` condition\n * (alone or inside `all`) narrows that field to non-null in the output type.\n /\n\nimport { z } from 'zod'\nimport { compilePredicate } from '../predicate'\nimport { ok } from '../result'\nimport { defineNode, fail, nodeId } from './def'\nimport { narrow } from './source'\n\nconst params = z.strictObject({ in: nodeId, cond: z.unknown() })\n\nexport const filterNode = defineNode({\n op: 'filter',\n label: 'Filter',\n category: 'transform',\n description: 'Keeps the records where a condition holds.',\n slots: [{ id: 'in', label: 'In', path: ['in'] }],\n output: true,\n defaults: () => ({ in: '', cond: {} }),\n params,\n compile: (p, env) => {\n const input = env.input(p.in)\n const test = compilePredicate(p.cond, env.recordEnv(input.type))\n if (!test.ok) return fail(`cond: ${test.error}`)\n const cond = test.value\n return ok({\n output: narrow(input, p.cond),\n run: (inputs, ctx) => ok({ rows: inputs(p.in).filter((r) => cond(null, r, ctx)) }),\n })\n },\n})\n","/\n `join`: equi-join on key pairs plus an optional residual `where`, part of the match (as in\n * SQL `ON`). `left` makes every right field nullable; `semi` / `anti` keep left records with\n * at least one / no match and return the left schema.\n \n `select` picks and renames right fields; without it every right field is kept, a join key\n * with the same name on both sides merges, and any other collision is a save error. Null keys\n * never match.\n \n `cardinality` is declared and enforced while the hash table is built (limitation #16):\n * `n:1` right keys unique, `1:n` left keys unique, `1:1` both, `n:m` unrestricted but needs a\n * `count` expectation on this node.\n /\n\nimport { z } from 'zod'\nimport { compilePredicate, type Test } from '../predicate'\nimport { err, ok } from '../result'\nimport { comparable, type MType, show, t } from '../types'\nimport { type Json, keyOf, type Rec, type Relation, toJson, type Val } from '../values'\nimport { defineNode, nodeId, type NodeIssue, type Origin } from './def'\n\nconst params = z.strictObject({\n left: nodeId,\n right: nodeId,\n on: z.array(z.tuple([z.string().min(1), z.string().min(1)])).min(1),\n type: z.enum(['inner', 'left', 'semi', 'anti']).optional(),\n cardinality: z.enum(['1:1', 'n:1', '1:n', 'n:m']),\n select: z.record(z.string().min(1), z.string().min(1)).optional(),\n where: z.unknown().optional(),\n tolerate_skips: z.boolean().optional(),\n})\n\n/* Index of rows by key, skipping null keys; reports the first duplicate when `unique`. /\nfunction index(rows: Relation, keys: readonly string[], unique: boolean) {\n const byKey = new Map<string, Rec[]>()\n for (const row of rows) {\n if (keys.some((k) => (row[k] ?? null) === null)) continue\n const k = keyOf(row, keys)\n const bucket = byKey.get(k)\n if (!bucket) byKey.set(k, [row])\n else if (unique) return { duplicate: keys.map((f) => toJson(row[f] as Val)) }\n else bucket.push(row)\n }\n return { byKey }\n}\n\nexport const joinNode = defineNode({\n op: 'join',\n label: 'Join',\n category: 'transform',\n description: 'Combines two inputs on matching keys, with a declared cardinality.',\n slots: [\n { id: 'left', label: 'Left', path: ['left'] },\n { id: 'right', label: 'Right', path: ['right'] },\n ],\n output: true,\n defaults: () => ({ left: '', right: '', on: [], type: 'inner', cardinality: 'n:1' }),\n params,\n toleratesSkips: (p) => p.tolerate_skips === true,\n compile: (p, env) => {\n const left = env.input(p.left)\n const right = env.input(p.right)\n const kind = p.type ?? 'inner'\n const issues: NodeIssue[] = []\n\n for (const [lk, rk] of p.on) {\n const lt = left.type.fields[lk]\n const rt = right.type.fields[rk]\n if (!lt) issues.push({ message: `left has no field '${lk}'` })\n if (!rt) issues.push({ message: `right has no field '${rk}'` })\n if (lt && rt && !comparable(lt, rt)) {\n issues.push({ message: `join key ${lk}: ${show(lt)} vs ${rk}: ${show(rt)}` })\n }\n }\n if (p.cardinality === 'n:m' && env.expect?.count === undefined) {\n issues.push({\n message: \"an n:m join needs a count expectation in the version's expect block\",\n code: 'missing_expectation',\n })\n }\n\n // Right fields carried into the output: `select`ed and renamed, or all but merged keys.\n const carried: [string, string][] = []\n if (p.select) {\n for (const [from, to] of Object.entries(p.select)) {\n if (Object.hasOwn(right.type.fields, from)) carried.push([from, to])\n else issues.push({ message: `select: right has no field '${from}'` })\n }\n } else {\n const merged = new Set(p.on.filter(([l, r]) => l === r).map(([l]) => l))\n for (const name of Object.keys(right.type.fields))\n if (!merged.has(name)) carried.push([name, name])\n }\n const needsMerge = kind === 'inner' \|\| kind === 'left' \|\| p.where !== undefined\n const fields: Record<string, MType> = { ...left.type.fields }\n const origins: Record<string, Origin> = { ...left.origins }\n if (needsMerge) {\n for (const [from, to] of carried) {\n if (Object.hasOwn(fields, to)) {\n issues.push({ message: `field '${to}' exists on both sides; rename it with select` })\n continue\n }\n const type = right.type.fields[from] as MType\n fields[to] = kind === 'left' ? t.nullable(type) : type\n origins[to] =\n kind === 'left'\n ? { node: env.id, field: to, omittable: false }\n : (right.origins[from] as Origin)\n }\n }\n let where: Test \| undefined\n if (p.where !== undefined && issues.length === 0) {\n const compiled = compilePredicate(p.where, env.recordEnv(t.record(fields)))\n if (compiled.ok) where = compiled.value\n else issues.push({ message: `where: ${compiled.error}` })\n }\n if (issues.length) return { ok: false, error: issues }\n\n const leftKeys = p.on.map(([l]) => l)\n const rightKeys = p.on.map(([, r]) => r)\n const leftUnique = p.cardinality === '1:1' \|\| p.cardinality === '1:n'\n const rightUnique = p.cardinality === '1:1' \|\| p.cardinality === 'n:1'\n const nullRight = Object.fromEntries(carried.map(([, to]) => [to, null]))\n const project = (r: Rec): Rec => {\n const out: Record<string, Val> = {}\n for (const [from, to] of carried) out[to] = r[from] ?? null\n return out\n }\n const violated = (side: 'left' \| 'right', key: readonly Json[]) =>\n err({\n code: 'cardinality_violated',\n message: `${p.cardinality} join: ${side} key ${JSON.stringify(key)} is not unique`,\n samples: [key],\n })\n\n return ok({\n output: kind === 'inner' \|\| kind === 'left' ? { type: t.record(fields), origins } : left,\n run: (inputs, ctx) => {\n const lrows = inputs(p.left)\n const built = index(inputs(p.right), rightKeys, rightUnique)\n if (built.duplicate) return violated('right', built.duplicate)\n if (leftUnique) {\n const checked = index(lrows, leftKeys, true)\n if (checked.duplicate) return violated('left', checked.duplicate)\n }\n const byKey = built.byKey as Map<string, Rec[]>\n const rows: Rec[] = []\n for (const l of lrows) {\n const nullKey = leftKeys.some((k) => (l[k] ?? null) === null)\n const candidates = nullKey ? [] : (byKey.get(keyOf(l, leftKeys)) ?? [])\n const matches: Rec[] = []\n for (const r of candidates) {\n const merged = { ...l, ...project(r) }\n if (!where \|\| where(null, merged, ctx)) matches.push(merged)\n }\n if (kind === 'semi') {\n if (matches.length > 0) rows.push(l)\n } else if (kind === 'anti') {\n if (matches.length === 0) rows.push(l)\n } else if (matches.length > 0) rows.push(...matches)\n else if (kind === 'left') rows.push({ ...l, ...nullRight })\n }\n return ok({ rows })\n },\n })\n },\n})\n","/* Access ops, the pipeline entry points: `extract`, `const`, `coalesce`. /\n\nimport { z } from 'zod'\nimport { fieldType } from '../context'\nimport { ok, type Result } from '../result'\nimport { isNullable, type MType, stripNull, t, typeOfJson, unifyAll } from '../types'\nimport type { Val } from '../values'\nimport { defineOp, json, never, params } from './def'\n\n/* Reads one field of the current record, or a tuple of fields. A missing field is null. /\nexport const extract = defineOp({\n name: 'extract',\n params: params({ path: z.union([z.string().min(1), z.array(z.string().min(1)).min(1)]) }),\n nulls: 'consume',\n input: 'none',\n fallible: never,\n signature: (_input, p, env): Result<MType, string> => {\n if (typeof p.path === 'string') return fieldType(env.record, p.path)\n const types: MType[] = []\n for (const path of p.path) {\n const type = fieldType(env.record, path)\n if (!type.ok) return type\n types.push(type.value)\n }\n return ok(t.tuple(types))\n },\n run: (p) => {\n if (typeof p.path === 'string') {\n const path = p.path\n return (_input, ctx) => ok(ctx.record[path] ?? null)\n }\n const paths = p.path\n return (_input, ctx) => ok(paths.map((x) => ctx.record[x] ?? null))\n },\n})\n\n/* A literal value. /\nexport const constant = defineOp({\n name: 'const',\n params: params({ value: json }),\n nulls: 'consume',\n input: 'none',\n fallible: never,\n signature: (_input, p) => ok(typeOfJson(p.value)),\n run: (p) => {\n const value = p.value as Val\n return () => ok(value)\n },\n})\n\n/* The first non-null of several fields. Nullable only if every field is. /\nexport const coalesce = defineOp({\n name: 'coalesce',\n params: params({ paths: z.array(z.string().min(1)).min(2) }),\n nulls: 'consume',\n input: 'none',\n fallible: never,\n signature: (_input, p, env): Result<MType, string> => {\n const types: MType[] = []\n for (const path of p.paths) {\n const type = fieldType(env.record, path)\n if (!type.ok) return type\n types.push(type.value)\n }\n const common = unifyAll(types)\n if (!common.ok) return common\n return ok(types.every(isNullable) ? common.value : stripNull(common.value))\n },\n run: (p) => {\n const paths = p.paths\n return (_input, ctx) => {\n for (const path of paths) {\n const v = ctx.record[path] ?? null\n if (v !== null) return ok(v)\n }\n return ok(null)\n }\n },\n})\n","/* Type conversion: `to_number`, `to_string`, `to_bool`, `to_date`, `assert_type`. /\n\nimport { z } from 'zod'\nimport { err, ok, stepError } from '../result'\nimport {\n dateFormat,\n formatDate,\n hasFullDate,\n type Instant,\n isTimeZone,\n parseDateValue,\n parseDateFormat,\n} from '../time'\nimport { assignable, parseTypeName, show, t, typeName } from '../types'\nimport { toJson, type Val } from '../values'\nimport { defineOp, expectKind, never, params } from './def'\n\nconst NUMBER = /^[+-]?(\\d+(\\.\\d)?\|\\.\\d+)([eE][+-]?\\d+)?$/\n\nconst dateFormatParam = z.string().superRefine((s, ctx) => {\n const f = parseDateFormat(s)\n if (!f.ok) ctx.addIssue({ code: 'custom', message: f.error })\n})\n\nconst timeZone = z.string().refine(isTimeZone, 'unknown time zone')\n\n/** Parses a number from a string (a boolean gives 1 or 0). Strict raises, else null. /\nexport const toNumber = defineOp({\n name: 'to_number',\n params: params({ strict: z.boolean().optional() }),\n nulls: 'propagate',\n fallible: (p) => p.strict === true,\n signature: (input, p) => {\n const s = expectKind(input, ['string', 'boolean'], 'to_number')\n if (!s.ok) return s\n return ok(input.kind === 'boolean' \|\| p.strict ? t.number : t.nullable(t.number))\n },\n run: (p) => (input) => {\n if (typeof input === 'boolean') return ok(input ? 1 : 0)\n const text = (input as string).trim()\n if (NUMBER.test(text)) return ok(Number(text))\n return p.strict ? stepError('parse_failed', `'${input as string}' is not a number`) : ok(null)\n },\n})\n\n/* Canonical string form. `format` applies to dates, in the run time zone. /\nexport const toString = defineOp({\n name: 'to_string',\n params: params({ format: dateFormatParam.optional() }),\n nulls: 'propagate',\n fallible: never,\n signature: (input, p) => {\n if (input.kind === 'unknown') return err('to_string needs a known input type')\n if (p.format !== undefined && input.kind !== 'date') {\n return err('to_string format applies to dates only')\n }\n return ok(t.string)\n },\n run: (p, _env, input) => {\n if (input.kind === 'date') {\n const format = dateFormat(p.format ?? 'iso')\n return (v, ctx) => ok(formatDate(v as Instant, format, ctx.tz))\n }\n return (v) => ok(stringify(v))\n },\n})\n\nfunction stringify(v: Val): string {\n if (typeof v === 'string') return v\n if (typeof v === 'number' \|\| typeof v === 'boolean') return String(v)\n return JSON.stringify(toJson(v))\n}\n\nconst TRUE_VALUES = ['true', '1']\nconst FALSE_VALUES = ['false', '0']\n\n/* Explicit truthiness: only the listed values convert, anything else is an error. /\nexport const toBool = defineOp({\n name: 'to_bool',\n params: params({\n true_values: z.array(z.string()).min(1).optional(),\n false_values: z.array(z.string()).min(1).optional(),\n }).refine(\n (p) =>\n !(p.true_values ?? TRUE_VALUES).some((v) => (p.false_values ?? FALSE_VALUES).includes(v)),\n 'true_values and false_values overlap',\n ),\n nulls: 'propagate',\n fallible: () => true,\n signature: (input) => {\n const s = expectKind(input, ['string', 'number'], 'to_bool')\n return s.ok ? ok(t.boolean) : s\n },\n run: (p) => {\n const yes = new Set(p.true_values ?? TRUE_VALUES)\n const no = new Set(p.false_values ?? FALSE_VALUES)\n return (input) => {\n const text = typeof input === 'number' ? String(input) : (input as string).trim()\n if (yes.has(text)) return ok(true)\n if (no.has(text)) return ok(false)\n return stepError('parse_failed', `'${text}' is not a listed boolean value`)\n }\n },\n})\n\n/\n Parses to an instant: `iso`, `epoch_ms`, `epoch_s`, or a `YYYY MM DD HH mm ss` pattern.\n * Wall-clock values are read in `tz`, by default the run's frozen time zone.\n /\nexport const toDate = defineOp({\n name: 'to_date',\n params: params({ format: dateFormatParam, tz: timeZone.optional() }).refine((p) => {\n const format = parseDateFormat(p.format)\n return !format.ok \|\| hasFullDate(format.value)\n }, 'to_date format needs YYYY, MM and DD'),\n nulls: 'propagate',\n fallible: () => true,\n signature: (input, p) => {\n const epoch = dateFormat(p.format).kind === 'epoch'\n const s = expectKind(input, epoch ? ['string', 'number'] : ['string'], 'to_date')\n return s.ok ? ok(t.date) : s\n },\n run: (p) => {\n const format = dateFormat(p.format)\n return (input, ctx) => {\n const instant = parseDateValue(input as string \| number, format, p.tz ?? ctx.tz)\n return instant\n ? ok(instant)\n : stepError(\n 'parse_failed',\n `'${String(input as string \| number)}' does not match date format ${p.format}`,\n )\n }\n },\n})\n\n/* A runtime no-op and a checkpoint for the validator: the input must have this type. /\nexport const assertType = defineOp({\n name: 'assert_type',\n params: params({\n type: z.string().superRefine((s, ctx) => {\n const parsed = parseTypeName(s)\n if (!parsed.ok) ctx.addIssue({ code: 'custom', message: parsed.error })\n }),\n }),\n nulls: 'propagate',\n fallible: never,\n signature: (input, p) => {\n const declared = typeName(p.type)\n return assignable(input, declared)\n ? ok(declared)\n : err(`expected ${p.type}, got ${show(input)}`)\n },\n run: () => (input) => ok(input),\n})\n","/\n Date ops: `format_date`, `shift_date`, `truncate_date`, `to_utc`. Calendar math happens in\n * the run's frozen time zone unless a `tz` is given.\n /\n\nimport { z } from 'zod'\nimport { ok } from '../result'\nimport {\n dateFormat,\n duration,\n formatDate,\n type Instant,\n isTimeZone,\n parseDateFormat,\n parseDuration,\n shift,\n truncate,\n} from '../time'\nimport { type MType, t } from '../types'\nimport { defineOp, expectKind, never, params } from './def'\n\nconst dateIn =\n (op: string, out: MType = t.date) =>\n (input: MType) => {\n const s = expectKind(input, ['date'], op)\n return s.ok ? ok(out) : s\n }\n\nexport const formatDateOp = defineOp({\n name: 'format_date',\n params: params({\n format: z.string().superRefine((s, ctx) => {\n const f = parseDateFormat(s)\n if (!f.ok) ctx.addIssue({ code: 'custom', message: f.error })\n }),\n tz: z.string().refine(isTimeZone, 'unknown time zone').optional(),\n }),\n nulls: 'propagate',\n fallible: never,\n signature: dateIn('format_date', t.string),\n run: (p) => {\n const format = dateFormat(p.format)\n return (input, ctx) => ok(formatDate(input as Instant, format, p.tz ?? ctx.tz))\n },\n})\n\n/* Shift by a duration such as `+10y` or `-30d`. /\nexport const shiftDate = defineOp({\n name: 'shift_date',\n params: params({\n by: z.string().superRefine((s, ctx) => {\n const d = parseDuration(s)\n if (!d.ok) ctx.addIssue({ code: 'custom', message: d.error })\n }),\n }),\n nulls: 'propagate',\n fallible: never,\n signature: dateIn('shift_date'),\n run: (p) => {\n const by = duration(p.by)\n return (input, ctx) => ok(shift(input as Instant, by, ctx.tz))\n },\n})\n\nexport const truncateDate = defineOp({\n name: 'truncate_date',\n params: params({ unit: z.enum(['day', 'month', 'year']) }),\n nulls: 'propagate',\n fallible: never,\n signature: dateIn('truncate_date'),\n run: (p) => (input, ctx) => ok(truncate(input as Instant, p.unit, ctx.tz)),\n})\n\n/* Instants carry no zone, so this is the identity; kept as an explicit normalisation step. /\nexport const toUtc = defineOp({\n name: 'to_utc',\n params: params({}),\n nulls: 'propagate',\n fallible: never,\n signature: dateIn('to_utc'),\n run: () => (input) => ok(input),\n})\n","/\n `fn`: the record-scope escape hatch. Calls a named, reviewed, version-pinned function the\n * host registers in `GraphEnv.functions`, with a declared input and output type.\n /\n\nimport { z } from 'zod'\nimport type { FnDef } from '../context'\nimport { err, ok } from '../result'\nimport { assignable, show } from '../types'\nimport { defineOp, params } from './def'\n\nexport const fn = defineOp({\n name: 'fn',\n params: params({ ref: z.string().min(1) }),\n nulls: 'consume',\n fallible: (p, env) => env.functions[p.ref]?.fallible ?? true,\n signature: (input, p, env) => {\n const def = Object.hasOwn(env.functions, p.ref) ? env.functions[p.ref] : undefined\n if (!def) return err(`unknown function '${p.ref}'`)\n if (def.input && !assignable(input, def.input)) {\n return err(`function '${p.ref}' takes ${show(def.input)}, got ${show(input)}`)\n }\n return ok(def.output)\n },\n run: (p, env) => {\n const def = env.functions[p.ref] as FnDef\n return (input, ctx) => def.run(input, ctx)\n },\n})\n","/\n List ops for list-typed fields within one record: `each`, `filter_list`, `index`, `first`,\n * `last`, `len`, `unique`, `sum`, `min`, `max`, `contains`. Collection-wide work belongs to\n * collection nodes.\n /\n\nimport { z } from 'zod'\nimport { compileOperand, compilePredicate } from '../predicate'\nimport { compileSteps } from '../pipeline'\nimport { err, expectOk, ok, type Result } from '../result'\nimport { comparable, type ListType, type MType, orderable, show, stripNull, t } from '../types'\nimport { canonicalKey, compareVals, type Val } from '../values'\nimport { defineOp, never, params } from './def'\n\nconst listIn = (input: MType, op: string): Result<MType, string> =>\n input.kind === 'list' ? ok(input.of) : err(`${op} expects a list, got ${show(input)}`)\n\n/* Applies a nested pipeline to every element. Nesting depth is capped at 1. /\nexport const each = defineOp({\n name: 'each',\n params: params({ pipeline: z.array(z.unknown()).min(1) }),\n nulls: 'propagate',\n fallible: (p, env, input) =>\n expectOk(compileSteps(p.pipeline, { ...env, depth: env.depth + 1 }, (input as ListType).of))\n .fallible,\n signature: (input, p, env) => {\n if (env.depth >= 1) return err('each cannot be nested inside each')\n const element = listIn(input, 'each')\n if (!element.ok) return element\n const nested = compileSteps(p.pipeline, { ...env, depth: env.depth + 1 }, element.value)\n if (!nested.ok) return err(`each step ${nested.error.step}: ${nested.error.message}`)\n if (nested.value.omittable) return err('each cannot end in omit_if_null')\n return ok(t.list(nested.value.type))\n },\n run: (p, env, input) => {\n const { run } = expectOk(\n compileSteps(p.pipeline, { ...env, depth: env.depth + 1 }, (input as ListType).of),\n )\n return (list, ctx) => {\n const out: Val[] = []\n for (const [i, element] of (list as readonly Val[]).entries()) {\n const r = run(element, ctx)\n if (!r.ok)\n return err({\n code: r.error.code,\n detail: `element ${i}, ${r.error.op}: ${r.error.detail}`,\n })\n out.push(r.value as Val)\n }\n return ok(out)\n }\n },\n})\n\nexport const filterList = defineOp({\n name: 'filter_list',\n params: params({ cond: z.unknown() }),\n nulls: 'propagate',\n fallible: never,\n signature: (input, p, env) => {\n const element = listIn(input, 'filter_list')\n if (!element.ok) return element\n const test = compilePredicate(p.cond, env, element.value)\n return test.ok ? ok(input) : test\n },\n run: (p, env, input) => {\n const test = expectOk(compilePredicate(p.cond, env, (input as ListType).of))\n return (list, ctx) => ok((list as readonly Val[]).filter((e) => test(e, ctx.record, ctx)))\n },\n})\n\nconst pick = (name: string, at: (length: number) => number) =>\n defineOp({\n name,\n params: params({}),\n nulls: 'propagate',\n fallible: never,\n signature: (input) => {\n const element = listIn(input, name)\n return element.ok ? ok(t.nullable(element.value)) : element\n },\n run: () => (list) => ok((list as readonly Val[])[at((list as readonly Val[]).length)] ?? null),\n })\n\nexport const first = pick('first', () => 0)\nexport const last = pick('last', (n) => n - 1)\n\n/* Element at `at`; a negative index counts from the end. Out of range gives null. /\nexport const index = defineOp({\n name: 'index',\n params: params({ at: z.number().int() }),\n nulls: 'propagate',\n fallible: never,\n signature: (input) => {\n const element = listIn(input, 'index')\n return element.ok ? ok(t.nullable(element.value)) : element\n },\n run: (p) => (list) => ok((list as readonly Val[]).at(p.at) ?? null),\n})\n\n/* Length of a list, or of a string in code points. /\nexport const len = defineOp({\n name: 'len',\n params: params({}),\n nulls: 'propagate',\n fallible: never,\n signature: (input) =>\n input.kind === 'list' \|\| input.kind === 'string'\n ? ok(t.number)\n : err(`len expects a list or string, got ${show(input)}`),\n run: () => (v) => ok(typeof v === 'string' ? Array.from(v).length : (v as readonly Val[]).length),\n})\n\n/* Drops repeated elements, keeping the first occurrence. /\nexport const unique = defineOp({\n name: 'unique',\n params: params({}),\n nulls: 'propagate',\n fallible: never,\n signature: (input) => {\n const element = listIn(input, 'unique')\n return element.ok ? ok(input) : element\n },\n run: () => (list) => {\n const seen = new Set<string>()\n return ok(\n (list as readonly Val[]).filter((e) => {\n const k = canonicalKey(e)\n if (seen.has(k)) return false\n seen.add(k)\n return true\n }),\n )\n },\n})\n\n/* Null elements are skipped; an empty list gives null. /\nexport const sum = defineOp({\n name: 'sum',\n params: params({}),\n nulls: 'propagate',\n fallible: never,\n signature: (input) => {\n const element = listIn(input, 'sum')\n if (!element.ok) return element\n return stripNull(element.value).kind === 'number'\n ? ok(t.nullable(t.number))\n : err(`sum expects list<number>, got ${show(input)}`)\n },\n // Sorted first, so floating-point results do not depend on element order.\n run: () => (list) => {\n const numbers = (list as readonly Val[])\n .filter((x): x is number => x !== null)\n .sort((a, b) => a - b)\n return ok(numbers.length === 0 ? null : numbers.reduce((a, b) => a + b, 0))\n },\n})\n\nconst extreme = (name: 'min' \| 'max') =>\n defineOp({\n name,\n params: params({}),\n nulls: 'propagate',\n fallible: never,\n signature: (input) => {\n const element = listIn(input, name)\n if (!element.ok) return element\n return orderable(element.value)\n ? ok(t.nullable(stripNull(element.value)))\n : err(`${name} expects a list of numbers, strings or dates, got ${show(input)}`)\n },\n run: () => (list) => {\n let best: Val = null\n for (const x of list as readonly Val[]) {\n if (x === null) continue\n if (best === null \|\| (name === 'min' ? compareVals(x, best) < 0 : compareVals(x, best) > 0))\n best = x\n }\n return ok(best)\n },\n })\n\nexport const min = extreme('min')\nexport const max = extreme('max')\n\n/* Membership of a literal, `{ ref }` or `{ param }` value. Null is never a member. /\nexport const contains = defineOp({\n name: 'contains',\n params: params({ value: z.unknown().refine((v) => v !== undefined, 'contains needs a value') }),\n nulls: 'propagate',\n fallible: never,\n signature: (input, p, env) => {\n const element = listIn(input, 'contains')\n if (!element.ok) return element\n const operand = compileOperand(p.value, env, stripNull(element.value).kind === 'date')\n if (!operand.ok) return operand\n return comparable(element.value, operand.value.type)\n ? ok(t.boolean)\n : err(`cannot look for ${show(operand.value.type)} in ${show(input)}`)\n },\n run: (p, env, input) => {\n const element = (input as ListType).of\n const { get } = expectOk(compileOperand(p.value, env, stripNull(element).kind === 'date'))\n return (list, ctx) => {\n const v = get(list, ctx.record, ctx)\n return ok(\n v !== null && (list as readonly Val[]).some((x) => x !== null && compareVals(x, v) === 0),\n )\n }\n },\n})\n","/* `lookup`: a static value map stored with the version, for enum and code translation. /\n\nimport { z } from 'zod'\nimport { err, expectOk, ok, stepError } from '../result'\nimport { comparable, show, t, typeOfJson, unify, unifyAll } from '../types'\nimport type { Json, Val } from '../values'\nimport { defineOp, params } from './def'\n\nconst SCALAR = new Set(['string', 'number', 'boolean'])\n\n/\n Translate a scalar through `tables[table]` (keys are the value's string form). `on_miss`:\n * `null` (default) yields null, `pass` forwards the input, `error` raises `lookup_miss`.\n /\nexport const lookup = defineOp({\n name: 'lookup',\n params: params({\n table: z.string().min(1),\n on_miss: z.enum(['null', 'pass', 'error']).optional(),\n }),\n nulls: 'propagate',\n fallible: (p) => p.on_miss === 'error',\n signature: (input, p, env) => {\n if (!SCALAR.has(input.kind))\n return err(`lookup expects a string, number or boolean, got ${show(input)}`)\n if (!Object.hasOwn(env.tables, p.table)) return err(`unknown lookup table '${p.table}'`)\n const values = Object.values(env.tables[p.table] as Record<string, Json>)\n const value = unifyAll(values.map(typeOfJson))\n if (!value.ok) return err(`lookup table '${p.table}' mixes value types: ${value.error}`)\n switch (p.on_miss ?? 'null') {\n case 'null':\n return ok(t.nullable(value.value))\n case 'error':\n return ok(value.value)\n default: {\n if (!comparable(input, value.value)) {\n return err(\n `on_miss \"pass\" forwards ${show(input)}, but the table yields ${show(value.value)}`,\n )\n }\n return ok(expectOk(unify(input, value.value)))\n }\n }\n },\n run: (p, env) => {\n const table = env.tables[p.table] as Readonly<Record<string, Json>>\n const miss = p.on_miss ?? 'null'\n return (input) => {\n const key = String(input as string \| number \| boolean)\n if (Object.hasOwn(table, key)) return ok(table[key] as Val)\n if (miss === 'error') return stepError('lookup_miss', `'${key}' is not in table '${p.table}'`)\n return ok(miss === 'pass' ? input : null)\n }\n },\n})\n","/* Null and blank handling: `blank_to_null`, `default`, `require`, `omit_if_null`. /\n\nimport { z } from 'zod'\nimport { err, ok, stepError } from '../result'\nimport { assignable, show, stripNull, t, typeOfJson } from '../types'\nimport { OMIT, type Val } from '../values'\nimport { always, defineOp, expectKind, json, never, params } from './def'\n\n/* An empty or whitespace-only string becomes null. /\nexport const blankToNull = defineOp({\n name: 'blank_to_null',\n params: params({}),\n nulls: 'propagate',\n fallible: never,\n signature: (input) => {\n const s = expectKind(input, ['string'], 'blank_to_null')\n return s.ok ? ok(t.nullable(t.string)) : s\n },\n run: () => (input) => ok((input as string).trim() === '' ? null : input),\n})\n\n/* Replaces null with a literal of the input's type. /\nexport const defaultOp = defineOp({\n name: 'default',\n params: params({ value: json }),\n nulls: 'consume',\n fallible: never,\n signature: (input, p) => {\n if (p.value === null) return err('default needs a non-null value')\n const base = stripNull(input)\n const literal = typeOfJson(p.value)\n if (base.kind === 'unknown') return ok(literal)\n return assignable(literal, base)\n ? ok(base)\n : err(`default value is ${show(literal)}, input is ${show(input)}`)\n },\n run: (p) => {\n const value = p.value as Val\n return (input) => ok(input ?? value)\n },\n})\n\n/* Null triggers the node's `on_error` policy. /\nexport const requireOp = defineOp({\n name: 'require',\n params: params({ message: z.string().optional() }),\n nulls: 'consume',\n fallible: always,\n signature: (input) => ok(stripNull(input)),\n run: (p) => {\n const message = p.message ?? 'required value is null'\n return (input) => (input === null ? stepError('required_null', message) : ok(input))\n },\n})\n\n/\n Terminal. A null leaves the field out of the record (and so out of the write) instead of\n * setting it to null (limitation #8). Readers downstream see the field as nullable.\n /\nexport const omitIfNull = defineOp({\n name: 'omit_if_null',\n params: params({}),\n nulls: 'consume',\n terminal: true,\n fallible: never,\n signature: (input) => ok(t.nullable(stripNull(input))),\n run: () => (input) => ok(input === null ? OMIT : input),\n})\n","/\n The unit table behind `convert_unit`: mass, length and volume, each against one base unit.\n * Unit names are matched case-insensitively. Anything else, and any conversion across\n * dimensions, is unknown.\n /\n\ntype Dimension = 'mass' \| 'length' \| 'volume'\n\nconst UNITS: Readonly<Record<string, { readonly dimension: Dimension; readonly factor: number }>> =\n {\n // mass, in grams\n mg: { dimension: 'mass', factor: 0.001 },\n g: { dimension: 'mass', factor: 1 },\n kg: { dimension: 'mass', factor: 1000 },\n t: { dimension: 'mass', factor: 1_000_000 },\n oz: { dimension: 'mass', factor: 28.349523125 },\n lb: { dimension: 'mass', factor: 453.59237 },\n // length, in metres\n mm: { dimension: 'length', factor: 0.001 },\n cm: { dimension: 'length', factor: 0.01 },\n m: { dimension: 'length', factor: 1 },\n km: { dimension: 'length', factor: 1000 },\n in: { dimension: 'length', factor: 0.0254 },\n ft: { dimension: 'length', factor: 0.3048 },\n // volume, in litres\n ml: { dimension: 'volume', factor: 0.001 },\n l: { dimension: 'volume', factor: 1 },\n m3: { dimension: 'volume', factor: 1000 },\n }\n\nconst unit = (name: string) => UNITS[name.trim().toLowerCase()]\n\nexport function isUnit(name: string): boolean {\n return unit(name) !== undefined\n}\n\n/* Multiply by this to convert `from` into `to`; undefined if unknown or across dimensions. /\nexport function conversionFactor(from: string, to: string): number \| undefined {\n const a = unit(from)\n const b = unit(to)\n if (!a \|\| !b \|\| a.dimension !== b.dimension) return undefined\n // Divide instead of multiplying by a reciprocal, so kg -> g is exactly 1000.\n return a.factor / b.factor\n}\n","/* Numeric ops: `add`, `subtract`, `multiply`, `divide`, `round`, `abs`, `clamp`, `convert_unit`. /\n\nimport { z } from 'zod'\nimport { err, ok, stepError } from '../result'\nimport { isNullable, type MType, nullableIf, show, stripNull, t } from '../types'\nimport { conversionFactor, isUnit } from '../units'\nimport { defineOp, expectKind, never, params } from './def'\n\n// Zod 4 numbers are finite: Infinity and NaN are rejected.\nconst finite = z.number()\n\nconst numberIn = (op: string) => (input: MType) => {\n const s = expectKind(input, ['number'], op)\n return s.ok ? ok(t.number) : s\n}\n\nconst arithmetic = <K extends string>(\n name: string,\n key: K,\n apply: (a: number, b: number) => number,\n) =>\n defineOp({\n name,\n params: params({ [key]: finite } as { [P in K]: typeof finite }),\n nulls: 'propagate',\n fallible: never,\n signature: numberIn(name),\n run: (p) => {\n const operand = (p as Record<K, number>)[key]\n return (input) => ok(apply(input as number, operand))\n },\n })\n\nexport const add = arithmetic('add', 'value', (a, b) => a + b)\nexport const subtract = arithmetic('subtract', 'value', (a, b) => a - b)\nexport const multiply = arithmetic('multiply', 'by', (a, b) => a b)\n\n/** `by: 0` is rejected when the version is saved, never at runtime. /\nexport const divide = defineOp({\n name: 'divide',\n params: params({ by: finite.refine((n) => n !== 0, 'divide by zero') }),\n nulls: 'propagate',\n fallible: never,\n signature: numberIn('divide'),\n run: (p) => (input) => ok((input as number) / p.by),\n})\n\n/* Shift the decimal point by `places` without floating-point drift (1.005 stays 1.005). /\nfunction shiftDecimal(n: number, places: number): number {\n const [mantissa, exponent = '0'] = String(n).split('e')\n return Number(`${mantissa}e${Number(exponent) + places}`)\n}\n\ntype RoundMode = 'half_up' \| 'half_even' \| 'floor' \| 'ceil'\n\nfunction roundScaled(x: number, mode: RoundMode): number {\n switch (mode) {\n case 'floor':\n return Math.floor(x)\n case 'ceil':\n return Math.ceil(x)\n case 'half_up':\n return Math.sign(x) Math.round(Math.abs(x))\n case 'half_even': {\n const a = Math.abs(x)\n const floor = Math.floor(a)\n const diff = a - floor\n const r = diff > 0.5 \|\| (diff === 0.5 && floor % 2 === 1) ? floor + 1 : floor\n return Math.sign(x) * r\n }\n }\n}\n\n/** Round to `precision` decimals. `half_up` rounds halves away from zero. /\nexport const round = defineOp({\n name: 'round',\n params: params({\n precision: z.number().int().min(0).max(15).optional(),\n mode: z.enum(['half_up', 'half_even', 'floor', 'ceil']).optional(),\n }),\n nulls: 'propagate',\n fallible: never,\n signature: numberIn('round'),\n run: (p) => {\n const precision = p.precision ?? 0\n const mode = p.mode ?? 'half_up'\n // The final shift goes through String(), which also turns -0 into 0.\n return (input) =>\n ok(shiftDecimal(roundScaled(shiftDecimal(input as number, precision), mode), -precision))\n },\n})\n\nexport const abs = defineOp({\n name: 'abs',\n params: params({}),\n nulls: 'propagate',\n fallible: never,\n signature: numberIn('abs'),\n run: () => (input) => ok(Math.abs(input as number)),\n})\n\nexport const clamp = defineOp({\n name: 'clamp',\n params: params({ min: finite.optional(), max: finite.optional() })\n .refine((p) => p.min !== undefined \|\| p.max !== undefined, 'clamp needs min or max')\n .refine(\n (p) => p.min === undefined \|\| p.max === undefined \|\| p.min <= p.max,\n 'min is above max',\n ),\n nulls: 'propagate',\n fallible: never,\n signature: numberIn('clamp'),\n run: (p) => {\n const min = p.min ?? -Infinity\n const max = p.max ?? Infinity\n return (input) => ok(Math.min(max, Math.max(min, input as number)))\n },\n})\n\nconst unitName = z.string().refine(isUnit, 'unknown unit')\n\n/\n Convert over the unit table. The source unit is `from`, or the second element of an\n * extracted `(value, unit)` tuple. With a static `from` the conversion is checked at save\n * and cannot fail; with a unit read from the record an unknown unit raises.\n /\nexport const convertUnit = defineOp({\n name: 'convert_unit',\n params: params({ to: unitName, from: unitName.optional() }).refine(\n (p) =>\n p.from === undefined \|\|\n !isUnit(p.from) \|\|\n !isUnit(p.to) \|\|\n conversionFactor(p.from, p.to) !== undefined,\n 'from and to measure different things',\n ),\n nulls: 'propagate',\n fallible: (p) => p.from === undefined,\n signature: (input, p) => {\n if (input.kind === 'tuple') {\n if (p.from !== undefined)\n return err('convert_unit takes a unit from the record or from \"from\", not both')\n const [value, unit] = input.of as readonly [MType, MType]\n const pair =\n input.of.length === 2 &&\n stripNull(value).kind === 'number' &&\n stripNull(unit).kind === 'string'\n if (!pair) return err(`convert_unit expects (number, string), got ${show(input)}`)\n return ok(nullableIf(t.number, isNullable(value)))\n }\n if (p.from === undefined) return err('convert_unit needs a unit input or a \"from\" param')\n return numberIn('convert_unit')(input)\n },\n run: (p, _env, input) => {\n const to = p.to\n if (input.kind !== 'tuple') {\n const factor = conversionFactor(p.from as string, to) as number\n return (v) => ok((v as number) factor)\n }\n return (v) => {\n const [value, from] = v as readonly [number \| null, string \| null]\n if (value === null) return ok(null)\n if (from === null) return stepError('unknown_unit', `no unit given for ${value}`)\n const factor = conversionFactor(from, to)\n return factor === undefined\n ? stepError('unknown_unit', `cannot convert ${from} to ${to}`)\n : ok(value * factor)\n }\n },\n})\n","/*\n String ops: `trim`, `lower`, `upper`, `truncate`, `pad`, `replace`, `regex_extract`,\n * `split`, `join`, `concat`, `slug`. Lengths count code points, not UTF-16 units.\n /\n\nimport { z } from 'zod'\nimport { compileRegex } from '../predicate'\nimport { err, ok } from '../result'\nimport { type MType, show, stripNull, t } from '../types'\nimport type { Val } from '../values'\nimport { defineOp, expectKind, never, params } from './def'\n\nconst stringIn = (op: string) => (input: MType) => {\n const s = expectKind(input, ['string'], op)\n return s.ok ? ok(t.string) : s\n}\n\nconst regex = z.string().superRefine((s, ctx) => {\n const r = compileRegex(s)\n if (!r.ok) ctx.addIssue({ code: 'custom', message: r.error })\n})\n\nconst escapeRegex = (s: string) => s.replace(/[.+?^${}()\|[\\]\\\\]/g, '\\\\$&')\n\nexport const trim = defineOp({\n name: 'trim',\n params: params({ chars: z.string().min(1).optional() }),\n nulls: 'propagate',\n fallible: never,\n signature: stringIn('trim'),\n run: (p) => {\n if (p.chars === undefined) return (input) => ok((input as string).trim())\n const set = `[${p.chars.replace(/[\\\\\\]^-]/g, '\\\\$&')}]+`\n const edges = new RegExp(`^${set}\|${set}$`, 'gu')\n return (input) => ok((input as string).replace(edges, ''))\n },\n})\n\nexport const lower = defineOp({\n name: 'lower',\n params: params({}),\n nulls: 'propagate',\n fallible: never,\n signature: stringIn('lower'),\n run: () => (input) => ok((input as string).toLowerCase()),\n})\n\nexport const upper = defineOp({\n name: 'upper',\n params: params({}),\n nulls: 'propagate',\n fallible: never,\n signature: stringIn('upper'),\n run: () => (input) => ok((input as string).toUpperCase()),\n})\n\n/** Lossy, no inverse. With `ellipsis` the result, ellipsis included, fits `length`. /\nexport const truncate = defineOp({\n name: 'truncate',\n params: params({ length: z.number().int().min(0), ellipsis: z.boolean().optional() }).refine(\n (p) => !p.ellipsis \|\| p.length >= 1,\n 'truncate with ellipsis needs length >= 1',\n ),\n nulls: 'propagate',\n fallible: never,\n signature: stringIn('truncate'),\n run: (p) => (input) => {\n const chars = Array.from(input as string)\n if (chars.length <= p.length) return ok(input)\n return ok(\n p.ellipsis ? `${chars.slice(0, p.length - 1).join('')}…` : chars.slice(0, p.length).join(''),\n )\n },\n})\n\n/* Fixed-width codes, zero-padded SKUs. Strings already as long are unchanged. /\nexport const pad = defineOp({\n name: 'pad',\n params: params({\n length: z.number().int().min(1),\n with: z.string().min(1),\n side: z.enum(['left', 'right']),\n }),\n nulls: 'propagate',\n fallible: never,\n signature: stringIn('pad'),\n run: (p) => (input) => {\n const s = input as string\n return ok(p.side === 'left' ? s.padStart(p.length, p.with) : s.padEnd(p.length, p.with))\n },\n})\n\n/* Replace every occurrence; `regex: true` treats `pattern` as a regular expression. /\nexport const replace = defineOp({\n name: 'replace',\n params: params({\n pattern: z.string().min(1),\n with: z.string(),\n regex: z.boolean().optional(),\n }).superRefine((p, ctx) => {\n if (!p.regex \|\| typeof p.pattern !== 'string') return\n const r = compileRegex(p.pattern)\n if (!r.ok) ctx.addIssue({ code: 'custom', path: ['pattern'], message: r.error })\n }),\n nulls: 'propagate',\n fallible: never,\n signature: stringIn('replace'),\n run: (p) => {\n const pattern = new RegExp(p.regex ? p.pattern : escapeRegex(p.pattern), 'gu')\n // Literal replacement: `$` in `with` has no special meaning.\n return (input) => ok((input as string).replace(pattern, () => p.with))\n },\n})\n\nfunction groupCount(pattern: string): number {\n return (new RegExp(`${pattern}\|`, 'u').exec('') as RegExpExecArray).length - 1\n}\n\n/* The match (or capture `group`) of the first match; no match gives null. /\nexport const regexExtract = defineOp({\n name: 'regex_extract',\n params: params({ pattern: regex, group: z.number().int().min(0).optional() }).refine(\n (p) => !compileRegex(p.pattern).ok \|\| (p.group ?? 0) <= groupCount(p.pattern),\n 'group is larger than the number of capture groups',\n ),\n nulls: 'propagate',\n fallible: never,\n signature: (input) => {\n const s = expectKind(input, ['string'], 'regex_extract')\n return s.ok ? ok(t.nullable(t.string)) : s\n },\n run: (p) => {\n const re = new RegExp(p.pattern, 'u')\n const group = p.group ?? 0\n return (input) => ok(re.exec(input as string)?.[group] ?? null)\n },\n})\n\n/* Split on a separator. With `limit`, at most that many parts; the last keeps the rest. /\nexport const split = defineOp({\n name: 'split',\n params: params({ separator: z.string().min(1), limit: z.number().int().min(1).optional() }),\n nulls: 'propagate',\n fallible: never,\n signature: (input) => {\n const s = expectKind(input, ['string'], 'split')\n return s.ok ? ok(t.list(t.string)) : s\n },\n run: (p) => (input) => {\n const parts = (input as string).split(p.separator)\n if (p.limit === undefined \|\| parts.length <= p.limit) return ok(parts)\n return ok([...parts.slice(0, p.limit - 1), parts.slice(p.limit - 1).join(p.separator)])\n },\n})\n\n/* String join of a list; null elements are skipped. Unrelated to the `join` node. /\nexport const join = defineOp({\n name: 'join',\n params: params({ separator: z.string() }),\n nulls: 'propagate',\n fallible: never,\n signature: (input) => {\n if (input.kind !== 'list' \|\| stripNull(input.of).kind !== 'string') {\n return err(`join expects list<string>, got ${show(input)}`)\n }\n return ok(t.string)\n },\n run: (p) => (input) =>\n ok((input as readonly (string \| null)[]).filter((x) => x !== null).join(p.separator)),\n})\n\nconst SCALAR = new Set(['string', 'number', 'boolean'])\n\n/* Join the parts of a multi-path `extract`; null parts are skipped. /\nexport const concat = defineOp({\n name: 'concat',\n params: params({ separator: z.string().optional() }),\n nulls: 'propagate',\n fallible: never,\n signature: (input) => {\n if (input.kind !== 'tuple' \|\| !input.of.every((x) => SCALAR.has(stripNull(x).kind))) {\n return err(`concat expects a tuple of strings, numbers or booleans, got ${show(input)}`)\n }\n return ok(t.string)\n },\n run: (p) => (input) =>\n ok(\n (input as readonly Val[])\n .filter((x) => x !== null)\n .map((x) => String(x as string \| number \| boolean))\n .join(p.separator ?? ''),\n ),\n})\n\n/* URL-safe form: ASCII letters and digits, lowercase, runs of anything else to `separator`. /\nexport const slug = defineOp({\n name: 'slug',\n params: params({ separator: z.string().min(1).optional() }),\n nulls: 'propagate',\n fallible: never,\n signature: stringIn('slug'),\n run: (p) => {\n const sep = p.separator ?? '-'\n return (input) =>\n ok(\n (input as string)\n .normalize('NFKD')\n .replace(/[̀-ͯ]/g, '')\n .toLowerCase()\n .split(/[^a-z0-9]+/)\n .filter((x) => x !== '')\n .join(sep),\n )\n },\n})\n","/\n `when`: the one general conditional (arch.md limitation #12). First matching case wins;\n * `then` and `else` are a literal, `null`, or `{ \"pass\": true }` to forward the input. `else`\n * defaults to pass-through. As a pipeline's first step there is no input: every case must\n * test a `path`, and `else` is required.\n /\n\nimport { z } from 'zod'\nimport { compilePredicate } from '../predicate'\nimport { err, expectOk, ok, type Result } from '../result'\nimport { type MType, show, typeOfJson, unifyAll } from '../types'\nimport type { Json, Val } from '../values'\nimport { defineOp, json, never, params } from './def'\n\nconst pass = z.strictObject({ pass: z.literal(true) })\nconst scalar = z.union([z.string(), z.number(), z.boolean(), z.null(), z.array(json)])\nconst branch = z.union([pass, scalar])\n\ntype Branch = z.infer<typeof branch>\n\nconst isPass = (b: Branch): b is { pass: true } =>\n typeof b === 'object' && b !== null && !Array.isArray(b)\n\nexport const when = defineOp({\n name: 'when',\n params: params({\n cases: z.array(z.strictObject({ cond: z.unknown(), then: branch })).min(1),\n else: branch.optional(),\n }),\n nulls: 'consume',\n input: 'any',\n fallible: never,\n signature: (input, p, env): Result<MType, string> => {\n const first = input.kind === 'unit'\n const branches = [...p.cases.map((c) => c.then), ...(p.else === undefined ? [] : [p.else])]\n if (first && p.else === undefined) return err('when as the first step needs an \"else\"')\n if (first && branches.some(isPass)) return err('when as the first step has no input to pass')\n for (const [i, c] of p.cases.entries()) {\n const test = compilePredicate(c.cond, env, input)\n if (!test.ok) return err(`case ${i}: ${test.error}`)\n }\n const types = branches.map((b) => (isPass(b) ? input : typeOfJson(b)))\n if (p.else === undefined) types.push(input)\n const out = unifyAll(types)\n return out.ok ? out : err(`when branches disagree: ${types.map(show).join(', ')}`)\n },\n run: (p, env, input) => {\n const cases = p.cases.map((c) => ({\n test: expectOk(compilePredicate(c.cond, env, input)),\n then: c.then,\n }))\n const otherwise = p.else ?? { pass: true as const }\n const resolve = (b: Branch, v: Val): Val => (isPass(b) ? v : (b as Json as Val))\n return (v, ctx) => {\n for (const c of cases) if (c.test(v, ctx.record, ctx)) return ok(resolve(c.then, v))\n return ok(resolve(otherwise, v))\n }\n },\n})\n","/* The record op registry: every op a `map` field pipeline may use, by name. /\n\nimport { coalesce, constant, extract } from './access'\nimport { assertType, toBool, toDate, toNumber, toString } from './convert'\nimport { formatDateOp, shiftDate, toUtc, truncateDate } from './date'\nimport type { OpDef } from './def'\nimport { fn } from './fn'\nimport { contains, each, filterList, first, index, last, len, max, min, sum, unique } from './list'\nimport { lookup } from './lookup'\nimport { blankToNull, defaultOp, omitIfNull, requireOp } from './nulls'\nimport { abs, add, clamp, convertUnit, divide, multiply, round, subtract } from './numeric'\nimport {\n concat,\n join,\n lower,\n pad,\n regexExtract,\n replace,\n slug,\n split,\n trim,\n truncate,\n upper,\n} from './string'\nimport { when } from './when'\n\nexport type { OpDef, Step, StepResult } from './def'\nexport { defineOp } from './def'\n\nconst all = [\n extract,\n constant,\n coalesce,\n blankToNull,\n defaultOp,\n requireOp,\n omitIfNull,\n toNumber,\n toString,\n toBool,\n toDate,\n assertType,\n add,\n subtract,\n multiply,\n divide,\n round,\n abs,\n clamp,\n convertUnit,\n trim,\n lower,\n upper,\n truncate,\n pad,\n replace,\n regexExtract,\n split,\n join,\n concat,\n slug,\n formatDateOp,\n shiftDate,\n truncateDate,\n toUtc,\n when,\n each,\n filterList,\n index,\n first,\n last,\n len,\n unique,\n sum,\n min,\n max,\n contains,\n lookup,\n fn,\n]\n\nexport const opRegistry: Readonly<Record<string, OpDef<unknown>>> = Object.fromEntries(\n all.map((op) => [op.name, op as unknown as OpDef<unknown>]),\n)\n","/\n Sugar, kept for readability and expanded on save (arch.md, \"Conditional\" and \"Lookup\").\n \n - `{ op: \"if_<predicate>\", <operand>, then, else? }` expands to a one-case `when`, e.g.\n * `{ op: \"if_lte\", value: 0, then: null }` to\n * `{ op: \"when\", cases: [{ cond: { lte: 0 }, then: null }] }`.\n * - `{ op: \"lookup_entity\", entity, by, field, on_miss? }` expands into a `source` for the\n * internal entity, an `n:1` left `join` on `by`, and an `extract` of `field` (see\n * `normalizeVersion`).\n /\n\nimport { z } from 'zod'\nimport type { GraphEnv } from './context'\nimport type { MappingVersion, NodeJson } from './document'\nimport { entityJsonSchema } from './jsonschema'\nimport { PREDICATES } from './predicate'\nimport { type CompileIssue, err, ok, type Result } from './result'\n\nconst OPERAND_KEYS = ['value', 'values', 'date', 'pattern'] as const\nconst SUGAR_PREDICATES = new Set<string>(\n PREDICATES.filter((p) => !['all', 'any', 'not'].includes(p)),\n)\n\nexport type StepJson = { readonly op: string } & { readonly [key: string]: unknown }\n\n/* Expand one step if it is sugar; other steps pass through unchanged. /\nexport function expandStep(raw: StepJson): Result<StepJson, string> {\n const m = /^if_(.+)$/.exec(raw.op)\n if (!m) return ok(raw)\n const predicate = m[1] as string\n if (!SUGAR_PREDICATES.has(predicate)) return err(`unknown op '${raw.op}'`)\n const { op: _op, then, else: otherwise, path, ...rest } = raw\n if (!('then' in raw)) return err(`${raw.op} needs \"then\"`)\n\n const extra = Object.keys(rest).filter((k) => !(OPERAND_KEYS as readonly string[]).includes(k))\n if (extra.length) return err(`${raw.op} does not take ${extra.join(', ')}`)\n const given = OPERAND_KEYS.filter((k) => k in rest)\n const presence = predicate === 'is_null' \|\| predicate === 'is_blank'\n if (presence ? given.length > 0 : given.length !== 1) {\n return err(\n presence\n ? `${raw.op} takes no comparison value`\n : `${raw.op} takes exactly one of ${OPERAND_KEYS.join(', ')}`,\n )\n }\n const operand = presence ? true : rest[given[0] as string]\n const cond = { ...(path === undefined ? {} : { path }), [predicate]: operand }\n return ok({\n op: 'when',\n cases: [{ cond, then }],\n ...(otherwise === undefined ? {} : { else: otherwise }),\n })\n}\n\nconst LookupEntity = z.strictObject({\n op: z.literal('lookup_entity'),\n entity: z.string().min(1),\n by: z.string().min(1),\n field: z.string().min(1).default('id'),\n on_miss: z.enum(['null', 'pass', 'error']).optional(),\n})\n\nconst isStep = (v: unknown): v is StepJson =>\n typeof v === 'object' && v !== null && typeof (v as StepJson).op === 'string'\n\n/* Expand `if_` steps (also inside `each`); report `lookup_entity` where it cannot go. /\nfunction expandPipeline(\n steps: readonly unknown[],\n nested: boolean,\n issue: (message: string, step: number) => void,\n): unknown[] {\n return steps.map((step, i) => {\n if (!isStep(step)) return step\n if (nested && step.op === 'lookup_entity') {\n issue('lookup_entity cannot be used inside each', i)\n return step\n }\n if (step.op === 'each' && Array.isArray(step.pipeline)) {\n return {\n ...step,\n pipeline: expandPipeline(step.pipeline, true, (m) => issue(`each: ${m}`, i)),\n }\n }\n const expanded = expandStep(step)\n if (expanded.ok) return expanded.value\n issue(expanded.error, i)\n return step\n })\n}\n\ninterface Rewrite {\n readonly generated: NodeJson[]\n readonly node: NodeJson\n}\n\n/** Rewrite the `lookup_entity` steps of one map node into generated nodes. /\nfunction rewriteLookups(\n node: NodeJson,\n env: Pick<GraphEnv, 'targets'>,\n sources: Set<string>,\n issues: CompileIssue[],\n): Rewrite {\n const generated: NodeJson[] = []\n let input = node.in\n const drop = Array.isArray(node.drop) ? [...(node.drop as string[])] : []\n let n = 0\n const fields = (node.fields as unknown[]).map((raw) => {\n const f = raw as { key?: unknown; pipeline?: unknown }\n if (typeof f !== 'object' \|\| f === null \|\| !Array.isArray(f.pipeline)) return raw\n const key = String(f.key)\n const issue = (message: string, step: number) =>\n issues.push({ code: 'invalid_params', message, node: node.id, field: key, step })\n const pipeline = expandPipeline(f.pipeline, false, issue)\n const at = pipeline.findIndex((s) => isStep(s) && s.op === 'lookup_entity')\n if (at < 0) return { ...f, pipeline }\n if (pipeline.findLastIndex((s) => isStep(s) && s.op === 'lookup_entity') !== at) {\n issue('use one lookup_entity per field; resolve the others in an upstream map', at)\n return { ...f, pipeline }\n }\n const parsed = LookupEntity.safeParse(pipeline[at])\n if (!parsed.success) {\n issue(\n `lookup_entity: ${parsed.error.issues.map((x) => `${x.path.join('.')}: ${x.message}`).join('; ')}`,\n at,\n )\n return { ...f, pipeline }\n }\n if (at === 0) {\n issue('lookup_entity needs a key; extract it first', at)\n return { ...f, pipeline }\n }\n const { entity, by, field, on_miss: onMiss } = parsed.data\n if (!env.targets.entities.some((e) => e.name === entity)) {\n issue(`lookup_entity: unknown entity '${entity}'`, at)\n return { ...f, pipeline }\n }\n n += 1\n const prefix = pipeline.slice(0, at) as StepJson[]\n const only = prefix[0] as StepJson\n let keyField: string\n if (prefix.length === 1 && only.op === 'extract' && typeof only.path === 'string') {\n keyField = only.path\n } else {\n // A computed key is materialised as a field of a preceding map first.\n keyField = `__${key}__key`\n const helper: NodeJson = {\n id: `${node.id}__key${n}`,\n op: 'map',\n in: input,\n keep: 'all',\n fields: [{ key: keyField, pipeline: prefix }],\n ...(node.on_error === undefined ? {} : { on_error: node.on_error }),\n }\n generated.push(helper)\n input = helper.id\n drop.push(keyField)\n }\n const source = `__internal_${entity}`\n if (!sources.has(source)) {\n sources.add(source)\n generated.push({ id: source, op: 'source', system: 'internal', entity })\n }\n const valueField = `__${key}__lookup`\n const join: NodeJson = {\n id: `${node.id}__lookup${n}`,\n op: 'join',\n left: input,\n right: source,\n on: [[keyField, by]],\n type: 'left',\n cardinality: 'n:1',\n select: { [field]: valueField },\n tolerate_skips: true,\n }\n generated.push(join)\n input = join.id\n drop.push(valueField)\n const head: StepJson[] =\n onMiss === 'pass'\n ? [{ op: 'coalesce', paths: [valueField, keyField] }]\n : onMiss === 'error'\n ? [\n { op: 'extract', path: valueField },\n { op: 'require', message: `no ${entity} with ${by} equal to the key` },\n ]\n : [{ op: 'extract', path: valueField }]\n return { ...f, pipeline: [...head, ...pipeline.slice(at + 1)] }\n })\n if (n === 0) return { generated, node: { ...node, fields } }\n const keepAll = node.keep === 'all'\n return {\n generated,\n node: { ...node, in: input, fields, ...(keepAll ? { drop } : {}) },\n }\n}\n\n/\n The form a version is stored and compiled in: sugar expanded, `lookup_entity` rewritten\n * into graph nodes, and every internal source's schema pinned from the target model\n * (structural rule 4). Idempotent.\n /\nexport function normalizeVersion(\n version: MappingVersion,\n env: Pick<GraphEnv, 'targets'>,\n): { version: MappingVersion; issues: CompileIssue[] } {\n const issues: CompileIssue[] = []\n const sources = new Set(version.nodes.filter((n) => n.op === 'source').map((n) => n.id))\n const nodes: NodeJson[] = []\n for (const node of version.nodes) {\n if (node.op !== 'map' \|\| !Array.isArray(node.fields)) {\n nodes.push(node)\n continue\n }\n const rewrite = rewriteLookups(node, env, sources, issues)\n nodes.push(...rewrite.generated, rewrite.node)\n }\n const expectedSchema = { ...version.expectedSchema }\n for (const node of nodes) {\n if (node.op !== 'source' \|\| node.system !== 'internal' \|\| expectedSchema[node.id]) continue\n const entity = env.targets.entities.find((e) => e.name === node.entity)\n if (entity) expectedSchema[node.id] = entityJsonSchema(entity)\n }\n return { version: { ...version, nodes, expectedSchema }, issues }\n}\n","/\n The step compiler (arch.md, \"The compiler\"): a fold over the steps of one field pipeline\n * that threads a value type and a closure. Nullability is lifted here, so an op marked\n * `nulls: 'propagate'` never sees null: a null input skips it and stays null.\n /\n\nimport type { RecordContext, RecordEnv } from './context'\nimport { opRegistry } from './ops'\nimport type { Step } from './ops/def'\nimport { err, ok, type Result, type StepError } from './result'\nimport { expandStep, type StepJson } from './sugar'\nimport { mayBeNull, type MType, stripNull, t } from './types'\nimport type { Omitted, Val } from './values'\n\nexport interface PipelineError extends StepError {\n readonly step: number\n readonly op: string\n}\n\nexport interface CompiledPipeline {\n readonly type: MType\n /* Can return an error at runtime. /\n readonly fallible: boolean\n /* Ends in `omit_if_null`: the field may be left out of the record. /\n readonly omittable: boolean\n readonly run: (input: Val, ctx: RecordContext) => Result<Val \| Omitted, PipelineError>\n}\n\nexport interface StepIssue {\n readonly step: number\n readonly message: string\n}\n\nconst NULL_RESULT = ok(null)\n\n/* Compile a pipeline. Top-level pipelines start from `t.unit`; `each` passes the element type. /\nexport function compileSteps(\n raw: readonly unknown[],\n env: RecordEnv,\n input: MType = t.unit,\n): Result<CompiledPipeline, StepIssue> {\n if (raw.length === 0) return err({ step: 0, message: 'a pipeline needs at least one step' })\n\n let type = input\n let fallible = false\n let omittable = false\n const steps: Step[] = []\n const names: string[] = []\n\n for (const [i, value] of raw.entries()) {\n const issue = (message: string) => err({ step: i, message })\n if (typeof value !== 'object' \|\| value === null \|\| typeof (value as StepJson).op !== 'string') {\n return issue('a step is an object with an \"op\"')\n }\n const expanded = expandStep(value as StepJson)\n if (!expanded.ok) return issue(expanded.error)\n const { op, ...rest } = expanded.value\n const def = Object.hasOwn(opRegistry, op) ? opRegistry[op] : undefined\n if (!def) return issue(`unknown op '${op}'`)\n if (omittable) return issue(`${names.at(-1)} must be the last step`)\n\n const params = def.params.safeParse(rest)\n if (!params.success) {\n return issue(\n `${op}: ${params.error.issues.map((x) => `${x.path.length ? `${x.path.join('.')}: ` : ''}${x.message}`).join('; ')}`,\n )\n }\n\n const mode = def.input ?? 'value'\n if (mode === 'none' && type.kind !== 'unit') {\n return issue(`${op} starts a pipeline; it cannot follow another step`)\n }\n if (mode === 'value' && type.kind === 'unit') {\n return issue(`${op} needs an input; start the pipeline with extract, const, coalesce or when`)\n }\n\n // Nullability is lifted here, so the op only ever sees a non-null input.\n const propagate = def.nulls === 'propagate'\n const lifted = propagate && mayBeNull(type)\n const inner = propagate ? stripNull(type) : type\n if (inner.kind === 'never') return issue(`${op} receives only null; nothing to do`)\n\n const out = def.signature(inner, params.data, env)\n if (!out.ok) return issue(out.error)\n\n const bound = def.run(params.data, env, inner)\n steps.push(lifted ? (v, ctx) => (v === null ? NULL_RESULT : bound(v, ctx)) : bound)\n names.push(op)\n type = lifted ? t.nullable(out.value) : out.value\n fallible \|\|= def.fallible(params.data, env, inner)\n omittable = def.terminal === true\n }\n\n return ok({\n type,\n fallible,\n omittable,\n run: (input, ctx) => {\n let v: Val \| Omitted = input\n for (let i = 0; i < steps.length; i++) {\n const r = (steps[i] as Step)(v as Val, ctx)\n if (!r.ok) return err({ ...r.error, step: i, op: names[i] as string })\n v = r.value\n }\n return ok(v)\n },\n })\n}\n","/\n `map`: where the scopes meet. Splits a collection into records, runs one field pipeline per\n * target field with the record as the `extract` scope, and collects the results.\n \n `keep: \"all\"` passes the input fields through alongside the new ones, except those listed in\n * `drop` (the `lookup_entity` rewrite drops its helper fields that way). A failing field\n * applies `on_error`:\n * `null` writes null, `skip_field` leaves the field out, `skip_record` (default) drops the\n * record, `fail_sync` fails the node and stops the run.\n /\n\nimport { z } from 'zod'\nimport { OnError } from '../document'\nimport { type CompiledPipeline, compileSteps } from '../pipeline'\nimport { err, ok } from '../result'\nimport { type MType, stripNull, t } from '../types'\nimport { OMIT, type Rec, type Val } from '../values'\nimport { defineNode, nodeId, type NodeIssue, type Origin, type RunIssue } from './def'\n\nconst field = z.strictObject({ key: z.string().min(1), pipeline: z.array(z.unknown()).min(1) })\n\nconst params = z.strictObject({\n in: nodeId,\n fields: z.array(field).min(1),\n keep: z.enum(['none', 'all']).optional(),\n drop: z.array(z.string().min(1)).optional(),\n on_error: OnError.optional(),\n})\n\nconst SAMPLES = 5\n\nexport const mapNode = defineNode({\n op: 'map',\n label: 'Map fields',\n category: 'transform',\n description: 'One output field per pipeline, computed from each input record.',\n slots: [{ id: 'in', label: 'In', path: ['in'] }],\n output: true,\n defaults: () => ({ in: '', fields: [] }),\n params,\n compile: (p, env) => {\n const input = env.input(p.in)\n const renv = env.recordEnv(input.type)\n const policy = p.on_error ?? env.version.onError ?? 'skip_record'\n const issues: NodeIssue[] = []\n\n const drop = new Set(p.drop ?? [])\n if (drop.size > 0 && p.keep !== 'all')\n issues.push({ message: 'drop applies only with keep: \"all\"' })\n for (const name of drop) {\n if (!Object.hasOwn(input.type.fields, name))\n issues.push({ message: `drop: unknown field '${name}'` })\n }\n const keep = p.keep === 'all' ? Object.keys(input.type.fields).filter((f) => !drop.has(f)) : []\n\n const seen = new Set<string>()\n const compiled: { key: string; pipeline: CompiledPipeline }[] = []\n for (const f of p.fields) {\n if (seen.has(f.key))\n issues.push({ message: `field '${f.key}' is defined twice`, field: f.key })\n seen.add(f.key)\n const c = compileSteps(f.pipeline, renv)\n if (c.ok) compiled.push({ key: f.key, pipeline: c.value })\n else issues.push({ message: c.error.message, field: f.key, step: c.error.step })\n }\n if (issues.length) return { ok: false, error: issues }\n\n const fields: Record<string, MType> = {}\n const origins: Record<string, Origin> = {}\n for (const name of keep) {\n fields[name] = input.type.fields[name] as MType\n origins[name] = input.origins[name] as Origin\n }\n for (const { key, pipeline } of compiled) {\n const soft = pipeline.fallible && (policy === 'null' \|\| policy === 'skip_field')\n const omittable = pipeline.omittable \|\| (pipeline.fallible && policy === 'skip_field')\n fields[key] = soft ? t.nullable(pipeline.type) : pipeline.type\n origins[key] = {\n node: env.id,\n field: key,\n omittable,\n ...(omittable\n ? { present: pipeline.omittable ? stripNull(pipeline.type) : pipeline.type }\n : {}),\n }\n }\n\n return ok({\n output: {\n type: t.record(fields),\n origins,\n canSkip: policy === 'skip_record' && compiled.some((c) => c.pipeline.fallible),\n },\n run: (inputs, ctx) => {\n const errors = new Map<\n string,\n { field: string; code: string; count: number; samples: string[] }\n >()\n const rows: Rec[] = []\n let skipped = 0\n for (const record of inputs(p.in)) {\n const rc = { ...ctx, record }\n const out: Record<string, Val> = {}\n for (const name of keep) if (Object.hasOwn(record, name)) out[name] = record[name] as Val\n let drop = false\n for (const { key, pipeline } of compiled) {\n const r = pipeline.run(null, rc)\n if (r.ok) {\n if (r.value === OMIT) delete out[key]\n else out[key] = r.value\n continue\n }\n const detail = `step ${r.error.step} ${r.error.op}: ${r.error.detail}`\n if (policy === 'fail_sync') {\n return err({ code: r.error.code, message: `${key} ${detail}`, stop: true })\n }\n const k = `${key}\\u0000${r.error.code}`\n const e = errors.get(k) ?? { field: key, code: r.error.code, count: 0, samples: [] }\n e.count += 1\n if (e.samples.length < SAMPLES) e.samples.push(detail)\n errors.set(k, e)\n if (policy === 'null') out[key] = null\n else if (policy === 'skip_field') delete out[key]\n else {\n drop = true\n break\n }\n }\n if (drop) skipped += 1\n else rows.push(out)\n }\n const issues: RunIssue[] = [...errors.values()].map((e) => ({\n node: env.id,\n code: e.code,\n field: e.field,\n message: `${e.field}: ${e.count} records failed (${policy})`,\n count: e.count,\n samples: e.samples,\n }))\n return ok({ rows, skipped, issues })\n },\n })\n },\n})\n","/\n `metrics`: writes a small relation, such as counters, onto the sync run rather than into the\n * domain. Never held back by any check: it describes the run, and matters most when a run\n * is stopped.\n \n `count_by` reports one row per distinct combination of those fields with its number of\n * `rows`, the usual counter, so it needs no `aggregate` in front. The reported relation is the\n * node's output for `expect` (a `keyed` bound alerts on one counter); nothing reads it.\n /\n\nimport { z } from 'zod'\nimport { ok } from '../result'\nimport { type MType, t } from '../types'\nimport { type Json, keyOf, type Rec, sortRecords, toJson } from '../values'\nimport { defineNode, fail, nodeId, type Origin, ownOrigins } from './def'\n\nconst params = z.strictObject({\n in: nodeId,\n name: z.string().min(1),\n count_by: z.array(z.string().min(1)).min(1).optional(),\n})\n\n/* The count field `count_by` adds next to the group fields. /\nconst COUNT = 'rows'\n\nexport const metricsNode = defineNode({\n op: 'metrics',\n label: 'Run metrics',\n category: 'target',\n description: 'Reports a small relation (counters) on the run instead of the domain.',\n slots: [{ id: 'in', label: 'In', path: ['in'] }],\n output: false,\n effect: 'metrics',\n defaults: () => ({ in: '', name: '' }),\n params,\n compile: (p, env) => {\n const input = env.input(p.in)\n const by = p.count_by\n if (!by) {\n return ok({\n output: input,\n run: (inputs) => {\n const rows = sortRecords(inputs(p.in), [])\n return ok({ rows, metric: metric(env.id, p.name, rows) })\n },\n })\n }\n const unknown = by.filter((f) => !Object.hasOwn(input.type.fields, f))\n if (unknown.length) return fail(`count_by: unknown fields: ${unknown.join(', ')}`)\n if (by.includes(COUNT)) return fail(`count_by: '${COUNT}' is the count field; rename it first`)\n const fields: Record<string, MType> = Object.fromEntries(\n by.map((f) => [f, input.type.fields[f] as MType]),\n )\n const type = t.record({ ...fields, [COUNT]: t.number })\n return ok({\n output: {\n type,\n origins: {\n ...ownOrigins(env.id, type),\n ...Object.fromEntries(by.map((f) => [f, input.origins[f] as Origin])),\n },\n },\n run: (inputs) => {\n const groups = new Map<string, { first: Rec; n: number }>()\n for (const row of inputs(p.in)) {\n const k = keyOf(row, by)\n const group = groups.get(k)\n if (group) group.n += 1\n else groups.set(k, { first: row, n: 1 })\n }\n const counted = [...groups.values()].map(({ first, n }) => ({\n ...Object.fromEntries(by.map((f) => [f, first[f] ?? null])),\n [COUNT]: n,\n }))\n const rows = sortRecords(counted, by)\n return ok({ rows, metric: metric(env.id, p.name, rows) })\n },\n })\n },\n})\n\nfunction metric(node: string, name: string, rows: readonly Rec[]) {\n return { node, name, rows: rows.map((r) => toJson(r) as Record<string, Json>) }\n}\n","/\n `sink`: upserts its input on `key` into the internal model. Every input field is written to\n * the target path it names (`product.sku`, or a bare `sku` on the sink's own `target`), or\n * to the path `columns` renames it to. Types are enforced here against the host's\n * `TargetSchema`: an unknown path, a wrong type, or a nullable value for a required field\n * fails at save, blamed on the `map` field that produced it.\n \n A reference field listed in `refs` is written as a natural key of the entity it references\n * (`product_id` as a SKU, a lane as its `(from, to)` pair) and typed by those fields, so a\n * key of the wrong shape fails at save; the host resolves it to an id when it writes. Key\n * fields must be non-null, except a nullable identity field of an entity whose identity\n * matches NULLs as equal (the inbound supplier lane, `from_warehouse_id = NULL`).\n \n `mode: 'replace'` makes the rows the complete set of the target for the company: the host\n * reconciles with `synchronize_all`, deleting rows this run no longer produces. That is what a\n * presence-only entity needs (an exclusion row is the rule). Because a short source read\n * would then delete real rows, `in` must carry a `count` expectation with a lower bound\n * (`min` or `shiftRatio.min`) whose action is `stop` or `skip_downstream`.\n \n The library performs no write: a run returns the rows, sorted by key, for the host.\n /\n\nimport { z } from 'zod'\nimport type { TargetEntity, TargetField, TargetSchema } from '../../schema'\nimport { resolveAction } from '../expect'\nimport { err, ok, type Result } from '../result'\nimport { type Instant, toDateString } from '../time'\nimport {\n assignable,\n fromLogicalType,\n type MType,\n mayBeNull,\n nullableIf,\n show,\n stripNull,\n t,\n} from '../types'\nimport { compareVals, type Json, keyOf, type Rec, toJson, type Val } from '../values'\nimport {\n defineNode,\n nodeId,\n type NodeIssue,\n type Origin,\n type SinkRef,\n type WritePolicy,\n} from './def'\n\nconst params = z.strictObject({\n in: nodeId,\n target: z.string().min(1),\n key: z.array(z.string().min(1)).min(1),\n columns: z.record(z.string(), z.string().min(1)).optional(),\n write: z.record(z.string(), z.enum(['overwrite', 'fill_if_null', 'never'])).optional(),\n refs: z.record(z.string(), z.strictObject({ by: z.array(z.string().min(1)).min(1) })).optional(),\n mode: z.enum(['upsert', 'replace']).optional(),\n})\n\ninterface Resolved {\n readonly entity: TargetEntity\n readonly field: TargetField\n readonly type: MType\n}\n\n/* `entity.field` names any entity; a bare name is a field of the sink's own target. /\nexport function resolveTarget(\n targets: TargetSchema,\n target: string,\n path: string,\n): Result<Resolved, string> {\n const dot = path.indexOf('.')\n const [entityName, fieldName] =\n dot < 0 ? [target, path] : [path.slice(0, dot), path.slice(dot + 1)]\n const entity = targets.entities.find((e) => e.name === entityName)\n if (!entity) return err(`target has no entity '${entityName}'`)\n const field = entity.fields.find((f) => f.name === fieldName)\n if (!field) return err(`${entityName} has no field '${fieldName}'`)\n return ok({ entity, field, type: nullableIf(fromLogicalType(field.logicalType), field.nullable) })\n}\n\n/\n The type of a reference field written as a natural key: the type of its one `by` field of\n * the referenced entity, or a tuple of them in `by` order (each with its own nullability).\n /\nexport function refType(\n targets: TargetSchema,\n field: TargetField,\n by: readonly string[],\n): Result<{ entity: string; type: MType }, string> {\n if (!field.references) return err(`${field.name} is not a reference`)\n const entity = targets.entities.find((e) => e.name === field.references)\n if (!entity) return err(`target has no entity '${field.references}'`)\n const parts: MType[] = []\n for (const name of by) {\n const part = entity.fields.find((f) => f.name === name)\n if (!part) return err(`${entity.name} has no field '${name}'`)\n parts.push(nullableIf(fromLogicalType(part.logicalType), part.nullable))\n }\n const value = parts.length === 1 ? stripNull(parts[0] as MType) : t.tuple(parts)\n return ok({ entity: entity.name, type: nullableIf(value, field.nullable) })\n}\n\n/* A nullable key field is allowed where the target identity matches NULLs as equal. /\nconst nullsEqual = ({ entity, field }: Resolved) =>\n field.nullable && entity.nullsNotDistinct === true && entity.identity.includes(field.name)\n\nexport const sinkNode = defineNode({\n op: 'sink',\n label: 'Write to target',\n category: 'target',\n description: 'Writes rows into a Spherecast entity, updating records with the same key.',\n slots: [{ id: 'in', label: 'In', path: ['in'] }],\n output: false,\n effect: 'sink',\n defaults: () => ({ in: '', target: '', key: [] }),\n params,\n compile: (p, env) => {\n const input = env.input(p.in)\n const issues: NodeIssue[] = []\n const targets = env.graph.targets\n if (!targets.entities.some((e) => e.name === p.target)) {\n return { ok: false, error: [{ message: `target has no entity '${p.target}'` }] }\n }\n const fieldNames = Object.keys(input.type.fields)\n for (const name of [\n ...Object.keys(p.columns ?? {}),\n ...Object.keys(p.write ?? {}),\n ...Object.keys(p.refs ?? {}),\n ]) {\n if (!fieldNames.includes(name))\n issues.push({ message: `'${name}' is not a field of ${p.in}` })\n }\n\n const paths: Record<string, string> = {}\n const logical: Record<string, TargetField['logicalType']> = {}\n const resolvedOf: Record<string, Resolved> = {}\n const refs: Record<string, SinkRef> = {}\n const entities = new Set([p.target])\n for (const name of fieldNames) {\n const path = p.columns?.[name] ?? name\n const origin = input.origins[name] as Origin\n const blame = { node: origin.node, field: origin.field }\n const resolved = resolveTarget(targets, p.target, path)\n if (!resolved.ok) {\n issues.push({ message: resolved.error, ...blame })\n continue\n }\n let expected = resolved.value.type\n const ref = p.refs?.[name]\n if (ref) {\n const typed = refType(targets, resolved.value.field, ref.by)\n if (!typed.ok) {\n issues.push({ message: `refs.${name}: ${typed.error}` })\n continue\n }\n expected = typed.value.type\n refs[path] = { entity: typed.value.entity, by: ref.by }\n }\n const type = input.type.fields[name] as MType\n const present = origin.present ?? type\n if (!assignable(present, expected)) {\n issues.push({\n message: `${path} expects ${show(expected)}, got ${show(present)}`,\n ...blame,\n })\n }\n paths[name] = path\n logical[name] = resolved.value.field.logicalType\n resolvedOf[name] = resolved.value\n entities.add(resolved.value.entity.name)\n }\n for (const k of p.key) {\n const type = input.type.fields[k]\n const resolved = resolvedOf[k]\n if (!type) issues.push({ message: `key '${k}' is not a field of ${p.in}` })\n else if (\n mayBeNull(type) &&\n ((input.origins[k] as Origin).omittable \|\| !resolved \|\| !nullsEqual(resolved))\n ) {\n issues.push({ message: `key '${k}' must be non-null, got ${show(type)}` })\n }\n }\n if (p.mode === 'replace') {\n const exp = env.version.expect[p.in]\n const lower = exp?.count?.min !== undefined \|\| exp?.count?.shiftRatio?.min !== undefined\n const action = resolveAction(exp?.onFail, 'count')\n if (!lower \|\| (action !== 'stop' && action !== 'skip_downstream')) {\n issues.push({\n message: `mode 'replace' deletes rows this run does not produce; give ${p.in} a count expectation with a lower bound and onFail stop or skip_downstream`,\n })\n }\n }\n if (issues.length) return { ok: false, error: issues }\n\n const keyPaths = p.key.map((k) => paths[k] as string)\n const write = p.write\n ? Object.fromEntries(\n Object.entries(p.write).map(([f, w]) => [paths[f] as string, w as WritePolicy]),\n )\n : undefined\n\n return ok({\n output: null,\n writes: [...entities].sort(),\n run: (inputs, ctx) => {\n // Key fields are never omittable, so every row has them (null only where allowed).\n const rows = [...inputs(p.in)].sort((a, b) => {\n for (const k of p.key) {\n const c = compareVals(a[k] as Val, b[k] as Val)\n if (c !== 0) return c\n }\n return 0\n })\n for (let i = 1; i < rows.length; i++) {\n if (keyOf(rows[i] as Rec, p.key) === keyOf(rows[i - 1] as Rec, p.key)) {\n const sample = p.key.map((k) => toJson((rows[i] as Rec)[k] as Val))\n return err({\n code: 'duplicate_key',\n message: `${p.key.join(', ')} ${JSON.stringify(sample)} is written twice`,\n samples: [sample],\n })\n }\n }\n const out = rows.map((row) => {\n const target: Record<string, Json> = {}\n for (const name of fieldNames) {\n if (!Object.hasOwn(row, name)) continue\n const v = row[name] ?? null\n const kind = logical[name]\n target[paths[name] as string] =\n v !== null && kind === 'date' ? toDateString(v as Instant, ctx.tz) : toJson(v)\n }\n return target\n })\n return ok({\n rows: out,\n write: {\n sink: env.id,\n target: p.target,\n key: keyPaths,\n rows: out,\n ...(write ? { write } : {}),\n ...(Object.keys(refs).length ? { refs } : {}),\n ...(p.mode === 'replace' ? { mode: 'replace' as const } : {}),\n },\n })\n },\n })\n },\n})\n","/\n `transform`: the collection-scope escape hatch. Calls reviewed, version-pinned code the host\n * registers in `GraphEnv.transforms`; its declared output `schema` (JSON Schema of one record)\n * keeps the rest of the graph type-checked, and its rows are checked against it at runtime.\n /\n\nimport { z } from 'zod'\nimport type { TransformDef } from '../context'\nimport { JsonSchema } from '../document'\nimport { sourceRecordType } from '../jsonschema'\nimport { err, ok } from '../result'\nimport { defineNode, fail, nodeId, ownOrigins } from './def'\nimport { loadRows } from './source'\n\nconst params = z.strictObject({\n ref: z.string().min(1),\n inputs: z.array(nodeId).min(1),\n schema: JsonSchema,\n})\n\nexport const transformNode = defineNode({\n op: 'transform',\n label: 'Transform (code)',\n category: 'transform',\n description: 'Reviewed, version-pinned code with a declared output schema.',\n slots: [{ id: 'inputs', label: 'Inputs', path: ['inputs'], multiple: true }],\n output: true,\n defaults: () => ({ ref: '', inputs: [], schema: { type: 'object', properties: {} } }),\n params,\n compile: (p, env) => {\n for (const id of p.inputs) env.input(id)\n const transforms = env.graph.transforms ?? {}\n if (!Object.hasOwn(transforms, p.ref)) return fail(`unknown transform '${p.ref}'`)\n const type = sourceRecordType(p.schema)\n if (!type.ok) return fail(`schema: ${type.error}`)\n const record = type.value\n const transform = transforms[p.ref] as TransformDef\n return ok({\n output: { type: record, origins: ownOrigins(env.id, record) },\n run: (inputs, ctx) => {\n const result = transform.run(p.inputs.map(inputs), ctx)\n if (!result.ok) return err({ code: 'transform_failed', message: result.error })\n const loaded = loadRows(env.id, result.value, record)\n return loaded.ok ? ok({ rows: loaded.value }) : loaded\n },\n })\n },\n})\n","/\n `union`: set union of inputs with the same fields. Field types must agree up to\n * nullability (a field nullable in any input is nullable in the output); project with a\n * `map` first otherwise. Duplicates collapse.\n /\n\nimport { z } from 'zod'\nimport { expectOk, ok } from '../result'\nimport { type MType, show, t, unify } from '../types'\nimport { keyOf, type Rec } from '../values'\nimport { defineNode, fail, nodeId, type NodeIssue, type Origin } from './def'\n\nconst params = z.strictObject({ inputs: z.array(nodeId).min(2) })\n\nexport const unionNode = defineNode({\n op: 'union',\n label: 'Union',\n category: 'transform',\n description: 'All records of several inputs with the same fields; duplicates collapse.',\n slots: [{ id: 'inputs', label: 'Inputs', path: ['inputs'], multiple: true }],\n output: true,\n defaults: () => ({ inputs: [] }),\n params,\n compile: (p, env) => {\n const outputs = p.inputs.map((id) => env.input(id))\n const first = outputs[0] as (typeof outputs)[number]\n const names = Object.keys(first.type.fields).sort()\n const issues: NodeIssue[] = []\n const fields: Record<string, MType> = {}\n const origins: Record<string, Origin> = {}\n for (const [i, out] of outputs.entries()) {\n const other = Object.keys(out.type.fields).sort()\n if (other.join('\\u0000') !== names.join('\\u0000')) {\n return fail(\n `${p.inputs[i]} has fields ${other.join(', ')}; ${p.inputs[0]} has ${names.join(', ')}`,\n )\n }\n }\n for (const name of names) {\n let type: MType = t.never\n let present: MType = t.never\n let omittable = false\n for (const [i, out] of outputs.entries()) {\n const field = out.type.fields[name] as MType\n const u = unify(type, field)\n if (!u.ok) {\n issues.push({\n message: `${name}: ${p.inputs[i]} gives ${show(field)}, earlier inputs ${show(type)}`,\n })\n break\n }\n type = u.value\n const origin = out.origins[name] as Origin\n omittable \|\|= origin.omittable\n present = expectOk(unify(present, origin.present ?? field))\n }\n fields[name] = type\n origins[name] = { node: env.id, field: name, omittable, ...(omittable ? { present } : {}) }\n }\n if (issues.length) return { ok: false, error: issues }\n return ok({\n output: { type: t.record(fields), origins },\n run: (inputs) => {\n const seen = new Set<string>()\n const rows: Rec[] = []\n for (const id of p.inputs) {\n for (const row of inputs(id)) {\n const k = keyOf(row, names)\n if (seen.has(k)) continue\n seen.add(k)\n rows.push(row)\n }\n }\n return ok({ rows })\n },\n })\n },\n})\n","/* The collection node registry, and the catalog the editor builds its palette from. /\n\nimport { aggregateNode } from './aggregate'\nimport { assertNode } from './assert'\nimport type { NodeCategory, NodeDef, Slot } from './def'\nimport { distinctNode } from './distinct'\nimport { filterNode } from './filter'\nimport { joinNode } from './join'\nimport { mapNode } from './map'\nimport { metricsNode } from './metrics'\nimport { sinkNode } from './sink'\nimport { sourceNode } from './source'\nimport { transformNode } from './transform'\nimport { unionNode } from './union'\n\nexport type from './def'\nexport { defineNode } from './def'\nexport { refType, resolveTarget } from './sink'\nexport { findCycle } from './assert'\n\nconst all = [\n sourceNode,\n mapNode,\n filterNode,\n joinNode,\n aggregateNode,\n distinctNode,\n unionNode,\n sinkNode,\n metricsNode,\n assertNode,\n transformNode,\n]\n\nexport const nodeRegistry: Readonly<Record<string, NodeDef<unknown>>> = Object.fromEntries(\n all.map((def) => [def.op, def as unknown as NodeDef<unknown>]),\n)\n\n/** What the editor needs to place a node and draw its handles. /\nexport interface CatalogEntry {\n readonly op: string\n readonly label: string\n readonly category: NodeCategory\n readonly description: string\n readonly slots: readonly Slot[]\n readonly output: boolean\n readonly defaults: () => Record<string, unknown>\n}\n\nexport const nodeCatalog: readonly CatalogEntry[] = all.map(\n ({ op, label, category, description, slots, output, defaults }) => ({\n op,\n label,\n category,\n description,\n slots,\n output,\n defaults,\n }),\n)\n","/\n Edges are implied by input references (`in`, `left`, `right`, `inputs`, and an assert's\n * `per.in` / `remove.in`); each node definition's `slots` name them. Everything that walks the\n * graph (ordering, dead nodes, lineage, freeing edges, the editor's edges) reads them here.\n /\n\nimport type { NodeJson } from './document'\nimport { nodeRegistry } from './nodes'\n\nexport interface Ref {\n /* Slot id on the consuming node. /\n readonly slot: string\n /* Id of the referenced (upstream) node. /\n readonly source: string\n /* Position within a `multiple` slot. /\n readonly index?: number\n}\n\nfunction at(node: Readonly<Record<string, unknown>>, path: readonly string[]): unknown {\n let value: unknown = node\n for (const key of path) {\n if (typeof value !== 'object' \|\| value === null) return undefined\n value = (value as Record<string, unknown>)[key]\n }\n return value\n}\n\n/* The input references of a node, slot by slot. Unknown ops have none. /\nexport function nodeRefs(node: NodeJson): Ref[] {\n const def = Object.hasOwn(nodeRegistry, node.op) ? nodeRegistry[node.op] : undefined\n if (!def) return []\n const refs: Ref[] = []\n for (const slot of def.slots) {\n const value = at(node, slot.path)\n if (slot.multiple && Array.isArray(value)) {\n for (const [index, source] of value.entries()) {\n if (typeof source === 'string' && source !== '') refs.push({ slot: slot.id, source, index })\n }\n } else if (typeof value === 'string' && value !== '') {\n refs.push({ slot: slot.id, source: value })\n }\n }\n return refs\n}\n\n/* Distinct upstream ids of a node, in slot order. /\nexport function inputIds(node: NodeJson): string[] {\n return [...new Set(nodeRefs(node).map((r) => r.source))]\n}\n\n/* Downstream neighbours of every node (only references to existing nodes). /\nexport function consumers(nodes: readonly NodeJson[]): Map<string, string[]> {\n const ids = new Set(nodes.map((n) => n.id))\n const next = new Map<string, string[]>(nodes.map((n) => [n.id, []]))\n for (const node of nodes) {\n for (const source of inputIds(node)) {\n if (ids.has(source)) (next.get(source) as string[]).push(node.id)\n }\n }\n return next\n}\n\nfunction reach(start: string, next: ReadonlyMap<string, readonly string[]>): Set<string> {\n const seen = new Set<string>()\n const stack = [...(next.get(start) ?? [])]\n while (stack.length > 0) {\n const id = stack.pop() as string\n if (seen.has(id)) continue\n seen.add(id)\n stack.push(...(next.get(id) as readonly string[]))\n }\n return seen\n}\n\n/* Every node fed by `id`, directly or not (not including `id`). /\nexport function downstream(nodes: readonly NodeJson[], id: string): Set<string> {\n return reach(id, consumers(nodes))\n}\n\n/* Every node feeding `id`, directly or not (not including `id`). /\nexport function upstream(nodes: readonly NodeJson[], id: string): Set<string> {\n const ids = new Set(nodes.map((n) => n.id))\n const prev = new Map(nodes.map((n) => [n.id, inputIds(n).filter((s) => ids.has(s))]))\n return reach(id, prev)\n}\n\n/* One cycle as node ids (first repeated at the end), or null if acyclic. /\nexport function findGraphCycle(nodes: readonly NodeJson[]): string[] \| null {\n const next = consumers(nodes)\n const state = new Map<string, 'open' \| 'done'>()\n const path: string[] = []\n const visit = (id: string): string[] \| null => {\n state.set(id, 'open')\n path.push(id)\n for (const to of next.get(id) as string[]) {\n if (state.get(to) === 'open') return [...path.slice(path.indexOf(to)), to]\n if (!state.has(to)) {\n const cycle = visit(to)\n if (cycle) return cycle\n }\n }\n path.pop()\n state.set(id, 'done')\n return null\n }\n for (const node of nodes) {\n if (state.has(node.id)) continue\n const cycle = visit(node.id)\n if (cycle) return cycle\n }\n return null\n}\n\n/\n Node ids with every node after the nodes it reads; ties keep document order, so the result\n * is stable. Nodes on a cycle are left out (check `findGraphCycle` first).\n /\nexport function topologicalOrder(nodes: readonly NodeJson[]): string[] {\n const next = consumers(nodes)\n const indegree = new Map(nodes.map((n) => [n.id, 0]))\n for (const targets of next.values())\n for (const t of targets) indegree.set(t, (indegree.get(t) as number) + 1)\n const position = new Map(nodes.map((n, i) => [n.id, i]))\n const ready = nodes.filter((n) => indegree.get(n.id) === 0).map((n) => n.id)\n const order: string[] = []\n while (ready.length > 0) {\n ready.sort((a, b) => (position.get(a) as number) - (position.get(b) as number))\n const id = ready.shift() as string\n order.push(id)\n for (const to of next.get(id) as string[]) {\n const remaining = (indegree.get(to) as number) - 1\n indegree.set(to, remaining)\n if (remaining === 0) ready.push(to)\n }\n }\n return order\n}\n","/\n The graph compiler (arch.md, \"The compiler\"): walks nodes in topological order, threading\n * record types along edges, and compiles each node into a closure in the same pass. The\n * result is one plan per version; a run never touches JSON.\n \n Every problem is collected in one pass and located by node, field and step. A node whose\n * inputs failed to compile is skipped silently, so one mistake does not cascade.\n /\n\nimport { type GraphEnv, recordEnv } from './context'\nimport type { MappingVersion, NodeJson } from './document'\nimport { type Checker, compileExpectation } from './expect'\nimport { consumers, findGraphCycle, inputIds, nodeRefs, topologicalOrder } from './graph'\nimport { type CompiledNode, nodeRegistry, type NodeEnv, type NodeOutput } from './nodes'\nimport type { CompileIssue } from './result'\nimport { normalizeVersion } from './sugar'\nimport type { RecordType } from './types'\n\nexport interface PlannedNode {\n readonly id: string\n readonly op: string\n /* Parsed params. /\n readonly params: Readonly<Record<string, unknown>>\n readonly inputs: readonly string[]\n readonly output: NodeOutput \| null\n readonly effect?: 'sink' \| 'metrics' \| 'check'\n readonly run: CompiledNode['run']\n /* The node's `expect` entry, compiled. /\n readonly check?: Checker\n /* Sinks downstream of this node, itself included: the reach of `skip_downstream`. /\n readonly sinks: readonly string[]\n /* Upstream of (or is) a `metrics` node: keeps running after a `stop`. /\n readonly feedsMetrics: boolean\n}\n\nexport interface Plan {\n /* The normalized version the plan was compiled from. /\n readonly version: MappingVersion\n readonly nodes: readonly PlannedNode[]\n /* Index of the last node reading each node's output; the edge is freed after it. /\n readonly lastUse: ReadonlyMap<string, number>\n /* Some predicate reads the run clock (`today`, `now`). /\n readonly usesClock: boolean\n}\n\n/\n `types` holds the output record type of every node that compiled, also when others did\n * not, so an editor can offer the fields reaching a node while the graph is half built.\n /\nexport type CompileResult =\n \| {\n readonly ok: true\n readonly plan: Plan\n readonly issues: readonly []\n readonly types: Readonly<Record<string, RecordType>>\n }\n \| {\n readonly ok: false\n readonly issues: readonly CompileIssue[]\n readonly types: Readonly<Record<string, RecordType>>\n }\n\nfunction paramsOf(node: NodeJson): Record<string, unknown> {\n const { id: _i, op: _o, label: _l, ...rest } = node\n return rest\n}\n\n/\n Structural rules that need no types: unique ids, known ops, resolvable references,\n * acyclic, no dead nodes, addressable `expect` keys. Checked in the browser too.\n /\nexport function structuralIssues(version: MappingVersion): CompileIssue[] {\n const issues: CompileIssue[] = []\n const byId = new Map<string, NodeJson>()\n for (const node of version.nodes) {\n if (byId.has(node.id))\n issues.push({ code: 'duplicate_id', message: `id '${node.id}' is used twice`, node: node.id })\n byId.set(node.id, node)\n }\n for (const node of version.nodes) {\n const def = Object.hasOwn(nodeRegistry, node.op) ? nodeRegistry[node.op] : undefined\n if (!def) {\n issues.push({ code: 'unknown_op', message: `unknown node op '${node.op}'`, node: node.id })\n continue\n }\n const refs = nodeRefs(node)\n for (const slot of def.slots) {\n if (!slot.optional && !refs.some((r) => r.slot === slot.id)) {\n issues.push({\n code: 'missing_input',\n message: `input '${slot.label}' is not connected`,\n node: node.id,\n })\n }\n }\n for (const ref of refs) {\n const source = byId.get(ref.source)\n if (!source) {\n issues.push({\n code: 'dangling_ref',\n message: `'${ref.slot}' refers to unknown node '${ref.source}'`,\n node: node.id,\n })\n } else if (nodeRegistry[source.op] && !nodeRegistry[source.op]?.output) {\n issues.push({\n code: 'dangling_ref',\n message: `'${ref.source}' (${source.op}) has no output to read`,\n node: node.id,\n })\n }\n }\n }\n const cycle = findGraphCycle(version.nodes)\n if (cycle) issues.push({ code: 'cycle', message: `cycle: ${cycle.join(' -> ')}`, node: cycle[0] })\n\n // No dead nodes: every node must reach a sink, metrics or assert.\n const live = new Set<string>()\n const effectful = (n: NodeJson) => nodeRegistry[n.op]?.effect !== undefined\n const stack = version.nodes.filter(effectful).map((n) => n.id)\n const prev = new Map(version.nodes.map((n) => [n.id, inputIds(n)]))\n while (stack.length > 0) {\n const id = stack.pop() as string\n if (live.has(id)) continue\n live.add(id)\n stack.push(...(prev.get(id) ?? []))\n }\n for (const node of version.nodes) {\n if (!live.has(node.id) && nodeRegistry[node.op]) {\n issues.push({\n code: 'dead_node',\n message: 'reaches no sink, metrics or assert',\n node: node.id,\n })\n }\n }\n for (const id of Object.keys(version.expect)) {\n if (!byId.has(id))\n issues.push({\n code: 'unknown_reference',\n message: `expect names unknown node '${id}'`,\n field: id,\n })\n }\n return issues\n}\n\n/* Compile a version against the host's environment. /\nexport function compileVersion(input: MappingVersion, env: GraphEnv): CompileResult {\n const normalized = normalizeVersion(input, env)\n const version = normalized.version\n const issues: CompileIssue[] = [...normalized.issues, ...structuralIssues(version)]\n if (issues.some((i) => i.code === 'cycle' \|\| i.code === 'duplicate_id'))\n return { ok: false, issues, types: {} }\n\n const byId = new Map(version.nodes.map((n) => [n.id, n]))\n const clock = { used: false }\n const outputs = new Map<string, NodeOutput>()\n const compiled = new Map<string, CompiledEntry>()\n const renv = (record: RecordType) =>\n recordEnv(record, {\n params: version.params,\n tables: version.tables,\n functions: env.functions ?? {},\n clock,\n })\n\n for (const id of topologicalOrder(version.nodes)) {\n const node = byId.get(id) as NodeJson\n const def = Object.hasOwn(nodeRegistry, node.op) ? nodeRegistry[node.op] : undefined\n if (!def) continue\n const refs = inputIds(node)\n if (refs.some((r) => !outputs.has(r))) continue // blocked by an upstream problem\n\n const parsed = def.params.safeParse(paramsOf(node))\n if (!parsed.success) {\n for (const x of parsed.error.issues) {\n issues.push({\n code: 'invalid_params',\n message: `${x.path.length ? `${x.path.join('.')}: ` : ''}${x.message}`,\n node: id,\n })\n }\n continue\n }\n const exp = version.expect[id]\n const nodeEnv: NodeEnv = {\n id,\n graph: env,\n version,\n ...(exp ? { expect: exp } : {}),\n clock,\n input: (ref) => outputs.get(ref) as NodeOutput,\n recordEnv: renv,\n }\n const result = def.compile(parsed.data, nodeEnv)\n if (!result.ok) {\n for (const x of result.error) {\n issues.push({\n code: x.code ?? 'type_error',\n message: x.message,\n node: x.node ?? id,\n ...(x.field === undefined ? {} : { field: x.field }),\n ...(x.step === undefined ? {} : { step: x.step }),\n })\n }\n continue\n }\n let output = result.value.output\n let check: Checker \| undefined\n if (exp) {\n if (!output) {\n issues.push({\n code: 'invalid_expectation',\n message: `${node.op} has no output to expect on`,\n node: id,\n })\n continue\n }\n const e = compileExpectation(id, exp, output, renv)\n if (!e.ok) {\n for (const x of e.error) {\n // Every expectation issue names its clause.\n issues.push({\n code: 'invalid_expectation',\n message: x.message,\n node: id,\n field: x.field as string,\n })\n }\n continue\n }\n output = e.value.output\n check = e.value.check\n }\n if (output) outputs.set(id, output)\n compiled.set(id, {\n node: { ...result.value, output },\n params: parsed.data as Record<string, unknown>,\n ...(check ? { check } : {}),\n })\n }\n\n issues.push(...sinkIssues(compiled), ...skipIssues(version, compiled))\n const types = Object.fromEntries([...outputs].map(([id, output]) => [id, output.type]))\n if (issues.length > 0) return { ok: false, issues: dedupe(issues), types }\n return { ok: true, plan: plan(version, compiled, clock.used), issues: [], types }\n}\n\ninterface CompiledEntry {\n readonly node: CompiledNode\n readonly params: Record<string, unknown>\n readonly check?: Checker\n}\n\ntype Compiled = ReadonlyMap<string, CompiledEntry>\n\n/* Sugar that fails to expand is reported by normalization and again by the step compiler. /\nfunction dedupe(issues: readonly CompileIssue[]): CompileIssue[] {\n const seen = new Set<string>()\n return issues.filter((i) => {\n const key = JSON.stringify([i.node, i.field, i.step, i.message])\n if (seen.has(key)) return false\n seen.add(key)\n return true\n })\n}\n\n/* One sink per target entity (structural rule 3): resolve overlaps with a union. /\nfunction sinkIssues(compiled: Compiled): CompileIssue[] {\n const writers = new Map<string, string[]>()\n for (const [id, c] of compiled) {\n for (const entity of c.node.writes ?? [])\n writers.set(entity, [...(writers.get(entity) ?? []), id])\n }\n return [...writers]\n .filter(([, sinks]) => sinks.length > 1)\n .map(([entity, sinks]) => ({\n code: 'duplicate_sink' as const,\n message: `${sinks.join(' and ')} both write ${entity}; union their inputs into one sink`,\n node: sinks[1] as string,\n }))\n}\n\n/\n Limitation #20: a map that can drop records upstream of a join or aggregate can flip its\n * result, so the first join or aggregate on every path from it must declare `tolerate_skips`.\n /\nfunction skipIssues(version: MappingVersion, compiled: Compiled): CompileIssue[] {\n const next = consumers(version.nodes)\n const byId = new Map(version.nodes.map((n) => [n.id, n]))\n const issues: CompileIssue[] = []\n for (const [id, c] of compiled) {\n // Only a map drops records; nodes downstream of it may carry its `canSkip` along.\n if (byId.get(id)?.op !== 'map' \|\| !c.node.output?.canSkip) continue\n const seen = new Set<string>()\n const stack = [...(next.get(id) as string[])]\n while (stack.length > 0) {\n const n = stack.pop() as string\n if (seen.has(n)) continue\n seen.add(n)\n const node = byId.get(n) as NodeJson\n const def = nodeRegistry[node.op]\n if (def?.toleratesSkips) {\n const params = compiled.get(n)?.params\n if (params && !def.toleratesSkips(params)) {\n issues.push({\n code: 'skip_tolerance',\n message: `${id} can drop records (on_error skip_record with a fallible field); set tolerate_skips: true here or change ${id}'s on_error`,\n node: n,\n })\n }\n continue\n }\n stack.push(...(next.get(n) as string[]))\n }\n }\n return issues\n}\n\nfunction plan(version: MappingVersion, compiled: Compiled, usesClock: boolean): Plan {\n const order = topologicalOrder(version.nodes)\n const byId = new Map(version.nodes.map((n) => [n.id, n]))\n const next = consumers(version.nodes)\n const lastUse = new Map<string, number>()\n for (const [i, id] of order.entries()) {\n for (const ref of inputIds(byId.get(id) as NodeJson)) lastUse.set(ref, i)\n }\n const sinksBelow = new Map<string, string[]>()\n const metricsBelow = new Map<string, boolean>()\n for (const id of [...order].reverse()) {\n const op = (byId.get(id) as NodeJson).op\n // Reverse topological order: every consumer is done before the node it reads.\n const below = next.get(id) as string[]\n const sinks = below.flatMap((b) => sinksBelow.get(b) as string[])\n sinksBelow.set(id, [...new Set(op === 'sink' ? [id, ...sinks] : sinks)].sort())\n metricsBelow.set(id, op === 'metrics' \|\| below.some((b) => metricsBelow.get(b)))\n }\n const nodes: PlannedNode[] = order.map((id) => {\n const node = byId.get(id) as NodeJson\n const c = compiled.get(id) as CompiledEntry\n const def = nodeRegistry[node.op]\n return {\n id,\n op: node.op,\n params: c.params,\n inputs: inputIds(node),\n output: c.node.output,\n ...(def?.effect ? { effect: def.effect } : {}),\n run: c.node.run,\n ...(c.check ? { check: c.check } : {}),\n sinks: sinksBelow.get(id) as string[],\n feedsMetrics: metricsBelow.get(id) as boolean,\n }\n })\n return { version, nodes, lastUse, usesClock }\n}\n","/\n The executor (arch.md, \"Execution\"). Runs a compiled plan over a frozen snapshot: every node\n * once, in topological order, each edge held only until its last consumer has run. Nothing is\n * written: sinks return their rows, and the host writes those with status `write`.\n \n Failure stays as local as lineage allows. A failed node skips what depends on it while\n * independent branches proceed; `skip_downstream` holds back exactly the sinks below a node;\n * `stop` (or `on_error: fail_sync`) holds back every sink, but nodes feeding `metrics` still\n * run, because metrics describe the run and matter most when it stops.\n /\n\nimport type { RunContext } from './context'\nimport type { Plan } from './compile'\nimport type { Metric, NodeRun, RunIssue, SinkWrite } from './nodes'\nimport { Instant } from './time'\nimport { type Relation, toJson } from './values'\n\nexport interface RunInput {\n /* The run's frozen clock: an instant, or an ISO string with an offset. /\n readonly now: Instant \| string\n /* IANA time zone for calendar math; defaults to UTC. /\n readonly tz?: string\n readonly locale?: string\n readonly syncRunId?: string\n /* Previous output counts per node id, for `count.shiftRatio`. /\n readonly baseline?: Readonly<Record<string, number>>\n}\n\nexport interface ExecuteOptions {\n /* Keep every node's output in the result (previews, fixtures). /\n readonly retain?: boolean\n /* Fixture mode: run every node even after a stop, skip production `count` envelopes. /\n readonly fixture?: boolean\n /* Elapsed-time clock for statistics; defaults to `performance.now`. /\n readonly clock?: () => number\n}\n\nexport type NodeStatus = 'ok' \| 'failed' \| 'upstream_failed' \| 'stopped'\n\nexport interface NodeStats {\n readonly node: string\n readonly op: string\n readonly status: NodeStatus\n readonly rowsIn: number\n readonly rowsOut: number\n readonly skipped: number\n readonly changed: number\n readonly ms: number\n}\n\nexport type SinkStatus = 'write' \| 'held' \| 'stopped' \| 'failed' \| 'upstream_failed'\n\nexport interface SinkResult {\n readonly sink: string\n readonly status: SinkStatus\n /* Present only with status `write`. /\n readonly write?: SinkWrite\n}\n\nexport interface RunResult {\n /* `stopped`: nothing may be written. `partial`: some sink is not `write`. /\n readonly status: 'ok' \| 'partial' \| 'stopped'\n readonly sinks: readonly SinkResult[]\n readonly metrics: readonly Metric[]\n readonly stats: readonly NodeStats[]\n readonly issues: readonly RunIssue[]\n /* Every node's output, with `retain`. Sinks hold the rows they would write. /\n readonly outputs?: Readonly<Record<string, Relation>>\n}\n\nexport type Snapshot = Readonly<Record<string, readonly Readonly<Record<string, unknown>>[]>>\n\n/* Sources the host must read, once each, before a run. /\nexport function readPlan(plan: Plan): { node: string; system: string; entity: string }[] {\n return plan.nodes\n .filter((n) => n.op === 'source')\n .map((n) => ({ node: n.id, system: String(n.params.system), entity: String(n.params.entity) }))\n}\n\n/* Read every source once and freeze the result into a snapshot. /\nexport async function readSnapshot(\n plan: Plan,\n read: (source: {\n node: string\n system: string\n entity: string\n }) => Promise<readonly Readonly<Record<string, unknown>>[]>,\n): Promise<Snapshot> {\n const snapshot: Record<string, readonly Readonly<Record<string, unknown>>[]> = {}\n for (const source of readPlan(plan))\n snapshot[source.node] = Object.freeze([...(await read(source))])\n return Object.freeze(snapshot)\n}\n\nexport function execute(\n plan: Plan,\n snapshot: Snapshot,\n run: RunInput,\n options: ExecuteOptions = {},\n): RunResult {\n const now = typeof run.now === 'string' ? Instant.parse(run.now) : run.now\n if (!now) throw new Error(`run.now '${String(run.now)}' is not an ISO instant`)\n const clock = options.clock ?? (() => performance.now())\n const ctx: RunContext = Object.freeze({\n now,\n tz: run.tz ?? 'UTC',\n locale: run.locale ?? 'en',\n snapshot: snapshot as RunContext['snapshot'],\n params: plan.version.params,\n tables: plan.version.tables,\n run: {\n syncRunId: run.syncRunId ?? '',\n mappingVersionId: `${plan.version.id}@${plan.version.version}`,\n },\n })\n\n const outputs = new Map<string, Relation>()\n const retained: Record<string, Relation> = {}\n const status = new Map<string, NodeStatus>()\n const stats: NodeStats[] = []\n const issues: RunIssue[] = []\n const writes = new Map<string, SinkWrite>()\n const metrics: Metric[] = []\n const held = new Set<string>()\n let stopped = false\n\n for (const [i, node] of plan.nodes.entries()) {\n const record = (s: NodeStatus, extra: Partial<NodeStats> = {}) => {\n status.set(node.id, s)\n stats.push({\n node: node.id,\n op: node.op,\n status: s,\n rowsIn: 0,\n rowsOut: 0,\n skipped: 0,\n changed: 0,\n ms: 0,\n ...extra,\n })\n }\n // Nodes feeding metrics read only nodes feeding metrics, so never a stopped input.\n if (stopped && !options.fixture && !node.feedsMetrics) record('stopped')\n else if (node.inputs.some((id) => status.get(id) !== 'ok')) record('upstream_failed')\n else {\n const rowsIn = node.inputs.reduce((n, id) => n + (outputs.get(id) as Relation).length, 0)\n const start = clock()\n const result = node.run((id) => outputs.get(id) as Relation, ctx, {\n ...(run.baseline?.[node.id] === undefined ? {} : { baseline: run.baseline[node.id] }),\n ...(options.fixture ? { skipCount: true } : {}),\n })\n if (!result.ok) {\n const e = result.error\n issues.push({\n node: node.id,\n code: e.code,\n message: e.message,\n ...(e.samples ? { samples: e.samples } : {}),\n })\n issues.push(...(e.issues ?? []))\n if (e.stop) stopped = true\n record('failed', { rowsIn, ms: clock() - start })\n } else {\n let out: NodeRun = result.value\n if (node.check) {\n const checked = node.check(out.rows, ctx, {\n ...(run.baseline?.[node.id] === undefined ? {} : { baseline: run.baseline[node.id] }),\n ...(options.fixture ? { skipCount: true } : {}),\n })\n out = {\n ...out,\n rows: checked.rows,\n changed: (out.changed ?? 0) + checked.changed,\n issues: [...(out.issues ?? []), ...checked.issues],\n stop: out.stop \|\| checked.stop,\n skipDownstream: out.skipDownstream \|\| checked.skipDownstream,\n }\n }\n issues.push(...(out.issues ?? []))\n if (out.stop) stopped = true\n if (out.skipDownstream) for (const s of node.sinks) held.add(s)\n if (out.write) writes.set(node.id, out.write)\n // A metric reports its rows as the node's checks left them.\n if (out.metric) {\n metrics.push(\n node.check\n ? { ...out.metric, rows: out.rows.map((r) => toJson(r) as Metric['rows'][number]) }\n : out.metric,\n )\n }\n outputs.set(node.id, out.rows)\n if (options.retain) retained[node.id] = out.rows\n record('ok', {\n rowsIn,\n rowsOut: out.rows.length,\n skipped: out.skipped ?? 0,\n changed: out.changed ?? 0,\n ms: clock() - start,\n })\n }\n }\n for (const id of node.inputs) if (plan.lastUse.get(id) === i) outputs.delete(id)\n }\n\n const sinks: SinkResult[] = plan.nodes\n .filter((n) => n.effect === 'sink')\n .map((n) => {\n const s = status.get(n.id)\n const write = writes.get(n.id)\n if (stopped) return { sink: n.id, status: 'stopped' }\n if (s === 'failed') return { sink: n.id, status: 'failed' }\n if (s !== 'ok' \|\| !write) return { sink: n.id, status: 'upstream_failed' }\n if (held.has(n.id)) return { sink: n.id, status: 'held' }\n return { sink: n.id, status: 'write', write }\n })\n\n return {\n status: stopped\n ? 'stopped'\n : sinks.every((s) => s.status === 'write') && [...status.values()].every((s) => s === 'ok')\n ? 'ok'\n : 'partial',\n sinks,\n metrics,\n stats,\n issues,\n ...(options.retain ? { outputs: retained } : {}),\n }\n}\n","/\n Fixtures (arch.md limitation #14): relations in, keyed by source node id, and relations\n * out, keyed by any node id, so a multi-step graph is tested at the step that matters. An\n * expected relation is compared as a set on the fields it lists. A fixture also fails when\n * its run stops (an `assert` or expectation with `stop`) or a node fails.\n \n Fixtures run at sample scale, so production `count` envelopes are skipped. Dates compare\n * as ISO instants; sink rows hold what would be written (`YYYY-MM-DD` for date fields).\n /\n\nimport type { Plan } from './compile'\nimport { execute, type RunResult } from './execute'\nimport type { RunIssue } from './nodes'\nimport { Instant, isTimeZone } from './time'\nimport { canonicalKey, type Json, toJson, type Val } from './values'\n\nexport interface NodeDiff {\n readonly node: string\n /* Expected records the run did not produce. /\n readonly missing: readonly Json[]\n /* Produced records the fixture does not list. /\n readonly unexpected: readonly Json[]\n}\n\nexport interface ExampleResult {\n readonly index: number\n readonly name?: string\n readonly passed: boolean\n /* Why the fixture failed, apart from relation differences. /\n readonly failures: readonly string[]\n readonly diffs: readonly NodeDiff[]\n readonly issues: readonly RunIssue[]\n readonly run?: RunResult\n}\n\nconst DEFAULT_NOW = '2000-01-01T00:00:00Z'\n\nexport function runExamples(plan: Plan): ExampleResult[] {\n return plan.version.examples.map((example, index) => {\n const failures: string[] = []\n const head = { index, ...(example.name ? { name: example.name } : {}) }\n const sources = new Set(plan.nodes.filter((n) => n.op === 'source').map((n) => n.id))\n const nodes = new Set(plan.nodes.map((n) => n.id))\n for (const id of Object.keys(example.sources)) {\n if (!sources.has(id)) failures.push(`sources names '${id}', which is not a source node`)\n }\n for (const id of Object.keys(example.expect)) {\n if (!nodes.has(id)) failures.push(`expect names unknown node '${id}'`)\n }\n if (plan.usesClock && example.now === undefined) {\n failures.push('the graph reads the clock (today/now), so the example needs \"now\"')\n }\n const now = Instant.parse(example.now ?? DEFAULT_NOW)\n if (!now) failures.push(`now '${example.now}' is not an ISO instant`)\n const tz = example.tz ?? 'UTC'\n if (!isTimeZone(tz)) failures.push(`unknown time zone '${tz}'`)\n if (failures.length) return { ...head, passed: false, failures, diffs: [], issues: [] }\n\n const run = execute(\n plan,\n example.sources,\n { now: now as Instant, tz },\n { retain: true, fixture: true },\n )\n if (run.status === 'stopped') {\n const why = run.issues\n .filter((i) => i.action === 'stop')\n .map((i) => `${i.node}: ${i.message}`)\n failures.push(`run stopped${why.length ? `: ${why.join('; ')}` : ''}`)\n }\n for (const s of run.stats) {\n if (s.status === 'failed') {\n const why = run.issues.filter((i) => i.node === s.node).map((i) => i.message)\n failures.push(`${s.node} failed: ${why.join('; ')}`)\n }\n }\n\n const diffs: NodeDiff[] = []\n for (const [id, expected] of Object.entries(example.expect)) {\n const actual = run.outputs?.[id]\n if (!actual) {\n failures.push(`${id} produced no output`)\n continue\n }\n if (expected.length === 0) {\n if (actual.length) diffs.push({ node: id, missing: [], unexpected: actual.map(toJson) })\n continue\n }\n const fields = Object.keys(expected[0] as object).sort()\n if (expected.some((r) => Object.keys(r).sort().join('\\u0000') !== fields.join('\\u0000'))) {\n failures.push(`expected rows of ${id} must all list the same fields`)\n continue\n }\n const project = (r: Readonly<Record<string, Val>>) =>\n Object.fromEntries(fields.map((f) => [f, toJson(r[f] ?? null)])) as Json\n const want = new Map(\n expected.map((r) => [\n canonicalKey(project(r as Record<string, Val>) as Val),\n project(r as Record<string, Val>),\n ]),\n )\n const got = new Map(actual.map((r) => [canonicalKey(project(r) as Val), project(r)]))\n const missing = [...want].filter(([k]) => !got.has(k)).map(([, r]) => r)\n const unexpected = [...got].filter(([k]) => !want.has(k)).map(([, r]) => r)\n if (missing.length \|\| unexpected.length) diffs.push({ node: id, missing, unexpected })\n }\n return {\n ...head,\n passed: failures.length === 0 && diffs.length === 0,\n failures,\n diffs,\n issues: run.issues,\n run,\n }\n })\n}\n","/\n The draft-save gate: everything that must hold before a version may be published, as one\n * list of located issues. `validateStructure` is the subset that needs no host environment,\n * cheap enough to run in the editor on every change.\n /\n\nimport { compileVersion, type Plan, structuralIssues } from './compile'\nimport type { GraphEnv } from './context'\nimport type { MappingVersion, NodeJson } from './document'\nimport { type ExampleResult, runExamples } from './examples'\nimport { nodeRegistry } from './nodes'\nimport type { CompileIssue } from './result'\n\nexport interface CheckResult {\n readonly ok: boolean\n readonly issues: readonly CompileIssue[]\n readonly plan?: Plan\n readonly examples?: readonly ExampleResult[]\n}\n\n/* Compile, then run every example; publishable only if `ok`. /\nexport function checkVersion(version: MappingVersion, env: GraphEnv): CheckResult {\n const compiled = compileVersion(version, env)\n if (!compiled.ok) return { ok: false, issues: compiled.issues }\n const examples = runExamples(compiled.plan)\n const issues: CompileIssue[] = examples.flatMap((e) => {\n const label = `example ${e.name ?? e.index}`\n return [\n ...e.failures.map((f) => ({ code: 'example_failed' as const, message: `${label}: ${f}` })),\n ...e.diffs.map((d) => ({\n code: 'example_failed' as const,\n node: d.node,\n message: `${label}: ${d.node} is missing ${d.missing.length} and has ${d.unexpected.length} unexpected records`,\n })),\n ]\n })\n return { ok: issues.length === 0, issues, plan: compiled.plan, examples }\n}\n\n/* Structure and params only: no types, no target schema. /\nexport function validateStructure(version: MappingVersion): CompileIssue[] {\n const issues = structuralIssues(version)\n for (const node of version.nodes) {\n const def = Object.hasOwn(nodeRegistry, node.op) ? nodeRegistry[node.op] : undefined\n if (!def) continue\n const { id: _id, op: _op, label: _label, ...params } = node as NodeJson\n const parsed = def.params.safeParse(params)\n if (parsed.success) continue\n for (const x of parsed.error.issues) {\n issues.push({\n code: 'invalid_params',\n message: `${x.path.length ? `${x.path.join('.')}: ` : ''}${x.message}`,\n node: node.id,\n })\n }\n }\n return issues\n}\n","/\n Pure, immutable edits of a version's graph, for the editor. Every edit returns a new\n * version. `canConnect` is the single rule book for edges, so live feedback while dragging\n * and validation on save agree. Edges are derived from input references (`edgesOf`).\n /\n\nimport type { MappingVersion, NodeJson, Position } from './document'\nimport { downstream, nodeRefs } from './graph'\nimport { nodeCatalog, nodeRegistry, type Slot } from './nodes'\n\nexport { nodeCatalog }\n\nexport interface Edge {\n /* Stable id: `source->target:slot[index]`. /\n readonly id: string\n readonly source: string\n readonly target: string\n /* Slot id on the target node, used as the React Flow target handle. /\n readonly slot: string\n readonly index?: number\n}\n\n/* A prospective edge. /\nexport interface Connection {\n readonly source: string\n readonly target: string\n readonly slot: string\n}\n\nexport type ConnectResult = { ok: true } \| { ok: false; reason: string }\n\nlet counter = 0\n\n/* A short unique id; `crypto.randomUUID` where available, a counter otherwise. /\nexport function createId(prefix: string): string {\n counter += 1\n const random = globalThis.crypto?.randomUUID?.().slice(0, 8)\n return `${prefix}_${random ?? counter.toString(36)}`\n}\n\nexport function getNode(version: MappingVersion, id: string): NodeJson \| undefined {\n return version.nodes.find((n) => n.id === id)\n}\n\nconst defOf = (op: string) => (Object.hasOwn(nodeRegistry, op) ? nodeRegistry[op] : undefined)\n\nexport function edgesOf(version: MappingVersion): Edge[] {\n return version.nodes.flatMap((node) =>\n nodeRefs(node).map((r) => ({\n id: `${r.source}->${node.id}:${r.slot}${r.index === undefined ? '' : `[${r.index}]`}`,\n source: r.source,\n target: node.id,\n slot: r.slot,\n ...(r.index === undefined ? {} : { index: r.index }),\n })),\n )\n}\n\n/* Add a node of a known op with its default params. /\nexport function addNode(\n version: MappingVersion,\n op: string,\n init: { id?: string; label?: string; params?: Record<string, unknown>; position?: Position } = {},\n): { version: MappingVersion; node: NodeJson } {\n const def = defOf(op)\n if (!def) throw new Error(`Unknown node op '${op}'`)\n const id = init.id ?? createId(op)\n if (getNode(version, id)) throw new Error(`Node id '${id}' already exists`)\n const node: NodeJson = {\n ...def.defaults(),\n ...init.params,\n id,\n op,\n ...(init.label === undefined ? {} : { label: init.label }),\n }\n return {\n version: {\n ...version,\n nodes: [...version.nodes, node],\n ...(init.position ? { layout: { ...version.layout, [id]: init.position } } : {}),\n },\n node,\n }\n}\n\nfunction setPath(node: NodeJson, path: readonly string[], value: unknown): NodeJson {\n const [head, ...rest] = path as [string, ...string[]]\n if (rest.length === 0) {\n const copy: Record<string, unknown> = { ...node }\n if (value === undefined) delete copy[head]\n else copy[head] = value\n return copy as NodeJson\n }\n const child = (node as Record<string, unknown>)[head]\n const inner = typeof child === 'object' && child !== null ? child : {}\n return { ...node, [head]: setPath(inner as NodeJson, rest, value) } as NodeJson\n}\n\nfunction getPath(node: NodeJson, path: readonly string[]): unknown {\n let value: unknown = node\n for (const key of path) value = (value as Record<string, unknown> \| undefined)?.[key]\n return value\n}\n\nfunction slotOf(node: NodeJson, slot: string): Slot \| undefined {\n return defOf(node.op)?.slots.find((s) => s.id === slot)\n}\n\n/* Remove a node, every reference to it, and its layout entry. /\nexport function removeNode(version: MappingVersion, id: string): MappingVersion {\n const nodes = version.nodes\n .filter((n) => n.id !== id)\n .map((n) => {\n let next = n\n for (const ref of nodeRefs(n)\n .filter((r) => r.source === id)\n .reverse()) {\n next = unlink(next, ref.slot, id)\n }\n return next\n })\n const layout = version.layout ? { ...version.layout } : undefined\n if (layout) delete layout[id]\n const expect = { ...version.expect }\n delete expect[id]\n return { ...version, nodes, expect, ...(layout ? { layout } : {}) }\n}\n\n/* Drop `node`'s reference to `source` in `slotId`; anything else is left as it is. /\nfunction unlink(node: NodeJson, slotId: string, source: string): NodeJson {\n const slot = slotOf(node, slotId)\n if (!slot) return node\n const value = getPath(node, slot.path)\n if (Array.isArray(value))\n return setPath(\n node,\n slot.path,\n value.filter((v) => v !== source),\n )\n return value === source ? setPath(node, slot.path, undefined) : node\n}\n\n/\n Replace a node's label and/or params; `id` and `op` cannot change. A `label` key set to\n * undefined clears the label.\n /\nexport function updateNode(\n version: MappingVersion,\n id: string,\n patch: { label?: string \| undefined; params?: Record<string, unknown> },\n): MappingVersion {\n return {\n ...version,\n nodes: version.nodes.map((n) => {\n if (n.id !== id) return n\n const label = 'label' in patch ? patch.label : n.label\n const params = patch.params ?? (({ id: _i, op: _o, label: _l, ...rest }) => rest)(n)\n return { ...params, id: n.id, op: n.op, ...(label === undefined ? {} : { label }) }\n }),\n }\n}\n\nexport function moveNode(version: MappingVersion, id: string, position: Position): MappingVersion {\n return { ...version, layout: { ...version.layout, [id]: position } }\n}\n\n/* Every rule a new edge must satisfy, checked against the current version. /\nexport function canConnect(version: MappingVersion, connection: Connection): ConnectResult {\n const source = getNode(version, connection.source)\n const target = getNode(version, connection.target)\n if (!source \|\| !target) return { ok: false, reason: 'Both ends must be nodes in the graph.' }\n if (source.id === target.id) return { ok: false, reason: 'A node cannot feed itself.' }\n const from = defOf(source.op)\n if (!from \|\| !defOf(target.op)) return { ok: false, reason: 'Unknown node op.' }\n if (!from.output) return { ok: false, reason: `${from.label} has no output.` }\n const slot = slotOf(target, connection.slot)\n if (!slot) return { ok: false, reason: `${target.op} has no input '${connection.slot}'.` }\n const refs = nodeRefs(target).filter((r) => r.slot === slot.id)\n if (refs.some((r) => r.source === source.id))\n return { ok: false, reason: 'These nodes are already connected.' }\n if (refs.length > 0 && !slot.multiple)\n return { ok: false, reason: `Input '${slot.label}' already has a connection.` }\n if (downstream(version.nodes, target.id).has(source.id)) {\n return { ok: false, reason: 'This connection would create a cycle; mappings must be acyclic.' }\n }\n return { ok: true }\n}\n\n/* Add an edge by setting the target's input reference, or throw with `canConnect`'s reason. /\nexport function connect(version: MappingVersion, connection: Connection): MappingVersion {\n const verdict = canConnect(version, connection)\n if (!verdict.ok) throw new Error(verdict.reason)\n return {\n ...version,\n nodes: version.nodes.map((n) => {\n if (n.id !== connection.target) return n\n const slot = slotOf(n, connection.slot) as Slot\n const current = getPath(n, slot.path)\n const value = slot.multiple\n ? [...(Array.isArray(current) ? current : []), connection.source]\n : connection.source\n return setPath(n, slot.path, value)\n }),\n }\n}\n\n/* Remove an edge by clearing the target's reference to its source. /\nexport function disconnect(\n version: MappingVersion,\n edge: Pick<Edge, 'source' \| 'target' \| 'slot'>,\n): MappingVersion {\n return {\n ...version,\n nodes: version.nodes.map((n) => (n.id === edge.target ? unlink(n, edge.slot, edge.source) : n)),\n }\n}\n","/\n Descriptions of source and target schemas.\n \n These are the nouns every other part of hockeymask speaks: connectors describe what a\n * source contains as `Table`s of `Column`s, the host application describes what it wants\n * to receive as a `TargetSchema`, and mapping graphs work between the two.\n \n Every type is a zod schema plus its inferred TypeScript type, so the same definition\n * validates data on the wire and types it in code.\n /\n\nimport { z } from 'zod'\n\n/* A single decoded value. Dates are ISO strings ('2026-10-04'), decimals are numbers. /\nexport const Value = z.union([z.string(), z.number(), z.boolean(), z.null()])\nexport type Value = z.infer<typeof Value>\n\n/* One record as a source returns it: column name -> decoded value. /\nexport const Row = z.record(z.string(), Value)\nexport type Row = z.infer<typeof Row>\n\n/\n Source-independent type of a column or field.\n \n Connectors translate each system's declared types into one of these. The declared type\n * is kept alongside (`Column.sourceType`), because it often carries meaning the logical\n * type loses, e.g. NetSuite declares checkboxes `boolean` but SuiteQL returns 'T' / 'F'.\n /\nexport const LogicalType = z.enum([\n 'string',\n 'integer',\n 'decimal',\n 'boolean',\n 'date',\n 'timestamp',\n 'reference',\n 'unknown',\n])\nexport type LogicalType = z.infer<typeof LogicalType>\n\nexport const Column = z.object({\n name: z.string(),\n logicalType: LogicalType,\n sourceType: z.string().describe('Type exactly as the source declares it.'),\n nullable: z.boolean().default(true),\n label: z.string().nullable().default(null).describe('Human label shown in the source UI.'),\n description: z.string().nullable().default(null),\n isCustom: z.boolean().default(false).describe('Customer-added field, e.g. custitem_.'),\n references: z\n .string()\n .nullable()\n .default(null)\n .describe('Table this column points at, when the source declares it.'),\n})\nexport type Column = z.infer<typeof Column>\n\nexport const TableRef = z.object({\n name: z.string().describe(\"Name in the source's own notation, e.g. ANALYTICS.PLANNING.X.\"),\n label: z.string().nullable().default(null),\n description: z.string().nullable().default(null),\n rowCount: z.number().int().nullable().default(null),\n})\nexport type TableRef = z.infer<typeof TableRef>\n\nexport const Table = TableRef.extend({ columns: z.array(Column) })\nexport type Table = z.infer<typeof Table>\n\n/** A batch of rows together with the columns that describe them. /\nexport const RowSet = z.object({\n columns: z.array(Column),\n rows: z.array(Row),\n totalRows: z\n .number()\n .int()\n .nullable()\n .default(null)\n .describe('Rows the query would return without a limit, if known.'),\n})\nexport type RowSet = z.infer<typeof RowSet>\n\nexport const TargetField = z.object({\n name: z.string(),\n logicalType: LogicalType,\n nullable: z.boolean().default(true),\n description: z.string().nullable().default(null),\n unit: z.string().nullable().default(null).describe(\"Unit the target stores, e.g. 'g' or 'm'.\"),\n references: z.string().nullable().default(null).describe('Target entity of a foreign key.'),\n})\nexport type TargetField = z.infer<typeof TargetField>\n\nexport const TargetEntity = z.object({\n name: z.string(),\n description: z.string().nullable().default(null),\n identity: z\n .array(z.string())\n .default([])\n .describe('Fields a re-import uses to find the row it wrote last time.'),\n nullsNotDistinct: z\n .boolean()\n .optional()\n .describe(\n 'The identity matches NULLs as equal (NULLS NOT DISTINCT), so a nullable identity field may be part of an upsert key.',\n ),\n fields: z.array(TargetField),\n})\nexport type TargetEntity = z.infer<typeof TargetEntity>\n\nexport const TargetSchema = z.object({\n name: z.string(),\n entities: z.array(TargetEntity),\n})\nexport type TargetSchema = z.infer<typeof TargetSchema>\n\n/* Column of `table` named `name`, ignoring case (source systems differ on case). /\nexport function findColumn(table: Table, name: string): Column {\n const wanted = name.toLowerCase()\n const column = table.columns.find((c) => c.name.toLowerCase() === wanted)\n if (!column) throw new Error(`${table.name} has no column '${name}'`)\n return column\n}\n\nexport function findEntity(schema: TargetSchema, name: string): TargetEntity {\n const entity = schema.entities.find((e) => e.name === name)\n if (!entity) throw new Error(`${schema.name} has no entity '${name}'`)\n return entity\n}\n\nexport function findField(entity: TargetEntity, name: string): TargetField {\n const field = entity.fields.find((f) => f.name === name)\n if (!field) throw new Error(`${entity.name} has no field '${name}'`)\n return field\n}\n\n/* Build a Column with the defaults filled in. */\nexport function column(\n input: Pick<Column, 'name' \| 'logicalType' \| 'sourceType'> & Partial<Column>,\n): Column {\n return Column.parse(input)\n}\n"],"mappings":";;;AA0BA,IAAa,iBAAb,cAAoC,MAAM;CACxC,OAAgB;AAClB;;AAGA,IAAa,oBAAb,cAAuC,eAAe;CACpD,OAAgB;AAClB;;;;ACqCA,SAAgB,UAAU,QAAoB,MAAqC;CACjF,MAAM,OAAO,OAAO,OAAO,OAAO,QAAQ,IAAI,IAAI,OAAO,OAAO,QAAQ,KAAA;CACxE,OAAO,OACH;EAAE,IAAI;EAAM,OAAO;CAAK,IACxB;EACE,IAAI;EACJ,OAAO,kBAAkB,KAAK,gBAAgB,OAAO,KAAK,OAAO,MAAM,CAAC,CAAC,KAAK,IAAI,KAAK,YAAY;CACrG;AACN;AAEA,SAAgB,UACd,QACA,OAA2C,CAAC,GACjC;CACX,OAAO;EACL;EACA,QAAQ,KAAK,UAAU,CAAC;EACxB,QAAQ,KAAK,UAAU,CAAC;EACxB,WAAW,KAAK,aAAa,CAAC;EAC9B,OAAO,KAAK,SAAS;EACrB,OAAO,KAAK,SAAS,EAAE,MAAM,MAAM;CACrC;AACF;;;ACnFA,SAAgB,GAAM,OAAoD;CACxE,OAAO;EAAE,IAAI;EAAM;CAAM;AAC3B;;AAGA,SAAgB,SAAY,QAA+B;CACzD,IAAI,CAAC,OAAO,IAAI,MAAM,IAAI,MAAM,uBAAuB,KAAK,UAAU,OAAO,KAAK,GAAG;CACrF,OAAO,OAAO;AAChB;AAEA,SAAgB,IAAO,OAAqD;CAC1E,OAAO;EAAE,IAAI;EAAO;CAAM;AAC5B;AAyBA,SAAgB,UAAU,MAAiB,QAAiD;CAC1F,OAAO,IAAI;EAAE;EAAM;CAAO,CAAC;AAC7B;;;;;;;;;;;ACrCA,IAAa,UAAb,MAAa,QAAQ;CACU;CAA7B,YAAoB,SAA0B;EAAjB,KAAA,UAAA;EAC3B,OAAO,OAAO,IAAI;CACpB;CAEA,OAAO,UAAU,SAA0B;EACzC,IAAI,CAAC,OAAO,SAAS,OAAO,GAAG,MAAM,IAAI,WAAW,8BAA8B,SAAS;EAC3F,OAAO,IAAI,QAAQ,OAAO;CAC5B;;CAGA,OAAO,MAAM,KAAkC;EAC7C,IAAI,CAAC,YAAY,KAAK,GAAG,GAAG,OAAO,KAAA;EACnC,MAAM,KAAK,KAAK,MAAM,GAAG;EACzB,OAAO,OAAO,MAAM,EAAE,IAAI,KAAA,IAAY,IAAI,QAAQ,EAAE;CACtD;CAEA,cAAsB;EACpB,OAAO,IAAI,KAAK,KAAK,OAAO,CAAC,CAAC,YAAY;CAC5C;CAEA,SAAiB;EACf,OAAO,KAAK,YAAY;CAC1B;CAEA,WAAmB;EACjB,OAAO,KAAK,YAAY;CAC1B;AACF;AAEA,MAAM,cAAc;AAepB,MAAM,6BAAa,IAAI,IAAiC;AAExD,SAAS,UAAU,IAAiC;CAClD,IAAI,IAAI,WAAW,IAAI,EAAE;CACzB,IAAI,CAAC,GAAG;EACN,IAAI,IAAI,KAAK,eAAe,SAAS;GACnC,UAAU;GACV,WAAW;GACX,MAAM;GACN,OAAO;GACP,KAAK;GACL,MAAM;GACN,QAAQ;GACR,QAAQ;EACV,CAAC;EACD,WAAW,IAAI,IAAI,CAAC;CACtB;CACA,OAAO;AACT;AAEA,SAAgB,WAAW,IAAqB;CAC9C,IAAI;EACF,UAAU,EAAE;EACZ,OAAO;CACT,QAAQ;EACN,OAAO;CACT;AACF;;AAGA,SAAgB,YAAY,SAAkB,IAAuB;CACnE,MAAM,QAAgC,CAAC;CACvC,KAAK,MAAM,KAAK,UAAU,EAAE,CAAC,CAAC,cAAc,IAAI,KAAK,QAAQ,OAAO,CAAC,GACnE,IAAI,EAAE,SAAS,WAAW,MAAM,EAAE,QAAQ,OAAO,EAAE,KAAK;CAE1D,OAAO;EACL,MAAM,MAAM;EACZ,OAAO,MAAM;EACb,KAAK,MAAM;EACX,MAAM,MAAM;EACZ,QAAQ,MAAM;EACd,QAAQ,MAAM;EACd,KAAM,QAAQ,UAAU,MAAQ,OAAQ;CAC1C;AACF;AAEA,SAAS,UAAU,GAAsB;CAEvC,MAAM,IAAI,IAAI,KAAK,KAAK,IAAI,KAAM,EAAE,QAAQ,GAAG,EAAE,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,EAAE,CAAC;CACvF,EAAE,eAAe,EAAE,IAAI;CACvB,OAAO,EAAE,QAAQ;AACnB;;AAGA,SAAS,SAAS,SAAiB,IAAoB;CACrD,OAAO,UAAU,YAAY,QAAQ,UAAU,OAAO,GAAG,EAAE,CAAC,IAAI;AAClE;;;;;AAMA,SAAgB,cAAc,GAAc,IAAqB;CAC/D,MAAM,QAAQ,UAAU,CAAC;CAEzB,MAAM,SAAS,SAAS,QAAQ,OAAY,EAAE;CAC9C,MAAM,QAAQ,SAAS,QAAQ,OAAY,EAAE;CAC7C,MAAM,SAAS,MAAc,UAAU,YAAY,QAAQ,UAAU,CAAC,GAAG,EAAE,CAAC,MAAM;CAClF,MAAM,aAAa,CAAC,QAAQ,QAAQ,QAAQ,KAAK,CAAC,CAAC,OAAO,KAAK;CAE/D,OAAO,QAAQ,UAAU,WAAW,SAAS,IAAI,KAAK,IAAI,GAAG,UAAU,IAAI,QAAQ,MAAM;AAC3F;AAEA,SAAgB,YAAY,MAAc,OAAuB;CAC/D,IAAI,UAAU,GAAG,OAAQ,OAAO,MAAM,KAAK,OAAO,QAAQ,KAAM,OAAO,QAAQ,IAAI,KAAK;CACxF,OAAO;EAAC;EAAG;EAAG;EAAG;CAAE,CAAC,CAAC,SAAS,KAAK,IAAI,KAAK;AAC9C;AAWA,MAAM,gBAAgB;;AAGtB,SAAgB,cAAc,MAAmD;CAC/E,MAAM,QAAoB,CAAC;CAC3B,cAAc,YAAY;CAC1B,IAAI,KAAK;CACT,OAAO,KAAK,KAAK,QAAQ;EACvB,cAAc,YAAY;EAC1B,MAAM,IAAI,cAAc,KAAK,IAAI;EACjC,IAAI,CAAC,GAAG,OAAO,IAAI,qBAAqB,KAAK,kCAAkC;EAC/E,MAAM,GAAG,MAAM,QAAQ,QAAQ;EAC/B,MAAM,KAAK;GAAE,QAAQ,OAAO,MAAM,KAAK,SAAS,MAAM,KAAK;GAAU;EAAqB,CAAC;EAC3F,KAAK,cAAc;CACrB;CACA,IAAI,MAAM,WAAW,GAAG,OAAO,IAAI,qBAAqB,KAAK,kCAAkC;CAC/F,OAAO,GAAG,KAAK;AACjB;;AAGA,SAAgB,SAAS,MAAmC;CAC1D,MAAM,SAAS,cAAc,IAAI;CACjC,IAAI,CAAC,OAAO,IAAI,MAAM,IAAI,MAAM,OAAO,KAAK;CAC5C,OAAO,OAAO;AAChB;;AAGA,SAAgB,MAAM,SAAkB,IAAyB,IAAqB;CACpF,IAAI,UAAU;CACd,KAAK,MAAM,EAAE,QAAQ,UAAU,IAAI;EACjC,IAAI,SAAS,KAAK;GAChB,UAAU,QAAQ,UAAU,QAAQ,UAAU,SAAS,IAAS;GAChE;EACF;EACA,MAAM,IAAI,YAAY,SAAS,EAAE;EACjC,IAAI,SAAS,OAAO,SAAS,MAAM;GACjC,MAAM,SAAS,EAAE,OAAO,MAAM,EAAE,QAAQ,MAAM,SAAS,MAAM,SAAS,KAAK;GAC3E,MAAM,OAAO,KAAK,MAAM,SAAS,EAAE;GACnC,MAAM,QAAS,SAAS,KAAM;GAC9B,UAAU,cACR;IAAE,GAAG;IAAG;IAAM;IAAO,KAAK,KAAK,IAAI,EAAE,KAAK,YAAY,MAAM,KAAK,CAAC;GAAE,GACpE,EACF;EACF,OAAO;GACL,MAAM,OAAO,SAAS,MAAM,SAAS,IAAI;GACzC,MAAM,IAAI,IAAI,KAAK,UAAU;IAAE,GAAG;IAAG,MAAM;IAAG,QAAQ;IAAG,QAAQ;IAAG,IAAI;GAAE,CAAC,CAAC;GAC5E,EAAE,WAAW,EAAE,WAAW,IAAI,IAAI;GAClC,UAAU,cACR;IAAE,GAAG;IAAG,MAAM,EAAE,eAAe;IAAG,OAAO,EAAE,YAAY,IAAI;IAAG,KAAK,EAAE,WAAW;GAAE,GAClF,EACF;EACF;CACF;CACA,OAAO;AACT;;AAKA,SAAgB,SAAS,SAAkB,MAAoB,IAAqB;CAClF,MAAM,IAAI,YAAY,SAAS,EAAE;CACjC,OAAO,cACL;EACE,MAAM,EAAE;EACR,OAAO,SAAS,SAAS,IAAI,EAAE;EAC/B,KAAK,SAAS,QAAQ,EAAE,MAAM;EAC9B,MAAM;EACN,QAAQ;EACR,QAAQ;EACR,IAAI;CACN,GACA,EACF;AACF;AAiBA,MAAM,WAAW;AAEjB,SAAgB,cAAc,MAAwC;CACpE,MAAM,MAAM,SAAS,KAAK,IAAI;CAC9B,IAAI,KAAK;EACP,MAAM,SAAS,IAAI;EACnB,IAAI,IAAI,OAAO,IAAI,OAAO,GAAG;GAAE,MAAM;GAAY;GAAQ,IAAI,CAAC;EAAE,CAAC;EACjE,MAAM,KAAK,cAAc,IAAI,EAAY;EACzC,OAAO,GAAG,KAAK,GAAG;GAAE,MAAM;GAAY;GAAQ,IAAI,GAAG;EAAM,CAAC,IAAI;CAClE;CACA,MAAM,OAAO,gBAAgB,MAAM,SAAS;CAC5C,IAAI,MAAM,OAAO,GAAG;EAAE,MAAM;EAAQ;CAAK,CAAC;CAC1C,MAAM,UAAU,QAAQ,MAAM,IAAI;CAClC,IAAI,SAAS,OAAO,GAAG;EAAE,MAAM;EAAW;CAAQ,CAAC;CACnD,OAAO,IACL,iBAAiB,KAAK,kEACxB;AACF;;AAGA,SAAgB,UAAU,MAAyB;CACjD,OAAO,KAAK,SAAS;AACvB;AAEA,SAAgB,gBAAgB,MAAgB,OAA8C;CAC5F,QAAQ,KAAK,MAAb;EACE,KAAK,WACH,OAAO,KAAK;EACd,KAAK,QACH,OAAO,cAAc,KAAK,MAAM,MAAM,EAAE;EAC1C,KAAK,YAEH,OAAO,MADQ,KAAK,WAAW,UAAU,SAAS,MAAM,KAAK,OAAO,MAAM,EAAE,IAAI,MAAM,KACjE,KAAK,IAAI,MAAM,EAAE;CAE1C;AACF;AAaA,MAAM,SAAS;CAAC;CAAQ;CAAM;CAAM;CAAM;CAAM;AAAI;AACpD,MAAM,cAAc;AAEpB,SAAgB,gBAAgB,MAA0C;CACxE,IAAI,SAAS,OAAO,OAAO,GAAG,EAAE,MAAM,MAAM,CAAC;CAC7C,IAAI,SAAS,YAAY,OAAO,GAAG;EAAE,MAAM;EAAS,MAAM;CAAK,CAAC;CAChE,IAAI,SAAS,WAAW,OAAO,GAAG;EAAE,MAAM;EAAS,MAAM;CAAI,CAAC;CAC9D,MAAM,SAAS,KAAK,MAAM,WAAW,CAAC,CAAC,QAAQ,MAAM,MAAM,EAAE;CAC7D,MAAM,OAAO,OAAO,QAAQ,MAAO,OAA6B,SAAS,CAAC,CAAC;CAC3E,IAAI,KAAK,WAAW,GAAG,OAAO,IAAI,gBAAgB,KAAK,gBAAgB,OAAO,KAAK,GAAG,GAAG;CACzF,IAAI,IAAI,IAAI,IAAI,CAAC,CAAC,SAAS,KAAK,QAAQ,OAAO,IAAI,gBAAgB,KAAK,kBAAkB;CAC1F,MAAM,SAAS,OACZ,KAAK,MAAM;EACV,IAAI,MAAM,QAAQ,OAAO;EACzB,IAAK,OAA6B,SAAS,CAAC,GAAG,OAAO;EACtD,OAAO,EAAE,QAAQ,uBAAuB,MAAM;CAChD,CAAC,CAAC,CACD,KAAK,EAAE;CACV,OAAO,GAAG;EAAE,MAAM;EAAW;EAAQ,OAAO,IAAI,OAAO,IAAI,OAAO,EAAE;CAAE,CAAC;AACzE;;AAGA,SAAgB,WAAW,MAA0B;CACnD,MAAM,SAAS,gBAAgB,IAAI;CACnC,IAAI,CAAC,OAAO,IAAI,MAAM,IAAI,MAAM,OAAO,KAAK;CAC5C,OAAO,OAAO;AAChB;AAEA,MAAM,YAAY,gBAAgB,YAAY;AAC9C,MAAM,YAAY,gBAAgB,qBAAqB;;AAGvD,SAAgB,YAAY,QAA6B;CACvD,OAAO,OAAO,SAAS,aAAa;EAAC;EAAQ;EAAM;CAAI,CAAC,CAAC,OAAO,MAAM,OAAO,OAAO,SAAS,CAAC,CAAC;AACjG;AAEA,SAAS,gBAAgB,MAAc,QAA2D;CAChG,IAAI,CAAC,OAAO,MAAM,OAAO,MAAM,SAAS,WAAW,OAAO,KAAA;CAC1D,MAAM,IAAI,OAAO,MAAM,MAAM,KAAK,IAAI;CACtC,IAAI,CAAC,GAAG,OAAO,KAAA;CACf,MAAM,SAAiC;EAAE,MAAM;EAAM,IAAI;EAAG,IAAI;EAAG,IAAI;EAAG,IAAI;EAAG,IAAI;CAAE;CACvF,IAAI,QAAQ;CACZ,KAAK,MAAM,SAAS,OAAO,MAAM,QAC/B,IAAK,OAA6B,SAAS,KAAK,GAAG,OAAO,SAAS,OAAO,EAAE,QAAQ;CAEtF,MAAM,IAAe;EACnB,MAAM,OAAO;EACb,OAAO,OAAO;EACd,KAAK,OAAO;EACZ,MAAM,OAAO;EACb,QAAQ,OAAO;EACf,QAAQ,OAAO;EACf,IAAI;CACN;CASA,OAPE,EAAE,SAAS,KACX,EAAE,SAAS,MACX,EAAE,OAAO,KACT,EAAE,OAAO,YAAY,EAAE,MAAM,EAAE,KAAK,KACpC,EAAE,QAAQ,MACV,EAAE,UAAU,MACZ,EAAE,UAAU,KACC,IAAI,KAAA;AACrB;;;;;AAMA,SAAgB,eACd,OACA,QACA,IACqB;CACrB,IAAI,OAAO,SAAS,SAAS;EAC3B,MAAM,IAAI,OAAO,UAAU,WAAW,QAAQ,UAAU,KAAK,KAAK,IAAI,OAAO,KAAK,IAAI;EACtF,OAAO,OAAO,SAAS,CAAC,IAAI,QAAQ,UAAU,OAAO,SAAS,MAAM,IAAI,MAAO,CAAC,IAAI,KAAA;CACtF;CACA,IAAI,OAAO,UAAU,UAAU,OAAO,KAAA;CACtC,IAAI,OAAO,SAAS,WAAW;EAC7B,MAAM,IAAI,gBAAgB,OAAO,GAAG,MAAM,CAAC;EAC3C,OAAO,KAAK,cAAc,GAAG,EAAE;CACjC;CACA,MAAM,OAAO,gBAAgB,OAAO,SAAS,KAAK,gBAAgB,OAAO,SAAS;CAClF,OAAO,OAAO,cAAc,MAAM,EAAE,IAAI,QAAQ,MAAM,KAAK;AAC7D;AAEA,MAAMA,SAAO,GAAW,QAAQ,MAAM,OAAO,CAAC,CAAC,CAAC,SAAS,OAAO,GAAG;;AAGnE,SAAgB,WAAW,SAAkB,QAAoB,IAAoB;CACnF,IAAI,OAAO,SAAS,OAAO,OAAO,QAAQ,YAAY;CACtD,IAAI,OAAO,SAAS,SAClB,OAAO,OAAO,OAAO,SAAS,MAAM,KAAK,MAAM,QAAQ,UAAU,GAAI,IAAI,QAAQ,OAAO;CAE1F,MAAM,IAAI,YAAY,SAAS,EAAE;CACjC,MAAM,SAAiC;EACrC,MAAMA,MAAI,EAAE,MAAM,CAAC;EACnB,IAAIA,MAAI,EAAE,KAAK;EACf,IAAIA,MAAI,EAAE,GAAG;EACb,IAAIA,MAAI,EAAE,IAAI;EACd,IAAIA,MAAI,EAAE,MAAM;EAChB,IAAIA,MAAI,EAAE,MAAM;CAClB;CACA,OAAO,OAAO,OAAO,KAAK,MAAM,OAAO,MAAM,CAAC,CAAC,CAAC,KAAK,EAAE;AACzD;;AAGA,SAAgB,aAAa,SAAkB,IAAoB;CACjE,MAAM,IAAI,YAAY,SAAS,EAAE;CACjC,OAAO,GAAGA,MAAI,EAAE,MAAM,CAAC,EAAE,GAAGA,MAAI,EAAE,KAAK,EAAE,GAAGA,MAAI,EAAE,GAAG;AACvD;;;;ACpWA,MAAa,IAAI;CACf,QAAQ,EAAE,MAAM,SAAS;CACzB,QAAQ,EAAE,MAAM,SAAS;CACzB,SAAS,EAAE,MAAM,UAAU;CAC3B,MAAM,EAAE,MAAM,OAAO;CACrB,MAAM,EAAE,MAAM,OAAO;CACrB,SAAS,EAAE,MAAM,UAAU;CAC3B,OAAO,EAAE,MAAM,QAAQ;CACvB,MAAM;EAAE,MAAM;EAAY,IAAI,EAAE,MAAM,QAAQ;CAAE;CAChD,OAAO,QAAsB;EAAE,MAAM;EAAQ;CAAG;CAChD,QAAQ,QAAiC;EAAE,MAAM;EAAS;CAAG;CAC7D,SAAS,YAAyD;EAAE,MAAM;EAAU;CAAO;CAC3F,WAAW,OAAsB,GAAG,SAAS,aAAa,KAAK;EAAE,MAAM;EAAY;CAAG;AACxF;AAEA,SAAgB,WAAW,MAAmC;CAC5D,OAAO,KAAK,SAAS;AACvB;;AAGA,SAAgB,UAAU,MAAsB;CAC9C,OAAO,KAAK,SAAS,aAAa,KAAK,KAAK;AAC9C;;AAGA,SAAgB,UAAU,MAAsB;CAC9C,OAAO,KAAK,SAAS,cAAc,KAAK,SAAS;AACnD;;AAGA,SAAgB,WAAW,MAAa,MAAsB;CAC5D,OAAO,OAAO,EAAE,SAAS,IAAI,IAAI;AACnC;;AAGA,SAAgB,KAAK,MAAqB;CACxC,QAAQ,KAAK,MAAb;EACE,KAAK,YACH,OAAO,KAAK,GAAG,SAAS,UAAU,SAAS,GAAG,KAAK,KAAK,EAAE,EAAE;EAC9D,KAAK,QACH,OAAO,QAAQ,KAAK,KAAK,EAAE,EAAE;EAC/B,KAAK,SACH,OAAO,IAAI,KAAK,GAAG,IAAI,IAAI,CAAC,CAAC,KAAK,IAAI,EAAE;EAC1C,KAAK,UACH,OAAO,KAAK,OAAO,QAAQ,KAAK,MAAM,CAAC,CACpC,KAAK,CAAC,GAAG,OAAO,GAAG,EAAE,IAAI,KAAK,CAAC,GAAG,CAAC,CACnC,KAAK,IAAI,EAAE;EAChB,KAAK,QACH,OAAO;EACT,SACE,OAAO,KAAK;CAChB;AACF;AAEA,SAAgB,WAAW,GAAU,GAAmB;CACtD,OAAO,KAAK,CAAC,MAAM,KAAK,CAAC;AAC3B;;AAGA,SAAgB,WAAW,MAAa,IAAoB;CAC1D,IAAI,GAAG,SAAS,WAAW,OAAO;CAClC,IAAI,KAAK,SAAS,SAAS,OAAO;CAClC,IAAI,KAAK,SAAS,YAChB,OAAO,GAAG,SAAS,cAAc,WAAW,KAAK,IAAI,GAAG,EAAE;CAE5D,IAAI,GAAG,SAAS,YAAY,OAAO,WAAW,MAAM,GAAG,EAAE;CACzD,QAAQ,KAAK,MAAb;EACE,KAAK,QACH,OAAO,GAAG,SAAS,UAAU,WAAW,KAAK,IAAI,GAAG,EAAE;EACxD,KAAK,SACH,OACE,GAAG,SAAS,WACZ,GAAG,GAAG,WAAW,KAAK,GAAG,UACzB,KAAK,GAAG,OAAO,GAAG,MAAM,WAAW,GAAG,GAAG,GAAG,EAAW,CAAC;EAE5D,KAAK,UACH,OACE,GAAG,SAAS,YACZ,OAAO,QAAQ,GAAG,MAAM,CAAC,CAAC,OACvB,CAAC,GAAG,OAAO,KAAK,KAAK,UAAU,WAAW,KAAK,OAAO,IAAa,CAAC,CACvE;EAEJ,SACE,OAAO,KAAK,SAAS,GAAG;CAC5B;AACF;AAEA,MAAM,+BAAe,IAAI,IAAI;CAAC;CAAU;CAAU;CAAW;AAAM,CAAC;;AAGpE,SAAgB,WAAW,GAAU,GAAmB;CACtD,MAAM,IAAI,UAAU,CAAC;CACrB,MAAM,IAAI,UAAU,CAAC;CACrB,IAAI,EAAE,SAAS,aAAa,EAAE,SAAS,WAAW,OAAO;CACzD,IAAI,EAAE,SAAS,WAAW,EAAE,SAAS,SAAS,OAAO;CACrD,IAAI,EAAE,SAAS,UAAU,EAAE,SAAS,QAAQ,OAAO,WAAW,EAAE,IAAI,EAAE,EAAE;CACxE,OAAO,aAAa,IAAI,EAAE,IAAI,KAAK,EAAE,SAAS,EAAE;AAClD;;AAGA,SAAgB,UAAU,MAAsB;CAC9C,MAAM,OAAO,UAAU,IAAI,CAAC,CAAC;CAC7B,OAAO,SAAS,YAAY,SAAS,UAAU,SAAS;AAC1D;;;;;AAMA,SAAgB,MAAM,GAAU,GAAiC;CAC/D,MAAM,WAAW,WAAW,CAAC,KAAK,WAAW,CAAC;CAG9C,MAAM,OAAO,aAFH,UAAU,CAEM,GADhB,UAAU,CACS,CAAC;CAC9B,IAAI,CAAC,KAAK,IAAI,OAAO;CACrB,OAAO,GAAG,WAAW,KAAK,OAAO,QAAQ,CAAC;AAC5C;AAEA,SAAS,aAAa,GAAY,GAAmC;CACnE,MAAM,iBAAiB,IAAI,GAAG,KAAK,CAAC,EAAE,OAAO,KAAK,CAAC,EAAE,qBAAqB;CAC1E,IAAI,EAAE,SAAS,SAAS,OAAO,GAAG,CAAC;CACnC,IAAI,EAAE,SAAS,SAAS,OAAO,GAAG,CAAC;CACnC,IAAI,EAAE,SAAS,aAAa,EAAE,SAAS,WAAW,OAAO,GAAG,EAAE,OAAO;CACrE,IAAI,EAAE,SAAS,UAAU,EAAE,SAAS,QAAQ;EAC1C,MAAM,KAAK,MAAM,EAAE,IAAI,EAAE,EAAE;EAC3B,OAAO,GAAG,KAAK,GAAG,EAAE,KAAK,GAAG,KAAK,CAAC,IAAI,SAAS;CACjD;CACA,IAAI,EAAE,SAAS,WAAW,EAAE,SAAS,SAAS;EAC5C,IAAI,EAAE,GAAG,WAAW,EAAE,GAAG,QAAQ,OAAO,SAAS;EACjD,MAAM,KAAc,CAAC;EACrB,KAAK,MAAM,CAAC,GAAG,MAAM,EAAE,GAAG,QAAQ,GAAG;GACnC,MAAM,IAAI,MAAM,GAAG,EAAE,GAAG,EAAW;GACnC,IAAI,CAAC,EAAE,IAAI,OAAO,SAAS;GAC3B,GAAG,KAAK,EAAE,KAAK;EACjB;EACA,OAAO,GAAG,EAAE,MAAM,EAAE,CAAC;CACvB;CACA,IAAI,EAAE,SAAS,YAAY,EAAE,SAAS,UAAU;EAC9C,MAAM,OAAO,OAAO,KAAK,EAAE,MAAM;EACjC,IAAI,KAAK,WAAW,OAAO,KAAK,EAAE,MAAM,CAAC,CAAC,QAAQ,OAAO,SAAS;EAClE,MAAM,SAAgC,CAAC;EACvC,KAAK,MAAM,KAAK,MAAM;GACpB,MAAM,QAAQ,EAAE,OAAO;GACvB,IAAI,CAAC,OAAO,OAAO,SAAS;GAC5B,MAAM,IAAI,MAAM,EAAE,OAAO,IAAa,KAAK;GAC3C,IAAI,CAAC,EAAE,IAAI,OAAO,SAAS;GAC3B,OAAO,KAAK,EAAE;EAChB;EACA,OAAO,GAAG,EAAE,OAAO,MAAM,CAAC;CAC5B;CACA,OAAO,EAAE,SAAS,EAAE,OAAO,GAAG,CAAC,IAAI,SAAS;AAC9C;;AAGA,SAAgB,SAAS,OAAgD;CACvE,IAAI,MAAa,EAAE;CACnB,KAAK,MAAM,QAAQ,OAAO;EACxB,MAAM,IAAI,MAAM,KAAK,IAAI;EACzB,IAAI,CAAC,EAAE,IAAI,OAAO;EAClB,MAAM,EAAE;CACV;CACA,OAAO,GAAG,GAAG;AACf;;AAGA,SAAgB,WAAW,OAAuB;CAChD,IAAI,UAAU,MAAM,OAAO,EAAE;CAC7B,QAAQ,OAAO,OAAf;EACE,KAAK,UACH,OAAO,EAAE;EACX,KAAK,UACH,OAAO,EAAE;EACX,KAAK,WACH,OAAO,EAAE;CACb;CACA,IAAI,MAAM,QAAQ,KAAK,GAAG;EACxB,MAAM,UAAU,SAAS,MAAM,IAAI,UAAU,CAAC;EAC9C,OAAO,EAAE,KAAK,QAAQ,KAAK,QAAQ,QAAQ,EAAE,OAAO;CACtD;CACA,IAAI,OAAO,UAAU,UACnB,OAAO,EAAE,OACP,OAAO,YAAY,OAAO,QAAQ,KAAe,CAAC,CAAC,KAAK,CAAC,GAAG,OAAO,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,CACxF;CAEF,OAAO,EAAE;AACX;;AAGA,SAAgB,gBAAgB,SAA+B;CAC7D,QAAQ,SAAR;EACE,KAAK,UACH,OAAO,EAAE;EACX,KAAK;EACL,KAAK,WACH,OAAO,EAAE;EACX,KAAK,WACH,OAAO,EAAE;EACX,KAAK;EACL,KAAK,aACH,OAAO,EAAE;EACX,SACE,OAAO,EAAE;CACb;AACF;;;;;AAMA,SAAgB,cAAc,MAAqC;CACjE,MAAM,SAAS,KAAK,QAAQ,QAAQ,EAAE;CACtC,MAAM,SAAS,MAAiC;EAC9C,IAAI,EAAE,SAAS,GAAG,GAAG;GACnB,MAAM,QAAQ,MAAM,EAAE,MAAM,GAAG,EAAE,CAAC;GAClC,OAAO,SAAS,MAAM,SAAS,aAAa,EAAE,SAAS,KAAK,IAAI,KAAA;EAClE;EACA,IAAI,EAAE,WAAW,OAAO,KAAK,EAAE,SAAS,GAAG,GAAG;GAC5C,MAAM,QAAQ,MAAM,EAAE,MAAM,GAAG,EAAE,CAAC;GAClC,OAAO,SAAS,EAAE,KAAK,KAAK;EAC9B;EACA,QAAQ,GAAR;GACE,KAAK,UACH,OAAO,EAAE;GACX,KAAK,UACH,OAAO,EAAE;GACX,KAAK,WACH,OAAO,EAAE;GACX,KAAK,QACH,OAAO,EAAE;GACX,SACE;EACJ;CACF;CACA,MAAM,OAAO,MAAM,MAAM;CACzB,OAAO,OAAO,GAAG,IAAI,IAAI,IAAI,iBAAiB,KAAK,EAAE;AACvD;;AAGA,SAAgB,SAAS,MAAqB;CAC5C,MAAM,OAAO,cAAc,IAAI;CAC/B,IAAI,CAAC,KAAK,IAAI,MAAM,IAAI,MAAM,KAAK,KAAK;CACxC,OAAO,KAAK;AACd;;;;;;;;;;;;ACnPA,MAAa,OAAsB,OAAO,MAAM;AAGhD,SAAgB,YAAY,GAA8C;CACxE,OAAO,OAAO,MAAM,YAAY,MAAM,QAAQ,CAAC,MAAM,QAAQ,CAAC,KAAK,EAAE,aAAa;AACpF;;AAGA,SAAgB,aAAa,GAAgB;CAC3C,IAAI,MAAM,MAAM,OAAO;CACvB,QAAQ,OAAO,GAAf;EACE,KAAK,UACH,OAAO,IAAI,KAAK,UAAU,CAAC;EAC7B,KAAK,UACH,OAAO,IAAI,OAAO,GAAG,GAAG,EAAE,IAAI,IAAI;EACpC,KAAK,WACH,OAAO,IAAI,MAAM;CACrB;CACA,IAAI,aAAa,SAAS,OAAO,IAAI,EAAE;CACvC,IAAI,MAAM,QAAQ,CAAC,GAAG,OAAO,IAAK,EAAqB,IAAI,YAAY,CAAC,CAAC,KAAK,GAAG,EAAE;CACnF,MAAM,MAAM;CACZ,OAAO,IAAI,OAAO,KAAK,GAAG,CAAC,CACxB,KAAK,CAAC,CACN,KAAK,MAAM,GAAG,KAAK,UAAU,CAAC,EAAE,GAAG,aAAa,IAAI,EAAS,GAAG,CAAC,CACjE,KAAK,GAAG,EAAE;AACf;;AAGA,SAAgB,MAAM,KAAU,QAAmC;CACjE,OAAO,aAAa,OAAO,KAAK,MAAM,IAAI,MAAM,IAAI,CAAC;AACvD;AAEA,MAAM,QAAQ,MAAmB;CAC/B,IAAI,MAAM,MAAM,OAAO;CACvB,QAAQ,OAAO,GAAf;EACE,KAAK,WACH,OAAO;EACT,KAAK,UACH,OAAO;EACT,KAAK,UACH,OAAO;CACX;CACA,IAAI,aAAa,SAAS,OAAO;CACjC,OAAO,MAAM,QAAQ,CAAC,IAAI,IAAI;AAChC;;;;;AAMA,SAAgB,YAAY,GAAQ,GAAgB;CAClD,MAAM,KAAK,KAAK,CAAC;CACjB,MAAM,KAAK,KAAK,CAAC;CACjB,IAAI,OAAO,IAAI,OAAO,KAAK;CAC3B,QAAQ,IAAR;EACE,KAAK,GACH,OAAO;EACT,KAAK;EACL,KAAK,GACH,OAAO,OAAO,CAAC,IAAI,OAAO,CAAC;EAC7B,KAAK,GACH,OAAO,MAAM,IAAI,IAAK,IAAgB,IAAe,KAAK;EAC5D,KAAK,GACH,OAAQ,EAAc,UAAW,EAAc;EACjD,KAAK,GAAG;GACN,MAAM,IAAI;GACV,MAAM,IAAI;GACV,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,IAAI,EAAE,QAAQ,EAAE,MAAM,GAAG,KAAK;IACrD,MAAM,IAAI,YAAY,EAAE,IAAW,EAAE,EAAS;IAC9C,IAAI,MAAM,GAAG,OAAO;GACtB;GACA,OAAO,EAAE,SAAS,EAAE;EACtB;EACA,SAAS;GACP,MAAM,IAAI,aAAa,CAAC;GACxB,MAAM,IAAI,aAAa,CAAC;GACxB,OAAO,MAAM,IAAI,IAAI,IAAI,IAAI,KAAK;EACpC;CACF;AACF;AAEA,SAAgB,UAAU,GAAQ,GAAiB;CACjD,OAAO,YAAY,GAAG,CAAC,MAAM;AAC/B;;AAGA,SAAgB,OAAO,GAAc;CACnC,IAAI,aAAa,SAAS,OAAO,EAAE,YAAY;CAC/C,IAAI,MAAM,QAAQ,CAAC,GAAG,OAAQ,EAAqB,IAAI,MAAM;CAC7D,IAAI,YAAY,CAAC,GAAG,OAAO,OAAO,YAAY,OAAO,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,OAAO,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;CAC/F,OAAO;AACT;;AAGA,SAAgB,YAAY,MAAsB,QAAkC;CAClF,OAAO,CAAC,GAAG,IAAI,CAAC,CAAC,MAAM,GAAG,MAAM;EAC9B,KAAK,MAAM,KAAK,QAAQ;GACtB,MAAM,IAAI,YAAY,EAAE,MAAM,MAAM,EAAE,MAAM,IAAI;GAChD,IAAI,MAAM,GAAG,OAAO;EACtB;EACA,MAAM,IAAI,aAAa,CAAC;EACxB,MAAM,IAAI,aAAa,CAAC;EACxB,OAAO,MAAM,IAAI,IAAI,IAAI,IAAI,KAAK;CACpC,CAAC;AACH;;;;;;;;;;;;;;;ACtHA,MAAM,cAAc;CAAC;CAAM;CAAO;CAAM;CAAO;CAAM;CAAO;CAAU;AAAO;AAC7E,MAAM,aAAa,CAAC,MAAM,QAAQ;AAClC,MAAM,WAAW,CAAC,WAAW,UAAU;AACvC,MAAM,cAAc;CAAC;CAAO;CAAO;AAAK;;AAGxC,MAAa,aAAa;CACxB,GAAG;CACH,GAAG;CACH;CACA,GAAG;CACH,GAAG;AACL;;;;;AAiBA,SAAgB,iBACd,KACA,KACA,OACsB;CACtB,IAAI,OAAO,QAAQ,YAAY,QAAQ,QAAQ,MAAM,QAAQ,GAAG,GAC9D,OAAO,IAAI,qDAAmD;CAEhE,MAAM,OAAO;CACb,MAAM,OAAO,OAAO,KAAK,IAAI,CAAC,CAAC,QAAQ,MAAM,MAAM,MAAM;CACzD,IAAI,KAAK,WAAW,GAClB,OAAO,IACL,gDAAgD,KAAK,SAAS,KAAK,KAAK,IAAI,IAAI,QAClF;CAEF,MAAM,OAAO,KAAK;CAClB,IAAI,CAAE,WAAiC,SAAS,IAAI,GAAG,OAAO,IAAI,sBAAsB,KAAK,EAAE;CAC/F,MAAM,QAAQ,KAAK;CAEnB,IAAK,YAAkC,SAAS,IAAI,GAAG;EACrD,IAAI,UAAU,MAAM,OAAO,IAAI,IAAI,KAAK,oDAAoD;EAC5F,OAAO,mBAAmB,MAAsC,OAAO,KAAK,KAAK;CACnF;CAEA,MAAM,UAAU,eAAe,KAAK,MAAM,KAAK,KAAK;CACpD,IAAI,CAAC,QAAQ,IAAI,OAAO;CACxB,MAAM,EAAE,MAAM,QAAQ,QAAQ;CAC9B,MAAM,OAAO,UAAU,IAAI;CAE3B,QAAQ,MAAR;EACE,KAAK;EACL,KAAK,YAAY;GACf,IAAI,OAAO,UAAU,WAAW,OAAO,IAAI,IAAI,KAAK,sBAAsB;GAC1E,IAAI,SAAS,cAAc,KAAK,SAAS,YAAY,KAAK,SAAS,WACjE,OAAO,IAAI,oCAAoC,KAAK,IAAI,GAAG;GAE7D,MAAM,QACJ,SAAS,aACJ,MAAW,MAAM,QACjB,MAAW,MAAM,QAAS,OAAO,MAAM,YAAY,EAAE,KAAK,MAAM;GACvE,OAAO,IAAI,GAAG,GAAG,MAAM,MAAM,IAAI,GAAG,GAAG,CAAC,CAAC,MAAM,KAAK;EACtD;EACA,KAAK,WAAW;GACd,IAAI,OAAO,UAAU,UAAU,OAAO,IAAI,2CAA2C;GACrF,IAAI,KAAK,SAAS,YAAY,KAAK,SAAS,WAC1C,OAAO,IAAI,mCAAmC,KAAK,IAAI,GAAG;GAE5D,MAAM,QAAQ,aAAa,KAAK;GAChC,IAAI,CAAC,MAAM,IAAI,OAAO;GACtB,MAAM,KAAK,MAAM;GACjB,OAAO,IAAI,GAAG,GAAG,MAAM;IACrB,MAAM,IAAI,IAAI,GAAG,GAAG,CAAC;IACrB,OAAO,OAAO,MAAM,YAAY,GAAG,KAAK,CAAC;GAC3C,CAAC;EACH;EACA,KAAK;EACL,KAAK,UAAU;GACb,MAAM,UAAU,eAAe,OAAO,KAAK,KAAK,SAAS,MAAM;GAC/D,IAAI,CAAC,QAAQ,IAAI,OAAO;GACxB,MAAM,WAAW,UAAU,QAAQ,MAAM,IAAI;GAC7C,IAAI,SAAS,SAAS,QACpB,OAAO,IAAI,IAAI,KAAK,sBAAsB,KAAK,QAAQ,MAAM,IAAI,GAAG;GACtE,IAAI,CAAC,WAAW,MAAM,SAAS,EAAE,GAC/B,OAAO,IAAI,eAAe,KAAK,IAAI,EAAE,qBAAqB,KAAK,QAAQ,GAAG;GAE5E,MAAM,OAAO,QAAQ,MAAM;GAC3B,MAAM,UAAgB,GAAG,GAAG,MAAM;IAChC,MAAM,IAAI,IAAI,GAAG,GAAG,CAAC;IACrB,MAAM,SAAS,KAAK,GAAG,GAAG,CAAC;IAC3B,IAAI,MAAM,QAAQ,CAAC,MAAM,QAAQ,MAAM,GAAG,OAAO;IACjD,OAAQ,OAA0B,MAAM,MAAM,MAAM,QAAQ,YAAY,GAAG,CAAC,MAAM,CAAC;GACrF;GACA,OAAO,GAAG,SAAS,OAAO,UAAU,GAAG,GAAG,MAAM,CAAC,OAAO,GAAG,GAAG,CAAC,CAAC;EAClE;CACF;CAGA,MAAM,SAAS,SAAS,YAAY,SAAS;CAC7C,IAAI,UAAU,KAAK,SAAS,UAAU,KAAK,SAAS,WAClD,OAAO,IAAI,IAAI,KAAK,0BAA0B,KAAK,IAAI,GAAG;CAE5D,IAAI,CAAC,UAAU,SAAS,QAAQ,SAAS,SAAS,CAAC,UAAU,IAAI,KAAK,KAAK,SAAS,WAClF,OAAO,IAAI,IAAI,KAAK,+CAA+C,KAAK,IAAI,GAAG;CAEjF,IAAI,UAAU,MAAM,OAAO,IAAI,IAAI,KAAK,wCAAwC;CAChF,MAAM,UAAU,eAAe,OAAO,KAAK,KAAK,SAAS,UAAU,MAAM;CACzE,IAAI,CAAC,QAAQ,IAAI,OAAO;CACxB,IAAI,CAAC,WAAW,MAAM,QAAQ,MAAM,IAAI,GACtC,OAAO,IAAI,kBAAkB,KAAK,IAAI,EAAE,QAAQ,KAAK,QAAQ,MAAM,IAAI,GAAG;CAE5E,MAAM,QAAQ,QAAQ,MAAM;CAC5B,MAAM,OAAO,QAAQ;CACrB,OAAO,IAAI,GAAG,GAAG,MAAM;EACrB,MAAM,IAAI,IAAI,GAAG,GAAG,CAAC;EACrB,MAAM,IAAI,MAAM,GAAG,GAAG,CAAC;EACvB,MAAM,QAAQ,MAAM,QAAQ,MAAM,QAAQ,KAAK,YAAY,GAAG,CAAC,CAAC;EAChE,OAAO,SAAS,QAAQ,CAAC,QAAQ;CACnC,CAAC;AACH;AAEA,MAAM,UAAwE;CAC5E,KAAK,MAAM,MAAM;CACjB,MAAM,MAAM,MAAM;CAClB,KAAK,MAAM,IAAI;CACf,MAAM,MAAM,KAAK;CACjB,KAAK,MAAM,IAAI;CACf,MAAM,MAAM,KAAK;CACjB,SAAS,MAAM,IAAI;CACnB,QAAQ,MAAM,IAAI;AACpB;AAEA,SAAS,mBACP,MACA,OACA,KACA,OACsB;CACtB,IAAI,SAAS,OAAO;EAClB,MAAM,QAAQ,iBAAiB,OAAO,KAAK,KAAK;EAChD,IAAI,CAAC,MAAM,IAAI,OAAO;EACtB,MAAM,OAAO,MAAM;EACnB,OAAO,IAAI,GAAG,GAAG,MAAM,CAAC,KAAK,GAAG,GAAG,CAAC,CAAC;CACvC;CACA,MAAM,KAAM,OAAmC;CAC/C,IACE,OAAO,UAAU,YACjB,UAAU,QACV,OAAO,KAAK,KAAK,CAAC,CAAC,WAAW,KAC9B,CAAC,MAAM,QAAQ,EAAE,GAEjB,OAAO,IAAI,IAAI,KAAK,+BAA+B;CAErD,MAAM,QAAgB,CAAC;CACvB,KAAK,MAAM,CAAC,GAAG,MAAM,GAAG,QAAQ,GAAG;EACjC,MAAM,WAAW,iBAAiB,GAAG,KAAK,KAAK;EAC/C,IAAI,CAAC,SAAS,IAAI,OAAO,IAAI,GAAG,KAAK,MAAM,EAAE,KAAK,SAAS,OAAO;EAClE,MAAM,KAAK,SAAS,KAAK;CAC3B;CACA,OAAO,GACL,SAAS,SACJ,GAAG,GAAG,MAAM,MAAM,OAAO,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,KACzC,GAAG,GAAG,MAAM,MAAM,MAAM,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,CAC/C;AACF;AAEA,SAAS,eACP,MACA,KACA,OAC8C;CAC9C,IAAI,SAAS,KAAA,GAAW;EACtB,IAAI,OAAO,SAAS,UAAU,OAAO,IAAI,2BAA2B;EACpE,MAAM,OAAO,UAAU,IAAI,QAAQ,IAAI;EACvC,IAAI,CAAC,KAAK,IAAI,OAAO;EACrB,OAAO,GAAG;GAAE,MAAM,KAAK;GAAO,MAAM,IAAI,MAAM,EAAE,SAAS;EAAK,CAAC;CACjE;CACA,IAAI,CAAC,SAAS,MAAM,SAAS,QAC3B,OAAO,IAAI,+DAA6D;CAE1E,OAAO,GAAG;EAAE,MAAM;EAAO,MAAM,MAAM;CAAE,CAAC;AAC1C;;AAGA,SAAgB,eACd,OACA,KACA,QACyB;CACzB,IAAI,OAAO,UAAU,YAAY,UAAU,QAAQ,CAAC,MAAM,QAAQ,KAAK,GAAG;EACxE,MAAM,OAAO,OAAO,KAAK,KAAK;EAC9B,MAAM,IAAI;EACV,IAAI,KAAK,WAAW,KAAK,OAAO,EAAE,QAAQ,UAAU;GAClD,MAAM,MAAM,EAAE;GACd,MAAM,OAAO,UAAU,IAAI,QAAQ,GAAG;GACtC,IAAI,CAAC,KAAK,IAAI,OAAO;GACrB,OAAO,GAAG;IAAE,MAAM,KAAK;IAAO,MAAM,IAAI,MAAM,EAAE,QAAQ;GAAK,CAAC;EAChE;EACA,IAAI,KAAK,WAAW,KAAK,OAAO,EAAE,UAAU,UAAU;GACpD,MAAM,OAAO,EAAE;GACf,IAAI,CAAC,OAAO,OAAO,IAAI,QAAQ,IAAI,GAAG,OAAO,IAAI,kBAAkB,KAAK,EAAE;GAC1E,OAAO,QAAQ,IAAI,OAAO,OAAe,KAAK,MAAM;EACtD;EACA,OAAO,IAAI,4EAAwE;CACrF;CACA,OAAO,QAAQ,OAAe,KAAK,MAAM;AAC3C;AAEA,SAAS,QAAQ,OAAa,KAAgB,QAA0C;CACtF,IAAI,UAAU,OAAO,UAAU,UAAU;EACvC,MAAM,OAAO,cAAc,KAAK;EAChC,IAAI,CAAC,KAAK,IAAI,OAAO;EACrB,IAAI,UAAU,KAAK,KAAK,GAAG,IAAI,MAAM,OAAO;EAC5C,OAAO,GAAG;GAAE,MAAM,EAAE;GAAM,KAAK,WAAW,KAAK,KAAK;EAAE,CAAC;CACzD;CACA,IAAI,UAAU,MAAM,QAAQ,KAAK,KAAK,MAAM,OAAO,MAAM,OAAO,MAAM,QAAQ,GAAG;EAC/E,MAAM,QAAoB,CAAC;EAC3B,KAAK,MAAM,KAAK,OAAmB;GACjC,MAAM,OAAO,cAAc,CAAC;GAC5B,IAAI,CAAC,KAAK,IAAI,OAAO;GACrB,IAAI,UAAU,KAAK,KAAK,GAAG,IAAI,MAAM,OAAO;GAC5C,MAAM,KAAK,KAAK,KAAK;EACvB;EACA,MAAM,UAAU,MAAM,IAAI,UAAU;EACpC,OAAO,GAAG;GAAE,MAAM,EAAE,KAAK,EAAE,IAAI;GAAG,MAAM,GAAG,GAAG,MAAM,QAAQ,KAAK,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC;EAAE,CAAC;CACtF;CACA,MAAM,WAAW;CACjB,OAAO,GAAG;EAAE,MAAM,WAAW,KAAK;EAAG,WAAW;CAAS,CAAC;AAC5D;;AAGA,SAAS,WAAW,MAAwB;CAC1C,IAAI,MAAM;CACV,IAAI,SAAkB,QAAQ,UAAU,CAAC;CACzC,QAAQ,IAAI,IAAI,QAAQ;EACtB,MAAM,IAAI,GAAG,IAAI,IAAI,QAAQ,GAAG,IAAI;EACpC,IAAI,MAAM,KAAK;GACb,SAAS,gBAAgB,MAAM,GAAG;GAClC,MAAM;EACR;EACA,OAAO;CACT;AACF;AAEA,SAAgB,aAAa,SAAyC;CACpE,IAAI;EACF,OAAO,GAAG,IAAI,OAAO,SAAS,GAAG,CAAC;CACpC,SAAS,GAAG;EACV,OAAO,IAAI,+BAAgC,EAAY,SAAS;CAClE;AACF;;;;;AAMA,SAAgB,aAAa,KAAwB;CACnD,IAAI,OAAO,QAAQ,YAAY,QAAQ,MAAM,OAAO,CAAC;CACrD,MAAM,OAAO;CACb,IAAI,OAAO,KAAK,SAAS,YAAY,KAAK,YAAY,OAAO,OAAO,CAAC,KAAK,IAAI;CAC9E,MAAM,KAAM,KAAK,KAAsC;CACvD,OAAO,MAAM,QAAQ,EAAE,IAAI,GAAG,QAAQ,YAAY,IAAI,CAAC;AACzD;;;ACtQA,MAAM,QAAqE;CACzE,OAAO;EAAC;EAAS;EAAmB;CAAM;CAC1C,QAAQ;EAAC;EAAS;EAAa;EAAmB;CAAM;CACxD,OAAO;EAAC;EAAS;EAAmB;CAAM;CAC1C,MAAM;EAAC;EAAS;EAAa;EAAY;EAAe;EAAmB;CAAM;CACjF,SAAS;EAAC;EAAS;EAAmB;CAAM;AAC9C;AAEA,SAAgB,WAAW,QAA4B;CACrD,IAAI,OAAO,WAAW,UAAU,OAAO;CACvC,OAAO,cAAc,SAAS,aAAa;AAC7C;;AAGA,SAAgB,cAAc,MAA8B,QAAgB,KAAsB;CAChG,IAAI,QAAQ,KAAA,GAAW,OAAO;CAC9B,IAAI,SAAS,KAAA,GAAW,OAAO;CAC/B,IAAI,OAAO,SAAS,YAAY,cAAc,QAAQ,iBAAiB,MAAM,OAAO;CACpF,MAAM,QAAQ;CACd,OAAO,MAAM,WAAW,MAAM,WAAW;AAC3C;;AAGA,SAAgB,YACd,QACA,OACA,QAC4B;CAC5B,MAAM,OAAO,WAAW,MAAM;CAC9B,IAAI,CAAC,MAAM,MAAM,CAAC,SAAS,IAAI,GAAG,OAAO,IAAI,UAAU,KAAK,qBAAqB,OAAO;CACxF,IAAI,OAAO,WAAW,UAAU,OAAO,GAAG,MAAM;CAEhD,MAAM,WADS,cAAc,SAAS,OAAO,WAAW,OAAO,KAAK,OAAO,WAAW,EAAA,CAC/D,QAAQ,MAAM,CAAC,OAAO,OAAO,OAAO,KAAK,QAAQ,CAAC,CAAC;CAC1E,IAAI,QAAQ,QAAQ,OAAO,IAAI,GAAG,KAAK,yBAAyB,QAAQ,KAAK,IAAI,GAAG;CACpF,IAAI,iBAAiB,QAAQ;EAC3B,KAAK,MAAM,CAAC,GAAG,MAAM,OAAO,QAAQ,OAAO,WAAW,GAAG;GACvD,MAAM,OAAO,OAAO,KAAK,OAAO;GAChC,IAAI,MAAM,QAAQ,CAAC,WAAW,WAAW,CAAC,GAAG,UAAU,IAAI,CAAC,GAC1D,OAAO,IAAI,eAAe,EAAE,IAAI,KAAK,UAAU,CAAC,EAAE,YAAY,KAAK,UAAU,IAAI,CAAC,GAAG;EAEzF;EACA,OAAO,GAAG,MAAM;CAClB;CAEA,MAAM,UAAU,EAAE,GAAG,OAAO,KAAK,OAAO;CACxC,KAAK,MAAM,KAAK,OAAO,UAAU,QAAQ,KAAK,EAAE,SAAS,QAAQ,EAAW;CAC5E,OAAO,GAAG;EAAE,GAAG;EAAQ,MAAM,EAAE,OAAO,OAAO;CAAE,CAAC;AAClD;;AAqBA,SAAgB,gBACd,MACA,MACA,MACA,YACS;CACT,MAAM,0BAAU,IAAI,IAAY;CAChC,KAAK,MAAM,KAAK,YACd,IAAI,WAAW,EAAE,MAAM,MAAM,aAAa,KAAK,MAAM,KAAK,EAAE,QAAQ,CAAC,GAAG,QAAQ,IAAI,CAAC;CAEvF,MAAM,0BAAU,IAAI,IAAiC;CACrD,KAAK,MAAM,KAAK,YAAY;EAC1B,IAAI,OAAO,EAAE,WAAW,UAAU;EAClC,MAAM,QACJ,cAAc,EAAE,SACZ,OAAO,YAAY,EAAE,OAAO,SAAS,KAAK,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,IACzD,EAAE,OAAO;EAChB,KAAK,MAAM,KAAK,EAAE,QAAQ,CAAC,GACzB,IAAI,CAAC,QAAQ,IAAI,CAAC,GAAG,QAAQ,IAAI,GAAG;GAAE,GAAG,QAAQ,IAAI,CAAC;GAAG,GAAG;EAAM,CAAC;CAEvE;CACA,MAAM,MAAa,CAAC;CACpB,KAAK,MAAM,CAAC,GAAG,QAAQ,KAAK,QAAQ,GAAG;EACrC,IAAI,QAAQ,IAAI,CAAC,GAAG;EACpB,MAAM,QAAQ,QAAQ,IAAI,CAAC;EAC3B,IAAI,KAAK,QAAQ;GAAE,GAAG;GAAK,GAAG;EAAM,IAAI,GAAG;CAC7C;CACA,MAAM,YAAY,MAChB,WAAW,EAAE,MAAM,MAAM,eACpB,EAAE,QAAQ,CAAC,EAAA,CAAG,SACf,OAAO,EAAE,WAAW,WAClB,KAAA,KACC,EAAE,QAAQ,CAAC,EAAA,CAAG,QAAQ,MAAM,CAAC,QAAQ,IAAI,CAAC,CAAC,CAAC,CAAC;CACtD,OAAO;EACL,MAAM;EACN,SAAS,QAAQ,OAAO,QAAQ;EAChC,MAAM,WAAW,MAAM,MAAM,EAAE,WAAW,MAAM;EAChD,gBAAgB,WAAW,MAAM,MAAM,EAAE,WAAW,iBAAiB;EACrE,QAAQ,WAAW,KAAK,OAAO;GAC7B;GACA;GACA,QAAQ,EAAE;GACV,QAAQ,EAAE;GACV,SAAS,EAAE;GACX,OAAO,EAAE;GACT,SAAS,EAAE;GACX,GAAI,SAAS,CAAC,MAAM,KAAA,IAAY,CAAC,IAAI,EAAE,cAAc,SAAS,CAAC,EAAE;EACnE,EAAE;CACJ;AACF;AAEA,MAAMC,YAAU;AAEhB,SAAgB,eACd,OACA,OACA,QACA,UACuB;CACvB,MAAM,WAAqB,CAAC;CAC5B,IAAI,MAAM,QAAQ,KAAA,KAAa,QAAQ,MAAM,KAC3C,SAAS,KAAK,SAAS,MAAM,SAAS,MAAM,KAAK;CACnD,IAAI,MAAM,QAAQ,KAAA,KAAa,QAAQ,MAAM,KAC3C,SAAS,KAAK,SAAS,MAAM,SAAS,MAAM,KAAK;CACnD,MAAM,QAAQ,MAAM;CACpB,IAAI,SAAS,aAAa,KAAA,KAAa,WAAW,GAAG;EACnD,MAAM,QAAQ,QAAQ;EACtB,IACG,MAAM,QAAQ,KAAA,KAAa,QAAQ,MAAM,OACzC,MAAM,QAAQ,KAAA,KAAa,QAAQ,MAAM,KAE1C,SAAS,KAAK,SAAS,MAAM,MAAM,MAAM,QAAQ,CAAC,EAAE,iBAAiB,UAAU;CAEnF;CACA,OAAO,SAAS,SACZ;EAAE,QAAQ;EAAS;EAAQ,SAAS,SAAS,KAAK,IAAI;EAAG,OAAO;EAAG,SAAS,CAAC,KAAK;CAAE,IACpF,KAAA;AACN;AAEA,SAAgB,gBACd,MACA,MACA,QACuB;CACvB,MAAM,yBAAS,IAAI,IAAsB;CACzC,KAAK,MAAM,CAAC,GAAG,QAAQ,KAAK,QAAQ,GAAG;EACrC,MAAM,IAAI,MAAM,KAAK,IAAI;EACzB,MAAM,IAAI,OAAO,IAAI,CAAC;EACtB,IAAI,GAAG,EAAE,KAAK,CAAC;OACV,OAAO,IAAI,GAAG,CAAC,CAAC,CAAC;CACxB;CACA,MAAM,aAAa,CAAC,GAAG,OAAO,OAAO,CAAC,CAAC,CAAC,QAAQ,MAAM,EAAE,SAAS,CAAC;CAClE,IAAI,WAAW,WAAW,GAAG,OAAO,KAAA;CACpC,OAAO;EACL,QAAQ;EACR;EACA,SAAS,GAAG,KAAK,KAAK,IAAI,EAAE,eAAe,WAAW,OAAO;EAC7D,OAAO,WAAW;EAClB,SAAS,WACN,MAAM,GAAGA,SAAO,CAAC,CACjB,KAAK,MAAM,KAAK,KAAK,MAAM,OAAQ,KAAK,EAAE,GAAa,CAAS,MAAM,IAAI,CAAC,CAAC;EAC/E,MAAM,WAAW,KAAK;CACxB;AACF;AAEA,SAAgB,cACd,MACA,MACA,KACA,QACuB;CACvB,MAAM,MAAgB,CAAC;CACvB,KAAK,MAAM,CAAC,GAAG,QAAQ,KAAK,QAAQ,GAAG,IAAI,CAAC,KAAK,MAAM,KAAK,GAAG,GAAG,IAAI,KAAK,CAAC;CAC5E,IAAI,IAAI,WAAW,GAAG,OAAO,KAAA;CAC7B,OAAO;EACL,QAAQ;EACR;EACA,SAAS,GAAG,IAAI,OAAO;EACvB,OAAO,IAAI;EACX,SAAS,IAAI,MAAM,GAAGA,SAAO,CAAC,CAAC,KAAK,MAAM,OAAO,KAAK,EAAS,CAAC;EAChE,MAAM;CACR;AACF;;AAKA,SAAgB,gBACd,MACA,OACA,MACa;CACb,MAAM,yBAAS,IAAI,IAAiB;CACpC,KAAK,MAAM,OAAO,MAAM;EACtB,MAAM,KAAK,IAAI,MAAM,OAAO;EAC5B,MAAM,IAAI,OAAO,OAAO,WAAW,KAAK,KAAK,UAAU,OAAO,EAAE,CAAC;EACjE,IAAI,CAAC,OAAO,IAAI,CAAC,GAAG,OAAO,IAAI,GAAG,IAAI,MAAM,UAAU,IAAI;CAC5D;CACA,MAAM,MAAmB,CAAC;CAC1B,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,MAAM,MAAM,GAAG;EACvD,MAAM,MAAM,OAAO,IAAI,GAAG;EAC1B,MAAM,QAAQ,OAAO,QAAQ,WAAW,MAAM;EAC9C,MAAM,MAAM,MAAM,QAAQ,KAAA,KAAa,QAAQ,MAAM;EACrD,MAAM,OAAO,MAAM,QAAQ,KAAA,KAAa,QAAQ,MAAM;EACtD,IAAI,OAAO,MACT,IAAI,KAAK;GACP,QAAQ;GACR,QAAQ,cAAc,MAAM,SAAS,MAAM,MAAM;GACjD,SAAS,GAAG,MAAM,GAAG,GAAG,IAAI,IAAI,MAAM,MAAM,GAAG,MAAM,GAAG,MAAM,SAAS,MAAM,QAAQ,SAAS,MAAM;GACpG,OAAO;GACP,SAAS,CAAC,GAAG;EACf,CAAC;CAEL;CACA,OAAO;AACT;;AAYA,SAAgB,mBACd,MACA,KACA,QACA,MACsE;CACtE,MAAM,SAAsB,CAAC;CAC7B,MAAM,SAAS,OAAe,YAC5B,OAAO,KAAK;EAAE;EAAS;EAAO,MAAM;CAAsB,CAAC;CAC7D,IAAI,WAAW;CACf,MAAM,SAAS,OAAO,KAAK;CAC3B,MAAM,WAAW,UAA6B,MAAM,QAAQ,MAAM,CAAC,OAAO,OAAO,QAAQ,CAAC,CAAC;CAE3F,KAAK,MAAM,UAAU;EAAC;EAAS;EAAU;EAAS;CAAM,GAAY;EAClE,IAAI,IAAI,YAAY,KAAA,GAAW;EAE/B,MAAM,UAAU,YADD,cAAc,IAAI,QAAQ,MACR,GAAG,QAAQ,QAAQ;EACpD,IAAI,QAAQ,IAAI,WAAW,QAAQ;OAC9B,MAAM,QAAQ,QAAQ,KAAK;CAClC;CACA,IAAI,IAAI,UAAU,QAAQ,IAAI,MAAM,CAAC,CAAC,QACpC,MAAM,UAAU,mBAAmB,QAAQ,IAAI,MAAM,CAAC,CAAC,KAAK,IAAI,GAAG;CAErE,IAAI,IAAI,OAAO;EACb,MAAM,QAAQ,IAAI;EAClB,IAAI,QAAQ,CAAC,MAAM,IAAI,MAAM,KAAK,CAAC,CAAC,CAAC,QACnC,MAAM,SAAS,mBAAmB,QAAQ,CAAC,MAAM,IAAI,MAAM,KAAK,CAAC,CAAC,CAAC,KAAK,IAAI,GAAG;OAC1E,IAAI,CAAC,WAAW,OAAO,MAAM,QAAiB,EAAE,MAAM,GAC3D,MAAM,SAAS,GAAG,MAAM,MAAM,kBAAkB;EAElD,KAAK,MAAM,SAAS,OAAO,OAAO,MAAM,MAAM,GAAG;GAC/C,IAAI,MAAM,WAAW,KAAA,GAAW;GAChC,MAAM,UAAU,YAAY,MAAM,QAAQ,SAAS,QAAQ;GAC3D,IAAI,CAAC,QAAQ,IAAI,MAAM,SAAS,QAAQ,KAAK;EAC/C;CACF;CACA,IAAI;CACJ,IAAI,IAAI,MAAM;EACZ,MAAM,WAAW,iBAAiB,IAAI,KAAK,MAAM,KAAK,OAAO,IAAI,CAAC;EAClE,IAAI,SAAS,IAAI,OAAO,SAAS;OAC5B,MAAM,QAAQ,SAAS,KAAK;CACnC;CACA,IAAI,OAAO,QAAQ,OAAO;EAAE,IAAI;EAAO,OAAO;CAAO;CAErD,MAAM,SAAkB,MAAM,KAAK,YAAY;EAC7C,MAAM,aAA0B,CAAC;EACjC,MAAM,QAAQ,MAA6B,KAAK,WAAW,KAAK,CAAC;EACjE,IAAI,IAAI,SAAS,CAAC,QAAQ,WACxB,KACE,eACE,KAAK,QACL,IAAI,OACJ,cAAc,IAAI,QAAQ,OAAO,GACjC,QAAQ,QACV,CACF;EAEF,IAAI,IAAI,QAAQ,KAAK,gBAAgB,MAAM,IAAI,QAAQ,cAAc,IAAI,QAAQ,QAAQ,CAAC,CAAC;EAC3F,IAAI,IAAI,OAAO,WAAW,KAAK,GAAG,gBAAgB,MAAM,IAAI,OAAO,IAAI,MAAM,CAAC;EAC9E,IAAI,MAAM,KAAK,cAAc,MAAM,MAAM,KAAK,cAAc,IAAI,QAAQ,MAAM,CAAC,CAAC;EAChF,OAAO,gBAAgB,MAAM,eAAe,MAAM,UAAU;CAC9D;CACA,OAAO,GAAG;EAAE,QAAQ;EAAU;CAAM,CAAC;AACvC;;;;;;;;;;;AC9IA,SAAgB,WAAc,KAA6B;CACzD,OAAO;AACT;AAEA,MAAa,SAAS,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;;AAGtC,SAAgB,WAAW,MAAc,MAA0C;CACjF,OAAO,OAAO,YACZ,OAAO,KAAK,KAAK,MAAM,CAAC,CAAC,KAAK,UAAU,CAAC,OAAO;EAAE;EAAM;EAAO,WAAW;CAAM,CAAC,CAAC,CACpF;AACF;;AAGA,SAAgB,KAAK,SAAiB,QAAoC,CAAC,GAAG;CAC5E,OAAO;EAAE,IAAI;EAAgB,OAAO,CAAC;GAAE;GAAS,GAAG;EAAM,CAAC;CAA0B;AACtF;;;;;;;;;AClLA,MAAM,UAAU,EACb,MACC,EAAE,MAAM,CACN,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,GAChB,EAAE,aAAa;CAAE,MAAM,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;CAAG,MAAM,EAAE,QAAQ,CAAC,CAAC,SAAS;AAAE,CAAC,CAC1E,CAAC,CACH,CAAC,CACA,IAAI,CAAC;AAER,MAAM,MAAM,EAAE,aAAa;CACzB,KAAK,EAAE,KAAK;EACV;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;CACF,CAAC;CACD,MAAM,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS;CACjC,OAAO,EAAE,QAAQ,CAAC,CAAC,SAAS;CAC5B,UAAU,QAAQ,SAAS;CAC3B,MAAM,EAAE,QAAQ,CAAC,CAAC,SAAS;AAC7B,CAAC;AAGD,MAAMC,YAAS,EAAE,aAAa;CAC5B,IAAI;CACJ,UAAU,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC;CACnC,QAAQ,EACL,OAAO,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,CAC9B,QAAQ,MAAM,OAAO,KAAK,CAAC,CAAC,CAAC,SAAS,GAAG,0BAA0B;CACtE,gBAAgB,EAAE,QAAQ,CAAC,CAAC,SAAS;AACvC,CAAC;AAED,MAAM,6BAAa,IAAI,IAAI;CACzB;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AACF,CAAC;AACD,MAAM,8BAAc,IAAI,IAAI;CAAC;CAAgB;CAAS;AAAM,CAAC;AAC7D,MAAM,6BAAa,IAAI,IAAI,CAAC,OAAO,KAAK,CAAC;AAIzC,SAAS,WACP,MACA,MACA,OACA,KAC+C;CAC/C,MAAM,SAAS,aAAgC;EAAE;EAAS,OAAO;CAAK;CACtE,MAAM,OAAO,IAAI,UAAU,KAAK;CAChC,IAAI,WAAW,IAAI,KAAK,GAAG,OAAO,KAAK,SAAS,KAAA,IAC9C,OAAO,MACL,WAAW,IAAI,KAAK,GAAG,IAAI,GAAG,KAAK,IAAI,iBAAiB,GAAG,KAAK,IAAI,eACtE;CAEF,IAAI,YAAY,IAAI,KAAK,GAAG,OAAO,KAAK,aAAa,KAAA,IACnD,OAAO,MACL,YAAY,IAAI,KAAK,GAAG,IAAI,GAAG,KAAK,IAAI,mBAAmB,GAAG,KAAK,IAAI,mBACzE;CAEF,IAAI,WAAW,IAAI,KAAK,GAAG,OAAO,KAAK,SAAS,KAAA,IAC9C,OAAO,MACL,WAAW,IAAI,KAAK,GAAG,IAAI,GAAG,KAAK,IAAI,iBAAiB,GAAG,KAAK,IAAI,eACtE;CAEF,MAAM,OAAO,KAAK;CAClB,MAAM,YAAY,SAAS,KAAA,IAAY,KAAA,IAAY,MAAM,OAAO;CAChE,IAAI,SAAS,KAAA,KAAa,CAAC,WAAW,OAAO,MAAM,kBAAkB,KAAK,EAAE;CAC5E,MAAM,SAAS,KAAK,YAAY,CAAC,EAAA,CAAG,KAAK,MACvC,OAAO,MAAM,WAAW;EAAE,MAAM;EAAG,MAAM;CAAM,IAAI;EAAE,MAAM;EAAO,GAAG;CAAE,CACzE;CACA,MAAM,eAAe,MAAM,QAAQ,MAAM,CAAC,OAAO,OAAO,MAAM,QAAQ,EAAE,IAAI,CAAC;CAC7E,IAAI,aAAa,QACf,OAAO,MAAM,4BAA6B,aAAa,EAAE,CAAsB,KAAK,EAAE;CAExF,IAAI;CACJ,IAAI,KAAK,UAAU,KAAA,GAAW;EAC5B,MAAM,IAAI,iBAAiB,KAAK,OAAO,IAAI;EAC3C,IAAI,CAAC,EAAE,IAAI,OAAO,MAAM,UAAU,EAAE,OAAO;EAC3C,QAAQ,EAAE;CACZ;CACA,IAAI;CACJ,IAAI,KAAK,SAAS,KAAA,GAAW;EAC3B,MAAM,IAAI,iBAAiB,KAAK,MAAM,IAAI;EAC1C,IAAI,CAAC,EAAE,IAAI,OAAO,MAAM,SAAS,EAAE,OAAO;EAC1C,OAAO,EAAE;CACX;CAEA,MAAM,UAAU,SAAmB,KAAK,KAAK,MAAM,EAAE,SAAmB,IAAI;CAC5E,MAAM,WAAW,SAAmB,OAAO,IAAI,CAAC,CAAC,QAAQ,MAAM,MAAM,IAAI;CACzE,MAAM,UAAU,SACd,CAAC,GAAG,IAAI,CAAC,CAAC,MAAM,GAAG,MAAM;EACvB,KAAK,MAAM,KAAK,OAAO;GACrB,MAAM,IAAI,YAAY,EAAE,EAAE,SAAS,MAAM,EAAE,EAAE,SAAS,IAAI;GAC1D,IAAI,MAAM,GAAG,OAAO,EAAE,OAAO,CAAC,IAAI;EACpC;EACA,OAAO,YAAY,aAAa,CAAC,GAAG,aAAa,CAAC,CAAC;CACrD,CAAC;CACH,MAAM,OAAO,YAAY,UAAU,SAAS,IAAI,EAAE;CAElD,IAAI;CACJ,IAAI;CACJ,QAAQ,KAAK,KAAb;EACE,KAAK;GACH,OAAO,EAAE;GACT,WAAW,SAAS,KAAK;GACzB;EACF,KAAK;GACH,OAAO,EAAE;GACT,WAAW,SAAS,IAAI,IAAI,QAAQ,IAAI,CAAC,CAAC,IAAI,YAAY,CAAC,CAAC,CAAC;GAC7D;EACF,KAAK;GACH,IAAI,KAAK,SAAS,UAChB,OAAO,MAAM,6BAA6B,KAAK,MAAM,KAAK,SAAkB,GAAG;GACjF,OAAO,EAAE,SAAS,EAAE,MAAM;GAC1B,WAAW,SAAS;IAClB,MAAM,KAAM,QAAQ,IAAI,CAAC,CAAc,MAAM,GAAG,MAAM,IAAI,CAAC;IAC3D,OAAO,GAAG,WAAW,IAAI,OAAO,GAAG,QAAQ,GAAG,MAAM,IAAI,GAAG,CAAC;GAC9D;GACA;EACF,KAAK;EACL,KAAK,OAAO;GACV,IAAI,CAAC,UAAU,IAAI,GACjB,OAAO,MACL,GAAG,KAAK,IAAI,yCAAyC,KAAK,MAAM,KAAK,SAAkB,GACzF;GACF,OAAO,EAAE,SAAS,IAAI;GACtB,MAAM,OAAO,KAAK,QAAQ,QAAQ,IAAI;GACtC,WAAW,SAAS,QAAQ,IAAI,CAAC,CAAC,MAAM,GAAG,MAAM,OAAO,YAAY,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM;GACjF;EACF;EACA,KAAK;GACH,OAAO,EAAE,KAAK,IAAI;GAClB,WAAW,SAAS;IAClB,MAAM,uBAAO,IAAI,IAAiB;IAClC,KAAK,MAAM,KAAK,QAAQ,IAAI,GAAG,KAAK,IAAI,aAAa,CAAC,GAAG,CAAC;IAC1D,OAAO,CAAC,GAAG,KAAK,OAAO,CAAC,CAAC,CAAC,KAAK,WAAW;GAC5C;GACA;EACF,KAAK;GACH,OAAO,EAAE,KAAK,SAAkB;GAChC,WAAW,SAAS,OAAO,IAAI,CAAC,CAAC,KAAK,MAAM,EAAE,SAAmB,IAAI;GACrE;EACF,KAAK;EACL,KAAK,QAAQ;GACX,OAAO,EAAE,SAAS,SAAkB;GACpC,MAAM,OAAO,KAAK,QAAQ,UAAU,IAAI;GACxC,WAAW,SAAS,OAAO,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,SAAmB;GAC/D;EACF;EACA,SAAS;GACP,OAAO,EAAE;GACT,MAAM,OAAO;GACb,UACE,KAAK,QAAQ,SACR,MAAM,QAAQ,KAAK,MAAM,MAAM,KAAK,MAAM,GAAG,GAAG,CAAC,KACjD,MAAM,QAAQ,KAAK,OAAO,MAAM,KAAK,MAAM,GAAG,GAAG,CAAC;EAC3D;CACF;CACA,IAAI,OAAO;EACT,MAAM,IAAI;EACV,MAAM,QAAQ;EACd,WAAW,MAAM,QACf,MACE,KAAK,QAAQ,MAAM,EAAE,MAAM,GAAG,GAAG,CAAC,GAClC,GACF;CACJ;CACA,OAAO;EAAE;EAAM;CAAQ;AACzB;AAEA,MAAa,gBAAgB,WAAW;CACtC,IAAI;CACJ,OAAO;CACP,UAAU;CACV,aAAa;CACb,OAAO,CAAC;EAAE,IAAI;EAAM,OAAO;EAAM,MAAM,CAAC,IAAI;CAAE,CAAC;CAC/C,QAAQ;CACR,iBAAiB;EAAE,IAAI;EAAI,UAAU,CAAC;EAAG,QAAQ,CAAC;CAAE;CACpD,QAAA;CACA,iBAAiB,MAAM,EAAE,mBAAmB;CAC5C,UAAU,GAAG,QAAQ;EACnB,MAAM,QAAQ,IAAI,MAAM,EAAE,EAAE;EAC5B,MAAM,SAAsB,CAAC;EAC7B,MAAM,SAAgC,CAAC;EACvC,KAAK,MAAM,KAAK,EAAE,UAAU;GAC1B,MAAM,OAAO,MAAM,KAAK,OAAO;GAC/B,IAAI,MAAM,OAAO,KAAK;QACjB,OAAO,KAAK,EAAE,SAAS,4BAA4B,EAAE,GAAG,CAAC;EAChE;EACA,MAAM,OAA6C,CAAC;EACpD,KAAK,MAAM,CAAC,MAAM,SAAS,OAAO,QAAQ,EAAE,MAAM,GAAG;GACnD,IAAI,EAAE,SAAS,SAAS,IAAI,GAAG;IAC7B,OAAO,KAAK;KAAE,SAAS,IAAI,KAAK;KAAyC,OAAO;IAAK,CAAC;IACtF;GACF;GACA,MAAM,WAAW,WAAW,MAAM,MAAM,MAAM,MAAM,GAAG;GACvD,IAAI,aAAa,UAAU,OAAO,KAAK,QAAQ;QAC1C;IACH,OAAO,QAAQ,SAAS;IACxB,KAAK,KAAK;KAAE;KAAM,SAAS,SAAS;IAAQ,CAAC;GAC/C;EACF;EACA,IAAI,OAAO,QAAQ,OAAO;GAAE,IAAI;GAAO,OAAO;EAAO;EAErD,MAAM,OAAO,EAAE,OAAO,MAAM;EAC5B,OAAO,GAAG;GACR,QAAQ;IACN;IACA,SAAS;KACP,GAAG,WAAW,IAAI,IAAI,IAAI;KAC1B,GAAG,OAAO,YAAY,EAAE,SAAS,KAAK,MAAM,CAAC,GAAG,MAAM,QAAQ,EAAY,CAAC,CAAC;IAC9E;GACF;GACA,MAAM,QAAQ,QAAQ;IACpB,MAAM,yBAAS,IAAI,IAAmB;IAEtC,IAAI,EAAE,SAAS,WAAW,GAAG,OAAO,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IACzD,KAAK,MAAM,OAAO,OAAO,EAAE,EAAE,GAAG;KAC9B,MAAM,IAAI,MAAM,KAAK,EAAE,QAAQ;KAC/B,MAAM,IAAI,OAAO,IAAI,CAAC;KACtB,IAAI,GAAG,EAAE,KAAK,GAAG;UACZ,OAAO,IAAI,GAAG,CAAC,GAAG,CAAC;IAC1B;IACA,MAAM,OAAc,CAAC;IACrB,KAAK,MAAM,WAAW,OAAO,OAAO,GAAG;KACrC,MAAM,MAA2B,CAAC;KAClC,MAAM,SAAS,QAAQ;KACvB,KAAK,MAAM,KAAK,EAAE,UAAU,IAAI,KAAM,OAAe,MAAM;KAC3D,KAAK,MAAM,KAAK,MAAM,IAAI,EAAE,QAAQ,EAAE,QAAQ,SAAS,GAAG;KAC1D,KAAK,KAAK,GAAG;IACf;IACA,OAAO,GAAG,EAAE,MAAM,YAAY,MAAM,EAAE,QAAQ,EAAE,CAAC;GACnD;EACF,CAAC;CACH;AACF,CAAC;;;;;;;;;;;;ACtOD,SAAgB,SAAY,KAAyB;CACnD,OAAO;AACT;AAEA,MAAa,cAAc;AAC3B,MAAa,eAAe;;AAG5B,SAAgB,WACd,OACA,OACA,IACuB;CACvB,OAAO,MAAM,SAAS,MAAM,IAAI,IAC5B,GAAG,KAAK,IACR,IAAI,GAAG,GAAG,WAAW,MAAM,KAAK,MAAM,EAAE,QAAQ,SAAS,KAAK,GAAG;AACvE;AAEA,SAAS,SAAS,OAAsB;CACtC,OAAO,MAAM,SAAS,aAClB,GAAG,MAAM,GAAG,KAAK,KACjB,MAAM,SAAS,SACb,aACA,MAAM;AACd;;AAGA,MAAa,OAA4C,EAAE,WACzD,EAAE,MAAM;CACN,EAAE,OAAO;CACT,EAAE,OAAO;CACT,EAAE,QAAQ;CACV,EAAE,KAAK;CACP,EAAE,MAAM,IAAI;CACZ,EAAE,OAAO,EAAE,OAAO,GAAG,IAAI;AAC3B,CAAC,CACH;;AAGA,MAAaC,aAAmC,UAAa,EAAE,aAAa,KAAK;;;;;;;;;;;;;AClEjF,MAAa,UAAU,EAAE,KAAK;CAAC;CAAQ;CAAc;CAAe;AAAW,CAAC;AAGhF,MAAa,SAAS,EAAE,MAAM;CAC5B,EAAE,KAAK;EAAC;EAAS;EAAa;EAAmB;CAAM,CAAC;CACxD,EAAE,aAAa,EAAE,UAAU,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;CAC9D,EAAE,aAAa,EAAE,aAAa,EAAE,OAAO,EAAE,OAAO,GAAG,IAAI,EAAE,CAAC;AAC5D,CAAC;AAGD,MAAa,UAAU;CAAC;CAAS;CAAU;CAAS;AAAM;;AAI1D,MAAa,aAAa,EAAE,MAAM,CAChC,QACA,EAAE,aAAa;CACb,SAAS,OAAO,SAAS;CACzB,OAAO,OAAO,SAAS;CACvB,QAAQ,OAAO,SAAS;CACxB,OAAO,OAAO,SAAS;CACvB,MAAM,OAAO,SAAS;AACxB,CAAC,CACH,CAAC;AAGD,MAAa,QAAQ,EAAE,aAAa;CAAE,KAAK,EAAE,OAAO,CAAC,CAAC,SAAS;CAAG,KAAK,EAAE,OAAO,CAAC,CAAC,SAAS;AAAE,CAAC;AAG9F,MAAa,kBAAkB,EAAE,aAAa;;CAE5C,OAAO,MAAM,OAAO,EAAE,YAAY,MAAM,SAAS,EAAE,CAAC,CAAC,CAAC,SAAS;;CAE/D,QAAQ,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS;;CAEnD,OAAO,EACJ,aAAa;EACZ,IAAI,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;EACpB,OAAO,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;EACvB,QAAQ,EAAE,OAAO,EAAE,OAAO,GAAG,MAAM,OAAO,EAAE,QAAQ,OAAO,SAAS,EAAE,CAAC,CAAC;CAC1E,CAAC,CAAC,CACD,SAAS;;CAEZ,MAAM,EAAE,aAAa,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC,SAAS;CACrD,QAAQ,WAAW,SAAS;CAC5B,MAAM,EAAE,OAAO,CAAC,CAAC,SAAS;AAC5B,CAAC;AAGD,MAAM,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,GAAG,IAAI,CAAC;;AAG/C,MAAa,UAAU,EAAE,aAAa;CACpC,MAAM,EAAE,OAAO,CAAC,CAAC,SAAS;CAC1B,SAAS,EAAE,OAAO,EAAE,OAAO,GAAG,IAAI,CAAC,CAAC,QAAQ,CAAC,CAAC;CAC9C,QAAQ,EAAE,OAAO,EAAE,OAAO,GAAG,IAAI,CAAC,CAAC,QAAQ,CAAC,CAAC;;CAE7C,KAAK,EAAE,OAAO,CAAC,CAAC,SAAS;CACzB,IAAI,EAAE,OAAO,CAAC,CAAC,SAAS;AAC1B,CAAC;AAGD,MAAa,WAAW,EAAE,YAAY;CACpC,IAAI,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;CACpB,IAAI,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;CACpB,OAAO,EAAE,OAAO,CAAC,CAAC,SAAS;AAC7B,CAAC;AAGD,MAAa,WAAW,EAAE,OAAO;CAAE,GAAG,EAAE,OAAO;CAAG,GAAG,EAAE,OAAO;AAAE,CAAC;;AAIjE,MAAa,aAAa,EAAE,OAAO,EAAE,OAAO,GAAG,EAAE,QAAQ,CAAC;AAG1D,MAAa,iBAAiB,EAAE,OAAO;CACrC,IAAI,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;CACpB,MAAM,EAAE,OAAO,CAAC,CAAC,SAAS;CAC1B,SAAS,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC;CAC1C,QAAQ,EAAE,KAAK,CAAC,SAAS,WAAW,CAAC,CAAC,CAAC,QAAQ,OAAO;;CAEtD,SAAS,QAAQ,SAAS;CAC1B,eAAe,EAAE,KAAK,CAAC,UAAU,QAAQ,CAAC,CAAC,CAAC,SAAS;CACrD,QAAQ,EAAE,OAAO,EAAE,OAAO,GAAG,IAAI,CAAC,CAAC,QAAQ,CAAC,CAAC;CAC7C,QAAQ,EAAE,OAAO,EAAE,OAAO,GAAG,EAAE,OAAO,EAAE,OAAO,GAAG,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;CACnE,gBAAgB,EAAE,OAAO,EAAE,OAAO,GAAG,UAAU,CAAC,CAAC,QAAQ,CAAC,CAAC;CAC3D,OAAO,EAAE,MAAM,QAAQ,CAAC,CAAC,QAAQ,CAAC,CAAC;CACnC,QAAQ,EAAE,OAAO,EAAE,OAAO,GAAG,eAAe,CAAC,CAAC,QAAQ,CAAC,CAAC;CACxD,UAAU,EAAE,MAAM,OAAO,CAAC,CAAC,QAAQ,CAAC,CAAC;CACrC,QAAQ,EAAE,OAAO,EAAE,OAAO,GAAG,QAAQ,CAAC,CAAC,SAAS;AAClD,CAAC;;AAMD,SAAgB,aAAa,OAAgC;CAC3D,OAAO,eAAe,MAAM,KAAK;AACnC;AAEA,SAAgB,aAAa,IAAY,MAA+B;CACtE,OAAO,aAAa,SAAS,KAAA,IAAY,EAAE,GAAG,IAAI;EAAE;EAAI;CAAK,CAAC;AAChE;;AAGA,SAAgB,oBAA6C;CAC3D,OAAO,EAAE,aAAa,gBAAgB,EAAE,IAAI,QAAQ,CAAC;AACvD;;;;;;;;;;;;;;;;;AC1FA,MAAM,SAAS;CAAE,IAAI;CAAQ,SAAS,OAAO,SAAS;AAAE;AAExD,MAAMC,WAAS,EAAE,mBAAmB,SAAS;CAC3C,EAAE,aAAa;EACb,GAAG;EACH,OAAO,EAAE,QAAQ,OAAO;EACxB,KAAK,EAAE,OAAO,CAAC,CAAC,SAAS;EACzB,KAAK,EAAE,OAAO,CAAC,CAAC,SAAS;CAC3B,CAAC;CACD,EAAE,aAAa;EACb,GAAG;EACH,OAAO,EAAE,QAAQ,QAAQ;EACzB,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;CACxC,CAAC;CACD,EAAE,aAAa;EAAE,GAAG;EAAQ,OAAO,EAAE,QAAQ,MAAM;EAAG,MAAM,EAAE,QAAQ;CAAE,CAAC;CACzE,EAAE,aAAa;EACb,GAAG;EACH,OAAO,EAAE,QAAQ,SAAS;EAC1B,MAAM,EAAE,aAAa;GACnB,MAAM,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;GACtB,IAAI,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;GACpB,KAAK,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS;EAClC,CAAC;EACD,KAAK,EAAE,aAAa;GAAE,IAAI;GAAQ,KAAK,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;EAAE,CAAC,CAAC,CAAC,SAAS;EACrE,QAAQ,EACL,aAAa;GACZ,IAAI;GACJ,KAAK,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;GACrB,MAAM,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;GACtB,IAAI,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;GACpB,OAAO,EAAE,QAAQ,CAAC,CAAC,SAAS;EAC9B,CAAC,CAAC,CACD,SAAS;CACd,CAAC;AACH,CAAC;;AAKD,SAAgB,UAAU,OAAqE;CAC7F,MAAM,uBAAO,IAAI,IAAsB;CACvC,KAAK,MAAM,CAAC,MAAM,OAAO,OAAO,KAAK,IAAI,MAAM,CAAC,GAAI,KAAK,IAAI,IAAI,KAAK,CAAC,GAAI,EAAE,CAAC;CAC9E,MAAM,wBAAQ,IAAI,IAA6B;CAC/C,MAAM,OAAiB,CAAC;CACxB,MAAM,SAAS,SAAuC;EACpD,MAAM,IAAI,MAAM,MAAM;EACtB,KAAK,KAAK,IAAI;EACd,KAAK,MAAM,MAAM,KAAK,IAAI,IAAI,KAAK,CAAC,GAAG;GACrC,IAAI,MAAM,IAAI,EAAE,MAAM,QAAQ,OAAO,CAAC,GAAG,KAAK,MAAM,KAAK,QAAQ,EAAE,CAAC,GAAG,EAAE;GACzE,IAAI,CAAC,MAAM,IAAI,EAAE,GAAG;IAClB,MAAM,QAAQ,MAAM,EAAE;IACtB,IAAI,OAAO,OAAO;GACpB;EACF;EACA,KAAK,IAAI;EACT,MAAM,IAAI,MAAM,MAAM;CAExB;CACA,KAAK,MAAM,QAAQ,CAAC,GAAG,KAAK,KAAK,CAAC,CAAC,CAAC,KAAK,GAAG;EAC1C,IAAI,MAAM,IAAI,IAAI,GAAG;EACrB,MAAM,QAAQ,MAAM,IAAI;EACxB,IAAI,OAAO,OAAO;CACpB;AAEF;AAEA,SAAS,YAAY,QAAoB,QAA2B,OAA4B;CAC9F,OAAO,OACJ,QAAQ,MAAM,CAAC,OAAO,OAAO,OAAO,KAAK,QAAQ,CAAC,CAAC,CAAC,CACpD,KAAK,OAAO,EAAE,SAAS,GAAG,MAAM,mBAAmB,EAAE,GAAG,EAAE;AAC/D;AAEA,SAAS,eAAe,GAAY,OAAmB,KAAc;CACnE,MAAM,SAAS,YACb,OACA;EAAC,EAAE,KAAK;EAAM,EAAE,KAAK;EAAI,GAAI,EAAE,KAAK,MAAM,CAAC,EAAE,KAAK,GAAG,IAAI,CAAC;CAAE,GAC5D,MACF;CACA,MAAM,WAAW,MAAM,KAAK,OAAO,EAAE,KAAK;CAC1C,IAAI;CACJ,IAAI,EAAE,KAAK,OAAO,KAAK,GAAG,YAAY,IAAI,MAAM,EAAE,IAAI,EAAE,GAAG,CAAC,EAAE,IAAI,GAAG,GAAG,KAAK,CAAC;CAE9E,IAAI,EAAE,KAAK,OAAO,EAAE,KAAK,OAAO,KAAK,EAAE,SAAS,6CAA6C,CAAC;CAC9F,MAAM,YAAY,EAAE,KAAK,MACrB,MAAM,KAAK,OAAO,EAAE,KAAK,OACzB,EAAE,OAAO,IAAI,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC,KAAK,OAAO,EAAE,IAAI;CACnD,IAAI,EAAE,QAAQ;EACZ,IAAI,CAAC,EAAE,OAAO,CAAC,EAAE,KAAK,KAAK,OAAO,KAAK,EAAE,SAAS,+BAA+B,CAAC;EAClF,MAAM,UAAU,IAAI,MAAM,EAAE,OAAO,EAAE;EACrC,OAAO,KAAK,GAAG,YAAY,SAAS;GAAC,EAAE,OAAO;GAAK,EAAE,OAAO;GAAM,EAAE,OAAO;EAAE,GAAG,QAAQ,CAAC;EACzF,MAAM,SAA2D;GAC/D;IAAC;IAAe,QAAQ,KAAK,OAAO,EAAE,OAAO;IAAO;GAAQ;GAC5D;IAAC;IAAa,QAAQ,KAAK,OAAO,EAAE,OAAO;IAAK;GAAQ;GACxD;IAAC;IAAc,QAAQ,KAAK,OAAO,EAAE,OAAO;IAAM;GAAS;EAC7D;EACA,KAAK,MAAM,CAAC,MAAM,GAAG,MAAM,QACzB,IAAI,KAAK,KAAK,CAAC,WAAW,GAAG,CAAC,GAAG,OAAO,KAAK,EAAE,SAAS,GAAG,KAAK,IAAI,KAAK,CAAC,EAAE,MAAM,KAAK,CAAC,IAAI,CAAC;EAE/F,IAAI,EAAE,OAAO,UAAU,KAAA,GAAW;GAChC,MAAM,IAAI,iBAAiB,EAAE,OAAO,OAAO,IAAI,UAAU,QAAQ,IAAI,CAAC;GACtE,IAAI,EAAE,IAAI,cAAc,EAAE;QACrB,OAAO,KAAK,EAAE,SAAS,iBAAiB,EAAE,QAAQ,CAAC;EAC1D;CACF;CACA,MAAM,SAAS,MAAM,KAAK,OAAO,EAAE,KAAK;CACxC,IAAI,YAAY,UAAU,CAAC,WAAW,UAAU,MAAM,GACpD,OAAO,KAAK,EAAE,SAAS,SAAS,KAAK,QAAQ,EAAE,MAAM,KAAK,MAAM,IAAI,CAAC;CAEvE,OAAO;EAAE;EAAQ;CAAY;AAC/B;AAEA,MAAM,OAAO,MAAY,OAAO,MAAM,WAAW,IAAI,aAAa,CAAC;AAInE,SAAS,iBACP,GACA,QACA,KACA,aACA,QACuB;CACvB,MAAM,QAAQ,EAAE,KAAK;CACrB,MAAM,UAAU,UAAU,KAAA,KAAa,EAAE,QAAQ,KAAA;CAEjD,MAAM,0BAAU,IAAI,IAA+B;CACnD,MAAM,uBAAO,IAAI,IAAiB;CAClC,KAAK,MAAM,OAAO,OAAO,EAAE,EAAE,GAAG;EAC9B,MAAM,OAAO,IAAI,EAAE,KAAK,SAAS;EACjC,MAAM,KAAK,IAAI,EAAE,KAAK,OAAO;EAC7B,MAAM,IAAI,QAAS,IAAI,UAAU,OAAQ;EACzC,IAAI,SAAS,QAAQ,OAAO,QAAS,SAAS,MAAM,MAAO;EAC3D,MAAM,IAAI,aAAa,CAAC;EACxB,KAAK,IAAI,GAAG,CAAC;EACb,MAAM,QAAQ,QAAQ,IAAI,CAAC,qBAAK,IAAI,IAAkB;EACtD,MAAM,IAAI,aAAa,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,CAAC;EACxD,QAAQ,IAAI,GAAG,KAAK;CACtB;CACA,IAAI,SAAgB,CAAC,IAAI;CACzB,IAAI,OAAO,SAAS,CAAC,GAAG,KAAK,OAAO,CAAC,CAAC,CAAC,KAAK,WAAW;MAClD,IAAI,EAAE,KAAK;EACd,MAAM,uBAAO,IAAI,IAAiB;EAClC,KAAK,MAAM,OAAO,OAAO,EAAE,IAAI,EAAE,GAAG;GAClC,MAAM,IAAI,IAAI,EAAE,IAAI,QAAQ;GAC5B,IAAI,MAAM,MAAM,KAAK,IAAI,aAAa,CAAC,GAAG,CAAC;EAC7C;EACA,SAAS,CAAC,GAAG,KAAK,OAAO,CAAC,CAAC,CAAC,KAAK,WAAW;CAC9C;CACA,MAAM,2BAAW,IAAI,IAAyB;CAC9C,IAAI,EAAE,QACJ,KAAK,MAAM,OAAO,OAAO,EAAE,OAAO,EAAE,GAAG;EACrC,IAAI,eAAe,CAAC,YAAY,MAAM,KAAK,GAAG,GAAG;EACjD,MAAM,IAAI,aAAa,IAAI,EAAE,OAAO,QAAQ,IAAI;EAChD,MAAM,MAAM,SAAS,IAAI,CAAC,qBAAK,IAAI,IAAY;EAC/C,IAAI,IAAI,aAAa,CAAC,IAAI,EAAE,OAAO,SAAS,MAAM,IAAI,EAAE,OAAO,OAAO,IAAI,CAAC,CAAC;EAC5E,SAAS,IAAI,GAAG,GAAG;CACrB;CAIF,MAAM,wBAAQ,IAAI,IAAkC;CACpD,MAAM,UAAkB,CAAC;CACzB,IAAI,QAAQ;CACZ,KAAK,MAAM,KAAK,QAAQ;EACtB,MAAM,UAAU,SAAS,IAAI,aAAa,CAAC,CAAC,qBAAK,IAAI,IAAY;EACjE,MAAM,QAAQ,QAAQ,IAAI,aAAa,QAAQ,IAAI,IAAI,CAAC,qBAAK,IAAI,IAAkB;EACnF,MAAM,aAAa,CAAC,GAAG,KAAK,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,QAAQ,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,OAAO,CAAC;EAC/E,IAAI;EACJ,IAAI,OAAO,QAAQ,UAAU,KAAK,CAAC;OAC9B;GACH,MAAM,YAAY,CAAC,GAAG,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC,KAAK,GAAG;GAC9C,IAAI,CAAC,MAAM,IAAI,SAAS,GAAG,MAAM,IAAI,WAAW,UAAU,KAAK,CAAC,CAAC;GACjE,QAAQ,MAAM,IAAI,SAAS;EAC7B;EACA,IAAI,OAAO;GACT,SAAS;GACT,IAAI,QAAQ,SAAS,GAAG,QAAQ,KAAK;IAAE,OAAO,OAAO,CAAC;IAAG;GAAM,CAAC;EAClE;CACF;CACA,IAAI,UAAU,GAAG,OAAO,KAAA;CACxB,MAAM,QAAQ,QAAQ;CACtB,OAAO;EACL,QAAQ;EACR;EACA,SAAS,GAAG,MAAM,GAAG,UAAU,gBAAgB,YAAY,iBAAiB,UAAU,GAAG,OAAO,MAAM,UAAU,WAAW,MAAM,QAAQ,KAAK,UAAU,MAAM,KAAK,EAAE,MAAM,KAAK,MAAM,MAAM,KAAK,MAAM;EACvM;EACA,SAAS;CACX;AACF;AAEA,MAAa,aAAa,WAAW;CACnC,IAAI;CACJ,OAAO;CACP,UAAU;CACV,aAAa;CACb,OAAO;EACL;GAAE,IAAI;GAAM,OAAO;GAAM,MAAM,CAAC,IAAI;EAAE;EACtC;GAAE,IAAI;GAAO,OAAO;GAAO,MAAM,CAAC,OAAO,IAAI;GAAG,UAAU;EAAK;EAC/D;GAAE,IAAI;GAAU,OAAO;GAAU,MAAM,CAAC,UAAU,IAAI;GAAG,UAAU;EAAK;CAC1E;CACA,QAAQ;CACR,QAAQ;CACR,iBAAiB;EAAE,IAAI;EAAI,OAAO;CAAQ;CAC1C,QAAA;CACA,UAAU,GAAW,QAAQ;EAC3B,MAAM,QAAQ,IAAI,MAAM,EAAE,EAAE;EAC5B,MAAM,SAAS,EAAE,WAAW;EAC5B,MAAM,UAAU,YAAY,QAAQ,EAAE,OAAO,KAAK;EAClD,MAAM,SAAsB,QAAQ,KAAK,CAAC,IAAI,CAAC,EAAE,SAAS,YAAY,QAAQ,QAAQ,CAAC;EACvF,IAAI;EACJ,IAAI;EACJ,QAAQ,EAAE,OAAV;GACE,KAAK;IACH,OAAO,KAAK,GAAG,YAAY,OAAO,EAAE,MAAM,MAAM,CAAC;IACjD;GACF,KAAK,QAAQ;IACX,MAAM,WAAW,iBAAiB,EAAE,MAAM,IAAI,UAAU,MAAM,IAAI,CAAC;IACnE,IAAI,SAAS,IAAI,OAAO,SAAS;SAC5B,OAAO,KAAK,EAAE,SAAS,SAAS,SAAS,QAAQ,CAAC;IACvD;GACF;GACA,KAAK,WAAW;IACd,MAAM,WAAW,eAAe,GAAG,OAAO,GAAG;IAC7C,OAAO,KAAK,GAAG,SAAS,MAAM;IAC9B,cAAc,SAAS;IACvB;GACF;EACF;EACA,IAAI,CAAC,QAAQ,MAAM,OAAO,SAAS,GAAG,OAAO;GAAE,IAAI;GAAO,OAAO;EAAO;EAExE,OAAO,GAAG;GACR,QAAQ,QAAQ;GAChB,MAAM,QAAQ,KAAK,UAAU,CAAC,MAAM;IAClC,MAAM,OAAO,OAAO,EAAE,EAAE;IACxB,IAAI;IACJ,QAAQ,EAAE,OAAV;KACE,KAAK;MACH,YAAY,QAAQ,YAChB,KAAA,IACA,eAAe,KAAK,QAAQ,GAAG,QAAQ,KAAA,CAAS;MACpD;KACF,KAAK;MACH,YAAY,gBAAgB,MAAM,EAAE,MAAM,MAAM;MAChD;KACF,KAAK;MACH,YAAY,cAAc,MAAM,MAAc,KAAK,MAAM;MACzD;KACF,SACE,YAAY,iBAAiB,GAAG,QAAQ,KAAK,aAAa,MAAM;IACpE;IACA,OAAO,GAAG,gBAAgB,IAAI,IAAI,UAAU,MAAM,YAAY,CAAC,SAAS,IAAI,CAAC,CAAC,CAAC;GACjF;EACF,CAAC;CACH;AACF,CAAC;ACpRD,MAAa,eAAe,WAAW;CACrC,IAAI;CACJ,OAAO;CACP,UAAU;CACV,aAAa;CACb,OAAO,CAAC;EAAE,IAAI;EAAM,OAAO;EAAM,MAAM,CAAC,IAAI;CAAE,CAAC;CAC/C,QAAQ;CACR,iBAAiB;EAAE,IAAI;EAAI,MAAM,CAAC;CAAE;CACpC,QAVa,EAAE,aAAa;EAAE,IAAI;EAAQ,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;CAAE,CAUlF;CACA,UAAU,GAAG,QAAQ;EACnB,MAAM,QAAQ,IAAI,MAAM,EAAE,EAAE;EAC5B,MAAM,UAAU,EAAE,KAAK,QAAQ,MAAM,CAAC,OAAO,OAAO,MAAM,KAAK,QAAQ,CAAC,CAAC;EACzE,IAAI,QAAQ,QAAQ,OAAO,KAAK,iBAAiB,QAAQ,KAAK,IAAI,GAAG;EACrE,MAAM,SAAgC,CAAC;EACvC,MAAM,UAAkC,CAAC;EACzC,KAAK,MAAM,KAAK,EAAE,MAAM;GACtB,OAAO,KAAK,MAAM,KAAK,OAAO;GAC9B,QAAQ,KAAK,MAAM,QAAQ;EAC7B;EACA,OAAO,GAAG;GACR,QAAQ;IAAE,MAAM,EAAE,OAAO,MAAM;IAAG;GAAQ;GAC1C,MAAM,WAAW;IACf,MAAM,uBAAO,IAAI,IAAY;IAC7B,MAAM,OAAc,CAAC;IACrB,KAAK,MAAM,OAAO,OAAO,EAAE,EAAE,GAAG;KAC9B,MAAM,IAAI,MAAM,KAAK,EAAE,IAAI;KAC3B,IAAI,KAAK,IAAI,CAAC,GAAG;KACjB,KAAK,IAAI,CAAC;KACV,KAAK,KAAK,OAAO,YAAY,EAAE,KAAK,KAAK,MAAM,CAAC,GAAI,IAAI,MAAM,IAAY,CAAC,CAAC,CAAC;IAC/E;IACA,OAAO,GAAG,EAAE,KAAK,CAAC;GACpB;EACF,CAAC;CACH;AACF,CAAC;;;ACxBD,MAAM,UAAU;;AAGhB,SAAgB,iBAAiB,QAAgD;CAC/E,MAAM,aAAa,OAAO;CAC1B,IAAI,OAAO,SAAS,YAAY,OAAO,eAAe,YAAY,eAAe,MAC/E,OAAO,IACL,4FACF;CAEF,MAAM,WAAW,IAAI,IAAI,MAAM,QAAQ,OAAO,QAAQ,IAAK,OAAO,WAAwB,CAAC,CAAC;CAC5F,MAAM,SAAgC,CAAC;CACvC,KAAK,MAAM,CAAC,MAAM,SAAS,OAAO,QAAQ,UAAU,GAAG;EACrD,MAAM,OAAO,QAAQ,IAAI;EACzB,OAAO,QAAQ,SAAS,IAAI,IAAI,IAAI,OAAO,EAAE,SAAS,IAAI;CAC5D;CACA,OAAO,GAAG,EAAE,OAAO,MAAM,CAAC;AAC5B;AAEA,SAAS,QAAQ,MAAmB;CAClC,MAAM,QAAS,KAAK,SAAS,KAAK;CAClC,IAAI,MAAM,QAAQ,KAAK,GAAG;EACxB,MAAM,UAAU,MAAM,QAAQ,MAAM,EAAE,SAAS,MAAM;EACrD,MAAM,QAAQ,QAAQ,WAAW,IAAI,QAAQ,QAAQ,EAAU,IAAI,EAAE;EACrE,OAAO,MAAM,SAAS,QAAQ,SAAS,EAAE,SAAS,KAAK,IAAI;CAC7D;CACA,IAAI,MAAM,QAAQ,KAAK,IAAI,GAAG;EAC5B,MAAM,QAAQ,KAAK;EACnB,MAAM,UAAU,MAAM,QAAQ,MAAM,MAAM,MAAM;EAChD,MAAM,QAAQ,QAAQ,WAAW,IAAI,QAAQ;GAAE,GAAG;GAAM,MAAM,QAAQ;EAAG,CAAC,IAAI,EAAE;EAChF,OAAO,QAAQ,SAAS,MAAM,SAAS,EAAE,SAAS,KAAK,IAAI;CAC7D;CACA,IAAI,MAAM,QAAQ,KAAK,IAAI,GAAG;EAC5B,MAAM,QAAQ,IAAI,IACf,KAAK,KAA4B,KAAK,MAAO,MAAM,OAAO,SAAS,OAAO,CAAE,CAC/E;EACA,MAAM,UAAU,MAAM,OAAO,MAAM;EACnC,MAAM,QAAe,MAAM,SAAS,IAAIE,SAAO,CAAC,GAAG,KAAK,CAAC,CAAC,EAAY,IAAI,EAAE;EAC5E,OAAO,UAAU,EAAE,SAAS,KAAK,IAAI;CACvC;CACA,QAAQ,KAAK,MAAb;EACE,KAAK;EACL,KAAK;EACL,KAAK,WACH,OAAOA,SAAO,KAAK,IAAI;EACzB,KAAK,WACH,OAAO,EAAE;EACX,KAAK,SACH,OAAO,EAAE,KACP,OAAO,KAAK,UAAU,YAAY,KAAK,QAAQ,QAAQ,KAAK,KAAa,IAAI,EAAE,OACjF;EACF,KAAK,UAAU;GACb,MAAM,QAAS,KAAK,cAAc,CAAC;GACnC,OAAO,EAAE,OAAO,OAAO,YAAY,OAAO,QAAQ,KAAK,CAAC,CAAC,KAAK,CAAC,GAAG,OAAO,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;EAC5F;EACA,SACE,OAAO,EAAE;CACb;AACF;AAEA,SAASA,SAAO,MAAuB;CACrC,QAAQ,MAAR;EACE,KAAK,UACH,OAAO,EAAE;EACX,KAAK,UACH,OAAO,EAAE;EACX,KAAK,WACH,OAAO,EAAE;EACX,SACE,OAAO,EAAE;CACb;AACF;AAEA,SAAS,cAAc,SAA4C;CACjE,QAAQ,SAAR;EACE,KAAK,UACH,OAAO,EAAE,MAAM,SAAS;EAC1B,KAAK,WACH,OAAO,EAAE,MAAM,UAAU;EAC3B,KAAK,WACH,OAAO,EAAE,MAAM,SAAS;EAC1B,KAAK,WACH,OAAO,EAAE,MAAM,UAAU;EAC3B,KAAK,QACH,OAAO;GAAE,MAAM;GAAU,QAAQ;EAAO;EAC1C,KAAK,aACH,OAAO;GAAE,MAAM;GAAU,QAAQ;EAAY;EAC/C,SACE,OAAO,CAAC;CACZ;AACF;AAEA,SAAS,YAAY,SAAsB,UAAmB,aAA6B;CACzF,MAAM,OAAO,cAAc,OAAO;CAClC,MAAM,QACJ,YAAY,OAAO,KAAK,SAAS,WAAW;EAAE,GAAG;EAAM,MAAM,CAAC,KAAK,MAAM,MAAM;CAAE,IAAI;CACvF,OAAO,cAAc;EAAE,GAAG;EAAO;CAAY,IAAI;AACnD;AAEA,SAAS,aACP,IACA,QAMY;CACZ,OAAO;EACL,SAAS;EACT,KAAK;EACL,MAAM;EACN,UAAU,OAAO,QAAQ,MAAM,CAAC,EAAE,QAAQ,CAAC,CAAC,KAAK,MAAM,EAAE,IAAI;EAC7D,YAAY,OAAO,YACjB,OAAO,KAAK,MAAM,CAAC,EAAE,MAAM,YAAY,EAAE,SAAS,EAAE,UAAU,EAAE,WAAW,CAAC,CAAC,CAC/E;EACA,sBAAsB;CACxB;AACF;;AAGA,SAAgB,gBAAgB,OAAc,QAA6B;CACzE,OAAO,aACL,SAAS,GAAG,OAAO,GAAG,MAAM,SAAS,MAAM,MAC3C,MAAM,QAAQ,KAAK,OAAe;EAChC,MAAM,EAAE;EACR,SAAS,EAAE;EACX,UAAU,EAAE;EACZ,aAAa,EAAE;CACjB,EAAE,CACJ;AACF;;AAGA,SAAgB,iBAAiB,QAAkC;CACjE,OAAO,aACL,YAAY,OAAO,QACnB,OAAO,OAAO,KAAK,OAAO;EACxB,MAAM,EAAE;EACR,SAAS,EAAE;EACX,UAAU,EAAE;EACZ,aAAa,EAAE;CACjB,EAAE,CACJ;AACF;;AAGA,SAAgB,SAAS,OAAY,MAAsB;CACzD,IAAI,UAAU,MAAM,OAAO,KAAK,SAAS,cAAc,KAAK,SAAS;CACrE,QAAQ,KAAK,MAAb;EACE,KAAK,YACH,OAAO,SAAS,OAAO,KAAK,EAAE;EAChC,KAAK,WACH,OAAO;EACT,KAAK,UACH,OAAO,OAAO,UAAU;EAC1B,KAAK,UACH,OAAO,OAAO,UAAU,YAAY,OAAO,SAAS,KAAK;EAC3D,KAAK,WACH,OAAO,OAAO,UAAU;EAC1B,KAAK,QACH,OAAO,iBAAiB;EAC1B,KAAK,QACH,OAAO,MAAM,QAAQ,KAAK,KAAM,MAAyB,OAAO,MAAM,SAAS,GAAG,KAAK,EAAE,CAAC;EAC5F,KAAK,SACH,OACE,MAAM,QAAQ,KAAK,KACnB,MAAM,WAAW,KAAK,GAAG,UACzB,KAAK,GAAG,OAAO,GAAG,MAAM,SAAU,MAAyB,IAAW,CAAC,CAAC;EAE5E,KAAK,UACH,OACE,YAAY,KAAK,KACjB,OAAO,QAAQ,KAAK,MAAM,CAAC,CAAC,OAAO,CAAC,GAAG,OAAO,SAAS,MAAM,MAAM,MAAM,CAAC,CAAC;EAE/E,SACE,OAAO;CACX;AACF;;AAWA,SAAgB,YACd,MACA,MAC+C;CAC/C,MAAM,SAAS,OAAO,QAAQ,KAAK,MAAM;CACzC,MAAM,yBAAS,IAAI,IAAkD;CACrE,MAAM,MAAa,CAAC;CACpB,KAAK,MAAM,CAAC,GAAG,QAAQ,KAAK,QAAQ,GAAG;EACrC,MAAM,MAA2B,CAAC;EAClC,KAAK,MAAM,CAAC,MAAM,cAAc,QAAQ;GACtC,MAAM,QAAS,IAAI,SAAS;GAC5B,IAAI,CAAC,SAAS,OAAO,SAAS,GAAG;IAC/B,MAAM,IAAI,OAAO,IAAI,IAAI,KAAK;KAAE,OAAO;KAAG,SAAS,CAAC;IAAE;IACtD,EAAE,SAAS;IACX,IAAI,EAAE,QAAQ,SAAS,GAAG,EAAE,QAAQ,KAAK,CAAC;IAC1C,OAAO,IAAI,MAAM,CAAC;GACpB;GACA,IAAI,QAAQ;EACd;EACA,IAAI,KAAK,GAAG;CACd;CACA,OAAO;EACL,MAAM;EACN,YAAY,CAAC,GAAG,MAAM,CAAC,CAAC,KAAK,CAAC,OAAO,QAAQ;GAC3C;GACA,UAAU,KAAK,KAAK,OAAO,MAAe;GAC1C,GAAG;EACL,EAAE;CACJ;AACF;;;;;;;;;ACtNA,MAAMC,WAAS,EAAE,aAAa;CAC5B,QAAQ,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;CACxB,QAAQ,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;CACxB,QAAQ,EAAE,QAAQ,CAAC,CAAC,SAAS;AAC/B,CAAC;;;;;AAMD,SAAgB,OAAO,QAAoB,MAA2B;CACpE,MAAM,SAAS,EAAE,GAAG,OAAO,KAAK,OAAO;CACvC,MAAM,UAAU,EAAE,GAAG,OAAO,QAAQ;CACpC,KAAK,MAAM,QAAQ,aAAa,IAAI,GAAG;EACrC,OAAO,QAAQ,UAAU,OAAO,KAAc;EAC9C,MAAM,SAAS,QAAQ;EACvB,QAAQ,QAAQ;GAAE,MAAM,OAAO;GAAM,OAAO,OAAO;GAAO,WAAW;EAAM;CAC7E;CACA,OAAO;EAAE,GAAG;EAAQ,MAAM,EAAE,OAAO,MAAM;EAAG;CAAQ;AACtD;;AAGA,SAAgB,SACd,MACA,MACA,MAC4B;CAC5B,MAAM,SAAS,YAAY,MAAM,IAAI;CACrC,IAAI,OAAO,WAAW,WAAW,GAAG,OAAO,GAAG,OAAO,IAAI;CACzD,MAAM,SAAqB,OAAO,WAAW,KAAK,OAAuB;EACvE;EACA,MAAM;EACN,OAAO,EAAE;EACT,SAAS,GAAG,EAAE,MAAM,IAAI,EAAE,MAAM,kBAAkB,EAAE;EACpD,OAAO,EAAE;EACT,SAAS,EAAE;CACb,EAAE;CACF,OAAO,IAAI;EACT,MAAM;EACN,SAAS,GAAG,OAAO,WAAW,OAAO;EACrC;CACF,CAAC;AACH;AAEA,MAAa,aAAa,WAAW;CACnC,IAAI;CACJ,OAAO;CACP,UAAU;CACV,aAAa;CACb,OAAO,CAAC;CACR,QAAQ;CACR,iBAAiB;EAAE,QAAQ;EAAI,QAAQ;CAAG;CAC1C,QAAA;CACA,UAAU,GAAG,QAAQ;EACnB,MAAM,SAAS,IAAI,QAAQ,eAAe,IAAI;EAC9C,IAAI,CAAC,QACH,OAAO,KAAK,iCAAiC,IAAI,GAAG,IAAI,EAAE,MAAM,iBAAiB,CAAC;EAEpF,MAAM,WAAW,iBAAiB,MAAM;EACxC,IAAI,CAAC,SAAS,IAAI,OAAO,KAAK,SAAS,OAAO,EAAE,MAAM,iBAAiB,CAAC;EACxE,MAAM,OAAO,SAAS;EAEtB,IAAI;EACJ,IAAI,EAAE,WAAW,KAAA,GAAW;GAC1B,MAAM,WAAW,iBAAiB,EAAE,QAAQ,IAAI,UAAU,IAAI,CAAC;GAC/D,IAAI,CAAC,SAAS,IACZ,OAAO;IAAE,IAAI;IAAO,OAAO,CAAC,EAAE,SAAS,WAAW,SAAS,QAAQ,CAAC;GAAiB;GACvF,OAAO,SAAS;EAClB;EACA,MAAM,iBAA6B;GAAE;GAAM,SAAS,WAAW,IAAI,IAAI,IAAI;EAAE;EAG7E,OAAO,GAAG;GACR,QAHa,OAAO,OAAO,gBAAgB,EAAE,MAAM,IAAI;GAIvD,MAAM,SAAS,QAAQ;IACrB,MAAM,SAAS,SAAS,IAAI,IAAI,IAAI,SAAS,IAAI,OAAO,CAAC,GAAG,IAAI;IAChE,IAAI,CAAC,OAAO,IAAI,OAAO;IAIvB,OAAO,GAAG,EAAE,MAHW,OACnB,OAAO,MAAM,QAAQ,MAAO,KAAc,MAAM,GAAG,GAAG,CAAC,IACvD,OAAO,MACM,CAAC;GACpB;EACF,CAAC;CACH;AACF,CAAC;AC/FD,MAAa,aAAa,WAAW;CACnC,IAAI;CACJ,OAAO;CACP,UAAU;CACV,aAAa;CACb,OAAO,CAAC;EAAE,IAAI;EAAM,OAAO;EAAM,MAAM,CAAC,IAAI;CAAE,CAAC;CAC/C,QAAQ;CACR,iBAAiB;EAAE,IAAI;EAAI,MAAM,CAAC;CAAE;CACpC,QAVa,EAAE,aAAa;EAAE,IAAI;EAAQ,MAAM,EAAE,QAAQ;CAAE,CAU5D;CACA,UAAU,GAAG,QAAQ;EACnB,MAAM,QAAQ,IAAI,MAAM,EAAE,EAAE;EAC5B,MAAM,OAAO,iBAAiB,EAAE,MAAM,IAAI,UAAU,MAAM,IAAI,CAAC;EAC/D,IAAI,CAAC,KAAK,IAAI,OAAO,KAAK,SAAS,KAAK,OAAO;EAC/C,MAAM,OAAO,KAAK;EAClB,OAAO,GAAG;GACR,QAAQ,OAAO,OAAO,EAAE,IAAI;GAC5B,MAAM,QAAQ,QAAQ,GAAG,EAAE,MAAM,OAAO,EAAE,EAAE,CAAC,CAAC,QAAQ,MAAM,KAAK,MAAM,GAAG,GAAG,CAAC,EAAE,CAAC;EACnF,CAAC;CACH;AACF,CAAC;;;;;;;;;;;;;;;;ACXD,MAAME,WAAS,EAAE,aAAa;CAC5B,MAAM;CACN,OAAO;CACP,IAAI,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;CAClE,MAAM,EAAE,KAAK;EAAC;EAAS;EAAQ;EAAQ;CAAM,CAAC,CAAC,CAAC,SAAS;CACzD,aAAa,EAAE,KAAK;EAAC;EAAO;EAAO;EAAO;CAAK,CAAC;CAChD,QAAQ,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,SAAS;CAChE,OAAO,EAAE,QAAQ,CAAC,CAAC,SAAS;CAC5B,gBAAgB,EAAE,QAAQ,CAAC,CAAC,SAAS;AACvC,CAAC;;AAGD,SAASC,QAAM,MAAgB,MAAyB,QAAiB;CACvE,MAAM,wBAAQ,IAAI,IAAmB;CACrC,KAAK,MAAM,OAAO,MAAM;EACtB,IAAI,KAAK,MAAM,OAAO,IAAI,MAAM,UAAU,IAAI,GAAG;EACjD,MAAM,IAAI,MAAM,KAAK,IAAI;EACzB,MAAM,SAAS,MAAM,IAAI,CAAC;EAC1B,IAAI,CAAC,QAAQ,MAAM,IAAI,GAAG,CAAC,GAAG,CAAC;OAC1B,IAAI,QAAQ,OAAO,EAAE,WAAW,KAAK,KAAK,MAAM,OAAO,IAAI,EAAS,CAAC,EAAE;OACvE,OAAO,KAAK,GAAG;CACtB;CACA,OAAO,EAAE,MAAM;AACjB;AAEA,MAAa,WAAW,WAAW;CACjC,IAAI;CACJ,OAAO;CACP,UAAU;CACV,aAAa;CACb,OAAO,CACL;EAAE,IAAI;EAAQ,OAAO;EAAQ,MAAM,CAAC,MAAM;CAAE,GAC5C;EAAE,IAAI;EAAS,OAAO;EAAS,MAAM,CAAC,OAAO;CAAE,CACjD;CACA,QAAQ;CACR,iBAAiB;EAAE,MAAM;EAAI,OAAO;EAAI,IAAI,CAAC;EAAG,MAAM;EAAS,aAAa;CAAM;CAClF,QAAA;CACA,iBAAiB,MAAM,EAAE,mBAAmB;CAC5C,UAAU,GAAG,QAAQ;EACnB,MAAM,OAAO,IAAI,MAAM,EAAE,IAAI;EAC7B,MAAM,QAAQ,IAAI,MAAM,EAAE,KAAK;EAC/B,MAAM,OAAO,EAAE,QAAQ;EACvB,MAAM,SAAsB,CAAC;EAE7B,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,IAAI;GAC3B,MAAM,KAAK,KAAK,KAAK,OAAO;GAC5B,MAAM,KAAK,MAAM,KAAK,OAAO;GAC7B,IAAI,CAAC,IAAI,OAAO,KAAK,EAAE,SAAS,sBAAsB,GAAG,GAAG,CAAC;GAC7D,IAAI,CAAC,IAAI,OAAO,KAAK,EAAE,SAAS,uBAAuB,GAAG,GAAG,CAAC;GAC9D,IAAI,MAAM,MAAM,CAAC,WAAW,IAAI,EAAE,GAChC,OAAO,KAAK,EAAE,SAAS,YAAY,GAAG,IAAI,KAAK,EAAE,EAAE,MAAM,GAAG,IAAI,KAAK,EAAE,IAAI,CAAC;EAEhF;EACA,IAAI,EAAE,gBAAgB,SAAS,IAAI,QAAQ,UAAU,KAAA,GACnD,OAAO,KAAK;GACV,SAAS;GACT,MAAM;EACR,CAAC;EAIH,MAAM,UAA8B,CAAC;EACrC,IAAI,EAAE,QACJ,KAAK,MAAM,CAAC,MAAM,OAAO,OAAO,QAAQ,EAAE,MAAM,GAC9C,IAAI,OAAO,OAAO,MAAM,KAAK,QAAQ,IAAI,GAAG,QAAQ,KAAK,CAAC,MAAM,EAAE,CAAC;OAC9D,OAAO,KAAK,EAAE,SAAS,+BAA+B,KAAK,GAAG,CAAC;OAEjE;GACL,MAAM,SAAS,IAAI,IAAI,EAAE,GAAG,QAAQ,CAAC,GAAG,OAAO,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;GACvE,KAAK,MAAM,QAAQ,OAAO,KAAK,MAAM,KAAK,MAAM,GAC9C,IAAI,CAAC,OAAO,IAAI,IAAI,GAAG,QAAQ,KAAK,CAAC,MAAM,IAAI,CAAC;EACpD;EACA,MAAM,aAAa,SAAS,WAAW,SAAS,UAAU,EAAE,UAAU,KAAA;EACtE,MAAM,SAAgC,EAAE,GAAG,KAAK,KAAK,OAAO;EAC5D,MAAM,UAAkC,EAAE,GAAG,KAAK,QAAQ;EAC1D,IAAI,YACF,KAAK,MAAM,CAAC,MAAM,OAAO,SAAS;GAChC,IAAI,OAAO,OAAO,QAAQ,EAAE,GAAG;IAC7B,OAAO,KAAK,EAAE,SAAS,UAAU,GAAG,+CAA+C,CAAC;IACpF;GACF;GACA,MAAM,OAAO,MAAM,KAAK,OAAO;GAC/B,OAAO,MAAM,SAAS,SAAS,EAAE,SAAS,IAAI,IAAI;GAClD,QAAQ,MACN,SAAS,SACL;IAAE,MAAM,IAAI;IAAI,OAAO;IAAI,WAAW;GAAM,IAC3C,MAAM,QAAQ;EACvB;EAEF,IAAI;EACJ,IAAI,EAAE,UAAU,KAAA,KAAa,OAAO,WAAW,GAAG;GAChD,MAAM,WAAW,iBAAiB,EAAE,OAAO,IAAI,UAAU,EAAE,OAAO,MAAM,CAAC,CAAC;GAC1E,IAAI,SAAS,IAAI,QAAQ,SAAS;QAC7B,OAAO,KAAK,EAAE,SAAS,UAAU,SAAS,QAAQ,CAAC;EAC1D;EACA,IAAI,OAAO,QAAQ,OAAO;GAAE,IAAI;GAAO,OAAO;EAAO;EAErD,MAAM,WAAW,EAAE,GAAG,KAAK,CAAC,OAAO,CAAC;EACpC,MAAM,YAAY,EAAE,GAAG,KAAK,GAAG,OAAO,CAAC;EACvC,MAAM,aAAa,EAAE,gBAAgB,SAAS,EAAE,gBAAgB;EAChE,MAAM,cAAc,EAAE,gBAAgB,SAAS,EAAE,gBAAgB;EACjE,MAAM,YAAY,OAAO,YAAY,QAAQ,KAAK,GAAG,QAAQ,CAAC,IAAI,IAAI,CAAC,CAAC;EACxE,MAAM,WAAW,MAAgB;GAC/B,MAAM,MAA2B,CAAC;GAClC,KAAK,MAAM,CAAC,MAAM,OAAO,SAAS,IAAI,MAAM,EAAE,SAAS;GACvD,OAAO;EACT;EACA,MAAM,YAAY,MAAwB,QACxC,IAAI;GACF,MAAM;GACN,SAAS,GAAG,EAAE,YAAY,SAAS,KAAK,OAAO,KAAK,UAAU,GAAG,EAAE;GACnE,SAAS,CAAC,GAAG;EACf,CAAC;EAEH,OAAO,GAAG;GACR,QAAQ,SAAS,WAAW,SAAS,SAAS;IAAE,MAAM,EAAE,OAAO,MAAM;IAAG;GAAQ,IAAI;GACpF,MAAM,QAAQ,QAAQ;IACpB,MAAM,QAAQ,OAAO,EAAE,IAAI;IAC3B,MAAM,QAAQA,QAAM,OAAO,EAAE,KAAK,GAAG,WAAW,WAAW;IAC3D,IAAI,MAAM,WAAW,OAAO,SAAS,SAAS,MAAM,SAAS;IAC7D,IAAI,YAAY;KACd,MAAM,UAAUA,QAAM,OAAO,UAAU,IAAI;KAC3C,IAAI,QAAQ,WAAW,OAAO,SAAS,QAAQ,QAAQ,SAAS;IAClE;IACA,MAAM,QAAQ,MAAM;IACpB,MAAM,OAAc,CAAC;IACrB,KAAK,MAAM,KAAK,OAAO;KAErB,MAAM,aADU,SAAS,MAAM,OAAO,EAAE,MAAM,UAAU,IAC/B,IAAI,CAAC,IAAK,MAAM,IAAI,MAAM,GAAG,QAAQ,CAAC,KAAK,CAAC;KACrE,MAAM,UAAiB,CAAC;KACxB,KAAK,MAAM,KAAK,YAAY;MAC1B,MAAM,SAAS;OAAE,GAAG;OAAG,GAAG,QAAQ,CAAC;MAAE;MACrC,IAAI,CAAC,SAAS,MAAM,MAAM,QAAQ,GAAG,GAAG,QAAQ,KAAK,MAAM;KAC7D;KACA,IAAI,SAAS,QACP;UAAA,QAAQ,SAAS,GAAG,KAAK,KAAK,CAAC;KAAA,OAC9B,IAAI,SAAS,QACd;UAAA,QAAQ,WAAW,GAAG,KAAK,KAAK,CAAC;KAAA,OAChC,IAAI,QAAQ,SAAS,GAAG,KAAK,KAAK,GAAG,OAAO;UAC9C,IAAI,SAAS,QAAQ,KAAK,KAAK;MAAE,GAAG;MAAG,GAAG;KAAU,CAAC;IAC5D;IACA,OAAO,GAAG,EAAE,KAAK,CAAC;GACpB;EACF,CAAC;CACH;AACF,CAAC;;;;;AC5JD,MAAa,UAAU,SAAS;CAC9B,MAAM;CACN,QAAQC,UAAO,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;CACxF,OAAO;CACP,OAAO;CACP,UAAU;CACV,YAAY,QAAQ,GAAG,QAA+B;EACpD,IAAI,OAAO,EAAE,SAAS,UAAU,OAAO,UAAU,IAAI,QAAQ,EAAE,IAAI;EACnE,MAAM,QAAiB,CAAC;EACxB,KAAK,MAAM,QAAQ,EAAE,MAAM;GACzB,MAAM,OAAO,UAAU,IAAI,QAAQ,IAAI;GACvC,IAAI,CAAC,KAAK,IAAI,OAAO;GACrB,MAAM,KAAK,KAAK,KAAK;EACvB;EACA,OAAO,GAAG,EAAE,MAAM,KAAK,CAAC;CAC1B;CACA,MAAM,MAAM;EACV,IAAI,OAAO,EAAE,SAAS,UAAU;GAC9B,MAAM,OAAO,EAAE;GACf,QAAQ,QAAQ,QAAQ,GAAG,IAAI,OAAO,SAAS,IAAI;EACrD;EACA,MAAM,QAAQ,EAAE;EAChB,QAAQ,QAAQ,QAAQ,GAAG,MAAM,KAAK,MAAM,IAAI,OAAO,MAAM,IAAI,CAAC;CACpE;AACF,CAAC;;AAGD,MAAa,WAAW,SAAS;CAC/B,MAAM;CACN,QAAQA,UAAO,EAAE,OAAO,KAAK,CAAC;CAC9B,OAAO;CACP,OAAO;CACP,UAAU;CACV,YAAY,QAAQ,MAAM,GAAG,WAAW,EAAE,KAAK,CAAC;CAChD,MAAM,MAAM;EACV,MAAM,QAAQ,EAAE;EAChB,aAAa,GAAG,KAAK;CACvB;AACF,CAAC;;AAGD,MAAa,WAAW,SAAS;CAC/B,MAAM;CACN,QAAQA,UAAO,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;CAC3D,OAAO;CACP,OAAO;CACP,UAAU;CACV,YAAY,QAAQ,GAAG,QAA+B;EACpD,MAAM,QAAiB,CAAC;EACxB,KAAK,MAAM,QAAQ,EAAE,OAAO;GAC1B,MAAM,OAAO,UAAU,IAAI,QAAQ,IAAI;GACvC,IAAI,CAAC,KAAK,IAAI,OAAO;GACrB,MAAM,KAAK,KAAK,KAAK;EACvB;EACA,MAAM,SAAS,SAAS,KAAK;EAC7B,IAAI,CAAC,OAAO,IAAI,OAAO;EACvB,OAAO,GAAG,MAAM,MAAM,UAAU,IAAI,OAAO,QAAQ,UAAU,OAAO,KAAK,CAAC;CAC5E;CACA,MAAM,MAAM;EACV,MAAM,QAAQ,EAAE;EAChB,QAAQ,QAAQ,QAAQ;GACtB,KAAK,MAAM,QAAQ,OAAO;IACxB,MAAM,IAAI,IAAI,OAAO,SAAS;IAC9B,IAAI,MAAM,MAAM,OAAO,GAAG,CAAC;GAC7B;GACA,OAAO,GAAG,IAAI;EAChB;CACF;AACF,CAAC;;;;AC7DD,MAAM,SAAS;AAEf,MAAM,kBAAkB,EAAE,OAAO,CAAC,CAAC,aAAa,GAAG,QAAQ;CACzD,MAAM,IAAI,gBAAgB,CAAC;CAC3B,IAAI,CAAC,EAAE,IAAI,IAAI,SAAS;EAAE,MAAM;EAAU,SAAS,EAAE;CAAM,CAAC;AAC9D,CAAC;AAED,MAAM,WAAW,EAAE,OAAO,CAAC,CAAC,OAAO,YAAY,mBAAmB;;AAGlE,MAAa,WAAW,SAAS;CAC/B,MAAM;CACN,QAAQC,UAAO,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC,SAAS,EAAE,CAAC;CACjD,OAAO;CACP,WAAW,MAAM,EAAE,WAAW;CAC9B,YAAY,OAAO,MAAM;EACvB,MAAM,IAAI,WAAW,OAAO,CAAC,UAAU,SAAS,GAAG,WAAW;EAC9D,IAAI,CAAC,EAAE,IAAI,OAAO;EAClB,OAAO,GAAG,MAAM,SAAS,aAAa,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM,CAAC;CAClF;CACA,MAAM,OAAO,UAAU;EACrB,IAAI,OAAO,UAAU,WAAW,OAAO,GAAG,QAAQ,IAAI,CAAC;EACvD,MAAM,OAAQ,MAAiB,KAAK;EACpC,IAAI,OAAO,KAAK,IAAI,GAAG,OAAO,GAAG,OAAO,IAAI,CAAC;EAC7C,OAAO,EAAE,SAAS,UAAU,gBAAgB,IAAI,MAAgB,kBAAkB,IAAI,GAAG,IAAI;CAC/F;AACF,CAAC;;AAGD,MAAa,WAAW,SAAS;CAC/B,MAAM;CACN,QAAQA,UAAO,EAAE,QAAQ,gBAAgB,SAAS,EAAE,CAAC;CACrD,OAAO;CACP,UAAU;CACV,YAAY,OAAO,MAAM;EACvB,IAAI,MAAM,SAAS,WAAW,OAAO,IAAI,oCAAoC;EAC7E,IAAI,EAAE,WAAW,KAAA,KAAa,MAAM,SAAS,QAC3C,OAAO,IAAI,wCAAwC;EAErD,OAAO,GAAG,EAAE,MAAM;CACpB;CACA,MAAM,GAAG,MAAM,UAAU;EACvB,IAAI,MAAM,SAAS,QAAQ;GACzB,MAAM,SAAS,WAAW,EAAE,UAAU,KAAK;GAC3C,QAAQ,GAAG,QAAQ,GAAG,WAAW,GAAc,QAAQ,IAAI,EAAE,CAAC;EAChE;EACA,QAAQ,MAAM,GAAG,UAAU,CAAC,CAAC;CAC/B;AACF,CAAC;AAED,SAAS,UAAU,GAAgB;CACjC,IAAI,OAAO,MAAM,UAAU,OAAO;CAClC,IAAI,OAAO,MAAM,YAAY,OAAO,MAAM,WAAW,OAAO,OAAO,CAAC;CACpE,OAAO,KAAK,UAAU,OAAO,CAAC,CAAC;AACjC;AAEA,MAAM,cAAc,CAAC,QAAQ,GAAG;AAChC,MAAM,eAAe,CAAC,SAAS,GAAG;;AAGlC,MAAa,SAAS,SAAS;CAC7B,MAAM;CACN,QAAQA,UAAO;EACb,aAAa,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS;EACjD,cAAc,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS;CACpD,CAAC,CAAC,CAAC,QACA,MACC,EAAE,EAAE,eAAe,YAAA,CAAa,MAAM,OAAO,EAAE,gBAAgB,aAAA,CAAc,SAAS,CAAC,CAAC,GAC1F,sCACF;CACA,OAAO;CACP,gBAAgB;CAChB,YAAY,UAAU;EACpB,MAAM,IAAI,WAAW,OAAO,CAAC,UAAU,QAAQ,GAAG,SAAS;EAC3D,OAAO,EAAE,KAAK,GAAG,EAAE,OAAO,IAAI;CAChC;CACA,MAAM,MAAM;EACV,MAAM,MAAM,IAAI,IAAI,EAAE,eAAe,WAAW;EAChD,MAAM,KAAK,IAAI,IAAI,EAAE,gBAAgB,YAAY;EACjD,QAAQ,UAAU;GAChB,MAAM,OAAO,OAAO,UAAU,WAAW,OAAO,KAAK,IAAK,MAAiB,KAAK;GAChF,IAAI,IAAI,IAAI,IAAI,GAAG,OAAO,GAAG,IAAI;GACjC,IAAI,GAAG,IAAI,IAAI,GAAG,OAAO,GAAG,KAAK;GACjC,OAAO,UAAU,gBAAgB,IAAI,KAAK,gCAAgC;EAC5E;CACF;AACF,CAAC;;;;;AAMD,MAAa,SAAS,SAAS;CAC7B,MAAM;CACN,QAAQA,UAAO;EAAE,QAAQ;EAAiB,IAAI,SAAS,SAAS;CAAE,CAAC,CAAC,CAAC,QAAQ,MAAM;EACjF,MAAM,SAAS,gBAAgB,EAAE,MAAM;EACvC,OAAO,CAAC,OAAO,MAAM,YAAY,OAAO,KAAK;CAC/C,GAAG,sCAAsC;CACzC,OAAO;CACP,gBAAgB;CAChB,YAAY,OAAO,MAAM;EAEvB,MAAM,IAAI,WAAW,OADP,WAAW,EAAE,MAAM,CAAC,CAAC,SAAS,UACR,CAAC,UAAU,QAAQ,IAAI,CAAC,QAAQ,GAAG,SAAS;EAChF,OAAO,EAAE,KAAK,GAAG,EAAE,IAAI,IAAI;CAC7B;CACA,MAAM,MAAM;EACV,MAAM,SAAS,WAAW,EAAE,MAAM;EAClC,QAAQ,OAAO,QAAQ;GACrB,MAAM,UAAU,eAAe,OAA0B,QAAQ,EAAE,MAAM,IAAI,EAAE;GAC/E,OAAO,UACH,GAAG,OAAO,IACV,UACE,gBACA,IAAI,OAAO,KAAwB,EAAE,+BAA+B,EAAE,QACxE;EACN;CACF;AACF,CAAC;;AAGD,MAAa,aAAa,SAAS;CACjC,MAAM;CACN,QAAQA,UAAO,EACb,MAAM,EAAE,OAAO,CAAC,CAAC,aAAa,GAAG,QAAQ;EACvC,MAAM,SAAS,cAAc,CAAC;EAC9B,IAAI,CAAC,OAAO,IAAI,IAAI,SAAS;GAAE,MAAM;GAAU,SAAS,OAAO;EAAM,CAAC;CACxE,CAAC,EACH,CAAC;CACD,OAAO;CACP,UAAU;CACV,YAAY,OAAO,MAAM;EACvB,MAAM,WAAW,SAAS,EAAE,IAAI;EAChC,OAAO,WAAW,OAAO,QAAQ,IAC7B,GAAG,QAAQ,IACX,IAAI,YAAY,EAAE,KAAK,QAAQ,KAAK,KAAK,GAAG;CAClD;CACA,YAAY,UAAU,GAAG,KAAK;AAChC,CAAC;;;;;;;ACrID,MAAM,UACH,IAAY,MAAa,EAAE,UAC3B,UAAiB;CAChB,MAAM,IAAI,WAAW,OAAO,CAAC,MAAM,GAAG,EAAE;CACxC,OAAO,EAAE,KAAK,GAAG,GAAG,IAAI;AAC1B;AAEF,MAAa,eAAe,SAAS;CACnC,MAAM;CACN,QAAQC,UAAO;EACb,QAAQ,EAAE,OAAO,CAAC,CAAC,aAAa,GAAG,QAAQ;GACzC,MAAM,IAAI,gBAAgB,CAAC;GAC3B,IAAI,CAAC,EAAE,IAAI,IAAI,SAAS;IAAE,MAAM;IAAU,SAAS,EAAE;GAAM,CAAC;EAC9D,CAAC;EACD,IAAI,EAAE,OAAO,CAAC,CAAC,OAAO,YAAY,mBAAmB,CAAC,CAAC,SAAS;CAClE,CAAC;CACD,OAAO;CACP,UAAU;CACV,WAAW,OAAO,eAAe,EAAE,MAAM;CACzC,MAAM,MAAM;EACV,MAAM,SAAS,WAAW,EAAE,MAAM;EAClC,QAAQ,OAAO,QAAQ,GAAG,WAAW,OAAkB,QAAQ,EAAE,MAAM,IAAI,EAAE,CAAC;CAChF;AACF,CAAC;;AAGD,MAAa,YAAY,SAAS;CAChC,MAAM;CACN,QAAQA,UAAO,EACb,IAAI,EAAE,OAAO,CAAC,CAAC,aAAa,GAAG,QAAQ;EACrC,MAAM,IAAI,cAAc,CAAC;EACzB,IAAI,CAAC,EAAE,IAAI,IAAI,SAAS;GAAE,MAAM;GAAU,SAAS,EAAE;EAAM,CAAC;CAC9D,CAAC,EACH,CAAC;CACD,OAAO;CACP,UAAU;CACV,WAAW,OAAO,YAAY;CAC9B,MAAM,MAAM;EACV,MAAM,KAAK,SAAS,EAAE,EAAE;EACxB,QAAQ,OAAO,QAAQ,GAAG,MAAM,OAAkB,IAAI,IAAI,EAAE,CAAC;CAC/D;AACF,CAAC;AAED,MAAa,eAAe,SAAS;CACnC,MAAM;CACN,QAAQA,UAAO,EAAE,MAAM,EAAE,KAAK;EAAC;EAAO;EAAS;CAAM,CAAC,EAAE,CAAC;CACzD,OAAO;CACP,UAAU;CACV,WAAW,OAAO,eAAe;CACjC,MAAM,OAAO,OAAO,QAAQ,GAAG,SAAS,OAAkB,EAAE,MAAM,IAAI,EAAE,CAAC;AAC3E,CAAC;;AAGD,MAAa,QAAQ,SAAS;CAC5B,MAAM;CACN,QAAQA,UAAO,CAAC,CAAC;CACjB,OAAO;CACP,UAAU;CACV,WAAW,OAAO,QAAQ;CAC1B,YAAY,UAAU,GAAG,KAAK;AAChC,CAAC;;;;;;;ACtED,MAAa,KAAK,SAAS;CACzB,MAAM;CACN,QAAQC,UAAO,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;CACzC,OAAO;CACP,WAAW,GAAG,QAAQ,IAAI,UAAU,EAAE,IAAI,EAAE,YAAY;CACxD,YAAY,OAAO,GAAG,QAAQ;EAC5B,MAAM,MAAM,OAAO,OAAO,IAAI,WAAW,EAAE,GAAG,IAAI,IAAI,UAAU,EAAE,OAAO,KAAA;EACzE,IAAI,CAAC,KAAK,OAAO,IAAI,qBAAqB,EAAE,IAAI,EAAE;EAClD,IAAI,IAAI,SAAS,CAAC,WAAW,OAAO,IAAI,KAAK,GAC3C,OAAO,IAAI,aAAa,EAAE,IAAI,UAAU,KAAK,IAAI,KAAK,EAAE,QAAQ,KAAK,KAAK,GAAG;EAE/E,OAAO,GAAG,IAAI,MAAM;CACtB;CACA,MAAM,GAAG,QAAQ;EACf,MAAM,MAAM,IAAI,UAAU,EAAE;EAC5B,QAAQ,OAAO,QAAQ,IAAI,IAAI,OAAO,GAAG;CAC3C;AACF,CAAC;;;;;;;;ACdD,MAAM,UAAU,OAAc,OAC5B,MAAM,SAAS,SAAS,GAAG,MAAM,EAAE,IAAI,IAAI,GAAG,GAAG,uBAAuB,KAAK,KAAK,GAAG;;AAGvF,MAAa,OAAO,SAAS;CAC3B,MAAM;CACN,QAAQC,UAAO,EAAE,UAAU,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;CACxD,OAAO;CACP,WAAW,GAAG,KAAK,UACjB,SAAS,aAAa,EAAE,UAAU;EAAE,GAAG;EAAK,OAAO,IAAI,QAAQ;CAAE,GAAI,MAAmB,EAAE,CAAC,CAAC,CACzF;CACL,YAAY,OAAO,GAAG,QAAQ;EAC5B,IAAI,IAAI,SAAS,GAAG,OAAO,IAAI,mCAAmC;EAClE,MAAM,UAAU,OAAO,OAAO,MAAM;EACpC,IAAI,CAAC,QAAQ,IAAI,OAAO;EACxB,MAAM,SAAS,aAAa,EAAE,UAAU;GAAE,GAAG;GAAK,OAAO,IAAI,QAAQ;EAAE,GAAG,QAAQ,KAAK;EACvF,IAAI,CAAC,OAAO,IAAI,OAAO,IAAI,aAAa,OAAO,MAAM,KAAK,IAAI,OAAO,MAAM,SAAS;EACpF,IAAI,OAAO,MAAM,WAAW,OAAO,IAAI,iCAAiC;EACxE,OAAO,GAAG,EAAE,KAAK,OAAO,MAAM,IAAI,CAAC;CACrC;CACA,MAAM,GAAG,KAAK,UAAU;EACtB,MAAM,EAAE,QAAQ,SACd,aAAa,EAAE,UAAU;GAAE,GAAG;GAAK,OAAO,IAAI,QAAQ;EAAE,GAAI,MAAmB,EAAE,CACnF;EACA,QAAQ,MAAM,QAAQ;GACpB,MAAM,MAAa,CAAC;GACpB,KAAK,MAAM,CAAC,GAAG,YAAa,KAAwB,QAAQ,GAAG;IAC7D,MAAM,IAAI,IAAI,SAAS,GAAG;IAC1B,IAAI,CAAC,EAAE,IACL,OAAO,IAAI;KACT,MAAM,EAAE,MAAM;KACd,QAAQ,WAAW,EAAE,IAAI,EAAE,MAAM,GAAG,IAAI,EAAE,MAAM;IAClD,CAAC;IACH,IAAI,KAAK,EAAE,KAAY;GACzB;GACA,OAAO,GAAG,GAAG;EACf;CACF;AACF,CAAC;AAED,MAAa,aAAa,SAAS;CACjC,MAAM;CACN,QAAQA,UAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC;CACpC,OAAO;CACP,UAAU;CACV,YAAY,OAAO,GAAG,QAAQ;EAC5B,MAAM,UAAU,OAAO,OAAO,aAAa;EAC3C,IAAI,CAAC,QAAQ,IAAI,OAAO;EACxB,MAAM,OAAO,iBAAiB,EAAE,MAAM,KAAK,QAAQ,KAAK;EACxD,OAAO,KAAK,KAAK,GAAG,KAAK,IAAI;CAC/B;CACA,MAAM,GAAG,KAAK,UAAU;EACtB,MAAM,OAAO,SAAS,iBAAiB,EAAE,MAAM,KAAM,MAAmB,EAAE,CAAC;EAC3E,QAAQ,MAAM,QAAQ,GAAI,KAAwB,QAAQ,MAAM,KAAK,GAAG,IAAI,QAAQ,GAAG,CAAC,CAAC;CAC3F;AACF,CAAC;AAED,MAAM,QAAQ,MAAc,OAC1B,SAAS;CACP;CACA,QAAQA,UAAO,CAAC,CAAC;CACjB,OAAO;CACP,UAAU;CACV,YAAY,UAAU;EACpB,MAAM,UAAU,OAAO,OAAO,IAAI;EAClC,OAAO,QAAQ,KAAK,GAAG,EAAE,SAAS,QAAQ,KAAK,CAAC,IAAI;CACtD;CACA,YAAY,SAAS,GAAI,KAAwB,GAAI,KAAwB,MAAM,MAAM,IAAI;AAC/F,CAAC;AAEH,MAAa,QAAQ,KAAK,eAAe,CAAC;AAC1C,MAAa,OAAO,KAAK,SAAS,MAAM,IAAI,CAAC;;AAG7C,MAAa,QAAQ,SAAS;CAC5B,MAAM;CACN,QAAQA,UAAO,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC;CACvC,OAAO;CACP,UAAU;CACV,YAAY,UAAU;EACpB,MAAM,UAAU,OAAO,OAAO,OAAO;EACrC,OAAO,QAAQ,KAAK,GAAG,EAAE,SAAS,QAAQ,KAAK,CAAC,IAAI;CACtD;CACA,MAAM,OAAO,SAAS,GAAI,KAAwB,GAAG,EAAE,EAAE,KAAK,IAAI;AACpE,CAAC;;AAGD,MAAa,MAAM,SAAS;CAC1B,MAAM;CACN,QAAQA,UAAO,CAAC,CAAC;CACjB,OAAO;CACP,UAAU;CACV,YAAY,UACV,MAAM,SAAS,UAAU,MAAM,SAAS,WACpC,GAAG,EAAE,MAAM,IACX,IAAI,qCAAqC,KAAK,KAAK,GAAG;CAC5D,YAAY,MAAM,GAAG,OAAO,MAAM,WAAW,MAAM,KAAK,CAAC,CAAC,CAAC,SAAU,EAAqB,MAAM;AAClG,CAAC;;AAGD,MAAa,SAAS,SAAS;CAC7B,MAAM;CACN,QAAQA,UAAO,CAAC,CAAC;CACjB,OAAO;CACP,UAAU;CACV,YAAY,UAAU;EACpB,MAAM,UAAU,OAAO,OAAO,QAAQ;EACtC,OAAO,QAAQ,KAAK,GAAG,KAAK,IAAI;CAClC;CACA,YAAY,SAAS;EACnB,MAAM,uBAAO,IAAI,IAAY;EAC7B,OAAO,GACJ,KAAwB,QAAQ,MAAM;GACrC,MAAM,IAAI,aAAa,CAAC;GACxB,IAAI,KAAK,IAAI,CAAC,GAAG,OAAO;GACxB,KAAK,IAAI,CAAC;GACV,OAAO;EACT,CAAC,CACH;CACF;AACF,CAAC;;AAGD,MAAa,MAAM,SAAS;CAC1B,MAAM;CACN,QAAQA,UAAO,CAAC,CAAC;CACjB,OAAO;CACP,UAAU;CACV,YAAY,UAAU;EACpB,MAAM,UAAU,OAAO,OAAO,KAAK;EACnC,IAAI,CAAC,QAAQ,IAAI,OAAO;EACxB,OAAO,UAAU,QAAQ,KAAK,CAAC,CAAC,SAAS,WACrC,GAAG,EAAE,SAAS,EAAE,MAAM,CAAC,IACvB,IAAI,iCAAiC,KAAK,KAAK,GAAG;CACxD;CAEA,YAAY,SAAS;EACnB,MAAM,UAAW,KACd,QAAQ,MAAmB,MAAM,IAAI,CAAC,CACtC,MAAM,GAAG,MAAM,IAAI,CAAC;EACvB,OAAO,GAAG,QAAQ,WAAW,IAAI,OAAO,QAAQ,QAAQ,GAAG,MAAM,IAAI,GAAG,CAAC,CAAC;CAC5E;AACF,CAAC;AAED,MAAM,WAAW,SACf,SAAS;CACP;CACA,QAAQA,UAAO,CAAC,CAAC;CACjB,OAAO;CACP,UAAU;CACV,YAAY,UAAU;EACpB,MAAM,UAAU,OAAO,OAAO,IAAI;EAClC,IAAI,CAAC,QAAQ,IAAI,OAAO;EACxB,OAAO,UAAU,QAAQ,KAAK,IAC1B,GAAG,EAAE,SAAS,UAAU,QAAQ,KAAK,CAAC,CAAC,IACvC,IAAI,GAAG,KAAK,oDAAoD,KAAK,KAAK,GAAG;CACnF;CACA,YAAY,SAAS;EACnB,IAAI,OAAY;EAChB,KAAK,MAAM,KAAK,MAAwB;GACtC,IAAI,MAAM,MAAM;GAChB,IAAI,SAAS,SAAS,SAAS,QAAQ,YAAY,GAAG,IAAI,IAAI,IAAI,YAAY,GAAG,IAAI,IAAI,IACvF,OAAO;EACX;EACA,OAAO,GAAG,IAAI;CAChB;AACF,CAAC;AAEH,MAAa,MAAM,QAAQ,KAAK;AAChC,MAAa,MAAM,QAAQ,KAAK;;AAGhC,MAAa,WAAW,SAAS;CAC/B,MAAM;CACN,QAAQA,UAAO,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC,QAAQ,MAAM,MAAM,KAAA,GAAW,wBAAwB,EAAE,CAAC;CAC9F,OAAO;CACP,UAAU;CACV,YAAY,OAAO,GAAG,QAAQ;EAC5B,MAAM,UAAU,OAAO,OAAO,UAAU;EACxC,IAAI,CAAC,QAAQ,IAAI,OAAO;EACxB,MAAM,UAAU,eAAe,EAAE,OAAO,KAAK,UAAU,QAAQ,KAAK,CAAC,CAAC,SAAS,MAAM;EACrF,IAAI,CAAC,QAAQ,IAAI,OAAO;EACxB,OAAO,WAAW,QAAQ,OAAO,QAAQ,MAAM,IAAI,IAC/C,GAAG,EAAE,OAAO,IACZ,IAAI,mBAAmB,KAAK,QAAQ,MAAM,IAAI,EAAE,MAAM,KAAK,KAAK,GAAG;CACzE;CACA,MAAM,GAAG,KAAK,UAAU;EACtB,MAAM,UAAW,MAAmB;EACpC,MAAM,EAAE,QAAQ,SAAS,eAAe,EAAE,OAAO,KAAK,UAAU,OAAO,CAAC,CAAC,SAAS,MAAM,CAAC;EACzF,QAAQ,MAAM,QAAQ;GACpB,MAAM,IAAI,IAAI,MAAM,IAAI,QAAQ,GAAG;GACnC,OAAO,GACL,MAAM,QAAS,KAAwB,MAAM,MAAM,MAAM,QAAQ,YAAY,GAAG,CAAC,MAAM,CAAC,CAC1F;EACF;CACF;AACF,CAAC;;;;AC1MD,MAAMC,2BAAS,IAAI,IAAI;CAAC;CAAU;CAAU;AAAS,CAAC;;;;;AAMtD,MAAa,SAAS,SAAS;CAC7B,MAAM;CACN,QAAQC,UAAO;EACb,OAAO,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;EACvB,SAAS,EAAE,KAAK;GAAC;GAAQ;GAAQ;EAAO,CAAC,CAAC,CAAC,SAAS;CACtD,CAAC;CACD,OAAO;CACP,WAAW,MAAM,EAAE,YAAY;CAC/B,YAAY,OAAO,GAAG,QAAQ;EAC5B,IAAI,CAACD,SAAO,IAAI,MAAM,IAAI,GACxB,OAAO,IAAI,mDAAmD,KAAK,KAAK,GAAG;EAC7E,IAAI,CAAC,OAAO,OAAO,IAAI,QAAQ,EAAE,KAAK,GAAG,OAAO,IAAI,yBAAyB,EAAE,MAAM,EAAE;EAEvF,MAAM,QAAQ,SADC,OAAO,OAAO,IAAI,OAAO,EAAE,MACnB,CAAA,CAAO,IAAI,UAAU,CAAC;EAC7C,IAAI,CAAC,MAAM,IAAI,OAAO,IAAI,iBAAiB,EAAE,MAAM,uBAAuB,MAAM,OAAO;EACvF,QAAQ,EAAE,WAAW,QAArB;GACE,KAAK,QACH,OAAO,GAAG,EAAE,SAAS,MAAM,KAAK,CAAC;GACnC,KAAK,SACH,OAAO,GAAG,MAAM,KAAK;GACvB;IACE,IAAI,CAAC,WAAW,OAAO,MAAM,KAAK,GAChC,OAAO,IACL,2BAA2B,KAAK,KAAK,EAAE,yBAAyB,KAAK,MAAM,KAAK,GAClF;IAEF,OAAO,GAAG,SAAS,MAAM,OAAO,MAAM,KAAK,CAAC,CAAC;EAEjD;CACF;CACA,MAAM,GAAG,QAAQ;EACf,MAAM,QAAQ,IAAI,OAAO,EAAE;EAC3B,MAAM,OAAO,EAAE,WAAW;EAC1B,QAAQ,UAAU;GAChB,MAAM,MAAM,OAAO,KAAkC;GACrD,IAAI,OAAO,OAAO,OAAO,GAAG,GAAG,OAAO,GAAG,MAAM,IAAW;GAC1D,IAAI,SAAS,SAAS,OAAO,UAAU,eAAe,IAAI,IAAI,qBAAqB,EAAE,MAAM,EAAE;GAC7F,OAAO,GAAG,SAAS,SAAS,QAAQ,IAAI;EAC1C;CACF;AACF,CAAC;;;;;AC7CD,MAAa,cAAc,SAAS;CAClC,MAAM;CACN,QAAQE,UAAO,CAAC,CAAC;CACjB,OAAO;CACP,UAAU;CACV,YAAY,UAAU;EACpB,MAAM,IAAI,WAAW,OAAO,CAAC,QAAQ,GAAG,eAAe;EACvD,OAAO,EAAE,KAAK,GAAG,EAAE,SAAS,EAAE,MAAM,CAAC,IAAI;CAC3C;CACA,YAAY,UAAU,GAAI,MAAiB,KAAK,MAAM,KAAK,OAAO,KAAK;AACzE,CAAC;;AAGD,MAAa,YAAY,SAAS;CAChC,MAAM;CACN,QAAQA,UAAO,EAAE,OAAO,KAAK,CAAC;CAC9B,OAAO;CACP,UAAU;CACV,YAAY,OAAO,MAAM;EACvB,IAAI,EAAE,UAAU,MAAM,OAAO,IAAI,gCAAgC;EACjE,MAAM,OAAO,UAAU,KAAK;EAC5B,MAAM,UAAU,WAAW,EAAE,KAAK;EAClC,IAAI,KAAK,SAAS,WAAW,OAAO,GAAG,OAAO;EAC9C,OAAO,WAAW,SAAS,IAAI,IAC3B,GAAG,IAAI,IACP,IAAI,oBAAoB,KAAK,OAAO,EAAE,aAAa,KAAK,KAAK,GAAG;CACtE;CACA,MAAM,MAAM;EACV,MAAM,QAAQ,EAAE;EAChB,QAAQ,UAAU,GAAG,SAAS,KAAK;CACrC;AACF,CAAC;;AAGD,MAAa,YAAY,SAAS;CAChC,MAAM;CACN,QAAQA,UAAO,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC,SAAS,EAAE,CAAC;CACjD,OAAO;CACP,UAAU;CACV,YAAY,UAAU,GAAG,UAAU,KAAK,CAAC;CACzC,MAAM,MAAM;EACV,MAAM,UAAU,EAAE,WAAW;EAC7B,QAAQ,UAAW,UAAU,OAAO,UAAU,iBAAiB,OAAO,IAAI,GAAG,KAAK;CACpF;AACF,CAAC;;;;;AAMD,MAAa,aAAa,SAAS;CACjC,MAAM;CACN,QAAQA,UAAO,CAAC,CAAC;CACjB,OAAO;CACP,UAAU;CACV,UAAU;CACV,YAAY,UAAU,GAAG,EAAE,SAAS,UAAU,KAAK,CAAC,CAAC;CACrD,YAAY,UAAU,GAAG,UAAU,OAAO,OAAO,KAAK;AACxD,CAAC;;;AC3DD,MAAM,QACJ;CAEE,IAAI;EAAE,WAAW;EAAQ,QAAQ;CAAM;CACvC,GAAG;EAAE,WAAW;EAAQ,QAAQ;CAAE;CAClC,IAAI;EAAE,WAAW;EAAQ,QAAQ;CAAK;CACtC,GAAG;EAAE,WAAW;EAAQ,QAAQ;CAAU;CAC1C,IAAI;EAAE,WAAW;EAAQ,QAAQ;CAAa;CAC9C,IAAI;EAAE,WAAW;EAAQ,QAAQ;CAAU;CAE3C,IAAI;EAAE,WAAW;EAAU,QAAQ;CAAM;CACzC,IAAI;EAAE,WAAW;EAAU,QAAQ;CAAK;CACxC,GAAG;EAAE,WAAW;EAAU,QAAQ;CAAE;CACpC,IAAI;EAAE,WAAW;EAAU,QAAQ;CAAK;CACxC,IAAI;EAAE,WAAW;EAAU,QAAQ;CAAO;CAC1C,IAAI;EAAE,WAAW;EAAU,QAAQ;CAAO;CAE1C,IAAI;EAAE,WAAW;EAAU,QAAQ;CAAM;CACzC,GAAG;EAAE,WAAW;EAAU,QAAQ;CAAE;CACpC,IAAI;EAAE,WAAW;EAAU,QAAQ;CAAK;AAC1C;AAEF,MAAM,QAAQ,SAAiB,MAAM,KAAK,KAAK,CAAC,CAAC,YAAY;AAE7D,SAAgB,OAAO,MAAuB;CAC5C,OAAO,KAAK,IAAI,MAAM,KAAA;AACxB;;AAGA,SAAgB,iBAAiB,MAAc,IAAgC;CAC7E,MAAM,IAAI,KAAK,IAAI;CACnB,MAAM,IAAI,KAAK,EAAE;CACjB,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,cAAc,EAAE,WAAW,OAAO,KAAA;CAEpD,OAAO,EAAE,SAAS,EAAE;AACtB;;;;AClCA,MAAM,SAAS,EAAE,OAAO;AAExB,MAAM,YAAY,QAAgB,UAAiB;CACjD,MAAM,IAAI,WAAW,OAAO,CAAC,QAAQ,GAAG,EAAE;CAC1C,OAAO,EAAE,KAAK,GAAG,EAAE,MAAM,IAAI;AAC/B;AAEA,MAAM,cACJ,MACA,KACA,UAEA,SAAS;CACP;CACA,QAAQC,UAAO,GAAG,MAAM,OAAO,CAAgC;CAC/D,OAAO;CACP,UAAU;CACV,WAAW,SAAS,IAAI;CACxB,MAAM,MAAM;EACV,MAAM,UAAW,EAAwB;EACzC,QAAQ,UAAU,GAAG,MAAM,OAAiB,OAAO,CAAC;CACtD;AACF,CAAC;AAEH,MAAa,MAAM,WAAW,OAAO,UAAU,GAAG,MAAM,IAAI,CAAC;AAC7D,MAAa,WAAW,WAAW,YAAY,UAAU,GAAG,MAAM,IAAI,CAAC;AACvE,MAAa,WAAW,WAAW,YAAY,OAAO,GAAG,MAAM,IAAI,CAAC;;AAGpE,MAAa,SAAS,SAAS;CAC7B,MAAM;CACN,QAAQA,UAAO,EAAE,IAAI,OAAO,QAAQ,MAAM,MAAM,GAAG,gBAAgB,EAAE,CAAC;CACtE,OAAO;CACP,UAAU;CACV,WAAW,SAAS,QAAQ;CAC5B,MAAM,OAAO,UAAU,GAAI,QAAmB,EAAE,EAAE;AACpD,CAAC;;AAGD,SAAS,aAAa,GAAW,QAAwB;CACvD,MAAM,CAAC,UAAU,WAAW,OAAO,OAAO,CAAC,CAAC,CAAC,MAAM,GAAG;CACtD,OAAO,OAAO,GAAG,SAAS,GAAG,OAAO,QAAQ,IAAI,QAAQ;AAC1D;AAIA,SAAS,YAAY,GAAW,MAAyB;CACvD,QAAQ,MAAR;EACE,KAAK,SACH,OAAO,KAAK,MAAM,CAAC;EACrB,KAAK,QACH,OAAO,KAAK,KAAK,CAAC;EACpB,KAAK,WACH,OAAO,KAAK,KAAK,CAAC,IAAI,KAAK,MAAM,KAAK,IAAI,CAAC,CAAC;EAC9C,KAAK,aAAa;GAChB,MAAM,IAAI,KAAK,IAAI,CAAC;GACpB,MAAM,QAAQ,KAAK,MAAM,CAAC;GAC1B,MAAM,OAAO,IAAI;GACjB,MAAM,IAAI,OAAO,MAAQ,SAAS,MAAO,QAAQ,MAAM,IAAK,QAAQ,IAAI;GACxE,OAAO,KAAK,KAAK,CAAC,IAAI;EACxB;CACF;AACF;;AAGA,MAAa,QAAQ,SAAS;CAC5B,MAAM;CACN,QAAQA,UAAO;EACb,WAAW,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,SAAS;EACpD,MAAM,EAAE,KAAK;GAAC;GAAW;GAAa;GAAS;EAAM,CAAC,CAAC,CAAC,SAAS;CACnE,CAAC;CACD,OAAO;CACP,UAAU;CACV,WAAW,SAAS,OAAO;CAC3B,MAAM,MAAM;EACV,MAAM,YAAY,EAAE,aAAa;EACjC,MAAM,OAAO,EAAE,QAAQ;EAEvB,QAAQ,UACN,GAAG,aAAa,YAAY,aAAa,OAAiB,SAAS,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC;CAC5F;AACF,CAAC;AAED,MAAa,MAAM,SAAS;CAC1B,MAAM;CACN,QAAQA,UAAO,CAAC,CAAC;CACjB,OAAO;CACP,UAAU;CACV,WAAW,SAAS,KAAK;CACzB,YAAY,UAAU,GAAG,KAAK,IAAI,KAAe,CAAC;AACpD,CAAC;AAED,MAAa,QAAQ,SAAS;CAC5B,MAAM;CACN,QAAQA,UAAO;EAAE,KAAK,OAAO,SAAS;EAAG,KAAK,OAAO,SAAS;CAAE,CAAC,CAAC,CAC/D,QAAQ,MAAM,EAAE,QAAQ,KAAA,KAAa,EAAE,QAAQ,KAAA,GAAW,wBAAwB,CAAC,CACnF,QACE,MAAM,EAAE,QAAQ,KAAA,KAAa,EAAE,QAAQ,KAAA,KAAa,EAAE,OAAO,EAAE,KAChE,kBACF;CACF,OAAO;CACP,UAAU;CACV,WAAW,SAAS,OAAO;CAC3B,MAAM,MAAM;EACV,MAAM,MAAM,EAAE,OAAO;EACrB,MAAM,MAAM,EAAE,OAAO;EACrB,QAAQ,UAAU,GAAG,KAAK,IAAI,KAAK,KAAK,IAAI,KAAK,KAAe,CAAC,CAAC;CACpE;AACF,CAAC;AAED,MAAM,WAAW,EAAE,OAAO,CAAC,CAAC,OAAO,QAAQ,cAAc;;;;;;AAOzD,MAAa,cAAc,SAAS;CAClC,MAAM;CACN,QAAQA,UAAO;EAAE,IAAI;EAAU,MAAM,SAAS,SAAS;CAAE,CAAC,CAAC,CAAC,QACzD,MACC,EAAE,SAAS,KAAA,KACX,CAAC,OAAO,EAAE,IAAI,KACd,CAAC,OAAO,EAAE,EAAE,KACZ,iBAAiB,EAAE,MAAM,EAAE,EAAE,MAAM,KAAA,GACrC,sCACF;CACA,OAAO;CACP,WAAW,MAAM,EAAE,SAAS,KAAA;CAC5B,YAAY,OAAO,MAAM;EACvB,IAAI,MAAM,SAAS,SAAS;GAC1B,IAAI,EAAE,SAAS,KAAA,GACb,OAAO,IAAI,sEAAoE;GACjF,MAAM,CAAC,OAAO,QAAQ,MAAM;GAK5B,IAAI,EAHF,MAAM,GAAG,WAAW,KACpB,UAAU,KAAK,CAAC,CAAC,SAAS,YAC1B,UAAU,IAAI,CAAC,CAAC,SAAS,WAChB,OAAO,IAAI,8CAA8C,KAAK,KAAK,GAAG;GACjF,OAAO,GAAG,WAAW,EAAE,QAAQ,WAAW,KAAK,CAAC,CAAC;EACnD;EACA,IAAI,EAAE,SAAS,KAAA,GAAW,OAAO,IAAI,qDAAmD;EACxF,OAAO,SAAS,cAAc,CAAC,CAAC,KAAK;CACvC;CACA,MAAM,GAAG,MAAM,UAAU;EACvB,MAAM,KAAK,EAAE;EACb,IAAI,MAAM,SAAS,SAAS;GAC1B,MAAM,SAAS,iBAAiB,EAAE,MAAgB,EAAE;GACpD,QAAQ,MAAM,GAAI,IAAe,MAAM;EACzC;EACA,QAAQ,MAAM;GACZ,MAAM,CAAC,OAAO,QAAQ;GACtB,IAAI,UAAU,MAAM,OAAO,GAAG,IAAI;GAClC,IAAI,SAAS,MAAM,OAAO,UAAU,gBAAgB,qBAAqB,OAAO;GAChF,MAAM,SAAS,iBAAiB,MAAM,EAAE;GACxC,OAAO,WAAW,KAAA,IACd,UAAU,gBAAgB,kBAAkB,KAAK,MAAM,IAAI,IAC3D,GAAG,QAAQ,MAAM;EACvB;CACF;AACF,CAAC;;;;;;;AC7JD,MAAM,YAAY,QAAgB,UAAiB;CACjD,MAAM,IAAI,WAAW,OAAO,CAAC,QAAQ,GAAG,EAAE;CAC1C,OAAO,EAAE,KAAK,GAAG,EAAE,MAAM,IAAI;AAC/B;AAEA,MAAM,QAAQ,EAAE,OAAO,CAAC,CAAC,aAAa,GAAG,QAAQ;CAC/C,MAAM,IAAI,aAAa,CAAC;CACxB,IAAI,CAAC,EAAE,IAAI,IAAI,SAAS;EAAE,MAAM;EAAU,SAAS,EAAE;CAAM,CAAC;AAC9D,CAAC;AAED,MAAM,eAAe,MAAc,EAAE,QAAQ,uBAAuB,MAAM;AAE1E,MAAa,OAAO,SAAS;CAC3B,MAAM;CACN,QAAQC,UAAO,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;CACtD,OAAO;CACP,UAAU;CACV,WAAW,SAAS,MAAM;CAC1B,MAAM,MAAM;EACV,IAAI,EAAE,UAAU,KAAA,GAAW,QAAQ,UAAU,GAAI,MAAiB,KAAK,CAAC;EACxE,MAAM,MAAM,IAAI,EAAE,MAAM,QAAQ,aAAa,MAAM,EAAE;EACrD,MAAM,QAAQ,IAAI,OAAO,IAAI,IAAI,GAAG,IAAI,IAAI,IAAI;EAChD,QAAQ,UAAU,GAAI,MAAiB,QAAQ,OAAO,EAAE,CAAC;CAC3D;AACF,CAAC;AAED,MAAa,QAAQ,SAAS;CAC5B,MAAM;CACN,QAAQA,UAAO,CAAC,CAAC;CACjB,OAAO;CACP,UAAU;CACV,WAAW,SAAS,OAAO;CAC3B,YAAY,UAAU,GAAI,MAAiB,YAAY,CAAC;AAC1D,CAAC;AAED,MAAa,QAAQ,SAAS;CAC5B,MAAM;CACN,QAAQA,UAAO,CAAC,CAAC;CACjB,OAAO;CACP,UAAU;CACV,WAAW,SAAS,OAAO;CAC3B,YAAY,UAAU,GAAI,MAAiB,YAAY,CAAC;AAC1D,CAAC;;AAGD,MAAaC,aAAW,SAAS;CAC/B,MAAM;CACN,QAAQD,UAAO;EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC;EAAG,UAAU,EAAE,QAAQ,CAAC,CAAC,SAAS;CAAE,CAAC,CAAC,CAAC,QACnF,MAAM,CAAC,EAAE,YAAY,EAAE,UAAU,GAClC,0CACF;CACA,OAAO;CACP,UAAU;CACV,WAAW,SAAS,UAAU;CAC9B,MAAM,OAAO,UAAU;EACrB,MAAM,QAAQ,MAAM,KAAK,KAAe;EACxC,IAAI,MAAM,UAAU,EAAE,QAAQ,OAAO,GAAG,KAAK;EAC7C,OAAO,GACL,EAAE,WAAW,GAAG,MAAM,MAAM,GAAG,EAAE,SAAS,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,KAAK,MAAM,MAAM,GAAG,EAAE,MAAM,CAAC,CAAC,KAAK,EAAE,CAC7F;CACF;AACF,CAAC;;AAGD,MAAa,MAAM,SAAS;CAC1B,MAAM;CACN,QAAQA,UAAO;EACb,QAAQ,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC;EAC9B,MAAM,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;EACtB,MAAM,EAAE,KAAK,CAAC,QAAQ,OAAO,CAAC;CAChC,CAAC;CACD,OAAO;CACP,UAAU;CACV,WAAW,SAAS,KAAK;CACzB,MAAM,OAAO,UAAU;EACrB,MAAM,IAAI;EACV,OAAO,GAAG,EAAE,SAAS,SAAS,EAAE,SAAS,EAAE,QAAQ,EAAE,IAAI,IAAI,EAAE,OAAO,EAAE,QAAQ,EAAE,IAAI,CAAC;CACzF;AACF,CAAC;;AAGD,MAAa,UAAU,SAAS;CAC9B,MAAM;CACN,QAAQA,UAAO;EACb,SAAS,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;EACzB,MAAM,EAAE,OAAO;EACf,OAAO,EAAE,QAAQ,CAAC,CAAC,SAAS;CAC9B,CAAC,CAAC,CAAC,aAAa,GAAG,QAAQ;EACzB,IAAI,CAAC,EAAE,SAAS,OAAO,EAAE,YAAY,UAAU;EAC/C,MAAM,IAAI,aAAa,EAAE,OAAO;EAChC,IAAI,CAAC,EAAE,IAAI,IAAI,SAAS;GAAE,MAAM;GAAU,MAAM,CAAC,SAAS;GAAG,SAAS,EAAE;EAAM,CAAC;CACjF,CAAC;CACD,OAAO;CACP,UAAU;CACV,WAAW,SAAS,SAAS;CAC7B,MAAM,MAAM;EACV,MAAM,UAAU,IAAI,OAAO,EAAE,QAAQ,EAAE,UAAU,YAAY,EAAE,OAAO,GAAG,IAAI;EAE7E,QAAQ,UAAU,GAAI,MAAiB,QAAQ,eAAe,EAAE,IAAI,CAAC;CACvE;AACF,CAAC;AAED,SAAS,WAAW,SAAyB;CAC3C,OAAQ,IAAI,OAAO,GAAG,QAAQ,IAAI,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,CAAqB,SAAS;AAC/E;;AAGA,MAAa,eAAe,SAAS;CACnC,MAAM;CACN,QAAQA,UAAO;EAAE,SAAS;EAAO,OAAO,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS;CAAE,CAAC,CAAC,CAAC,QAC3E,MAAM,CAAC,aAAa,EAAE,OAAO,CAAC,CAAC,OAAO,EAAE,SAAS,MAAM,WAAW,EAAE,OAAO,GAC5E,mDACF;CACA,OAAO;CACP,UAAU;CACV,YAAY,UAAU;EACpB,MAAM,IAAI,WAAW,OAAO,CAAC,QAAQ,GAAG,eAAe;EACvD,OAAO,EAAE,KAAK,GAAG,EAAE,SAAS,EAAE,MAAM,CAAC,IAAI;CAC3C;CACA,MAAM,MAAM;EACV,MAAM,KAAK,IAAI,OAAO,EAAE,SAAS,GAAG;EACpC,MAAM,QAAQ,EAAE,SAAS;EACzB,QAAQ,UAAU,GAAG,GAAG,KAAK,KAAe,CAAC,GAAG,UAAU,IAAI;CAChE;AACF,CAAC;;AAGD,MAAa,QAAQ,SAAS;CAC5B,MAAM;CACN,QAAQA,UAAO;EAAE,WAAW,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;EAAG,OAAO,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS;CAAE,CAAC;CAC1F,OAAO;CACP,UAAU;CACV,YAAY,UAAU;EACpB,MAAM,IAAI,WAAW,OAAO,CAAC,QAAQ,GAAG,OAAO;EAC/C,OAAO,EAAE,KAAK,GAAG,EAAE,KAAK,EAAE,MAAM,CAAC,IAAI;CACvC;CACA,MAAM,OAAO,UAAU;EACrB,MAAM,QAAS,MAAiB,MAAM,EAAE,SAAS;EACjD,IAAI,EAAE,UAAU,KAAA,KAAa,MAAM,UAAU,EAAE,OAAO,OAAO,GAAG,KAAK;EACrE,OAAO,GAAG,CAAC,GAAG,MAAM,MAAM,GAAG,EAAE,QAAQ,CAAC,GAAG,MAAM,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;CACxF;AACF,CAAC;;AAGD,MAAa,OAAO,SAAS;CAC3B,MAAM;CACN,QAAQA,UAAO,EAAE,WAAW,EAAE,OAAO,EAAE,CAAC;CACxC,OAAO;CACP,UAAU;CACV,YAAY,UAAU;EACpB,IAAI,MAAM,SAAS,UAAU,UAAU,MAAM,EAAE,CAAC,CAAC,SAAS,UACxD,OAAO,IAAI,kCAAkC,KAAK,KAAK,GAAG;EAE5D,OAAO,GAAG,EAAE,MAAM;CACpB;CACA,MAAM,OAAO,UACX,GAAI,MAAqC,QAAQ,MAAM,MAAM,IAAI,CAAC,CAAC,KAAK,EAAE,SAAS,CAAC;AACxF,CAAC;AAED,MAAM,yBAAS,IAAI,IAAI;CAAC;CAAU;CAAU;AAAS,CAAC;;AAGtD,MAAa,SAAS,SAAS;CAC7B,MAAM;CACN,QAAQA,UAAO,EAAE,WAAW,EAAE,OAAO,CAAC,CAAC,SAAS,EAAE,CAAC;CACnD,OAAO;CACP,UAAU;CACV,YAAY,UAAU;EACpB,IAAI,MAAM,SAAS,WAAW,CAAC,MAAM,GAAG,OAAO,MAAM,OAAO,IAAI,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,GAChF,OAAO,IAAI,+DAA+D,KAAK,KAAK,GAAG;EAEzF,OAAO,GAAG,EAAE,MAAM;CACpB;CACA,MAAM,OAAO,UACX,GACG,MACE,QAAQ,MAAM,MAAM,IAAI,CAAC,CACzB,KAAK,MAAM,OAAO,CAA8B,CAAC,CAAC,CAClD,KAAK,EAAE,aAAa,EAAE,CAC3B;AACJ,CAAC;;AAGD,MAAa,OAAO,SAAS;CAC3B,MAAM;CACN,QAAQA,UAAO,EAAE,WAAW,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;CAC1D,OAAO;CACP,UAAU;CACV,WAAW,SAAS,MAAM;CAC1B,MAAM,MAAM;EACV,MAAM,MAAM,EAAE,aAAa;EAC3B,QAAQ,UACN,GACG,MACE,UAAU,MAAM,CAAC,CACjB,QAAQ,UAAU,EAAE,CAAC,CACrB,YAAY,CAAC,CACb,MAAM,YAAY,CAAC,CACnB,QAAQ,MAAM,MAAM,EAAE,CAAC,CACvB,KAAK,GAAG,CACb;CACJ;AACF,CAAC;;;;;;;;;ACxMD,MAAM,OAAO,EAAE,aAAa,EAAE,MAAM,EAAE,QAAQ,IAAI,EAAE,CAAC;AACrD,MAAM,SAAS,EAAE,MAAM;CAAC,EAAE,OAAO;CAAG,EAAE,OAAO;CAAG,EAAE,QAAQ;CAAG,EAAE,KAAK;CAAG,EAAE,MAAM,IAAI;AAAC,CAAC;AACrF,MAAM,SAAS,EAAE,MAAM,CAAC,MAAM,MAAM,CAAC;AAIrC,MAAM,UAAU,MACd,OAAO,MAAM,YAAY,MAAM,QAAQ,CAAC,MAAM,QAAQ,CAAC;;;;ACQzD,MAAMG,QAAM;CACV;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACAC;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CDzCkB,SAAS;EAC3B,MAAM;EACN,QAAQF,UAAO;GACb,OAAO,EAAE,MAAM,EAAE,aAAa;IAAE,MAAM,EAAE,QAAQ;IAAG,MAAM;GAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;GACzE,MAAM,OAAO,SAAS;EACxB,CAAC;EACD,OAAO;EACP,OAAO;EACP,UAAU;EACV,YAAY,OAAO,GAAG,QAA+B;GACnD,MAAM,QAAQ,MAAM,SAAS;GAC7B,MAAM,WAAW,CAAC,GAAG,EAAE,MAAM,KAAK,MAAM,EAAE,IAAI,GAAG,GAAI,EAAE,SAAS,KAAA,IAAY,CAAC,IAAI,CAAC,EAAE,IAAI,CAAE;GAC1F,IAAI,SAAS,EAAE,SAAS,KAAA,GAAW,OAAO,IAAI,0CAAwC;GACtF,IAAI,SAAS,SAAS,KAAK,MAAM,GAAG,OAAO,IAAI,6CAA6C;GAC5F,KAAK,MAAM,CAAC,GAAG,MAAM,EAAE,MAAM,QAAQ,GAAG;IACtC,MAAM,OAAO,iBAAiB,EAAE,MAAM,KAAK,KAAK;IAChD,IAAI,CAAC,KAAK,IAAI,OAAO,IAAI,QAAQ,EAAE,IAAI,KAAK,OAAO;GACrD;GACA,MAAM,QAAQ,SAAS,KAAK,MAAO,OAAO,CAAC,IAAI,QAAQ,WAAW,CAAC,CAAE;GACrE,IAAI,EAAE,SAAS,KAAA,GAAW,MAAM,KAAK,KAAK;GAC1C,MAAM,MAAM,SAAS,KAAK;GAC1B,OAAO,IAAI,KAAK,MAAM,IAAI,2BAA2B,MAAM,IAAI,IAAI,CAAC,CAAC,KAAK,IAAI,GAAG;EACnF;EACA,MAAM,GAAG,KAAK,UAAU;GACtB,MAAM,QAAQ,EAAE,MAAM,KAAK,OAAO;IAChC,MAAM,SAAS,iBAAiB,EAAE,MAAM,KAAK,KAAK,CAAC;IACnD,MAAM,EAAE;GACV,EAAE;GACF,MAAM,YAAY,EAAE,QAAQ,EAAE,MAAM,KAAc;GAClD,MAAM,WAAW,GAAW,MAAiB,OAAO,CAAC,IAAI,IAAK;GAC9D,QAAQ,GAAG,QAAQ;IACjB,KAAK,MAAM,KAAK,OAAO,IAAI,EAAE,KAAK,GAAG,IAAI,QAAQ,GAAG,GAAG,OAAO,GAAG,QAAQ,EAAE,MAAM,CAAC,CAAC;IACnF,OAAO,GAAG,QAAQ,WAAW,CAAC,CAAC;GACjC;EACF;CACF,CCOE;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AACF;AAEA,MAAa,aAAuD,OAAO,YACzEC,MAAI,KAAK,OAAO,CAAC,GAAG,MAAM,EAA+B,CAAC,CAC5D;;;;;;;;;;;;;ACjEA,MAAM,eAAe;CAAC;CAAS;CAAU;CAAQ;AAAS;AAC1D,MAAM,mBAAmB,IAAI,IAC3B,WAAW,QAAQ,MAAM,CAAC;CAAC;CAAO;CAAO;AAAK,CAAC,CAAC,SAAS,CAAC,CAAC,CAC7D;;AAKA,SAAgB,WAAW,KAAyC;CAClE,MAAM,IAAI,YAAY,KAAK,IAAI,EAAE;CACjC,IAAI,CAAC,GAAG,OAAO,GAAG,GAAG;CACrB,MAAM,YAAY,EAAE;CACpB,IAAI,CAAC,iBAAiB,IAAI,SAAS,GAAG,OAAO,IAAI,eAAe,IAAI,GAAG,EAAE;CACzE,MAAM,EAAE,IAAI,KAAK,MAAM,MAAM,WAAW,MAAM,GAAG,SAAS;CAC1D,IAAI,EAAE,UAAU,MAAM,OAAO,IAAI,GAAG,IAAI,GAAG,cAAc;CAEzD,MAAM,QAAQ,OAAO,KAAK,IAAI,CAAC,CAAC,QAAQ,MAAM,CAAE,aAAmC,SAAS,CAAC,CAAC;CAC9F,IAAI,MAAM,QAAQ,OAAO,IAAI,GAAG,IAAI,GAAG,iBAAiB,MAAM,KAAK,IAAI,GAAG;CAC1E,MAAM,QAAQ,aAAa,QAAQ,MAAM,KAAK,IAAI;CAClD,MAAM,WAAW,cAAc,aAAa,cAAc;CAC1D,IAAI,WAAW,MAAM,SAAS,IAAI,MAAM,WAAW,GACjD,OAAO,IACL,WACI,GAAG,IAAI,GAAG,8BACV,GAAG,IAAI,GAAG,wBAAwB,aAAa,KAAK,IAAI,GAC9D;CAEF,MAAM,UAAU,WAAW,OAAO,KAAK,MAAM;CAE7C,OAAO,GAAG;EACR,IAAI;EACJ,OAAO,CAAC;GAAE;IAHG,GAAI,SAAS,KAAA,IAAY,CAAC,IAAI,EAAE,KAAK;KAAK,YAAY;GAGzD;GAAM;EAAK,CAAC;EACtB,GAAI,cAAc,KAAA,IAAY,CAAC,IAAI,EAAE,MAAM,UAAU;CACvD,CAAC;AACH;AAEA,MAAM,eAAe,EAAE,aAAa;CAClC,IAAI,EAAE,QAAQ,eAAe;CAC7B,QAAQ,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;CACxB,IAAI,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;CACpB,OAAO,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,IAAI;CACrC,SAAS,EAAE,KAAK;EAAC;EAAQ;EAAQ;CAAO,CAAC,CAAC,CAAC,SAAS;AACtD,CAAC;AAED,MAAM,UAAU,MACd,OAAO,MAAM,YAAY,MAAM,QAAQ,OAAQ,EAAe,OAAO;;AAGvE,SAAS,eACP,OACA,QACA,OACW;CACX,OAAO,MAAM,KAAK,MAAM,MAAM;EAC5B,IAAI,CAAC,OAAO,IAAI,GAAG,OAAO;EAC1B,IAAI,UAAU,KAAK,OAAO,iBAAiB;GACzC,MAAM,4CAA4C,CAAC;GACnD,OAAO;EACT;EACA,IAAI,KAAK,OAAO,UAAU,MAAM,QAAQ,KAAK,QAAQ,GACnD,OAAO;GACL,GAAG;GACH,UAAU,eAAe,KAAK,UAAU,OAAO,MAAM,MAAM,SAAS,KAAK,CAAC,CAAC;EAC7E;EAEF,MAAM,WAAW,WAAW,IAAI;EAChC,IAAI,SAAS,IAAI,OAAO,SAAS;EACjC,MAAM,SAAS,OAAO,CAAC;EACvB,OAAO;CACT,CAAC;AACH;;AAQA,SAAS,eACP,MACA,KACA,SACA,QACS;CACT,MAAM,YAAwB,CAAC;CAC/B,IAAI,QAAQ,KAAK;CACjB,MAAM,OAAO,MAAM,QAAQ,KAAK,IAAI,IAAI,CAAC,GAAI,KAAK,IAAiB,IAAI,CAAC;CACxE,IAAI,IAAI;CACR,MAAM,SAAU,KAAK,OAAqB,KAAK,QAAQ;EACrD,MAAM,IAAI;EACV,IAAI,OAAO,MAAM,YAAY,MAAM,QAAQ,CAAC,MAAM,QAAQ,EAAE,QAAQ,GAAG,OAAO;EAC9E,MAAM,MAAM,OAAO,EAAE,GAAG;EACxB,MAAM,SAAS,SAAiB,SAC9B,OAAO,KAAK;GAAE,MAAM;GAAkB;GAAS,MAAM,KAAK;GAAI,OAAO;GAAK;EAAK,CAAC;EAClF,MAAM,WAAW,eAAe,EAAE,UAAU,OAAO,KAAK;EACxD,MAAM,KAAK,SAAS,WAAW,MAAM,OAAO,CAAC,KAAK,EAAE,OAAO,eAAe;EAC1E,IAAI,KAAK,GAAG,OAAO;GAAE,GAAG;GAAG;EAAS;EACpC,IAAI,SAAS,eAAe,MAAM,OAAO,CAAC,KAAK,EAAE,OAAO,eAAe,MAAM,IAAI;GAC/E,MAAM,0EAA0E,EAAE;GAClF,OAAO;IAAE,GAAG;IAAG;GAAS;EAC1B;EACA,MAAM,SAAS,aAAa,UAAU,SAAS,GAAG;EAClD,IAAI,CAAC,OAAO,SAAS;GACnB,MACE,kBAAkB,OAAO,MAAM,OAAO,KAAK,MAAM,GAAG,EAAE,KAAK,KAAK,GAAG,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,KAAK,IAAI,KAC/F,EACF;GACA,OAAO;IAAE,GAAG;IAAG;GAAS;EAC1B;EACA,IAAI,OAAO,GAAG;GACZ,MAAM,+CAA+C,EAAE;GACvD,OAAO;IAAE,GAAG;IAAG;GAAS;EAC1B;EACA,MAAM,EAAE,QAAQ,IAAI,OAAO,SAAS,WAAW,OAAO;EACtD,IAAI,CAAC,IAAI,QAAQ,SAAS,MAAM,MAAM,EAAE,SAAS,MAAM,GAAG;GACxD,MAAM,kCAAkC,OAAO,IAAI,EAAE;GACrD,OAAO;IAAE,GAAG;IAAG;GAAS;EAC1B;EACA,KAAK;EACL,MAAM,SAAS,SAAS,MAAM,GAAG,EAAE;EACnC,MAAM,OAAO,OAAO;EACpB,IAAI;EACJ,IAAI,OAAO,WAAW,KAAK,KAAK,OAAO,aAAa,OAAO,KAAK,SAAS,UACvE,WAAW,KAAK;OACX;GAEL,WAAW,KAAK,IAAI;GACpB,MAAM,SAAmB;IACvB,IAAI,GAAG,KAAK,GAAG,OAAO;IACtB,IAAI;IACJ,IAAI;IACJ,MAAM;IACN,QAAQ,CAAC;KAAE,KAAK;KAAU,UAAU;IAAO,CAAC;IAC5C,GAAI,KAAK,aAAa,KAAA,IAAY,CAAC,IAAI,EAAE,UAAU,KAAK,SAAS;GACnE;GACA,UAAU,KAAK,MAAM;GACrB,QAAQ,OAAO;GACf,KAAK,KAAK,QAAQ;EACpB;EACA,MAAM,SAAS,cAAc;EAC7B,IAAI,CAAC,QAAQ,IAAI,MAAM,GAAG;GACxB,QAAQ,IAAI,MAAM;GAClB,UAAU,KAAK;IAAE,IAAI;IAAQ,IAAI;IAAU,QAAQ;IAAY;GAAO,CAAC;EACzE;EACA,MAAM,aAAa,KAAK,IAAI;EAC5B,MAAM,OAAiB;GACrB,IAAI,GAAG,KAAK,GAAG,UAAU;GACzB,IAAI;GACJ,MAAM;GACN,OAAO;GACP,IAAI,CAAC,CAAC,UAAU,EAAE,CAAC;GACnB,MAAM;GACN,aAAa;GACb,QAAQ,GAAG,QAAQ,WAAW;GAC9B,gBAAgB;EAClB;EACA,UAAU,KAAK,IAAI;EACnB,QAAQ,KAAK;EACb,KAAK,KAAK,UAAU;EACpB,MAAM,OACJ,WAAW,SACP,CAAC;GAAE,IAAI;GAAY,OAAO,CAAC,YAAY,QAAQ;EAAE,CAAC,IAClD,WAAW,UACT,CACE;GAAE,IAAI;GAAW,MAAM;EAAW,GAClC;GAAE,IAAI;GAAW,SAAS,MAAM,OAAO,QAAQ,GAAG;EAAmB,CACvE,IACA,CAAC;GAAE,IAAI;GAAW,MAAM;EAAW,CAAC;EAC5C,OAAO;GAAE,GAAG;GAAG,UAAU,CAAC,GAAG,MAAM,GAAG,SAAS,MAAM,KAAK,CAAC,CAAC;EAAE;CAChE,CAAC;CACD,IAAI,MAAM,GAAG,OAAO;EAAE;EAAW,MAAM;GAAE,GAAG;GAAM;EAAO;CAAE;CAC3D,MAAM,UAAU,KAAK,SAAS;CAC9B,OAAO;EACL;EACA,MAAM;GAAE,GAAG;GAAM,IAAI;GAAO;GAAQ,GAAI,UAAU,EAAE,KAAK,IAAI,CAAC;EAAG;CACnE;AACF;;;;;;AAOA,SAAgB,iBACd,SACA,KACqD;CACrD,MAAM,SAAyB,CAAC;CAChC,MAAM,UAAU,IAAI,IAAI,QAAQ,MAAM,QAAQ,MAAM,EAAE,OAAO,QAAQ,CAAC,CAAC,KAAK,MAAM,EAAE,EAAE,CAAC;CACvF,MAAM,QAAoB,CAAC;CAC3B,KAAK,MAAM,QAAQ,QAAQ,OAAO;EAChC,IAAI,KAAK,OAAO,SAAS,CAAC,MAAM,QAAQ,KAAK,MAAM,GAAG;GACpD,MAAM,KAAK,IAAI;GACf;EACF;EACA,MAAM,UAAU,eAAe,MAAM,KAAK,SAAS,MAAM;EACzD,MAAM,KAAK,GAAG,QAAQ,WAAW,QAAQ,IAAI;CAC/C;CACA,MAAM,iBAAiB,EAAE,GAAG,QAAQ,eAAe;CACnD,KAAK,MAAM,QAAQ,OAAO;EACxB,IAAI,KAAK,OAAO,YAAY,KAAK,WAAW,cAAc,eAAe,KAAK,KAAK;EACnF,MAAM,SAAS,IAAI,QAAQ,SAAS,MAAM,MAAM,EAAE,SAAS,KAAK,MAAM;EACtE,IAAI,QAAQ,eAAe,KAAK,MAAM,iBAAiB,MAAM;CAC/D;CACA,OAAO;EAAE,SAAS;GAAE,GAAG;GAAS;GAAO;EAAe;EAAG;CAAO;AAClE;;;AC9LA,MAAM,cAAc,GAAG,IAAI;;AAG3B,SAAgB,aACd,KACA,KACA,QAAe,EAAE,MACoB;CACrC,IAAI,IAAI,WAAW,GAAG,OAAO,IAAI;EAAE,MAAM;EAAG,SAAS;CAAqC,CAAC;CAE3F,IAAI,OAAO;CACX,IAAI,WAAW;CACf,IAAI,YAAY;CAChB,MAAM,QAAgB,CAAC;CACvB,MAAM,QAAkB,CAAC;CAEzB,KAAK,MAAM,CAAC,GAAG,UAAU,IAAI,QAAQ,GAAG;EACtC,MAAM,SAAS,YAAoB,IAAI;GAAE,MAAM;GAAG;EAAQ,CAAC;EAC3D,IAAI,OAAO,UAAU,YAAY,UAAU,QAAQ,OAAQ,MAAmB,OAAO,UACnF,OAAO,MAAM,oCAAkC;EAEjD,MAAM,WAAW,WAAW,KAAiB;EAC7C,IAAI,CAAC,SAAS,IAAI,OAAO,MAAM,SAAS,KAAK;EAC7C,MAAM,EAAE,IAAI,GAAG,SAAS,SAAS;EACjC,MAAM,MAAM,OAAO,OAAO,YAAY,EAAE,IAAI,WAAW,MAAM,KAAA;EAC7D,IAAI,CAAC,KAAK,OAAO,MAAM,eAAe,GAAG,EAAE;EAC3C,IAAI,WAAW,OAAO,MAAM,GAAG,MAAM,GAAG,EAAE,EAAE,uBAAuB;EAEnE,MAAM,SAAS,IAAI,OAAO,UAAU,IAAI;EACxC,IAAI,CAAC,OAAO,SACV,OAAO,MACL,GAAG,GAAG,IAAI,OAAO,MAAM,OAAO,KAAK,MAAM,GAAG,EAAE,KAAK,SAAS,GAAG,EAAE,KAAK,KAAK,GAAG,EAAE,MAAM,KAAK,EAAE,SAAS,CAAC,CAAC,KAAK,IAAI,GACnH;EAGF,MAAM,OAAO,IAAI,SAAS;EAC1B,IAAI,SAAS,UAAU,KAAK,SAAS,QACnC,OAAO,MAAM,GAAG,GAAG,kDAAkD;EAEvE,IAAI,SAAS,WAAW,KAAK,SAAS,QACpC,OAAO,MAAM,GAAG,GAAG,0EAA0E;EAI/F,MAAM,YAAY,IAAI,UAAU;EAChC,MAAM,SAAS,aAAa,UAAU,IAAI;EAC1C,MAAM,QAAQ,YAAY,UAAU,IAAI,IAAI;EAC5C,IAAI,MAAM,SAAS,SAAS,OAAO,MAAM,GAAG,GAAG,mCAAmC;EAElF,MAAM,MAAM,IAAI,UAAU,OAAO,OAAO,MAAM,GAAG;EACjD,IAAI,CAAC,IAAI,IAAI,OAAO,MAAM,IAAI,KAAK;EAEnC,MAAM,QAAQ,IAAI,IAAI,OAAO,MAAM,KAAK,KAAK;EAC7C,MAAM,KAAK,UAAU,GAAG,QAAS,MAAM,OAAO,cAAc,MAAM,GAAG,GAAG,IAAK,KAAK;EAClF,MAAM,KAAK,EAAE;EACb,OAAO,SAAS,EAAE,SAAS,IAAI,KAAK,IAAI,IAAI;EAC5C,aAAa,IAAI,SAAS,OAAO,MAAM,KAAK,KAAK;EACjD,YAAY,IAAI,aAAa;CAC/B;CAEA,OAAO,GAAG;EACR;EACA;EACA;EACA,MAAM,OAAO,QAAQ;GACnB,IAAI,IAAmB;GACvB,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;IACrC,MAAM,IAAK,MAAM,EAAE,CAAU,GAAU,GAAG;IAC1C,IAAI,CAAC,EAAE,IAAI,OAAO,IAAI;KAAE,GAAG,EAAE;KAAO,MAAM;KAAG,IAAI,MAAM;IAAa,CAAC;IACrE,IAAI,EAAE;GACR;GACA,OAAO,GAAG,CAAC;EACb;CACF,CAAC;AACH;;;;;;;;;;;;;ACxFA,MAAM,QAAQ,EAAE,aAAa;CAAE,KAAK,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;CAAG,UAAU,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC;AAAE,CAAC;AAE9F,MAAME,WAAS,EAAE,aAAa;CAC5B,IAAI;CACJ,QAAQ,EAAE,MAAM,KAAK,CAAC,CAAC,IAAI,CAAC;CAC5B,MAAM,EAAE,KAAK,CAAC,QAAQ,KAAK,CAAC,CAAC,CAAC,SAAS;CACvC,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,SAAS;CAC1C,UAAU,QAAQ,SAAS;AAC7B,CAAC;AAED,MAAM,UAAU;AAEhB,MAAa,UAAU,WAAW;CAChC,IAAI;CACJ,OAAO;CACP,UAAU;CACV,aAAa;CACb,OAAO,CAAC;EAAE,IAAI;EAAM,OAAO;EAAM,MAAM,CAAC,IAAI;CAAE,CAAC;CAC/C,QAAQ;CACR,iBAAiB;EAAE,IAAI;EAAI,QAAQ,CAAC;CAAE;CACtC,QAAA;CACA,UAAU,GAAG,QAAQ;EACnB,MAAM,QAAQ,IAAI,MAAM,EAAE,EAAE;EAC5B,MAAM,OAAO,IAAI,UAAU,MAAM,IAAI;EACrC,MAAM,SAAS,EAAE,YAAY,IAAI,QAAQ,WAAW;EACpD,MAAM,SAAsB,CAAC;EAE7B,MAAM,OAAO,IAAI,IAAI,EAAE,QAAQ,CAAC,CAAC;EACjC,IAAI,KAAK,OAAO,KAAK,EAAE,SAAS,OAC9B,OAAO,KAAK,EAAE,SAAS,uCAAqC,CAAC;EAC/D,KAAK,MAAM,QAAQ,MACjB,IAAI,CAAC,OAAO,OAAO,MAAM,KAAK,QAAQ,IAAI,GACxC,OAAO,KAAK,EAAE,SAAS,wBAAwB,KAAK,GAAG,CAAC;EAE5D,MAAM,OAAO,EAAE,SAAS,QAAQ,OAAO,KAAK,MAAM,KAAK,MAAM,CAAC,CAAC,QAAQ,MAAM,CAAC,KAAK,IAAI,CAAC,CAAC,IAAI,CAAC;EAE9F,MAAM,uBAAO,IAAI,IAAY;EAC7B,MAAM,WAA0D,CAAC;EACjE,KAAK,MAAM,KAAK,EAAE,QAAQ;GACxB,IAAI,KAAK,IAAI,EAAE,GAAG,GAChB,OAAO,KAAK;IAAE,SAAS,UAAU,EAAE,IAAI;IAAqB,OAAO,EAAE;GAAI,CAAC;GAC5E,KAAK,IAAI,EAAE,GAAG;GACd,MAAM,IAAI,aAAa,EAAE,UAAU,IAAI;GACvC,IAAI,EAAE,IAAI,SAAS,KAAK;IAAE,KAAK,EAAE;IAAK,UAAU,EAAE;GAAM,CAAC;QACpD,OAAO,KAAK;IAAE,SAAS,EAAE,MAAM;IAAS,OAAO,EAAE;IAAK,MAAM,EAAE,MAAM;GAAK,CAAC;EACjF;EACA,IAAI,OAAO,QAAQ,OAAO;GAAE,IAAI;GAAO,OAAO;EAAO;EAErD,MAAM,SAAgC,CAAC;EACvC,MAAM,UAAkC,CAAC;EACzC,KAAK,MAAM,QAAQ,MAAM;GACvB,OAAO,QAAQ,MAAM,KAAK,OAAO;GACjC,QAAQ,QAAQ,MAAM,QAAQ;EAChC;EACA,KAAK,MAAM,EAAE,KAAK,cAAc,UAAU;GACxC,MAAM,OAAO,SAAS,aAAa,WAAW,UAAU,WAAW;GACnE,MAAM,YAAY,SAAS,aAAc,SAAS,YAAY,WAAW;GACzE,OAAO,OAAO,OAAO,EAAE,SAAS,SAAS,IAAI,IAAI,SAAS;GAC1D,QAAQ,OAAO;IACb,MAAM,IAAI;IACV,OAAO;IACP;IACA,GAAI,YACA,EAAE,SAAS,SAAS,YAAY,UAAU,SAAS,IAAI,IAAI,SAAS,KAAK,IACzE,CAAC;GACP;EACF;EAEA,OAAO,GAAG;GACR,QAAQ;IACN,MAAM,EAAE,OAAO,MAAM;IACrB;IACA,SAAS,WAAW,iBAAiB,SAAS,MAAM,MAAM,EAAE,SAAS,QAAQ;GAC/E;GACA,MAAM,QAAQ,QAAQ;IACpB,MAAM,yBAAS,IAAI,IAGjB;IACF,MAAM,OAAc,CAAC;IACrB,IAAI,UAAU;IACd,KAAK,MAAM,UAAU,OAAO,EAAE,EAAE,GAAG;KACjC,MAAM,KAAK;MAAE,GAAG;MAAK;KAAO;KAC5B,MAAM,MAA2B,CAAC;KAClC,KAAK,MAAM,QAAQ,MAAM,IAAI,OAAO,OAAO,QAAQ,IAAI,GAAG,IAAI,QAAQ,OAAO;KAC7E,IAAI,OAAO;KACX,KAAK,MAAM,EAAE,KAAK,cAAc,UAAU;MACxC,MAAM,IAAI,SAAS,IAAI,MAAM,EAAE;MAC/B,IAAI,EAAE,IAAI;OACR,IAAI,EAAE,UAAU,MAAM,OAAO,IAAI;YAC5B,IAAI,OAAO,EAAE;OAClB;MACF;MACA,MAAM,SAAS,QAAQ,EAAE,MAAM,KAAK,GAAG,EAAE,MAAM,GAAG,IAAI,EAAE,MAAM;MAC9D,IAAI,WAAW,aACb,OAAO,IAAI;OAAE,MAAM,EAAE,MAAM;OAAM,SAAS,GAAG,IAAI,GAAG;OAAU,MAAM;MAAK,CAAC;MAE5E,MAAM,IAAI,GAAG,IAAI,QAAQ,EAAE,MAAM;MACjC,MAAM,IAAI,OAAO,IAAI,CAAC,KAAK;OAAE,OAAO;OAAK,MAAM,EAAE,MAAM;OAAM,OAAO;OAAG,SAAS,CAAC;MAAE;MACnF,EAAE,SAAS;MACX,IAAI,EAAE,QAAQ,SAAS,SAAS,EAAE,QAAQ,KAAK,MAAM;MACrD,OAAO,IAAI,GAAG,CAAC;MACf,IAAI,WAAW,QAAQ,IAAI,OAAO;WAC7B,IAAI,WAAW,cAAc,OAAO,IAAI;WACxC;OACH,OAAO;OACP;MACF;KACF;KACA,IAAI,MAAM,WAAW;UAChB,KAAK,KAAK,GAAG;IACpB;IACA,MAAM,SAAqB,CAAC,GAAG,OAAO,OAAO,CAAC,CAAC,CAAC,KAAK,OAAO;KAC1D,MAAM,IAAI;KACV,MAAM,EAAE;KACR,OAAO,EAAE;KACT,SAAS,GAAG,EAAE,MAAM,IAAI,EAAE,MAAM,mBAAmB,OAAO;KAC1D,OAAO,EAAE;KACT,SAAS,EAAE;IACb,EAAE;IACF,OAAO,GAAG;KAAE;KAAM;KAAS;IAAO,CAAC;GACrC;EACF,CAAC;CACH;AACF,CAAC;;;;;;;;;;;;AC/HD,MAAMC,WAAS,EAAE,aAAa;CAC5B,IAAI;CACJ,MAAM,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;CACtB,UAAU,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS;AACvD,CAAC;;AAGD,MAAM,QAAQ;AAEd,MAAa,cAAc,WAAW;CACpC,IAAI;CACJ,OAAO;CACP,UAAU;CACV,aAAa;CACb,OAAO,CAAC;EAAE,IAAI;EAAM,OAAO;EAAM,MAAM,CAAC,IAAI;CAAE,CAAC;CAC/C,QAAQ;CACR,QAAQ;CACR,iBAAiB;EAAE,IAAI;EAAI,MAAM;CAAG;CACpC,QAAA;CACA,UAAU,GAAG,QAAQ;EACnB,MAAM,QAAQ,IAAI,MAAM,EAAE,EAAE;EAC5B,MAAM,KAAK,EAAE;EACb,IAAI,CAAC,IACH,OAAO,GAAG;GACR,QAAQ;GACR,MAAM,WAAW;IACf,MAAM,OAAO,YAAY,OAAO,EAAE,EAAE,GAAG,CAAC,CAAC;IACzC,OAAO,GAAG;KAAE;KAAM,QAAQ,OAAO,IAAI,IAAI,EAAE,MAAM,IAAI;IAAE,CAAC;GAC1D;EACF,CAAC;EAEH,MAAM,UAAU,GAAG,QAAQ,MAAM,CAAC,OAAO,OAAO,MAAM,KAAK,QAAQ,CAAC,CAAC;EACrE,IAAI,QAAQ,QAAQ,OAAO,KAAK,6BAA6B,QAAQ,KAAK,IAAI,GAAG;EACjF,IAAI,GAAG,SAAS,KAAK,GAAG,OAAO,KAAK,cAAc,MAAM,sCAAsC;EAC9F,MAAM,SAAgC,OAAO,YAC3C,GAAG,KAAK,MAAM,CAAC,GAAG,MAAM,KAAK,OAAO,EAAW,CAAC,CAClD;EACA,MAAM,OAAO,EAAE,OAAO;GAAE,GAAG;IAAS,QAAQ,EAAE;EAAO,CAAC;EACtD,OAAO,GAAG;GACR,QAAQ;IACN;IACA,SAAS;KACP,GAAG,WAAW,IAAI,IAAI,IAAI;KAC1B,GAAG,OAAO,YAAY,GAAG,KAAK,MAAM,CAAC,GAAG,MAAM,QAAQ,EAAY,CAAC,CAAC;IACtE;GACF;GACA,MAAM,WAAW;IACf,MAAM,yBAAS,IAAI,IAAuC;IAC1D,KAAK,MAAM,OAAO,OAAO,EAAE,EAAE,GAAG;KAC9B,MAAM,IAAI,MAAM,KAAK,EAAE;KACvB,MAAM,QAAQ,OAAO,IAAI,CAAC;KAC1B,IAAI,OAAO,MAAM,KAAK;UACjB,OAAO,IAAI,GAAG;MAAE,OAAO;MAAK,GAAG;KAAE,CAAC;IACzC;IAKA,MAAM,OAAO,YAJG,CAAC,GAAG,OAAO,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,OAAO,SAAS;KAC1D,GAAG,OAAO,YAAY,GAAG,KAAK,MAAM,CAAC,GAAG,MAAM,MAAM,IAAI,CAAC,CAAC;MACzD,QAAQ;IACX,EACyB,GAAS,EAAE;IACpC,OAAO,GAAG;KAAE;KAAM,QAAQ,OAAO,IAAI,IAAI,EAAE,MAAM,IAAI;IAAE,CAAC;GAC1D;EACF,CAAC;CACH;AACF,CAAC;AAED,SAAS,OAAO,MAAc,MAAc,MAAsB;CAChE,OAAO;EAAE;EAAM;EAAM,MAAM,KAAK,KAAK,MAAM,OAAO,CAAC,CAAyB;CAAE;AAChF;;;;;;;;;;;;;;;;;;;;;;;;ACpCA,MAAMC,WAAS,EAAE,aAAa;CAC5B,IAAI;CACJ,QAAQ,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;CACxB,KAAK,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;CACrC,SAAS,EAAE,OAAO,EAAE,OAAO,GAAG,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,SAAS;CAC1D,OAAO,EAAE,OAAO,EAAE,OAAO,GAAG,EAAE,KAAK;EAAC;EAAa;EAAgB;CAAO,CAAC,CAAC,CAAC,CAAC,SAAS;CACrF,MAAM,EAAE,OAAO,EAAE,OAAO,GAAG,EAAE,aAAa,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS;CAC/F,MAAM,EAAE,KAAK,CAAC,UAAU,SAAS,CAAC,CAAC,CAAC,SAAS;AAC/C,CAAC;;AASD,SAAgB,cACd,SACA,QACA,MAC0B;CAC1B,MAAM,MAAM,KAAK,QAAQ,GAAG;CAC5B,MAAM,CAAC,YAAY,aACjB,MAAM,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,KAAK,MAAM,GAAG,GAAG,GAAG,KAAK,MAAM,MAAM,CAAC,CAAC;CACrE,MAAM,SAAS,QAAQ,SAAS,MAAM,MAAM,EAAE,SAAS,UAAU;CACjE,IAAI,CAAC,QAAQ,OAAO,IAAI,yBAAyB,WAAW,EAAE;CAC9D,MAAM,QAAQ,OAAO,OAAO,MAAM,MAAM,EAAE,SAAS,SAAS;CAC5D,IAAI,CAAC,OAAO,OAAO,IAAI,GAAG,WAAW,iBAAiB,UAAU,EAAE;CAClE,OAAO,GAAG;EAAE;EAAQ;EAAO,MAAM,WAAW,gBAAgB,MAAM,WAAW,GAAG,MAAM,QAAQ;CAAE,CAAC;AACnG;;;;;AAMA,SAAgB,QACd,SACA,OACA,IACiD;CACjD,IAAI,CAAC,MAAM,YAAY,OAAO,IAAI,GAAG,MAAM,KAAK,oBAAoB;CACpE,MAAM,SAAS,QAAQ,SAAS,MAAM,MAAM,EAAE,SAAS,MAAM,UAAU;CACvE,IAAI,CAAC,QAAQ,OAAO,IAAI,yBAAyB,MAAM,WAAW,EAAE;CACpE,MAAM,QAAiB,CAAC;CACxB,KAAK,MAAM,QAAQ,IAAI;EACrB,MAAM,OAAO,OAAO,OAAO,MAAM,MAAM,EAAE,SAAS,IAAI;EACtD,IAAI,CAAC,MAAM,OAAO,IAAI,GAAG,OAAO,KAAK,iBAAiB,KAAK,EAAE;EAC7D,MAAM,KAAK,WAAW,gBAAgB,KAAK,WAAW,GAAG,KAAK,QAAQ,CAAC;CACzE;CACA,MAAM,QAAQ,MAAM,WAAW,IAAI,UAAU,MAAM,EAAW,IAAI,EAAE,MAAM,KAAK;CAC/E,OAAO,GAAG;EAAE,QAAQ,OAAO;EAAM,MAAM,WAAW,OAAO,MAAM,QAAQ;CAAE,CAAC;AAC5E;;AAGA,MAAM,cAAc,EAAE,QAAQ,YAC5B,MAAM,YAAY,OAAO,qBAAqB,QAAQ,OAAO,SAAS,SAAS,MAAM,IAAI;AAE3F,MAAa,WAAW,WAAW;CACjC,IAAI;CACJ,OAAO;CACP,UAAU;CACV,aAAa;CACb,OAAO,CAAC;EAAE,IAAI;EAAM,OAAO;EAAM,MAAM,CAAC,IAAI;CAAE,CAAC;CAC/C,QAAQ;CACR,QAAQ;CACR,iBAAiB;EAAE,IAAI;EAAI,QAAQ;EAAI,KAAK,CAAC;CAAE;CAC/C,QAAA;CACA,UAAU,GAAG,QAAQ;EACnB,MAAM,QAAQ,IAAI,MAAM,EAAE,EAAE;EAC5B,MAAM,SAAsB,CAAC;EAC7B,MAAM,UAAU,IAAI,MAAM;EAC1B,IAAI,CAAC,QAAQ,SAAS,MAAM,MAAM,EAAE,SAAS,EAAE,MAAM,GACnD,OAAO;GAAE,IAAI;GAAO,OAAO,CAAC,EAAE,SAAS,yBAAyB,EAAE,OAAO,GAAG,CAAC;EAAE;EAEjF,MAAM,aAAa,OAAO,KAAK,MAAM,KAAK,MAAM;EAChD,KAAK,MAAM,QAAQ;GACjB,GAAG,OAAO,KAAK,EAAE,WAAW,CAAC,CAAC;GAC9B,GAAG,OAAO,KAAK,EAAE,SAAS,CAAC,CAAC;GAC5B,GAAG,OAAO,KAAK,EAAE,QAAQ,CAAC,CAAC;EAC7B,GACE,IAAI,CAAC,WAAW,SAAS,IAAI,GAC3B,OAAO,KAAK,EAAE,SAAS,IAAI,KAAK,sBAAsB,EAAE,KAAK,CAAC;EAGlE,MAAM,QAAgC,CAAC;EACvC,MAAM,UAAsD,CAAC;EAC7D,MAAM,aAAuC,CAAC;EAC9C,MAAM,OAAgC,CAAC;EACvC,MAAM,2BAAW,IAAI,IAAI,CAAC,EAAE,MAAM,CAAC;EACnC,KAAK,MAAM,QAAQ,YAAY;GAC7B,MAAM,OAAO,EAAE,UAAU,SAAS;GAClC,MAAM,SAAS,MAAM,QAAQ;GAC7B,MAAM,QAAQ;IAAE,MAAM,OAAO;IAAM,OAAO,OAAO;GAAM;GACvD,MAAM,WAAW,cAAc,SAAS,EAAE,QAAQ,IAAI;GACtD,IAAI,CAAC,SAAS,IAAI;IAChB,OAAO,KAAK;KAAE,SAAS,SAAS;KAAO,GAAG;IAAM,CAAC;IACjD;GACF;GACA,IAAI,WAAW,SAAS,MAAM;GAC9B,MAAM,MAAM,EAAE,OAAO;GACrB,IAAI,KAAK;IACP,MAAM,QAAQ,QAAQ,SAAS,SAAS,MAAM,OAAO,IAAI,EAAE;IAC3D,IAAI,CAAC,MAAM,IAAI;KACb,OAAO,KAAK,EAAE,SAAS,QAAQ,KAAK,IAAI,MAAM,QAAQ,CAAC;KACvD;IACF;IACA,WAAW,MAAM,MAAM;IACvB,KAAK,QAAQ;KAAE,QAAQ,MAAM,MAAM;KAAQ,IAAI,IAAI;IAAG;GACxD;GACA,MAAM,OAAO,MAAM,KAAK,OAAO;GAC/B,MAAM,UAAU,OAAO,WAAW;GAClC,IAAI,CAAC,WAAW,SAAS,QAAQ,GAC/B,OAAO,KAAK;IACV,SAAS,GAAG,KAAK,WAAW,KAAK,QAAQ,EAAE,QAAQ,KAAK,OAAO;IAC/D,GAAG;GACL,CAAC;GAEH,MAAM,QAAQ;GACd,QAAQ,QAAQ,SAAS,MAAM,MAAM;GACrC,WAAW,QAAQ,SAAS;GAC5B,SAAS,IAAI,SAAS,MAAM,OAAO,IAAI;EACzC;EACA,KAAK,MAAM,KAAK,EAAE,KAAK;GACrB,MAAM,OAAO,MAAM,KAAK,OAAO;GAC/B,MAAM,WAAW,WAAW;GAC5B,IAAI,CAAC,MAAM,OAAO,KAAK,EAAE,SAAS,QAAQ,EAAE,sBAAsB,EAAE,KAAK,CAAC;QACrE,IACH,UAAU,IAAI,MACZ,MAAM,QAAQ,EAAE,CAAY,aAAa,CAAC,YAAY,CAAC,WAAW,QAAQ,IAE5E,OAAO,KAAK,EAAE,SAAS,QAAQ,EAAE,0BAA0B,KAAK,IAAI,IAAI,CAAC;EAE7E;EACA,IAAI,EAAE,SAAS,WAAW;GACxB,MAAM,MAAM,IAAI,QAAQ,OAAO,EAAE;GACjC,MAAM,QAAQ,KAAK,OAAO,QAAQ,KAAA,KAAa,KAAK,OAAO,YAAY,QAAQ,KAAA;GAC/E,MAAM,SAAS,cAAc,KAAK,QAAQ,OAAO;GACjD,IAAI,CAAC,SAAU,WAAW,UAAU,WAAW,mBAC7C,OAAO,KAAK,EACV,SAAS,+DAA+D,EAAE,GAAG,4EAC/E,CAAC;EAEL;EACA,IAAI,OAAO,QAAQ,OAAO;GAAE,IAAI;GAAO,OAAO;EAAO;EAErD,MAAM,WAAW,EAAE,IAAI,KAAK,MAAM,MAAM,EAAY;EACpD,MAAM,QAAQ,EAAE,QACZ,OAAO,YACL,OAAO,QAAQ,EAAE,KAAK,CAAC,CAAC,KAAK,CAAC,GAAG,OAAO,CAAC,MAAM,IAAc,CAAgB,CAAC,CAChF,IACA,KAAA;EAEJ,OAAO,GAAG;GACR,QAAQ;GACR,QAAQ,CAAC,GAAG,QAAQ,CAAC,CAAC,KAAK;GAC3B,MAAM,QAAQ,QAAQ;IAEpB,MAAM,OAAO,CAAC,GAAG,OAAO,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,MAAM;KAC5C,KAAK,MAAM,KAAK,EAAE,KAAK;MACrB,MAAM,IAAI,YAAY,EAAE,IAAW,EAAE,EAAS;MAC9C,IAAI,MAAM,GAAG,OAAO;KACtB;KACA,OAAO;IACT,CAAC;IACD,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAC/B,IAAI,MAAM,KAAK,IAAW,EAAE,GAAG,MAAM,MAAM,KAAK,IAAI,IAAW,EAAE,GAAG,GAAG;KACrE,MAAM,SAAS,EAAE,IAAI,KAAK,MAAM,OAAQ,KAAK,EAAE,CAAS,EAAS,CAAC;KAClE,OAAO,IAAI;MACT,MAAM;MACN,SAAS,GAAG,EAAE,IAAI,KAAK,IAAI,EAAE,GAAG,KAAK,UAAU,MAAM,EAAE;MACvD,SAAS,CAAC,MAAM;KAClB,CAAC;IACH;IAEF,MAAM,MAAM,KAAK,KAAK,QAAQ;KAC5B,MAAM,SAA+B,CAAC;KACtC,KAAK,MAAM,QAAQ,YAAY;MAC7B,IAAI,CAAC,OAAO,OAAO,KAAK,IAAI,GAAG;MAC/B,MAAM,IAAI,IAAI,SAAS;MACvB,MAAM,OAAO,QAAQ;MACrB,OAAO,MAAM,SACX,MAAM,QAAQ,SAAS,SAAS,aAAa,GAAc,IAAI,EAAE,IAAI,OAAO,CAAC;KACjF;KACA,OAAO;IACT,CAAC;IACD,OAAO,GAAG;KACR,MAAM;KACN,OAAO;MACL,MAAM,IAAI;MACV,QAAQ,EAAE;MACV,KAAK;MACL,MAAM;MACN,GAAI,QAAQ,EAAE,MAAM,IAAI,CAAC;MACzB,GAAI,OAAO,KAAK,IAAI,CAAC,CAAC,SAAS,EAAE,KAAK,IAAI,CAAC;MAC3C,GAAI,EAAE,SAAS,YAAY,EAAE,MAAM,UAAmB,IAAI,CAAC;KAC7D;IACF,CAAC;GACH;EACF,CAAC;CACH;AACF,CAAC;ACpOD,MAAa,gBAAgB,WAAW;CACtC,IAAI;CACJ,OAAO;CACP,UAAU;CACV,aAAa;CACb,OAAO,CAAC;EAAE,IAAI;EAAU,OAAO;EAAU,MAAM,CAAC,QAAQ;EAAG,UAAU;CAAK,CAAC;CAC3E,QAAQ;CACR,iBAAiB;EAAE,KAAK;EAAI,QAAQ,CAAC;EAAG,QAAQ;GAAE,MAAM;GAAU,YAAY,CAAC;EAAE;CAAE;CACnF,QAda,EAAE,aAAa;EAC5B,KAAK,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;EACrB,QAAQ,EAAE,MAAM,MAAM,CAAC,CAAC,IAAI,CAAC;EAC7B,QAAQ;CACV,CAUE;CACA,UAAU,GAAG,QAAQ;EACnB,KAAK,MAAM,MAAM,EAAE,QAAQ,IAAI,MAAM,EAAE;EACvC,MAAM,aAAa,IAAI,MAAM,cAAc,CAAC;EAC5C,IAAI,CAAC,OAAO,OAAO,YAAY,EAAE,GAAG,GAAG,OAAO,KAAK,sBAAsB,EAAE,IAAI,EAAE;EACjF,MAAM,OAAO,iBAAiB,EAAE,MAAM;EACtC,IAAI,CAAC,KAAK,IAAI,OAAO,KAAK,WAAW,KAAK,OAAO;EACjD,MAAM,SAAS,KAAK;EACpB,MAAM,YAAY,WAAW,EAAE;EAC/B,OAAO,GAAG;GACR,QAAQ;IAAE,MAAM;IAAQ,SAAS,WAAW,IAAI,IAAI,MAAM;GAAE;GAC5D,MAAM,QAAQ,QAAQ;IACpB,MAAM,SAAS,UAAU,IAAI,EAAE,OAAO,IAAI,MAAM,GAAG,GAAG;IACtD,IAAI,CAAC,OAAO,IAAI,OAAO,IAAI;KAAE,MAAM;KAAoB,SAAS,OAAO;IAAM,CAAC;IAC9E,MAAM,SAAS,SAAS,IAAI,IAAI,OAAO,OAAO,MAAM;IACpD,OAAO,OAAO,KAAK,GAAG,EAAE,MAAM,OAAO,MAAM,CAAC,IAAI;GAClD;EACF,CAAC;CACH;AACF,CAAC;;;;AE3BD,MAAM,MAAM;CACV;CACA;CACA;CACA;CACA;CACA;CDZuB,WAAW;EAClC,IAAI;EACJ,OAAO;EACP,UAAU;EACV,aAAa;EACb,OAAO,CAAC;GAAE,IAAI;GAAU,OAAO;GAAU,MAAM,CAAC,QAAQ;GAAG,UAAU;EAAK,CAAC;EAC3E,QAAQ;EACR,iBAAiB,EAAE,QAAQ,CAAC,EAAE;EAC9B,QAVa,EAAE,aAAa,EAAE,QAAQ,EAAE,MAAM,MAAM,CAAC,CAAC,IAAI,CAAC,EAAE,CAU7D;EACA,UAAU,GAAG,QAAQ;GACnB,MAAM,UAAU,EAAE,OAAO,KAAK,OAAO,IAAI,MAAM,EAAE,CAAC;GAClD,MAAM,QAAQ,QAAQ;GACtB,MAAM,QAAQ,OAAO,KAAK,MAAM,KAAK,MAAM,CAAC,CAAC,KAAK;GAClD,MAAM,SAAsB,CAAC;GAC7B,MAAM,SAAgC,CAAC;GACvC,MAAM,UAAkC,CAAC;GACzC,KAAK,MAAM,CAAC,GAAG,QAAQ,QAAQ,QAAQ,GAAG;IACxC,MAAM,QAAQ,OAAO,KAAK,IAAI,KAAK,MAAM,CAAC,CAAC,KAAK;IAChD,IAAI,MAAM,KAAK,IAAQ,MAAM,MAAM,KAAK,IAAQ,GAC9C,OAAO,KACL,GAAG,EAAE,OAAO,GAAG,cAAc,MAAM,KAAK,IAAI,EAAE,IAAI,EAAE,OAAO,GAAG,OAAO,MAAM,KAAK,IAAI,GACtF;GAEJ;GACA,KAAK,MAAM,QAAQ,OAAO;IACxB,IAAI,OAAc,EAAE;IACpB,IAAI,UAAiB,EAAE;IACvB,IAAI,YAAY;IAChB,KAAK,MAAM,CAAC,GAAG,QAAQ,QAAQ,QAAQ,GAAG;KACxC,MAAM,QAAQ,IAAI,KAAK,OAAO;KAC9B,MAAM,IAAI,MAAM,MAAM,KAAK;KAC3B,IAAI,CAAC,EAAE,IAAI;MACT,OAAO,KAAK,EACV,SAAS,GAAG,KAAK,IAAI,EAAE,OAAO,GAAG,SAAS,KAAK,KAAK,EAAE,mBAAmB,KAAK,IAAI,IACpF,CAAC;MACD;KACF;KACA,OAAO,EAAE;KACT,MAAM,SAAS,IAAI,QAAQ;KAC3B,cAAc,OAAO;KACrB,UAAU,SAAS,MAAM,SAAS,OAAO,WAAW,KAAK,CAAC;IAC5D;IACA,OAAO,QAAQ;IACf,QAAQ,QAAQ;KAAE,MAAM,IAAI;KAAI,OAAO;KAAM;KAAW,GAAI,YAAY,EAAE,QAAQ,IAAI,CAAC;IAAG;GAC5F;GACA,IAAI,OAAO,QAAQ,OAAO;IAAE,IAAI;IAAO,OAAO;GAAO;GACrD,OAAO,GAAG;IACR,QAAQ;KAAE,MAAM,EAAE,OAAO,MAAM;KAAG;IAAQ;IAC1C,MAAM,WAAW;KACf,MAAM,uBAAO,IAAI,IAAY;KAC7B,MAAM,OAAc,CAAC;KACrB,KAAK,MAAM,MAAM,EAAE,QACjB,KAAK,MAAM,OAAO,OAAO,EAAE,GAAG;MAC5B,MAAM,IAAI,MAAM,KAAK,KAAK;MAC1B,IAAI,KAAK,IAAI,CAAC,GAAG;MACjB,KAAK,IAAI,CAAC;MACV,KAAK,KAAK,GAAG;KACf;KAEF,OAAO,GAAG,EAAE,KAAK,CAAC;IACpB;GACF,CAAC;EACH;CACF,CClDE;CACA;CACA;CACA;CACA;AACF;AAEA,MAAa,eAA2D,OAAO,YAC7E,IAAI,KAAK,QAAQ,CAAC,IAAI,IAAI,GAAkC,CAAC,CAC/D;AAaA,MAAa,cAAuC,IAAI,KACrD,EAAE,IAAI,OAAO,UAAU,aAAa,OAAO,QAAQ,gBAAgB;CAClE;CACA;CACA;CACA;CACA;CACA;CACA;AACF,EACF;;;ACzCA,SAAS,GAAG,MAAyC,MAAkC;CACrF,IAAI,QAAiB;CACrB,KAAK,MAAM,OAAO,MAAM;EACtB,IAAI,OAAO,UAAU,YAAY,UAAU,MAAM,OAAO,KAAA;EACxD,QAAS,MAAkC;CAC7C;CACA,OAAO;AACT;;AAGA,SAAgB,SAAS,MAAuB;CAC9C,MAAM,MAAM,OAAO,OAAO,cAAc,KAAK,EAAE,IAAI,aAAa,KAAK,MAAM,KAAA;CAC3E,IAAI,CAAC,KAAK,OAAO,CAAC;CAClB,MAAM,OAAc,CAAC;CACrB,KAAK,MAAM,QAAQ,IAAI,OAAO;EAC5B,MAAM,QAAQ,GAAG,MAAM,KAAK,IAAI;EAChC,IAAI,KAAK,YAAY,MAAM,QAAQ,KAAK,GACjC;QAAA,MAAM,CAAC,OAAO,WAAW,MAAM,QAAQ,GAC1C,IAAI,OAAO,WAAW,YAAY,WAAW,IAAI,KAAK,KAAK;IAAE,MAAM,KAAK;IAAI;IAAQ;GAAM,CAAC;EAAA,OAExF,IAAI,OAAO,UAAU,YAAY,UAAU,IAChD,KAAK,KAAK;GAAE,MAAM,KAAK;GAAI,QAAQ;EAAM,CAAC;CAE9C;CACA,OAAO;AACT;;AAGA,SAAgB,SAAS,MAA0B;CACjD,OAAO,CAAC,GAAG,IAAI,IAAI,SAAS,IAAI,CAAC,CAAC,KAAK,MAAM,EAAE,MAAM,CAAC,CAAC;AACzD;;AAGA,SAAgB,UAAU,OAAmD;CAC3E,MAAM,MAAM,IAAI,IAAI,MAAM,KAAK,MAAM,EAAE,EAAE,CAAC;CAC1C,MAAM,OAAO,IAAI,IAAsB,MAAM,KAAK,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;CACnE,KAAK,MAAM,QAAQ,OACjB,KAAK,MAAM,UAAU,SAAS,IAAI,GAChC,IAAI,IAAI,IAAI,MAAM,GAAG,KAAM,IAAI,MAAM,CAAC,CAAc,KAAK,KAAK,EAAE;CAGpE,OAAO;AACT;AAEA,SAAS,MAAM,OAAe,MAA2D;CACvF,MAAM,uBAAO,IAAI,IAAY;CAC7B,MAAM,QAAQ,CAAC,GAAI,KAAK,IAAI,KAAK,KAAK,CAAC,CAAE;CACzC,OAAO,MAAM,SAAS,GAAG;EACvB,MAAM,KAAK,MAAM,IAAI;EACrB,IAAI,KAAK,IAAI,EAAE,GAAG;EAClB,KAAK,IAAI,EAAE;EACX,MAAM,KAAK,GAAI,KAAK,IAAI,EAAE,CAAuB;CACnD;CACA,OAAO;AACT;;AAGA,SAAgB,WAAW,OAA4B,IAAyB;CAC9E,OAAO,MAAM,IAAI,UAAU,KAAK,CAAC;AACnC;;AAGA,SAAgB,SAAS,OAA4B,IAAyB;CAC5E,MAAM,MAAM,IAAI,IAAI,MAAM,KAAK,MAAM,EAAE,EAAE,CAAC;CAE1C,OAAO,MAAM,IAAI,IADA,IAAI,MAAM,KAAK,MAAM,CAAC,EAAE,IAAI,SAAS,CAAC,CAAC,CAAC,QAAQ,MAAM,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,CAC/D,CAAC;AACvB;;AAGA,SAAgB,eAAe,OAA6C;CAC1E,MAAM,OAAO,UAAU,KAAK;CAC5B,MAAM,wBAAQ,IAAI,IAA6B;CAC/C,MAAM,OAAiB,CAAC;CACxB,MAAM,SAAS,OAAgC;EAC7C,MAAM,IAAI,IAAI,MAAM;EACpB,KAAK,KAAK,EAAE;EACZ,KAAK,MAAM,MAAM,KAAK,IAAI,EAAE,GAAe;GACzC,IAAI,MAAM,IAAI,EAAE,MAAM,QAAQ,OAAO,CAAC,GAAG,KAAK,MAAM,KAAK,QAAQ,EAAE,CAAC,GAAG,EAAE;GACzE,IAAI,CAAC,MAAM,IAAI,EAAE,GAAG;IAClB,MAAM,QAAQ,MAAM,EAAE;IACtB,IAAI,OAAO,OAAO;GACpB;EACF;EACA,KAAK,IAAI;EACT,MAAM,IAAI,IAAI,MAAM;EACpB,OAAO;CACT;CACA,KAAK,MAAM,QAAQ,OAAO;EACxB,IAAI,MAAM,IAAI,KAAK,EAAE,GAAG;EACxB,MAAM,QAAQ,MAAM,KAAK,EAAE;EAC3B,IAAI,OAAO,OAAO;CACpB;CACA,OAAO;AACT;;;;;AAMA,SAAgB,iBAAiB,OAAsC;CACrE,MAAM,OAAO,UAAU,KAAK;CAC5B,MAAM,WAAW,IAAI,IAAI,MAAM,KAAK,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;CACpD,KAAK,MAAM,WAAW,KAAK,OAAO,GAChC,KAAK,MAAM,KAAK,SAAS,SAAS,IAAI,GAAI,SAAS,IAAI,CAAC,IAAe,CAAC;CAC1E,MAAM,WAAW,IAAI,IAAI,MAAM,KAAK,GAAG,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;CACvD,MAAM,QAAQ,MAAM,QAAQ,MAAM,SAAS,IAAI,EAAE,EAAE,MAAM,CAAC,CAAC,CAAC,KAAK,MAAM,EAAE,EAAE;CAC3E,MAAM,QAAkB,CAAC;CACzB,OAAO,MAAM,SAAS,GAAG;EACvB,MAAM,MAAM,GAAG,MAAO,SAAS,IAAI,CAAC,IAAgB,SAAS,IAAI,CAAC,CAAY;EAC9E,MAAM,KAAK,MAAM,MAAM;EACvB,MAAM,KAAK,EAAE;EACb,KAAK,MAAM,MAAM,KAAK,IAAI,EAAE,GAAe;GACzC,MAAM,YAAa,SAAS,IAAI,EAAE,IAAe;GACjD,SAAS,IAAI,IAAI,SAAS;GAC1B,IAAI,cAAc,GAAG,MAAM,KAAK,EAAE;EACpC;CACF;CACA,OAAO;AACT;;;;;;;;;;;AC1EA,SAAS,SAAS,MAAyC;CACzD,MAAM,EAAE,IAAI,IAAI,IAAI,IAAI,OAAO,IAAI,GAAG,SAAS;CAC/C,OAAO;AACT;;;;;AAMA,SAAgB,iBAAiB,SAAyC;CACxE,MAAM,SAAyB,CAAC;CAChC,MAAM,uBAAO,IAAI,IAAsB;CACvC,KAAK,MAAM,QAAQ,QAAQ,OAAO;EAChC,IAAI,KAAK,IAAI,KAAK,EAAE,GAClB,OAAO,KAAK;GAAE,MAAM;GAAgB,SAAS,OAAO,KAAK,GAAG;GAAkB,MAAM,KAAK;EAAG,CAAC;EAC/F,KAAK,IAAI,KAAK,IAAI,IAAI;CACxB;CACA,KAAK,MAAM,QAAQ,QAAQ,OAAO;EAChC,MAAM,MAAM,OAAO,OAAO,cAAc,KAAK,EAAE,IAAI,aAAa,KAAK,MAAM,KAAA;EAC3E,IAAI,CAAC,KAAK;GACR,OAAO,KAAK;IAAE,MAAM;IAAc,SAAS,oBAAoB,KAAK,GAAG;IAAI,MAAM,KAAK;GAAG,CAAC;GAC1F;EACF;EACA,MAAM,OAAO,SAAS,IAAI;EAC1B,KAAK,MAAM,QAAQ,IAAI,OACrB,IAAI,CAAC,KAAK,YAAY,CAAC,KAAK,MAAM,MAAM,EAAE,SAAS,KAAK,EAAE,GACxD,OAAO,KAAK;GACV,MAAM;GACN,SAAS,UAAU,KAAK,MAAM;GAC9B,MAAM,KAAK;EACb,CAAC;EAGL,KAAK,MAAM,OAAO,MAAM;GACtB,MAAM,SAAS,KAAK,IAAI,IAAI,MAAM;GAClC,IAAI,CAAC,QACH,OAAO,KAAK;IACV,MAAM;IACN,SAAS,IAAI,IAAI,KAAK,4BAA4B,IAAI,OAAO;IAC7D,MAAM,KAAK;GACb,CAAC;QACI,IAAI,aAAa,OAAO,OAAO,CAAC,aAAa,OAAO,GAAG,EAAE,QAC9D,OAAO,KAAK;IACV,MAAM;IACN,SAAS,IAAI,IAAI,OAAO,KAAK,OAAO,GAAG;IACvC,MAAM,KAAK;GACb,CAAC;EAEL;CACF;CACA,MAAM,QAAQ,eAAe,QAAQ,KAAK;CAC1C,IAAI,OAAO,OAAO,KAAK;EAAE,MAAM;EAAS,SAAS,UAAU,MAAM,KAAK,MAAM;EAAK,MAAM,MAAM;CAAG,CAAC;CAGjG,MAAM,uBAAO,IAAI,IAAY;CAC7B,MAAM,aAAa,MAAgB,aAAa,EAAE,GAAG,EAAE,WAAW,KAAA;CAClE,MAAM,QAAQ,QAAQ,MAAM,OAAO,SAAS,CAAC,CAAC,KAAK,MAAM,EAAE,EAAE;CAC7D,MAAM,OAAO,IAAI,IAAI,QAAQ,MAAM,KAAK,MAAM,CAAC,EAAE,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC;CAClE,OAAO,MAAM,SAAS,GAAG;EACvB,MAAM,KAAK,MAAM,IAAI;EACrB,IAAI,KAAK,IAAI,EAAE,GAAG;EAClB,KAAK,IAAI,EAAE;EACX,MAAM,KAAK,GAAI,KAAK,IAAI,EAAE,KAAK,CAAC,CAAE;CACpC;CACA,KAAK,MAAM,QAAQ,QAAQ,OACzB,IAAI,CAAC,KAAK,IAAI,KAAK,EAAE,KAAK,aAAa,KAAK,KAC1C,OAAO,KAAK;EACV,MAAM;EACN,SAAS;EACT,MAAM,KAAK;CACb,CAAC;CAGL,KAAK,MAAM,MAAM,OAAO,KAAK,QAAQ,MAAM,GACzC,IAAI,CAAC,KAAK,IAAI,EAAE,GACd,OAAO,KAAK;EACV,MAAM;EACN,SAAS,8BAA8B,GAAG;EAC1C,OAAO;CACT,CAAC;CAEL,OAAO;AACT;;AAGA,SAAgB,eAAe,OAAuB,KAA8B;CAClF,MAAM,aAAa,iBAAiB,OAAO,GAAG;CAC9C,MAAM,UAAU,WAAW;CAC3B,MAAM,SAAyB,CAAC,GAAG,WAAW,QAAQ,GAAG,iBAAiB,OAAO,CAAC;CAClF,IAAI,OAAO,MAAM,MAAM,EAAE,SAAS,WAAW,EAAE,SAAS,cAAc,GACpE,OAAO;EAAE,IAAI;EAAO;EAAQ,OAAO,CAAC;CAAE;CAExC,MAAM,OAAO,IAAI,IAAI,QAAQ,MAAM,KAAK,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;CACxD,MAAM,QAAQ,EAAE,MAAM,MAAM;CAC5B,MAAM,0BAAU,IAAI,IAAwB;CAC5C,MAAM,2BAAW,IAAI,IAA2B;CAChD,MAAM,QAAQ,WACZ,UAAU,QAAQ;EAChB,QAAQ,QAAQ;EAChB,QAAQ,QAAQ;EAChB,WAAW,IAAI,aAAa,CAAC;EAC7B;CACF,CAAC;CAEH,KAAK,MAAM,MAAM,iBAAiB,QAAQ,KAAK,GAAG;EAChD,MAAM,OAAO,KAAK,IAAI,EAAE;EACxB,MAAM,MAAM,OAAO,OAAO,cAAc,KAAK,EAAE,IAAI,aAAa,KAAK,MAAM,KAAA;EAC3E,IAAI,CAAC,KAAK;EAEV,IADa,SAAS,IACf,CAAC,CAAC,MAAM,MAAM,CAAC,QAAQ,IAAI,CAAC,CAAC,GAAG;EAEvC,MAAM,SAAS,IAAI,OAAO,UAAU,SAAS,IAAI,CAAC;EAClD,IAAI,CAAC,OAAO,SAAS;GACnB,KAAK,MAAM,KAAK,OAAO,MAAM,QAC3B,OAAO,KAAK;IACV,MAAM;IACN,SAAS,GAAG,EAAE,KAAK,SAAS,GAAG,EAAE,KAAK,KAAK,GAAG,EAAE,MAAM,KAAK,EAAE;IAC7D,MAAM;GACR,CAAC;GAEH;EACF;EACA,MAAM,MAAM,QAAQ,OAAO;EAC3B,MAAM,UAAmB;GACvB;GACA,OAAO;GACP;GACA,GAAI,MAAM,EAAE,QAAQ,IAAI,IAAI,CAAC;GAC7B;GACA,QAAQ,QAAQ,QAAQ,IAAI,GAAG;GAC/B,WAAW;EACb;EACA,MAAM,SAAS,IAAI,QAAQ,OAAO,MAAM,OAAO;EAC/C,IAAI,CAAC,OAAO,IAAI;GACd,KAAK,MAAM,KAAK,OAAO,OACrB,OAAO,KAAK;IACV,MAAM,EAAE,QAAQ;IAChB,SAAS,EAAE;IACX,MAAM,EAAE,QAAQ;IAChB,GAAI,EAAE,UAAU,KAAA,IAAY,CAAC,IAAI,EAAE,OAAO,EAAE,MAAM;IAClD,GAAI,EAAE,SAAS,KAAA,IAAY,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK;GACjD,CAAC;GAEH;EACF;EACA,IAAI,SAAS,OAAO,MAAM;EAC1B,IAAI;EACJ,IAAI,KAAK;GACP,IAAI,CAAC,QAAQ;IACX,OAAO,KAAK;KACV,MAAM;KACN,SAAS,GAAG,KAAK,GAAG;KACpB,MAAM;IACR,CAAC;IACD;GACF;GACA,MAAM,IAAI,mBAAmB,IAAI,KAAK,QAAQ,IAAI;GAClD,IAAI,CAAC,EAAE,IAAI;IACT,KAAK,MAAM,KAAK,EAAE,OAEhB,OAAO,KAAK;KACV,MAAM;KACN,SAAS,EAAE;KACX,MAAM;KACN,OAAO,EAAE;IACX,CAAC;IAEH;GACF;GACA,SAAS,EAAE,MAAM;GACjB,QAAQ,EAAE,MAAM;EAClB;EACA,IAAI,QAAQ,QAAQ,IAAI,IAAI,MAAM;EAClC,SAAS,IAAI,IAAI;GACf,MAAM;IAAE,GAAG,OAAO;IAAO;GAAO;GAChC,QAAQ,OAAO;GACf,GAAI,QAAQ,EAAE,MAAM,IAAI,CAAC;EAC3B,CAAC;CACH;CAEA,OAAO,KAAK,GAAG,WAAW,QAAQ,GAAG,GAAG,WAAW,SAAS,QAAQ,CAAC;CACrE,MAAM,QAAQ,OAAO,YAAY,CAAC,GAAG,OAAO,CAAC,CAAC,KAAK,CAAC,IAAI,YAAY,CAAC,IAAI,OAAO,IAAI,CAAC,CAAC;CACtF,IAAI,OAAO,SAAS,GAAG,OAAO;EAAE,IAAI;EAAO,QAAQ,OAAO,MAAM;EAAG;CAAM;CACzE,OAAO;EAAE,IAAI;EAAM,MAAM,KAAK,SAAS,UAAU,MAAM,IAAI;EAAG,QAAQ,CAAC;EAAG;CAAM;AAClF;;AAWA,SAAS,OAAO,QAAiD;CAC/D,MAAM,uBAAO,IAAI,IAAY;CAC7B,OAAO,OAAO,QAAQ,MAAM;EAC1B,MAAM,MAAM,KAAK,UAAU;GAAC,EAAE;GAAM,EAAE;GAAO,EAAE;GAAM,EAAE;EAAO,CAAC;EAC/D,IAAI,KAAK,IAAI,GAAG,GAAG,OAAO;EAC1B,KAAK,IAAI,GAAG;EACZ,OAAO;CACT,CAAC;AACH;;AAGA,SAAS,WAAW,UAAoC;CACtD,MAAM,0BAAU,IAAI,IAAsB;CAC1C,KAAK,MAAM,CAAC,IAAI,MAAM,UACpB,KAAK,MAAM,UAAU,EAAE,KAAK,UAAU,CAAC,GACrC,QAAQ,IAAI,QAAQ,CAAC,GAAI,QAAQ,IAAI,MAAM,KAAK,CAAC,GAAI,EAAE,CAAC;CAE5D,OAAO,CAAC,GAAG,OAAO,CAAC,CAChB,QAAQ,GAAG,WAAW,MAAM,SAAS,CAAC,CAAC,CACvC,KAAK,CAAC,QAAQ,YAAY;EACzB,MAAM;EACN,SAAS,GAAG,MAAM,KAAK,OAAO,EAAE,cAAc,OAAO;EACrD,MAAM,MAAM;CACd,EAAE;AACN;;;;;AAMA,SAAS,WAAW,SAAyB,UAAoC;CAC/E,MAAM,OAAO,UAAU,QAAQ,KAAK;CACpC,MAAM,OAAO,IAAI,IAAI,QAAQ,MAAM,KAAK,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;CACxD,MAAM,SAAyB,CAAC;CAChC,KAAK,MAAM,CAAC,IAAI,MAAM,UAAU;EAE9B,IAAI,KAAK,IAAI,EAAE,CAAC,EAAE,OAAO,SAAS,CAAC,EAAE,KAAK,QAAQ,SAAS;EAC3D,MAAM,uBAAO,IAAI,IAAY;EAC7B,MAAM,QAAQ,CAAC,GAAI,KAAK,IAAI,EAAE,CAAc;EAC5C,OAAO,MAAM,SAAS,GAAG;GACvB,MAAM,IAAI,MAAM,IAAI;GACpB,IAAI,KAAK,IAAI,CAAC,GAAG;GACjB,KAAK,IAAI,CAAC;GACV,MAAM,OAAO,KAAK,IAAI,CAAC;GACvB,MAAM,MAAM,aAAa,KAAK;GAC9B,IAAI,KAAK,gBAAgB;IACvB,MAAM,SAAS,SAAS,IAAI,CAAC,CAAC,EAAE;IAChC,IAAI,UAAU,CAAC,IAAI,eAAe,MAAM,GACtC,OAAO,KAAK;KACV,MAAM;KACN,SAAS,GAAG,GAAG,0GAA0G,GAAG;KAC5H,MAAM;IACR,CAAC;IAEH;GACF;GACA,MAAM,KAAK,GAAI,KAAK,IAAI,CAAC,CAAc;EACzC;CACF;CACA,OAAO;AACT;AAEA,SAAS,KAAK,SAAyB,UAAoB,WAA0B;CACnF,MAAM,QAAQ,iBAAiB,QAAQ,KAAK;CAC5C,MAAM,OAAO,IAAI,IAAI,QAAQ,MAAM,KAAK,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;CACxD,MAAM,OAAO,UAAU,QAAQ,KAAK;CACpC,MAAM,0BAAU,IAAI,IAAoB;CACxC,KAAK,MAAM,CAAC,GAAG,OAAO,MAAM,QAAQ,GAClC,KAAK,MAAM,OAAO,SAAS,KAAK,IAAI,EAAE,CAAa,GAAG,QAAQ,IAAI,KAAK,CAAC;CAE1E,MAAM,6BAAa,IAAI,IAAsB;CAC7C,MAAM,+BAAe,IAAI,IAAqB;CAC9C,KAAK,MAAM,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,QAAQ,GAAG;EACrC,MAAM,KAAM,KAAK,IAAI,EAAE,CAAC,CAAc;EAEtC,MAAM,QAAQ,KAAK,IAAI,EAAE;EACzB,MAAM,QAAQ,MAAM,SAAS,MAAM,WAAW,IAAI,CAAC,CAAa;EAChE,WAAW,IAAI,IAAI,CAAC,GAAG,IAAI,IAAI,OAAO,SAAS,CAAC,IAAI,GAAG,KAAK,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC;EAC9E,aAAa,IAAI,IAAI,OAAO,aAAa,MAAM,MAAM,MAAM,aAAa,IAAI,CAAC,CAAC,CAAC;CACjF;CAkBA,OAAO;EAAE;EAAS,OAjBW,MAAM,KAAK,OAAO;GAC7C,MAAM,OAAO,KAAK,IAAI,EAAE;GACxB,MAAM,IAAI,SAAS,IAAI,EAAE;GACzB,MAAM,MAAM,aAAa,KAAK;GAC9B,OAAO;IACL;IACA,IAAI,KAAK;IACT,QAAQ,EAAE;IACV,QAAQ,SAAS,IAAI;IACrB,QAAQ,EAAE,KAAK;IACf,GAAI,KAAK,SAAS,EAAE,QAAQ,IAAI,OAAO,IAAI,CAAC;IAC5C,KAAK,EAAE,KAAK;IACZ,GAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,IAAI,CAAC;IACpC,OAAO,WAAW,IAAI,EAAE;IACxB,cAAc,aAAa,IAAI,EAAE;GACnC;EACF,CACsB;EAAG;EAAS;CAAU;AAC9C;;;;AC1RA,SAAgB,SAAS,MAAgE;CACvF,OAAO,KAAK,MACT,QAAQ,MAAM,EAAE,OAAO,QAAQ,CAAC,CAChC,KAAK,OAAO;EAAE,MAAM,EAAE;EAAI,QAAQ,OAAO,EAAE,OAAO,MAAM;EAAG,QAAQ,OAAO,EAAE,OAAO,MAAM;CAAE,EAAE;AAClG;;AAGA,eAAsB,aACpB,MACA,MAKmB;CACnB,MAAM,WAAyE,CAAC;CAChF,KAAK,MAAM,UAAU,SAAS,IAAI,GAChC,SAAS,OAAO,QAAQ,OAAO,OAAO,CAAC,GAAI,MAAM,KAAK,MAAM,CAAE,CAAC;CACjE,OAAO,OAAO,OAAO,QAAQ;AAC/B;AAEA,SAAgB,QACd,MACA,UACA,KACA,UAA0B,CAAC,GAChB;CACX,MAAM,MAAM,OAAO,IAAI,QAAQ,WAAW,QAAQ,MAAM,IAAI,GAAG,IAAI,IAAI;CACvE,IAAI,CAAC,KAAK,MAAM,IAAI,MAAM,YAAY,OAAO,IAAI,GAAG,EAAE,wBAAwB;CAC9E,MAAM,QAAQ,QAAQ,gBAAgB,YAAY,IAAI;CACtD,MAAM,MAAkB,OAAO,OAAO;EACpC;EACA,IAAI,IAAI,MAAM;EACd,QAAQ,IAAI,UAAU;EACZ;EACV,QAAQ,KAAK,QAAQ;EACrB,QAAQ,KAAK,QAAQ;EACrB,KAAK;GACH,WAAW,IAAI,aAAa;GAC5B,kBAAkB,GAAG,KAAK,QAAQ,GAAG,GAAG,KAAK,QAAQ;EACvD;CACF,CAAC;CAED,MAAM,0BAAU,IAAI,IAAsB;CAC1C,MAAM,WAAqC,CAAC;CAC5C,MAAM,yBAAS,IAAI,IAAwB;CAC3C,MAAM,QAAqB,CAAC;CAC5B,MAAM,SAAqB,CAAC;CAC5B,MAAM,yBAAS,IAAI,IAAuB;CAC1C,MAAM,UAAoB,CAAC;CAC3B,MAAM,uBAAO,IAAI,IAAY;CAC7B,IAAI,UAAU;CAEd,KAAK,MAAM,CAAC,GAAG,SAAS,KAAK,MAAM,QAAQ,GAAG;EAC5C,MAAM,UAAU,GAAe,QAA4B,CAAC,MAAM;GAChE,OAAO,IAAI,KAAK,IAAI,CAAC;GACrB,MAAM,KAAK;IACT,MAAM,KAAK;IACX,IAAI,KAAK;IACT,QAAQ;IACR,QAAQ;IACR,SAAS;IACT,SAAS;IACT,SAAS;IACT,IAAI;IACJ,GAAG;GACL,CAAC;EACH;EAEA,IAAI,WAAW,CAAC,QAAQ,WAAW,CAAC,KAAK,cAAc,OAAO,SAAS;OAClE,IAAI,KAAK,OAAO,MAAM,OAAO,OAAO,IAAI,EAAE,MAAM,IAAI,GAAG,OAAO,iBAAiB;OAC/E;GACH,MAAM,SAAS,KAAK,OAAO,QAAQ,GAAG,OAAO,IAAK,QAAQ,IAAI,EAAE,CAAC,CAAc,QAAQ,CAAC;GACxF,MAAM,QAAQ,MAAM;GACpB,MAAM,SAAS,KAAK,KAAK,OAAO,QAAQ,IAAI,EAAE,GAAe,KAAK;IAChE,GAAI,IAAI,WAAW,KAAK,QAAQ,KAAA,IAAY,CAAC,IAAI,EAAE,UAAU,IAAI,SAAS,KAAK,IAAI;IACnF,GAAI,QAAQ,UAAU,EAAE,WAAW,KAAK,IAAI,CAAC;GAC/C,CAAC;GACD,IAAI,CAAC,OAAO,IAAI;IACd,MAAM,IAAI,OAAO;IACjB,OAAO,KAAK;KACV,MAAM,KAAK;KACX,MAAM,EAAE;KACR,SAAS,EAAE;KACX,GAAI,EAAE,UAAU,EAAE,SAAS,EAAE,QAAQ,IAAI,CAAC;IAC5C,CAAC;IACD,OAAO,KAAK,GAAI,EAAE,UAAU,CAAC,CAAE;IAC/B,IAAI,EAAE,MAAM,UAAU;IACtB,OAAO,UAAU;KAAE;KAAQ,IAAI,MAAM,IAAI;IAAM,CAAC;GAClD,OAAO;IACL,IAAI,MAAe,OAAO;IAC1B,IAAI,KAAK,OAAO;KACd,MAAM,UAAU,KAAK,MAAM,IAAI,MAAM,KAAK;MACxC,GAAI,IAAI,WAAW,KAAK,QAAQ,KAAA,IAAY,CAAC,IAAI,EAAE,UAAU,IAAI,SAAS,KAAK,IAAI;MACnF,GAAI,QAAQ,UAAU,EAAE,WAAW,KAAK,IAAI,CAAC;KAC/C,CAAC;KACD,MAAM;MACJ,GAAG;MACH,MAAM,QAAQ;MACd,UAAU,IAAI,WAAW,KAAK,QAAQ;MACtC,QAAQ,CAAC,GAAI,IAAI,UAAU,CAAC,GAAI,GAAG,QAAQ,MAAM;MACjD,MAAM,IAAI,QAAQ,QAAQ;MAC1B,gBAAgB,IAAI,kBAAkB,QAAQ;KAChD;IACF;IACA,OAAO,KAAK,GAAI,IAAI,UAAU,CAAC,CAAE;IACjC,IAAI,IAAI,MAAM,UAAU;IACxB,IAAI,IAAI,gBAAgB,KAAK,MAAM,KAAK,KAAK,OAAO,KAAK,IAAI,CAAC;IAC9D,IAAI,IAAI,OAAO,OAAO,IAAI,KAAK,IAAI,IAAI,KAAK;IAE5C,IAAI,IAAI,QACN,QAAQ,KACN,KAAK,QACD;KAAE,GAAG,IAAI;KAAQ,MAAM,IAAI,KAAK,KAAK,MAAM,OAAO,CAAC,CAA2B;IAAE,IAChF,IAAI,MACV;IAEF,QAAQ,IAAI,KAAK,IAAI,IAAI,IAAI;IAC7B,IAAI,QAAQ,QAAQ,SAAS,KAAK,MAAM,IAAI;IAC5C,OAAO,MAAM;KACX;KACA,SAAS,IAAI,KAAK;KAClB,SAAS,IAAI,WAAW;KACxB,SAAS,IAAI,WAAW;KACxB,IAAI,MAAM,IAAI;IAChB,CAAC;GACH;EACF;EACA,KAAK,MAAM,MAAM,KAAK,QAAQ,IAAI,KAAK,QAAQ,IAAI,EAAE,MAAM,GAAG,QAAQ,OAAO,EAAE;CACjF;CAEA,MAAM,QAAsB,KAAK,MAC9B,QAAQ,MAAM,EAAE,WAAW,MAAM,CAAC,CAClC,KAAK,MAAM;EACV,MAAM,IAAI,OAAO,IAAI,EAAE,EAAE;EACzB,MAAM,QAAQ,OAAO,IAAI,EAAE,EAAE;EAC7B,IAAI,SAAS,OAAO;GAAE,MAAM,EAAE;GAAI,QAAQ;EAAU;EACpD,IAAI,MAAM,UAAU,OAAO;GAAE,MAAM,EAAE;GAAI,QAAQ;EAAS;EAC1D,IAAI,MAAM,QAAQ,CAAC,OAAO,OAAO;GAAE,MAAM,EAAE;GAAI,QAAQ;EAAkB;EACzE,IAAI,KAAK,IAAI,EAAE,EAAE,GAAG,OAAO;GAAE,MAAM,EAAE;GAAI,QAAQ;EAAO;EACxD,OAAO;GAAE,MAAM,EAAE;GAAI,QAAQ;GAAS;EAAM;CAC9C,CAAC;CAEH,OAAO;EACL,QAAQ,UACJ,YACA,MAAM,OAAO,MAAM,EAAE,WAAW,OAAO,KAAK,CAAC,GAAG,OAAO,OAAO,CAAC,CAAC,CAAC,OAAO,MAAM,MAAM,IAAI,IACtF,OACA;EACN;EACA;EACA;EACA;EACA,GAAI,QAAQ,SAAS,EAAE,SAAS,SAAS,IAAI,CAAC;CAChD;AACF;;;ACjMA,MAAM,cAAc;AAEpB,SAAgB,YAAY,MAA6B;CACvD,OAAO,KAAK,QAAQ,SAAS,KAAK,SAAS,UAAU;EACnD,MAAM,WAAqB,CAAC;EAC5B,MAAM,OAAO;GAAE;GAAO,GAAI,QAAQ,OAAO,EAAE,MAAM,QAAQ,KAAK,IAAI,CAAC;EAAG;EACtE,MAAM,UAAU,IAAI,IAAI,KAAK,MAAM,QAAQ,MAAM,EAAE,OAAO,QAAQ,CAAC,CAAC,KAAK,MAAM,EAAE,EAAE,CAAC;EACpF,MAAM,QAAQ,IAAI,IAAI,KAAK,MAAM,KAAK,MAAM,EAAE,EAAE,CAAC;EACjD,KAAK,MAAM,MAAM,OAAO,KAAK,QAAQ,OAAO,GAC1C,IAAI,CAAC,QAAQ,IAAI,EAAE,GAAG,SAAS,KAAK,kBAAkB,GAAG,8BAA8B;EAEzF,KAAK,MAAM,MAAM,OAAO,KAAK,QAAQ,MAAM,GACzC,IAAI,CAAC,MAAM,IAAI,EAAE,GAAG,SAAS,KAAK,8BAA8B,GAAG,EAAE;EAEvE,IAAI,KAAK,aAAa,QAAQ,QAAQ,KAAA,GACpC,SAAS,KAAK,qEAAmE;EAEnF,MAAM,MAAM,QAAQ,MAAM,QAAQ,OAAO,WAAW;EACpD,IAAI,CAAC,KAAK,SAAS,KAAK,QAAQ,QAAQ,IAAI,wBAAwB;EACpE,MAAM,KAAK,QAAQ,MAAM;EACzB,IAAI,CAAC,WAAW,EAAE,GAAG,SAAS,KAAK,sBAAsB,GAAG,EAAE;EAC9D,IAAI,SAAS,QAAQ,OAAO;GAAE,GAAG;GAAM,QAAQ;GAAO;GAAU,OAAO,CAAC;GAAG,QAAQ,CAAC;EAAE;EAEtF,MAAM,MAAM,QACV,MACA,QAAQ,SACR;GAAO;GAAgB;EAAG,GAC1B;GAAE,QAAQ;GAAM,SAAS;EAAK,CAChC;EACA,IAAI,IAAI,WAAW,WAAW;GAC5B,MAAM,MAAM,IAAI,OACb,QAAQ,MAAM,EAAE,WAAW,MAAM,CAAC,CAClC,KAAK,MAAM,GAAG,EAAE,KAAK,IAAI,EAAE,SAAS;GACvC,SAAS,KAAK,cAAc,IAAI,SAAS,KAAK,IAAI,KAAK,IAAI,MAAM,IAAI;EACvE;EACA,KAAK,MAAM,KAAK,IAAI,OAClB,IAAI,EAAE,WAAW,UAAU;GACzB,MAAM,MAAM,IAAI,OAAO,QAAQ,MAAM,EAAE,SAAS,EAAE,IAAI,CAAC,CAAC,KAAK,MAAM,EAAE,OAAO;GAC5E,SAAS,KAAK,GAAG,EAAE,KAAK,WAAW,IAAI,KAAK,IAAI,GAAG;EACrD;EAGF,MAAM,QAAoB,CAAC;EAC3B,KAAK,MAAM,CAAC,IAAI,aAAa,OAAO,QAAQ,QAAQ,MAAM,GAAG;GAC3D,MAAM,SAAS,IAAI,UAAU;GAC7B,IAAI,CAAC,QAAQ;IACX,SAAS,KAAK,GAAG,GAAG,oBAAoB;IACxC;GACF;GACA,IAAI,SAAS,WAAW,GAAG;IACzB,IAAI,OAAO,QAAQ,MAAM,KAAK;KAAE,MAAM;KAAI,SAAS,CAAC;KAAG,YAAY,OAAO,IAAI,MAAM;IAAE,CAAC;IACvF;GACF;GACA,MAAM,SAAS,OAAO,KAAK,SAAS,EAAY,CAAC,CAAC,KAAK;GACvD,IAAI,SAAS,MAAM,MAAM,OAAO,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,KAAK,IAAQ,MAAM,OAAO,KAAK,IAAQ,CAAC,GAAG;IACxF,SAAS,KAAK,oBAAoB,GAAG,+BAA+B;IACpE;GACF;GACA,MAAM,WAAW,MACf,OAAO,YAAY,OAAO,KAAK,MAAM,CAAC,GAAG,OAAO,EAAE,MAAM,IAAI,CAAC,CAAC,CAAC;GACjE,MAAM,OAAO,IAAI,IACf,SAAS,KAAK,MAAM,CAClB,aAAa,QAAQ,CAAwB,CAAQ,GACrD,QAAQ,CAAwB,CAClC,CAAC,CACH;GACA,MAAM,MAAM,IAAI,IAAI,OAAO,KAAK,MAAM,CAAC,aAAa,QAAQ,CAAC,CAAQ,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;GACpF,MAAM,UAAU,CAAC,GAAG,IAAI,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,OAAO,CAAC;GACvE,MAAM,aAAa,CAAC,GAAG,GAAG,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,OAAO,CAAC;GAC1E,IAAI,QAAQ,UAAU,WAAW,QAAQ,MAAM,KAAK;IAAE,MAAM;IAAI;IAAS;GAAW,CAAC;EACvF;EACA,OAAO;GACL,GAAG;GACH,QAAQ,SAAS,WAAW,KAAK,MAAM,WAAW;GAClD;GACA;GACA,QAAQ,IAAI;GACZ;EACF;CACF,CAAC;AACH;;;;;;;;;AC9FA,SAAgB,aAAa,SAAyB,KAA4B;CAChF,MAAM,WAAW,eAAe,SAAS,GAAG;CAC5C,IAAI,CAAC,SAAS,IAAI,OAAO;EAAE,IAAI;EAAO,QAAQ,SAAS;CAAO;CAC9D,MAAM,WAAW,YAAY,SAAS,IAAI;CAC1C,MAAM,SAAyB,SAAS,SAAS,MAAM;EACrD,MAAM,QAAQ,WAAW,EAAE,QAAQ,EAAE;EACrC,OAAO,CACL,GAAG,EAAE,SAAS,KAAK,OAAO;GAAE,MAAM;GAA2B,SAAS,GAAG,MAAM,IAAI;EAAI,EAAE,GACzF,GAAG,EAAE,MAAM,KAAK,OAAO;GACrB,MAAM;GACN,MAAM,EAAE;GACR,SAAS,GAAG,MAAM,IAAI,EAAE,KAAK,cAAc,EAAE,QAAQ,OAAO,WAAW,EAAE,WAAW,OAAO;EAC7F,EAAE,CACJ;CACF,CAAC;CACD,OAAO;EAAE,IAAI,OAAO,WAAW;EAAG;EAAQ,MAAM,SAAS;EAAM;CAAS;AAC1E;;AAGA,SAAgB,kBAAkB,SAAyC;CACzE,MAAM,SAAS,iBAAiB,OAAO;CACvC,KAAK,MAAM,QAAQ,QAAQ,OAAO;EAChC,MAAM,MAAM,OAAO,OAAO,cAAc,KAAK,EAAE,IAAI,aAAa,KAAK,MAAM,KAAA;EAC3E,IAAI,CAAC,KAAK;EACV,MAAM,EAAE,IAAI,KAAK,IAAI,KAAK,OAAO,QAAQ,GAAG,WAAW;EACvD,MAAM,SAAS,IAAI,OAAO,UAAU,MAAM;EAC1C,IAAI,OAAO,SAAS;EACpB,KAAK,MAAM,KAAK,OAAO,MAAM,QAC3B,OAAO,KAAK;GACV,MAAM;GACN,SAAS,GAAG,EAAE,KAAK,SAAS,GAAG,EAAE,KAAK,KAAK,GAAG,EAAE,MAAM,KAAK,EAAE;GAC7D,MAAM,KAAK;EACb,CAAC;CAEL;CACA,OAAO;AACT;;;AC1BA,IAAI,UAAU;;AAGd,SAAgB,SAAS,QAAwB;CAC/C,WAAW;CAEX,OAAO,GAAG,OAAO,GADF,WAAW,QAAQ,aAAa,CAAC,CAAC,MAAM,GAAG,CAAC,KAC7B,QAAQ,SAAS,EAAE;AACnD;AAEA,SAAgB,QAAQ,SAAyB,IAAkC;CACjF,OAAO,QAAQ,MAAM,MAAM,MAAM,EAAE,OAAO,EAAE;AAC9C;AAEA,MAAM,SAAS,OAAgB,OAAO,OAAO,cAAc,EAAE,IAAI,aAAa,MAAM,KAAA;AAEpF,SAAgB,QAAQ,SAAiC;CACvD,OAAO,QAAQ,MAAM,SAAS,SAC5B,SAAS,IAAI,CAAC,CAAC,KAAK,OAAO;EACzB,IAAI,GAAG,EAAE,OAAO,IAAI,KAAK,GAAG,GAAG,EAAE,OAAO,EAAE,UAAU,KAAA,IAAY,KAAK,IAAI,EAAE,MAAM;EACjF,QAAQ,EAAE;EACV,QAAQ,KAAK;EACb,MAAM,EAAE;EACR,GAAI,EAAE,UAAU,KAAA,IAAY,CAAC,IAAI,EAAE,OAAO,EAAE,MAAM;CACpD,EAAE,CACJ;AACF;;AAGA,SAAgB,QACd,SACA,IACA,OAA+F,CAAC,GACnD;CAC7C,MAAM,MAAM,MAAM,EAAE;CACpB,IAAI,CAAC,KAAK,MAAM,IAAI,MAAM,oBAAoB,GAAG,EAAE;CACnD,MAAM,KAAK,KAAK,MAAM,SAAS,EAAE;CACjC,IAAI,QAAQ,SAAS,EAAE,GAAG,MAAM,IAAI,MAAM,YAAY,GAAG,iBAAiB;CAC1E,MAAM,OAAiB;EACrB,GAAG,IAAI,SAAS;EAChB,GAAG,KAAK;EACR;EACA;EACA,GAAI,KAAK,UAAU,KAAA,IAAY,CAAC,IAAI,EAAE,OAAO,KAAK,MAAM;CAC1D;CACA,OAAO;EACL,SAAS;GACP,GAAG;GACH,OAAO,CAAC,GAAG,QAAQ,OAAO,IAAI;GAC9B,GAAI,KAAK,WAAW,EAAE,QAAQ;IAAE,GAAG,QAAQ;KAAS,KAAK,KAAK;GAAS,EAAE,IAAI,CAAC;EAChF;EACA;CACF;AACF;AAEA,SAAS,QAAQ,MAAgB,MAAyB,OAA0B;CAClF,MAAM,CAAC,MAAM,GAAG,QAAQ;CACxB,IAAI,KAAK,WAAW,GAAG;EACrB,MAAM,OAAgC,EAAE,GAAG,KAAK;EAChD,IAAI,UAAU,KAAA,GAAW,OAAO,KAAK;OAChC,KAAK,QAAQ;EAClB,OAAO;CACT;CACA,MAAM,QAAS,KAAiC;CAChD,MAAM,QAAQ,OAAO,UAAU,YAAY,UAAU,OAAO,QAAQ,CAAC;CACrE,OAAO;EAAE,GAAG;GAAO,OAAO,QAAQ,OAAmB,MAAM,KAAK;CAAE;AACpE;AAEA,SAAS,QAAQ,MAAgB,MAAkC;CACjE,IAAI,QAAiB;CACrB,KAAK,MAAM,OAAO,MAAM,QAAS,QAAgD;CACjF,OAAO;AACT;AAEA,SAAS,OAAO,MAAgB,MAAgC;CAC9D,OAAO,MAAM,KAAK,EAAE,CAAC,EAAE,MAAM,MAAM,MAAM,EAAE,OAAO,IAAI;AACxD;;AAGA,SAAgB,WAAW,SAAyB,IAA4B;CAC9E,MAAM,QAAQ,QAAQ,MACnB,QAAQ,MAAM,EAAE,OAAO,EAAE,CAAC,CAC1B,KAAK,MAAM;EACV,IAAI,OAAO;EACX,KAAK,MAAM,OAAO,SAAS,CAAC,CAAC,CAC1B,QAAQ,MAAM,EAAE,WAAW,EAAE,CAAC,CAC9B,QAAQ,GACT,OAAO,OAAO,MAAM,IAAI,MAAM,EAAE;EAElC,OAAO;CACT,CAAC;CACH,MAAM,SAAS,QAAQ,SAAS,EAAE,GAAG,QAAQ,OAAO,IAAI,KAAA;CACxD,IAAI,QAAQ,OAAO,OAAO;CAC1B,MAAM,SAAS,EAAE,GAAG,QAAQ,OAAO;CACnC,OAAO,OAAO;CACd,OAAO;EAAE,GAAG;EAAS;EAAO;EAAQ,GAAI,SAAS,EAAE,OAAO,IAAI,CAAC;CAAG;AACpE;;AAGA,SAAS,OAAO,MAAgB,QAAgB,QAA0B;CACxE,MAAM,OAAO,OAAO,MAAM,MAAM;CAChC,IAAI,CAAC,MAAM,OAAO;CAClB,MAAM,QAAQ,QAAQ,MAAM,KAAK,IAAI;CACrC,IAAI,MAAM,QAAQ,KAAK,GACrB,OAAO,QACL,MACA,KAAK,MACL,MAAM,QAAQ,MAAM,MAAM,MAAM,CAClC;CACF,OAAO,UAAU,SAAS,QAAQ,MAAM,KAAK,MAAM,KAAA,CAAS,IAAI;AAClE;;;;;AAMA,SAAgB,WACd,SACA,IACA,OACgB;CAChB,OAAO;EACL,GAAG;EACH,OAAO,QAAQ,MAAM,KAAK,MAAM;GAC9B,IAAI,EAAE,OAAO,IAAI,OAAO;GACxB,MAAM,QAAQ,WAAW,QAAQ,MAAM,QAAQ,EAAE;GAEjD,OAAO;IAAE,GADM,MAAM,YAAY,EAAE,IAAI,IAAI,IAAI,IAAI,OAAO,IAAI,GAAG,WAAW,KAAA,CAAM,CAAC;IAC/D,IAAI,EAAE;IAAI,IAAI,EAAE;IAAI,GAAI,UAAU,KAAA,IAAY,CAAC,IAAI,EAAE,MAAM;GAAG;EACpF,CAAC;CACH;AACF;AAEA,SAAgB,SAAS,SAAyB,IAAY,UAAoC;CAChG,OAAO;EAAE,GAAG;EAAS,QAAQ;GAAE,GAAG,QAAQ;IAAS,KAAK;EAAS;CAAE;AACrE;;AAGA,SAAgB,WAAW,SAAyB,YAAuC;CACzF,MAAM,SAAS,QAAQ,SAAS,WAAW,MAAM;CACjD,MAAM,SAAS,QAAQ,SAAS,WAAW,MAAM;CACjD,IAAI,CAAC,UAAU,CAAC,QAAQ,OAAO;EAAE,IAAI;EAAO,QAAQ;CAAwC;CAC5F,IAAI,OAAO,OAAO,OAAO,IAAI,OAAO;EAAE,IAAI;EAAO,QAAQ;CAA6B;CACtF,MAAM,OAAO,MAAM,OAAO,EAAE;CAC5B,IAAI,CAAC,QAAQ,CAAC,MAAM,OAAO,EAAE,GAAG,OAAO;EAAE,IAAI;EAAO,QAAQ;CAAmB;CAC/E,IAAI,CAAC,KAAK,QAAQ,OAAO;EAAE,IAAI;EAAO,QAAQ,GAAG,KAAK,MAAM;CAAiB;CAC7E,MAAM,OAAO,OAAO,QAAQ,WAAW,IAAI;CAC3C,IAAI,CAAC,MAAM,OAAO;EAAE,IAAI;EAAO,QAAQ,GAAG,OAAO,GAAG,iBAAiB,WAAW,KAAK;CAAI;CACzF,MAAM,OAAO,SAAS,MAAM,CAAC,CAAC,QAAQ,MAAM,EAAE,SAAS,KAAK,EAAE;CAC9D,IAAI,KAAK,MAAM,MAAM,EAAE,WAAW,OAAO,EAAE,GACzC,OAAO;EAAE,IAAI;EAAO,QAAQ;CAAqC;CACnE,IAAI,KAAK,SAAS,KAAK,CAAC,KAAK,UAC3B,OAAO;EAAE,IAAI;EAAO,QAAQ,UAAU,KAAK,MAAM;CAA6B;CAChF,IAAI,WAAW,QAAQ,OAAO,OAAO,EAAE,CAAC,CAAC,IAAI,OAAO,EAAE,GACpD,OAAO;EAAE,IAAI;EAAO,QAAQ;CAAkE;CAEhG,OAAO,EAAE,IAAI,KAAK;AACpB;;AAGA,SAAgB,QAAQ,SAAyB,YAAwC;CACvF,MAAM,UAAU,WAAW,SAAS,UAAU;CAC9C,IAAI,CAAC,QAAQ,IAAI,MAAM,IAAI,MAAM,QAAQ,MAAM;CAC/C,OAAO;EACL,GAAG;EACH,OAAO,QAAQ,MAAM,KAAK,MAAM;GAC9B,IAAI,EAAE,OAAO,WAAW,QAAQ,OAAO;GACvC,MAAM,OAAO,OAAO,GAAG,WAAW,IAAI;GACtC,MAAM,UAAU,QAAQ,GAAG,KAAK,IAAI;GACpC,MAAM,QAAQ,KAAK,WACf,CAAC,GAAI,MAAM,QAAQ,OAAO,IAAI,UAAU,CAAC,GAAI,WAAW,MAAM,IAC9D,WAAW;GACf,OAAO,QAAQ,GAAG,KAAK,MAAM,KAAK;EACpC,CAAC;CACH;AACF;;AAGA,SAAgB,WACd,SACA,MACgB;CAChB,OAAO;EACL,GAAG;EACH,OAAO,QAAQ,MAAM,KAAK,MAAO,EAAE,OAAO,KAAK,SAAS,OAAO,GAAG,KAAK,MAAM,KAAK,MAAM,IAAI,CAAE;CAChG;AACF;;;;;;;;;;;;;;ACzMA,MAAa,QAAQ,EAAE,MAAM;CAAC,EAAE,OAAO;CAAG,EAAE,OAAO;CAAG,EAAE,QAAQ;CAAG,EAAE,KAAK;AAAC,CAAC;;AAI5E,MAAa,MAAM,EAAE,OAAO,EAAE,OAAO,GAAG,KAAK;;;;;;;;AAU7C,MAAa,cAAc,EAAE,KAAK;CAChC;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AACF,CAAC;AAGD,MAAa,SAAS,EAAE,OAAO;CAC7B,MAAM,EAAE,OAAO;CACf,aAAa;CACb,YAAY,EAAE,OAAO,CAAC,CAAC,SAAS,yCAAyC;CACzE,UAAU,EAAE,QAAQ,CAAC,CAAC,QAAQ,IAAI;CAClC,OAAO,EAAE,OAAO,CAAC,CAAC,SAAS,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,SAAS,qCAAqC;CACzF,aAAa,EAAE,OAAO,CAAC,CAAC,SAAS,CAAC,CAAC,QAAQ,IAAI;CAC/C,UAAU,EAAE,QAAQ,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC,SAAS,wCAAwC;CACtF,YAAY,EACT,OAAO,CAAC,CACR,SAAS,CAAC,CACV,QAAQ,IAAI,CAAC,CACb,SAAS,2DAA2D;AACzE,CAAC;AAGD,MAAa,WAAW,EAAE,OAAO;CAC/B,MAAM,EAAE,OAAO,CAAC,CAAC,SAAS,+DAA+D;CACzF,OAAO,EAAE,OAAO,CAAC,CAAC,SAAS,CAAC,CAAC,QAAQ,IAAI;CACzC,aAAa,EAAE,OAAO,CAAC,CAAC,SAAS,CAAC,CAAC,QAAQ,IAAI;CAC/C,UAAU,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,SAAS,CAAC,CAAC,QAAQ,IAAI;AACpD,CAAC;AAGD,MAAa,QAAQ,SAAS,OAAO,EAAE,SAAS,EAAE,MAAM,MAAM,EAAE,CAAC;;AAIjE,MAAa,SAAS,EAAE,OAAO;CAC7B,SAAS,EAAE,MAAM,MAAM;CACvB,MAAM,EAAE,MAAM,GAAG;CACjB,WAAW,EACR,OAAO,CAAC,CACR,IAAI,CAAC,CACL,SAAS,CAAC,CACV,QAAQ,IAAI,CAAC,CACb,SAAS,wDAAwD;AACtE,CAAC;AAGD,MAAa,cAAc,EAAE,OAAO;CAClC,MAAM,EAAE,OAAO;CACf,aAAa;CACb,UAAU,EAAE,QAAQ,CAAC,CAAC,QAAQ,IAAI;CAClC,aAAa,EAAE,OAAO,CAAC,CAAC,SAAS,CAAC,CAAC,QAAQ,IAAI;CAC/C,MAAM,EAAE,OAAO,CAAC,CAAC,SAAS,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,SAAS,0CAA0C;CAC7F,YAAY,EAAE,OAAO,CAAC,CAAC,SAAS,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,SAAS,iCAAiC;AAC5F,CAAC;AAGD,MAAa,eAAe,EAAE,OAAO;CACnC,MAAM,EAAE,OAAO;CACf,aAAa,EAAE,OAAO,CAAC,CAAC,SAAS,CAAC,CAAC,QAAQ,IAAI;CAC/C,UAAU,EACP,MAAM,EAAE,OAAO,CAAC,CAAC,CACjB,QAAQ,CAAC,CAAC,CAAC,CACX,SAAS,6DAA6D;CACzE,kBAAkB,EACf,QAAQ,CAAC,CACT,SAAS,CAAC,CACV,SACC,sHACF;CACF,QAAQ,EAAE,MAAM,WAAW;AAC7B,CAAC;AAGD,MAAa,eAAe,EAAE,OAAO;CACnC,MAAM,EAAE,OAAO;CACf,UAAU,EAAE,MAAM,YAAY;AAChC,CAAC;;AAID,SAAgB,WAAW,OAAc,MAAsB;CAC7D,MAAM,SAAS,KAAK,YAAY;CAChC,MAAM,SAAS,MAAM,QAAQ,MAAM,MAAM,EAAE,KAAK,YAAY,MAAM,MAAM;CACxE,IAAI,CAAC,QAAQ,MAAM,IAAI,MAAM,GAAG,MAAM,KAAK,kBAAkB,KAAK,EAAE;CACpE,OAAO;AACT;AAEA,SAAgB,WAAW,QAAsB,MAA4B;CAC3E,MAAM,SAAS,OAAO,SAAS,MAAM,MAAM,EAAE,SAAS,IAAI;CAC1D,IAAI,CAAC,QAAQ,MAAM,IAAI,MAAM,GAAG,OAAO,KAAK,kBAAkB,KAAK,EAAE;CACrE,OAAO;AACT;AAEA,SAAgB,UAAU,QAAsB,MAA2B;CACzE,MAAM,QAAQ,OAAO,OAAO,MAAM,MAAM,EAAE,SAAS,IAAI;CACvD,IAAI,CAAC,OAAO,MAAM,IAAI,MAAM,GAAG,OAAO,KAAK,iBAAiB,KAAK,EAAE;CACnE,OAAO;AACT;;AAGA,SAAgB,OACd,OACQ;CACR,OAAO,OAAO,MAAM,KAAK;AAC3B"}
1	+ {"version":3,"file":"index.mjs","names":["pad","SAMPLES","params","params","params","params","scalar","params","params","params","index","params","params","params","params","params","SCALAR","params","params","params","params","truncate","params","all","truncate","params","params","params","params"],"sources":["../src/connector.ts","../src/mapping/context.ts","../src/mapping/result.ts","../src/mapping/time.ts","../src/mapping/types.ts","../src/mapping/values.ts","../src/mapping/predicate.ts","../src/mapping/expect.ts","../src/mapping/nodes/def.ts","../src/mapping/nodes/aggregate.ts","../src/mapping/ops/def.ts","../src/mapping/document.ts","../src/mapping/nodes/assert.ts","../src/mapping/nodes/distinct.ts","../src/mapping/jsonschema.ts","../src/mapping/nodes/source.ts","../src/mapping/nodes/filter.ts","../src/mapping/nodes/join.ts","../src/mapping/ops/access.ts","../src/mapping/ops/convert.ts","../src/mapping/ops/date.ts","../src/mapping/ops/fn.ts","../src/mapping/ops/list.ts","../src/mapping/ops/lookup.ts","../src/mapping/ops/nulls.ts","../src/mapping/units.ts","../src/mapping/ops/numeric.ts","../src/mapping/ops/string.ts","../src/mapping/ops/when.ts","../src/mapping/ops/index.ts","../src/mapping/sugar.ts","../src/mapping/pipeline.ts","../src/mapping/nodes/map.ts","../src/mapping/nodes/metrics.ts","../src/mapping/nodes/sink.ts","../src/mapping/nodes/transform.ts","../src/mapping/nodes/union.ts","../src/mapping/nodes/index.ts","../src/mapping/graph.ts","../src/mapping/compile.ts","../src/mapping/execute.ts","../src/mapping/examples.ts","../src/mapping/check.ts","../src/mapping/edit.ts","../src/schema.ts"],"sourcesContent":["/*\n The contract every source connector fulfils: list tables, read column names and types,\n * sample rows, plus a full `read` and a native `query`. Concrete connectors live with the\n * host that reaches its systems (the demo's NetSuite and Snowflake clients are in apps/api);\n * the mapping engine only ever sees rows.\n \n Connectors decode the wire format (numbers sent as strings, dates as epoch days or in the\n * account's date format) but never interpret values: a NetSuite checkbox still arrives as\n * 'T' / 'F', a placeholder date still arrives as '9999-01-01'. Interpretation is the mapping's job.\n /\n\nimport type { Row, RowSet, Table, TableRef } from './schema'\n\nexport interface Connector {\n /* Name of the source system, e.g. \"NetSuite\"; becomes `source_system` on imported rows. /\n readonly system: string\n /* Language `query` accepts, e.g. \"suiteql\" or \"snowflake\". /\n readonly dialect: string\n listTables(): Promise<TableRef[]>\n describe(table: string): Promise<Table>\n sample(table: string, limit?: number): Promise<RowSet>\n read(table: string, options?: { batchSize?: number }): AsyncIterable<Row[]>\n query(sql: string, options?: { limit?: number }): Promise<RowSet>\n}\n\n/* The source rejected a request; the message is safe to show to the user. /\nexport class ConnectorError extends Error {\n override name = 'ConnectorError'\n}\n\n/* The source could not be reached at all (network, DNS, timeout). /\nexport class SourceUnavailable extends ConnectorError {\n override name = 'SourceUnavailable'\n}\n","/\n Contexts: the only channel through which a node or step learns anything not in its input.\n * They hold frozen data, never clocks, clients or handles.\n \n `RunContext` / `RecordContext` exist at sync time. `GraphEnv` (from the host) and\n * `RecordEnv` (built by the compiler) exist at compile time.\n /\n\nimport type { TargetSchema } from '../schema'\nimport type { Result, StepError } from './result'\nimport type { Instant } from './time'\nimport type { MType, RecordType } from './types'\nimport type { Json, Rec, Relation, Val } from './values'\n\nexport interface RunContext {\n /* Clock frozen at the start of the run. The only source of \"now\". /\n readonly now: Instant\n readonly tz: string\n readonly locale: string\n /* Every source, read once at run start and frozen, keyed by `source` node id. /\n readonly snapshot: Readonly<Record<string, Relation>>\n /* Named constants of the version. /\n readonly params: Readonly<Record<string, Json>>\n /* Static lookup tables of the version, for the `lookup` op. /\n readonly tables: Readonly<Record<string, Readonly<Record<string, Json>>>>\n readonly run: { readonly syncRunId: string; readonly mappingVersionId: string }\n}\n\nexport interface RecordContext extends RunContext {\n /* The record under mapping inside a `map` node. /\n readonly record: Rec\n}\n\n/* A reviewed, version-pinned record function for the `fn` op (escape hatch). /\nexport interface FnDef {\n /* Accepted input type; omitted means any. /\n readonly input?: MType\n readonly output: MType\n /* Whether it can return an error. Defaults to true. /\n readonly fallible?: boolean\n readonly run: (value: Val, ctx: RecordContext) => Result<Val, StepError>\n}\n\n/* A reviewed, version-pinned collection function for the `transform` node (escape hatch). /\nexport interface TransformDef {\n readonly run: (inputs: readonly Relation[], ctx: RunContext) => Result<Relation, string>\n}\n\n/* What the host supplies to compile a version. /\nexport interface GraphEnv {\n /* The internal model sinks write to; also the schema of `system: \"internal\"` sources. /\n readonly targets: TargetSchema\n readonly functions?: Readonly<Record<string, FnDef>>\n readonly transforms?: Readonly<Record<string, TransformDef>>\n}\n\n/* Compile-time view of a record scope: field pipelines, predicates. /\nexport interface RecordEnv {\n /* Type of the current record, against which `extract` and `path` are checked. /\n readonly record: RecordType\n readonly params: Readonly<Record<string, Json>>\n readonly tables: Readonly<Record<string, Readonly<Record<string, Json>>>>\n readonly functions: Readonly<Record<string, FnDef>>\n /* `each` nesting depth; capped at 1. /\n readonly depth: number\n /* Set when anything resolves against the run clock (`today`, `now`). /\n readonly clock: { used: boolean }\n}\n\n/* Type of a record field, or an error naming the missing field. /\nexport function fieldType(record: RecordType, path: string): Result<MType, string> {\n const type = Object.hasOwn(record.fields, path) ? record.fields[path] : undefined\n return type\n ? { ok: true, value: type }\n : {\n ok: false,\n error: `unknown field '${path}' (record has ${Object.keys(record.fields).join(', ') \|\| 'no fields'})`,\n }\n}\n\nexport function recordEnv(\n record: RecordType,\n from: Partial<Omit<RecordEnv, 'record'>> = {},\n): RecordEnv {\n return {\n record,\n params: from.params ?? {},\n tables: from.tables ?? {},\n functions: from.functions ?? {},\n depth: from.depth ?? 0,\n clock: from.clock ?? { used: false },\n }\n}\n","/\n Failure as a value. Steps, nodes and the compiler return `Result` instead of throwing, so\n * the executor can apply each node's failure policy (arch.md,\n * \"Failure policy and partial results\").\n /\n\nexport type Result<T, E> =\n \| { readonly ok: true; readonly value: T }\n \| { readonly ok: false; readonly error: E }\n\nexport function ok<T>(value: T): { readonly ok: true; readonly value: T } {\n return { ok: true, value }\n}\n\n/* The value of a result the caller has already checked, e.g. by `signature` before `run`. /\nexport function expectOk<T>(result: Result<T, unknown>): T {\n if (!result.ok) throw new Error(`unexpected failure: ${JSON.stringify(result.error)}`)\n return result.value\n}\n\nexport function err<E>(error: E): { readonly ok: false; readonly error: E } {\n return { ok: false, error }\n}\n\n/* What a failing record op reports. The pipeline adds the op and step, the map the node. /\nexport type ErrorCode =\n \| 'type_mismatch'\n \| 'parse_failed'\n \| 'unknown_unit'\n \| 'lookup_miss'\n \| 'required_null'\n \| 'domain_error'\n \| 'fn_failed'\n\nexport interface StepError {\n readonly code: ErrorCode\n readonly detail: string\n}\n\n/* A runtime failure located in the graph. /\nexport interface MappingError extends StepError {\n readonly node: string\n readonly op: string\n readonly step?: number\n readonly key?: string\n}\n\nexport function stepError(code: ErrorCode, detail: string): { ok: false; error: StepError } {\n return err({ code, detail })\n}\n\n/* A problem found while checking a version, located as precisely as possible. /\nexport interface CompileIssue {\n readonly code: CompileCode\n readonly message: string\n readonly node?: string\n /* The `map` field key, aggregate field name, or expectation clause. /\n readonly field?: string\n /* Index of the step inside the field pipeline. /\n readonly step?: number\n}\n\nexport type CompileCode =\n \| 'invalid_params'\n \| 'unknown_op'\n \| 'type_error'\n \| 'duplicate_id'\n \| 'dangling_ref'\n \| 'missing_input'\n \| 'cycle'\n \| 'dead_node'\n \| 'missing_schema'\n \| 'duplicate_sink'\n \| 'skip_tolerance'\n \| 'missing_expectation'\n \| 'invalid_expectation'\n \| 'unknown_reference'\n \| 'example_failed'\n","/\n Dates without a wall clock.\n \n The runtime value of the `date` type is an `Instant`: a frozen point in time in epoch\n * milliseconds. Calendar math (\"+10y\", \"start of day\") happens in an IANA time zone, using\n * `Intl.DateTimeFormat` to move between instants and wall-clock time. \"now\" only ever comes\n * from the run context (arch.md, \"Time\"), never from `Date.now()`.\n /\n\nimport { err, ok, type Result } from './result'\n\nexport class Instant {\n private constructor(readonly epochMs: number) {\n Object.freeze(this)\n }\n\n static ofEpochMs(epochMs: number): Instant {\n if (!Number.isFinite(epochMs)) throw new RangeError(`invalid epoch milliseconds ${epochMs}`)\n return new Instant(epochMs)\n }\n\n /* Strict ISO 8601 with an offset or `Z`, e.g. `2026-10-04T12:00:00Z`. /\n static parse(iso: string): Instant \| undefined {\n if (!ISO_INSTANT.test(iso)) return undefined\n const ms = Date.parse(iso)\n return Number.isNaN(ms) ? undefined : new Instant(ms)\n }\n\n toISOString(): string {\n return new Date(this.epochMs).toISOString()\n }\n\n toJSON(): string {\n return this.toISOString()\n }\n\n toString(): string {\n return this.toISOString()\n }\n}\n\nconst ISO_INSTANT = /^\\d{4}-\\d{2}-\\d{2}T\\d{2}:\\d{2}(:\\d{2}(\\.\\d{1,3})?)?(Z\|[+-]\\d{2}:\\d{2})$/\n\n// --- time zones ---------------------------------------------------------------------------\n\n/* Wall-clock fields in some time zone. Months are 1-12. /\nexport interface WallClock {\n readonly year: number\n readonly month: number\n readonly day: number\n readonly hour: number\n readonly minute: number\n readonly second: number\n readonly ms: number\n}\n\nconst formatters = new Map<string, Intl.DateTimeFormat>()\n\nfunction formatter(tz: string): Intl.DateTimeFormat {\n let f = formatters.get(tz)\n if (!f) {\n f = new Intl.DateTimeFormat('en-US', {\n timeZone: tz,\n hourCycle: 'h23',\n year: 'numeric',\n month: 'numeric',\n day: 'numeric',\n hour: 'numeric',\n minute: 'numeric',\n second: 'numeric',\n })\n formatters.set(tz, f)\n }\n return f\n}\n\nexport function isTimeZone(tz: string): boolean {\n try {\n formatter(tz)\n return true\n } catch {\n return false\n }\n}\n\n/* The wall clock in `tz` at `instant`. /\nexport function toWallClock(instant: Instant, tz: string): WallClock {\n const parts: Record<string, number> = {}\n for (const p of formatter(tz).formatToParts(new Date(instant.epochMs))) {\n if (p.type !== 'literal') parts[p.type] = Number(p.value)\n }\n return {\n year: parts.year as number,\n month: parts.month as number,\n day: parts.day as number,\n hour: parts.hour as number,\n minute: parts.minute as number,\n second: parts.second as number,\n ms: ((instant.epochMs % 1000) + 1000) % 1000,\n }\n}\n\nfunction wallAsUtc(w: WallClock): number {\n // Date.UTC maps years 0-99 to 1900-1999; setUTCFullYear does not.\n const d = new Date(Date.UTC(2000, w.month - 1, w.day, w.hour, w.minute, w.second, w.ms))\n d.setUTCFullYear(w.year)\n return d.getTime()\n}\n\n/* Offset of `tz` from UTC at `epochMs`, in milliseconds. /\nfunction offsetAt(epochMs: number, tz: string): number {\n return wallAsUtc(toWallClock(Instant.ofEpochMs(epochMs), tz)) - epochMs\n}\n\n/\n The instant at which the wall clock in `tz` shows `w`. A wall time skipped by a DST\n * transition resolves after the gap; an ambiguous one resolves to the earlier instant.\n /\nexport function fromWallClock(w: WallClock, tz: string): Instant {\n const local = wallAsUtc(w)\n // The offsets in force a day before and a day after cover both sides of any transition.\n const before = offsetAt(local - 86_400_000, tz)\n const after = offsetAt(local + 86_400_000, tz)\n const shows = (c: number) => wallAsUtc(toWallClock(Instant.ofEpochMs(c), tz)) === local\n const candidates = [local - before, local - after].filter(shows)\n // Inside a gap neither matches: keep the earlier offset, which lands after the gap.\n return Instant.ofEpochMs(candidates.length > 0 ? Math.min(...candidates) : local - before)\n}\n\nexport function daysInMonth(year: number, month: number): number {\n if (month === 2) return (year % 4 === 0 && year % 100 !== 0) \|\| year % 400 === 0 ? 29 : 28\n return [4, 6, 9, 11].includes(month) ? 30 : 31\n}\n\n// --- calendar math --------------------------------------------------------------------------\n\nexport type DurationUnit = 'y' \| 'mo' \| 'w' \| 'd' \| 'h'\n\nexport interface Duration {\n readonly amount: number\n readonly unit: DurationUnit\n}\n\nconst DURATION_PART = /([+-])(\\d+)(y\|mo\|w\|d\|h)/gy\n\n/* `+10y`, `-30d`, `+1y-2mo`: one or more signed amounts. /\nexport function parseDuration(text: string): Result<readonly Duration[], string> {\n const parts: Duration[] = []\n DURATION_PART.lastIndex = 0\n let at = 0\n while (at < text.length) {\n DURATION_PART.lastIndex = at\n const m = DURATION_PART.exec(text)\n if (!m) return err(`invalid duration '${text}', expected e.g. '+10y' or '-30d'`)\n const [, sign, digits, unit] = m\n parts.push({ amount: Number(digits) (sign === '-' ? -1 : 1), unit: unit as DurationUnit })\n at = DURATION_PART.lastIndex\n }\n if (parts.length === 0) return err(`invalid duration '${text}', expected e.g. '+10y' or '-30d'`)\n return ok(parts)\n}\n\n/** A duration already validated by `parseDuration` (e.g. by a params schema). /\nexport function duration(text: string): readonly Duration[] {\n const parsed = parseDuration(text)\n if (!parsed.ok) throw new Error(parsed.error)\n return parsed.value\n}\n\n/* Shift by calendar units in `tz`. Month ends clamp: Feb 29 + 1y is Feb 28. /\nexport function shift(instant: Instant, by: readonly Duration[], tz: string): Instant {\n let current = instant\n for (const { amount, unit } of by) {\n if (unit === 'h') {\n current = Instant.ofEpochMs(current.epochMs + amount 3_600_000)\n continue\n }\n const w = toWallClock(current, tz)\n if (unit === 'y' \|\| unit === 'mo') {\n const months = w.year * 12 + (w.month - 1) + (unit === 'y' ? amount * 12 : amount)\n const year = Math.floor(months / 12)\n const month = (months % 12) + 1\n current = fromWallClock(\n { ...w, year, month, day: Math.min(w.day, daysInMonth(year, month)) },\n tz,\n )\n } else {\n const days = unit === 'w' ? amount * 7 : amount\n const d = new Date(wallAsUtc({ ...w, hour: 0, minute: 0, second: 0, ms: 0 }))\n d.setUTCDate(d.getUTCDate() + days)\n current = fromWallClock(\n { ...w, year: d.getUTCFullYear(), month: d.getUTCMonth() + 1, day: d.getUTCDate() },\n tz,\n )\n }\n }\n return current\n}\n\nexport type TruncateUnit = 'day' \| 'month' \| 'year'\n\n/** Start of the day, month or year containing `instant`, in `tz`. /\nexport function truncate(instant: Instant, unit: TruncateUnit, tz: string): Instant {\n const w = toWallClock(instant, tz)\n return fromWallClock(\n {\n year: w.year,\n month: unit === 'year' ? 1 : w.month,\n day: unit === 'day' ? w.day : 1,\n hour: 0,\n minute: 0,\n second: 0,\n ms: 0,\n },\n tz,\n )\n}\n\n// --- date expressions -------------------------------------------------------------------------\n\n/\n A comparison date in a predicate: `today` or `now` plus durations (resolved against the\n * run's frozen clock), or a literal ISO date or instant.\n /\nexport type DateExpr =\n \| {\n readonly kind: 'relative'\n readonly anchor: 'today' \| 'now'\n readonly by: readonly Duration[]\n }\n \| { readonly kind: 'date'; readonly wall: WallClock }\n \| { readonly kind: 'instant'; readonly instant: Instant }\n\nconst RELATIVE = /^(today\|now)(.)$/\n\nexport function parseDateExpr(text: string): Result<DateExpr, string> {\n const rel = RELATIVE.exec(text)\n if (rel) {\n const anchor = rel[1] as 'today' \| 'now'\n if (rel[2] === '') return ok({ kind: 'relative', anchor, by: [] })\n const by = parseDuration(rel[2] as string)\n return by.ok ? ok({ kind: 'relative', anchor, by: by.value }) : by\n }\n const wall = parseWithFormat(text, DATE_ONLY)\n if (wall) return ok({ kind: 'date', wall })\n const instant = Instant.parse(text)\n if (instant) return ok({ kind: 'instant', instant })\n return err(\n `invalid date '${text}', expected 'today+10y', 'now-1d', 'YYYY-MM-DD' or an ISO instant`,\n )\n}\n\n/** Whether the expression reads the run clock (fixtures must then pin `now`). /\nexport function usesClock(expr: DateExpr): boolean {\n return expr.kind === 'relative'\n}\n\nexport function resolveDateExpr(expr: DateExpr, clock: { now: Instant; tz: string }): Instant {\n switch (expr.kind) {\n case 'instant':\n return expr.instant\n case 'date':\n return fromWallClock(expr.wall, clock.tz)\n case 'relative': {\n const anchor = expr.anchor === 'today' ? truncate(clock.now, 'day', clock.tz) : clock.now\n return shift(anchor, expr.by, clock.tz)\n }\n }\n}\n\n// --- formats ------------------------------------------------------------------------------------\n\n/\n A date format: `iso`, `epoch_ms`, `epoch_s`, or a pattern of the tokens `YYYY MM DD HH mm ss`\n * with any other characters taken literally.\n /\nexport type DateFormat =\n \| { readonly kind: 'iso' }\n \| { readonly kind: 'epoch'; readonly unit: 'ms' \| 's' }\n \| { readonly kind: 'pattern'; readonly tokens: readonly string[]; readonly regex: RegExp }\n\nconst TOKENS = ['YYYY', 'MM', 'DD', 'HH', 'mm', 'ss'] as const\nconst TOKEN_SPLIT = /(YYYY\|MM\|DD\|HH\|mm\|ss)/\n\nexport function parseDateFormat(text: string): Result<DateFormat, string> {\n if (text === 'iso') return ok({ kind: 'iso' })\n if (text === 'epoch_ms') return ok({ kind: 'epoch', unit: 'ms' })\n if (text === 'epoch_s') return ok({ kind: 'epoch', unit: 's' })\n const tokens = text.split(TOKEN_SPLIT).filter((p) => p !== '')\n const used = tokens.filter((p) => (TOKENS as readonly string[]).includes(p))\n if (used.length === 0) return err(`date format '${text}' has none of ${TOKENS.join(' ')}`)\n if (new Set(used).size !== used.length) return err(`date format '${text}' repeats a token`)\n const source = tokens\n .map((p) => {\n if (p === 'YYYY') return '(\\\\d{4})'\n if ((TOKENS as readonly string[]).includes(p)) return '(\\\\d{2})'\n return p.replace(/[.+?^${}()\|[\\]\\\\]/g, '\\\\$&')\n })\n .join('')\n return ok({ kind: 'pattern', tokens, regex: new RegExp(`^${source}$`) })\n}\n\n/** A format already validated by `parseDateFormat` (e.g. by a params schema). /\nexport function dateFormat(text: string): DateFormat {\n const format = parseDateFormat(text)\n if (!format.ok) throw new Error(format.error)\n return format.value\n}\n\nconst DATE_ONLY = parseDateFormat('YYYY-MM-DD')\nconst DATE_TIME = parseDateFormat('YYYY-MM-DDTHH:mm:ss')\n\n/* Whether a pattern format names a full calendar date (needed to parse, not to format). /\nexport function hasFullDate(format: DateFormat): boolean {\n return format.kind !== 'pattern' \|\| ['YYYY', 'MM', 'DD'].every((x) => format.tokens.includes(x))\n}\n\nfunction parseWithFormat(text: string, format: Result<DateFormat, string>): WallClock \| undefined {\n if (!format.ok \|\| format.value.kind !== 'pattern') return undefined\n const m = format.value.regex.exec(text)\n if (!m) return undefined\n const fields: Record<string, number> = { YYYY: 1970, MM: 1, DD: 1, HH: 0, mm: 0, ss: 0 }\n let group = 1\n for (const token of format.value.tokens) {\n if ((TOKENS as readonly string[]).includes(token)) fields[token] = Number(m[group++])\n }\n const w: WallClock = {\n year: fields.YYYY as number,\n month: fields.MM as number,\n day: fields.DD as number,\n hour: fields.HH as number,\n minute: fields.mm as number,\n second: fields.ss as number,\n ms: 0,\n }\n const valid =\n w.month >= 1 &&\n w.month <= 12 &&\n w.day >= 1 &&\n w.day <= daysInMonth(w.year, w.month) &&\n w.hour <= 23 &&\n w.minute <= 59 &&\n w.second <= 59\n return valid ? w : undefined\n}\n\n/\n Parse a source value. Pattern and ISO strings without an offset are wall-clock times in\n * `tz`; epoch formats take a number or a numeric string. Undefined when it does not parse.\n /\nexport function parseDateValue(\n input: string \| number,\n format: DateFormat,\n tz: string,\n): Instant \| undefined {\n if (format.kind === 'epoch') {\n const n = typeof input === 'number' ? input : /^-?\\d+$/.test(input) ? Number(input) : Number.NaN\n return Number.isFinite(n) ? Instant.ofEpochMs(format.unit === 's' ? n 1000 : n) : undefined\n }\n if (typeof input !== 'string') return undefined\n if (format.kind === 'pattern') {\n const w = parseWithFormat(input, ok(format))\n return w && fromWallClock(w, tz)\n }\n const wall = parseWithFormat(input, DATE_ONLY) ?? parseWithFormat(input, DATE_TIME)\n return wall ? fromWallClock(wall, tz) : Instant.parse(input)\n}\n\nconst pad = (n: number, width = 2) => String(n).padStart(width, '0')\n\n/** Format an instant. `iso` is UTC (`...Z`); patterns and epoch formats as named. /\nexport function formatDate(instant: Instant, format: DateFormat, tz: string): string {\n if (format.kind === 'iso') return instant.toISOString()\n if (format.kind === 'epoch') {\n return String(format.unit === 's' ? Math.floor(instant.epochMs / 1000) : instant.epochMs)\n }\n const w = toWallClock(instant, tz)\n const values: Record<string, string> = {\n YYYY: pad(w.year, 4),\n MM: pad(w.month),\n DD: pad(w.day),\n HH: pad(w.hour),\n mm: pad(w.minute),\n ss: pad(w.second),\n }\n return format.tokens.map((p) => values[p] ?? p).join('')\n}\n\n/* `YYYY-MM-DD` of the instant in `tz`, how `date` target fields are written. /\nexport function toDateString(instant: Instant, tz: string): string {\n const w = toWallClock(instant, tz)\n return `${pad(w.year, 4)}-${pad(w.month)}-${pad(w.day)}`\n}\n","/\n The mapping language's type algebra (arch.md, \"Type checking\").\n \n Nullability is part of the type, so the pipeline compiler (not each op) implements null\n * short-circuiting. `Rel` (a collection) is deliberately not an `MType`: a record field can be\n * a list, never a collection.\n \n Three kinds exist only for the checker: `unit` is the input of a pipeline's first step,\n * `unknown` is a value nothing is known about (top), and `never` is the bottom type, used for\n * the element of `[]` and, as `t.null = nullable(never)`, for a literal `null`.\n /\n\nimport type { LogicalType } from '../schema'\nimport { err, ok, type Result } from './result'\n\nexport type NonNull =\n \| { readonly kind: 'string' }\n \| { readonly kind: 'number' }\n \| { readonly kind: 'boolean' }\n \| { readonly kind: 'date' }\n \| { readonly kind: 'list'; readonly of: MType }\n \| { readonly kind: 'tuple'; readonly of: readonly MType[] }\n \| { readonly kind: 'record'; readonly fields: Readonly<Record<string, MType>> }\n \| { readonly kind: 'unit' }\n \| { readonly kind: 'unknown' }\n \| { readonly kind: 'never' }\n\nexport type NullableType = { readonly kind: 'nullable'; readonly of: NonNull }\n\nexport type MType = NonNull \| NullableType\n\nexport type RecordType = Extract<NonNull, { kind: 'record' }>\nexport type ListType = Extract<NonNull, { kind: 'list' }>\nexport type TupleType = Extract<NonNull, { kind: 'tuple' }>\n\n/* Type constructors. `t.nullable` flattens, so `nullable(nullable(x))` is `nullable(x)`. /\nexport const t = {\n string: { kind: 'string' },\n number: { kind: 'number' },\n boolean: { kind: 'boolean' },\n date: { kind: 'date' },\n unit: { kind: 'unit' },\n unknown: { kind: 'unknown' },\n never: { kind: 'never' },\n null: { kind: 'nullable', of: { kind: 'never' } },\n list: (of: MType): MType => ({ kind: 'list', of }),\n tuple: (of: readonly MType[]): MType => ({ kind: 'tuple', of }),\n record: (fields: Readonly<Record<string, MType>>): RecordType => ({ kind: 'record', fields }),\n nullable: (of: MType): MType => (of.kind === 'nullable' ? of : { kind: 'nullable', of }),\n} as const satisfies Record<string, MType \| ((...args: never[]) => MType)>\n\nexport function isNullable(type: MType): type is NullableType {\n return type.kind === 'nullable'\n}\n\n/* The type without its null. /\nexport function stripNull(type: MType): NonNull {\n return type.kind === 'nullable' ? type.of : type\n}\n\n/* Whether a value of this type can be null at runtime (`unknown` can be anything). /\nexport function mayBeNull(type: MType): boolean {\n return type.kind === 'nullable' \|\| type.kind === 'unknown'\n}\n\n/* `nullable(x)` when `when` is true, else `x`. /\nexport function nullableIf(type: MType, when: boolean): MType {\n return when ? t.nullable(type) : type\n}\n\n/* Human-readable form used in every type error: `number?`, `list<string>`, `(number, string)`. /\nexport function show(type: MType): string {\n switch (type.kind) {\n case 'nullable':\n return type.of.kind === 'never' ? 'null' : `${show(type.of)}?`\n case 'list':\n return `list<${show(type.of)}>`\n case 'tuple':\n return `(${type.of.map(show).join(', ')})`\n case 'record':\n return `{ ${Object.entries(type.fields)\n .map(([k, v]) => `${k}: ${show(v)}`)\n .join(', ')} }`\n case 'unit':\n return '()'\n default:\n return type.kind\n }\n}\n\nexport function equalTypes(a: MType, b: MType): boolean {\n return show(a) === show(b)\n}\n\n/* Can a value of type `from` be used where `to` is expected? /\nexport function assignable(from: MType, to: MType): boolean {\n if (to.kind === 'unknown') return true\n if (from.kind === 'never') return true\n if (from.kind === 'nullable') {\n return to.kind === 'nullable' && assignable(from.of, to.of)\n }\n if (to.kind === 'nullable') return assignable(from, to.of)\n switch (from.kind) {\n case 'list':\n return to.kind === 'list' && assignable(from.of, to.of)\n case 'tuple':\n return (\n to.kind === 'tuple' &&\n to.of.length === from.of.length &&\n from.of.every((f, i) => assignable(f, to.of[i] as MType))\n )\n case 'record':\n return (\n to.kind === 'record' &&\n Object.entries(to.fields).every(\n ([k, v]) => k in from.fields && assignable(from.fields[k] as MType, v),\n )\n )\n default:\n return from.kind === to.kind\n }\n}\n\nconst SCALAR_KINDS = new Set(['string', 'number', 'boolean', 'date'])\n\n/* Can values of these types be compared for equality (join keys, `eq`, `in`)? /\nexport function comparable(a: MType, b: MType): boolean {\n const x = stripNull(a)\n const y = stripNull(b)\n if (x.kind === 'unknown' \|\| y.kind === 'unknown') return true\n if (x.kind === 'never' \|\| y.kind === 'never') return true\n if (x.kind === 'list' && y.kind === 'list') return comparable(x.of, y.of)\n return SCALAR_KINDS.has(x.kind) && x.kind === y.kind\n}\n\n/* Can values of this type be ordered (`lt`, `min`, sorting)? /\nexport function orderable(type: MType): boolean {\n const kind = stripNull(type).kind\n return kind === 'number' \|\| kind === 'date' \|\| kind === 'string'\n}\n\n/\n The common type of two branches (`when` cases, `coalesce`, `union` inputs): equal modulo\n * nullability, nullable when either side is. `never` unifies with anything.\n /\nexport function unify(a: MType, b: MType): Result<MType, string> {\n const nullable = isNullable(a) \|\| isNullable(b)\n const x = stripNull(a)\n const y = stripNull(b)\n const base = unifyNonNull(x, y)\n if (!base.ok) return base\n return ok(nullableIf(base.value, nullable))\n}\n\nfunction unifyNonNull(x: NonNull, y: NonNull): Result<MType, string> {\n const mismatch = () => err(`${show(x)} and ${show(y)} have no common type`)\n if (x.kind === 'never') return ok(y)\n if (y.kind === 'never') return ok(x)\n if (x.kind === 'unknown' \|\| y.kind === 'unknown') return ok(t.unknown)\n if (x.kind === 'list' && y.kind === 'list') {\n const of = unify(x.of, y.of)\n return of.ok ? ok(t.list(of.value)) : mismatch()\n }\n if (x.kind === 'tuple' && y.kind === 'tuple') {\n if (x.of.length !== y.of.length) return mismatch()\n const of: MType[] = []\n for (const [i, a] of x.of.entries()) {\n const u = unify(a, y.of[i] as MType)\n if (!u.ok) return mismatch()\n of.push(u.value)\n }\n return ok(t.tuple(of))\n }\n if (x.kind === 'record' && y.kind === 'record') {\n const keys = Object.keys(x.fields)\n if (keys.length !== Object.keys(y.fields).length) return mismatch()\n const fields: Record<string, MType> = {}\n for (const k of keys) {\n const other = y.fields[k]\n if (!other) return mismatch()\n const u = unify(x.fields[k] as MType, other)\n if (!u.ok) return mismatch()\n fields[k] = u.value\n }\n return ok(t.record(fields))\n }\n return x.kind === y.kind ? ok(x) : mismatch()\n}\n\n/* Unify a non-empty list of types, left to right. /\nexport function unifyAll(types: readonly MType[]): Result<MType, string> {\n let acc: MType = t.never\n for (const type of types) {\n const u = unify(acc, type)\n if (!u.ok) return u\n acc = u.value\n }\n return ok(acc)\n}\n\n/* Static type of a JSON literal: `null` is `t.null`, `[]` is `list<never>`. /\nexport function typeOfJson(value: unknown): MType {\n if (value === null) return t.null\n switch (typeof value) {\n case 'string':\n return t.string\n case 'number':\n return t.number\n case 'boolean':\n return t.boolean\n }\n if (Array.isArray(value)) {\n const element = unifyAll(value.map(typeOfJson))\n return t.list(element.ok ? element.value : t.unknown)\n }\n if (typeof value === 'object') {\n return t.record(\n Object.fromEntries(Object.entries(value as object).map(([k, v]) => [k, typeOfJson(v)])),\n )\n }\n return t.unknown\n}\n\n/* A connector/target logical type as an `MType`. References are opaque ids. /\nexport function fromLogicalType(logical: LogicalType): NonNull {\n switch (logical) {\n case 'string':\n return t.string\n case 'integer':\n case 'decimal':\n return t.number\n case 'boolean':\n return t.boolean\n case 'date':\n case 'timestamp':\n return t.date\n default:\n return t.unknown\n }\n}\n\n/\n Parse a type name as written in `assert_type`: `string`, `number`, `boolean`, `date`,\n * `list<T>`, and a trailing `?` for nullable.\n /\nexport function parseTypeName(text: string): Result<MType, string> {\n const source = text.replace(/\\s+/g, '')\n const parse = (s: string): MType \| undefined => {\n if (s.endsWith('?')) {\n const inner = parse(s.slice(0, -1))\n return inner && inner.kind !== 'nullable' ? t.nullable(inner) : undefined\n }\n if (s.startsWith('list<') && s.endsWith('>')) {\n const inner = parse(s.slice(5, -1))\n return inner && t.list(inner)\n }\n switch (s) {\n case 'string':\n return t.string\n case 'number':\n return t.number\n case 'boolean':\n return t.boolean\n case 'date':\n return t.date\n default:\n return undefined\n }\n }\n const type = parse(source)\n return type ? ok(type) : err(`unknown type '${text}'`)\n}\n\n/* A type name already validated by `parseTypeName` (e.g. by a params schema). /\nexport function typeName(text: string): MType {\n const type = parseTypeName(text)\n if (!type.ok) throw new Error(type.error)\n return type.value\n}\n","/\n Runtime values and the relations that carry them.\n \n A record is a plain frozen-by-convention object; an absent key reads as null (that is how\n * `omit_if_null` and `skip_field` leave a field out of a write). Nothing here depends on\n * insertion order: hashing and sorting go through `canonicalKey` and `compareVals`, so two\n * runs over the same snapshot produce identical output (arch.md, \"Execution model\").\n /\n\nimport { Instant } from './time'\n\nexport type Val =\n \| null\n \| string\n \| number\n \| boolean\n \| Instant\n \| readonly Val[]\n \| { readonly [key: string]: Val }\n\nexport type Rec = Readonly<Record<string, Val>>\n\n/* A collection: records of one record type, in no meaningful order. /\nexport type Relation = readonly Rec[]\n\n/* JSON as stored in a version (params, tables, literals, fixtures). /\nexport type Json =\n \| null\n \| string\n \| number\n \| boolean\n \| readonly Json[]\n \| { readonly [key: string]: Json }\n\n/* Returned by a step to leave its field out of the record entirely (`omit_if_null`). /\nexport const OMIT: unique symbol = Symbol('omit')\nexport type Omitted = typeof OMIT\n\nexport function isRecordVal(v: Val): v is { readonly [key: string]: Val } {\n return typeof v === 'object' && v !== null && !Array.isArray(v) && !(v instanceof Instant)\n}\n\n/* A string that is equal for equal values, used for hashing (joins, distinct, union, groups). /\nexport function canonicalKey(v: Val): string {\n if (v === null) return 'n'\n switch (typeof v) {\n case 'string':\n return `s${JSON.stringify(v)}`\n case 'number':\n return `d${Object.is(v, -0) ? 0 : v}`\n case 'boolean':\n return v ? 't' : 'f'\n }\n if (v instanceof Instant) return `i${v.epochMs}`\n if (Array.isArray(v)) return `[${(v as readonly Val[]).map(canonicalKey).join(',')}]`\n const rec = v as { readonly [key: string]: Val }\n return `{${Object.keys(rec)\n .sort()\n .map((k) => `${JSON.stringify(k)}:${canonicalKey(rec[k] as Val)}`)\n .join(',')}}`\n}\n\n/* Canonical key of a tuple of fields of a record; absent fields count as null. /\nexport function keyOf(rec: Rec, fields: readonly string[]): string {\n return canonicalKey(fields.map((f) => rec[f] ?? null))\n}\n\nconst rank = (v: Val): number => {\n if (v === null) return 0\n switch (typeof v) {\n case 'boolean':\n return 1\n case 'number':\n return 2\n case 'string':\n return 3\n }\n if (v instanceof Instant) return 4\n return Array.isArray(v) ? 5 : 6\n}\n\n/\n A total order over values: null first, then booleans, numbers, strings (by UTF-16 code\n * unit, never locale), dates, lists (lexicographic), records (by canonical key).\n /\nexport function compareVals(a: Val, b: Val): number {\n const ra = rank(a)\n const rb = rank(b)\n if (ra !== rb) return ra - rb\n switch (ra) {\n case 0:\n return 0\n case 1:\n case 2:\n return Number(a) - Number(b)\n case 3:\n return a === b ? 0 : (a as string) < (b as string) ? -1 : 1\n case 4:\n return (a as Instant).epochMs - (b as Instant).epochMs\n case 5: {\n const x = a as readonly Val[]\n const y = b as readonly Val[]\n for (let i = 0; i < Math.min(x.length, y.length); i++) {\n const c = compareVals(x[i] as Val, y[i] as Val)\n if (c !== 0) return c\n }\n return x.length - y.length\n }\n default: {\n const x = canonicalKey(a)\n const y = canonicalKey(b)\n return x === y ? 0 : x < y ? -1 : 1\n }\n }\n}\n\nexport function valEquals(a: Val, b: Val): boolean {\n return compareVals(a, b) === 0\n}\n\n/* Values as JSON: dates become ISO strings. For fixtures, metrics and diagnostics. /\nexport function toJson(v: Val): Json {\n if (v instanceof Instant) return v.toISOString()\n if (Array.isArray(v)) return (v as readonly Val[]).map(toJson)\n if (isRecordVal(v)) return Object.fromEntries(Object.entries(v).map(([k, x]) => [k, toJson(x)]))\n return v as Json\n}\n\n/* Sort records by the values of `fields`, ties by whole-record canonical key. /\nexport function sortRecords(rows: readonly Rec[], fields: readonly string[]): Rec[] {\n return [...rows].sort((a, b) => {\n for (const f of fields) {\n const c = compareVals(a[f] ?? null, b[f] ?? null)\n if (c !== 0) return c\n }\n const x = canonicalKey(a)\n const y = canonicalKey(b)\n return x === y ? 0 : x < y ? -1 : 1\n })\n}\n","/\n The one predicate vocabulary, shared by `when`, `filter_list`, the `filter` node, join\n * `where`, aggregate `where`, and `rows` expectations.\n \n Shape: `{ path?, <predicate>: operand }` with exactly one predicate key, or a composition\n * `{ all: { of: [...] } }`, `{ any: { of: [...] } }`, `{ not: cond }`. Without `path` the\n * predicate tests the piped value. An operand is a literal, `{ ref: field }` or\n * `{ param: name }`.\n \n Null never compares: ordering and equality with a null side are false, `neq` and `not_in`\n * are their negations and so hold for null (arch.md, \"Null semantics\").\n /\n\nimport { fieldType, type RecordEnv, type RunContext } from './context'\nimport { err, ok, type Result } from './result'\nimport { type DateExpr, Instant, parseDateExpr, resolveDateExpr, usesClock } from './time'\nimport { comparable, type MType, orderable, show, stripNull, t, typeOfJson } from './types'\nimport { compareVals, type Json, type Rec, type Val } from './values'\n\nexport type Test = (piped: Val, record: Rec, ctx: RunContext) => boolean\n\nconst COMPARISONS = ['eq', 'neq', 'lt', 'lte', 'gt', 'gte', 'before', 'after'] as const\nconst MEMBERSHIP = ['in', 'not_in'] as const\nconst PRESENCE = ['is_null', 'is_blank'] as const\nconst COMPOSITION = ['all', 'any', 'not'] as const\n\n/* Every predicate name; the `if_<name>` sugar is derived from the non-composite ones. /\nexport const PREDICATES = [\n ...COMPARISONS,\n ...MEMBERSHIP,\n 'matches',\n ...PRESENCE,\n ...COMPOSITION,\n] as const\nexport type PredicateName = (typeof PREDICATES)[number]\n\n/* Predicate JSON, loosely typed: validated by `compilePredicate`. /\nexport type Predicate = { readonly [key: string]: unknown }\n\nexport type Getter = (piped: Val, record: Rec, ctx: RunContext) => Val\n\nexport interface Operand {\n readonly type: MType\n readonly get: Getter\n}\n\n/\n Compile a predicate. `piped` is the type of the piped value, or undefined where there is\n * none (`filter`, join `where`, aggregate `where`), in which case `path` is required.\n /\nexport function compilePredicate(\n raw: unknown,\n env: RecordEnv,\n piped?: MType,\n): Result<Test, string> {\n if (typeof raw !== 'object' \|\| raw === null \|\| Array.isArray(raw)) {\n return err('a condition must be an object such as { \"eq\": 1 }')\n }\n const cond = raw as Predicate\n const keys = Object.keys(cond).filter((k) => k !== 'path')\n if (keys.length !== 1) {\n return err(\n `a condition needs exactly one predicate, got ${keys.length ? keys.join(', ') : 'none'}`,\n )\n }\n const name = keys[0] as string\n if (!(PREDICATES as readonly string[]).includes(name)) return err(`unknown predicate '${name}'`)\n const value = cond[name]\n\n if ((COMPOSITION as readonly string[]).includes(name)) {\n if ('path' in cond) return err(`'${name}' does not take a path; put paths on its conditions`)\n return compileComposition(name as (typeof COMPOSITION)[number], value, env, piped)\n }\n\n const subject = compileSubject(cond.path, env, piped)\n if (!subject.ok) return subject\n const { type, get } = subject.value\n const base = stripNull(type)\n\n switch (name) {\n case 'is_null':\n case 'is_blank': {\n if (typeof value !== 'boolean') return err(`'${name}' takes true or false`)\n if (name === 'is_blank' && base.kind !== 'string' && base.kind !== 'unknown') {\n return err(`is_blank applies to strings, not ${show(type)}`)\n }\n const blank =\n name === 'is_null'\n ? (v: Val) => v === null\n : (v: Val) => v === null \|\| (typeof v === 'string' && v.trim() === '')\n return ok((p, r, c) => blank(get(p, r, c)) === value)\n }\n case 'matches': {\n if (typeof value !== 'string') return err('matches takes a regular expression string')\n if (base.kind !== 'string' && base.kind !== 'unknown') {\n return err(`matches applies to strings, not ${show(type)}`)\n }\n const regex = compileRegex(value)\n if (!regex.ok) return regex\n const re = regex.value\n return ok((p, r, c) => {\n const v = get(p, r, c)\n return typeof v === 'string' && re.test(v)\n })\n }\n case 'in':\n case 'not_in': {\n const operand = compileOperand(value, env, base.kind === 'date')\n if (!operand.ok) return operand\n const listType = stripNull(operand.value.type)\n if (listType.kind !== 'list')\n return err(`'${name}' takes a list, got ${show(operand.value.type)}`)\n if (!comparable(type, listType.of)) {\n return err(`cannot test ${show(type)} for membership in ${show(listType)}`)\n }\n const list = operand.value.get\n const member: Test = (p, r, c) => {\n const v = get(p, r, c)\n const values = list(p, r, c)\n if (v === null \|\| !Array.isArray(values)) return false\n return (values as readonly Val[]).some((x) => x !== null && compareVals(v, x) === 0)\n }\n return ok(name === 'in' ? member : (p, r, c) => !member(p, r, c))\n }\n }\n\n // Comparisons.\n const isDate = name === 'before' \|\| name === 'after'\n if (isDate && base.kind !== 'date' && base.kind !== 'unknown') {\n return err(`'${name}' applies to dates, not ${show(type)}`)\n }\n if (!isDate && name !== 'eq' && name !== 'neq' && !orderable(base) && base.kind !== 'unknown') {\n return err(`'${name}' applies to numbers, strings and dates, not ${show(type)}`)\n }\n if (value === null) return err(`'${name}' cannot compare with null; use is_null`)\n const operand = compileOperand(value, env, base.kind === 'date' \|\| isDate)\n if (!operand.ok) return operand\n if (!comparable(type, operand.value.type)) {\n return err(`cannot compare ${show(type)} with ${show(operand.value.type)}`)\n }\n const other = operand.value.get\n const test = COMPARE[name as (typeof COMPARISONS)[number]]\n return ok((p, r, c) => {\n const a = get(p, r, c)\n const b = other(p, r, c)\n const holds = a !== null && b !== null && test(compareVals(a, b))\n return name === 'neq' ? !holds : holds\n })\n}\n\nconst COMPARE: Record<(typeof COMPARISONS)[number], (c: number) => boolean> = {\n eq: (c) => c === 0,\n neq: (c) => c === 0, // negated by the caller, so null sides make `neq` true\n lt: (c) => c < 0,\n lte: (c) => c <= 0,\n gt: (c) => c > 0,\n gte: (c) => c >= 0,\n before: (c) => c < 0,\n after: (c) => c > 0,\n}\n\nfunction compileComposition(\n name: (typeof COMPOSITION)[number],\n value: unknown,\n env: RecordEnv,\n piped: MType \| undefined,\n): Result<Test, string> {\n if (name === 'not') {\n const inner = compilePredicate(value, env, piped)\n if (!inner.ok) return inner\n const test = inner.value\n return ok((p, r, c) => !test(p, r, c))\n }\n const of = (value as { of?: unknown } \| null)?.of\n if (\n typeof value !== 'object' \|\|\n value === null \|\|\n Object.keys(value).length !== 1 \|\|\n !Array.isArray(of)\n ) {\n return err(`'${name}' takes { \"of\": [conditions] }`)\n }\n const tests: Test[] = []\n for (const [i, c] of of.entries()) {\n const compiled = compilePredicate(c, env, piped)\n if (!compiled.ok) return err(`${name}.of[${i}]: ${compiled.error}`)\n tests.push(compiled.value)\n }\n return ok(\n name === 'all'\n ? (p, r, c) => tests.every((x) => x(p, r, c))\n : (p, r, c) => tests.some((x) => x(p, r, c)),\n )\n}\n\nfunction compileSubject(\n path: unknown,\n env: RecordEnv,\n piped: MType \| undefined,\n): Result<{ type: MType; get: Getter }, string> {\n if (path !== undefined) {\n if (typeof path !== 'string') return err('path must be a field name')\n const type = fieldType(env.record, path)\n if (!type.ok) return type\n return ok({ type: type.value, get: (_p, r) => r[path] ?? null })\n }\n if (!piped \|\| piped.kind === 'unit') {\n return err('this condition has no piped value to test; give it a \"path\"')\n }\n return ok({ type: piped, get: (p) => p })\n}\n\n/* Literal, `{ ref }` or `{ param }`. Strings compared with a date are date expressions. /\nexport function compileOperand(\n value: unknown,\n env: RecordEnv,\n asDate: boolean,\n): Result<Operand, string> {\n if (typeof value === 'object' && value !== null && !Array.isArray(value)) {\n const keys = Object.keys(value)\n const o = value as { ref?: unknown; param?: unknown }\n if (keys.length === 1 && typeof o.ref === 'string') {\n const ref = o.ref\n const type = fieldType(env.record, ref)\n if (!type.ok) return type\n return ok({ type: type.value, get: (_p, r) => r[ref] ?? null })\n }\n if (keys.length === 1 && typeof o.param === 'string') {\n const name = o.param\n if (!Object.hasOwn(env.params, name)) return err(`unknown param '${name}'`)\n return literal(env.params[name] as Json, env, asDate)\n }\n return err('a comparison value is a literal, { \"ref\": field } or { \"param\": name }')\n }\n return literal(value as Json, env, asDate)\n}\n\nfunction literal(value: Json, env: RecordEnv, asDate: boolean): Result<Operand, string> {\n if (asDate && typeof value === 'string') {\n const expr = parseDateExpr(value)\n if (!expr.ok) return expr\n if (usesClock(expr.value)) env.clock.used = true\n return ok({ type: t.date, get: dateGetter(expr.value) })\n }\n if (asDate && Array.isArray(value) && value.every((v) => typeof v === 'string')) {\n const exprs: DateExpr[] = []\n for (const v of value as string[]) {\n const expr = parseDateExpr(v)\n if (!expr.ok) return expr\n if (usesClock(expr.value)) env.clock.used = true\n exprs.push(expr.value)\n }\n const getters = exprs.map(dateGetter)\n return ok({ type: t.list(t.date), get: (p, r, c) => getters.map((g) => g(p, r, c)) })\n }\n const constant = value as Val\n return ok({ type: typeOfJson(value), get: () => constant })\n}\n\n/* Resolve a date expression against the run clock, once per distinct clock. /\nfunction dateGetter(expr: DateExpr): Getter {\n let key = ''\n let cached: Instant = Instant.ofEpochMs(0)\n return (_p, _r, ctx) => {\n const k = `${ctx.now.epochMs}\|${ctx.tz}`\n if (k !== key) {\n cached = resolveDateExpr(expr, ctx)\n key = k\n }\n return cached\n }\n}\n\nexport function compileRegex(pattern: string): Result<RegExp, string> {\n try {\n return ok(new RegExp(pattern, 'u'))\n } catch (e) {\n return err(`invalid regular expression: ${(e as Error).message}`)\n }\n}\n\n/\n Fields a passing record is known to have non-null: `{ path, is_null: false }` at the top\n * level or inside `all`. The `filter` node narrows its output type with these.\n /\nexport function nonNullPaths(raw: unknown): string[] {\n if (typeof raw !== 'object' \|\| raw === null) return []\n const cond = raw as Predicate\n if (typeof cond.path === 'string' && cond.is_null === false) return [cond.path]\n const of = (cond.all as { of?: unknown } \| undefined)?.of\n return Array.isArray(of) ? of.flatMap(nonNullPaths) : []\n}\n","/\n Node expectations and the action building blocks (arch.md, \"Failure policy and\n * partial results\"), shared by the version's `expect` block and `assert` nodes.\n \n Every clause is detected on the node's raw output first; then `drop_rows` removes the\n * rows it names, then `set_null` / `set_default` repair the remaining violating rows. So\n * the order clauses are written in never matters. Every breach is reported as an issue,\n * whatever its action.\n /\n\nimport type { RecordEnv, RunContext } from './context'\nimport type { Action, ActionSpec, Bound, Clause, NodeExpectation } from './document'\nimport type { NodeIssue, NodeOutput, RunIssue } from './nodes/def'\nimport { compilePredicate, type Test } from './predicate'\nimport { err, ok, type Result } from './result'\nimport {\n assignable,\n comparable,\n type MType,\n type RecordType,\n show,\n stripNull,\n t,\n typeOfJson,\n} from './types'\nimport { type Json, keyOf, type Rec, type Relation, toJson, type Val } from './values'\n\ntype ActionName = 'alert' \| 'drop_rows' \| 'set_null' \| 'set_default' \| 'skip_downstream' \| 'stop'\n\nconst VALID: Readonly<Record<Clause \| 'acyclic', readonly ActionName[]>> = {\n count: ['alert', 'skip_downstream', 'stop'],\n unique: ['alert', 'drop_rows', 'skip_downstream', 'stop'],\n keyed: ['alert', 'skip_downstream', 'stop'],\n rows: ['alert', 'drop_rows', 'set_null', 'set_default', 'skip_downstream', 'stop'],\n acyclic: ['alert', 'skip_downstream', 'stop'],\n}\n\nexport function actionName(action: Action): ActionName {\n if (typeof action === 'string') return action\n return 'set_null' in action ? 'set_null' : 'set_default'\n}\n\n/* Precedence: a bound's own action, then the clause's, then `default`, then the plain spec. /\nexport function resolveAction(spec: ActionSpec \| undefined, clause: Clause, own?: Action): Action {\n if (own !== undefined) return own\n if (spec === undefined) return 'alert'\n if (typeof spec === 'string' \|\| 'set_null' in spec \|\| 'set_default' in spec) return spec as Action\n const keyed = spec as Partial<Record<Clause \| 'default', Action>>\n return keyed[clause] ?? keyed.default ?? 'alert'\n}\n\n/* Check an action fits its check and the output type; returns the repaired output type. /\nexport function checkAction(\n action: Action,\n check: Clause \| 'acyclic',\n output: NodeOutput,\n): Result<NodeOutput, string> {\n const name = actionName(action)\n if (!VALID[check].includes(name)) return err(`action ${name} does not apply to ${check}`)\n if (typeof action === 'string') return ok(output)\n const fields = 'set_null' in action ? action.set_null : Object.keys(action.set_default)\n const unknown = fields.filter((f) => !Object.hasOwn(output.type.fields, f))\n if (unknown.length) return err(`${name} names unknown fields: ${unknown.join(', ')}`)\n if ('set_default' in action) {\n for (const [f, v] of Object.entries(action.set_default)) {\n const type = output.type.fields[f] as MType\n if (v === null \|\| !assignable(typeOfJson(v), stripNull(type))) {\n return err(`set_default ${f}: ${JSON.stringify(v)} is not a ${show(stripNull(type))}`)\n }\n }\n return ok(output)\n }\n // set_null widens the repaired fields, so every consumer is checked against nulls there.\n const widened = { ...output.type.fields }\n for (const f of action.set_null) widened[f] = t.nullable(widened[f] as MType)\n return ok({ ...output, type: t.record(widened) })\n}\n\nexport interface Violation {\n readonly clause: string\n readonly action: Action\n readonly message: string\n readonly count: number\n readonly samples: readonly Json[]\n /* Positions of the violating rows, for row actions. /\n readonly rows?: readonly number[]\n}\n\nexport interface Outcome {\n readonly rows: Relation\n readonly changed: number\n readonly issues: readonly RunIssue[]\n readonly stop: boolean\n readonly skipDownstream: boolean\n}\n\n/* Apply the actions of the detected violations to `rows`, reporting each as an issue. /\nexport function applyViolations(\n node: string,\n code: string,\n rows: Relation,\n violations: readonly Violation[],\n): Outcome {\n const dropped = new Set<number>()\n for (const v of violations) {\n if (actionName(v.action) === 'drop_rows') for (const i of v.rows ?? []) dropped.add(i)\n }\n const patches = new Map<number, Record<string, Val>>()\n for (const v of violations) {\n if (typeof v.action === 'string') continue\n const patch: Record<string, Val> =\n 'set_null' in v.action\n ? Object.fromEntries(v.action.set_null.map((f) => [f, null]))\n : (v.action.set_default as Record<string, Val>)\n for (const i of v.rows ?? []) {\n if (!dropped.has(i)) patches.set(i, { ...patches.get(i), ...patch })\n }\n }\n const out: Rec[] = []\n for (const [i, row] of rows.entries()) {\n if (dropped.has(i)) continue\n const patch = patches.get(i)\n out.push(patch ? { ...row, ...patch } : row)\n }\n const affected = (v: Violation) =>\n actionName(v.action) === 'drop_rows'\n ? (v.rows ?? []).length\n : typeof v.action === 'string'\n ? undefined\n : (v.rows ?? []).filter((i) => !dropped.has(i)).length\n return {\n rows: out,\n changed: dropped.size + patches.size,\n stop: violations.some((v) => v.action === 'stop'),\n skipDownstream: violations.some((v) => v.action === 'skip_downstream'),\n issues: violations.map((v) => ({\n node,\n code,\n clause: v.clause,\n action: v.action,\n message: v.message,\n count: v.count,\n samples: v.samples,\n ...(affected(v) === undefined ? {} : { rowsAffected: affected(v) }),\n })),\n }\n}\n\nconst SAMPLES = 5\n\nexport function countViolation(\n count: number,\n bound: Bound & { readonly shiftRatio?: Bound },\n action: Action,\n baseline: number \| undefined,\n): Violation \| undefined {\n const problems: string[] = []\n if (bound.min !== undefined && count < bound.min)\n problems.push(`count ${count} below ${bound.min}`)\n if (bound.max !== undefined && count > bound.max)\n problems.push(`count ${count} above ${bound.max}`)\n const shift = bound.shiftRatio\n if (shift && baseline !== undefined && baseline > 0) {\n const ratio = count / baseline\n if (\n (shift.min !== undefined && ratio < shift.min) \|\|\n (shift.max !== undefined && ratio > shift.max)\n ) {\n problems.push(`count ${count} is ${ratio.toFixed(2)}x the baseline ${baseline}`)\n }\n }\n return problems.length\n ? { clause: 'count', action, message: problems.join('; '), count: 1, samples: [count] }\n : undefined\n}\n\nexport function uniqueViolation(\n rows: Relation,\n keys: readonly string[],\n action: Action,\n): Violation \| undefined {\n const groups = new Map<string, number[]>()\n for (const [i, row] of rows.entries()) {\n const k = keyOf(row, keys)\n const g = groups.get(k)\n if (g) g.push(i)\n else groups.set(k, [i])\n }\n const duplicates = [...groups.values()].filter((g) => g.length > 1)\n if (duplicates.length === 0) return undefined\n return {\n clause: 'unique',\n action,\n message: `${keys.join(', ')} not unique: ${duplicates.length} duplicated keys`,\n count: duplicates.length,\n samples: duplicates\n .slice(0, SAMPLES)\n .map((g) => keys.map((k) => toJson((rows[g[0] as number] as Rec)[k] ?? null))),\n rows: duplicates.flat(),\n }\n}\n\nexport function rowsViolation(\n rows: Relation,\n test: Test,\n ctx: RunContext,\n action: Action,\n): Violation \| undefined {\n const bad: number[] = []\n for (const [i, row] of rows.entries()) if (!test(null, row, ctx)) bad.push(i)\n if (bad.length === 0) return undefined\n return {\n clause: 'rows',\n action,\n message: `${bad.length} rows fail the row condition`,\n count: bad.length,\n samples: bad.slice(0, SAMPLES).map((i) => toJson(rows[i] as Rec)),\n rows: bad,\n }\n}\n\ntype Keyed = NonNullable<NodeExpectation['keyed']>\n\n/* A key with no row counts as 0, so it fails a positive `min` and passes any `max`. /\nexport function keyedViolations(\n rows: Relation,\n keyed: Keyed,\n spec: ActionSpec \| undefined,\n): Violation[] {\n const values = new Map<string, Val>()\n for (const row of rows) {\n const by = row[keyed.by] ?? null\n const k = typeof by === 'string' ? by : JSON.stringify(toJson(by))\n if (!values.has(k)) values.set(k, row[keyed.value] ?? null)\n }\n const out: Violation[] = []\n for (const [key, bound] of Object.entries(keyed.bounds)) {\n const raw = values.get(key)\n const value = typeof raw === 'number' ? raw : 0\n const low = bound.min !== undefined && value < bound.min\n const high = bound.max !== undefined && value > bound.max\n if (low \|\| high) {\n out.push({\n clause: 'keyed',\n action: resolveAction(spec, 'keyed', bound.onFail),\n message: `${keyed.by} ${key}: ${keyed.value} ${value} ${low ? `below ${bound.min}` : `above ${bound.max}`}`,\n count: 1,\n samples: [key],\n })\n }\n }\n return out\n}\n\nexport interface CheckOptions {\n /* Previous count of this node, for `count.shiftRatio`. /\n readonly baseline?: number\n /* Fixtures run at sample scale, so production `count` envelopes are skipped. /\n readonly skipCount?: boolean\n}\n\nexport type Checker = (rows: Relation, ctx: RunContext, options: CheckOptions) => Outcome\n\n/* Compile a node's `expect` entry against its output; returns the repaired output type. /\nexport function compileExpectation(\n node: string,\n exp: NodeExpectation,\n output: NodeOutput,\n renv: (record: RecordType) => RecordEnv,\n): Result<{ output: NodeOutput; check: Checker }, readonly NodeIssue[]> {\n const issues: NodeIssue[] = []\n const issue = (field: Clause, message: string) =>\n issues.push({ message, field, code: 'invalid_expectation' })\n let repaired = output\n const fields = output.type.fields\n const missing = (names: readonly string[]) => names.filter((f) => !Object.hasOwn(fields, f))\n\n for (const clause of ['count', 'unique', 'keyed', 'rows'] as const) {\n if (exp[clause] === undefined) continue\n const action = resolveAction(exp.onFail, clause)\n const checked = checkAction(action, clause, repaired)\n if (checked.ok) repaired = checked.value\n else issue(clause, checked.error)\n }\n if (exp.unique && missing(exp.unique).length) {\n issue('unique', `unknown fields: ${missing(exp.unique).join(', ')}`)\n }\n if (exp.keyed) {\n const keyed = exp.keyed\n if (missing([keyed.by, keyed.value]).length) {\n issue('keyed', `unknown fields: ${missing([keyed.by, keyed.value]).join(', ')}`)\n } else if (!comparable(fields[keyed.value] as MType, t.number)) {\n issue('keyed', `${keyed.value} must be a number`)\n }\n for (const bound of Object.values(keyed.bounds)) {\n if (bound.onFail === undefined) continue\n const checked = checkAction(bound.onFail, 'keyed', repaired)\n if (!checked.ok) issue('keyed', checked.error)\n }\n }\n let test: Test \| undefined\n if (exp.rows) {\n const compiled = compilePredicate(exp.rows.cond, renv(output.type))\n if (compiled.ok) test = compiled.value\n else issue('rows', compiled.error)\n }\n if (issues.length) return { ok: false, error: issues }\n\n const check: Checker = (rows, ctx, options) => {\n const violations: Violation[] = []\n const push = (v: Violation \| undefined) => v && violations.push(v)\n if (exp.count && !options.skipCount) {\n push(\n countViolation(\n rows.length,\n exp.count,\n resolveAction(exp.onFail, 'count'),\n options.baseline,\n ),\n )\n }\n if (exp.unique) push(uniqueViolation(rows, exp.unique, resolveAction(exp.onFail, 'unique')))\n if (exp.keyed) violations.push(...keyedViolations(rows, exp.keyed, exp.onFail))\n if (test) push(rowsViolation(rows, test, ctx, resolveAction(exp.onFail, 'rows')))\n return applyViolations(node, 'expectation', rows, violations)\n }\n return ok({ output: repaired, check })\n}\n","/\n Collection node definitions.\n \n A node definition compiles itself: from its params and the types of its inputs it returns\n * its output type and a closure, in one step, so type checking and compilation stay the same\n * pass. Nodes reference their inputs by id; `slots` say which params hold those ids, which is\n * all the graph utilities and the editor need to know about edges.\n /\n\nimport { z } from 'zod'\nimport type { GraphEnv, RecordEnv, RunContext } from '../context'\nimport type { Action, JsonSchema, MappingVersion, NodeExpectation } from '../document'\nimport type { CompileCode, Result } from '../result'\nimport type { MType, RecordType } from '../types'\nimport type { Json, Relation } from '../values'\n\n/* Where a field's value was produced, so a sink can blame the right `map` field. /\nexport interface Origin {\n readonly node: string\n readonly field: string\n /* The field may be absent from a record (`omit_if_null`, `on_error: skip_field`). /\n readonly omittable: boolean\n /* Type of the value when present; set exactly for omittable fields. /\n readonly present?: MType\n}\n\n/\n Compile-time output of a node: its record type plus per-field provenance. Invariants: every\n * field has an origin, and an omittable field is typed nullable (an absent field reads null).\n /\nexport interface NodeOutput {\n readonly type: RecordType\n readonly origins: Readonly<Record<string, Origin>>\n /* Can drop records on a failed field. /\n readonly canSkip?: boolean\n}\n\n/* An input slot: the param path that holds an upstream node id. /\nexport interface Slot {\n readonly id: string\n readonly label: string\n readonly path: readonly string[]\n /* Holds a list of ids (`union.inputs`). /\n readonly multiple?: boolean\n readonly optional?: boolean\n}\n\nexport type NodeCategory = 'source' \| 'transform' \| 'target' \| 'check'\n\n/* What a node definition sees while compiling. /\nexport interface NodeEnv {\n readonly id: string\n readonly graph: GraphEnv\n readonly version: Pick<\n MappingVersion,\n 'params' \| 'tables' \| 'expectedSchema' \| 'onError' \| 'expect'\n >\n /* This node's entry in the version's `expect` block. /\n readonly expect?: NodeExpectation\n readonly clock: { used: boolean }\n /* Output of an upstream node; the compiler only calls `compile` once all inputs exist. /\n input(id: string): NodeOutput\n recordEnv(record: RecordType): RecordEnv\n}\n\nexport interface NodeIssue {\n readonly message: string\n readonly code?: CompileCode\n /* Blame another node, e.g. the `map` that produced a field a sink rejects. /\n readonly node?: string\n readonly field?: string\n readonly step?: number\n}\n\n/* A problem found while running, reported on the run rather than failing it. /\nexport interface RunIssue {\n readonly node: string\n readonly code: string\n readonly message: string\n readonly field?: string\n readonly clause?: string\n readonly action?: Action\n readonly count?: number\n readonly rowsAffected?: number\n readonly samples?: readonly Json[]\n}\n\nexport interface SinkWrite {\n readonly sink: string\n readonly target: string\n /* Target paths of the upsert key. /\n readonly key: readonly string[]\n /* Rows by target path, sorted by key. Dates are `YYYY-MM-DD`, timestamps ISO. /\n readonly rows: readonly Readonly<Record<string, Json>>[]\n readonly write?: Readonly<Record<string, WritePolicy>>\n /\n Reference fields written as natural keys, by target path. The host resolves each value\n * (one field of `by`, or a list in `by` order) to the id of the `entity` row it names.\n /\n readonly refs?: Readonly<Record<string, SinkRef>>\n /\n The rows are the complete set of the target for the company (and source system, where\n * the identity has one): the host calls `synchronize_all(rows, scope)`, deleting rows not\n * written. Writes of one run go in one transaction, inserts parent-first and deletes\n * child-first (join-table rows before the entities they reference). A sink that does not write\n * (held, stopped, failed) deletes nothing.\n /\n readonly mode?: 'replace'\n}\n\nexport type WritePolicy = 'overwrite' \| 'fill_if_null' \| 'never'\n\nexport interface SinkRef {\n readonly entity: string\n readonly by: readonly string[]\n}\n\nexport interface Metric {\n readonly node: string\n readonly name: string\n readonly rows: readonly Readonly<Record<string, Json>>[]\n}\n\nexport interface NodeRun {\n readonly rows: Relation\n /* Records a `map` dropped under `skip_record`. /\n readonly skipped?: number\n /* Rows dropped or repaired by an action. /\n readonly changed?: number\n readonly issues?: readonly RunIssue[]\n readonly stop?: boolean\n readonly skipDownstream?: boolean\n readonly write?: SinkWrite\n readonly metric?: Metric\n}\n\nexport interface NodeFailure {\n readonly code: string\n readonly message: string\n /* Halts the run (`on_error: fail_sync`). /\n readonly stop?: boolean\n readonly issues?: readonly RunIssue[]\n readonly samples?: readonly Json[]\n}\n\nexport type Inputs = (id: string) => Relation\n\nexport interface RunOptions {\n /* Previous output count of this node, for `count.shiftRatio`. /\n readonly baseline?: number\n /* Fixture runs are sample-sized, so production `count` envelopes are skipped. /\n readonly skipCount?: boolean\n}\n\nexport interface CompiledNode {\n /* Null for a node without an output relation (`sink`); `metrics` types what it reports. /\n readonly output: NodeOutput \| null\n /* Target entities a sink writes (one sink per entity, structural rule 4). /\n readonly writes?: readonly string[]\n readonly run: (\n inputs: Inputs,\n ctx: RunContext,\n options?: RunOptions,\n ) => Result<NodeRun, NodeFailure>\n}\n\nexport interface NodeDef<P = unknown> {\n readonly op: string\n readonly label: string\n readonly category: NodeCategory\n readonly description: string\n readonly slots: readonly Slot[]\n /* Has an output edge. /\n readonly output: boolean\n /* Has an effect: a write, a metric, or a check. Every node must reach one. /\n readonly effect?: 'sink' \| 'metrics' \| 'check'\n /* Params a new node starts with in the editor. /\n readonly defaults: () => Record<string, unknown>\n /* Parses the node object without `id`, `op` and `label`. /\n readonly params: z.ZodType<P>\n /* Accepts `tolerate_skips` (arch.md, \"Failure policy and partial results\"). /\n readonly toleratesSkips?: (params: P) => boolean\n readonly compile: (params: P, env: NodeEnv) => Result<CompiledNode, readonly NodeIssue[]>\n}\n\nexport function defineNode<P>(def: NodeDef<P>): NodeDef<P> {\n return def\n}\n\nexport const nodeId = z.string().min(1)\n\n/* Origins for fields a node produces itself. /\nexport function ownOrigins(node: string, type: RecordType): Record<string, Origin> {\n return Object.fromEntries(\n Object.keys(type.fields).map((field) => [field, { node, field, omittable: false }]),\n )\n}\n\n/* Shorthand for a single issue result. /\nexport function fail(message: string, extra: Omit<NodeIssue, 'message'> = {}) {\n return { ok: false as const, error: [{ message, ...extra }] as readonly NodeIssue[] }\n}\n\nexport type { JsonSchema }\n","/\n `aggregate`: one record per group of `group_by` (one record overall for `group_by: []`,\n * even on empty input). Every aggregation takes an optional `where`, making it a filtered\n * aggregate. Results never depend on input order: `sum` adds in sorted order, `collect_set`\n * is sorted, and `collect_list`, `first`, `last` require `order_by`.\n /\n\nimport { z } from 'zod'\nimport type { RunContext } from '../context'\nimport { compilePredicate, type Test } from '../predicate'\nimport { ok } from '../result'\nimport { type MType, orderable, type RecordType, show, stripNull, t } from '../types'\nimport {\n canonicalKey,\n compareVals,\n keyOf,\n type Rec,\n type Relation,\n sortRecords,\n type Val,\n} from '../values'\nimport { defineNode, type NodeEnv, nodeId, type NodeIssue, type Origin, ownOrigins } from './def'\n\nconst orderBy = z\n .array(\n z.union([\n z.string().min(1),\n z.strictObject({ path: z.string().min(1), desc: z.boolean().optional() }),\n ]),\n )\n .min(1)\n\nconst agg = z.strictObject({\n agg: z.enum([\n 'count',\n 'count_distinct',\n 'sum',\n 'min',\n 'max',\n 'collect_set',\n 'collect_list',\n 'first',\n 'last',\n 'any',\n 'all',\n ]),\n path: z.string().min(1).optional(),\n where: z.unknown().optional(),\n order_by: orderBy.optional(),\n cond: z.unknown().optional(),\n})\ntype Agg = z.infer<typeof agg>\n\nconst params = z.strictObject({\n in: nodeId,\n group_by: z.array(z.string().min(1)),\n fields: z\n .record(z.string().min(1), agg)\n .refine((f) => Object.keys(f).length > 0, 'needs at least one field'),\n tolerate_skips: z.boolean().optional(),\n})\n\nconst NEEDS_PATH = new Set([\n 'count_distinct',\n 'sum',\n 'min',\n 'max',\n 'collect_set',\n 'collect_list',\n 'first',\n 'last',\n])\nconst NEEDS_ORDER = new Set(['collect_list', 'first', 'last'])\nconst NEEDS_COND = new Set(['any', 'all'])\n\ntype Compute = (rows: Relation, ctx: RunContext) => Val\n\nfunction compileAgg(\n name: string,\n spec: Agg,\n input: RecordType,\n env: NodeEnv,\n): { type: MType; compute: Compute } \| NodeIssue {\n const issue = (message: string): NodeIssue => ({ message, field: name })\n const renv = env.recordEnv(input)\n if (NEEDS_PATH.has(spec.agg) !== (spec.path !== undefined)) {\n return issue(\n NEEDS_PATH.has(spec.agg) ? `${spec.agg} needs a path` : `${spec.agg} takes no path`,\n )\n }\n if (NEEDS_ORDER.has(spec.agg) !== (spec.order_by !== undefined)) {\n return issue(\n NEEDS_ORDER.has(spec.agg) ? `${spec.agg} needs order_by` : `${spec.agg} takes no order_by`,\n )\n }\n if (NEEDS_COND.has(spec.agg) !== (spec.cond !== undefined)) {\n return issue(\n NEEDS_COND.has(spec.agg) ? `${spec.agg} needs a cond` : `${spec.agg} takes no cond`,\n )\n }\n const path = spec.path\n const fieldType = path === undefined ? undefined : input.fields[path]\n if (path !== undefined && !fieldType) return issue(`unknown field '${path}'`)\n const order = (spec.order_by ?? []).map((o) =>\n typeof o === 'string' ? { path: o, desc: false } : { desc: false, ...o },\n )\n const unknownOrder = order.filter((o) => !Object.hasOwn(input.fields, o.path))\n if (unknownOrder.length)\n return issue(`order_by: unknown field '${(unknownOrder[0] as { path: string }).path}'`)\n\n let where: Test \| undefined\n if (spec.where !== undefined) {\n const w = compilePredicate(spec.where, renv)\n if (!w.ok) return issue(`where: ${w.error}`)\n where = w.value\n }\n let cond: Test \| undefined\n if (spec.cond !== undefined) {\n const c = compilePredicate(spec.cond, renv)\n if (!c.ok) return issue(`cond: ${c.error}`)\n cond = c.value\n }\n\n const values = (rows: Relation) => rows.map((r) => r[path as string] ?? null)\n const nonNull = (rows: Relation) => values(rows).filter((v) => v !== null)\n const sorted = (rows: Relation) =>\n [...rows].sort((a, b) => {\n for (const o of order) {\n const c = compareVals(a[o.path] ?? null, b[o.path] ?? null)\n if (c !== 0) return o.desc ? -c : c\n }\n return compareVals(canonicalKey(a), canonicalKey(b))\n })\n const base = fieldType ? stripNull(fieldType) : t.unknown\n\n let type: MType\n let compute: Compute\n switch (spec.agg) {\n case 'count':\n type = t.number\n compute = (rows) => rows.length\n break\n case 'count_distinct':\n type = t.number\n compute = (rows) => new Set(nonNull(rows).map(canonicalKey)).size\n break\n case 'sum':\n if (base.kind !== 'number')\n return issue(`sum needs a number field, ${path} is ${show(fieldType as MType)}`)\n type = t.nullable(t.number)\n compute = (rows) => {\n const xs = (nonNull(rows) as number[]).sort((a, b) => a - b)\n return xs.length === 0 ? null : xs.reduce((a, b) => a + b, 0)\n }\n break\n case 'min':\n case 'max': {\n if (!orderable(base))\n return issue(\n `${spec.agg} needs a number, string or date field, ${path} is ${show(fieldType as MType)}`,\n )\n type = t.nullable(base)\n const sign = spec.agg === 'min' ? 1 : -1\n compute = (rows) => nonNull(rows).sort((a, b) => sign compareVals(a, b))[0] ?? null\n break\n }\n case 'collect_set':\n type = t.list(base)\n compute = (rows) => {\n const seen = new Map<string, Val>()\n for (const v of nonNull(rows)) seen.set(canonicalKey(v), v)\n return [...seen.values()].sort(compareVals)\n }\n break\n case 'collect_list':\n type = t.list(fieldType as MType)\n compute = (rows) => sorted(rows).map((r) => r[path as string] ?? null)\n break\n case 'first':\n case 'last': {\n type = t.nullable(fieldType as MType)\n const pick = spec.agg === 'first' ? 0 : -1\n compute = (rows) => sorted(rows).at(pick)?.[path as string] ?? null\n break\n }\n default: {\n type = t.boolean\n const test = cond as Test\n compute =\n spec.agg === 'any'\n ? (rows, ctx) => rows.some((r) => test(null, r, ctx))\n : (rows, ctx) => rows.every((r) => test(null, r, ctx))\n }\n }\n if (where) {\n const w = where\n const inner = compute\n compute = (rows, ctx) =>\n inner(\n rows.filter((r) => w(null, r, ctx)),\n ctx,\n )\n }\n return { type, compute }\n}\n\nexport const aggregateNode = defineNode({\n op: 'aggregate',\n label: 'Aggregate',\n category: 'transform',\n description: 'One record per group, with counts, sums, sets and other aggregates.',\n slots: [{ id: 'in', label: 'In', path: ['in'] }],\n output: true,\n defaults: () => ({ in: '', group_by: [], fields: {} }),\n params,\n toleratesSkips: (p) => p.tolerate_skips === true,\n compile: (p, env) => {\n const input = env.input(p.in)\n const issues: NodeIssue[] = []\n const fields: Record<string, MType> = {}\n for (const g of p.group_by) {\n const type = input.type.fields[g]\n if (type) fields[g] = type\n else issues.push({ message: `group_by: unknown field '${g}'` })\n }\n const aggs: { name: string; compute: Compute }[] = []\n for (const [name, spec] of Object.entries(p.fields)) {\n if (p.group_by.includes(name)) {\n issues.push({ message: `'${name}' is both a group key and an aggregate`, field: name })\n continue\n }\n const compiled = compileAgg(name, spec, input.type, env)\n if ('message' in compiled) issues.push(compiled)\n else {\n fields[name] = compiled.type\n aggs.push({ name, compute: compiled.compute })\n }\n }\n if (issues.length) return { ok: false, error: issues }\n\n const type = t.record(fields)\n return ok({\n output: {\n type,\n origins: {\n ...ownOrigins(env.id, type),\n ...Object.fromEntries(p.group_by.map((g) => [g, input.origins[g] as Origin])),\n },\n },\n run: (inputs, ctx) => {\n const groups = new Map<string, Rec[]>()\n // `group_by: []` yields one record even for empty input.\n if (p.group_by.length === 0) groups.set(keyOf({}, []), [])\n for (const row of inputs(p.in)) {\n const k = keyOf(row, p.group_by)\n const g = groups.get(k)\n if (g) g.push(row)\n else groups.set(k, [row])\n }\n const rows: Rec[] = []\n for (const members of groups.values()) {\n const out: Record<string, Val> = {}\n const sample = members[0]\n for (const g of p.group_by) out[g] = (sample as Rec)[g] ?? null\n for (const a of aggs) out[a.name] = a.compute(members, ctx)\n rows.push(out)\n }\n return ok({ rows: sortRecords(rows, p.group_by) })\n },\n })\n },\n})\n","/*\n Record op definitions.\n \n An op is a params schema, a type function and a curried implementation. `signature` is\n * the validator's half; `run` binds params once per compiled version and returns the\n * per-record step. With `nulls: 'propagate'` the pipeline compiler handles a null input, so\n * `run` never sees null and `signature` never sees a nullable type.\n /\n\nimport { z } from 'zod'\nimport type { RecordContext, RecordEnv } from '../context'\nimport { err, ok, type Result, type StepError } from '../result'\nimport type { MType } from '../types'\nimport type { Omitted, Val } from '../values'\n\nexport type StepResult = Result<Val \| Omitted, StepError>\n\nexport type Step = (input: Val, ctx: RecordContext) => StepResult\n\nexport interface OpDef<P = unknown> {\n readonly name: string\n /* Parses the step object without its `op` key. Unknown keys are rejected. /\n readonly params: z.ZodType<P>\n /* Who handles a null input: the compiler ('propagate') or this op ('consume'). /\n readonly nulls: 'propagate' \| 'consume'\n /\n What the op reads: 'value' (default) needs a piped value; 'none' starts a pipeline and\n * takes no piped input; 'any' accepts either (`when`).\n /\n readonly input?: 'value' \| 'none' \| 'any'\n /* Must be the last step (`omit_if_null`). /\n readonly terminal?: boolean\n /* Whether this op can return an error at runtime, given its params. /\n readonly fallible: (params: P, env: RecordEnv, input: MType) => boolean\n /* Output type for an input type; an error message when the input is not accepted. /\n readonly signature: (input: MType, params: P, env: RecordEnv) => Result<MType, string>\n /* Bind params once; `input` is the (null-stripped) input type `signature` accepted. /\n readonly run: (params: P, env: RecordEnv, input: MType) => Step\n}\n\n/* Identity function that keeps `P` inferred from the params schema. /\nexport function defineOp<P>(def: OpDef<P>): OpDef<P> {\n return def\n}\n\nexport const never = () => false\nexport const always = () => true\n\n/* Expect an exact non-null kind. /\nexport function expectKind(\n input: MType,\n kinds: readonly MType['kind'][],\n op: string,\n): Result<MType, string> {\n return kinds.includes(input.kind)\n ? ok(input)\n : err(`${op} expects ${kinds.join(' or ')}, got ${showKind(input)}`)\n}\n\nfunction showKind(input: MType): string {\n return input.kind === 'nullable'\n ? `${input.of.kind}?`\n : input.kind === 'unit'\n ? 'no input'\n : input.kind\n}\n\n/* JSON literal accepted in params. /\nexport const json: z.ZodType<import('../values').Json> = z.lazy(() =>\n z.union([\n z.string(),\n z.number(),\n z.boolean(),\n z.null(),\n z.array(json),\n z.record(z.string(), json),\n ]),\n)\n\n/* Strict object schema, so a typo'd param is an error rather than ignored. /\nexport const params = <S extends z.ZodRawShape>(shape: S) => z.strictObject(shape)\n","/\n The mapping document (arch.md, \"The mapping document\"): one version of a mapping, stored as\n * JSON. It carries the graph (`nodes`), the assumptions about each source (`expectedSchema`,\n * which is also the type environment), expectations about what nodes produce (`expect`),\n * named constants (`params`), lookup tables (`tables`) and fixtures (`examples`).\n \n Nodes are flat objects, `{ id, op, ...params }`, and reference their inputs by id; there is\n * no edge list. Node params are validated by the node's definition when the version compiles,\n * so a draft with a half-edited node still parses. `layout` is editor state only.\n /\n\nimport { z } from 'zod'\nimport { json } from './ops/def'\n\nexport const OnError = z.enum(['null', 'skip_field', 'skip_record', 'fail_sync'])\nexport type OnError = z.infer<typeof OnError>\n\nexport const Action = z.union([\n z.enum(['alert', 'drop_rows', 'skip_downstream', 'stop']),\n z.strictObject({ set_null: z.array(z.string().min(1)).min(1) }),\n z.strictObject({ set_default: z.record(z.string(), json) }),\n])\nexport type Action = z.infer<typeof Action>\n\nexport const CLAUSES = ['count', 'unique', 'keyed', 'rows'] as const\nexport type Clause = (typeof CLAUSES)[number]\n\n/* One action for every clause, or one per clause with a fallback. /\nexport const ActionSpec = z.union([\n Action,\n z.strictObject({\n default: Action.optional(),\n count: Action.optional(),\n unique: Action.optional(),\n keyed: Action.optional(),\n rows: Action.optional(),\n }),\n])\nexport type ActionSpec = z.infer<typeof ActionSpec>\n\nexport const Bound = z.strictObject({ min: z.number().optional(), max: z.number().optional() })\nexport type Bound = z.infer<typeof Bound>\n\nexport const NodeExpectation = z.strictObject({\n /* Absolute bounds, and drift relative to a baseline the host passes per run. /\n count: Bound.extend({ shiftRatio: Bound.optional() }).optional(),\n /* Fields whose combination must be unique in the node's output. /\n unique: z.array(z.string().min(1)).min(1).optional(),\n /* Bounds on individual rows of a small keyed relation, typically counters. /\n keyed: z\n .strictObject({\n by: z.string().min(1),\n value: z.string().min(1),\n bounds: z.record(z.string(), Bound.extend({ onFail: Action.optional() })),\n })\n .optional(),\n /* A predicate every row must satisfy. /\n rows: z.strictObject({ cond: z.unknown() }).optional(),\n onFail: ActionSpec.optional(),\n note: z.string().optional(),\n})\nexport type NodeExpectation = z.infer<typeof NodeExpectation>\n\nconst Rows = z.array(z.record(z.string(), json))\n\n/* A fixture: relations in, keyed by source node id; relations out, keyed by any node id. /\nexport const Example = z.strictObject({\n name: z.string().optional(),\n sources: z.record(z.string(), Rows).default({}),\n expect: z.record(z.string(), Rows).default({}),\n /* Frozen clock for the fixture run (ISO instant); required if the graph reads the clock. /\n now: z.string().optional(),\n tz: z.string().optional(),\n})\nexport type Example = z.infer<typeof Example>\n\nexport const NodeJson = z.looseObject({\n id: z.string().min(1),\n op: z.string().min(1),\n label: z.string().optional(),\n})\nexport type NodeJson = z.infer<typeof NodeJson>\n\nexport const Position = z.object({ x: z.number(), y: z.number() })\nexport type Position = z.infer<typeof Position>\n\n/* One JSON Schema document per source node, describing one record of that source. /\nexport const JsonSchema = z.record(z.string(), z.unknown())\nexport type JsonSchema = Readonly<Record<string, unknown>>\n\nexport const MappingVersion = z.object({\n id: z.string().min(1),\n name: z.string().optional(),\n version: z.number().int().min(1).default(1),\n status: z.enum(['draft', 'published']).default('draft'),\n /* Default `on_error` of `map` nodes; a node's own `on_error` overrides it. /\n onError: OnError.optional(),\n unknownFields: z.enum(['ignore', 'notify']).optional(),\n params: z.record(z.string(), json).default({}),\n tables: z.record(z.string(), z.record(z.string(), json)).default({}),\n expectedSchema: z.record(z.string(), JsonSchema).default({}),\n nodes: z.array(NodeJson).default([]),\n expect: z.record(z.string(), NodeExpectation).default({}),\n examples: z.array(Example).default([]),\n layout: z.record(z.string(), Position).optional(),\n})\nexport type MappingVersion = z.infer<typeof MappingVersion>\n/* A version as authored, before defaults are filled in. /\nexport type MappingVersionInput = z.input<typeof MappingVersion>\n\n/* Parse untrusted JSON into a version; throws a zod error with paths on failure. /\nexport function parseVersion(input: unknown): MappingVersion {\n return MappingVersion.parse(input)\n}\n\nexport function emptyVersion(id: string, name?: string): MappingVersion {\n return parseVersion(name === undefined ? { id } : { id, name })\n}\n\n/* JSON Schema of the mapping document, for tools and models that produce mappings. /\nexport function versionJsonSchema(): Record<string, unknown> {\n return z.toJSONSchema(MappingVersion, { io: 'input' }) as Record<string, unknown>\n}\n","/\n `assert`: a named built-in check on its `in` relation, which it passes through (repaired, if\n * the chosen action repairs rows), so it can guard a flow or end a branch. `on_fail` is one\n * of the expectation actions, `alert` by default.\n \n - `count`: `min` / `max` rows.\n * - `unique`: `keys` unique.\n * - `rows`: every row satisfies `cond`.\n * - `acyclic`: the edges `edge.from -> edge.to` of `in` contain no cycle. With `edge.key` the\n * edges belong to groups (each product's own supply graph) and each group is checked on its\n * own; with `per`, every distinct `per.key` of `per.in` is checked against all edges. Either\n * way a group's rows of `remove.in` are taken out first. Cycle detection is iterative, so\n * it is engine code rather than a composition of DAG nodes.\n /\n\nimport { z } from 'zod'\nimport type { RunContext } from '../context'\nimport { Action } from '../document'\nimport {\n applyViolations,\n checkAction,\n countViolation,\n rowsViolation,\n uniqueViolation,\n type Violation,\n} from '../expect'\nimport { compilePredicate, type Test } from '../predicate'\nimport { ok } from '../result'\nimport { comparable, type MType, show } from '../types'\nimport { canonicalKey, compareVals, type Json, type Relation, toJson, type Val } from '../values'\nimport { defineNode, type NodeEnv, nodeId, type NodeIssue, type NodeOutput } from './def'\n\nconst common = { in: nodeId, on_fail: Action.optional() }\n\nconst params = z.discriminatedUnion('check', [\n z.strictObject({\n ...common,\n check: z.literal('count'),\n min: z.number().optional(),\n max: z.number().optional(),\n }),\n z.strictObject({\n ...common,\n check: z.literal('unique'),\n keys: z.array(z.string().min(1)).min(1),\n }),\n z.strictObject({ ...common, check: z.literal('rows'), cond: z.unknown() }),\n z.strictObject({\n ...common,\n check: z.literal('acyclic'),\n edge: z.strictObject({\n from: z.string().min(1),\n to: z.string().min(1),\n key: z.string().min(1).optional(),\n }),\n per: z.strictObject({ in: nodeId, key: z.string().min(1) }).optional(),\n remove: z\n .strictObject({\n in: nodeId,\n key: z.string().min(1),\n from: z.string().min(1),\n to: z.string().min(1),\n where: z.unknown().optional(),\n })\n .optional(),\n }),\n])\ntype Params = z.infer<typeof params>\ntype Acyclic = Extract<Params, { check: 'acyclic' }>\n\n/* One cycle as a path (first node repeated at the end), or undefined. /\nexport function findCycle(edges: readonly (readonly [string, string])[]): string[] \| undefined {\n const next = new Map<string, string[]>()\n for (const [from, to] of edges) next.set(from, [...(next.get(from) ?? []), to])\n const state = new Map<string, 'open' \| 'done'>()\n const path: string[] = []\n const visit = (node: string): string[] \| undefined => {\n state.set(node, 'open')\n path.push(node)\n for (const to of next.get(node) ?? []) {\n if (state.get(to) === 'open') return [...path.slice(path.indexOf(to)), to]\n if (!state.has(to)) {\n const cycle = visit(to)\n if (cycle) return cycle\n }\n }\n path.pop()\n state.set(node, 'done')\n return undefined\n }\n for (const node of [...next.keys()].sort()) {\n if (state.has(node)) continue\n const cycle = visit(node)\n if (cycle) return cycle\n }\n return undefined\n}\n\nfunction fieldIssues(output: NodeOutput, fields: readonly string[], where: string): NodeIssue[] {\n return fields\n .filter((f) => !Object.hasOwn(output.type.fields, f))\n .map((f) => ({ message: `${where}: unknown field '${f}'` }))\n}\n\nfunction compileAcyclic(p: Acyclic, input: NodeOutput, env: NodeEnv) {\n const issues = fieldIssues(\n input,\n [p.edge.from, p.edge.to, ...(p.edge.key ? [p.edge.key] : [])],\n 'edge',\n )\n const edgeType = input.type.fields[p.edge.from]\n let removeWhere: Test \| undefined\n if (p.per) issues.push(...fieldIssues(env.input(p.per.in), [p.per.key], 'per'))\n // A group without edges cannot have a cycle, so per adds nothing to grouped edges.\n if (p.edge.key && p.per) issues.push({ message: 'edge.key groups the edges itself; drop per' })\n const groupType = p.edge.key\n ? input.type.fields[p.edge.key]\n : p.per && env.input(p.per.in).type.fields[p.per.key]\n if (p.remove) {\n if (!p.per && !p.edge.key) issues.push({ message: 'remove needs per or edge.key' })\n const removal = env.input(p.remove.in)\n issues.push(...fieldIssues(removal, [p.remove.key, p.remove.from, p.remove.to], 'remove'))\n const checks: [string, MType \| undefined, MType \| undefined][] = [\n [`remove.from`, removal.type.fields[p.remove.from], edgeType],\n [`remove.to`, removal.type.fields[p.remove.to], edgeType],\n [`remove.key`, removal.type.fields[p.remove.key], groupType],\n ]\n for (const [name, a, b] of checks) {\n if (a && b && !comparable(a, b)) issues.push({ message: `${name}: ${show(a)} vs ${show(b)}` })\n }\n if (p.remove.where !== undefined) {\n const w = compilePredicate(p.remove.where, env.recordEnv(removal.type))\n if (w.ok) removeWhere = w.value\n else issues.push({ message: `remove.where: ${w.error}` })\n }\n }\n const toType = input.type.fields[p.edge.to]\n if (edgeType && toType && !comparable(edgeType, toType)) {\n issues.push({ message: `edge: ${show(edgeType)} vs ${show(toType)}` })\n }\n return { issues, removeWhere }\n}\n\nconst str = (v: Val) => (typeof v === 'string' ? v : canonicalKey(v))\n\ntype Edge = readonly [string, string]\n\nfunction acyclicViolation(\n p: Acyclic,\n inputs: (id: string) => Relation,\n ctx: RunContext,\n removeWhere: Test \| undefined,\n action: Action,\n): Violation \| undefined {\n const keyed = p.edge.key\n const grouped = keyed !== undefined \|\| p.per !== undefined\n // Edges by canonical group key: by `edge.key`, or one set every group shares under null.\n const edgesOf = new Map<string, Map<string, Edge>>()\n const keys = new Map<string, Val>()\n for (const row of inputs(p.in)) {\n const from = row[p.edge.from] ?? null\n const to = row[p.edge.to] ?? null\n const k = keyed ? (row[keyed] ?? null) : null\n if (from === null \|\| to === null \|\| (keyed && k === null)) continue\n const g = canonicalKey(k)\n keys.set(g, k)\n const edges = edgesOf.get(g) ?? new Map<string, Edge>()\n edges.set(canonicalKey([from, to]), [str(from), str(to)])\n edgesOf.set(g, edges)\n }\n let groups: Val[] = [null]\n if (keyed) groups = [...keys.values()].sort(compareVals)\n else if (p.per) {\n const seen = new Map<string, Val>()\n for (const row of inputs(p.per.in)) {\n const k = row[p.per.key] ?? null\n if (k !== null) seen.set(canonicalKey(k), k)\n }\n groups = [...seen.values()].sort(compareVals)\n }\n const removals = new Map<string, Set<string>>()\n if (p.remove) {\n for (const row of inputs(p.remove.in)) {\n if (removeWhere && !removeWhere(null, row, ctx)) continue\n const g = canonicalKey(row[p.remove.key] ?? null)\n const set = removals.get(g) ?? new Set<string>()\n set.add(canonicalKey([row[p.remove.from] ?? null, row[p.remove.to] ?? null]))\n removals.set(g, set)\n }\n }\n // With shared edges most groups remove the same ones (often none), so cycles are cached\n // by removal set; a group with edges of its own is small and checked directly.\n const cache = new Map<string, string[] \| undefined>()\n const failing: Json[] = []\n let count = 0\n for (const g of groups) {\n const removed = removals.get(canonicalKey(g)) ?? new Set<string>()\n const edges = edgesOf.get(canonicalKey(keyed ? g : null)) ?? new Map<string, Edge>()\n const kept = () => [...edges].filter(([k]) => !removed.has(k)).map(([, e]) => e)\n let cycle: string[] \| undefined\n if (keyed) cycle = findCycle(kept())\n else {\n const signature = [...removed].sort().join('\|')\n if (!cache.has(signature)) cache.set(signature, findCycle(kept()))\n cycle = cache.get(signature)\n }\n if (cycle) {\n count += 1\n if (failing.length < 5) failing.push({ group: toJson(g), cycle })\n }\n }\n if (count === 0) return undefined\n const first = failing[0] as { group: Json; cycle: string[] }\n return {\n clause: 'acyclic',\n action,\n message: `${count} ${grouped ? 'groups have' : 'graph has'} a cycle, e.g. ${grouped ? `${typeof first.group === 'string' ? first.group : JSON.stringify(first.group)}: ` : ''}${first.cycle.join(' -> ')}`,\n count,\n samples: failing,\n }\n}\n\nexport const assertNode = defineNode({\n op: 'assert',\n label: 'Assert',\n category: 'check',\n description: 'A built-in check (count, unique, rows, acyclic) that passes its input through.',\n slots: [\n { id: 'in', label: 'In', path: ['in'] },\n { id: 'per', label: 'Per', path: ['per', 'in'], optional: true },\n { id: 'remove', label: 'Remove', path: ['remove', 'in'], optional: true },\n ],\n output: true,\n effect: 'check',\n defaults: () => ({ in: '', check: 'count' }),\n params,\n compile: (p: Params, env) => {\n const input = env.input(p.in)\n const action = p.on_fail ?? 'alert'\n const checked = checkAction(action, p.check, input)\n const issues: NodeIssue[] = checked.ok ? [] : [{ message: `on_fail: ${checked.error}` }]\n let test: Test \| undefined\n let removeWhere: Test \| undefined\n switch (p.check) {\n case 'unique':\n issues.push(...fieldIssues(input, p.keys, 'keys'))\n break\n case 'rows': {\n const compiled = compilePredicate(p.cond, env.recordEnv(input.type))\n if (compiled.ok) test = compiled.value\n else issues.push({ message: `cond: ${compiled.error}` })\n break\n }\n case 'acyclic': {\n const compiled = compileAcyclic(p, input, env)\n issues.push(...compiled.issues)\n removeWhere = compiled.removeWhere\n break\n }\n }\n if (!checked.ok \|\| issues.length > 0) return { ok: false, error: issues }\n\n return ok({\n output: checked.value,\n run: (inputs, ctx, options = {}) => {\n const rows = inputs(p.in)\n let violation: Violation \| undefined\n switch (p.check) {\n case 'count':\n violation = options.skipCount\n ? undefined\n : countViolation(rows.length, p, action, undefined)\n break\n case 'unique':\n violation = uniqueViolation(rows, p.keys, action)\n break\n case 'rows':\n violation = rowsViolation(rows, test as Test, ctx, action)\n break\n default:\n violation = acyclicViolation(p, inputs, ctx, removeWhere, action)\n }\n return ok(applyViolations(env.id, 'assert', rows, violation ? [violation] : []))\n },\n })\n },\n})\n","/* `distinct`: deduplicates on `keys` and projects to them. /\n\nimport { z } from 'zod'\nimport { ok } from '../result'\nimport { type MType, t } from '../types'\nimport { keyOf, type Rec, type Val } from '../values'\nimport { defineNode, fail, nodeId, type Origin } from './def'\n\nconst params = z.strictObject({ in: nodeId, keys: z.array(z.string().min(1)).min(1) })\n\nexport const distinctNode = defineNode({\n op: 'distinct',\n label: 'Distinct',\n category: 'transform',\n description: 'One record per distinct combination of the key fields.',\n slots: [{ id: 'in', label: 'In', path: ['in'] }],\n output: true,\n defaults: () => ({ in: '', keys: [] }),\n params,\n compile: (p, env) => {\n const input = env.input(p.in)\n const unknown = p.keys.filter((k) => !Object.hasOwn(input.type.fields, k))\n if (unknown.length) return fail(`unknown keys: ${unknown.join(', ')}`)\n const fields: Record<string, MType> = {}\n const origins: Record<string, Origin> = {}\n for (const k of p.keys) {\n fields[k] = input.type.fields[k] as MType\n origins[k] = input.origins[k] as Origin\n }\n return ok({\n output: { type: t.record(fields), origins },\n run: (inputs) => {\n const seen = new Set<string>()\n const rows: Rec[] = []\n for (const row of inputs(p.in)) {\n const k = keyOf(row, p.keys)\n if (seen.has(k)) continue\n seen.add(k)\n rows.push(Object.fromEntries(p.keys.map((f) => [f, (row[f] ?? null) as Val])))\n }\n return ok({ rows })\n },\n })\n },\n})\n","/\n `expectedSchema` as JSON Schema (arch.md, \"expectedSchema is the type environment\").\n \n The stored schema of a source is its type environment: `sourceRecordType` derives the\n * record type a `source` node emits. `format` stays a validation constraint, never a type: a\n * `{ \"type\": \"string\", \"format\": \"date\" }` field is a `string`, and `to_date` makes a date.\n \n Until per-record contract validation (Ajv) exists, `conformRows` is the runtime guard: it\n * projects rows onto the declared fields and checks every value against its declared type.\n /\n\nimport type { Column, LogicalType, Table, TargetEntity } from '../schema'\nimport type { JsonSchema } from './document'\nimport { err, ok, type Result } from './result'\nimport { Instant } from './time'\nimport { type MType, type NonNull, type RecordType, show, t } from './types'\nimport { isRecordVal, type Json, type Rec, type Val } from './values'\n\ntype Node = Readonly<Record<string, unknown>>\n\nconst DIALECT = 'https://json-schema.org/draft/2020-12/schema'\n\n/* The record type of a source's schema. Optional fields read as null, so are nullable. /\nexport function sourceRecordType(schema: JsonSchema): Result<RecordType, string> {\n const properties = schema.properties as Readonly<Record<string, Node>> \| undefined\n if (schema.type !== 'object' \|\| typeof properties !== 'object' \|\| properties === null) {\n return err(\n 'a source schema must describe one object record (\"type\": \"object\" with \"properties\")',\n )\n }\n const required = new Set(Array.isArray(schema.required) ? (schema.required as string[]) : [])\n const fields: Record<string, MType> = {}\n for (const [name, node] of Object.entries(properties)) {\n const type = toMType(node)\n fields[name] = required.has(name) ? type : t.nullable(type)\n }\n return ok(t.record(fields))\n}\n\nfunction toMType(node: Node): MType {\n const union = (node.anyOf ?? node.oneOf) as readonly Node[] \| undefined\n if (Array.isArray(union)) {\n const nonNull = union.filter((m) => m.type !== 'null')\n const inner = nonNull.length === 1 ? toMType(nonNull[0] as Node) : t.unknown\n return union.length > nonNull.length ? t.nullable(inner) : inner\n }\n if (Array.isArray(node.type)) {\n const types = node.type as readonly string[]\n const nonNull = types.filter((x) => x !== 'null')\n const inner = nonNull.length === 1 ? toMType({ ...node, type: nonNull[0] }) : t.unknown\n return nonNull.length < types.length ? t.nullable(inner) : inner\n }\n if (Array.isArray(node.enum)) {\n const kinds = new Set(\n (node.enum as readonly unknown[]).map((v) => (v === null ? 'null' : typeof v)),\n )\n const hasNull = kinds.delete('null')\n const inner: MType = kinds.size === 1 ? scalar([...kinds][0] as string) : t.unknown\n return hasNull ? t.nullable(inner) : inner\n }\n switch (node.type) {\n case 'string':\n case 'number':\n case 'boolean':\n return scalar(node.type)\n case 'integer':\n return t.number\n case 'array':\n return t.list(\n typeof node.items === 'object' && node.items ? toMType(node.items as Node) : t.unknown,\n )\n case 'object': {\n const props = (node.properties ?? {}) as Readonly<Record<string, Node>>\n return t.record(Object.fromEntries(Object.entries(props).map(([k, v]) => [k, toMType(v)])))\n }\n default:\n return t.unknown\n }\n}\n\nfunction scalar(kind: string): NonNull {\n switch (kind) {\n case 'string':\n return t.string\n case 'number':\n return t.number\n case 'boolean':\n return t.boolean\n default:\n return t.unknown\n }\n}\n\nfunction logicalSchema(logical: LogicalType): Record<string, Json> {\n switch (logical) {\n case 'string':\n return { type: 'string' }\n case 'integer':\n return { type: 'integer' }\n case 'decimal':\n return { type: 'number' }\n case 'boolean':\n return { type: 'boolean' }\n case 'date':\n return { type: 'string', format: 'date' }\n case 'timestamp':\n return { type: 'string', format: 'date-time' }\n default:\n return {}\n }\n}\n\nfunction fieldSchema(logical: LogicalType, nullable: boolean, description?: string \| null) {\n const base = logicalSchema(logical)\n const typed =\n nullable && typeof base.type === 'string' ? { ...base, type: [base.type, 'null'] } : base\n return description ? { ...typed, description } : typed\n}\n\nfunction objectSchema(\n id: string,\n fields: readonly {\n name: string\n logical: LogicalType\n nullable: boolean\n description?: string \| null\n }[],\n): JsonSchema {\n return {\n $schema: DIALECT,\n $id: id,\n type: 'object',\n required: fields.filter((f) => !f.nullable).map((f) => f.name),\n properties: Object.fromEntries(\n fields.map((f) => [f.name, fieldSchema(f.logical, f.nullable, f.description)]),\n ),\n additionalProperties: true,\n }\n}\n\n/* A starting `expectedSchema` for a source table, from what its connector describes. /\nexport function tableJsonSchema(table: Table, system?: string): JsonSchema {\n return objectSchema(\n system ? `${system}.${table.name}` : table.name,\n table.columns.map((c: Column) => ({\n name: c.name,\n logical: c.logicalType,\n nullable: c.nullable,\n description: c.description,\n })),\n )\n}\n\n/* The pinned schema of an internal entity read as a source. /\nexport function entityJsonSchema(entity: TargetEntity): JsonSchema {\n return objectSchema(\n `internal.${entity.name}`,\n entity.fields.map((f) => ({\n name: f.name,\n logical: f.logicalType,\n nullable: f.nullable,\n description: f.description,\n })),\n )\n}\n\n/* Does a runtime value inhabit this type? /\nexport function conforms(value: Val, type: MType): boolean {\n if (value === null) return type.kind === 'nullable' \|\| type.kind === 'unknown'\n switch (type.kind) {\n case 'nullable':\n return conforms(value, type.of)\n case 'unknown':\n return true\n case 'string':\n return typeof value === 'string'\n case 'number':\n return typeof value === 'number' && Number.isFinite(value)\n case 'boolean':\n return typeof value === 'boolean'\n case 'date':\n return value instanceof Instant\n case 'list':\n return Array.isArray(value) && (value as readonly Val[]).every((v) => conforms(v, type.of))\n case 'tuple':\n return (\n Array.isArray(value) &&\n value.length === type.of.length &&\n type.of.every((x, i) => conforms((value as readonly Val[])[i] as Val, x))\n )\n case 'record':\n return (\n isRecordVal(value) &&\n Object.entries(type.fields).every(([k, v]) => conforms(value[k] ?? null, v))\n )\n default:\n return false\n }\n}\n\nexport interface FieldViolation {\n readonly field: string\n readonly expected: string\n readonly count: number\n /* Row positions of the first violations. /\n readonly samples: readonly number[]\n}\n\n/* Project rows onto the declared fields and check each value; one violation per field. /\nexport function conformRows(\n rows: readonly Readonly<Record<string, unknown>>[],\n type: RecordType,\n): { rows: Rec[]; violations: FieldViolation[] } {\n const fields = Object.entries(type.fields)\n const counts = new Map<string, { count: number; samples: number[] }>()\n const out: Rec[] = []\n for (const [i, row] of rows.entries()) {\n const rec: Record<string, Val> = {}\n for (const [name, fieldType] of fields) {\n const value = (row[name] ?? null) as Val\n if (!conforms(value, fieldType)) {\n const v = counts.get(name) ?? { count: 0, samples: [] }\n v.count += 1\n if (v.samples.length < 5) v.samples.push(i)\n counts.set(name, v)\n }\n rec[name] = value\n }\n out.push(rec)\n }\n return {\n rows: out,\n violations: [...counts].map(([field, v]) => ({\n field,\n expected: show(type.fields[field] as MType),\n ...v,\n })),\n }\n}\n","/\n `source`: one entity of an external or internal system, read once per run into the\n * snapshot. Its record type comes from the version's `expectedSchema` entry for this node.\n * Loading checks every value against that type; a violation fails the node, so nothing\n * downstream runs on data the version never claimed to handle.\n /\n\nimport { z } from 'zod'\nimport { conformRows, type FieldViolation, sourceRecordType } from '../jsonschema'\nimport { compilePredicate, nonNullPaths, type Test } from '../predicate'\nimport { err, ok, type Result } from '../result'\nimport { type MType, type RecordType, stripNull, t } from '../types'\nimport type { Rec, Relation } from '../values'\nimport {\n defineNode,\n fail,\n type NodeFailure,\n type NodeIssue,\n type NodeOutput,\n type Origin,\n ownOrigins,\n type RunIssue,\n} from './def'\n\nconst params = z.strictObject({\n system: z.string().min(1),\n entity: z.string().min(1),\n filter: z.unknown().optional(),\n})\n\n/\n Narrow the fields a passing filter guarantees are non-null (and so present). The condition\n * has compiled against `output`, so every path it names exists.\n /\nexport function narrow(output: NodeOutput, cond: unknown): NodeOutput {\n const fields = { ...output.type.fields }\n const origins = { ...output.origins }\n for (const path of nonNullPaths(cond)) {\n fields[path] = stripNull(fields[path] as MType)\n const origin = origins[path] as Origin\n origins[path] = { node: origin.node, field: origin.field, omittable: false }\n }\n return { ...output, type: t.record(fields), origins }\n}\n\n/* Shared by `source` and `transform`: conform rows, or fail with one issue per field. /\nexport function loadRows(\n node: string,\n rows: readonly Readonly<Record<string, unknown>>[],\n type: RecordType,\n): Result<Rec[], NodeFailure> {\n const loaded = conformRows(rows, type)\n if (loaded.violations.length === 0) return ok(loaded.rows)\n const issues: RunIssue[] = loaded.violations.map((v: FieldViolation) => ({\n node,\n code: 'schema_violation',\n field: v.field,\n message: `${v.field}: ${v.count} values are not ${v.expected}`,\n count: v.count,\n samples: v.samples,\n }))\n return err({\n code: 'schema_violation',\n message: `${loaded.violations.length} fields do not match the declared schema`,\n issues,\n })\n}\n\nexport const sourceNode = defineNode({\n op: 'source',\n label: 'Source',\n category: 'source',\n description: 'Reads one entity of a source system into the run snapshot.',\n slots: [],\n output: true,\n defaults: () => ({ system: '', entity: '' }),\n params,\n compile: (p, env) => {\n const schema = env.version.expectedSchema[env.id]\n if (!schema) {\n return fail(`no expectedSchema for source '${env.id}'`, { code: 'missing_schema' })\n }\n const declared = sourceRecordType(schema)\n if (!declared.ok) return fail(declared.error, { code: 'missing_schema' })\n const type = declared.value\n\n let test: Test \| undefined\n if (p.filter !== undefined) {\n const compiled = compilePredicate(p.filter, env.recordEnv(type))\n if (!compiled.ok)\n return { ok: false, error: [{ message: `filter: ${compiled.error}` }] as NodeIssue[] }\n test = compiled.value\n }\n const declaredOutput: NodeOutput = { type, origins: ownOrigins(env.id, type) }\n const output = test ? narrow(declaredOutput, p.filter) : declaredOutput\n\n return ok({\n output,\n run: (_inputs, ctx) => {\n const loaded = loadRows(env.id, ctx.snapshot[env.id] ?? [], type)\n if (!loaded.ok) return loaded\n const rows: Relation = test\n ? loaded.value.filter((r) => (test as Test)(null, r, ctx))\n : loaded.value\n return ok({ rows })\n },\n })\n },\n})\n","/\n `filter`: keeps records where the predicate holds. A `{ path, is_null: false }` condition\n * (alone or inside `all`) narrows that field to non-null in the output type.\n /\n\nimport { z } from 'zod'\nimport { compilePredicate } from '../predicate'\nimport { ok } from '../result'\nimport { defineNode, fail, nodeId } from './def'\nimport { narrow } from './source'\n\nconst params = z.strictObject({ in: nodeId, cond: z.unknown() })\n\nexport const filterNode = defineNode({\n op: 'filter',\n label: 'Filter',\n category: 'transform',\n description: 'Keeps the records where a condition holds.',\n slots: [{ id: 'in', label: 'In', path: ['in'] }],\n output: true,\n defaults: () => ({ in: '', cond: {} }),\n params,\n compile: (p, env) => {\n const input = env.input(p.in)\n const test = compilePredicate(p.cond, env.recordEnv(input.type))\n if (!test.ok) return fail(`cond: ${test.error}`)\n const cond = test.value\n return ok({\n output: narrow(input, p.cond),\n run: (inputs, ctx) => ok({ rows: inputs(p.in).filter((r) => cond(null, r, ctx)) }),\n })\n },\n})\n","/\n `join`: equi-join on key pairs plus an optional residual `where`, part of the match (as in\n * SQL `ON`). `left` makes every right field nullable; `semi` / `anti` keep left records with\n * at least one / no match and return the left schema.\n \n `select` picks and renames right fields; without it every right field is kept, a join key\n * with the same name on both sides merges, and any other collision is a save error. Null keys\n * never match.\n \n `cardinality` is declared and enforced while the hash table is built:\n * `n:1` right keys unique, `1:n` left keys unique, `1:1` both, `n:m` unrestricted but needs a\n * `count` expectation on this node.\n /\n\nimport { z } from 'zod'\nimport { compilePredicate, type Test } from '../predicate'\nimport { err, ok } from '../result'\nimport { comparable, type MType, show, t } from '../types'\nimport { type Json, keyOf, type Rec, type Relation, toJson, type Val } from '../values'\nimport { defineNode, nodeId, type NodeIssue, type Origin } from './def'\n\nconst params = z.strictObject({\n left: nodeId,\n right: nodeId,\n on: z.array(z.tuple([z.string().min(1), z.string().min(1)])).min(1),\n type: z.enum(['inner', 'left', 'semi', 'anti']).optional(),\n cardinality: z.enum(['1:1', 'n:1', '1:n', 'n:m']),\n select: z.record(z.string().min(1), z.string().min(1)).optional(),\n where: z.unknown().optional(),\n tolerate_skips: z.boolean().optional(),\n})\n\n/* Index of rows by key, skipping null keys; reports the first duplicate when `unique`. /\nfunction index(rows: Relation, keys: readonly string[], unique: boolean) {\n const byKey = new Map<string, Rec[]>()\n for (const row of rows) {\n if (keys.some((k) => (row[k] ?? null) === null)) continue\n const k = keyOf(row, keys)\n const bucket = byKey.get(k)\n if (!bucket) byKey.set(k, [row])\n else if (unique) return { duplicate: keys.map((f) => toJson(row[f] as Val)) }\n else bucket.push(row)\n }\n return { byKey }\n}\n\nexport const joinNode = defineNode({\n op: 'join',\n label: 'Join',\n category: 'transform',\n description: 'Combines two inputs on matching keys, with a declared cardinality.',\n slots: [\n { id: 'left', label: 'Left', path: ['left'] },\n { id: 'right', label: 'Right', path: ['right'] },\n ],\n output: true,\n defaults: () => ({ left: '', right: '', on: [], type: 'inner', cardinality: 'n:1' }),\n params,\n toleratesSkips: (p) => p.tolerate_skips === true,\n compile: (p, env) => {\n const left = env.input(p.left)\n const right = env.input(p.right)\n const kind = p.type ?? 'inner'\n const issues: NodeIssue[] = []\n\n for (const [lk, rk] of p.on) {\n const lt = left.type.fields[lk]\n const rt = right.type.fields[rk]\n if (!lt) issues.push({ message: `left has no field '${lk}'` })\n if (!rt) issues.push({ message: `right has no field '${rk}'` })\n if (lt && rt && !comparable(lt, rt)) {\n issues.push({ message: `join key ${lk}: ${show(lt)} vs ${rk}: ${show(rt)}` })\n }\n }\n if (p.cardinality === 'n:m' && env.expect?.count === undefined) {\n issues.push({\n message: \"an n:m join needs a count expectation in the version's expect block\",\n code: 'missing_expectation',\n })\n }\n\n // Right fields carried into the output: `select`ed and renamed, or all but merged keys.\n const carried: [string, string][] = []\n if (p.select) {\n for (const [from, to] of Object.entries(p.select)) {\n if (Object.hasOwn(right.type.fields, from)) carried.push([from, to])\n else issues.push({ message: `select: right has no field '${from}'` })\n }\n } else {\n const merged = new Set(p.on.filter(([l, r]) => l === r).map(([l]) => l))\n for (const name of Object.keys(right.type.fields))\n if (!merged.has(name)) carried.push([name, name])\n }\n const needsMerge = kind === 'inner' \|\| kind === 'left' \|\| p.where !== undefined\n const fields: Record<string, MType> = { ...left.type.fields }\n const origins: Record<string, Origin> = { ...left.origins }\n if (needsMerge) {\n for (const [from, to] of carried) {\n if (Object.hasOwn(fields, to)) {\n issues.push({ message: `field '${to}' exists on both sides; rename it with select` })\n continue\n }\n const type = right.type.fields[from] as MType\n fields[to] = kind === 'left' ? t.nullable(type) : type\n origins[to] =\n kind === 'left'\n ? { node: env.id, field: to, omittable: false }\n : (right.origins[from] as Origin)\n }\n }\n let where: Test \| undefined\n if (p.where !== undefined && issues.length === 0) {\n const compiled = compilePredicate(p.where, env.recordEnv(t.record(fields)))\n if (compiled.ok) where = compiled.value\n else issues.push({ message: `where: ${compiled.error}` })\n }\n if (issues.length) return { ok: false, error: issues }\n\n const leftKeys = p.on.map(([l]) => l)\n const rightKeys = p.on.map(([, r]) => r)\n const leftUnique = p.cardinality === '1:1' \|\| p.cardinality === '1:n'\n const rightUnique = p.cardinality === '1:1' \|\| p.cardinality === 'n:1'\n const nullRight = Object.fromEntries(carried.map(([, to]) => [to, null]))\n const project = (r: Rec): Rec => {\n const out: Record<string, Val> = {}\n for (const [from, to] of carried) out[to] = r[from] ?? null\n return out\n }\n const violated = (side: 'left' \| 'right', key: readonly Json[]) =>\n err({\n code: 'cardinality_violated',\n message: `${p.cardinality} join: ${side} key ${JSON.stringify(key)} is not unique`,\n samples: [key],\n })\n\n return ok({\n output: kind === 'inner' \|\| kind === 'left' ? { type: t.record(fields), origins } : left,\n run: (inputs, ctx) => {\n const lrows = inputs(p.left)\n const built = index(inputs(p.right), rightKeys, rightUnique)\n if (built.duplicate) return violated('right', built.duplicate)\n if (leftUnique) {\n const checked = index(lrows, leftKeys, true)\n if (checked.duplicate) return violated('left', checked.duplicate)\n }\n const byKey = built.byKey as Map<string, Rec[]>\n const rows: Rec[] = []\n for (const l of lrows) {\n const nullKey = leftKeys.some((k) => (l[k] ?? null) === null)\n const candidates = nullKey ? [] : (byKey.get(keyOf(l, leftKeys)) ?? [])\n const matches: Rec[] = []\n for (const r of candidates) {\n const merged = { ...l, ...project(r) }\n if (!where \|\| where(null, merged, ctx)) matches.push(merged)\n }\n if (kind === 'semi') {\n if (matches.length > 0) rows.push(l)\n } else if (kind === 'anti') {\n if (matches.length === 0) rows.push(l)\n } else if (matches.length > 0) rows.push(...matches)\n else if (kind === 'left') rows.push({ ...l, ...nullRight })\n }\n return ok({ rows })\n },\n })\n },\n})\n","/* Access ops, the pipeline entry points: `extract`, `const`, `coalesce`. /\n\nimport { z } from 'zod'\nimport { fieldType } from '../context'\nimport { ok, type Result } from '../result'\nimport { isNullable, type MType, stripNull, t, typeOfJson, unifyAll } from '../types'\nimport type { Val } from '../values'\nimport { defineOp, json, never, params } from './def'\n\n/* Reads one field of the current record, or a tuple of fields. A missing field is null. /\nexport const extract = defineOp({\n name: 'extract',\n params: params({ path: z.union([z.string().min(1), z.array(z.string().min(1)).min(1)]) }),\n nulls: 'consume',\n input: 'none',\n fallible: never,\n signature: (_input, p, env): Result<MType, string> => {\n if (typeof p.path === 'string') return fieldType(env.record, p.path)\n const types: MType[] = []\n for (const path of p.path) {\n const type = fieldType(env.record, path)\n if (!type.ok) return type\n types.push(type.value)\n }\n return ok(t.tuple(types))\n },\n run: (p) => {\n if (typeof p.path === 'string') {\n const path = p.path\n return (_input, ctx) => ok(ctx.record[path] ?? null)\n }\n const paths = p.path\n return (_input, ctx) => ok(paths.map((x) => ctx.record[x] ?? null))\n },\n})\n\n/* A literal value. /\nexport const constant = defineOp({\n name: 'const',\n params: params({ value: json }),\n nulls: 'consume',\n input: 'none',\n fallible: never,\n signature: (_input, p) => ok(typeOfJson(p.value)),\n run: (p) => {\n const value = p.value as Val\n return () => ok(value)\n },\n})\n\n/* The first non-null of several fields. Nullable only if every field is. /\nexport const coalesce = defineOp({\n name: 'coalesce',\n params: params({ paths: z.array(z.string().min(1)).min(2) }),\n nulls: 'consume',\n input: 'none',\n fallible: never,\n signature: (_input, p, env): Result<MType, string> => {\n const types: MType[] = []\n for (const path of p.paths) {\n const type = fieldType(env.record, path)\n if (!type.ok) return type\n types.push(type.value)\n }\n const common = unifyAll(types)\n if (!common.ok) return common\n return ok(types.every(isNullable) ? common.value : stripNull(common.value))\n },\n run: (p) => {\n const paths = p.paths\n return (_input, ctx) => {\n for (const path of paths) {\n const v = ctx.record[path] ?? null\n if (v !== null) return ok(v)\n }\n return ok(null)\n }\n },\n})\n","/* Type conversion: `to_number`, `to_string`, `to_bool`, `to_date`, `assert_type`. /\n\nimport { z } from 'zod'\nimport { err, ok, stepError } from '../result'\nimport {\n dateFormat,\n formatDate,\n hasFullDate,\n type Instant,\n isTimeZone,\n parseDateValue,\n parseDateFormat,\n} from '../time'\nimport { assignable, parseTypeName, show, t, typeName } from '../types'\nimport { toJson, type Val } from '../values'\nimport { defineOp, expectKind, never, params } from './def'\n\nconst NUMBER = /^[+-]?(\\d+(\\.\\d)?\|\\.\\d+)([eE][+-]?\\d+)?$/\n\nconst dateFormatParam = z.string().superRefine((s, ctx) => {\n const f = parseDateFormat(s)\n if (!f.ok) ctx.addIssue({ code: 'custom', message: f.error })\n})\n\nconst timeZone = z.string().refine(isTimeZone, 'unknown time zone')\n\n/** Parses a number from a string (a boolean gives 1 or 0). Strict raises, else null. /\nexport const toNumber = defineOp({\n name: 'to_number',\n params: params({ strict: z.boolean().optional() }),\n nulls: 'propagate',\n fallible: (p) => p.strict === true,\n signature: (input, p) => {\n const s = expectKind(input, ['string', 'boolean'], 'to_number')\n if (!s.ok) return s\n return ok(input.kind === 'boolean' \|\| p.strict ? t.number : t.nullable(t.number))\n },\n run: (p) => (input) => {\n if (typeof input === 'boolean') return ok(input ? 1 : 0)\n const text = (input as string).trim()\n if (NUMBER.test(text)) return ok(Number(text))\n return p.strict ? stepError('parse_failed', `'${input as string}' is not a number`) : ok(null)\n },\n})\n\n/* Canonical string form. `format` applies to dates, in the run time zone. /\nexport const toString = defineOp({\n name: 'to_string',\n params: params({ format: dateFormatParam.optional() }),\n nulls: 'propagate',\n fallible: never,\n signature: (input, p) => {\n if (input.kind === 'unknown') return err('to_string needs a known input type')\n if (p.format !== undefined && input.kind !== 'date') {\n return err('to_string format applies to dates only')\n }\n return ok(t.string)\n },\n run: (p, _env, input) => {\n if (input.kind === 'date') {\n const format = dateFormat(p.format ?? 'iso')\n return (v, ctx) => ok(formatDate(v as Instant, format, ctx.tz))\n }\n return (v) => ok(stringify(v))\n },\n})\n\nfunction stringify(v: Val): string {\n if (typeof v === 'string') return v\n if (typeof v === 'number' \|\| typeof v === 'boolean') return String(v)\n return JSON.stringify(toJson(v))\n}\n\nconst TRUE_VALUES = ['true', '1']\nconst FALSE_VALUES = ['false', '0']\n\n/* Explicit truthiness: only the listed values convert, anything else is an error. /\nexport const toBool = defineOp({\n name: 'to_bool',\n params: params({\n true_values: z.array(z.string()).min(1).optional(),\n false_values: z.array(z.string()).min(1).optional(),\n }).refine(\n (p) =>\n !(p.true_values ?? TRUE_VALUES).some((v) => (p.false_values ?? FALSE_VALUES).includes(v)),\n 'true_values and false_values overlap',\n ),\n nulls: 'propagate',\n fallible: () => true,\n signature: (input) => {\n const s = expectKind(input, ['string', 'number'], 'to_bool')\n return s.ok ? ok(t.boolean) : s\n },\n run: (p) => {\n const yes = new Set(p.true_values ?? TRUE_VALUES)\n const no = new Set(p.false_values ?? FALSE_VALUES)\n return (input) => {\n const text = typeof input === 'number' ? String(input) : (input as string).trim()\n if (yes.has(text)) return ok(true)\n if (no.has(text)) return ok(false)\n return stepError('parse_failed', `'${text}' is not a listed boolean value`)\n }\n },\n})\n\n/\n Parses to an instant: `iso`, `epoch_ms`, `epoch_s`, or a `YYYY MM DD HH mm ss` pattern.\n * Wall-clock values are read in `tz`, by default the run's frozen time zone.\n /\nexport const toDate = defineOp({\n name: 'to_date',\n params: params({ format: dateFormatParam, tz: timeZone.optional() }).refine((p) => {\n const format = parseDateFormat(p.format)\n return !format.ok \|\| hasFullDate(format.value)\n }, 'to_date format needs YYYY, MM and DD'),\n nulls: 'propagate',\n fallible: () => true,\n signature: (input, p) => {\n const epoch = dateFormat(p.format).kind === 'epoch'\n const s = expectKind(input, epoch ? ['string', 'number'] : ['string'], 'to_date')\n return s.ok ? ok(t.date) : s\n },\n run: (p) => {\n const format = dateFormat(p.format)\n return (input, ctx) => {\n const instant = parseDateValue(input as string \| number, format, p.tz ?? ctx.tz)\n return instant\n ? ok(instant)\n : stepError(\n 'parse_failed',\n `'${String(input as string \| number)}' does not match date format ${p.format}`,\n )\n }\n },\n})\n\n/* A runtime no-op and a checkpoint for the validator: the input must have this type. /\nexport const assertType = defineOp({\n name: 'assert_type',\n params: params({\n type: z.string().superRefine((s, ctx) => {\n const parsed = parseTypeName(s)\n if (!parsed.ok) ctx.addIssue({ code: 'custom', message: parsed.error })\n }),\n }),\n nulls: 'propagate',\n fallible: never,\n signature: (input, p) => {\n const declared = typeName(p.type)\n return assignable(input, declared)\n ? ok(declared)\n : err(`expected ${p.type}, got ${show(input)}`)\n },\n run: () => (input) => ok(input),\n})\n","/\n Date ops: `format_date`, `shift_date`, `truncate_date`, `to_utc`. Calendar math happens in\n * the run's frozen time zone unless a `tz` is given.\n /\n\nimport { z } from 'zod'\nimport { ok } from '../result'\nimport {\n dateFormat,\n duration,\n formatDate,\n type Instant,\n isTimeZone,\n parseDateFormat,\n parseDuration,\n shift,\n truncate,\n} from '../time'\nimport { type MType, t } from '../types'\nimport { defineOp, expectKind, never, params } from './def'\n\nconst dateIn =\n (op: string, out: MType = t.date) =>\n (input: MType) => {\n const s = expectKind(input, ['date'], op)\n return s.ok ? ok(out) : s\n }\n\nexport const formatDateOp = defineOp({\n name: 'format_date',\n params: params({\n format: z.string().superRefine((s, ctx) => {\n const f = parseDateFormat(s)\n if (!f.ok) ctx.addIssue({ code: 'custom', message: f.error })\n }),\n tz: z.string().refine(isTimeZone, 'unknown time zone').optional(),\n }),\n nulls: 'propagate',\n fallible: never,\n signature: dateIn('format_date', t.string),\n run: (p) => {\n const format = dateFormat(p.format)\n return (input, ctx) => ok(formatDate(input as Instant, format, p.tz ?? ctx.tz))\n },\n})\n\n/* Shift by a duration such as `+10y` or `-30d`. /\nexport const shiftDate = defineOp({\n name: 'shift_date',\n params: params({\n by: z.string().superRefine((s, ctx) => {\n const d = parseDuration(s)\n if (!d.ok) ctx.addIssue({ code: 'custom', message: d.error })\n }),\n }),\n nulls: 'propagate',\n fallible: never,\n signature: dateIn('shift_date'),\n run: (p) => {\n const by = duration(p.by)\n return (input, ctx) => ok(shift(input as Instant, by, ctx.tz))\n },\n})\n\nexport const truncateDate = defineOp({\n name: 'truncate_date',\n params: params({ unit: z.enum(['day', 'month', 'year']) }),\n nulls: 'propagate',\n fallible: never,\n signature: dateIn('truncate_date'),\n run: (p) => (input, ctx) => ok(truncate(input as Instant, p.unit, ctx.tz)),\n})\n\n/* Instants carry no zone, so this is the identity; kept as an explicit normalisation step. /\nexport const toUtc = defineOp({\n name: 'to_utc',\n params: params({}),\n nulls: 'propagate',\n fallible: never,\n signature: dateIn('to_utc'),\n run: () => (input) => ok(input),\n})\n","/\n `fn`: the record-scope escape hatch. Calls a named, reviewed, version-pinned function the\n * host registers in `GraphEnv.functions`, with a declared input and output type.\n /\n\nimport { z } from 'zod'\nimport type { FnDef } from '../context'\nimport { err, ok } from '../result'\nimport { assignable, show } from '../types'\nimport { defineOp, params } from './def'\n\nexport const fn = defineOp({\n name: 'fn',\n params: params({ ref: z.string().min(1) }),\n nulls: 'consume',\n fallible: (p, env) => env.functions[p.ref]?.fallible ?? true,\n signature: (input, p, env) => {\n const def = Object.hasOwn(env.functions, p.ref) ? env.functions[p.ref] : undefined\n if (!def) return err(`unknown function '${p.ref}'`)\n if (def.input && !assignable(input, def.input)) {\n return err(`function '${p.ref}' takes ${show(def.input)}, got ${show(input)}`)\n }\n return ok(def.output)\n },\n run: (p, env) => {\n const def = env.functions[p.ref] as FnDef\n return (input, ctx) => def.run(input, ctx)\n },\n})\n","/\n List ops for list-typed fields within one record: `each`, `filter_list`, `index`, `first`,\n * `last`, `len`, `unique`, `sum`, `min`, `max`, `contains`. Collection-wide work belongs to\n * collection nodes.\n /\n\nimport { z } from 'zod'\nimport { compileOperand, compilePredicate } from '../predicate'\nimport { compileSteps } from '../pipeline'\nimport { err, expectOk, ok, type Result } from '../result'\nimport { comparable, type ListType, type MType, orderable, show, stripNull, t } from '../types'\nimport { canonicalKey, compareVals, type Val } from '../values'\nimport { defineOp, never, params } from './def'\n\nconst listIn = (input: MType, op: string): Result<MType, string> =>\n input.kind === 'list' ? ok(input.of) : err(`${op} expects a list, got ${show(input)}`)\n\n/* Applies a nested pipeline to every element. Nesting depth is capped at 1. /\nexport const each = defineOp({\n name: 'each',\n params: params({ pipeline: z.array(z.unknown()).min(1) }),\n nulls: 'propagate',\n fallible: (p, env, input) =>\n expectOk(compileSteps(p.pipeline, { ...env, depth: env.depth + 1 }, (input as ListType).of))\n .fallible,\n signature: (input, p, env) => {\n if (env.depth >= 1) return err('each cannot be nested inside each')\n const element = listIn(input, 'each')\n if (!element.ok) return element\n const nested = compileSteps(p.pipeline, { ...env, depth: env.depth + 1 }, element.value)\n if (!nested.ok) return err(`each step ${nested.error.step}: ${nested.error.message}`)\n if (nested.value.omittable) return err('each cannot end in omit_if_null')\n return ok(t.list(nested.value.type))\n },\n run: (p, env, input) => {\n const { run } = expectOk(\n compileSteps(p.pipeline, { ...env, depth: env.depth + 1 }, (input as ListType).of),\n )\n return (list, ctx) => {\n const out: Val[] = []\n for (const [i, element] of (list as readonly Val[]).entries()) {\n const r = run(element, ctx)\n if (!r.ok)\n return err({\n code: r.error.code,\n detail: `element ${i}, ${r.error.op}: ${r.error.detail}`,\n })\n out.push(r.value as Val)\n }\n return ok(out)\n }\n },\n})\n\nexport const filterList = defineOp({\n name: 'filter_list',\n params: params({ cond: z.unknown() }),\n nulls: 'propagate',\n fallible: never,\n signature: (input, p, env) => {\n const element = listIn(input, 'filter_list')\n if (!element.ok) return element\n const test = compilePredicate(p.cond, env, element.value)\n return test.ok ? ok(input) : test\n },\n run: (p, env, input) => {\n const test = expectOk(compilePredicate(p.cond, env, (input as ListType).of))\n return (list, ctx) => ok((list as readonly Val[]).filter((e) => test(e, ctx.record, ctx)))\n },\n})\n\nconst pick = (name: string, at: (length: number) => number) =>\n defineOp({\n name,\n params: params({}),\n nulls: 'propagate',\n fallible: never,\n signature: (input) => {\n const element = listIn(input, name)\n return element.ok ? ok(t.nullable(element.value)) : element\n },\n run: () => (list) => ok((list as readonly Val[])[at((list as readonly Val[]).length)] ?? null),\n })\n\nexport const first = pick('first', () => 0)\nexport const last = pick('last', (n) => n - 1)\n\n/* Element at `at`; a negative index counts from the end. Out of range gives null. /\nexport const index = defineOp({\n name: 'index',\n params: params({ at: z.number().int() }),\n nulls: 'propagate',\n fallible: never,\n signature: (input) => {\n const element = listIn(input, 'index')\n return element.ok ? ok(t.nullable(element.value)) : element\n },\n run: (p) => (list) => ok((list as readonly Val[]).at(p.at) ?? null),\n})\n\n/* Length of a list, or of a string in code points. /\nexport const len = defineOp({\n name: 'len',\n params: params({}),\n nulls: 'propagate',\n fallible: never,\n signature: (input) =>\n input.kind === 'list' \|\| input.kind === 'string'\n ? ok(t.number)\n : err(`len expects a list or string, got ${show(input)}`),\n run: () => (v) => ok(typeof v === 'string' ? Array.from(v).length : (v as readonly Val[]).length),\n})\n\n/* Drops repeated elements, keeping the first occurrence. /\nexport const unique = defineOp({\n name: 'unique',\n params: params({}),\n nulls: 'propagate',\n fallible: never,\n signature: (input) => {\n const element = listIn(input, 'unique')\n return element.ok ? ok(input) : element\n },\n run: () => (list) => {\n const seen = new Set<string>()\n return ok(\n (list as readonly Val[]).filter((e) => {\n const k = canonicalKey(e)\n if (seen.has(k)) return false\n seen.add(k)\n return true\n }),\n )\n },\n})\n\n/* Null elements are skipped; an empty list gives null. /\nexport const sum = defineOp({\n name: 'sum',\n params: params({}),\n nulls: 'propagate',\n fallible: never,\n signature: (input) => {\n const element = listIn(input, 'sum')\n if (!element.ok) return element\n return stripNull(element.value).kind === 'number'\n ? ok(t.nullable(t.number))\n : err(`sum expects list<number>, got ${show(input)}`)\n },\n // Sorted first, so floating-point results do not depend on element order.\n run: () => (list) => {\n const numbers = (list as readonly Val[])\n .filter((x): x is number => x !== null)\n .sort((a, b) => a - b)\n return ok(numbers.length === 0 ? null : numbers.reduce((a, b) => a + b, 0))\n },\n})\n\nconst extreme = (name: 'min' \| 'max') =>\n defineOp({\n name,\n params: params({}),\n nulls: 'propagate',\n fallible: never,\n signature: (input) => {\n const element = listIn(input, name)\n if (!element.ok) return element\n return orderable(element.value)\n ? ok(t.nullable(stripNull(element.value)))\n : err(`${name} expects a list of numbers, strings or dates, got ${show(input)}`)\n },\n run: () => (list) => {\n let best: Val = null\n for (const x of list as readonly Val[]) {\n if (x === null) continue\n if (best === null \|\| (name === 'min' ? compareVals(x, best) < 0 : compareVals(x, best) > 0))\n best = x\n }\n return ok(best)\n },\n })\n\nexport const min = extreme('min')\nexport const max = extreme('max')\n\n/* Membership of a literal, `{ ref }` or `{ param }` value. Null is never a member. /\nexport const contains = defineOp({\n name: 'contains',\n params: params({ value: z.unknown().refine((v) => v !== undefined, 'contains needs a value') }),\n nulls: 'propagate',\n fallible: never,\n signature: (input, p, env) => {\n const element = listIn(input, 'contains')\n if (!element.ok) return element\n const operand = compileOperand(p.value, env, stripNull(element.value).kind === 'date')\n if (!operand.ok) return operand\n return comparable(element.value, operand.value.type)\n ? ok(t.boolean)\n : err(`cannot look for ${show(operand.value.type)} in ${show(input)}`)\n },\n run: (p, env, input) => {\n const element = (input as ListType).of\n const { get } = expectOk(compileOperand(p.value, env, stripNull(element).kind === 'date'))\n return (list, ctx) => {\n const v = get(list, ctx.record, ctx)\n return ok(\n v !== null && (list as readonly Val[]).some((x) => x !== null && compareVals(x, v) === 0),\n )\n }\n },\n})\n","/* `lookup`: a static value map stored with the version, for enum and code translation. /\n\nimport { z } from 'zod'\nimport { err, expectOk, ok, stepError } from '../result'\nimport { comparable, show, t, typeOfJson, unify, unifyAll } from '../types'\nimport type { Json, Val } from '../values'\nimport { defineOp, params } from './def'\n\nconst SCALAR = new Set(['string', 'number', 'boolean'])\n\n/\n Translate a scalar through `tables[table]` (keys are the value's string form). `on_miss`:\n * `null` (default) yields null, `pass` forwards the input, `error` raises `lookup_miss`.\n /\nexport const lookup = defineOp({\n name: 'lookup',\n params: params({\n table: z.string().min(1),\n on_miss: z.enum(['null', 'pass', 'error']).optional(),\n }),\n nulls: 'propagate',\n fallible: (p) => p.on_miss === 'error',\n signature: (input, p, env) => {\n if (!SCALAR.has(input.kind))\n return err(`lookup expects a string, number or boolean, got ${show(input)}`)\n if (!Object.hasOwn(env.tables, p.table)) return err(`unknown lookup table '${p.table}'`)\n const values = Object.values(env.tables[p.table] as Record<string, Json>)\n const value = unifyAll(values.map(typeOfJson))\n if (!value.ok) return err(`lookup table '${p.table}' mixes value types: ${value.error}`)\n switch (p.on_miss ?? 'null') {\n case 'null':\n return ok(t.nullable(value.value))\n case 'error':\n return ok(value.value)\n default: {\n if (!comparable(input, value.value)) {\n return err(\n `on_miss \"pass\" forwards ${show(input)}, but the table yields ${show(value.value)}`,\n )\n }\n return ok(expectOk(unify(input, value.value)))\n }\n }\n },\n run: (p, env) => {\n const table = env.tables[p.table] as Readonly<Record<string, Json>>\n const miss = p.on_miss ?? 'null'\n return (input) => {\n const key = String(input as string \| number \| boolean)\n if (Object.hasOwn(table, key)) return ok(table[key] as Val)\n if (miss === 'error') return stepError('lookup_miss', `'${key}' is not in table '${p.table}'`)\n return ok(miss === 'pass' ? input : null)\n }\n },\n})\n","/* Null and blank handling: `blank_to_null`, `default`, `require`, `omit_if_null`. /\n\nimport { z } from 'zod'\nimport { err, ok, stepError } from '../result'\nimport { assignable, show, stripNull, t, typeOfJson } from '../types'\nimport { OMIT, type Val } from '../values'\nimport { always, defineOp, expectKind, json, never, params } from './def'\n\n/* An empty or whitespace-only string becomes null. /\nexport const blankToNull = defineOp({\n name: 'blank_to_null',\n params: params({}),\n nulls: 'propagate',\n fallible: never,\n signature: (input) => {\n const s = expectKind(input, ['string'], 'blank_to_null')\n return s.ok ? ok(t.nullable(t.string)) : s\n },\n run: () => (input) => ok((input as string).trim() === '' ? null : input),\n})\n\n/* Replaces null with a literal of the input's type. /\nexport const defaultOp = defineOp({\n name: 'default',\n params: params({ value: json }),\n nulls: 'consume',\n fallible: never,\n signature: (input, p) => {\n if (p.value === null) return err('default needs a non-null value')\n const base = stripNull(input)\n const literal = typeOfJson(p.value)\n if (base.kind === 'unknown') return ok(literal)\n return assignable(literal, base)\n ? ok(base)\n : err(`default value is ${show(literal)}, input is ${show(input)}`)\n },\n run: (p) => {\n const value = p.value as Val\n return (input) => ok(input ?? value)\n },\n})\n\n/* Null triggers the node's `on_error` policy. /\nexport const requireOp = defineOp({\n name: 'require',\n params: params({ message: z.string().optional() }),\n nulls: 'consume',\n fallible: always,\n signature: (input) => ok(stripNull(input)),\n run: (p) => {\n const message = p.message ?? 'required value is null'\n return (input) => (input === null ? stepError('required_null', message) : ok(input))\n },\n})\n\n/\n Terminal. A null leaves the field out of the record (and so out of the write) instead of\n * setting it to null. Readers downstream see the field as nullable.\n /\nexport const omitIfNull = defineOp({\n name: 'omit_if_null',\n params: params({}),\n nulls: 'consume',\n terminal: true,\n fallible: never,\n signature: (input) => ok(t.nullable(stripNull(input))),\n run: () => (input) => ok(input === null ? OMIT : input),\n})\n","/\n The unit table behind `convert_unit`: mass, length and volume, each against one base unit.\n * Unit names are matched case-insensitively. Anything else, and any conversion across\n * dimensions, is unknown.\n /\n\ntype Dimension = 'mass' \| 'length' \| 'volume'\n\nconst UNITS: Readonly<Record<string, { readonly dimension: Dimension; readonly factor: number }>> =\n {\n // mass, in grams\n mg: { dimension: 'mass', factor: 0.001 },\n g: { dimension: 'mass', factor: 1 },\n kg: { dimension: 'mass', factor: 1000 },\n t: { dimension: 'mass', factor: 1_000_000 },\n oz: { dimension: 'mass', factor: 28.349523125 },\n lb: { dimension: 'mass', factor: 453.59237 },\n // length, in metres\n mm: { dimension: 'length', factor: 0.001 },\n cm: { dimension: 'length', factor: 0.01 },\n m: { dimension: 'length', factor: 1 },\n km: { dimension: 'length', factor: 1000 },\n in: { dimension: 'length', factor: 0.0254 },\n ft: { dimension: 'length', factor: 0.3048 },\n // volume, in litres\n ml: { dimension: 'volume', factor: 0.001 },\n l: { dimension: 'volume', factor: 1 },\n m3: { dimension: 'volume', factor: 1000 },\n }\n\nconst unit = (name: string) => UNITS[name.trim().toLowerCase()]\n\nexport function isUnit(name: string): boolean {\n return unit(name) !== undefined\n}\n\n/* Multiply by this to convert `from` into `to`; undefined if unknown or across dimensions. /\nexport function conversionFactor(from: string, to: string): number \| undefined {\n const a = unit(from)\n const b = unit(to)\n if (!a \|\| !b \|\| a.dimension !== b.dimension) return undefined\n // Divide instead of multiplying by a reciprocal, so kg -> g is exactly 1000.\n return a.factor / b.factor\n}\n","/* Numeric ops: `add`, `subtract`, `multiply`, `divide`, `round`, `abs`, `clamp`, `convert_unit`. /\n\nimport { z } from 'zod'\nimport { err, ok, stepError } from '../result'\nimport { isNullable, type MType, nullableIf, show, stripNull, t } from '../types'\nimport { conversionFactor, isUnit } from '../units'\nimport { defineOp, expectKind, never, params } from './def'\n\n// Zod 4 numbers are finite: Infinity and NaN are rejected.\nconst finite = z.number()\n\nconst numberIn = (op: string) => (input: MType) => {\n const s = expectKind(input, ['number'], op)\n return s.ok ? ok(t.number) : s\n}\n\nconst arithmetic = <K extends string>(\n name: string,\n key: K,\n apply: (a: number, b: number) => number,\n) =>\n defineOp({\n name,\n params: params({ [key]: finite } as { [P in K]: typeof finite }),\n nulls: 'propagate',\n fallible: never,\n signature: numberIn(name),\n run: (p) => {\n const operand = (p as Record<K, number>)[key]\n return (input) => ok(apply(input as number, operand))\n },\n })\n\nexport const add = arithmetic('add', 'value', (a, b) => a + b)\nexport const subtract = arithmetic('subtract', 'value', (a, b) => a - b)\nexport const multiply = arithmetic('multiply', 'by', (a, b) => a b)\n\n/** `by: 0` is rejected when the version is saved, never at runtime. /\nexport const divide = defineOp({\n name: 'divide',\n params: params({ by: finite.refine((n) => n !== 0, 'divide by zero') }),\n nulls: 'propagate',\n fallible: never,\n signature: numberIn('divide'),\n run: (p) => (input) => ok((input as number) / p.by),\n})\n\n/* Shift the decimal point by `places` without floating-point drift (1.005 stays 1.005). /\nfunction shiftDecimal(n: number, places: number): number {\n const [mantissa, exponent = '0'] = String(n).split('e')\n return Number(`${mantissa}e${Number(exponent) + places}`)\n}\n\ntype RoundMode = 'half_up' \| 'half_even' \| 'floor' \| 'ceil'\n\nfunction roundScaled(x: number, mode: RoundMode): number {\n switch (mode) {\n case 'floor':\n return Math.floor(x)\n case 'ceil':\n return Math.ceil(x)\n case 'half_up':\n return Math.sign(x) Math.round(Math.abs(x))\n case 'half_even': {\n const a = Math.abs(x)\n const floor = Math.floor(a)\n const diff = a - floor\n const r = diff > 0.5 \|\| (diff === 0.5 && floor % 2 === 1) ? floor + 1 : floor\n return Math.sign(x) * r\n }\n }\n}\n\n/** Round to `precision` decimals. `half_up` rounds halves away from zero. /\nexport const round = defineOp({\n name: 'round',\n params: params({\n precision: z.number().int().min(0).max(15).optional(),\n mode: z.enum(['half_up', 'half_even', 'floor', 'ceil']).optional(),\n }),\n nulls: 'propagate',\n fallible: never,\n signature: numberIn('round'),\n run: (p) => {\n const precision = p.precision ?? 0\n const mode = p.mode ?? 'half_up'\n // The final shift goes through String(), which also turns -0 into 0.\n return (input) =>\n ok(shiftDecimal(roundScaled(shiftDecimal(input as number, precision), mode), -precision))\n },\n})\n\nexport const abs = defineOp({\n name: 'abs',\n params: params({}),\n nulls: 'propagate',\n fallible: never,\n signature: numberIn('abs'),\n run: () => (input) => ok(Math.abs(input as number)),\n})\n\nexport const clamp = defineOp({\n name: 'clamp',\n params: params({ min: finite.optional(), max: finite.optional() })\n .refine((p) => p.min !== undefined \|\| p.max !== undefined, 'clamp needs min or max')\n .refine(\n (p) => p.min === undefined \|\| p.max === undefined \|\| p.min <= p.max,\n 'min is above max',\n ),\n nulls: 'propagate',\n fallible: never,\n signature: numberIn('clamp'),\n run: (p) => {\n const min = p.min ?? -Infinity\n const max = p.max ?? Infinity\n return (input) => ok(Math.min(max, Math.max(min, input as number)))\n },\n})\n\nconst unitName = z.string().refine(isUnit, 'unknown unit')\n\n/\n Convert over the unit table. The source unit is `from`, or the second element of an\n * extracted `(value, unit)` tuple. With a static `from` the conversion is checked at save\n * and cannot fail; with a unit read from the record an unknown unit raises.\n /\nexport const convertUnit = defineOp({\n name: 'convert_unit',\n params: params({ to: unitName, from: unitName.optional() }).refine(\n (p) =>\n p.from === undefined \|\|\n !isUnit(p.from) \|\|\n !isUnit(p.to) \|\|\n conversionFactor(p.from, p.to) !== undefined,\n 'from and to measure different things',\n ),\n nulls: 'propagate',\n fallible: (p) => p.from === undefined,\n signature: (input, p) => {\n if (input.kind === 'tuple') {\n if (p.from !== undefined)\n return err('convert_unit takes a unit from the record or from \"from\", not both')\n const [value, unit] = input.of as readonly [MType, MType]\n const pair =\n input.of.length === 2 &&\n stripNull(value).kind === 'number' &&\n stripNull(unit).kind === 'string'\n if (!pair) return err(`convert_unit expects (number, string), got ${show(input)}`)\n return ok(nullableIf(t.number, isNullable(value)))\n }\n if (p.from === undefined) return err('convert_unit needs a unit input or a \"from\" param')\n return numberIn('convert_unit')(input)\n },\n run: (p, _env, input) => {\n const to = p.to\n if (input.kind !== 'tuple') {\n const factor = conversionFactor(p.from as string, to) as number\n return (v) => ok((v as number) factor)\n }\n return (v) => {\n const [value, from] = v as readonly [number \| null, string \| null]\n if (value === null) return ok(null)\n if (from === null) return stepError('unknown_unit', `no unit given for ${value}`)\n const factor = conversionFactor(from, to)\n return factor === undefined\n ? stepError('unknown_unit', `cannot convert ${from} to ${to}`)\n : ok(value * factor)\n }\n },\n})\n","/*\n String ops: `trim`, `lower`, `upper`, `truncate`, `pad`, `replace`, `regex_extract`,\n * `split`, `join`, `concat`, `slug`. Lengths count code points, not UTF-16 units.\n /\n\nimport { z } from 'zod'\nimport { compileRegex } from '../predicate'\nimport { err, ok } from '../result'\nimport { type MType, show, stripNull, t } from '../types'\nimport type { Val } from '../values'\nimport { defineOp, expectKind, never, params } from './def'\n\nconst stringIn = (op: string) => (input: MType) => {\n const s = expectKind(input, ['string'], op)\n return s.ok ? ok(t.string) : s\n}\n\nconst regex = z.string().superRefine((s, ctx) => {\n const r = compileRegex(s)\n if (!r.ok) ctx.addIssue({ code: 'custom', message: r.error })\n})\n\nconst escapeRegex = (s: string) => s.replace(/[.+?^${}()\|[\\]\\\\]/g, '\\\\$&')\n\nexport const trim = defineOp({\n name: 'trim',\n params: params({ chars: z.string().min(1).optional() }),\n nulls: 'propagate',\n fallible: never,\n signature: stringIn('trim'),\n run: (p) => {\n if (p.chars === undefined) return (input) => ok((input as string).trim())\n const set = `[${p.chars.replace(/[\\\\\\]^-]/g, '\\\\$&')}]+`\n const edges = new RegExp(`^${set}\|${set}$`, 'gu')\n return (input) => ok((input as string).replace(edges, ''))\n },\n})\n\nexport const lower = defineOp({\n name: 'lower',\n params: params({}),\n nulls: 'propagate',\n fallible: never,\n signature: stringIn('lower'),\n run: () => (input) => ok((input as string).toLowerCase()),\n})\n\nexport const upper = defineOp({\n name: 'upper',\n params: params({}),\n nulls: 'propagate',\n fallible: never,\n signature: stringIn('upper'),\n run: () => (input) => ok((input as string).toUpperCase()),\n})\n\n/** Lossy, no inverse. With `ellipsis` the result, ellipsis included, fits `length`. /\nexport const truncate = defineOp({\n name: 'truncate',\n params: params({ length: z.number().int().min(0), ellipsis: z.boolean().optional() }).refine(\n (p) => !p.ellipsis \|\| p.length >= 1,\n 'truncate with ellipsis needs length >= 1',\n ),\n nulls: 'propagate',\n fallible: never,\n signature: stringIn('truncate'),\n run: (p) => (input) => {\n const chars = Array.from(input as string)\n if (chars.length <= p.length) return ok(input)\n return ok(\n p.ellipsis ? `${chars.slice(0, p.length - 1).join('')}…` : chars.slice(0, p.length).join(''),\n )\n },\n})\n\n/* Fixed-width codes, zero-padded SKUs. Strings already as long are unchanged. /\nexport const pad = defineOp({\n name: 'pad',\n params: params({\n length: z.number().int().min(1),\n with: z.string().min(1),\n side: z.enum(['left', 'right']),\n }),\n nulls: 'propagate',\n fallible: never,\n signature: stringIn('pad'),\n run: (p) => (input) => {\n const s = input as string\n return ok(p.side === 'left' ? s.padStart(p.length, p.with) : s.padEnd(p.length, p.with))\n },\n})\n\n/* Replace every occurrence; `regex: true` treats `pattern` as a regular expression. /\nexport const replace = defineOp({\n name: 'replace',\n params: params({\n pattern: z.string().min(1),\n with: z.string(),\n regex: z.boolean().optional(),\n }).superRefine((p, ctx) => {\n if (!p.regex \|\| typeof p.pattern !== 'string') return\n const r = compileRegex(p.pattern)\n if (!r.ok) ctx.addIssue({ code: 'custom', path: ['pattern'], message: r.error })\n }),\n nulls: 'propagate',\n fallible: never,\n signature: stringIn('replace'),\n run: (p) => {\n const pattern = new RegExp(p.regex ? p.pattern : escapeRegex(p.pattern), 'gu')\n // Literal replacement: `$` in `with` has no special meaning.\n return (input) => ok((input as string).replace(pattern, () => p.with))\n },\n})\n\nfunction groupCount(pattern: string): number {\n return (new RegExp(`${pattern}\|`, 'u').exec('') as RegExpExecArray).length - 1\n}\n\n/* The match (or capture `group`) of the first match; no match gives null. /\nexport const regexExtract = defineOp({\n name: 'regex_extract',\n params: params({ pattern: regex, group: z.number().int().min(0).optional() }).refine(\n (p) => !compileRegex(p.pattern).ok \|\| (p.group ?? 0) <= groupCount(p.pattern),\n 'group is larger than the number of capture groups',\n ),\n nulls: 'propagate',\n fallible: never,\n signature: (input) => {\n const s = expectKind(input, ['string'], 'regex_extract')\n return s.ok ? ok(t.nullable(t.string)) : s\n },\n run: (p) => {\n const re = new RegExp(p.pattern, 'u')\n const group = p.group ?? 0\n return (input) => ok(re.exec(input as string)?.[group] ?? null)\n },\n})\n\n/* Split on a separator. With `limit`, at most that many parts; the last keeps the rest. /\nexport const split = defineOp({\n name: 'split',\n params: params({ separator: z.string().min(1), limit: z.number().int().min(1).optional() }),\n nulls: 'propagate',\n fallible: never,\n signature: (input) => {\n const s = expectKind(input, ['string'], 'split')\n return s.ok ? ok(t.list(t.string)) : s\n },\n run: (p) => (input) => {\n const parts = (input as string).split(p.separator)\n if (p.limit === undefined \|\| parts.length <= p.limit) return ok(parts)\n return ok([...parts.slice(0, p.limit - 1), parts.slice(p.limit - 1).join(p.separator)])\n },\n})\n\n/* String join of a list; null elements are skipped. Unrelated to the `join` node. /\nexport const join = defineOp({\n name: 'join',\n params: params({ separator: z.string() }),\n nulls: 'propagate',\n fallible: never,\n signature: (input) => {\n if (input.kind !== 'list' \|\| stripNull(input.of).kind !== 'string') {\n return err(`join expects list<string>, got ${show(input)}`)\n }\n return ok(t.string)\n },\n run: (p) => (input) =>\n ok((input as readonly (string \| null)[]).filter((x) => x !== null).join(p.separator)),\n})\n\nconst SCALAR = new Set(['string', 'number', 'boolean'])\n\n/* Join the parts of a multi-path `extract`; null parts are skipped. /\nexport const concat = defineOp({\n name: 'concat',\n params: params({ separator: z.string().optional() }),\n nulls: 'propagate',\n fallible: never,\n signature: (input) => {\n if (input.kind !== 'tuple' \|\| !input.of.every((x) => SCALAR.has(stripNull(x).kind))) {\n return err(`concat expects a tuple of strings, numbers or booleans, got ${show(input)}`)\n }\n return ok(t.string)\n },\n run: (p) => (input) =>\n ok(\n (input as readonly Val[])\n .filter((x) => x !== null)\n .map((x) => String(x as string \| number \| boolean))\n .join(p.separator ?? ''),\n ),\n})\n\n/* URL-safe form: ASCII letters and digits, lowercase, runs of anything else to `separator`. /\nexport const slug = defineOp({\n name: 'slug',\n params: params({ separator: z.string().min(1).optional() }),\n nulls: 'propagate',\n fallible: never,\n signature: stringIn('slug'),\n run: (p) => {\n const sep = p.separator ?? '-'\n return (input) =>\n ok(\n (input as string)\n .normalize('NFKD')\n .replace(/[̀-ͯ]/g, '')\n .toLowerCase()\n .split(/[^a-z0-9]+/)\n .filter((x) => x !== '')\n .join(sep),\n )\n },\n})\n","/\n `when`: the one general conditional. First matching case wins;\n * `then` and `else` are a literal, `null`, or `{ \"pass\": true }` to forward the input. `else`\n * defaults to pass-through. As a pipeline's first step there is no input: every case must\n * test a `path`, and `else` is required.\n /\n\nimport { z } from 'zod'\nimport { compilePredicate } from '../predicate'\nimport { err, expectOk, ok, type Result } from '../result'\nimport { type MType, show, typeOfJson, unifyAll } from '../types'\nimport type { Json, Val } from '../values'\nimport { defineOp, json, never, params } from './def'\n\nconst pass = z.strictObject({ pass: z.literal(true) })\nconst scalar = z.union([z.string(), z.number(), z.boolean(), z.null(), z.array(json)])\nconst branch = z.union([pass, scalar])\n\ntype Branch = z.infer<typeof branch>\n\nconst isPass = (b: Branch): b is { pass: true } =>\n typeof b === 'object' && b !== null && !Array.isArray(b)\n\nexport const when = defineOp({\n name: 'when',\n params: params({\n cases: z.array(z.strictObject({ cond: z.unknown(), then: branch })).min(1),\n else: branch.optional(),\n }),\n nulls: 'consume',\n input: 'any',\n fallible: never,\n signature: (input, p, env): Result<MType, string> => {\n const first = input.kind === 'unit'\n const branches = [...p.cases.map((c) => c.then), ...(p.else === undefined ? [] : [p.else])]\n if (first && p.else === undefined) return err('when as the first step needs an \"else\"')\n if (first && branches.some(isPass)) return err('when as the first step has no input to pass')\n for (const [i, c] of p.cases.entries()) {\n const test = compilePredicate(c.cond, env, input)\n if (!test.ok) return err(`case ${i}: ${test.error}`)\n }\n const types = branches.map((b) => (isPass(b) ? input : typeOfJson(b)))\n if (p.else === undefined) types.push(input)\n const out = unifyAll(types)\n return out.ok ? out : err(`when branches disagree: ${types.map(show).join(', ')}`)\n },\n run: (p, env, input) => {\n const cases = p.cases.map((c) => ({\n test: expectOk(compilePredicate(c.cond, env, input)),\n then: c.then,\n }))\n const otherwise = p.else ?? { pass: true as const }\n const resolve = (b: Branch, v: Val): Val => (isPass(b) ? v : (b as Json as Val))\n return (v, ctx) => {\n for (const c of cases) if (c.test(v, ctx.record, ctx)) return ok(resolve(c.then, v))\n return ok(resolve(otherwise, v))\n }\n },\n})\n","/* The record op registry: every op a `map` field pipeline may use, by name. /\n\nimport { coalesce, constant, extract } from './access'\nimport { assertType, toBool, toDate, toNumber, toString } from './convert'\nimport { formatDateOp, shiftDate, toUtc, truncateDate } from './date'\nimport type { OpDef } from './def'\nimport { fn } from './fn'\nimport { contains, each, filterList, first, index, last, len, max, min, sum, unique } from './list'\nimport { lookup } from './lookup'\nimport { blankToNull, defaultOp, omitIfNull, requireOp } from './nulls'\nimport { abs, add, clamp, convertUnit, divide, multiply, round, subtract } from './numeric'\nimport {\n concat,\n join,\n lower,\n pad,\n regexExtract,\n replace,\n slug,\n split,\n trim,\n truncate,\n upper,\n} from './string'\nimport { when } from './when'\n\nexport type { OpDef, Step, StepResult } from './def'\nexport { defineOp } from './def'\n\nconst all = [\n extract,\n constant,\n coalesce,\n blankToNull,\n defaultOp,\n requireOp,\n omitIfNull,\n toNumber,\n toString,\n toBool,\n toDate,\n assertType,\n add,\n subtract,\n multiply,\n divide,\n round,\n abs,\n clamp,\n convertUnit,\n trim,\n lower,\n upper,\n truncate,\n pad,\n replace,\n regexExtract,\n split,\n join,\n concat,\n slug,\n formatDateOp,\n shiftDate,\n truncateDate,\n toUtc,\n when,\n each,\n filterList,\n index,\n first,\n last,\n len,\n unique,\n sum,\n min,\n max,\n contains,\n lookup,\n fn,\n]\n\nexport const opRegistry: Readonly<Record<string, OpDef<unknown>>> = Object.fromEntries(\n all.map((op) => [op.name, op as unknown as OpDef<unknown>]),\n)\n","/\n Sugar, kept for readability and expanded on save.\n \n - `{ op: \"if_<predicate>\", <operand>, then, else? }` expands to a one-case `when`, e.g.\n * `{ op: \"if_lte\", value: 0, then: null }` to\n * `{ op: \"when\", cases: [{ cond: { lte: 0 }, then: null }] }`.\n * - `{ op: \"lookup_entity\", entity, by, field, on_miss? }` expands into a `source` for the\n * internal entity, an `n:1` left `join` on `by`, and an `extract` of `field` (see\n * `normalizeVersion`).\n /\n\nimport { z } from 'zod'\nimport type { GraphEnv } from './context'\nimport type { MappingVersion, NodeJson } from './document'\nimport { entityJsonSchema } from './jsonschema'\nimport { PREDICATES } from './predicate'\nimport { type CompileIssue, err, ok, type Result } from './result'\n\nconst OPERAND_KEYS = ['value', 'values', 'date', 'pattern'] as const\nconst SUGAR_PREDICATES = new Set<string>(\n PREDICATES.filter((p) => !['all', 'any', 'not'].includes(p)),\n)\n\nexport type StepJson = { readonly op: string } & { readonly [key: string]: unknown }\n\n/* Expand one step if it is sugar; other steps pass through unchanged. /\nexport function expandStep(raw: StepJson): Result<StepJson, string> {\n const m = /^if_(.+)$/.exec(raw.op)\n if (!m) return ok(raw)\n const predicate = m[1] as string\n if (!SUGAR_PREDICATES.has(predicate)) return err(`unknown op '${raw.op}'`)\n const { op: _op, then, else: otherwise, path, ...rest } = raw\n if (!('then' in raw)) return err(`${raw.op} needs \"then\"`)\n\n const extra = Object.keys(rest).filter((k) => !(OPERAND_KEYS as readonly string[]).includes(k))\n if (extra.length) return err(`${raw.op} does not take ${extra.join(', ')}`)\n const given = OPERAND_KEYS.filter((k) => k in rest)\n const presence = predicate === 'is_null' \|\| predicate === 'is_blank'\n if (presence ? given.length > 0 : given.length !== 1) {\n return err(\n presence\n ? `${raw.op} takes no comparison value`\n : `${raw.op} takes exactly one of ${OPERAND_KEYS.join(', ')}`,\n )\n }\n const operand = presence ? true : rest[given[0] as string]\n const cond = { ...(path === undefined ? {} : { path }), [predicate]: operand }\n return ok({\n op: 'when',\n cases: [{ cond, then }],\n ...(otherwise === undefined ? {} : { else: otherwise }),\n })\n}\n\nconst LookupEntity = z.strictObject({\n op: z.literal('lookup_entity'),\n entity: z.string().min(1),\n by: z.string().min(1),\n field: z.string().min(1).default('id'),\n on_miss: z.enum(['null', 'pass', 'error']).optional(),\n})\n\nconst isStep = (v: unknown): v is StepJson =>\n typeof v === 'object' && v !== null && typeof (v as StepJson).op === 'string'\n\n/* Expand `if_` steps (also inside `each`); report `lookup_entity` where it cannot go. /\nfunction expandPipeline(\n steps: readonly unknown[],\n nested: boolean,\n issue: (message: string, step: number) => void,\n): unknown[] {\n return steps.map((step, i) => {\n if (!isStep(step)) return step\n if (nested && step.op === 'lookup_entity') {\n issue('lookup_entity cannot be used inside each', i)\n return step\n }\n if (step.op === 'each' && Array.isArray(step.pipeline)) {\n return {\n ...step,\n pipeline: expandPipeline(step.pipeline, true, (m) => issue(`each: ${m}`, i)),\n }\n }\n const expanded = expandStep(step)\n if (expanded.ok) return expanded.value\n issue(expanded.error, i)\n return step\n })\n}\n\ninterface Rewrite {\n readonly generated: NodeJson[]\n readonly node: NodeJson\n}\n\n/** Rewrite the `lookup_entity` steps of one map node into generated nodes. /\nfunction rewriteLookups(\n node: NodeJson,\n env: Pick<GraphEnv, 'targets'>,\n sources: Set<string>,\n issues: CompileIssue[],\n): Rewrite {\n const generated: NodeJson[] = []\n let input = node.in\n const drop = Array.isArray(node.drop) ? [...(node.drop as string[])] : []\n let n = 0\n const fields = (node.fields as unknown[]).map((raw) => {\n const f = raw as { key?: unknown; pipeline?: unknown }\n if (typeof f !== 'object' \|\| f === null \|\| !Array.isArray(f.pipeline)) return raw\n const key = String(f.key)\n const issue = (message: string, step: number) =>\n issues.push({ code: 'invalid_params', message, node: node.id, field: key, step })\n const pipeline = expandPipeline(f.pipeline, false, issue)\n const at = pipeline.findIndex((s) => isStep(s) && s.op === 'lookup_entity')\n if (at < 0) return { ...f, pipeline }\n if (pipeline.findLastIndex((s) => isStep(s) && s.op === 'lookup_entity') !== at) {\n issue('use one lookup_entity per field; resolve the others in an upstream map', at)\n return { ...f, pipeline }\n }\n const parsed = LookupEntity.safeParse(pipeline[at])\n if (!parsed.success) {\n issue(\n `lookup_entity: ${parsed.error.issues.map((x) => `${x.path.join('.')}: ${x.message}`).join('; ')}`,\n at,\n )\n return { ...f, pipeline }\n }\n if (at === 0) {\n issue('lookup_entity needs a key; extract it first', at)\n return { ...f, pipeline }\n }\n const { entity, by, field, on_miss: onMiss } = parsed.data\n if (!env.targets.entities.some((e) => e.name === entity)) {\n issue(`lookup_entity: unknown entity '${entity}'`, at)\n return { ...f, pipeline }\n }\n n += 1\n const prefix = pipeline.slice(0, at) as StepJson[]\n const only = prefix[0] as StepJson\n let keyField: string\n if (prefix.length === 1 && only.op === 'extract' && typeof only.path === 'string') {\n keyField = only.path\n } else {\n // A computed key is materialised as a field of a preceding map first.\n keyField = `__${key}__key`\n const helper: NodeJson = {\n id: `${node.id}__key${n}`,\n op: 'map',\n in: input,\n keep: 'all',\n fields: [{ key: keyField, pipeline: prefix }],\n ...(node.on_error === undefined ? {} : { on_error: node.on_error }),\n }\n generated.push(helper)\n input = helper.id\n drop.push(keyField)\n }\n const source = `__internal_${entity}`\n if (!sources.has(source)) {\n sources.add(source)\n generated.push({ id: source, op: 'source', system: 'internal', entity })\n }\n const valueField = `__${key}__lookup`\n const join: NodeJson = {\n id: `${node.id}__lookup${n}`,\n op: 'join',\n left: input,\n right: source,\n on: [[keyField, by]],\n type: 'left',\n cardinality: 'n:1',\n select: { [field]: valueField },\n tolerate_skips: true,\n }\n generated.push(join)\n input = join.id\n drop.push(valueField)\n const head: StepJson[] =\n onMiss === 'pass'\n ? [{ op: 'coalesce', paths: [valueField, keyField] }]\n : onMiss === 'error'\n ? [\n { op: 'extract', path: valueField },\n { op: 'require', message: `no ${entity} with ${by} equal to the key` },\n ]\n : [{ op: 'extract', path: valueField }]\n return { ...f, pipeline: [...head, ...pipeline.slice(at + 1)] }\n })\n if (n === 0) return { generated, node: { ...node, fields } }\n const keepAll = node.keep === 'all'\n return {\n generated,\n node: { ...node, in: input, fields, ...(keepAll ? { drop } : {}) },\n }\n}\n\n/\n The form a version is stored and compiled in: sugar expanded, `lookup_entity` rewritten\n * into graph nodes, and every internal source's schema pinned from the target model.\n * Idempotent.\n /\nexport function normalizeVersion(\n version: MappingVersion,\n env: Pick<GraphEnv, 'targets'>,\n): { version: MappingVersion; issues: CompileIssue[] } {\n const issues: CompileIssue[] = []\n const sources = new Set(version.nodes.filter((n) => n.op === 'source').map((n) => n.id))\n const nodes: NodeJson[] = []\n for (const node of version.nodes) {\n if (node.op !== 'map' \|\| !Array.isArray(node.fields)) {\n nodes.push(node)\n continue\n }\n const rewrite = rewriteLookups(node, env, sources, issues)\n nodes.push(...rewrite.generated, rewrite.node)\n }\n const expectedSchema = { ...version.expectedSchema }\n for (const node of nodes) {\n if (node.op !== 'source' \|\| node.system !== 'internal' \|\| expectedSchema[node.id]) continue\n const entity = env.targets.entities.find((e) => e.name === node.entity)\n if (entity) expectedSchema[node.id] = entityJsonSchema(entity)\n }\n return { version: { ...version, nodes, expectedSchema }, issues }\n}\n","/\n The step compiler (arch.md, \"Type checking\"): a fold over the steps of one field pipeline\n * that threads a value type and a closure. Nullability is lifted here, so an op marked\n * `nulls: 'propagate'` never sees null: a null input skips it and stays null.\n /\n\nimport type { RecordContext, RecordEnv } from './context'\nimport { opRegistry } from './ops'\nimport type { Step } from './ops/def'\nimport { err, ok, type Result, type StepError } from './result'\nimport { expandStep, type StepJson } from './sugar'\nimport { mayBeNull, type MType, stripNull, t } from './types'\nimport type { Omitted, Val } from './values'\n\nexport interface PipelineError extends StepError {\n readonly step: number\n readonly op: string\n}\n\nexport interface CompiledPipeline {\n readonly type: MType\n /* Can return an error at runtime. /\n readonly fallible: boolean\n /* Ends in `omit_if_null`: the field may be left out of the record. /\n readonly omittable: boolean\n readonly run: (input: Val, ctx: RecordContext) => Result<Val \| Omitted, PipelineError>\n}\n\nexport interface StepIssue {\n readonly step: number\n readonly message: string\n}\n\nconst NULL_RESULT = ok(null)\n\n/* Compile a pipeline. Top-level pipelines start from `t.unit`; `each` passes the element type. /\nexport function compileSteps(\n raw: readonly unknown[],\n env: RecordEnv,\n input: MType = t.unit,\n): Result<CompiledPipeline, StepIssue> {\n if (raw.length === 0) return err({ step: 0, message: 'a pipeline needs at least one step' })\n\n let type = input\n let fallible = false\n let omittable = false\n const steps: Step[] = []\n const names: string[] = []\n\n for (const [i, value] of raw.entries()) {\n const issue = (message: string) => err({ step: i, message })\n if (typeof value !== 'object' \|\| value === null \|\| typeof (value as StepJson).op !== 'string') {\n return issue('a step is an object with an \"op\"')\n }\n const expanded = expandStep(value as StepJson)\n if (!expanded.ok) return issue(expanded.error)\n const { op, ...rest } = expanded.value\n const def = Object.hasOwn(opRegistry, op) ? opRegistry[op] : undefined\n if (!def) return issue(`unknown op '${op}'`)\n if (omittable) return issue(`${names.at(-1)} must be the last step`)\n\n const params = def.params.safeParse(rest)\n if (!params.success) {\n return issue(\n `${op}: ${params.error.issues.map((x) => `${x.path.length ? `${x.path.join('.')}: ` : ''}${x.message}`).join('; ')}`,\n )\n }\n\n const mode = def.input ?? 'value'\n if (mode === 'none' && type.kind !== 'unit') {\n return issue(`${op} starts a pipeline; it cannot follow another step`)\n }\n if (mode === 'value' && type.kind === 'unit') {\n return issue(`${op} needs an input; start the pipeline with extract, const, coalesce or when`)\n }\n\n // Nullability is lifted here, so the op only ever sees a non-null input.\n const propagate = def.nulls === 'propagate'\n const lifted = propagate && mayBeNull(type)\n const inner = propagate ? stripNull(type) : type\n if (inner.kind === 'never') return issue(`${op} receives only null; nothing to do`)\n\n const out = def.signature(inner, params.data, env)\n if (!out.ok) return issue(out.error)\n\n const bound = def.run(params.data, env, inner)\n steps.push(lifted ? (v, ctx) => (v === null ? NULL_RESULT : bound(v, ctx)) : bound)\n names.push(op)\n type = lifted ? t.nullable(out.value) : out.value\n fallible \|\|= def.fallible(params.data, env, inner)\n omittable = def.terminal === true\n }\n\n return ok({\n type,\n fallible,\n omittable,\n run: (input, ctx) => {\n let v: Val \| Omitted = input\n for (let i = 0; i < steps.length; i++) {\n const r = (steps[i] as Step)(v as Val, ctx)\n if (!r.ok) return err({ ...r.error, step: i, op: names[i] as string })\n v = r.value\n }\n return ok(v)\n },\n })\n}\n","/\n `map`: where the scopes meet. Splits a collection into records, runs one field pipeline per\n * target field with the record as the `extract` scope, and collects the results.\n \n `keep: \"all\"` passes the input fields through alongside the new ones, except those listed in\n * `drop` (the `lookup_entity` rewrite drops its helper fields that way). A failing field\n * applies `on_error`:\n * `null` writes null, `skip_field` leaves the field out, `skip_record` (default) drops the\n * record, `fail_sync` fails the node and stops the run.\n /\n\nimport { z } from 'zod'\nimport { OnError } from '../document'\nimport { type CompiledPipeline, compileSteps } from '../pipeline'\nimport { err, ok } from '../result'\nimport { type MType, stripNull, t } from '../types'\nimport { OMIT, type Rec, type Val } from '../values'\nimport { defineNode, nodeId, type NodeIssue, type Origin, type RunIssue } from './def'\n\nconst field = z.strictObject({ key: z.string().min(1), pipeline: z.array(z.unknown()).min(1) })\n\nconst params = z.strictObject({\n in: nodeId,\n fields: z.array(field).min(1),\n keep: z.enum(['none', 'all']).optional(),\n drop: z.array(z.string().min(1)).optional(),\n on_error: OnError.optional(),\n})\n\nconst SAMPLES = 5\n\nexport const mapNode = defineNode({\n op: 'map',\n label: 'Map fields',\n category: 'transform',\n description: 'One output field per pipeline, computed from each input record.',\n slots: [{ id: 'in', label: 'In', path: ['in'] }],\n output: true,\n defaults: () => ({ in: '', fields: [] }),\n params,\n compile: (p, env) => {\n const input = env.input(p.in)\n const renv = env.recordEnv(input.type)\n const policy = p.on_error ?? env.version.onError ?? 'skip_record'\n const issues: NodeIssue[] = []\n\n const drop = new Set(p.drop ?? [])\n if (drop.size > 0 && p.keep !== 'all')\n issues.push({ message: 'drop applies only with keep: \"all\"' })\n for (const name of drop) {\n if (!Object.hasOwn(input.type.fields, name))\n issues.push({ message: `drop: unknown field '${name}'` })\n }\n const keep = p.keep === 'all' ? Object.keys(input.type.fields).filter((f) => !drop.has(f)) : []\n\n const seen = new Set<string>()\n const compiled: { key: string; pipeline: CompiledPipeline }[] = []\n for (const f of p.fields) {\n if (seen.has(f.key))\n issues.push({ message: `field '${f.key}' is defined twice`, field: f.key })\n seen.add(f.key)\n const c = compileSteps(f.pipeline, renv)\n if (c.ok) compiled.push({ key: f.key, pipeline: c.value })\n else issues.push({ message: c.error.message, field: f.key, step: c.error.step })\n }\n if (issues.length) return { ok: false, error: issues }\n\n const fields: Record<string, MType> = {}\n const origins: Record<string, Origin> = {}\n for (const name of keep) {\n fields[name] = input.type.fields[name] as MType\n origins[name] = input.origins[name] as Origin\n }\n for (const { key, pipeline } of compiled) {\n const soft = pipeline.fallible && (policy === 'null' \|\| policy === 'skip_field')\n const omittable = pipeline.omittable \|\| (pipeline.fallible && policy === 'skip_field')\n fields[key] = soft ? t.nullable(pipeline.type) : pipeline.type\n origins[key] = {\n node: env.id,\n field: key,\n omittable,\n ...(omittable\n ? { present: pipeline.omittable ? stripNull(pipeline.type) : pipeline.type }\n : {}),\n }\n }\n\n return ok({\n output: {\n type: t.record(fields),\n origins,\n canSkip: policy === 'skip_record' && compiled.some((c) => c.pipeline.fallible),\n },\n run: (inputs, ctx) => {\n const errors = new Map<\n string,\n { field: string; code: string; count: number; samples: string[] }\n >()\n const rows: Rec[] = []\n let skipped = 0\n for (const record of inputs(p.in)) {\n const rc = { ...ctx, record }\n const out: Record<string, Val> = {}\n for (const name of keep) if (Object.hasOwn(record, name)) out[name] = record[name] as Val\n let drop = false\n for (const { key, pipeline } of compiled) {\n const r = pipeline.run(null, rc)\n if (r.ok) {\n if (r.value === OMIT) delete out[key]\n else out[key] = r.value\n continue\n }\n const detail = `step ${r.error.step} ${r.error.op}: ${r.error.detail}`\n if (policy === 'fail_sync') {\n return err({ code: r.error.code, message: `${key} ${detail}`, stop: true })\n }\n const k = `${key}\\u0000${r.error.code}`\n const e = errors.get(k) ?? { field: key, code: r.error.code, count: 0, samples: [] }\n e.count += 1\n if (e.samples.length < SAMPLES) e.samples.push(detail)\n errors.set(k, e)\n if (policy === 'null') out[key] = null\n else if (policy === 'skip_field') delete out[key]\n else {\n drop = true\n break\n }\n }\n if (drop) skipped += 1\n else rows.push(out)\n }\n const issues: RunIssue[] = [...errors.values()].map((e) => ({\n node: env.id,\n code: e.code,\n field: e.field,\n message: `${e.field}: ${e.count} records failed (${policy})`,\n count: e.count,\n samples: e.samples,\n }))\n return ok({ rows, skipped, issues })\n },\n })\n },\n})\n","/\n `metrics`: writes a small relation, such as counters, onto the sync run rather than into the\n * domain. Never held back by any check: it describes the run, and matters most when a run\n * is stopped.\n \n `count_by` reports one row per distinct combination of those fields with its number of\n * `rows`, the usual counter, so it needs no `aggregate` in front. The reported relation is the\n * node's output for `expect` (a `keyed` bound alerts on one counter); nothing reads it.\n /\n\nimport { z } from 'zod'\nimport { ok } from '../result'\nimport { type MType, t } from '../types'\nimport { type Json, keyOf, type Rec, sortRecords, toJson } from '../values'\nimport { defineNode, fail, nodeId, type Origin, ownOrigins } from './def'\n\nconst params = z.strictObject({\n in: nodeId,\n name: z.string().min(1),\n count_by: z.array(z.string().min(1)).min(1).optional(),\n})\n\n/* The count field `count_by` adds next to the group fields. /\nconst COUNT = 'rows'\n\nexport const metricsNode = defineNode({\n op: 'metrics',\n label: 'Run metrics',\n category: 'target',\n description: 'Reports a small relation (counters) on the run instead of the domain.',\n slots: [{ id: 'in', label: 'In', path: ['in'] }],\n output: false,\n effect: 'metrics',\n defaults: () => ({ in: '', name: '' }),\n params,\n compile: (p, env) => {\n const input = env.input(p.in)\n const by = p.count_by\n if (!by) {\n return ok({\n output: input,\n run: (inputs) => {\n const rows = sortRecords(inputs(p.in), [])\n return ok({ rows, metric: metric(env.id, p.name, rows) })\n },\n })\n }\n const unknown = by.filter((f) => !Object.hasOwn(input.type.fields, f))\n if (unknown.length) return fail(`count_by: unknown fields: ${unknown.join(', ')}`)\n if (by.includes(COUNT)) return fail(`count_by: '${COUNT}' is the count field; rename it first`)\n const fields: Record<string, MType> = Object.fromEntries(\n by.map((f) => [f, input.type.fields[f] as MType]),\n )\n const type = t.record({ ...fields, [COUNT]: t.number })\n return ok({\n output: {\n type,\n origins: {\n ...ownOrigins(env.id, type),\n ...Object.fromEntries(by.map((f) => [f, input.origins[f] as Origin])),\n },\n },\n run: (inputs) => {\n const groups = new Map<string, { first: Rec; n: number }>()\n for (const row of inputs(p.in)) {\n const k = keyOf(row, by)\n const group = groups.get(k)\n if (group) group.n += 1\n else groups.set(k, { first: row, n: 1 })\n }\n const counted = [...groups.values()].map(({ first, n }) => ({\n ...Object.fromEntries(by.map((f) => [f, first[f] ?? null])),\n [COUNT]: n,\n }))\n const rows = sortRecords(counted, by)\n return ok({ rows, metric: metric(env.id, p.name, rows) })\n },\n })\n },\n})\n\nfunction metric(node: string, name: string, rows: readonly Rec[]) {\n return { node, name, rows: rows.map((r) => toJson(r) as Record<string, Json>) }\n}\n","/\n `sink`: upserts its input on `key` into the internal model. Every input field is written to\n * the target path it names (`product.sku`, or a bare `sku` on the sink's own `target`), or\n * to the path `columns` renames it to. Types are enforced here against the host's\n * `TargetSchema`: an unknown path, a wrong type, or a nullable value for a required field\n * fails at save, blamed on the `map` field that produced it.\n \n A reference field listed in `refs` is written as a natural key of the entity it references\n * (`product_id` as a SKU, a join-table row as its two keys) and typed by those fields, so a\n * key of the wrong shape fails at save; the host resolves it to an id when it writes. Key\n * fields must be non-null, except a nullable identity field of an entity whose identity\n * matches NULLs as equal (a transfer with no origin, `from_warehouse_id = NULL`).\n \n `mode: 'replace'` makes the rows the complete set of the target for the company: the host\n * reconciles with `synchronize_all`, deleting rows this run no longer produces. That is what a\n * presence-only entity needs (a join-table row is the link). Because a short source read\n * would then delete real rows, `in` must carry a `count` expectation with a lower bound\n * (`min` or `shiftRatio.min`) whose action is `stop` or `skip_downstream`.\n \n The library performs no write: a run returns the rows, sorted by key, for the host.\n /\n\nimport { z } from 'zod'\nimport type { TargetEntity, TargetField, TargetSchema } from '../../schema'\nimport { resolveAction } from '../expect'\nimport { err, ok, type Result } from '../result'\nimport { type Instant, toDateString } from '../time'\nimport {\n assignable,\n fromLogicalType,\n type MType,\n mayBeNull,\n nullableIf,\n show,\n stripNull,\n t,\n} from '../types'\nimport { compareVals, type Json, keyOf, type Rec, toJson, type Val } from '../values'\nimport {\n defineNode,\n nodeId,\n type NodeIssue,\n type Origin,\n type SinkRef,\n type WritePolicy,\n} from './def'\n\nconst params = z.strictObject({\n in: nodeId,\n target: z.string().min(1),\n key: z.array(z.string().min(1)).min(1),\n columns: z.record(z.string(), z.string().min(1)).optional(),\n write: z.record(z.string(), z.enum(['overwrite', 'fill_if_null', 'never'])).optional(),\n refs: z.record(z.string(), z.strictObject({ by: z.array(z.string().min(1)).min(1) })).optional(),\n mode: z.enum(['upsert', 'replace']).optional(),\n})\n\ninterface Resolved {\n readonly entity: TargetEntity\n readonly field: TargetField\n readonly type: MType\n}\n\n/* `entity.field` names any entity; a bare name is a field of the sink's own target. /\nexport function resolveTarget(\n targets: TargetSchema,\n target: string,\n path: string,\n): Result<Resolved, string> {\n const dot = path.indexOf('.')\n const [entityName, fieldName] =\n dot < 0 ? [target, path] : [path.slice(0, dot), path.slice(dot + 1)]\n const entity = targets.entities.find((e) => e.name === entityName)\n if (!entity) return err(`target has no entity '${entityName}'`)\n const field = entity.fields.find((f) => f.name === fieldName)\n if (!field) return err(`${entityName} has no field '${fieldName}'`)\n return ok({ entity, field, type: nullableIf(fromLogicalType(field.logicalType), field.nullable) })\n}\n\n/\n The type of a reference field written as a natural key: the type of its one `by` field of\n * the referenced entity, or a tuple of them in `by` order (each with its own nullability).\n /\nexport function refType(\n targets: TargetSchema,\n field: TargetField,\n by: readonly string[],\n): Result<{ entity: string; type: MType }, string> {\n if (!field.references) return err(`${field.name} is not a reference`)\n const entity = targets.entities.find((e) => e.name === field.references)\n if (!entity) return err(`target has no entity '${field.references}'`)\n const parts: MType[] = []\n for (const name of by) {\n const part = entity.fields.find((f) => f.name === name)\n if (!part) return err(`${entity.name} has no field '${name}'`)\n parts.push(nullableIf(fromLogicalType(part.logicalType), part.nullable))\n }\n const value = parts.length === 1 ? stripNull(parts[0] as MType) : t.tuple(parts)\n return ok({ entity: entity.name, type: nullableIf(value, field.nullable) })\n}\n\n/* A nullable key field is allowed where the target identity matches NULLs as equal. /\nconst nullsEqual = ({ entity, field }: Resolved) =>\n field.nullable && entity.nullsNotDistinct === true && entity.identity.includes(field.name)\n\nexport const sinkNode = defineNode({\n op: 'sink',\n label: 'Write to target',\n category: 'target',\n description: 'Writes rows into a target entity, updating records with the same key.',\n slots: [{ id: 'in', label: 'In', path: ['in'] }],\n output: false,\n effect: 'sink',\n defaults: () => ({ in: '', target: '', key: [] }),\n params,\n compile: (p, env) => {\n const input = env.input(p.in)\n const issues: NodeIssue[] = []\n const targets = env.graph.targets\n if (!targets.entities.some((e) => e.name === p.target)) {\n return { ok: false, error: [{ message: `target has no entity '${p.target}'` }] }\n }\n const fieldNames = Object.keys(input.type.fields)\n for (const name of [\n ...Object.keys(p.columns ?? {}),\n ...Object.keys(p.write ?? {}),\n ...Object.keys(p.refs ?? {}),\n ]) {\n if (!fieldNames.includes(name))\n issues.push({ message: `'${name}' is not a field of ${p.in}` })\n }\n\n const paths: Record<string, string> = {}\n const logical: Record<string, TargetField['logicalType']> = {}\n const resolvedOf: Record<string, Resolved> = {}\n const refs: Record<string, SinkRef> = {}\n const entities = new Set([p.target])\n for (const name of fieldNames) {\n const path = p.columns?.[name] ?? name\n const origin = input.origins[name] as Origin\n const blame = { node: origin.node, field: origin.field }\n const resolved = resolveTarget(targets, p.target, path)\n if (!resolved.ok) {\n issues.push({ message: resolved.error, ...blame })\n continue\n }\n let expected = resolved.value.type\n const ref = p.refs?.[name]\n if (ref) {\n const typed = refType(targets, resolved.value.field, ref.by)\n if (!typed.ok) {\n issues.push({ message: `refs.${name}: ${typed.error}` })\n continue\n }\n expected = typed.value.type\n refs[path] = { entity: typed.value.entity, by: ref.by }\n }\n const type = input.type.fields[name] as MType\n const present = origin.present ?? type\n if (!assignable(present, expected)) {\n issues.push({\n message: `${path} expects ${show(expected)}, got ${show(present)}`,\n ...blame,\n })\n }\n paths[name] = path\n logical[name] = resolved.value.field.logicalType\n resolvedOf[name] = resolved.value\n entities.add(resolved.value.entity.name)\n }\n for (const k of p.key) {\n const type = input.type.fields[k]\n const resolved = resolvedOf[k]\n if (!type) issues.push({ message: `key '${k}' is not a field of ${p.in}` })\n else if (\n mayBeNull(type) &&\n ((input.origins[k] as Origin).omittable \|\| !resolved \|\| !nullsEqual(resolved))\n ) {\n issues.push({ message: `key '${k}' must be non-null, got ${show(type)}` })\n }\n }\n if (p.mode === 'replace') {\n const exp = env.version.expect[p.in]\n const lower = exp?.count?.min !== undefined \|\| exp?.count?.shiftRatio?.min !== undefined\n const action = resolveAction(exp?.onFail, 'count')\n if (!lower \|\| (action !== 'stop' && action !== 'skip_downstream')) {\n issues.push({\n message: `mode 'replace' deletes rows this run does not produce; give ${p.in} a count expectation with a lower bound and onFail stop or skip_downstream`,\n })\n }\n }\n if (issues.length) return { ok: false, error: issues }\n\n const keyPaths = p.key.map((k) => paths[k] as string)\n const write = p.write\n ? Object.fromEntries(\n Object.entries(p.write).map(([f, w]) => [paths[f] as string, w as WritePolicy]),\n )\n : undefined\n\n return ok({\n output: null,\n writes: [...entities].sort(),\n run: (inputs, ctx) => {\n // Key fields are never omittable, so every row has them (null only where allowed).\n const rows = [...inputs(p.in)].sort((a, b) => {\n for (const k of p.key) {\n const c = compareVals(a[k] as Val, b[k] as Val)\n if (c !== 0) return c\n }\n return 0\n })\n for (let i = 1; i < rows.length; i++) {\n if (keyOf(rows[i] as Rec, p.key) === keyOf(rows[i - 1] as Rec, p.key)) {\n const sample = p.key.map((k) => toJson((rows[i] as Rec)[k] as Val))\n return err({\n code: 'duplicate_key',\n message: `${p.key.join(', ')} ${JSON.stringify(sample)} is written twice`,\n samples: [sample],\n })\n }\n }\n const out = rows.map((row) => {\n const target: Record<string, Json> = {}\n for (const name of fieldNames) {\n if (!Object.hasOwn(row, name)) continue\n const v = row[name] ?? null\n const kind = logical[name]\n target[paths[name] as string] =\n v !== null && kind === 'date' ? toDateString(v as Instant, ctx.tz) : toJson(v)\n }\n return target\n })\n return ok({\n rows: out,\n write: {\n sink: env.id,\n target: p.target,\n key: keyPaths,\n rows: out,\n ...(write ? { write } : {}),\n ...(Object.keys(refs).length ? { refs } : {}),\n ...(p.mode === 'replace' ? { mode: 'replace' as const } : {}),\n },\n })\n },\n })\n },\n})\n","/\n `transform`: the collection-scope escape hatch. Calls reviewed, version-pinned code the host\n * registers in `GraphEnv.transforms`; its declared output `schema` (JSON Schema of one record)\n * keeps the rest of the graph type-checked, and its rows are checked against it at runtime.\n /\n\nimport { z } from 'zod'\nimport type { TransformDef } from '../context'\nimport { JsonSchema } from '../document'\nimport { sourceRecordType } from '../jsonschema'\nimport { err, ok } from '../result'\nimport { defineNode, fail, nodeId, ownOrigins } from './def'\nimport { loadRows } from './source'\n\nconst params = z.strictObject({\n ref: z.string().min(1),\n inputs: z.array(nodeId).min(1),\n schema: JsonSchema,\n})\n\nexport const transformNode = defineNode({\n op: 'transform',\n label: 'Transform (code)',\n category: 'transform',\n description: 'Reviewed, version-pinned code with a declared output schema.',\n slots: [{ id: 'inputs', label: 'Inputs', path: ['inputs'], multiple: true }],\n output: true,\n defaults: () => ({ ref: '', inputs: [], schema: { type: 'object', properties: {} } }),\n params,\n compile: (p, env) => {\n for (const id of p.inputs) env.input(id)\n const transforms = env.graph.transforms ?? {}\n if (!Object.hasOwn(transforms, p.ref)) return fail(`unknown transform '${p.ref}'`)\n const type = sourceRecordType(p.schema)\n if (!type.ok) return fail(`schema: ${type.error}`)\n const record = type.value\n const transform = transforms[p.ref] as TransformDef\n return ok({\n output: { type: record, origins: ownOrigins(env.id, record) },\n run: (inputs, ctx) => {\n const result = transform.run(p.inputs.map(inputs), ctx)\n if (!result.ok) return err({ code: 'transform_failed', message: result.error })\n const loaded = loadRows(env.id, result.value, record)\n return loaded.ok ? ok({ rows: loaded.value }) : loaded\n },\n })\n },\n})\n","/\n `union`: set union of inputs with the same fields. Field types must agree up to\n * nullability (a field nullable in any input is nullable in the output); project with a\n * `map` first otherwise. Duplicates collapse.\n /\n\nimport { z } from 'zod'\nimport { expectOk, ok } from '../result'\nimport { type MType, show, t, unify } from '../types'\nimport { keyOf, type Rec } from '../values'\nimport { defineNode, fail, nodeId, type NodeIssue, type Origin } from './def'\n\nconst params = z.strictObject({ inputs: z.array(nodeId).min(2) })\n\nexport const unionNode = defineNode({\n op: 'union',\n label: 'Union',\n category: 'transform',\n description: 'All records of several inputs with the same fields; duplicates collapse.',\n slots: [{ id: 'inputs', label: 'Inputs', path: ['inputs'], multiple: true }],\n output: true,\n defaults: () => ({ inputs: [] }),\n params,\n compile: (p, env) => {\n const outputs = p.inputs.map((id) => env.input(id))\n const first = outputs[0] as (typeof outputs)[number]\n const names = Object.keys(first.type.fields).sort()\n const issues: NodeIssue[] = []\n const fields: Record<string, MType> = {}\n const origins: Record<string, Origin> = {}\n for (const [i, out] of outputs.entries()) {\n const other = Object.keys(out.type.fields).sort()\n if (other.join('\\u0000') !== names.join('\\u0000')) {\n return fail(\n `${p.inputs[i]} has fields ${other.join(', ')}; ${p.inputs[0]} has ${names.join(', ')}`,\n )\n }\n }\n for (const name of names) {\n let type: MType = t.never\n let present: MType = t.never\n let omittable = false\n for (const [i, out] of outputs.entries()) {\n const field = out.type.fields[name] as MType\n const u = unify(type, field)\n if (!u.ok) {\n issues.push({\n message: `${name}: ${p.inputs[i]} gives ${show(field)}, earlier inputs ${show(type)}`,\n })\n break\n }\n type = u.value\n const origin = out.origins[name] as Origin\n omittable \|\|= origin.omittable\n present = expectOk(unify(present, origin.present ?? field))\n }\n fields[name] = type\n origins[name] = { node: env.id, field: name, omittable, ...(omittable ? { present } : {}) }\n }\n if (issues.length) return { ok: false, error: issues }\n return ok({\n output: { type: t.record(fields), origins },\n run: (inputs) => {\n const seen = new Set<string>()\n const rows: Rec[] = []\n for (const id of p.inputs) {\n for (const row of inputs(id)) {\n const k = keyOf(row, names)\n if (seen.has(k)) continue\n seen.add(k)\n rows.push(row)\n }\n }\n return ok({ rows })\n },\n })\n },\n})\n","/* The collection node registry, and the catalog the editor builds its palette from. /\n\nimport { aggregateNode } from './aggregate'\nimport { assertNode } from './assert'\nimport type { NodeCategory, NodeDef, Slot } from './def'\nimport { distinctNode } from './distinct'\nimport { filterNode } from './filter'\nimport { joinNode } from './join'\nimport { mapNode } from './map'\nimport { metricsNode } from './metrics'\nimport { sinkNode } from './sink'\nimport { sourceNode } from './source'\nimport { transformNode } from './transform'\nimport { unionNode } from './union'\n\nexport type from './def'\nexport { defineNode } from './def'\nexport { refType, resolveTarget } from './sink'\nexport { findCycle } from './assert'\n\nconst all = [\n sourceNode,\n mapNode,\n filterNode,\n joinNode,\n aggregateNode,\n distinctNode,\n unionNode,\n sinkNode,\n metricsNode,\n assertNode,\n transformNode,\n]\n\nexport const nodeRegistry: Readonly<Record<string, NodeDef<unknown>>> = Object.fromEntries(\n all.map((def) => [def.op, def as unknown as NodeDef<unknown>]),\n)\n\n/** What the editor needs to place a node and draw its handles. /\nexport interface CatalogEntry {\n readonly op: string\n readonly label: string\n readonly category: NodeCategory\n readonly description: string\n readonly slots: readonly Slot[]\n readonly output: boolean\n readonly defaults: () => Record<string, unknown>\n}\n\nexport const nodeCatalog: readonly CatalogEntry[] = all.map(\n ({ op, label, category, description, slots, output, defaults }) => ({\n op,\n label,\n category,\n description,\n slots,\n output,\n defaults,\n }),\n)\n","/\n Edges are implied by input references (`in`, `left`, `right`, `inputs`, and an assert's\n * `per.in` / `remove.in`); each node definition's `slots` name them. Everything that walks the\n * graph (ordering, dead nodes, lineage, freeing edges, the editor's edges) reads them here.\n /\n\nimport type { NodeJson } from './document'\nimport { nodeRegistry } from './nodes'\n\nexport interface Ref {\n /* Slot id on the consuming node. /\n readonly slot: string\n /* Id of the referenced (upstream) node. /\n readonly source: string\n /* Position within a `multiple` slot. /\n readonly index?: number\n}\n\nfunction at(node: Readonly<Record<string, unknown>>, path: readonly string[]): unknown {\n let value: unknown = node\n for (const key of path) {\n if (typeof value !== 'object' \|\| value === null) return undefined\n value = (value as Record<string, unknown>)[key]\n }\n return value\n}\n\n/* The input references of a node, slot by slot. Unknown ops have none. /\nexport function nodeRefs(node: NodeJson): Ref[] {\n const def = Object.hasOwn(nodeRegistry, node.op) ? nodeRegistry[node.op] : undefined\n if (!def) return []\n const refs: Ref[] = []\n for (const slot of def.slots) {\n const value = at(node, slot.path)\n if (slot.multiple && Array.isArray(value)) {\n for (const [index, source] of value.entries()) {\n if (typeof source === 'string' && source !== '') refs.push({ slot: slot.id, source, index })\n }\n } else if (typeof value === 'string' && value !== '') {\n refs.push({ slot: slot.id, source: value })\n }\n }\n return refs\n}\n\n/* Distinct upstream ids of a node, in slot order. /\nexport function inputIds(node: NodeJson): string[] {\n return [...new Set(nodeRefs(node).map((r) => r.source))]\n}\n\n/* Downstream neighbours of every node (only references to existing nodes). /\nexport function consumers(nodes: readonly NodeJson[]): Map<string, string[]> {\n const ids = new Set(nodes.map((n) => n.id))\n const next = new Map<string, string[]>(nodes.map((n) => [n.id, []]))\n for (const node of nodes) {\n for (const source of inputIds(node)) {\n if (ids.has(source)) (next.get(source) as string[]).push(node.id)\n }\n }\n return next\n}\n\nfunction reach(start: string, next: ReadonlyMap<string, readonly string[]>): Set<string> {\n const seen = new Set<string>()\n const stack = [...(next.get(start) ?? [])]\n while (stack.length > 0) {\n const id = stack.pop() as string\n if (seen.has(id)) continue\n seen.add(id)\n stack.push(...(next.get(id) as readonly string[]))\n }\n return seen\n}\n\n/* Every node fed by `id`, directly or not (not including `id`). /\nexport function downstream(nodes: readonly NodeJson[], id: string): Set<string> {\n return reach(id, consumers(nodes))\n}\n\n/* Every node feeding `id`, directly or not (not including `id`). /\nexport function upstream(nodes: readonly NodeJson[], id: string): Set<string> {\n const ids = new Set(nodes.map((n) => n.id))\n const prev = new Map(nodes.map((n) => [n.id, inputIds(n).filter((s) => ids.has(s))]))\n return reach(id, prev)\n}\n\n/* One cycle as node ids (first repeated at the end), or null if acyclic. /\nexport function findGraphCycle(nodes: readonly NodeJson[]): string[] \| null {\n const next = consumers(nodes)\n const state = new Map<string, 'open' \| 'done'>()\n const path: string[] = []\n const visit = (id: string): string[] \| null => {\n state.set(id, 'open')\n path.push(id)\n for (const to of next.get(id) as string[]) {\n if (state.get(to) === 'open') return [...path.slice(path.indexOf(to)), to]\n if (!state.has(to)) {\n const cycle = visit(to)\n if (cycle) return cycle\n }\n }\n path.pop()\n state.set(id, 'done')\n return null\n }\n for (const node of nodes) {\n if (state.has(node.id)) continue\n const cycle = visit(node.id)\n if (cycle) return cycle\n }\n return null\n}\n\n/\n Node ids with every node after the nodes it reads; ties keep document order, so the result\n * is stable. Nodes on a cycle are left out (check `findGraphCycle` first).\n /\nexport function topologicalOrder(nodes: readonly NodeJson[]): string[] {\n const next = consumers(nodes)\n const indegree = new Map(nodes.map((n) => [n.id, 0]))\n for (const targets of next.values())\n for (const t of targets) indegree.set(t, (indegree.get(t) as number) + 1)\n const position = new Map(nodes.map((n, i) => [n.id, i]))\n const ready = nodes.filter((n) => indegree.get(n.id) === 0).map((n) => n.id)\n const order: string[] = []\n while (ready.length > 0) {\n ready.sort((a, b) => (position.get(a) as number) - (position.get(b) as number))\n const id = ready.shift() as string\n order.push(id)\n for (const to of next.get(id) as string[]) {\n const remaining = (indegree.get(to) as number) - 1\n indegree.set(to, remaining)\n if (remaining === 0) ready.push(to)\n }\n }\n return order\n}\n","/\n The graph compiler (arch.md, \"Type checking\"): walks nodes in topological order, threading\n * record types along edges, and compiles each node into a closure in the same pass. The\n * result is one plan per version; a run never touches JSON.\n \n Every problem is collected in one pass and located by node, field and step. A node whose\n * inputs failed to compile is skipped silently, so one mistake does not cascade.\n /\n\nimport { type GraphEnv, recordEnv } from './context'\nimport type { MappingVersion, NodeJson } from './document'\nimport { type Checker, compileExpectation } from './expect'\nimport { consumers, findGraphCycle, inputIds, nodeRefs, topologicalOrder } from './graph'\nimport { type CompiledNode, nodeRegistry, type NodeEnv, type NodeOutput } from './nodes'\nimport type { CompileIssue } from './result'\nimport { normalizeVersion } from './sugar'\nimport type { RecordType } from './types'\n\nexport interface PlannedNode {\n readonly id: string\n readonly op: string\n /* Parsed params. /\n readonly params: Readonly<Record<string, unknown>>\n readonly inputs: readonly string[]\n readonly output: NodeOutput \| null\n readonly effect?: 'sink' \| 'metrics' \| 'check'\n readonly run: CompiledNode['run']\n /* The node's `expect` entry, compiled. /\n readonly check?: Checker\n /* Sinks downstream of this node, itself included: the reach of `skip_downstream`. /\n readonly sinks: readonly string[]\n /* Upstream of (or is) a `metrics` node: keeps running after a `stop`. /\n readonly feedsMetrics: boolean\n}\n\nexport interface Plan {\n /* The normalized version the plan was compiled from. /\n readonly version: MappingVersion\n readonly nodes: readonly PlannedNode[]\n /* Index of the last node reading each node's output; the edge is freed after it. /\n readonly lastUse: ReadonlyMap<string, number>\n /* Some predicate reads the run clock (`today`, `now`). /\n readonly usesClock: boolean\n}\n\n/\n `types` holds the output record type of every node that compiled, also when others did\n * not, so an editor can offer the fields reaching a node while the graph is half built.\n /\nexport type CompileResult =\n \| {\n readonly ok: true\n readonly plan: Plan\n readonly issues: readonly []\n readonly types: Readonly<Record<string, RecordType>>\n }\n \| {\n readonly ok: false\n readonly issues: readonly CompileIssue[]\n readonly types: Readonly<Record<string, RecordType>>\n }\n\nfunction paramsOf(node: NodeJson): Record<string, unknown> {\n const { id: _i, op: _o, label: _l, ...rest } = node\n return rest\n}\n\n/\n Structural rules that need no types: unique ids, known ops, resolvable references,\n * acyclic, no dead nodes, addressable `expect` keys. Checked in the browser too.\n /\nexport function structuralIssues(version: MappingVersion): CompileIssue[] {\n const issues: CompileIssue[] = []\n const byId = new Map<string, NodeJson>()\n for (const node of version.nodes) {\n if (byId.has(node.id))\n issues.push({ code: 'duplicate_id', message: `id '${node.id}' is used twice`, node: node.id })\n byId.set(node.id, node)\n }\n for (const node of version.nodes) {\n const def = Object.hasOwn(nodeRegistry, node.op) ? nodeRegistry[node.op] : undefined\n if (!def) {\n issues.push({ code: 'unknown_op', message: `unknown node op '${node.op}'`, node: node.id })\n continue\n }\n const refs = nodeRefs(node)\n for (const slot of def.slots) {\n if (!slot.optional && !refs.some((r) => r.slot === slot.id)) {\n issues.push({\n code: 'missing_input',\n message: `input '${slot.label}' is not connected`,\n node: node.id,\n })\n }\n }\n for (const ref of refs) {\n const source = byId.get(ref.source)\n if (!source) {\n issues.push({\n code: 'dangling_ref',\n message: `'${ref.slot}' refers to unknown node '${ref.source}'`,\n node: node.id,\n })\n } else if (nodeRegistry[source.op] && !nodeRegistry[source.op]?.output) {\n issues.push({\n code: 'dangling_ref',\n message: `'${ref.source}' (${source.op}) has no output to read`,\n node: node.id,\n })\n }\n }\n }\n const cycle = findGraphCycle(version.nodes)\n if (cycle) issues.push({ code: 'cycle', message: `cycle: ${cycle.join(' -> ')}`, node: cycle[0] })\n\n // No dead nodes: every node must reach a sink, metrics or assert.\n const live = new Set<string>()\n const effectful = (n: NodeJson) => nodeRegistry[n.op]?.effect !== undefined\n const stack = version.nodes.filter(effectful).map((n) => n.id)\n const prev = new Map(version.nodes.map((n) => [n.id, inputIds(n)]))\n while (stack.length > 0) {\n const id = stack.pop() as string\n if (live.has(id)) continue\n live.add(id)\n stack.push(...(prev.get(id) ?? []))\n }\n for (const node of version.nodes) {\n if (!live.has(node.id) && nodeRegistry[node.op]) {\n issues.push({\n code: 'dead_node',\n message: 'reaches no sink, metrics or assert',\n node: node.id,\n })\n }\n }\n for (const id of Object.keys(version.expect)) {\n if (!byId.has(id))\n issues.push({\n code: 'unknown_reference',\n message: `expect names unknown node '${id}'`,\n field: id,\n })\n }\n return issues\n}\n\n/* Compile a version against the host's environment. /\nexport function compileVersion(input: MappingVersion, env: GraphEnv): CompileResult {\n const normalized = normalizeVersion(input, env)\n const version = normalized.version\n const issues: CompileIssue[] = [...normalized.issues, ...structuralIssues(version)]\n if (issues.some((i) => i.code === 'cycle' \|\| i.code === 'duplicate_id'))\n return { ok: false, issues, types: {} }\n\n const byId = new Map(version.nodes.map((n) => [n.id, n]))\n const clock = { used: false }\n const outputs = new Map<string, NodeOutput>()\n const compiled = new Map<string, CompiledEntry>()\n const renv = (record: RecordType) =>\n recordEnv(record, {\n params: version.params,\n tables: version.tables,\n functions: env.functions ?? {},\n clock,\n })\n\n for (const id of topologicalOrder(version.nodes)) {\n const node = byId.get(id) as NodeJson\n const def = Object.hasOwn(nodeRegistry, node.op) ? nodeRegistry[node.op] : undefined\n if (!def) continue\n const refs = inputIds(node)\n if (refs.some((r) => !outputs.has(r))) continue // blocked by an upstream problem\n\n const parsed = def.params.safeParse(paramsOf(node))\n if (!parsed.success) {\n for (const x of parsed.error.issues) {\n issues.push({\n code: 'invalid_params',\n message: `${x.path.length ? `${x.path.join('.')}: ` : ''}${x.message}`,\n node: id,\n })\n }\n continue\n }\n const exp = version.expect[id]\n const nodeEnv: NodeEnv = {\n id,\n graph: env,\n version,\n ...(exp ? { expect: exp } : {}),\n clock,\n input: (ref) => outputs.get(ref) as NodeOutput,\n recordEnv: renv,\n }\n const result = def.compile(parsed.data, nodeEnv)\n if (!result.ok) {\n for (const x of result.error) {\n issues.push({\n code: x.code ?? 'type_error',\n message: x.message,\n node: x.node ?? id,\n ...(x.field === undefined ? {} : { field: x.field }),\n ...(x.step === undefined ? {} : { step: x.step }),\n })\n }\n continue\n }\n let output = result.value.output\n let check: Checker \| undefined\n if (exp) {\n if (!output) {\n issues.push({\n code: 'invalid_expectation',\n message: `${node.op} has no output to expect on`,\n node: id,\n })\n continue\n }\n const e = compileExpectation(id, exp, output, renv)\n if (!e.ok) {\n for (const x of e.error) {\n // Every expectation issue names its clause.\n issues.push({\n code: 'invalid_expectation',\n message: x.message,\n node: id,\n field: x.field as string,\n })\n }\n continue\n }\n output = e.value.output\n check = e.value.check\n }\n if (output) outputs.set(id, output)\n compiled.set(id, {\n node: { ...result.value, output },\n params: parsed.data as Record<string, unknown>,\n ...(check ? { check } : {}),\n })\n }\n\n issues.push(...sinkIssues(compiled), ...skipIssues(version, compiled))\n const types = Object.fromEntries([...outputs].map(([id, output]) => [id, output.type]))\n if (issues.length > 0) return { ok: false, issues: dedupe(issues), types }\n return { ok: true, plan: plan(version, compiled, clock.used), issues: [], types }\n}\n\ninterface CompiledEntry {\n readonly node: CompiledNode\n readonly params: Record<string, unknown>\n readonly check?: Checker\n}\n\ntype Compiled = ReadonlyMap<string, CompiledEntry>\n\n/* Sugar that fails to expand is reported by normalization and again by the step compiler. /\nfunction dedupe(issues: readonly CompileIssue[]): CompileIssue[] {\n const seen = new Set<string>()\n return issues.filter((i) => {\n const key = JSON.stringify([i.node, i.field, i.step, i.message])\n if (seen.has(key)) return false\n seen.add(key)\n return true\n })\n}\n\n/* One sink per target entity (structural rule 4): resolve overlaps with a union. /\nfunction sinkIssues(compiled: Compiled): CompileIssue[] {\n const writers = new Map<string, string[]>()\n for (const [id, c] of compiled) {\n for (const entity of c.node.writes ?? [])\n writers.set(entity, [...(writers.get(entity) ?? []), id])\n }\n return [...writers]\n .filter(([, sinks]) => sinks.length > 1)\n .map(([entity, sinks]) => ({\n code: 'duplicate_sink' as const,\n message: `${sinks.join(' and ')} both write ${entity}; union their inputs into one sink`,\n node: sinks[1] as string,\n }))\n}\n\n/\n A map that can drop records upstream of a join or aggregate can flip its result, so the\n * first join or aggregate on every path from it must declare `tolerate_skips`.\n /\nfunction skipIssues(version: MappingVersion, compiled: Compiled): CompileIssue[] {\n const next = consumers(version.nodes)\n const byId = new Map(version.nodes.map((n) => [n.id, n]))\n const issues: CompileIssue[] = []\n for (const [id, c] of compiled) {\n // Only a map drops records; nodes downstream of it may carry its `canSkip` along.\n if (byId.get(id)?.op !== 'map' \|\| !c.node.output?.canSkip) continue\n const seen = new Set<string>()\n const stack = [...(next.get(id) as string[])]\n while (stack.length > 0) {\n const n = stack.pop() as string\n if (seen.has(n)) continue\n seen.add(n)\n const node = byId.get(n) as NodeJson\n const def = nodeRegistry[node.op]\n if (def?.toleratesSkips) {\n const params = compiled.get(n)?.params\n if (params && !def.toleratesSkips(params)) {\n issues.push({\n code: 'skip_tolerance',\n message: `${id} can drop records (on_error skip_record with a fallible field); set tolerate_skips: true here or change ${id}'s on_error`,\n node: n,\n })\n }\n continue\n }\n stack.push(...(next.get(n) as string[]))\n }\n }\n return issues\n}\n\nfunction plan(version: MappingVersion, compiled: Compiled, usesClock: boolean): Plan {\n const order = topologicalOrder(version.nodes)\n const byId = new Map(version.nodes.map((n) => [n.id, n]))\n const next = consumers(version.nodes)\n const lastUse = new Map<string, number>()\n for (const [i, id] of order.entries()) {\n for (const ref of inputIds(byId.get(id) as NodeJson)) lastUse.set(ref, i)\n }\n const sinksBelow = new Map<string, string[]>()\n const metricsBelow = new Map<string, boolean>()\n for (const id of [...order].reverse()) {\n const op = (byId.get(id) as NodeJson).op\n // Reverse topological order: every consumer is done before the node it reads.\n const below = next.get(id) as string[]\n const sinks = below.flatMap((b) => sinksBelow.get(b) as string[])\n sinksBelow.set(id, [...new Set(op === 'sink' ? [id, ...sinks] : sinks)].sort())\n metricsBelow.set(id, op === 'metrics' \|\| below.some((b) => metricsBelow.get(b)))\n }\n const nodes: PlannedNode[] = order.map((id) => {\n const node = byId.get(id) as NodeJson\n const c = compiled.get(id) as CompiledEntry\n const def = nodeRegistry[node.op]\n return {\n id,\n op: node.op,\n params: c.params,\n inputs: inputIds(node),\n output: c.node.output,\n ...(def?.effect ? { effect: def.effect } : {}),\n run: c.node.run,\n ...(c.check ? { check: c.check } : {}),\n sinks: sinksBelow.get(id) as string[],\n feedsMetrics: metricsBelow.get(id) as boolean,\n }\n })\n return { version, nodes, lastUse, usesClock }\n}\n","/\n The executor (arch.md, \"Execution model\"). Runs a compiled plan over a frozen snapshot:\n * every node once, in topological order, each edge held only until its last consumer has run.\n * Nothing is written: sinks return their rows, and the host writes those with status `write`.\n \n Failure stays as local as lineage allows. A failed node skips what depends on it while\n * independent branches proceed; `skip_downstream` holds back exactly the sinks below a node;\n * `stop` (or `on_error: fail_sync`) holds back every sink, but nodes feeding `metrics` still\n * run, because metrics describe the run and matter most when it stops.\n /\n\nimport type { RunContext } from './context'\nimport type { Plan } from './compile'\nimport type { Metric, NodeRun, RunIssue, SinkWrite } from './nodes'\nimport { Instant } from './time'\nimport { type Relation, toJson } from './values'\n\nexport interface RunInput {\n /* The run's frozen clock: an instant, or an ISO string with an offset. /\n readonly now: Instant \| string\n /* IANA time zone for calendar math; defaults to UTC. /\n readonly tz?: string\n readonly locale?: string\n readonly syncRunId?: string\n /* Previous output counts per node id, for `count.shiftRatio`. /\n readonly baseline?: Readonly<Record<string, number>>\n}\n\nexport interface ExecuteOptions {\n /* Keep every node's output in the result (previews, fixtures). /\n readonly retain?: boolean\n /* Fixture mode: run every node even after a stop, skip production `count` envelopes. /\n readonly fixture?: boolean\n /* Elapsed-time clock for statistics; defaults to `performance.now`. /\n readonly clock?: () => number\n}\n\nexport type NodeStatus = 'ok' \| 'failed' \| 'upstream_failed' \| 'stopped'\n\nexport interface NodeStats {\n readonly node: string\n readonly op: string\n readonly status: NodeStatus\n readonly rowsIn: number\n readonly rowsOut: number\n readonly skipped: number\n readonly changed: number\n readonly ms: number\n}\n\nexport type SinkStatus = 'write' \| 'held' \| 'stopped' \| 'failed' \| 'upstream_failed'\n\nexport interface SinkResult {\n readonly sink: string\n readonly status: SinkStatus\n /* Present only with status `write`. /\n readonly write?: SinkWrite\n}\n\nexport interface RunResult {\n /* `stopped`: nothing may be written. `partial`: some sink is not `write`. /\n readonly status: 'ok' \| 'partial' \| 'stopped'\n readonly sinks: readonly SinkResult[]\n readonly metrics: readonly Metric[]\n readonly stats: readonly NodeStats[]\n readonly issues: readonly RunIssue[]\n /* Every node's output, with `retain`. Sinks hold the rows they would write. /\n readonly outputs?: Readonly<Record<string, Relation>>\n}\n\nexport type Snapshot = Readonly<Record<string, readonly Readonly<Record<string, unknown>>[]>>\n\n/* Sources the host must read, once each, before a run. /\nexport function readPlan(plan: Plan): { node: string; system: string; entity: string }[] {\n return plan.nodes\n .filter((n) => n.op === 'source')\n .map((n) => ({ node: n.id, system: String(n.params.system), entity: String(n.params.entity) }))\n}\n\n/* Read every source once and freeze the result into a snapshot. /\nexport async function readSnapshot(\n plan: Plan,\n read: (source: {\n node: string\n system: string\n entity: string\n }) => Promise<readonly Readonly<Record<string, unknown>>[]>,\n): Promise<Snapshot> {\n const snapshot: Record<string, readonly Readonly<Record<string, unknown>>[]> = {}\n for (const source of readPlan(plan))\n snapshot[source.node] = Object.freeze([...(await read(source))])\n return Object.freeze(snapshot)\n}\n\nexport function execute(\n plan: Plan,\n snapshot: Snapshot,\n run: RunInput,\n options: ExecuteOptions = {},\n): RunResult {\n const now = typeof run.now === 'string' ? Instant.parse(run.now) : run.now\n if (!now) throw new Error(`run.now '${String(run.now)}' is not an ISO instant`)\n const clock = options.clock ?? (() => performance.now())\n const ctx: RunContext = Object.freeze({\n now,\n tz: run.tz ?? 'UTC',\n locale: run.locale ?? 'en',\n snapshot: snapshot as RunContext['snapshot'],\n params: plan.version.params,\n tables: plan.version.tables,\n run: {\n syncRunId: run.syncRunId ?? '',\n mappingVersionId: `${plan.version.id}@${plan.version.version}`,\n },\n })\n\n const outputs = new Map<string, Relation>()\n const retained: Record<string, Relation> = {}\n const status = new Map<string, NodeStatus>()\n const stats: NodeStats[] = []\n const issues: RunIssue[] = []\n const writes = new Map<string, SinkWrite>()\n const metrics: Metric[] = []\n const held = new Set<string>()\n let stopped = false\n\n for (const [i, node] of plan.nodes.entries()) {\n const record = (s: NodeStatus, extra: Partial<NodeStats> = {}) => {\n status.set(node.id, s)\n stats.push({\n node: node.id,\n op: node.op,\n status: s,\n rowsIn: 0,\n rowsOut: 0,\n skipped: 0,\n changed: 0,\n ms: 0,\n ...extra,\n })\n }\n // Nodes feeding metrics read only nodes feeding metrics, so never a stopped input.\n if (stopped && !options.fixture && !node.feedsMetrics) record('stopped')\n else if (node.inputs.some((id) => status.get(id) !== 'ok')) record('upstream_failed')\n else {\n const rowsIn = node.inputs.reduce((n, id) => n + (outputs.get(id) as Relation).length, 0)\n const start = clock()\n const result = node.run((id) => outputs.get(id) as Relation, ctx, {\n ...(run.baseline?.[node.id] === undefined ? {} : { baseline: run.baseline[node.id] }),\n ...(options.fixture ? { skipCount: true } : {}),\n })\n if (!result.ok) {\n const e = result.error\n issues.push({\n node: node.id,\n code: e.code,\n message: e.message,\n ...(e.samples ? { samples: e.samples } : {}),\n })\n issues.push(...(e.issues ?? []))\n if (e.stop) stopped = true\n record('failed', { rowsIn, ms: clock() - start })\n } else {\n let out: NodeRun = result.value\n if (node.check) {\n const checked = node.check(out.rows, ctx, {\n ...(run.baseline?.[node.id] === undefined ? {} : { baseline: run.baseline[node.id] }),\n ...(options.fixture ? { skipCount: true } : {}),\n })\n out = {\n ...out,\n rows: checked.rows,\n changed: (out.changed ?? 0) + checked.changed,\n issues: [...(out.issues ?? []), ...checked.issues],\n stop: out.stop \|\| checked.stop,\n skipDownstream: out.skipDownstream \|\| checked.skipDownstream,\n }\n }\n issues.push(...(out.issues ?? []))\n if (out.stop) stopped = true\n if (out.skipDownstream) for (const s of node.sinks) held.add(s)\n if (out.write) writes.set(node.id, out.write)\n // A metric reports its rows as the node's checks left them.\n if (out.metric) {\n metrics.push(\n node.check\n ? { ...out.metric, rows: out.rows.map((r) => toJson(r) as Metric['rows'][number]) }\n : out.metric,\n )\n }\n outputs.set(node.id, out.rows)\n if (options.retain) retained[node.id] = out.rows\n record('ok', {\n rowsIn,\n rowsOut: out.rows.length,\n skipped: out.skipped ?? 0,\n changed: out.changed ?? 0,\n ms: clock() - start,\n })\n }\n }\n for (const id of node.inputs) if (plan.lastUse.get(id) === i) outputs.delete(id)\n }\n\n const sinks: SinkResult[] = plan.nodes\n .filter((n) => n.effect === 'sink')\n .map((n) => {\n const s = status.get(n.id)\n const write = writes.get(n.id)\n if (stopped) return { sink: n.id, status: 'stopped' }\n if (s === 'failed') return { sink: n.id, status: 'failed' }\n if (s !== 'ok' \|\| !write) return { sink: n.id, status: 'upstream_failed' }\n if (held.has(n.id)) return { sink: n.id, status: 'held' }\n return { sink: n.id, status: 'write', write }\n })\n\n return {\n status: stopped\n ? 'stopped'\n : sinks.every((s) => s.status === 'write') && [...status.values()].every((s) => s === 'ok')\n ? 'ok'\n : 'partial',\n sinks,\n metrics,\n stats,\n issues,\n ...(options.retain ? { outputs: retained } : {}),\n }\n}\n","/\n Fixtures (arch.md, \"examples\"): relations in, keyed by source node id, and relations\n * out, keyed by any node id, so a multi-step graph is tested at the step that matters. An\n * expected relation is compared as a set on the fields it lists. A fixture also fails when\n * its run stops (an `assert` or expectation with `stop`) or a node fails.\n \n Fixtures run at sample scale, so production `count` envelopes are skipped. Dates compare\n * as ISO instants; sink rows hold what would be written (`YYYY-MM-DD` for date fields).\n /\n\nimport type { Plan } from './compile'\nimport { execute, type RunResult } from './execute'\nimport type { RunIssue } from './nodes'\nimport { Instant, isTimeZone } from './time'\nimport { canonicalKey, type Json, toJson, type Val } from './values'\n\nexport interface NodeDiff {\n readonly node: string\n /* Expected records the run did not produce. /\n readonly missing: readonly Json[]\n /* Produced records the fixture does not list. /\n readonly unexpected: readonly Json[]\n}\n\nexport interface ExampleResult {\n readonly index: number\n readonly name?: string\n readonly passed: boolean\n /* Why the fixture failed, apart from relation differences. /\n readonly failures: readonly string[]\n readonly diffs: readonly NodeDiff[]\n readonly issues: readonly RunIssue[]\n readonly run?: RunResult\n}\n\nconst DEFAULT_NOW = '2000-01-01T00:00:00Z'\n\nexport function runExamples(plan: Plan): ExampleResult[] {\n return plan.version.examples.map((example, index) => {\n const failures: string[] = []\n const head = { index, ...(example.name ? { name: example.name } : {}) }\n const sources = new Set(plan.nodes.filter((n) => n.op === 'source').map((n) => n.id))\n const nodes = new Set(plan.nodes.map((n) => n.id))\n for (const id of Object.keys(example.sources)) {\n if (!sources.has(id)) failures.push(`sources names '${id}', which is not a source node`)\n }\n for (const id of Object.keys(example.expect)) {\n if (!nodes.has(id)) failures.push(`expect names unknown node '${id}'`)\n }\n if (plan.usesClock && example.now === undefined) {\n failures.push('the graph reads the clock (today/now), so the example needs \"now\"')\n }\n const now = Instant.parse(example.now ?? DEFAULT_NOW)\n if (!now) failures.push(`now '${example.now}' is not an ISO instant`)\n const tz = example.tz ?? 'UTC'\n if (!isTimeZone(tz)) failures.push(`unknown time zone '${tz}'`)\n if (failures.length) return { ...head, passed: false, failures, diffs: [], issues: [] }\n\n const run = execute(\n plan,\n example.sources,\n { now: now as Instant, tz },\n { retain: true, fixture: true },\n )\n if (run.status === 'stopped') {\n const why = run.issues\n .filter((i) => i.action === 'stop')\n .map((i) => `${i.node}: ${i.message}`)\n failures.push(`run stopped${why.length ? `: ${why.join('; ')}` : ''}`)\n }\n for (const s of run.stats) {\n if (s.status === 'failed') {\n const why = run.issues.filter((i) => i.node === s.node).map((i) => i.message)\n failures.push(`${s.node} failed: ${why.join('; ')}`)\n }\n }\n\n const diffs: NodeDiff[] = []\n for (const [id, expected] of Object.entries(example.expect)) {\n const actual = run.outputs?.[id]\n if (!actual) {\n failures.push(`${id} produced no output`)\n continue\n }\n if (expected.length === 0) {\n if (actual.length) diffs.push({ node: id, missing: [], unexpected: actual.map(toJson) })\n continue\n }\n const fields = Object.keys(expected[0] as object).sort()\n if (expected.some((r) => Object.keys(r).sort().join('\\u0000') !== fields.join('\\u0000'))) {\n failures.push(`expected rows of ${id} must all list the same fields`)\n continue\n }\n const project = (r: Readonly<Record<string, Val>>) =>\n Object.fromEntries(fields.map((f) => [f, toJson(r[f] ?? null)])) as Json\n const want = new Map(\n expected.map((r) => [\n canonicalKey(project(r as Record<string, Val>) as Val),\n project(r as Record<string, Val>),\n ]),\n )\n const got = new Map(actual.map((r) => [canonicalKey(project(r) as Val), project(r)]))\n const missing = [...want].filter(([k]) => !got.has(k)).map(([, r]) => r)\n const unexpected = [...got].filter(([k]) => !want.has(k)).map(([, r]) => r)\n if (missing.length \|\| unexpected.length) diffs.push({ node: id, missing, unexpected })\n }\n return {\n ...head,\n passed: failures.length === 0 && diffs.length === 0,\n failures,\n diffs,\n issues: run.issues,\n run,\n }\n })\n}\n","/\n The draft-save gate: everything that must hold before a version may be published, as one\n * list of located issues. `validateStructure` is the subset that needs no host environment,\n * cheap enough to run in the editor on every change.\n /\n\nimport { compileVersion, type Plan, structuralIssues } from './compile'\nimport type { GraphEnv } from './context'\nimport type { MappingVersion, NodeJson } from './document'\nimport { type ExampleResult, runExamples } from './examples'\nimport { nodeRegistry } from './nodes'\nimport type { CompileIssue } from './result'\n\nexport interface CheckResult {\n readonly ok: boolean\n readonly issues: readonly CompileIssue[]\n readonly plan?: Plan\n readonly examples?: readonly ExampleResult[]\n}\n\n/* Compile, then run every example; publishable only if `ok`. /\nexport function checkVersion(version: MappingVersion, env: GraphEnv): CheckResult {\n const compiled = compileVersion(version, env)\n if (!compiled.ok) return { ok: false, issues: compiled.issues }\n const examples = runExamples(compiled.plan)\n const issues: CompileIssue[] = examples.flatMap((e) => {\n const label = `example ${e.name ?? e.index}`\n return [\n ...e.failures.map((f) => ({ code: 'example_failed' as const, message: `${label}: ${f}` })),\n ...e.diffs.map((d) => ({\n code: 'example_failed' as const,\n node: d.node,\n message: `${label}: ${d.node} is missing ${d.missing.length} and has ${d.unexpected.length} unexpected records`,\n })),\n ]\n })\n return { ok: issues.length === 0, issues, plan: compiled.plan, examples }\n}\n\n/* Structure and params only: no types, no target schema. /\nexport function validateStructure(version: MappingVersion): CompileIssue[] {\n const issues = structuralIssues(version)\n for (const node of version.nodes) {\n const def = Object.hasOwn(nodeRegistry, node.op) ? nodeRegistry[node.op] : undefined\n if (!def) continue\n const { id: _id, op: _op, label: _label, ...params } = node as NodeJson\n const parsed = def.params.safeParse(params)\n if (parsed.success) continue\n for (const x of parsed.error.issues) {\n issues.push({\n code: 'invalid_params',\n message: `${x.path.length ? `${x.path.join('.')}: ` : ''}${x.message}`,\n node: node.id,\n })\n }\n }\n return issues\n}\n","/\n Pure, immutable edits of a version's graph, for the editor. Every edit returns a new\n * version. `canConnect` is the single rule book for edges, so live feedback while dragging\n * and validation on save agree. Edges are derived from input references (`edgesOf`).\n /\n\nimport type { MappingVersion, NodeJson, Position } from './document'\nimport { downstream, nodeRefs } from './graph'\nimport { nodeCatalog, nodeRegistry, type Slot } from './nodes'\n\nexport { nodeCatalog }\n\nexport interface Edge {\n /* Stable id: `source->target:slot[index]`. /\n readonly id: string\n readonly source: string\n readonly target: string\n /* Slot id on the target node, used as the React Flow target handle. /\n readonly slot: string\n readonly index?: number\n}\n\n/* A prospective edge. /\nexport interface Connection {\n readonly source: string\n readonly target: string\n readonly slot: string\n}\n\nexport type ConnectResult = { ok: true } \| { ok: false; reason: string }\n\nlet counter = 0\n\n/* A short unique id; `crypto.randomUUID` where available, a counter otherwise. /\nexport function createId(prefix: string): string {\n counter += 1\n const random = globalThis.crypto?.randomUUID?.().slice(0, 8)\n return `${prefix}_${random ?? counter.toString(36)}`\n}\n\nexport function getNode(version: MappingVersion, id: string): NodeJson \| undefined {\n return version.nodes.find((n) => n.id === id)\n}\n\nconst defOf = (op: string) => (Object.hasOwn(nodeRegistry, op) ? nodeRegistry[op] : undefined)\n\nexport function edgesOf(version: MappingVersion): Edge[] {\n return version.nodes.flatMap((node) =>\n nodeRefs(node).map((r) => ({\n id: `${r.source}->${node.id}:${r.slot}${r.index === undefined ? '' : `[${r.index}]`}`,\n source: r.source,\n target: node.id,\n slot: r.slot,\n ...(r.index === undefined ? {} : { index: r.index }),\n })),\n )\n}\n\n/* Add a node of a known op with its default params. /\nexport function addNode(\n version: MappingVersion,\n op: string,\n init: { id?: string; label?: string; params?: Record<string, unknown>; position?: Position } = {},\n): { version: MappingVersion; node: NodeJson } {\n const def = defOf(op)\n if (!def) throw new Error(`Unknown node op '${op}'`)\n const id = init.id ?? createId(op)\n if (getNode(version, id)) throw new Error(`Node id '${id}' already exists`)\n const node: NodeJson = {\n ...def.defaults(),\n ...init.params,\n id,\n op,\n ...(init.label === undefined ? {} : { label: init.label }),\n }\n return {\n version: {\n ...version,\n nodes: [...version.nodes, node],\n ...(init.position ? { layout: { ...version.layout, [id]: init.position } } : {}),\n },\n node,\n }\n}\n\nfunction setPath(node: NodeJson, path: readonly string[], value: unknown): NodeJson {\n const [head, ...rest] = path as [string, ...string[]]\n if (rest.length === 0) {\n const copy: Record<string, unknown> = { ...node }\n if (value === undefined) delete copy[head]\n else copy[head] = value\n return copy as NodeJson\n }\n const child = (node as Record<string, unknown>)[head]\n const inner = typeof child === 'object' && child !== null ? child : {}\n return { ...node, [head]: setPath(inner as NodeJson, rest, value) } as NodeJson\n}\n\nfunction getPath(node: NodeJson, path: readonly string[]): unknown {\n let value: unknown = node\n for (const key of path) value = (value as Record<string, unknown> \| undefined)?.[key]\n return value\n}\n\nfunction slotOf(node: NodeJson, slot: string): Slot \| undefined {\n return defOf(node.op)?.slots.find((s) => s.id === slot)\n}\n\n/* Remove a node, every reference to it, and its layout entry. /\nexport function removeNode(version: MappingVersion, id: string): MappingVersion {\n const nodes = version.nodes\n .filter((n) => n.id !== id)\n .map((n) => {\n let next = n\n for (const ref of nodeRefs(n)\n .filter((r) => r.source === id)\n .reverse()) {\n next = unlink(next, ref.slot, id)\n }\n return next\n })\n const layout = version.layout ? { ...version.layout } : undefined\n if (layout) delete layout[id]\n const expect = { ...version.expect }\n delete expect[id]\n return { ...version, nodes, expect, ...(layout ? { layout } : {}) }\n}\n\n/* Drop `node`'s reference to `source` in `slotId`; anything else is left as it is. /\nfunction unlink(node: NodeJson, slotId: string, source: string): NodeJson {\n const slot = slotOf(node, slotId)\n if (!slot) return node\n const value = getPath(node, slot.path)\n if (Array.isArray(value))\n return setPath(\n node,\n slot.path,\n value.filter((v) => v !== source),\n )\n return value === source ? setPath(node, slot.path, undefined) : node\n}\n\n/\n Replace a node's label and/or params; `id` and `op` cannot change. A `label` key set to\n * undefined clears the label.\n /\nexport function updateNode(\n version: MappingVersion,\n id: string,\n patch: { label?: string \| undefined; params?: Record<string, unknown> },\n): MappingVersion {\n return {\n ...version,\n nodes: version.nodes.map((n) => {\n if (n.id !== id) return n\n const label = 'label' in patch ? patch.label : n.label\n const params = patch.params ?? (({ id: _i, op: _o, label: _l, ...rest }) => rest)(n)\n return { ...params, id: n.id, op: n.op, ...(label === undefined ? {} : { label }) }\n }),\n }\n}\n\nexport function moveNode(version: MappingVersion, id: string, position: Position): MappingVersion {\n return { ...version, layout: { ...version.layout, [id]: position } }\n}\n\n/* Every rule a new edge must satisfy, checked against the current version. /\nexport function canConnect(version: MappingVersion, connection: Connection): ConnectResult {\n const source = getNode(version, connection.source)\n const target = getNode(version, connection.target)\n if (!source \|\| !target) return { ok: false, reason: 'Both ends must be nodes in the graph.' }\n if (source.id === target.id) return { ok: false, reason: 'A node cannot feed itself.' }\n const from = defOf(source.op)\n if (!from \|\| !defOf(target.op)) return { ok: false, reason: 'Unknown node op.' }\n if (!from.output) return { ok: false, reason: `${from.label} has no output.` }\n const slot = slotOf(target, connection.slot)\n if (!slot) return { ok: false, reason: `${target.op} has no input '${connection.slot}'.` }\n const refs = nodeRefs(target).filter((r) => r.slot === slot.id)\n if (refs.some((r) => r.source === source.id))\n return { ok: false, reason: 'These nodes are already connected.' }\n if (refs.length > 0 && !slot.multiple)\n return { ok: false, reason: `Input '${slot.label}' already has a connection.` }\n if (downstream(version.nodes, target.id).has(source.id)) {\n return { ok: false, reason: 'This connection would create a cycle; mappings must be acyclic.' }\n }\n return { ok: true }\n}\n\n/* Add an edge by setting the target's input reference, or throw with `canConnect`'s reason. /\nexport function connect(version: MappingVersion, connection: Connection): MappingVersion {\n const verdict = canConnect(version, connection)\n if (!verdict.ok) throw new Error(verdict.reason)\n return {\n ...version,\n nodes: version.nodes.map((n) => {\n if (n.id !== connection.target) return n\n const slot = slotOf(n, connection.slot) as Slot\n const current = getPath(n, slot.path)\n const value = slot.multiple\n ? [...(Array.isArray(current) ? current : []), connection.source]\n : connection.source\n return setPath(n, slot.path, value)\n }),\n }\n}\n\n/* Remove an edge by clearing the target's reference to its source. /\nexport function disconnect(\n version: MappingVersion,\n edge: Pick<Edge, 'source' \| 'target' \| 'slot'>,\n): MappingVersion {\n return {\n ...version,\n nodes: version.nodes.map((n) => (n.id === edge.target ? unlink(n, edge.slot, edge.source) : n)),\n }\n}\n","/\n Descriptions of source and target schemas.\n \n These are the nouns every other part of hockeymask speaks: connectors describe what a\n * source contains as `Table`s of `Column`s, the host application describes what it wants\n * to receive as a `TargetSchema`, and mapping graphs work between the two.\n \n Every type is a zod schema plus its inferred TypeScript type, so the same definition\n * validates data on the wire and types it in code.\n /\n\nimport { z } from 'zod'\n\n/* A single decoded value. Dates are ISO strings ('2026-10-04'), decimals are numbers. /\nexport const Value = z.union([z.string(), z.number(), z.boolean(), z.null()])\nexport type Value = z.infer<typeof Value>\n\n/* One record as a source returns it: column name -> decoded value. /\nexport const Row = z.record(z.string(), Value)\nexport type Row = z.infer<typeof Row>\n\n/\n Source-independent type of a column or field.\n \n Connectors translate each system's declared types into one of these. The declared type\n * is kept alongside (`Column.sourceType`), because it often carries meaning the logical\n * type loses, e.g. NetSuite declares checkboxes `boolean` but SuiteQL returns 'T' / 'F'.\n /\nexport const LogicalType = z.enum([\n 'string',\n 'integer',\n 'decimal',\n 'boolean',\n 'date',\n 'timestamp',\n 'reference',\n 'unknown',\n])\nexport type LogicalType = z.infer<typeof LogicalType>\n\nexport const Column = z.object({\n name: z.string(),\n logicalType: LogicalType,\n sourceType: z.string().describe('Type exactly as the source declares it.'),\n nullable: z.boolean().default(true),\n label: z.string().nullable().default(null).describe('Human label shown in the source UI.'),\n description: z.string().nullable().default(null),\n isCustom: z.boolean().default(false).describe('Customer-added field, e.g. custitem_.'),\n references: z\n .string()\n .nullable()\n .default(null)\n .describe('Table this column points at, when the source declares it.'),\n})\nexport type Column = z.infer<typeof Column>\n\nexport const TableRef = z.object({\n name: z.string().describe(\"Name in the source's own notation, e.g. ANALYTICS.PLANNING.X.\"),\n label: z.string().nullable().default(null),\n description: z.string().nullable().default(null),\n rowCount: z.number().int().nullable().default(null),\n})\nexport type TableRef = z.infer<typeof TableRef>\n\nexport const Table = TableRef.extend({ columns: z.array(Column) })\nexport type Table = z.infer<typeof Table>\n\n/** A batch of rows together with the columns that describe them. /\nexport const RowSet = z.object({\n columns: z.array(Column),\n rows: z.array(Row),\n totalRows: z\n .number()\n .int()\n .nullable()\n .default(null)\n .describe('Rows the query would return without a limit, if known.'),\n})\nexport type RowSet = z.infer<typeof RowSet>\n\nexport const TargetField = z.object({\n name: z.string(),\n logicalType: LogicalType,\n nullable: z.boolean().default(true),\n description: z.string().nullable().default(null),\n unit: z.string().nullable().default(null).describe(\"Unit the target stores, e.g. 'g' or 'm'.\"),\n references: z.string().nullable().default(null).describe('Target entity of a foreign key.'),\n})\nexport type TargetField = z.infer<typeof TargetField>\n\nexport const TargetEntity = z.object({\n name: z.string(),\n description: z.string().nullable().default(null),\n identity: z\n .array(z.string())\n .default([])\n .describe('Fields a re-import uses to find the row it wrote last time.'),\n nullsNotDistinct: z\n .boolean()\n .optional()\n .describe(\n 'The identity matches NULLs as equal (NULLS NOT DISTINCT), so a nullable identity field may be part of an upsert key.',\n ),\n fields: z.array(TargetField),\n})\nexport type TargetEntity = z.infer<typeof TargetEntity>\n\nexport const TargetSchema = z.object({\n name: z.string(),\n entities: z.array(TargetEntity),\n})\nexport type TargetSchema = z.infer<typeof TargetSchema>\n\n/* Column of `table` named `name`, ignoring case (source systems differ on case). /\nexport function findColumn(table: Table, name: string): Column {\n const wanted = name.toLowerCase()\n const column = table.columns.find((c) => c.name.toLowerCase() === wanted)\n if (!column) throw new Error(`${table.name} has no column '${name}'`)\n return column\n}\n\nexport function findEntity(schema: TargetSchema, name: string): TargetEntity {\n const entity = schema.entities.find((e) => e.name === name)\n if (!entity) throw new Error(`${schema.name} has no entity '${name}'`)\n return entity\n}\n\nexport function findField(entity: TargetEntity, name: string): TargetField {\n const field = entity.fields.find((f) => f.name === name)\n if (!field) throw new Error(`${entity.name} has no field '${name}'`)\n return field\n}\n\n/* Build a Column with the defaults filled in. */\nexport function column(\n input: Pick<Column, 'name' \| 'logicalType' \| 'sourceType'> & Partial<Column>,\n): Column {\n return Column.parse(input)\n}\n"],"mappings":";;;AA0BA,IAAa,iBAAb,cAAoC,MAAM;CACxC,OAAgB;AAClB;;AAGA,IAAa,oBAAb,cAAuC,eAAe;CACpD,OAAgB;AAClB;;;;ACqCA,SAAgB,UAAU,QAAoB,MAAqC;CACjF,MAAM,OAAO,OAAO,OAAO,OAAO,QAAQ,IAAI,IAAI,OAAO,OAAO,QAAQ,KAAA;CACxE,OAAO,OACH;EAAE,IAAI;EAAM,OAAO;CAAK,IACxB;EACE,IAAI;EACJ,OAAO,kBAAkB,KAAK,gBAAgB,OAAO,KAAK,OAAO,MAAM,CAAC,CAAC,KAAK,IAAI,KAAK,YAAY;CACrG;AACN;AAEA,SAAgB,UACd,QACA,OAA2C,CAAC,GACjC;CACX,OAAO;EACL;EACA,QAAQ,KAAK,UAAU,CAAC;EACxB,QAAQ,KAAK,UAAU,CAAC;EACxB,WAAW,KAAK,aAAa,CAAC;EAC9B,OAAO,KAAK,SAAS;EACrB,OAAO,KAAK,SAAS,EAAE,MAAM,MAAM;CACrC;AACF;;;AClFA,SAAgB,GAAM,OAAoD;CACxE,OAAO;EAAE,IAAI;EAAM;CAAM;AAC3B;;AAGA,SAAgB,SAAY,QAA+B;CACzD,IAAI,CAAC,OAAO,IAAI,MAAM,IAAI,MAAM,uBAAuB,KAAK,UAAU,OAAO,KAAK,GAAG;CACrF,OAAO,OAAO;AAChB;AAEA,SAAgB,IAAO,OAAqD;CAC1E,OAAO;EAAE,IAAI;EAAO;CAAM;AAC5B;AAyBA,SAAgB,UAAU,MAAiB,QAAiD;CAC1F,OAAO,IAAI;EAAE;EAAM;CAAO,CAAC;AAC7B;;;;;;;;;;;ACtCA,IAAa,UAAb,MAAa,QAAQ;CACU;CAA7B,YAAoB,SAA0B;EAAjB,KAAA,UAAA;EAC3B,OAAO,OAAO,IAAI;CACpB;CAEA,OAAO,UAAU,SAA0B;EACzC,IAAI,CAAC,OAAO,SAAS,OAAO,GAAG,MAAM,IAAI,WAAW,8BAA8B,SAAS;EAC3F,OAAO,IAAI,QAAQ,OAAO;CAC5B;;CAGA,OAAO,MAAM,KAAkC;EAC7C,IAAI,CAAC,YAAY,KAAK,GAAG,GAAG,OAAO,KAAA;EACnC,MAAM,KAAK,KAAK,MAAM,GAAG;EACzB,OAAO,OAAO,MAAM,EAAE,IAAI,KAAA,IAAY,IAAI,QAAQ,EAAE;CACtD;CAEA,cAAsB;EACpB,OAAO,IAAI,KAAK,KAAK,OAAO,CAAC,CAAC,YAAY;CAC5C;CAEA,SAAiB;EACf,OAAO,KAAK,YAAY;CAC1B;CAEA,WAAmB;EACjB,OAAO,KAAK,YAAY;CAC1B;AACF;AAEA,MAAM,cAAc;AAepB,MAAM,6BAAa,IAAI,IAAiC;AAExD,SAAS,UAAU,IAAiC;CAClD,IAAI,IAAI,WAAW,IAAI,EAAE;CACzB,IAAI,CAAC,GAAG;EACN,IAAI,IAAI,KAAK,eAAe,SAAS;GACnC,UAAU;GACV,WAAW;GACX,MAAM;GACN,OAAO;GACP,KAAK;GACL,MAAM;GACN,QAAQ;GACR,QAAQ;EACV,CAAC;EACD,WAAW,IAAI,IAAI,CAAC;CACtB;CACA,OAAO;AACT;AAEA,SAAgB,WAAW,IAAqB;CAC9C,IAAI;EACF,UAAU,EAAE;EACZ,OAAO;CACT,QAAQ;EACN,OAAO;CACT;AACF;;AAGA,SAAgB,YAAY,SAAkB,IAAuB;CACnE,MAAM,QAAgC,CAAC;CACvC,KAAK,MAAM,KAAK,UAAU,EAAE,CAAC,CAAC,cAAc,IAAI,KAAK,QAAQ,OAAO,CAAC,GACnE,IAAI,EAAE,SAAS,WAAW,MAAM,EAAE,QAAQ,OAAO,EAAE,KAAK;CAE1D,OAAO;EACL,MAAM,MAAM;EACZ,OAAO,MAAM;EACb,KAAK,MAAM;EACX,MAAM,MAAM;EACZ,QAAQ,MAAM;EACd,QAAQ,MAAM;EACd,KAAM,QAAQ,UAAU,MAAQ,OAAQ;CAC1C;AACF;AAEA,SAAS,UAAU,GAAsB;CAEvC,MAAM,IAAI,IAAI,KAAK,KAAK,IAAI,KAAM,EAAE,QAAQ,GAAG,EAAE,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,EAAE,CAAC;CACvF,EAAE,eAAe,EAAE,IAAI;CACvB,OAAO,EAAE,QAAQ;AACnB;;AAGA,SAAS,SAAS,SAAiB,IAAoB;CACrD,OAAO,UAAU,YAAY,QAAQ,UAAU,OAAO,GAAG,EAAE,CAAC,IAAI;AAClE;;;;;AAMA,SAAgB,cAAc,GAAc,IAAqB;CAC/D,MAAM,QAAQ,UAAU,CAAC;CAEzB,MAAM,SAAS,SAAS,QAAQ,OAAY,EAAE;CAC9C,MAAM,QAAQ,SAAS,QAAQ,OAAY,EAAE;CAC7C,MAAM,SAAS,MAAc,UAAU,YAAY,QAAQ,UAAU,CAAC,GAAG,EAAE,CAAC,MAAM;CAClF,MAAM,aAAa,CAAC,QAAQ,QAAQ,QAAQ,KAAK,CAAC,CAAC,OAAO,KAAK;CAE/D,OAAO,QAAQ,UAAU,WAAW,SAAS,IAAI,KAAK,IAAI,GAAG,UAAU,IAAI,QAAQ,MAAM;AAC3F;AAEA,SAAgB,YAAY,MAAc,OAAuB;CAC/D,IAAI,UAAU,GAAG,OAAQ,OAAO,MAAM,KAAK,OAAO,QAAQ,KAAM,OAAO,QAAQ,IAAI,KAAK;CACxF,OAAO;EAAC;EAAG;EAAG;EAAG;CAAE,CAAC,CAAC,SAAS,KAAK,IAAI,KAAK;AAC9C;AAWA,MAAM,gBAAgB;;AAGtB,SAAgB,cAAc,MAAmD;CAC/E,MAAM,QAAoB,CAAC;CAC3B,cAAc,YAAY;CAC1B,IAAI,KAAK;CACT,OAAO,KAAK,KAAK,QAAQ;EACvB,cAAc,YAAY;EAC1B,MAAM,IAAI,cAAc,KAAK,IAAI;EACjC,IAAI,CAAC,GAAG,OAAO,IAAI,qBAAqB,KAAK,kCAAkC;EAC/E,MAAM,GAAG,MAAM,QAAQ,QAAQ;EAC/B,MAAM,KAAK;GAAE,QAAQ,OAAO,MAAM,KAAK,SAAS,MAAM,KAAK;GAAU;EAAqB,CAAC;EAC3F,KAAK,cAAc;CACrB;CACA,IAAI,MAAM,WAAW,GAAG,OAAO,IAAI,qBAAqB,KAAK,kCAAkC;CAC/F,OAAO,GAAG,KAAK;AACjB;;AAGA,SAAgB,SAAS,MAAmC;CAC1D,MAAM,SAAS,cAAc,IAAI;CACjC,IAAI,CAAC,OAAO,IAAI,MAAM,IAAI,MAAM,OAAO,KAAK;CAC5C,OAAO,OAAO;AAChB;;AAGA,SAAgB,MAAM,SAAkB,IAAyB,IAAqB;CACpF,IAAI,UAAU;CACd,KAAK,MAAM,EAAE,QAAQ,UAAU,IAAI;EACjC,IAAI,SAAS,KAAK;GAChB,UAAU,QAAQ,UAAU,QAAQ,UAAU,SAAS,IAAS;GAChE;EACF;EACA,MAAM,IAAI,YAAY,SAAS,EAAE;EACjC,IAAI,SAAS,OAAO,SAAS,MAAM;GACjC,MAAM,SAAS,EAAE,OAAO,MAAM,EAAE,QAAQ,MAAM,SAAS,MAAM,SAAS,KAAK;GAC3E,MAAM,OAAO,KAAK,MAAM,SAAS,EAAE;GACnC,MAAM,QAAS,SAAS,KAAM;GAC9B,UAAU,cACR;IAAE,GAAG;IAAG;IAAM;IAAO,KAAK,KAAK,IAAI,EAAE,KAAK,YAAY,MAAM,KAAK,CAAC;GAAE,GACpE,EACF;EACF,OAAO;GACL,MAAM,OAAO,SAAS,MAAM,SAAS,IAAI;GACzC,MAAM,IAAI,IAAI,KAAK,UAAU;IAAE,GAAG;IAAG,MAAM;IAAG,QAAQ;IAAG,QAAQ;IAAG,IAAI;GAAE,CAAC,CAAC;GAC5E,EAAE,WAAW,EAAE,WAAW,IAAI,IAAI;GAClC,UAAU,cACR;IAAE,GAAG;IAAG,MAAM,EAAE,eAAe;IAAG,OAAO,EAAE,YAAY,IAAI;IAAG,KAAK,EAAE,WAAW;GAAE,GAClF,EACF;EACF;CACF;CACA,OAAO;AACT;;AAKA,SAAgB,SAAS,SAAkB,MAAoB,IAAqB;CAClF,MAAM,IAAI,YAAY,SAAS,EAAE;CACjC,OAAO,cACL;EACE,MAAM,EAAE;EACR,OAAO,SAAS,SAAS,IAAI,EAAE;EAC/B,KAAK,SAAS,QAAQ,EAAE,MAAM;EAC9B,MAAM;EACN,QAAQ;EACR,QAAQ;EACR,IAAI;CACN,GACA,EACF;AACF;AAiBA,MAAM,WAAW;AAEjB,SAAgB,cAAc,MAAwC;CACpE,MAAM,MAAM,SAAS,KAAK,IAAI;CAC9B,IAAI,KAAK;EACP,MAAM,SAAS,IAAI;EACnB,IAAI,IAAI,OAAO,IAAI,OAAO,GAAG;GAAE,MAAM;GAAY;GAAQ,IAAI,CAAC;EAAE,CAAC;EACjE,MAAM,KAAK,cAAc,IAAI,EAAY;EACzC,OAAO,GAAG,KAAK,GAAG;GAAE,MAAM;GAAY;GAAQ,IAAI,GAAG;EAAM,CAAC,IAAI;CAClE;CACA,MAAM,OAAO,gBAAgB,MAAM,SAAS;CAC5C,IAAI,MAAM,OAAO,GAAG;EAAE,MAAM;EAAQ;CAAK,CAAC;CAC1C,MAAM,UAAU,QAAQ,MAAM,IAAI;CAClC,IAAI,SAAS,OAAO,GAAG;EAAE,MAAM;EAAW;CAAQ,CAAC;CACnD,OAAO,IACL,iBAAiB,KAAK,kEACxB;AACF;;AAGA,SAAgB,UAAU,MAAyB;CACjD,OAAO,KAAK,SAAS;AACvB;AAEA,SAAgB,gBAAgB,MAAgB,OAA8C;CAC5F,QAAQ,KAAK,MAAb;EACE,KAAK,WACH,OAAO,KAAK;EACd,KAAK,QACH,OAAO,cAAc,KAAK,MAAM,MAAM,EAAE;EAC1C,KAAK,YAEH,OAAO,MADQ,KAAK,WAAW,UAAU,SAAS,MAAM,KAAK,OAAO,MAAM,EAAE,IAAI,MAAM,KACjE,KAAK,IAAI,MAAM,EAAE;CAE1C;AACF;AAaA,MAAM,SAAS;CAAC;CAAQ;CAAM;CAAM;CAAM;CAAM;AAAI;AACpD,MAAM,cAAc;AAEpB,SAAgB,gBAAgB,MAA0C;CACxE,IAAI,SAAS,OAAO,OAAO,GAAG,EAAE,MAAM,MAAM,CAAC;CAC7C,IAAI,SAAS,YAAY,OAAO,GAAG;EAAE,MAAM;EAAS,MAAM;CAAK,CAAC;CAChE,IAAI,SAAS,WAAW,OAAO,GAAG;EAAE,MAAM;EAAS,MAAM;CAAI,CAAC;CAC9D,MAAM,SAAS,KAAK,MAAM,WAAW,CAAC,CAAC,QAAQ,MAAM,MAAM,EAAE;CAC7D,MAAM,OAAO,OAAO,QAAQ,MAAO,OAA6B,SAAS,CAAC,CAAC;CAC3E,IAAI,KAAK,WAAW,GAAG,OAAO,IAAI,gBAAgB,KAAK,gBAAgB,OAAO,KAAK,GAAG,GAAG;CACzF,IAAI,IAAI,IAAI,IAAI,CAAC,CAAC,SAAS,KAAK,QAAQ,OAAO,IAAI,gBAAgB,KAAK,kBAAkB;CAC1F,MAAM,SAAS,OACZ,KAAK,MAAM;EACV,IAAI,MAAM,QAAQ,OAAO;EACzB,IAAK,OAA6B,SAAS,CAAC,GAAG,OAAO;EACtD,OAAO,EAAE,QAAQ,uBAAuB,MAAM;CAChD,CAAC,CAAC,CACD,KAAK,EAAE;CACV,OAAO,GAAG;EAAE,MAAM;EAAW;EAAQ,OAAO,IAAI,OAAO,IAAI,OAAO,EAAE;CAAE,CAAC;AACzE;;AAGA,SAAgB,WAAW,MAA0B;CACnD,MAAM,SAAS,gBAAgB,IAAI;CACnC,IAAI,CAAC,OAAO,IAAI,MAAM,IAAI,MAAM,OAAO,KAAK;CAC5C,OAAO,OAAO;AAChB;AAEA,MAAM,YAAY,gBAAgB,YAAY;AAC9C,MAAM,YAAY,gBAAgB,qBAAqB;;AAGvD,SAAgB,YAAY,QAA6B;CACvD,OAAO,OAAO,SAAS,aAAa;EAAC;EAAQ;EAAM;CAAI,CAAC,CAAC,OAAO,MAAM,OAAO,OAAO,SAAS,CAAC,CAAC;AACjG;AAEA,SAAS,gBAAgB,MAAc,QAA2D;CAChG,IAAI,CAAC,OAAO,MAAM,OAAO,MAAM,SAAS,WAAW,OAAO,KAAA;CAC1D,MAAM,IAAI,OAAO,MAAM,MAAM,KAAK,IAAI;CACtC,IAAI,CAAC,GAAG,OAAO,KAAA;CACf,MAAM,SAAiC;EAAE,MAAM;EAAM,IAAI;EAAG,IAAI;EAAG,IAAI;EAAG,IAAI;EAAG,IAAI;CAAE;CACvF,IAAI,QAAQ;CACZ,KAAK,MAAM,SAAS,OAAO,MAAM,QAC/B,IAAK,OAA6B,SAAS,KAAK,GAAG,OAAO,SAAS,OAAO,EAAE,QAAQ;CAEtF,MAAM,IAAe;EACnB,MAAM,OAAO;EACb,OAAO,OAAO;EACd,KAAK,OAAO;EACZ,MAAM,OAAO;EACb,QAAQ,OAAO;EACf,QAAQ,OAAO;EACf,IAAI;CACN;CASA,OAPE,EAAE,SAAS,KACX,EAAE,SAAS,MACX,EAAE,OAAO,KACT,EAAE,OAAO,YAAY,EAAE,MAAM,EAAE,KAAK,KACpC,EAAE,QAAQ,MACV,EAAE,UAAU,MACZ,EAAE,UAAU,KACC,IAAI,KAAA;AACrB;;;;;AAMA,SAAgB,eACd,OACA,QACA,IACqB;CACrB,IAAI,OAAO,SAAS,SAAS;EAC3B,MAAM,IAAI,OAAO,UAAU,WAAW,QAAQ,UAAU,KAAK,KAAK,IAAI,OAAO,KAAK,IAAI;EACtF,OAAO,OAAO,SAAS,CAAC,IAAI,QAAQ,UAAU,OAAO,SAAS,MAAM,IAAI,MAAO,CAAC,IAAI,KAAA;CACtF;CACA,IAAI,OAAO,UAAU,UAAU,OAAO,KAAA;CACtC,IAAI,OAAO,SAAS,WAAW;EAC7B,MAAM,IAAI,gBAAgB,OAAO,GAAG,MAAM,CAAC;EAC3C,OAAO,KAAK,cAAc,GAAG,EAAE;CACjC;CACA,MAAM,OAAO,gBAAgB,OAAO,SAAS,KAAK,gBAAgB,OAAO,SAAS;CAClF,OAAO,OAAO,cAAc,MAAM,EAAE,IAAI,QAAQ,MAAM,KAAK;AAC7D;AAEA,MAAMA,SAAO,GAAW,QAAQ,MAAM,OAAO,CAAC,CAAC,CAAC,SAAS,OAAO,GAAG;;AAGnE,SAAgB,WAAW,SAAkB,QAAoB,IAAoB;CACnF,IAAI,OAAO,SAAS,OAAO,OAAO,QAAQ,YAAY;CACtD,IAAI,OAAO,SAAS,SAClB,OAAO,OAAO,OAAO,SAAS,MAAM,KAAK,MAAM,QAAQ,UAAU,GAAI,IAAI,QAAQ,OAAO;CAE1F,MAAM,IAAI,YAAY,SAAS,EAAE;CACjC,MAAM,SAAiC;EACrC,MAAMA,MAAI,EAAE,MAAM,CAAC;EACnB,IAAIA,MAAI,EAAE,KAAK;EACf,IAAIA,MAAI,EAAE,GAAG;EACb,IAAIA,MAAI,EAAE,IAAI;EACd,IAAIA,MAAI,EAAE,MAAM;EAChB,IAAIA,MAAI,EAAE,MAAM;CAClB;CACA,OAAO,OAAO,OAAO,KAAK,MAAM,OAAO,MAAM,CAAC,CAAC,CAAC,KAAK,EAAE;AACzD;;AAGA,SAAgB,aAAa,SAAkB,IAAoB;CACjE,MAAM,IAAI,YAAY,SAAS,EAAE;CACjC,OAAO,GAAGA,MAAI,EAAE,MAAM,CAAC,EAAE,GAAGA,MAAI,EAAE,KAAK,EAAE,GAAGA,MAAI,EAAE,GAAG;AACvD;;;;ACpWA,MAAa,IAAI;CACf,QAAQ,EAAE,MAAM,SAAS;CACzB,QAAQ,EAAE,MAAM,SAAS;CACzB,SAAS,EAAE,MAAM,UAAU;CAC3B,MAAM,EAAE,MAAM,OAAO;CACrB,MAAM,EAAE,MAAM,OAAO;CACrB,SAAS,EAAE,MAAM,UAAU;CAC3B,OAAO,EAAE,MAAM,QAAQ;CACvB,MAAM;EAAE,MAAM;EAAY,IAAI,EAAE,MAAM,QAAQ;CAAE;CAChD,OAAO,QAAsB;EAAE,MAAM;EAAQ;CAAG;CAChD,QAAQ,QAAiC;EAAE,MAAM;EAAS;CAAG;CAC7D,SAAS,YAAyD;EAAE,MAAM;EAAU;CAAO;CAC3F,WAAW,OAAsB,GAAG,SAAS,aAAa,KAAK;EAAE,MAAM;EAAY;CAAG;AACxF;AAEA,SAAgB,WAAW,MAAmC;CAC5D,OAAO,KAAK,SAAS;AACvB;;AAGA,SAAgB,UAAU,MAAsB;CAC9C,OAAO,KAAK,SAAS,aAAa,KAAK,KAAK;AAC9C;;AAGA,SAAgB,UAAU,MAAsB;CAC9C,OAAO,KAAK,SAAS,cAAc,KAAK,SAAS;AACnD;;AAGA,SAAgB,WAAW,MAAa,MAAsB;CAC5D,OAAO,OAAO,EAAE,SAAS,IAAI,IAAI;AACnC;;AAGA,SAAgB,KAAK,MAAqB;CACxC,QAAQ,KAAK,MAAb;EACE,KAAK,YACH,OAAO,KAAK,GAAG,SAAS,UAAU,SAAS,GAAG,KAAK,KAAK,EAAE,EAAE;EAC9D,KAAK,QACH,OAAO,QAAQ,KAAK,KAAK,EAAE,EAAE;EAC/B,KAAK,SACH,OAAO,IAAI,KAAK,GAAG,IAAI,IAAI,CAAC,CAAC,KAAK,IAAI,EAAE;EAC1C,KAAK,UACH,OAAO,KAAK,OAAO,QAAQ,KAAK,MAAM,CAAC,CACpC,KAAK,CAAC,GAAG,OAAO,GAAG,EAAE,IAAI,KAAK,CAAC,GAAG,CAAC,CACnC,KAAK,IAAI,EAAE;EAChB,KAAK,QACH,OAAO;EACT,SACE,OAAO,KAAK;CAChB;AACF;AAEA,SAAgB,WAAW,GAAU,GAAmB;CACtD,OAAO,KAAK,CAAC,MAAM,KAAK,CAAC;AAC3B;;AAGA,SAAgB,WAAW,MAAa,IAAoB;CAC1D,IAAI,GAAG,SAAS,WAAW,OAAO;CAClC,IAAI,KAAK,SAAS,SAAS,OAAO;CAClC,IAAI,KAAK,SAAS,YAChB,OAAO,GAAG,SAAS,cAAc,WAAW,KAAK,IAAI,GAAG,EAAE;CAE5D,IAAI,GAAG,SAAS,YAAY,OAAO,WAAW,MAAM,GAAG,EAAE;CACzD,QAAQ,KAAK,MAAb;EACE,KAAK,QACH,OAAO,GAAG,SAAS,UAAU,WAAW,KAAK,IAAI,GAAG,EAAE;EACxD,KAAK,SACH,OACE,GAAG,SAAS,WACZ,GAAG,GAAG,WAAW,KAAK,GAAG,UACzB,KAAK,GAAG,OAAO,GAAG,MAAM,WAAW,GAAG,GAAG,GAAG,EAAW,CAAC;EAE5D,KAAK,UACH,OACE,GAAG,SAAS,YACZ,OAAO,QAAQ,GAAG,MAAM,CAAC,CAAC,OACvB,CAAC,GAAG,OAAO,KAAK,KAAK,UAAU,WAAW,KAAK,OAAO,IAAa,CAAC,CACvE;EAEJ,SACE,OAAO,KAAK,SAAS,GAAG;CAC5B;AACF;AAEA,MAAM,+BAAe,IAAI,IAAI;CAAC;CAAU;CAAU;CAAW;AAAM,CAAC;;AAGpE,SAAgB,WAAW,GAAU,GAAmB;CACtD,MAAM,IAAI,UAAU,CAAC;CACrB,MAAM,IAAI,UAAU,CAAC;CACrB,IAAI,EAAE,SAAS,aAAa,EAAE,SAAS,WAAW,OAAO;CACzD,IAAI,EAAE,SAAS,WAAW,EAAE,SAAS,SAAS,OAAO;CACrD,IAAI,EAAE,SAAS,UAAU,EAAE,SAAS,QAAQ,OAAO,WAAW,EAAE,IAAI,EAAE,EAAE;CACxE,OAAO,aAAa,IAAI,EAAE,IAAI,KAAK,EAAE,SAAS,EAAE;AAClD;;AAGA,SAAgB,UAAU,MAAsB;CAC9C,MAAM,OAAO,UAAU,IAAI,CAAC,CAAC;CAC7B,OAAO,SAAS,YAAY,SAAS,UAAU,SAAS;AAC1D;;;;;AAMA,SAAgB,MAAM,GAAU,GAAiC;CAC/D,MAAM,WAAW,WAAW,CAAC,KAAK,WAAW,CAAC;CAG9C,MAAM,OAAO,aAFH,UAAU,CAEM,GADhB,UAAU,CACS,CAAC;CAC9B,IAAI,CAAC,KAAK,IAAI,OAAO;CACrB,OAAO,GAAG,WAAW,KAAK,OAAO,QAAQ,CAAC;AAC5C;AAEA,SAAS,aAAa,GAAY,GAAmC;CACnE,MAAM,iBAAiB,IAAI,GAAG,KAAK,CAAC,EAAE,OAAO,KAAK,CAAC,EAAE,qBAAqB;CAC1E,IAAI,EAAE,SAAS,SAAS,OAAO,GAAG,CAAC;CACnC,IAAI,EAAE,SAAS,SAAS,OAAO,GAAG,CAAC;CACnC,IAAI,EAAE,SAAS,aAAa,EAAE,SAAS,WAAW,OAAO,GAAG,EAAE,OAAO;CACrE,IAAI,EAAE,SAAS,UAAU,EAAE,SAAS,QAAQ;EAC1C,MAAM,KAAK,MAAM,EAAE,IAAI,EAAE,EAAE;EAC3B,OAAO,GAAG,KAAK,GAAG,EAAE,KAAK,GAAG,KAAK,CAAC,IAAI,SAAS;CACjD;CACA,IAAI,EAAE,SAAS,WAAW,EAAE,SAAS,SAAS;EAC5C,IAAI,EAAE,GAAG,WAAW,EAAE,GAAG,QAAQ,OAAO,SAAS;EACjD,MAAM,KAAc,CAAC;EACrB,KAAK,MAAM,CAAC,GAAG,MAAM,EAAE,GAAG,QAAQ,GAAG;GACnC,MAAM,IAAI,MAAM,GAAG,EAAE,GAAG,EAAW;GACnC,IAAI,CAAC,EAAE,IAAI,OAAO,SAAS;GAC3B,GAAG,KAAK,EAAE,KAAK;EACjB;EACA,OAAO,GAAG,EAAE,MAAM,EAAE,CAAC;CACvB;CACA,IAAI,EAAE,SAAS,YAAY,EAAE,SAAS,UAAU;EAC9C,MAAM,OAAO,OAAO,KAAK,EAAE,MAAM;EACjC,IAAI,KAAK,WAAW,OAAO,KAAK,EAAE,MAAM,CAAC,CAAC,QAAQ,OAAO,SAAS;EAClE,MAAM,SAAgC,CAAC;EACvC,KAAK,MAAM,KAAK,MAAM;GACpB,MAAM,QAAQ,EAAE,OAAO;GACvB,IAAI,CAAC,OAAO,OAAO,SAAS;GAC5B,MAAM,IAAI,MAAM,EAAE,OAAO,IAAa,KAAK;GAC3C,IAAI,CAAC,EAAE,IAAI,OAAO,SAAS;GAC3B,OAAO,KAAK,EAAE;EAChB;EACA,OAAO,GAAG,EAAE,OAAO,MAAM,CAAC;CAC5B;CACA,OAAO,EAAE,SAAS,EAAE,OAAO,GAAG,CAAC,IAAI,SAAS;AAC9C;;AAGA,SAAgB,SAAS,OAAgD;CACvE,IAAI,MAAa,EAAE;CACnB,KAAK,MAAM,QAAQ,OAAO;EACxB,MAAM,IAAI,MAAM,KAAK,IAAI;EACzB,IAAI,CAAC,EAAE,IAAI,OAAO;EAClB,MAAM,EAAE;CACV;CACA,OAAO,GAAG,GAAG;AACf;;AAGA,SAAgB,WAAW,OAAuB;CAChD,IAAI,UAAU,MAAM,OAAO,EAAE;CAC7B,QAAQ,OAAO,OAAf;EACE,KAAK,UACH,OAAO,EAAE;EACX,KAAK,UACH,OAAO,EAAE;EACX,KAAK,WACH,OAAO,EAAE;CACb;CACA,IAAI,MAAM,QAAQ,KAAK,GAAG;EACxB,MAAM,UAAU,SAAS,MAAM,IAAI,UAAU,CAAC;EAC9C,OAAO,EAAE,KAAK,QAAQ,KAAK,QAAQ,QAAQ,EAAE,OAAO;CACtD;CACA,IAAI,OAAO,UAAU,UACnB,OAAO,EAAE,OACP,OAAO,YAAY,OAAO,QAAQ,KAAe,CAAC,CAAC,KAAK,CAAC,GAAG,OAAO,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,CACxF;CAEF,OAAO,EAAE;AACX;;AAGA,SAAgB,gBAAgB,SAA+B;CAC7D,QAAQ,SAAR;EACE,KAAK,UACH,OAAO,EAAE;EACX,KAAK;EACL,KAAK,WACH,OAAO,EAAE;EACX,KAAK,WACH,OAAO,EAAE;EACX,KAAK;EACL,KAAK,aACH,OAAO,EAAE;EACX,SACE,OAAO,EAAE;CACb;AACF;;;;;AAMA,SAAgB,cAAc,MAAqC;CACjE,MAAM,SAAS,KAAK,QAAQ,QAAQ,EAAE;CACtC,MAAM,SAAS,MAAiC;EAC9C,IAAI,EAAE,SAAS,GAAG,GAAG;GACnB,MAAM,QAAQ,MAAM,EAAE,MAAM,GAAG,EAAE,CAAC;GAClC,OAAO,SAAS,MAAM,SAAS,aAAa,EAAE,SAAS,KAAK,IAAI,KAAA;EAClE;EACA,IAAI,EAAE,WAAW,OAAO,KAAK,EAAE,SAAS,GAAG,GAAG;GAC5C,MAAM,QAAQ,MAAM,EAAE,MAAM,GAAG,EAAE,CAAC;GAClC,OAAO,SAAS,EAAE,KAAK,KAAK;EAC9B;EACA,QAAQ,GAAR;GACE,KAAK,UACH,OAAO,EAAE;GACX,KAAK,UACH,OAAO,EAAE;GACX,KAAK,WACH,OAAO,EAAE;GACX,KAAK,QACH,OAAO,EAAE;GACX,SACE;EACJ;CACF;CACA,MAAM,OAAO,MAAM,MAAM;CACzB,OAAO,OAAO,GAAG,IAAI,IAAI,IAAI,iBAAiB,KAAK,EAAE;AACvD;;AAGA,SAAgB,SAAS,MAAqB;CAC5C,MAAM,OAAO,cAAc,IAAI;CAC/B,IAAI,CAAC,KAAK,IAAI,MAAM,IAAI,MAAM,KAAK,KAAK;CACxC,OAAO,KAAK;AACd;;;;;;;;;;;;ACnPA,MAAa,OAAsB,OAAO,MAAM;AAGhD,SAAgB,YAAY,GAA8C;CACxE,OAAO,OAAO,MAAM,YAAY,MAAM,QAAQ,CAAC,MAAM,QAAQ,CAAC,KAAK,EAAE,aAAa;AACpF;;AAGA,SAAgB,aAAa,GAAgB;CAC3C,IAAI,MAAM,MAAM,OAAO;CACvB,QAAQ,OAAO,GAAf;EACE,KAAK,UACH,OAAO,IAAI,KAAK,UAAU,CAAC;EAC7B,KAAK,UACH,OAAO,IAAI,OAAO,GAAG,GAAG,EAAE,IAAI,IAAI;EACpC,KAAK,WACH,OAAO,IAAI,MAAM;CACrB;CACA,IAAI,aAAa,SAAS,OAAO,IAAI,EAAE;CACvC,IAAI,MAAM,QAAQ,CAAC,GAAG,OAAO,IAAK,EAAqB,IAAI,YAAY,CAAC,CAAC,KAAK,GAAG,EAAE;CACnF,MAAM,MAAM;CACZ,OAAO,IAAI,OAAO,KAAK,GAAG,CAAC,CACxB,KAAK,CAAC,CACN,KAAK,MAAM,GAAG,KAAK,UAAU,CAAC,EAAE,GAAG,aAAa,IAAI,EAAS,GAAG,CAAC,CACjE,KAAK,GAAG,EAAE;AACf;;AAGA,SAAgB,MAAM,KAAU,QAAmC;CACjE,OAAO,aAAa,OAAO,KAAK,MAAM,IAAI,MAAM,IAAI,CAAC;AACvD;AAEA,MAAM,QAAQ,MAAmB;CAC/B,IAAI,MAAM,MAAM,OAAO;CACvB,QAAQ,OAAO,GAAf;EACE,KAAK,WACH,OAAO;EACT,KAAK,UACH,OAAO;EACT,KAAK,UACH,OAAO;CACX;CACA,IAAI,aAAa,SAAS,OAAO;CACjC,OAAO,MAAM,QAAQ,CAAC,IAAI,IAAI;AAChC;;;;;AAMA,SAAgB,YAAY,GAAQ,GAAgB;CAClD,MAAM,KAAK,KAAK,CAAC;CACjB,MAAM,KAAK,KAAK,CAAC;CACjB,IAAI,OAAO,IAAI,OAAO,KAAK;CAC3B,QAAQ,IAAR;EACE,KAAK,GACH,OAAO;EACT,KAAK;EACL,KAAK,GACH,OAAO,OAAO,CAAC,IAAI,OAAO,CAAC;EAC7B,KAAK,GACH,OAAO,MAAM,IAAI,IAAK,IAAgB,IAAe,KAAK;EAC5D,KAAK,GACH,OAAQ,EAAc,UAAW,EAAc;EACjD,KAAK,GAAG;GACN,MAAM,IAAI;GACV,MAAM,IAAI;GACV,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,IAAI,EAAE,QAAQ,EAAE,MAAM,GAAG,KAAK;IACrD,MAAM,IAAI,YAAY,EAAE,IAAW,EAAE,EAAS;IAC9C,IAAI,MAAM,GAAG,OAAO;GACtB;GACA,OAAO,EAAE,SAAS,EAAE;EACtB;EACA,SAAS;GACP,MAAM,IAAI,aAAa,CAAC;GACxB,MAAM,IAAI,aAAa,CAAC;GACxB,OAAO,MAAM,IAAI,IAAI,IAAI,IAAI,KAAK;EACpC;CACF;AACF;AAEA,SAAgB,UAAU,GAAQ,GAAiB;CACjD,OAAO,YAAY,GAAG,CAAC,MAAM;AAC/B;;AAGA,SAAgB,OAAO,GAAc;CACnC,IAAI,aAAa,SAAS,OAAO,EAAE,YAAY;CAC/C,IAAI,MAAM,QAAQ,CAAC,GAAG,OAAQ,EAAqB,IAAI,MAAM;CAC7D,IAAI,YAAY,CAAC,GAAG,OAAO,OAAO,YAAY,OAAO,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,OAAO,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;CAC/F,OAAO;AACT;;AAGA,SAAgB,YAAY,MAAsB,QAAkC;CAClF,OAAO,CAAC,GAAG,IAAI,CAAC,CAAC,MAAM,GAAG,MAAM;EAC9B,KAAK,MAAM,KAAK,QAAQ;GACtB,MAAM,IAAI,YAAY,EAAE,MAAM,MAAM,EAAE,MAAM,IAAI;GAChD,IAAI,MAAM,GAAG,OAAO;EACtB;EACA,MAAM,IAAI,aAAa,CAAC;EACxB,MAAM,IAAI,aAAa,CAAC;EACxB,OAAO,MAAM,IAAI,IAAI,IAAI,IAAI,KAAK;CACpC,CAAC;AACH;;;;;;;;;;;;;;;ACtHA,MAAM,cAAc;CAAC;CAAM;CAAO;CAAM;CAAO;CAAM;CAAO;CAAU;AAAO;AAC7E,MAAM,aAAa,CAAC,MAAM,QAAQ;AAClC,MAAM,WAAW,CAAC,WAAW,UAAU;AACvC,MAAM,cAAc;CAAC;CAAO;CAAO;AAAK;;AAGxC,MAAa,aAAa;CACxB,GAAG;CACH,GAAG;CACH;CACA,GAAG;CACH,GAAG;AACL;;;;;AAiBA,SAAgB,iBACd,KACA,KACA,OACsB;CACtB,IAAI,OAAO,QAAQ,YAAY,QAAQ,QAAQ,MAAM,QAAQ,GAAG,GAC9D,OAAO,IAAI,qDAAmD;CAEhE,MAAM,OAAO;CACb,MAAM,OAAO,OAAO,KAAK,IAAI,CAAC,CAAC,QAAQ,MAAM,MAAM,MAAM;CACzD,IAAI,KAAK,WAAW,GAClB,OAAO,IACL,gDAAgD,KAAK,SAAS,KAAK,KAAK,IAAI,IAAI,QAClF;CAEF,MAAM,OAAO,KAAK;CAClB,IAAI,CAAE,WAAiC,SAAS,IAAI,GAAG,OAAO,IAAI,sBAAsB,KAAK,EAAE;CAC/F,MAAM,QAAQ,KAAK;CAEnB,IAAK,YAAkC,SAAS,IAAI,GAAG;EACrD,IAAI,UAAU,MAAM,OAAO,IAAI,IAAI,KAAK,oDAAoD;EAC5F,OAAO,mBAAmB,MAAsC,OAAO,KAAK,KAAK;CACnF;CAEA,MAAM,UAAU,eAAe,KAAK,MAAM,KAAK,KAAK;CACpD,IAAI,CAAC,QAAQ,IAAI,OAAO;CACxB,MAAM,EAAE,MAAM,QAAQ,QAAQ;CAC9B,MAAM,OAAO,UAAU,IAAI;CAE3B,QAAQ,MAAR;EACE,KAAK;EACL,KAAK,YAAY;GACf,IAAI,OAAO,UAAU,WAAW,OAAO,IAAI,IAAI,KAAK,sBAAsB;GAC1E,IAAI,SAAS,cAAc,KAAK,SAAS,YAAY,KAAK,SAAS,WACjE,OAAO,IAAI,oCAAoC,KAAK,IAAI,GAAG;GAE7D,MAAM,QACJ,SAAS,aACJ,MAAW,MAAM,QACjB,MAAW,MAAM,QAAS,OAAO,MAAM,YAAY,EAAE,KAAK,MAAM;GACvE,OAAO,IAAI,GAAG,GAAG,MAAM,MAAM,IAAI,GAAG,GAAG,CAAC,CAAC,MAAM,KAAK;EACtD;EACA,KAAK,WAAW;GACd,IAAI,OAAO,UAAU,UAAU,OAAO,IAAI,2CAA2C;GACrF,IAAI,KAAK,SAAS,YAAY,KAAK,SAAS,WAC1C,OAAO,IAAI,mCAAmC,KAAK,IAAI,GAAG;GAE5D,MAAM,QAAQ,aAAa,KAAK;GAChC,IAAI,CAAC,MAAM,IAAI,OAAO;GACtB,MAAM,KAAK,MAAM;GACjB,OAAO,IAAI,GAAG,GAAG,MAAM;IACrB,MAAM,IAAI,IAAI,GAAG,GAAG,CAAC;IACrB,OAAO,OAAO,MAAM,YAAY,GAAG,KAAK,CAAC;GAC3C,CAAC;EACH;EACA,KAAK;EACL,KAAK,UAAU;GACb,MAAM,UAAU,eAAe,OAAO,KAAK,KAAK,SAAS,MAAM;GAC/D,IAAI,CAAC,QAAQ,IAAI,OAAO;GACxB,MAAM,WAAW,UAAU,QAAQ,MAAM,IAAI;GAC7C,IAAI,SAAS,SAAS,QACpB,OAAO,IAAI,IAAI,KAAK,sBAAsB,KAAK,QAAQ,MAAM,IAAI,GAAG;GACtE,IAAI,CAAC,WAAW,MAAM,SAAS,EAAE,GAC/B,OAAO,IAAI,eAAe,KAAK,IAAI,EAAE,qBAAqB,KAAK,QAAQ,GAAG;GAE5E,MAAM,OAAO,QAAQ,MAAM;GAC3B,MAAM,UAAgB,GAAG,GAAG,MAAM;IAChC,MAAM,IAAI,IAAI,GAAG,GAAG,CAAC;IACrB,MAAM,SAAS,KAAK,GAAG,GAAG,CAAC;IAC3B,IAAI,MAAM,QAAQ,CAAC,MAAM,QAAQ,MAAM,GAAG,OAAO;IACjD,OAAQ,OAA0B,MAAM,MAAM,MAAM,QAAQ,YAAY,GAAG,CAAC,MAAM,CAAC;GACrF;GACA,OAAO,GAAG,SAAS,OAAO,UAAU,GAAG,GAAG,MAAM,CAAC,OAAO,GAAG,GAAG,CAAC,CAAC;EAClE;CACF;CAGA,MAAM,SAAS,SAAS,YAAY,SAAS;CAC7C,IAAI,UAAU,KAAK,SAAS,UAAU,KAAK,SAAS,WAClD,OAAO,IAAI,IAAI,KAAK,0BAA0B,KAAK,IAAI,GAAG;CAE5D,IAAI,CAAC,UAAU,SAAS,QAAQ,SAAS,SAAS,CAAC,UAAU,IAAI,KAAK,KAAK,SAAS,WAClF,OAAO,IAAI,IAAI,KAAK,+CAA+C,KAAK,IAAI,GAAG;CAEjF,IAAI,UAAU,MAAM,OAAO,IAAI,IAAI,KAAK,wCAAwC;CAChF,MAAM,UAAU,eAAe,OAAO,KAAK,KAAK,SAAS,UAAU,MAAM;CACzE,IAAI,CAAC,QAAQ,IAAI,OAAO;CACxB,IAAI,CAAC,WAAW,MAAM,QAAQ,MAAM,IAAI,GACtC,OAAO,IAAI,kBAAkB,KAAK,IAAI,EAAE,QAAQ,KAAK,QAAQ,MAAM,IAAI,GAAG;CAE5E,MAAM,QAAQ,QAAQ,MAAM;CAC5B,MAAM,OAAO,QAAQ;CACrB,OAAO,IAAI,GAAG,GAAG,MAAM;EACrB,MAAM,IAAI,IAAI,GAAG,GAAG,CAAC;EACrB,MAAM,IAAI,MAAM,GAAG,GAAG,CAAC;EACvB,MAAM,QAAQ,MAAM,QAAQ,MAAM,QAAQ,KAAK,YAAY,GAAG,CAAC,CAAC;EAChE,OAAO,SAAS,QAAQ,CAAC,QAAQ;CACnC,CAAC;AACH;AAEA,MAAM,UAAwE;CAC5E,KAAK,MAAM,MAAM;CACjB,MAAM,MAAM,MAAM;CAClB,KAAK,MAAM,IAAI;CACf,MAAM,MAAM,KAAK;CACjB,KAAK,MAAM,IAAI;CACf,MAAM,MAAM,KAAK;CACjB,SAAS,MAAM,IAAI;CACnB,QAAQ,MAAM,IAAI;AACpB;AAEA,SAAS,mBACP,MACA,OACA,KACA,OACsB;CACtB,IAAI,SAAS,OAAO;EAClB,MAAM,QAAQ,iBAAiB,OAAO,KAAK,KAAK;EAChD,IAAI,CAAC,MAAM,IAAI,OAAO;EACtB,MAAM,OAAO,MAAM;EACnB,OAAO,IAAI,GAAG,GAAG,MAAM,CAAC,KAAK,GAAG,GAAG,CAAC,CAAC;CACvC;CACA,MAAM,KAAM,OAAmC;CAC/C,IACE,OAAO,UAAU,YACjB,UAAU,QACV,OAAO,KAAK,KAAK,CAAC,CAAC,WAAW,KAC9B,CAAC,MAAM,QAAQ,EAAE,GAEjB,OAAO,IAAI,IAAI,KAAK,+BAA+B;CAErD,MAAM,QAAgB,CAAC;CACvB,KAAK,MAAM,CAAC,GAAG,MAAM,GAAG,QAAQ,GAAG;EACjC,MAAM,WAAW,iBAAiB,GAAG,KAAK,KAAK;EAC/C,IAAI,CAAC,SAAS,IAAI,OAAO,IAAI,GAAG,KAAK,MAAM,EAAE,KAAK,SAAS,OAAO;EAClE,MAAM,KAAK,SAAS,KAAK;CAC3B;CACA,OAAO,GACL,SAAS,SACJ,GAAG,GAAG,MAAM,MAAM,OAAO,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,KACzC,GAAG,GAAG,MAAM,MAAM,MAAM,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,CAC/C;AACF;AAEA,SAAS,eACP,MACA,KACA,OAC8C;CAC9C,IAAI,SAAS,KAAA,GAAW;EACtB,IAAI,OAAO,SAAS,UAAU,OAAO,IAAI,2BAA2B;EACpE,MAAM,OAAO,UAAU,IAAI,QAAQ,IAAI;EACvC,IAAI,CAAC,KAAK,IAAI,OAAO;EACrB,OAAO,GAAG;GAAE,MAAM,KAAK;GAAO,MAAM,IAAI,MAAM,EAAE,SAAS;EAAK,CAAC;CACjE;CACA,IAAI,CAAC,SAAS,MAAM,SAAS,QAC3B,OAAO,IAAI,+DAA6D;CAE1E,OAAO,GAAG;EAAE,MAAM;EAAO,MAAM,MAAM;CAAE,CAAC;AAC1C;;AAGA,SAAgB,eACd,OACA,KACA,QACyB;CACzB,IAAI,OAAO,UAAU,YAAY,UAAU,QAAQ,CAAC,MAAM,QAAQ,KAAK,GAAG;EACxE,MAAM,OAAO,OAAO,KAAK,KAAK;EAC9B,MAAM,IAAI;EACV,IAAI,KAAK,WAAW,KAAK,OAAO,EAAE,QAAQ,UAAU;GAClD,MAAM,MAAM,EAAE;GACd,MAAM,OAAO,UAAU,IAAI,QAAQ,GAAG;GACtC,IAAI,CAAC,KAAK,IAAI,OAAO;GACrB,OAAO,GAAG;IAAE,MAAM,KAAK;IAAO,MAAM,IAAI,MAAM,EAAE,QAAQ;GAAK,CAAC;EAChE;EACA,IAAI,KAAK,WAAW,KAAK,OAAO,EAAE,UAAU,UAAU;GACpD,MAAM,OAAO,EAAE;GACf,IAAI,CAAC,OAAO,OAAO,IAAI,QAAQ,IAAI,GAAG,OAAO,IAAI,kBAAkB,KAAK,EAAE;GAC1E,OAAO,QAAQ,IAAI,OAAO,OAAe,KAAK,MAAM;EACtD;EACA,OAAO,IAAI,4EAAwE;CACrF;CACA,OAAO,QAAQ,OAAe,KAAK,MAAM;AAC3C;AAEA,SAAS,QAAQ,OAAa,KAAgB,QAA0C;CACtF,IAAI,UAAU,OAAO,UAAU,UAAU;EACvC,MAAM,OAAO,cAAc,KAAK;EAChC,IAAI,CAAC,KAAK,IAAI,OAAO;EACrB,IAAI,UAAU,KAAK,KAAK,GAAG,IAAI,MAAM,OAAO;EAC5C,OAAO,GAAG;GAAE,MAAM,EAAE;GAAM,KAAK,WAAW,KAAK,KAAK;EAAE,CAAC;CACzD;CACA,IAAI,UAAU,MAAM,QAAQ,KAAK,KAAK,MAAM,OAAO,MAAM,OAAO,MAAM,QAAQ,GAAG;EAC/E,MAAM,QAAoB,CAAC;EAC3B,KAAK,MAAM,KAAK,OAAmB;GACjC,MAAM,OAAO,cAAc,CAAC;GAC5B,IAAI,CAAC,KAAK,IAAI,OAAO;GACrB,IAAI,UAAU,KAAK,KAAK,GAAG,IAAI,MAAM,OAAO;GAC5C,MAAM,KAAK,KAAK,KAAK;EACvB;EACA,MAAM,UAAU,MAAM,IAAI,UAAU;EACpC,OAAO,GAAG;GAAE,MAAM,EAAE,KAAK,EAAE,IAAI;GAAG,MAAM,GAAG,GAAG,MAAM,QAAQ,KAAK,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC;EAAE,CAAC;CACtF;CACA,MAAM,WAAW;CACjB,OAAO,GAAG;EAAE,MAAM,WAAW,KAAK;EAAG,WAAW;CAAS,CAAC;AAC5D;;AAGA,SAAS,WAAW,MAAwB;CAC1C,IAAI,MAAM;CACV,IAAI,SAAkB,QAAQ,UAAU,CAAC;CACzC,QAAQ,IAAI,IAAI,QAAQ;EACtB,MAAM,IAAI,GAAG,IAAI,IAAI,QAAQ,GAAG,IAAI;EACpC,IAAI,MAAM,KAAK;GACb,SAAS,gBAAgB,MAAM,GAAG;GAClC,MAAM;EACR;EACA,OAAO;CACT;AACF;AAEA,SAAgB,aAAa,SAAyC;CACpE,IAAI;EACF,OAAO,GAAG,IAAI,OAAO,SAAS,GAAG,CAAC;CACpC,SAAS,GAAG;EACV,OAAO,IAAI,+BAAgC,EAAY,SAAS;CAClE;AACF;;;;;AAMA,SAAgB,aAAa,KAAwB;CACnD,IAAI,OAAO,QAAQ,YAAY,QAAQ,MAAM,OAAO,CAAC;CACrD,MAAM,OAAO;CACb,IAAI,OAAO,KAAK,SAAS,YAAY,KAAK,YAAY,OAAO,OAAO,CAAC,KAAK,IAAI;CAC9E,MAAM,KAAM,KAAK,KAAsC;CACvD,OAAO,MAAM,QAAQ,EAAE,IAAI,GAAG,QAAQ,YAAY,IAAI,CAAC;AACzD;;;ACtQA,MAAM,QAAqE;CACzE,OAAO;EAAC;EAAS;EAAmB;CAAM;CAC1C,QAAQ;EAAC;EAAS;EAAa;EAAmB;CAAM;CACxD,OAAO;EAAC;EAAS;EAAmB;CAAM;CAC1C,MAAM;EAAC;EAAS;EAAa;EAAY;EAAe;EAAmB;CAAM;CACjF,SAAS;EAAC;EAAS;EAAmB;CAAM;AAC9C;AAEA,SAAgB,WAAW,QAA4B;CACrD,IAAI,OAAO,WAAW,UAAU,OAAO;CACvC,OAAO,cAAc,SAAS,aAAa;AAC7C;;AAGA,SAAgB,cAAc,MAA8B,QAAgB,KAAsB;CAChG,IAAI,QAAQ,KAAA,GAAW,OAAO;CAC9B,IAAI,SAAS,KAAA,GAAW,OAAO;CAC/B,IAAI,OAAO,SAAS,YAAY,cAAc,QAAQ,iBAAiB,MAAM,OAAO;CACpF,MAAM,QAAQ;CACd,OAAO,MAAM,WAAW,MAAM,WAAW;AAC3C;;AAGA,SAAgB,YACd,QACA,OACA,QAC4B;CAC5B,MAAM,OAAO,WAAW,MAAM;CAC9B,IAAI,CAAC,MAAM,MAAM,CAAC,SAAS,IAAI,GAAG,OAAO,IAAI,UAAU,KAAK,qBAAqB,OAAO;CACxF,IAAI,OAAO,WAAW,UAAU,OAAO,GAAG,MAAM;CAEhD,MAAM,WADS,cAAc,SAAS,OAAO,WAAW,OAAO,KAAK,OAAO,WAAW,EAAA,CAC/D,QAAQ,MAAM,CAAC,OAAO,OAAO,OAAO,KAAK,QAAQ,CAAC,CAAC;CAC1E,IAAI,QAAQ,QAAQ,OAAO,IAAI,GAAG,KAAK,yBAAyB,QAAQ,KAAK,IAAI,GAAG;CACpF,IAAI,iBAAiB,QAAQ;EAC3B,KAAK,MAAM,CAAC,GAAG,MAAM,OAAO,QAAQ,OAAO,WAAW,GAAG;GACvD,MAAM,OAAO,OAAO,KAAK,OAAO;GAChC,IAAI,MAAM,QAAQ,CAAC,WAAW,WAAW,CAAC,GAAG,UAAU,IAAI,CAAC,GAC1D,OAAO,IAAI,eAAe,EAAE,IAAI,KAAK,UAAU,CAAC,EAAE,YAAY,KAAK,UAAU,IAAI,CAAC,GAAG;EAEzF;EACA,OAAO,GAAG,MAAM;CAClB;CAEA,MAAM,UAAU,EAAE,GAAG,OAAO,KAAK,OAAO;CACxC,KAAK,MAAM,KAAK,OAAO,UAAU,QAAQ,KAAK,EAAE,SAAS,QAAQ,EAAW;CAC5E,OAAO,GAAG;EAAE,GAAG;EAAQ,MAAM,EAAE,OAAO,OAAO;CAAE,CAAC;AAClD;;AAqBA,SAAgB,gBACd,MACA,MACA,MACA,YACS;CACT,MAAM,0BAAU,IAAI,IAAY;CAChC,KAAK,MAAM,KAAK,YACd,IAAI,WAAW,EAAE,MAAM,MAAM,aAAa,KAAK,MAAM,KAAK,EAAE,QAAQ,CAAC,GAAG,QAAQ,IAAI,CAAC;CAEvF,MAAM,0BAAU,IAAI,IAAiC;CACrD,KAAK,MAAM,KAAK,YAAY;EAC1B,IAAI,OAAO,EAAE,WAAW,UAAU;EAClC,MAAM,QACJ,cAAc,EAAE,SACZ,OAAO,YAAY,EAAE,OAAO,SAAS,KAAK,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,IACzD,EAAE,OAAO;EAChB,KAAK,MAAM,KAAK,EAAE,QAAQ,CAAC,GACzB,IAAI,CAAC,QAAQ,IAAI,CAAC,GAAG,QAAQ,IAAI,GAAG;GAAE,GAAG,QAAQ,IAAI,CAAC;GAAG,GAAG;EAAM,CAAC;CAEvE;CACA,MAAM,MAAa,CAAC;CACpB,KAAK,MAAM,CAAC,GAAG,QAAQ,KAAK,QAAQ,GAAG;EACrC,IAAI,QAAQ,IAAI,CAAC,GAAG;EACpB,MAAM,QAAQ,QAAQ,IAAI,CAAC;EAC3B,IAAI,KAAK,QAAQ;GAAE,GAAG;GAAK,GAAG;EAAM,IAAI,GAAG;CAC7C;CACA,MAAM,YAAY,MAChB,WAAW,EAAE,MAAM,MAAM,eACpB,EAAE,QAAQ,CAAC,EAAA,CAAG,SACf,OAAO,EAAE,WAAW,WAClB,KAAA,KACC,EAAE,QAAQ,CAAC,EAAA,CAAG,QAAQ,MAAM,CAAC,QAAQ,IAAI,CAAC,CAAC,CAAC,CAAC;CACtD,OAAO;EACL,MAAM;EACN,SAAS,QAAQ,OAAO,QAAQ;EAChC,MAAM,WAAW,MAAM,MAAM,EAAE,WAAW,MAAM;EAChD,gBAAgB,WAAW,MAAM,MAAM,EAAE,WAAW,iBAAiB;EACrE,QAAQ,WAAW,KAAK,OAAO;GAC7B;GACA;GACA,QAAQ,EAAE;GACV,QAAQ,EAAE;GACV,SAAS,EAAE;GACX,OAAO,EAAE;GACT,SAAS,EAAE;GACX,GAAI,SAAS,CAAC,MAAM,KAAA,IAAY,CAAC,IAAI,EAAE,cAAc,SAAS,CAAC,EAAE;EACnE,EAAE;CACJ;AACF;AAEA,MAAMC,YAAU;AAEhB,SAAgB,eACd,OACA,OACA,QACA,UACuB;CACvB,MAAM,WAAqB,CAAC;CAC5B,IAAI,MAAM,QAAQ,KAAA,KAAa,QAAQ,MAAM,KAC3C,SAAS,KAAK,SAAS,MAAM,SAAS,MAAM,KAAK;CACnD,IAAI,MAAM,QAAQ,KAAA,KAAa,QAAQ,MAAM,KAC3C,SAAS,KAAK,SAAS,MAAM,SAAS,MAAM,KAAK;CACnD,MAAM,QAAQ,MAAM;CACpB,IAAI,SAAS,aAAa,KAAA,KAAa,WAAW,GAAG;EACnD,MAAM,QAAQ,QAAQ;EACtB,IACG,MAAM,QAAQ,KAAA,KAAa,QAAQ,MAAM,OACzC,MAAM,QAAQ,KAAA,KAAa,QAAQ,MAAM,KAE1C,SAAS,KAAK,SAAS,MAAM,MAAM,MAAM,QAAQ,CAAC,EAAE,iBAAiB,UAAU;CAEnF;CACA,OAAO,SAAS,SACZ;EAAE,QAAQ;EAAS;EAAQ,SAAS,SAAS,KAAK,IAAI;EAAG,OAAO;EAAG,SAAS,CAAC,KAAK;CAAE,IACpF,KAAA;AACN;AAEA,SAAgB,gBACd,MACA,MACA,QACuB;CACvB,MAAM,yBAAS,IAAI,IAAsB;CACzC,KAAK,MAAM,CAAC,GAAG,QAAQ,KAAK,QAAQ,GAAG;EACrC,MAAM,IAAI,MAAM,KAAK,IAAI;EACzB,MAAM,IAAI,OAAO,IAAI,CAAC;EACtB,IAAI,GAAG,EAAE,KAAK,CAAC;OACV,OAAO,IAAI,GAAG,CAAC,CAAC,CAAC;CACxB;CACA,MAAM,aAAa,CAAC,GAAG,OAAO,OAAO,CAAC,CAAC,CAAC,QAAQ,MAAM,EAAE,SAAS,CAAC;CAClE,IAAI,WAAW,WAAW,GAAG,OAAO,KAAA;CACpC,OAAO;EACL,QAAQ;EACR;EACA,SAAS,GAAG,KAAK,KAAK,IAAI,EAAE,eAAe,WAAW,OAAO;EAC7D,OAAO,WAAW;EAClB,SAAS,WACN,MAAM,GAAGA,SAAO,CAAC,CACjB,KAAK,MAAM,KAAK,KAAK,MAAM,OAAQ,KAAK,EAAE,GAAa,CAAS,MAAM,IAAI,CAAC,CAAC;EAC/E,MAAM,WAAW,KAAK;CACxB;AACF;AAEA,SAAgB,cACd,MACA,MACA,KACA,QACuB;CACvB,MAAM,MAAgB,CAAC;CACvB,KAAK,MAAM,CAAC,GAAG,QAAQ,KAAK,QAAQ,GAAG,IAAI,CAAC,KAAK,MAAM,KAAK,GAAG,GAAG,IAAI,KAAK,CAAC;CAC5E,IAAI,IAAI,WAAW,GAAG,OAAO,KAAA;CAC7B,OAAO;EACL,QAAQ;EACR;EACA,SAAS,GAAG,IAAI,OAAO;EACvB,OAAO,IAAI;EACX,SAAS,IAAI,MAAM,GAAGA,SAAO,CAAC,CAAC,KAAK,MAAM,OAAO,KAAK,EAAS,CAAC;EAChE,MAAM;CACR;AACF;;AAKA,SAAgB,gBACd,MACA,OACA,MACa;CACb,MAAM,yBAAS,IAAI,IAAiB;CACpC,KAAK,MAAM,OAAO,MAAM;EACtB,MAAM,KAAK,IAAI,MAAM,OAAO;EAC5B,MAAM,IAAI,OAAO,OAAO,WAAW,KAAK,KAAK,UAAU,OAAO,EAAE,CAAC;EACjE,IAAI,CAAC,OAAO,IAAI,CAAC,GAAG,OAAO,IAAI,GAAG,IAAI,MAAM,UAAU,IAAI;CAC5D;CACA,MAAM,MAAmB,CAAC;CAC1B,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,MAAM,MAAM,GAAG;EACvD,MAAM,MAAM,OAAO,IAAI,GAAG;EAC1B,MAAM,QAAQ,OAAO,QAAQ,WAAW,MAAM;EAC9C,MAAM,MAAM,MAAM,QAAQ,KAAA,KAAa,QAAQ,MAAM;EACrD,MAAM,OAAO,MAAM,QAAQ,KAAA,KAAa,QAAQ,MAAM;EACtD,IAAI,OAAO,MACT,IAAI,KAAK;GACP,QAAQ;GACR,QAAQ,cAAc,MAAM,SAAS,MAAM,MAAM;GACjD,SAAS,GAAG,MAAM,GAAG,GAAG,IAAI,IAAI,MAAM,MAAM,GAAG,MAAM,GAAG,MAAM,SAAS,MAAM,QAAQ,SAAS,MAAM;GACpG,OAAO;GACP,SAAS,CAAC,GAAG;EACf,CAAC;CAEL;CACA,OAAO;AACT;;AAYA,SAAgB,mBACd,MACA,KACA,QACA,MACsE;CACtE,MAAM,SAAsB,CAAC;CAC7B,MAAM,SAAS,OAAe,YAC5B,OAAO,KAAK;EAAE;EAAS;EAAO,MAAM;CAAsB,CAAC;CAC7D,IAAI,WAAW;CACf,MAAM,SAAS,OAAO,KAAK;CAC3B,MAAM,WAAW,UAA6B,MAAM,QAAQ,MAAM,CAAC,OAAO,OAAO,QAAQ,CAAC,CAAC;CAE3F,KAAK,MAAM,UAAU;EAAC;EAAS;EAAU;EAAS;CAAM,GAAY;EAClE,IAAI,IAAI,YAAY,KAAA,GAAW;EAE/B,MAAM,UAAU,YADD,cAAc,IAAI,QAAQ,MACR,GAAG,QAAQ,QAAQ;EACpD,IAAI,QAAQ,IAAI,WAAW,QAAQ;OAC9B,MAAM,QAAQ,QAAQ,KAAK;CAClC;CACA,IAAI,IAAI,UAAU,QAAQ,IAAI,MAAM,CAAC,CAAC,QACpC,MAAM,UAAU,mBAAmB,QAAQ,IAAI,MAAM,CAAC,CAAC,KAAK,IAAI,GAAG;CAErE,IAAI,IAAI,OAAO;EACb,MAAM,QAAQ,IAAI;EAClB,IAAI,QAAQ,CAAC,MAAM,IAAI,MAAM,KAAK,CAAC,CAAC,CAAC,QACnC,MAAM,SAAS,mBAAmB,QAAQ,CAAC,MAAM,IAAI,MAAM,KAAK,CAAC,CAAC,CAAC,KAAK,IAAI,GAAG;OAC1E,IAAI,CAAC,WAAW,OAAO,MAAM,QAAiB,EAAE,MAAM,GAC3D,MAAM,SAAS,GAAG,MAAM,MAAM,kBAAkB;EAElD,KAAK,MAAM,SAAS,OAAO,OAAO,MAAM,MAAM,GAAG;GAC/C,IAAI,MAAM,WAAW,KAAA,GAAW;GAChC,MAAM,UAAU,YAAY,MAAM,QAAQ,SAAS,QAAQ;GAC3D,IAAI,CAAC,QAAQ,IAAI,MAAM,SAAS,QAAQ,KAAK;EAC/C;CACF;CACA,IAAI;CACJ,IAAI,IAAI,MAAM;EACZ,MAAM,WAAW,iBAAiB,IAAI,KAAK,MAAM,KAAK,OAAO,IAAI,CAAC;EAClE,IAAI,SAAS,IAAI,OAAO,SAAS;OAC5B,MAAM,QAAQ,SAAS,KAAK;CACnC;CACA,IAAI,OAAO,QAAQ,OAAO;EAAE,IAAI;EAAO,OAAO;CAAO;CAErD,MAAM,SAAkB,MAAM,KAAK,YAAY;EAC7C,MAAM,aAA0B,CAAC;EACjC,MAAM,QAAQ,MAA6B,KAAK,WAAW,KAAK,CAAC;EACjE,IAAI,IAAI,SAAS,CAAC,QAAQ,WACxB,KACE,eACE,KAAK,QACL,IAAI,OACJ,cAAc,IAAI,QAAQ,OAAO,GACjC,QAAQ,QACV,CACF;EAEF,IAAI,IAAI,QAAQ,KAAK,gBAAgB,MAAM,IAAI,QAAQ,cAAc,IAAI,QAAQ,QAAQ,CAAC,CAAC;EAC3F,IAAI,IAAI,OAAO,WAAW,KAAK,GAAG,gBAAgB,MAAM,IAAI,OAAO,IAAI,MAAM,CAAC;EAC9E,IAAI,MAAM,KAAK,cAAc,MAAM,MAAM,KAAK,cAAc,IAAI,QAAQ,MAAM,CAAC,CAAC;EAChF,OAAO,gBAAgB,MAAM,eAAe,MAAM,UAAU;CAC9D;CACA,OAAO,GAAG;EAAE,QAAQ;EAAU;CAAM,CAAC;AACvC;;;;;;;;;;;AC9IA,SAAgB,WAAc,KAA6B;CACzD,OAAO;AACT;AAEA,MAAa,SAAS,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;;AAGtC,SAAgB,WAAW,MAAc,MAA0C;CACjF,OAAO,OAAO,YACZ,OAAO,KAAK,KAAK,MAAM,CAAC,CAAC,KAAK,UAAU,CAAC,OAAO;EAAE;EAAM;EAAO,WAAW;CAAM,CAAC,CAAC,CACpF;AACF;;AAGA,SAAgB,KAAK,SAAiB,QAAoC,CAAC,GAAG;CAC5E,OAAO;EAAE,IAAI;EAAgB,OAAO,CAAC;GAAE;GAAS,GAAG;EAAM,CAAC;CAA0B;AACtF;;;;;;;;;AClLA,MAAM,UAAU,EACb,MACC,EAAE,MAAM,CACN,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,GAChB,EAAE,aAAa;CAAE,MAAM,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;CAAG,MAAM,EAAE,QAAQ,CAAC,CAAC,SAAS;AAAE,CAAC,CAC1E,CAAC,CACH,CAAC,CACA,IAAI,CAAC;AAER,MAAM,MAAM,EAAE,aAAa;CACzB,KAAK,EAAE,KAAK;EACV;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;CACF,CAAC;CACD,MAAM,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS;CACjC,OAAO,EAAE,QAAQ,CAAC,CAAC,SAAS;CAC5B,UAAU,QAAQ,SAAS;CAC3B,MAAM,EAAE,QAAQ,CAAC,CAAC,SAAS;AAC7B,CAAC;AAGD,MAAMC,YAAS,EAAE,aAAa;CAC5B,IAAI;CACJ,UAAU,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC;CACnC,QAAQ,EACL,OAAO,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,CAC9B,QAAQ,MAAM,OAAO,KAAK,CAAC,CAAC,CAAC,SAAS,GAAG,0BAA0B;CACtE,gBAAgB,EAAE,QAAQ,CAAC,CAAC,SAAS;AACvC,CAAC;AAED,MAAM,6BAAa,IAAI,IAAI;CACzB;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AACF,CAAC;AACD,MAAM,8BAAc,IAAI,IAAI;CAAC;CAAgB;CAAS;AAAM,CAAC;AAC7D,MAAM,6BAAa,IAAI,IAAI,CAAC,OAAO,KAAK,CAAC;AAIzC,SAAS,WACP,MACA,MACA,OACA,KAC+C;CAC/C,MAAM,SAAS,aAAgC;EAAE;EAAS,OAAO;CAAK;CACtE,MAAM,OAAO,IAAI,UAAU,KAAK;CAChC,IAAI,WAAW,IAAI,KAAK,GAAG,OAAO,KAAK,SAAS,KAAA,IAC9C,OAAO,MACL,WAAW,IAAI,KAAK,GAAG,IAAI,GAAG,KAAK,IAAI,iBAAiB,GAAG,KAAK,IAAI,eACtE;CAEF,IAAI,YAAY,IAAI,KAAK,GAAG,OAAO,KAAK,aAAa,KAAA,IACnD,OAAO,MACL,YAAY,IAAI,KAAK,GAAG,IAAI,GAAG,KAAK,IAAI,mBAAmB,GAAG,KAAK,IAAI,mBACzE;CAEF,IAAI,WAAW,IAAI,KAAK,GAAG,OAAO,KAAK,SAAS,KAAA,IAC9C,OAAO,MACL,WAAW,IAAI,KAAK,GAAG,IAAI,GAAG,KAAK,IAAI,iBAAiB,GAAG,KAAK,IAAI,eACtE;CAEF,MAAM,OAAO,KAAK;CAClB,MAAM,YAAY,SAAS,KAAA,IAAY,KAAA,IAAY,MAAM,OAAO;CAChE,IAAI,SAAS,KAAA,KAAa,CAAC,WAAW,OAAO,MAAM,kBAAkB,KAAK,EAAE;CAC5E,MAAM,SAAS,KAAK,YAAY,CAAC,EAAA,CAAG,KAAK,MACvC,OAAO,MAAM,WAAW;EAAE,MAAM;EAAG,MAAM;CAAM,IAAI;EAAE,MAAM;EAAO,GAAG;CAAE,CACzE;CACA,MAAM,eAAe,MAAM,QAAQ,MAAM,CAAC,OAAO,OAAO,MAAM,QAAQ,EAAE,IAAI,CAAC;CAC7E,IAAI,aAAa,QACf,OAAO,MAAM,4BAA6B,aAAa,EAAE,CAAsB,KAAK,EAAE;CAExF,IAAI;CACJ,IAAI,KAAK,UAAU,KAAA,GAAW;EAC5B,MAAM,IAAI,iBAAiB,KAAK,OAAO,IAAI;EAC3C,IAAI,CAAC,EAAE,IAAI,OAAO,MAAM,UAAU,EAAE,OAAO;EAC3C,QAAQ,EAAE;CACZ;CACA,IAAI;CACJ,IAAI,KAAK,SAAS,KAAA,GAAW;EAC3B,MAAM,IAAI,iBAAiB,KAAK,MAAM,IAAI;EAC1C,IAAI,CAAC,EAAE,IAAI,OAAO,MAAM,SAAS,EAAE,OAAO;EAC1C,OAAO,EAAE;CACX;CAEA,MAAM,UAAU,SAAmB,KAAK,KAAK,MAAM,EAAE,SAAmB,IAAI;CAC5E,MAAM,WAAW,SAAmB,OAAO,IAAI,CAAC,CAAC,QAAQ,MAAM,MAAM,IAAI;CACzE,MAAM,UAAU,SACd,CAAC,GAAG,IAAI,CAAC,CAAC,MAAM,GAAG,MAAM;EACvB,KAAK,MAAM,KAAK,OAAO;GACrB,MAAM,IAAI,YAAY,EAAE,EAAE,SAAS,MAAM,EAAE,EAAE,SAAS,IAAI;GAC1D,IAAI,MAAM,GAAG,OAAO,EAAE,OAAO,CAAC,IAAI;EACpC;EACA,OAAO,YAAY,aAAa,CAAC,GAAG,aAAa,CAAC,CAAC;CACrD,CAAC;CACH,MAAM,OAAO,YAAY,UAAU,SAAS,IAAI,EAAE;CAElD,IAAI;CACJ,IAAI;CACJ,QAAQ,KAAK,KAAb;EACE,KAAK;GACH,OAAO,EAAE;GACT,WAAW,SAAS,KAAK;GACzB;EACF,KAAK;GACH,OAAO,EAAE;GACT,WAAW,SAAS,IAAI,IAAI,QAAQ,IAAI,CAAC,CAAC,IAAI,YAAY,CAAC,CAAC,CAAC;GAC7D;EACF,KAAK;GACH,IAAI,KAAK,SAAS,UAChB,OAAO,MAAM,6BAA6B,KAAK,MAAM,KAAK,SAAkB,GAAG;GACjF,OAAO,EAAE,SAAS,EAAE,MAAM;GAC1B,WAAW,SAAS;IAClB,MAAM,KAAM,QAAQ,IAAI,CAAC,CAAc,MAAM,GAAG,MAAM,IAAI,CAAC;IAC3D,OAAO,GAAG,WAAW,IAAI,OAAO,GAAG,QAAQ,GAAG,MAAM,IAAI,GAAG,CAAC;GAC9D;GACA;EACF,KAAK;EACL,KAAK,OAAO;GACV,IAAI,CAAC,UAAU,IAAI,GACjB,OAAO,MACL,GAAG,KAAK,IAAI,yCAAyC,KAAK,MAAM,KAAK,SAAkB,GACzF;GACF,OAAO,EAAE,SAAS,IAAI;GACtB,MAAM,OAAO,KAAK,QAAQ,QAAQ,IAAI;GACtC,WAAW,SAAS,QAAQ,IAAI,CAAC,CAAC,MAAM,GAAG,MAAM,OAAO,YAAY,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM;GACjF;EACF;EACA,KAAK;GACH,OAAO,EAAE,KAAK,IAAI;GAClB,WAAW,SAAS;IAClB,MAAM,uBAAO,IAAI,IAAiB;IAClC,KAAK,MAAM,KAAK,QAAQ,IAAI,GAAG,KAAK,IAAI,aAAa,CAAC,GAAG,CAAC;IAC1D,OAAO,CAAC,GAAG,KAAK,OAAO,CAAC,CAAC,CAAC,KAAK,WAAW;GAC5C;GACA;EACF,KAAK;GACH,OAAO,EAAE,KAAK,SAAkB;GAChC,WAAW,SAAS,OAAO,IAAI,CAAC,CAAC,KAAK,MAAM,EAAE,SAAmB,IAAI;GACrE;EACF,KAAK;EACL,KAAK,QAAQ;GACX,OAAO,EAAE,SAAS,SAAkB;GACpC,MAAM,OAAO,KAAK,QAAQ,UAAU,IAAI;GACxC,WAAW,SAAS,OAAO,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,SAAmB;GAC/D;EACF;EACA,SAAS;GACP,OAAO,EAAE;GACT,MAAM,OAAO;GACb,UACE,KAAK,QAAQ,SACR,MAAM,QAAQ,KAAK,MAAM,MAAM,KAAK,MAAM,GAAG,GAAG,CAAC,KACjD,MAAM,QAAQ,KAAK,OAAO,MAAM,KAAK,MAAM,GAAG,GAAG,CAAC;EAC3D;CACF;CACA,IAAI,OAAO;EACT,MAAM,IAAI;EACV,MAAM,QAAQ;EACd,WAAW,MAAM,QACf,MACE,KAAK,QAAQ,MAAM,EAAE,MAAM,GAAG,GAAG,CAAC,GAClC,GACF;CACJ;CACA,OAAO;EAAE;EAAM;CAAQ;AACzB;AAEA,MAAa,gBAAgB,WAAW;CACtC,IAAI;CACJ,OAAO;CACP,UAAU;CACV,aAAa;CACb,OAAO,CAAC;EAAE,IAAI;EAAM,OAAO;EAAM,MAAM,CAAC,IAAI;CAAE,CAAC;CAC/C,QAAQ;CACR,iBAAiB;EAAE,IAAI;EAAI,UAAU,CAAC;EAAG,QAAQ,CAAC;CAAE;CACpD,QAAA;CACA,iBAAiB,MAAM,EAAE,mBAAmB;CAC5C,UAAU,GAAG,QAAQ;EACnB,MAAM,QAAQ,IAAI,MAAM,EAAE,EAAE;EAC5B,MAAM,SAAsB,CAAC;EAC7B,MAAM,SAAgC,CAAC;EACvC,KAAK,MAAM,KAAK,EAAE,UAAU;GAC1B,MAAM,OAAO,MAAM,KAAK,OAAO;GAC/B,IAAI,MAAM,OAAO,KAAK;QACjB,OAAO,KAAK,EAAE,SAAS,4BAA4B,EAAE,GAAG,CAAC;EAChE;EACA,MAAM,OAA6C,CAAC;EACpD,KAAK,MAAM,CAAC,MAAM,SAAS,OAAO,QAAQ,EAAE,MAAM,GAAG;GACnD,IAAI,EAAE,SAAS,SAAS,IAAI,GAAG;IAC7B,OAAO,KAAK;KAAE,SAAS,IAAI,KAAK;KAAyC,OAAO;IAAK,CAAC;IACtF;GACF;GACA,MAAM,WAAW,WAAW,MAAM,MAAM,MAAM,MAAM,GAAG;GACvD,IAAI,aAAa,UAAU,OAAO,KAAK,QAAQ;QAC1C;IACH,OAAO,QAAQ,SAAS;IACxB,KAAK,KAAK;KAAE;KAAM,SAAS,SAAS;IAAQ,CAAC;GAC/C;EACF;EACA,IAAI,OAAO,QAAQ,OAAO;GAAE,IAAI;GAAO,OAAO;EAAO;EAErD,MAAM,OAAO,EAAE,OAAO,MAAM;EAC5B,OAAO,GAAG;GACR,QAAQ;IACN;IACA,SAAS;KACP,GAAG,WAAW,IAAI,IAAI,IAAI;KAC1B,GAAG,OAAO,YAAY,EAAE,SAAS,KAAK,MAAM,CAAC,GAAG,MAAM,QAAQ,EAAY,CAAC,CAAC;IAC9E;GACF;GACA,MAAM,QAAQ,QAAQ;IACpB,MAAM,yBAAS,IAAI,IAAmB;IAEtC,IAAI,EAAE,SAAS,WAAW,GAAG,OAAO,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IACzD,KAAK,MAAM,OAAO,OAAO,EAAE,EAAE,GAAG;KAC9B,MAAM,IAAI,MAAM,KAAK,EAAE,QAAQ;KAC/B,MAAM,IAAI,OAAO,IAAI,CAAC;KACtB,IAAI,GAAG,EAAE,KAAK,GAAG;UACZ,OAAO,IAAI,GAAG,CAAC,GAAG,CAAC;IAC1B;IACA,MAAM,OAAc,CAAC;IACrB,KAAK,MAAM,WAAW,OAAO,OAAO,GAAG;KACrC,MAAM,MAA2B,CAAC;KAClC,MAAM,SAAS,QAAQ;KACvB,KAAK,MAAM,KAAK,EAAE,UAAU,IAAI,KAAM,OAAe,MAAM;KAC3D,KAAK,MAAM,KAAK,MAAM,IAAI,EAAE,QAAQ,EAAE,QAAQ,SAAS,GAAG;KAC1D,KAAK,KAAK,GAAG;IACf;IACA,OAAO,GAAG,EAAE,MAAM,YAAY,MAAM,EAAE,QAAQ,EAAE,CAAC;GACnD;EACF,CAAC;CACH;AACF,CAAC;;;;;;;;;;;;ACtOD,SAAgB,SAAY,KAAyB;CACnD,OAAO;AACT;AAEA,MAAa,cAAc;AAC3B,MAAa,eAAe;;AAG5B,SAAgB,WACd,OACA,OACA,IACuB;CACvB,OAAO,MAAM,SAAS,MAAM,IAAI,IAC5B,GAAG,KAAK,IACR,IAAI,GAAG,GAAG,WAAW,MAAM,KAAK,MAAM,EAAE,QAAQ,SAAS,KAAK,GAAG;AACvE;AAEA,SAAS,SAAS,OAAsB;CACtC,OAAO,MAAM,SAAS,aAClB,GAAG,MAAM,GAAG,KAAK,KACjB,MAAM,SAAS,SACb,aACA,MAAM;AACd;;AAGA,MAAa,OAA4C,EAAE,WACzD,EAAE,MAAM;CACN,EAAE,OAAO;CACT,EAAE,OAAO;CACT,EAAE,QAAQ;CACV,EAAE,KAAK;CACP,EAAE,MAAM,IAAI;CACZ,EAAE,OAAO,EAAE,OAAO,GAAG,IAAI;AAC3B,CAAC,CACH;;AAGA,MAAaC,aAAmC,UAAa,EAAE,aAAa,KAAK;;;;;;;;;;;;;AClEjF,MAAa,UAAU,EAAE,KAAK;CAAC;CAAQ;CAAc;CAAe;AAAW,CAAC;AAGhF,MAAa,SAAS,EAAE,MAAM;CAC5B,EAAE,KAAK;EAAC;EAAS;EAAa;EAAmB;CAAM,CAAC;CACxD,EAAE,aAAa,EAAE,UAAU,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;CAC9D,EAAE,aAAa,EAAE,aAAa,EAAE,OAAO,EAAE,OAAO,GAAG,IAAI,EAAE,CAAC;AAC5D,CAAC;AAGD,MAAa,UAAU;CAAC;CAAS;CAAU;CAAS;AAAM;;AAI1D,MAAa,aAAa,EAAE,MAAM,CAChC,QACA,EAAE,aAAa;CACb,SAAS,OAAO,SAAS;CACzB,OAAO,OAAO,SAAS;CACvB,QAAQ,OAAO,SAAS;CACxB,OAAO,OAAO,SAAS;CACvB,MAAM,OAAO,SAAS;AACxB,CAAC,CACH,CAAC;AAGD,MAAa,QAAQ,EAAE,aAAa;CAAE,KAAK,EAAE,OAAO,CAAC,CAAC,SAAS;CAAG,KAAK,EAAE,OAAO,CAAC,CAAC,SAAS;AAAE,CAAC;AAG9F,MAAa,kBAAkB,EAAE,aAAa;;CAE5C,OAAO,MAAM,OAAO,EAAE,YAAY,MAAM,SAAS,EAAE,CAAC,CAAC,CAAC,SAAS;;CAE/D,QAAQ,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS;;CAEnD,OAAO,EACJ,aAAa;EACZ,IAAI,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;EACpB,OAAO,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;EACvB,QAAQ,EAAE,OAAO,EAAE,OAAO,GAAG,MAAM,OAAO,EAAE,QAAQ,OAAO,SAAS,EAAE,CAAC,CAAC;CAC1E,CAAC,CAAC,CACD,SAAS;;CAEZ,MAAM,EAAE,aAAa,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC,SAAS;CACrD,QAAQ,WAAW,SAAS;CAC5B,MAAM,EAAE,OAAO,CAAC,CAAC,SAAS;AAC5B,CAAC;AAGD,MAAM,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,GAAG,IAAI,CAAC;;AAG/C,MAAa,UAAU,EAAE,aAAa;CACpC,MAAM,EAAE,OAAO,CAAC,CAAC,SAAS;CAC1B,SAAS,EAAE,OAAO,EAAE,OAAO,GAAG,IAAI,CAAC,CAAC,QAAQ,CAAC,CAAC;CAC9C,QAAQ,EAAE,OAAO,EAAE,OAAO,GAAG,IAAI,CAAC,CAAC,QAAQ,CAAC,CAAC;;CAE7C,KAAK,EAAE,OAAO,CAAC,CAAC,SAAS;CACzB,IAAI,EAAE,OAAO,CAAC,CAAC,SAAS;AAC1B,CAAC;AAGD,MAAa,WAAW,EAAE,YAAY;CACpC,IAAI,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;CACpB,IAAI,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;CACpB,OAAO,EAAE,OAAO,CAAC,CAAC,SAAS;AAC7B,CAAC;AAGD,MAAa,WAAW,EAAE,OAAO;CAAE,GAAG,EAAE,OAAO;CAAG,GAAG,EAAE,OAAO;AAAE,CAAC;;AAIjE,MAAa,aAAa,EAAE,OAAO,EAAE,OAAO,GAAG,EAAE,QAAQ,CAAC;AAG1D,MAAa,iBAAiB,EAAE,OAAO;CACrC,IAAI,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;CACpB,MAAM,EAAE,OAAO,CAAC,CAAC,SAAS;CAC1B,SAAS,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC;CAC1C,QAAQ,EAAE,KAAK,CAAC,SAAS,WAAW,CAAC,CAAC,CAAC,QAAQ,OAAO;;CAEtD,SAAS,QAAQ,SAAS;CAC1B,eAAe,EAAE,KAAK,CAAC,UAAU,QAAQ,CAAC,CAAC,CAAC,SAAS;CACrD,QAAQ,EAAE,OAAO,EAAE,OAAO,GAAG,IAAI,CAAC,CAAC,QAAQ,CAAC,CAAC;CAC7C,QAAQ,EAAE,OAAO,EAAE,OAAO,GAAG,EAAE,OAAO,EAAE,OAAO,GAAG,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;CACnE,gBAAgB,EAAE,OAAO,EAAE,OAAO,GAAG,UAAU,CAAC,CAAC,QAAQ,CAAC,CAAC;CAC3D,OAAO,EAAE,MAAM,QAAQ,CAAC,CAAC,QAAQ,CAAC,CAAC;CACnC,QAAQ,EAAE,OAAO,EAAE,OAAO,GAAG,eAAe,CAAC,CAAC,QAAQ,CAAC,CAAC;CACxD,UAAU,EAAE,MAAM,OAAO,CAAC,CAAC,QAAQ,CAAC,CAAC;CACrC,QAAQ,EAAE,OAAO,EAAE,OAAO,GAAG,QAAQ,CAAC,CAAC,SAAS;AAClD,CAAC;;AAMD,SAAgB,aAAa,OAAgC;CAC3D,OAAO,eAAe,MAAM,KAAK;AACnC;AAEA,SAAgB,aAAa,IAAY,MAA+B;CACtE,OAAO,aAAa,SAAS,KAAA,IAAY,EAAE,GAAG,IAAI;EAAE;EAAI;CAAK,CAAC;AAChE;;AAGA,SAAgB,oBAA6C;CAC3D,OAAO,EAAE,aAAa,gBAAgB,EAAE,IAAI,QAAQ,CAAC;AACvD;;;;;;;;;;;;;;;;;AC1FA,MAAM,SAAS;CAAE,IAAI;CAAQ,SAAS,OAAO,SAAS;AAAE;AAExD,MAAMC,WAAS,EAAE,mBAAmB,SAAS;CAC3C,EAAE,aAAa;EACb,GAAG;EACH,OAAO,EAAE,QAAQ,OAAO;EACxB,KAAK,EAAE,OAAO,CAAC,CAAC,SAAS;EACzB,KAAK,EAAE,OAAO,CAAC,CAAC,SAAS;CAC3B,CAAC;CACD,EAAE,aAAa;EACb,GAAG;EACH,OAAO,EAAE,QAAQ,QAAQ;EACzB,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;CACxC,CAAC;CACD,EAAE,aAAa;EAAE,GAAG;EAAQ,OAAO,EAAE,QAAQ,MAAM;EAAG,MAAM,EAAE,QAAQ;CAAE,CAAC;CACzE,EAAE,aAAa;EACb,GAAG;EACH,OAAO,EAAE,QAAQ,SAAS;EAC1B,MAAM,EAAE,aAAa;GACnB,MAAM,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;GACtB,IAAI,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;GACpB,KAAK,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS;EAClC,CAAC;EACD,KAAK,EAAE,aAAa;GAAE,IAAI;GAAQ,KAAK,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;EAAE,CAAC,CAAC,CAAC,SAAS;EACrE,QAAQ,EACL,aAAa;GACZ,IAAI;GACJ,KAAK,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;GACrB,MAAM,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;GACtB,IAAI,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;GACpB,OAAO,EAAE,QAAQ,CAAC,CAAC,SAAS;EAC9B,CAAC,CAAC,CACD,SAAS;CACd,CAAC;AACH,CAAC;;AAKD,SAAgB,UAAU,OAAqE;CAC7F,MAAM,uBAAO,IAAI,IAAsB;CACvC,KAAK,MAAM,CAAC,MAAM,OAAO,OAAO,KAAK,IAAI,MAAM,CAAC,GAAI,KAAK,IAAI,IAAI,KAAK,CAAC,GAAI,EAAE,CAAC;CAC9E,MAAM,wBAAQ,IAAI,IAA6B;CAC/C,MAAM,OAAiB,CAAC;CACxB,MAAM,SAAS,SAAuC;EACpD,MAAM,IAAI,MAAM,MAAM;EACtB,KAAK,KAAK,IAAI;EACd,KAAK,MAAM,MAAM,KAAK,IAAI,IAAI,KAAK,CAAC,GAAG;GACrC,IAAI,MAAM,IAAI,EAAE,MAAM,QAAQ,OAAO,CAAC,GAAG,KAAK,MAAM,KAAK,QAAQ,EAAE,CAAC,GAAG,EAAE;GACzE,IAAI,CAAC,MAAM,IAAI,EAAE,GAAG;IAClB,MAAM,QAAQ,MAAM,EAAE;IACtB,IAAI,OAAO,OAAO;GACpB;EACF;EACA,KAAK,IAAI;EACT,MAAM,IAAI,MAAM,MAAM;CAExB;CACA,KAAK,MAAM,QAAQ,CAAC,GAAG,KAAK,KAAK,CAAC,CAAC,CAAC,KAAK,GAAG;EAC1C,IAAI,MAAM,IAAI,IAAI,GAAG;EACrB,MAAM,QAAQ,MAAM,IAAI;EACxB,IAAI,OAAO,OAAO;CACpB;AAEF;AAEA,SAAS,YAAY,QAAoB,QAA2B,OAA4B;CAC9F,OAAO,OACJ,QAAQ,MAAM,CAAC,OAAO,OAAO,OAAO,KAAK,QAAQ,CAAC,CAAC,CAAC,CACpD,KAAK,OAAO,EAAE,SAAS,GAAG,MAAM,mBAAmB,EAAE,GAAG,EAAE;AAC/D;AAEA,SAAS,eAAe,GAAY,OAAmB,KAAc;CACnE,MAAM,SAAS,YACb,OACA;EAAC,EAAE,KAAK;EAAM,EAAE,KAAK;EAAI,GAAI,EAAE,KAAK,MAAM,CAAC,EAAE,KAAK,GAAG,IAAI,CAAC;CAAE,GAC5D,MACF;CACA,MAAM,WAAW,MAAM,KAAK,OAAO,EAAE,KAAK;CAC1C,IAAI;CACJ,IAAI,EAAE,KAAK,OAAO,KAAK,GAAG,YAAY,IAAI,MAAM,EAAE,IAAI,EAAE,GAAG,CAAC,EAAE,IAAI,GAAG,GAAG,KAAK,CAAC;CAE9E,IAAI,EAAE,KAAK,OAAO,EAAE,KAAK,OAAO,KAAK,EAAE,SAAS,6CAA6C,CAAC;CAC9F,MAAM,YAAY,EAAE,KAAK,MACrB,MAAM,KAAK,OAAO,EAAE,KAAK,OACzB,EAAE,OAAO,IAAI,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC,KAAK,OAAO,EAAE,IAAI;CACnD,IAAI,EAAE,QAAQ;EACZ,IAAI,CAAC,EAAE,OAAO,CAAC,EAAE,KAAK,KAAK,OAAO,KAAK,EAAE,SAAS,+BAA+B,CAAC;EAClF,MAAM,UAAU,IAAI,MAAM,EAAE,OAAO,EAAE;EACrC,OAAO,KAAK,GAAG,YAAY,SAAS;GAAC,EAAE,OAAO;GAAK,EAAE,OAAO;GAAM,EAAE,OAAO;EAAE,GAAG,QAAQ,CAAC;EACzF,MAAM,SAA2D;GAC/D;IAAC;IAAe,QAAQ,KAAK,OAAO,EAAE,OAAO;IAAO;GAAQ;GAC5D;IAAC;IAAa,QAAQ,KAAK,OAAO,EAAE,OAAO;IAAK;GAAQ;GACxD;IAAC;IAAc,QAAQ,KAAK,OAAO,EAAE,OAAO;IAAM;GAAS;EAC7D;EACA,KAAK,MAAM,CAAC,MAAM,GAAG,MAAM,QACzB,IAAI,KAAK,KAAK,CAAC,WAAW,GAAG,CAAC,GAAG,OAAO,KAAK,EAAE,SAAS,GAAG,KAAK,IAAI,KAAK,CAAC,EAAE,MAAM,KAAK,CAAC,IAAI,CAAC;EAE/F,IAAI,EAAE,OAAO,UAAU,KAAA,GAAW;GAChC,MAAM,IAAI,iBAAiB,EAAE,OAAO,OAAO,IAAI,UAAU,QAAQ,IAAI,CAAC;GACtE,IAAI,EAAE,IAAI,cAAc,EAAE;QACrB,OAAO,KAAK,EAAE,SAAS,iBAAiB,EAAE,QAAQ,CAAC;EAC1D;CACF;CACA,MAAM,SAAS,MAAM,KAAK,OAAO,EAAE,KAAK;CACxC,IAAI,YAAY,UAAU,CAAC,WAAW,UAAU,MAAM,GACpD,OAAO,KAAK,EAAE,SAAS,SAAS,KAAK,QAAQ,EAAE,MAAM,KAAK,MAAM,IAAI,CAAC;CAEvE,OAAO;EAAE;EAAQ;CAAY;AAC/B;AAEA,MAAM,OAAO,MAAY,OAAO,MAAM,WAAW,IAAI,aAAa,CAAC;AAInE,SAAS,iBACP,GACA,QACA,KACA,aACA,QACuB;CACvB,MAAM,QAAQ,EAAE,KAAK;CACrB,MAAM,UAAU,UAAU,KAAA,KAAa,EAAE,QAAQ,KAAA;CAEjD,MAAM,0BAAU,IAAI,IAA+B;CACnD,MAAM,uBAAO,IAAI,IAAiB;CAClC,KAAK,MAAM,OAAO,OAAO,EAAE,EAAE,GAAG;EAC9B,MAAM,OAAO,IAAI,EAAE,KAAK,SAAS;EACjC,MAAM,KAAK,IAAI,EAAE,KAAK,OAAO;EAC7B,MAAM,IAAI,QAAS,IAAI,UAAU,OAAQ;EACzC,IAAI,SAAS,QAAQ,OAAO,QAAS,SAAS,MAAM,MAAO;EAC3D,MAAM,IAAI,aAAa,CAAC;EACxB,KAAK,IAAI,GAAG,CAAC;EACb,MAAM,QAAQ,QAAQ,IAAI,CAAC,qBAAK,IAAI,IAAkB;EACtD,MAAM,IAAI,aAAa,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,CAAC;EACxD,QAAQ,IAAI,GAAG,KAAK;CACtB;CACA,IAAI,SAAgB,CAAC,IAAI;CACzB,IAAI,OAAO,SAAS,CAAC,GAAG,KAAK,OAAO,CAAC,CAAC,CAAC,KAAK,WAAW;MAClD,IAAI,EAAE,KAAK;EACd,MAAM,uBAAO,IAAI,IAAiB;EAClC,KAAK,MAAM,OAAO,OAAO,EAAE,IAAI,EAAE,GAAG;GAClC,MAAM,IAAI,IAAI,EAAE,IAAI,QAAQ;GAC5B,IAAI,MAAM,MAAM,KAAK,IAAI,aAAa,CAAC,GAAG,CAAC;EAC7C;EACA,SAAS,CAAC,GAAG,KAAK,OAAO,CAAC,CAAC,CAAC,KAAK,WAAW;CAC9C;CACA,MAAM,2BAAW,IAAI,IAAyB;CAC9C,IAAI,EAAE,QACJ,KAAK,MAAM,OAAO,OAAO,EAAE,OAAO,EAAE,GAAG;EACrC,IAAI,eAAe,CAAC,YAAY,MAAM,KAAK,GAAG,GAAG;EACjD,MAAM,IAAI,aAAa,IAAI,EAAE,OAAO,QAAQ,IAAI;EAChD,MAAM,MAAM,SAAS,IAAI,CAAC,qBAAK,IAAI,IAAY;EAC/C,IAAI,IAAI,aAAa,CAAC,IAAI,EAAE,OAAO,SAAS,MAAM,IAAI,EAAE,OAAO,OAAO,IAAI,CAAC,CAAC;EAC5E,SAAS,IAAI,GAAG,GAAG;CACrB;CAIF,MAAM,wBAAQ,IAAI,IAAkC;CACpD,MAAM,UAAkB,CAAC;CACzB,IAAI,QAAQ;CACZ,KAAK,MAAM,KAAK,QAAQ;EACtB,MAAM,UAAU,SAAS,IAAI,aAAa,CAAC,CAAC,qBAAK,IAAI,IAAY;EACjE,MAAM,QAAQ,QAAQ,IAAI,aAAa,QAAQ,IAAI,IAAI,CAAC,qBAAK,IAAI,IAAkB;EACnF,MAAM,aAAa,CAAC,GAAG,KAAK,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,QAAQ,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,OAAO,CAAC;EAC/E,IAAI;EACJ,IAAI,OAAO,QAAQ,UAAU,KAAK,CAAC;OAC9B;GACH,MAAM,YAAY,CAAC,GAAG,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC,KAAK,GAAG;GAC9C,IAAI,CAAC,MAAM,IAAI,SAAS,GAAG,MAAM,IAAI,WAAW,UAAU,KAAK,CAAC,CAAC;GACjE,QAAQ,MAAM,IAAI,SAAS;EAC7B;EACA,IAAI,OAAO;GACT,SAAS;GACT,IAAI,QAAQ,SAAS,GAAG,QAAQ,KAAK;IAAE,OAAO,OAAO,CAAC;IAAG;GAAM,CAAC;EAClE;CACF;CACA,IAAI,UAAU,GAAG,OAAO,KAAA;CACxB,MAAM,QAAQ,QAAQ;CACtB,OAAO;EACL,QAAQ;EACR;EACA,SAAS,GAAG,MAAM,GAAG,UAAU,gBAAgB,YAAY,iBAAiB,UAAU,GAAG,OAAO,MAAM,UAAU,WAAW,MAAM,QAAQ,KAAK,UAAU,MAAM,KAAK,EAAE,MAAM,KAAK,MAAM,MAAM,KAAK,MAAM;EACvM;EACA,SAAS;CACX;AACF;AAEA,MAAa,aAAa,WAAW;CACnC,IAAI;CACJ,OAAO;CACP,UAAU;CACV,aAAa;CACb,OAAO;EACL;GAAE,IAAI;GAAM,OAAO;GAAM,MAAM,CAAC,IAAI;EAAE;EACtC;GAAE,IAAI;GAAO,OAAO;GAAO,MAAM,CAAC,OAAO,IAAI;GAAG,UAAU;EAAK;EAC/D;GAAE,IAAI;GAAU,OAAO;GAAU,MAAM,CAAC,UAAU,IAAI;GAAG,UAAU;EAAK;CAC1E;CACA,QAAQ;CACR,QAAQ;CACR,iBAAiB;EAAE,IAAI;EAAI,OAAO;CAAQ;CAC1C,QAAA;CACA,UAAU,GAAW,QAAQ;EAC3B,MAAM,QAAQ,IAAI,MAAM,EAAE,EAAE;EAC5B,MAAM,SAAS,EAAE,WAAW;EAC5B,MAAM,UAAU,YAAY,QAAQ,EAAE,OAAO,KAAK;EAClD,MAAM,SAAsB,QAAQ,KAAK,CAAC,IAAI,CAAC,EAAE,SAAS,YAAY,QAAQ,QAAQ,CAAC;EACvF,IAAI;EACJ,IAAI;EACJ,QAAQ,EAAE,OAAV;GACE,KAAK;IACH,OAAO,KAAK,GAAG,YAAY,OAAO,EAAE,MAAM,MAAM,CAAC;IACjD;GACF,KAAK,QAAQ;IACX,MAAM,WAAW,iBAAiB,EAAE,MAAM,IAAI,UAAU,MAAM,IAAI,CAAC;IACnE,IAAI,SAAS,IAAI,OAAO,SAAS;SAC5B,OAAO,KAAK,EAAE,SAAS,SAAS,SAAS,QAAQ,CAAC;IACvD;GACF;GACA,KAAK,WAAW;IACd,MAAM,WAAW,eAAe,GAAG,OAAO,GAAG;IAC7C,OAAO,KAAK,GAAG,SAAS,MAAM;IAC9B,cAAc,SAAS;IACvB;GACF;EACF;EACA,IAAI,CAAC,QAAQ,MAAM,OAAO,SAAS,GAAG,OAAO;GAAE,IAAI;GAAO,OAAO;EAAO;EAExE,OAAO,GAAG;GACR,QAAQ,QAAQ;GAChB,MAAM,QAAQ,KAAK,UAAU,CAAC,MAAM;IAClC,MAAM,OAAO,OAAO,EAAE,EAAE;IACxB,IAAI;IACJ,QAAQ,EAAE,OAAV;KACE,KAAK;MACH,YAAY,QAAQ,YAChB,KAAA,IACA,eAAe,KAAK,QAAQ,GAAG,QAAQ,KAAA,CAAS;MACpD;KACF,KAAK;MACH,YAAY,gBAAgB,MAAM,EAAE,MAAM,MAAM;MAChD;KACF,KAAK;MACH,YAAY,cAAc,MAAM,MAAc,KAAK,MAAM;MACzD;KACF,SACE,YAAY,iBAAiB,GAAG,QAAQ,KAAK,aAAa,MAAM;IACpE;IACA,OAAO,GAAG,gBAAgB,IAAI,IAAI,UAAU,MAAM,YAAY,CAAC,SAAS,IAAI,CAAC,CAAC,CAAC;GACjF;EACF,CAAC;CACH;AACF,CAAC;ACpRD,MAAa,eAAe,WAAW;CACrC,IAAI;CACJ,OAAO;CACP,UAAU;CACV,aAAa;CACb,OAAO,CAAC;EAAE,IAAI;EAAM,OAAO;EAAM,MAAM,CAAC,IAAI;CAAE,CAAC;CAC/C,QAAQ;CACR,iBAAiB;EAAE,IAAI;EAAI,MAAM,CAAC;CAAE;CACpC,QAVa,EAAE,aAAa;EAAE,IAAI;EAAQ,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;CAAE,CAUlF;CACA,UAAU,GAAG,QAAQ;EACnB,MAAM,QAAQ,IAAI,MAAM,EAAE,EAAE;EAC5B,MAAM,UAAU,EAAE,KAAK,QAAQ,MAAM,CAAC,OAAO,OAAO,MAAM,KAAK,QAAQ,CAAC,CAAC;EACzE,IAAI,QAAQ,QAAQ,OAAO,KAAK,iBAAiB,QAAQ,KAAK,IAAI,GAAG;EACrE,MAAM,SAAgC,CAAC;EACvC,MAAM,UAAkC,CAAC;EACzC,KAAK,MAAM,KAAK,EAAE,MAAM;GACtB,OAAO,KAAK,MAAM,KAAK,OAAO;GAC9B,QAAQ,KAAK,MAAM,QAAQ;EAC7B;EACA,OAAO,GAAG;GACR,QAAQ;IAAE,MAAM,EAAE,OAAO,MAAM;IAAG;GAAQ;GAC1C,MAAM,WAAW;IACf,MAAM,uBAAO,IAAI,IAAY;IAC7B,MAAM,OAAc,CAAC;IACrB,KAAK,MAAM,OAAO,OAAO,EAAE,EAAE,GAAG;KAC9B,MAAM,IAAI,MAAM,KAAK,EAAE,IAAI;KAC3B,IAAI,KAAK,IAAI,CAAC,GAAG;KACjB,KAAK,IAAI,CAAC;KACV,KAAK,KAAK,OAAO,YAAY,EAAE,KAAK,KAAK,MAAM,CAAC,GAAI,IAAI,MAAM,IAAY,CAAC,CAAC,CAAC;IAC/E;IACA,OAAO,GAAG,EAAE,KAAK,CAAC;GACpB;EACF,CAAC;CACH;AACF,CAAC;;;ACxBD,MAAM,UAAU;;AAGhB,SAAgB,iBAAiB,QAAgD;CAC/E,MAAM,aAAa,OAAO;CAC1B,IAAI,OAAO,SAAS,YAAY,OAAO,eAAe,YAAY,eAAe,MAC/E,OAAO,IACL,4FACF;CAEF,MAAM,WAAW,IAAI,IAAI,MAAM,QAAQ,OAAO,QAAQ,IAAK,OAAO,WAAwB,CAAC,CAAC;CAC5F,MAAM,SAAgC,CAAC;CACvC,KAAK,MAAM,CAAC,MAAM,SAAS,OAAO,QAAQ,UAAU,GAAG;EACrD,MAAM,OAAO,QAAQ,IAAI;EACzB,OAAO,QAAQ,SAAS,IAAI,IAAI,IAAI,OAAO,EAAE,SAAS,IAAI;CAC5D;CACA,OAAO,GAAG,EAAE,OAAO,MAAM,CAAC;AAC5B;AAEA,SAAS,QAAQ,MAAmB;CAClC,MAAM,QAAS,KAAK,SAAS,KAAK;CAClC,IAAI,MAAM,QAAQ,KAAK,GAAG;EACxB,MAAM,UAAU,MAAM,QAAQ,MAAM,EAAE,SAAS,MAAM;EACrD,MAAM,QAAQ,QAAQ,WAAW,IAAI,QAAQ,QAAQ,EAAU,IAAI,EAAE;EACrE,OAAO,MAAM,SAAS,QAAQ,SAAS,EAAE,SAAS,KAAK,IAAI;CAC7D;CACA,IAAI,MAAM,QAAQ,KAAK,IAAI,GAAG;EAC5B,MAAM,QAAQ,KAAK;EACnB,MAAM,UAAU,MAAM,QAAQ,MAAM,MAAM,MAAM;EAChD,MAAM,QAAQ,QAAQ,WAAW,IAAI,QAAQ;GAAE,GAAG;GAAM,MAAM,QAAQ;EAAG,CAAC,IAAI,EAAE;EAChF,OAAO,QAAQ,SAAS,MAAM,SAAS,EAAE,SAAS,KAAK,IAAI;CAC7D;CACA,IAAI,MAAM,QAAQ,KAAK,IAAI,GAAG;EAC5B,MAAM,QAAQ,IAAI,IACf,KAAK,KAA4B,KAAK,MAAO,MAAM,OAAO,SAAS,OAAO,CAAE,CAC/E;EACA,MAAM,UAAU,MAAM,OAAO,MAAM;EACnC,MAAM,QAAe,MAAM,SAAS,IAAIE,SAAO,CAAC,GAAG,KAAK,CAAC,CAAC,EAAY,IAAI,EAAE;EAC5E,OAAO,UAAU,EAAE,SAAS,KAAK,IAAI;CACvC;CACA,QAAQ,KAAK,MAAb;EACE,KAAK;EACL,KAAK;EACL,KAAK,WACH,OAAOA,SAAO,KAAK,IAAI;EACzB,KAAK,WACH,OAAO,EAAE;EACX,KAAK,SACH,OAAO,EAAE,KACP,OAAO,KAAK,UAAU,YAAY,KAAK,QAAQ,QAAQ,KAAK,KAAa,IAAI,EAAE,OACjF;EACF,KAAK,UAAU;GACb,MAAM,QAAS,KAAK,cAAc,CAAC;GACnC,OAAO,EAAE,OAAO,OAAO,YAAY,OAAO,QAAQ,KAAK,CAAC,CAAC,KAAK,CAAC,GAAG,OAAO,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;EAC5F;EACA,SACE,OAAO,EAAE;CACb;AACF;AAEA,SAASA,SAAO,MAAuB;CACrC,QAAQ,MAAR;EACE,KAAK,UACH,OAAO,EAAE;EACX,KAAK,UACH,OAAO,EAAE;EACX,KAAK,WACH,OAAO,EAAE;EACX,SACE,OAAO,EAAE;CACb;AACF;AAEA,SAAS,cAAc,SAA4C;CACjE,QAAQ,SAAR;EACE,KAAK,UACH,OAAO,EAAE,MAAM,SAAS;EAC1B,KAAK,WACH,OAAO,EAAE,MAAM,UAAU;EAC3B,KAAK,WACH,OAAO,EAAE,MAAM,SAAS;EAC1B,KAAK,WACH,OAAO,EAAE,MAAM,UAAU;EAC3B,KAAK,QACH,OAAO;GAAE,MAAM;GAAU,QAAQ;EAAO;EAC1C,KAAK,aACH,OAAO;GAAE,MAAM;GAAU,QAAQ;EAAY;EAC/C,SACE,OAAO,CAAC;CACZ;AACF;AAEA,SAAS,YAAY,SAAsB,UAAmB,aAA6B;CACzF,MAAM,OAAO,cAAc,OAAO;CAClC,MAAM,QACJ,YAAY,OAAO,KAAK,SAAS,WAAW;EAAE,GAAG;EAAM,MAAM,CAAC,KAAK,MAAM,MAAM;CAAE,IAAI;CACvF,OAAO,cAAc;EAAE,GAAG;EAAO;CAAY,IAAI;AACnD;AAEA,SAAS,aACP,IACA,QAMY;CACZ,OAAO;EACL,SAAS;EACT,KAAK;EACL,MAAM;EACN,UAAU,OAAO,QAAQ,MAAM,CAAC,EAAE,QAAQ,CAAC,CAAC,KAAK,MAAM,EAAE,IAAI;EAC7D,YAAY,OAAO,YACjB,OAAO,KAAK,MAAM,CAAC,EAAE,MAAM,YAAY,EAAE,SAAS,EAAE,UAAU,EAAE,WAAW,CAAC,CAAC,CAC/E;EACA,sBAAsB;CACxB;AACF;;AAGA,SAAgB,gBAAgB,OAAc,QAA6B;CACzE,OAAO,aACL,SAAS,GAAG,OAAO,GAAG,MAAM,SAAS,MAAM,MAC3C,MAAM,QAAQ,KAAK,OAAe;EAChC,MAAM,EAAE;EACR,SAAS,EAAE;EACX,UAAU,EAAE;EACZ,aAAa,EAAE;CACjB,EAAE,CACJ;AACF;;AAGA,SAAgB,iBAAiB,QAAkC;CACjE,OAAO,aACL,YAAY,OAAO,QACnB,OAAO,OAAO,KAAK,OAAO;EACxB,MAAM,EAAE;EACR,SAAS,EAAE;EACX,UAAU,EAAE;EACZ,aAAa,EAAE;CACjB,EAAE,CACJ;AACF;;AAGA,SAAgB,SAAS,OAAY,MAAsB;CACzD,IAAI,UAAU,MAAM,OAAO,KAAK,SAAS,cAAc,KAAK,SAAS;CACrE,QAAQ,KAAK,MAAb;EACE,KAAK,YACH,OAAO,SAAS,OAAO,KAAK,EAAE;EAChC,KAAK,WACH,OAAO;EACT,KAAK,UACH,OAAO,OAAO,UAAU;EAC1B,KAAK,UACH,OAAO,OAAO,UAAU,YAAY,OAAO,SAAS,KAAK;EAC3D,KAAK,WACH,OAAO,OAAO,UAAU;EAC1B,KAAK,QACH,OAAO,iBAAiB;EAC1B,KAAK,QACH,OAAO,MAAM,QAAQ,KAAK,KAAM,MAAyB,OAAO,MAAM,SAAS,GAAG,KAAK,EAAE,CAAC;EAC5F,KAAK,SACH,OACE,MAAM,QAAQ,KAAK,KACnB,MAAM,WAAW,KAAK,GAAG,UACzB,KAAK,GAAG,OAAO,GAAG,MAAM,SAAU,MAAyB,IAAW,CAAC,CAAC;EAE5E,KAAK,UACH,OACE,YAAY,KAAK,KACjB,OAAO,QAAQ,KAAK,MAAM,CAAC,CAAC,OAAO,CAAC,GAAG,OAAO,SAAS,MAAM,MAAM,MAAM,CAAC,CAAC;EAE/E,SACE,OAAO;CACX;AACF;;AAWA,SAAgB,YACd,MACA,MAC+C;CAC/C,MAAM,SAAS,OAAO,QAAQ,KAAK,MAAM;CACzC,MAAM,yBAAS,IAAI,IAAkD;CACrE,MAAM,MAAa,CAAC;CACpB,KAAK,MAAM,CAAC,GAAG,QAAQ,KAAK,QAAQ,GAAG;EACrC,MAAM,MAA2B,CAAC;EAClC,KAAK,MAAM,CAAC,MAAM,cAAc,QAAQ;GACtC,MAAM,QAAS,IAAI,SAAS;GAC5B,IAAI,CAAC,SAAS,OAAO,SAAS,GAAG;IAC/B,MAAM,IAAI,OAAO,IAAI,IAAI,KAAK;KAAE,OAAO;KAAG,SAAS,CAAC;IAAE;IACtD,EAAE,SAAS;IACX,IAAI,EAAE,QAAQ,SAAS,GAAG,EAAE,QAAQ,KAAK,CAAC;IAC1C,OAAO,IAAI,MAAM,CAAC;GACpB;GACA,IAAI,QAAQ;EACd;EACA,IAAI,KAAK,GAAG;CACd;CACA,OAAO;EACL,MAAM;EACN,YAAY,CAAC,GAAG,MAAM,CAAC,CAAC,KAAK,CAAC,OAAO,QAAQ;GAC3C;GACA,UAAU,KAAK,KAAK,OAAO,MAAe;GAC1C,GAAG;EACL,EAAE;CACJ;AACF;;;;;;;;;ACtNA,MAAMC,WAAS,EAAE,aAAa;CAC5B,QAAQ,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;CACxB,QAAQ,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;CACxB,QAAQ,EAAE,QAAQ,CAAC,CAAC,SAAS;AAC/B,CAAC;;;;;AAMD,SAAgB,OAAO,QAAoB,MAA2B;CACpE,MAAM,SAAS,EAAE,GAAG,OAAO,KAAK,OAAO;CACvC,MAAM,UAAU,EAAE,GAAG,OAAO,QAAQ;CACpC,KAAK,MAAM,QAAQ,aAAa,IAAI,GAAG;EACrC,OAAO,QAAQ,UAAU,OAAO,KAAc;EAC9C,MAAM,SAAS,QAAQ;EACvB,QAAQ,QAAQ;GAAE,MAAM,OAAO;GAAM,OAAO,OAAO;GAAO,WAAW;EAAM;CAC7E;CACA,OAAO;EAAE,GAAG;EAAQ,MAAM,EAAE,OAAO,MAAM;EAAG;CAAQ;AACtD;;AAGA,SAAgB,SACd,MACA,MACA,MAC4B;CAC5B,MAAM,SAAS,YAAY,MAAM,IAAI;CACrC,IAAI,OAAO,WAAW,WAAW,GAAG,OAAO,GAAG,OAAO,IAAI;CACzD,MAAM,SAAqB,OAAO,WAAW,KAAK,OAAuB;EACvE;EACA,MAAM;EACN,OAAO,EAAE;EACT,SAAS,GAAG,EAAE,MAAM,IAAI,EAAE,MAAM,kBAAkB,EAAE;EACpD,OAAO,EAAE;EACT,SAAS,EAAE;CACb,EAAE;CACF,OAAO,IAAI;EACT,MAAM;EACN,SAAS,GAAG,OAAO,WAAW,OAAO;EACrC;CACF,CAAC;AACH;AAEA,MAAa,aAAa,WAAW;CACnC,IAAI;CACJ,OAAO;CACP,UAAU;CACV,aAAa;CACb,OAAO,CAAC;CACR,QAAQ;CACR,iBAAiB;EAAE,QAAQ;EAAI,QAAQ;CAAG;CAC1C,QAAA;CACA,UAAU,GAAG,QAAQ;EACnB,MAAM,SAAS,IAAI,QAAQ,eAAe,IAAI;EAC9C,IAAI,CAAC,QACH,OAAO,KAAK,iCAAiC,IAAI,GAAG,IAAI,EAAE,MAAM,iBAAiB,CAAC;EAEpF,MAAM,WAAW,iBAAiB,MAAM;EACxC,IAAI,CAAC,SAAS,IAAI,OAAO,KAAK,SAAS,OAAO,EAAE,MAAM,iBAAiB,CAAC;EACxE,MAAM,OAAO,SAAS;EAEtB,IAAI;EACJ,IAAI,EAAE,WAAW,KAAA,GAAW;GAC1B,MAAM,WAAW,iBAAiB,EAAE,QAAQ,IAAI,UAAU,IAAI,CAAC;GAC/D,IAAI,CAAC,SAAS,IACZ,OAAO;IAAE,IAAI;IAAO,OAAO,CAAC,EAAE,SAAS,WAAW,SAAS,QAAQ,CAAC;GAAiB;GACvF,OAAO,SAAS;EAClB;EACA,MAAM,iBAA6B;GAAE;GAAM,SAAS,WAAW,IAAI,IAAI,IAAI;EAAE;EAG7E,OAAO,GAAG;GACR,QAHa,OAAO,OAAO,gBAAgB,EAAE,MAAM,IAAI;GAIvD,MAAM,SAAS,QAAQ;IACrB,MAAM,SAAS,SAAS,IAAI,IAAI,IAAI,SAAS,IAAI,OAAO,CAAC,GAAG,IAAI;IAChE,IAAI,CAAC,OAAO,IAAI,OAAO;IAIvB,OAAO,GAAG,EAAE,MAHW,OACnB,OAAO,MAAM,QAAQ,MAAO,KAAc,MAAM,GAAG,GAAG,CAAC,IACvD,OAAO,MACM,CAAC;GACpB;EACF,CAAC;CACH;AACF,CAAC;AC/FD,MAAa,aAAa,WAAW;CACnC,IAAI;CACJ,OAAO;CACP,UAAU;CACV,aAAa;CACb,OAAO,CAAC;EAAE,IAAI;EAAM,OAAO;EAAM,MAAM,CAAC,IAAI;CAAE,CAAC;CAC/C,QAAQ;CACR,iBAAiB;EAAE,IAAI;EAAI,MAAM,CAAC;CAAE;CACpC,QAVa,EAAE,aAAa;EAAE,IAAI;EAAQ,MAAM,EAAE,QAAQ;CAAE,CAU5D;CACA,UAAU,GAAG,QAAQ;EACnB,MAAM,QAAQ,IAAI,MAAM,EAAE,EAAE;EAC5B,MAAM,OAAO,iBAAiB,EAAE,MAAM,IAAI,UAAU,MAAM,IAAI,CAAC;EAC/D,IAAI,CAAC,KAAK,IAAI,OAAO,KAAK,SAAS,KAAK,OAAO;EAC/C,MAAM,OAAO,KAAK;EAClB,OAAO,GAAG;GACR,QAAQ,OAAO,OAAO,EAAE,IAAI;GAC5B,MAAM,QAAQ,QAAQ,GAAG,EAAE,MAAM,OAAO,EAAE,EAAE,CAAC,CAAC,QAAQ,MAAM,KAAK,MAAM,GAAG,GAAG,CAAC,EAAE,CAAC;EACnF,CAAC;CACH;AACF,CAAC;;;;;;;;;;;;;;;;ACXD,MAAME,WAAS,EAAE,aAAa;CAC5B,MAAM;CACN,OAAO;CACP,IAAI,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;CAClE,MAAM,EAAE,KAAK;EAAC;EAAS;EAAQ;EAAQ;CAAM,CAAC,CAAC,CAAC,SAAS;CACzD,aAAa,EAAE,KAAK;EAAC;EAAO;EAAO;EAAO;CAAK,CAAC;CAChD,QAAQ,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,SAAS;CAChE,OAAO,EAAE,QAAQ,CAAC,CAAC,SAAS;CAC5B,gBAAgB,EAAE,QAAQ,CAAC,CAAC,SAAS;AACvC,CAAC;;AAGD,SAASC,QAAM,MAAgB,MAAyB,QAAiB;CACvE,MAAM,wBAAQ,IAAI,IAAmB;CACrC,KAAK,MAAM,OAAO,MAAM;EACtB,IAAI,KAAK,MAAM,OAAO,IAAI,MAAM,UAAU,IAAI,GAAG;EACjD,MAAM,IAAI,MAAM,KAAK,IAAI;EACzB,MAAM,SAAS,MAAM,IAAI,CAAC;EAC1B,IAAI,CAAC,QAAQ,MAAM,IAAI,GAAG,CAAC,GAAG,CAAC;OAC1B,IAAI,QAAQ,OAAO,EAAE,WAAW,KAAK,KAAK,MAAM,OAAO,IAAI,EAAS,CAAC,EAAE;OACvE,OAAO,KAAK,GAAG;CACtB;CACA,OAAO,EAAE,MAAM;AACjB;AAEA,MAAa,WAAW,WAAW;CACjC,IAAI;CACJ,OAAO;CACP,UAAU;CACV,aAAa;CACb,OAAO,CACL;EAAE,IAAI;EAAQ,OAAO;EAAQ,MAAM,CAAC,MAAM;CAAE,GAC5C;EAAE,IAAI;EAAS,OAAO;EAAS,MAAM,CAAC,OAAO;CAAE,CACjD;CACA,QAAQ;CACR,iBAAiB;EAAE,MAAM;EAAI,OAAO;EAAI,IAAI,CAAC;EAAG,MAAM;EAAS,aAAa;CAAM;CAClF,QAAA;CACA,iBAAiB,MAAM,EAAE,mBAAmB;CAC5C,UAAU,GAAG,QAAQ;EACnB,MAAM,OAAO,IAAI,MAAM,EAAE,IAAI;EAC7B,MAAM,QAAQ,IAAI,MAAM,EAAE,KAAK;EAC/B,MAAM,OAAO,EAAE,QAAQ;EACvB,MAAM,SAAsB,CAAC;EAE7B,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,IAAI;GAC3B,MAAM,KAAK,KAAK,KAAK,OAAO;GAC5B,MAAM,KAAK,MAAM,KAAK,OAAO;GAC7B,IAAI,CAAC,IAAI,OAAO,KAAK,EAAE,SAAS,sBAAsB,GAAG,GAAG,CAAC;GAC7D,IAAI,CAAC,IAAI,OAAO,KAAK,EAAE,SAAS,uBAAuB,GAAG,GAAG,CAAC;GAC9D,IAAI,MAAM,MAAM,CAAC,WAAW,IAAI,EAAE,GAChC,OAAO,KAAK,EAAE,SAAS,YAAY,GAAG,IAAI,KAAK,EAAE,EAAE,MAAM,GAAG,IAAI,KAAK,EAAE,IAAI,CAAC;EAEhF;EACA,IAAI,EAAE,gBAAgB,SAAS,IAAI,QAAQ,UAAU,KAAA,GACnD,OAAO,KAAK;GACV,SAAS;GACT,MAAM;EACR,CAAC;EAIH,MAAM,UAA8B,CAAC;EACrC,IAAI,EAAE,QACJ,KAAK,MAAM,CAAC,MAAM,OAAO,OAAO,QAAQ,EAAE,MAAM,GAC9C,IAAI,OAAO,OAAO,MAAM,KAAK,QAAQ,IAAI,GAAG,QAAQ,KAAK,CAAC,MAAM,EAAE,CAAC;OAC9D,OAAO,KAAK,EAAE,SAAS,+BAA+B,KAAK,GAAG,CAAC;OAEjE;GACL,MAAM,SAAS,IAAI,IAAI,EAAE,GAAG,QAAQ,CAAC,GAAG,OAAO,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;GACvE,KAAK,MAAM,QAAQ,OAAO,KAAK,MAAM,KAAK,MAAM,GAC9C,IAAI,CAAC,OAAO,IAAI,IAAI,GAAG,QAAQ,KAAK,CAAC,MAAM,IAAI,CAAC;EACpD;EACA,MAAM,aAAa,SAAS,WAAW,SAAS,UAAU,EAAE,UAAU,KAAA;EACtE,MAAM,SAAgC,EAAE,GAAG,KAAK,KAAK,OAAO;EAC5D,MAAM,UAAkC,EAAE,GAAG,KAAK,QAAQ;EAC1D,IAAI,YACF,KAAK,MAAM,CAAC,MAAM,OAAO,SAAS;GAChC,IAAI,OAAO,OAAO,QAAQ,EAAE,GAAG;IAC7B,OAAO,KAAK,EAAE,SAAS,UAAU,GAAG,+CAA+C,CAAC;IACpF;GACF;GACA,MAAM,OAAO,MAAM,KAAK,OAAO;GAC/B,OAAO,MAAM,SAAS,SAAS,EAAE,SAAS,IAAI,IAAI;GAClD,QAAQ,MACN,SAAS,SACL;IAAE,MAAM,IAAI;IAAI,OAAO;IAAI,WAAW;GAAM,IAC3C,MAAM,QAAQ;EACvB;EAEF,IAAI;EACJ,IAAI,EAAE,UAAU,KAAA,KAAa,OAAO,WAAW,GAAG;GAChD,MAAM,WAAW,iBAAiB,EAAE,OAAO,IAAI,UAAU,EAAE,OAAO,MAAM,CAAC,CAAC;GAC1E,IAAI,SAAS,IAAI,QAAQ,SAAS;QAC7B,OAAO,KAAK,EAAE,SAAS,UAAU,SAAS,QAAQ,CAAC;EAC1D;EACA,IAAI,OAAO,QAAQ,OAAO;GAAE,IAAI;GAAO,OAAO;EAAO;EAErD,MAAM,WAAW,EAAE,GAAG,KAAK,CAAC,OAAO,CAAC;EACpC,MAAM,YAAY,EAAE,GAAG,KAAK,GAAG,OAAO,CAAC;EACvC,MAAM,aAAa,EAAE,gBAAgB,SAAS,EAAE,gBAAgB;EAChE,MAAM,cAAc,EAAE,gBAAgB,SAAS,EAAE,gBAAgB;EACjE,MAAM,YAAY,OAAO,YAAY,QAAQ,KAAK,GAAG,QAAQ,CAAC,IAAI,IAAI,CAAC,CAAC;EACxE,MAAM,WAAW,MAAgB;GAC/B,MAAM,MAA2B,CAAC;GAClC,KAAK,MAAM,CAAC,MAAM,OAAO,SAAS,IAAI,MAAM,EAAE,SAAS;GACvD,OAAO;EACT;EACA,MAAM,YAAY,MAAwB,QACxC,IAAI;GACF,MAAM;GACN,SAAS,GAAG,EAAE,YAAY,SAAS,KAAK,OAAO,KAAK,UAAU,GAAG,EAAE;GACnE,SAAS,CAAC,GAAG;EACf,CAAC;EAEH,OAAO,GAAG;GACR,QAAQ,SAAS,WAAW,SAAS,SAAS;IAAE,MAAM,EAAE,OAAO,MAAM;IAAG;GAAQ,IAAI;GACpF,MAAM,QAAQ,QAAQ;IACpB,MAAM,QAAQ,OAAO,EAAE,IAAI;IAC3B,MAAM,QAAQA,QAAM,OAAO,EAAE,KAAK,GAAG,WAAW,WAAW;IAC3D,IAAI,MAAM,WAAW,OAAO,SAAS,SAAS,MAAM,SAAS;IAC7D,IAAI,YAAY;KACd,MAAM,UAAUA,QAAM,OAAO,UAAU,IAAI;KAC3C,IAAI,QAAQ,WAAW,OAAO,SAAS,QAAQ,QAAQ,SAAS;IAClE;IACA,MAAM,QAAQ,MAAM;IACpB,MAAM,OAAc,CAAC;IACrB,KAAK,MAAM,KAAK,OAAO;KAErB,MAAM,aADU,SAAS,MAAM,OAAO,EAAE,MAAM,UAAU,IAC/B,IAAI,CAAC,IAAK,MAAM,IAAI,MAAM,GAAG,QAAQ,CAAC,KAAK,CAAC;KACrE,MAAM,UAAiB,CAAC;KACxB,KAAK,MAAM,KAAK,YAAY;MAC1B,MAAM,SAAS;OAAE,GAAG;OAAG,GAAG,QAAQ,CAAC;MAAE;MACrC,IAAI,CAAC,SAAS,MAAM,MAAM,QAAQ,GAAG,GAAG,QAAQ,KAAK,MAAM;KAC7D;KACA,IAAI,SAAS,QACP;UAAA,QAAQ,SAAS,GAAG,KAAK,KAAK,CAAC;KAAA,OAC9B,IAAI,SAAS,QACd;UAAA,QAAQ,WAAW,GAAG,KAAK,KAAK,CAAC;KAAA,OAChC,IAAI,QAAQ,SAAS,GAAG,KAAK,KAAK,GAAG,OAAO;UAC9C,IAAI,SAAS,QAAQ,KAAK,KAAK;MAAE,GAAG;MAAG,GAAG;KAAU,CAAC;IAC5D;IACA,OAAO,GAAG,EAAE,KAAK,CAAC;GACpB;EACF,CAAC;CACH;AACF,CAAC;;;;;AC5JD,MAAa,UAAU,SAAS;CAC9B,MAAM;CACN,QAAQC,UAAO,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;CACxF,OAAO;CACP,OAAO;CACP,UAAU;CACV,YAAY,QAAQ,GAAG,QAA+B;EACpD,IAAI,OAAO,EAAE,SAAS,UAAU,OAAO,UAAU,IAAI,QAAQ,EAAE,IAAI;EACnE,MAAM,QAAiB,CAAC;EACxB,KAAK,MAAM,QAAQ,EAAE,MAAM;GACzB,MAAM,OAAO,UAAU,IAAI,QAAQ,IAAI;GACvC,IAAI,CAAC,KAAK,IAAI,OAAO;GACrB,MAAM,KAAK,KAAK,KAAK;EACvB;EACA,OAAO,GAAG,EAAE,MAAM,KAAK,CAAC;CAC1B;CACA,MAAM,MAAM;EACV,IAAI,OAAO,EAAE,SAAS,UAAU;GAC9B,MAAM,OAAO,EAAE;GACf,QAAQ,QAAQ,QAAQ,GAAG,IAAI,OAAO,SAAS,IAAI;EACrD;EACA,MAAM,QAAQ,EAAE;EAChB,QAAQ,QAAQ,QAAQ,GAAG,MAAM,KAAK,MAAM,IAAI,OAAO,MAAM,IAAI,CAAC;CACpE;AACF,CAAC;;AAGD,MAAa,WAAW,SAAS;CAC/B,MAAM;CACN,QAAQA,UAAO,EAAE,OAAO,KAAK,CAAC;CAC9B,OAAO;CACP,OAAO;CACP,UAAU;CACV,YAAY,QAAQ,MAAM,GAAG,WAAW,EAAE,KAAK,CAAC;CAChD,MAAM,MAAM;EACV,MAAM,QAAQ,EAAE;EAChB,aAAa,GAAG,KAAK;CACvB;AACF,CAAC;;AAGD,MAAa,WAAW,SAAS;CAC/B,MAAM;CACN,QAAQA,UAAO,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;CAC3D,OAAO;CACP,OAAO;CACP,UAAU;CACV,YAAY,QAAQ,GAAG,QAA+B;EACpD,MAAM,QAAiB,CAAC;EACxB,KAAK,MAAM,QAAQ,EAAE,OAAO;GAC1B,MAAM,OAAO,UAAU,IAAI,QAAQ,IAAI;GACvC,IAAI,CAAC,KAAK,IAAI,OAAO;GACrB,MAAM,KAAK,KAAK,KAAK;EACvB;EACA,MAAM,SAAS,SAAS,KAAK;EAC7B,IAAI,CAAC,OAAO,IAAI,OAAO;EACvB,OAAO,GAAG,MAAM,MAAM,UAAU,IAAI,OAAO,QAAQ,UAAU,OAAO,KAAK,CAAC;CAC5E;CACA,MAAM,MAAM;EACV,MAAM,QAAQ,EAAE;EAChB,QAAQ,QAAQ,QAAQ;GACtB,KAAK,MAAM,QAAQ,OAAO;IACxB,MAAM,IAAI,IAAI,OAAO,SAAS;IAC9B,IAAI,MAAM,MAAM,OAAO,GAAG,CAAC;GAC7B;GACA,OAAO,GAAG,IAAI;EAChB;CACF;AACF,CAAC;;;;AC7DD,MAAM,SAAS;AAEf,MAAM,kBAAkB,EAAE,OAAO,CAAC,CAAC,aAAa,GAAG,QAAQ;CACzD,MAAM,IAAI,gBAAgB,CAAC;CAC3B,IAAI,CAAC,EAAE,IAAI,IAAI,SAAS;EAAE,MAAM;EAAU,SAAS,EAAE;CAAM,CAAC;AAC9D,CAAC;AAED,MAAM,WAAW,EAAE,OAAO,CAAC,CAAC,OAAO,YAAY,mBAAmB;;AAGlE,MAAa,WAAW,SAAS;CAC/B,MAAM;CACN,QAAQC,UAAO,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC,SAAS,EAAE,CAAC;CACjD,OAAO;CACP,WAAW,MAAM,EAAE,WAAW;CAC9B,YAAY,OAAO,MAAM;EACvB,MAAM,IAAI,WAAW,OAAO,CAAC,UAAU,SAAS,GAAG,WAAW;EAC9D,IAAI,CAAC,EAAE,IAAI,OAAO;EAClB,OAAO,GAAG,MAAM,SAAS,aAAa,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM,CAAC;CAClF;CACA,MAAM,OAAO,UAAU;EACrB,IAAI,OAAO,UAAU,WAAW,OAAO,GAAG,QAAQ,IAAI,CAAC;EACvD,MAAM,OAAQ,MAAiB,KAAK;EACpC,IAAI,OAAO,KAAK,IAAI,GAAG,OAAO,GAAG,OAAO,IAAI,CAAC;EAC7C,OAAO,EAAE,SAAS,UAAU,gBAAgB,IAAI,MAAgB,kBAAkB,IAAI,GAAG,IAAI;CAC/F;AACF,CAAC;;AAGD,MAAa,WAAW,SAAS;CAC/B,MAAM;CACN,QAAQA,UAAO,EAAE,QAAQ,gBAAgB,SAAS,EAAE,CAAC;CACrD,OAAO;CACP,UAAU;CACV,YAAY,OAAO,MAAM;EACvB,IAAI,MAAM,SAAS,WAAW,OAAO,IAAI,oCAAoC;EAC7E,IAAI,EAAE,WAAW,KAAA,KAAa,MAAM,SAAS,QAC3C,OAAO,IAAI,wCAAwC;EAErD,OAAO,GAAG,EAAE,MAAM;CACpB;CACA,MAAM,GAAG,MAAM,UAAU;EACvB,IAAI,MAAM,SAAS,QAAQ;GACzB,MAAM,SAAS,WAAW,EAAE,UAAU,KAAK;GAC3C,QAAQ,GAAG,QAAQ,GAAG,WAAW,GAAc,QAAQ,IAAI,EAAE,CAAC;EAChE;EACA,QAAQ,MAAM,GAAG,UAAU,CAAC,CAAC;CAC/B;AACF,CAAC;AAED,SAAS,UAAU,GAAgB;CACjC,IAAI,OAAO,MAAM,UAAU,OAAO;CAClC,IAAI,OAAO,MAAM,YAAY,OAAO,MAAM,WAAW,OAAO,OAAO,CAAC;CACpE,OAAO,KAAK,UAAU,OAAO,CAAC,CAAC;AACjC;AAEA,MAAM,cAAc,CAAC,QAAQ,GAAG;AAChC,MAAM,eAAe,CAAC,SAAS,GAAG;;AAGlC,MAAa,SAAS,SAAS;CAC7B,MAAM;CACN,QAAQA,UAAO;EACb,aAAa,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS;EACjD,cAAc,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS;CACpD,CAAC,CAAC,CAAC,QACA,MACC,EAAE,EAAE,eAAe,YAAA,CAAa,MAAM,OAAO,EAAE,gBAAgB,aAAA,CAAc,SAAS,CAAC,CAAC,GAC1F,sCACF;CACA,OAAO;CACP,gBAAgB;CAChB,YAAY,UAAU;EACpB,MAAM,IAAI,WAAW,OAAO,CAAC,UAAU,QAAQ,GAAG,SAAS;EAC3D,OAAO,EAAE,KAAK,GAAG,EAAE,OAAO,IAAI;CAChC;CACA,MAAM,MAAM;EACV,MAAM,MAAM,IAAI,IAAI,EAAE,eAAe,WAAW;EAChD,MAAM,KAAK,IAAI,IAAI,EAAE,gBAAgB,YAAY;EACjD,QAAQ,UAAU;GAChB,MAAM,OAAO,OAAO,UAAU,WAAW,OAAO,KAAK,IAAK,MAAiB,KAAK;GAChF,IAAI,IAAI,IAAI,IAAI,GAAG,OAAO,GAAG,IAAI;GACjC,IAAI,GAAG,IAAI,IAAI,GAAG,OAAO,GAAG,KAAK;GACjC,OAAO,UAAU,gBAAgB,IAAI,KAAK,gCAAgC;EAC5E;CACF;AACF,CAAC;;;;;AAMD,MAAa,SAAS,SAAS;CAC7B,MAAM;CACN,QAAQA,UAAO;EAAE,QAAQ;EAAiB,IAAI,SAAS,SAAS;CAAE,CAAC,CAAC,CAAC,QAAQ,MAAM;EACjF,MAAM,SAAS,gBAAgB,EAAE,MAAM;EACvC,OAAO,CAAC,OAAO,MAAM,YAAY,OAAO,KAAK;CAC/C,GAAG,sCAAsC;CACzC,OAAO;CACP,gBAAgB;CAChB,YAAY,OAAO,MAAM;EAEvB,MAAM,IAAI,WAAW,OADP,WAAW,EAAE,MAAM,CAAC,CAAC,SAAS,UACR,CAAC,UAAU,QAAQ,IAAI,CAAC,QAAQ,GAAG,SAAS;EAChF,OAAO,EAAE,KAAK,GAAG,EAAE,IAAI,IAAI;CAC7B;CACA,MAAM,MAAM;EACV,MAAM,SAAS,WAAW,EAAE,MAAM;EAClC,QAAQ,OAAO,QAAQ;GACrB,MAAM,UAAU,eAAe,OAA0B,QAAQ,EAAE,MAAM,IAAI,EAAE;GAC/E,OAAO,UACH,GAAG,OAAO,IACV,UACE,gBACA,IAAI,OAAO,KAAwB,EAAE,+BAA+B,EAAE,QACxE;EACN;CACF;AACF,CAAC;;AAGD,MAAa,aAAa,SAAS;CACjC,MAAM;CACN,QAAQA,UAAO,EACb,MAAM,EAAE,OAAO,CAAC,CAAC,aAAa,GAAG,QAAQ;EACvC,MAAM,SAAS,cAAc,CAAC;EAC9B,IAAI,CAAC,OAAO,IAAI,IAAI,SAAS;GAAE,MAAM;GAAU,SAAS,OAAO;EAAM,CAAC;CACxE,CAAC,EACH,CAAC;CACD,OAAO;CACP,UAAU;CACV,YAAY,OAAO,MAAM;EACvB,MAAM,WAAW,SAAS,EAAE,IAAI;EAChC,OAAO,WAAW,OAAO,QAAQ,IAC7B,GAAG,QAAQ,IACX,IAAI,YAAY,EAAE,KAAK,QAAQ,KAAK,KAAK,GAAG;CAClD;CACA,YAAY,UAAU,GAAG,KAAK;AAChC,CAAC;;;;;;;ACrID,MAAM,UACH,IAAY,MAAa,EAAE,UAC3B,UAAiB;CAChB,MAAM,IAAI,WAAW,OAAO,CAAC,MAAM,GAAG,EAAE;CACxC,OAAO,EAAE,KAAK,GAAG,GAAG,IAAI;AAC1B;AAEF,MAAa,eAAe,SAAS;CACnC,MAAM;CACN,QAAQC,UAAO;EACb,QAAQ,EAAE,OAAO,CAAC,CAAC,aAAa,GAAG,QAAQ;GACzC,MAAM,IAAI,gBAAgB,CAAC;GAC3B,IAAI,CAAC,EAAE,IAAI,IAAI,SAAS;IAAE,MAAM;IAAU,SAAS,EAAE;GAAM,CAAC;EAC9D,CAAC;EACD,IAAI,EAAE,OAAO,CAAC,CAAC,OAAO,YAAY,mBAAmB,CAAC,CAAC,SAAS;CAClE,CAAC;CACD,OAAO;CACP,UAAU;CACV,WAAW,OAAO,eAAe,EAAE,MAAM;CACzC,MAAM,MAAM;EACV,MAAM,SAAS,WAAW,EAAE,MAAM;EAClC,QAAQ,OAAO,QAAQ,GAAG,WAAW,OAAkB,QAAQ,EAAE,MAAM,IAAI,EAAE,CAAC;CAChF;AACF,CAAC;;AAGD,MAAa,YAAY,SAAS;CAChC,MAAM;CACN,QAAQA,UAAO,EACb,IAAI,EAAE,OAAO,CAAC,CAAC,aAAa,GAAG,QAAQ;EACrC,MAAM,IAAI,cAAc,CAAC;EACzB,IAAI,CAAC,EAAE,IAAI,IAAI,SAAS;GAAE,MAAM;GAAU,SAAS,EAAE;EAAM,CAAC;CAC9D,CAAC,EACH,CAAC;CACD,OAAO;CACP,UAAU;CACV,WAAW,OAAO,YAAY;CAC9B,MAAM,MAAM;EACV,MAAM,KAAK,SAAS,EAAE,EAAE;EACxB,QAAQ,OAAO,QAAQ,GAAG,MAAM,OAAkB,IAAI,IAAI,EAAE,CAAC;CAC/D;AACF,CAAC;AAED,MAAa,eAAe,SAAS;CACnC,MAAM;CACN,QAAQA,UAAO,EAAE,MAAM,EAAE,KAAK;EAAC;EAAO;EAAS;CAAM,CAAC,EAAE,CAAC;CACzD,OAAO;CACP,UAAU;CACV,WAAW,OAAO,eAAe;CACjC,MAAM,OAAO,OAAO,QAAQ,GAAG,SAAS,OAAkB,EAAE,MAAM,IAAI,EAAE,CAAC;AAC3E,CAAC;;AAGD,MAAa,QAAQ,SAAS;CAC5B,MAAM;CACN,QAAQA,UAAO,CAAC,CAAC;CACjB,OAAO;CACP,UAAU;CACV,WAAW,OAAO,QAAQ;CAC1B,YAAY,UAAU,GAAG,KAAK;AAChC,CAAC;;;;;;;ACtED,MAAa,KAAK,SAAS;CACzB,MAAM;CACN,QAAQC,UAAO,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;CACzC,OAAO;CACP,WAAW,GAAG,QAAQ,IAAI,UAAU,EAAE,IAAI,EAAE,YAAY;CACxD,YAAY,OAAO,GAAG,QAAQ;EAC5B,MAAM,MAAM,OAAO,OAAO,IAAI,WAAW,EAAE,GAAG,IAAI,IAAI,UAAU,EAAE,OAAO,KAAA;EACzE,IAAI,CAAC,KAAK,OAAO,IAAI,qBAAqB,EAAE,IAAI,EAAE;EAClD,IAAI,IAAI,SAAS,CAAC,WAAW,OAAO,IAAI,KAAK,GAC3C,OAAO,IAAI,aAAa,EAAE,IAAI,UAAU,KAAK,IAAI,KAAK,EAAE,QAAQ,KAAK,KAAK,GAAG;EAE/E,OAAO,GAAG,IAAI,MAAM;CACtB;CACA,MAAM,GAAG,QAAQ;EACf,MAAM,MAAM,IAAI,UAAU,EAAE;EAC5B,QAAQ,OAAO,QAAQ,IAAI,IAAI,OAAO,GAAG;CAC3C;AACF,CAAC;;;;;;;;ACdD,MAAM,UAAU,OAAc,OAC5B,MAAM,SAAS,SAAS,GAAG,MAAM,EAAE,IAAI,IAAI,GAAG,GAAG,uBAAuB,KAAK,KAAK,GAAG;;AAGvF,MAAa,OAAO,SAAS;CAC3B,MAAM;CACN,QAAQC,UAAO,EAAE,UAAU,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;CACxD,OAAO;CACP,WAAW,GAAG,KAAK,UACjB,SAAS,aAAa,EAAE,UAAU;EAAE,GAAG;EAAK,OAAO,IAAI,QAAQ;CAAE,GAAI,MAAmB,EAAE,CAAC,CAAC,CACzF;CACL,YAAY,OAAO,GAAG,QAAQ;EAC5B,IAAI,IAAI,SAAS,GAAG,OAAO,IAAI,mCAAmC;EAClE,MAAM,UAAU,OAAO,OAAO,MAAM;EACpC,IAAI,CAAC,QAAQ,IAAI,OAAO;EACxB,MAAM,SAAS,aAAa,EAAE,UAAU;GAAE,GAAG;GAAK,OAAO,IAAI,QAAQ;EAAE,GAAG,QAAQ,KAAK;EACvF,IAAI,CAAC,OAAO,IAAI,OAAO,IAAI,aAAa,OAAO,MAAM,KAAK,IAAI,OAAO,MAAM,SAAS;EACpF,IAAI,OAAO,MAAM,WAAW,OAAO,IAAI,iCAAiC;EACxE,OAAO,GAAG,EAAE,KAAK,OAAO,MAAM,IAAI,CAAC;CACrC;CACA,MAAM,GAAG,KAAK,UAAU;EACtB,MAAM,EAAE,QAAQ,SACd,aAAa,EAAE,UAAU;GAAE,GAAG;GAAK,OAAO,IAAI,QAAQ;EAAE,GAAI,MAAmB,EAAE,CACnF;EACA,QAAQ,MAAM,QAAQ;GACpB,MAAM,MAAa,CAAC;GACpB,KAAK,MAAM,CAAC,GAAG,YAAa,KAAwB,QAAQ,GAAG;IAC7D,MAAM,IAAI,IAAI,SAAS,GAAG;IAC1B,IAAI,CAAC,EAAE,IACL,OAAO,IAAI;KACT,MAAM,EAAE,MAAM;KACd,QAAQ,WAAW,EAAE,IAAI,EAAE,MAAM,GAAG,IAAI,EAAE,MAAM;IAClD,CAAC;IACH,IAAI,KAAK,EAAE,KAAY;GACzB;GACA,OAAO,GAAG,GAAG;EACf;CACF;AACF,CAAC;AAED,MAAa,aAAa,SAAS;CACjC,MAAM;CACN,QAAQA,UAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC;CACpC,OAAO;CACP,UAAU;CACV,YAAY,OAAO,GAAG,QAAQ;EAC5B,MAAM,UAAU,OAAO,OAAO,aAAa;EAC3C,IAAI,CAAC,QAAQ,IAAI,OAAO;EACxB,MAAM,OAAO,iBAAiB,EAAE,MAAM,KAAK,QAAQ,KAAK;EACxD,OAAO,KAAK,KAAK,GAAG,KAAK,IAAI;CAC/B;CACA,MAAM,GAAG,KAAK,UAAU;EACtB,MAAM,OAAO,SAAS,iBAAiB,EAAE,MAAM,KAAM,MAAmB,EAAE,CAAC;EAC3E,QAAQ,MAAM,QAAQ,GAAI,KAAwB,QAAQ,MAAM,KAAK,GAAG,IAAI,QAAQ,GAAG,CAAC,CAAC;CAC3F;AACF,CAAC;AAED,MAAM,QAAQ,MAAc,OAC1B,SAAS;CACP;CACA,QAAQA,UAAO,CAAC,CAAC;CACjB,OAAO;CACP,UAAU;CACV,YAAY,UAAU;EACpB,MAAM,UAAU,OAAO,OAAO,IAAI;EAClC,OAAO,QAAQ,KAAK,GAAG,EAAE,SAAS,QAAQ,KAAK,CAAC,IAAI;CACtD;CACA,YAAY,SAAS,GAAI,KAAwB,GAAI,KAAwB,MAAM,MAAM,IAAI;AAC/F,CAAC;AAEH,MAAa,QAAQ,KAAK,eAAe,CAAC;AAC1C,MAAa,OAAO,KAAK,SAAS,MAAM,IAAI,CAAC;;AAG7C,MAAa,QAAQ,SAAS;CAC5B,MAAM;CACN,QAAQA,UAAO,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC;CACvC,OAAO;CACP,UAAU;CACV,YAAY,UAAU;EACpB,MAAM,UAAU,OAAO,OAAO,OAAO;EACrC,OAAO,QAAQ,KAAK,GAAG,EAAE,SAAS,QAAQ,KAAK,CAAC,IAAI;CACtD;CACA,MAAM,OAAO,SAAS,GAAI,KAAwB,GAAG,EAAE,EAAE,KAAK,IAAI;AACpE,CAAC;;AAGD,MAAa,MAAM,SAAS;CAC1B,MAAM;CACN,QAAQA,UAAO,CAAC,CAAC;CACjB,OAAO;CACP,UAAU;CACV,YAAY,UACV,MAAM,SAAS,UAAU,MAAM,SAAS,WACpC,GAAG,EAAE,MAAM,IACX,IAAI,qCAAqC,KAAK,KAAK,GAAG;CAC5D,YAAY,MAAM,GAAG,OAAO,MAAM,WAAW,MAAM,KAAK,CAAC,CAAC,CAAC,SAAU,EAAqB,MAAM;AAClG,CAAC;;AAGD,MAAa,SAAS,SAAS;CAC7B,MAAM;CACN,QAAQA,UAAO,CAAC,CAAC;CACjB,OAAO;CACP,UAAU;CACV,YAAY,UAAU;EACpB,MAAM,UAAU,OAAO,OAAO,QAAQ;EACtC,OAAO,QAAQ,KAAK,GAAG,KAAK,IAAI;CAClC;CACA,YAAY,SAAS;EACnB,MAAM,uBAAO,IAAI,IAAY;EAC7B,OAAO,GACJ,KAAwB,QAAQ,MAAM;GACrC,MAAM,IAAI,aAAa,CAAC;GACxB,IAAI,KAAK,IAAI,CAAC,GAAG,OAAO;GACxB,KAAK,IAAI,CAAC;GACV,OAAO;EACT,CAAC,CACH;CACF;AACF,CAAC;;AAGD,MAAa,MAAM,SAAS;CAC1B,MAAM;CACN,QAAQA,UAAO,CAAC,CAAC;CACjB,OAAO;CACP,UAAU;CACV,YAAY,UAAU;EACpB,MAAM,UAAU,OAAO,OAAO,KAAK;EACnC,IAAI,CAAC,QAAQ,IAAI,OAAO;EACxB,OAAO,UAAU,QAAQ,KAAK,CAAC,CAAC,SAAS,WACrC,GAAG,EAAE,SAAS,EAAE,MAAM,CAAC,IACvB,IAAI,iCAAiC,KAAK,KAAK,GAAG;CACxD;CAEA,YAAY,SAAS;EACnB,MAAM,UAAW,KACd,QAAQ,MAAmB,MAAM,IAAI,CAAC,CACtC,MAAM,GAAG,MAAM,IAAI,CAAC;EACvB,OAAO,GAAG,QAAQ,WAAW,IAAI,OAAO,QAAQ,QAAQ,GAAG,MAAM,IAAI,GAAG,CAAC,CAAC;CAC5E;AACF,CAAC;AAED,MAAM,WAAW,SACf,SAAS;CACP;CACA,QAAQA,UAAO,CAAC,CAAC;CACjB,OAAO;CACP,UAAU;CACV,YAAY,UAAU;EACpB,MAAM,UAAU,OAAO,OAAO,IAAI;EAClC,IAAI,CAAC,QAAQ,IAAI,OAAO;EACxB,OAAO,UAAU,QAAQ,KAAK,IAC1B,GAAG,EAAE,SAAS,UAAU,QAAQ,KAAK,CAAC,CAAC,IACvC,IAAI,GAAG,KAAK,oDAAoD,KAAK,KAAK,GAAG;CACnF;CACA,YAAY,SAAS;EACnB,IAAI,OAAY;EAChB,KAAK,MAAM,KAAK,MAAwB;GACtC,IAAI,MAAM,MAAM;GAChB,IAAI,SAAS,SAAS,SAAS,QAAQ,YAAY,GAAG,IAAI,IAAI,IAAI,YAAY,GAAG,IAAI,IAAI,IACvF,OAAO;EACX;EACA,OAAO,GAAG,IAAI;CAChB;AACF,CAAC;AAEH,MAAa,MAAM,QAAQ,KAAK;AAChC,MAAa,MAAM,QAAQ,KAAK;;AAGhC,MAAa,WAAW,SAAS;CAC/B,MAAM;CACN,QAAQA,UAAO,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC,QAAQ,MAAM,MAAM,KAAA,GAAW,wBAAwB,EAAE,CAAC;CAC9F,OAAO;CACP,UAAU;CACV,YAAY,OAAO,GAAG,QAAQ;EAC5B,MAAM,UAAU,OAAO,OAAO,UAAU;EACxC,IAAI,CAAC,QAAQ,IAAI,OAAO;EACxB,MAAM,UAAU,eAAe,EAAE,OAAO,KAAK,UAAU,QAAQ,KAAK,CAAC,CAAC,SAAS,MAAM;EACrF,IAAI,CAAC,QAAQ,IAAI,OAAO;EACxB,OAAO,WAAW,QAAQ,OAAO,QAAQ,MAAM,IAAI,IAC/C,GAAG,EAAE,OAAO,IACZ,IAAI,mBAAmB,KAAK,QAAQ,MAAM,IAAI,EAAE,MAAM,KAAK,KAAK,GAAG;CACzE;CACA,MAAM,GAAG,KAAK,UAAU;EACtB,MAAM,UAAW,MAAmB;EACpC,MAAM,EAAE,QAAQ,SAAS,eAAe,EAAE,OAAO,KAAK,UAAU,OAAO,CAAC,CAAC,SAAS,MAAM,CAAC;EACzF,QAAQ,MAAM,QAAQ;GACpB,MAAM,IAAI,IAAI,MAAM,IAAI,QAAQ,GAAG;GACnC,OAAO,GACL,MAAM,QAAS,KAAwB,MAAM,MAAM,MAAM,QAAQ,YAAY,GAAG,CAAC,MAAM,CAAC,CAC1F;EACF;CACF;AACF,CAAC;;;;AC1MD,MAAMC,2BAAS,IAAI,IAAI;CAAC;CAAU;CAAU;AAAS,CAAC;;;;;AAMtD,MAAa,SAAS,SAAS;CAC7B,MAAM;CACN,QAAQC,UAAO;EACb,OAAO,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;EACvB,SAAS,EAAE,KAAK;GAAC;GAAQ;GAAQ;EAAO,CAAC,CAAC,CAAC,SAAS;CACtD,CAAC;CACD,OAAO;CACP,WAAW,MAAM,EAAE,YAAY;CAC/B,YAAY,OAAO,GAAG,QAAQ;EAC5B,IAAI,CAACD,SAAO,IAAI,MAAM,IAAI,GACxB,OAAO,IAAI,mDAAmD,KAAK,KAAK,GAAG;EAC7E,IAAI,CAAC,OAAO,OAAO,IAAI,QAAQ,EAAE,KAAK,GAAG,OAAO,IAAI,yBAAyB,EAAE,MAAM,EAAE;EAEvF,MAAM,QAAQ,SADC,OAAO,OAAO,IAAI,OAAO,EAAE,MACnB,CAAA,CAAO,IAAI,UAAU,CAAC;EAC7C,IAAI,CAAC,MAAM,IAAI,OAAO,IAAI,iBAAiB,EAAE,MAAM,uBAAuB,MAAM,OAAO;EACvF,QAAQ,EAAE,WAAW,QAArB;GACE,KAAK,QACH,OAAO,GAAG,EAAE,SAAS,MAAM,KAAK,CAAC;GACnC,KAAK,SACH,OAAO,GAAG,MAAM,KAAK;GACvB;IACE,IAAI,CAAC,WAAW,OAAO,MAAM,KAAK,GAChC,OAAO,IACL,2BAA2B,KAAK,KAAK,EAAE,yBAAyB,KAAK,MAAM,KAAK,GAClF;IAEF,OAAO,GAAG,SAAS,MAAM,OAAO,MAAM,KAAK,CAAC,CAAC;EAEjD;CACF;CACA,MAAM,GAAG,QAAQ;EACf,MAAM,QAAQ,IAAI,OAAO,EAAE;EAC3B,MAAM,OAAO,EAAE,WAAW;EAC1B,QAAQ,UAAU;GAChB,MAAM,MAAM,OAAO,KAAkC;GACrD,IAAI,OAAO,OAAO,OAAO,GAAG,GAAG,OAAO,GAAG,MAAM,IAAW;GAC1D,IAAI,SAAS,SAAS,OAAO,UAAU,eAAe,IAAI,IAAI,qBAAqB,EAAE,MAAM,EAAE;GAC7F,OAAO,GAAG,SAAS,SAAS,QAAQ,IAAI;EAC1C;CACF;AACF,CAAC;;;;;AC7CD,MAAa,cAAc,SAAS;CAClC,MAAM;CACN,QAAQE,UAAO,CAAC,CAAC;CACjB,OAAO;CACP,UAAU;CACV,YAAY,UAAU;EACpB,MAAM,IAAI,WAAW,OAAO,CAAC,QAAQ,GAAG,eAAe;EACvD,OAAO,EAAE,KAAK,GAAG,EAAE,SAAS,EAAE,MAAM,CAAC,IAAI;CAC3C;CACA,YAAY,UAAU,GAAI,MAAiB,KAAK,MAAM,KAAK,OAAO,KAAK;AACzE,CAAC;;AAGD,MAAa,YAAY,SAAS;CAChC,MAAM;CACN,QAAQA,UAAO,EAAE,OAAO,KAAK,CAAC;CAC9B,OAAO;CACP,UAAU;CACV,YAAY,OAAO,MAAM;EACvB,IAAI,EAAE,UAAU,MAAM,OAAO,IAAI,gCAAgC;EACjE,MAAM,OAAO,UAAU,KAAK;EAC5B,MAAM,UAAU,WAAW,EAAE,KAAK;EAClC,IAAI,KAAK,SAAS,WAAW,OAAO,GAAG,OAAO;EAC9C,OAAO,WAAW,SAAS,IAAI,IAC3B,GAAG,IAAI,IACP,IAAI,oBAAoB,KAAK,OAAO,EAAE,aAAa,KAAK,KAAK,GAAG;CACtE;CACA,MAAM,MAAM;EACV,MAAM,QAAQ,EAAE;EAChB,QAAQ,UAAU,GAAG,SAAS,KAAK;CACrC;AACF,CAAC;;AAGD,MAAa,YAAY,SAAS;CAChC,MAAM;CACN,QAAQA,UAAO,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC,SAAS,EAAE,CAAC;CACjD,OAAO;CACP,UAAU;CACV,YAAY,UAAU,GAAG,UAAU,KAAK,CAAC;CACzC,MAAM,MAAM;EACV,MAAM,UAAU,EAAE,WAAW;EAC7B,QAAQ,UAAW,UAAU,OAAO,UAAU,iBAAiB,OAAO,IAAI,GAAG,KAAK;CACpF;AACF,CAAC;;;;;AAMD,MAAa,aAAa,SAAS;CACjC,MAAM;CACN,QAAQA,UAAO,CAAC,CAAC;CACjB,OAAO;CACP,UAAU;CACV,UAAU;CACV,YAAY,UAAU,GAAG,EAAE,SAAS,UAAU,KAAK,CAAC,CAAC;CACrD,YAAY,UAAU,GAAG,UAAU,OAAO,OAAO,KAAK;AACxD,CAAC;;;AC3DD,MAAM,QACJ;CAEE,IAAI;EAAE,WAAW;EAAQ,QAAQ;CAAM;CACvC,GAAG;EAAE,WAAW;EAAQ,QAAQ;CAAE;CAClC,IAAI;EAAE,WAAW;EAAQ,QAAQ;CAAK;CACtC,GAAG;EAAE,WAAW;EAAQ,QAAQ;CAAU;CAC1C,IAAI;EAAE,WAAW;EAAQ,QAAQ;CAAa;CAC9C,IAAI;EAAE,WAAW;EAAQ,QAAQ;CAAU;CAE3C,IAAI;EAAE,WAAW;EAAU,QAAQ;CAAM;CACzC,IAAI;EAAE,WAAW;EAAU,QAAQ;CAAK;CACxC,GAAG;EAAE,WAAW;EAAU,QAAQ;CAAE;CACpC,IAAI;EAAE,WAAW;EAAU,QAAQ;CAAK;CACxC,IAAI;EAAE,WAAW;EAAU,QAAQ;CAAO;CAC1C,IAAI;EAAE,WAAW;EAAU,QAAQ;CAAO;CAE1C,IAAI;EAAE,WAAW;EAAU,QAAQ;CAAM;CACzC,GAAG;EAAE,WAAW;EAAU,QAAQ;CAAE;CACpC,IAAI;EAAE,WAAW;EAAU,QAAQ;CAAK;AAC1C;AAEF,MAAM,QAAQ,SAAiB,MAAM,KAAK,KAAK,CAAC,CAAC,YAAY;AAE7D,SAAgB,OAAO,MAAuB;CAC5C,OAAO,KAAK,IAAI,MAAM,KAAA;AACxB;;AAGA,SAAgB,iBAAiB,MAAc,IAAgC;CAC7E,MAAM,IAAI,KAAK,IAAI;CACnB,MAAM,IAAI,KAAK,EAAE;CACjB,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,cAAc,EAAE,WAAW,OAAO,KAAA;CAEpD,OAAO,EAAE,SAAS,EAAE;AACtB;;;;AClCA,MAAM,SAAS,EAAE,OAAO;AAExB,MAAM,YAAY,QAAgB,UAAiB;CACjD,MAAM,IAAI,WAAW,OAAO,CAAC,QAAQ,GAAG,EAAE;CAC1C,OAAO,EAAE,KAAK,GAAG,EAAE,MAAM,IAAI;AAC/B;AAEA,MAAM,cACJ,MACA,KACA,UAEA,SAAS;CACP;CACA,QAAQC,UAAO,GAAG,MAAM,OAAO,CAAgC;CAC/D,OAAO;CACP,UAAU;CACV,WAAW,SAAS,IAAI;CACxB,MAAM,MAAM;EACV,MAAM,UAAW,EAAwB;EACzC,QAAQ,UAAU,GAAG,MAAM,OAAiB,OAAO,CAAC;CACtD;AACF,CAAC;AAEH,MAAa,MAAM,WAAW,OAAO,UAAU,GAAG,MAAM,IAAI,CAAC;AAC7D,MAAa,WAAW,WAAW,YAAY,UAAU,GAAG,MAAM,IAAI,CAAC;AACvE,MAAa,WAAW,WAAW,YAAY,OAAO,GAAG,MAAM,IAAI,CAAC;;AAGpE,MAAa,SAAS,SAAS;CAC7B,MAAM;CACN,QAAQA,UAAO,EAAE,IAAI,OAAO,QAAQ,MAAM,MAAM,GAAG,gBAAgB,EAAE,CAAC;CACtE,OAAO;CACP,UAAU;CACV,WAAW,SAAS,QAAQ;CAC5B,MAAM,OAAO,UAAU,GAAI,QAAmB,EAAE,EAAE;AACpD,CAAC;;AAGD,SAAS,aAAa,GAAW,QAAwB;CACvD,MAAM,CAAC,UAAU,WAAW,OAAO,OAAO,CAAC,CAAC,CAAC,MAAM,GAAG;CACtD,OAAO,OAAO,GAAG,SAAS,GAAG,OAAO,QAAQ,IAAI,QAAQ;AAC1D;AAIA,SAAS,YAAY,GAAW,MAAyB;CACvD,QAAQ,MAAR;EACE,KAAK,SACH,OAAO,KAAK,MAAM,CAAC;EACrB,KAAK,QACH,OAAO,KAAK,KAAK,CAAC;EACpB,KAAK,WACH,OAAO,KAAK,KAAK,CAAC,IAAI,KAAK,MAAM,KAAK,IAAI,CAAC,CAAC;EAC9C,KAAK,aAAa;GAChB,MAAM,IAAI,KAAK,IAAI,CAAC;GACpB,MAAM,QAAQ,KAAK,MAAM,CAAC;GAC1B,MAAM,OAAO,IAAI;GACjB,MAAM,IAAI,OAAO,MAAQ,SAAS,MAAO,QAAQ,MAAM,IAAK,QAAQ,IAAI;GACxE,OAAO,KAAK,KAAK,CAAC,IAAI;EACxB;CACF;AACF;;AAGA,MAAa,QAAQ,SAAS;CAC5B,MAAM;CACN,QAAQA,UAAO;EACb,WAAW,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,SAAS;EACpD,MAAM,EAAE,KAAK;GAAC;GAAW;GAAa;GAAS;EAAM,CAAC,CAAC,CAAC,SAAS;CACnE,CAAC;CACD,OAAO;CACP,UAAU;CACV,WAAW,SAAS,OAAO;CAC3B,MAAM,MAAM;EACV,MAAM,YAAY,EAAE,aAAa;EACjC,MAAM,OAAO,EAAE,QAAQ;EAEvB,QAAQ,UACN,GAAG,aAAa,YAAY,aAAa,OAAiB,SAAS,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC;CAC5F;AACF,CAAC;AAED,MAAa,MAAM,SAAS;CAC1B,MAAM;CACN,QAAQA,UAAO,CAAC,CAAC;CACjB,OAAO;CACP,UAAU;CACV,WAAW,SAAS,KAAK;CACzB,YAAY,UAAU,GAAG,KAAK,IAAI,KAAe,CAAC;AACpD,CAAC;AAED,MAAa,QAAQ,SAAS;CAC5B,MAAM;CACN,QAAQA,UAAO;EAAE,KAAK,OAAO,SAAS;EAAG,KAAK,OAAO,SAAS;CAAE,CAAC,CAAC,CAC/D,QAAQ,MAAM,EAAE,QAAQ,KAAA,KAAa,EAAE,QAAQ,KAAA,GAAW,wBAAwB,CAAC,CACnF,QACE,MAAM,EAAE,QAAQ,KAAA,KAAa,EAAE,QAAQ,KAAA,KAAa,EAAE,OAAO,EAAE,KAChE,kBACF;CACF,OAAO;CACP,UAAU;CACV,WAAW,SAAS,OAAO;CAC3B,MAAM,MAAM;EACV,MAAM,MAAM,EAAE,OAAO;EACrB,MAAM,MAAM,EAAE,OAAO;EACrB,QAAQ,UAAU,GAAG,KAAK,IAAI,KAAK,KAAK,IAAI,KAAK,KAAe,CAAC,CAAC;CACpE;AACF,CAAC;AAED,MAAM,WAAW,EAAE,OAAO,CAAC,CAAC,OAAO,QAAQ,cAAc;;;;;;AAOzD,MAAa,cAAc,SAAS;CAClC,MAAM;CACN,QAAQA,UAAO;EAAE,IAAI;EAAU,MAAM,SAAS,SAAS;CAAE,CAAC,CAAC,CAAC,QACzD,MACC,EAAE,SAAS,KAAA,KACX,CAAC,OAAO,EAAE,IAAI,KACd,CAAC,OAAO,EAAE,EAAE,KACZ,iBAAiB,EAAE,MAAM,EAAE,EAAE,MAAM,KAAA,GACrC,sCACF;CACA,OAAO;CACP,WAAW,MAAM,EAAE,SAAS,KAAA;CAC5B,YAAY,OAAO,MAAM;EACvB,IAAI,MAAM,SAAS,SAAS;GAC1B,IAAI,EAAE,SAAS,KAAA,GACb,OAAO,IAAI,sEAAoE;GACjF,MAAM,CAAC,OAAO,QAAQ,MAAM;GAK5B,IAAI,EAHF,MAAM,GAAG,WAAW,KACpB,UAAU,KAAK,CAAC,CAAC,SAAS,YAC1B,UAAU,IAAI,CAAC,CAAC,SAAS,WAChB,OAAO,IAAI,8CAA8C,KAAK,KAAK,GAAG;GACjF,OAAO,GAAG,WAAW,EAAE,QAAQ,WAAW,KAAK,CAAC,CAAC;EACnD;EACA,IAAI,EAAE,SAAS,KAAA,GAAW,OAAO,IAAI,qDAAmD;EACxF,OAAO,SAAS,cAAc,CAAC,CAAC,KAAK;CACvC;CACA,MAAM,GAAG,MAAM,UAAU;EACvB,MAAM,KAAK,EAAE;EACb,IAAI,MAAM,SAAS,SAAS;GAC1B,MAAM,SAAS,iBAAiB,EAAE,MAAgB,EAAE;GACpD,QAAQ,MAAM,GAAI,IAAe,MAAM;EACzC;EACA,QAAQ,MAAM;GACZ,MAAM,CAAC,OAAO,QAAQ;GACtB,IAAI,UAAU,MAAM,OAAO,GAAG,IAAI;GAClC,IAAI,SAAS,MAAM,OAAO,UAAU,gBAAgB,qBAAqB,OAAO;GAChF,MAAM,SAAS,iBAAiB,MAAM,EAAE;GACxC,OAAO,WAAW,KAAA,IACd,UAAU,gBAAgB,kBAAkB,KAAK,MAAM,IAAI,IAC3D,GAAG,QAAQ,MAAM;EACvB;CACF;AACF,CAAC;;;;;;;AC7JD,MAAM,YAAY,QAAgB,UAAiB;CACjD,MAAM,IAAI,WAAW,OAAO,CAAC,QAAQ,GAAG,EAAE;CAC1C,OAAO,EAAE,KAAK,GAAG,EAAE,MAAM,IAAI;AAC/B;AAEA,MAAM,QAAQ,EAAE,OAAO,CAAC,CAAC,aAAa,GAAG,QAAQ;CAC/C,MAAM,IAAI,aAAa,CAAC;CACxB,IAAI,CAAC,EAAE,IAAI,IAAI,SAAS;EAAE,MAAM;EAAU,SAAS,EAAE;CAAM,CAAC;AAC9D,CAAC;AAED,MAAM,eAAe,MAAc,EAAE,QAAQ,uBAAuB,MAAM;AAE1E,MAAa,OAAO,SAAS;CAC3B,MAAM;CACN,QAAQC,UAAO,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;CACtD,OAAO;CACP,UAAU;CACV,WAAW,SAAS,MAAM;CAC1B,MAAM,MAAM;EACV,IAAI,EAAE,UAAU,KAAA,GAAW,QAAQ,UAAU,GAAI,MAAiB,KAAK,CAAC;EACxE,MAAM,MAAM,IAAI,EAAE,MAAM,QAAQ,aAAa,MAAM,EAAE;EACrD,MAAM,QAAQ,IAAI,OAAO,IAAI,IAAI,GAAG,IAAI,IAAI,IAAI;EAChD,QAAQ,UAAU,GAAI,MAAiB,QAAQ,OAAO,EAAE,CAAC;CAC3D;AACF,CAAC;AAED,MAAa,QAAQ,SAAS;CAC5B,MAAM;CACN,QAAQA,UAAO,CAAC,CAAC;CACjB,OAAO;CACP,UAAU;CACV,WAAW,SAAS,OAAO;CAC3B,YAAY,UAAU,GAAI,MAAiB,YAAY,CAAC;AAC1D,CAAC;AAED,MAAa,QAAQ,SAAS;CAC5B,MAAM;CACN,QAAQA,UAAO,CAAC,CAAC;CACjB,OAAO;CACP,UAAU;CACV,WAAW,SAAS,OAAO;CAC3B,YAAY,UAAU,GAAI,MAAiB,YAAY,CAAC;AAC1D,CAAC;;AAGD,MAAaC,aAAW,SAAS;CAC/B,MAAM;CACN,QAAQD,UAAO;EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC;EAAG,UAAU,EAAE,QAAQ,CAAC,CAAC,SAAS;CAAE,CAAC,CAAC,CAAC,QACnF,MAAM,CAAC,EAAE,YAAY,EAAE,UAAU,GAClC,0CACF;CACA,OAAO;CACP,UAAU;CACV,WAAW,SAAS,UAAU;CAC9B,MAAM,OAAO,UAAU;EACrB,MAAM,QAAQ,MAAM,KAAK,KAAe;EACxC,IAAI,MAAM,UAAU,EAAE,QAAQ,OAAO,GAAG,KAAK;EAC7C,OAAO,GACL,EAAE,WAAW,GAAG,MAAM,MAAM,GAAG,EAAE,SAAS,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,KAAK,MAAM,MAAM,GAAG,EAAE,MAAM,CAAC,CAAC,KAAK,EAAE,CAC7F;CACF;AACF,CAAC;;AAGD,MAAa,MAAM,SAAS;CAC1B,MAAM;CACN,QAAQA,UAAO;EACb,QAAQ,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC;EAC9B,MAAM,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;EACtB,MAAM,EAAE,KAAK,CAAC,QAAQ,OAAO,CAAC;CAChC,CAAC;CACD,OAAO;CACP,UAAU;CACV,WAAW,SAAS,KAAK;CACzB,MAAM,OAAO,UAAU;EACrB,MAAM,IAAI;EACV,OAAO,GAAG,EAAE,SAAS,SAAS,EAAE,SAAS,EAAE,QAAQ,EAAE,IAAI,IAAI,EAAE,OAAO,EAAE,QAAQ,EAAE,IAAI,CAAC;CACzF;AACF,CAAC;;AAGD,MAAa,UAAU,SAAS;CAC9B,MAAM;CACN,QAAQA,UAAO;EACb,SAAS,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;EACzB,MAAM,EAAE,OAAO;EACf,OAAO,EAAE,QAAQ,CAAC,CAAC,SAAS;CAC9B,CAAC,CAAC,CAAC,aAAa,GAAG,QAAQ;EACzB,IAAI,CAAC,EAAE,SAAS,OAAO,EAAE,YAAY,UAAU;EAC/C,MAAM,IAAI,aAAa,EAAE,OAAO;EAChC,IAAI,CAAC,EAAE,IAAI,IAAI,SAAS;GAAE,MAAM;GAAU,MAAM,CAAC,SAAS;GAAG,SAAS,EAAE;EAAM,CAAC;CACjF,CAAC;CACD,OAAO;CACP,UAAU;CACV,WAAW,SAAS,SAAS;CAC7B,MAAM,MAAM;EACV,MAAM,UAAU,IAAI,OAAO,EAAE,QAAQ,EAAE,UAAU,YAAY,EAAE,OAAO,GAAG,IAAI;EAE7E,QAAQ,UAAU,GAAI,MAAiB,QAAQ,eAAe,EAAE,IAAI,CAAC;CACvE;AACF,CAAC;AAED,SAAS,WAAW,SAAyB;CAC3C,OAAQ,IAAI,OAAO,GAAG,QAAQ,IAAI,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,CAAqB,SAAS;AAC/E;;AAGA,MAAa,eAAe,SAAS;CACnC,MAAM;CACN,QAAQA,UAAO;EAAE,SAAS;EAAO,OAAO,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS;CAAE,CAAC,CAAC,CAAC,QAC3E,MAAM,CAAC,aAAa,EAAE,OAAO,CAAC,CAAC,OAAO,EAAE,SAAS,MAAM,WAAW,EAAE,OAAO,GAC5E,mDACF;CACA,OAAO;CACP,UAAU;CACV,YAAY,UAAU;EACpB,MAAM,IAAI,WAAW,OAAO,CAAC,QAAQ,GAAG,eAAe;EACvD,OAAO,EAAE,KAAK,GAAG,EAAE,SAAS,EAAE,MAAM,CAAC,IAAI;CAC3C;CACA,MAAM,MAAM;EACV,MAAM,KAAK,IAAI,OAAO,EAAE,SAAS,GAAG;EACpC,MAAM,QAAQ,EAAE,SAAS;EACzB,QAAQ,UAAU,GAAG,GAAG,KAAK,KAAe,CAAC,GAAG,UAAU,IAAI;CAChE;AACF,CAAC;;AAGD,MAAa,QAAQ,SAAS;CAC5B,MAAM;CACN,QAAQA,UAAO;EAAE,WAAW,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;EAAG,OAAO,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS;CAAE,CAAC;CAC1F,OAAO;CACP,UAAU;CACV,YAAY,UAAU;EACpB,MAAM,IAAI,WAAW,OAAO,CAAC,QAAQ,GAAG,OAAO;EAC/C,OAAO,EAAE,KAAK,GAAG,EAAE,KAAK,EAAE,MAAM,CAAC,IAAI;CACvC;CACA,MAAM,OAAO,UAAU;EACrB,MAAM,QAAS,MAAiB,MAAM,EAAE,SAAS;EACjD,IAAI,EAAE,UAAU,KAAA,KAAa,MAAM,UAAU,EAAE,OAAO,OAAO,GAAG,KAAK;EACrE,OAAO,GAAG,CAAC,GAAG,MAAM,MAAM,GAAG,EAAE,QAAQ,CAAC,GAAG,MAAM,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;CACxF;AACF,CAAC;;AAGD,MAAa,OAAO,SAAS;CAC3B,MAAM;CACN,QAAQA,UAAO,EAAE,WAAW,EAAE,OAAO,EAAE,CAAC;CACxC,OAAO;CACP,UAAU;CACV,YAAY,UAAU;EACpB,IAAI,MAAM,SAAS,UAAU,UAAU,MAAM,EAAE,CAAC,CAAC,SAAS,UACxD,OAAO,IAAI,kCAAkC,KAAK,KAAK,GAAG;EAE5D,OAAO,GAAG,EAAE,MAAM;CACpB;CACA,MAAM,OAAO,UACX,GAAI,MAAqC,QAAQ,MAAM,MAAM,IAAI,CAAC,CAAC,KAAK,EAAE,SAAS,CAAC;AACxF,CAAC;AAED,MAAM,yBAAS,IAAI,IAAI;CAAC;CAAU;CAAU;AAAS,CAAC;;AAGtD,MAAa,SAAS,SAAS;CAC7B,MAAM;CACN,QAAQA,UAAO,EAAE,WAAW,EAAE,OAAO,CAAC,CAAC,SAAS,EAAE,CAAC;CACnD,OAAO;CACP,UAAU;CACV,YAAY,UAAU;EACpB,IAAI,MAAM,SAAS,WAAW,CAAC,MAAM,GAAG,OAAO,MAAM,OAAO,IAAI,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,GAChF,OAAO,IAAI,+DAA+D,KAAK,KAAK,GAAG;EAEzF,OAAO,GAAG,EAAE,MAAM;CACpB;CACA,MAAM,OAAO,UACX,GACG,MACE,QAAQ,MAAM,MAAM,IAAI,CAAC,CACzB,KAAK,MAAM,OAAO,CAA8B,CAAC,CAAC,CAClD,KAAK,EAAE,aAAa,EAAE,CAC3B;AACJ,CAAC;;AAGD,MAAa,OAAO,SAAS;CAC3B,MAAM;CACN,QAAQA,UAAO,EAAE,WAAW,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;CAC1D,OAAO;CACP,UAAU;CACV,WAAW,SAAS,MAAM;CAC1B,MAAM,MAAM;EACV,MAAM,MAAM,EAAE,aAAa;EAC3B,QAAQ,UACN,GACG,MACE,UAAU,MAAM,CAAC,CACjB,QAAQ,UAAU,EAAE,CAAC,CACrB,YAAY,CAAC,CACb,MAAM,YAAY,CAAC,CACnB,QAAQ,MAAM,MAAM,EAAE,CAAC,CACvB,KAAK,GAAG,CACb;CACJ;AACF,CAAC;;;;;;;;;ACxMD,MAAM,OAAO,EAAE,aAAa,EAAE,MAAM,EAAE,QAAQ,IAAI,EAAE,CAAC;AACrD,MAAM,SAAS,EAAE,MAAM;CAAC,EAAE,OAAO;CAAG,EAAE,OAAO;CAAG,EAAE,QAAQ;CAAG,EAAE,KAAK;CAAG,EAAE,MAAM,IAAI;AAAC,CAAC;AACrF,MAAM,SAAS,EAAE,MAAM,CAAC,MAAM,MAAM,CAAC;AAIrC,MAAM,UAAU,MACd,OAAO,MAAM,YAAY,MAAM,QAAQ,CAAC,MAAM,QAAQ,CAAC;;;;ACQzD,MAAMG,QAAM;CACV;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACAC;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CDzCkB,SAAS;EAC3B,MAAM;EACN,QAAQF,UAAO;GACb,OAAO,EAAE,MAAM,EAAE,aAAa;IAAE,MAAM,EAAE,QAAQ;IAAG,MAAM;GAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;GACzE,MAAM,OAAO,SAAS;EACxB,CAAC;EACD,OAAO;EACP,OAAO;EACP,UAAU;EACV,YAAY,OAAO,GAAG,QAA+B;GACnD,MAAM,QAAQ,MAAM,SAAS;GAC7B,MAAM,WAAW,CAAC,GAAG,EAAE,MAAM,KAAK,MAAM,EAAE,IAAI,GAAG,GAAI,EAAE,SAAS,KAAA,IAAY,CAAC,IAAI,CAAC,EAAE,IAAI,CAAE;GAC1F,IAAI,SAAS,EAAE,SAAS,KAAA,GAAW,OAAO,IAAI,0CAAwC;GACtF,IAAI,SAAS,SAAS,KAAK,MAAM,GAAG,OAAO,IAAI,6CAA6C;GAC5F,KAAK,MAAM,CAAC,GAAG,MAAM,EAAE,MAAM,QAAQ,GAAG;IACtC,MAAM,OAAO,iBAAiB,EAAE,MAAM,KAAK,KAAK;IAChD,IAAI,CAAC,KAAK,IAAI,OAAO,IAAI,QAAQ,EAAE,IAAI,KAAK,OAAO;GACrD;GACA,MAAM,QAAQ,SAAS,KAAK,MAAO,OAAO,CAAC,IAAI,QAAQ,WAAW,CAAC,CAAE;GACrE,IAAI,EAAE,SAAS,KAAA,GAAW,MAAM,KAAK,KAAK;GAC1C,MAAM,MAAM,SAAS,KAAK;GAC1B,OAAO,IAAI,KAAK,MAAM,IAAI,2BAA2B,MAAM,IAAI,IAAI,CAAC,CAAC,KAAK,IAAI,GAAG;EACnF;EACA,MAAM,GAAG,KAAK,UAAU;GACtB,MAAM,QAAQ,EAAE,MAAM,KAAK,OAAO;IAChC,MAAM,SAAS,iBAAiB,EAAE,MAAM,KAAK,KAAK,CAAC;IACnD,MAAM,EAAE;GACV,EAAE;GACF,MAAM,YAAY,EAAE,QAAQ,EAAE,MAAM,KAAc;GAClD,MAAM,WAAW,GAAW,MAAiB,OAAO,CAAC,IAAI,IAAK;GAC9D,QAAQ,GAAG,QAAQ;IACjB,KAAK,MAAM,KAAK,OAAO,IAAI,EAAE,KAAK,GAAG,IAAI,QAAQ,GAAG,GAAG,OAAO,GAAG,QAAQ,EAAE,MAAM,CAAC,CAAC;IACnF,OAAO,GAAG,QAAQ,WAAW,CAAC,CAAC;GACjC;EACF;CACF,CCOE;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AACF;AAEA,MAAa,aAAuD,OAAO,YACzEC,MAAI,KAAK,OAAO,CAAC,GAAG,MAAM,EAA+B,CAAC,CAC5D;;;;;;;;;;;;;ACjEA,MAAM,eAAe;CAAC;CAAS;CAAU;CAAQ;AAAS;AAC1D,MAAM,mBAAmB,IAAI,IAC3B,WAAW,QAAQ,MAAM,CAAC;CAAC;CAAO;CAAO;AAAK,CAAC,CAAC,SAAS,CAAC,CAAC,CAC7D;;AAKA,SAAgB,WAAW,KAAyC;CAClE,MAAM,IAAI,YAAY,KAAK,IAAI,EAAE;CACjC,IAAI,CAAC,GAAG,OAAO,GAAG,GAAG;CACrB,MAAM,YAAY,EAAE;CACpB,IAAI,CAAC,iBAAiB,IAAI,SAAS,GAAG,OAAO,IAAI,eAAe,IAAI,GAAG,EAAE;CACzE,MAAM,EAAE,IAAI,KAAK,MAAM,MAAM,WAAW,MAAM,GAAG,SAAS;CAC1D,IAAI,EAAE,UAAU,MAAM,OAAO,IAAI,GAAG,IAAI,GAAG,cAAc;CAEzD,MAAM,QAAQ,OAAO,KAAK,IAAI,CAAC,CAAC,QAAQ,MAAM,CAAE,aAAmC,SAAS,CAAC,CAAC;CAC9F,IAAI,MAAM,QAAQ,OAAO,IAAI,GAAG,IAAI,GAAG,iBAAiB,MAAM,KAAK,IAAI,GAAG;CAC1E,MAAM,QAAQ,aAAa,QAAQ,MAAM,KAAK,IAAI;CAClD,MAAM,WAAW,cAAc,aAAa,cAAc;CAC1D,IAAI,WAAW,MAAM,SAAS,IAAI,MAAM,WAAW,GACjD,OAAO,IACL,WACI,GAAG,IAAI,GAAG,8BACV,GAAG,IAAI,GAAG,wBAAwB,aAAa,KAAK,IAAI,GAC9D;CAEF,MAAM,UAAU,WAAW,OAAO,KAAK,MAAM;CAE7C,OAAO,GAAG;EACR,IAAI;EACJ,OAAO,CAAC;GAAE;IAHG,GAAI,SAAS,KAAA,IAAY,CAAC,IAAI,EAAE,KAAK;KAAK,YAAY;GAGzD;GAAM;EAAK,CAAC;EACtB,GAAI,cAAc,KAAA,IAAY,CAAC,IAAI,EAAE,MAAM,UAAU;CACvD,CAAC;AACH;AAEA,MAAM,eAAe,EAAE,aAAa;CAClC,IAAI,EAAE,QAAQ,eAAe;CAC7B,QAAQ,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;CACxB,IAAI,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;CACpB,OAAO,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,IAAI;CACrC,SAAS,EAAE,KAAK;EAAC;EAAQ;EAAQ;CAAO,CAAC,CAAC,CAAC,SAAS;AACtD,CAAC;AAED,MAAM,UAAU,MACd,OAAO,MAAM,YAAY,MAAM,QAAQ,OAAQ,EAAe,OAAO;;AAGvE,SAAS,eACP,OACA,QACA,OACW;CACX,OAAO,MAAM,KAAK,MAAM,MAAM;EAC5B,IAAI,CAAC,OAAO,IAAI,GAAG,OAAO;EAC1B,IAAI,UAAU,KAAK,OAAO,iBAAiB;GACzC,MAAM,4CAA4C,CAAC;GACnD,OAAO;EACT;EACA,IAAI,KAAK,OAAO,UAAU,MAAM,QAAQ,KAAK,QAAQ,GACnD,OAAO;GACL,GAAG;GACH,UAAU,eAAe,KAAK,UAAU,OAAO,MAAM,MAAM,SAAS,KAAK,CAAC,CAAC;EAC7E;EAEF,MAAM,WAAW,WAAW,IAAI;EAChC,IAAI,SAAS,IAAI,OAAO,SAAS;EACjC,MAAM,SAAS,OAAO,CAAC;EACvB,OAAO;CACT,CAAC;AACH;;AAQA,SAAS,eACP,MACA,KACA,SACA,QACS;CACT,MAAM,YAAwB,CAAC;CAC/B,IAAI,QAAQ,KAAK;CACjB,MAAM,OAAO,MAAM,QAAQ,KAAK,IAAI,IAAI,CAAC,GAAI,KAAK,IAAiB,IAAI,CAAC;CACxE,IAAI,IAAI;CACR,MAAM,SAAU,KAAK,OAAqB,KAAK,QAAQ;EACrD,MAAM,IAAI;EACV,IAAI,OAAO,MAAM,YAAY,MAAM,QAAQ,CAAC,MAAM,QAAQ,EAAE,QAAQ,GAAG,OAAO;EAC9E,MAAM,MAAM,OAAO,EAAE,GAAG;EACxB,MAAM,SAAS,SAAiB,SAC9B,OAAO,KAAK;GAAE,MAAM;GAAkB;GAAS,MAAM,KAAK;GAAI,OAAO;GAAK;EAAK,CAAC;EAClF,MAAM,WAAW,eAAe,EAAE,UAAU,OAAO,KAAK;EACxD,MAAM,KAAK,SAAS,WAAW,MAAM,OAAO,CAAC,KAAK,EAAE,OAAO,eAAe;EAC1E,IAAI,KAAK,GAAG,OAAO;GAAE,GAAG;GAAG;EAAS;EACpC,IAAI,SAAS,eAAe,MAAM,OAAO,CAAC,KAAK,EAAE,OAAO,eAAe,MAAM,IAAI;GAC/E,MAAM,0EAA0E,EAAE;GAClF,OAAO;IAAE,GAAG;IAAG;GAAS;EAC1B;EACA,MAAM,SAAS,aAAa,UAAU,SAAS,GAAG;EAClD,IAAI,CAAC,OAAO,SAAS;GACnB,MACE,kBAAkB,OAAO,MAAM,OAAO,KAAK,MAAM,GAAG,EAAE,KAAK,KAAK,GAAG,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,KAAK,IAAI,KAC/F,EACF;GACA,OAAO;IAAE,GAAG;IAAG;GAAS;EAC1B;EACA,IAAI,OAAO,GAAG;GACZ,MAAM,+CAA+C,EAAE;GACvD,OAAO;IAAE,GAAG;IAAG;GAAS;EAC1B;EACA,MAAM,EAAE,QAAQ,IAAI,OAAO,SAAS,WAAW,OAAO;EACtD,IAAI,CAAC,IAAI,QAAQ,SAAS,MAAM,MAAM,EAAE,SAAS,MAAM,GAAG;GACxD,MAAM,kCAAkC,OAAO,IAAI,EAAE;GACrD,OAAO;IAAE,GAAG;IAAG;GAAS;EAC1B;EACA,KAAK;EACL,MAAM,SAAS,SAAS,MAAM,GAAG,EAAE;EACnC,MAAM,OAAO,OAAO;EACpB,IAAI;EACJ,IAAI,OAAO,WAAW,KAAK,KAAK,OAAO,aAAa,OAAO,KAAK,SAAS,UACvE,WAAW,KAAK;OACX;GAEL,WAAW,KAAK,IAAI;GACpB,MAAM,SAAmB;IACvB,IAAI,GAAG,KAAK,GAAG,OAAO;IACtB,IAAI;IACJ,IAAI;IACJ,MAAM;IACN,QAAQ,CAAC;KAAE,KAAK;KAAU,UAAU;IAAO,CAAC;IAC5C,GAAI,KAAK,aAAa,KAAA,IAAY,CAAC,IAAI,EAAE,UAAU,KAAK,SAAS;GACnE;GACA,UAAU,KAAK,MAAM;GACrB,QAAQ,OAAO;GACf,KAAK,KAAK,QAAQ;EACpB;EACA,MAAM,SAAS,cAAc;EAC7B,IAAI,CAAC,QAAQ,IAAI,MAAM,GAAG;GACxB,QAAQ,IAAI,MAAM;GAClB,UAAU,KAAK;IAAE,IAAI;IAAQ,IAAI;IAAU,QAAQ;IAAY;GAAO,CAAC;EACzE;EACA,MAAM,aAAa,KAAK,IAAI;EAC5B,MAAM,OAAiB;GACrB,IAAI,GAAG,KAAK,GAAG,UAAU;GACzB,IAAI;GACJ,MAAM;GACN,OAAO;GACP,IAAI,CAAC,CAAC,UAAU,EAAE,CAAC;GACnB,MAAM;GACN,aAAa;GACb,QAAQ,GAAG,QAAQ,WAAW;GAC9B,gBAAgB;EAClB;EACA,UAAU,KAAK,IAAI;EACnB,QAAQ,KAAK;EACb,KAAK,KAAK,UAAU;EACpB,MAAM,OACJ,WAAW,SACP,CAAC;GAAE,IAAI;GAAY,OAAO,CAAC,YAAY,QAAQ;EAAE,CAAC,IAClD,WAAW,UACT,CACE;GAAE,IAAI;GAAW,MAAM;EAAW,GAClC;GAAE,IAAI;GAAW,SAAS,MAAM,OAAO,QAAQ,GAAG;EAAmB,CACvE,IACA,CAAC;GAAE,IAAI;GAAW,MAAM;EAAW,CAAC;EAC5C,OAAO;GAAE,GAAG;GAAG,UAAU,CAAC,GAAG,MAAM,GAAG,SAAS,MAAM,KAAK,CAAC,CAAC;EAAE;CAChE,CAAC;CACD,IAAI,MAAM,GAAG,OAAO;EAAE;EAAW,MAAM;GAAE,GAAG;GAAM;EAAO;CAAE;CAC3D,MAAM,UAAU,KAAK,SAAS;CAC9B,OAAO;EACL;EACA,MAAM;GAAE,GAAG;GAAM,IAAI;GAAO;GAAQ,GAAI,UAAU,EAAE,KAAK,IAAI,CAAC;EAAG;CACnE;AACF;;;;;;AAOA,SAAgB,iBACd,SACA,KACqD;CACrD,MAAM,SAAyB,CAAC;CAChC,MAAM,UAAU,IAAI,IAAI,QAAQ,MAAM,QAAQ,MAAM,EAAE,OAAO,QAAQ,CAAC,CAAC,KAAK,MAAM,EAAE,EAAE,CAAC;CACvF,MAAM,QAAoB,CAAC;CAC3B,KAAK,MAAM,QAAQ,QAAQ,OAAO;EAChC,IAAI,KAAK,OAAO,SAAS,CAAC,MAAM,QAAQ,KAAK,MAAM,GAAG;GACpD,MAAM,KAAK,IAAI;GACf;EACF;EACA,MAAM,UAAU,eAAe,MAAM,KAAK,SAAS,MAAM;EACzD,MAAM,KAAK,GAAG,QAAQ,WAAW,QAAQ,IAAI;CAC/C;CACA,MAAM,iBAAiB,EAAE,GAAG,QAAQ,eAAe;CACnD,KAAK,MAAM,QAAQ,OAAO;EACxB,IAAI,KAAK,OAAO,YAAY,KAAK,WAAW,cAAc,eAAe,KAAK,KAAK;EACnF,MAAM,SAAS,IAAI,QAAQ,SAAS,MAAM,MAAM,EAAE,SAAS,KAAK,MAAM;EACtE,IAAI,QAAQ,eAAe,KAAK,MAAM,iBAAiB,MAAM;CAC/D;CACA,OAAO;EAAE,SAAS;GAAE,GAAG;GAAS;GAAO;EAAe;EAAG;CAAO;AAClE;;;AC9LA,MAAM,cAAc,GAAG,IAAI;;AAG3B,SAAgB,aACd,KACA,KACA,QAAe,EAAE,MACoB;CACrC,IAAI,IAAI,WAAW,GAAG,OAAO,IAAI;EAAE,MAAM;EAAG,SAAS;CAAqC,CAAC;CAE3F,IAAI,OAAO;CACX,IAAI,WAAW;CACf,IAAI,YAAY;CAChB,MAAM,QAAgB,CAAC;CACvB,MAAM,QAAkB,CAAC;CAEzB,KAAK,MAAM,CAAC,GAAG,UAAU,IAAI,QAAQ,GAAG;EACtC,MAAM,SAAS,YAAoB,IAAI;GAAE,MAAM;GAAG;EAAQ,CAAC;EAC3D,IAAI,OAAO,UAAU,YAAY,UAAU,QAAQ,OAAQ,MAAmB,OAAO,UACnF,OAAO,MAAM,oCAAkC;EAEjD,MAAM,WAAW,WAAW,KAAiB;EAC7C,IAAI,CAAC,SAAS,IAAI,OAAO,MAAM,SAAS,KAAK;EAC7C,MAAM,EAAE,IAAI,GAAG,SAAS,SAAS;EACjC,MAAM,MAAM,OAAO,OAAO,YAAY,EAAE,IAAI,WAAW,MAAM,KAAA;EAC7D,IAAI,CAAC,KAAK,OAAO,MAAM,eAAe,GAAG,EAAE;EAC3C,IAAI,WAAW,OAAO,MAAM,GAAG,MAAM,GAAG,EAAE,EAAE,uBAAuB;EAEnE,MAAM,SAAS,IAAI,OAAO,UAAU,IAAI;EACxC,IAAI,CAAC,OAAO,SACV,OAAO,MACL,GAAG,GAAG,IAAI,OAAO,MAAM,OAAO,KAAK,MAAM,GAAG,EAAE,KAAK,SAAS,GAAG,EAAE,KAAK,KAAK,GAAG,EAAE,MAAM,KAAK,EAAE,SAAS,CAAC,CAAC,KAAK,IAAI,GACnH;EAGF,MAAM,OAAO,IAAI,SAAS;EAC1B,IAAI,SAAS,UAAU,KAAK,SAAS,QACnC,OAAO,MAAM,GAAG,GAAG,kDAAkD;EAEvE,IAAI,SAAS,WAAW,KAAK,SAAS,QACpC,OAAO,MAAM,GAAG,GAAG,0EAA0E;EAI/F,MAAM,YAAY,IAAI,UAAU;EAChC,MAAM,SAAS,aAAa,UAAU,IAAI;EAC1C,MAAM,QAAQ,YAAY,UAAU,IAAI,IAAI;EAC5C,IAAI,MAAM,SAAS,SAAS,OAAO,MAAM,GAAG,GAAG,mCAAmC;EAElF,MAAM,MAAM,IAAI,UAAU,OAAO,OAAO,MAAM,GAAG;EACjD,IAAI,CAAC,IAAI,IAAI,OAAO,MAAM,IAAI,KAAK;EAEnC,MAAM,QAAQ,IAAI,IAAI,OAAO,MAAM,KAAK,KAAK;EAC7C,MAAM,KAAK,UAAU,GAAG,QAAS,MAAM,OAAO,cAAc,MAAM,GAAG,GAAG,IAAK,KAAK;EAClF,MAAM,KAAK,EAAE;EACb,OAAO,SAAS,EAAE,SAAS,IAAI,KAAK,IAAI,IAAI;EAC5C,aAAa,IAAI,SAAS,OAAO,MAAM,KAAK,KAAK;EACjD,YAAY,IAAI,aAAa;CAC/B;CAEA,OAAO,GAAG;EACR;EACA;EACA;EACA,MAAM,OAAO,QAAQ;GACnB,IAAI,IAAmB;GACvB,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;IACrC,MAAM,IAAK,MAAM,EAAE,CAAU,GAAU,GAAG;IAC1C,IAAI,CAAC,EAAE,IAAI,OAAO,IAAI;KAAE,GAAG,EAAE;KAAO,MAAM;KAAG,IAAI,MAAM;IAAa,CAAC;IACrE,IAAI,EAAE;GACR;GACA,OAAO,GAAG,CAAC;EACb;CACF,CAAC;AACH;;;;;;;;;;;;;ACxFA,MAAM,QAAQ,EAAE,aAAa;CAAE,KAAK,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;CAAG,UAAU,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC;AAAE,CAAC;AAE9F,MAAME,WAAS,EAAE,aAAa;CAC5B,IAAI;CACJ,QAAQ,EAAE,MAAM,KAAK,CAAC,CAAC,IAAI,CAAC;CAC5B,MAAM,EAAE,KAAK,CAAC,QAAQ,KAAK,CAAC,CAAC,CAAC,SAAS;CACvC,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,SAAS;CAC1C,UAAU,QAAQ,SAAS;AAC7B,CAAC;AAED,MAAM,UAAU;AAEhB,MAAa,UAAU,WAAW;CAChC,IAAI;CACJ,OAAO;CACP,UAAU;CACV,aAAa;CACb,OAAO,CAAC;EAAE,IAAI;EAAM,OAAO;EAAM,MAAM,CAAC,IAAI;CAAE,CAAC;CAC/C,QAAQ;CACR,iBAAiB;EAAE,IAAI;EAAI,QAAQ,CAAC;CAAE;CACtC,QAAA;CACA,UAAU,GAAG,QAAQ;EACnB,MAAM,QAAQ,IAAI,MAAM,EAAE,EAAE;EAC5B,MAAM,OAAO,IAAI,UAAU,MAAM,IAAI;EACrC,MAAM,SAAS,EAAE,YAAY,IAAI,QAAQ,WAAW;EACpD,MAAM,SAAsB,CAAC;EAE7B,MAAM,OAAO,IAAI,IAAI,EAAE,QAAQ,CAAC,CAAC;EACjC,IAAI,KAAK,OAAO,KAAK,EAAE,SAAS,OAC9B,OAAO,KAAK,EAAE,SAAS,uCAAqC,CAAC;EAC/D,KAAK,MAAM,QAAQ,MACjB,IAAI,CAAC,OAAO,OAAO,MAAM,KAAK,QAAQ,IAAI,GACxC,OAAO,KAAK,EAAE,SAAS,wBAAwB,KAAK,GAAG,CAAC;EAE5D,MAAM,OAAO,EAAE,SAAS,QAAQ,OAAO,KAAK,MAAM,KAAK,MAAM,CAAC,CAAC,QAAQ,MAAM,CAAC,KAAK,IAAI,CAAC,CAAC,IAAI,CAAC;EAE9F,MAAM,uBAAO,IAAI,IAAY;EAC7B,MAAM,WAA0D,CAAC;EACjE,KAAK,MAAM,KAAK,EAAE,QAAQ;GACxB,IAAI,KAAK,IAAI,EAAE,GAAG,GAChB,OAAO,KAAK;IAAE,SAAS,UAAU,EAAE,IAAI;IAAqB,OAAO,EAAE;GAAI,CAAC;GAC5E,KAAK,IAAI,EAAE,GAAG;GACd,MAAM,IAAI,aAAa,EAAE,UAAU,IAAI;GACvC,IAAI,EAAE,IAAI,SAAS,KAAK;IAAE,KAAK,EAAE;IAAK,UAAU,EAAE;GAAM,CAAC;QACpD,OAAO,KAAK;IAAE,SAAS,EAAE,MAAM;IAAS,OAAO,EAAE;IAAK,MAAM,EAAE,MAAM;GAAK,CAAC;EACjF;EACA,IAAI,OAAO,QAAQ,OAAO;GAAE,IAAI;GAAO,OAAO;EAAO;EAErD,MAAM,SAAgC,CAAC;EACvC,MAAM,UAAkC,CAAC;EACzC,KAAK,MAAM,QAAQ,MAAM;GACvB,OAAO,QAAQ,MAAM,KAAK,OAAO;GACjC,QAAQ,QAAQ,MAAM,QAAQ;EAChC;EACA,KAAK,MAAM,EAAE,KAAK,cAAc,UAAU;GACxC,MAAM,OAAO,SAAS,aAAa,WAAW,UAAU,WAAW;GACnE,MAAM,YAAY,SAAS,aAAc,SAAS,YAAY,WAAW;GACzE,OAAO,OAAO,OAAO,EAAE,SAAS,SAAS,IAAI,IAAI,SAAS;GAC1D,QAAQ,OAAO;IACb,MAAM,IAAI;IACV,OAAO;IACP;IACA,GAAI,YACA,EAAE,SAAS,SAAS,YAAY,UAAU,SAAS,IAAI,IAAI,SAAS,KAAK,IACzE,CAAC;GACP;EACF;EAEA,OAAO,GAAG;GACR,QAAQ;IACN,MAAM,EAAE,OAAO,MAAM;IACrB;IACA,SAAS,WAAW,iBAAiB,SAAS,MAAM,MAAM,EAAE,SAAS,QAAQ;GAC/E;GACA,MAAM,QAAQ,QAAQ;IACpB,MAAM,yBAAS,IAAI,IAGjB;IACF,MAAM,OAAc,CAAC;IACrB,IAAI,UAAU;IACd,KAAK,MAAM,UAAU,OAAO,EAAE,EAAE,GAAG;KACjC,MAAM,KAAK;MAAE,GAAG;MAAK;KAAO;KAC5B,MAAM,MAA2B,CAAC;KAClC,KAAK,MAAM,QAAQ,MAAM,IAAI,OAAO,OAAO,QAAQ,IAAI,GAAG,IAAI,QAAQ,OAAO;KAC7E,IAAI,OAAO;KACX,KAAK,MAAM,EAAE,KAAK,cAAc,UAAU;MACxC,MAAM,IAAI,SAAS,IAAI,MAAM,EAAE;MAC/B,IAAI,EAAE,IAAI;OACR,IAAI,EAAE,UAAU,MAAM,OAAO,IAAI;YAC5B,IAAI,OAAO,EAAE;OAClB;MACF;MACA,MAAM,SAAS,QAAQ,EAAE,MAAM,KAAK,GAAG,EAAE,MAAM,GAAG,IAAI,EAAE,MAAM;MAC9D,IAAI,WAAW,aACb,OAAO,IAAI;OAAE,MAAM,EAAE,MAAM;OAAM,SAAS,GAAG,IAAI,GAAG;OAAU,MAAM;MAAK,CAAC;MAE5E,MAAM,IAAI,GAAG,IAAI,QAAQ,EAAE,MAAM;MACjC,MAAM,IAAI,OAAO,IAAI,CAAC,KAAK;OAAE,OAAO;OAAK,MAAM,EAAE,MAAM;OAAM,OAAO;OAAG,SAAS,CAAC;MAAE;MACnF,EAAE,SAAS;MACX,IAAI,EAAE,QAAQ,SAAS,SAAS,EAAE,QAAQ,KAAK,MAAM;MACrD,OAAO,IAAI,GAAG,CAAC;MACf,IAAI,WAAW,QAAQ,IAAI,OAAO;WAC7B,IAAI,WAAW,cAAc,OAAO,IAAI;WACxC;OACH,OAAO;OACP;MACF;KACF;KACA,IAAI,MAAM,WAAW;UAChB,KAAK,KAAK,GAAG;IACpB;IACA,MAAM,SAAqB,CAAC,GAAG,OAAO,OAAO,CAAC,CAAC,CAAC,KAAK,OAAO;KAC1D,MAAM,IAAI;KACV,MAAM,EAAE;KACR,OAAO,EAAE;KACT,SAAS,GAAG,EAAE,MAAM,IAAI,EAAE,MAAM,mBAAmB,OAAO;KAC1D,OAAO,EAAE;KACT,SAAS,EAAE;IACb,EAAE;IACF,OAAO,GAAG;KAAE;KAAM;KAAS;IAAO,CAAC;GACrC;EACF,CAAC;CACH;AACF,CAAC;;;;;;;;;;;;AC/HD,MAAMC,WAAS,EAAE,aAAa;CAC5B,IAAI;CACJ,MAAM,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;CACtB,UAAU,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS;AACvD,CAAC;;AAGD,MAAM,QAAQ;AAEd,MAAa,cAAc,WAAW;CACpC,IAAI;CACJ,OAAO;CACP,UAAU;CACV,aAAa;CACb,OAAO,CAAC;EAAE,IAAI;EAAM,OAAO;EAAM,MAAM,CAAC,IAAI;CAAE,CAAC;CAC/C,QAAQ;CACR,QAAQ;CACR,iBAAiB;EAAE,IAAI;EAAI,MAAM;CAAG;CACpC,QAAA;CACA,UAAU,GAAG,QAAQ;EACnB,MAAM,QAAQ,IAAI,MAAM,EAAE,EAAE;EAC5B,MAAM,KAAK,EAAE;EACb,IAAI,CAAC,IACH,OAAO,GAAG;GACR,QAAQ;GACR,MAAM,WAAW;IACf,MAAM,OAAO,YAAY,OAAO,EAAE,EAAE,GAAG,CAAC,CAAC;IACzC,OAAO,GAAG;KAAE;KAAM,QAAQ,OAAO,IAAI,IAAI,EAAE,MAAM,IAAI;IAAE,CAAC;GAC1D;EACF,CAAC;EAEH,MAAM,UAAU,GAAG,QAAQ,MAAM,CAAC,OAAO,OAAO,MAAM,KAAK,QAAQ,CAAC,CAAC;EACrE,IAAI,QAAQ,QAAQ,OAAO,KAAK,6BAA6B,QAAQ,KAAK,IAAI,GAAG;EACjF,IAAI,GAAG,SAAS,KAAK,GAAG,OAAO,KAAK,cAAc,MAAM,sCAAsC;EAC9F,MAAM,SAAgC,OAAO,YAC3C,GAAG,KAAK,MAAM,CAAC,GAAG,MAAM,KAAK,OAAO,EAAW,CAAC,CAClD;EACA,MAAM,OAAO,EAAE,OAAO;GAAE,GAAG;IAAS,QAAQ,EAAE;EAAO,CAAC;EACtD,OAAO,GAAG;GACR,QAAQ;IACN;IACA,SAAS;KACP,GAAG,WAAW,IAAI,IAAI,IAAI;KAC1B,GAAG,OAAO,YAAY,GAAG,KAAK,MAAM,CAAC,GAAG,MAAM,QAAQ,EAAY,CAAC,CAAC;IACtE;GACF;GACA,MAAM,WAAW;IACf,MAAM,yBAAS,IAAI,IAAuC;IAC1D,KAAK,MAAM,OAAO,OAAO,EAAE,EAAE,GAAG;KAC9B,MAAM,IAAI,MAAM,KAAK,EAAE;KACvB,MAAM,QAAQ,OAAO,IAAI,CAAC;KAC1B,IAAI,OAAO,MAAM,KAAK;UACjB,OAAO,IAAI,GAAG;MAAE,OAAO;MAAK,GAAG;KAAE,CAAC;IACzC;IAKA,MAAM,OAAO,YAJG,CAAC,GAAG,OAAO,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,OAAO,SAAS;KAC1D,GAAG,OAAO,YAAY,GAAG,KAAK,MAAM,CAAC,GAAG,MAAM,MAAM,IAAI,CAAC,CAAC;MACzD,QAAQ;IACX,EACyB,GAAS,EAAE;IACpC,OAAO,GAAG;KAAE;KAAM,QAAQ,OAAO,IAAI,IAAI,EAAE,MAAM,IAAI;IAAE,CAAC;GAC1D;EACF,CAAC;CACH;AACF,CAAC;AAED,SAAS,OAAO,MAAc,MAAc,MAAsB;CAChE,OAAO;EAAE;EAAM;EAAM,MAAM,KAAK,KAAK,MAAM,OAAO,CAAC,CAAyB;CAAE;AAChF;;;;;;;;;;;;;;;;;;;;;;;;ACpCA,MAAMC,WAAS,EAAE,aAAa;CAC5B,IAAI;CACJ,QAAQ,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;CACxB,KAAK,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;CACrC,SAAS,EAAE,OAAO,EAAE,OAAO,GAAG,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,SAAS;CAC1D,OAAO,EAAE,OAAO,EAAE,OAAO,GAAG,EAAE,KAAK;EAAC;EAAa;EAAgB;CAAO,CAAC,CAAC,CAAC,CAAC,SAAS;CACrF,MAAM,EAAE,OAAO,EAAE,OAAO,GAAG,EAAE,aAAa,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS;CAC/F,MAAM,EAAE,KAAK,CAAC,UAAU,SAAS,CAAC,CAAC,CAAC,SAAS;AAC/C,CAAC;;AASD,SAAgB,cACd,SACA,QACA,MAC0B;CAC1B,MAAM,MAAM,KAAK,QAAQ,GAAG;CAC5B,MAAM,CAAC,YAAY,aACjB,MAAM,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,KAAK,MAAM,GAAG,GAAG,GAAG,KAAK,MAAM,MAAM,CAAC,CAAC;CACrE,MAAM,SAAS,QAAQ,SAAS,MAAM,MAAM,EAAE,SAAS,UAAU;CACjE,IAAI,CAAC,QAAQ,OAAO,IAAI,yBAAyB,WAAW,EAAE;CAC9D,MAAM,QAAQ,OAAO,OAAO,MAAM,MAAM,EAAE,SAAS,SAAS;CAC5D,IAAI,CAAC,OAAO,OAAO,IAAI,GAAG,WAAW,iBAAiB,UAAU,EAAE;CAClE,OAAO,GAAG;EAAE;EAAQ;EAAO,MAAM,WAAW,gBAAgB,MAAM,WAAW,GAAG,MAAM,QAAQ;CAAE,CAAC;AACnG;;;;;AAMA,SAAgB,QACd,SACA,OACA,IACiD;CACjD,IAAI,CAAC,MAAM,YAAY,OAAO,IAAI,GAAG,MAAM,KAAK,oBAAoB;CACpE,MAAM,SAAS,QAAQ,SAAS,MAAM,MAAM,EAAE,SAAS,MAAM,UAAU;CACvE,IAAI,CAAC,QAAQ,OAAO,IAAI,yBAAyB,MAAM,WAAW,EAAE;CACpE,MAAM,QAAiB,CAAC;CACxB,KAAK,MAAM,QAAQ,IAAI;EACrB,MAAM,OAAO,OAAO,OAAO,MAAM,MAAM,EAAE,SAAS,IAAI;EACtD,IAAI,CAAC,MAAM,OAAO,IAAI,GAAG,OAAO,KAAK,iBAAiB,KAAK,EAAE;EAC7D,MAAM,KAAK,WAAW,gBAAgB,KAAK,WAAW,GAAG,KAAK,QAAQ,CAAC;CACzE;CACA,MAAM,QAAQ,MAAM,WAAW,IAAI,UAAU,MAAM,EAAW,IAAI,EAAE,MAAM,KAAK;CAC/E,OAAO,GAAG;EAAE,QAAQ,OAAO;EAAM,MAAM,WAAW,OAAO,MAAM,QAAQ;CAAE,CAAC;AAC5E;;AAGA,MAAM,cAAc,EAAE,QAAQ,YAC5B,MAAM,YAAY,OAAO,qBAAqB,QAAQ,OAAO,SAAS,SAAS,MAAM,IAAI;AAE3F,MAAa,WAAW,WAAW;CACjC,IAAI;CACJ,OAAO;CACP,UAAU;CACV,aAAa;CACb,OAAO,CAAC;EAAE,IAAI;EAAM,OAAO;EAAM,MAAM,CAAC,IAAI;CAAE,CAAC;CAC/C,QAAQ;CACR,QAAQ;CACR,iBAAiB;EAAE,IAAI;EAAI,QAAQ;EAAI,KAAK,CAAC;CAAE;CAC/C,QAAA;CACA,UAAU,GAAG,QAAQ;EACnB,MAAM,QAAQ,IAAI,MAAM,EAAE,EAAE;EAC5B,MAAM,SAAsB,CAAC;EAC7B,MAAM,UAAU,IAAI,MAAM;EAC1B,IAAI,CAAC,QAAQ,SAAS,MAAM,MAAM,EAAE,SAAS,EAAE,MAAM,GACnD,OAAO;GAAE,IAAI;GAAO,OAAO,CAAC,EAAE,SAAS,yBAAyB,EAAE,OAAO,GAAG,CAAC;EAAE;EAEjF,MAAM,aAAa,OAAO,KAAK,MAAM,KAAK,MAAM;EAChD,KAAK,MAAM,QAAQ;GACjB,GAAG,OAAO,KAAK,EAAE,WAAW,CAAC,CAAC;GAC9B,GAAG,OAAO,KAAK,EAAE,SAAS,CAAC,CAAC;GAC5B,GAAG,OAAO,KAAK,EAAE,QAAQ,CAAC,CAAC;EAC7B,GACE,IAAI,CAAC,WAAW,SAAS,IAAI,GAC3B,OAAO,KAAK,EAAE,SAAS,IAAI,KAAK,sBAAsB,EAAE,KAAK,CAAC;EAGlE,MAAM,QAAgC,CAAC;EACvC,MAAM,UAAsD,CAAC;EAC7D,MAAM,aAAuC,CAAC;EAC9C,MAAM,OAAgC,CAAC;EACvC,MAAM,2BAAW,IAAI,IAAI,CAAC,EAAE,MAAM,CAAC;EACnC,KAAK,MAAM,QAAQ,YAAY;GAC7B,MAAM,OAAO,EAAE,UAAU,SAAS;GAClC,MAAM,SAAS,MAAM,QAAQ;GAC7B,MAAM,QAAQ;IAAE,MAAM,OAAO;IAAM,OAAO,OAAO;GAAM;GACvD,MAAM,WAAW,cAAc,SAAS,EAAE,QAAQ,IAAI;GACtD,IAAI,CAAC,SAAS,IAAI;IAChB,OAAO,KAAK;KAAE,SAAS,SAAS;KAAO,GAAG;IAAM,CAAC;IACjD;GACF;GACA,IAAI,WAAW,SAAS,MAAM;GAC9B,MAAM,MAAM,EAAE,OAAO;GACrB,IAAI,KAAK;IACP,MAAM,QAAQ,QAAQ,SAAS,SAAS,MAAM,OAAO,IAAI,EAAE;IAC3D,IAAI,CAAC,MAAM,IAAI;KACb,OAAO,KAAK,EAAE,SAAS,QAAQ,KAAK,IAAI,MAAM,QAAQ,CAAC;KACvD;IACF;IACA,WAAW,MAAM,MAAM;IACvB,KAAK,QAAQ;KAAE,QAAQ,MAAM,MAAM;KAAQ,IAAI,IAAI;IAAG;GACxD;GACA,MAAM,OAAO,MAAM,KAAK,OAAO;GAC/B,MAAM,UAAU,OAAO,WAAW;GAClC,IAAI,CAAC,WAAW,SAAS,QAAQ,GAC/B,OAAO,KAAK;IACV,SAAS,GAAG,KAAK,WAAW,KAAK,QAAQ,EAAE,QAAQ,KAAK,OAAO;IAC/D,GAAG;GACL,CAAC;GAEH,MAAM,QAAQ;GACd,QAAQ,QAAQ,SAAS,MAAM,MAAM;GACrC,WAAW,QAAQ,SAAS;GAC5B,SAAS,IAAI,SAAS,MAAM,OAAO,IAAI;EACzC;EACA,KAAK,MAAM,KAAK,EAAE,KAAK;GACrB,MAAM,OAAO,MAAM,KAAK,OAAO;GAC/B,MAAM,WAAW,WAAW;GAC5B,IAAI,CAAC,MAAM,OAAO,KAAK,EAAE,SAAS,QAAQ,EAAE,sBAAsB,EAAE,KAAK,CAAC;QACrE,IACH,UAAU,IAAI,MACZ,MAAM,QAAQ,EAAE,CAAY,aAAa,CAAC,YAAY,CAAC,WAAW,QAAQ,IAE5E,OAAO,KAAK,EAAE,SAAS,QAAQ,EAAE,0BAA0B,KAAK,IAAI,IAAI,CAAC;EAE7E;EACA,IAAI,EAAE,SAAS,WAAW;GACxB,MAAM,MAAM,IAAI,QAAQ,OAAO,EAAE;GACjC,MAAM,QAAQ,KAAK,OAAO,QAAQ,KAAA,KAAa,KAAK,OAAO,YAAY,QAAQ,KAAA;GAC/E,MAAM,SAAS,cAAc,KAAK,QAAQ,OAAO;GACjD,IAAI,CAAC,SAAU,WAAW,UAAU,WAAW,mBAC7C,OAAO,KAAK,EACV,SAAS,+DAA+D,EAAE,GAAG,4EAC/E,CAAC;EAEL;EACA,IAAI,OAAO,QAAQ,OAAO;GAAE,IAAI;GAAO,OAAO;EAAO;EAErD,MAAM,WAAW,EAAE,IAAI,KAAK,MAAM,MAAM,EAAY;EACpD,MAAM,QAAQ,EAAE,QACZ,OAAO,YACL,OAAO,QAAQ,EAAE,KAAK,CAAC,CAAC,KAAK,CAAC,GAAG,OAAO,CAAC,MAAM,IAAc,CAAgB,CAAC,CAChF,IACA,KAAA;EAEJ,OAAO,GAAG;GACR,QAAQ;GACR,QAAQ,CAAC,GAAG,QAAQ,CAAC,CAAC,KAAK;GAC3B,MAAM,QAAQ,QAAQ;IAEpB,MAAM,OAAO,CAAC,GAAG,OAAO,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,MAAM;KAC5C,KAAK,MAAM,KAAK,EAAE,KAAK;MACrB,MAAM,IAAI,YAAY,EAAE,IAAW,EAAE,EAAS;MAC9C,IAAI,MAAM,GAAG,OAAO;KACtB;KACA,OAAO;IACT,CAAC;IACD,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAC/B,IAAI,MAAM,KAAK,IAAW,EAAE,GAAG,MAAM,MAAM,KAAK,IAAI,IAAW,EAAE,GAAG,GAAG;KACrE,MAAM,SAAS,EAAE,IAAI,KAAK,MAAM,OAAQ,KAAK,EAAE,CAAS,EAAS,CAAC;KAClE,OAAO,IAAI;MACT,MAAM;MACN,SAAS,GAAG,EAAE,IAAI,KAAK,IAAI,EAAE,GAAG,KAAK,UAAU,MAAM,EAAE;MACvD,SAAS,CAAC,MAAM;KAClB,CAAC;IACH;IAEF,MAAM,MAAM,KAAK,KAAK,QAAQ;KAC5B,MAAM,SAA+B,CAAC;KACtC,KAAK,MAAM,QAAQ,YAAY;MAC7B,IAAI,CAAC,OAAO,OAAO,KAAK,IAAI,GAAG;MAC/B,MAAM,IAAI,IAAI,SAAS;MACvB,MAAM,OAAO,QAAQ;MACrB,OAAO,MAAM,SACX,MAAM,QAAQ,SAAS,SAAS,aAAa,GAAc,IAAI,EAAE,IAAI,OAAO,CAAC;KACjF;KACA,OAAO;IACT,CAAC;IACD,OAAO,GAAG;KACR,MAAM;KACN,OAAO;MACL,MAAM,IAAI;MACV,QAAQ,EAAE;MACV,KAAK;MACL,MAAM;MACN,GAAI,QAAQ,EAAE,MAAM,IAAI,CAAC;MACzB,GAAI,OAAO,KAAK,IAAI,CAAC,CAAC,SAAS,EAAE,KAAK,IAAI,CAAC;MAC3C,GAAI,EAAE,SAAS,YAAY,EAAE,MAAM,UAAmB,IAAI,CAAC;KAC7D;IACF,CAAC;GACH;EACF,CAAC;CACH;AACF,CAAC;ACpOD,MAAa,gBAAgB,WAAW;CACtC,IAAI;CACJ,OAAO;CACP,UAAU;CACV,aAAa;CACb,OAAO,CAAC;EAAE,IAAI;EAAU,OAAO;EAAU,MAAM,CAAC,QAAQ;EAAG,UAAU;CAAK,CAAC;CAC3E,QAAQ;CACR,iBAAiB;EAAE,KAAK;EAAI,QAAQ,CAAC;EAAG,QAAQ;GAAE,MAAM;GAAU,YAAY,CAAC;EAAE;CAAE;CACnF,QAda,EAAE,aAAa;EAC5B,KAAK,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;EACrB,QAAQ,EAAE,MAAM,MAAM,CAAC,CAAC,IAAI,CAAC;EAC7B,QAAQ;CACV,CAUE;CACA,UAAU,GAAG,QAAQ;EACnB,KAAK,MAAM,MAAM,EAAE,QAAQ,IAAI,MAAM,EAAE;EACvC,MAAM,aAAa,IAAI,MAAM,cAAc,CAAC;EAC5C,IAAI,CAAC,OAAO,OAAO,YAAY,EAAE,GAAG,GAAG,OAAO,KAAK,sBAAsB,EAAE,IAAI,EAAE;EACjF,MAAM,OAAO,iBAAiB,EAAE,MAAM;EACtC,IAAI,CAAC,KAAK,IAAI,OAAO,KAAK,WAAW,KAAK,OAAO;EACjD,MAAM,SAAS,KAAK;EACpB,MAAM,YAAY,WAAW,EAAE;EAC/B,OAAO,GAAG;GACR,QAAQ;IAAE,MAAM;IAAQ,SAAS,WAAW,IAAI,IAAI,MAAM;GAAE;GAC5D,MAAM,QAAQ,QAAQ;IACpB,MAAM,SAAS,UAAU,IAAI,EAAE,OAAO,IAAI,MAAM,GAAG,GAAG;IACtD,IAAI,CAAC,OAAO,IAAI,OAAO,IAAI;KAAE,MAAM;KAAoB,SAAS,OAAO;IAAM,CAAC;IAC9E,MAAM,SAAS,SAAS,IAAI,IAAI,OAAO,OAAO,MAAM;IACpD,OAAO,OAAO,KAAK,GAAG,EAAE,MAAM,OAAO,MAAM,CAAC,IAAI;GAClD;EACF,CAAC;CACH;AACF,CAAC;;;;AE3BD,MAAM,MAAM;CACV;CACA;CACA;CACA;CACA;CACA;CDZuB,WAAW;EAClC,IAAI;EACJ,OAAO;EACP,UAAU;EACV,aAAa;EACb,OAAO,CAAC;GAAE,IAAI;GAAU,OAAO;GAAU,MAAM,CAAC,QAAQ;GAAG,UAAU;EAAK,CAAC;EAC3E,QAAQ;EACR,iBAAiB,EAAE,QAAQ,CAAC,EAAE;EAC9B,QAVa,EAAE,aAAa,EAAE,QAAQ,EAAE,MAAM,MAAM,CAAC,CAAC,IAAI,CAAC,EAAE,CAU7D;EACA,UAAU,GAAG,QAAQ;GACnB,MAAM,UAAU,EAAE,OAAO,KAAK,OAAO,IAAI,MAAM,EAAE,CAAC;GAClD,MAAM,QAAQ,QAAQ;GACtB,MAAM,QAAQ,OAAO,KAAK,MAAM,KAAK,MAAM,CAAC,CAAC,KAAK;GAClD,MAAM,SAAsB,CAAC;GAC7B,MAAM,SAAgC,CAAC;GACvC,MAAM,UAAkC,CAAC;GACzC,KAAK,MAAM,CAAC,GAAG,QAAQ,QAAQ,QAAQ,GAAG;IACxC,MAAM,QAAQ,OAAO,KAAK,IAAI,KAAK,MAAM,CAAC,CAAC,KAAK;IAChD,IAAI,MAAM,KAAK,IAAQ,MAAM,MAAM,KAAK,IAAQ,GAC9C,OAAO,KACL,GAAG,EAAE,OAAO,GAAG,cAAc,MAAM,KAAK,IAAI,EAAE,IAAI,EAAE,OAAO,GAAG,OAAO,MAAM,KAAK,IAAI,GACtF;GAEJ;GACA,KAAK,MAAM,QAAQ,OAAO;IACxB,IAAI,OAAc,EAAE;IACpB,IAAI,UAAiB,EAAE;IACvB,IAAI,YAAY;IAChB,KAAK,MAAM,CAAC,GAAG,QAAQ,QAAQ,QAAQ,GAAG;KACxC,MAAM,QAAQ,IAAI,KAAK,OAAO;KAC9B,MAAM,IAAI,MAAM,MAAM,KAAK;KAC3B,IAAI,CAAC,EAAE,IAAI;MACT,OAAO,KAAK,EACV,SAAS,GAAG,KAAK,IAAI,EAAE,OAAO,GAAG,SAAS,KAAK,KAAK,EAAE,mBAAmB,KAAK,IAAI,IACpF,CAAC;MACD;KACF;KACA,OAAO,EAAE;KACT,MAAM,SAAS,IAAI,QAAQ;KAC3B,cAAc,OAAO;KACrB,UAAU,SAAS,MAAM,SAAS,OAAO,WAAW,KAAK,CAAC;IAC5D;IACA,OAAO,QAAQ;IACf,QAAQ,QAAQ;KAAE,MAAM,IAAI;KAAI,OAAO;KAAM;KAAW,GAAI,YAAY,EAAE,QAAQ,IAAI,CAAC;IAAG;GAC5F;GACA,IAAI,OAAO,QAAQ,OAAO;IAAE,IAAI;IAAO,OAAO;GAAO;GACrD,OAAO,GAAG;IACR,QAAQ;KAAE,MAAM,EAAE,OAAO,MAAM;KAAG;IAAQ;IAC1C,MAAM,WAAW;KACf,MAAM,uBAAO,IAAI,IAAY;KAC7B,MAAM,OAAc,CAAC;KACrB,KAAK,MAAM,MAAM,EAAE,QACjB,KAAK,MAAM,OAAO,OAAO,EAAE,GAAG;MAC5B,MAAM,IAAI,MAAM,KAAK,KAAK;MAC1B,IAAI,KAAK,IAAI,CAAC,GAAG;MACjB,KAAK,IAAI,CAAC;MACV,KAAK,KAAK,GAAG;KACf;KAEF,OAAO,GAAG,EAAE,KAAK,CAAC;IACpB;GACF,CAAC;EACH;CACF,CClDE;CACA;CACA;CACA;CACA;AACF;AAEA,MAAa,eAA2D,OAAO,YAC7E,IAAI,KAAK,QAAQ,CAAC,IAAI,IAAI,GAAkC,CAAC,CAC/D;AAaA,MAAa,cAAuC,IAAI,KACrD,EAAE,IAAI,OAAO,UAAU,aAAa,OAAO,QAAQ,gBAAgB;CAClE;CACA;CACA;CACA;CACA;CACA;CACA;AACF,EACF;;;ACzCA,SAAS,GAAG,MAAyC,MAAkC;CACrF,IAAI,QAAiB;CACrB,KAAK,MAAM,OAAO,MAAM;EACtB,IAAI,OAAO,UAAU,YAAY,UAAU,MAAM,OAAO,KAAA;EACxD,QAAS,MAAkC;CAC7C;CACA,OAAO;AACT;;AAGA,SAAgB,SAAS,MAAuB;CAC9C,MAAM,MAAM,OAAO,OAAO,cAAc,KAAK,EAAE,IAAI,aAAa,KAAK,MAAM,KAAA;CAC3E,IAAI,CAAC,KAAK,OAAO,CAAC;CAClB,MAAM,OAAc,CAAC;CACrB,KAAK,MAAM,QAAQ,IAAI,OAAO;EAC5B,MAAM,QAAQ,GAAG,MAAM,KAAK,IAAI;EAChC,IAAI,KAAK,YAAY,MAAM,QAAQ,KAAK,GACjC;QAAA,MAAM,CAAC,OAAO,WAAW,MAAM,QAAQ,GAC1C,IAAI,OAAO,WAAW,YAAY,WAAW,IAAI,KAAK,KAAK;IAAE,MAAM,KAAK;IAAI;IAAQ;GAAM,CAAC;EAAA,OAExF,IAAI,OAAO,UAAU,YAAY,UAAU,IAChD,KAAK,KAAK;GAAE,MAAM,KAAK;GAAI,QAAQ;EAAM,CAAC;CAE9C;CACA,OAAO;AACT;;AAGA,SAAgB,SAAS,MAA0B;CACjD,OAAO,CAAC,GAAG,IAAI,IAAI,SAAS,IAAI,CAAC,CAAC,KAAK,MAAM,EAAE,MAAM,CAAC,CAAC;AACzD;;AAGA,SAAgB,UAAU,OAAmD;CAC3E,MAAM,MAAM,IAAI,IAAI,MAAM,KAAK,MAAM,EAAE,EAAE,CAAC;CAC1C,MAAM,OAAO,IAAI,IAAsB,MAAM,KAAK,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;CACnE,KAAK,MAAM,QAAQ,OACjB,KAAK,MAAM,UAAU,SAAS,IAAI,GAChC,IAAI,IAAI,IAAI,MAAM,GAAG,KAAM,IAAI,MAAM,CAAC,CAAc,KAAK,KAAK,EAAE;CAGpE,OAAO;AACT;AAEA,SAAS,MAAM,OAAe,MAA2D;CACvF,MAAM,uBAAO,IAAI,IAAY;CAC7B,MAAM,QAAQ,CAAC,GAAI,KAAK,IAAI,KAAK,KAAK,CAAC,CAAE;CACzC,OAAO,MAAM,SAAS,GAAG;EACvB,MAAM,KAAK,MAAM,IAAI;EACrB,IAAI,KAAK,IAAI,EAAE,GAAG;EAClB,KAAK,IAAI,EAAE;EACX,MAAM,KAAK,GAAI,KAAK,IAAI,EAAE,CAAuB;CACnD;CACA,OAAO;AACT;;AAGA,SAAgB,WAAW,OAA4B,IAAyB;CAC9E,OAAO,MAAM,IAAI,UAAU,KAAK,CAAC;AACnC;;AAGA,SAAgB,SAAS,OAA4B,IAAyB;CAC5E,MAAM,MAAM,IAAI,IAAI,MAAM,KAAK,MAAM,EAAE,EAAE,CAAC;CAE1C,OAAO,MAAM,IAAI,IADA,IAAI,MAAM,KAAK,MAAM,CAAC,EAAE,IAAI,SAAS,CAAC,CAAC,CAAC,QAAQ,MAAM,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,CAC/D,CAAC;AACvB;;AAGA,SAAgB,eAAe,OAA6C;CAC1E,MAAM,OAAO,UAAU,KAAK;CAC5B,MAAM,wBAAQ,IAAI,IAA6B;CAC/C,MAAM,OAAiB,CAAC;CACxB,MAAM,SAAS,OAAgC;EAC7C,MAAM,IAAI,IAAI,MAAM;EACpB,KAAK,KAAK,EAAE;EACZ,KAAK,MAAM,MAAM,KAAK,IAAI,EAAE,GAAe;GACzC,IAAI,MAAM,IAAI,EAAE,MAAM,QAAQ,OAAO,CAAC,GAAG,KAAK,MAAM,KAAK,QAAQ,EAAE,CAAC,GAAG,EAAE;GACzE,IAAI,CAAC,MAAM,IAAI,EAAE,GAAG;IAClB,MAAM,QAAQ,MAAM,EAAE;IACtB,IAAI,OAAO,OAAO;GACpB;EACF;EACA,KAAK,IAAI;EACT,MAAM,IAAI,IAAI,MAAM;EACpB,OAAO;CACT;CACA,KAAK,MAAM,QAAQ,OAAO;EACxB,IAAI,MAAM,IAAI,KAAK,EAAE,GAAG;EACxB,MAAM,QAAQ,MAAM,KAAK,EAAE;EAC3B,IAAI,OAAO,OAAO;CACpB;CACA,OAAO;AACT;;;;;AAMA,SAAgB,iBAAiB,OAAsC;CACrE,MAAM,OAAO,UAAU,KAAK;CAC5B,MAAM,WAAW,IAAI,IAAI,MAAM,KAAK,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;CACpD,KAAK,MAAM,WAAW,KAAK,OAAO,GAChC,KAAK,MAAM,KAAK,SAAS,SAAS,IAAI,GAAI,SAAS,IAAI,CAAC,IAAe,CAAC;CAC1E,MAAM,WAAW,IAAI,IAAI,MAAM,KAAK,GAAG,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;CACvD,MAAM,QAAQ,MAAM,QAAQ,MAAM,SAAS,IAAI,EAAE,EAAE,MAAM,CAAC,CAAC,CAAC,KAAK,MAAM,EAAE,EAAE;CAC3E,MAAM,QAAkB,CAAC;CACzB,OAAO,MAAM,SAAS,GAAG;EACvB,MAAM,MAAM,GAAG,MAAO,SAAS,IAAI,CAAC,IAAgB,SAAS,IAAI,CAAC,CAAY;EAC9E,MAAM,KAAK,MAAM,MAAM;EACvB,MAAM,KAAK,EAAE;EACb,KAAK,MAAM,MAAM,KAAK,IAAI,EAAE,GAAe;GACzC,MAAM,YAAa,SAAS,IAAI,EAAE,IAAe;GACjD,SAAS,IAAI,IAAI,SAAS;GAC1B,IAAI,cAAc,GAAG,MAAM,KAAK,EAAE;EACpC;CACF;CACA,OAAO;AACT;;;;;;;;;;;AC1EA,SAAS,SAAS,MAAyC;CACzD,MAAM,EAAE,IAAI,IAAI,IAAI,IAAI,OAAO,IAAI,GAAG,SAAS;CAC/C,OAAO;AACT;;;;;AAMA,SAAgB,iBAAiB,SAAyC;CACxE,MAAM,SAAyB,CAAC;CAChC,MAAM,uBAAO,IAAI,IAAsB;CACvC,KAAK,MAAM,QAAQ,QAAQ,OAAO;EAChC,IAAI,KAAK,IAAI,KAAK,EAAE,GAClB,OAAO,KAAK;GAAE,MAAM;GAAgB,SAAS,OAAO,KAAK,GAAG;GAAkB,MAAM,KAAK;EAAG,CAAC;EAC/F,KAAK,IAAI,KAAK,IAAI,IAAI;CACxB;CACA,KAAK,MAAM,QAAQ,QAAQ,OAAO;EAChC,MAAM,MAAM,OAAO,OAAO,cAAc,KAAK,EAAE,IAAI,aAAa,KAAK,MAAM,KAAA;EAC3E,IAAI,CAAC,KAAK;GACR,OAAO,KAAK;IAAE,MAAM;IAAc,SAAS,oBAAoB,KAAK,GAAG;IAAI,MAAM,KAAK;GAAG,CAAC;GAC1F;EACF;EACA,MAAM,OAAO,SAAS,IAAI;EAC1B,KAAK,MAAM,QAAQ,IAAI,OACrB,IAAI,CAAC,KAAK,YAAY,CAAC,KAAK,MAAM,MAAM,EAAE,SAAS,KAAK,EAAE,GACxD,OAAO,KAAK;GACV,MAAM;GACN,SAAS,UAAU,KAAK,MAAM;GAC9B,MAAM,KAAK;EACb,CAAC;EAGL,KAAK,MAAM,OAAO,MAAM;GACtB,MAAM,SAAS,KAAK,IAAI,IAAI,MAAM;GAClC,IAAI,CAAC,QACH,OAAO,KAAK;IACV,MAAM;IACN,SAAS,IAAI,IAAI,KAAK,4BAA4B,IAAI,OAAO;IAC7D,MAAM,KAAK;GACb,CAAC;QACI,IAAI,aAAa,OAAO,OAAO,CAAC,aAAa,OAAO,GAAG,EAAE,QAC9D,OAAO,KAAK;IACV,MAAM;IACN,SAAS,IAAI,IAAI,OAAO,KAAK,OAAO,GAAG;IACvC,MAAM,KAAK;GACb,CAAC;EAEL;CACF;CACA,MAAM,QAAQ,eAAe,QAAQ,KAAK;CAC1C,IAAI,OAAO,OAAO,KAAK;EAAE,MAAM;EAAS,SAAS,UAAU,MAAM,KAAK,MAAM;EAAK,MAAM,MAAM;CAAG,CAAC;CAGjG,MAAM,uBAAO,IAAI,IAAY;CAC7B,MAAM,aAAa,MAAgB,aAAa,EAAE,GAAG,EAAE,WAAW,KAAA;CAClE,MAAM,QAAQ,QAAQ,MAAM,OAAO,SAAS,CAAC,CAAC,KAAK,MAAM,EAAE,EAAE;CAC7D,MAAM,OAAO,IAAI,IAAI,QAAQ,MAAM,KAAK,MAAM,CAAC,EAAE,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC;CAClE,OAAO,MAAM,SAAS,GAAG;EACvB,MAAM,KAAK,MAAM,IAAI;EACrB,IAAI,KAAK,IAAI,EAAE,GAAG;EAClB,KAAK,IAAI,EAAE;EACX,MAAM,KAAK,GAAI,KAAK,IAAI,EAAE,KAAK,CAAC,CAAE;CACpC;CACA,KAAK,MAAM,QAAQ,QAAQ,OACzB,IAAI,CAAC,KAAK,IAAI,KAAK,EAAE,KAAK,aAAa,KAAK,KAC1C,OAAO,KAAK;EACV,MAAM;EACN,SAAS;EACT,MAAM,KAAK;CACb,CAAC;CAGL,KAAK,MAAM,MAAM,OAAO,KAAK,QAAQ,MAAM,GACzC,IAAI,CAAC,KAAK,IAAI,EAAE,GACd,OAAO,KAAK;EACV,MAAM;EACN,SAAS,8BAA8B,GAAG;EAC1C,OAAO;CACT,CAAC;CAEL,OAAO;AACT;;AAGA,SAAgB,eAAe,OAAuB,KAA8B;CAClF,MAAM,aAAa,iBAAiB,OAAO,GAAG;CAC9C,MAAM,UAAU,WAAW;CAC3B,MAAM,SAAyB,CAAC,GAAG,WAAW,QAAQ,GAAG,iBAAiB,OAAO,CAAC;CAClF,IAAI,OAAO,MAAM,MAAM,EAAE,SAAS,WAAW,EAAE,SAAS,cAAc,GACpE,OAAO;EAAE,IAAI;EAAO;EAAQ,OAAO,CAAC;CAAE;CAExC,MAAM,OAAO,IAAI,IAAI,QAAQ,MAAM,KAAK,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;CACxD,MAAM,QAAQ,EAAE,MAAM,MAAM;CAC5B,MAAM,0BAAU,IAAI,IAAwB;CAC5C,MAAM,2BAAW,IAAI,IAA2B;CAChD,MAAM,QAAQ,WACZ,UAAU,QAAQ;EAChB,QAAQ,QAAQ;EAChB,QAAQ,QAAQ;EAChB,WAAW,IAAI,aAAa,CAAC;EAC7B;CACF,CAAC;CAEH,KAAK,MAAM,MAAM,iBAAiB,QAAQ,KAAK,GAAG;EAChD,MAAM,OAAO,KAAK,IAAI,EAAE;EACxB,MAAM,MAAM,OAAO,OAAO,cAAc,KAAK,EAAE,IAAI,aAAa,KAAK,MAAM,KAAA;EAC3E,IAAI,CAAC,KAAK;EAEV,IADa,SAAS,IACf,CAAC,CAAC,MAAM,MAAM,CAAC,QAAQ,IAAI,CAAC,CAAC,GAAG;EAEvC,MAAM,SAAS,IAAI,OAAO,UAAU,SAAS,IAAI,CAAC;EAClD,IAAI,CAAC,OAAO,SAAS;GACnB,KAAK,MAAM,KAAK,OAAO,MAAM,QAC3B,OAAO,KAAK;IACV,MAAM;IACN,SAAS,GAAG,EAAE,KAAK,SAAS,GAAG,EAAE,KAAK,KAAK,GAAG,EAAE,MAAM,KAAK,EAAE;IAC7D,MAAM;GACR,CAAC;GAEH;EACF;EACA,MAAM,MAAM,QAAQ,OAAO;EAC3B,MAAM,UAAmB;GACvB;GACA,OAAO;GACP;GACA,GAAI,MAAM,EAAE,QAAQ,IAAI,IAAI,CAAC;GAC7B;GACA,QAAQ,QAAQ,QAAQ,IAAI,GAAG;GAC/B,WAAW;EACb;EACA,MAAM,SAAS,IAAI,QAAQ,OAAO,MAAM,OAAO;EAC/C,IAAI,CAAC,OAAO,IAAI;GACd,KAAK,MAAM,KAAK,OAAO,OACrB,OAAO,KAAK;IACV,MAAM,EAAE,QAAQ;IAChB,SAAS,EAAE;IACX,MAAM,EAAE,QAAQ;IAChB,GAAI,EAAE,UAAU,KAAA,IAAY,CAAC,IAAI,EAAE,OAAO,EAAE,MAAM;IAClD,GAAI,EAAE,SAAS,KAAA,IAAY,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK;GACjD,CAAC;GAEH;EACF;EACA,IAAI,SAAS,OAAO,MAAM;EAC1B,IAAI;EACJ,IAAI,KAAK;GACP,IAAI,CAAC,QAAQ;IACX,OAAO,KAAK;KACV,MAAM;KACN,SAAS,GAAG,KAAK,GAAG;KACpB,MAAM;IACR,CAAC;IACD;GACF;GACA,MAAM,IAAI,mBAAmB,IAAI,KAAK,QAAQ,IAAI;GAClD,IAAI,CAAC,EAAE,IAAI;IACT,KAAK,MAAM,KAAK,EAAE,OAEhB,OAAO,KAAK;KACV,MAAM;KACN,SAAS,EAAE;KACX,MAAM;KACN,OAAO,EAAE;IACX,CAAC;IAEH;GACF;GACA,SAAS,EAAE,MAAM;GACjB,QAAQ,EAAE,MAAM;EAClB;EACA,IAAI,QAAQ,QAAQ,IAAI,IAAI,MAAM;EAClC,SAAS,IAAI,IAAI;GACf,MAAM;IAAE,GAAG,OAAO;IAAO;GAAO;GAChC,QAAQ,OAAO;GACf,GAAI,QAAQ,EAAE,MAAM,IAAI,CAAC;EAC3B,CAAC;CACH;CAEA,OAAO,KAAK,GAAG,WAAW,QAAQ,GAAG,GAAG,WAAW,SAAS,QAAQ,CAAC;CACrE,MAAM,QAAQ,OAAO,YAAY,CAAC,GAAG,OAAO,CAAC,CAAC,KAAK,CAAC,IAAI,YAAY,CAAC,IAAI,OAAO,IAAI,CAAC,CAAC;CACtF,IAAI,OAAO,SAAS,GAAG,OAAO;EAAE,IAAI;EAAO,QAAQ,OAAO,MAAM;EAAG;CAAM;CACzE,OAAO;EAAE,IAAI;EAAM,MAAM,KAAK,SAAS,UAAU,MAAM,IAAI;EAAG,QAAQ,CAAC;EAAG;CAAM;AAClF;;AAWA,SAAS,OAAO,QAAiD;CAC/D,MAAM,uBAAO,IAAI,IAAY;CAC7B,OAAO,OAAO,QAAQ,MAAM;EAC1B,MAAM,MAAM,KAAK,UAAU;GAAC,EAAE;GAAM,EAAE;GAAO,EAAE;GAAM,EAAE;EAAO,CAAC;EAC/D,IAAI,KAAK,IAAI,GAAG,GAAG,OAAO;EAC1B,KAAK,IAAI,GAAG;EACZ,OAAO;CACT,CAAC;AACH;;AAGA,SAAS,WAAW,UAAoC;CACtD,MAAM,0BAAU,IAAI,IAAsB;CAC1C,KAAK,MAAM,CAAC,IAAI,MAAM,UACpB,KAAK,MAAM,UAAU,EAAE,KAAK,UAAU,CAAC,GACrC,QAAQ,IAAI,QAAQ,CAAC,GAAI,QAAQ,IAAI,MAAM,KAAK,CAAC,GAAI,EAAE,CAAC;CAE5D,OAAO,CAAC,GAAG,OAAO,CAAC,CAChB,QAAQ,GAAG,WAAW,MAAM,SAAS,CAAC,CAAC,CACvC,KAAK,CAAC,QAAQ,YAAY;EACzB,MAAM;EACN,SAAS,GAAG,MAAM,KAAK,OAAO,EAAE,cAAc,OAAO;EACrD,MAAM,MAAM;CACd,EAAE;AACN;;;;;AAMA,SAAS,WAAW,SAAyB,UAAoC;CAC/E,MAAM,OAAO,UAAU,QAAQ,KAAK;CACpC,MAAM,OAAO,IAAI,IAAI,QAAQ,MAAM,KAAK,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;CACxD,MAAM,SAAyB,CAAC;CAChC,KAAK,MAAM,CAAC,IAAI,MAAM,UAAU;EAE9B,IAAI,KAAK,IAAI,EAAE,CAAC,EAAE,OAAO,SAAS,CAAC,EAAE,KAAK,QAAQ,SAAS;EAC3D,MAAM,uBAAO,IAAI,IAAY;EAC7B,MAAM,QAAQ,CAAC,GAAI,KAAK,IAAI,EAAE,CAAc;EAC5C,OAAO,MAAM,SAAS,GAAG;GACvB,MAAM,IAAI,MAAM,IAAI;GACpB,IAAI,KAAK,IAAI,CAAC,GAAG;GACjB,KAAK,IAAI,CAAC;GACV,MAAM,OAAO,KAAK,IAAI,CAAC;GACvB,MAAM,MAAM,aAAa,KAAK;GAC9B,IAAI,KAAK,gBAAgB;IACvB,MAAM,SAAS,SAAS,IAAI,CAAC,CAAC,EAAE;IAChC,IAAI,UAAU,CAAC,IAAI,eAAe,MAAM,GACtC,OAAO,KAAK;KACV,MAAM;KACN,SAAS,GAAG,GAAG,0GAA0G,GAAG;KAC5H,MAAM;IACR,CAAC;IAEH;GACF;GACA,MAAM,KAAK,GAAI,KAAK,IAAI,CAAC,CAAc;EACzC;CACF;CACA,OAAO;AACT;AAEA,SAAS,KAAK,SAAyB,UAAoB,WAA0B;CACnF,MAAM,QAAQ,iBAAiB,QAAQ,KAAK;CAC5C,MAAM,OAAO,IAAI,IAAI,QAAQ,MAAM,KAAK,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;CACxD,MAAM,OAAO,UAAU,QAAQ,KAAK;CACpC,MAAM,0BAAU,IAAI,IAAoB;CACxC,KAAK,MAAM,CAAC,GAAG,OAAO,MAAM,QAAQ,GAClC,KAAK,MAAM,OAAO,SAAS,KAAK,IAAI,EAAE,CAAa,GAAG,QAAQ,IAAI,KAAK,CAAC;CAE1E,MAAM,6BAAa,IAAI,IAAsB;CAC7C,MAAM,+BAAe,IAAI,IAAqB;CAC9C,KAAK,MAAM,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,QAAQ,GAAG;EACrC,MAAM,KAAM,KAAK,IAAI,EAAE,CAAC,CAAc;EAEtC,MAAM,QAAQ,KAAK,IAAI,EAAE;EACzB,MAAM,QAAQ,MAAM,SAAS,MAAM,WAAW,IAAI,CAAC,CAAa;EAChE,WAAW,IAAI,IAAI,CAAC,GAAG,IAAI,IAAI,OAAO,SAAS,CAAC,IAAI,GAAG,KAAK,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC;EAC9E,aAAa,IAAI,IAAI,OAAO,aAAa,MAAM,MAAM,MAAM,aAAa,IAAI,CAAC,CAAC,CAAC;CACjF;CAkBA,OAAO;EAAE;EAAS,OAjBW,MAAM,KAAK,OAAO;GAC7C,MAAM,OAAO,KAAK,IAAI,EAAE;GACxB,MAAM,IAAI,SAAS,IAAI,EAAE;GACzB,MAAM,MAAM,aAAa,KAAK;GAC9B,OAAO;IACL;IACA,IAAI,KAAK;IACT,QAAQ,EAAE;IACV,QAAQ,SAAS,IAAI;IACrB,QAAQ,EAAE,KAAK;IACf,GAAI,KAAK,SAAS,EAAE,QAAQ,IAAI,OAAO,IAAI,CAAC;IAC5C,KAAK,EAAE,KAAK;IACZ,GAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,IAAI,CAAC;IACpC,OAAO,WAAW,IAAI,EAAE;IACxB,cAAc,aAAa,IAAI,EAAE;GACnC;EACF,CACsB;EAAG;EAAS;CAAU;AAC9C;;;;AC1RA,SAAgB,SAAS,MAAgE;CACvF,OAAO,KAAK,MACT,QAAQ,MAAM,EAAE,OAAO,QAAQ,CAAC,CAChC,KAAK,OAAO;EAAE,MAAM,EAAE;EAAI,QAAQ,OAAO,EAAE,OAAO,MAAM;EAAG,QAAQ,OAAO,EAAE,OAAO,MAAM;CAAE,EAAE;AAClG;;AAGA,eAAsB,aACpB,MACA,MAKmB;CACnB,MAAM,WAAyE,CAAC;CAChF,KAAK,MAAM,UAAU,SAAS,IAAI,GAChC,SAAS,OAAO,QAAQ,OAAO,OAAO,CAAC,GAAI,MAAM,KAAK,MAAM,CAAE,CAAC;CACjE,OAAO,OAAO,OAAO,QAAQ;AAC/B;AAEA,SAAgB,QACd,MACA,UACA,KACA,UAA0B,CAAC,GAChB;CACX,MAAM,MAAM,OAAO,IAAI,QAAQ,WAAW,QAAQ,MAAM,IAAI,GAAG,IAAI,IAAI;CACvE,IAAI,CAAC,KAAK,MAAM,IAAI,MAAM,YAAY,OAAO,IAAI,GAAG,EAAE,wBAAwB;CAC9E,MAAM,QAAQ,QAAQ,gBAAgB,YAAY,IAAI;CACtD,MAAM,MAAkB,OAAO,OAAO;EACpC;EACA,IAAI,IAAI,MAAM;EACd,QAAQ,IAAI,UAAU;EACZ;EACV,QAAQ,KAAK,QAAQ;EACrB,QAAQ,KAAK,QAAQ;EACrB,KAAK;GACH,WAAW,IAAI,aAAa;GAC5B,kBAAkB,GAAG,KAAK,QAAQ,GAAG,GAAG,KAAK,QAAQ;EACvD;CACF,CAAC;CAED,MAAM,0BAAU,IAAI,IAAsB;CAC1C,MAAM,WAAqC,CAAC;CAC5C,MAAM,yBAAS,IAAI,IAAwB;CAC3C,MAAM,QAAqB,CAAC;CAC5B,MAAM,SAAqB,CAAC;CAC5B,MAAM,yBAAS,IAAI,IAAuB;CAC1C,MAAM,UAAoB,CAAC;CAC3B,MAAM,uBAAO,IAAI,IAAY;CAC7B,IAAI,UAAU;CAEd,KAAK,MAAM,CAAC,GAAG,SAAS,KAAK,MAAM,QAAQ,GAAG;EAC5C,MAAM,UAAU,GAAe,QAA4B,CAAC,MAAM;GAChE,OAAO,IAAI,KAAK,IAAI,CAAC;GACrB,MAAM,KAAK;IACT,MAAM,KAAK;IACX,IAAI,KAAK;IACT,QAAQ;IACR,QAAQ;IACR,SAAS;IACT,SAAS;IACT,SAAS;IACT,IAAI;IACJ,GAAG;GACL,CAAC;EACH;EAEA,IAAI,WAAW,CAAC,QAAQ,WAAW,CAAC,KAAK,cAAc,OAAO,SAAS;OAClE,IAAI,KAAK,OAAO,MAAM,OAAO,OAAO,IAAI,EAAE,MAAM,IAAI,GAAG,OAAO,iBAAiB;OAC/E;GACH,MAAM,SAAS,KAAK,OAAO,QAAQ,GAAG,OAAO,IAAK,QAAQ,IAAI,EAAE,CAAC,CAAc,QAAQ,CAAC;GACxF,MAAM,QAAQ,MAAM;GACpB,MAAM,SAAS,KAAK,KAAK,OAAO,QAAQ,IAAI,EAAE,GAAe,KAAK;IAChE,GAAI,IAAI,WAAW,KAAK,QAAQ,KAAA,IAAY,CAAC,IAAI,EAAE,UAAU,IAAI,SAAS,KAAK,IAAI;IACnF,GAAI,QAAQ,UAAU,EAAE,WAAW,KAAK,IAAI,CAAC;GAC/C,CAAC;GACD,IAAI,CAAC,OAAO,IAAI;IACd,MAAM,IAAI,OAAO;IACjB,OAAO,KAAK;KACV,MAAM,KAAK;KACX,MAAM,EAAE;KACR,SAAS,EAAE;KACX,GAAI,EAAE,UAAU,EAAE,SAAS,EAAE,QAAQ,IAAI,CAAC;IAC5C,CAAC;IACD,OAAO,KAAK,GAAI,EAAE,UAAU,CAAC,CAAE;IAC/B,IAAI,EAAE,MAAM,UAAU;IACtB,OAAO,UAAU;KAAE;KAAQ,IAAI,MAAM,IAAI;IAAM,CAAC;GAClD,OAAO;IACL,IAAI,MAAe,OAAO;IAC1B,IAAI,KAAK,OAAO;KACd,MAAM,UAAU,KAAK,MAAM,IAAI,MAAM,KAAK;MACxC,GAAI,IAAI,WAAW,KAAK,QAAQ,KAAA,IAAY,CAAC,IAAI,EAAE,UAAU,IAAI,SAAS,KAAK,IAAI;MACnF,GAAI,QAAQ,UAAU,EAAE,WAAW,KAAK,IAAI,CAAC;KAC/C,CAAC;KACD,MAAM;MACJ,GAAG;MACH,MAAM,QAAQ;MACd,UAAU,IAAI,WAAW,KAAK,QAAQ;MACtC,QAAQ,CAAC,GAAI,IAAI,UAAU,CAAC,GAAI,GAAG,QAAQ,MAAM;MACjD,MAAM,IAAI,QAAQ,QAAQ;MAC1B,gBAAgB,IAAI,kBAAkB,QAAQ;KAChD;IACF;IACA,OAAO,KAAK,GAAI,IAAI,UAAU,CAAC,CAAE;IACjC,IAAI,IAAI,MAAM,UAAU;IACxB,IAAI,IAAI,gBAAgB,KAAK,MAAM,KAAK,KAAK,OAAO,KAAK,IAAI,CAAC;IAC9D,IAAI,IAAI,OAAO,OAAO,IAAI,KAAK,IAAI,IAAI,KAAK;IAE5C,IAAI,IAAI,QACN,QAAQ,KACN,KAAK,QACD;KAAE,GAAG,IAAI;KAAQ,MAAM,IAAI,KAAK,KAAK,MAAM,OAAO,CAAC,CAA2B;IAAE,IAChF,IAAI,MACV;IAEF,QAAQ,IAAI,KAAK,IAAI,IAAI,IAAI;IAC7B,IAAI,QAAQ,QAAQ,SAAS,KAAK,MAAM,IAAI;IAC5C,OAAO,MAAM;KACX;KACA,SAAS,IAAI,KAAK;KAClB,SAAS,IAAI,WAAW;KACxB,SAAS,IAAI,WAAW;KACxB,IAAI,MAAM,IAAI;IAChB,CAAC;GACH;EACF;EACA,KAAK,MAAM,MAAM,KAAK,QAAQ,IAAI,KAAK,QAAQ,IAAI,EAAE,MAAM,GAAG,QAAQ,OAAO,EAAE;CACjF;CAEA,MAAM,QAAsB,KAAK,MAC9B,QAAQ,MAAM,EAAE,WAAW,MAAM,CAAC,CAClC,KAAK,MAAM;EACV,MAAM,IAAI,OAAO,IAAI,EAAE,EAAE;EACzB,MAAM,QAAQ,OAAO,IAAI,EAAE,EAAE;EAC7B,IAAI,SAAS,OAAO;GAAE,MAAM,EAAE;GAAI,QAAQ;EAAU;EACpD,IAAI,MAAM,UAAU,OAAO;GAAE,MAAM,EAAE;GAAI,QAAQ;EAAS;EAC1D,IAAI,MAAM,QAAQ,CAAC,OAAO,OAAO;GAAE,MAAM,EAAE;GAAI,QAAQ;EAAkB;EACzE,IAAI,KAAK,IAAI,EAAE,EAAE,GAAG,OAAO;GAAE,MAAM,EAAE;GAAI,QAAQ;EAAO;EACxD,OAAO;GAAE,MAAM,EAAE;GAAI,QAAQ;GAAS;EAAM;CAC9C,CAAC;CAEH,OAAO;EACL,QAAQ,UACJ,YACA,MAAM,OAAO,MAAM,EAAE,WAAW,OAAO,KAAK,CAAC,GAAG,OAAO,OAAO,CAAC,CAAC,CAAC,OAAO,MAAM,MAAM,IAAI,IACtF,OACA;EACN;EACA;EACA;EACA;EACA,GAAI,QAAQ,SAAS,EAAE,SAAS,SAAS,IAAI,CAAC;CAChD;AACF;;;ACjMA,MAAM,cAAc;AAEpB,SAAgB,YAAY,MAA6B;CACvD,OAAO,KAAK,QAAQ,SAAS,KAAK,SAAS,UAAU;EACnD,MAAM,WAAqB,CAAC;EAC5B,MAAM,OAAO;GAAE;GAAO,GAAI,QAAQ,OAAO,EAAE,MAAM,QAAQ,KAAK,IAAI,CAAC;EAAG;EACtE,MAAM,UAAU,IAAI,IAAI,KAAK,MAAM,QAAQ,MAAM,EAAE,OAAO,QAAQ,CAAC,CAAC,KAAK,MAAM,EAAE,EAAE,CAAC;EACpF,MAAM,QAAQ,IAAI,IAAI,KAAK,MAAM,KAAK,MAAM,EAAE,EAAE,CAAC;EACjD,KAAK,MAAM,MAAM,OAAO,KAAK,QAAQ,OAAO,GAC1C,IAAI,CAAC,QAAQ,IAAI,EAAE,GAAG,SAAS,KAAK,kBAAkB,GAAG,8BAA8B;EAEzF,KAAK,MAAM,MAAM,OAAO,KAAK,QAAQ,MAAM,GACzC,IAAI,CAAC,MAAM,IAAI,EAAE,GAAG,SAAS,KAAK,8BAA8B,GAAG,EAAE;EAEvE,IAAI,KAAK,aAAa,QAAQ,QAAQ,KAAA,GACpC,SAAS,KAAK,qEAAmE;EAEnF,MAAM,MAAM,QAAQ,MAAM,QAAQ,OAAO,WAAW;EACpD,IAAI,CAAC,KAAK,SAAS,KAAK,QAAQ,QAAQ,IAAI,wBAAwB;EACpE,MAAM,KAAK,QAAQ,MAAM;EACzB,IAAI,CAAC,WAAW,EAAE,GAAG,SAAS,KAAK,sBAAsB,GAAG,EAAE;EAC9D,IAAI,SAAS,QAAQ,OAAO;GAAE,GAAG;GAAM,QAAQ;GAAO;GAAU,OAAO,CAAC;GAAG,QAAQ,CAAC;EAAE;EAEtF,MAAM,MAAM,QACV,MACA,QAAQ,SACR;GAAO;GAAgB;EAAG,GAC1B;GAAE,QAAQ;GAAM,SAAS;EAAK,CAChC;EACA,IAAI,IAAI,WAAW,WAAW;GAC5B,MAAM,MAAM,IAAI,OACb,QAAQ,MAAM,EAAE,WAAW,MAAM,CAAC,CAClC,KAAK,MAAM,GAAG,EAAE,KAAK,IAAI,EAAE,SAAS;GACvC,SAAS,KAAK,cAAc,IAAI,SAAS,KAAK,IAAI,KAAK,IAAI,MAAM,IAAI;EACvE;EACA,KAAK,MAAM,KAAK,IAAI,OAClB,IAAI,EAAE,WAAW,UAAU;GACzB,MAAM,MAAM,IAAI,OAAO,QAAQ,MAAM,EAAE,SAAS,EAAE,IAAI,CAAC,CAAC,KAAK,MAAM,EAAE,OAAO;GAC5E,SAAS,KAAK,GAAG,EAAE,KAAK,WAAW,IAAI,KAAK,IAAI,GAAG;EACrD;EAGF,MAAM,QAAoB,CAAC;EAC3B,KAAK,MAAM,CAAC,IAAI,aAAa,OAAO,QAAQ,QAAQ,MAAM,GAAG;GAC3D,MAAM,SAAS,IAAI,UAAU;GAC7B,IAAI,CAAC,QAAQ;IACX,SAAS,KAAK,GAAG,GAAG,oBAAoB;IACxC;GACF;GACA,IAAI,SAAS,WAAW,GAAG;IACzB,IAAI,OAAO,QAAQ,MAAM,KAAK;KAAE,MAAM;KAAI,SAAS,CAAC;KAAG,YAAY,OAAO,IAAI,MAAM;IAAE,CAAC;IACvF;GACF;GACA,MAAM,SAAS,OAAO,KAAK,SAAS,EAAY,CAAC,CAAC,KAAK;GACvD,IAAI,SAAS,MAAM,MAAM,OAAO,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,KAAK,IAAQ,MAAM,OAAO,KAAK,IAAQ,CAAC,GAAG;IACxF,SAAS,KAAK,oBAAoB,GAAG,+BAA+B;IACpE;GACF;GACA,MAAM,WAAW,MACf,OAAO,YAAY,OAAO,KAAK,MAAM,CAAC,GAAG,OAAO,EAAE,MAAM,IAAI,CAAC,CAAC,CAAC;GACjE,MAAM,OAAO,IAAI,IACf,SAAS,KAAK,MAAM,CAClB,aAAa,QAAQ,CAAwB,CAAQ,GACrD,QAAQ,CAAwB,CAClC,CAAC,CACH;GACA,MAAM,MAAM,IAAI,IAAI,OAAO,KAAK,MAAM,CAAC,aAAa,QAAQ,CAAC,CAAQ,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;GACpF,MAAM,UAAU,CAAC,GAAG,IAAI,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,OAAO,CAAC;GACvE,MAAM,aAAa,CAAC,GAAG,GAAG,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,OAAO,CAAC;GAC1E,IAAI,QAAQ,UAAU,WAAW,QAAQ,MAAM,KAAK;IAAE,MAAM;IAAI;IAAS;GAAW,CAAC;EACvF;EACA,OAAO;GACL,GAAG;GACH,QAAQ,SAAS,WAAW,KAAK,MAAM,WAAW;GAClD;GACA;GACA,QAAQ,IAAI;GACZ;EACF;CACF,CAAC;AACH;;;;;;;;;AC9FA,SAAgB,aAAa,SAAyB,KAA4B;CAChF,MAAM,WAAW,eAAe,SAAS,GAAG;CAC5C,IAAI,CAAC,SAAS,IAAI,OAAO;EAAE,IAAI;EAAO,QAAQ,SAAS;CAAO;CAC9D,MAAM,WAAW,YAAY,SAAS,IAAI;CAC1C,MAAM,SAAyB,SAAS,SAAS,MAAM;EACrD,MAAM,QAAQ,WAAW,EAAE,QAAQ,EAAE;EACrC,OAAO,CACL,GAAG,EAAE,SAAS,KAAK,OAAO;GAAE,MAAM;GAA2B,SAAS,GAAG,MAAM,IAAI;EAAI,EAAE,GACzF,GAAG,EAAE,MAAM,KAAK,OAAO;GACrB,MAAM;GACN,MAAM,EAAE;GACR,SAAS,GAAG,MAAM,IAAI,EAAE,KAAK,cAAc,EAAE,QAAQ,OAAO,WAAW,EAAE,WAAW,OAAO;EAC7F,EAAE,CACJ;CACF,CAAC;CACD,OAAO;EAAE,IAAI,OAAO,WAAW;EAAG;EAAQ,MAAM,SAAS;EAAM;CAAS;AAC1E;;AAGA,SAAgB,kBAAkB,SAAyC;CACzE,MAAM,SAAS,iBAAiB,OAAO;CACvC,KAAK,MAAM,QAAQ,QAAQ,OAAO;EAChC,MAAM,MAAM,OAAO,OAAO,cAAc,KAAK,EAAE,IAAI,aAAa,KAAK,MAAM,KAAA;EAC3E,IAAI,CAAC,KAAK;EACV,MAAM,EAAE,IAAI,KAAK,IAAI,KAAK,OAAO,QAAQ,GAAG,WAAW;EACvD,MAAM,SAAS,IAAI,OAAO,UAAU,MAAM;EAC1C,IAAI,OAAO,SAAS;EACpB,KAAK,MAAM,KAAK,OAAO,MAAM,QAC3B,OAAO,KAAK;GACV,MAAM;GACN,SAAS,GAAG,EAAE,KAAK,SAAS,GAAG,EAAE,KAAK,KAAK,GAAG,EAAE,MAAM,KAAK,EAAE;GAC7D,MAAM,KAAK;EACb,CAAC;CAEL;CACA,OAAO;AACT;;;AC1BA,IAAI,UAAU;;AAGd,SAAgB,SAAS,QAAwB;CAC/C,WAAW;CAEX,OAAO,GAAG,OAAO,GADF,WAAW,QAAQ,aAAa,CAAC,CAAC,MAAM,GAAG,CAAC,KAC7B,QAAQ,SAAS,EAAE;AACnD;AAEA,SAAgB,QAAQ,SAAyB,IAAkC;CACjF,OAAO,QAAQ,MAAM,MAAM,MAAM,EAAE,OAAO,EAAE;AAC9C;AAEA,MAAM,SAAS,OAAgB,OAAO,OAAO,cAAc,EAAE,IAAI,aAAa,MAAM,KAAA;AAEpF,SAAgB,QAAQ,SAAiC;CACvD,OAAO,QAAQ,MAAM,SAAS,SAC5B,SAAS,IAAI,CAAC,CAAC,KAAK,OAAO;EACzB,IAAI,GAAG,EAAE,OAAO,IAAI,KAAK,GAAG,GAAG,EAAE,OAAO,EAAE,UAAU,KAAA,IAAY,KAAK,IAAI,EAAE,MAAM;EACjF,QAAQ,EAAE;EACV,QAAQ,KAAK;EACb,MAAM,EAAE;EACR,GAAI,EAAE,UAAU,KAAA,IAAY,CAAC,IAAI,EAAE,OAAO,EAAE,MAAM;CACpD,EAAE,CACJ;AACF;;AAGA,SAAgB,QACd,SACA,IACA,OAA+F,CAAC,GACnD;CAC7C,MAAM,MAAM,MAAM,EAAE;CACpB,IAAI,CAAC,KAAK,MAAM,IAAI,MAAM,oBAAoB,GAAG,EAAE;CACnD,MAAM,KAAK,KAAK,MAAM,SAAS,EAAE;CACjC,IAAI,QAAQ,SAAS,EAAE,GAAG,MAAM,IAAI,MAAM,YAAY,GAAG,iBAAiB;CAC1E,MAAM,OAAiB;EACrB,GAAG,IAAI,SAAS;EAChB,GAAG,KAAK;EACR;EACA;EACA,GAAI,KAAK,UAAU,KAAA,IAAY,CAAC,IAAI,EAAE,OAAO,KAAK,MAAM;CAC1D;CACA,OAAO;EACL,SAAS;GACP,GAAG;GACH,OAAO,CAAC,GAAG,QAAQ,OAAO,IAAI;GAC9B,GAAI,KAAK,WAAW,EAAE,QAAQ;IAAE,GAAG,QAAQ;KAAS,KAAK,KAAK;GAAS,EAAE,IAAI,CAAC;EAChF;EACA;CACF;AACF;AAEA,SAAS,QAAQ,MAAgB,MAAyB,OAA0B;CAClF,MAAM,CAAC,MAAM,GAAG,QAAQ;CACxB,IAAI,KAAK,WAAW,GAAG;EACrB,MAAM,OAAgC,EAAE,GAAG,KAAK;EAChD,IAAI,UAAU,KAAA,GAAW,OAAO,KAAK;OAChC,KAAK,QAAQ;EAClB,OAAO;CACT;CACA,MAAM,QAAS,KAAiC;CAChD,MAAM,QAAQ,OAAO,UAAU,YAAY,UAAU,OAAO,QAAQ,CAAC;CACrE,OAAO;EAAE,GAAG;GAAO,OAAO,QAAQ,OAAmB,MAAM,KAAK;CAAE;AACpE;AAEA,SAAS,QAAQ,MAAgB,MAAkC;CACjE,IAAI,QAAiB;CACrB,KAAK,MAAM,OAAO,MAAM,QAAS,QAAgD;CACjF,OAAO;AACT;AAEA,SAAS,OAAO,MAAgB,MAAgC;CAC9D,OAAO,MAAM,KAAK,EAAE,CAAC,EAAE,MAAM,MAAM,MAAM,EAAE,OAAO,IAAI;AACxD;;AAGA,SAAgB,WAAW,SAAyB,IAA4B;CAC9E,MAAM,QAAQ,QAAQ,MACnB,QAAQ,MAAM,EAAE,OAAO,EAAE,CAAC,CAC1B,KAAK,MAAM;EACV,IAAI,OAAO;EACX,KAAK,MAAM,OAAO,SAAS,CAAC,CAAC,CAC1B,QAAQ,MAAM,EAAE,WAAW,EAAE,CAAC,CAC9B,QAAQ,GACT,OAAO,OAAO,MAAM,IAAI,MAAM,EAAE;EAElC,OAAO;CACT,CAAC;CACH,MAAM,SAAS,QAAQ,SAAS,EAAE,GAAG,QAAQ,OAAO,IAAI,KAAA;CACxD,IAAI,QAAQ,OAAO,OAAO;CAC1B,MAAM,SAAS,EAAE,GAAG,QAAQ,OAAO;CACnC,OAAO,OAAO;CACd,OAAO;EAAE,GAAG;EAAS;EAAO;EAAQ,GAAI,SAAS,EAAE,OAAO,IAAI,CAAC;CAAG;AACpE;;AAGA,SAAS,OAAO,MAAgB,QAAgB,QAA0B;CACxE,MAAM,OAAO,OAAO,MAAM,MAAM;CAChC,IAAI,CAAC,MAAM,OAAO;CAClB,MAAM,QAAQ,QAAQ,MAAM,KAAK,IAAI;CACrC,IAAI,MAAM,QAAQ,KAAK,GACrB,OAAO,QACL,MACA,KAAK,MACL,MAAM,QAAQ,MAAM,MAAM,MAAM,CAClC;CACF,OAAO,UAAU,SAAS,QAAQ,MAAM,KAAK,MAAM,KAAA,CAAS,IAAI;AAClE;;;;;AAMA,SAAgB,WACd,SACA,IACA,OACgB;CAChB,OAAO;EACL,GAAG;EACH,OAAO,QAAQ,MAAM,KAAK,MAAM;GAC9B,IAAI,EAAE,OAAO,IAAI,OAAO;GACxB,MAAM,QAAQ,WAAW,QAAQ,MAAM,QAAQ,EAAE;GAEjD,OAAO;IAAE,GADM,MAAM,YAAY,EAAE,IAAI,IAAI,IAAI,IAAI,OAAO,IAAI,GAAG,WAAW,KAAA,CAAM,CAAC;IAC/D,IAAI,EAAE;IAAI,IAAI,EAAE;IAAI,GAAI,UAAU,KAAA,IAAY,CAAC,IAAI,EAAE,MAAM;GAAG;EACpF,CAAC;CACH;AACF;AAEA,SAAgB,SAAS,SAAyB,IAAY,UAAoC;CAChG,OAAO;EAAE,GAAG;EAAS,QAAQ;GAAE,GAAG,QAAQ;IAAS,KAAK;EAAS;CAAE;AACrE;;AAGA,SAAgB,WAAW,SAAyB,YAAuC;CACzF,MAAM,SAAS,QAAQ,SAAS,WAAW,MAAM;CACjD,MAAM,SAAS,QAAQ,SAAS,WAAW,MAAM;CACjD,IAAI,CAAC,UAAU,CAAC,QAAQ,OAAO;EAAE,IAAI;EAAO,QAAQ;CAAwC;CAC5F,IAAI,OAAO,OAAO,OAAO,IAAI,OAAO;EAAE,IAAI;EAAO,QAAQ;CAA6B;CACtF,MAAM,OAAO,MAAM,OAAO,EAAE;CAC5B,IAAI,CAAC,QAAQ,CAAC,MAAM,OAAO,EAAE,GAAG,OAAO;EAAE,IAAI;EAAO,QAAQ;CAAmB;CAC/E,IAAI,CAAC,KAAK,QAAQ,OAAO;EAAE,IAAI;EAAO,QAAQ,GAAG,KAAK,MAAM;CAAiB;CAC7E,MAAM,OAAO,OAAO,QAAQ,WAAW,IAAI;CAC3C,IAAI,CAAC,MAAM,OAAO;EAAE,IAAI;EAAO,QAAQ,GAAG,OAAO,GAAG,iBAAiB,WAAW,KAAK;CAAI;CACzF,MAAM,OAAO,SAAS,MAAM,CAAC,CAAC,QAAQ,MAAM,EAAE,SAAS,KAAK,EAAE;CAC9D,IAAI,KAAK,MAAM,MAAM,EAAE,WAAW,OAAO,EAAE,GACzC,OAAO;EAAE,IAAI;EAAO,QAAQ;CAAqC;CACnE,IAAI,KAAK,SAAS,KAAK,CAAC,KAAK,UAC3B,OAAO;EAAE,IAAI;EAAO,QAAQ,UAAU,KAAK,MAAM;CAA6B;CAChF,IAAI,WAAW,QAAQ,OAAO,OAAO,EAAE,CAAC,CAAC,IAAI,OAAO,EAAE,GACpD,OAAO;EAAE,IAAI;EAAO,QAAQ;CAAkE;CAEhG,OAAO,EAAE,IAAI,KAAK;AACpB;;AAGA,SAAgB,QAAQ,SAAyB,YAAwC;CACvF,MAAM,UAAU,WAAW,SAAS,UAAU;CAC9C,IAAI,CAAC,QAAQ,IAAI,MAAM,IAAI,MAAM,QAAQ,MAAM;CAC/C,OAAO;EACL,GAAG;EACH,OAAO,QAAQ,MAAM,KAAK,MAAM;GAC9B,IAAI,EAAE,OAAO,WAAW,QAAQ,OAAO;GACvC,MAAM,OAAO,OAAO,GAAG,WAAW,IAAI;GACtC,MAAM,UAAU,QAAQ,GAAG,KAAK,IAAI;GACpC,MAAM,QAAQ,KAAK,WACf,CAAC,GAAI,MAAM,QAAQ,OAAO,IAAI,UAAU,CAAC,GAAI,WAAW,MAAM,IAC9D,WAAW;GACf,OAAO,QAAQ,GAAG,KAAK,MAAM,KAAK;EACpC,CAAC;CACH;AACF;;AAGA,SAAgB,WACd,SACA,MACgB;CAChB,OAAO;EACL,GAAG;EACH,OAAO,QAAQ,MAAM,KAAK,MAAO,EAAE,OAAO,KAAK,SAAS,OAAO,GAAG,KAAK,MAAM,KAAK,MAAM,IAAI,CAAE;CAChG;AACF;;;;;;;;;;;;;;ACzMA,MAAa,QAAQ,EAAE,MAAM;CAAC,EAAE,OAAO;CAAG,EAAE,OAAO;CAAG,EAAE,QAAQ;CAAG,EAAE,KAAK;AAAC,CAAC;;AAI5E,MAAa,MAAM,EAAE,OAAO,EAAE,OAAO,GAAG,KAAK;;;;;;;;AAU7C,MAAa,cAAc,EAAE,KAAK;CAChC;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AACF,CAAC;AAGD,MAAa,SAAS,EAAE,OAAO;CAC7B,MAAM,EAAE,OAAO;CACf,aAAa;CACb,YAAY,EAAE,OAAO,CAAC,CAAC,SAAS,yCAAyC;CACzE,UAAU,EAAE,QAAQ,CAAC,CAAC,QAAQ,IAAI;CAClC,OAAO,EAAE,OAAO,CAAC,CAAC,SAAS,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,SAAS,qCAAqC;CACzF,aAAa,EAAE,OAAO,CAAC,CAAC,SAAS,CAAC,CAAC,QAAQ,IAAI;CAC/C,UAAU,EAAE,QAAQ,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC,SAAS,wCAAwC;CACtF,YAAY,EACT,OAAO,CAAC,CACR,SAAS,CAAC,CACV,QAAQ,IAAI,CAAC,CACb,SAAS,2DAA2D;AACzE,CAAC;AAGD,MAAa,WAAW,EAAE,OAAO;CAC/B,MAAM,EAAE,OAAO,CAAC,CAAC,SAAS,+DAA+D;CACzF,OAAO,EAAE,OAAO,CAAC,CAAC,SAAS,CAAC,CAAC,QAAQ,IAAI;CACzC,aAAa,EAAE,OAAO,CAAC,CAAC,SAAS,CAAC,CAAC,QAAQ,IAAI;CAC/C,UAAU,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,SAAS,CAAC,CAAC,QAAQ,IAAI;AACpD,CAAC;AAGD,MAAa,QAAQ,SAAS,OAAO,EAAE,SAAS,EAAE,MAAM,MAAM,EAAE,CAAC;;AAIjE,MAAa,SAAS,EAAE,OAAO;CAC7B,SAAS,EAAE,MAAM,MAAM;CACvB,MAAM,EAAE,MAAM,GAAG;CACjB,WAAW,EACR,OAAO,CAAC,CACR,IAAI,CAAC,CACL,SAAS,CAAC,CACV,QAAQ,IAAI,CAAC,CACb,SAAS,wDAAwD;AACtE,CAAC;AAGD,MAAa,cAAc,EAAE,OAAO;CAClC,MAAM,EAAE,OAAO;CACf,aAAa;CACb,UAAU,EAAE,QAAQ,CAAC,CAAC,QAAQ,IAAI;CAClC,aAAa,EAAE,OAAO,CAAC,CAAC,SAAS,CAAC,CAAC,QAAQ,IAAI;CAC/C,MAAM,EAAE,OAAO,CAAC,CAAC,SAAS,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,SAAS,0CAA0C;CAC7F,YAAY,EAAE,OAAO,CAAC,CAAC,SAAS,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,SAAS,iCAAiC;AAC5F,CAAC;AAGD,MAAa,eAAe,EAAE,OAAO;CACnC,MAAM,EAAE,OAAO;CACf,aAAa,EAAE,OAAO,CAAC,CAAC,SAAS,CAAC,CAAC,QAAQ,IAAI;CAC/C,UAAU,EACP,MAAM,EAAE,OAAO,CAAC,CAAC,CACjB,QAAQ,CAAC,CAAC,CAAC,CACX,SAAS,6DAA6D;CACzE,kBAAkB,EACf,QAAQ,CAAC,CACT,SAAS,CAAC,CACV,SACC,sHACF;CACF,QAAQ,EAAE,MAAM,WAAW;AAC7B,CAAC;AAGD,MAAa,eAAe,EAAE,OAAO;CACnC,MAAM,EAAE,OAAO;CACf,UAAU,EAAE,MAAM,YAAY;AAChC,CAAC;;AAID,SAAgB,WAAW,OAAc,MAAsB;CAC7D,MAAM,SAAS,KAAK,YAAY;CAChC,MAAM,SAAS,MAAM,QAAQ,MAAM,MAAM,EAAE,KAAK,YAAY,MAAM,MAAM;CACxE,IAAI,CAAC,QAAQ,MAAM,IAAI,MAAM,GAAG,MAAM,KAAK,kBAAkB,KAAK,EAAE;CACpE,OAAO;AACT;AAEA,SAAgB,WAAW,QAAsB,MAA4B;CAC3E,MAAM,SAAS,OAAO,SAAS,MAAM,MAAM,EAAE,SAAS,IAAI;CAC1D,IAAI,CAAC,QAAQ,MAAM,IAAI,MAAM,GAAG,OAAO,KAAK,kBAAkB,KAAK,EAAE;CACrE,OAAO;AACT;AAEA,SAAgB,UAAU,QAAsB,MAA2B;CACzE,MAAM,QAAQ,OAAO,OAAO,MAAM,MAAM,EAAE,SAAS,IAAI;CACvD,IAAI,CAAC,OAAO,MAAM,IAAI,MAAM,GAAG,OAAO,KAAK,iBAAiB,KAAK,EAAE;CACnE,OAAO;AACT;;AAGA,SAAgB,OACd,OACQ;CACR,OAAO,OAAO,MAAM,KAAK;AAC3B"}