@kya-os/checkpoint-shared 1.6.0 → 1.8.0
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.
- package/CHANGELOG.md +122 -9
- package/README.md +24 -7
- package/dist/beacon-nonce/index.d.mts +1 -0
- package/dist/beacon-nonce/index.d.mts.map +1 -1
- package/dist/beacon-nonce/index.d.ts +1 -0
- package/dist/beacon-nonce/index.d.ts.map +1 -1
- package/dist/beacon-nonce/index.js +9 -3
- package/dist/beacon-nonce/index.mjs +9 -4
- package/dist/beacon-nonce/index.mjs.map +1 -1
- package/dist/beacon-types/index.d.mts +23 -1
- package/dist/beacon-types/index.d.mts.map +1 -1
- package/dist/beacon-types/index.d.ts +23 -1
- package/dist/beacon-types/index.d.ts.map +1 -1
- package/dist/beacon-types/index.js +49 -4
- package/dist/beacon-types/index.mjs +47 -4
- package/dist/beacon-types/index.mjs.map +1 -1
- package/dist/{browser-posture-BuChqmH5.d.mts → browser-posture-5fPrsxx7.d.mts} +2 -2
- package/dist/{browser-posture-BuChqmH5.d.mts.map → browser-posture-5fPrsxx7.d.mts.map} +1 -1
- package/dist/{browser-posture-DIaVLuW3.d.ts → browser-posture-CCR1kh5e.d.ts} +2 -2
- package/dist/{browser-posture-DIaVLuW3.d.ts.map → browser-posture-CCR1kh5e.d.ts.map} +1 -1
- package/dist/browser-posture-cookie.js +1 -1
- package/dist/browser-posture-cookie.mjs +1 -1
- package/dist/browser-posture-cookie.mjs.map +1 -1
- package/dist/browser-posture-proof.d.mts +16 -2
- package/dist/browser-posture-proof.d.mts.map +1 -1
- package/dist/browser-posture-proof.d.ts +16 -2
- package/dist/browser-posture-proof.d.ts.map +1 -1
- package/dist/browser-posture-proof.js +114 -17
- package/dist/browser-posture-proof.mjs +112 -17
- package/dist/browser-posture-proof.mjs.map +1 -1
- package/dist/browser-posture.d.mts +1 -1
- package/dist/browser-posture.d.ts +1 -1
- package/dist/browser-posture.js +6 -5
- package/dist/browser-posture.mjs +4 -3
- package/dist/browser-posture.mjs.map +1 -1
- package/dist/browser.d.mts +25 -4
- package/dist/browser.d.mts.map +1 -1
- package/dist/browser.d.ts +25 -4
- package/dist/browser.d.ts.map +1 -1
- package/dist/browser.js +1 -1
- package/dist/browser.mjs +1 -1
- package/dist/browser.mjs.map +1 -1
- package/dist/canonical-signer/index.d.mts.map +1 -1
- package/dist/canonical-signer/index.d.ts.map +1 -1
- package/dist/canonical-signer/index.js +116 -79
- package/dist/canonical-signer/index.mjs +117 -52
- package/dist/canonical-signer/index.mjs.map +1 -1
- package/dist/clearance.d.mts +1 -1
- package/dist/clearance.d.ts +1 -1
- package/dist/clearance.js +2 -2
- package/dist/clearance.mjs +2 -2
- package/dist/client-ip-B7w-uHfS.d.mts +55 -0
- package/dist/client-ip-B7w-uHfS.d.mts.map +1 -0
- package/dist/client-ip-B7w-uHfS.d.ts +55 -0
- package/dist/client-ip-B7w-uHfS.d.ts.map +1 -0
- package/dist/{client-ip-CW6pRyLf.js → client-ip-B8wFzJ5f.js} +117 -7
- package/dist/{client-ip-B2Xeo-GK.mjs → client-ip-DIJyr6px.mjs} +113 -9
- package/dist/client-ip-DIJyr6px.mjs.map +1 -0
- package/dist/client-ip.d.mts +2 -0
- package/dist/client-ip.d.ts +2 -0
- package/dist/client-ip.js +8 -0
- package/dist/client-ip.mjs +3 -0
- package/dist/detection-reason-mapping-B9RSkOs8.js +277 -0
- package/dist/detection-reason-mapping-BGymWIPl.mjs +249 -0
- package/dist/detection-reason-mapping-BGymWIPl.mjs.map +1 -0
- package/dist/detection-reason-mapping-CQexNvR7.d.mts +52 -0
- package/dist/detection-reason-mapping-CQexNvR7.d.mts.map +1 -0
- package/dist/detection-reason-mapping-CQexNvR7.d.ts +52 -0
- package/dist/detection-reason-mapping-CQexNvR7.d.ts.map +1 -0
- package/dist/engine-enforcing-AYEcgNsb.js +39 -0
- package/dist/engine-enforcing-B5eNfCpG.mjs +29 -0
- package/dist/engine-enforcing-B5eNfCpG.mjs.map +1 -0
- package/dist/engine-enforcing-DiOclGqf.d.mts +11 -0
- package/dist/engine-enforcing-DiOclGqf.d.mts.map +1 -0
- package/dist/engine-enforcing-DiOclGqf.d.ts +11 -0
- package/dist/engine-enforcing-DiOclGqf.d.ts.map +1 -0
- package/dist/engine-info.d.mts +2 -0
- package/dist/engine-info.d.ts +2 -0
- package/dist/engine-info.js +4 -0
- package/dist/engine-info.mjs +3 -0
- package/dist/errors/index.d.mts +5 -0
- package/dist/errors/index.d.mts.map +1 -1
- package/dist/errors/index.d.ts +5 -0
- package/dist/errors/index.d.ts.map +1 -1
- package/dist/errors/index.js +23 -4
- package/dist/errors/index.mjs +23 -4
- package/dist/errors/index.mjs.map +1 -1
- package/dist/{external-B7WI9FyQ.d.ts → external-m3Kmafwj.d.mts} +2 -2
- package/dist/{external-B7WI9FyQ.d.mts.map → external-m3Kmafwj.d.mts.map} +1 -1
- package/dist/{external-B7WI9FyQ.d.mts → external-m3Kmafwj.d.ts} +2 -2
- package/dist/{external-B7WI9FyQ.d.ts.map → external-m3Kmafwj.d.ts.map} +1 -1
- package/dist/fetcher-CivUCbhL.d.ts +44 -0
- package/dist/fetcher-CivUCbhL.d.ts.map +1 -0
- package/dist/fetcher-cXQsbm6s.d.mts +44 -0
- package/dist/fetcher-cXQsbm6s.d.mts.map +1 -0
- package/dist/gateway-client-ip.d.mts +1 -1
- package/dist/gateway-client-ip.d.ts +1 -1
- package/dist/gateway-client-ip.js +2 -2
- package/dist/gateway-client-ip.mjs +2 -2
- package/dist/host-adapter/index.d.mts +2 -0
- package/dist/host-adapter/index.d.ts +2 -0
- package/dist/host-adapter/index.js +24 -0
- package/dist/host-adapter/index.mjs +3 -0
- package/dist/host-adapter-0F8EpbD6.js +753 -0
- package/dist/host-adapter-DHyISsIf.mjs +593 -0
- package/dist/host-adapter-DHyISsIf.mjs.map +1 -0
- package/dist/index-B3cHxr3O.d.mts +156 -0
- package/dist/index-B3cHxr3O.d.mts.map +1 -0
- package/dist/index-CXbOY7gB.d.ts +156 -0
- package/dist/index-CXbOY7gB.d.ts.map +1 -0
- package/dist/index.d.mts +6997 -12170
- package/dist/index.d.mts.map +1 -1
- package/dist/index.d.ts +6997 -12170
- package/dist/index.d.ts.map +1 -1
- package/dist/index.js +2510 -8893
- package/dist/index.mjs +2366 -8534
- package/dist/index.mjs.map +1 -1
- package/dist/kya-http-error-codes-7ewV5RuK.d.mts +29 -0
- package/dist/kya-http-error-codes-7ewV5RuK.d.mts.map +1 -0
- package/dist/kya-http-error-codes-7ewV5RuK.d.ts +29 -0
- package/dist/kya-http-error-codes-7ewV5RuK.d.ts.map +1 -0
- package/dist/kya-http-error-codes-C2JiWPsi.mjs +73 -0
- package/dist/kya-http-error-codes-C2JiWPsi.mjs.map +1 -0
- package/dist/kya-http-error-codes-UYb1zpGM.js +83 -0
- package/dist/kya-http.d.mts +3 -0
- package/dist/kya-http.d.ts +3 -0
- package/dist/kya-http.js +19 -0
- package/dist/kya-http.mjs +5 -0
- package/dist/mcpi/dashboard-config/index.d.mts.map +1 -1
- package/dist/mcpi/dashboard-config/index.d.ts.map +1 -1
- package/dist/mcpi/status-list/index.d.mts +72 -0
- package/dist/mcpi/status-list/index.d.mts.map +1 -0
- package/dist/mcpi/status-list/index.d.ts +72 -0
- package/dist/mcpi/status-list/index.d.ts.map +1 -0
- package/dist/mcpi/status-list/index.js +703 -0
- package/dist/mcpi/status-list/index.mjs +684 -0
- package/dist/mcpi/status-list/index.mjs.map +1 -0
- package/dist/patterns-B2r7M9wR.js +243 -0
- package/dist/patterns-B7dQoeE3.mjs +173 -0
- package/dist/patterns-B7dQoeE3.mjs.map +1 -0
- package/dist/patterns-Bp40cwh2.d.mts +110 -0
- package/dist/patterns-Bp40cwh2.d.mts.map +1 -0
- package/dist/patterns-Bp40cwh2.d.ts +110 -0
- package/dist/patterns-Bp40cwh2.d.ts.map +1 -0
- package/dist/patterns.d.mts +2 -0
- package/dist/patterns.d.ts +2 -0
- package/dist/patterns.js +15 -0
- package/dist/patterns.mjs +3 -0
- package/dist/policy/enforcement.d.mts +3 -0
- package/dist/policy/enforcement.d.ts +3 -0
- package/dist/policy/enforcement.js +21 -0
- package/dist/policy/enforcement.mjs +4 -0
- package/dist/policy/fetcher.d.mts +2 -0
- package/dist/policy/fetcher.d.ts +2 -0
- package/dist/policy/fetcher.js +240 -0
- package/dist/policy/fetcher.mjs +238 -0
- package/dist/policy/fetcher.mjs.map +1 -0
- package/dist/policy/schemas.d.mts +3 -0
- package/dist/policy/schemas.d.ts +3 -0
- package/dist/policy/schemas.js +27 -0
- package/dist/policy/schemas.mjs +4 -0
- package/dist/{posture-origins-Pn-ii-Pp.mjs → posture-origins-Ci6k4Zh1.js} +24 -173
- package/dist/{posture-origins-LFkX80oF.js → posture-origins-DGyS4Vuk.mjs} +2 -267
- package/dist/posture-origins-DGyS4Vuk.mjs.map +1 -0
- package/dist/{project-verification-key-BccT12tQ.js → project-verification-key-B-L3D2nC.js} +1 -1
- package/dist/{project-verification-key-66N4edKn.mjs → project-verification-key-CWXdu3-n.mjs} +2 -2
- package/dist/{project-verification-key-66N4edKn.mjs.map → project-verification-key-CWXdu3-n.mjs.map} +1 -1
- package/dist/provider-registry.d.mts +2 -0
- package/dist/provider-registry.d.ts +2 -0
- package/dist/provider-registry.js +51 -0
- package/dist/provider-registry.mjs +3 -0
- package/dist/reason-codes.d.mts +2 -0
- package/dist/reason-codes.d.ts +2 -0
- package/dist/reason-codes.js +8 -0
- package/dist/reason-codes.mjs +3 -0
- package/dist/registered-sid-26hNxp6t.mjs +151 -0
- package/dist/registered-sid-26hNxp6t.mjs.map +1 -0
- package/dist/registered-sid-D6KCaT1E.d.mts +33 -0
- package/dist/registered-sid-D6KCaT1E.d.mts.map +1 -0
- package/dist/registered-sid-D6KCaT1E.d.ts +33 -0
- package/dist/registered-sid-D6KCaT1E.d.ts.map +1 -0
- package/dist/registered-sid-DVGTSH0L.js +185 -0
- package/dist/ruleset-hash-Cmv8MSO5.js +34 -0
- package/dist/ruleset-hash-IRN5eI9H.d.mts +5 -0
- package/dist/ruleset-hash-IRN5eI9H.d.mts.map +1 -0
- package/dist/ruleset-hash-IRN5eI9H.d.ts +5 -0
- package/dist/ruleset-hash-IRN5eI9H.d.ts.map +1 -0
- package/dist/ruleset-hash-QQIaLuPi.mjs +30 -0
- package/dist/ruleset-hash-QQIaLuPi.mjs.map +1 -0
- package/dist/schemas-02CI7jgm.d.mts +535 -0
- package/dist/schemas-02CI7jgm.d.mts.map +1 -0
- package/dist/{schemas-YhagYDx_.js → schemas-BlScS1it.js} +0 -20
- package/dist/schemas-C_3C72SR.d.ts +535 -0
- package/dist/schemas-C_3C72SR.d.ts.map +1 -0
- package/dist/schemas-Cm4C4Z5G.js +703 -0
- package/dist/schemas-DPIT8usF.mjs +525 -0
- package/dist/schemas-DPIT8usF.mjs.map +1 -0
- package/dist/{schemas-7qodsG-Z.mjs → schemas-IHAhH3gV.mjs} +2 -16
- package/dist/schemas-IHAhH3gV.mjs.map +1 -0
- package/dist/step-up-BK0oBi11.mjs +1563 -0
- package/dist/step-up-BK0oBi11.mjs.map +1 -0
- package/dist/step-up-Bp8RAQwv.js +1759 -0
- package/dist/step-up-Bz12gYKT.d.mts +130 -0
- package/dist/step-up-Bz12gYKT.d.mts.map +1 -0
- package/dist/step-up-Bz12gYKT.d.ts +130 -0
- package/dist/step-up-Bz12gYKT.d.ts.map +1 -0
- package/dist/test-fixtures/index.d.mts +4 -4
- package/dist/test-fixtures/index.d.mts.map +1 -1
- package/dist/test-fixtures/index.d.ts +4 -4
- package/dist/test-fixtures/index.d.ts.map +1 -1
- package/dist/test-fixtures/index.js +4 -4
- package/dist/test-fixtures/index.mjs +4 -4
- package/dist/test-fixtures/index.mjs.map +1 -1
- package/dist/verification-BAw9N8Pt.js +181 -0
- package/dist/verification-Cvvv86TT.mjs +123 -0
- package/dist/verification-Cvvv86TT.mjs.map +1 -0
- package/fixtures/client-ip-resolution.n01.json +101 -0
- package/fixtures/reviewer-grant-revocation.v1.json +53 -81
- package/package.json +59 -2
- package/dist/client-ip-B2Xeo-GK.mjs.map +0 -1
- package/dist/posture-origins-Pn-ii-Pp.mjs.map +0 -1
- package/dist/schemas-7qodsG-Z.mjs.map +0 -1
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"step-up-BK0oBi11.mjs","names":[],"sources":["../src/policy/fail-closed-response.ts","../src/policy/match-path.ts","../src/policy/cedar-space.ts","../src/policy/cedar-mask.ts","../src/policy/cedar-string.ts","../src/policy/legacy-carve-out.ts","../src/policy/cedar-expression.ts","../src/policy/cedar-principal-scope.ts","../src/policy/cedar-rule-match.ts","../src/policy/byte-bounded-memo.ts","../src/policy/unsubstituted-source.ts","../src/policy/required-scopes.ts","../src/policy/decision-policy-id.ts","../src/policy/bespoke-policy.ts","../src/policy/approval-quorum.ts","../src/policy/step-up.ts"],"sourcesContent":["export const FAIL_CLOSED_STATUS = 503;\n\nexport const FAIL_CLOSED_RETRY_AFTER_SECONDS = 3;\n\nexport const FAIL_CLOSED_BODY = {\n error: 'Service temporarily unavailable',\n source: 'checkpoint-middleware',\n} as const;\n\nexport const FAIL_CLOSED_HEADERS: Readonly<Record<string, string>> = {\n 'Content-Type': 'application/json',\n 'Cache-Control': 'no-store',\n 'Retry-After': String(FAIL_CLOSED_RETRY_AFTER_SECONDS),\n};\n","/**\n * Match a request path against a policy path pattern: an exact path, a glob\n * (`*` within a segment, `**` across segments), a prefix ending in `/`, or a\n * prefix that stops at a segment boundary (`/api` matches `/api/users`, not\n * `/apiv2`). Kept out of the Zod modules so request-time callers can use it\n * from `./policy/enforcement`.\n */\nexport function matchPath(path: string, pattern: string): boolean {\n // Exact match\n if (pattern === path) {\n return true;\n }\n\n // Glob pattern with wildcards\n if (pattern.includes('*')) {\n const regexPattern = pattern\n .replace(/[.+?^${}()|[\\]\\\\]/g, '\\\\$&') // Escape regex special chars\n .replace(/\\*\\*/g, '<<GLOBSTAR>>') // Temporarily replace **\n .replace(/\\*/g, '[^/]*') // Single * matches anything except /\n .replace(/<<GLOBSTAR>>/g, '.*'); // ** matches anything including /\n try {\n return new RegExp(`^${regexPattern}$`).test(path);\n } catch {\n return false;\n }\n }\n\n // Prefix match (pattern ends with /)\n if (pattern.endsWith('/')) {\n return path.startsWith(pattern) || path === pattern.slice(0, -1);\n }\n\n // Prefix match with segment boundary check\n // Pattern /api should match /api and /api/users but NOT /apiv2/users\n if (!path.startsWith(pattern)) {\n return false;\n }\n\n // Exact match\n if (path === pattern) {\n return true;\n }\n\n // Check that the next character after the pattern is a segment boundary\n const nextChar = path[pattern.length];\n return nextChar === '/';\n}\n","export const CEDAR_SPACE_CLASS =\n '[\\\\t-\\\\r \\\\u0085\\\\u00a0\\\\u1680\\\\u2000-\\\\u200a\\\\u2028\\\\u2029\\\\u202f\\\\u205f\\\\u3000]';\n\nexport function isCedarSpace(char: string): boolean {\n const code = char.charCodeAt(0);\n return (\n (code >= 0x09 && code <= 0x0d) ||\n code === 0x20 ||\n code === 0x85 ||\n code === 0xa0 ||\n code === 0x1680 ||\n (code >= 0x2000 && code <= 0x200a) ||\n code === 0x2028 ||\n code === 0x2029 ||\n code === 0x202f ||\n code === 0x205f ||\n code === 0x3000\n );\n}\n","export interface MaskedCedar {\n visible: string;\n code: string;\n inString: boolean[];\n}\n\nconst blank = (char: string): string => (char === '\\n' || char === '\\r' ? char : ' ');\n\nexport function maskCedar(cedar: string): MaskedCedar {\n const visible = cedar.split('');\n const code = cedar.split('');\n const inString: boolean[] = new Array<boolean>(cedar.length).fill(false);\n let i = 0;\n while (i < cedar.length) {\n if (cedar[i] === '\"') {\n let end = i + 1;\n while (end < cedar.length && cedar[end] !== '\"') end += cedar[end] === '\\\\' ? 2 : 1;\n const bodyEnd = Math.min(end, cedar.length);\n for (let k = i + 1; k < bodyEnd; k++) {\n inString[k] = true;\n code[k] = blank(cedar[k]);\n }\n i = end + 1;\n } else if (cedar[i] === '/' && cedar[i + 1] === '/') {\n while (i < cedar.length && cedar[i] !== '\\n' && cedar[i] !== '\\r') {\n visible[i] = ' ';\n code[i] = ' ';\n i++;\n }\n } else {\n i++;\n }\n }\n return { visible: visible.join(''), code: code.join(''), inString };\n}\n","/**\n * The Cedar double-quoted string grammar shared by the compose engine's emitter/\n * parser and every enforcement-path TEXT reader (required-scopes, cedar-rule-match).\n * Keeping the escape codec AND the capture pattern in one place means a value the\n * emitter escapes is decoded identically wherever a reader parses it back — they\n * can never drift. (Rust/.NET parse Cedar with a real parser and are unaffected.)\n */\n\n/** Escape a value for embedding inside a Cedar double-quoted string literal. */\nexport function escapeCedarString(value: string): string {\n return value\n .replace(/\\\\/g, '\\\\\\\\')\n .replace(/\"/g, '\\\\\"')\n .replace(/\\n/g, '\\\\n')\n .replace(/\\r/g, '\\\\r')\n .replace(/\\t/g, '\\\\t');\n}\n\n/** Inverse of {@link escapeCedarString} — decode Cedar string escapes to raw text. */\nexport function unescapeCedarString(value: string): string {\n return value.replace(/\\\\([\\\\\"nrt])/g, (_m, ch: string) =>\n ch === 'n' ? '\\n' : ch === 'r' ? '\\r' : ch === 't' ? '\\t' : ch\n );\n}\n\n/**\n * Build a RegExp matching `<prefixSource>\"<body>\"`, where <body> is an escape-aware\n * Cedar string. Capture group 1 is the RAW (still-escaped) body — pass it through\n * {@link unescapeCedarString} before use. `prefixSource` is a regex-source fragment\n * (escape its own metacharacters). This is the single source of the quoted-string\n * capture pattern.\n */\nexport function cedarQuotedValueRegExp(prefixSource: string, flags = ''): RegExp {\n return new RegExp(`${prefixSource}\"((?:\\\\\\\\.|[^\"\\\\\\\\])*)\"`, flags);\n}\n\nconst LIKE_ESCAPES: Record<string, string> = { n: '\\n', r: '\\r', t: '\\t', '0': '\\0' };\nconst NUMERIC_ESCAPE = /x([0-9a-fA-F]{2})|u\\{([0-9a-fA-F][0-9a-fA-F_]*)\\}/y;\nconst MAX_CODE_POINT = 0x10ffff;\nconst MAX_UNICODE_DIGITS = 6;\n\nexport function numericEscapeCode(\n raw: string,\n at: number\n): { code: number; length: number } | null {\n NUMERIC_ESCAPE.lastIndex = at;\n const match = NUMERIC_ESCAPE.exec(raw);\n if (match === null) return null;\n if (match[1] !== undefined) return { code: parseInt(match[1], 16), length: match[0].length };\n const digits = match[2].replace(/_/g, '');\n const code = parseInt(digits, 16);\n const valid =\n digits.length <= MAX_UNICODE_DIGITS &&\n code <= MAX_CODE_POINT &&\n (code < 0xd800 || code > 0xdfff);\n return valid ? { code, length: match[0].length } : null;\n}\n\nexport function cedarLikeSegments(rawPattern: string): string[] {\n const segments = [''];\n const append = (char: string) => {\n if (char === '*') segments.push('');\n else segments[segments.length - 1] += char;\n };\n for (let i = 0; i < rawPattern.length; i++) {\n const char = rawPattern.charAt(i);\n if (char !== '\\\\') {\n append(char);\n continue;\n }\n const numeric = numericEscapeCode(rawPattern, i + 1);\n if (numeric !== null) {\n append(String.fromCodePoint(numeric.code));\n i += numeric.length;\n } else {\n const next = rawPattern.charAt(++i);\n segments[segments.length - 1] += LIKE_ESCAPES[next] ?? next;\n }\n }\n return segments;\n}\n\nexport function globMatches(segments: readonly string[], value: string): boolean {\n const first = segments[0];\n if (segments.length === 1) return value === first;\n const last = segments[segments.length - 1];\n const end = value.length - last.length;\n if (end < first.length || !value.startsWith(first) || !value.endsWith(last)) return false;\n let position = first.length;\n for (let i = 1; i < segments.length - 1; i++) {\n const at = value.indexOf(segments[i], position);\n if (at === -1 || at + segments[i].length > end) return false;\n position = at + segments[i].length;\n }\n return true;\n}\n","import { maskCedar } from './cedar-mask';\nimport { CEDAR_SPACE_CLASS, isCedarSpace } from './cedar-space';\nimport { cedarLikeSegments, globMatches } from './cedar-string';\n\nexport const NO_EVIDENCE_CATEGORY = 'no_evidence';\nexport const NO_EVIDENCE_EXCLUSION_TERM = `principal.category != \"${NO_EVIDENCE_CATEGORY}\"`;\nexport const NO_EVIDENCE_EQUALITY_TERM = `principal.category == \"${NO_EVIDENCE_CATEGORY}\"`;\n\nconst WS = `${CEDAR_SPACE_CLASS}*`;\nconst SEGMENT_BOUNDARY = new RegExp(`\\\\b(?:forbid|permit)${WS}\\\\(|;`, 'g');\nconst ACCESSOR = `(?:\\\\.${WS}category\\\\b|\\\\[${WS}\"C[^\"]*\"${WS}\\\\])`;\nconst SUBJECT = `(?<![.\\\\w])principal${WS}${ACCESSOR}`;\nconst EXACT = '\"E[^\"]*\"';\nconst LIKEABLE = '\"[EL][^\"]*\"';\nconst ELEMENTS = `[^\\\\]\\\\[]*(?:\\\\[${WS}\"[^\"]*\"${WS}\\\\][^\\\\]\\\\[]*){0,16}`;\nconst CATEGORY_READ = new RegExp(`(?<![.\\\\w])principal(?:${WS}\\\\))*${WS}${ACCESSOR}`, 'g');\nconst GROUP_OR_PRINCIPAL = /[()[\\]{}]|(?<![\\w.])principal(?!\\w)/g;\nconst CHAIN_LINK = new RegExp(\n `${WS}(?:\\\\.${WS}(category\\\\b)|\\\\.${WS}\\\\w+|\\\\[${WS}\"(C)?[^\"]*\"${WS}\\\\])`,\n 'y'\n);\nconst PRINCIPAL_LENGTH = 'principal'.length;\nconst BARE_GROUP = new RegExp(`^(?:\\\\(|${CEDAR_SPACE_CLASS})*$`);\nconst CATEGORY_COMPARED = new RegExp(\n `${SUBJECT}${WS}(?:(?:==|!=)${WS}${EXACT}|like${WS}${LIKEABLE})|${EXACT}${WS}(?:==|!=)${WS}${SUBJECT}`\n);\nconst LIST_CALL = new RegExp(\n `\\\\[(${ELEMENTS})\\\\]${WS}\\\\.${WS}contains(?:All|Any)?${WS}(?:(${SUBJECT})|(${EXACT})|\\\\[(${ELEMENTS})\\\\])`,\n 'g'\n);\nconst HAS_CATEGORY = new RegExp(SUBJECT);\nconst HAS_NO_EVIDENCE = new RegExp(EXACT);\nconst SUBSTITUTED_READ = new RegExp(\n `\\\\(if ((?:\\\\(|${CEDAR_SPACE_CLASS})*principal(?:\\\\)|${CEDAR_SPACE_CLASS})*(?:\\\\.${WS}category\\\\b|\\\\[${WS}(\"(?:\\\\\\\\.|[^\"\\\\\\\\])*\")${WS}\\\\])) == \"${NO_EVIDENCE_CATEGORY}\" then \"human\" else \\\\1\\\\)`,\n 'g'\n);\n\ninterface Edit {\n start: number;\n end: number;\n text: string;\n}\n\nfunction literalMarker(body: string): string {\n const segments = cedarLikeSegments(body);\n if (segments.length === 1) {\n if (segments[0] === NO_EVIDENCE_CATEGORY) return 'E';\n return segments[0] === 'category' ? 'C' : ' ';\n }\n const spelled = segments.some((segment) => segment.includes(NO_EVIDENCE_CATEGORY));\n return spelled && globMatches(segments, NO_EVIDENCE_CATEGORY) ? 'L' : ' ';\n}\n\ninterface Scanned {\n visible: string;\n text: string;\n flat: string;\n pairs: Int32Array;\n}\n\nfunction scan(cedar: string): Scanned {\n const { visible, code, inString } = maskCedar(cedar);\n const marked = code.split('');\n for (let start = 0; start < cedar.length; ) {\n if (!inString[start]) {\n start++;\n continue;\n }\n let end = start;\n while (end < cedar.length && inString[end]) end++;\n const marker = literalMarker(visible.slice(start, end));\n if (marker !== ' ') marked[start] = marker;\n start = end;\n }\n const text = marked.join('');\n return { visible, text, flat: text.replace(/[()]/g, ' '), pairs: pairParentheses(text) };\n}\n\nfunction pairParentheses(text: string): Int32Array {\n const pairs = new Int32Array(text.length).fill(-1);\n const open: number[] = [];\n for (let i = 0; i < text.length; i++) {\n if (text[i] === '(') open.push(i);\n else if (text[i] === ')') pairs[i] = open.pop() ?? -1;\n }\n return pairs;\n}\n\nfunction statementRanges(text: string): Array<[number, number]> {\n const ranges: Array<[number, number]> = [];\n let open = -1;\n for (const boundary of text.matchAll(SEGMENT_BOUNDARY)) {\n if (boundary[0] === ';') {\n if (open !== -1) ranges.push([open, boundary.index + 1]);\n open = -1;\n } else {\n if (open !== -1) ranges.push([open, boundary.index]);\n open = boundary.index;\n }\n }\n if (open !== -1) ranges.push([open, text.length]);\n return ranges;\n}\n\nfunction applyEdits(cedar: string, edits: Edit[]): string {\n if (edits.length === 0) return cedar;\n const pieces: string[] = [];\n let position = 0;\n for (const edit of edits) {\n pieces.push(cedar.slice(position, edit.start), edit.text);\n position = edit.end;\n }\n pieces.push(cedar.slice(position));\n return pieces.join('');\n}\n\nfunction namesNoEvidenceIn(flat: string): boolean {\n if (CATEGORY_COMPARED.test(flat)) return true;\n for (const [, receiver, subject, exact, list = ''] of flat.matchAll(LIST_CALL)) {\n const receiverReadsCategory = HAS_CATEGORY.test(receiver);\n const receiverNamesNoEvidence = HAS_NO_EVIDENCE.test(receiver);\n if (\n (receiverReadsCategory && (exact !== undefined || HAS_NO_EVIDENCE.test(list))) ||\n (receiverNamesNoEvidence && (subject !== undefined || HAS_CATEGORY.test(list)))\n ) {\n return true;\n }\n }\n return false;\n}\n\nexport function namesNoEvidence(cedar: string): boolean {\n return namesNoEvidenceIn(scan(cedar).flat);\n}\n\nfunction groupStart({ text, pairs }: Scanned, principal: number, read: string): number {\n const lastCloser = read.lastIndexOf(')');\n if (lastCloser === -1) return principal;\n const open = pairs[principal + lastCloser];\n return open !== -1 && BARE_GROUP.test(text.slice(open, principal)) ? open : -1;\n}\n\nconst isWordChar = (char: string | undefined): boolean => char !== undefined && /\\w/.test(char);\n\nfunction skipSpaceBack(text: string, from: number): number {\n let i = from;\n while (i >= 0 && isCedarSpace(text[i])) i--;\n return i;\n}\n\nfunction skipSpaceForward(text: string, from: number): number {\n let i = from;\n while (i < text.length && isCedarSpace(text[i])) i++;\n return i;\n}\n\nfunction wordEndingAt(text: string, end: number): string {\n let start = end;\n while (start > 0 && isWordChar(text[start - 1])) start--;\n return text.slice(start, end + 1);\n}\n\nfunction isPrincipalVariable(text: string, at: number): boolean {\n const before = skipSpaceBack(text, at - 1);\n const char = text[before];\n if (char === '.' || char === '?') return false;\n if (char === ':' && text[before - 1] === ':') return false;\n if (isWordChar(char) && wordEndingAt(text, before) === 'has') return false;\n return text[skipSpaceForward(text, at + PRINCIPAL_LENGTH)] !== ':';\n}\n\nfunction isBranchValue(text: string, at: number): boolean {\n let before = skipSpaceBack(text, at - 1);\n while (text[before] === '(') before = skipSpaceBack(text, before - 1);\n const char = text[before];\n const word = isWordChar(char) ? wordEndingAt(text, before) : '';\n const introduced =\n word === 'then' || word === 'else' || (char === ':' && text[before - 1] !== ':');\n const after = skipSpaceForward(text, at + PRINCIPAL_LENGTH);\n const next = text[after];\n const ends =\n next === ')' ||\n next === '}' ||\n next === ']' ||\n next === ',' ||\n (text.startsWith('else', after) && !isWordChar(text[after + 4]));\n return introduced && ends;\n}\n\nfunction headEnd(text: string, from: number, to: number): number {\n let depth = 0;\n for (let i = text.indexOf('(', from); i < to; i++) {\n if (text[i] === '(') depth++;\n else if (text[i] === ')' && --depth === 0) return i + 1;\n }\n return from;\n}\n\ninterface CategoryRead {\n principal: number;\n start: number;\n end: number;\n}\n\nfunction directReads(scanned: Scanned, from: number, to: number): CategoryRead[] {\n const reads: CategoryRead[] = [];\n for (const read of scanned.text.slice(from, to).matchAll(CATEGORY_READ)) {\n const principal = from + read.index;\n if (!isPrincipalVariable(scanned.text, principal)) continue;\n const start = groupStart(scanned, principal, read[0]);\n if (start !== -1) reads.push({ principal, start, end: principal + read[0].length });\n }\n return reads;\n}\n\nfunction readsCategoryAfter(text: string, from: number): boolean {\n CHAIN_LINK.lastIndex = from;\n for (let link = CHAIN_LINK.exec(text); link !== null; link = CHAIN_LINK.exec(text)) {\n if (link[1] !== undefined || link[2] !== undefined) return true;\n }\n return false;\n}\n\nfunction readsCategoryOfCarriedPrincipal(\n text: string,\n from: number,\n to: number,\n reads: CategoryRead[]\n): boolean {\n const direct = new Set(reads.map((read) => read.principal));\n const holding = [false];\n for (const token of text.slice(from, to).matchAll(GROUP_OR_PRINCIPAL)) {\n const at = from + token.index;\n if (token[0] === 'principal') {\n if (!direct.has(at) && isPrincipalVariable(text, at) && isBranchValue(text, at)) {\n holding[holding.length - 1] = true;\n }\n } else if ('([{'.includes(token[0])) {\n holding.push(false);\n } else if (holding.length > 1 && holding.pop()) {\n holding[holding.length - 1] = true;\n if (readsCategoryAfter(text, at + 1)) return true;\n }\n }\n return false;\n}\n\nexport function withNoEvidenceExclusion(cedar: string): string {\n const scanned = scan(cedar);\n const { visible, text, flat } = scanned;\n const edits: Edit[] = [];\n for (const [from, to] of statementRanges(text)) {\n if (namesNoEvidenceIn(flat.slice(from, to))) continue;\n const reads = directReads(scanned, from, to);\n if (reads.length === 0) continue;\n const body = headEnd(text, from, to);\n if (readsCategoryOfCarriedPrincipal(text, body, to, reads)) continue;\n for (const { start, end } of reads) {\n const accessor = visible.slice(start, end);\n edits.push({\n start,\n end,\n text: `(if ${accessor} == \"${NO_EVIDENCE_CATEGORY}\" then \"human\" else ${accessor})`,\n });\n }\n }\n return applyEdits(cedar, edits);\n}\n\nexport function withoutNoEvidenceExclusion(cedar: string): string {\n const { visible, inString } = maskCedar(cedar);\n const edits: Edit[] = [];\n for (const read of visible.matchAll(SUBSTITUTED_READ)) {\n const key = read[2];\n if (!inString[read.index] && (key === undefined || literalMarker(key.slice(1, -1)) === 'C')) {\n edits.push({ start: read.index, end: read.index + read[0].length, text: read[1] });\n }\n }\n return applyEdits(cedar, edits);\n}\n","import { isCedarSpace } from './cedar-space';\nimport { cedarLikeSegments, globMatches, numericEscapeCode } from './cedar-string';\n\nexport type Tri = 'yes' | 'no' | 'maybe';\n\nexport interface ExpressionFacts {\n category: string;\n path?: string;\n unnamed?: string;\n}\n\ntype Expr =\n | { k: 'lit'; v: boolean }\n | { k: 'str'; raw: string }\n | { k: 'var'; name: string }\n | { k: 'category' | 'name' | 'path' | 'unknown' }\n | { k: 'set'; items: Expr[] }\n | { k: 'and' | 'or'; terms: Expr[] }\n | { k: 'not'; operand: Expr }\n | { k: 'if'; cond: Expr; then: Expr; otherwise: Expr }\n | { k: 'cmp'; equals: boolean; left: Expr; right: Expr }\n | { k: 'like'; operand: Expr; pattern: string }\n | { k: 'call'; method: string; receiver: Expr; args: Expr[] };\n\ntype Value =\n | { k: 'tri'; v: Tri }\n | { k: 'str'; v: string }\n | { k: 'set'; items: Value[] }\n | { k: 'name' | 'unknown' };\n\ntype Token = { t: 'str' | 'id' | 'num' | 'p'; v: string };\n\nconst MAX_NESTING = 48;\nconst MAX_HEX_ESCAPE = 0x7f;\nconst UNNAMED_CATEGORY = '\\uD800';\nconst LONE_SURROGATE = /\\p{Surrogate}/u;\nconst HUMAN_NAMES = ['', 'human', 'unknown', 'anonymous'];\nconst UNKNOWN: Expr = { k: 'unknown' };\nconst PUNCTUATION = new Set('<>!+-*()[]{}.,:');\nconst TWO_CHARACTER = new Set(['&&', '||', '==', '!=', '<=', '>=', '::']);\nconst SIMPLE_ESCAPES: Record<string, string> = {\n n: '\\n',\n r: '\\r',\n t: '\\t',\n '\\\\': '\\\\',\n '0': '\\0',\n \"'\": \"'\",\n '\"': '\"',\n};\nconst IDENTIFIER_START = /[A-Za-z_]/;\nconst IDENTIFIER_PART = /[A-Za-z0-9_]/;\nconst DIGIT = /[0-9]/;\nconst UNSUPPORTED_PATTERN_ESCAPE = /\\\\[0u]/;\n\nfunction tokenize(text: string): Token[] {\n const tokens: Token[] = [];\n let i = 0;\n while (i < text.length) {\n const char = text[i];\n if (isCedarSpace(char)) {\n i += 1;\n } else if (char === '/' && text[i + 1] === '/') {\n while (i < text.length && text[i] !== '\\n' && text[i] !== '\\r') i += 1;\n } else if (char === '\"') {\n let end = i + 1;\n while (end < text.length && text[end] !== '\"') end += text[end] === '\\\\' ? 2 : 1;\n if (end >= text.length) throw new SyntaxError('unterminated string');\n const body = text.slice(i + 1, end);\n if (LONE_SURROGATE.test(body)) throw new SyntaxError('ill-formed string');\n tokens.push({ t: 'str', v: body });\n i = end + 1;\n } else if (IDENTIFIER_START.test(char)) {\n let end = i + 1;\n while (end < text.length && IDENTIFIER_PART.test(text[end])) end += 1;\n tokens.push({ t: 'id', v: text.slice(i, end) });\n i = end;\n } else if (DIGIT.test(char)) {\n let end = i + 1;\n while (end < text.length && DIGIT.test(text[end])) end += 1;\n tokens.push({ t: 'num', v: text.slice(i, end) });\n i = end;\n } else if (TWO_CHARACTER.has(text.slice(i, i + 2))) {\n tokens.push({ t: 'p', v: text.slice(i, i + 2) });\n i += 2;\n } else if (PUNCTUATION.has(char)) {\n tokens.push({ t: 'p', v: char });\n i += 1;\n } else {\n throw new SyntaxError('unexpected character');\n }\n }\n return tokens;\n}\n\nexport function decodeCedarString(raw: string): string | null {\n let out = '';\n for (let i = 0; i < raw.length; i += 1) {\n if (raw[i] !== '\\\\') {\n out += raw[i];\n } else if (raw[i + 1] === 'x' || raw[i + 1] === 'u') {\n const numeric = numericEscapeCode(raw, i + 1);\n if (numeric === null || (raw[i + 1] === 'x' && numeric.code > MAX_HEX_ESCAPE)) return null;\n out += String.fromCodePoint(numeric.code);\n i += numeric.length;\n } else {\n const mapped = SIMPLE_ESCAPES[raw[i + 1]];\n if (mapped === undefined) return null;\n out += mapped;\n i += 1;\n }\n }\n return out;\n}\n\nclass Parser {\n private position = 0;\n private readsTag = false;\n\n constructor(private readonly tokens: Token[]) {}\n\n parseAll(): Expr {\n const expression = this.expression(0);\n if (this.position < this.tokens.length) throw new SyntaxError('trailing tokens');\n return this.readsTag ? UNKNOWN : expression;\n }\n\n private peek(): Token | undefined {\n return this.tokens[this.position];\n }\n\n private is(type: Token['t'], value: string): boolean {\n const token = this.peek();\n return token !== undefined && token.t === type && token.v === value;\n }\n\n private take(type: Token['t'], value: string): boolean {\n const found = this.is(type, value);\n if (found) this.position += 1;\n return found;\n }\n\n private expect(type: Token['t'], value: string): void {\n if (!this.take(type, value)) throw new SyntaxError(`expected ${value}`);\n }\n\n private next(type: Token['t']): Token {\n const token = this.peek();\n if (token === undefined || token.t !== type) throw new SyntaxError(`expected ${type}`);\n this.position += 1;\n return token;\n }\n\n private expression(depth: number): Expr {\n if (depth > MAX_NESTING) throw new SyntaxError('too deep');\n if (this.take('id', 'if')) {\n const cond = this.expression(depth + 1);\n this.expect('id', 'then');\n const then = this.expression(depth + 1);\n this.expect('id', 'else');\n return { k: 'if', cond, then, otherwise: this.expression(depth + 1) };\n }\n return this.chain('||', () => this.chain('&&', () => this.relation(depth)));\n }\n\n private chain(operator: '&&' | '||', operand: () => Expr): Expr {\n const terms = [operand()];\n while (this.take('p', operator)) terms.push(operand());\n return terms.length === 1 ? terms[0] : { k: operator === '&&' ? 'and' : 'or', terms };\n }\n\n private relation(depth: number): Expr {\n const left = this.additive(depth);\n const token = this.peek();\n if (token === undefined) return left;\n if (token.t === 'p' && (token.v === '==' || token.v === '!=')) {\n this.position += 1;\n return { k: 'cmp', equals: token.v === '==', left, right: this.additive(depth) };\n }\n if (token.t === 'p' && ['<', '<=', '>', '>='].includes(token.v)) {\n this.position += 1;\n this.additive(depth);\n return UNKNOWN;\n }\n if (token.t === 'id' && token.v === 'in') {\n this.position += 1;\n this.additive(depth);\n return UNKNOWN;\n }\n if (token.t === 'id' && token.v === 'like') {\n this.position += 1;\n return { k: 'like', operand: left, pattern: this.next('str').v };\n }\n if (token.t === 'id' && token.v === 'has') {\n this.position += 1;\n this.attributePath();\n return UNKNOWN;\n }\n if (token.t === 'id' && token.v === 'is') {\n this.position += 1;\n this.namePath();\n if (this.take('id', 'in')) this.additive(depth);\n return UNKNOWN;\n }\n return left;\n }\n\n private attributePath(): void {\n const first = this.peek();\n if (first === undefined || (first.t !== 'id' && first.t !== 'str')) {\n throw new SyntaxError('expected attribute');\n }\n this.position += 1;\n while (this.take('p', '.')) {\n const part = this.peek();\n if (part === undefined || (part.t !== 'id' && part.t !== 'str')) {\n throw new SyntaxError('expected attribute');\n }\n this.position += 1;\n }\n }\n\n private namePath(): void {\n this.next('id');\n while (this.take('p', '::')) this.next('id');\n }\n\n private additive(depth: number): Expr {\n let result = this.multiplicative(depth);\n while (this.is('p', '+') || this.is('p', '-')) {\n this.position += 1;\n this.multiplicative(depth);\n result = UNKNOWN;\n }\n return result;\n }\n\n private multiplicative(depth: number): Expr {\n let result = this.unary(depth);\n while (this.take('p', '*')) {\n this.unary(depth);\n result = UNKNOWN;\n }\n return result;\n }\n\n private unary(depth: number): Expr {\n const prefixes: string[] = [];\n while (this.is('p', '!') || this.is('p', '-')) {\n prefixes.push((this.peek() as Token).v);\n this.position += 1;\n if (prefixes.length > MAX_NESTING) throw new SyntaxError('too deep');\n }\n let result = this.member(depth);\n for (let i = prefixes.length - 1; i >= 0; i -= 1) {\n result = prefixes[i] === '!' ? { k: 'not', operand: result } : UNKNOWN;\n }\n return result;\n }\n\n private member(depth: number): Expr {\n let result = this.primary(depth);\n let links = 0;\n for (;;) {\n if (this.take('p', '.')) {\n const method = this.next('id').v;\n if (method === 'getTag') this.readsTag = true;\n result = this.is('p', '(')\n ? { k: 'call', method, receiver: result, args: this.arguments(depth) }\n : attribute(result, method);\n } else if (this.take('p', '[')) {\n const key = this.next('str').v;\n this.expect('p', ']');\n result = attribute(result, decodeCedarString(key));\n } else {\n return result;\n }\n links += 1;\n if (links > MAX_NESTING) throw new SyntaxError('too deep');\n }\n }\n\n private arguments(depth: number): Expr[] {\n this.expect('p', '(');\n return this.list(')', depth + 1);\n }\n\n private list(close: string, depth: number): Expr[] {\n const items: Expr[] = [];\n while (!this.take('p', close)) {\n items.push(this.expression(depth));\n if (!this.is('p', close)) this.expect('p', ',');\n }\n return items;\n }\n\n private primary(depth: number): Expr {\n const token = this.peek();\n if (token === undefined) throw new SyntaxError('unexpected end');\n this.position += 1;\n if (token.t === 'str') return { k: 'str', raw: token.v };\n if (token.t === 'num') return UNKNOWN;\n if (token.t === 'id') {\n if (token.v === 'true' || token.v === 'false') return { k: 'lit', v: token.v === 'true' };\n if (['principal', 'resource', 'action', 'context'].includes(token.v)) {\n return { k: 'var', name: token.v };\n }\n while (this.take('p', '::')) {\n if (this.peek()?.t === 'str') {\n this.position += 1;\n return UNKNOWN;\n }\n this.next('id');\n }\n if (this.is('p', '(')) this.arguments(depth);\n return UNKNOWN;\n }\n if (token.v === '(') {\n const inner = this.expression(depth + 1);\n this.expect('p', ')');\n return inner;\n }\n if (token.v === '[') return { k: 'set', items: this.list(']', depth + 1) };\n if (token.v === '{') {\n while (!this.take('p', '}')) {\n const key = this.peek();\n if (key === undefined || (key.t !== 'id' && key.t !== 'str')) {\n throw new SyntaxError('expected key');\n }\n this.position += 1;\n this.expect('p', ':');\n this.expression(depth + 1);\n if (!this.is('p', '}')) this.expect('p', ',');\n }\n return UNKNOWN;\n }\n throw new SyntaxError('unexpected token');\n }\n}\n\nfunction attribute(target: Expr, name: string | null): Expr {\n if (target.k !== 'var' || name === null) return UNKNOWN;\n if (target.name === 'principal' && (name === 'category' || name === 'name')) {\n return { k: name };\n }\n return target.name === 'resource' && name === 'path' ? { k: 'path' } : UNKNOWN;\n}\n\nexport type { Expr as CedarExpression };\n\nexport const parseExpression = (text: string): Expr => new Parser(tokenize(text)).parseAll();\n\nconst triOf = (value: boolean): Tri => (value ? 'yes' : 'no');\nconst invert = (value: Tri): Tri => (value === 'maybe' ? 'maybe' : value === 'yes' ? 'no' : 'yes');\n\nconst constantSets = new WeakMap<Expr, Value>();\n\nfunction valueOf(expr: Expr, facts: ExpressionFacts, read: string): Value {\n switch (expr.k) {\n case 'str': {\n const decoded = decodeCedarString(expr.raw);\n return decoded === null ? { k: 'unknown' } : { k: 'str', v: decoded };\n }\n case 'category':\n return { k: 'str', v: read };\n case 'path':\n return facts.path === undefined ? { k: 'unknown' } : { k: 'str', v: facts.path };\n case 'name':\n return { k: 'name' };\n case 'set': {\n const known = constantSets.get(expr);\n if (known !== undefined) return known;\n const items = expr.items.map((item) => valueOf(item, facts, read));\n const value: Value = items.some((item) => item.k === 'set')\n ? { k: 'unknown' }\n : { k: 'set', items };\n if (expr.items.every((item) => item.k === 'str')) constantSets.set(expr, value);\n return value;\n }\n case 'if': {\n const cond = evaluateExpression(expr.cond, facts);\n if (cond === 'maybe') return { k: 'unknown' };\n return valueOf(cond === 'yes' ? expr.then : expr.otherwise, facts, read);\n }\n case 'lit':\n case 'and':\n case 'or':\n case 'not':\n case 'cmp':\n case 'like':\n case 'call':\n return { k: 'tri', v: evaluateExpression(expr, facts) };\n default:\n return { k: 'unknown' };\n }\n}\n\nfunction sameValue(left: Value, right: Value): Tri {\n if (left.k === 'unknown' || right.k === 'unknown') return 'maybe';\n if (left.k === 'name' || right.k === 'name') {\n const other = left.k === 'name' ? right : left;\n if (other.k !== 'str') return other.k === 'name' ? 'maybe' : 'no';\n return HUMAN_NAMES.includes(other.v.trim().toLowerCase()) ? 'maybe' : 'no';\n }\n if (left.k === 'tri' && right.k === 'tri') {\n return left.v === 'maybe' || right.v === 'maybe' ? 'maybe' : triOf(left.v === right.v);\n }\n if (left.k === 'tri' || right.k === 'tri') return 'no';\n if (left.k === 'str' && right.k === 'str') return triOf(left.v === right.v);\n if (left.k === 'set' && right.k === 'set') {\n const [leftIndex, rightIndex] = [indexItems(left.items), indexItems(right.items)];\n if (leftIndex.pure && rightIndex.pure) {\n return triOf(\n leftIndex.strings.size === rightIndex.strings.size && holdsAll(leftIndex, rightIndex)\n );\n }\n const covers = (from: Value[], into: Value[]): Tri => {\n const index = indexItems(into);\n return combine(\n from.map((item) => member(item, index)),\n 'and'\n );\n };\n return combine([covers(left.items, right.items), covers(right.items, left.items)], 'and');\n }\n return 'no';\n}\n\ninterface Members {\n strings: Set<string>;\n representatives: Value[];\n pure: boolean;\n}\n\nfunction holdsAll(index: Members, other: Members): boolean {\n for (const value of other.strings) if (!index.strings.has(value)) return false;\n return true;\n}\n\nfunction shareAny(left: Members, right: Members): boolean {\n const [small, large] = left.strings.size <= right.strings.size ? [left, right] : [right, left];\n for (const value of small.strings) if (large.strings.has(value)) return true;\n return false;\n}\n\nconst indexes = new WeakMap<Value[], Members>();\n\nfunction indexItems(items: Value[]): Members {\n const known = indexes.get(items);\n if (known !== undefined) return known;\n const index = buildIndex(items);\n indexes.set(items, index);\n return index;\n}\n\nfunction buildIndex(items: Value[]): Members {\n const strings = new Set<string>();\n const representatives = new Map<string, Value>();\n for (const item of items) {\n if (item.k === 'str') {\n strings.add(item.v);\n representatives.set(\n HUMAN_NAMES.includes(item.v.trim().toLowerCase()) ? 'human' : 'str',\n item\n );\n } else {\n representatives.set(item.k === 'tri' ? `tri:${item.v}` : item.k, item);\n }\n }\n return {\n strings,\n representatives: [...representatives.values()],\n pure: items.every((item) => item.k === 'str'),\n };\n}\n\nfunction member(item: Value, index: Members): Tri {\n if (item.k === 'str' && index.strings.has(item.v)) return 'yes';\n return combine(\n index.representatives.map((candidate) => sameValue(item, candidate)),\n 'or'\n );\n}\n\nfunction combine(results: Tri[], op: 'and' | 'or'): Tri {\n const decisive: Tri = op === 'and' ? 'no' : 'yes';\n if (results.includes(decisive)) return decisive;\n return results.includes('maybe') ? 'maybe' : invert(decisive);\n}\n\nfunction setCall(method: string, receiver: Value, args: Value[]): Tri {\n if (receiver.k !== 'set') return 'maybe';\n if (method === 'isEmpty' && args.length === 0) return triOf(receiver.items.length === 0);\n const [argument] = args;\n if (args.length !== 1) return 'maybe';\n const index = indexItems(receiver.items);\n if (method === 'contains') return member(argument, index);\n if (argument.k !== 'set') return 'maybe';\n if (method === 'containsAny' || method === 'containsAll') {\n const other = indexItems(argument.items);\n if (index.pure && other.pure) {\n return triOf(\n method === 'containsAny'\n ? shareAny(index, other)\n : other.strings.size <= index.strings.size && holdsAll(index, other)\n );\n }\n return combine(\n argument.items.map((item) => member(item, index)),\n method === 'containsAny' ? 'or' : 'and'\n );\n }\n return 'maybe';\n}\n\nconst leaves = (expr: Expr): Expr[] =>\n expr.k === 'set'\n ? expr.items.flatMap(leaves)\n : expr.k === 'if'\n ? [...leaves(expr.then), ...leaves(expr.otherwise)]\n : [expr];\n\nfunction strings(exprs: Expr[]): string[] {\n const found: string[] = [];\n for (const part of exprs.flatMap(leaves)) {\n const decoded = part.k === 'str' ? decodeCedarString(part.raw) : null;\n if (decoded !== null) found.push(decoded);\n }\n return found;\n}\n\nconst readsCategory = (exprs: Expr[]): boolean =>\n exprs.flatMap(leaves).some((part) => part.k === 'category');\n\ninterface Spelled {\n reads: boolean;\n names: Set<string>;\n}\n\nconst spelledAtoms = new WeakMap<Expr, Spelled>();\n\nfunction spelledBy(expr: Extract<Expr, { k: 'cmp' | 'call' }>): Spelled {\n let spelled = spelledAtoms.get(expr);\n if (spelled === undefined) {\n const sides = expr.k === 'cmp' ? [expr.left, expr.right] : [expr.receiver, ...expr.args];\n spelled = { reads: readsCategory(sides), names: new Set(strings(sides)) };\n spelledAtoms.set(expr, spelled);\n }\n return spelled;\n}\n\nfunction mentions(\n expr: Extract<Expr, { k: 'cmp' | 'like' | 'call' }>,\n name: string | undefined\n): boolean {\n if (name === undefined) return false;\n if (expr.k === 'like') {\n const segments = cedarLikeSegments(expr.pattern);\n return (\n readsCategory([expr.operand]) &&\n segments.some((segment) => segment.includes(name)) &&\n globMatches(segments, name)\n );\n }\n const { reads, names } = spelledBy(expr);\n return reads && names.has(name);\n}\n\nconst readOf = (\n expr: Extract<Expr, { k: 'cmp' | 'like' | 'call' }>,\n facts: ExpressionFacts\n): string => (mentions(expr, facts.unnamed) ? UNNAMED_CATEGORY : facts.category);\n\nexport function evaluateExpression(expr: Expr, facts: ExpressionFacts): Tri {\n switch (expr.k) {\n case 'lit':\n return triOf(expr.v);\n case 'not':\n return invert(evaluateExpression(expr.operand, facts));\n case 'and':\n case 'or':\n return combine(\n expr.terms.map((term) => evaluateExpression(term, facts)),\n expr.k\n );\n case 'if': {\n const cond = evaluateExpression(expr.cond, facts);\n if (cond !== 'maybe')\n return evaluateExpression(cond === 'yes' ? expr.then : expr.otherwise, facts);\n const [then, otherwise] = [expr.then, expr.otherwise].map((branch) =>\n evaluateExpression(branch, facts)\n );\n return then === otherwise ? then : 'maybe';\n }\n case 'cmp': {\n const read = readOf(expr, facts);\n const same = sameValue(valueOf(expr.left, facts, read), valueOf(expr.right, facts, read));\n return expr.equals ? same : invert(same);\n }\n case 'like': {\n const subject = valueOf(expr.operand, facts, readOf(expr, facts));\n if (UNSUPPORTED_PATTERN_ESCAPE.test(expr.pattern)) return 'maybe';\n const segments = cedarLikeSegments(expr.pattern);\n if (subject.k === 'name') {\n return HUMAN_NAMES.some((candidate) => globMatches(segments, candidate)) ? 'maybe' : 'no';\n }\n if (subject.k !== 'str') return 'maybe';\n return triOf(globMatches(segments, subject.v));\n }\n case 'call': {\n const read = readOf(expr, facts);\n return setCall(\n expr.method,\n valueOf(expr.receiver, facts, read),\n expr.args.map((arg) => valueOf(arg, facts, read))\n );\n }\n default:\n return 'maybe';\n }\n}\n","import { maskCedar } from './cedar-mask';\nimport { CEDAR_SPACE_CLASS, isCedarSpace } from './cedar-space';\nimport {\n NO_EVIDENCE_CATEGORY,\n namesNoEvidence,\n withNoEvidenceExclusion,\n withoutNoEvidenceExclusion,\n} from './legacy-carve-out';\nimport {\n decodeCedarString,\n evaluateExpression,\n parseExpression,\n type CedarExpression,\n} from './cedar-expression';\nimport { unescapeCedarString } from './cedar-string';\n\nexport type ProbeClass = 'human' | typeof NO_EVIDENCE_CATEGORY;\n\nexport const PROBE_CLASSES: readonly ProbeClass[] = ['human', NO_EVIDENCE_CATEGORY];\n\nexport interface CedarCondition {\n kind: 'when' | 'unless';\n body: string;\n}\n\nexport interface CedarStatement {\n effect: 'forbid' | 'permit';\n blockStart: number;\n start: number;\n end: number;\n text: string;\n scope: string;\n conditions: CedarCondition[];\n annotations: string;\n}\n\ninterface Facts {\n category: string;\n path?: string;\n discountNaming?: boolean;\n}\n\ntype Tri = ReturnType<typeof evaluateExpression>;\n\nconst ANONYMOUS_PRINCIPAL_ID = 'anonymous';\nconst S = CEDAR_SPACE_CLASS;\nconst HEAD = new RegExp(`\\\\b(forbid|permit)${S}*\\\\(`, 'g');\nconst isAnnotationName = (code: string, index: number): boolean => {\n let position = index - 1;\n while (position >= 0 && isCedarSpace(code[position])) position -= 1;\n return code[position] === '@';\n};\nconst skipSpace = (text: string, from: number): number => {\n let index = from;\n while (index < text.length && isCedarSpace(text[index])) index += 1;\n return index;\n};\n\nconst conditionAt = (\n text: string,\n from: number\n): { kind: 'when' | 'unless'; braceOpen: number } | null => {\n const keywordStart = skipSpace(text, from);\n const kind = text.startsWith('when', keywordStart)\n ? 'when'\n : text.startsWith('unless', keywordStart)\n ? 'unless'\n : null;\n if (kind === null) return null;\n const braceOpen = skipSpace(text, keywordStart + kind.length);\n return text[braceOpen] === '{' ? { kind, braceOpen } : null;\n};\nfunction matching(code: string, openIndex: number, open: string, close: string): number {\n let depth = 0;\n for (let i = openIndex; i < code.length; i++) {\n if (code[i] === open) depth++;\n else if (code[i] === close) {\n depth--;\n if (depth === 0) return i;\n }\n }\n return -1;\n}\n\nexport function parseCedarStatements(cedar: string): CedarStatement[] {\n const { visible, code } = maskCedar(cedar);\n const statements: CedarStatement[] = [];\n const heads = new RegExp(HEAD.source, 'g');\n let previousEnd = 0;\n let match = heads.exec(code);\n while (match !== null) {\n if (isAnnotationName(code, match.index)) {\n match = heads.exec(code);\n continue;\n }\n const open = match.index + match[0].length - 1;\n const scopeEnd = matching(code, open, '(', ')');\n if (scopeEnd < 0) break;\n const conditions: CedarCondition[] = [];\n let position = scopeEnd + 1;\n for (;;) {\n const condition = conditionAt(code, position);\n if (condition === null) break;\n const braceClose = matching(code, condition.braceOpen, '{', '}');\n if (braceClose < 0) {\n position = code.length;\n break;\n }\n conditions.push({\n kind: condition.kind,\n body: visible.slice(condition.braceOpen + 1, braceClose),\n });\n position = braceClose + 1;\n }\n const terminatorAt = skipSpace(code, position);\n const end = code[terminatorAt] === ';' ? terminatorAt + 1 : position;\n statements.push({\n effect: match[1] as 'forbid' | 'permit',\n blockStart: Math.min(skipSpace(cedar, previousEnd), match.index),\n start: match.index,\n end,\n text: visible.slice(match.index, end),\n scope: visible.slice(open + 1, scopeEnd),\n conditions,\n annotations: visible.slice(previousEnd, match.index),\n });\n previousEnd = end;\n heads.lastIndex = end;\n match = heads.exec(code);\n }\n return statements;\n}\n\nconst TRUE_BODY = new RegExp(`^${S}*true${S}*$`);\nconst PRINCIPAL_EQUALS = new RegExp(`\\\\bprincipal${S}*==`);\nconst ENTITY_ID = new RegExp(`::${S}*\"((?:\\\\\\\\.|[^\"\\\\\\\\])*)\"`, 'g');\nconst IS_TYPE = new RegExp(`\\\\bis${S}+([\\\\w:]+)`);\nconst ID_ANNOTATION = new RegExp(`@id\\\\(${S}*\"((?:\\\\\\\\.|[^\"\\\\\\\\])*)\"${S}*\\\\)`, 'g');\n\nfunction principalScope(scope: string): Tri {\n const { visible, code } = maskCedar(scope);\n let depth = 0;\n let end = code.length;\n for (let i = 0; i < code.length; i++) {\n const char = code[i];\n if (char === '(' || char === '[' || char === '{') depth++;\n else if (char === ')' || char === ']' || char === '}') depth--;\n else if (char === ',' && depth === 0) {\n end = i;\n break;\n }\n }\n const text = visible.slice(0, end);\n const masked = code.slice(0, end);\n if (PRINCIPAL_EQUALS.test(masked) || /\\bin\\b/.test(masked)) {\n const ids = Array.from(text.matchAll(ENTITY_ID), (m) => decodeCedarString(m[1]));\n return ids.some((id) => id === null || id === ANONYMOUS_PRINCIPAL_ID) ? 'maybe' : 'no';\n }\n const isType = IS_TYPE.exec(masked);\n if (isType) return isType[1].split('::').pop() === 'Agent' ? 'maybe' : 'no';\n return 'yes';\n}\n\ninterface Prepared {\n namesNoEvidence: boolean;\n substituted: boolean;\n evaluable: {\n scope: Tri;\n conditions: Array<{ kind: 'when' | 'unless'; node: CedarExpression | null }>;\n };\n}\n\nconst prepared = new WeakMap<CedarStatement, Prepared>();\n\nfunction parsedCondition(body: string): CedarExpression | null {\n try {\n return parseExpression(body);\n } catch {\n return null;\n }\n}\n\nfunction evaluableOf(statement: CedarStatement): Prepared['evaluable'] {\n return {\n scope: principalScope(statement.scope),\n conditions: statement.conditions.map(({ kind, body }) => ({\n kind,\n node: parsedCondition(body),\n })),\n };\n}\n\nfunction preparedOf(statement: CedarStatement): Prepared {\n let entry = prepared.get(statement);\n if (entry === undefined) {\n const named = namesNoEvidence(statement.text);\n entry = {\n namesNoEvidence: named,\n substituted: !named && withNoEvidenceExclusion(statement.text) !== statement.text,\n evaluable: evaluableOf(statement),\n };\n prepared.set(statement, entry);\n }\n return entry;\n}\n\nexport function statementApplies(statement: CedarStatement, facts: Facts): boolean {\n const { substituted, evaluable } = preparedOf(statement);\n const read: Facts =\n facts.category === NO_EVIDENCE_CATEGORY && substituted\n ? { ...facts, category: 'human' }\n : facts;\n const effective = {\n category: read.category,\n path: read.path,\n unnamed: facts.discountNaming ? read.category : undefined,\n };\n if (evaluable.scope === 'no') return false;\n for (const { kind, node } of evaluable.conditions) {\n const result = node === null ? 'maybe' : evaluateExpression(node, effective);\n if (kind === 'when' && result === 'no') return false;\n if (kind === 'unless' && result === 'yes') return false;\n }\n return true;\n}\n\nfunction reachesClassOnlyByNaming(\n statement: CedarStatement,\n probe: ProbeClass,\n path: string | undefined\n): boolean {\n return (\n statementApplies(statement, { category: probe, path }) &&\n !statementApplies(statement, { category: probe, path, discountNaming: true })\n );\n}\n\nexport function statementId(statement: CedarStatement): string | undefined {\n const matches = Array.from(statement.annotations.matchAll(ID_ANNOTATION), (m) =>\n unescapeCedarString(m[1])\n );\n return matches.at(-1);\n}\n\nexport interface UnnarrowedDeny {\n statement: CedarStatement;\n classes: ProbeClass[];\n line: number;\n}\n\nlet memoText: string | undefined;\nlet memoParsed: { text: string; statements: CedarStatement[] } = { text: '', statements: [] };\n\nfunction parsedOf(cedar: string): { text: string; statements: CedarStatement[] } {\n if (memoText !== cedar) {\n const text = withoutNoEvidenceExclusion(cedar);\n memoParsed = { text, statements: parseCedarStatements(text) };\n memoText = cedar;\n }\n return memoParsed;\n}\n\nexport interface PolicyScopeAnalysis {\n unnarrowedDeny(path?: string): UnnarrowedDeny[];\n denyNamingClass(path: string, probe: ProbeClass): CedarStatement[];\n lacksBaselinePermit(): boolean;\n}\n\nexport function analyzePolicyScope(cedar: string): PolicyScopeAnalysis {\n const { text, statements } = parsedOf(cedar);\n return {\n unnarrowedDeny(path) {\n const found: UnnarrowedDeny[] = [];\n let line = 1;\n let counted = 0;\n for (const statement of statements) {\n if (statement.effect !== 'forbid') continue;\n const classes = PROBE_CLASSES.filter(\n (probe) =>\n statementApplies(statement, { category: probe, path }) &&\n !reachesClassOnlyByNaming(statement, probe, path)\n );\n if (classes.length > 0) {\n for (; counted < statement.blockStart; counted++) {\n if (text.charCodeAt(counted) === 10) line++;\n }\n found.push({ statement, classes, line });\n }\n }\n return found;\n },\n denyNamingClass(path, probe) {\n return statements.filter(\n (statement) =>\n statement.effect === 'forbid' &&\n (probe !== NO_EVIDENCE_CATEGORY || preparedOf(statement).namesNoEvidence) &&\n reachesClassOnlyByNaming(statement, probe, path)\n );\n },\n lacksBaselinePermit() {\n return statements.length > 0 && !statements.some(isBaselinePermit);\n },\n };\n}\n\nexport const unnarrowedDenyStatements = (cedar: string, path?: string): UnnarrowedDeny[] =>\n analyzePolicyScope(cedar).unnarrowedDeny(path);\n\nexport const lacksBaselinePermit = (cedar: string): boolean =>\n analyzePolicyScope(cedar).lacksBaselinePermit();\n\nfunction isBaselinePermit(statement: CedarStatement): boolean {\n return (\n statement.effect === 'permit' &&\n principalScope(statement.scope) === 'yes' &&\n statement.conditions.every(\n (condition) => condition.kind === 'when' && TRUE_BODY.test(condition.body)\n )\n );\n}\n","import { CEDAR_SPACE_CLASS } from './cedar-space';\nimport { analyzePolicyScope, type ProbeClass } from './cedar-principal-scope';\nimport {\n NO_EVIDENCE_CATEGORY,\n withNoEvidenceExclusion,\n withoutNoEvidenceExclusion,\n} from './legacy-carve-out';\n/**\n * Shared best-effort matchers for reading a composed Cedar policy's per-rule\n * annotations (`@scopes`, `@approvers`, …) WITHOUT a Cedar AST. Both\n * `requiredScopesForRequest` (consent scopes) and `approvalQuorumForRequest`\n * (step-up quorum) narrow a rule's annotation to a request the same way the\n * compose engine's own `parseExistingCedar` does: blocks split on blank lines,\n * a rule contributes only when EVERY request fact it constrains matches.\n *\n * A fact is matched against the SAME projection the gateway/edge feeds the\n * engine (`name = agentName`, `category = scraper|detectionClass`), so the\n * narrowing mirrors the engine's own evaluation. An UNKNOWN fact never narrows.\n */\nimport { cedarQuotedValueRegExp, globMatches, unescapeCedarString } from './cedar-string';\n\nconst UNLESS_BRACE = new RegExp(`unless${CEDAR_SPACE_CLASS}*\\\\{`);\n\nexport interface RequestFacts {\n path?: string;\n /** Agent label → `principal.name`. */\n name?: string;\n /** Agent category → `principal.category` (e.g. `\"scraper\"`). */\n category?: string;\n}\n\n/**\n * A block applies when its path AND principal conditions all match the KNOWN\n * request facts. An unknown fact never narrows (so the no-`request` case unions\n * every matching rule's annotation).\n */\nexport function blockApplies(block: string, request?: RequestFacts): boolean {\n if (request?.path !== undefined && !blockMatchesPath(block, request.path)) return false;\n if (request?.name !== undefined && !blockMatchesEquality(block, 'principal.name', request.name)) {\n return false;\n }\n if (request?.category !== undefined) {\n if (!blockMatchesEquality(block, 'principal.category', categoryRead(block, request.category))) {\n return false;\n }\n }\n return true;\n}\n\nfunction categoryRead(block: string, category: string): string {\n if (category !== NO_EVIDENCE_CATEGORY) return category;\n const original = withoutNoEvidenceExclusion(block);\n return withNoEvidenceExclusion(original) !== original ? 'human' : category;\n}\n\n/** The `resource.path` literals appearing anywhere in `text` (no `when`/\n * `unless` scoping — callers that care about scope use `splitWhenUnless`\n * first). Shared regex extraction for `pathLiteralsInBlock` and the\n * scope-aware helpers below. */\nfunction pathLiteralsInText(text: string): string[] {\n return Array.from(\n text.matchAll(cedarQuotedValueRegExp('resource\\\\.path (?:like|==) ', 'g')),\n (m) => unescapeCedarString(m[1])\n );\n}\n\n/**\n * The `resource.path` literals a block MENTIONS anywhere — `when` or\n * `unless` alike (empty = the block never mentions a path). Used for\n * enumeration (which concrete paths does this bundle reference at all),\n * NOT for \"does this block's condition match path\" — that's\n * `blockMatchesPath`, which is `unless`-aware. Mixing the two up is exactly\n * the bug Bugbot caught (2026-09-10): a literal that appears ONLY inside\n * `unless { … }` names a path this block does NOT apply to, not one it\n * targets.\n */\nexport function pathLiteralsInBlock(block: string): string[] {\n return pathLiteralsInText(block);\n}\n\n/**\n * Split `block` into its `when`-scoped text and its `unless`-scoped inner\n * text, mirroring the compose engine's own excision order\n * (`apps/web/lib/compose/cedar.ts`'s `unless` handling): `unless { … }` is\n * located first and excised, so its own literals never leak into what\n * counts as the block's `when` (narrowing) scope.\n *\n * CodeQL js/polynomial-redos: a single `/unless\\s*\\{([\\s\\S]*?)\\}\\s*;?/`\n * regex is quadratic on a policy blob containing many \"unless{\"\n * substrings with no closing brace (composed policy text is untrusted,\n * customer-authored input evaluated on the request hot path) — an\n * unanchored match retries the unbounded `[\\s\\S]*?` scan-to-end at every\n * failed start position. `search()` for the fixed-length \"unless\\s*{\"\n * prefix has no such ambiguity (each position fails fast), and the\n * closing brace is then found with a single linear `indexOf`, so the\n * whole split stays O(n) regardless of how many false \"unless{\" starts\n * the text contains.\n */\nfunction splitWhenUnless(block: string): { whenText: string; unlessText: string } {\n const unlessIndex = block.search(UNLESS_BRACE);\n if (unlessIndex === -1) return { whenText: block, unlessText: '' };\n const openBraceIndex = block.indexOf('{', unlessIndex);\n const closeBraceIndex = block.indexOf('}', openBraceIndex + 1);\n if (closeBraceIndex === -1) return { whenText: block, unlessText: '' };\n return {\n whenText: block.slice(0, unlessIndex),\n unlessText: block.slice(openBraceIndex + 1, closeBraceIndex),\n };\n}\n\n/**\n * A block applies to `path` when: no `unless` literal excludes it, AND\n * either the `when` scope has no path constraint at all (unconstrained →\n * matches every path except what `unless` just excluded), or one of the\n * `when` scope's path literals matches (exact, or a `*`-prefix glob).\n *\n * Bugbot (2026-09-10): the previous version read path literals from the\n * WHOLE block regardless of `when` vs `unless`, so a site-wide forbid whose\n * only path mention was an `unless { resource.path == \"/checkout\" }`\n * exemption got scored as \"targets only /checkout\" — backwards. It applies\n * to every path EXCEPT the excepted one, not ONLY the excepted one.\n */\nexport function blockMatchesPath(block: string, path: string): boolean {\n const { whenText, unlessText } = splitWhenUnless(block);\n const unlessLiterals = pathLiteralsInText(unlessText);\n if (unlessLiterals.some((literal) => pathLiteralMatches(literal, path))) return false;\n const whenLiterals = pathLiteralsInText(whenText);\n if (whenLiterals.length === 0) return true;\n return whenLiterals.some((literal) => pathLiteralMatches(literal, path));\n}\n\n/** Escape every regex metacharacter in `s` (so it matches literally). */\nexport function escapeRegExp(s: string): string {\n return s.replace(/[.*+?^${}()|[\\]\\\\]/g, '\\\\$&');\n}\n\n/**\n * Split a composed Cedar bundle into per-rule blocks (blank-line separated),\n * trimmed and with empties dropped. Mirrors the compose engine's own block\n * split (`apps/web/lib/compose/cedar.ts` `parseCedarBlocks`).\n */\nexport function splitCedarBlocks(cedar: string): string[] {\n return cedar\n .split(/\\n\\s*\\n/)\n .map((b) => b.trim())\n .filter((b) => b.length > 0);\n}\n\n/**\n * The set of values a block positively constrains `attr` to via `== ` literals.\n * Empty = the block places no `==` constraint on `attr` (unconstrained).\n */\nexport function blockEqualityLiterals(block: string, attr: string): string[] {\n const a = escapeRegExp(attr);\n return Array.from(block.matchAll(cedarQuotedValueRegExp(`${a} == `, 'g')), (m) =>\n unescapeCedarString(m[1])\n );\n}\n\n/**\n * The set of values a block EXCLUDES `attr` from via `!= ` literals.\n * Empty = the block places no `!=` constraint on `attr`.\n */\nexport function blockExclusionLiterals(block: string, attr: string): string[] {\n const a = escapeRegExp(attr);\n return Array.from(block.matchAll(cedarQuotedValueRegExp(`${a} != `, 'g')), (m) =>\n unescapeCedarString(m[1])\n );\n}\n\n/** A block applies to `value` when it is NOT excluded by a `!=` literal AND\n * (it declares no `==` literal — unconstrained → applies to all — or `value` is\n * one of them; compose emits an OR-disjunction for a name set). Without the `!=`\n * arm a rule that challenges everyone EXCEPT X (`principal.name != \"X\"`) would\n * over-advertise its annotation to X — a broader grant than the rule meant. */\nexport function blockMatchesEquality(block: string, attr: string, value: string): boolean {\n const eq = blockEqualityLiterals(block, attr);\n const neq = blockExclusionLiterals(block, attr);\n if (neq.includes(value)) return false; // explicitly excluded\n if (eq.length > 0) return eq.includes(value); // positively narrowed to a set\n return true; // unconstrained (and not excluded)\n}\n\n/**\n * Match a `resource.path` literal against the request path with CEDAR `like`\n * semantics — NOT the package's `matchPath`. Cedar `*` matches any sequence\n * INCLUDING `/` (regex `.*`), whereas `matchPath` treats a single `*` as\n * `[^/]*` (no slash); using it here would disagree with what the engine\n * actually matched. A `==`/non-wildcard literal is an exact match; a `like`\n * literal maps each `*` (and `**`) to `.*`, anchored.\n */\nexport function pathLiteralMatches(literal: string, path: string): boolean {\n return globMatches(literal.split('*'), path);\n}\n\nexport interface PolicyHazardAnalysis {\n unnarrowedDenyFor(path: string, probe: ProbeClass): boolean;\n explicitDenyFor(path: string, probe: ProbeClass): boolean;\n humanHazard(path: string): boolean;\n noEvidenceHazard(path: string): boolean;\n noEvidenceNamed(path: string): boolean;\n}\n\nexport function analyzePolicySource(cedar: string): PolicyHazardAnalysis {\n const scope = analyzePolicyScope(cedar);\n const analysis: PolicyHazardAnalysis = {\n unnarrowedDenyFor: (path, probe) =>\n scope.unnarrowedDeny(path).some(({ classes }) => classes.includes(probe)),\n explicitDenyFor: (path, probe) => scope.denyNamingClass(path, probe).length > 0,\n humanHazard: (path) => analysis.unnarrowedDenyFor(path, 'human'),\n noEvidenceHazard: (path) =>\n analysis.unnarrowedDenyFor(path, NO_EVIDENCE_CATEGORY) && !analysis.noEvidenceNamed(path),\n noEvidenceNamed: (path) => analysis.explicitDenyFor(path, NO_EVIDENCE_CATEGORY),\n };\n return analysis;\n}\n\nexport function pathHasUnnarrowedDenyRuleFor(\n cedar: string,\n path: string,\n probe: ProbeClass\n): boolean {\n return analyzePolicySource(cedar).unnarrowedDenyFor(path, probe);\n}\n","export class ByteBoundedMemo<V> {\n private readonly entries = new Map<string, { value: V; bytes: number }>();\n private used = 0;\n\n constructor(private readonly budgetBytes: number) {}\n\n remember(key: string, bytes: number, make: () => V): V {\n const hit = this.entries.get(key);\n if (hit !== undefined) {\n this.entries.delete(key);\n this.entries.set(key, hit);\n return hit.value;\n }\n const value = make();\n if (bytes > this.budgetBytes) return value;\n this.entries.set(key, { value, bytes });\n this.used += bytes;\n for (const [oldest, entry] of this.entries) {\n if (this.used <= this.budgetBytes) break;\n this.entries.delete(oldest);\n this.used -= entry.bytes;\n }\n return value;\n }\n}\n","import { ByteBoundedMemo } from './byte-bounded-memo';\nimport { withoutNoEvidenceExclusion } from './legacy-carve-out';\n\nconst BUDGET_BYTES = 4 * 1024 * 1024;\nconst BYTES_PER_CHARACTER = 4;\n\nconst memo = new ByteBoundedMemo<string>(BUDGET_BYTES);\n\nexport const unsubstitutedSource = (source: string): string =>\n memo.remember(source, source.length * BYTES_PER_CHARACTER, () =>\n withoutNoEvidenceExclusion(source)\n );\n","/**\n * Consent scopes a composed Cedar policy REQUIRES for a request — the\n * `@scopes(...)` annotations the compose engine writes on CHALLENGE-verdict\n * rules (alongside `unless { context.granted_scopes.contains(\"S\") }`).\n *\n * WHY: when a scope-gated rule challenges a request, the step-up must request\n * EXACTLY the scopes the policy demands, so the consent flow mints a delegation\n * carrying them (and the agent's retry then satisfies the carve-out). The\n * policy is the source of truth for \"what this route requires\", so reading its\n * `@scopes` is reading the SSOT — not re-deriving an engine-computed value.\n *\n * Best-effort TEXT parse (no Cedar AST), mirroring the compose engine's own\n * `parseExistingCedar`: blocks are split on blank lines. A CHALLENGE block\n * contributes its scopes only when EVERY request fact it constrains matches —\n * `resource.path`, `principal.name`, and `principal.category` — so on a shared\n * path the scopes of ANOTHER agent's CHALLENGE rule are not advertised (the\n * engine challenged on the rule whose `when` matched, not merely the path).\n *\n * A fact is matched against the SAME projection the gateway feeds the engine\n * (`name = detection.agentName`, `category = scraper|detectionClass`), so the\n * narrowing mirrors the engine's own evaluation. An UNKNOWN fact never narrows:\n * with no `request` (the consent allow-list case) this returns the union of\n * every CHALLENGE rule's scopes — exactly what consent must be able to grant.\n */\nimport { blockApplies, type RequestFacts } from './cedar-rule-match';\nimport { cedarQuotedValueRegExp, unescapeCedarString } from './cedar-string';\nimport { unsubstitutedSource } from './unsubstituted-source';\n\nexport type { RequestFacts };\n\nexport function requiredScopesForRequest(\n policySource: string | null | undefined,\n request?: RequestFacts\n): string[] {\n if (!policySource || !policySource.trim()) return [];\n const out = new Set<string>();\n for (const block of unsubstitutedSource(policySource).split(/\\n\\s*\\n/)) {\n if (!/@verdict\\(\"CHALLENGE\"\\)/.test(block)) continue;\n const scopesMatch = block.match(cedarQuotedValueRegExp('@scopes\\\\('));\n if (!scopesMatch) continue;\n // Split on whitespace FIRST (the emitter joins escaped tokens with a real\n // space), THEN decode each token — an escaped \\t must not act as a separator.\n const scopes = scopesMatch[1].split(/\\s+/).filter(Boolean).map(unescapeCedarString);\n if (scopes.length === 0) continue;\n if (!blockApplies(block, request)) continue;\n for (const scope of scopes) out.add(scope);\n }\n return [...out];\n}\n","/**\n * `decisionPolicyId` — extract the determining policy's authored Cedar `@id`\n * from an engine `Decision` (#3272 PR2 wire; consumed by #3236 attribution).\n *\n * The optional `policyId` rides a different position per decision kind:\n * `Permit` root, the `PolicyDenied` reason for `Block`, and the\n * `params` / `target` / `payload` for Challenge / Redirect / Instruct. This\n * helper is the single owner of that position-per-kind knowledge — the TS\n * mirror of .NET's `DecisionMapping.TryGetPolicyId` — so the middleware\n * reporter, the gateway worker, and ingest never duplicate it.\n *\n * `undefined` for pre-PR2 payloads, non-policy blocks (`Revoked`, etc.),\n * deny-by-default, and anything malformed — never throws.\n */\n/**\n * Structural input so BOTH Decision flavors fit without casts: the canonical\n * zod-inferred `Decision` from `./schemas` AND the wasm-runtime's\n * `engine/types` mirror (which carries extra Block variants the zod union\n * doesn't, e.g. Tier3UAMatch). Only the fields this extraction reads are\n * named; everything else is ignored.\n */\nexport interface DecisionLike {\n kind: string;\n policyId?: string;\n reason?: { kind: string; policyId?: string };\n params?: { policyId?: string };\n target?: { policyId?: string };\n payload?: { policyId?: string };\n}\n\nexport function decisionPolicyId(decision: DecisionLike): string | undefined {\n switch (decision.kind) {\n case 'Permit':\n return decision.policyId;\n case 'Block':\n return decision.reason?.kind === 'PolicyDenied' ? decision.reason.policyId : undefined;\n case 'Challenge':\n return decision.params?.policyId;\n case 'Redirect':\n return decision.target?.policyId;\n case 'Instruct':\n return decision.payload?.policyId;\n default:\n return undefined;\n }\n}\n","/**\n * Synthetic `@id`s for the gateway's \"bespoke\" (non-composed-Cedar) policy\n * mechanisms — KYA-862 follow-up.\n *\n * The gateway worker has two policy-evaluation paths: composed Cedar (whose\n * decisions carry an authored `@id`) and the bespoke evaluator\n * (`evaluateGatewayPolicy`) that runs when a project has no composed bundle, is\n * in shadow mode, or the engine faults. Bespoke decisions historically carried\n * no `policyId`, so they landed with `detections.policy_id = NULL` and rendered\n * as an em-dash on `/activity` with no attribution.\n *\n * A bespoke decision made by an EXPLICIT configured rule (deny-list, allow-list,\n * path-rule, confidence threshold) now carries one of these stable ids, so\n * `/activity` can attribute it. The slug style (`bespoke-<match-type>`) mirrors\n * composed-Cedar `@id`s (a slug of the rule title; cf. the reserved\n * `baseline-allow`).\n *\n * These are NOT authored Cedar policies — there is no policy-detail page for a\n * built-in mechanism — so the dashboard renders them as a friendly label, NOT a\n * deep link (`isBespokePolicyId` gates the href off). Implicit decisions\n * (below-threshold allow, enforcement disabled) carry no id and keep the\n * em-dash, since no explicit rule decided them.\n */\n\n/** Shared naming convention: every bespoke `@id` starts with this. */\nexport const BESPOKE_POLICY_ID_PREFIX = 'bespoke-';\n\n/** Stable synthetic `@id` per explicit bespoke mechanism. */\nexport const BESPOKE_POLICY_IDS = {\n denyList: 'bespoke-deny-list',\n allowList: 'bespoke-allow-list',\n pathRule: 'bespoke-path-rule',\n threshold: 'bespoke-threshold',\n} as const;\n\nexport type BespokePolicyId = (typeof BESPOKE_POLICY_IDS)[keyof typeof BESPOKE_POLICY_IDS];\n\nconst BESPOKE_POLICY_LABELS: Record<string, string> = {\n [BESPOKE_POLICY_IDS.denyList]: 'Deny list',\n [BESPOKE_POLICY_IDS.allowList]: 'Allow list',\n [BESPOKE_POLICY_IDS.pathRule]: 'Path rule',\n [BESPOKE_POLICY_IDS.threshold]: 'Confidence threshold',\n};\n\n// Exact membership, NOT a prefix test: a `bespoke-` prefix check would\n// misclassify an authored Cedar policy whose title slugs to `bespoke-…`. Both\n// the worker (stamping) and the reader (display) use this same set, so there is\n// no drift — a new mechanism is recognized everywhere the moment it's added to\n// BESPOKE_POLICY_IDS.\nconst BESPOKE_POLICY_ID_SET: ReadonlySet<string> = new Set(Object.values(BESPOKE_POLICY_IDS));\n\n/** True when `policyId` is one of our synthetic bespoke ids (vs. an authored Cedar `@id`). */\nexport function isBespokePolicyId(policyId: string | null | undefined): boolean {\n return typeof policyId === 'string' && BESPOKE_POLICY_ID_SET.has(policyId);\n}\n\n/**\n * Human-readable label for a bespoke `@id`; `null` for an unrecognized id so the\n * caller can fall back to showing the raw id.\n */\nexport function bespokePolicyLabel(policyId: string): string | null {\n return BESPOKE_POLICY_LABELS[policyId] ?? null;\n}\n\n/**\n * The compose engine's implicit default-allow baseline rule `@id`. The engine\n * emits it into every composed Cedar bundle (see\n * `apps/web/lib/compose/cedar.ts` `DEFAULT_ALLOW_BASELINE`), but the policy\n * list/detail derivation excludes it — \"the implicit allow-all, not a user\n * rule\" — so it has NO detail page. `/activity` attributes a row to it but must\n * never link it (a deep link 404s). Kept here so the activity reader recognizes\n * it without importing the compose engine into the client bundle; a test pins\n * that this string still matches the emitter's `@id`.\n */\nexport const BASELINE_ALLOW_POLICY_ID = 'baseline-allow';\n\n/**\n * `policyId`s that have NO policy-detail page: the synthetic bespoke mechanisms\n * AND the implicit `baseline-allow`. `/activity` attributes these but must not\n * deep-link them.\n */\nexport function isNonNavigablePolicyId(policyId: string | null | undefined): boolean {\n return isBespokePolicyId(policyId) || policyId === BASELINE_ALLOW_POLICY_ID;\n}\n\n/**\n * Friendly label for a non-navigable policy id (bespoke mechanism or\n * `baseline-allow`); `null` for a real authored policy id (caller resolves the\n * projection name / raw `@id` instead).\n */\nexport function nonNavigablePolicyLabel(policyId: string | null | undefined): string | null {\n if (policyId === BASELINE_ALLOW_POLICY_ID) return 'Default allow';\n return typeof policyId === 'string' ? bespokePolicyLabel(policyId) : null;\n}\n","/**\n * The step-up APPROVAL QUORUM a composed Cedar policy requires for a request —\n * the `@approvers(...)` (+ optional `@quorum(\"N\")`) annotations on a\n * CHALLENGE-verdict rule.\n *\n * WHY (ADR D7 — distinct verdict): the engine emits a single `Challenge` for\n * both consent (`@scopes`) and human-approval step-up (`@approvers`). They are\n * DIFFERENT security flows and must not collide — a consent challenge mints a\n * delegation; an approval-quorum challenge demands N-of-M humans cryptographically\n * sign. This classifier is the seam that tells them apart from the policy text:\n * - a CHALLENGE rule carrying `@approvers` → an approval quorum (this returns it)\n * - a CHALLENGE rule with only `@scopes` (or neither) → consent (returns null)\n *\n * It mirrors {@link requiredScopesForRequest}: the SAME best-effort block parse\n * and the SAME request narrowing (shared {@link blockApplies}), so the rule it\n * reads the quorum off is the rule the engine actually challenged on — not merely\n * one that shares a path. Reading the annotation is reading the SSOT (the policy\n * is the source of truth for \"what this action requires\"), not re-deriving it.\n *\n * The engine carries no rule id on its Challenge, so the classifier re-matches by\n * request facts and is FAIL-CLOSED on ambiguity:\n * - if a CONSENT-only CHALLENGE rule ALSO applies, it returns null — the engine\n * may have challenged on THAT, and reading approval off a different rule would\n * conflate the two flows (ADR D7)\n * - if two applying approval rules disagree on {n, approvers}, it returns null —\n * enforcing the wrong approver roster is a worse failure than a clean deny\n * Each caller feeds it the SAME facts its engine evaluated, so it narrows to the\n * rule the engine could have fired on. The EDGE worker sets resource.path +\n * principal.name and narrows on them; the Fly gateway sets NEITHER (it populates\n * category + the resource entity, leaving resource.path==\"\" and principal.name=\"\"),\n * so it passes those as \"\" — path/name-scoped rules don't fire there, exactly as\n * the engine sees it, and a same-scope tie falls to the fail-closed guard above.\n */\nimport { blockApplies, type RequestFacts } from './cedar-rule-match';\nimport { unsubstitutedSource } from './unsubstituted-source';\n\nexport type { RequestFacts };\n\nexport interface ApprovalQuorum {\n /** Distinct allow-listed approvers that must sign — `>= 1`. */\n n: number;\n /** The approver DIDs the org sovereignly authorizes for this action. */\n approvers: string[];\n}\n\nexport function approvalQuorumForRequest(\n policySource: string | null | undefined,\n request?: RequestFacts\n): ApprovalQuorum | null {\n if (!policySource || !policySource.trim()) return null;\n\n let chosen: ApprovalQuorum | null = null;\n for (const block of unsubstitutedSource(policySource).split(/\\n\\s*\\n/)) {\n if (!/@verdict\\(\"CHALLENGE\"\\)/.test(block)) continue;\n if (!blockApplies(block, request)) continue; // not a rule the engine could have fired on\n\n const approvers = parseApprovers(block);\n if (!approvers) {\n // A consent-only CHALLENGE rule also applies — the engine may have fired it.\n // Without a rule id we can't tell, so never read an approval quorum off a\n // different rule (ADR D7): fail to the consent/deny path.\n return null;\n }\n const candidate: ApprovalQuorum = { n: parseQuorumN(block), approvers };\n if (chosen && !sameQuorum(chosen, candidate)) {\n // Two distinct approval quorums both apply — ambiguous without a rule id, so\n // enforcing either risks the wrong approver roster. Fail closed.\n return null;\n }\n chosen = candidate;\n }\n return chosen;\n}\n\n/** The DIDs of an `@approvers(\"did … did\")` annotation, or null when the rule\n * carries none (a consent challenge) or an empty/whitespace list (no real gate). */\nfunction parseApprovers(block: string): string[] | null {\n const m = block.match(/@approvers\\(\"([^\"]*)\"\\)/);\n if (!m) return null;\n const approvers = m[1].split(/\\s+/).filter(Boolean);\n return approvers.length > 0 ? approvers : null;\n}\n\n/** Two quorums match iff same n and same ordered approver list. */\nfunction sameQuorum(a: ApprovalQuorum, b: ApprovalQuorum): boolean {\n return (\n a.n === b.n &&\n a.approvers.length === b.approvers.length &&\n a.approvers.every((did, i) => did === b.approvers[i])\n );\n}\n\n/**\n * The `@quorum(\"N\")` count, or 1 when absent/malformed. Fail-secure: an\n * unparseable or `< 1` value falls back to 1 (the smallest real quorum), never 0\n * — which would make the step-up gate a no-op. The route's own\n * `validateStepUpQuorum` is the second line of defence on a misconfigured n.\n */\nfunction parseQuorumN(block: string): number {\n const m = block.match(/@quorum\\(\"([^\"]*)\"\\)/);\n if (!m) return 1;\n const n = Number(m[1]);\n return Number.isInteger(n) && n >= 1 ? n : 1;\n}\n","/**\n * Step-up quorum validation — the fail-closed guard the enforce-path PEP runs\n * BEFORE attempting approval-signature verification.\n *\n * Moved from the gateway (`apps/gateway/src/lib/step-up-quorum.ts`) into\n * `@kya-os/checkpoint-shared` so every runtime that enforces N-of-M step-up at\n * the edge — not only the central gateway — applies the SAME fail-closed gate\n * (T3-edge keystone). Pure, with the quorum typed STRUCTURALLY ({@link\n * StepUpQuorumLike}) so the dependency-graph root package takes no\n * `@kya-os/mcp` dependency; the `@kya-os/mcp` `Quorum` is structurally\n * assignable to it.\n *\n * A `step_up` decision names an N-of-M approval quorum. Two shapes can never be\n * legitimately satisfied and MUST be denied rather than passed through to the\n * verifier:\n *\n * - `n` not a positive integer — a misconfigured engine emitting `{ n: 0 }`\n * (e.g. a Cedar Challenge defaulting to zero) would otherwise auto-pass.\n * - an EMPTY approver allowlist. Per the `@kya-os/mcp` quorum contract an\n * empty `approvers` means \"any identity may approve\". In ENFORCE mode that\n * is NOT authorization: once a real approval-signature verifier replaces\n * today's reject-all kill switch, any signer would satisfy the quorum. A\n * `step_up` that names no eligible approvers can never be a real\n * authorization gate, so it is denied — the policy author must name the\n * approvers.\n *\n * Extracted as a pure function so the fail-closed posture is unit-testable\n * independently of the deep request handlers that invoke it.\n */\n\n/**\n * The N-of-M quorum shape the validator inspects. Structural mirror of the\n * `@kya-os/mcp` `Quorum` (`{ n, approvers }`) — kept local so this module (and\n * thus the checkpoint-shared dependency-graph root) takes no `@kya-os/mcp`\n * dependency. The `@kya-os/mcp` `Quorum` is structurally assignable here.\n */\nexport interface StepUpQuorumLike {\n n: number;\n approvers: string[];\n}\n\n/**\n * Why a step-up quorum is rejected. Surfaced as the `policy_denied` reason and\n * in the enforce-path structured log.\n */\nexport type InvalidStepUpReason = 'invalid_step_up_quorum' | 'step_up_no_approvers';\n\n/** Result of {@link validateStepUpQuorum}: pass, or a fail-closed deny reason. */\nexport type StepUpQuorumCheck = { ok: true } | { ok: false; reason: InvalidStepUpReason };\n\n/**\n * Validate a `step_up` decision's quorum before approval verification.\n * Fail-closed: returns a deny `reason` for any quorum that can never be\n * legitimately met; `{ ok: true }` only when the quorum is a real gate.\n *\n * Ordering is load-bearing: the `n` guard runs first, so an invalid quorum that\n * is both non-positive AND has no approvers reports `invalid_step_up_quorum`\n * (stable/deterministic reason).\n */\nexport function validateStepUpQuorum(quorum: StepUpQuorumLike): StepUpQuorumCheck {\n if (!Number.isInteger(quorum.n) || quorum.n < 1) {\n return { ok: false, reason: 'invalid_step_up_quorum' };\n }\n if (!Array.isArray(quorum.approvers) || quorum.approvers.length === 0) {\n return { ok: false, reason: 'step_up_no_approvers' };\n }\n return { ok: true };\n}\n"],"mappings":";AAAA,MAAa,qBAAqB;AAElC,MAAa,kCAAkC;AAE/C,MAAa,mBAAmB;CAC9B,OAAO;CACP,QAAQ;AACV;AAEA,MAAa,sBAAwD;CACnE,gBAAgB;CAChB,iBAAiB;CACjB,eAAe,QAAsC;AACvD;;;;;;;;;;;ACNA,SAAgB,UAAU,MAAc,SAA0B;CAEhE,IAAI,YAAY,MACd,OAAO;CAIT,IAAI,QAAQ,SAAS,GAAG,GAAG;EACzB,MAAM,eAAe,QAClB,QAAQ,sBAAsB,MAAM,CAAC,CACrC,QAAQ,SAAS,cAAc,CAAC,CAChC,QAAQ,OAAO,OAAO,CAAC,CACvB,QAAQ,iBAAiB,IAAI;EAChC,IAAI;GACF,OAAO,IAAI,OAAO,IAAI,aAAa,EAAE,CAAC,CAAC,KAAK,IAAI;EAClD,QAAQ;GACN,OAAO;EACT;CACF;CAGA,IAAI,QAAQ,SAAS,GAAG,GACtB,OAAO,KAAK,WAAW,OAAO,KAAK,SAAS,QAAQ,MAAM,GAAG,EAAE;CAKjE,IAAI,CAAC,KAAK,WAAW,OAAO,GAC1B,OAAO;CAIT,IAAI,SAAS,SACX,OAAO;CAKT,OADiB,KAAK,QAAQ,YACV;AACtB;;;;AC9CA,MAAa,oBACX;AAEF,SAAgB,aAAa,MAAuB;CAClD,MAAM,OAAO,KAAK,WAAW,CAAC;CAC9B,OACG,QAAQ,KAAQ,QAAQ,MACzB,SAAS,MACT,SAAS,OACT,SAAS,OACT,SAAS,QACR,QAAQ,QAAU,QAAQ,QAC3B,SAAS,QACT,SAAS,QACT,SAAS,QACT,SAAS,QACT,SAAS;AAEb;;;;ACZA,MAAM,SAAS,SAA0B,SAAS,QAAQ,SAAS,OAAO,OAAO;AAEjF,SAAgB,UAAU,OAA4B;CACpD,MAAM,UAAU,MAAM,MAAM,EAAE;CAC9B,MAAM,OAAO,MAAM,MAAM,EAAE;CAC3B,MAAM,WAAsB,IAAI,MAAe,MAAM,MAAM,CAAC,CAAC,KAAK,KAAK;CACvE,IAAI,IAAI;CACR,OAAO,IAAI,MAAM,QACf,IAAI,MAAM,OAAO,MAAK;EACpB,IAAI,MAAM,IAAI;EACd,OAAO,MAAM,MAAM,UAAU,MAAM,SAAS,MAAK,OAAO,MAAM,SAAS,OAAO,IAAI;EAClF,MAAM,UAAU,KAAK,IAAI,KAAK,MAAM,MAAM;EAC1C,KAAK,IAAI,IAAI,IAAI,GAAG,IAAI,SAAS,KAAK;GACpC,SAAS,KAAK;GACd,KAAK,KAAK,MAAM,MAAM,EAAE;EAC1B;EACA,IAAI,MAAM;CACZ,OAAO,IAAI,MAAM,OAAO,OAAO,MAAM,IAAI,OAAO,KAC9C,OAAO,IAAI,MAAM,UAAU,MAAM,OAAO,QAAQ,MAAM,OAAO,MAAM;EACjE,QAAQ,KAAK;EACb,KAAK,KAAK;EACV;CACF;MAEA;CAGJ,OAAO;EAAE,SAAS,QAAQ,KAAK,EAAE;EAAG,MAAM,KAAK,KAAK,EAAE;EAAG;CAAS;AACpE;;;;;;;;;;;;ACzBA,SAAgB,kBAAkB,OAAuB;CACvD,OAAO,MACJ,QAAQ,OAAO,MAAM,CAAC,CACtB,QAAQ,MAAM,MAAK,CAAC,CACpB,QAAQ,OAAO,KAAK,CAAC,CACrB,QAAQ,OAAO,KAAK,CAAC,CACrB,QAAQ,OAAO,KAAK;AACzB;;AAGA,SAAgB,oBAAoB,OAAuB;CACzD,OAAO,MAAM,QAAQ,kBAAkB,IAAI,OACzC,OAAO,MAAM,OAAO,OAAO,MAAM,OAAO,OAAO,MAAM,MAAO,EAC9D;AACF;;;;;;;;AASA,SAAgB,uBAAuB,cAAsB,QAAQ,IAAY;CAC/E,OAAO,IAAI,OAAO,GAAG,aAAa,0BAA0B,KAAK;AACnE;AAEA,MAAM,eAAuC;CAAE,GAAG;CAAM,GAAG;CAAM,GAAG;CAAM,KAAK;AAAK;AACpF,MAAM,iBAAiB;AACvB,MAAM,iBAAiB;AACvB,MAAM,qBAAqB;AAE3B,SAAgB,kBACd,KACA,IACyC;CACzC,eAAe,YAAY;CAC3B,MAAM,QAAQ,eAAe,KAAK,GAAG;CACrC,IAAI,UAAU,MAAM,OAAO;CAC3B,IAAI,MAAM,OAAO,QAAW,OAAO;EAAE,MAAM,SAAS,MAAM,IAAI,EAAE;EAAG,QAAQ,MAAM,EAAE,CAAC;CAAO;CAC3F,MAAM,SAAS,MAAM,EAAE,CAAC,QAAQ,MAAM,EAAE;CACxC,MAAM,OAAO,SAAS,QAAQ,EAAE;CAKhC,OAHE,OAAO,UAAU,sBACjB,QAAQ,mBACP,OAAO,SAAU,OAAO,SACZ;EAAE;EAAM,QAAQ,MAAM,EAAE,CAAC;CAAO,IAAI;AACrD;AAEA,SAAgB,kBAAkB,YAA8B;CAC9D,MAAM,WAAW,CAAC,EAAE;CACpB,MAAM,UAAU,SAAiB;EAC/B,IAAI,SAAS,KAAK,SAAS,KAAK,EAAE;OAC7B,SAAS,SAAS,SAAS,MAAM;CACxC;CACA,KAAK,IAAI,IAAI,GAAG,IAAI,WAAW,QAAQ,KAAK;EAC1C,MAAM,OAAO,WAAW,OAAO,CAAC;EAChC,IAAI,SAAS,MAAM;GACjB,OAAO,IAAI;GACX;EACF;EACA,MAAM,UAAU,kBAAkB,YAAY,IAAI,CAAC;EACnD,IAAI,YAAY,MAAM;GACpB,OAAO,OAAO,cAAc,QAAQ,IAAI,CAAC;GACzC,KAAK,QAAQ;EACf,OAAO;GACL,MAAM,OAAO,WAAW,OAAO,EAAE,CAAC;GAClC,SAAS,SAAS,SAAS,MAAM,aAAa,SAAS;EACzD;CACF;CACA,OAAO;AACT;AAEA,SAAgB,YAAY,UAA6B,OAAwB;CAC/E,MAAM,QAAQ,SAAS;CACvB,IAAI,SAAS,WAAW,GAAG,OAAO,UAAU;CAC5C,MAAM,OAAO,SAAS,SAAS,SAAS;CACxC,MAAM,MAAM,MAAM,SAAS,KAAK;CAChC,IAAI,MAAM,MAAM,UAAU,CAAC,MAAM,WAAW,KAAK,KAAK,CAAC,MAAM,SAAS,IAAI,GAAG,OAAO;CACpF,IAAI,WAAW,MAAM;CACrB,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,SAAS,GAAG,KAAK;EAC5C,MAAM,KAAK,MAAM,QAAQ,SAAS,IAAI,QAAQ;EAC9C,IAAI,OAAO,MAAM,KAAK,SAAS,EAAE,CAAC,SAAS,KAAK,OAAO;EACvD,WAAW,KAAK,SAAS,EAAE,CAAC;CAC9B;CACA,OAAO;AACT;;;;AC3FA,MAAa,uBAAuB;AACpC,MAAa,6BAA6B,0BAA0B,qBAAqB;AACzF,MAAa,4BAA4B,0BAA0B,qBAAqB;AAExF,MAAM,KAAK,GAAG,kBAAkB;AAChC,MAAM,mBAAmB,IAAI,OAAO,uBAAuB,GAAG,QAAQ,GAAG;AACzE,MAAM,WAAW,SAAS,GAAG,iBAAiB,GAAG,UAAU,GAAG;AAC9D,MAAM,UAAU,uBAAuB,KAAK;AAC5C,MAAM,QAAQ;AACd,MAAM,WAAW;AACjB,MAAM,WAAW,mBAAmB,GAAG,SAAS,GAAG;AACnD,MAAM,gBAAgB,IAAI,OAAO,0BAA0B,GAAG,OAAO,KAAK,YAAY,GAAG;AACzF,MAAM,qBAAqB;AAC3B,MAAM,aAAa,IAAI,OACrB,GAAG,GAAG,QAAQ,GAAG,mBAAmB,GAAG,UAAU,GAAG,aAAa,GAAG,OACpE,GACF;AACA,MAAM,mBAAmB;AACzB,MAAM,aAAa,IAAI,OAAO,WAAW,kBAAkB,IAAI;AAC/D,MAAM,oBAAoB,IAAI,OAC5B,GAAG,UAAU,GAAG,cAAc,KAAK,MAAM,OAAO,KAAK,SAAS,IAAI,QAAQ,GAAG,WAAW,KAAK,SAC/F;AACA,MAAM,YAAY,IAAI,OACpB,OAAO,SAAS,MAAM,GAAG,KAAK,GAAG,sBAAsB,GAAG,MAAM,QAAQ,KAAK,MAAM,QAAQ,SAAS,QACpG,GACF;AACA,MAAM,eAAe,IAAI,OAAO,OAAO;AACvC,MAAM,kBAAkB,IAAI,OAAO,KAAK;AACxC,MAAM,mBAAmB,IAAI,OAC3B,iBAAiB,kBAAkB,oBAAoB,kBAAkB,UAAU,GAAG,iBAAiB,GAAG,yBAAyB,GAAG,YAAY,qBAAqB,6BACvK,GACF;AAQA,SAAS,cAAc,MAAsB;CAC3C,MAAM,WAAW,kBAAkB,IAAI;CACvC,IAAI,SAAS,WAAW,GAAG;EACzB,IAAI,SAAS,sBAA6B,OAAO;EACjD,OAAO,SAAS,OAAO,aAAa,MAAM;CAC5C;CAEA,OADgB,SAAS,MAAM,YAAY,QAAQ,sBAA6B,CACnE,KAAK,YAAY,uBAA8B,IAAI,MAAM;AACxE;AASA,SAAS,KAAK,OAAwB;CACpC,MAAM,EAAE,SAAS,MAAM,aAAa,UAAU,KAAK;CACnD,MAAM,SAAS,KAAK,MAAM,EAAE;CAC5B,KAAK,IAAI,QAAQ,GAAG,QAAQ,MAAM,SAAU;EAC1C,IAAI,CAAC,SAAS,QAAQ;GACpB;GACA;EACF;EACA,IAAI,MAAM;EACV,OAAO,MAAM,MAAM,UAAU,SAAS,MAAM;EAC5C,MAAM,SAAS,cAAc,QAAQ,MAAM,OAAO,GAAG,CAAC;EACtD,IAAI,WAAW,KAAK,OAAO,SAAS;EACpC,QAAQ;CACV;CACA,MAAM,OAAO,OAAO,KAAK,EAAE;CAC3B,OAAO;EAAE;EAAS;EAAM,MAAM,KAAK,QAAQ,SAAS,GAAG;EAAG,OAAO,gBAAgB,IAAI;CAAE;AACzF;AAEA,SAAS,gBAAgB,MAA0B;CACjD,MAAM,QAAQ,IAAI,WAAW,KAAK,MAAM,CAAC,CAAC,KAAK,EAAE;CACjD,MAAM,OAAiB,CAAC;CACxB,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAC/B,IAAI,KAAK,OAAO,KAAK,KAAK,KAAK,CAAC;MAC3B,IAAI,KAAK,OAAO,KAAK,MAAM,KAAK,KAAK,IAAI,KAAK;CAErD,OAAO;AACT;AAEA,SAAS,gBAAgB,MAAuC;CAC9D,MAAM,SAAkC,CAAC;CACzC,IAAI,OAAO;CACX,KAAK,MAAM,YAAY,KAAK,SAAS,gBAAgB,GACnD,IAAI,SAAS,OAAO,KAAK;EACvB,IAAI,SAAS,IAAI,OAAO,KAAK,CAAC,MAAM,SAAS,QAAQ,CAAC,CAAC;EACvD,OAAO;CACT,OAAO;EACL,IAAI,SAAS,IAAI,OAAO,KAAK,CAAC,MAAM,SAAS,KAAK,CAAC;EACnD,OAAO,SAAS;CAClB;CAEF,IAAI,SAAS,IAAI,OAAO,KAAK,CAAC,MAAM,KAAK,MAAM,CAAC;CAChD,OAAO;AACT;AAEA,SAAS,WAAW,OAAe,OAAuB;CACxD,IAAI,MAAM,WAAW,GAAG,OAAO;CAC/B,MAAM,SAAmB,CAAC;CAC1B,IAAI,WAAW;CACf,KAAK,MAAM,QAAQ,OAAO;EACxB,OAAO,KAAK,MAAM,MAAM,UAAU,KAAK,KAAK,GAAG,KAAK,IAAI;EACxD,WAAW,KAAK;CAClB;CACA,OAAO,KAAK,MAAM,MAAM,QAAQ,CAAC;CACjC,OAAO,OAAO,KAAK,EAAE;AACvB;AAEA,SAAS,kBAAkB,MAAuB;CAChD,IAAI,kBAAkB,KAAK,IAAI,GAAG,OAAO;CACzC,KAAK,MAAM,GAAG,UAAU,SAAS,OAAO,OAAO,OAAO,KAAK,SAAS,SAAS,GAAG;EAC9E,MAAM,wBAAwB,aAAa,KAAK,QAAQ;EACxD,MAAM,0BAA0B,gBAAgB,KAAK,QAAQ;EAC7D,IACG,0BAA0B,UAAU,UAAa,gBAAgB,KAAK,IAAI,MAC1E,4BAA4B,YAAY,UAAa,aAAa,KAAK,IAAI,IAE5E,OAAO;CAEX;CACA,OAAO;AACT;AAEA,SAAgB,gBAAgB,OAAwB;CACtD,OAAO,kBAAkB,KAAK,KAAK,CAAC,CAAC,IAAI;AAC3C;AAEA,SAAS,WAAW,EAAE,MAAM,SAAkB,WAAmB,MAAsB;CACrF,MAAM,aAAa,KAAK,YAAY,GAAG;CACvC,IAAI,eAAe,IAAI,OAAO;CAC9B,MAAM,OAAO,MAAM,YAAY;CAC/B,OAAO,SAAS,MAAM,WAAW,KAAK,KAAK,MAAM,MAAM,SAAS,CAAC,IAAI,OAAO;AAC9E;AAEA,MAAM,cAAc,SAAsC,SAAS,UAAa,KAAK,KAAK,IAAI;AAE9F,SAAS,cAAc,MAAc,MAAsB;CACzD,IAAI,IAAI;CACR,OAAO,KAAK,KAAK,aAAa,KAAK,EAAE,GAAG;CACxC,OAAO;AACT;AAEA,SAAS,iBAAiB,MAAc,MAAsB;CAC5D,IAAI,IAAI;CACR,OAAO,IAAI,KAAK,UAAU,aAAa,KAAK,EAAE,GAAG;CACjD,OAAO;AACT;AAEA,SAAS,aAAa,MAAc,KAAqB;CACvD,IAAI,QAAQ;CACZ,OAAO,QAAQ,KAAK,WAAW,KAAK,QAAQ,EAAE,GAAG;CACjD,OAAO,KAAK,MAAM,OAAO,MAAM,CAAC;AAClC;AAEA,SAAS,oBAAoB,MAAc,IAAqB;CAC9D,MAAM,SAAS,cAAc,MAAM,KAAK,CAAC;CACzC,MAAM,OAAO,KAAK;CAClB,IAAI,SAAS,OAAO,SAAS,KAAK,OAAO;CACzC,IAAI,SAAS,OAAO,KAAK,SAAS,OAAO,KAAK,OAAO;CACrD,IAAI,WAAW,IAAI,KAAK,aAAa,MAAM,MAAM,MAAM,OAAO,OAAO;CACrE,OAAO,KAAK,iBAAiB,MAAM,KAAK,gBAAgB,OAAO;AACjE;AAEA,SAAS,cAAc,MAAc,IAAqB;CACxD,IAAI,SAAS,cAAc,MAAM,KAAK,CAAC;CACvC,OAAO,KAAK,YAAY,KAAK,SAAS,cAAc,MAAM,SAAS,CAAC;CACpE,MAAM,OAAO,KAAK;CAClB,MAAM,OAAO,WAAW,IAAI,IAAI,aAAa,MAAM,MAAM,IAAI;CAC7D,MAAM,aACJ,SAAS,UAAU,SAAS,UAAW,SAAS,OAAO,KAAK,SAAS,OAAO;CAC9E,MAAM,QAAQ,iBAAiB,MAAM,KAAK,gBAAgB;CAC1D,MAAM,OAAO,KAAK;CAClB,MAAM,OACJ,SAAS,OACT,SAAS,OACT,SAAS,OACT,SAAS,OACR,KAAK,WAAW,QAAQ,KAAK,KAAK,CAAC,WAAW,KAAK,QAAQ,EAAE;CAChE,OAAO,cAAc;AACvB;AAEA,SAAS,QAAQ,MAAc,MAAc,IAAoB;CAC/D,IAAI,QAAQ;CACZ,KAAK,IAAI,IAAI,KAAK,QAAQ,KAAK,IAAI,GAAG,IAAI,IAAI,KAC5C,IAAI,KAAK,OAAO,KAAK;MAChB,IAAI,KAAK,OAAO,OAAO,EAAE,UAAU,GAAG,OAAO,IAAI;CAExD,OAAO;AACT;AAQA,SAAS,YAAY,SAAkB,MAAc,IAA4B;CAC/E,MAAM,QAAwB,CAAC;CAC/B,KAAK,MAAM,QAAQ,QAAQ,KAAK,MAAM,MAAM,EAAE,CAAC,CAAC,SAAS,aAAa,GAAG;EACvE,MAAM,YAAY,OAAO,KAAK;EAC9B,IAAI,CAAC,oBAAoB,QAAQ,MAAM,SAAS,GAAG;EACnD,MAAM,QAAQ,WAAW,SAAS,WAAW,KAAK,EAAE;EACpD,IAAI,UAAU,IAAI,MAAM,KAAK;GAAE;GAAW;GAAO,KAAK,YAAY,KAAK,EAAE,CAAC;EAAO,CAAC;CACpF;CACA,OAAO;AACT;AAEA,SAAS,mBAAmB,MAAc,MAAuB;CAC/D,WAAW,YAAY;CACvB,KAAK,IAAI,OAAO,WAAW,KAAK,IAAI,GAAG,SAAS,MAAM,OAAO,WAAW,KAAK,IAAI,GAC/E,IAAI,KAAK,OAAO,UAAa,KAAK,OAAO,QAAW,OAAO;CAE7D,OAAO;AACT;AAEA,SAAS,gCACP,MACA,MACA,IACA,OACS;CACT,MAAM,SAAS,IAAI,IAAI,MAAM,KAAK,SAAS,KAAK,SAAS,CAAC;CAC1D,MAAM,UAAU,CAAC,KAAK;CACtB,KAAK,MAAM,SAAS,KAAK,MAAM,MAAM,EAAE,CAAC,CAAC,SAAS,kBAAkB,GAAG;EACrE,MAAM,KAAK,OAAO,MAAM;EACxB,IAAI,MAAM,OAAO,aACf;OAAI,CAAC,OAAO,IAAI,EAAE,KAAK,oBAAoB,MAAM,EAAE,KAAK,cAAc,MAAM,EAAE,GAC5E,QAAQ,QAAQ,SAAS,KAAK;EAChC,OACK,IAAI,MAAM,SAAS,MAAM,EAAE,GAChC,QAAQ,KAAK,KAAK;OACb,IAAI,QAAQ,SAAS,KAAK,QAAQ,IAAI,GAAG;GAC9C,QAAQ,QAAQ,SAAS,KAAK;GAC9B,IAAI,mBAAmB,MAAM,KAAK,CAAC,GAAG,OAAO;EAC/C;CACF;CACA,OAAO;AACT;AAEA,SAAgB,wBAAwB,OAAuB;CAC7D,MAAM,UAAU,KAAK,KAAK;CAC1B,MAAM,EAAE,SAAS,MAAM,SAAS;CAChC,MAAM,QAAgB,CAAC;CACvB,KAAK,MAAM,CAAC,MAAM,OAAO,gBAAgB,IAAI,GAAG;EAC9C,IAAI,kBAAkB,KAAK,MAAM,MAAM,EAAE,CAAC,GAAG;EAC7C,MAAM,QAAQ,YAAY,SAAS,MAAM,EAAE;EAC3C,IAAI,MAAM,WAAW,GAAG;EAExB,IAAI,gCAAgC,MADvB,QAAQ,MAAM,MAAM,EACY,GAAG,IAAI,KAAK,GAAG;EAC5D,KAAK,MAAM,EAAE,OAAO,SAAS,OAAO;GAClC,MAAM,WAAW,QAAQ,MAAM,OAAO,GAAG;GACzC,MAAM,KAAK;IACT;IACA;IACA,MAAM,OAAO,SAAS,OAAO,qBAAqB,sBAAsB,SAAS;GACnF,CAAC;EACH;CACF;CACA,OAAO,WAAW,OAAO,KAAK;AAChC;AAEA,SAAgB,2BAA2B,OAAuB;CAChE,MAAM,EAAE,SAAS,aAAa,UAAU,KAAK;CAC7C,MAAM,QAAgB,CAAC;CACvB,KAAK,MAAM,QAAQ,QAAQ,SAAS,gBAAgB,GAAG;EACrD,MAAM,MAAM,KAAK;EACjB,IAAI,CAAC,SAAS,KAAK,WAAW,QAAQ,UAAa,cAAc,IAAI,MAAM,GAAG,EAAE,CAAC,MAAM,MACrF,MAAM,KAAK;GAAE,OAAO,KAAK;GAAO,KAAK,KAAK,QAAQ,KAAK,EAAE,CAAC;GAAQ,MAAM,KAAK;EAAG,CAAC;CAErF;CACA,OAAO,WAAW,OAAO,KAAK;AAChC;;;;ACvPA,MAAM,cAAc;AACpB,MAAM,iBAAiB;AACvB,MAAM,mBAAmB;AACzB,MAAM,iBAAiB;AACvB,MAAM,cAAc;CAAC;CAAI;CAAS;CAAW;AAAW;AACxD,MAAM,UAAgB,EAAE,GAAG,UAAU;AACrC,MAAM,8BAAc,IAAI,IAAI,iBAAiB;AAC7C,MAAM,gCAAgB,IAAI,IAAI;CAAC;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;AAAI,CAAC;AACxE,MAAM,iBAAyC;CAC7C,GAAG;CACH,GAAG;CACH,GAAG;CACH,MAAM;CACN,KAAK;CACL,KAAK;CACL,MAAK;AACP;AACA,MAAM,mBAAmB;AACzB,MAAM,kBAAkB;AACxB,MAAM,QAAQ;AACd,MAAM,6BAA6B;AAEnC,SAAS,SAAS,MAAuB;CACvC,MAAM,SAAkB,CAAC;CACzB,IAAI,IAAI;CACR,OAAO,IAAI,KAAK,QAAQ;EACtB,MAAM,OAAO,KAAK;EAClB,IAAI,aAAa,IAAI,GACnB,KAAK;OACA,IAAI,SAAS,OAAO,KAAK,IAAI,OAAO,KACzC,OAAO,IAAI,KAAK,UAAU,KAAK,OAAO,QAAQ,KAAK,OAAO,MAAM,KAAK;OAChE,IAAI,SAAS,MAAK;GACvB,IAAI,MAAM,IAAI;GACd,OAAO,MAAM,KAAK,UAAU,KAAK,SAAS,MAAK,OAAO,KAAK,SAAS,OAAO,IAAI;GAC/E,IAAI,OAAO,KAAK,QAAQ,MAAM,IAAI,YAAY,qBAAqB;GACnE,MAAM,OAAO,KAAK,MAAM,IAAI,GAAG,GAAG;GAClC,IAAI,eAAe,KAAK,IAAI,GAAG,MAAM,IAAI,YAAY,mBAAmB;GACxE,OAAO,KAAK;IAAE,GAAG;IAAO,GAAG;GAAK,CAAC;GACjC,IAAI,MAAM;EACZ,OAAO,IAAI,iBAAiB,KAAK,IAAI,GAAG;GACtC,IAAI,MAAM,IAAI;GACd,OAAO,MAAM,KAAK,UAAU,gBAAgB,KAAK,KAAK,IAAI,GAAG,OAAO;GACpE,OAAO,KAAK;IAAE,GAAG;IAAM,GAAG,KAAK,MAAM,GAAG,GAAG;GAAE,CAAC;GAC9C,IAAI;EACN,OAAO,IAAI,MAAM,KAAK,IAAI,GAAG;GAC3B,IAAI,MAAM,IAAI;GACd,OAAO,MAAM,KAAK,UAAU,MAAM,KAAK,KAAK,IAAI,GAAG,OAAO;GAC1D,OAAO,KAAK;IAAE,GAAG;IAAO,GAAG,KAAK,MAAM,GAAG,GAAG;GAAE,CAAC;GAC/C,IAAI;EACN,OAAO,IAAI,cAAc,IAAI,KAAK,MAAM,GAAG,IAAI,CAAC,CAAC,GAAG;GAClD,OAAO,KAAK;IAAE,GAAG;IAAK,GAAG,KAAK,MAAM,GAAG,IAAI,CAAC;GAAE,CAAC;GAC/C,KAAK;EACP,OAAO,IAAI,YAAY,IAAI,IAAI,GAAG;GAChC,OAAO,KAAK;IAAE,GAAG;IAAK,GAAG;GAAK,CAAC;GAC/B,KAAK;EACP,OACE,MAAM,IAAI,YAAY,sBAAsB;CAEhD;CACA,OAAO;AACT;AAEA,SAAgB,kBAAkB,KAA4B;CAC5D,IAAI,MAAM;CACV,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK,GACnC,IAAI,IAAI,OAAO,MACb,OAAO,IAAI;MACN,IAAI,IAAI,IAAI,OAAO,OAAO,IAAI,IAAI,OAAO,KAAK;EACnD,MAAM,UAAU,kBAAkB,KAAK,IAAI,CAAC;EAC5C,IAAI,YAAY,QAAS,IAAI,IAAI,OAAO,OAAO,QAAQ,OAAO,gBAAiB,OAAO;EACtF,OAAO,OAAO,cAAc,QAAQ,IAAI;EACxC,KAAK,QAAQ;CACf,OAAO;EACL,MAAM,SAAS,eAAe,IAAI,IAAI;EACtC,IAAI,WAAW,QAAW,OAAO;EACjC,OAAO;EACP,KAAK;CACP;CAEF,OAAO;AACT;AAEA,IAAM,SAAN,MAAa;CAIkB;CAH7B,AAAQ,WAAW;CACnB,AAAQ,WAAW;CAEnB,YAAY,AAAiB,QAAiB;EAAjB;CAAkB;CAE/C,WAAiB;EACf,MAAM,aAAa,KAAK,WAAW,CAAC;EACpC,IAAI,KAAK,WAAW,KAAK,OAAO,QAAQ,MAAM,IAAI,YAAY,iBAAiB;EAC/E,OAAO,KAAK,WAAW,UAAU;CACnC;CAEA,AAAQ,OAA0B;EAChC,OAAO,KAAK,OAAO,KAAK;CAC1B;CAEA,AAAQ,GAAG,MAAkB,OAAwB;EACnD,MAAM,QAAQ,KAAK,KAAK;EACxB,OAAO,UAAU,UAAa,MAAM,MAAM,QAAQ,MAAM,MAAM;CAChE;CAEA,AAAQ,KAAK,MAAkB,OAAwB;EACrD,MAAM,QAAQ,KAAK,GAAG,MAAM,KAAK;EACjC,IAAI,OAAO,KAAK,YAAY;EAC5B,OAAO;CACT;CAEA,AAAQ,OAAO,MAAkB,OAAqB;EACpD,IAAI,CAAC,KAAK,KAAK,MAAM,KAAK,GAAG,MAAM,IAAI,YAAY,YAAY,OAAO;CACxE;CAEA,AAAQ,KAAK,MAAyB;EACpC,MAAM,QAAQ,KAAK,KAAK;EACxB,IAAI,UAAU,UAAa,MAAM,MAAM,MAAM,MAAM,IAAI,YAAY,YAAY,MAAM;EACrF,KAAK,YAAY;EACjB,OAAO;CACT;CAEA,AAAQ,WAAW,OAAqB;EACtC,IAAI,QAAQ,aAAa,MAAM,IAAI,YAAY,UAAU;EACzD,IAAI,KAAK,KAAK,MAAM,IAAI,GAAG;GACzB,MAAM,OAAO,KAAK,WAAW,QAAQ,CAAC;GACtC,KAAK,OAAO,MAAM,MAAM;GACxB,MAAM,OAAO,KAAK,WAAW,QAAQ,CAAC;GACtC,KAAK,OAAO,MAAM,MAAM;GACxB,OAAO;IAAE,GAAG;IAAM;IAAM;IAAM,WAAW,KAAK,WAAW,QAAQ,CAAC;GAAE;EACtE;EACA,OAAO,KAAK,MAAM,YAAY,KAAK,MAAM,YAAY,KAAK,SAAS,KAAK,CAAC,CAAC;CAC5E;CAEA,AAAQ,MAAM,UAAuB,SAA2B;EAC9D,MAAM,QAAQ,CAAC,QAAQ,CAAC;EACxB,OAAO,KAAK,KAAK,KAAK,QAAQ,GAAG,MAAM,KAAK,QAAQ,CAAC;EACrD,OAAO,MAAM,WAAW,IAAI,MAAM,KAAK;GAAE,GAAG,aAAa,OAAO,QAAQ;GAAM;EAAM;CACtF;CAEA,AAAQ,SAAS,OAAqB;EACpC,MAAM,OAAO,KAAK,SAAS,KAAK;EAChC,MAAM,QAAQ,KAAK,KAAK;EACxB,IAAI,UAAU,QAAW,OAAO;EAChC,IAAI,MAAM,MAAM,QAAQ,MAAM,MAAM,QAAQ,MAAM,MAAM,OAAO;GAC7D,KAAK,YAAY;GACjB,OAAO;IAAE,GAAG;IAAO,QAAQ,MAAM,MAAM;IAAM;IAAM,OAAO,KAAK,SAAS,KAAK;GAAE;EACjF;EACA,IAAI,MAAM,MAAM,OAAO;GAAC;GAAK;GAAM;GAAK;EAAI,CAAC,CAAC,SAAS,MAAM,CAAC,GAAG;GAC/D,KAAK,YAAY;GACjB,KAAK,SAAS,KAAK;GACnB,OAAO;EACT;EACA,IAAI,MAAM,MAAM,QAAQ,MAAM,MAAM,MAAM;GACxC,KAAK,YAAY;GACjB,KAAK,SAAS,KAAK;GACnB,OAAO;EACT;EACA,IAAI,MAAM,MAAM,QAAQ,MAAM,MAAM,QAAQ;GAC1C,KAAK,YAAY;GACjB,OAAO;IAAE,GAAG;IAAQ,SAAS;IAAM,SAAS,KAAK,KAAK,KAAK,CAAC,CAAC;GAAE;EACjE;EACA,IAAI,MAAM,MAAM,QAAQ,MAAM,MAAM,OAAO;GACzC,KAAK,YAAY;GACjB,KAAK,cAAc;GACnB,OAAO;EACT;EACA,IAAI,MAAM,MAAM,QAAQ,MAAM,MAAM,MAAM;GACxC,KAAK,YAAY;GACjB,KAAK,SAAS;GACd,IAAI,KAAK,KAAK,MAAM,IAAI,GAAG,KAAK,SAAS,KAAK;GAC9C,OAAO;EACT;EACA,OAAO;CACT;CAEA,AAAQ,gBAAsB;EAC5B,MAAM,QAAQ,KAAK,KAAK;EACxB,IAAI,UAAU,UAAc,MAAM,MAAM,QAAQ,MAAM,MAAM,OAC1D,MAAM,IAAI,YAAY,oBAAoB;EAE5C,KAAK,YAAY;EACjB,OAAO,KAAK,KAAK,KAAK,GAAG,GAAG;GAC1B,MAAM,OAAO,KAAK,KAAK;GACvB,IAAI,SAAS,UAAc,KAAK,MAAM,QAAQ,KAAK,MAAM,OACvD,MAAM,IAAI,YAAY,oBAAoB;GAE5C,KAAK,YAAY;EACnB;CACF;CAEA,AAAQ,WAAiB;EACvB,KAAK,KAAK,IAAI;EACd,OAAO,KAAK,KAAK,KAAK,IAAI,GAAG,KAAK,KAAK,IAAI;CAC7C;CAEA,AAAQ,SAAS,OAAqB;EACpC,IAAI,SAAS,KAAK,eAAe,KAAK;EACtC,OAAO,KAAK,GAAG,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,GAAG;GAC7C,KAAK,YAAY;GACjB,KAAK,eAAe,KAAK;GACzB,SAAS;EACX;EACA,OAAO;CACT;CAEA,AAAQ,eAAe,OAAqB;EAC1C,IAAI,SAAS,KAAK,MAAM,KAAK;EAC7B,OAAO,KAAK,KAAK,KAAK,GAAG,GAAG;GAC1B,KAAK,MAAM,KAAK;GAChB,SAAS;EACX;EACA,OAAO;CACT;CAEA,AAAQ,MAAM,OAAqB;EACjC,MAAM,WAAqB,CAAC;EAC5B,OAAO,KAAK,GAAG,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,GAAG;GAC7C,SAAS,KAAM,KAAK,KAAK,CAAC,CAAW,CAAC;GACtC,KAAK,YAAY;GACjB,IAAI,SAAS,SAAS,aAAa,MAAM,IAAI,YAAY,UAAU;EACrE;EACA,IAAI,SAAS,KAAK,OAAO,KAAK;EAC9B,KAAK,IAAI,IAAI,SAAS,SAAS,GAAG,KAAK,GAAG,KAAK,GAC7C,SAAS,SAAS,OAAO,MAAM;GAAE,GAAG;GAAO,SAAS;EAAO,IAAI;EAEjE,OAAO;CACT;CAEA,AAAQ,OAAO,OAAqB;EAClC,IAAI,SAAS,KAAK,QAAQ,KAAK;EAC/B,IAAI,QAAQ;EACZ,SAAS;GACP,IAAI,KAAK,KAAK,KAAK,GAAG,GAAG;IACvB,MAAM,SAAS,KAAK,KAAK,IAAI,CAAC,CAAC;IAC/B,IAAI,WAAW,UAAU,KAAK,WAAW;IACzC,SAAS,KAAK,GAAG,KAAK,GAAG,IACrB;KAAE,GAAG;KAAQ;KAAQ,UAAU;KAAQ,MAAM,KAAK,UAAU,KAAK;IAAE,IACnE,UAAU,QAAQ,MAAM;GAC9B,OAAO,IAAI,KAAK,KAAK,KAAK,GAAG,GAAG;IAC9B,MAAM,MAAM,KAAK,KAAK,KAAK,CAAC,CAAC;IAC7B,KAAK,OAAO,KAAK,GAAG;IACpB,SAAS,UAAU,QAAQ,kBAAkB,GAAG,CAAC;GACnD,OACE,OAAO;GAET,SAAS;GACT,IAAI,QAAQ,aAAa,MAAM,IAAI,YAAY,UAAU;EAC3D;CACF;CAEA,AAAQ,UAAU,OAAuB;EACvC,KAAK,OAAO,KAAK,GAAG;EACpB,OAAO,KAAK,KAAK,KAAK,QAAQ,CAAC;CACjC;CAEA,AAAQ,KAAK,OAAe,OAAuB;EACjD,MAAM,QAAgB,CAAC;EACvB,OAAO,CAAC,KAAK,KAAK,KAAK,KAAK,GAAG;GAC7B,MAAM,KAAK,KAAK,WAAW,KAAK,CAAC;GACjC,IAAI,CAAC,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,OAAO,KAAK,GAAG;EAChD;EACA,OAAO;CACT;CAEA,AAAQ,QAAQ,OAAqB;EACnC,MAAM,QAAQ,KAAK,KAAK;EACxB,IAAI,UAAU,QAAW,MAAM,IAAI,YAAY,gBAAgB;EAC/D,KAAK,YAAY;EACjB,IAAI,MAAM,MAAM,OAAO,OAAO;GAAE,GAAG;GAAO,KAAK,MAAM;EAAE;EACvD,IAAI,MAAM,MAAM,OAAO,OAAO;EAC9B,IAAI,MAAM,MAAM,MAAM;GACpB,IAAI,MAAM,MAAM,UAAU,MAAM,MAAM,SAAS,OAAO;IAAE,GAAG;IAAO,GAAG,MAAM,MAAM;GAAO;GACxF,IAAI;IAAC;IAAa;IAAY;IAAU;GAAS,CAAC,CAAC,SAAS,MAAM,CAAC,GACjE,OAAO;IAAE,GAAG;IAAO,MAAM,MAAM;GAAE;GAEnC,OAAO,KAAK,KAAK,KAAK,IAAI,GAAG;IAC3B,IAAI,KAAK,KAAK,CAAC,EAAE,MAAM,OAAO;KAC5B,KAAK,YAAY;KACjB,OAAO;IACT;IACA,KAAK,KAAK,IAAI;GAChB;GACA,IAAI,KAAK,GAAG,KAAK,GAAG,GAAG,KAAK,UAAU,KAAK;GAC3C,OAAO;EACT;EACA,IAAI,MAAM,MAAM,KAAK;GACnB,MAAM,QAAQ,KAAK,WAAW,QAAQ,CAAC;GACvC,KAAK,OAAO,KAAK,GAAG;GACpB,OAAO;EACT;EACA,IAAI,MAAM,MAAM,KAAK,OAAO;GAAE,GAAG;GAAO,OAAO,KAAK,KAAK,KAAK,QAAQ,CAAC;EAAE;EACzE,IAAI,MAAM,MAAM,KAAK;GACnB,OAAO,CAAC,KAAK,KAAK,KAAK,GAAG,GAAG;IAC3B,MAAM,MAAM,KAAK,KAAK;IACtB,IAAI,QAAQ,UAAc,IAAI,MAAM,QAAQ,IAAI,MAAM,OACpD,MAAM,IAAI,YAAY,cAAc;IAEtC,KAAK,YAAY;IACjB,KAAK,OAAO,KAAK,GAAG;IACpB,KAAK,WAAW,QAAQ,CAAC;IACzB,IAAI,CAAC,KAAK,GAAG,KAAK,GAAG,GAAG,KAAK,OAAO,KAAK,GAAG;GAC9C;GACA,OAAO;EACT;EACA,MAAM,IAAI,YAAY,kBAAkB;CAC1C;AACF;AAEA,SAAS,UAAU,QAAc,MAA2B;CAC1D,IAAI,OAAO,MAAM,SAAS,SAAS,MAAM,OAAO;CAChD,IAAI,OAAO,SAAS,gBAAgB,SAAS,cAAc,SAAS,SAClE,OAAO,EAAE,GAAG,KAAK;CAEnB,OAAO,OAAO,SAAS,cAAc,SAAS,SAAS,EAAE,GAAG,OAAO,IAAI;AACzE;AAIA,MAAa,mBAAmB,SAAuB,IAAI,OAAO,SAAS,IAAI,CAAC,CAAC,CAAC,SAAS;AAE3F,MAAM,SAAS,UAAyB,QAAQ,QAAQ;AACxD,MAAM,UAAU,UAAqB,UAAU,UAAU,UAAU,UAAU,QAAQ,OAAO;AAE5F,MAAM,+BAAe,IAAI,QAAqB;AAE9C,SAAS,QAAQ,MAAY,OAAwB,MAAqB;CACxE,QAAQ,KAAK,GAAb;EACE,KAAK,OAAO;GACV,MAAM,UAAU,kBAAkB,KAAK,GAAG;GAC1C,OAAO,YAAY,OAAO,EAAE,GAAG,UAAU,IAAI;IAAE,GAAG;IAAO,GAAG;GAAQ;EACtE;EACA,KAAK,YACH,OAAO;GAAE,GAAG;GAAO,GAAG;EAAK;EAC7B,KAAK,QACH,OAAO,MAAM,SAAS,SAAY,EAAE,GAAG,UAAU,IAAI;GAAE,GAAG;GAAO,GAAG,MAAM;EAAK;EACjF,KAAK,QACH,OAAO,EAAE,GAAG,OAAO;EACrB,KAAK,OAAO;GACV,MAAM,QAAQ,aAAa,IAAI,IAAI;GACnC,IAAI,UAAU,QAAW,OAAO;GAChC,MAAM,QAAQ,KAAK,MAAM,KAAK,SAAS,QAAQ,MAAM,OAAO,IAAI,CAAC;GACjE,MAAM,QAAe,MAAM,MAAM,SAAS,KAAK,MAAM,KAAK,IACtD,EAAE,GAAG,UAAU,IACf;IAAE,GAAG;IAAO;GAAM;GACtB,IAAI,KAAK,MAAM,OAAO,SAAS,KAAK,MAAM,KAAK,GAAG,aAAa,IAAI,MAAM,KAAK;GAC9E,OAAO;EACT;EACA,KAAK,MAAM;GACT,MAAM,OAAO,mBAAmB,KAAK,MAAM,KAAK;GAChD,IAAI,SAAS,SAAS,OAAO,EAAE,GAAG,UAAU;GAC5C,OAAO,QAAQ,SAAS,QAAQ,KAAK,OAAO,KAAK,WAAW,OAAO,IAAI;EACzE;EACA,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK,QACH,OAAO;GAAE,GAAG;GAAO,GAAG,mBAAmB,MAAM,KAAK;EAAE;EACxD,SACE,OAAO,EAAE,GAAG,UAAU;CAC1B;AACF;AAEA,SAAS,UAAU,MAAa,OAAmB;CACjD,IAAI,KAAK,MAAM,aAAa,MAAM,MAAM,WAAW,OAAO;CAC1D,IAAI,KAAK,MAAM,UAAU,MAAM,MAAM,QAAQ;EAC3C,MAAM,QAAQ,KAAK,MAAM,SAAS,QAAQ;EAC1C,IAAI,MAAM,MAAM,OAAO,OAAO,MAAM,MAAM,SAAS,UAAU;EAC7D,OAAO,YAAY,SAAS,MAAM,EAAE,KAAK,CAAC,CAAC,YAAY,CAAC,IAAI,UAAU;CACxE;CACA,IAAI,KAAK,MAAM,SAAS,MAAM,MAAM,OAClC,OAAO,KAAK,MAAM,WAAW,MAAM,MAAM,UAAU,UAAU,MAAM,KAAK,MAAM,MAAM,CAAC;CAEvF,IAAI,KAAK,MAAM,SAAS,MAAM,MAAM,OAAO,OAAO;CAClD,IAAI,KAAK,MAAM,SAAS,MAAM,MAAM,OAAO,OAAO,MAAM,KAAK,MAAM,MAAM,CAAC;CAC1E,IAAI,KAAK,MAAM,SAAS,MAAM,MAAM,OAAO;EACzC,MAAM,CAAC,WAAW,cAAc,CAAC,WAAW,KAAK,KAAK,GAAG,WAAW,MAAM,KAAK,CAAC;EAChF,IAAI,UAAU,QAAQ,WAAW,MAC/B,OAAO,MACL,UAAU,QAAQ,SAAS,WAAW,QAAQ,QAAQ,SAAS,WAAW,UAAU,CACtF;EAEF,MAAM,UAAU,MAAe,SAAuB;GACpD,MAAM,QAAQ,WAAW,IAAI;GAC7B,OAAO,QACL,KAAK,KAAK,SAAS,OAAO,MAAM,KAAK,CAAC,GACtC,KACF;EACF;EACA,OAAO,QAAQ,CAAC,OAAO,KAAK,OAAO,MAAM,KAAK,GAAG,OAAO,MAAM,OAAO,KAAK,KAAK,CAAC,GAAG,KAAK;CAC1F;CACA,OAAO;AACT;AAQA,SAAS,SAAS,OAAgB,OAAyB;CACzD,KAAK,MAAM,SAAS,MAAM,SAAS,IAAI,CAAC,MAAM,QAAQ,IAAI,KAAK,GAAG,OAAO;CACzE,OAAO;AACT;AAEA,SAAS,SAAS,MAAe,OAAyB;CACxD,MAAM,CAAC,OAAO,SAAS,KAAK,QAAQ,QAAQ,MAAM,QAAQ,OAAO,CAAC,MAAM,KAAK,IAAI,CAAC,OAAO,IAAI;CAC7F,KAAK,MAAM,SAAS,MAAM,SAAS,IAAI,MAAM,QAAQ,IAAI,KAAK,GAAG,OAAO;CACxE,OAAO;AACT;AAEA,MAAM,0BAAU,IAAI,QAA0B;AAE9C,SAAS,WAAW,OAAyB;CAC3C,MAAM,QAAQ,QAAQ,IAAI,KAAK;CAC/B,IAAI,UAAU,QAAW,OAAO;CAChC,MAAM,QAAQ,WAAW,KAAK;CAC9B,QAAQ,IAAI,OAAO,KAAK;CACxB,OAAO;AACT;AAEA,SAAS,WAAW,OAAyB;CAC3C,MAAM,0BAAU,IAAI,IAAY;CAChC,MAAM,kCAAkB,IAAI,IAAmB;CAC/C,KAAK,MAAM,QAAQ,OACjB,IAAI,KAAK,MAAM,OAAO;EACpB,QAAQ,IAAI,KAAK,CAAC;EAClB,gBAAgB,IACd,YAAY,SAAS,KAAK,EAAE,KAAK,CAAC,CAAC,YAAY,CAAC,IAAI,UAAU,OAC9D,IACF;CACF,OACE,gBAAgB,IAAI,KAAK,MAAM,QAAQ,OAAO,KAAK,MAAM,KAAK,GAAG,IAAI;CAGzE,OAAO;EACL;EACA,iBAAiB,CAAC,GAAG,gBAAgB,OAAO,CAAC;EAC7C,MAAM,MAAM,OAAO,SAAS,KAAK,MAAM,KAAK;CAC9C;AACF;AAEA,SAAS,OAAO,MAAa,OAAqB;CAChD,IAAI,KAAK,MAAM,SAAS,MAAM,QAAQ,IAAI,KAAK,CAAC,GAAG,OAAO;CAC1D,OAAO,QACL,MAAM,gBAAgB,KAAK,cAAc,UAAU,MAAM,SAAS,CAAC,GACnE,IACF;AACF;AAEA,SAAS,QAAQ,SAAgB,IAAuB;CACtD,MAAM,WAAgB,OAAO,QAAQ,OAAO;CAC5C,IAAI,QAAQ,SAAS,QAAQ,GAAG,OAAO;CACvC,OAAO,QAAQ,SAAS,OAAO,IAAI,UAAU,OAAO,QAAQ;AAC9D;AAEA,SAAS,QAAQ,QAAgB,UAAiB,MAAoB;CACpE,IAAI,SAAS,MAAM,OAAO,OAAO;CACjC,IAAI,WAAW,aAAa,KAAK,WAAW,GAAG,OAAO,MAAM,SAAS,MAAM,WAAW,CAAC;CACvF,MAAM,CAAC,YAAY;CACnB,IAAI,KAAK,WAAW,GAAG,OAAO;CAC9B,MAAM,QAAQ,WAAW,SAAS,KAAK;CACvC,IAAI,WAAW,YAAY,OAAO,OAAO,UAAU,KAAK;CACxD,IAAI,SAAS,MAAM,OAAO,OAAO;CACjC,IAAI,WAAW,iBAAiB,WAAW,eAAe;EACxD,MAAM,QAAQ,WAAW,SAAS,KAAK;EACvC,IAAI,MAAM,QAAQ,MAAM,MACtB,OAAO,MACL,WAAW,gBACP,SAAS,OAAO,KAAK,IACrB,MAAM,QAAQ,QAAQ,MAAM,QAAQ,QAAQ,SAAS,OAAO,KAAK,CACvE;EAEF,OAAO,QACL,SAAS,MAAM,KAAK,SAAS,OAAO,MAAM,KAAK,CAAC,GAChD,WAAW,gBAAgB,OAAO,KACpC;CACF;CACA,OAAO;AACT;AAEA,MAAM,UAAU,SACd,KAAK,MAAM,QACP,KAAK,MAAM,QAAQ,MAAM,IACzB,KAAK,MAAM,OACT,CAAC,GAAG,OAAO,KAAK,IAAI,GAAG,GAAG,OAAO,KAAK,SAAS,CAAC,IAChD,CAAC,IAAI;AAEb,SAAS,QAAQ,OAAyB;CACxC,MAAM,QAAkB,CAAC;CACzB,KAAK,MAAM,QAAQ,MAAM,QAAQ,MAAM,GAAG;EACxC,MAAM,UAAU,KAAK,MAAM,QAAQ,kBAAkB,KAAK,GAAG,IAAI;EACjE,IAAI,YAAY,MAAM,MAAM,KAAK,OAAO;CAC1C;CACA,OAAO;AACT;AAEA,MAAM,iBAAiB,UACrB,MAAM,QAAQ,MAAM,CAAC,CAAC,MAAM,SAAS,KAAK,MAAM,UAAU;AAO5D,MAAM,+BAAe,IAAI,QAAuB;AAEhD,SAAS,UAAU,MAAqD;CACtE,IAAI,UAAU,aAAa,IAAI,IAAI;CACnC,IAAI,YAAY,QAAW;EACzB,MAAM,QAAQ,KAAK,MAAM,QAAQ,CAAC,KAAK,MAAM,KAAK,KAAK,IAAI,CAAC,KAAK,UAAU,GAAG,KAAK,IAAI;EACvF,UAAU;GAAE,OAAO,cAAc,KAAK;GAAG,OAAO,IAAI,IAAI,QAAQ,KAAK,CAAC;EAAE;EACxE,aAAa,IAAI,MAAM,OAAO;CAChC;CACA,OAAO;AACT;AAEA,SAAS,SACP,MACA,MACS;CACT,IAAI,SAAS,QAAW,OAAO;CAC/B,IAAI,KAAK,MAAM,QAAQ;EACrB,MAAM,WAAW,kBAAkB,KAAK,OAAO;EAC/C,OACE,cAAc,CAAC,KAAK,OAAO,CAAC,KAC5B,SAAS,MAAM,YAAY,QAAQ,SAAS,IAAI,CAAC,KACjD,YAAY,UAAU,IAAI;CAE9B;CACA,MAAM,EAAE,OAAO,UAAU,UAAU,IAAI;CACvC,OAAO,SAAS,MAAM,IAAI,IAAI;AAChC;AAEA,MAAM,UACJ,MACA,UACY,SAAS,MAAM,MAAM,OAAO,IAAI,mBAAmB,MAAM;AAEvE,SAAgB,mBAAmB,MAAY,OAA6B;CAC1E,QAAQ,KAAK,GAAb;EACE,KAAK,OACH,OAAO,MAAM,KAAK,CAAC;EACrB,KAAK,OACH,OAAO,OAAO,mBAAmB,KAAK,SAAS,KAAK,CAAC;EACvD,KAAK;EACL,KAAK,MACH,OAAO,QACL,KAAK,MAAM,KAAK,SAAS,mBAAmB,MAAM,KAAK,CAAC,GACxD,KAAK,CACP;EACF,KAAK,MAAM;GACT,MAAM,OAAO,mBAAmB,KAAK,MAAM,KAAK;GAChD,IAAI,SAAS,SACX,OAAO,mBAAmB,SAAS,QAAQ,KAAK,OAAO,KAAK,WAAW,KAAK;GAC9E,MAAM,CAAC,MAAM,aAAa,CAAC,KAAK,MAAM,KAAK,SAAS,CAAC,CAAC,KAAK,WACzD,mBAAmB,QAAQ,KAAK,CAClC;GACA,OAAO,SAAS,YAAY,OAAO;EACrC;EACA,KAAK,OAAO;GACV,MAAM,OAAO,OAAO,MAAM,KAAK;GAC/B,MAAM,OAAO,UAAU,QAAQ,KAAK,MAAM,OAAO,IAAI,GAAG,QAAQ,KAAK,OAAO,OAAO,IAAI,CAAC;GACxF,OAAO,KAAK,SAAS,OAAO,OAAO,IAAI;EACzC;EACA,KAAK,QAAQ;GACX,MAAM,UAAU,QAAQ,KAAK,SAAS,OAAO,OAAO,MAAM,KAAK,CAAC;GAChE,IAAI,2BAA2B,KAAK,KAAK,OAAO,GAAG,OAAO;GAC1D,MAAM,WAAW,kBAAkB,KAAK,OAAO;GAC/C,IAAI,QAAQ,MAAM,QAChB,OAAO,YAAY,MAAM,cAAc,YAAY,UAAU,SAAS,CAAC,IAAI,UAAU;GAEvF,IAAI,QAAQ,MAAM,OAAO,OAAO;GAChC,OAAO,MAAM,YAAY,UAAU,QAAQ,CAAC,CAAC;EAC/C;EACA,KAAK,QAAQ;GACX,MAAM,OAAO,OAAO,MAAM,KAAK;GAC/B,OAAO,QACL,KAAK,QACL,QAAQ,KAAK,UAAU,OAAO,IAAI,GAClC,KAAK,KAAK,KAAK,QAAQ,QAAQ,KAAK,OAAO,IAAI,CAAC,CAClD;EACF;EACA,SACE,OAAO;CACX;AACF;;;;ACzlBA,MAAa,gBAAuC,CAAC,SAAS,oBAAoB;AA0BlF,MAAM,yBAAyB;AAC/B,MAAM,IAAI;AACV,MAAM,OAAO,IAAI,OAAO,qBAAqB,EAAE,OAAO,GAAG;AACzD,MAAM,oBAAoB,MAAc,UAA2B;CACjE,IAAI,WAAW,QAAQ;CACvB,OAAO,YAAY,KAAK,aAAa,KAAK,SAAS,GAAG,YAAY;CAClE,OAAO,KAAK,cAAc;AAC5B;AACA,MAAM,aAAa,MAAc,SAAyB;CACxD,IAAI,QAAQ;CACZ,OAAO,QAAQ,KAAK,UAAU,aAAa,KAAK,MAAM,GAAG,SAAS;CAClE,OAAO;AACT;AAEA,MAAM,eACJ,MACA,SAC0D;CAC1D,MAAM,eAAe,UAAU,MAAM,IAAI;CACzC,MAAM,OAAO,KAAK,WAAW,QAAQ,YAAY,IAC7C,SACA,KAAK,WAAW,UAAU,YAAY,IACpC,WACA;CACN,IAAI,SAAS,MAAM,OAAO;CAC1B,MAAM,YAAY,UAAU,MAAM,eAAe,KAAK,MAAM;CAC5D,OAAO,KAAK,eAAe,MAAM;EAAE;EAAM;CAAU,IAAI;AACzD;AACA,SAAS,SAAS,MAAc,WAAmB,MAAc,OAAuB;CACtF,IAAI,QAAQ;CACZ,KAAK,IAAI,IAAI,WAAW,IAAI,KAAK,QAAQ,KACvC,IAAI,KAAK,OAAO,MAAM;MACjB,IAAI,KAAK,OAAO,OAAO;EAC1B;EACA,IAAI,UAAU,GAAG,OAAO;CAC1B;CAEF,OAAO;AACT;AAEA,SAAgB,qBAAqB,OAAiC;CACpE,MAAM,EAAE,SAAS,SAAS,UAAU,KAAK;CACzC,MAAM,aAA+B,CAAC;CACtC,MAAM,QAAQ,IAAI,OAAO,KAAK,QAAQ,GAAG;CACzC,IAAI,cAAc;CAClB,IAAI,QAAQ,MAAM,KAAK,IAAI;CAC3B,OAAO,UAAU,MAAM;EACrB,IAAI,iBAAiB,MAAM,MAAM,KAAK,GAAG;GACvC,QAAQ,MAAM,KAAK,IAAI;GACvB;EACF;EACA,MAAM,OAAO,MAAM,QAAQ,MAAM,EAAE,CAAC,SAAS;EAC7C,MAAM,WAAW,SAAS,MAAM,MAAM,KAAK,GAAG;EAC9C,IAAI,WAAW,GAAG;EAClB,MAAM,aAA+B,CAAC;EACtC,IAAI,WAAW,WAAW;EAC1B,SAAS;GACP,MAAM,YAAY,YAAY,MAAM,QAAQ;GAC5C,IAAI,cAAc,MAAM;GACxB,MAAM,aAAa,SAAS,MAAM,UAAU,WAAW,KAAK,GAAG;GAC/D,IAAI,aAAa,GAAG;IAClB,WAAW,KAAK;IAChB;GACF;GACA,WAAW,KAAK;IACd,MAAM,UAAU;IAChB,MAAM,QAAQ,MAAM,UAAU,YAAY,GAAG,UAAU;GACzD,CAAC;GACD,WAAW,aAAa;EAC1B;EACA,MAAM,eAAe,UAAU,MAAM,QAAQ;EAC7C,MAAM,MAAM,KAAK,kBAAkB,MAAM,eAAe,IAAI;EAC5D,WAAW,KAAK;GACd,QAAQ,MAAM;GACd,YAAY,KAAK,IAAI,UAAU,OAAO,WAAW,GAAG,MAAM,KAAK;GAC/D,OAAO,MAAM;GACb;GACA,MAAM,QAAQ,MAAM,MAAM,OAAO,GAAG;GACpC,OAAO,QAAQ,MAAM,OAAO,GAAG,QAAQ;GACvC;GACA,aAAa,QAAQ,MAAM,aAAa,MAAM,KAAK;EACrD,CAAC;EACD,cAAc;EACd,MAAM,YAAY;EAClB,QAAQ,MAAM,KAAK,IAAI;CACzB;CACA,OAAO;AACT;AAEA,MAAM,YAAY,IAAI,OAAO,IAAI,EAAE,OAAO,EAAE,GAAG;AAC/C,MAAM,mBAAmB,IAAI,OAAO,eAAe,EAAE,IAAI;AACzD,MAAM,YAAY,IAAI,OAAO,KAAK,EAAE,2BAA2B,GAAG;AAClE,MAAM,UAAU,IAAI,OAAO,QAAQ,EAAE,WAAW;AAChD,MAAM,gBAAgB,IAAI,OAAO,SAAS,EAAE,0BAA0B,EAAE,OAAO,GAAG;AAElF,SAAS,eAAe,OAAoB;CAC1C,MAAM,EAAE,SAAS,SAAS,UAAU,KAAK;CACzC,IAAI,QAAQ;CACZ,IAAI,MAAM,KAAK;CACf,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;EACpC,MAAM,OAAO,KAAK;EAClB,IAAI,SAAS,OAAO,SAAS,OAAO,SAAS,KAAK;OAC7C,IAAI,SAAS,OAAO,SAAS,OAAO,SAAS,KAAK;OAClD,IAAI,SAAS,OAAO,UAAU,GAAG;GACpC,MAAM;GACN;EACF;CACF;CACA,MAAM,OAAO,QAAQ,MAAM,GAAG,GAAG;CACjC,MAAM,SAAS,KAAK,MAAM,GAAG,GAAG;CAChC,IAAI,iBAAiB,KAAK,MAAM,KAAK,SAAS,KAAK,MAAM,GAEvD,OADY,MAAM,KAAK,KAAK,SAAS,SAAS,IAAI,MAAM,kBAAkB,EAAE,EAAE,CACrE,CAAC,CAAC,MAAM,OAAO,OAAO,QAAQ,OAAO,sBAAsB,IAAI,UAAU;CAEpF,MAAM,SAAS,QAAQ,KAAK,MAAM;CAClC,IAAI,QAAQ,OAAO,OAAO,EAAE,CAAC,MAAM,IAAI,CAAC,CAAC,IAAI,MAAM,UAAU,UAAU;CACvE,OAAO;AACT;AAWA,MAAM,2BAAW,IAAI,QAAkC;AAEvD,SAAS,gBAAgB,MAAsC;CAC7D,IAAI;EACF,OAAO,gBAAgB,IAAI;CAC7B,QAAQ;EACN,OAAO;CACT;AACF;AAEA,SAAS,YAAY,WAAkD;CACrE,OAAO;EACL,OAAO,eAAe,UAAU,KAAK;EACrC,YAAY,UAAU,WAAW,KAAK,EAAE,MAAM,YAAY;GACxD;GACA,MAAM,gBAAgB,IAAI;EAC5B,EAAE;CACJ;AACF;AAEA,SAAS,WAAW,WAAqC;CACvD,IAAI,QAAQ,SAAS,IAAI,SAAS;CAClC,IAAI,UAAU,QAAW;EACvB,MAAM,QAAQ,gBAAgB,UAAU,IAAI;EAC5C,QAAQ;GACN,iBAAiB;GACjB,aAAa,CAAC,SAAS,wBAAwB,UAAU,IAAI,MAAM,UAAU;GAC7E,WAAW,YAAY,SAAS;EAClC;EACA,SAAS,IAAI,WAAW,KAAK;CAC/B;CACA,OAAO;AACT;AAEA,SAAgB,iBAAiB,WAA2B,OAAuB;CACjF,MAAM,EAAE,aAAa,cAAc,WAAW,SAAS;CACvD,MAAM,OACJ,MAAM,8BAAqC,cACvC;EAAE,GAAG;EAAO,UAAU;CAAQ,IAC9B;CACN,MAAM,YAAY;EAChB,UAAU,KAAK;EACf,MAAM,KAAK;EACX,SAAS,MAAM,iBAAiB,KAAK,WAAW;CAClD;CACA,IAAI,UAAU,UAAU,MAAM,OAAO;CACrC,KAAK,MAAM,EAAE,MAAM,UAAU,UAAU,YAAY;EACjD,MAAM,SAAS,SAAS,OAAO,UAAU,mBAAmB,MAAM,SAAS;EAC3E,IAAI,SAAS,UAAU,WAAW,MAAM,OAAO;EAC/C,IAAI,SAAS,YAAY,WAAW,OAAO,OAAO;CACpD;CACA,OAAO;AACT;AAEA,SAAS,yBACP,WACA,OACA,MACS;CACT,OACE,iBAAiB,WAAW;EAAE,UAAU;EAAO;CAAK,CAAC,KACrD,CAAC,iBAAiB,WAAW;EAAE,UAAU;EAAO;EAAM,gBAAgB;CAAK,CAAC;AAEhF;AAEA,SAAgB,YAAY,WAA+C;CAIzE,OAHgB,MAAM,KAAK,UAAU,YAAY,SAAS,aAAa,IAAI,MACzE,oBAAoB,EAAE,EAAE,CAEb,CAAC,CAAC,GAAG,EAAE;AACtB;AAQA,IAAI;AACJ,IAAI,aAA6D;CAAE,MAAM;CAAI,YAAY,CAAC;AAAE;AAE5F,SAAS,SAAS,OAA+D;CAC/E,IAAI,aAAa,OAAO;EACtB,MAAM,OAAO,2BAA2B,KAAK;EAC7C,aAAa;GAAE;GAAM,YAAY,qBAAqB,IAAI;EAAE;EAC5D,WAAW;CACb;CACA,OAAO;AACT;AAQA,SAAgB,mBAAmB,OAAoC;CACrE,MAAM,EAAE,MAAM,eAAe,SAAS,KAAK;CAC3C,OAAO;EACL,eAAe,MAAM;GACnB,MAAM,QAA0B,CAAC;GACjC,IAAI,OAAO;GACX,IAAI,UAAU;GACd,KAAK,MAAM,aAAa,YAAY;IAClC,IAAI,UAAU,WAAW,UAAU;IACnC,MAAM,UAAU,cAAc,QAC3B,UACC,iBAAiB,WAAW;KAAE,UAAU;KAAO;IAAK,CAAC,KACrD,CAAC,yBAAyB,WAAW,OAAO,IAAI,CACpD;IACA,IAAI,QAAQ,SAAS,GAAG;KACtB,OAAO,UAAU,UAAU,YAAY,WACrC,IAAI,KAAK,WAAW,OAAO,MAAM,IAAI;KAEvC,MAAM,KAAK;MAAE;MAAW;MAAS;KAAK,CAAC;IACzC;GACF;GACA,OAAO;EACT;EACA,gBAAgB,MAAM,OAAO;GAC3B,OAAO,WAAW,QACf,cACC,UAAU,WAAW,aACpB,2BAAkC,WAAW,SAAS,CAAC,CAAC,oBACzD,yBAAyB,WAAW,OAAO,IAAI,CACnD;EACF;EACA,sBAAsB;GACpB,OAAO,WAAW,SAAS,KAAK,CAAC,WAAW,KAAK,gBAAgB;EACnE;CACF;AACF;AAEA,MAAa,4BAA4B,OAAe,SACtD,mBAAmB,KAAK,CAAC,CAAC,eAAe,IAAI;AAE/C,MAAa,uBAAuB,UAClC,mBAAmB,KAAK,CAAC,CAAC,oBAAoB;AAEhD,SAAS,iBAAiB,WAAoC;CAC5D,OACE,UAAU,WAAW,YACrB,eAAe,UAAU,KAAK,MAAM,SACpC,UAAU,WAAW,OAClB,cAAc,UAAU,SAAS,UAAU,UAAU,KAAK,UAAU,IAAI,CAC3E;AAEJ;;;;;;;;;;;;;;;;AC1SA,MAAM,eAAe,IAAI,OAAO,SAAS,kBAAkB,KAAK;;;;;;AAehE,SAAgB,aAAa,OAAe,SAAiC;CAC3E,IAAI,SAAS,SAAS,UAAa,CAAC,iBAAiB,OAAO,QAAQ,IAAI,GAAG,OAAO;CAClF,IAAI,SAAS,SAAS,UAAa,CAAC,qBAAqB,OAAO,kBAAkB,QAAQ,IAAI,GAC5F,OAAO;CAET,IAAI,SAAS,aAAa,QACxB;MAAI,CAAC,qBAAqB,OAAO,sBAAsB,aAAa,OAAO,QAAQ,QAAQ,CAAC,GAC1F,OAAO;CACT;CAEF,OAAO;AACT;AAEA,SAAS,aAAa,OAAe,UAA0B;CAC7D,IAAI,4BAAmC,OAAO;CAC9C,MAAM,WAAW,2BAA2B,KAAK;CACjD,OAAO,wBAAwB,QAAQ,MAAM,WAAW,UAAU;AACpE;;;;;AAMA,SAAS,mBAAmB,MAAwB;CAClD,OAAO,MAAM,KACX,KAAK,SAAS,uBAAuB,gCAAgC,GAAG,CAAC,IACxE,MAAM,oBAAoB,EAAE,EAAE,CACjC;AACF;;;;;;;;;;;AAYA,SAAgB,oBAAoB,OAAyB;CAC3D,OAAO,mBAAmB,KAAK;AACjC;;;;;;;;;;;;;;;;;;;AAoBA,SAAS,gBAAgB,OAAyD;CAChF,MAAM,cAAc,MAAM,OAAO,YAAY;CAC7C,IAAI,gBAAgB,IAAI,OAAO;EAAE,UAAU;EAAO,YAAY;CAAG;CACjE,MAAM,iBAAiB,MAAM,QAAQ,KAAK,WAAW;CACrD,MAAM,kBAAkB,MAAM,QAAQ,KAAK,iBAAiB,CAAC;CAC7D,IAAI,oBAAoB,IAAI,OAAO;EAAE,UAAU;EAAO,YAAY;CAAG;CACrE,OAAO;EACL,UAAU,MAAM,MAAM,GAAG,WAAW;EACpC,YAAY,MAAM,MAAM,iBAAiB,GAAG,eAAe;CAC7D;AACF;;;;;;;;;;;;;AAcA,SAAgB,iBAAiB,OAAe,MAAuB;CACrE,MAAM,EAAE,UAAU,eAAe,gBAAgB,KAAK;CAEtD,IADuB,mBAAmB,UACzB,CAAC,CAAC,MAAM,YAAY,mBAAmB,SAAS,IAAI,CAAC,GAAG,OAAO;CAChF,MAAM,eAAe,mBAAmB,QAAQ;CAChD,IAAI,aAAa,WAAW,GAAG,OAAO;CACtC,OAAO,aAAa,MAAM,YAAY,mBAAmB,SAAS,IAAI,CAAC;AACzE;;AAGA,SAAgB,aAAa,GAAmB;CAC9C,OAAO,EAAE,QAAQ,uBAAuB,MAAM;AAChD;;;;;;AAOA,SAAgB,iBAAiB,OAAyB;CACxD,OAAO,MACJ,MAAM,SAAS,CAAC,CAChB,KAAK,MAAM,EAAE,KAAK,CAAC,CAAC,CACpB,QAAQ,MAAM,EAAE,SAAS,CAAC;AAC/B;;;;;AAMA,SAAgB,sBAAsB,OAAe,MAAwB;CAC3E,MAAM,IAAI,aAAa,IAAI;CAC3B,OAAO,MAAM,KAAK,MAAM,SAAS,uBAAuB,GAAG,EAAE,OAAO,GAAG,CAAC,IAAI,MAC1E,oBAAoB,EAAE,EAAE,CAC1B;AACF;;;;;AAMA,SAAgB,uBAAuB,OAAe,MAAwB;CAC5E,MAAM,IAAI,aAAa,IAAI;CAC3B,OAAO,MAAM,KAAK,MAAM,SAAS,uBAAuB,GAAG,EAAE,OAAO,GAAG,CAAC,IAAI,MAC1E,oBAAoB,EAAE,EAAE,CAC1B;AACF;;;;;;AAOA,SAAgB,qBAAqB,OAAe,MAAc,OAAwB;CACxF,MAAM,KAAK,sBAAsB,OAAO,IAAI;CAE5C,IADY,uBAAuB,OAAO,IACpC,CAAC,CAAC,SAAS,KAAK,GAAG,OAAO;CAChC,IAAI,GAAG,SAAS,GAAG,OAAO,GAAG,SAAS,KAAK;CAC3C,OAAO;AACT;;;;;;;;;AAUA,SAAgB,mBAAmB,SAAiB,MAAuB;CACzE,OAAO,YAAY,QAAQ,MAAM,GAAG,GAAG,IAAI;AAC7C;AAUA,SAAgB,oBAAoB,OAAqC;CACvE,MAAM,QAAQ,mBAAmB,KAAK;CACtC,MAAM,WAAiC;EACrC,oBAAoB,MAAM,UACxB,MAAM,eAAe,IAAI,CAAC,CAAC,MAAM,EAAE,cAAc,QAAQ,SAAS,KAAK,CAAC;EAC1E,kBAAkB,MAAM,UAAU,MAAM,gBAAgB,MAAM,KAAK,CAAC,CAAC,SAAS;EAC9E,cAAc,SAAS,SAAS,kBAAkB,MAAM,OAAO;EAC/D,mBAAmB,SACjB,SAAS,kBAAkB,mBAA0B,KAAK,CAAC,SAAS,gBAAgB,IAAI;EAC1F,kBAAkB,SAAS,SAAS,gBAAgB,MAAM,oBAAoB;CAChF;CACA,OAAO;AACT;AAEA,SAAgB,6BACd,OACA,MACA,OACS;CACT,OAAO,oBAAoB,KAAK,CAAC,CAAC,kBAAkB,MAAM,KAAK;AACjE;;;;AC/NA,IAAa,kBAAb,MAAgC;CAID;CAH7B,AAAiB,0BAAU,IAAI,IAAyC;CACxE,AAAQ,OAAO;CAEf,YAAY,AAAiB,aAAqB;EAArB;CAAsB;CAEnD,SAAS,KAAa,OAAe,MAAkB;EACrD,MAAM,MAAM,KAAK,QAAQ,IAAI,GAAG;EAChC,IAAI,QAAQ,QAAW;GACrB,KAAK,QAAQ,OAAO,GAAG;GACvB,KAAK,QAAQ,IAAI,KAAK,GAAG;GACzB,OAAO,IAAI;EACb;EACA,MAAM,QAAQ,KAAK;EACnB,IAAI,QAAQ,KAAK,aAAa,OAAO;EACrC,KAAK,QAAQ,IAAI,KAAK;GAAE;GAAO;EAAM,CAAC;EACtC,KAAK,QAAQ;EACb,KAAK,MAAM,CAAC,QAAQ,UAAU,KAAK,SAAS;GAC1C,IAAI,KAAK,QAAQ,KAAK,aAAa;GACnC,KAAK,QAAQ,OAAO,MAAM;GAC1B,KAAK,QAAQ,MAAM;EACrB;EACA,OAAO;CACT;AACF;;;;ACrBA,MAAM,eAAe;AACrB,MAAM,sBAAsB;AAE5B,MAAM,OAAO,IAAI,gBAAwB,YAAY;AAErD,MAAa,uBAAuB,WAClC,KAAK,SAAS,QAAQ,OAAO,SAAS,2BACpC,2BAA2B,MAAM,CACnC;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACmBF,SAAgB,yBACd,cACA,SACU;CACV,IAAI,CAAC,gBAAgB,CAAC,aAAa,KAAK,GAAG,OAAO,CAAC;CACnD,MAAM,sBAAM,IAAI,IAAY;CAC5B,KAAK,MAAM,SAAS,oBAAoB,YAAY,CAAC,CAAC,MAAM,SAAS,GAAG;EACtE,IAAI,CAAC,0BAA0B,KAAK,KAAK,GAAG;EAC5C,MAAM,cAAc,MAAM,MAAM,uBAAuB,YAAY,CAAC;EACpE,IAAI,CAAC,aAAa;EAGlB,MAAM,SAAS,YAAY,EAAE,CAAC,MAAM,KAAK,CAAC,CAAC,OAAO,OAAO,CAAC,CAAC,IAAI,mBAAmB;EAClF,IAAI,OAAO,WAAW,GAAG;EACzB,IAAI,CAAC,aAAa,OAAO,OAAO,GAAG;EACnC,KAAK,MAAM,SAAS,QAAQ,IAAI,IAAI,KAAK;CAC3C;CACA,OAAO,CAAC,GAAG,GAAG;AAChB;;;;AClBA,SAAgB,iBAAiB,UAA4C;CAC3E,QAAQ,SAAS,MAAjB;EACE,KAAK,UACH,OAAO,SAAS;EAClB,KAAK,SACH,OAAO,SAAS,QAAQ,SAAS,iBAAiB,SAAS,OAAO,WAAW;EAC/E,KAAK,aACH,OAAO,SAAS,QAAQ;EAC1B,KAAK,YACH,OAAO,SAAS,QAAQ;EAC1B,KAAK,YACH,OAAO,SAAS,SAAS;EAC3B,SACE;CACJ;AACF;;;;;ACjBA,MAAa,qBAAqB;CAChC,UAAU;CACV,WAAW;CACX,UAAU;CACV,WAAW;AACb;AAIA,MAAM,wBAAgD;EACnD,mBAAmB,WAAW;EAC9B,mBAAmB,YAAY;EAC/B,mBAAmB,WAAW;EAC9B,mBAAmB,YAAY;AAClC;AAOA,MAAM,wBAA6C,IAAI,IAAI,OAAO,OAAO,kBAAkB,CAAC;;AAG5F,SAAgB,kBAAkB,UAA8C;CAC9E,OAAO,OAAO,aAAa,YAAY,sBAAsB,IAAI,QAAQ;AAC3E;;;;;AAMA,SAAgB,mBAAmB,UAAiC;CAClE,OAAO,sBAAsB,aAAa;AAC5C;;;;;;;;;;;AAYA,MAAa,2BAA2B;;;;;;AAOxC,SAAgB,uBAAuB,UAA8C;CACnF,OAAO,kBAAkB,QAAQ,KAAK;AACxC;;;;;;AAOA,SAAgB,wBAAwB,UAAoD;CAC1F,IAAI,+BAAuC,OAAO;CAClD,OAAO,OAAO,aAAa,WAAW,mBAAmB,QAAQ,IAAI;AACvE;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AChDA,SAAgB,yBACd,cACA,SACuB;CACvB,IAAI,CAAC,gBAAgB,CAAC,aAAa,KAAK,GAAG,OAAO;CAElD,IAAI,SAAgC;CACpC,KAAK,MAAM,SAAS,oBAAoB,YAAY,CAAC,CAAC,MAAM,SAAS,GAAG;EACtE,IAAI,CAAC,0BAA0B,KAAK,KAAK,GAAG;EAC5C,IAAI,CAAC,aAAa,OAAO,OAAO,GAAG;EAEnC,MAAM,YAAY,eAAe,KAAK;EACtC,IAAI,CAAC,WAIH,OAAO;EAET,MAAM,YAA4B;GAAE,GAAG,aAAa,KAAK;GAAG;EAAU;EACtE,IAAI,UAAU,CAAC,WAAW,QAAQ,SAAS,GAGzC,OAAO;EAET,SAAS;CACX;CACA,OAAO;AACT;;;AAIA,SAAS,eAAe,OAAgC;CACtD,MAAM,IAAI,MAAM,MAAM,yBAAyB;CAC/C,IAAI,CAAC,GAAG,OAAO;CACf,MAAM,YAAY,EAAE,EAAE,CAAC,MAAM,KAAK,CAAC,CAAC,OAAO,OAAO;CAClD,OAAO,UAAU,SAAS,IAAI,YAAY;AAC5C;;AAGA,SAAS,WAAW,GAAmB,GAA4B;CACjE,OACE,EAAE,MAAM,EAAE,KACV,EAAE,UAAU,WAAW,EAAE,UAAU,UACnC,EAAE,UAAU,OAAO,KAAK,MAAM,QAAQ,EAAE,UAAU,EAAE;AAExD;;;;;;;AAQA,SAAS,aAAa,OAAuB;CAC3C,MAAM,IAAI,MAAM,MAAM,sBAAsB;CAC5C,IAAI,CAAC,GAAG,OAAO;CACf,MAAM,IAAI,OAAO,EAAE,EAAE;CACrB,OAAO,OAAO,UAAU,CAAC,KAAK,KAAK,IAAI,IAAI;AAC7C;;;;;;;;;;;;;AC5CA,SAAgB,qBAAqB,QAA6C;CAChF,IAAI,CAAC,OAAO,UAAU,OAAO,CAAC,KAAK,OAAO,IAAI,GAC5C,OAAO;EAAE,IAAI;EAAO,QAAQ;CAAyB;CAEvD,IAAI,CAAC,MAAM,QAAQ,OAAO,SAAS,KAAK,OAAO,UAAU,WAAW,GAClE,OAAO;EAAE,IAAI;EAAO,QAAQ;CAAuB;CAErD,OAAO,EAAE,IAAI,KAAK;AACpB"}
|