watch-tail 0.4.0 → 0.6.0

package/build/server/chunks/chunks/log-buffer.js-BI_gQOls.js

@@ -0,0 +1,587 @@
+//#region src/lib/log-format.ts
+/**
+* Parses a log message that is entirely JSON.
+*
+* Only objects and arrays count: a message that happens to be `42` or `"ok"` is
+* left alone, and anything that does not parse is not JSON. Leading and trailing
+* whitespace is ignored.
+*/
+function detectJson(message) {
+	if (typeof message !== "string") return null;
+	const trimmed = message.trim();
+	if (trimmed.length === 0) return null;
+	const first = trimmed[0];
+	if (first !== "{" && first !== "[") return null;
+	try {
+		const parsed = JSON.parse(trimmed);
+		if (parsed === null || typeof parsed !== "object") return null;
+		return parsed;
+	} catch {
+		return null;
+	}
+}
+/**
+* Returns the text to render for a log message.
+*
+* `prettyJson` is normally true: JSON messages are re-serialised with two-space
+* indentation. With `prettyJson` false the raw message is returned unchanged,
+* which is what the viewer's JSON toggle switches to.
+*/
+function formatLogMessage(message, options = {}) {
+	const { prettyJson = true } = options;
+	const value = detectJson(message);
+	if (value === null || !prettyJson) return {
+		text: message,
+		isJson: value !== null,
+		value
+	};
+	return {
+		text: JSON.stringify(value, null, 2),
+		isJson: true,
+		value
+	};
+}
+var NUMBER_PATTERN = /^-?\d+(?:\.\d+)?(?:[eE][+-]?\d+)?$/;
+/**
+* Splits pretty-printed JSON into coloured tokens.
+*
+* The concatenation of every token's `text` is always identical to the input, so
+* rendering tokens can never lose or alter a character. This is a display-only
+* scanner: it assumes well-formed JSON produced by `JSON.stringify`.
+*/
+function tokenizeJson(text) {
+	const tokens = [];
+	let index = 0;
+	const push = (type, value) => {
+		if (value.length > 0) tokens.push({
+			type,
+			text: value
+		});
+	};
+	while (index < text.length) {
+		const char = text[index];
+		if (char === " " || char === "\n" || char === "	" || char === "\r") {
+			let end = index;
+			while (end < text.length && " \n	\r".includes(text[end])) end += 1;
+			push("whitespace", text.slice(index, end));
+			index = end;
+			continue;
+		}
+		if (char === "\"") {
+			let end = index + 1;
+			while (end < text.length) {
+				if (text[end] === "\\") {
+					end += 2;
+					continue;
+				}
+				if (text[end] === "\"") break;
+				end += 1;
+			}
+			const raw = text.slice(index, Math.min(end + 1, text.length));
+			let lookahead = index + raw.length;
+			while (lookahead < text.length && " \n	\r".includes(text[lookahead])) lookahead += 1;
+			push(text[lookahead] === ":" ? "key" : "string", raw);
+			index += raw.length;
+			continue;
+		}
+		if (char === "{" || char === "}" || char === "[" || char === "]" || char === "," || char === ":") {
+			push("punctuation", char);
+			index += 1;
+			continue;
+		}
+		if (text.startsWith("true", index) || text.startsWith("false", index)) {
+			const literal = text.startsWith("true", index) ? "true" : "false";
+			push("boolean", literal);
+			index += literal.length;
+			continue;
+		}
+		if (text.startsWith("null", index)) {
+			push("null", "null");
+			index += 4;
+			continue;
+		}
+		let end = index;
+		while (end < text.length && !"{}[],:\" \n	\r".includes(text[end])) end += 1;
+		const raw = text.slice(index, Math.max(end, index + 1));
+		push(NUMBER_PATTERN.test(raw) ? "number" : "other", raw);
+		index += raw.length;
+	}
+	return tokens;
+}
+/**
+* Finds the first JSON object or array inside a log message.
+*
+* Whole messages are handled by {@link detectJson}; this also copes with the
+* common "prefix then payload" shape (`2026-01-01 INFO {"level":"info"}`), which
+* is what the viewer expands when pretty-printing is switched off.
+*
+* Strings and escapes are respected while matching brackets, so a `}` inside a
+* message value cannot end the scan early.
+*/
+function findJsonInMessage(message) {
+	if (typeof message !== "string") return null;
+	const whole = detectJson(message);
+	if (whole !== null) return whole;
+	for (let index = 0; index < message.length; index += 1) {
+		const opener = message[index];
+		if (opener !== "{" && opener !== "[") continue;
+		const closer = opener === "{" ? "}" : "]";
+		let depth = 0;
+		let inString = false;
+		let escaped = false;
+		for (let scan = index; scan < message.length; scan += 1) {
+			const char = message[scan];
+			if (inString) {
+				if (escaped) escaped = false;
+				else if (char === "\\") escaped = true;
+				else if (char === "\"") inString = false;
+				continue;
+			}
+			if (char === "\"") {
+				inString = true;
+				continue;
+			}
+			if (char === opener) depth += 1;
+			else if (char === closer) {
+				depth -= 1;
+				if (depth === 0) {
+					const candidate = message.slice(index, scan + 1);
+					try {
+						const parsed = JSON.parse(candidate);
+						if (parsed !== null && typeof parsed === "object") return parsed;
+					} catch {}
+					break;
+				}
+			}
+		}
+	}
+	return null;
+}
+//#endregion
+//#region src/lib/log-buffer.ts
+/**
+* Pure client-side log storage and filtering for the watch-stream UI.
+*
+* Design decisions (kept in one place so the UI stays predictable):
+*
+* - The visible buffer is a fixed-capacity ring buffer. When it is full the oldest line is
+*   dropped, so memory stays bounded while tailing a busy group.
+* - Pausing keeps the SSE connection open and keeps receiving events. Incoming events are held in
+*   a bounded pending buffer instead of the visible buffer, and are flushed in arrival order when
+*   the user resumes.
+*/
+/** Maximum number of lines kept in the visible client buffer. */
+var DEFAULT_CAPACITY = 5e3;
+var ERROR_PATTERN = /\b(ERROR|FATAL|CRITICAL|CRIT|PANIC|EXCEPTION|TRACEBACK|SEVERE|FAILED|FAILURE)\b/;
+var WARN_PATTERN = /\b(WARN|WARNING)\b/;
+var DEBUG_PATTERN = /\b(DEBUG|TRACE|VERBOSE)\b/;
+/** Payload keys checked, in order, for a level the producer declared. */
+var LEVEL_KEYS = [
+	"level",
+	"severity",
+	"lvl",
+	"logLevel",
+	"log_level"
+];
+/**
+* Declared level words mapped onto the four levels the UI knows.
+*
+* The vocabulary is deliberately small: `fatal` and `critical` are errors to
+* everyone reading a log, and collapsing them keeps the filter and the colours
+* honest instead of inventing levels nothing else understands.
+*/
+var LEVEL_WORDS = {
+	trace: "debug",
+	verbose: "debug",
+	debug: "debug",
+	info: "info",
+	information: "info",
+	notice: "info",
+	note: "info",
+	warn: "warn",
+	warning: "warn",
+	error: "error",
+	err: "error",
+	exception: "error",
+	fatal: "error",
+	critical: "error",
+	crit: "error",
+	panic: "error",
+	severe: "error",
+	alert: "error",
+	emergency: "error"
+};
+/**
+* Bunyan/pino style numeric levels.
+*
+* Only exact known values are mapped: a bare number such as `{"level":0}` means
+* different things in different loggers, so an unknown number falls through to
+* the text heuristic instead of being guessed at.
+*/
+var NUMERIC_LEVELS = {
+	10: "debug",
+	20: "debug",
+	30: "info",
+	40: "warn",
+	50: "error",
+	60: "error"
+};
+/** True when a value is one of the four known levels. */
+function isLogLevel(value) {
+	return value === "error" || value === "warn" || value === "info" || value === "debug";
+}
+/** Converts one declared JSON value into a level, or `null` when unrecognised. */
+function levelFromDeclared(value) {
+	if (typeof value === "number" && Number.isFinite(value)) return NUMERIC_LEVELS[value] ?? null;
+	if (typeof value !== "string") return null;
+	const word = value.trim().toLowerCase();
+	if (word.length === 0) return null;
+	return LEVEL_WORDS[word] ?? null;
+}
+/**
+* Level the payload declares, when the line carries a JSON object with a known
+* level key. Whole messages and "prefix then payload" lines are both handled,
+* by the same parser the viewer uses to pretty-print JSON.
+*/
+function declaredLevel(message) {
+	const payload = findJsonInMessage(message);
+	if (payload === null || typeof payload !== "object" || Array.isArray(payload)) return null;
+	const record = payload;
+	for (const key of LEVEL_KEYS) {
+		const level = levelFromDeclared(record[key]);
+		if (level !== null) return level;
+	}
+	return null;
+}
+/**
+* Severity ranks, highest first, with `unknown` below every real level.
+*
+* One ordered table feeds the JavaScript helpers and the SQL the archive runs,
+* so "most critical" means exactly the same thing in the chart, in the log view
+* and in DuckDB. Insertion order is severity order.
+*/
+var LEVEL_RANK = {
+	error: 4,
+	warn: 3,
+	info: 2,
+	debug: 1,
+	unknown: 0
+};
+/**
+* Worst level in a set of levels, or `null` when none of them has a level.
+*
+* This is what a request id group is coloured by: a group with one error line
+* and twenty info lines is an error, because that is what a reader needs to see.
+*/
+function mostCriticalLevel(levels) {
+	let best = null;
+	let bestRank = -1;
+	for (const level of levels) {
+		if (level === null || level === void 0 || level === "unknown") continue;
+		const rank = LEVEL_RANK[level];
+		if (rank > bestRank) {
+			bestRank = rank;
+			best = level;
+		}
+	}
+	return best;
+}
+/**
+* Payload keys checked, in order, for a request id the producer declared.
+*
+* The list is deliberately about the *request*: a trace id, a session id or a
+* tenant id names something else and must not collapse unrelated lines.
+*/
+var REQUEST_ID_KEYS = [
+	"requestId",
+	"request_id",
+	"requestID",
+	"reqId",
+	"req_id",
+	"awsRequestId",
+	"aws_request_id",
+	"xRequestId",
+	"x_request_id",
+	"x-request-id",
+	"X-Request-Id"
+];
+/** Values that look like an id but mean "there is none". */
+var REQUEST_ID_PLACEHOLDERS = /* @__PURE__ */ new Set([
+	"none",
+	"null",
+	"undefined",
+	"n/a",
+	"na",
+	"unknown",
+	"test",
+	"-",
+	"{{requestid}}",
+	"${requestid}"
+]);
+/** Shortest value treated as a request id, so `id: 1` is not a grouping key. */
+var REQUEST_ID_MIN_LENGTH = 4;
+/** Characters a request id is made of; anything with a space is not an id. */
+var REQUEST_ID_PATTERN = /^[A-Za-z0-9][A-Za-z0-9._:=-]*$/;
+/**
+* `RequestId: 1234-abcd`, `request_id=abc.def`, `x-request-id: 8f2c`: the
+* separators and the casing both vary, so one pattern covers them.
+*
+* A bare UUID is deliberately *not* matched. Plenty of log lines carry a
+* correlation id, a span id or an uploaded file's id, and grouping by one of
+* those would invent requests that never existed.
+*/
+var REQUEST_ID_TEXT = /\brequest[\s_-]?id\b\s*[:=]\s*"?([A-Za-z0-9][A-Za-z0-9._:=-]*)"?/i;
+/** Trims trailing punctuation a sentence adds after an id. */
+function cleanRequestId(value) {
+	const trimmed = value.replace(/[.,;:]+$/, "").trim();
+	if (trimmed.length < REQUEST_ID_MIN_LENGTH) return null;
+	if (REQUEST_ID_PLACEHOLDERS.has(trimmed.toLowerCase())) return null;
+	return REQUEST_ID_PATTERN.test(trimmed) ? trimmed : null;
+}
+/** Request id the payload declares, when the line carries a JSON object. */
+function declaredRequestId(message) {
+	const payload = findJsonInMessage(message);
+	if (payload === null || typeof payload !== "object" || Array.isArray(payload)) return null;
+	const record = payload;
+	for (const key of REQUEST_ID_KEYS) {
+		const value = record[key];
+		if (typeof value === "string") {
+			const cleaned = cleanRequestId(value);
+			if (cleaned !== null) return cleaned;
+		}
+		if (typeof value === "number" && Number.isFinite(value)) return String(value);
+	}
+	return null;
+}
+/**
+* Detects the request id of a log line, or returns `null` when it has none.
+*
+* A declared payload key wins; the text form is the fallback for the many logs
+* that print their id instead of emitting JSON. Both paths return the id
+* verbatim, because it is an identifier - folding case would merge distinct ids
+* on the one hand and lie about what the log said on the other.
+*/
+function detectRequestId(message) {
+	const text = message ?? "";
+	if (text === "") return null;
+	const declared = declaredRequestId(text);
+	if (declared !== null) return declared;
+	const match = REQUEST_ID_TEXT.exec(text);
+	return match === null ? null : cleanRequestId(match[1] ?? "");
+}
+/**
+* Detects the severity of a log line.
+*
+* A level the payload declares wins, because it is a statement of fact; the
+* text heuristic is the fallback for the many logs that declare nothing. The
+* heuristic matches level words anywhere in the line, so
+* `{"level":"info","msg":"retry after error count 0"}` is `info`, not `error`.
+*/
+function detectLevelWithSource(message) {
+	const declared = declaredLevel(message ?? "");
+	if (declared !== null) return {
+		level: declared,
+		source: "json"
+	};
+	const upper = (message ?? "").toUpperCase();
+	if (ERROR_PATTERN.test(upper)) return {
+		level: "error",
+		source: "text"
+	};
+	if (WARN_PATTERN.test(upper)) return {
+		level: "warn",
+		source: "text"
+	};
+	if (DEBUG_PATTERN.test(upper)) return {
+		level: "debug",
+		source: "text"
+	};
+	return {
+		level: null,
+		source: null
+	};
+}
+/**
+* Guesses the severity of a log line from its text, or returns `null` when the
+* line carries no signal at all (a stack-trace continuation, for example).
+*/
+function detectLevel(message) {
+	return detectLevelWithSource(message).level;
+}
+/** Level of an event: what the server detected, else a guess from the text. */
+function effectiveLevel(event) {
+	return event.level !== void 0 ? event.level : detectLevel(event.message);
+}
+/** True when an event passes a level filter; a `null` filter accepts every line. */
+function matchesLevel(event, level) {
+	return level === null || effectiveLevel(event) === level;
+}
+/** Filters events by level, keeping every line when `level` is `null`. */
+function filterByLevel(events, level) {
+	if (level === null) return events.slice();
+	return events.filter((event) => matchesLevel(event, level));
+}
+/** Tailwind text colour class for a severity; an unknown level stays neutral. */
+function levelColorClass(level) {
+	switch (level) {
+		case "error": return "text-red-400";
+		case "warn": return "text-amber-300";
+		case "debug": return "text-neutral-500";
+		default: return "text-neutral-200";
+	}
+}
+/** Stable key for rendering a log line, since event ids can repeat or be missing. */
+function eventKey(event, index) {
+	return `${event.id ?? "no-id"}:${event.timestamp}:${index}`;
+}
+/** Case-insensitive substring match over the message and the stream name. */
+function matchesFilter(event, query) {
+	const needle = (query ?? "").trim().toLowerCase();
+	if (needle === "") return true;
+	return `${event.message ?? ""} ${event.streamName ?? ""}`.toLowerCase().includes(needle);
+}
+/** Returns the events matching `query`, in arrival order. */
+function filterEvents(events, query) {
+	if ((query ?? "").trim() === "") return events.slice();
+	return events.filter((event) => matchesFilter(event, query));
+}
+/** Creates an array of `length` undefined slots. */
+function emptySlots(length) {
+	return Array.from({ length });
+}
+/**
+* Fixed-capacity ring buffer that overwrites the oldest item once it is full.
+*/
+var LogRingBuffer = class {
+	/** Maximum number of items kept. */
+	capacity;
+	#items;
+	#start = 0;
+	#size = 0;
+	#dropped = 0;
+	constructor(capacity = DEFAULT_CAPACITY) {
+		if (!Number.isInteger(capacity) || capacity <= 0) throw new RangeError(`capacity must be a positive integer, received ${capacity}`);
+		this.capacity = capacity;
+		this.#items = emptySlots(capacity);
+	}
+	/** Number of items currently stored. */
+	get size() {
+		return this.#size;
+	}
+	/** Number of items discarded because the buffer was full. */
+	get dropped() {
+		return this.#dropped;
+	}
+	/** True when the buffer holds `capacity` items. */
+	get full() {
+		return this.#size === this.capacity;
+	}
+	/** Appends one item, dropping the oldest item when the buffer is full. */
+	push(item) {
+		if (this.#size === this.capacity) {
+			this.#dropped += 1;
+			this.#start = (this.#start + 1) % this.capacity;
+			this.#size -= 1;
+		}
+		const index = (this.#start + this.#size) % this.capacity;
+		this.#items[index] = item;
+		this.#size += 1;
+	}
+	/** Appends several items in order. */
+	pushMany(items) {
+		for (const item of items) this.push(item);
+	}
+	/** Copies the stored items into an array ordered oldest to newest. */
+	toArray() {
+		const output = emptySlots(this.#size);
+		for (let offset = 0; offset < this.#size; offset += 1) output[offset] = this.#items[(this.#start + offset) % this.capacity];
+		return output;
+	}
+	/** Oldest stored item, or `undefined` when empty. */
+	first() {
+		return this.#size === 0 ? void 0 : this.#items[this.#start];
+	}
+	/** Newest stored item, or `undefined` when empty. */
+	last() {
+		return this.#size === 0 ? void 0 : this.#items[(this.#start + this.#size - 1) % this.capacity];
+	}
+	/** Removes every item and resets the dropped counter. */
+	clear() {
+		this.#items = emptySlots(this.capacity);
+		this.#start = 0;
+		this.#size = 0;
+		this.#dropped = 0;
+	}
+};
+/**
+* Log store used by the UI: a visible ring buffer plus a pending buffer that fills up while the
+* view is paused. `push()` never drops silent data, it either appends to the visible buffer or to
+* the pending buffer; `resume()` moves the pending events into the visible buffer in order.
+*/
+var LogStore = class {
+	buffer;
+	#pending;
+	#paused = false;
+	constructor(capacity = DEFAULT_CAPACITY) {
+		this.buffer = new LogRingBuffer(capacity);
+		this.#pending = new LogRingBuffer(capacity);
+	}
+	/** True when incoming events are buffered instead of appended to the visible buffer. */
+	get paused() {
+		return this.#paused;
+	}
+	/** Number of visible lines. */
+	get size() {
+		return this.buffer.size;
+	}
+	/** Number of lines held back while paused. */
+	get pendingCount() {
+		return this.#pending.size;
+	}
+	/** Number of visible lines dropped because the buffer was full. */
+	get droppedCount() {
+		return this.buffer.dropped;
+	}
+	/** Appends events to the visible buffer, or holds them back while paused. */
+	push(events) {
+		if (this.#paused) {
+			this.#pending.pushMany(events);
+			return;
+		}
+		this.buffer.pushMany(events);
+	}
+	/** Pauses or resumes appending. Resuming flushes the pending events immediately. */
+	setPaused(paused) {
+		if (paused === this.#paused) return [];
+		this.#paused = paused;
+		return paused ? [] : this.flush();
+	}
+	/** Pauses appending to the visible buffer. */
+	pause() {
+		this.#paused = true;
+	}
+	/** Resumes appending and returns the events flushed from the pending buffer. */
+	resume() {
+		this.#paused = false;
+		return this.flush();
+	}
+	/** Moves every pending event into the visible buffer, oldest first. */
+	flush() {
+		const flushed = this.#pending.toArray();
+		this.#pending.clear();
+		this.buffer.pushMany(flushed);
+		return flushed;
+	}
+	/** Copies the visible lines, oldest first. */
+	toArray() {
+		return this.buffer.toArray();
+	}
+	/** Empties the visible buffer and discards pending events. */
+	clear() {
+		this.buffer.clear();
+		this.#pending.clear();
+	}
+};
+
+export { LEVEL_RANK as L, detectLevelWithSource as a, detectLevel as b, LogStore as c, detectRequestId as d, effectiveLevel as e, filterByLevel as f, filterEvents as g, formatLogMessage as h, isLogLevel as i, eventKey as j, levelColorClass as l, mostCriticalLevel as m, tokenizeJson as t };
+//# sourceMappingURL=log-buffer.js-BI_gQOls.js.map

package/build/server/chunks/chunks/log-buffer.js-BI_gQOls.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"log-buffer.js-BI_gQOls.js","sources":["../../../../.svelte-kit/output/server/chunks/log-buffer.js"],"sourcesContent":["//#region src/lib/log-format.ts\n/**\n* Parses a log message that is entirely JSON.\n*\n* Only objects and arrays count: a message that happens to be `42` or `\"ok\"` is\n* left alone, and anything that does not parse is not JSON. Leading and trailing\n* whitespace is ignored.\n*/\nfunction detectJson(message) {\n\tif (typeof message !== \"string\") return null;\n\tconst trimmed = message.trim();\n\tif (trimmed.length === 0) return null;\n\tconst first = trimmed[0];\n\tif (first !== \"{\" && first !== \"[\") return null;\n\ttry {\n\t\tconst parsed = JSON.parse(trimmed);\n\t\tif (parsed === null || typeof parsed !== \"object\") return null;\n\t\treturn parsed;\n\t} catch {\n\t\treturn null;\n\t}\n}\n/**\n* Returns the text to render for a log message.\n*\n* `prettyJson` is normally true: JSON messages are re-serialised with two-space\n* indentation. With `prettyJson` false the raw message is returned unchanged,\n* which is what the viewer's JSON toggle switches to.\n*/\nfunction formatLogMessage(message, options = {}) {\n\tconst { prettyJson = true } = options;\n\tconst value = detectJson(message);\n\tif (value === null || !prettyJson) return {\n\t\ttext: message,\n\t\tisJson: value !== null,\n\t\tvalue\n\t};\n\treturn {\n\t\ttext: JSON.stringify(value, null, 2),\n\t\tisJson: true,\n\t\tvalue\n\t};\n}\nvar NUMBER_PATTERN = /^-?\\d+(?:\\.\\d+)?(?:[eE][+-]?\\d+)?$/;\n/**\n* Splits pretty-printed JSON into coloured tokens.\n*\n* The concatenation of every token's `text` is always identical to the input, so\n* rendering tokens can never lose or alter a character. This is a display-only\n* scanner: it assumes well-formed JSON produced by `JSON.stringify`.\n*/\nfunction tokenizeJson(text) {\n\tconst tokens = [];\n\tlet index = 0;\n\tconst push = (type, value) => {\n\t\tif (value.length > 0) tokens.push({\n\t\t\ttype,\n\t\t\ttext: value\n\t\t});\n\t};\n\twhile (index < text.length) {\n\t\tconst char = text[index];\n\t\tif (char === \" \" || char === \"\\n\" || char === \"\t\" || char === \"\\r\") {\n\t\t\tlet end = index;\n\t\t\twhile (end < text.length && \" \\n\t\\r\".includes(text[end])) end += 1;\n\t\t\tpush(\"whitespace\", text.slice(index, end));\n\t\t\tindex = end;\n\t\t\tcontinue;\n\t\t}\n\t\tif (char === \"\\\"\") {\n\t\t\tlet end = index + 1;\n\t\t\twhile (end < text.length) {\n\t\t\t\tif (text[end] === \"\\\\\") {\n\t\t\t\t\tend += 2;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tif (text[end] === \"\\\"\") break;\n\t\t\t\tend += 1;\n\t\t\t}\n\t\t\tconst raw = text.slice(index, Math.min(end + 1, text.length));\n\t\t\tlet lookahead = index + raw.length;\n\t\t\twhile (lookahead < text.length && \" \\n\t\\r\".includes(text[lookahead])) lookahead += 1;\n\t\t\tpush(text[lookahead] === \":\" ? \"key\" : \"string\", raw);\n\t\t\tindex += raw.length;\n\t\t\tcontinue;\n\t\t}\n\t\tif (char === \"{\" || char === \"}\" || char === \"[\" || char === \"]\" || char === \",\" || char === \":\") {\n\t\t\tpush(\"punctuation\", char);\n\t\t\tindex += 1;\n\t\t\tcontinue;\n\t\t}\n\t\tif (text.startsWith(\"true\", index) || text.startsWith(\"false\", index)) {\n\t\t\tconst literal = text.startsWith(\"true\", index) ? \"true\" : \"false\";\n\t\t\tpush(\"boolean\", literal);\n\t\t\tindex += literal.length;\n\t\t\tcontinue;\n\t\t}\n\t\tif (text.startsWith(\"null\", index)) {\n\t\t\tpush(\"null\", \"null\");\n\t\t\tindex += 4;\n\t\t\tcontinue;\n\t\t}\n\t\tlet end = index;\n\t\twhile (end < text.length && !\"{}[],:\\\" \\n\t\\r\".includes(text[end])) end += 1;\n\t\tconst raw = text.slice(index, Math.max(end, index + 1));\n\t\tpush(NUMBER_PATTERN.test(raw) ? \"number\" : \"other\", raw);\n\t\tindex += raw.length;\n\t}\n\treturn tokens;\n}\n/**\n* Finds the first JSON object or array inside a log message.\n*\n* Whole messages are handled by {@link detectJson}; this also copes with the\n* common \"prefix then payload\" shape (`2026-01-01 INFO {\"level\":\"info\"}`), which\n* is what the viewer expands when pretty-printing is switched off.\n*\n* Strings and escapes are respected while matching brackets, so a `}` inside a\n* message value cannot end the scan early.\n*/\nfunction findJsonInMessage(message) {\n\tif (typeof message !== \"string\") return null;\n\tconst whole = detectJson(message);\n\tif (whole !== null) return whole;\n\tfor (let index = 0; index < message.length; index += 1) {\n\t\tconst opener = message[index];\n\t\tif (opener !== \"{\" && opener !== \"[\") continue;\n\t\tconst closer = opener === \"{\" ? \"}\" : \"]\";\n\t\tlet depth = 0;\n\t\tlet inString = false;\n\t\tlet escaped = false;\n\t\tfor (let scan = index; scan < message.length; scan += 1) {\n\t\t\tconst char = message[scan];\n\t\t\tif (inString) {\n\t\t\t\tif (escaped) escaped = false;\n\t\t\t\telse if (char === \"\\\\\") escaped = true;\n\t\t\t\telse if (char === \"\\\"\") inString = false;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (char === \"\\\"\") {\n\t\t\t\tinString = true;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (char === opener) depth += 1;\n\t\t\telse if (char === closer) {\n\t\t\t\tdepth -= 1;\n\t\t\t\tif (depth === 0) {\n\t\t\t\t\tconst candidate = message.slice(index, scan + 1);\n\t\t\t\t\ttry {\n\t\t\t\t\t\tconst parsed = JSON.parse(candidate);\n\t\t\t\t\t\tif (parsed !== null && typeof parsed === \"object\") return parsed;\n\t\t\t\t\t} catch {}\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn null;\n}\n//#endregion\n//#region src/lib/log-buffer.ts\n/**\n* Pure client-side log storage and filtering for the watch-stream UI.\n*\n* Design decisions (kept in one place so the UI stays predictable):\n*\n* - The visible buffer is a fixed-capacity ring buffer. When it is full the oldest line is\n*   dropped, so memory stays bounded while tailing a busy group.\n* - Pausing keeps the SSE connection open and keeps receiving events. Incoming events are held in\n*   a bounded pending buffer instead of the visible buffer, and are flushed in arrival order when\n*   the user resumes.\n*/\n/** Maximum number of lines kept in the visible client buffer. */\nvar DEFAULT_CAPACITY = 5e3;\nvar ERROR_PATTERN = /\\b(ERROR|FATAL|CRITICAL|CRIT|PANIC|EXCEPTION|TRACEBACK|SEVERE|FAILED|FAILURE)\\b/;\nvar WARN_PATTERN = /\\b(WARN|WARNING)\\b/;\nvar DEBUG_PATTERN = /\\b(DEBUG|TRACE|VERBOSE)\\b/;\n/** Payload keys checked, in order, for a level the producer declared. */\nvar LEVEL_KEYS = [\n\t\"level\",\n\t\"severity\",\n\t\"lvl\",\n\t\"logLevel\",\n\t\"log_level\"\n];\n/**\n* Declared level words mapped onto the four levels the UI knows.\n*\n* The vocabulary is deliberately small: `fatal` and `critical` are errors to\n* everyone reading a log, and collapsing them keeps the filter and the colours\n* honest instead of inventing levels nothing else understands.\n*/\nvar LEVEL_WORDS = {\n\ttrace: \"debug\",\n\tverbose: \"debug\",\n\tdebug: \"debug\",\n\tinfo: \"info\",\n\tinformation: \"info\",\n\tnotice: \"info\",\n\tnote: \"info\",\n\twarn: \"warn\",\n\twarning: \"warn\",\n\terror: \"error\",\n\terr: \"error\",\n\texception: \"error\",\n\tfatal: \"error\",\n\tcritical: \"error\",\n\tcrit: \"error\",\n\tpanic: \"error\",\n\tsevere: \"error\",\n\talert: \"error\",\n\temergency: \"error\"\n};\n/**\n* Bunyan/pino style numeric levels.\n*\n* Only exact known values are mapped: a bare number such as `{\"level\":0}` means\n* different things in different loggers, so an unknown number falls through to\n* the text heuristic instead of being guessed at.\n*/\nvar NUMERIC_LEVELS = {\n\t10: \"debug\",\n\t20: \"debug\",\n\t30: \"info\",\n\t40: \"warn\",\n\t50: \"error\",\n\t60: \"error\"\n};\n/** True when a value is one of the four known levels. */\nfunction isLogLevel(value) {\n\treturn value === \"error\" || value === \"warn\" || value === \"info\" || value === \"debug\";\n}\n/** Converts one declared JSON value into a level, or `null` when unrecognised. */\nfunction levelFromDeclared(value) {\n\tif (typeof value === \"number\" && Number.isFinite(value)) return NUMERIC_LEVELS[value] ?? null;\n\tif (typeof value !== \"string\") return null;\n\tconst word = value.trim().toLowerCase();\n\tif (word.length === 0) return null;\n\treturn LEVEL_WORDS[word] ?? null;\n}\n/**\n* Level the payload declares, when the line carries a JSON object with a known\n* level key. Whole messages and \"prefix then payload\" lines are both handled,\n* by the same parser the viewer uses to pretty-print JSON.\n*/\nfunction declaredLevel(message) {\n\tconst payload = findJsonInMessage(message);\n\tif (payload === null || typeof payload !== \"object\" || Array.isArray(payload)) return null;\n\tconst record = payload;\n\tfor (const key of LEVEL_KEYS) {\n\t\tconst level = levelFromDeclared(record[key]);\n\t\tif (level !== null) return level;\n\t}\n\treturn null;\n}\n/**\n* Severity ranks, highest first, with `unknown` below every real level.\n*\n* One ordered table feeds the JavaScript helpers and the SQL the archive runs,\n* so \"most critical\" means exactly the same thing in the chart, in the log view\n* and in DuckDB. Insertion order is severity order.\n*/\nvar LEVEL_RANK = {\n\terror: 4,\n\twarn: 3,\n\tinfo: 2,\n\tdebug: 1,\n\tunknown: 0\n};\n/**\n* Worst level in a set of levels, or `null` when none of them has a level.\n*\n* This is what a request id group is coloured by: a group with one error line\n* and twenty info lines is an error, because that is what a reader needs to see.\n*/\nfunction mostCriticalLevel(levels) {\n\tlet best = null;\n\tlet bestRank = -1;\n\tfor (const level of levels) {\n\t\tif (level === null || level === void 0 || level === \"unknown\") continue;\n\t\tconst rank = LEVEL_RANK[level];\n\t\tif (rank > bestRank) {\n\t\t\tbestRank = rank;\n\t\t\tbest = level;\n\t\t}\n\t}\n\treturn best;\n}\n/**\n* Payload keys checked, in order, for a request id the producer declared.\n*\n* The list is deliberately about the *request*: a trace id, a session id or a\n* tenant id names something else and must not collapse unrelated lines.\n*/\nvar REQUEST_ID_KEYS = [\n\t\"requestId\",\n\t\"request_id\",\n\t\"requestID\",\n\t\"reqId\",\n\t\"req_id\",\n\t\"awsRequestId\",\n\t\"aws_request_id\",\n\t\"xRequestId\",\n\t\"x_request_id\",\n\t\"x-request-id\",\n\t\"X-Request-Id\"\n];\n/** Values that look like an id but mean \"there is none\". */\nvar REQUEST_ID_PLACEHOLDERS = /* @__PURE__ */ new Set([\n\t\"none\",\n\t\"null\",\n\t\"undefined\",\n\t\"n/a\",\n\t\"na\",\n\t\"unknown\",\n\t\"test\",\n\t\"-\",\n\t\"{{requestid}}\",\n\t\"${requestid}\"\n]);\n/** Shortest value treated as a request id, so `id: 1` is not a grouping key. */\nvar REQUEST_ID_MIN_LENGTH = 4;\n/** Characters a request id is made of; anything with a space is not an id. */\nvar REQUEST_ID_PATTERN = /^[A-Za-z0-9][A-Za-z0-9._:=-]*$/;\n/**\n* `RequestId: 1234-abcd`, `request_id=abc.def`, `x-request-id: 8f2c`: the\n* separators and the casing both vary, so one pattern covers them.\n*\n* A bare UUID is deliberately *not* matched. Plenty of log lines carry a\n* correlation id, a span id or an uploaded file's id, and grouping by one of\n* those would invent requests that never existed.\n*/\nvar REQUEST_ID_TEXT = /\\brequest[\\s_-]?id\\b\\s*[:=]\\s*\"?([A-Za-z0-9][A-Za-z0-9._:=-]*)\"?/i;\n/** Trims trailing punctuation a sentence adds after an id. */\nfunction cleanRequestId(value) {\n\tconst trimmed = value.replace(/[.,;:]+$/, \"\").trim();\n\tif (trimmed.length < REQUEST_ID_MIN_LENGTH) return null;\n\tif (REQUEST_ID_PLACEHOLDERS.has(trimmed.toLowerCase())) return null;\n\treturn REQUEST_ID_PATTERN.test(trimmed) ? trimmed : null;\n}\n/** Request id the payload declares, when the line carries a JSON object. */\nfunction declaredRequestId(message) {\n\tconst payload = findJsonInMessage(message);\n\tif (payload === null || typeof payload !== \"object\" || Array.isArray(payload)) return null;\n\tconst record = payload;\n\tfor (const key of REQUEST_ID_KEYS) {\n\t\tconst value = record[key];\n\t\tif (typeof value === \"string\") {\n\t\t\tconst cleaned = cleanRequestId(value);\n\t\t\tif (cleaned !== null) return cleaned;\n\t\t}\n\t\tif (typeof value === \"number\" && Number.isFinite(value)) return String(value);\n\t}\n\treturn null;\n}\n/**\n* Detects the request id of a log line, or returns `null` when it has none.\n*\n* A declared payload key wins; the text form is the fallback for the many logs\n* that print their id instead of emitting JSON. Both paths return the id\n* verbatim, because it is an identifier - folding case would merge distinct ids\n* on the one hand and lie about what the log said on the other.\n*/\nfunction detectRequestId(message) {\n\tconst text = message ?? \"\";\n\tif (text === \"\") return null;\n\tconst declared = declaredRequestId(text);\n\tif (declared !== null) return declared;\n\tconst match = REQUEST_ID_TEXT.exec(text);\n\treturn match === null ? null : cleanRequestId(match[1] ?? \"\");\n}\n/**\n* Detects the severity of a log line.\n*\n* A level the payload declares wins, because it is a statement of fact; the\n* text heuristic is the fallback for the many logs that declare nothing. The\n* heuristic matches level words anywhere in the line, so\n* `{\"level\":\"info\",\"msg\":\"retry after error count 0\"}` is `info`, not `error`.\n*/\nfunction detectLevelWithSource(message) {\n\tconst declared = declaredLevel(message ?? \"\");\n\tif (declared !== null) return {\n\t\tlevel: declared,\n\t\tsource: \"json\"\n\t};\n\tconst upper = (message ?? \"\").toUpperCase();\n\tif (ERROR_PATTERN.test(upper)) return {\n\t\tlevel: \"error\",\n\t\tsource: \"text\"\n\t};\n\tif (WARN_PATTERN.test(upper)) return {\n\t\tlevel: \"warn\",\n\t\tsource: \"text\"\n\t};\n\tif (DEBUG_PATTERN.test(upper)) return {\n\t\tlevel: \"debug\",\n\t\tsource: \"text\"\n\t};\n\treturn {\n\t\tlevel: null,\n\t\tsource: null\n\t};\n}\n/**\n* Guesses the severity of a log line from its text, or returns `null` when the\n* line carries no signal at all (a stack-trace continuation, for example).\n*/\nfunction detectLevel(message) {\n\treturn detectLevelWithSource(message).level;\n}\n/** Level of an event: what the server detected, else a guess from the text. */\nfunction effectiveLevel(event) {\n\treturn event.level !== void 0 ? event.level : detectLevel(event.message);\n}\n/** True when an event passes a level filter; a `null` filter accepts every line. */\nfunction matchesLevel(event, level) {\n\treturn level === null || effectiveLevel(event) === level;\n}\n/** Filters events by level, keeping every line when `level` is `null`. */\nfunction filterByLevel(events, level) {\n\tif (level === null) return events.slice();\n\treturn events.filter((event) => matchesLevel(event, level));\n}\n/** Tailwind text colour class for a severity; an unknown level stays neutral. */\nfunction levelColorClass(level) {\n\tswitch (level) {\n\t\tcase \"error\": return \"text-red-400\";\n\t\tcase \"warn\": return \"text-amber-300\";\n\t\tcase \"debug\": return \"text-neutral-500\";\n\t\tdefault: return \"text-neutral-200\";\n\t}\n}\n/** Stable key for rendering a log line, since event ids can repeat or be missing. */\nfunction eventKey(event, index) {\n\treturn `${event.id ?? \"no-id\"}:${event.timestamp}:${index}`;\n}\n/** Case-insensitive substring match over the message and the stream name. */\nfunction matchesFilter(event, query) {\n\tconst needle = (query ?? \"\").trim().toLowerCase();\n\tif (needle === \"\") return true;\n\treturn `${event.message ?? \"\"} ${event.streamName ?? \"\"}`.toLowerCase().includes(needle);\n}\n/** Returns the events matching `query`, in arrival order. */\nfunction filterEvents(events, query) {\n\tif ((query ?? \"\").trim() === \"\") return events.slice();\n\treturn events.filter((event) => matchesFilter(event, query));\n}\n/** Creates an array of `length` undefined slots. */\nfunction emptySlots(length) {\n\treturn Array.from({ length });\n}\n/**\n* Fixed-capacity ring buffer that overwrites the oldest item once it is full.\n*/\nvar LogRingBuffer = class {\n\t/** Maximum number of items kept. */\n\tcapacity;\n\t#items;\n\t#start = 0;\n\t#size = 0;\n\t#dropped = 0;\n\tconstructor(capacity = DEFAULT_CAPACITY) {\n\t\tif (!Number.isInteger(capacity) || capacity <= 0) throw new RangeError(`capacity must be a positive integer, received ${capacity}`);\n\t\tthis.capacity = capacity;\n\t\tthis.#items = emptySlots(capacity);\n\t}\n\t/** Number of items currently stored. */\n\tget size() {\n\t\treturn this.#size;\n\t}\n\t/** Number of items discarded because the buffer was full. */\n\tget dropped() {\n\t\treturn this.#dropped;\n\t}\n\t/** True when the buffer holds `capacity` items. */\n\tget full() {\n\t\treturn this.#size === this.capacity;\n\t}\n\t/** Appends one item, dropping the oldest item when the buffer is full. */\n\tpush(item) {\n\t\tif (this.#size === this.capacity) {\n\t\t\tthis.#dropped += 1;\n\t\t\tthis.#start = (this.#start + 1) % this.capacity;\n\t\t\tthis.#size -= 1;\n\t\t}\n\t\tconst index = (this.#start + this.#size) % this.capacity;\n\t\tthis.#items[index] = item;\n\t\tthis.#size += 1;\n\t}\n\t/** Appends several items in order. */\n\tpushMany(items) {\n\t\tfor (const item of items) this.push(item);\n\t}\n\t/** Copies the stored items into an array ordered oldest to newest. */\n\ttoArray() {\n\t\tconst output = emptySlots(this.#size);\n\t\tfor (let offset = 0; offset < this.#size; offset += 1) output[offset] = this.#items[(this.#start + offset) % this.capacity];\n\t\treturn output;\n\t}\n\t/** Oldest stored item, or `undefined` when empty. */\n\tfirst() {\n\t\treturn this.#size === 0 ? void 0 : this.#items[this.#start];\n\t}\n\t/** Newest stored item, or `undefined` when empty. */\n\tlast() {\n\t\treturn this.#size === 0 ? void 0 : this.#items[(this.#start + this.#size - 1) % this.capacity];\n\t}\n\t/** Removes every item and resets the dropped counter. */\n\tclear() {\n\t\tthis.#items = emptySlots(this.capacity);\n\t\tthis.#start = 0;\n\t\tthis.#size = 0;\n\t\tthis.#dropped = 0;\n\t}\n};\n/**\n* Log store used by the UI: a visible ring buffer plus a pending buffer that fills up while the\n* view is paused. `push()` never drops silent data, it either appends to the visible buffer or to\n* the pending buffer; `resume()` moves the pending events into the visible buffer in order.\n*/\nvar LogStore = class {\n\tbuffer;\n\t#pending;\n\t#paused = false;\n\tconstructor(capacity = DEFAULT_CAPACITY) {\n\t\tthis.buffer = new LogRingBuffer(capacity);\n\t\tthis.#pending = new LogRingBuffer(capacity);\n\t}\n\t/** True when incoming events are buffered instead of appended to the visible buffer. */\n\tget paused() {\n\t\treturn this.#paused;\n\t}\n\t/** Number of visible lines. */\n\tget size() {\n\t\treturn this.buffer.size;\n\t}\n\t/** Number of lines held back while paused. */\n\tget pendingCount() {\n\t\treturn this.#pending.size;\n\t}\n\t/** Number of visible lines dropped because the buffer was full. */\n\tget droppedCount() {\n\t\treturn this.buffer.dropped;\n\t}\n\t/** Appends events to the visible buffer, or holds them back while paused. */\n\tpush(events) {\n\t\tif (this.#paused) {\n\t\t\tthis.#pending.pushMany(events);\n\t\t\treturn;\n\t\t}\n\t\tthis.buffer.pushMany(events);\n\t}\n\t/** Pauses or resumes appending. Resuming flushes the pending events immediately. */\n\tsetPaused(paused) {\n\t\tif (paused === this.#paused) return [];\n\t\tthis.#paused = paused;\n\t\treturn paused ? [] : this.flush();\n\t}\n\t/** Pauses appending to the visible buffer. */\n\tpause() {\n\t\tthis.#paused = true;\n\t}\n\t/** Resumes appending and returns the events flushed from the pending buffer. */\n\tresume() {\n\t\tthis.#paused = false;\n\t\treturn this.flush();\n\t}\n\t/** Moves every pending event into the visible buffer, oldest first. */\n\tflush() {\n\t\tconst flushed = this.#pending.toArray();\n\t\tthis.#pending.clear();\n\t\tthis.buffer.pushMany(flushed);\n\t\treturn flushed;\n\t}\n\t/** Copies the visible lines, oldest first. */\n\ttoArray() {\n\t\treturn this.buffer.toArray();\n\t}\n\t/** Empties the visible buffer and discards pending events. */\n\tclear() {\n\t\tthis.buffer.clear();\n\t\tthis.#pending.clear();\n\t}\n};\n//#endregion\nexport { detectLevelWithSource as a, eventKey as c, isLogLevel as d, levelColorClass as f, tokenizeJson as g, formatLogMessage as h, detectLevel as i, filterByLevel as l, findJsonInMessage as m, LEVEL_RANK as n, detectRequestId as o, mostCriticalLevel as p, LogStore as r, effectiveLevel as s, DEFAULT_CAPACITY as t, filterEvents as u };\n"],"names":[],"mappings":"AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,UAAU,CAAC,OAAO,EAAE;AAC7B,CAAC,IAAI,OAAO,OAAO,KAAK,QAAQ,EAAE,OAAO,IAAI;AAC7C,CAAC,MAAM,OAAO,GAAG,OAAO,CAAC,IAAI,EAAE;AAC/B,CAAC,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,OAAO,IAAI;AACtC,CAAC,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC;AACzB,CAAC,IAAI,KAAK,KAAK,GAAG,IAAI,KAAK,KAAK,GAAG,EAAE,OAAO,IAAI;AAChD,CAAC,IAAI;AACL,EAAE,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC;AACpC,EAAE,IAAI,MAAM,KAAK,IAAI,IAAI,OAAO,MAAM,KAAK,QAAQ,EAAE,OAAO,IAAI;AAChE,EAAE,OAAO,MAAM;AACf,CAAC,CAAC,CAAC,MAAM;AACT,EAAE,OAAO,IAAI;AACb,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,gBAAgB,CAAC,OAAO,EAAE,OAAO,GAAG,EAAE,EAAE;AACjD,CAAC,MAAM,EAAE,UAAU,GAAG,IAAI,EAAE,GAAG,OAAO;AACtC,CAAC,MAAM,KAAK,GAAG,UAAU,CAAC,OAAO,CAAC;AAClC,CAAC,IAAI,KAAK,KAAK,IAAI,IAAI,CAAC,UAAU,EAAE,OAAO;AAC3C,EAAE,IAAI,EAAE,OAAO;AACf,EAAE,MAAM,EAAE,KAAK,KAAK,IAAI;AACxB,EAAE;AACF,EAAE;AACF,CAAC,OAAO;AACR,EAAE,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC;AACtC,EAAE,MAAM,EAAE,IAAI;AACd,EAAE;AACF,EAAE;AACF;AACA,IAAI,cAAc,GAAG,oCAAoC;AACzD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,YAAY,CAAC,IAAI,EAAE;AAC5B,CAAC,MAAM,MAAM,GAAG,EAAE;AAClB,CAAC,IAAI,KAAK,GAAG,CAAC;AACd,CAAC,MAAM,IAAI,GAAG,CAAC,IAAI,EAAE,KAAK,KAAK;AAC/B,EAAE,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC;AACpC,GAAG,IAAI;AACP,GAAG,IAAI,EAAE;AACT,GAAG,CAAC;AACJ,CAAC,CAAC;AACF,CAAC,OAAO,KAAK,GAAG,IAAI,CAAC,MAAM,EAAE;AAC7B,EAAE,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;AAC1B,EAAE,IAAI,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,IAAI,EAAE;AACtE,GAAG,IAAI,GAAG,GAAG,KAAK;AAClB,GAAG,OAAO,GAAG,GAAG,IAAI,CAAC,MAAM,IAAI,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC;AACrE,GAAG,IAAI,CAAC,YAAY,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;AAC7C,GAAG,KAAK,GAAG,GAAG;AACd,GAAG;AACH,EAAE;AACF,EAAE,IAAI,IAAI,KAAK,IAAI,EAAE;AACrB,GAAG,IAAI,GAAG,GAAG,KAAK,GAAG,CAAC;AACtB,GAAG,OAAO,GAAG,GAAG,IAAI,CAAC,MAAM,EAAE;AAC7B,IAAI,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,IAAI,EAAE;AAC5B,KAAK,GAAG,IAAI,CAAC;AACb,KAAK;AACL,IAAI;AACJ,IAAI,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,IAAI,EAAE;AAC5B,IAAI,GAAG,IAAI,CAAC;AACZ,GAAG;AACH,GAAG,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;AAChE,GAAG,IAAI,SAAS,GAAG,KAAK,GAAG,GAAG,CAAC,MAAM;AACrC,GAAG,OAAO,SAAS,GAAG,IAAI,CAAC,MAAM,IAAI,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,SAAS,IAAI,CAAC;AACvF,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,GAAG,GAAG,KAAK,GAAG,QAAQ,EAAE,GAAG,CAAC;AACxD,GAAG,KAAK,IAAI,GAAG,CAAC,MAAM;AACtB,GAAG;AACH,EAAE;AACF,EAAE,IAAI,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,GAAG,EAAE;AACpG,GAAG,IAAI,CAAC,aAAa,EAAE,IAAI,CAAC;AAC5B,GAAG,KAAK,IAAI,CAAC;AACb,GAAG;AACH,EAAE;AACF,EAAE,IAAI,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,KAAK,CAAC,EAAE;AACzE,GAAG,MAAM,OAAO,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,KAAK,CAAC,GAAG,MAAM,GAAG,OAAO;AACpE,GAAG,IAAI,CAAC,SAAS,EAAE,OAAO,CAAC;AAC3B,GAAG,KAAK,IAAI,OAAO,CAAC,MAAM;AAC1B,GAAG;AACH,EAAE;AACF,EAAE,IAAI,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE;AACtC,GAAG,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC;AACvB,GAAG,KAAK,IAAI,CAAC;AACb,GAAG;AACH,EAAE;AACF,EAAE,IAAI,GAAG,GAAG,KAAK;AACjB,EAAE,OAAO,GAAG,GAAG,IAAI,CAAC,MAAM,IAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC;AAC7E,EAAE,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;AACzD,EAAE,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,QAAQ,GAAG,OAAO,EAAE,GAAG,CAAC;AAC1D,EAAE,KAAK,IAAI,GAAG,CAAC,MAAM;AACrB,CAAC;AACD,CAAC,OAAO,MAAM;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,iBAAiB,CAAC,OAAO,EAAE;AACpC,CAAC,IAAI,OAAO,OAAO,KAAK,QAAQ,EAAE,OAAO,IAAI;AAC7C,CAAC,MAAM,KAAK,GAAG,UAAU,CAAC,OAAO,CAAC;AAClC,CAAC,IAAI,KAAK,KAAK,IAAI,EAAE,OAAO,KAAK;AACjC,CAAC,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,OAAO,CAAC,MAAM,EAAE,KAAK,IAAI,CAAC,EAAE;AACzD,EAAE,MAAM,MAAM,GAAG,OAAO,CAAC,KAAK,CAAC;AAC/B,EAAE,IAAI,MAAM,KAAK,GAAG,IAAI,MAAM,KAAK,GAAG,EAAE;AACxC,EAAE,MAAM,MAAM,GAAG,MAAM,KAAK,GAAG,GAAG,GAAG,GAAG,GAAG;AAC3C,EAAE,IAAI,KAAK,GAAG,CAAC;AACf,EAAE,IAAI,QAAQ,GAAG,KAAK;AACtB,EAAE,IAAI,OAAO,GAAG,KAAK;AACrB,EAAE,KAAK,IAAI,IAAI,GAAG,KAAK,EAAE,IAAI,GAAG,OAAO,CAAC,MAAM,EAAE,IAAI,IAAI,CAAC,EAAE;AAC3D,GAAG,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC;AAC7B,GAAG,IAAI,QAAQ,EAAE;AACjB,IAAI,IAAI,OAAO,EAAE,OAAO,GAAG,KAAK;AAChC,SAAS,IAAI,IAAI,KAAK,IAAI,EAAE,OAAO,GAAG,IAAI;AAC1C,SAAS,IAAI,IAAI,KAAK,IAAI,EAAE,QAAQ,GAAG,KAAK;AAC5C,IAAI;AACJ,GAAG;AACH,GAAG,IAAI,IAAI,KAAK,IAAI,EAAE;AACtB,IAAI,QAAQ,GAAG,IAAI;AACnB,IAAI;AACJ,GAAG;AACH,GAAG,IAAI,IAAI,KAAK,MAAM,EAAE,KAAK,IAAI,CAAC;AAClC,QAAQ,IAAI,IAAI,KAAK,MAAM,EAAE;AAC7B,IAAI,KAAK,IAAI,CAAC;AACd,IAAI,IAAI,KAAK,KAAK,CAAC,EAAE;AACrB,KAAK,MAAM,SAAS,GAAG,OAAO,CAAC,KAAK,CAAC,KAAK,EAAE,IAAI,GAAG,CAAC,CAAC;AACrD,KAAK,IAAI;AACT,MAAM,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC;AAC1C,MAAM,IAAI,MAAM,KAAK,IAAI,IAAI,OAAO,MAAM,KAAK,QAAQ,EAAE,OAAO,MAAM;AACtE,KAAK,CAAC,CAAC,MAAM,CAAC;AACd,KAAK;AACL,IAAI;AACJ,GAAG;AACH,EAAE;AACF,CAAC;AACD,CAAC,OAAO,IAAI;AACZ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI,gBAAgB,GAAG,GAAG;AAC1B,IAAI,aAAa,GAAG,iFAAiF;AACrG,IAAI,YAAY,GAAG,oBAAoB;AACvC,IAAI,aAAa,GAAG,2BAA2B;AAC/C;AACA,IAAI,UAAU,GAAG;AACjB,CAAC,OAAO;AACR,CAAC,UAAU;AACX,CAAC,KAAK;AACN,CAAC,UAAU;AACX,CAAC;AACD,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI,WAAW,GAAG;AAClB,CAAC,KAAK,EAAE,OAAO;AACf,CAAC,OAAO,EAAE,OAAO;AACjB,CAAC,KAAK,EAAE,OAAO;AACf,CAAC,IAAI,EAAE,MAAM;AACb,CAAC,WAAW,EAAE,MAAM;AACpB,CAAC,MAAM,EAAE,MAAM;AACf,CAAC,IAAI,EAAE,MAAM;AACb,CAAC,IAAI,EAAE,MAAM;AACb,CAAC,OAAO,EAAE,MAAM;AAChB,CAAC,KAAK,EAAE,OAAO;AACf,CAAC,GAAG,EAAE,OAAO;AACb,CAAC,SAAS,EAAE,OAAO;AACnB,CAAC,KAAK,EAAE,OAAO;AACf,CAAC,QAAQ,EAAE,OAAO;AAClB,CAAC,IAAI,EAAE,OAAO;AACd,CAAC,KAAK,EAAE,OAAO;AACf,CAAC,MAAM,EAAE,OAAO;AAChB,CAAC,KAAK,EAAE,OAAO;AACf,CAAC,SAAS,EAAE;AACZ,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI,cAAc,GAAG;AACrB,CAAC,EAAE,EAAE,OAAO;AACZ,CAAC,EAAE,EAAE,OAAO;AACZ,CAAC,EAAE,EAAE,MAAM;AACX,CAAC,EAAE,EAAE,MAAM;AACX,CAAC,EAAE,EAAE,OAAO;AACZ,CAAC,EAAE,EAAE;AACL,CAAC;AACD;AACA,SAAS,UAAU,CAAC,KAAK,EAAE;AAC3B,CAAC,OAAO,KAAK,KAAK,OAAO,IAAI,KAAK,KAAK,MAAM,IAAI,KAAK,KAAK,MAAM,IAAI,KAAK,KAAK,OAAO;AACtF;AACA;AACA,SAAS,iBAAiB,CAAC,KAAK,EAAE;AAClC,CAAC,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,OAAO,cAAc,CAAC,KAAK,CAAC,IAAI,IAAI;AAC9F,CAAC,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,OAAO,IAAI;AAC3C,CAAC,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE;AACxC,CAAC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,OAAO,IAAI;AACnC,CAAC,OAAO,WAAW,CAAC,IAAI,CAAC,IAAI,IAAI;AACjC;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,aAAa,CAAC,OAAO,EAAE;AAChC,CAAC,MAAM,OAAO,GAAG,iBAAiB,CAAC,OAAO,CAAC;AAC3C,CAAC,IAAI,OAAO,KAAK,IAAI,IAAI,OAAO,OAAO,KAAK,QAAQ,IAAI,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,OAAO,IAAI;AAC3F,CAAC,MAAM,MAAM,GAAG,OAAO;AACvB,CAAC,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE;AAC/B,EAAE,MAAM,KAAK,GAAG,iBAAiB,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;AAC9C,EAAE,IAAI,KAAK,KAAK,IAAI,EAAE,OAAO,KAAK;AAClC,CAAC;AACD,CAAC,OAAO,IAAI;AACZ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACG,IAAC,UAAU,GAAG;AACjB,CAAC,KAAK,EAAE,CAAC;AACT,CAAC,IAAI,EAAE,CAAC;AACR,CAAC,IAAI,EAAE,CAAC;AACR,CAAC,KAAK,EAAE,CAAC;AACT,CAAC,OAAO,EAAE;AACV;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,iBAAiB,CAAC,MAAM,EAAE;AACnC,CAAC,IAAI,IAAI,GAAG,IAAI;AAChB,CAAC,IAAI,QAAQ,GAAG,EAAE;AAClB,CAAC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE;AAC7B,EAAE,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,KAAK,MAAM,IAAI,KAAK,KAAK,SAAS,EAAE;AACjE,EAAE,MAAM,IAAI,GAAG,UAAU,CAAC,KAAK,CAAC;AAChC,EAAE,IAAI,IAAI,GAAG,QAAQ,EAAE;AACvB,GAAG,QAAQ,GAAG,IAAI;AAClB,GAAG,IAAI,GAAG,KAAK;AACf,EAAE;AACF,CAAC;AACD,CAAC,OAAO,IAAI;AACZ;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI,eAAe,GAAG;AACtB,CAAC,WAAW;AACZ,CAAC,YAAY;AACb,CAAC,WAAW;AACZ,CAAC,OAAO;AACR,CAAC,QAAQ;AACT,CAAC,cAAc;AACf,CAAC,gBAAgB;AACjB,CAAC,YAAY;AACb,CAAC,cAAc;AACf,CAAC,cAAc;AACf,CAAC;AACD,CAAC;AACD;AACA,IAAI,uBAAuB,mBAAmB,IAAI,GAAG,CAAC;AACtD,CAAC,MAAM;AACP,CAAC,MAAM;AACP,CAAC,WAAW;AACZ,CAAC,KAAK;AACN,CAAC,IAAI;AACL,CAAC,SAAS;AACV,CAAC,MAAM;AACP,CAAC,GAAG;AACJ,CAAC,eAAe;AAChB,CAAC;AACD,CAAC,CAAC;AACF;AACA,IAAI,qBAAqB,GAAG,CAAC;AAC7B;AACA,IAAI,kBAAkB,GAAG,gCAAgC;AACzD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI,eAAe,GAAG,mEAAmE;AACzF;AACA,SAAS,cAAc,CAAC,KAAK,EAAE;AAC/B,CAAC,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE;AACrD,CAAC,IAAI,OAAO,CAAC,MAAM,GAAG,qBAAqB,EAAE,OAAO,IAAI;AACxD,CAAC,IAAI,uBAAuB,CAAC,GAAG,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC,EAAE,OAAO,IAAI;AACpE,CAAC,OAAO,kBAAkB,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,OAAO,GAAG,IAAI;AACzD;AACA;AACA,SAAS,iBAAiB,CAAC,OAAO,EAAE;AACpC,CAAC,MAAM,OAAO,GAAG,iBAAiB,CAAC,OAAO,CAAC;AAC3C,CAAC,IAAI,OAAO,KAAK,IAAI,IAAI,OAAO,OAAO,KAAK,QAAQ,IAAI,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,OAAO,IAAI;AAC3F,CAAC,MAAM,MAAM,GAAG,OAAO;AACvB,CAAC,KAAK,MAAM,GAAG,IAAI,eAAe,EAAE;AACpC,EAAE,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC;AAC3B,EAAE,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE;AACjC,GAAG,MAAM,OAAO,GAAG,cAAc,CAAC,KAAK,CAAC;AACxC,GAAG,IAAI,OAAO,KAAK,IAAI,EAAE,OAAO,OAAO;AACvC,EAAE;AACF,EAAE,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,OAAO,MAAM,CAAC,KAAK,CAAC;AAC/E,CAAC;AACD,CAAC,OAAO,IAAI;AACZ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,eAAe,CAAC,OAAO,EAAE;AAClC,CAAC,MAAM,IAAI,GAAG,OAAO,IAAI,EAAE;AAC3B,CAAC,IAAI,IAAI,KAAK,EAAE,EAAE,OAAO,IAAI;AAC7B,CAAC,MAAM,QAAQ,GAAG,iBAAiB,CAAC,IAAI,CAAC;AACzC,CAAC,IAAI,QAAQ,KAAK,IAAI,EAAE,OAAO,QAAQ;AACvC,CAAC,MAAM,KAAK,GAAG,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC;AACzC,CAAC,OAAO,KAAK,KAAK,IAAI,GAAG,IAAI,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;AAC9D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,qBAAqB,CAAC,OAAO,EAAE;AACxC,CAAC,MAAM,QAAQ,GAAG,aAAa,CAAC,OAAO,IAAI,EAAE,CAAC;AAC9C,CAAC,IAAI,QAAQ,KAAK,IAAI,EAAE,OAAO;AAC/B,EAAE,KAAK,EAAE,QAAQ;AACjB,EAAE,MAAM,EAAE;AACV,EAAE;AACF,CAAC,MAAM,KAAK,GAAG,CAAC,OAAO,IAAI,EAAE,EAAE,WAAW,EAAE;AAC5C,CAAC,IAAI,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,OAAO;AACvC,EAAE,KAAK,EAAE,OAAO;AAChB,EAAE,MAAM,EAAE;AACV,EAAE;AACF,CAAC,IAAI,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,OAAO;AACtC,EAAE,KAAK,EAAE,MAAM;AACf,EAAE,MAAM,EAAE;AACV,EAAE;AACF,CAAC,IAAI,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,OAAO;AACvC,EAAE,KAAK,EAAE,OAAO;AAChB,EAAE,MAAM,EAAE;AACV,EAAE;AACF,CAAC,OAAO;AACR,EAAE,KAAK,EAAE,IAAI;AACb,EAAE,MAAM,EAAE;AACV,EAAE;AACF;AACA;AACA;AACA;AACA;AACA,SAAS,WAAW,CAAC,OAAO,EAAE;AAC9B,CAAC,OAAO,qBAAqB,CAAC,OAAO,CAAC,CAAC,KAAK;AAC5C;AACA;AACA,SAAS,cAAc,CAAC,KAAK,EAAE;AAC/B,CAAC,OAAO,KAAK,CAAC,KAAK,KAAK,MAAM,GAAG,KAAK,CAAC,KAAK,GAAG,WAAW,CAAC,KAAK,CAAC,OAAO,CAAC;AACzE;AACA;AACA,SAAS,YAAY,CAAC,KAAK,EAAE,KAAK,EAAE;AACpC,CAAC,OAAO,KAAK,KAAK,IAAI,IAAI,cAAc,CAAC,KAAK,CAAC,KAAK,KAAK;AACzD;AACA;AACA,SAAS,aAAa,CAAC,MAAM,EAAE,KAAK,EAAE;AACtC,CAAC,IAAI,KAAK,KAAK,IAAI,EAAE,OAAO,MAAM,CAAC,KAAK,EAAE;AAC1C,CAAC,OAAO,MAAM,CAAC,MAAM,CAAC,CAAC,KAAK,KAAK,YAAY,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;AAC5D;AACA;AACA,SAAS,eAAe,CAAC,KAAK,EAAE;AAChC,CAAC,QAAQ,KAAK;AACd,EAAE,KAAK,OAAO,EAAE,OAAO,cAAc;AACrC,EAAE,KAAK,MAAM,EAAE,OAAO,gBAAgB;AACtC,EAAE,KAAK,OAAO,EAAE,OAAO,kBAAkB;AACzC,EAAE,SAAS,OAAO,kBAAkB;AACpC;AACA;AACA;AACA,SAAS,QAAQ,CAAC,KAAK,EAAE,KAAK,EAAE;AAChC,CAAC,OAAO,CAAC,EAAE,KAAK,CAAC,EAAE,IAAI,OAAO,CAAC,CAAC,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;AAC5D;AACA;AACA,SAAS,aAAa,CAAC,KAAK,EAAE,KAAK,EAAE;AACrC,CAAC,MAAM,MAAM,GAAG,CAAC,KAAK,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,WAAW,EAAE;AAClD,CAAC,IAAI,MAAM,KAAK,EAAE,EAAE,OAAO,IAAI;AAC/B,CAAC,OAAO,CAAC,EAAE,KAAK,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC,EAAE,KAAK,CAAC,UAAU,IAAI,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,MAAM,CAAC;AACzF;AACA;AACA,SAAS,YAAY,CAAC,MAAM,EAAE,KAAK,EAAE;AACrC,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,OAAO,MAAM,CAAC,KAAK,EAAE;AACvD,CAAC,OAAO,MAAM,CAAC,MAAM,CAAC,CAAC,KAAK,KAAK,aAAa,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;AAC7D;AACA;AACA,SAAS,UAAU,CAAC,MAAM,EAAE;AAC5B,CAAC,OAAO,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC;AAC9B;AACA;AACA;AACA;AACA,IAAI,aAAa,GAAG,MAAM;AAC1B;AACA,CAAC,QAAQ;AACT,CAAC,MAAM;AACP,CAAC,MAAM,GAAG,CAAC;AACX,CAAC,KAAK,GAAG,CAAC;AACV,CAAC,QAAQ,GAAG,CAAC;AACb,CAAC,WAAW,CAAC,QAAQ,GAAG,gBAAgB,EAAE;AAC1C,EAAE,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,QAAQ,IAAI,CAAC,EAAE,MAAM,IAAI,UAAU,CAAC,CAAC,8CAA8C,EAAE,QAAQ,CAAC,CAAC,CAAC;AACrI,EAAE,IAAI,CAAC,QAAQ,GAAG,QAAQ;AAC1B,EAAE,IAAI,CAAC,MAAM,GAAG,UAAU,CAAC,QAAQ,CAAC;AACpC,CAAC;AACD;AACA,CAAC,IAAI,IAAI,GAAG;AACZ,EAAE,OAAO,IAAI,CAAC,KAAK;AACnB,CAAC;AACD;AACA,CAAC,IAAI,OAAO,GAAG;AACf,EAAE,OAAO,IAAI,CAAC,QAAQ;AACtB,CAAC;AACD;AACA,CAAC,IAAI,IAAI,GAAG;AACZ,EAAE,OAAO,IAAI,CAAC,KAAK,KAAK,IAAI,CAAC,QAAQ;AACrC,CAAC;AACD;AACA,CAAC,IAAI,CAAC,IAAI,EAAE;AACZ,EAAE,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI,CAAC,QAAQ,EAAE;AACpC,GAAG,IAAI,CAAC,QAAQ,IAAI,CAAC;AACrB,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,IAAI,IAAI,CAAC,QAAQ;AAClD,GAAG,IAAI,CAAC,KAAK,IAAI,CAAC;AAClB,EAAE;AACF,EAAE,MAAM,KAAK,GAAG,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,QAAQ;AAC1D,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,IAAI;AAC3B,EAAE,IAAI,CAAC,KAAK,IAAI,CAAC;AACjB,CAAC;AACD;AACA,CAAC,QAAQ,CAAC,KAAK,EAAE;AACjB,EAAE,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;AAC3C,CAAC;AACD;AACA,CAAC,OAAO,GAAG;AACX,EAAE,MAAM,MAAM,GAAG,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC;AACvC,EAAE,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC,KAAK,EAAE,MAAM,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,MAAM,GAAG,MAAM,IAAI,IAAI,CAAC,QAAQ,CAAC;AAC7H,EAAE,OAAO,MAAM;AACf,CAAC;AACD;AACA,CAAC,KAAK,GAAG;AACT,EAAE,OAAO,IAAI,CAAC,KAAK,KAAK,CAAC,GAAG,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC;AAC7D,CAAC;AACD;AACA,CAAC,IAAI,GAAG;AACR,EAAE,OAAO,IAAI,CAAC,KAAK,KAAK,CAAC,GAAG,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,KAAK,GAAG,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC;AAChG,CAAC;AACD;AACA,CAAC,KAAK,GAAG;AACT,EAAE,IAAI,CAAC,MAAM,GAAG,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC;AACzC,EAAE,IAAI,CAAC,MAAM,GAAG,CAAC;AACjB,EAAE,IAAI,CAAC,KAAK,GAAG,CAAC;AAChB,EAAE,IAAI,CAAC,QAAQ,GAAG,CAAC;AACnB,CAAC;AACD,CAAC;AACD;AACA;AACA;AACA;AACA;AACG,IAAC,QAAQ,GAAG,MAAM;AACrB,CAAC,MAAM;AACP,CAAC,QAAQ;AACT,CAAC,OAAO,GAAG,KAAK;AAChB,CAAC,WAAW,CAAC,QAAQ,GAAG,gBAAgB,EAAE;AAC1C,EAAE,IAAI,CAAC,MAAM,GAAG,IAAI,aAAa,CAAC,QAAQ,CAAC;AAC3C,EAAE,IAAI,CAAC,QAAQ,GAAG,IAAI,aAAa,CAAC,QAAQ,CAAC;AAC7C,CAAC;AACD;AACA,CAAC,IAAI,MAAM,GAAG;AACd,EAAE,OAAO,IAAI,CAAC,OAAO;AACrB,CAAC;AACD;AACA,CAAC,IAAI,IAAI,GAAG;AACZ,EAAE,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI;AACzB,CAAC;AACD;AACA,CAAC,IAAI,YAAY,GAAG;AACpB,EAAE,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI;AAC3B,CAAC;AACD;AACA,CAAC,IAAI,YAAY,GAAG;AACpB,EAAE,OAAO,IAAI,CAAC,MAAM,CAAC,OAAO;AAC5B,CAAC;AACD;AACA,CAAC,IAAI,CAAC,MAAM,EAAE;AACd,EAAE,IAAI,IAAI,CAAC,OAAO,EAAE;AACpB,GAAG,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC;AACjC,GAAG;AACH,EAAE;AACF,EAAE,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC;AAC9B,CAAC;AACD;AACA,CAAC,SAAS,CAAC,MAAM,EAAE;AACnB,EAAE,IAAI,MAAM,KAAK,IAAI,CAAC,OAAO,EAAE,OAAO,EAAE;AACxC,EAAE,IAAI,CAAC,OAAO,GAAG,MAAM;AACvB,EAAE,OAAO,MAAM,GAAG,EAAE,GAAG,IAAI,CAAC,KAAK,EAAE;AACnC,CAAC;AACD;AACA,CAAC,KAAK,GAAG;AACT,EAAE,IAAI,CAAC,OAAO,GAAG,IAAI;AACrB,CAAC;AACD;AACA,CAAC,MAAM,GAAG;AACV,EAAE,IAAI,CAAC,OAAO,GAAG,KAAK;AACtB,EAAE,OAAO,IAAI,CAAC,KAAK,EAAE;AACrB,CAAC;AACD;AACA,CAAC,KAAK,GAAG;AACT,EAAE,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE;AACzC,EAAE,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE;AACvB,EAAE,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC;AAC/B,EAAE,OAAO,OAAO;AAChB,CAAC;AACD;AACA,CAAC,OAAO,GAAG;AACX,EAAE,OAAO,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE;AAC9B,CAAC;AACD;AACA,CAAC,KAAK,GAAG;AACT,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE;AACrB,EAAE,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE;AACvB,CAAC;AACD;;"}