bimdown-cli 0.3.0 → 0.5.1
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +24 -3
- package/dist/chunk-4SKM4RHY.js +142 -0
- package/dist/chunk-4SKM4RHY.js.map +1 -0
- package/dist/chunk-4YHVOWS4.js +255 -0
- package/dist/chunk-4YHVOWS4.js.map +1 -0
- package/dist/chunk-AYAXRYGP.js +2129 -0
- package/dist/chunk-AYAXRYGP.js.map +1 -0
- package/dist/chunk-EC5MR5ZH.js +648 -0
- package/dist/chunk-EC5MR5ZH.js.map +1 -0
- package/dist/chunk-HS3PO2LB.js +487 -0
- package/dist/chunk-HS3PO2LB.js.map +1 -0
- package/dist/chunk-IQJA3EFO.js +179 -0
- package/dist/chunk-IQJA3EFO.js.map +1 -0
- package/dist/chunk-JY6KWRDB.js +80 -0
- package/dist/chunk-JY6KWRDB.js.map +1 -0
- package/dist/chunk-KWSGJUMZ.js +2501 -0
- package/dist/chunk-KWSGJUMZ.js.map +1 -0
- package/dist/chunk-LWYIPR64.js +35 -0
- package/dist/chunk-LWYIPR64.js.map +1 -0
- package/dist/chunk-OBY3UYCO.js +44 -0
- package/dist/chunk-OBY3UYCO.js.map +1 -0
- package/dist/chunk-XC6WHJRL.js +29 -0
- package/dist/chunk-XC6WHJRL.js.map +1 -0
- package/dist/chunk-XQU52JKB.js +187 -0
- package/dist/chunk-XQU52JKB.js.map +1 -0
- package/dist/clash-load-D3LNQR6G.js +941 -0
- package/dist/clash-load-D3LNQR6G.js.map +1 -0
- package/dist/cli.js +431 -0
- package/dist/cli.js.map +1 -0
- package/dist/dehydrate-ZHAGOI7Q.js +90 -0
- package/dist/dehydrate-ZHAGOI7Q.js.map +1 -0
- package/dist/diff-T2KOK2WR.js +89 -0
- package/dist/diff-T2KOK2WR.js.map +1 -0
- package/dist/engine-2TPWJVEQ.js +12 -0
- package/dist/engine-2TPWJVEQ.js.map +1 -0
- package/dist/hydrate-V24H7IF3.js +673 -0
- package/dist/hydrate-V24H7IF3.js.map +1 -0
- package/dist/import-ifc-RCZSXDA6.js +5324 -0
- package/dist/import-ifc-RCZSXDA6.js.map +1 -0
- package/dist/info-QC7YXWNX.js +92 -0
- package/dist/info-QC7YXWNX.js.map +1 -0
- package/dist/init-VWDML3UC.js +112 -0
- package/dist/init-VWDML3UC.js.map +1 -0
- package/dist/lib.d.ts +492 -0
- package/dist/lib.js +6528 -0
- package/dist/lib.js.map +1 -0
- package/dist/mep-W4HJI363.js +25 -0
- package/dist/mep-W4HJI363.js.map +1 -0
- package/dist/merge-ESOPDSA5.js +413 -0
- package/dist/merge-ESOPDSA5.js.map +1 -0
- package/dist/publish-3TAXQCUV.js +80 -0
- package/dist/publish-3TAXQCUV.js.map +1 -0
- package/dist/render-UEWYHPN6.js +1807 -0
- package/dist/render-UEWYHPN6.js.map +1 -0
- package/dist/resolve-topology-AQ2RO3W3.js +338 -0
- package/dist/resolve-topology-AQ2RO3W3.js.map +1 -0
- package/dist/spec/csv-schema/annotation/dimension.yaml +77 -0
- package/dist/spec/csv-schema/annotation/tag.yaml +44 -0
- package/dist/spec/csv-schema/annotation/text_note.yaml +52 -0
- package/dist/spec/csv-schema/architecture/ceiling.yaml +8 -1
- package/dist/spec/csv-schema/architecture/column.yaml +5 -1
- package/dist/spec/csv-schema/architecture/curtain_wall.yaml +45 -5
- package/dist/spec/csv-schema/architecture/door.yaml +5 -0
- package/dist/spec/csv-schema/architecture/furniture.yaml +28 -0
- package/dist/spec/csv-schema/architecture/opening.yaml +27 -6
- package/dist/spec/csv-schema/architecture/railing.yaml +35 -0
- package/dist/spec/csv-schema/architecture/roof.yaml +34 -1
- package/dist/spec/csv-schema/architecture/slab.yaml +19 -0
- package/dist/spec/csv-schema/architecture/space.yaml +11 -1
- package/dist/spec/csv-schema/architecture/stair.yaml +49 -0
- package/dist/spec/csv-schema/architecture/stair_landing.yaml +36 -0
- package/dist/spec/csv-schema/architecture/stair_run.yaml +31 -0
- package/dist/spec/csv-schema/architecture/wall.yaml +14 -1
- package/dist/spec/csv-schema/architecture/window.yaml +19 -0
- package/dist/spec/csv-schema/base/element.yaml +20 -11
- package/dist/spec/csv-schema/base/furniture_params.yaml +60 -0
- package/dist/spec/csv-schema/base/hosted_element.yaml +10 -2
- package/dist/spec/csv-schema/base/mep_connectable.yaml +23 -0
- package/dist/spec/csv-schema/base/mep_design.yaml +24 -0
- package/dist/spec/csv-schema/base/mep_insulated.yaml +9 -0
- package/dist/spec/csv-schema/base/mep_system_tag.yaml +12 -0
- package/dist/spec/csv-schema/base/point_element.yaml +1 -0
- package/dist/spec/csv-schema/base/section_profile.yaml +5 -0
- package/dist/spec/csv-schema/base/spatial_line_element.yaml +4 -2
- package/dist/spec/csv-schema/base/structural_section_profile.yaml +50 -0
- package/dist/spec/csv-schema/base/vertical_span.yaml +9 -3
- package/dist/spec/csv-schema/base/wall_bounded.yaml +21 -0
- package/dist/spec/csv-schema/grid.yaml +5 -0
- package/dist/spec/csv-schema/mep/cable_tray.yaml +10 -3
- package/dist/spec/csv-schema/mep/circuit.yaml +70 -0
- package/dist/spec/csv-schema/mep/conduit.yaml +2 -2
- package/dist/spec/csv-schema/mep/connector.yaml +112 -0
- package/dist/spec/csv-schema/mep/duct.yaml +10 -3
- package/dist/spec/csv-schema/mep/equipment.yaml +18 -1
- package/dist/spec/csv-schema/mep/mep_node.yaml +91 -2
- package/dist/spec/csv-schema/mep/mep_system.yaml +21 -0
- package/dist/spec/csv-schema/mep/pipe.yaml +27 -3
- package/dist/spec/csv-schema/mep/terminal.yaml +22 -1
- package/dist/spec/csv-schema/model_group.yaml +40 -0
- package/dist/spec/csv-schema/sheet/sheet.yaml +50 -0
- package/dist/spec/csv-schema/sheet/sheet_viewport.yaml +86 -0
- package/dist/spec/csv-schema/structure/beam.yaml +29 -1
- package/dist/spec/csv-schema/structure/beam_system.yaml +29 -0
- package/dist/spec/csv-schema/structure/brace.yaml +24 -1
- package/dist/spec/csv-schema/structure/foundation.yaml +40 -7
- package/dist/spec/csv-schema/structure/structure_column.yaml +19 -1
- package/dist/spec/csv-schema/structure/structure_slab.yaml +32 -0
- package/dist/spec/csv-schema/structure/structure_wall.yaml +22 -0
- package/dist/spec/csv-schema/types/beam_type.yaml +11 -0
- package/dist/spec/csv-schema/types/ceiling_type.yaml +6 -0
- package/dist/spec/csv-schema/types/column_type.yaml +12 -0
- package/dist/spec/csv-schema/types/curtain_wall_type.yaml +32 -0
- package/dist/spec/csv-schema/types/door_type.yaml +27 -0
- package/dist/spec/csv-schema/types/element_type.yaml +21 -0
- package/dist/spec/csv-schema/types/fenestration.yaml +16 -0
- package/dist/spec/csv-schema/types/foundation_type.yaml +36 -0
- package/dist/spec/csv-schema/types/furniture_type.yaml +11 -0
- package/dist/spec/csv-schema/types/layered_type.yaml +13 -0
- package/dist/spec/csv-schema/types/railing_type.yaml +40 -0
- package/dist/spec/csv-schema/types/roof_type.yaml +7 -0
- package/dist/spec/csv-schema/types/slab_type.yaml +9 -0
- package/dist/spec/csv-schema/types/type_layer.yaml +47 -0
- package/dist/spec/csv-schema/types/wall_type.yaml +6 -0
- package/dist/spec/csv-schema/types/window_type.yaml +31 -0
- package/dist/spec/csv-schema/underlay.yaml +73 -0
- package/dist/spec/csv-schema/view.yaml +36 -0
- package/dist/spec/duckdb-strategy.md +4 -3
- package/dist/spec/geojson-schema/readme.md +380 -0
- package/dist/spec/mep-port-conventions.md +190 -0
- package/dist/spec/migration-guide.md +1 -1
- package/dist/spec/project_metadata.schema.yaml +52 -4
- package/dist/spec/readme.md +356 -97
- package/dist/spec/starter-types/global/beam_type.csv +5 -0
- package/dist/spec/starter-types/global/ceiling_type.csv +3 -0
- package/dist/spec/starter-types/global/column_type.csv +5 -0
- package/dist/spec/starter-types/global/curtain_wall_type.csv +2 -0
- package/dist/spec/starter-types/global/door_type.csv +6 -0
- package/dist/spec/starter-types/global/foundation_type.csv +7 -0
- package/dist/spec/starter-types/global/furniture_type.csv +11 -0
- package/dist/spec/starter-types/global/railing_type.csv +5 -0
- package/dist/spec/starter-types/global/roof_type.csv +3 -0
- package/dist/spec/starter-types/global/slab_type.csv +4 -0
- package/dist/spec/starter-types/global/type_layer.csv +40 -0
- package/dist/spec/starter-types/global/wall_type.csv +8 -0
- package/dist/spec/starter-types/global/window_type.csv +6 -0
- package/dist/spec/svg-schema/readme.md +47 -1
- package/package.json +17 -5
- package/dist/index.js +0 -3366
- package/dist/index.js.map +0 -1
- package/dist/spec/csv-schema/base/mep_connected_segment.yaml +0 -17
- package/dist/spec/csv-schema/base/mep_system.yaml +0 -7
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"sources":["../src/build/index.ts","../src/validate/index.ts","../src/validate/structure.ts","../src/validate/csv.ts","../src/validate/ids.ts","../src/validate/references.ts","../src/build/model-checks.ts","../src/validate/ranges.ts","../src/validate/geojson.ts","../src/validate/types.ts","../src/furniture/validate.ts","../src/validate/sheets.ts","../src/validate/groups.ts","../src/validate/envelope.ts","../src/validate/curtain-wall.ts","../src/validate/stairs.ts","../src/build/space-boundary.ts","../src/build/room-area.ts","../src/build/room-net-area.ts","../src/build/room-faces.ts","../src/build/project-rooms.ts","../src/build/geometry-warnings.ts","../src/build/resolve-hosted-coords.ts","../src/build/snap-endpoints.ts","../src/build/group-warnings.ts","../src/build/number-warnings.ts","../src/build/hints.ts"],"sourcesContent":["import { existsSync, mkdirSync, mkdtempSync, readdirSync, copyFileSync, rmSync, symlinkSync } from 'node:fs';\nimport { join } from 'node:path';\nimport { tmpdir } from 'node:os';\nimport { validate } from '../validate/index.js';\nimport { discoverLayout } from '../utils/fs.js';\nimport { computeSpaceBoundaries, type RoomIssue } from './space-boundary.js';\nimport { validateGeometry } from './geometry-warnings.js';\nimport { resolveHostedCoords } from './resolve-hosted-coords.js';\nimport { snapEndpoints, type SnapRecord } from './snap-endpoints.js';\nimport { typeWarnings } from '../catalog/index.js';\nimport { mepErrors, mepWarnings } from '../mep/index.js';\nimport { groupWarningsForDir } from './group-warnings.js';\nimport { numberWarnings } from './number-warnings.js';\nimport { authoringHints } from './hints.js';\nimport { curtainWallWarnings } from '../validate/curtain-wall.js';\nimport { validateStairs } from '../validate/stairs.js';\n\nexport type { RoomIssue };\n\nexport interface BuildResult {\n issues: string[];\n warnings: string[];\n artifacts: string[];\n snappedEndpoints: number;\n snaps: SnapRecord[];\n /** Derived-room overlaps/leaks; each one also appears in `warnings`. */\n roomIssues: RoomIssue[];\n /** Authoring advice, not problems: raw sizes where a type fits, unmarked doors / windows. */\n hints: string[];\n}\n\nexport function build(dir: string): BuildResult {\n // 0a. Merge wall endpoints of the same level that are within 5 cm (before everything else)\n const snaps = snapEndpoints(dir);\n\n // 0b. Resolve host_x/host_y → host_id + position (before validation)\n const resolveIssues = resolveHostedCoords(dir);\n\n // 1. Run all existing validation\n const issues = [...resolveIssues, ...validate(dir)];\n\n // 2. Geometry warnings (connectivity, hosted bounds, overlap)\n const warnings = [...validateGeometry(dir), ...typeWarnings(dir), ...groupWarningsForDir(dir), ...curtainWallWarnings(dir), ...validateStairs(dir).warnings, ...numberWarnings(dir)];\n\n // 2b. MEP connectivity (open ends, misplaced port refs, system mismatches);\n // a reference to a missing element or port is an error\n warnings.push(...mepWarnings(dir));\n issues.push(...mepErrors(dir));\n\n // 3. Compute space boundaries per level → write space.geojson\n const artifacts: string[] = [];\n const roomIssues: RoomIssue[] = [];\n const layout = discoverLayout(dir);\n\n for (const levelDir of layout.levelDirs) {\n const spaceCsvPath = join(levelDir.path, 'space.csv');\n if (!existsSync(spaceCsvPath)) continue;\n\n const result = computeSpaceBoundaries(levelDir, layout.globalDir);\n warnings.push(...result.warnings);\n roomIssues.push(...result.roomIssues);\n if (result.geojsonWritten) {\n artifacts.push(`${levelDir.name}/space.geojson`);\n }\n }\n\n return { issues, warnings, artifacts, snappedEndpoints: snaps.length, snaps, roomIssues, hints: authoringHints(dir) };\n}\n\n/**\n * `bimdown validate`: the same checks as build without touching the project.\n * Build writes (snapped endpoints, resolved host refs, space.geojson), so it\n * runs on a scratch copy: data files copied, everything else (meshes, images)\n * linked.\n */\nexport function validateOnly(dir: string): BuildResult {\n const scratch = mkdtempSync(join(tmpdir(), 'bimdown-validate-'));\n try {\n copyData(dir, scratch);\n return build(scratch);\n } finally {\n rmSync(scratch, { recursive: true, force: true });\n }\n}\n\nfunction copyData(from: string, to: string) {\n for (const e of readdirSync(from, { withFileTypes: true })) {\n const src = join(from, e.name), dest = join(to, e.name);\n if (e.isDirectory()) { mkdirSync(dest); copyData(src, dest); }\n else if (/\\.(csv|geojson|json)$/i.test(e.name)) copyFileSync(src, dest);\n else symlinkSync(src, dest);\n }\n}\n","import { existsSync } from 'node:fs';\nimport { join } from 'node:path';\nimport { buildRegistry, getSpecDir, GEOJSON_FILE_NAMES } from '../schema/registry.js';\nimport type { ResolvedTable } from '../schema/types.js';\nimport { discoverLayout, listFiles } from '../utils/fs.js';\nimport { readCsv, type CsvData } from '../utils/csv.js';\nimport { validateStructure } from './structure.js';\nimport { validateCsvHeaders, validateCsvRequired, validateCsvEnums, validateCsvTypes } from './csv.js';\nimport { validateIdFormat, createIdRegistry, registerIds } from './ids.js';\nimport { validateReferences } from './references.js';\nimport { validateRanges } from './ranges.js';\nimport { projectUnits } from '../utils/units.js';\nimport { validateGeoJsonFile } from './geojson.js';\nimport { catalogFromEntries, typeSuppliedFields, validateTypes } from './types.js';\nimport { validateAnnotations } from './annotations.js';\nimport { validateFurnitureRows } from '../furniture/validate.js';\nimport { effectiveRows } from '../catalog/index.js';\nimport { validateSheets } from './sheets.js';\nimport { validateGroups } from './groups.js';\nimport { validateEnvelope } from './envelope.js';\nimport { validateCurtainWallCsv } from './curtain-wall.js';\nimport { validateStairs } from './stairs.js';\n\ninterface CsvEntry {\n path: string; // relative display path\n fullPath: string;\n tableName: string;\n table: ResolvedTable;\n data: CsvData;\n}\n\nexport function validate(dir: string): string[] {\n const issues: string[] = [];\n\n // 1. Structure validation\n issues.push(...validateStructure(dir));\n\n const registry = buildRegistry(getSpecDir());\n const layout = discoverLayout(dir);\n\n // Collect all CSVs\n const csvEntries: CsvEntry[] = [];\n const allDirs = [\n { name: 'global', path: layout.globalDir },\n ...layout.levelDirs,\n ];\n\n for (const d of allDirs) {\n if (!existsSync(d.path)) continue;\n const files = listFiles(d.path);\n for (const f of files) {\n if (!f.endsWith('.csv')) continue;\n const tableName = f.replace('.csv', '');\n const table = registry.get(tableName);\n if (!table) continue;\n\n const fullPath = join(d.path, f);\n const relPath = `${d.name}/${f}`;\n\n let data: CsvData;\n try {\n data = readCsv(fullPath);\n } catch (e) {\n issues.push(`${relPath} failed to read CSV: ${(e as Error).message}`);\n continue;\n }\n\n csvEntries.push({ path: relPath, fullPath, tableName, table, data });\n }\n }\n\n // 2-3. CSV header and required field validation (a typed row may leave the\n // fields its type supplies empty)\n const catalog = catalogFromEntries(csvEntries);\n for (const entry of csvEntries) {\n const supplied = entry.table.typeTable\n ? (row: Record<string, string>) => typeSuppliedFields(entry.table, row, catalog)\n : undefined;\n issues.push(...validateCsvHeaders(entry.path, entry.table, entry.data, supplied));\n issues.push(...validateCsvRequired(entry.path, entry.table, entry.data, supplied));\n }\n\n // 4. ID format validation\n for (const entry of csvEntries) {\n issues.push(...validateIdFormat(entry.path, entry.table, entry.data));\n }\n\n // 5. ID uniqueness (global)\n const idRegistry = createIdRegistry();\n for (const entry of csvEntries) {\n registerIds(idRegistry, entry.path, entry.tableName, entry.data);\n }\n issues.push(...idRegistry.issues);\n\n // 6. Enum validation\n for (const entry of csvEntries) {\n issues.push(...validateCsvEnums(entry.path, entry.table, entry.data));\n issues.push(...validateCsvTypes(entry.path, entry.table, entry.data));\n }\n\n // 6b. Furniture variant belongs to its family\n for (const entry of csvEntries) {\n if (entry.tableName === 'furniture' || entry.tableName === 'furniture_type') {\n // Instances: family / variant as resolved through their type (an empty value inherits it).\n const rows = entry.tableName === 'furniture' ? effectiveRows(dir, 'furniture', entry.data.rows) : entry.data.rows;\n issues.push(...validateFurnitureRows(entry.path, { ...entry.data, rows }));\n }\n }\n\n // 7. Reference validation\n for (const entry of csvEntries) {\n issues.push(...validateReferences(entry.path, entry.table, entry.data, idRegistry));\n }\n\n // 7b. Element types: layers, thermal values, type_id targets, enum values supplied by types\n issues.push(...validateTypes(csvEntries, catalog, idRegistry));\n\n // 7c. Annotation tables: numbers, dimension references, same-level hosts\n for (const entry of csvEntries) {\n issues.push(...validateAnnotations(entry.path, entry.tableName, entry.data, idRegistry));\n }\n\n // 7d. Sheets: unique numbers, what each viewport shows, scale, position on the paper\n const globalCsv = (t: string) => csvEntries.find(e => e.path === `global/${t}.csv`)?.data ?? null;\n issues.push(...validateSheets(globalCsv('sheet'), globalCsv('sheet_viewport'), idRegistry));\n // 7e. Model groups: members and their group on one level\n issues.push(...validateGroups(csvEntries, idRegistry));\n // 7f. Envelope: roof edge slopes / profiles, wall top attachment, shafts\n const levelElevation = new Map<string, number>();\n for (const entry of csvEntries) {\n if (entry.tableName !== 'level') continue;\n for (const row of entry.data.rows) if (row.id) levelElevation.set(row.id, Number(row.elevation) || 0);\n }\n issues.push(...validateEnvelope(dir, csvEntries, idRegistry, levelElevation));\n\n // 7g. Curtain walls: grid line lists and panel overrides\n for (const entry of csvEntries) {\n if (entry.tableName === 'curtain_wall') issues.push(...validateCurtainWallCsv(entry.path, entry.data));\n }\n // 7h. Stairs: parts / railings hosted on a stair (or slab), multi-storey top level\n issues.push(...validateStairs(dir).issues);\n\n // 8. Value range validation (catches unit mistakes; limits are scaled to the project unit)\n const units = projectUnits(dir);\n for (const entry of csvEntries) {\n issues.push(...validateRanges(entry.path, entry.table, entry.data, units));\n }\n\n // 8b. Hosted element position validation (must be a non-negative distance)\n for (const entry of csvEntries) {\n if (!entry.table.hostType) continue;\n for (let i = 0; i < entry.data.rows.length; i++) {\n const row = entry.data.rows[i];\n const pos = row.position;\n if (pos === undefined || pos === '') continue;\n const val = Number(pos);\n if (isNaN(val) || val < 0) {\n issues.push(\n `${entry.path}:${i + 2} position=${pos} must be a non-negative distance`,\n );\n }\n }\n }\n\n // 9. GeoJSON validation\n for (const d of allDirs) {\n if (!existsSync(d.path)) continue;\n const files = listFiles(d.path);\n for (const f of files) {\n if (!f.endsWith('.geojson')) continue;\n const base = f.replace('.geojson', '');\n const tableEntry = Object.entries(GEOJSON_FILE_NAMES).find(([, v]) => v === base);\n if (!tableEntry) continue;\n const [tableName] = tableEntry;\n const table = registry.get(tableName);\n if (!table) continue;\n\n // Gather CSV IDs for this table in this partition (global or current level)\n const csvIds = new Set<string>();\n for (const entry of csvEntries) {\n if (entry.tableName !== tableName) continue;\n const entryDir = entry.path.split('/')[0];\n if (entryDir !== d.name) continue;\n for (const row of entry.data.rows) {\n if (row.id) csvIds.add(row.id);\n }\n }\n\n const fullPath = join(d.path, f);\n const relPath = `${d.name}/${f}`;\n issues.push(...validateGeoJsonFile(relPath, fullPath, csvIds, tableName, units));\n }\n }\n\n return issues;\n}\n","import { existsSync, readdirSync, readFileSync } from 'node:fs';\nimport { join, extname } from 'node:path';\nimport { discoverLayout, listFiles, ASSET_DIRS } from '../utils/fs.js';\nimport { readCsv } from '../utils/csv.js';\nimport { ID_PREFIXES, GEOJSON_FILE_NAMES, GLOBAL_ONLY_TABLES, ANNOTATION_TABLES, VIEW_ANNOTATION_TABLES, LEVEL_ONLY_TABLES } from '../schema/registry.js';\n\n// Tables where the GeoJSON file is optional:\n// - opening: wall-mode is CSV-only, slab-mode has geometry\n// - space: boundary auto-generated by build\n// - stair/ramp/railing: sketch/run-based; a single LineString rarely represents them,\n// so geometry falls back to an optional GLB mesh (mesh_file)\nconst OPTIONAL_GEOMETRY_TABLES = new Set(['opening', 'space', 'stair', 'ramp', 'railing']);\n\nconst KNOWN_CSV_NAMES = new Set(Object.keys(ID_PREFIXES).map((t) => `${t}.csv`));\nconst KNOWN_GEOJSON_NAMES = new Set(Object.values(GEOJSON_FILE_NAMES).map((s) => `${s}.geojson`));\nconst KNOWN_GLOBAL_EXTRAS = new Set(['_IdMap.csv']);\n/** Licence / attribution notes allowed in the project root (e.g. a model shared under CC BY or MIT). */\nconst ROOT_NOTE_FILE = /^(LICEN[CS]E|COPYING|NOTICE|README|CREDITS)(\\.(txt|md))?$/i;\n\n// Minimum supported format version. v1 was SVG geometry; v2+ is GeoJSON. Builds\n// accept any version >= this (v2, v3, ...) since they share the GeoJSON format.\nconst MIN_FORMAT_VERSION = 2;\n\n/** Fields of project_metadata.json — keep in sync with spec/project_metadata.schema.yaml. */\nexport const PROJECT_METADATA_FIELDS = ['format_version', 'project_name', 'project_number', 'client', 'address', 'units', 'source', 'spatial_z', 'discipline', 'numbering'];\n\nexport function validateStructure(dir: string): string[] {\n const issues: string[] = [];\n const layout = discoverLayout(dir);\n\n // Must have global/\n if (!existsSync(layout.globalDir)) {\n issues.push('global/ missing global/ directory');\n return issues;\n }\n\n // global/ must have level.csv. grid.csv is optional — a structural grid is\n // meaningful for column layouts but pointless for plain architectural/MEP models.\n const globalFiles = listFiles(layout.globalDir);\n if (!globalFiles.includes('level.csv')) {\n issues.push('global/ missing level.csv');\n }\n\n // global/ — CSVs and GeoJSON files (cross-floor elements may have geometry in global/) allowed\n for (const f of globalFiles) {\n const ext = extname(f);\n if (ext === '.svg') {\n issues.push(`global/${f} SVG files are not allowed (use GeoJSON; see migration script)`);\n } else if (ext === '.csv') {\n if (!KNOWN_CSV_NAMES.has(f) && !KNOWN_GLOBAL_EXTRAS.has(f)) {\n issues.push(`global/${f} unknown file — only known table CSVs are allowed`);\n } else if (ANNOTATION_TABLES.has(f.replace('.csv', '')) && !VIEW_ANNOTATION_TABLES.has(f.replace('.csv', ''))) {\n issues.push(`global/${f} annotations belong to a level plan — put ${f} in a level directory`);\n } else if (LEVEL_ONLY_TABLES.has(f.replace('.csv', ''))) {\n issues.push(`global/${f} model groups belong to a level — put ${f} in a level directory`);\n }\n } else if (ext === '.geojson') {\n if (!KNOWN_GEOJSON_NAMES.has(f)) {\n issues.push(`global/${f} unknown GeoJSON file — not a recognized BimDown table name`);\n }\n } else {\n issues.push(`global/${f} unexpected file — only CSV and GeoJSON files are allowed in global/`);\n }\n }\n\n // Level dirs\n for (const ld of layout.levelDirs) {\n if (!/^lv-.+$/.test(ld.name)) {\n issues.push(`${ld.name}/ directory name does not match lv-{id} pattern`);\n continue;\n }\n\n const files = listFiles(ld.path);\n\n for (const f of files) {\n const ext = extname(f);\n if (ext === '.csv') {\n if (!KNOWN_CSV_NAMES.has(f)) {\n issues.push(`${ld.name}/${f} unknown file — not a recognized BimDown table`);\n }\n const tableName = f.replace('.csv', '');\n if (GLOBAL_ONLY_TABLES.has(tableName)) {\n issues.push(`${ld.name}/${f} ${tableName} belongs in global/ only`);\n }\n } else if (ext === '.svg') {\n issues.push(`${ld.name}/${f} SVG files are not allowed (use GeoJSON; see migration script)`);\n } else if (ext === '.geojson') {\n if (!KNOWN_GEOJSON_NAMES.has(f)) {\n issues.push(`${ld.name}/${f} unknown GeoJSON file — not a recognized BimDown table name`);\n }\n const base = f.replace('.geojson', '');\n const tableName = Object.entries(GEOJSON_FILE_NAMES).find(([, v]) => v === base)?.[0];\n if (tableName && !files.includes(`${tableName}.csv`)) {\n issues.push(`${ld.name}/${f} orphaned GeoJSON — no matching ${tableName}.csv`);\n }\n } else {\n issues.push(`${ld.name}/${f} unexpected file — only CSV and GeoJSON files are allowed`);\n }\n }\n\n // CSV must have matching GeoJSON (reverse check) — unless geometry is optional for that table\n for (const f of files) {\n if (extname(f) !== '.csv') continue;\n const tableName = f.replace('.csv', '');\n const geojsonName = GEOJSON_FILE_NAMES[tableName];\n if (geojsonName && !files.includes(`${geojsonName}.geojson`) && !OPTIONAL_GEOMETRY_TABLES.has(tableName)) {\n issues.push(`${ld.name}/${f} missing paired GeoJSON file \"${geojsonName}.geojson\"`);\n }\n }\n }\n\n // Reject top-level entries other than global/, lv-{n}/, project_metadata.json,\n // _IdMap.csv (UUID↔short-id map), mesh/ (GLB assets), underlays/ (tracing references)\n // and the licence / attribution notes a shared model must carry (LICENSE.txt, README.md, …).\n const topEntries = readdirSync(dir);\n for (const f of topEntries) {\n if (f === 'global' || /^lv-.+$/.test(f)) continue;\n if (f === 'project_metadata.json') continue;\n if (f === '_IdMap.csv' || ASSET_DIRS.has(f)) continue;\n if (f.startsWith('.')) continue;\n if (ROOT_NOTE_FILE.test(f)) continue;\n issues.push(`${f} unexpected entry in project root — only global/, lv-{n}/, mesh/, underlays/, _IdMap.csv, project_metadata.json and LICENSE/README notes are allowed`);\n }\n\n issues.push(...validateUnderlayFiles(dir));\n\n // Validate project_metadata.json\n const metadataPath = join(dir, 'project_metadata.json');\n if (existsSync(metadataPath)) {\n try {\n const raw = readFileSync(metadataPath, 'utf-8');\n const metadata = JSON.parse(raw);\n if (typeof metadata !== 'object' || metadata === null || Array.isArray(metadata)) {\n issues.push('project_metadata.json must be a JSON object');\n } else {\n const fv = metadata.format_version;\n if (fv === undefined || fv === null) {\n issues.push('project_metadata.json missing \"format_version\"');\n } else {\n const n = typeof fv === 'number' ? fv : parseInt(String(fv), 10);\n if (!Number.isFinite(n)) {\n issues.push(`project_metadata.json invalid \"format_version\": ${fv}`);\n } else if (n < MIN_FORMAT_VERSION) {\n issues.push(\n `project_metadata.json format_version ${n} is no longer supported. Run: npx tsx scripts/svg-to-geojson.ts <project_dir>`,\n );\n }\n // n >= MIN_FORMAT_VERSION is accepted: v2 and v3 are the same GeoJSON\n // format (the API stamps new projects \"3.0\"); the number is just an\n // identifier, so don't hard-fail builds on a \"newer\" minor bump.\n }\n for (const key of Object.keys(metadata)) {\n if (!PROJECT_METADATA_FIELDS.includes(key)) {\n issues.push(`project_metadata.json unknown field \"${key}\"`);\n }\n }\n if (metadata.spatial_z !== undefined && metadata.spatial_z !== 'absolute') {\n issues.push(`project_metadata.json invalid \"spatial_z\": ${JSON.stringify(metadata.spatial_z)} — must be \"absolute\"`);\n }\n if (metadata.numbering !== undefined) {\n const nb = metadata.numbering;\n if (typeof nb !== 'object' || nb === null || Array.isArray(nb) || Object.values(nb).some((v) => typeof v !== 'string')) {\n issues.push('project_metadata.json invalid \"numbering\" — must be an object of table name → prefix string');\n }\n }\n if (metadata.units !== undefined) {\n const validUnits = ['m', 'ft', 'in', 'mm'];\n if (typeof metadata.units !== 'string' || !validUnits.includes(metadata.units)) {\n issues.push(\n `project_metadata.json invalid \"units\": ${JSON.stringify(metadata.units)} — must be one of ${validUnits.join(', ')}`,\n );\n }\n }\n }\n } catch (e) {\n issues.push(`project_metadata.json failed to parse: ${(e as Error).message}`);\n }\n }\n\n return issues;\n}\n\n/** File types an underlay can reference (underlay.file). */\nexport const UNDERLAY_EXTENSIONS = new Set(['.png', '.jpg', '.jpeg', '.webp', '.pdf', '.dxf']);\n\n/**\n * Each global/underlay.csv row must point at an existing file under\n * underlays/ with a supported extension. Files nobody references are fine.\n */\nfunction validateUnderlayFiles(dir: string): string[] {\n const csvPath = join(dir, 'global', 'underlay.csv');\n if (!existsSync(csvPath)) return [];\n let rows: Record<string, string>[];\n try {\n rows = readCsv(csvPath).rows;\n } catch {\n return []; // reported by the CSV pass\n }\n const issues: string[] = [];\n rows.forEach((row, i) => {\n const file = row.file;\n if (!file) return; // required-field check reports it\n const where = `global/underlay.csv:${i + 2}`;\n if (!file.startsWith('underlays/') || file.includes('..')) {\n issues.push(`${where} file \"${file}\" must be a path under underlays/`);\n return;\n }\n if (!UNDERLAY_EXTENSIONS.has(extname(file).toLowerCase())) {\n issues.push(`${where} file \"${file}\" is not a supported underlay type (${[...UNDERLAY_EXTENSIONS].join(', ')})`);\n return;\n }\n if (!existsSync(join(dir, file))) {\n issues.push(`${where} file \"${file}\" not found`);\n }\n });\n return issues;\n}\n","import type { ResolvedTable } from '../schema/types.js';\nimport type { CsvData } from '../utils/csv.js';\n\n/** Fields a row's type supplies — a required field may then stay empty (see validate/types.ts). */\nexport type TypeSupplied = (row: Record<string, string>) => Set<string>;\n\nexport function validateCsvHeaders(\n path: string,\n table: ResolvedTable,\n data: CsvData,\n supplied?: TypeSupplied,\n): string[] {\n const issues: string[] = [];\n const expected = new Set(table.csvFields.map((f) => f.name));\n const actual = new Set(data.headers);\n\n for (const h of data.duplicateHeaders ?? []) {\n issues.push(`${path} duplicate column \"${h}\" (merged on read; rewrite the file with one \"${h}\" column)`);\n }\n\n for (const h of data.headers) {\n if (!expected.has(h)) {\n issues.push(`${path} unexpected column \"${h}\"`);\n }\n }\n for (const f of table.csvFields) {\n if (f.required && !actual.has(f.name)) {\n // A typed table may omit a column every row's type provides.\n if (supplied && actual.has('type_id') && data.rows.every((r) => supplied(r).has(f.name))) continue;\n issues.push(`${path} missing required column \"${f.name}\"`);\n }\n }\n\n return issues;\n}\n\nexport function validateCsvRequired(\n path: string,\n table: ResolvedTable,\n data: CsvData,\n supplied?: TypeSupplied,\n): string[] {\n const issues: string[] = [];\n const requiredFields = table.csvFields.filter((f) => f.required);\n\n for (let i = 0; i < data.rows.length; i++) {\n const row = data.rows[i];\n const fromType = supplied && row.type_id ? supplied(row) : undefined;\n for (const f of requiredFields) {\n const val = row[f.name];\n if ((val === undefined || val === '') && !fromType?.has(f.name)) {\n issues.push(`${path}:${i + 2} required field \"${f.name}\" is empty`);\n }\n }\n }\n\n return issues;\n}\n\nexport function validateCsvEnums(\n path: string,\n table: ResolvedTable,\n data: CsvData,\n): string[] {\n const issues: string[] = [];\n const enumFields = table.csvFields.filter((f) => f.type === 'enum' && f.values);\n\n for (let i = 0; i < data.rows.length; i++) {\n const row = data.rows[i];\n for (const f of enumFields) {\n const val = row[f.name];\n if (val !== undefined && val !== '' && !f.values!.includes(val)) {\n issues.push(\n `${path}:${i + 2} field \"${f.name}\" value \"${val}\" is not a valid enum (${f.values!.join(', ')})`,\n );\n }\n }\n }\n\n return issues;\n}\n\nconst BOOLEAN_VALUES = new Set(['true', 'false']);\n\n/** Boolean columns hold `true` / `false` (empty = false). Numbers in numeric columns must parse. */\nexport function validateCsvTypes(\n path: string,\n table: ResolvedTable,\n data: CsvData,\n): string[] {\n const issues: string[] = [];\n const typed = table.csvFields.filter((f) => f.type === 'boolean' || (f.unit === 'none' && (f.type === 'float' || f.type === 'int')));\n if (typed.length === 0) return issues;\n for (let i = 0; i < data.rows.length; i++) {\n const row = data.rows[i];\n for (const f of typed) {\n const val = row[f.name];\n if (val === undefined || val === '') continue;\n if (f.type === 'boolean') {\n if (!BOOLEAN_VALUES.has(val.toLowerCase())) issues.push(`${path}:${i + 2} field \"${f.name}\" value \"${val}\" must be true or false`);\n } else if (!Number.isFinite(Number(val)) || Number(val) < 0) {\n issues.push(`${path}:${i + 2} field \"${f.name}\" value \"${val}\" must be a non-negative number`);\n }\n }\n }\n return issues;\n}\n","import type { ResolvedTable } from '../schema/types.js';\nimport type { CsvData } from '../utils/csv.js';\n\nexport function validateIdFormat(\n path: string,\n table: ResolvedTable,\n data: CsvData,\n): string[] {\n const issues: string[] = [];\n const prefix = table.prefix;\n\n for (let i = 0; i < data.rows.length; i++) {\n const id = data.rows[i].id;\n if (!id) continue; // caught by required check\n\n // IDs must carry the table prefix (\"{prefix}-...\") so references resolve and\n // prefix-collisions stay impossible. The suffix is free-form: digits\n // (\"w-1\") or descriptive (\"w-ext-1\", \"c-lv1-A3\") are both fine — merge\n // renumbers to sequential prefix-N on roundtrip, so authored IDs need only\n // be unique within their level scope.\n const regex = new RegExp(`^${prefix}-.+$`);\n if (!regex.test(id)) {\n issues.push(`${path}:${i + 2} id \"${id}\" has wrong format, expected \"${prefix}-...\"`);\n }\n }\n\n return issues;\n}\n\nexport interface IdRegistry {\n // \"level/id\" -> { table, path, row } for level-scoped uniqueness\n ids: Map<string, { table: string; path: string; row: number }>;\n // All ids across the project (for reference lookups)\n allIds: Map<string, { table: string; path: string; row: number }>;\n issues: string[];\n}\n\nexport function createIdRegistry(): IdRegistry {\n return { ids: new Map(), allIds: new Map(), issues: [] };\n}\n\nexport function registerIds(\n registry: IdRegistry,\n path: string,\n tableName: string,\n data: CsvData,\n): void {\n // Extract level scope from path (e.g., \"lv-1/wall.csv\" -> \"lv-1\")\n const level = path.split('/')[0];\n\n for (let i = 0; i < data.rows.length; i++) {\n const id = data.rows[i].id;\n if (!id) continue;\n\n // Level-scoped uniqueness check\n const scopedKey = `${level}/${id}`;\n const existing = registry.ids.get(scopedKey);\n if (existing) {\n if (existing.table === tableName) {\n registry.issues.push(\n `${path}:${i + 2} duplicate id \"${id}\" (first seen in ${existing.path}:${existing.row})`,\n );\n } else {\n registry.issues.push(\n `${path}:${i + 2} id \"${id}\" conflicts with ${existing.table} in ${existing.path}:${existing.row}`,\n );\n }\n } else {\n registry.ids.set(scopedKey, { table: tableName, path, row: i + 2 });\n }\n\n // Also register in global lookup (for reference resolution)\n registry.allIds.set(id, { table: tableName, path, row: i + 2 });\n }\n}\n","import type { ResolvedTable } from '../schema/types.js';\nimport type { CsvData } from '../utils/csv.js';\nimport type { IdRegistry } from './ids.js';\nimport { ID_PREFIXES } from '../schema/registry.js';\n\nexport function validateReferences(\n path: string,\n table: ResolvedTable,\n data: CsvData,\n idRegistry: IdRegistry,\n): string[] {\n const issues: string[] = [];\n const refFields = table.csvFields.filter((f) => f.type === 'reference');\n\n for (let i = 0; i < data.rows.length; i++) {\n const row = data.rows[i];\n for (const f of refFields) {\n const val = row[f.name];\n if (!val) continue; // empty is OK if not required (required check handles that)\n\n const entry = idRegistry.allIds.get(val);\n if (!entry) {\n issues.push(`${path}:${i + 2} ${f.name} \"${val}\" references non-existent id`);\n continue;\n }\n\n // If reference specifies a target table, validate prefix\n if (f.reference && f.reference !== 'element') {\n const expectedPrefix = ID_PREFIXES[f.reference];\n if (expectedPrefix && !val.startsWith(expectedPrefix + '-')) {\n issues.push(\n `${path}:${i + 2} ${f.name} \"${val}\" should reference ${f.reference} (prefix \"${expectedPrefix}-\")`,\n );\n }\n }\n }\n }\n\n return issues;\n}\n","/**\n * Copy of bimdown-editor/editor/src/geometry/modelChecks.ts (verbatim; web/src/lib/shared-code-drift.test.ts).\n */\n/**\n * Model checks shared by `bimdown build` / `validate` and the editor\n * (Warnings panel, properties): overlapping doors / windows / openings on\n * one host, walls overlapping each other, and numeric fields that must be\n * positive (thickness, widths…). Pure core on a flat,\n * unit-agnostic model; callers pass a tolerance in project units. The CLI\n * keeps a verbatim copy in bimdown-spec/cli/src/build/model-checks.ts\n * (web/src/lib/shared-code-drift.test.ts).\n */\ninterface P { x: number; y: number }\n\n/** A door / window / wall opening on its host: centre `position` from the host start, `width` along it. */\nexport interface CheckInsert {\n id: string;\n /** Id scope (level directory). */\n scope: string;\n table: string;\n hostId: string;\n position: number;\n width: number;\n /** Sill above the host base and height; inserts stacked one over the other don't clash. */\n sill?: number;\n height?: number;\n}\n\n/** A straight wall (or structure wall) centre line. */\nexport interface CheckWall {\n id: string;\n scope: string;\n table: string;\n a: P;\n b: P;\n thickness: number;\n /** Absolute bottom / top; walls one above the other don't clash. */\n z0?: number;\n z1?: number;\n}\n\nexport type ModelProblemCode = 'insert_overlap' | 'wall_overlap';\n\nexport interface ModelProblem {\n code: ModelProblemCode;\n scope: string;\n /** The elements involved (the pair). */\n ids: [string, string];\n tables: [string, string];\n /** insert_overlap: the shared host. */\n hostId?: string;\n /** Overlap length along the host / walls. */\n overlap: number;\n /** wall_overlap: middle of the overlap. */\n at?: P;\n message: string;\n}\n\nconst fmt = (v: number) => v.toFixed(3);\n\n/** Vertical ranges [a0, a1] and [b0, b1] overlap by more than `tol` (unknown ranges count as overlapping). */\nfunction zOverlap(a0: number | undefined, a1: number | undefined, b0: number | undefined, b1: number | undefined, tol: number): boolean {\n if (a0 === undefined || a1 === undefined || b0 === undefined || b1 === undefined) return true;\n return Math.min(a1, b1) - Math.max(a0, b0) > tol;\n}\n\n/** Pairs of inserts on the same host whose spans along it overlap by more than `tol`. */\nexport function insertOverlaps(inserts: CheckInsert[], tol: number, unit = 'm'): ModelProblem[] {\n const out: ModelProblem[] = [];\n const byHost = new Map<string, CheckInsert[]>();\n for (const e of inserts) {\n if (!e.hostId || !Number.isFinite(e.position) || !Number.isFinite(e.width)) continue;\n const key = `${e.scope}\\u0000${e.hostId}`;\n const list = byHost.get(key);\n if (list) list.push(e);\n else byHost.set(key, [e]);\n }\n for (const group of byHost.values()) {\n if (group.length < 2) continue;\n group.sort((a, b) => a.position - b.position);\n for (let i = 0; i < group.length; i++) {\n for (let j = i + 1; j < group.length; j++) {\n const a = group[i], b = group[j];\n const aLo = a.position - a.width / 2, aHi = a.position + a.width / 2;\n const bLo = b.position - b.width / 2, bHi = b.position + b.width / 2;\n const overlap = Math.min(aHi, bHi) - Math.max(aLo, bLo);\n if (overlap <= tol) continue;\n const aTop = a.sill !== undefined && a.height !== undefined ? a.sill + a.height : undefined;\n const bTop = b.sill !== undefined && b.height !== undefined ? b.sill + b.height : undefined;\n if (!zOverlap(a.sill, aTop, b.sill, bTop, tol)) continue;\n out.push({\n code: 'insert_overlap', scope: a.scope, ids: [a.id, b.id], tables: [a.table, b.table], hostId: a.hostId, overlap,\n message: `${a.id} and ${b.id} overlap on ${a.hostId} (${a.id}: ${fmt(aLo)}–${fmt(aHi)} ${unit}, ${b.id}: ${fmt(bLo)}–${fmt(bHi)} ${unit})`,\n });\n }\n }\n }\n return out;\n}\n\n/** Sine of the largest angle (≈1.2°) between two walls still treated as parallel. */\nconst PARALLEL_SIN = 0.02;\n\n/**\n * Pairs of walls of one scope that overlap (Revit \"Highlighted walls\n * overlap\"): parallel, one's centre line inside the other's thickness, and\n * running side by side for more than `minOverlap`.\n */\nexport function wallOverlaps(walls: CheckWall[], tol: number, minOverlap = tol * 10, unit = 'm'): ModelProblem[] {\n const out: ModelProblem[] = [];\n const items = walls\n .map(w => {\n const dx = w.b.x - w.a.x, dy = w.b.y - w.a.y;\n const len = Math.hypot(dx, dy);\n return { w, len, ux: dx / len, uy: dy / len, minX: Math.min(w.a.x, w.b.x) - w.thickness, maxX: Math.max(w.a.x, w.b.x) + w.thickness, minY: Math.min(w.a.y, w.b.y) - w.thickness, maxY: Math.max(w.a.y, w.b.y) + w.thickness };\n })\n .filter(i => i.len > tol)\n .sort((a, b) => a.minX - b.minX);\n for (let i = 0; i < items.length; i++) {\n const A = items[i];\n for (let j = i + 1; j < items.length; j++) {\n const B = items[j];\n if (B.minX > A.maxX) break;\n if (A.w.scope !== B.w.scope || B.minY > A.maxY || B.maxY < A.minY) continue;\n if (Math.abs(A.ux * B.uy - A.uy * B.ux) > PARALLEL_SIN) continue;\n // Centre-line offset, measured across A at B's ends\n const across = (p: P) => -(p.x - A.w.a.x) * A.uy + (p.y - A.w.a.y) * A.ux;\n const off = Math.max(Math.abs(across(B.w.a)), Math.abs(across(B.w.b)));\n if (off >= Math.max(A.w.thickness, B.w.thickness) / 2 - tol) continue;\n const along = (p: P) => (p.x - A.w.a.x) * A.ux + (p.y - A.w.a.y) * A.uy;\n const b0 = along(B.w.a), b1 = along(B.w.b);\n const lo = Math.max(0, Math.min(b0, b1)), hi = Math.min(A.len, Math.max(b0, b1));\n if (hi - lo <= minOverlap) continue;\n if (!zOverlap(A.w.z0, A.w.z1, B.w.z0, B.w.z1, tol)) continue;\n const m = (lo + hi) / 2;\n out.push({\n code: 'wall_overlap', scope: A.w.scope, ids: [A.w.id, B.w.id], tables: [A.w.table, B.w.table], overlap: hi - lo,\n at: { x: A.w.a.x + A.ux * m, y: A.w.a.y + A.uy * m },\n message: `${A.w.id} and ${B.w.id} overlap for ${fmt(hi - lo)} ${unit} — one wall inside the other; delete or shorten one (room boundaries and quantities count both)`,\n });\n }\n }\n return out;\n}\n\n/** Numeric fields that must be greater than 0 when set (an empty value inherits from the type). */\nexport const POSITIVE_FIELDS = new Set([\n 'thickness', 'width', 'height', 'size_x', 'size_y', 'flange', 'web', 'step_count',\n 'u_spacing', 'v_spacing', 'mullion_width', 'mullion_depth', 'frame_width',\n 'baluster_spacing', 'baluster_size', 'top_rail_size', 'conductivity',\n]);\n/** Numeric fields that must not be negative. */\nexport const NON_NEGATIVE_FIELDS = new Set(['position', 'u_grid_count', 'v_grid_count', 'u_value', 'shgc', 'vt', 'load', 'rating', 'voltage', 'poles']);\n\n/** 'positive' / 'non_negative' when `raw` breaks the field's sign rule, else null (empty / non-numeric: other checks). */\nexport function numericFieldError(field: string, raw: string | undefined): 'positive' | 'non_negative' | null {\n if (raw === undefined || raw.trim() === '') return null;\n const v = Number(raw);\n if (!Number.isFinite(v)) return null;\n if (POSITIVE_FIELDS.has(field) && !(v > 0)) return 'positive';\n if (NON_NEGATIVE_FIELDS.has(field) && v < 0) return 'non_negative';\n return null;\n}\n","/**\n * Value range validation — catches millimeter-vs-meter mistakes.\n *\n * Any float field value > threshold is flagged as a likely unit error.\n * Field-specific thresholds override the default where needed.\n */\nimport type { ResolvedTable } from '../schema/types.js';\nimport type { CsvData } from '../utils/csv.js';\nimport { UNIT_TO_M } from '../utils/units.js';\nimport { numericFieldError } from '../build/model-checks.js';\n\n/** Per-field max reasonable values in meters. */\nconst FIELD_MAX: Record<string, number> = {\n elevation: 500, // tallest buildings ~500m\n base_offset: 100,\n top_offset: 100,\n thickness: 2,\n width: 30,\n height: 20,\n size_x: 10,\n size_y: 10,\n length: 100,\n position: 100, // distance in meters along host wall\n start_x: 10000, // site coordinates can be large\n start_y: 10000,\n end_x: 10000,\n end_y: 10000,\n start_z: 500,\n end_z: 500,\n step_count: 200, // not meters, but still bounded\n};\n\n/** Default max for any float field not in FIELD_MAX. */\nconst DEFAULT_MAX = 1000;\n\n/** Deep foundations (drilled piers, piles) are far thicker than any wall or slab. */\nconst TABLE_FIELD_MAX: Record<string, Record<string, number>> = {\n foundation: { thickness: 60 },\n foundation_type: { thickness: 60 },\n // A DXF underlay's origin may sit far from the plan (survey coordinates);\n // scale is units per pixel / point / drawing unit, not a length.\n underlay: { x: 1e7, y: 1e7, scale: 1e6 },\n // Trees, cars and long counters outgrow the 10 m section limit.\n furniture: { size_x: 30, size_y: 30 },\n // Paper millimetres and a scale denominator, not model lengths.\n sheet_viewport: { x: 1e7, y: 1e7, scale: 1e7 },\n};\n\nexport function validateRanges(path: string, table: ResolvedTable, data: CsvData, units = 'm'): string[] {\n const toM = UNIT_TO_M[units] ?? 1;\n const issues: string[] = [];\n\n // Quantities that are not lengths (flow, load, voltage, …) are not range-checked.\n const floatFields = table.csvFields.filter(\n (f) => (f.type === 'float' || f.type === 'int') && f.name !== 'id' && f.unit !== 'none',\n );\n\n // Sign rules shared with the editor (thickness, widths… > 0; positions ≥ 0)\n const numericFields = table.csvFields.filter((f) => f.type === 'float' || f.type === 'int');\n\n for (let i = 0; i < data.rows.length; i++) {\n const row = data.rows[i];\n const rowNum = i + 2; // 1-indexed + header\n\n for (const field of numericFields) {\n const err = numericFieldError(field.name, row[field.name]);\n if (err) issues.push(`${path}:${rowNum} ${field.name}=${row[field.name]} must be ${err === 'positive' ? 'greater than 0' : '0 or more'}`);\n }\n\n for (const field of floatFields) {\n const raw = row[field.name];\n if (raw === undefined || raw === '') continue;\n\n const val = Number(raw);\n if (isNaN(val)) continue;\n\n const max = TABLE_FIELD_MAX[table.name]?.[field.name] ?? FIELD_MAX[field.name] ?? DEFAULT_MAX;\n if (field.name !== 'step_count' && Math.abs(val) * toM > max) {\n issues.push(\n `${path}:${rowNum} ${field.name}=${raw} is out of range for project units \"${units}\" (max reasonable: ${+(max / toM).toPrecision(4)} ${units}) — check the unit`,\n );\n } else if (field.name === 'step_count' && Math.abs(val) > max) {\n issues.push(`${path}:${rowNum} ${field.name}=${raw} is out of range (max reasonable: ${max})`);\n }\n }\n }\n\n return issues;\n}\n","import { parseGeoJsonFile, featureId, type BimDownFeature } from '../utils/geojson.js';\nimport { SPATIAL_3D_TABLES } from '../schema/registry.js';\nimport { UNIT_TO_M } from '../utils/units.js';\n\n/** Expected GeoJSON geometry type(s) per table */\nconst EXPECTED_GEOMETRY: Record<string, Set<'Point' | 'LineString' | 'Polygon'>> = {\n // Line elements → LineString\n wall: new Set(['LineString']),\n structure_wall: new Set(['LineString']),\n curtain_wall: new Set(['LineString']),\n room_separator: new Set(['LineString']),\n stair: new Set(['LineString']),\n stair_run: new Set(['LineString']),\n ramp: new Set(['LineString']),\n railing: new Set(['LineString']),\n beam: new Set(['LineString']),\n brace: new Set(['LineString']),\n duct: new Set(['LineString']),\n pipe: new Set(['LineString']),\n cable_tray: new Set(['LineString']),\n conduit: new Set(['LineString']),\n // Point elements → Point\n column: new Set(['Point']),\n structure_column: new Set(['Point']),\n equipment: new Set(['Point']),\n terminal: new Set(['Point']),\n mep_node: new Set(['Point']),\n furniture: new Set(['Point']),\n // Polygon elements → Polygon\n slab: new Set(['Polygon']),\n roof: new Set(['Polygon']),\n ceiling: new Set(['Polygon']),\n structure_slab: new Set(['Polygon']),\n space: new Set(['Polygon']),\n stair_landing: new Set(['Polygon']),\n // Mixed\n foundation: new Set(['Point', 'LineString', 'Polygon']),\n opening: new Set(['Polygon']),\n};\n\nexport function validateGeoJsonFile(\n displayPath: string,\n fullPath: string,\n csvIds: Set<string>,\n tableName: string,\n units = 'm',\n): string[] {\n const issues: string[] = [];\n\n let fc;\n try {\n fc = parseGeoJsonFile(fullPath);\n } catch (e) {\n issues.push(`${displayPath} failed to parse GeoJSON: ${(e as Error).message}`);\n return issues;\n }\n\n const isSpatial = SPATIAL_3D_TABLES.has(tableName);\n const expected = EXPECTED_GEOMETRY[tableName];\n const seenIds = new Set<string>();\n\n for (let i = 0; i < fc.features.length; i++) {\n const feat = fc.features[i] as BimDownFeature;\n const ctx = `${displayPath}:feature[${i}]`;\n\n if (!feat || feat.type !== 'Feature') {\n issues.push(`${ctx} not a Feature object`);\n continue;\n }\n\n const id = featureId(feat);\n if (!id || id === '<unknown>') {\n issues.push(`${ctx} missing properties.id`);\n continue;\n }\n if (seenIds.has(id)) {\n issues.push(`${ctx} duplicate id \"${id}\"`);\n }\n seenIds.add(id);\n\n if (!csvIds.has(id)) {\n issues.push(`${ctx} id \"${id}\" has no matching CSV row`);\n }\n\n const g = feat.geometry;\n if (!g || !g.type) {\n issues.push(`${ctx} missing geometry`);\n continue;\n }\n\n if (expected && !expected.has(g.type as any)) {\n const allowed = [...expected].join(' or ');\n issues.push(`${ctx} id \"${id}\" geometry type ${g.type} not allowed for ${tableName} (expected ${allowed})`);\n }\n\n issues.push(...validateGeometryCoords(ctx, id, g, isSpatial, units));\n }\n\n return issues;\n}\n\n/** Coordinates beyond this (in meters, converted to the project's units) are almost surely a unit mistake. */\nconst MAX_COORD_M = 1000;\n\nfunction validateGeometryCoords(\n ctx: string,\n id: string,\n g: { type: string; coordinates: any },\n isSpatial: boolean,\n units: string,\n): string[] {\n const issues: string[] = [];\n const max = MAX_COORD_M / (UNIT_TO_M[units] ?? 1);\n\n const checkPosition = (p: any, where: string) => {\n if (!Array.isArray(p) || p.length < 2 || p.length > 3) {\n issues.push(`${ctx} id \"${id}\" ${where} position must be [x,y] or [x,y,z]`);\n return;\n }\n for (let k = 0; k < p.length; k++) {\n const v = p[k];\n if (typeof v !== 'number' || !isFinite(v)) {\n issues.push(`${ctx} id \"${id}\" ${where} non-numeric coordinate at index ${k}`);\n return;\n }\n if (Math.abs(v) > max) {\n issues.push(`${ctx} id \"${id}\" ${where} coordinate ${v} is out of range for project units \"${units}\" (max reasonable: ${+max.toPrecision(4)} ${units}) — check the unit`);\n return;\n }\n }\n if (isSpatial && p.length !== 3) {\n issues.push(`${ctx} id \"${id}\" ${where} spatial element requires 3D coordinates [x,y,z]`);\n }\n if (!isSpatial && p.length === 3) {\n issues.push(`${ctx} id \"${id}\" ${where} level-anchored element should use 2D coordinates (Z lives in base_offset/top_offset properties)`);\n }\n };\n\n if (g.type === 'Point') {\n checkPosition(g.coordinates, 'Point');\n } else if (g.type === 'LineString') {\n if (!Array.isArray(g.coordinates) || g.coordinates.length < 2) {\n issues.push(`${ctx} id \"${id}\" LineString needs at least 2 coordinates`);\n } else {\n checkPosition(g.coordinates[0], 'LineString[0]');\n checkPosition(g.coordinates[g.coordinates.length - 1], 'LineString[last]');\n }\n } else if (g.type === 'Polygon') {\n if (!Array.isArray(g.coordinates) || g.coordinates.length === 0) {\n issues.push(`${ctx} id \"${id}\" Polygon needs at least one ring`);\n } else {\n const ring = g.coordinates[0];\n if (!Array.isArray(ring) || ring.length < 4) {\n issues.push(`${ctx} id \"${id}\" Polygon outer ring needs >= 4 positions (including closing duplicate)`);\n } else {\n checkPosition(ring[0], 'Polygon outer[0]');\n const first = ring[0], last = ring[ring.length - 1];\n if (Array.isArray(first) && Array.isArray(last)) {\n if (first[0] !== last[0] || first[1] !== last[1]) {\n issues.push(`${ctx} id \"${id}\" Polygon outer ring not closed (first ≠ last)`);\n }\n }\n }\n }\n }\n\n return issues;\n}\n","/**\n * Element type validation: type tables, type_layer rows, and instance\n * `type_id` references (see catalog/index.ts for the resolution rule).\n */\nimport type { ResolvedTable } from '../schema/types.js';\nimport type { CsvData } from '../utils/csv.js';\nimport type { IdRegistry } from './ids.js';\nimport { TYPE_TABLES, LAYERED_TYPE_TABLES } from '../schema/registry.js';\nimport {\n catalogFromRows,\n layerTotal,\n typeOfRow,\n typeParamFields,\n typeValues,\n type TypeCatalog,\n} from '../catalog/index.js';\n\nexport interface TypedCsvEntry {\n path: string;\n tableName: string;\n table: ResolvedTable;\n data: CsvData;\n}\n\n/** Catalog from the global/ type tables among the collected CSVs. */\nexport function catalogFromEntries(entries: TypedCsvEntry[]): TypeCatalog {\n const global = entries.filter((e) => e.path.startsWith('global/'));\n return catalogFromRows(\n global.filter((e) => TYPE_TABLES.has(e.tableName)).map((e) => ({ table: e.tableName, rows: e.data.rows })),\n global.find((e) => e.tableName === 'type_layer')?.data.rows ?? [],\n );\n}\n\n/**\n * Fields of `row` that its type supplies (non-empty type value). Used to relax\n * required-field checks: a typed wall may leave `thickness` empty.\n */\nexport function typeSuppliedFields(\n table: ResolvedTable,\n row: Record<string, string>,\n catalog: TypeCatalog,\n): Set<string> {\n const t = table.typeTable ? typeOfRow(table.name, row, catalog) : undefined;\n if (!t) return new Set();\n const values = typeValues(t);\n return new Set(typeParamFields(table.name).filter((f) => values[f] !== undefined));\n}\n\nconst inRange01 = (v: number) => v >= 0 && v <= 1;\n\nexport function validateTypes(\n entries: TypedCsvEntry[],\n catalog: TypeCatalog,\n idRegistry: IdRegistry,\n): string[] {\n const issues: string[] = [];\n\n for (const entry of entries) {\n const { path, tableName, table, data } = entry;\n\n // ── type_layer rows ──\n if (tableName === 'type_layer') {\n const seqs = new Map<string, Set<number>>();\n data.rows.forEach((row, i) => {\n const at = `${path}:${i + 2}`;\n const typeId = row.type_id ?? '';\n const t = catalog.types.get(typeId);\n if (typeId && idRegistry.allIds.has(typeId) && (!t || !LAYERED_TYPE_TABLES.has(t.table))) {\n issues.push(`${at} type_id \"${typeId}\" is not a layered type (${[...LAYERED_TYPE_TABLES].join(', ')})`);\n }\n const seq = Number(row.seq);\n if (row.seq !== undefined && row.seq !== '') {\n if (!Number.isInteger(seq) || seq < 1) {\n issues.push(`${at} seq=${row.seq} must be a positive integer`);\n } else {\n const used = seqs.get(typeId) ?? new Set<number>();\n if (used.has(seq)) issues.push(`${at} seq=${seq} repeats within type ${typeId}`);\n used.add(seq);\n seqs.set(typeId, used);\n }\n }\n const th = Number(row.thickness);\n if (row.thickness && (!Number.isFinite(th) || th <= 0)) {\n issues.push(`${at} thickness=${row.thickness} must be > 0`);\n }\n const k = Number(row.conductivity);\n if (row.conductivity && (!Number.isFinite(k) || k <= 0)) {\n issues.push(`${at} conductivity=${row.conductivity} must be > 0 (W/(m·K))`);\n }\n });\n continue;\n }\n\n // ── type tables ──\n if (TYPE_TABLES.has(tableName)) {\n data.rows.forEach((row, i) => {\n const at = `${path}:${i + 2}`;\n const t = catalog.types.get(row.id ?? '');\n if (t && LAYERED_TYPE_TABLES.has(tableName)) {\n const total = layerTotal(t);\n const own = Number(row.thickness);\n if (row.thickness && total !== undefined && Number.isFinite(own) && Math.abs(own - total) > 5e-4) {\n issues.push(`${at} ${row.id} thickness=${row.thickness} differs from its layers' total ${total} — fix it or leave thickness empty`);\n }\n if (!row.thickness && total === undefined) {\n issues.push(`${at} ${row.id} has neither a thickness nor type_layer rows`);\n }\n }\n for (const f of ['shgc', 'vt']) {\n const v = Number(row[f]);\n if (row[f] && (!Number.isFinite(v) || !inRange01(v))) issues.push(`${at} ${f}=${row[f]} must be between 0 and 1`);\n }\n const u = Number(row.u_value);\n if (row.u_value && (!Number.isFinite(u) || u <= 0)) issues.push(`${at} u_value=${row.u_value} must be > 0 (W/(m²·K))`);\n });\n continue;\n }\n\n // ── instance rows with a type_id ──\n if (!table.typeTable || !data.headers.includes('type_id')) continue;\n const params = typeParamFields(tableName);\n const enumFields = table.csvFields.filter((f) => f.type === 'enum' && f.values && params.includes(f.name));\n data.rows.forEach((row, i) => {\n const typeId = row.type_id;\n if (!typeId) return;\n const at = `${path}:${i + 2}`;\n const target = idRegistry.allIds.get(typeId);\n if (target && target.table !== table.typeTable) {\n issues.push(`${at} type_id \"${typeId}\" is a ${target.table}; ${tableName} takes a ${table.typeTable}`);\n return;\n }\n const t = typeOfRow(tableName, row, catalog);\n if (!t) return;\n const values = typeValues(t);\n for (const f of enumFields) {\n if ((row[f.name] ?? '') !== '') continue; // instance value checked by the enum pass\n const v = values[f.name];\n if (v !== undefined && !f.values!.includes(v)) {\n issues.push(`${at} type ${typeId} gives ${f.name}=\"${v}\", which ${tableName} does not accept (${f.values!.join(', ')})`);\n }\n }\n });\n }\n\n return issues;\n}\n","/**\n * `furniture` checks the schema can't express: the variant must belong to the\n * row's family (the family enum itself is checked by the generic enum pass).\n */\nimport type { CsvData } from '../utils/csv.js';\nimport { getFurnitureFamily, variantIds } from './library.js';\n\nexport function validateFurnitureRows(path: string, data: CsvData): string[] {\n const issues: string[] = [];\n for (let i = 0; i < data.rows.length; i++) {\n const row = data.rows[i];\n const fam = getFurnitureFamily(row.family);\n const variant = row.variant ?? '';\n if (!fam || variant === '') continue;\n const ids = variantIds(fam);\n if (!ids.includes(variant)) {\n issues.push(\n ids.length > 0\n ? `${path}:${i + 2} variant \"${variant}\" is not a variant of family \"${fam.id}\" (${ids.join(', ')})`\n : `${path}:${i + 2} family \"${fam.id}\" has no variants; leave variant empty`,\n );\n }\n }\n return issues;\n}\n","/**\n * Sheet checks (global/sheet.csv + global/sheet_viewport.csv) beyond the\n * generic header, enum and reference validation: unique sheet numbers, dates,\n * and each viewport naming what it shows (a plan's level, a section of\n * global/view.csv or an elevation direction, a schedule), a positive scale\n * and a centre on its sheet's paper.\n */\nimport type { CsvData } from '../utils/csv.js';\nimport type { IdRegistry } from './ids.js';\nimport { ELEVATION_VIEW_IDS } from './annotations.js';\n\n/** ISO 216 landscape paper, mm. */\nexport const SHEET_PAPER: Record<string, { w: number; h: number }> = {\n A0: { w: 1189, h: 841 }, A1: { w: 841, h: 594 }, A2: { w: 594, h: 420 }, A3: { w: 420, h: 297 }, A4: { w: 297, h: 210 },\n};\n\nexport function validateSheets(sheets: CsvData | null, viewports: CsvData | null, registry: IdRegistry): string[] {\n const issues: string[] = [];\n const paperOf = new Map<string, { w: number; h: number }>();\n if (sheets) {\n const numbers = new Map<string, number>();\n sheets.rows.forEach((row, i) => {\n const at = `global/sheet.csv:${i + 2}`;\n paperOf.set(row.id, SHEET_PAPER[row.paper || 'A1'] ?? SHEET_PAPER.A1);\n for (const f of ['revision_date', 'issue_date']) {\n const v = row[f] ?? '';\n if (v && !/^\\d{4}-\\d{2}-\\d{2}$/.test(v)) issues.push(`${at} ${f}=\"${v}\" is not a YYYY-MM-DD date`);\n }\n const n = (row.number ?? '').trim();\n if (!n) return;\n const prev = numbers.get(n);\n if (prev) issues.push(`${at} sheet number \"${n}\" is already used on line ${prev}`);\n else numbers.set(n, i + 2);\n });\n }\n if (!viewports) return issues;\n viewports.rows.forEach((row, i) => {\n const at = `global/sheet_viewport.csv:${i + 2}`;\n const type = row.view_type;\n const viewId = (row.view_id ?? '').trim();\n if (type === 'plan' && !row.level_id) issues.push(`${at} a plan viewport needs level_id`);\n if (type === 'section') {\n if (!viewId) issues.push(`${at} a section viewport needs view_id (a section of global/view.csv)`);\n else if (registry.allIds.get(viewId)?.table !== 'view') issues.push(`${at} view_id \"${viewId}\" is not a section of global/view.csv`);\n }\n if (type === 'elevation' && !ELEVATION_VIEW_IDS.includes(viewId)) {\n issues.push(`${at} an elevation viewport needs view_id north, south, east or west`);\n }\n if (type === 'schedule' && !row.schedule) issues.push(`${at} a schedule viewport needs schedule`);\n const scale = row.scale ?? '';\n if (scale !== '' && !(Number.isInteger(Number(scale)) && Number(scale) > 0)) {\n issues.push(`${at} scale=\"${scale}\" must be a positive whole number (100 = 1:100)`);\n }\n for (const f of ['x', 'y']) {\n const v = row[f];\n if (v !== undefined && v !== '' && !Number.isFinite(Number(v))) issues.push(`${at} ${f}=\"${v}\" is not a number`);\n }\n const paper = paperOf.get(row.sheet_id);\n const x = Number(row.x), y = Number(row.y);\n if (paper && row.x !== '' && row.y !== '' && Number.isFinite(x) && Number.isFinite(y) && (x < 0 || y < 0 || x > paper.w || y > paper.h)) {\n issues.push(`${at} centre (${x}, ${y}) mm is off its ${paper.w}×${paper.h} mm sheet`);\n }\n });\n return issues;\n}\n","/**\n * Model groups (model_group.csv in a level directory + `group_id` on the\n * members). Generic reference validation already checks that a `group_id`\n * names an existing `mg-` row; here: the group lives on the member's own\n * level, its numbers parse and it has members. `groupWarnings` (build) flags\n * instances of one group whose member sets differ.\n */\nimport type { CsvData } from '../utils/csv.js';\nimport type { IdRegistry } from './ids.js';\n\ninterface Entry {\n path: string;\n tableName: string;\n data: CsvData;\n}\n\nconst NUMERIC = ['x', 'y', 'rotation'];\n\nexport function validateGroups(entries: readonly Entry[], registry: IdRegistry): string[] {\n const issues: string[] = [];\n // \"level/mg-1\" → member count\n const members = new Map<string, number>();\n for (const e of entries) {\n if (e.tableName === 'model_group' || !e.data.headers.includes('group_id')) continue;\n const level = e.path.split('/')[0];\n e.data.rows.forEach((row, i) => {\n const gid = (row.group_id ?? '').trim();\n if (!gid) return;\n if (level === 'global') {\n issues.push(`${e.path}:${i + 2} group_id \"${gid}\": elements in global/ cannot be grouped (groups belong to one level)`);\n return;\n }\n const g = registry.ids.get(`${level}/${gid}`);\n if (registry.allIds.has(gid) && (!g || g.table !== 'model_group')) {\n issues.push(`${e.path}:${i + 2} group_id \"${gid}\" is not a model_group on ${level}`);\n return;\n }\n members.set(`${level}/${gid}`, (members.get(`${level}/${gid}`) ?? 0) + 1);\n });\n }\n for (const e of entries) {\n if (e.tableName !== 'model_group') continue;\n const level = e.path.split('/')[0];\n e.data.rows.forEach((row, i) => {\n const at = `${e.path}:${i + 2}`;\n for (const f of NUMERIC) {\n const v = row[f];\n if (v !== undefined && v !== '' && !Number.isFinite(Number(v))) issues.push(`${at} ${f}=\"${v}\" is not a number`);\n }\n if (row.id && !members.has(`${level}/${row.id}`)) issues.push(`${at} model group \"${row.id}\" has no members (no element has group_id=${row.id})`);\n });\n }\n return issues;\n}\n\n/**\n * Instances sharing a name should hold the same members (per table). A\n * mismatch is a warning: the files stay valid, but editing the group in an\n * editor will make the instances identical again.\n */\nexport function groupWarnings(entries: readonly Entry[]): string[] {\n // \"level/mg-1\" → name\n const nameOf = new Map<string, string>();\n for (const e of entries) {\n if (e.tableName !== 'model_group') continue;\n const level = e.path.split('/')[0];\n for (const row of e.data.rows) if (row.id) nameOf.set(`${level}/${row.id}`, row.name ?? '');\n }\n if (nameOf.size === 0) return [];\n // instance → \"table×n\" counts\n const counts = new Map<string, Map<string, number>>();\n for (const key of nameOf.keys()) counts.set(key, new Map());\n for (const e of entries) {\n if (e.tableName === 'model_group' || !e.data.headers.includes('group_id')) continue;\n const level = e.path.split('/')[0];\n for (const row of e.data.rows) {\n const c = counts.get(`${level}/${(row.group_id ?? '').trim()}`);\n if (c) c.set(e.tableName, (c.get(e.tableName) ?? 0) + 1);\n }\n }\n const signature = (c: Map<string, number>) => [...c].sort(([a], [b]) => a.localeCompare(b)).map(([t, n]) => `${n} ${t}`).join(', ');\n const byName = new Map<string, { key: string; sig: string }[]>();\n for (const [key, name] of nameOf) {\n const list = byName.get(name) ?? [];\n list.push({ key, sig: signature(counts.get(key)!) });\n byName.set(name, list);\n }\n const warnings: string[] = [];\n for (const [name, list] of byName) {\n const first = list[0];\n for (const other of list.slice(1)) {\n if (other.sig !== first.sig) {\n warnings.push(`model group \"${name}\": ${other.key} (${other.sig || 'empty'}) differs from ${first.key} (${first.sig || 'empty'})`);\n }\n }\n }\n return warnings;\n}\n","/**\n * Building envelope checks: roof edge slopes / extrusion profiles against\n * the roof outline, wall top attachment targets, and shafts (openings with a\n * top_level_id) versus hosted openings, and slab slope arrows.\n */\nimport { existsSync } from 'node:fs';\nimport { join } from 'node:path';\nimport type { CsvData } from '../utils/csv.js';\nimport { parseGeoJsonFile, type BimDownFeature } from '../utils/geojson.js';\nimport type { IdRegistry } from './ids.js';\nimport { parseSlopeArrow } from '../geo/slab-slope.js';\n\ninterface Entry { path: string; tableName: string; data: CsvData }\n\nconst ATTACH_TARGETS = new Set(['roof', 'slab', 'structure_slab']);\n/** Tables whose outline may be associated with walls (`boundary_walls`), and what they may list. */\nconst BOUNDED = new Set(['slab', 'structure_slab', 'roof', 'ceiling']);\nconst BOUNDING = new Set(['wall', 'structure_wall', 'curtain_wall', 'room_separator']);\n\n/** Features of `<dir>/<file>.geojson` by id (empty when missing / unreadable). */\nfunction features(dirPath: string, file: string): Map<string, BimDownFeature> {\n const out = new Map<string, BimDownFeature>();\n const p = join(dirPath, `${file}.geojson`);\n if (!existsSync(p)) return out;\n try {\n for (const f of parseGeoJsonFile(p).features) out.set(String(f.properties?.id ?? ''), f);\n } catch { /* reported by the GeoJSON validator */ }\n return out;\n}\n\n/** Vertices of a polygon's outer ring, without the closing repeat. */\nfunction ringLength(f: BimDownFeature | undefined): number | null {\n if (!f || f.geometry.type !== 'Polygon') return null;\n const ring = f.geometry.coordinates[0] ?? [];\n const n = ring.length;\n if (n >= 2 && ring[0][0] === ring[n - 1][0] && ring[0][1] === ring[n - 1][1]) return n - 1;\n return n;\n}\n\nexport function validateEnvelope(\n dir: string,\n entries: Entry[],\n ids: IdRegistry,\n levelElevation: Map<string, number>,\n): string[] {\n const issues: string[] = [];\n for (const e of entries) {\n const levelDir = e.path.split('/')[0];\n const at = (i: number) => `${e.path}:${i + 2}`;\n if (e.tableName === 'roof') {\n const geo = features(join(dir, levelDir), 'roof');\n e.data.rows.forEach((row, i) => {\n const slopes = (row.edge_slopes ?? '').trim();\n if (slopes) {\n const vals = slopes.split(';').map(v => Number(v.trim()));\n if (vals.some(v => !Number.isFinite(v) || v < 0 || v >= 90)) {\n issues.push(`${at(i)} edge_slopes \"${slopes}\" must be semicolon-separated slopes in degrees (0 ≤ slope < 90)`);\n }\n const n = ringLength(geo.get(row.id));\n if (n !== null && vals.length !== n) {\n issues.push(`${at(i)} edge_slopes has ${vals.length} values but the roof outline has ${n} edges (one per edge, edge i from vertex i to i+1)`);\n }\n }\n if (row.roof_type === 'extrusion') {\n const pts = (row.profile ?? '').split(';').filter(s => s.trim()).map(p => p.split(',').map(v => Number(v.trim())));\n if (pts.length < 2 || pts.some(p => p.length !== 2 || !p.every(Number.isFinite))) {\n issues.push(`${at(i)} extrusion roof needs profile \"u,z;u,z;...\" with at least two points`);\n }\n }\n });\n }\n if (e.tableName === 'wall' || e.tableName === 'structure_wall') {\n e.data.rows.forEach((row, i) => {\n const target = row.top_attach_id;\n if (!target) return;\n const t = ids.allIds.get(target);\n if (t && !ATTACH_TARGETS.has(t.table)) {\n issues.push(`${at(i)} top_attach_id \"${target}\" is a ${t.table}; a wall top attaches to a roof, slab or structure_slab`);\n }\n });\n }\n if (e.tableName === 'slab' || e.tableName === 'structure_slab') {\n // Sloped floor: the slope arrow parses (tail ≠ head)\n e.data.rows.forEach((row, i) => {\n const a = parseSlopeArrow(row.slope_arrow);\n if (typeof a === 'string') issues.push(`${at(i)} slope_arrow \"${row.slope_arrow}\" ${a}`);\n });\n }\n if (BOUNDED.has(e.tableName)) {\n // boundary_walls: the walls (same level or global) the outline was picked from\n e.data.rows.forEach((row, i) => {\n for (const id of (row.boundary_walls ?? '').split(';').map(s => s.trim()).filter(Boolean)) {\n const t = ids.ids.get(`${levelDir}/${id}`) ?? ids.ids.get(`global/${id}`);\n if (!t) issues.push(`${at(i)} boundary_walls: \"${id}\" is not a wall on ${levelDir} or in global/`);\n else if (!BOUNDING.has(t.table)) issues.push(`${at(i)} boundary_walls: \"${id}\" is a ${t.table}; list walls, curtain walls or room separators`);\n }\n });\n }\n if (e.tableName === 'opening') {\n const geo = features(join(dir, levelDir), 'opening');\n e.data.rows.forEach((row, i) => {\n if (row.top_level_id) {\n if (geo.get(row.id)?.geometry.type !== 'Polygon') {\n issues.push(`${at(i)} a shaft (top_level_id set) needs a Polygon in opening.geojson`);\n }\n const base = levelElevation.get(levelDir), top = levelElevation.get(row.top_level_id);\n const off = (v: string | undefined) => Number(v || 0) || 0;\n if (base !== undefined && top !== undefined && top + off(row.top_offset) <= base + off(row.base_offset)) {\n issues.push(`${at(i)} shaft top (${row.top_level_id}) must be above its base level`);\n }\n } else if (!row.host_id) {\n issues.push(`${at(i)} host_id is required (a wall, slab or roof), unless the opening is a shaft with top_level_id`);\n }\n });\n }\n }\n return issues;\n}\n","/**\n * Curtain wall grid / panel fields (spec readme \"Curtain Wall Grids and Panels\").\n * Syntax problems are issues (validate); positions outside the wall, panel\n * cells outside the grid and doors above the bottom row are warnings (build),\n * since a wall edited shorter leaves such values harmless but ignored.\n */\nimport { existsSync } from 'node:fs';\nimport { join } from 'node:path';\nimport type { CsvData } from '../utils/csv.js';\nimport { readCsv } from '../utils/csv.js';\nimport { discoverLayout } from '../utils/fs.js';\nimport { parseGeoJsonFile, extractLineGeometry } from '../utils/geojson.js';\nimport { effectiveRows } from '../catalog/index.js';\nimport { GEOJSON_FILE_NAMES } from '../schema/registry.js';\nimport { PANEL_KINDS, gridLines, cellKinds, parseNumberList, parsePanels } from '../curtain-grid.js';\n\nconst LIST_FIELDS = ['v_grids', 'u_grids'] as const;\n\n/** List syntax and panel kinds of one curtain_wall.csv. */\nexport function validateCurtainWallCsv(path: string, data: CsvData): string[] {\n const issues: string[] = [];\n data.rows.forEach((row, i) => {\n const at = `${path}:${i + 2}`;\n for (const f of LIST_FIELDS) {\n const { bad } = parseNumberList(row[f]);\n if (bad.length > 0) issues.push(`${at} ${f}=\"${row[f]}\" must be semicolon-separated numbers (e.g. 1.2;2.4), bad: ${bad.join(', ')}`);\n }\n const { rules, bad } = parsePanels(row.panels);\n if (bad.length > 0) issues.push(`${at} panels: \"${bad.join('; ')}\" must be col:row=kind (e.g. 1:0=door, *:0=solid)`);\n const kinds = [...new Set(rules.map((r) => r.kind).filter((k) => !(PANEL_KINDS as readonly string[]).includes(k)))];\n if (kinds.length > 0) issues.push(`${at} panels: unknown kind ${kinds.join(', ')} (use ${PANEL_KINDS.join(', ')})`);\n });\n return issues;\n}\n\n/** Positions against the wall's length / height, panel cells against the grid. */\nexport function curtainWallWarnings(dir: string): string[] {\n const warnings: string[] = [];\n const layout = discoverLayout(dir);\n const elevations = new Map<string, number>();\n const levelCsv = join(layout.globalDir, 'level.csv');\n if (existsSync(levelCsv)) {\n for (const r of readCsv(levelCsv).rows) {\n const e = parseFloat(r.elevation ?? '');\n if (r.id && Number.isFinite(e)) elevations.set(r.id, e);\n }\n }\n\n for (const d of layout.levelDirs) {\n const csvPath = join(d.path, 'curtain_wall.csv');\n const geoPath = join(d.path, `${GEOJSON_FILE_NAMES.curtain_wall}.geojson`);\n if (!existsSync(csvPath) || !existsSync(geoPath)) continue;\n const lines = new Map<string, { length: number; baseOffset: number; topOffset: number }>();\n try {\n for (const f of parseGeoJsonFile(geoPath).features) {\n if (f.geometry.type !== 'LineString') continue;\n const num = (v: unknown) => (typeof v === 'number' ? v : parseFloat(String(v ?? '')) || 0);\n lines.set(String(f.properties.id ?? ''), {\n length: extractLineGeometry(f).length,\n baseOffset: num(f.properties.base_offset),\n topOffset: num(f.properties.top_offset),\n });\n }\n } catch { continue; }\n\n const rows = effectiveRows(dir, 'curtain_wall', readCsv(csvPath).rows);\n rows.forEach((row, i) => {\n const g = lines.get(row.id ?? '');\n if (!g) return;\n const at = `[warn] ${d.name}/curtain_wall.csv:${i + 2}`;\n const baseEl = elevations.get(d.name);\n const topEl = row.top_level_id ? elevations.get(row.top_level_id) : undefined;\n const height = baseEl !== undefined && topEl !== undefined ? topEl + g.topOffset - (baseEl + g.baseOffset) : undefined;\n\n const outside = (field: string, extent: number | undefined, what: string) => {\n if (extent === undefined) return;\n const off = parseNumberList(row[field]).values.filter((v) => v <= 0 || v >= extent);\n if (off.length > 0) warnings.push(`${at} ${field} ${off.join(', ')} outside the wall ${what} ${+extent.toFixed(3)} (ignored)`);\n };\n outside('v_grids', g.length, 'length');\n outside('u_grids', height, 'height');\n\n const { rules } = parsePanels(row.panels);\n if (rules.length === 0) return;\n const cols = gridLines(row.v_grids, row.v_grid_count, row.v_spacing, g.length).length + 1;\n // Unknown height (no top level): rows are known only from an explicit list or a count.\n const spacingRows = (row.u_grids ?? '').trim() === '' && (row.u_grid_count ?? '').trim() === '' && parseFloat(row.u_spacing ?? '') > 0;\n const rowsN = height !== undefined || !spacingRows\n ? gridLines(row.u_grids, row.u_grid_count, row.u_spacing, height ?? Number.MAX_VALUE).length + 1\n : Infinity;\n for (const r of rules) {\n if ((r.col !== '*' && r.col >= cols) || (r.row !== '*' && r.row >= rowsN)) {\n warnings.push(`${at} panels ${r.col}:${r.row}=${r.kind} is outside the ${cols} x ${rowsN} grid (ignored)`);\n } else if ((r.kind === 'door' || r.kind === 'double_door') && r.row !== 0) {\n warnings.push(`${at} panels ${r.col}:${r.row}=${r.kind}: doors belong in row 0 (the bottom row)`);\n }\n }\n // door_numbers: one mark per door panel, in cell order\n const marks = (row.door_numbers ?? '').split(';').filter(s => s.trim());\n if (marks.length > 0 && Number.isFinite(rowsN)) {\n const kinds = cellKinds(rules, cols, rowsN);\n const doors = kinds.flat().filter(k => k === 'door' || k === 'double_door').length;\n if (marks.length > doors) warnings.push(`${at} door_numbers lists ${marks.length} marks for ${doors} door panel(s) (extra marks ignored)`);\n }\n });\n }\n return warnings;\n}\n","/**\n * Stairs and railings (spec stair.yaml, railing.yaml): structural issues\n * (parts and railings hosted on a stair / slab, multi-storey top level above\n * the base) and stair-calculator warnings (riser, going, 2R+G, width,\n * landings level with their runs).\n */\nimport { join } from 'node:path';\nimport { existsSync } from 'node:fs';\nimport { readCsv } from '../utils/csv.js';\nimport { discoverLayout } from '../utils/fs.js';\nimport { UNIT_TO_M, projectUnits } from '../utils/units.js';\nimport { loadStairs } from '../stair/model.js';\nimport { STAIR_LIMITS, stairCalc } from '../stair/geometry.js';\n\nexport interface StairFindings {\n issues: string[];\n warnings: string[];\n}\n\nconst mm = (m: number) => `${Math.round(m * 1000)} mm`;\n\nexport function validateStairs(dir: string): StairFindings {\n const issues: string[] = [];\n const warnings: string[] = [];\n const upm = 1 / UNIT_TO_M[projectUnits(dir)];\n const layout = discoverLayout(dir);\n const elevations = new Map<string, number>();\n const levelCsv = join(layout.globalDir, 'level.csv');\n if (existsSync(levelCsv)) {\n try { for (const r of readCsv(levelCsv).rows) elevations.set(r.id, parseFloat(r.elevation) || 0); } catch { /* reported elsewhere */ }\n }\n const L = STAIR_LIMITS;\n for (const d of loadStairs(dir)) {\n for (const o of d.orphans) {\n if (o.hostId) issues.push(`${d.dir}/${o.table}.csv:${o.line} host_id \"${o.hostId}\" is not a stair`);\n }\n for (const s of d.stairs) {\n const at = `${d.dir}/stair.csv:${s.line} ${s.id}`;\n const top = s.row.multistory_top_level_id;\n if (top && elevations.has(top) && d.dir !== 'global' && (elevations.get(top)! <= (elevations.get(d.dir) ?? 0) + 1e-6)) {\n issues.push(`${at} multistory_top_level_id \"${top}\" must be a level above the stair's base level`);\n }\n const calc = stairCalc(s.asm, upm, s.reps.map(r => r.scale));\n if (!calc) continue;\n for (const c of calc.checks) {\n if (c.ok) continue;\n switch (c.key) {\n case 'riser': warnings.push(`${at} riser ${mm(c.value)} outside ${mm(L.riserMin)}–${mm(L.riserMax)} (${calc.risers} risers over ${mm(calc.rise)}${s.reps.length > 1 ? `, ${s.reps.length} storeys` : ''})`); break;\n case 'going': warnings.push(`${at} going ${mm(c.value)} below ${mm(L.goingMin)}${c.where && c.where !== s.id ? ` (run ${c.where})` : ''}`); break;\n case 'blondel': warnings.push(`${at} 2R+G ${mm(c.value)} outside ${mm(L.blondelMin)}–${mm(L.blondelMax)}`); break;\n case 'width': warnings.push(`${at} width ${mm(c.value)} below ${mm(L.widthMin)}${c.where && c.where !== s.id ? ` (run ${c.where})` : ''}`); break;\n case 'landing': warnings.push(`${at} landing ${c.where} top is ${mm(c.value)} off the run arriving on it`); break;\n }\n }\n }\n for (const r of d.railings) {\n const at = `${d.dir}/railing.csv:${r.line} ${r.id}`;\n if (r.host === 'missing') issues.push(`${at} host_id \"${r.row.host_id}\" must be a stair or a slab`);\n if (r.host === 'stair' && r.row.side !== 'left' && r.row.side !== 'right') {\n issues.push(`${at} a railing on a stair needs side = left | right`);\n }\n if (r.host !== 'stair' && r.paths.length === 0 && r.host !== 'missing') {\n warnings.push(`${at} no geometry: a sketched railing needs a LineString in railing.geojson (or host_id = a stair)`);\n }\n }\n }\n return { issues, warnings };\n}\n","import { writeFileSync } from 'node:fs';\nimport { dirname, join } from 'node:path';\nimport {\n stringifyFeatureCollection,\n type BimDownFeature,\n type BimDownFeatureCollection,\n} from '../utils/geojson.js';\nimport { dirFiles } from '../utils/fs.js';\nimport { projectUnits } from '../utils/units.js';\nimport { collectBoundaryLines, roomNetArea, unitsPerMetre, type BoundaryLine } from './room-area.js';\nimport type { Face, RoomIssue } from './room-faces.js';\nimport { deriveLevelRooms, type ProjectFiles } from './project-rooms.js';\n\nexport type { RoomIssue };\n\nexport interface SpaceBoundaryResult {\n warnings: string[];\n geojsonWritten: boolean;\n roomIssues: RoomIssue[];\n}\n\n// ─── Main entry point ───────────────────────────────────\n\n/**\n * Rooms of one level folder: faces, seed matching and overlap / leak checks\n * (build/project-rooms.ts, the same code as the IFC importer's report), then\n * space.geojson with each room's net area. Global boundary elements count when\n * `globalDir` is given.\n */\nexport function computeSpaceBoundaries(\n levelDir: { name: string; path: string },\n globalDir?: string,\n): SpaceBoundaryResult {\n const root = dirname(levelDir.path);\n const all = dirFiles(root);\n const files: ProjectFiles = globalDir ? all : { read: (p) => (p.startsWith('global/') ? undefined : all.read(p)), write: all.write };\n const { warnings, rooms } = deriveLevelRooms(files, levelDir.name);\n const roomIssues: RoomIssue[] = rooms ? [...rooms.roomIssues] : [];\n if (!rooms || rooms.matched.size === 0) return { warnings, geojsonWritten: false, roomIssues };\n\n // space.geojson (with each room's net area at the wall faces)\n const lines = collectBoundaryLines(levelDir.path);\n if (globalDir) lines.push(...collectBoundaryLines(globalDir));\n // Redundant rooms: every seed but the first in a shared area (area counted once).\n const redundant = new Set(rooms.roomIssues.filter((r) => r.kind === 'shared').flatMap((r) => r.spaceIds.slice(1)));\n writeSvg(levelDir.path, rooms.matched, lines, unitsPerMetre(projectUnits(root)), redundant);\n return { warnings, geojsonWritten: true, roomIssues };\n}\n\n// ─── GeoJSON output ─────────────────────────────────────\n\nfunction writeSvg(levelPath: string, matchedSpaces: Map<string, Face>, lines: BoundaryLine[], upm: number, redundant: Set<string>): void {\n const features: BimDownFeature[] = [];\n for (const [spaceId, face] of matchedSpaces) {\n // Close the ring per RFC 7946\n const ring = face.polygon.map((p) => [\n Number(p.x.toFixed(3)),\n Number(p.y.toFixed(3)),\n ] as [number, number]);\n if (ring.length === 0) continue;\n const first = ring[0], last = ring[ring.length - 1];\n if (first[0] !== last[0] || first[1] !== last[1]) ring.push([first[0], first[1]]);\n features.push({\n type: 'Feature',\n properties: redundant.has(spaceId)\n ? { id: spaceId, net_area: 0, redundant: true }\n : { id: spaceId, net_area: Number(roomNetArea(face.polygon, lines, upm).toFixed(4)) },\n geometry: { type: 'Polygon', coordinates: [ring] },\n });\n }\n const fc: BimDownFeatureCollection = { type: 'FeatureCollection', features };\n writeFileSync(join(levelPath, 'space.geojson'), stringifyFeatureCollection(fc), 'utf-8');\n}\n","/**\n * Net room area from a project folder: reads the boundary lines (with their\n * effective thickness) that `room-net-area.ts` offsets rooms by.\n */\nimport { existsSync } from 'node:fs';\nimport { dirname, join } from 'node:path';\nimport { parseGeoJsonFile, extractLineGeometry } from '../utils/geojson.js';\nimport { readCsv } from '../utils/csv.js';\nimport { effectiveRows } from '../catalog/index.js';\nimport { GEOJSON_FILE_NAMES } from '../schema/registry.js';\nimport { UNIT_TO_M } from '../utils/units.js';\n\nexport { netRoomOutline, roomNetArea, type BoundaryLine } from './room-net-area.js';\nimport type { BoundaryLine } from './room-net-area.js';\n\nconst BOUNDARY_TABLES = ['wall', 'structure_wall', 'curtain_wall', 'room_separator'];\n\n/** Boundary lines of one level (or global/) folder with their effective thickness. */\nexport function collectBoundaryLines(dirPath: string): BoundaryLine[] {\n const out: BoundaryLine[] = [];\n const projectDir = dirname(dirPath);\n for (const table of BOUNDARY_TABLES) {\n const geomPath = join(dirPath, `${GEOJSON_FILE_NAMES[table] ?? table}.geojson`);\n if (!existsSync(geomPath)) continue;\n const thickness = new Map<string, number>();\n const csvPath = join(dirPath, `${table}.csv`);\n if (table !== 'room_separator' && existsSync(csvPath)) {\n try {\n for (const r of effectiveRows(projectDir, table, readCsv(csvPath).rows)) {\n const t = parseFloat(r.thickness ?? '');\n if (r.id && Number.isFinite(t) && t > 0) thickness.set(r.id, t);\n }\n } catch { /* unreadable CSV: walls count as thin */ }\n }\n try {\n for (const f of parseGeoJsonFile(geomPath).features) {\n if (f.geometry.type !== 'LineString') continue;\n const id = String(f.properties?.id ?? '');\n const lg = extractLineGeometry(f);\n out.push({\n start: { x: lg.start_x, y: lg.start_y }, end: { x: lg.end_x, y: lg.end_y },\n half: table === 'room_separator' ? 0 : (thickness.get(id) ?? 0) / 2,\n });\n }\n } catch { /* skip */ }\n }\n return out;\n}\n\n/** Model units per metre for a project unit name. */\nexport function unitsPerMetre(unit: string): number {\n return 1 / (UNIT_TO_M[unit as keyof typeof UNIT_TO_M] ?? 1);\n}\n","/**\n * Net room area (`net_area`): the derived room outline (wall centre lines, as\n * in space.geojson) with every edge moved inward by half the thickness of the\n * wall it lies on — the area at the wall finish faces, Revit's default room\n * area. Room separators and edges on no wall stay put. `area` keeps the\n * centre-line value for backward compatibility.\n *\n * No file I/O (the IFC importer runs it in the browser). Mirror of the\n * editor's geometry/roomArea.ts (tags, schedules, plan sheets and IFC\n * NetFloorArea use it); keep both in step.\n */\ntype Pt = { x: number; y: number };\n\n/** A boundary line with the half thickness it takes off a room. */\nexport interface BoundaryLine { start: Pt; end: Pt; half: number }\n\n/** Edge-on-wall tolerance in metres (scaled to the project unit). */\nconst ON_LINE_TOL_M = 0.02;\n\nfunction signedArea(v: readonly Pt[]): number {\n let s = 0;\n for (let i = 0; i < v.length; i++) {\n const a = v[i], b = v[(i + 1) % v.length];\n s += a.x * b.y - b.x * a.y;\n }\n return s / 2;\n}\n\nfunction cleanRing(pts: readonly Pt[], tol = 1e-6): Pt[] {\n const out: Pt[] = [];\n for (const p of pts) {\n const last = out[out.length - 1];\n if (!last || Math.hypot(p.x - last.x, p.y - last.y) > tol) out.push(p);\n }\n while (out.length > 1 && Math.hypot(out[0].x - out[out.length - 1].x, out[0].y - out[out.length - 1].y) <= tol) out.pop();\n return out;\n}\n\nfunction distToSegment(p: Pt, a: Pt, b: Pt): number {\n const dx = b.x - a.x, dy = b.y - a.y;\n const l2 = dx * dx + dy * dy;\n const t = l2 > 0 ? Math.max(0, Math.min(1, ((p.x - a.x) * dx + (p.y - a.y) * dy) / l2)) : 0;\n return Math.hypot(p.x - (a.x + t * dx), p.y - (a.y + t * dy));\n}\n\n/** Net outline of a room polygon bounded by `lines`, or null when the offset degenerates. */\nexport function netRoomOutline(polygon: readonly Pt[], lines: BoundaryLine[], upm = 1): Pt[] | null {\n const tol = ON_LINE_TOL_M * upm;\n const ring = cleanRing(polygon);\n const edges: { a: Pt; b: Pt; half: number }[] = [];\n for (let i = 0; i < ring.length; i++) {\n const a = ring[i], b = ring[(i + 1) % ring.length];\n if (Math.hypot(b.x - a.x, b.y - a.y) < 1e-6 * upm) continue;\n const mid = { x: (a.x + b.x) / 2, y: (a.y + b.y) / 2 };\n const wall = lines.find((w) => distToSegment(a, w.start, w.end) < tol && distToSegment(b, w.start, w.end) < tol && distToSegment(mid, w.start, w.end) < tol);\n edges.push({ a, b, half: wall ? wall.half : 0 });\n }\n const n = edges.length;\n if (n < 3) return null;\n const sign = signedArea(edges.map((e) => e.a)) >= 0 ? 1 : -1;\n const offs = edges.map((e) => {\n const dx = e.b.x - e.a.x, dy = e.b.y - e.a.y;\n const l = Math.hypot(dx, dy);\n const nx = (-dy / l) * sign, ny = (dx / l) * sign;\n return { p: { x: e.a.x + nx * e.half, y: e.a.y + ny * e.half }, u: { x: dx / l, y: dy / l } };\n });\n const out: Pt[] = [];\n for (let i = 0; i < n; i++) {\n const L1 = offs[(i + n - 1) % n], L2 = offs[i];\n const den = L1.u.x * L2.u.y - L1.u.y * L2.u.x;\n if (Math.abs(den) < 1e-9) { out.push(L2.p); continue; }\n const t = ((L2.p.x - L1.p.x) * L2.u.y - (L2.p.y - L1.p.y) * L2.u.x) / den;\n out.push({ x: L1.p.x + L1.u.x * t, y: L1.p.y + L1.u.y * t });\n }\n const gross = Math.abs(signedArea(edges.map((e) => e.a)));\n const net = Math.abs(signedArea(out));\n if (!(net > 0) || net > gross + 1e-9 * Math.max(1, gross) || Math.sign(signedArea(out)) !== sign) return null;\n return out;\n}\n\n/** Net area of a room polygon (the centre-line area when the offset degenerates). */\nexport function roomNetArea(polygon: readonly Pt[], lines: BoundaryLine[], upm = 1): number {\n const net = netRoomOutline(polygon, lines, upm);\n return Math.abs(signedArea(net ?? polygon));\n}\n","/**\n * Pure core of room derivation (no file I/O, safe in the browser): wall /\n * separator segments + seed points → enclosed faces, matched rooms and room\n * problems. `space-boundary.ts` reads a level directory and calls this; the\n * IFC importer calls it on its in-memory result.\n */\n\nexport const TOLERANCE = 0.01; // 1cm in meters\nconst MAX_FACE_EDGES = 10000; // safety limit for face tracing\n\n// ─── Data structures ────────────────────────────────────\n\ninterface Vertex {\n x: number;\n y: number;\n id: number;\n outgoing: HalfEdge[];\n}\n\ninterface HalfEdge {\n from: Vertex;\n to: Vertex;\n twin: HalfEdge;\n next: HalfEdge;\n visited: boolean;\n sourceId: string;\n}\n\nexport interface Face {\n polygon: { x: number; y: number }[];\n signedArea: number;\n}\n\nexport interface Segment {\n startX: number;\n startY: number;\n endX: number;\n endY: number;\n id: string;\n}\n\n/**\n * A derived-room problem: the polygons are still written (backward compatible),\n * but their areas are wrong.\n * shared — several seeds land in one enclosed area, so the rooms get\n * identical polygons (usually a wall gap or a missing room_separator);\n * the first seed (CSV order) keeps the area, the others are\n * redundant rooms (Revit): area 0\n * contains — the polygon of spaceIds encloses the rooms in `inside`, whose\n * walls don't touch it, so its area double-counts them\n * unbounded — the seed is outside every closed loop; no polygon is generated\n */\nexport interface RoomIssue {\n kind: 'shared' | 'contains' | 'unbounded';\n level: string;\n spaceIds: string[];\n /** For `contains`: the enclosed rooms. */\n inside?: string[];\n}\n\n// ─── Rooms from segments ────────────────────────────────\n\nexport interface RoomSeed { id: string; x: number; y: number; /** Coordinates as written in space.csv, for warnings. */ raw?: [string, string] }\n\nexport interface DerivedRooms {\n /** Space id → the face it lies in. */\n matched: Map<string, Face>;\n roomIssues: RoomIssue[];\n warnings: string[];\n}\n\n/**\n * Trace the faces of `segments` and match each seed to the smallest interior\n * face holding it. `level` names the level in warnings, `units` the area unit.\n */\nexport function deriveRooms(level: string, segments: Segment[], seeds: RoomSeed[], units = 'm'): DerivedRooms {\n const warnings: string[] = [];\n const roomIssues: RoomIssue[] = [];\n const matched = new Map<string, Face>();\n\n // Split segments at T-junctions AND proper crossings so the half-edge\n // topology is correct (two walls that cross each other must become four\n // half-length segments meeting at the intersection point).\n const splitSegments = splitAtIntersections(segments);\n const { vertices, halfEdges } = buildHalfEdgeStructure(splitSegments);\n\n // Report dangling endpoints (degree 1 vertices)\n for (const v of vertices) {\n if (v.outgoing.length === 1) {\n const he = v.outgoing[0];\n warnings.push(\n `[warn] ${level}/ ${he.sourceId} endpoint (${v.x.toFixed(3)}, ${v.y.toFixed(3)}) has no connected line element`,\n );\n }\n }\n\n const faces = traceFaces(halfEdges);\n\n // Match seed points to faces\n const seedMap = new Map<string, { x: number; y: number }>();\n for (const seed of seeds) {\n if (isNaN(seed.x) || isNaN(seed.y)) continue;\n let bestFace: Face | null = null;\n let bestArea = Infinity;\n for (const face of faces) {\n // Skip outer boundary face (CW winding = negative signed area)\n if (face.signedArea <= 0) continue;\n if (face.signedArea < bestArea && pointInPolygon(seed.x, seed.y, face.polygon)) {\n bestFace = face;\n bestArea = face.signedArea;\n }\n }\n if (bestFace) {\n matched.set(seed.id, bestFace);\n seedMap.set(seed.id, { x: seed.x, y: seed.y });\n } else {\n roomIssues.push({ kind: 'unbounded', level, spaceIds: [seed.id] });\n warnings.push(\n `[warn] ${level}/space.csv ${seed.id} at (${seed.raw?.[0] ?? seed.x}, ${seed.raw?.[1] ?? seed.y}) has no enclosing boundary — the seed is outside every closed loop of walls/room separators (wall gap or seed outside the building); no polygon generated`,\n );\n }\n }\n\n // Overlap / leak checks on the derived rooms (warnings only).\n const overlap = findRoomOverlaps(level, matched, seedMap, units);\n roomIssues.push(...overlap.roomIssues);\n warnings.push(...overlap.warnings);\n return { matched, roomIssues, warnings };\n}\n\n// ─── Derived-room overlap checks ────────────────────────\n\n/**\n * Faces of one planar subdivision never overlap, except that a face's traced\n * outline ignores holes: a loop of walls that doesn't touch the surrounding\n * walls (an island) lies inside the outer face's polygon. So derived rooms can\n * only overlap in two ways — two seeds in the same face, or one room's seed\n * inside another room's (larger) face.\n */\nfunction findRoomOverlaps(\n level: string,\n matched: Map<string, Face>,\n seeds: Map<string, { x: number; y: number }>,\n units: string,\n): { warnings: string[]; roomIssues: RoomIssue[] } {\n const warnings: string[] = [];\n const roomIssues: RoomIssue[] = [];\n\n const byFace = new Map<Face, string[]>();\n for (const [id, face] of matched) {\n const ids = byFace.get(face);\n if (ids) ids.push(id);\n else byFace.set(face, [id]);\n }\n\n for (const [face, ids] of byFace) {\n if (ids.length < 2) continue;\n roomIssues.push({ kind: 'shared', level, spaceIds: ids });\n warnings.push(\n `[warn] ${level}/space.csv ${ids.join(', ')} share one enclosed area (${fmtArea(face.signedArea, units)}): ${ids.slice(1).join(', ')} ${ids.length > 2 ? 'are redundant rooms' : 'is a redundant room'} (area 0, the area counts once in ${ids[0]}) — a wall gap or missing room_separator likely merges these rooms, or delete the extra room`,\n );\n }\n\n // Each room's immediate container: the smallest other matched face holding its seed.\n const contained = new Map<Face, string[]>();\n for (const [id, face] of matched) {\n const seed = seeds.get(id)!;\n let parent: Face | null = null;\n for (const other of byFace.keys()) {\n if (other === face || other.signedArea <= face.signedArea) continue;\n if (parent && other.signedArea >= parent.signedArea) continue;\n if (pointInPolygon(seed.x, seed.y, other.polygon)) parent = other;\n }\n if (!parent) continue;\n const list = contained.get(parent);\n if (list) list.push(id);\n else contained.set(parent, [id]);\n }\n\n for (const [outer, inner] of contained) {\n const outerIds = byFace.get(outer)!;\n roomIssues.push({ kind: 'contains', level, spaceIds: outerIds, inside: inner });\n warnings.push(\n `[warn] ${level}/space.csv ${outerIds.join(', ')} polygon (${fmtArea(outer.signedArea, units)}) contains ${inner.join(', ')} — their walls don't connect to the surrounding walls, so the outer area also counts them; join the walls or add a room_separator`,\n );\n }\n\n return { warnings, roomIssues };\n}\n\nfunction fmtArea(a: number, units: string): string {\n return `${a.toFixed(1)} ${units}²`;\n}\n\n// ─── Segment intersection splitting ─────────────────────\n\n/**\n * Pre-process segments so that the half-edge topology will be correct:\n *\n * 1. **T-junctions**: when an endpoint of segment B falls on the interior\n * of segment A, split A at that point.\n * 2. **Proper crossings**: when two segments cross in each other's interior\n * (neither touches the other's endpoint), split BOTH at the computed\n * intersection point.\n *\n * Both passes run in the same loop: every segment collects all of its split\n * points from both sources, then is broken into sub-segments in one shot.\n * The outer `while (changed)` loop handles cascading splits (a new sub-segment\n * may become a T-junction target for yet another segment).\n */\nfunction splitAtIntersections(segments: Segment[]): Segment[] {\n let result = [...segments];\n let changed = true;\n\n while (changed) {\n changed = false;\n\n const allEndpoints: { x: number; y: number }[] = [];\n for (const seg of result) {\n allEndpoints.push({ x: seg.startX, y: seg.startY });\n allEndpoints.push({ x: seg.endX, y: seg.endY });\n }\n\n const nextResult: Segment[] = [];\n\n for (let i = 0; i < result.length; i++) {\n const seg = result[i];\n const dx = seg.endX - seg.startX;\n const dy = seg.endY - seg.startY;\n const lenSq = dx * dx + dy * dy;\n // Tolerances below are distances along the segment (1 cm), not fractions of it\n const segLen = Math.sqrt(lenSq);\n if (lenSq < TOLERANCE * TOLERANCE) {\n nextResult.push(seg);\n continue;\n }\n\n const splitPoints: { x: number; y: number; t: number }[] = [];\n\n // (a) T-junction: endpoints of OTHER segments that land on seg's interior.\n for (const ep of allEndpoints) {\n if (Math.abs(ep.x - seg.startX) < TOLERANCE && Math.abs(ep.y - seg.startY) < TOLERANCE) continue;\n if (Math.abs(ep.x - seg.endX) < TOLERANCE && Math.abs(ep.y - seg.endY) < TOLERANCE) continue;\n\n const t = ((ep.x - seg.startX) * dx + (ep.y - seg.startY) * dy) / lenSq;\n if (t * segLen <= TOLERANCE || (1 - t) * segLen <= TOLERANCE) continue;\n\n const closestX = seg.startX + t * dx;\n const closestY = seg.startY + t * dy;\n const distSq = (ep.x - closestX) * (ep.x - closestX) + (ep.y - closestY) * (ep.y - closestY);\n if (distSq < TOLERANCE * TOLERANCE) {\n splitPoints.push({ x: ep.x, y: ep.y, t });\n }\n }\n\n // (b) Proper crossings: solve seg ∩ other as line-line intersection,\n // require BOTH parameters to be strictly in the interior. If `other`\n // touches seg at an endpoint (s ≈ 0 or 1), branch (a) handles it already.\n for (let j = 0; j < result.length; j++) {\n if (j === i) continue;\n const other = result[j];\n const ox = other.endX - other.startX;\n const oy = other.endY - other.startY;\n\n // det = (dx,dy) × (ox,oy); 0 → parallel / colinear (unsupported here).\n const det = dx * oy - dy * ox;\n if (Math.abs(det) < 1e-12) continue;\n\n // Solve: seg.start + t·(dx,dy) = other.start + s·(ox,oy)\n const rx = other.startX - seg.startX;\n const ry = other.startY - seg.startY;\n const t = (rx * oy - ry * ox) / det;\n const s = (rx * dy - ry * dx) / det;\n\n if (t * segLen <= TOLERANCE || (1 - t) * segLen <= TOLERANCE) continue;\n const otherLen = Math.hypot(ox, oy);\n if (s * otherLen <= TOLERANCE || (1 - s) * otherLen <= TOLERANCE) continue;\n\n splitPoints.push({\n x: seg.startX + t * dx,\n y: seg.startY + t * dy,\n t,\n });\n }\n\n if (splitPoints.length === 0) {\n nextResult.push(seg);\n } else {\n changed = true;\n splitPoints.sort((a, b) => a.t - b.t);\n\n // Dedup near-coincident split points (e.g. endpoint-on-interior AND\n // crossing hitting the same spot).\n const unique = [splitPoints[0]];\n for (let k = 1; k < splitPoints.length; k++) {\n if (Math.abs(splitPoints[k].t - unique[unique.length - 1].t) * segLen > TOLERANCE) {\n unique.push(splitPoints[k]);\n }\n }\n\n let prevX = seg.startX, prevY = seg.startY;\n for (const sp of unique) {\n nextResult.push({ startX: prevX, startY: prevY, endX: sp.x, endY: sp.y, id: seg.id });\n prevX = sp.x;\n prevY = sp.y;\n }\n nextResult.push({ startX: prevX, startY: prevY, endX: seg.endX, endY: seg.endY, id: seg.id });\n }\n }\n\n result = nextResult;\n }\n\n return result;\n}\n\n// ─── Half-edge construction ─────────────────────────────\n\nfunction buildHalfEdgeStructure(segments: Segment[]): {\n vertices: Vertex[];\n halfEdges: HalfEdge[];\n} {\n const vertices: Vertex[] = [];\n\n function findOrCreateVertex(x: number, y: number): Vertex {\n for (const v of vertices) {\n if (Math.abs(v.x - x) < TOLERANCE && Math.abs(v.y - y) < TOLERANCE) {\n return v;\n }\n }\n const v: Vertex = { x, y, id: vertices.length, outgoing: [] };\n vertices.push(v);\n return v;\n }\n\n // Create half-edges for each segment\n const halfEdges: HalfEdge[] = [];\n\n for (const seg of segments) {\n const v1 = findOrCreateVertex(seg.startX, seg.startY);\n const v2 = findOrCreateVertex(seg.endX, seg.endY);\n if (v1 === v2) continue; // degenerate\n\n // Check for duplicate edge (same two vertices already connected)\n const isDuplicate = v1.outgoing.some((he) => he.to === v2);\n if (isDuplicate) continue;\n\n const he1 = { from: v1, to: v2, sourceId: seg.id } as HalfEdge;\n const he2 = { from: v2, to: v1, sourceId: seg.id } as HalfEdge;\n he1.twin = he2;\n he2.twin = he1;\n he1.visited = false;\n he2.visited = false;\n\n v1.outgoing.push(he1);\n v2.outgoing.push(he2);\n halfEdges.push(he1, he2);\n }\n\n // Sort outgoing edges at each vertex by angle\n for (const v of vertices) {\n v.outgoing.sort((a, b) => {\n const angleA = Math.atan2(a.to.y - v.y, a.to.x - v.x);\n const angleB = Math.atan2(b.to.y - v.y, b.to.x - v.x);\n return angleA - angleB;\n });\n }\n\n // Link next pointers:\n // For half-edge `he` arriving at vertex v, the face continues with\n // the outgoing edge one step CW from the twin (which leaves v going back).\n for (const he of halfEdges) {\n const v = he.to;\n const twinIdx = v.outgoing.indexOf(he.twin);\n if (twinIdx === -1) {\n // Should not happen, but handle gracefully\n he.next = he.twin;\n continue;\n }\n const prevIdx = (twinIdx - 1 + v.outgoing.length) % v.outgoing.length;\n he.next = v.outgoing[prevIdx];\n }\n\n return { vertices, halfEdges };\n}\n\n// ─── Face tracing ───────────────────────────────────────\n\nfunction traceFaces(halfEdges: HalfEdge[]): Face[] {\n const faces: Face[] = [];\n\n for (const startHe of halfEdges) {\n if (startHe.visited) continue;\n\n const polygon: { x: number; y: number }[] = [];\n let current = startHe;\n let count = 0;\n\n do {\n current.visited = true;\n polygon.push({ x: current.from.x, y: current.from.y });\n current = current.next;\n count++;\n } while (current !== startHe && count < MAX_FACE_EDGES);\n\n if (count >= MAX_FACE_EDGES) continue; // malformed cycle, skip\n\n // Compute signed area (shoelace formula)\n // Positive = CCW (interior face), Negative = CW (exterior/boundary face)\n let signedArea = 0;\n for (let i = 0; i < polygon.length; i++) {\n const j = (i + 1) % polygon.length;\n signedArea += polygon[i].x * polygon[j].y;\n signedArea -= polygon[j].x * polygon[i].y;\n }\n signedArea /= 2;\n\n faces.push({ polygon, signedArea });\n }\n\n return faces;\n}\n\n// ─── Point-in-polygon (ray casting) ─────────────────────\n\nexport function pointInPolygon(px: number, py: number, polygon: { x: number; y: number }[]): boolean {\n let crossings = 0;\n for (let i = 0; i < polygon.length; i++) {\n const j = (i + 1) % polygon.length;\n const yi = polygon[i].y;\n const yj = polygon[j].y;\n const xi = polygon[i].x;\n const xj = polygon[j].x;\n\n if ((yi <= py && py < yj) || (yj <= py && py < yi)) {\n const t = (py - yi) / (yj - yi);\n const xIntersect = xi + t * (xj - xi);\n if (px < xIntersect) crossings++;\n }\n }\n return crossings % 2 === 1;\n}\n","/**\n * The build's endpoint snap and room derivation over a project's files,\n * without file access: `bimdown build` runs them on a folder, the IFC\n * importer (also in the browser) on the files it is about to write, so the\n * import report and `bimdown build` find the same room problems.\n */\nimport { parseCsvText } from '../utils/csv-core.js';\nimport {\n parseGeoJsonText,\n stringifyFeatureCollection,\n extractLineGeometry,\n type BimDownFeatureCollection,\n type Position,\n} from '../utils/geojson-core.js';\nimport { UNIT_TO_M, unitsOfMetadata } from '../utils/units-core.js';\nimport { TOLERANCE, deriveRooms, type DerivedRooms, type Segment } from './room-faces.js';\n\n/** A project's text files by project-relative path ('lv-1/wall.geojson'). */\nexport interface ProjectFiles {\n read(path: string): string | undefined;\n write(path: string, text: string): void;\n}\n\n/** Project files held in memory (the importer's output). */\nexport function memoryFiles(files: Record<string, string>): ProjectFiles {\n return {\n read: (p) => files[p],\n write: (p, t) => { files[p] = t; },\n };\n}\n\n/** Boundary element tables (their GeoJSON files have the table's name). */\nexport const BOUNDARY_TABLES = ['wall', 'structure_wall', 'curtain_wall', 'room_separator'];\n\nexport function projectUnitsOf(files: ProjectFiles): string {\n return unitsOfMetadata(files.read('project_metadata.json'));\n}\n\nfunction readFc(files: ProjectFiles, path: string): BimDownFeatureCollection | null {\n const text = files.read(path);\n if (text === undefined) return null;\n try { return parseGeoJsonText(text, path); } catch { return null; }\n}\n\n// ─── Endpoint snap ───────────────────────────────────────────────────────────\n\n/**\n * Endpoints closer than this are treated as the same junction and merged. Kept small on purpose:\n * snapping only heals imprecise coordinates; it must not move real geometry. (It used to be the\n * thickest wall in the project, which merged distinct corners up to ~0.5 m apart and skewed walls.)\n */\nexport const SNAP_TOLERANCE_M = 0.05; // meters; converted to the project's units\n/** Never snap if it would turn a wall by more than this (degrees) — protects short walls. */\nconst MAX_TURN_DEG = 2;\n\ninterface Point { x: number; y: number }\n\ninterface EndpointRef {\n point: Point;\n other: Point; // the opposite endpoint of the same element\n table: string;\n elementId: string;\n side: 'start' | 'end';\n}\n\nexport interface SnapRecord {\n level: string;\n table: string;\n elementId: string;\n side: 'start' | 'end';\n from: Point;\n to: Point;\n}\n\n/**\n * Merge boundary endpoints of the same folder (`global` or a level) that lie within 5 cm (in\n * project units) of each other; rewrites the GeoJSON files that changed. Returns what was moved.\n */\nexport function snapProjectEndpoints(files: ProjectFiles, dirs: string[]): SnapRecord[] {\n const tolerance = SNAP_TOLERANCE_M / UNIT_TO_M[projectUnitsOf(files)];\n const records: SnapRecord[] = [];\n for (const dir of dirs) {\n const fcs = new Map<string, BimDownFeatureCollection>();\n const endpoints: EndpointRef[] = [];\n for (const table of BOUNDARY_TABLES) {\n const fc = readFc(files, `${dir}/${table}.geojson`);\n if (!fc) continue;\n fcs.set(table, fc);\n for (const f of fc.features) {\n if (f.geometry.type !== 'LineString' || f.geometry.coordinates.length < 2) continue;\n const id = String(f.properties?.id ?? '');\n if (!id) continue;\n const a = f.geometry.coordinates[0];\n const b = f.geometry.coordinates[f.geometry.coordinates.length - 1];\n const pa = { x: a[0], y: a[1] }, pb = { x: b[0], y: b[1] };\n endpoints.push({ point: pa, other: pb, table, elementId: id, side: 'start' });\n endpoints.push({ point: pb, other: pa, table, elementId: id, side: 'end' });\n }\n }\n\n // Snapping is per folder: endpoints of different levels never interact.\n const snapMap = new Map<string, Point>();\n for (const cluster of clusterEndpoints(endpoints, tolerance)) {\n if (cluster.length <= 1) continue;\n const canonical = pickCanonical(cluster);\n const moving = cluster.filter(ep => !same(ep.point, canonical));\n // A junction that already meets exactly moves whole or not at all: moving some of its\n // ends (a short wall refusing to turn) would open a gap that is not there now.\n const refused = new Set(moving.filter(ep => turnDegrees(ep.other, ep.point, canonical) > MAX_TURN_DEG).map(ep => key(ep.point)));\n for (const ep of moving) {\n if (refused.has(key(ep.point))) continue;\n snapMap.set(`${ep.table}:${ep.elementId}:${ep.side}`, canonical);\n records.push({ level: dir, table: ep.table, elementId: ep.elementId, side: ep.side, from: ep.point, to: canonical });\n }\n }\n if (snapMap.size === 0) continue;\n\n for (const [table, fc] of fcs) {\n let dirty = false;\n for (const f of fc.features) {\n if (f.geometry.type !== 'LineString' || f.geometry.coordinates.length < 2) continue;\n const id = String(f.properties?.id ?? '');\n const ns = snapMap.get(`${table}:${id}:start`);\n const ne = snapMap.get(`${table}:${id}:end`);\n if (!ns && !ne) continue;\n const coords = f.geometry.coordinates;\n if (ns) coords[0] = moved(coords[0], ns);\n if (ne) coords[coords.length - 1] = moved(coords[coords.length - 1], ne);\n dirty = true;\n }\n if (dirty) files.write(`${dir}/${table}.geojson`, stringifyFeatureCollection(fc));\n }\n }\n return records;\n}\n\nfunction moved(c: Position, to: Point): Position {\n return (c.length === 3 ? [to.x, to.y, c[2]] : [to.x, to.y]) as Position;\n}\n\n/** Seed clustering without chaining: every member is within `tolerance` of the seed. */\nfunction clusterEndpoints(endpoints: EndpointRef[], tolerance: number): EndpointRef[][] {\n const visited = new Set<number>();\n const clusters: EndpointRef[][] = [];\n for (let i = 0; i < endpoints.length; i++) {\n if (visited.has(i)) continue;\n visited.add(i);\n const cluster: EndpointRef[] = [endpoints[i]];\n for (let j = i + 1; j < endpoints.length; j++) {\n if (!visited.has(j) && dist(endpoints[i].point, endpoints[j].point) < tolerance) {\n cluster.push(endpoints[j]);\n visited.add(j);\n }\n }\n clusters.push(cluster);\n }\n return clusters;\n}\n\n/** Angle (degrees) between the element direction before and after moving `from` to `to`. */\nfunction turnDegrees(fixed: Point, from: Point, to: Point): number {\n const a = Math.atan2(from.y - fixed.y, from.x - fixed.x);\n const b = Math.atan2(to.y - fixed.y, to.x - fixed.x);\n let d = Math.abs(a - b) * 180 / Math.PI;\n if (d > 180) d = 360 - d;\n return d;\n}\n\nconst key = (p: Point) => `${p.x.toFixed(4)},${p.y.toFixed(4)}`;\nconst same = (a: Point, b: Point) => Math.abs(a.x - b.x) <= 1e-6 && Math.abs(a.y - b.y) <= 1e-6;\n\nfunction pickCanonical(cluster: EndpointRef[]): Point {\n const counts = new Map<string, { point: Point; count: number }>();\n for (const ep of cluster) {\n const k = key(ep.point);\n const entry = counts.get(k);\n if (entry) entry.count++;\n else counts.set(k, { point: ep.point, count: 1 });\n }\n let best: { point: Point; count: number } = { point: cluster[0].point, count: 0 };\n for (const entry of counts.values()) {\n if (entry.count > best.count) best = entry;\n }\n return best.point;\n}\n\nfunction dist(a: Point, b: Point): number {\n return Math.sqrt((a.x - b.x) ** 2 + (a.y - b.y) ** 2);\n}\n\n// ─── Rooms ───────────────────────────────────────────────────────────────────\n\n/**\n * Ids of global boundary elements standing on `level`: base at or below\n * the level, top above it (a multi-storey wall ending at a level's floor\n * doesn't divide that level's rooms). Null when the levels are unknown (all\n * global elements count, as before).\n */\nfunction globalIdsOnLevel(files: ProjectFiles, level: string): Set<string> | null {\n const levelCsv = files.read('global/level.csv');\n if (levelCsv === undefined) return null;\n const levels = parseCsvText(levelCsv).rows\n .map((r) => ({ id: r.id, elevation: parseFloat(r.elevation ?? '') }))\n .filter((l) => !isNaN(l.elevation))\n .sort((a, b) => a.elevation - b.elevation);\n const here = levels.find((l) => l.id === level)?.elevation;\n if (here === undefined) return null;\n const elev = new Map(levels.map((l) => [l.id, l.elevation]));\n const ids = new Set<string>();\n for (const table of BOUNDARY_TABLES) {\n const csv = files.read(`global/${table}.csv`);\n const fc = readFc(files, `global/${table}.geojson`);\n if (csv === undefined || !fc) continue;\n const props = new Map<string, Record<string, unknown>>();\n for (const f of fc.features) props.set(String(f.properties?.id ?? ''), (f.properties ?? {}) as Record<string, unknown>);\n for (const row of parseCsvText(csv).rows) {\n const base = elev.get(row.base_level_id ?? '');\n if (base === undefined) { ids.add(row.id); continue; }\n const p = props.get(row.id) ?? {};\n const above = levels.find((l) => l.elevation > base + 1e-6);\n const topLevel = elev.get(row.top_level_id ?? '') ?? above?.elevation;\n const bottom = base + (Number(p.base_offset) || 0);\n const top = topLevel === undefined ? Infinity : topLevel + (Number(p.top_offset) || 0);\n if (bottom <= here + TOLERANCE && top > here + TOLERANCE) ids.add(row.id);\n }\n }\n return ids;\n}\n\nfunction boundarySegments(files: ProjectFiles, dir: string, only?: Set<string> | null): Segment[] {\n const segments: Segment[] = [];\n for (const table of BOUNDARY_TABLES) {\n const fc = readFc(files, `${dir}/${table}.geojson`);\n if (!fc) continue;\n try {\n for (const f of fc.features) {\n if (f.geometry.type !== 'LineString') continue;\n const id = String(f.properties?.id ?? '');\n if (!id || (only && !only.has(id))) continue;\n const lg = extractLineGeometry(f);\n if (lg.length < TOLERANCE) continue;\n segments.push({ startX: lg.start_x, startY: lg.start_y, endX: lg.end_x, endY: lg.end_y, id });\n }\n } catch { /* skip */ }\n }\n return segments;\n}\n\nexport interface LevelRooms {\n warnings: string[];\n /** Null when the level has no spaces or no boundary elements. */\n rooms: DerivedRooms | null;\n}\n\n/** Rooms of one level from its space seeds and the boundary lines (level + global ones standing on it). */\nexport function deriveLevelRooms(files: ProjectFiles, level: string): LevelRooms {\n const spaceCsv = files.read(`${level}/space.csv`);\n if (spaceCsv === undefined) return { warnings: [], rooms: null };\n const rows = parseCsvText(spaceCsv).rows;\n if (rows.length === 0) return { warnings: [], rooms: null };\n\n const segments = boundarySegments(files, level);\n segments.push(...boundarySegments(files, 'global', globalIdsOnLevel(files, level)));\n if (segments.length === 0) {\n return { warnings: [`${level}/ no boundary elements found for space boundary computation`], rooms: null };\n }\n const seeds = rows.map((row) => ({\n id: row.id, x: parseFloat(row.x ?? ''), y: parseFloat(row.y ?? ''), raw: [row.x, row.y] as [string, string],\n }));\n const rooms = deriveRooms(level, segments, seeds, projectUnitsOf(files));\n return { warnings: rooms.warnings, rooms };\n}\n","import { existsSync } from 'node:fs';\nimport { dirname, join } from 'node:path';\nimport { GEOJSON_FILE_NAMES } from '../schema/registry.js';\nimport { discoverLayout } from '../utils/fs.js';\nimport { projectUnits } from '../utils/units.js';\nimport { readCsv } from '../utils/csv.js';\nimport { effectiveRows } from '../catalog/index.js';\nimport { parseGeoJsonFile, extractLineGeometry } from '../utils/geojson.js';\nimport { insertOverlaps, wallOverlaps, type CheckInsert, type CheckWall } from './model-checks.js';\nimport { embedCircle, type EmbedCircle } from '../curtain-embed.js';\n\nconst TOLERANCE = 0.01; // 1cm\n\n/** Tables whose SVG line segments form room boundaries */\nconst BOUNDARY_TABLES = ['wall', 'structure_wall', 'curtain_wall', 'room_separator'];\n\nexport function validateGeometry(dir: string): string[] {\n const warnings: string[] = [];\n const layout = discoverLayout(dir);\n // Distances in messages are in the project's units\n const unit = projectUnits(dir);\n\n const allDirs = [\n { name: 'global', path: layout.globalDir },\n ...layout.levelDirs,\n ];\n\n // Collect all wall geometries (for hosted bounds checking)\n const wallGeometries = new Map<string, { length: number }>();\n for (const d of allDirs) {\n if (!existsSync(d.path)) continue;\n for (const table of ['wall', 'structure_wall', 'curtain_wall']) {\n const geomName = GEOJSON_FILE_NAMES[table];\n if (!geomName) continue;\n const path = join(d.path, `${geomName}.geojson`);\n if (!existsSync(path)) continue;\n try {\n const fc = parseGeoJsonFile(path);\n for (const f of fc.features) {\n if (f.geometry.type !== 'LineString') continue;\n const id = String(f.properties?.id ?? '');\n if (!id) continue;\n const lg = extractLineGeometry(f);\n wallGeometries.set(id, { length: lg.length });\n }\n } catch { /* skip */ }\n }\n }\n\n // Per-level checks\n for (const d of [...layout.levelDirs]) {\n if (!existsSync(d.path)) continue;\n\n // A. Line connectivity\n warnings.push(...validateLineConnectivity(d, unit));\n\n // B. Hosted bounds\n warnings.push(...validateHostedBounds(d, wallGeometries, unit));\n\n // C. Hosted overlap\n warnings.push(...validateHostedOverlap(d, unit));\n\n // D. Overlapping walls\n warnings.push(...validateWallOverlap(d, unit));\n }\n\n return warnings;\n}\n\n// ─── A. Line connectivity ───────────────────────────────\n\n/** Extra slack (m) when deciding that a wall end touches another wall's body or a column. */\nconst TOUCH_SLACK = 0.02;\nconst COLUMN_TABLES = ['column', 'structure_column'];\n\n/**\n * A boundary-line end is connected when it meets another line's end, lands anywhere on another wall's\n * body (T-junction at the centre line or at the face, within that wall's half thickness; along the arc\n * for arc walls), or ends on a\n * column, or ends on the edge of a roof opening (a dormer cheek wall dying into the roof). Only ends\n * that touch nothing are reported — those are the gaps that keep rooms from closing.\n */\nfunction validateLineConnectivity(levelDir: { name: string; path: string }, unit: string): string[] {\n const warnings: string[] = [];\n\n interface Endpoint { x: number; y: number; side: 'start' | 'end'; elementId: string; table: string }\n interface Segment { ax: number; ay: number; bx: number; by: number; half: number; elementId: string; table: string; arc: EmbedCircle | null }\n interface Box { x0: number; y0: number; x1: number; y1: number }\n\n const endpoints: Endpoint[] = [];\n const segments: Segment[] = [];\n const columns: Box[] = [];\n\n const csvRows = (table: string): Map<string, Record<string, string>> => {\n const m = new Map<string, Record<string, string>>();\n const p = join(levelDir.path, `${table}.csv`);\n if (!existsSync(p)) return m;\n try { for (const r of effectiveRows(dirname(levelDir.path), table, readCsv(p).rows)) if (r.id) m.set(r.id, r); } catch { /* skip */ }\n return m;\n };\n\n for (const table of BOUNDARY_TABLES) {\n const geomName = GEOJSON_FILE_NAMES[table];\n if (!geomName) continue;\n const path = join(levelDir.path, `${geomName}.geojson`);\n if (!existsSync(path)) continue;\n const attrs = csvRows(table);\n try {\n const fc = parseGeoJsonFile(path);\n for (const f of fc.features) {\n if (f.geometry.type !== 'LineString') continue;\n const id = String(f.properties?.id ?? '');\n if (!id) continue;\n const lg = extractLineGeometry(f);\n const t = parseFloat(attrs.get(id)?.thickness ?? '') || 0;\n endpoints.push({ x: lg.start_x, y: lg.start_y, side: 'start', elementId: id, table });\n endpoints.push({ x: lg.end_x, y: lg.end_y, side: 'end', elementId: id, table });\n const arc = f.properties?.arc ? embedCircle({ start: { x: lg.start_x, y: lg.start_y }, end: { x: lg.end_x, y: lg.end_y }, arc: f.properties.arc as { radius: number; large_arc: boolean; sweep: boolean } }) : null;\n segments.push({ ax: lg.start_x, ay: lg.start_y, bx: lg.end_x, by: lg.end_y, half: t / 2, elementId: id, table, arc });\n }\n } catch { /* skip */ }\n }\n\n for (const table of COLUMN_TABLES) {\n const geomName = GEOJSON_FILE_NAMES[table];\n if (!geomName) continue;\n const path = join(levelDir.path, `${geomName}.geojson`);\n if (!existsSync(path)) continue;\n const attrs = csvRows(table);\n try {\n const fc = parseGeoJsonFile(path);\n for (const f of fc.features) {\n if (f.geometry.type !== 'Point') continue;\n const [x, y] = f.geometry.coordinates as number[];\n const r = attrs.get(String(f.properties?.id ?? ''));\n const sx = parseFloat(r?.size_x ?? '') || 0.4;\n const sy = parseFloat(r?.size_y ?? '') || sx;\n const h = Math.max(sx, sy) / 2; // rotation-safe: use the larger half size\n columns.push({ x0: x - h, y0: y - h, x1: x + h, y1: y + h });\n }\n } catch { /* skip */ }\n }\n\n // Roof openings (dormers): a cheek wall ends where it dies into the roof, on the opening's edge.\n const roofOpenings: number[][][] = [];\n {\n const path = join(levelDir.path, 'opening.geojson');\n const roofs = csvRows('roof');\n const rows = csvRows('opening');\n if (existsSync(path) && roofs.size > 0) {\n try {\n for (const f of parseGeoJsonFile(path).features) {\n if (f.geometry.type !== 'Polygon') continue;\n const host = rows.get(String(f.properties?.id ?? ''))?.host_id ?? '';\n if (roofs.has(host)) roofOpenings.push((f.geometry.coordinates as number[][][])[0] ?? []);\n }\n } catch { /* skip */ }\n }\n }\n\n const same = (a: { elementId: string; table: string }, b: { elementId: string; table: string }) =>\n a.elementId === b.elementId && a.table === b.table;\n\n for (const ep of endpoints) {\n const atEndpoint = endpoints.some(\n (o) => o !== ep && !same(o, ep) && Math.abs(o.x - ep.x) < TOLERANCE && Math.abs(o.y - ep.y) < TOLERANCE,\n );\n if (atEndpoint) continue;\n\n const onWall = segments.some((seg) => !same(seg, ep) && (seg.arc\n ? pointNearArc(ep.x, ep.y, seg.arc, Math.max(seg.half, TOLERANCE) + TOUCH_SLACK)\n : pointNearSegment(ep.x, ep.y, seg.ax, seg.ay, seg.bx, seg.by, Math.max(seg.half, TOLERANCE) + TOUCH_SLACK)));\n if (onWall) continue;\n\n const onColumn = columns.some((c) =>\n ep.x >= c.x0 - TOUCH_SLACK && ep.x <= c.x1 + TOUCH_SLACK && ep.y >= c.y0 - TOUCH_SLACK && ep.y <= c.y1 + TOUCH_SLACK);\n if (onColumn) continue;\n\n const onRoofOpening = roofOpenings.some(ring => ring.some((a, i) => {\n const b = ring[(i + 1) % ring.length];\n return pointNearSegment(ep.x, ep.y, a[0], a[1], b[0], b[1], TOLERANCE + TOUCH_SLACK);\n }));\n if (onRoofOpening) continue;\n\n let nearestDist = Infinity;\n let nearestId = '';\n let nearestSide = '';\n for (const other of endpoints) {\n if (other === ep || same(other, ep)) continue;\n const d = Math.hypot(other.x - ep.x, other.y - ep.y);\n if (d < nearestDist) { nearestDist = d; nearestId = other.elementId; nearestSide = other.side; }\n }\n const nearestInfo = nearestDist < Infinity ? ` (nearest: ${nearestId} ${nearestSide}, distance ${nearestDist.toFixed(3)} ${unit})` : '';\n warnings.push(\n `[warn] ${levelDir.name}/${ep.table}.geojson ${ep.elementId} ${ep.side} (${ep.x.toFixed(3)}, ${ep.y.toFixed(3)}) has no connected line element${nearestInfo}`,\n );\n }\n\n return warnings;\n}\n\n/** Point within `tol` of segment AB, measured to the segment body (ends extended by `tol`). */\n/** Within `tol` of an arc's body (radially, inside its sweep). */\nfunction pointNearArc(px: number, py: number, c: EmbedCircle, tol: number): boolean {\n if (Math.abs(Math.hypot(px - c.cx, py - c.cy) - c.r) > tol) return false;\n const TAU = 2 * Math.PI;\n const t = ((((Math.atan2(py - c.cy, px - c.cx) - c.a0) * Math.sign(c.sweep)) % TAU) + TAU) % TAU;\n const slack = tol / Math.max(c.r, 1e-9);\n return t <= Math.abs(c.sweep) + slack || t >= TAU - slack;\n}\n\nfunction pointNearSegment(px: number, py: number, ax: number, ay: number, bx: number, by: number, tol: number): boolean {\n const dx = bx - ax, dy = by - ay;\n const len = Math.hypot(dx, dy);\n if (len < 1e-9) return false;\n const ux = dx / len, uy = dy / len;\n const along = (px - ax) * ux + (py - ay) * uy;\n if (along < -tol || along > len + tol) return false;\n const across = Math.abs(-(px - ax) * uy + (py - ay) * ux);\n return across <= tol;\n}\n\n// ─── B. Hosted bounds ───────────────────────────────────\n\nfunction validateHostedBounds(\n levelDir: { name: string; path: string },\n wallGeometries: Map<string, { length: number }>,\n unit: string,\n): string[] {\n const warnings: string[] = [];\n\n for (const tableName of ['door', 'window']) {\n const csvPath = join(levelDir.path, `${tableName}.csv`);\n if (!existsSync(csvPath)) continue;\n\n const rows = effectiveRows(dirname(levelDir.path), tableName, readCsv(csvPath).rows);\n for (let i = 0; i < rows.length; i++) {\n const row = rows[i];\n const hostId = row.host_id;\n const position = parseFloat(row.position ?? '');\n const width = parseFloat(row.width ?? '');\n\n if (!hostId || isNaN(position) || isNaN(width)) continue;\n\n const wallGeo = wallGeometries.get(hostId);\n if (!wallGeo) continue; // host not found in SVG, reference validator handles this\n\n const halfWidth = width / 2;\n if (position - halfWidth < -TOLERANCE) {\n warnings.push(\n `[warn] ${levelDir.name}/${tableName}.csv:${i + 2} ${row.id} extends before host ${hostId} start: position(${position}) - width/2(${halfWidth.toFixed(3)}) = ${(position - halfWidth).toFixed(3)} ${unit}`,\n );\n }\n if (position + halfWidth > wallGeo.length + TOLERANCE) {\n warnings.push(\n `[warn] ${levelDir.name}/${tableName}.csv:${i + 2} ${row.id} extends past host ${hostId} end: position(${position}) + width/2(${halfWidth.toFixed(3)}) = ${(position + halfWidth).toFixed(3)} ${unit} > wall length ${wallGeo.length.toFixed(3)} ${unit}`,\n );\n }\n }\n }\n\n return warnings;\n}\n\n// ─── C. Hosted overlap ──────────────────────────────────\n\n/** Default sill / height when a row leaves them empty (as the editor's 3D: windows sit at 0.9 m). */\nconst INSERT_DEFAULTS: Record<string, { sill: number; height: number }> = {\n door: { sill: 0, height: 2.1 }, window: { sill: 0.9, height: 1.2 }, opening: { sill: 0, height: 2.1 },\n};\n\nfunction validateHostedOverlap(levelDir: { name: string; path: string }, unit: string): string[] {\n const inserts: CheckInsert[] = [];\n for (const tableName of ['door', 'window', 'opening']) {\n const csvPath = join(levelDir.path, `${tableName}.csv`);\n if (!existsSync(csvPath)) continue;\n const rows = effectiveRows(dirname(levelDir.path), tableName, readCsv(csvPath).rows);\n const d = INSERT_DEFAULTS[tableName];\n for (const row of rows) {\n const position = parseFloat(row.position ?? '');\n const width = parseFloat(row.width ?? '');\n if (!row.host_id || isNaN(position) || isNaN(width)) continue;\n const sill = row.base_offset !== undefined && row.base_offset !== '' ? parseFloat(row.base_offset) || 0 : d.sill;\n const height = parseFloat(row.height ?? '') || d.height;\n inserts.push({ id: row.id, scope: levelDir.name, table: tableName, hostId: row.host_id, position, width, sill, height });\n }\n }\n return insertOverlaps(inserts, TOLERANCE, unit).map((p) => `[warn] ${levelDir.name}/ ${p.message}`);\n}\n\n// ─── D. Overlapping walls ───────────────────────────────\n\nfunction validateWallOverlap(levelDir: { name: string; path: string }, unit: string): string[] {\n const walls: CheckWall[] = [];\n for (const table of ['wall', 'structure_wall']) {\n const geomName = GEOJSON_FILE_NAMES[table];\n const path = join(levelDir.path, `${geomName}.geojson`);\n if (!geomName || !existsSync(path)) continue;\n const thickness = new Map<string, number>();\n const csvPath = join(levelDir.path, `${table}.csv`);\n if (existsSync(csvPath)) {\n try { for (const r of effectiveRows(dirname(levelDir.path), table, readCsv(csvPath).rows)) thickness.set(r.id, parseFloat(r.thickness ?? '') || 0); } catch { /* skip */ }\n }\n try {\n for (const f of parseGeoJsonFile(path).features) {\n if (f.geometry.type !== 'LineString' || f.properties?.arc) continue;\n const id = String(f.properties?.id ?? '');\n if (!id) continue;\n const lg = extractLineGeometry(f);\n walls.push({ id, scope: levelDir.name, table, a: { x: lg.start_x, y: lg.start_y }, b: { x: lg.end_x, y: lg.end_y }, thickness: thickness.get(id) || 0.2 });\n }\n } catch { /* skip */ }\n }\n return wallOverlaps(walls, TOLERANCE, TOLERANCE * 10, unit).map((p) => `[warn] ${levelDir.name}/ ${p.message}`);\n}\n","import { existsSync } from 'node:fs';\nimport { join } from 'node:path';\nimport { parseGeoJsonFile, extractLineGeometry } from '../utils/geojson.js';\nimport { readCsv, writeCsv } from '../utils/csv.js';\nimport { discoverLayout, listFiles } from '../utils/fs.js';\nimport { GEOJSON_FILE_NAMES } from '../schema/registry.js';\nimport { metersToProject, projectUnits } from '../utils/units.js';\n\nconst TOLERANCE_M = 0.05; // 5 cm snap tolerance for finding the nearest wall, converted to project units\n\ninterface WallGeo {\n id: string;\n start_x: number;\n start_y: number;\n end_x: number;\n end_y: number;\n length: number;\n}\n\nconst HOSTED_TABLES = ['door', 'window', 'opening'];\n\n/**\n * Pre-build step: resolve host_x/host_y to host_id + position.\n * For each hosted element row that has host_x/host_y but missing position,\n * find the nearest wall and compute position along it.\n * Writes resolved values back to CSV.\n */\nexport function resolveHostedCoords(dir: string): string[] {\n const issues: string[] = [];\n const layout = discoverLayout(dir);\n const units = projectUnits(dir);\n const tolerance = metersToProject(dir, TOLERANCE_M);\n\n const allDirs = [\n { name: 'global', path: layout.globalDir },\n ...layout.levelDirs,\n ];\n\n for (const d of allDirs) {\n if (!existsSync(d.path)) continue;\n const files = listFiles(d.path);\n\n // Collect wall geometries for this level\n const walls: WallGeo[] = [];\n for (const table of ['wall', 'structure_wall', 'curtain_wall']) {\n const geomName = GEOJSON_FILE_NAMES[table];\n if (!geomName) continue;\n const path = join(d.path, `${geomName}.geojson`);\n if (!existsSync(path)) continue;\n try {\n const fc = parseGeoJsonFile(path);\n for (const f of fc.features) {\n if (f.geometry.type !== 'LineString') continue;\n const id = String(f.properties?.id ?? '');\n if (!id) continue;\n const lg = extractLineGeometry(f);\n walls.push({\n id,\n start_x: lg.start_x, start_y: lg.start_y,\n end_x: lg.end_x, end_y: lg.end_y,\n length: lg.length,\n });\n }\n } catch { /* skip */ }\n }\n\n if (walls.length === 0) continue;\n\n // Process each hosted table\n for (const table of HOSTED_TABLES) {\n const csvPath = join(d.path, `${table}.csv`);\n if (!files.includes(`${table}.csv`)) continue;\n\n const csv = readCsv(csvPath);\n const hasHostX = csv.headers.includes('host_x');\n const hasHostY = csv.headers.includes('host_y');\n if (!hasHostX || !hasHostY) continue;\n\n let modified = false;\n\n for (let i = 0; i < csv.rows.length; i++) {\n const row = csv.rows[i];\n const hostX = parseFloat(row.host_x ?? '');\n const hostY = parseFloat(row.host_y ?? '');\n\n // Skip if no host_x/host_y\n if (isNaN(hostX) || isNaN(hostY)) continue;\n\n // Skip if position already set\n const existingPosition = parseFloat(row.position ?? '');\n if (!isNaN(existingPosition) && row.position !== '') continue;\n\n // Find the nearest wall to this point\n const match = findNearestWall(hostX, hostY, walls, tolerance, row.host_id);\n\n if (!match) {\n issues.push(\n `${d.name}/${table}.csv:${i + 2} ${row.id} host_x=${hostX}, host_y=${hostY} — no wall found within ${+tolerance.toPrecision(3)} ${units}`,\n );\n continue;\n }\n\n // Write resolved values\n row.position = match.position.toFixed(4);\n if (!row.host_id || row.host_id === '') {\n row.host_id = match.wallId;\n }\n modified = true;\n }\n\n if (modified) {\n // Ensure host_id and position columns exist, remove host_x/host_y\n const cleanHeaders = csv.headers.filter(h => h !== 'host_x' && h !== 'host_y');\n if (!cleanHeaders.includes('host_id')) {\n // Insert host_id after 'id' column\n const idIdx = cleanHeaders.indexOf('id');\n cleanHeaders.splice(idIdx + 1, 0, 'host_id');\n }\n if (!cleanHeaders.includes('position')) {\n const hostIdx = cleanHeaders.indexOf('host_id');\n cleanHeaders.splice(hostIdx + 1, 0, 'position');\n }\n const cleanRows = csv.rows.map(row => {\n const clean: Record<string, string> = {};\n for (const h of cleanHeaders) {\n if (row[h] !== undefined) clean[h] = row[h];\n }\n return clean;\n });\n writeCsv(csvPath, { headers: cleanHeaders, rows: cleanRows });\n }\n }\n }\n\n return issues;\n}\n\nfunction findNearestWall(\n px: number,\n py: number,\n walls: WallGeo[],\n tolerance: number,\n preferredHostId?: string,\n): { wallId: string; position: number } | null {\n let bestWallId = '';\n let bestPosition = 0;\n let bestDist = Infinity;\n\n for (const wall of walls) {\n const dx = wall.end_x - wall.start_x;\n const dy = wall.end_y - wall.start_y;\n const lenSq = dx * dx + dy * dy;\n if (lenSq < 1e-10) continue;\n\n // Project point onto wall line\n const t = ((px - wall.start_x) * dx + (py - wall.start_y) * dy) / lenSq;\n const clampedT = Math.max(0, Math.min(1, t));\n\n const closestX = wall.start_x + clampedT * dx;\n const closestY = wall.start_y + clampedT * dy;\n const dist = Math.sqrt((px - closestX) ** 2 + (py - closestY) ** 2);\n\n // If host_id is specified, only match that wall\n if (preferredHostId && preferredHostId !== '') {\n if (wall.id === preferredHostId) {\n return { wallId: wall.id, position: clampedT * wall.length };\n }\n continue;\n }\n\n if (dist < bestDist) {\n bestDist = dist;\n bestWallId = wall.id;\n bestPosition = clampedT * wall.length;\n }\n }\n\n if (bestDist > tolerance && !preferredHostId) return null;\n if (!bestWallId) return null;\n\n return { wallId: bestWallId, position: bestPosition };\n}\n","import { discoverLayout, dirFiles } from '../utils/fs.js';\nimport { snapProjectEndpoints, type SnapRecord } from './project-rooms.js';\n\nexport type { SnapRecord };\n\n/**\n * Pre-build step: merge wall endpoints of the same level that lie within 5 cm (in project units) of each other.\n * Modifies GeoJSON files in-place. Returns what was moved. (The IFC importer runs the same snap on its output.)\n */\nexport function snapEndpoints(dir: string): SnapRecord[] {\n const layout = discoverLayout(dir);\n return snapProjectEndpoints(dirFiles(dir), ['global', ...layout.levelDirs.map(d => d.name)]);\n}\n","import { join } from 'node:path';\nimport { discoverLayout, listFiles } from '../utils/fs.js';\nimport { readCsv } from '../utils/csv.js';\nimport { groupWarnings } from '../validate/groups.js';\n\n/** Read the level CSVs and report model group instances that diverged. */\nexport function groupWarningsForDir(dir: string): string[] {\n const layout = discoverLayout(dir);\n const entries = [];\n for (const d of layout.levelDirs) {\n const files = listFiles(d.path).filter(f => f.endsWith('.csv'));\n if (!files.includes('model_group.csv')) continue;\n for (const f of files) {\n try {\n entries.push({ path: `${d.name}/${f}`, tableName: f.replace('.csv', ''), data: readCsv(join(d.path, f)) });\n } catch { /* unreadable CSVs are reported by validate */ }\n }\n }\n return groupWarnings(entries);\n}\n","import { existsSync } from 'node:fs';\nimport { join } from 'node:path';\nimport { discoverLayout } from '../utils/fs.js';\nimport { readCsv } from '../utils/csv.js';\n\n/** Tables whose marks must be unique project-wide, and the group they share (curtain wall door panels number with doors). */\nconst GROUPS: Record<string, string> = { door: 'door', curtain_wall: 'door', window: 'window', space: 'space' };\n\n/**\n * Duplicate marks across the project (Revit \"duplicate Mark values\"): a door,\n * curtain wall door panel (`door_numbers`), window or room number used more\n * than once. One warning per duplicated number.\n */\nexport function numberWarnings(dir: string): string[] {\n const layout = discoverLayout(dir);\n const seen = new Map<string, string[]>(); // group|number → \"lv-1/door.csv:3\"\n const dirs = [{ name: 'global', path: layout.globalDir }, ...layout.levelDirs];\n for (const d of dirs) {\n for (const table of Object.keys(GROUPS)) {\n const path = join(d.path, `${table}.csv`);\n if (!existsSync(path)) continue;\n let rows: Record<string, string>[];\n try { rows = readCsv(path).rows; } catch { continue; }\n rows.forEach((row, i) => {\n const marks = table === 'curtain_wall' ? (row.door_numbers ?? '').split(';') : [row.number ?? ''];\n for (const raw of marks) {\n const n = raw.trim();\n if (!n) continue;\n const k = `${GROUPS[table]}|${n}`;\n const at = `${d.name}/${table}.csv:${i + 2}`;\n const list = seen.get(k);\n if (list) list.push(at); else seen.set(k, [at]);\n }\n });\n }\n }\n const out: string[] = [];\n for (const [k, at] of seen) {\n if (at.length < 2) continue;\n const [group, n] = k.split('|');\n out.push(`${at[0]} ${group} number \"${n}\" is used ${at.length} times (${at.join(', ')})`);\n }\n return out;\n}\n","/**\n * Authoring hints for `bimdown build` (not warnings: the model is valid):\n * elements written with raw sizes instead of a type (Revit always places a\n * type), and doors / windows without a mark. One line per table, project-wide.\n */\nimport { existsSync } from 'node:fs';\nimport { join } from 'node:path';\nimport { readCsv } from '../utils/csv.js';\nimport { discoverLayout } from '../utils/fs.js';\nimport { buildRegistry, getSpecDir } from '../schema/registry.js';\nimport { loadCatalog, sameValue, typeParamFields, typeValues, type ElementType } from '../catalog/index.js';\n\n/** Size fields that identify a type (a row setting none of them is not \"raw\"). */\nconst SIZE_FIELDS = ['thickness', 'width', 'length', 'height', 'size_x', 'size_y'];\n/** Typed tables placed by family / host rather than by size. */\nconst SKIP = new Set(['furniture', 'railing']);\nconst MARKED = ['door', 'window'];\nconst LIST = 3;\n\ninterface Raw { at: string; id: string; row: Record<string, string> }\n\nfunction rowsOf(path: string): Record<string, string>[] {\n if (!existsSync(path)) return [];\n try { return readCsv(path).rows; } catch { return []; }\n}\n\n/** The type whose parameters agree with every one the row sets (at least one size), if any. */\nfunction matchingType(row: Record<string, string>, fields: string[], types: ElementType[]): ElementType | undefined {\n return types.find((t) => {\n const v = typeValues(t);\n let sized = false;\n for (const f of fields) {\n const own = (row[f] ?? '').trim();\n if (!own) continue;\n if (v[f] === undefined) return false;\n if (!sameValue(own, v[f])) return false;\n if (SIZE_FIELDS.includes(f)) sized = true;\n }\n return sized;\n });\n}\n\n/** A size as written, trimmed to 4 decimals for display. */\nconst short = (v: string) => (Number.isFinite(Number(v)) ? String(Math.round(Number(v) * 1e4) / 1e4) : v);\nconst ids = (list: Raw[]) => list.slice(0, LIST).map((r) => r.at).join(', ') + (list.length > LIST ? ', …' : '');\n\nexport function authoringHints(dir: string): string[] {\n const registry = buildRegistry(getSpecDir());\n const layout = discoverLayout(dir);\n const dirs = [{ name: 'global', path: layout.globalDir }, ...layout.levelDirs];\n const catalog = loadCatalog(dir);\n const out: string[] = [];\n\n for (const [table, def] of [...registry].sort(([a], [b]) => a.localeCompare(b))) {\n if (!def.typeTable || SKIP.has(table)) continue;\n const fields = typeParamFields(table);\n const sizeFields = fields.filter((f) => SIZE_FIELDS.includes(f));\n if (sizeFields.length === 0) continue;\n const raw: Raw[] = [];\n for (const d of dirs) {\n for (const row of rowsOf(join(d.path, `${table}.csv`))) {\n if (row.type_id || !sizeFields.some((f) => (row[f] ?? '').trim())) continue;\n raw.push({ at: `${d.name}/${row.id}`, id: row.id, row });\n }\n }\n if (raw.length === 0) continue;\n\n const types = [...catalog.types.values()].filter((t) => t.table === def.typeTable);\n const byType = new Map<string, Raw[]>();\n const unmatched: Raw[] = [];\n for (const r of raw) {\n const t = matchingType(r.row, fields, types);\n if (!t) { unmatched.push(r); continue; }\n const list = byType.get(t.id);\n if (list) list.push(r); else byType.set(t.id, [r]);\n }\n const parts: string[] = [];\n if (byType.size > 0) {\n const matched = [...byType].map(([id, list]) => `${id} ← ${list.length} (${ids(list)})`).join('; ');\n const set = fields.filter((f) => [...byType.values()].some((l) => l.some((r) => (r.row[f] ?? '').trim())));\n parts.push(`same size as a ${def.typeTable}: ${matched} — set type_id, clear ${set.join('/')} (check the material)`);\n }\n if (unmatched.length > 0) {\n const shown = sizeFields.filter((f) => unmatched.some((r) => (r.row[f] ?? '').trim()));\n const sizes = new Map<string, number>();\n for (const r of unmatched) {\n const k = shown.map((f) => (r.row[f] ? short(r.row[f]) : '-')).join('×');\n sizes.set(k, (sizes.get(k) ?? 0) + 1);\n }\n const top = [...sizes].sort((a, b) => b[1] - a[1]).slice(0, 4).map(([k, n]) => `${k} ×${n}`).join(', ');\n parts.push(`${unmatched.length} in ${sizes.size} size(s) [${shown.join('×')}: ${top}${sizes.size > 4 ? ', …' : ''}] — add a ${def.typeTable} row per size (or use an existing one) and set type_id`);\n }\n out.push(`[hint] ${table}: ${raw.length} row(s) without type_id; ${parts.join('; ')}`);\n }\n\n for (const table of MARKED) {\n const unmarked: Raw[] = [];\n for (const d of dirs) {\n for (const row of rowsOf(join(d.path, `${table}.csv`))) {\n if (!(row.number ?? '').trim()) unmarked.push({ at: `${d.name}/${row.id}`, id: row.id, row });\n }\n }\n if (unmarked.length > 0) {\n out.push(`[hint] ${table}: ${unmarked.length} row(s) without a number (mark: tags and schedules show it; unique project-wide): ${ids(unmarked)}`);\n }\n }\n return out;\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,SAAS,cAAAA,cAAY,WAAW,aAAa,eAAAC,cAAa,cAAc,QAAQ,mBAAmB;AACnG,SAAS,QAAAC,cAAY;AACrB,SAAS,cAAc;;;ACFvB,SAAS,cAAAC,mBAAkB;AAC3B,SAAS,QAAAC,aAAY;;;ACDrB,SAAS,YAAY,aAAa,oBAAoB;AACtD,SAAS,MAAM,eAAe;AAU9B,IAAM,2BAA2B,oBAAI,IAAI,CAAC,WAAW,SAAS,SAAS,QAAQ,SAAS,CAAC;AAEzF,IAAM,kBAAkB,IAAI,IAAI,OAAO,KAAK,WAAW,EAAE,IAAI,CAAC,MAAM,GAAG,CAAC,MAAM,CAAC;AAC/E,IAAM,sBAAsB,IAAI,IAAI,OAAO,OAAO,kBAAkB,EAAE,IAAI,CAAC,MAAM,GAAG,CAAC,UAAU,CAAC;AAChG,IAAM,sBAAsB,oBAAI,IAAI,CAAC,YAAY,CAAC;AAElD,IAAM,iBAAiB;AAIvB,IAAM,qBAAqB;AAGpB,IAAM,0BAA0B,CAAC,kBAAkB,gBAAgB,kBAAkB,UAAU,WAAW,SAAS,UAAU,aAAa,cAAc,WAAW;AAEnK,SAAS,kBAAkB,KAAuB;AACvD,QAAM,SAAmB,CAAC;AAC1B,QAAM,SAAS,eAAe,GAAG;AAGjC,MAAI,CAAC,WAAW,OAAO,SAAS,GAAG;AACjC,WAAO,KAAK,oCAAoC;AAChD,WAAO;AAAA,EACT;AAIA,QAAM,cAAc,UAAU,OAAO,SAAS;AAC9C,MAAI,CAAC,YAAY,SAAS,WAAW,GAAG;AACtC,WAAO,KAAK,4BAA4B;AAAA,EAC1C;AAGA,aAAW,KAAK,aAAa;AAC3B,UAAM,MAAM,QAAQ,CAAC;AACrB,QAAI,QAAQ,QAAQ;AAClB,aAAO,KAAK,UAAU,CAAC,iEAAiE;AAAA,IAC1F,WAAW,QAAQ,QAAQ;AACzB,UAAI,CAAC,gBAAgB,IAAI,CAAC,KAAK,CAAC,oBAAoB,IAAI,CAAC,GAAG;AAC1D,eAAO,KAAK,UAAU,CAAC,yDAAoD;AAAA,MAC7E,WAAW,kBAAkB,IAAI,EAAE,QAAQ,QAAQ,EAAE,CAAC,KAAK,CAAC,uBAAuB,IAAI,EAAE,QAAQ,QAAQ,EAAE,CAAC,GAAG;AAC7G,eAAO,KAAK,UAAU,CAAC,mDAA8C,CAAC,uBAAuB;AAAA,MAC/F,WAAW,kBAAkB,IAAI,EAAE,QAAQ,QAAQ,EAAE,CAAC,GAAG;AACvD,eAAO,KAAK,UAAU,CAAC,+CAA0C,CAAC,uBAAuB;AAAA,MAC3F;AAAA,IACF,WAAW,QAAQ,YAAY;AAC7B,UAAI,CAAC,oBAAoB,IAAI,CAAC,GAAG;AAC/B,eAAO,KAAK,UAAU,CAAC,mEAA8D;AAAA,MACvF;AAAA,IACF,OAAO;AACL,aAAO,KAAK,UAAU,CAAC,4EAAuE;AAAA,IAChG;AAAA,EACF;AAGA,aAAW,MAAM,OAAO,WAAW;AACjC,QAAI,CAAC,UAAU,KAAK,GAAG,IAAI,GAAG;AAC5B,aAAO,KAAK,GAAG,GAAG,IAAI,kDAAkD;AACxE;AAAA,IACF;AAEA,UAAM,QAAQ,UAAU,GAAG,IAAI;AAE/B,eAAW,KAAK,OAAO;AACrB,YAAM,MAAM,QAAQ,CAAC;AACrB,UAAI,QAAQ,QAAQ;AAClB,YAAI,CAAC,gBAAgB,IAAI,CAAC,GAAG;AAC3B,iBAAO,KAAK,GAAG,GAAG,IAAI,IAAI,CAAC,sDAAiD;AAAA,QAC9E;AACA,cAAM,YAAY,EAAE,QAAQ,QAAQ,EAAE;AACtC,YAAI,mBAAmB,IAAI,SAAS,GAAG;AACrC,iBAAO,KAAK,GAAG,GAAG,IAAI,IAAI,CAAC,KAAK,SAAS,0BAA0B;AAAA,QACrE;AAAA,MACF,WAAW,QAAQ,QAAQ;AACzB,eAAO,KAAK,GAAG,GAAG,IAAI,IAAI,CAAC,iEAAiE;AAAA,MAC9F,WAAW,QAAQ,YAAY;AAC7B,YAAI,CAAC,oBAAoB,IAAI,CAAC,GAAG;AAC/B,iBAAO,KAAK,GAAG,GAAG,IAAI,IAAI,CAAC,mEAA8D;AAAA,QAC3F;AACA,cAAM,OAAO,EAAE,QAAQ,YAAY,EAAE;AACrC,cAAM,YAAY,OAAO,QAAQ,kBAAkB,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,MAAM,MAAM,IAAI,IAAI,CAAC;AACpF,YAAI,aAAa,CAAC,MAAM,SAAS,GAAG,SAAS,MAAM,GAAG;AACpD,iBAAO,KAAK,GAAG,GAAG,IAAI,IAAI,CAAC,yCAAoC,SAAS,MAAM;AAAA,QAChF;AAAA,MACF,OAAO;AACL,eAAO,KAAK,GAAG,GAAG,IAAI,IAAI,CAAC,iEAA4D;AAAA,MACzF;AAAA,IACF;AAGA,eAAW,KAAK,OAAO;AACrB,UAAI,QAAQ,CAAC,MAAM,OAAQ;AAC3B,YAAM,YAAY,EAAE,QAAQ,QAAQ,EAAE;AACtC,YAAM,cAAc,mBAAmB,SAAS;AAChD,UAAI,eAAe,CAAC,MAAM,SAAS,GAAG,WAAW,UAAU,KAAK,CAAC,yBAAyB,IAAI,SAAS,GAAG;AACxG,eAAO,KAAK,GAAG,GAAG,IAAI,IAAI,CAAC,kCAAkC,WAAW,WAAW;AAAA,MACrF;AAAA,IACF;AAAA,EACF;AAKA,QAAM,aAAa,YAAY,GAAG;AAClC,aAAW,KAAK,YAAY;AAC1B,QAAI,MAAM,YAAY,UAAU,KAAK,CAAC,EAAG;AACzC,QAAI,MAAM,wBAAyB;AACnC,QAAI,MAAM,gBAAgB,WAAW,IAAI,CAAC,EAAG;AAC7C,QAAI,EAAE,WAAW,GAAG,EAAG;AACvB,QAAI,eAAe,KAAK,CAAC,EAAG;AAC5B,WAAO,KAAK,GAAG,CAAC,4JAAuJ;AAAA,EACzK;AAEA,SAAO,KAAK,GAAG,sBAAsB,GAAG,CAAC;AAGzC,QAAM,eAAe,KAAK,KAAK,uBAAuB;AACtD,MAAI,WAAW,YAAY,GAAG;AAC5B,QAAI;AACF,YAAM,MAAM,aAAa,cAAc,OAAO;AAC9C,YAAM,WAAW,KAAK,MAAM,GAAG;AAC/B,UAAI,OAAO,aAAa,YAAY,aAAa,QAAQ,MAAM,QAAQ,QAAQ,GAAG;AAChF,eAAO,KAAK,8CAA8C;AAAA,MAC5D,OAAO;AACL,cAAM,KAAK,SAAS;AACpB,YAAI,OAAO,UAAa,OAAO,MAAM;AACnC,iBAAO,KAAK,iDAAiD;AAAA,QAC/D,OAAO;AACL,gBAAM,IAAI,OAAO,OAAO,WAAW,KAAK,SAAS,OAAO,EAAE,GAAG,EAAE;AAC/D,cAAI,CAAC,OAAO,SAAS,CAAC,GAAG;AACvB,mBAAO,KAAK,oDAAoD,EAAE,EAAE;AAAA,UACtE,WAAW,IAAI,oBAAoB;AACjC,mBAAO;AAAA,cACL,yCAAyC,CAAC;AAAA,YAC5C;AAAA,UACF;AAAA,QAIF;AACA,mBAAWC,QAAO,OAAO,KAAK,QAAQ,GAAG;AACvC,cAAI,CAAC,wBAAwB,SAASA,IAAG,GAAG;AAC1C,mBAAO,KAAK,yCAAyCA,IAAG,GAAG;AAAA,UAC7D;AAAA,QACF;AACA,YAAI,SAAS,cAAc,UAAa,SAAS,cAAc,YAAY;AACzE,iBAAO,KAAK,+CAA+C,KAAK,UAAU,SAAS,SAAS,CAAC,4BAAuB;AAAA,QACtH;AACA,YAAI,SAAS,cAAc,QAAW;AACpC,gBAAM,KAAK,SAAS;AACpB,cAAI,OAAO,OAAO,YAAY,OAAO,QAAQ,MAAM,QAAQ,EAAE,KAAK,OAAO,OAAO,EAAE,EAAE,KAAK,CAAC,MAAM,OAAO,MAAM,QAAQ,GAAG;AACtH,mBAAO,KAAK,wGAA8F;AAAA,UAC5G;AAAA,QACF;AACA,YAAI,SAAS,UAAU,QAAW;AAChC,gBAAM,aAAa,CAAC,KAAK,MAAM,MAAM,IAAI;AACzC,cAAI,OAAO,SAAS,UAAU,YAAY,CAAC,WAAW,SAAS,SAAS,KAAK,GAAG;AAC9E,mBAAO;AAAA,cACL,2CAA2C,KAAK,UAAU,SAAS,KAAK,CAAC,0BAAqB,WAAW,KAAK,IAAI,CAAC;AAAA,YACrH;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAAA,IACF,SAAS,GAAG;AACV,aAAO,KAAK,2CAA4C,EAAY,OAAO,EAAE;AAAA,IAC/E;AAAA,EACF;AAEA,SAAO;AACT;AAGO,IAAM,sBAAsB,oBAAI,IAAI,CAAC,QAAQ,QAAQ,SAAS,SAAS,QAAQ,MAAM,CAAC;AAM7F,SAAS,sBAAsB,KAAuB;AACpD,QAAM,UAAU,KAAK,KAAK,UAAU,cAAc;AAClD,MAAI,CAAC,WAAW,OAAO,EAAG,QAAO,CAAC;AAClC,MAAI;AACJ,MAAI;AACF,WAAO,QAAQ,OAAO,EAAE;AAAA,EAC1B,QAAQ;AACN,WAAO,CAAC;AAAA,EACV;AACA,QAAM,SAAmB,CAAC;AAC1B,OAAK,QAAQ,CAAC,KAAK,MAAM;AACvB,UAAM,OAAO,IAAI;AACjB,QAAI,CAAC,KAAM;AACX,UAAM,QAAQ,uBAAuB,IAAI,CAAC;AAC1C,QAAI,CAAC,KAAK,WAAW,YAAY,KAAK,KAAK,SAAS,IAAI,GAAG;AACzD,aAAO,KAAK,GAAG,KAAK,WAAW,IAAI,mCAAmC;AACtE;AAAA,IACF;AACA,QAAI,CAAC,oBAAoB,IAAI,QAAQ,IAAI,EAAE,YAAY,CAAC,GAAG;AACzD,aAAO,KAAK,GAAG,KAAK,WAAW,IAAI,uCAAuC,CAAC,GAAG,mBAAmB,EAAE,KAAK,IAAI,CAAC,GAAG;AAChH;AAAA,IACF;AACA,QAAI,CAAC,WAAW,KAAK,KAAK,IAAI,CAAC,GAAG;AAChC,aAAO,KAAK,GAAG,KAAK,WAAW,IAAI,aAAa;AAAA,IAClD;AAAA,EACF,CAAC;AACD,SAAO;AACT;;;AClNO,SAAS,mBACd,MACA,OACA,MACA,UACU;AACV,QAAM,SAAmB,CAAC;AAC1B,QAAM,WAAW,IAAI,IAAI,MAAM,UAAU,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC;AAC3D,QAAM,SAAS,IAAI,IAAI,KAAK,OAAO;AAEnC,aAAW,KAAK,KAAK,oBAAoB,CAAC,GAAG;AAC3C,WAAO,KAAK,GAAG,IAAI,uBAAuB,CAAC,iDAAiD,CAAC,WAAW;AAAA,EAC1G;AAEA,aAAW,KAAK,KAAK,SAAS;AAC5B,QAAI,CAAC,SAAS,IAAI,CAAC,GAAG;AACpB,aAAO,KAAK,GAAG,IAAI,wBAAwB,CAAC,GAAG;AAAA,IACjD;AAAA,EACF;AACA,aAAW,KAAK,MAAM,WAAW;AAC/B,QAAI,EAAE,YAAY,CAAC,OAAO,IAAI,EAAE,IAAI,GAAG;AAErC,UAAI,YAAY,OAAO,IAAI,SAAS,KAAK,KAAK,KAAK,MAAM,CAAC,MAAM,SAAS,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,EAAG;AAC1F,aAAO,KAAK,GAAG,IAAI,8BAA8B,EAAE,IAAI,GAAG;AAAA,IAC5D;AAAA,EACF;AAEA,SAAO;AACT;AAEO,SAAS,oBACd,MACA,OACA,MACA,UACU;AACV,QAAM,SAAmB,CAAC;AAC1B,QAAM,iBAAiB,MAAM,UAAU,OAAO,CAAC,MAAM,EAAE,QAAQ;AAE/D,WAAS,IAAI,GAAG,IAAI,KAAK,KAAK,QAAQ,KAAK;AACzC,UAAM,MAAM,KAAK,KAAK,CAAC;AACvB,UAAM,WAAW,YAAY,IAAI,UAAU,SAAS,GAAG,IAAI;AAC3D,eAAW,KAAK,gBAAgB;AAC9B,YAAM,MAAM,IAAI,EAAE,IAAI;AACtB,WAAK,QAAQ,UAAa,QAAQ,OAAO,CAAC,UAAU,IAAI,EAAE,IAAI,GAAG;AAC/D,eAAO,KAAK,GAAG,IAAI,IAAI,IAAI,CAAC,qBAAqB,EAAE,IAAI,YAAY;AAAA,MACrE;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;AAEO,SAAS,iBACd,MACA,OACA,MACU;AACV,QAAM,SAAmB,CAAC;AAC1B,QAAM,aAAa,MAAM,UAAU,OAAO,CAAC,MAAM,EAAE,SAAS,UAAU,EAAE,MAAM;AAE9E,WAAS,IAAI,GAAG,IAAI,KAAK,KAAK,QAAQ,KAAK;AACzC,UAAM,MAAM,KAAK,KAAK,CAAC;AACvB,eAAW,KAAK,YAAY;AAC1B,YAAM,MAAM,IAAI,EAAE,IAAI;AACtB,UAAI,QAAQ,UAAa,QAAQ,MAAM,CAAC,EAAE,OAAQ,SAAS,GAAG,GAAG;AAC/D,eAAO;AAAA,UACL,GAAG,IAAI,IAAI,IAAI,CAAC,YAAY,EAAE,IAAI,YAAY,GAAG,0BAA0B,EAAE,OAAQ,KAAK,IAAI,CAAC;AAAA,QACjG;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;AAEA,IAAM,iBAAiB,oBAAI,IAAI,CAAC,QAAQ,OAAO,CAAC;AAGzC,SAAS,iBACd,MACA,OACA,MACU;AACV,QAAM,SAAmB,CAAC;AAC1B,QAAM,QAAQ,MAAM,UAAU,OAAO,CAAC,MAAM,EAAE,SAAS,aAAc,EAAE,SAAS,WAAW,EAAE,SAAS,WAAW,EAAE,SAAS,MAAO;AACnI,MAAI,MAAM,WAAW,EAAG,QAAO;AAC/B,WAAS,IAAI,GAAG,IAAI,KAAK,KAAK,QAAQ,KAAK;AACzC,UAAM,MAAM,KAAK,KAAK,CAAC;AACvB,eAAW,KAAK,OAAO;AACrB,YAAM,MAAM,IAAI,EAAE,IAAI;AACtB,UAAI,QAAQ,UAAa,QAAQ,GAAI;AACrC,UAAI,EAAE,SAAS,WAAW;AACxB,YAAI,CAAC,eAAe,IAAI,IAAI,YAAY,CAAC,EAAG,QAAO,KAAK,GAAG,IAAI,IAAI,IAAI,CAAC,YAAY,EAAE,IAAI,YAAY,GAAG,yBAAyB;AAAA,MACpI,WAAW,CAAC,OAAO,SAAS,OAAO,GAAG,CAAC,KAAK,OAAO,GAAG,IAAI,GAAG;AAC3D,eAAO,KAAK,GAAG,IAAI,IAAI,IAAI,CAAC,YAAY,EAAE,IAAI,YAAY,GAAG,iCAAiC;AAAA,MAChG;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;;;ACvGO,SAAS,iBACd,MACA,OACA,MACU;AACV,QAAM,SAAmB,CAAC;AAC1B,QAAM,SAAS,MAAM;AAErB,WAAS,IAAI,GAAG,IAAI,KAAK,KAAK,QAAQ,KAAK;AACzC,UAAM,KAAK,KAAK,KAAK,CAAC,EAAE;AACxB,QAAI,CAAC,GAAI;AAOT,UAAM,QAAQ,IAAI,OAAO,IAAI,MAAM,MAAM;AACzC,QAAI,CAAC,MAAM,KAAK,EAAE,GAAG;AACnB,aAAO,KAAK,GAAG,IAAI,IAAI,IAAI,CAAC,SAAS,EAAE,iCAAiC,MAAM,OAAO;AAAA,IACvF;AAAA,EACF;AAEA,SAAO;AACT;AAUO,SAAS,mBAA+B;AAC7C,SAAO,EAAE,KAAK,oBAAI,IAAI,GAAG,QAAQ,oBAAI,IAAI,GAAG,QAAQ,CAAC,EAAE;AACzD;AAEO,SAAS,YACd,UACA,MACA,WACA,MACM;AAEN,QAAM,QAAQ,KAAK,MAAM,GAAG,EAAE,CAAC;AAE/B,WAAS,IAAI,GAAG,IAAI,KAAK,KAAK,QAAQ,KAAK;AACzC,UAAM,KAAK,KAAK,KAAK,CAAC,EAAE;AACxB,QAAI,CAAC,GAAI;AAGT,UAAM,YAAY,GAAG,KAAK,IAAI,EAAE;AAChC,UAAM,WAAW,SAAS,IAAI,IAAI,SAAS;AAC3C,QAAI,UAAU;AACZ,UAAI,SAAS,UAAU,WAAW;AAChC,iBAAS,OAAO;AAAA,UACd,GAAG,IAAI,IAAI,IAAI,CAAC,mBAAmB,EAAE,oBAAoB,SAAS,IAAI,IAAI,SAAS,GAAG;AAAA,QACxF;AAAA,MACF,OAAO;AACL,iBAAS,OAAO;AAAA,UACd,GAAG,IAAI,IAAI,IAAI,CAAC,SAAS,EAAE,oBAAoB,SAAS,KAAK,OAAO,SAAS,IAAI,IAAI,SAAS,GAAG;AAAA,QACnG;AAAA,MACF;AAAA,IACF,OAAO;AACL,eAAS,IAAI,IAAI,WAAW,EAAE,OAAO,WAAW,MAAM,KAAK,IAAI,EAAE,CAAC;AAAA,IACpE;AAGA,aAAS,OAAO,IAAI,IAAI,EAAE,OAAO,WAAW,MAAM,KAAK,IAAI,EAAE,CAAC;AAAA,EAChE;AACF;;;ACrEO,SAAS,mBACd,MACA,OACA,MACA,YACU;AACV,QAAM,SAAmB,CAAC;AAC1B,QAAM,YAAY,MAAM,UAAU,OAAO,CAAC,MAAM,EAAE,SAAS,WAAW;AAEtE,WAAS,IAAI,GAAG,IAAI,KAAK,KAAK,QAAQ,KAAK;AACzC,UAAM,MAAM,KAAK,KAAK,CAAC;AACvB,eAAW,KAAK,WAAW;AACzB,YAAM,MAAM,IAAI,EAAE,IAAI;AACtB,UAAI,CAAC,IAAK;AAEV,YAAM,QAAQ,WAAW,OAAO,IAAI,GAAG;AACvC,UAAI,CAAC,OAAO;AACV,eAAO,KAAK,GAAG,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,IAAI,KAAK,GAAG,8BAA8B;AAC7E;AAAA,MACF;AAGA,UAAI,EAAE,aAAa,EAAE,cAAc,WAAW;AAC5C,cAAM,iBAAiB,YAAY,EAAE,SAAS;AAC9C,YAAI,kBAAkB,CAAC,IAAI,WAAW,iBAAiB,GAAG,GAAG;AAC3D,iBAAO;AAAA,YACL,GAAG,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,IAAI,KAAK,GAAG,sBAAsB,EAAE,SAAS,aAAa,cAAc;AAAA,UACjG;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;;;ACmBA,IAAM,MAAM,CAAC,MAAc,EAAE,QAAQ,CAAC;AAGtC,SAAS,SAAS,IAAwB,IAAwB,IAAwB,IAAwB,KAAsB;AACtI,MAAI,OAAO,UAAa,OAAO,UAAa,OAAO,UAAa,OAAO,OAAW,QAAO;AACzF,SAAO,KAAK,IAAI,IAAI,EAAE,IAAI,KAAK,IAAI,IAAI,EAAE,IAAI;AAC/C;AAGO,SAAS,eAAe,SAAwB,KAAa,OAAO,KAAqB;AAC9F,QAAM,MAAsB,CAAC;AAC7B,QAAM,SAAS,oBAAI,IAA2B;AAC9C,aAAW,KAAK,SAAS;AACvB,QAAI,CAAC,EAAE,UAAU,CAAC,OAAO,SAAS,EAAE,QAAQ,KAAK,CAAC,OAAO,SAAS,EAAE,KAAK,EAAG;AAC5E,UAAMC,OAAM,GAAG,EAAE,KAAK,KAAS,EAAE,MAAM;AACvC,UAAM,OAAO,OAAO,IAAIA,IAAG;AAC3B,QAAI,KAAM,MAAK,KAAK,CAAC;AAAA,QAChB,QAAO,IAAIA,MAAK,CAAC,CAAC,CAAC;AAAA,EAC1B;AACA,aAAW,SAAS,OAAO,OAAO,GAAG;AACnC,QAAI,MAAM,SAAS,EAAG;AACtB,UAAM,KAAK,CAAC,GAAG,MAAM,EAAE,WAAW,EAAE,QAAQ;AAC5C,aAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,eAAS,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACzC,cAAM,IAAI,MAAM,CAAC,GAAG,IAAI,MAAM,CAAC;AAC/B,cAAM,MAAM,EAAE,WAAW,EAAE,QAAQ,GAAG,MAAM,EAAE,WAAW,EAAE,QAAQ;AACnE,cAAM,MAAM,EAAE,WAAW,EAAE,QAAQ,GAAG,MAAM,EAAE,WAAW,EAAE,QAAQ;AACnE,cAAM,UAAU,KAAK,IAAI,KAAK,GAAG,IAAI,KAAK,IAAI,KAAK,GAAG;AACtD,YAAI,WAAW,IAAK;AACpB,cAAM,OAAO,EAAE,SAAS,UAAa,EAAE,WAAW,SAAY,EAAE,OAAO,EAAE,SAAS;AAClF,cAAM,OAAO,EAAE,SAAS,UAAa,EAAE,WAAW,SAAY,EAAE,OAAO,EAAE,SAAS;AAClF,YAAI,CAAC,SAAS,EAAE,MAAM,MAAM,EAAE,MAAM,MAAM,GAAG,EAAG;AAChD,YAAI,KAAK;AAAA,UACP,MAAM;AAAA,UAAkB,OAAO,EAAE;AAAA,UAAO,KAAK,CAAC,EAAE,IAAI,EAAE,EAAE;AAAA,UAAG,QAAQ,CAAC,EAAE,OAAO,EAAE,KAAK;AAAA,UAAG,QAAQ,EAAE;AAAA,UAAQ;AAAA,UACzG,SAAS,GAAG,EAAE,EAAE,QAAQ,EAAE,EAAE,eAAe,EAAE,MAAM,KAAK,EAAE,EAAE,KAAK,IAAI,GAAG,CAAC,SAAI,IAAI,GAAG,CAAC,IAAI,IAAI,KAAK,EAAE,EAAE,KAAK,IAAI,GAAG,CAAC,SAAI,IAAI,GAAG,CAAC,IAAI,IAAI;AAAA,QACzI,CAAC;AAAA,MACH;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAGA,IAAM,eAAe;AAOd,SAAS,aAAa,OAAoB,KAAa,aAAa,MAAM,IAAI,OAAO,KAAqB;AAC/G,QAAM,MAAsB,CAAC;AAC7B,QAAM,QAAQ,MACX,IAAI,OAAK;AACR,UAAM,KAAK,EAAE,EAAE,IAAI,EAAE,EAAE,GAAG,KAAK,EAAE,EAAE,IAAI,EAAE,EAAE;AAC3C,UAAM,MAAM,KAAK,MAAM,IAAI,EAAE;AAC7B,WAAO,EAAE,GAAG,KAAK,IAAI,KAAK,KAAK,IAAI,KAAK,KAAK,MAAM,KAAK,IAAI,EAAE,EAAE,GAAG,EAAE,EAAE,CAAC,IAAI,EAAE,WAAW,MAAM,KAAK,IAAI,EAAE,EAAE,GAAG,EAAE,EAAE,CAAC,IAAI,EAAE,WAAW,MAAM,KAAK,IAAI,EAAE,EAAE,GAAG,EAAE,EAAE,CAAC,IAAI,EAAE,WAAW,MAAM,KAAK,IAAI,EAAE,EAAE,GAAG,EAAE,EAAE,CAAC,IAAI,EAAE,UAAU;AAAA,EAC9N,CAAC,EACA,OAAO,OAAK,EAAE,MAAM,GAAG,EACvB,KAAK,CAAC,GAAG,MAAM,EAAE,OAAO,EAAE,IAAI;AACjC,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,UAAM,IAAI,MAAM,CAAC;AACjB,aAAS,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACzC,YAAM,IAAI,MAAM,CAAC;AACjB,UAAI,EAAE,OAAO,EAAE,KAAM;AACrB,UAAI,EAAE,EAAE,UAAU,EAAE,EAAE,SAAS,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,KAAM;AACnE,UAAI,KAAK,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE,IAAI,aAAc;AAExD,YAAM,SAAS,CAAC,MAAS,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE;AACvE,YAAM,MAAM,KAAK,IAAI,KAAK,IAAI,OAAO,EAAE,EAAE,CAAC,CAAC,GAAG,KAAK,IAAI,OAAO,EAAE,EAAE,CAAC,CAAC,CAAC;AACrE,UAAI,OAAO,KAAK,IAAI,EAAE,EAAE,WAAW,EAAE,EAAE,SAAS,IAAI,IAAI,IAAK;AAC7D,YAAM,QAAQ,CAAC,OAAU,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE;AACrE,YAAM,KAAK,MAAM,EAAE,EAAE,CAAC,GAAG,KAAK,MAAM,EAAE,EAAE,CAAC;AACzC,YAAM,KAAK,KAAK,IAAI,GAAG,KAAK,IAAI,IAAI,EAAE,CAAC,GAAG,KAAK,KAAK,IAAI,EAAE,KAAK,KAAK,IAAI,IAAI,EAAE,CAAC;AAC/E,UAAI,KAAK,MAAM,WAAY;AAC3B,UAAI,CAAC,SAAS,EAAE,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,EAAE,IAAI,GAAG,EAAG;AACpD,YAAM,KAAK,KAAK,MAAM;AACtB,UAAI,KAAK;AAAA,QACP,MAAM;AAAA,QAAgB,OAAO,EAAE,EAAE;AAAA,QAAO,KAAK,CAAC,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE;AAAA,QAAG,QAAQ,CAAC,EAAE,EAAE,OAAO,EAAE,EAAE,KAAK;AAAA,QAAG,SAAS,KAAK;AAAA,QAC7G,IAAI,EAAE,GAAG,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,GAAG,GAAG,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE;AAAA,QACnD,SAAS,GAAG,EAAE,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,gBAAgB,IAAI,KAAK,EAAE,CAAC,IAAI,IAAI;AAAA,MACtE,CAAC;AAAA,IACH;AAAA,EACF;AACA,SAAO;AACT;AAGO,IAAM,kBAAkB,oBAAI,IAAI;AAAA,EACrC;AAAA,EAAa;AAAA,EAAS;AAAA,EAAU;AAAA,EAAU;AAAA,EAAU;AAAA,EAAU;AAAA,EAAO;AAAA,EACrE;AAAA,EAAa;AAAA,EAAa;AAAA,EAAiB;AAAA,EAAiB;AAAA,EAC5D;AAAA,EAAoB;AAAA,EAAiB;AAAA,EAAiB;AACxD,CAAC;AAEM,IAAM,sBAAsB,oBAAI,IAAI,CAAC,YAAY,gBAAgB,gBAAgB,WAAW,QAAQ,MAAM,QAAQ,UAAU,WAAW,OAAO,CAAC;AAG/I,SAAS,kBAAkB,OAAe,KAA6D;AAC5G,MAAI,QAAQ,UAAa,IAAI,KAAK,MAAM,GAAI,QAAO;AACnD,QAAM,IAAI,OAAO,GAAG;AACpB,MAAI,CAAC,OAAO,SAAS,CAAC,EAAG,QAAO;AAChC,MAAI,gBAAgB,IAAI,KAAK,KAAK,EAAE,IAAI,GAAI,QAAO;AACnD,MAAI,oBAAoB,IAAI,KAAK,KAAK,IAAI,EAAG,QAAO;AACpD,SAAO;AACT;;;ACtJA,IAAM,YAAoC;AAAA,EACxC,WAAW;AAAA;AAAA,EACX,aAAa;AAAA,EACb,YAAY;AAAA,EACZ,WAAW;AAAA,EACX,OAAO;AAAA,EACP,QAAQ;AAAA,EACR,QAAQ;AAAA,EACR,QAAQ;AAAA,EACR,QAAQ;AAAA,EACR,UAAU;AAAA;AAAA,EACV,SAAS;AAAA;AAAA,EACT,SAAS;AAAA,EACT,OAAO;AAAA,EACP,OAAO;AAAA,EACP,SAAS;AAAA,EACT,OAAO;AAAA,EACP,YAAY;AAAA;AACd;AAGA,IAAM,cAAc;AAGpB,IAAM,kBAA0D;AAAA,EAC9D,YAAY,EAAE,WAAW,GAAG;AAAA,EAC5B,iBAAiB,EAAE,WAAW,GAAG;AAAA;AAAA;AAAA,EAGjC,UAAU,EAAE,GAAG,KAAK,GAAG,KAAK,OAAO,IAAI;AAAA;AAAA,EAEvC,WAAW,EAAE,QAAQ,IAAI,QAAQ,GAAG;AAAA;AAAA,EAEpC,gBAAgB,EAAE,GAAG,KAAK,GAAG,KAAK,OAAO,IAAI;AAC/C;AAEO,SAAS,eAAe,MAAc,OAAsB,MAAe,QAAQ,KAAe;AACvG,QAAM,MAAM,UAAU,KAAK,KAAK;AAChC,QAAM,SAAmB,CAAC;AAG1B,QAAM,cAAc,MAAM,UAAU;AAAA,IAClC,CAAC,OAAO,EAAE,SAAS,WAAW,EAAE,SAAS,UAAU,EAAE,SAAS,QAAQ,EAAE,SAAS;AAAA,EACnF;AAGA,QAAM,gBAAgB,MAAM,UAAU,OAAO,CAAC,MAAM,EAAE,SAAS,WAAW,EAAE,SAAS,KAAK;AAE1F,WAAS,IAAI,GAAG,IAAI,KAAK,KAAK,QAAQ,KAAK;AACzC,UAAM,MAAM,KAAK,KAAK,CAAC;AACvB,UAAM,SAAS,IAAI;AAEnB,eAAW,SAAS,eAAe;AACjC,YAAM,MAAM,kBAAkB,MAAM,MAAM,IAAI,MAAM,IAAI,CAAC;AACzD,UAAI,IAAK,QAAO,KAAK,GAAG,IAAI,IAAI,MAAM,KAAK,MAAM,IAAI,IAAI,IAAI,MAAM,IAAI,CAAC,YAAY,QAAQ,aAAa,mBAAmB,WAAW,EAAE;AAAA,IAC3I;AAEA,eAAW,SAAS,aAAa;AAC/B,YAAM,MAAM,IAAI,MAAM,IAAI;AAC1B,UAAI,QAAQ,UAAa,QAAQ,GAAI;AAErC,YAAM,MAAM,OAAO,GAAG;AACtB,UAAI,MAAM,GAAG,EAAG;AAEhB,YAAM,MAAM,gBAAgB,MAAM,IAAI,IAAI,MAAM,IAAI,KAAK,UAAU,MAAM,IAAI,KAAK;AAClF,UAAI,MAAM,SAAS,gBAAgB,KAAK,IAAI,GAAG,IAAI,MAAM,KAAK;AAC5D,eAAO;AAAA,UACL,GAAG,IAAI,IAAI,MAAM,KAAK,MAAM,IAAI,IAAI,GAAG,uCAAuC,KAAK,sBAAsB,EAAE,MAAM,KAAK,YAAY,CAAC,CAAC,IAAI,KAAK;AAAA,QAC/I;AAAA,MACF,WAAW,MAAM,SAAS,gBAAgB,KAAK,IAAI,GAAG,IAAI,KAAK;AAC7D,eAAO,KAAK,GAAG,IAAI,IAAI,MAAM,KAAK,MAAM,IAAI,IAAI,GAAG,qCAAqC,GAAG,GAAG;AAAA,MAChG;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;;;ACnFA,IAAM,oBAA6E;AAAA;AAAA,EAEjF,MAAM,oBAAI,IAAI,CAAC,YAAY,CAAC;AAAA,EAC5B,gBAAgB,oBAAI,IAAI,CAAC,YAAY,CAAC;AAAA,EACtC,cAAc,oBAAI,IAAI,CAAC,YAAY,CAAC;AAAA,EACpC,gBAAgB,oBAAI,IAAI,CAAC,YAAY,CAAC;AAAA,EACtC,OAAO,oBAAI,IAAI,CAAC,YAAY,CAAC;AAAA,EAC7B,WAAW,oBAAI,IAAI,CAAC,YAAY,CAAC;AAAA,EACjC,MAAM,oBAAI,IAAI,CAAC,YAAY,CAAC;AAAA,EAC5B,SAAS,oBAAI,IAAI,CAAC,YAAY,CAAC;AAAA,EAC/B,MAAM,oBAAI,IAAI,CAAC,YAAY,CAAC;AAAA,EAC5B,OAAO,oBAAI,IAAI,CAAC,YAAY,CAAC;AAAA,EAC7B,MAAM,oBAAI,IAAI,CAAC,YAAY,CAAC;AAAA,EAC5B,MAAM,oBAAI,IAAI,CAAC,YAAY,CAAC;AAAA,EAC5B,YAAY,oBAAI,IAAI,CAAC,YAAY,CAAC;AAAA,EAClC,SAAS,oBAAI,IAAI,CAAC,YAAY,CAAC;AAAA;AAAA,EAE/B,QAAQ,oBAAI,IAAI,CAAC,OAAO,CAAC;AAAA,EACzB,kBAAkB,oBAAI,IAAI,CAAC,OAAO,CAAC;AAAA,EACnC,WAAW,oBAAI,IAAI,CAAC,OAAO,CAAC;AAAA,EAC5B,UAAU,oBAAI,IAAI,CAAC,OAAO,CAAC;AAAA,EAC3B,UAAU,oBAAI,IAAI,CAAC,OAAO,CAAC;AAAA,EAC3B,WAAW,oBAAI,IAAI,CAAC,OAAO,CAAC;AAAA;AAAA,EAE5B,MAAM,oBAAI,IAAI,CAAC,SAAS,CAAC;AAAA,EACzB,MAAM,oBAAI,IAAI,CAAC,SAAS,CAAC;AAAA,EACzB,SAAS,oBAAI,IAAI,CAAC,SAAS,CAAC;AAAA,EAC5B,gBAAgB,oBAAI,IAAI,CAAC,SAAS,CAAC;AAAA,EACnC,OAAO,oBAAI,IAAI,CAAC,SAAS,CAAC;AAAA,EAC1B,eAAe,oBAAI,IAAI,CAAC,SAAS,CAAC;AAAA;AAAA,EAElC,YAAY,oBAAI,IAAI,CAAC,SAAS,cAAc,SAAS,CAAC;AAAA,EACtD,SAAS,oBAAI,IAAI,CAAC,SAAS,CAAC;AAC9B;AAEO,SAAS,oBACd,aACA,UACA,QACA,WACA,QAAQ,KACE;AACV,QAAM,SAAmB,CAAC;AAE1B,MAAI;AACJ,MAAI;AACF,SAAK,iBAAiB,QAAQ;AAAA,EAChC,SAAS,GAAG;AACV,WAAO,KAAK,GAAG,WAAW,8BAA+B,EAAY,OAAO,EAAE;AAC9E,WAAO;AAAA,EACT;AAEA,QAAM,YAAY,kBAAkB,IAAI,SAAS;AACjD,QAAM,WAAW,kBAAkB,SAAS;AAC5C,QAAM,UAAU,oBAAI,IAAY;AAEhC,WAAS,IAAI,GAAG,IAAI,GAAG,SAAS,QAAQ,KAAK;AAC3C,UAAM,OAAO,GAAG,SAAS,CAAC;AAC1B,UAAM,MAAM,GAAG,WAAW,YAAY,CAAC;AAEvC,QAAI,CAAC,QAAQ,KAAK,SAAS,WAAW;AACpC,aAAO,KAAK,GAAG,GAAG,wBAAwB;AAC1C;AAAA,IACF;AAEA,UAAM,KAAK,UAAU,IAAI;AACzB,QAAI,CAAC,MAAM,OAAO,aAAa;AAC7B,aAAO,KAAK,GAAG,GAAG,yBAAyB;AAC3C;AAAA,IACF;AACA,QAAI,QAAQ,IAAI,EAAE,GAAG;AACnB,aAAO,KAAK,GAAG,GAAG,mBAAmB,EAAE,GAAG;AAAA,IAC5C;AACA,YAAQ,IAAI,EAAE;AAEd,QAAI,CAAC,OAAO,IAAI,EAAE,GAAG;AACnB,aAAO,KAAK,GAAG,GAAG,SAAS,EAAE,2BAA2B;AAAA,IAC1D;AAEA,UAAM,IAAI,KAAK;AACf,QAAI,CAAC,KAAK,CAAC,EAAE,MAAM;AACjB,aAAO,KAAK,GAAG,GAAG,oBAAoB;AACtC;AAAA,IACF;AAEA,QAAI,YAAY,CAAC,SAAS,IAAI,EAAE,IAAW,GAAG;AAC5C,YAAM,UAAU,CAAC,GAAG,QAAQ,EAAE,KAAK,MAAM;AACzC,aAAO,KAAK,GAAG,GAAG,SAAS,EAAE,mBAAmB,EAAE,IAAI,oBAAoB,SAAS,cAAc,OAAO,GAAG;AAAA,IAC7G;AAEA,WAAO,KAAK,GAAG,uBAAuB,KAAK,IAAI,GAAG,WAAW,KAAK,CAAC;AAAA,EACrE;AAEA,SAAO;AACT;AAGA,IAAM,cAAc;AAEpB,SAAS,uBACP,KACA,IACA,GACA,WACA,OACU;AACV,QAAM,SAAmB,CAAC;AAC1B,QAAM,MAAM,eAAe,UAAU,KAAK,KAAK;AAE/C,QAAM,gBAAgB,CAAC,GAAQ,UAAkB;AAC/C,QAAI,CAAC,MAAM,QAAQ,CAAC,KAAK,EAAE,SAAS,KAAK,EAAE,SAAS,GAAG;AACrD,aAAO,KAAK,GAAG,GAAG,SAAS,EAAE,KAAK,KAAK,oCAAoC;AAC3E;AAAA,IACF;AACA,aAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;AACjC,YAAM,IAAI,EAAE,CAAC;AACb,UAAI,OAAO,MAAM,YAAY,CAAC,SAAS,CAAC,GAAG;AACzC,eAAO,KAAK,GAAG,GAAG,SAAS,EAAE,KAAK,KAAK,oCAAoC,CAAC,EAAE;AAC9E;AAAA,MACF;AACA,UAAI,KAAK,IAAI,CAAC,IAAI,KAAK;AACrB,eAAO,KAAK,GAAG,GAAG,SAAS,EAAE,KAAK,KAAK,eAAe,CAAC,uCAAuC,KAAK,sBAAsB,CAAC,IAAI,YAAY,CAAC,CAAC,IAAI,KAAK,yBAAoB;AACzK;AAAA,MACF;AAAA,IACF;AACA,QAAI,aAAa,EAAE,WAAW,GAAG;AAC/B,aAAO,KAAK,GAAG,GAAG,SAAS,EAAE,KAAK,KAAK,kDAAkD;AAAA,IAC3F;AACA,QAAI,CAAC,aAAa,EAAE,WAAW,GAAG;AAChC,aAAO,KAAK,GAAG,GAAG,SAAS,EAAE,KAAK,KAAK,kGAAkG;AAAA,IAC3I;AAAA,EACF;AAEA,MAAI,EAAE,SAAS,SAAS;AACtB,kBAAc,EAAE,aAAa,OAAO;AAAA,EACtC,WAAW,EAAE,SAAS,cAAc;AAClC,QAAI,CAAC,MAAM,QAAQ,EAAE,WAAW,KAAK,EAAE,YAAY,SAAS,GAAG;AAC7D,aAAO,KAAK,GAAG,GAAG,SAAS,EAAE,2CAA2C;AAAA,IAC1E,OAAO;AACL,oBAAc,EAAE,YAAY,CAAC,GAAG,eAAe;AAC/C,oBAAc,EAAE,YAAY,EAAE,YAAY,SAAS,CAAC,GAAG,kBAAkB;AAAA,IAC3E;AAAA,EACF,WAAW,EAAE,SAAS,WAAW;AAC/B,QAAI,CAAC,MAAM,QAAQ,EAAE,WAAW,KAAK,EAAE,YAAY,WAAW,GAAG;AAC/D,aAAO,KAAK,GAAG,GAAG,SAAS,EAAE,mCAAmC;AAAA,IAClE,OAAO;AACL,YAAM,OAAO,EAAE,YAAY,CAAC;AAC5B,UAAI,CAAC,MAAM,QAAQ,IAAI,KAAK,KAAK,SAAS,GAAG;AAC3C,eAAO,KAAK,GAAG,GAAG,SAAS,EAAE,yEAAyE;AAAA,MACxG,OAAO;AACL,sBAAc,KAAK,CAAC,GAAG,kBAAkB;AACzC,cAAM,QAAQ,KAAK,CAAC,GAAG,OAAO,KAAK,KAAK,SAAS,CAAC;AAClD,YAAI,MAAM,QAAQ,KAAK,KAAK,MAAM,QAAQ,IAAI,GAAG;AAC/C,cAAI,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,MAAM,CAAC,MAAM,KAAK,CAAC,GAAG;AAChD,mBAAO,KAAK,GAAG,GAAG,SAAS,EAAE,qDAAgD;AAAA,UAC/E;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;;;AC9IO,SAAS,mBAAmB,SAAuC;AACxE,QAAM,SAAS,QAAQ,OAAO,CAAC,MAAM,EAAE,KAAK,WAAW,SAAS,CAAC;AACjE,SAAO;AAAA,IACL,OAAO,OAAO,CAAC,MAAM,YAAY,IAAI,EAAE,SAAS,CAAC,EAAE,IAAI,CAAC,OAAO,EAAE,OAAO,EAAE,WAAW,MAAM,EAAE,KAAK,KAAK,EAAE;AAAA,IACzG,OAAO,KAAK,CAAC,MAAM,EAAE,cAAc,YAAY,GAAG,KAAK,QAAQ,CAAC;AAAA,EAClE;AACF;AAMO,SAAS,mBACd,OACA,KACA,SACa;AACb,QAAM,IAAI,MAAM,YAAY,UAAU,MAAM,MAAM,KAAK,OAAO,IAAI;AAClE,MAAI,CAAC,EAAG,QAAO,oBAAI,IAAI;AACvB,QAAM,SAAS,WAAW,CAAC;AAC3B,SAAO,IAAI,IAAI,gBAAgB,MAAM,IAAI,EAAE,OAAO,CAAC,MAAM,OAAO,CAAC,MAAM,MAAS,CAAC;AACnF;AAEA,IAAM,YAAY,CAAC,MAAc,KAAK,KAAK,KAAK;AAEzC,SAAS,cACd,SACA,SACA,YACU;AACV,QAAM,SAAmB,CAAC;AAE1B,aAAW,SAAS,SAAS;AAC3B,UAAM,EAAE,MAAM,WAAW,OAAO,KAAK,IAAI;AAGzC,QAAI,cAAc,cAAc;AAC9B,YAAM,OAAO,oBAAI,IAAyB;AAC1C,WAAK,KAAK,QAAQ,CAAC,KAAK,MAAM;AAC5B,cAAM,KAAK,GAAG,IAAI,IAAI,IAAI,CAAC;AAC3B,cAAM,SAAS,IAAI,WAAW;AAC9B,cAAM,IAAI,QAAQ,MAAM,IAAI,MAAM;AAClC,YAAI,UAAU,WAAW,OAAO,IAAI,MAAM,MAAM,CAAC,KAAK,CAAC,oBAAoB,IAAI,EAAE,KAAK,IAAI;AACxF,iBAAO,KAAK,GAAG,EAAE,cAAc,MAAM,4BAA4B,CAAC,GAAG,mBAAmB,EAAE,KAAK,IAAI,CAAC,GAAG;AAAA,QACzG;AACA,cAAM,MAAM,OAAO,IAAI,GAAG;AAC1B,YAAI,IAAI,QAAQ,UAAa,IAAI,QAAQ,IAAI;AAC3C,cAAI,CAAC,OAAO,UAAU,GAAG,KAAK,MAAM,GAAG;AACrC,mBAAO,KAAK,GAAG,EAAE,SAAS,IAAI,GAAG,6BAA6B;AAAA,UAChE,OAAO;AACL,kBAAM,OAAO,KAAK,IAAI,MAAM,KAAK,oBAAI,IAAY;AACjD,gBAAI,KAAK,IAAI,GAAG,EAAG,QAAO,KAAK,GAAG,EAAE,SAAS,GAAG,wBAAwB,MAAM,EAAE;AAChF,iBAAK,IAAI,GAAG;AACZ,iBAAK,IAAI,QAAQ,IAAI;AAAA,UACvB;AAAA,QACF;AACA,cAAM,KAAK,OAAO,IAAI,SAAS;AAC/B,YAAI,IAAI,cAAc,CAAC,OAAO,SAAS,EAAE,KAAK,MAAM,IAAI;AACtD,iBAAO,KAAK,GAAG,EAAE,eAAe,IAAI,SAAS,cAAc;AAAA,QAC7D;AACA,cAAM,IAAI,OAAO,IAAI,YAAY;AACjC,YAAI,IAAI,iBAAiB,CAAC,OAAO,SAAS,CAAC,KAAK,KAAK,IAAI;AACvD,iBAAO,KAAK,GAAG,EAAE,kBAAkB,IAAI,YAAY,2BAAwB;AAAA,QAC7E;AAAA,MACF,CAAC;AACD;AAAA,IACF;AAGA,QAAI,YAAY,IAAI,SAAS,GAAG;AAC9B,WAAK,KAAK,QAAQ,CAAC,KAAK,MAAM;AAC5B,cAAM,KAAK,GAAG,IAAI,IAAI,IAAI,CAAC;AAC3B,cAAM,IAAI,QAAQ,MAAM,IAAI,IAAI,MAAM,EAAE;AACxC,YAAI,KAAK,oBAAoB,IAAI,SAAS,GAAG;AAC3C,gBAAM,QAAQ,WAAW,CAAC;AAC1B,gBAAM,MAAM,OAAO,IAAI,SAAS;AAChC,cAAI,IAAI,aAAa,UAAU,UAAa,OAAO,SAAS,GAAG,KAAK,KAAK,IAAI,MAAM,KAAK,IAAI,MAAM;AAChG,mBAAO,KAAK,GAAG,EAAE,KAAK,IAAI,EAAE,cAAc,IAAI,SAAS,mCAAmC,KAAK,yCAAoC;AAAA,UACrI;AACA,cAAI,CAAC,IAAI,aAAa,UAAU,QAAW;AACzC,mBAAO,KAAK,GAAG,EAAE,KAAK,IAAI,EAAE,8CAA8C;AAAA,UAC5E;AAAA,QACF;AACA,mBAAW,KAAK,CAAC,QAAQ,IAAI,GAAG;AAC9B,gBAAM,IAAI,OAAO,IAAI,CAAC,CAAC;AACvB,cAAI,IAAI,CAAC,MAAM,CAAC,OAAO,SAAS,CAAC,KAAK,CAAC,UAAU,CAAC,GAAI,QAAO,KAAK,GAAG,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,CAAC,0BAA0B;AAAA,QACnH;AACA,cAAM,IAAI,OAAO,IAAI,OAAO;AAC5B,YAAI,IAAI,YAAY,CAAC,OAAO,SAAS,CAAC,KAAK,KAAK,GAAI,QAAO,KAAK,GAAG,EAAE,aAAa,IAAI,OAAO,+BAAyB;AAAA,MACxH,CAAC;AACD;AAAA,IACF;AAGA,QAAI,CAAC,MAAM,aAAa,CAAC,KAAK,QAAQ,SAAS,SAAS,EAAG;AAC3D,UAAM,SAAS,gBAAgB,SAAS;AACxC,UAAM,aAAa,MAAM,UAAU,OAAO,CAAC,MAAM,EAAE,SAAS,UAAU,EAAE,UAAU,OAAO,SAAS,EAAE,IAAI,CAAC;AACzG,SAAK,KAAK,QAAQ,CAAC,KAAK,MAAM;AAC5B,YAAM,SAAS,IAAI;AACnB,UAAI,CAAC,OAAQ;AACb,YAAM,KAAK,GAAG,IAAI,IAAI,IAAI,CAAC;AAC3B,YAAM,SAAS,WAAW,OAAO,IAAI,MAAM;AAC3C,UAAI,UAAU,OAAO,UAAU,MAAM,WAAW;AAC9C,eAAO,KAAK,GAAG,EAAE,cAAc,MAAM,UAAU,OAAO,KAAK,KAAK,SAAS,YAAY,MAAM,SAAS,EAAE;AACtG;AAAA,MACF;AACA,YAAM,IAAI,UAAU,WAAW,KAAK,OAAO;AAC3C,UAAI,CAAC,EAAG;AACR,YAAM,SAAS,WAAW,CAAC;AAC3B,iBAAW,KAAK,YAAY;AAC1B,aAAK,IAAI,EAAE,IAAI,KAAK,QAAQ,GAAI;AAChC,cAAM,IAAI,OAAO,EAAE,IAAI;AACvB,YAAI,MAAM,UAAa,CAAC,EAAE,OAAQ,SAAS,CAAC,GAAG;AAC7C,iBAAO,KAAK,GAAG,EAAE,UAAU,MAAM,UAAU,EAAE,IAAI,KAAK,CAAC,YAAY,SAAS,qBAAqB,EAAE,OAAQ,KAAK,IAAI,CAAC,GAAG;AAAA,QAC1H;AAAA,MACF;AAAA,IACF,CAAC;AAAA,EACH;AAEA,SAAO;AACT;;;AC1IO,SAAS,sBAAsB,MAAc,MAAyB;AAC3E,QAAM,SAAmB,CAAC;AAC1B,WAAS,IAAI,GAAG,IAAI,KAAK,KAAK,QAAQ,KAAK;AACzC,UAAM,MAAM,KAAK,KAAK,CAAC;AACvB,UAAM,MAAM,mBAAmB,IAAI,MAAM;AACzC,UAAM,UAAU,IAAI,WAAW;AAC/B,QAAI,CAAC,OAAO,YAAY,GAAI;AAC5B,UAAMC,OAAM,WAAW,GAAG;AAC1B,QAAI,CAACA,KAAI,SAAS,OAAO,GAAG;AAC1B,aAAO;AAAA,QACLA,KAAI,SAAS,IACT,GAAG,IAAI,IAAI,IAAI,CAAC,cAAc,OAAO,iCAAiC,IAAI,EAAE,MAAMA,KAAI,KAAK,IAAI,CAAC,MAChG,GAAG,IAAI,IAAI,IAAI,CAAC,aAAa,IAAI,EAAE;AAAA,MACzC;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;;;ACZO,IAAM,cAAwD;AAAA,EACnE,IAAI,EAAE,GAAG,MAAM,GAAG,IAAI;AAAA,EAAG,IAAI,EAAE,GAAG,KAAK,GAAG,IAAI;AAAA,EAAG,IAAI,EAAE,GAAG,KAAK,GAAG,IAAI;AAAA,EAAG,IAAI,EAAE,GAAG,KAAK,GAAG,IAAI;AAAA,EAAG,IAAI,EAAE,GAAG,KAAK,GAAG,IAAI;AACxH;AAEO,SAAS,eAAe,QAAwB,WAA2B,UAAgC;AAChH,QAAM,SAAmB,CAAC;AAC1B,QAAM,UAAU,oBAAI,IAAsC;AAC1D,MAAI,QAAQ;AACV,UAAM,UAAU,oBAAI,IAAoB;AACxC,WAAO,KAAK,QAAQ,CAAC,KAAK,MAAM;AAC9B,YAAM,KAAK,oBAAoB,IAAI,CAAC;AACpC,cAAQ,IAAI,IAAI,IAAI,YAAY,IAAI,SAAS,IAAI,KAAK,YAAY,EAAE;AACpE,iBAAW,KAAK,CAAC,iBAAiB,YAAY,GAAG;AAC/C,cAAM,IAAI,IAAI,CAAC,KAAK;AACpB,YAAI,KAAK,CAAC,sBAAsB,KAAK,CAAC,EAAG,QAAO,KAAK,GAAG,EAAE,KAAK,CAAC,KAAK,CAAC,4BAA4B;AAAA,MACpG;AACA,YAAM,KAAK,IAAI,UAAU,IAAI,KAAK;AAClC,UAAI,CAAC,EAAG;AACR,YAAM,OAAO,QAAQ,IAAI,CAAC;AAC1B,UAAI,KAAM,QAAO,KAAK,GAAG,EAAE,mBAAmB,CAAC,6BAA6B,IAAI,EAAE;AAAA,UAC7E,SAAQ,IAAI,GAAG,IAAI,CAAC;AAAA,IAC3B,CAAC;AAAA,EACH;AACA,MAAI,CAAC,UAAW,QAAO;AACvB,YAAU,KAAK,QAAQ,CAAC,KAAK,MAAM;AACjC,UAAM,KAAK,6BAA6B,IAAI,CAAC;AAC7C,UAAM,OAAO,IAAI;AACjB,UAAM,UAAU,IAAI,WAAW,IAAI,KAAK;AACxC,QAAI,SAAS,UAAU,CAAC,IAAI,SAAU,QAAO,KAAK,GAAG,EAAE,kCAAkC;AACzF,QAAI,SAAS,WAAW;AACtB,UAAI,CAAC,OAAQ,QAAO,KAAK,GAAG,EAAE,mEAAmE;AAAA,eACxF,SAAS,OAAO,IAAI,MAAM,GAAG,UAAU,OAAQ,QAAO,KAAK,GAAG,EAAE,cAAc,MAAM,uCAAuC;AAAA,IACtI;AACA,QAAI,SAAS,eAAe,CAAC,mBAAmB,SAAS,MAAM,GAAG;AAChE,aAAO,KAAK,GAAG,EAAE,kEAAkE;AAAA,IACrF;AACA,QAAI,SAAS,cAAc,CAAC,IAAI,SAAU,QAAO,KAAK,GAAG,EAAE,sCAAsC;AACjG,UAAM,QAAQ,IAAI,SAAS;AAC3B,QAAI,UAAU,MAAM,EAAE,OAAO,UAAU,OAAO,KAAK,CAAC,KAAK,OAAO,KAAK,IAAI,IAAI;AAC3E,aAAO,KAAK,GAAG,EAAE,YAAY,KAAK,iDAAiD;AAAA,IACrF;AACA,eAAW,KAAK,CAAC,KAAK,GAAG,GAAG;AAC1B,YAAM,IAAI,IAAI,CAAC;AACf,UAAI,MAAM,UAAa,MAAM,MAAM,CAAC,OAAO,SAAS,OAAO,CAAC,CAAC,EAAG,QAAO,KAAK,GAAG,EAAE,KAAK,CAAC,KAAK,CAAC,mBAAmB;AAAA,IAClH;AACA,UAAM,QAAQ,QAAQ,IAAI,IAAI,QAAQ;AACtC,UAAM,IAAI,OAAO,IAAI,CAAC,GAAG,IAAI,OAAO,IAAI,CAAC;AACzC,QAAI,SAAS,IAAI,MAAM,MAAM,IAAI,MAAM,MAAM,OAAO,SAAS,CAAC,KAAK,OAAO,SAAS,CAAC,MAAM,IAAI,KAAK,IAAI,KAAK,IAAI,MAAM,KAAK,IAAI,MAAM,IAAI;AACvI,aAAO,KAAK,GAAG,EAAE,aAAa,CAAC,KAAK,CAAC,mBAAmB,MAAM,CAAC,OAAI,MAAM,CAAC,WAAW;AAAA,IACvF;AAAA,EACF,CAAC;AACD,SAAO;AACT;;;AChDA,IAAM,UAAU,CAAC,KAAK,KAAK,UAAU;AAE9B,SAAS,eAAe,SAA2B,UAAgC;AACxF,QAAM,SAAmB,CAAC;AAE1B,QAAM,UAAU,oBAAI,IAAoB;AACxC,aAAW,KAAK,SAAS;AACvB,QAAI,EAAE,cAAc,iBAAiB,CAAC,EAAE,KAAK,QAAQ,SAAS,UAAU,EAAG;AAC3E,UAAM,QAAQ,EAAE,KAAK,MAAM,GAAG,EAAE,CAAC;AACjC,MAAE,KAAK,KAAK,QAAQ,CAAC,KAAK,MAAM;AAC9B,YAAM,OAAO,IAAI,YAAY,IAAI,KAAK;AACtC,UAAI,CAAC,IAAK;AACV,UAAI,UAAU,UAAU;AACtB,eAAO,KAAK,GAAG,EAAE,IAAI,IAAI,IAAI,CAAC,eAAe,GAAG,uEAAuE;AACvH;AAAA,MACF;AACA,YAAM,IAAI,SAAS,IAAI,IAAI,GAAG,KAAK,IAAI,GAAG,EAAE;AAC5C,UAAI,SAAS,OAAO,IAAI,GAAG,MAAM,CAAC,KAAK,EAAE,UAAU,gBAAgB;AACjE,eAAO,KAAK,GAAG,EAAE,IAAI,IAAI,IAAI,CAAC,eAAe,GAAG,6BAA6B,KAAK,EAAE;AACpF;AAAA,MACF;AACA,cAAQ,IAAI,GAAG,KAAK,IAAI,GAAG,KAAK,QAAQ,IAAI,GAAG,KAAK,IAAI,GAAG,EAAE,KAAK,KAAK,CAAC;AAAA,IAC1E,CAAC;AAAA,EACH;AACA,aAAW,KAAK,SAAS;AACvB,QAAI,EAAE,cAAc,cAAe;AACnC,UAAM,QAAQ,EAAE,KAAK,MAAM,GAAG,EAAE,CAAC;AACjC,MAAE,KAAK,KAAK,QAAQ,CAAC,KAAK,MAAM;AAC9B,YAAM,KAAK,GAAG,EAAE,IAAI,IAAI,IAAI,CAAC;AAC7B,iBAAW,KAAK,SAAS;AACvB,cAAM,IAAI,IAAI,CAAC;AACf,YAAI,MAAM,UAAa,MAAM,MAAM,CAAC,OAAO,SAAS,OAAO,CAAC,CAAC,EAAG,QAAO,KAAK,GAAG,EAAE,KAAK,CAAC,KAAK,CAAC,mBAAmB;AAAA,MAClH;AACA,UAAI,IAAI,MAAM,CAAC,QAAQ,IAAI,GAAG,KAAK,IAAI,IAAI,EAAE,EAAE,EAAG,QAAO,KAAK,GAAG,EAAE,kBAAkB,IAAI,EAAE,6CAA6C,IAAI,EAAE,GAAG;AAAA,IACnJ,CAAC;AAAA,EACH;AACA,SAAO;AACT;AAOO,SAAS,cAAc,SAAqC;AAEjE,QAAM,SAAS,oBAAI,IAAoB;AACvC,aAAW,KAAK,SAAS;AACvB,QAAI,EAAE,cAAc,cAAe;AACnC,UAAM,QAAQ,EAAE,KAAK,MAAM,GAAG,EAAE,CAAC;AACjC,eAAW,OAAO,EAAE,KAAK,KAAM,KAAI,IAAI,GAAI,QAAO,IAAI,GAAG,KAAK,IAAI,IAAI,EAAE,IAAI,IAAI,QAAQ,EAAE;AAAA,EAC5F;AACA,MAAI,OAAO,SAAS,EAAG,QAAO,CAAC;AAE/B,QAAM,SAAS,oBAAI,IAAiC;AACpD,aAAWC,QAAO,OAAO,KAAK,EAAG,QAAO,IAAIA,MAAK,oBAAI,IAAI,CAAC;AAC1D,aAAW,KAAK,SAAS;AACvB,QAAI,EAAE,cAAc,iBAAiB,CAAC,EAAE,KAAK,QAAQ,SAAS,UAAU,EAAG;AAC3E,UAAM,QAAQ,EAAE,KAAK,MAAM,GAAG,EAAE,CAAC;AACjC,eAAW,OAAO,EAAE,KAAK,MAAM;AAC7B,YAAM,IAAI,OAAO,IAAI,GAAG,KAAK,KAAK,IAAI,YAAY,IAAI,KAAK,CAAC,EAAE;AAC9D,UAAI,EAAG,GAAE,IAAI,EAAE,YAAY,EAAE,IAAI,EAAE,SAAS,KAAK,KAAK,CAAC;AAAA,IACzD;AAAA,EACF;AACA,QAAM,YAAY,CAAC,MAA2B,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,IAAI;AAClI,QAAM,SAAS,oBAAI,IAA4C;AAC/D,aAAW,CAACA,MAAK,IAAI,KAAK,QAAQ;AAChC,UAAM,OAAO,OAAO,IAAI,IAAI,KAAK,CAAC;AAClC,SAAK,KAAK,EAAE,KAAAA,MAAK,KAAK,UAAU,OAAO,IAAIA,IAAG,CAAE,EAAE,CAAC;AACnD,WAAO,IAAI,MAAM,IAAI;AAAA,EACvB;AACA,QAAM,WAAqB,CAAC;AAC5B,aAAW,CAAC,MAAM,IAAI,KAAK,QAAQ;AACjC,UAAM,QAAQ,KAAK,CAAC;AACpB,eAAW,SAAS,KAAK,MAAM,CAAC,GAAG;AACjC,UAAI,MAAM,QAAQ,MAAM,KAAK;AAC3B,iBAAS,KAAK,gBAAgB,IAAI,MAAM,MAAM,GAAG,KAAK,MAAM,OAAO,OAAO,kBAAkB,MAAM,GAAG,KAAK,MAAM,OAAO,OAAO,GAAG;AAAA,MACnI;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;;;AC5FA,SAAS,cAAAC,mBAAkB;AAC3B,SAAS,QAAAC,aAAY;AAQrB,IAAM,iBAAiB,oBAAI,IAAI,CAAC,QAAQ,QAAQ,gBAAgB,CAAC;AAEjE,IAAM,UAAU,oBAAI,IAAI,CAAC,QAAQ,kBAAkB,QAAQ,SAAS,CAAC;AACrE,IAAM,WAAW,oBAAI,IAAI,CAAC,QAAQ,kBAAkB,gBAAgB,gBAAgB,CAAC;AAGrF,SAAS,SAAS,SAAiB,MAA2C;AAC5E,QAAM,MAAM,oBAAI,IAA4B;AAC5C,QAAM,IAAIC,MAAK,SAAS,GAAG,IAAI,UAAU;AACzC,MAAI,CAACC,YAAW,CAAC,EAAG,QAAO;AAC3B,MAAI;AACF,eAAW,KAAK,iBAAiB,CAAC,EAAE,SAAU,KAAI,IAAI,OAAO,EAAE,YAAY,MAAM,EAAE,GAAG,CAAC;AAAA,EACzF,QAAQ;AAAA,EAA0C;AAClD,SAAO;AACT;AAGA,SAAS,WAAW,GAA8C;AAChE,MAAI,CAAC,KAAK,EAAE,SAAS,SAAS,UAAW,QAAO;AAChD,QAAM,OAAO,EAAE,SAAS,YAAY,CAAC,KAAK,CAAC;AAC3C,QAAM,IAAI,KAAK;AACf,MAAI,KAAK,KAAK,KAAK,CAAC,EAAE,CAAC,MAAM,KAAK,IAAI,CAAC,EAAE,CAAC,KAAK,KAAK,CAAC,EAAE,CAAC,MAAM,KAAK,IAAI,CAAC,EAAE,CAAC,EAAG,QAAO,IAAI;AACzF,SAAO;AACT;AAEO,SAAS,iBACd,KACA,SACAC,MACA,gBACU;AACV,QAAM,SAAmB,CAAC;AAC1B,aAAW,KAAK,SAAS;AACvB,UAAM,WAAW,EAAE,KAAK,MAAM,GAAG,EAAE,CAAC;AACpC,UAAM,KAAK,CAAC,MAAc,GAAG,EAAE,IAAI,IAAI,IAAI,CAAC;AAC5C,QAAI,EAAE,cAAc,QAAQ;AAC1B,YAAM,MAAM,SAASF,MAAK,KAAK,QAAQ,GAAG,MAAM;AAChD,QAAE,KAAK,KAAK,QAAQ,CAAC,KAAK,MAAM;AAC9B,cAAM,UAAU,IAAI,eAAe,IAAI,KAAK;AAC5C,YAAI,QAAQ;AACV,gBAAM,OAAO,OAAO,MAAM,GAAG,EAAE,IAAI,OAAK,OAAO,EAAE,KAAK,CAAC,CAAC;AACxD,cAAI,KAAK,KAAK,OAAK,CAAC,OAAO,SAAS,CAAC,KAAK,IAAI,KAAK,KAAK,EAAE,GAAG;AAC3D,mBAAO,KAAK,GAAG,GAAG,CAAC,CAAC,kBAAkB,MAAM,uEAAkE;AAAA,UAChH;AACA,gBAAM,IAAI,WAAW,IAAI,IAAI,IAAI,EAAE,CAAC;AACpC,cAAI,MAAM,QAAQ,KAAK,WAAW,GAAG;AACnC,mBAAO,KAAK,GAAG,GAAG,CAAC,CAAC,qBAAqB,KAAK,MAAM,oCAAoC,CAAC,oDAAoD;AAAA,UAC/I;AAAA,QACF;AACA,YAAI,IAAI,cAAc,aAAa;AACjC,gBAAM,OAAO,IAAI,WAAW,IAAI,MAAM,GAAG,EAAE,OAAO,OAAK,EAAE,KAAK,CAAC,EAAE,IAAI,OAAK,EAAE,MAAM,GAAG,EAAE,IAAI,OAAK,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC;AACjH,cAAI,IAAI,SAAS,KAAK,IAAI,KAAK,OAAK,EAAE,WAAW,KAAK,CAAC,EAAE,MAAM,OAAO,QAAQ,CAAC,GAAG;AAChF,mBAAO,KAAK,GAAG,GAAG,CAAC,CAAC,uEAAuE;AAAA,UAC7F;AAAA,QACF;AAAA,MACF,CAAC;AAAA,IACH;AACA,QAAI,EAAE,cAAc,UAAU,EAAE,cAAc,kBAAkB;AAC9D,QAAE,KAAK,KAAK,QAAQ,CAAC,KAAK,MAAM;AAC9B,cAAM,SAAS,IAAI;AACnB,YAAI,CAAC,OAAQ;AACb,cAAM,IAAIE,KAAI,OAAO,IAAI,MAAM;AAC/B,YAAI,KAAK,CAAC,eAAe,IAAI,EAAE,KAAK,GAAG;AACrC,iBAAO,KAAK,GAAG,GAAG,CAAC,CAAC,oBAAoB,MAAM,UAAU,EAAE,KAAK,yDAAyD;AAAA,QAC1H;AAAA,MACF,CAAC;AAAA,IACH;AACA,QAAI,EAAE,cAAc,UAAU,EAAE,cAAc,kBAAkB;AAE9D,QAAE,KAAK,KAAK,QAAQ,CAAC,KAAK,MAAM;AAC9B,cAAM,IAAI,gBAAgB,IAAI,WAAW;AACzC,YAAI,OAAO,MAAM,SAAU,QAAO,KAAK,GAAG,GAAG,CAAC,CAAC,kBAAkB,IAAI,WAAW,KAAK,CAAC,EAAE;AAAA,MAC1F,CAAC;AAAA,IACH;AACA,QAAI,QAAQ,IAAI,EAAE,SAAS,GAAG;AAE5B,QAAE,KAAK,KAAK,QAAQ,CAAC,KAAK,MAAM;AAC9B,mBAAW,OAAO,IAAI,kBAAkB,IAAI,MAAM,GAAG,EAAE,IAAI,OAAK,EAAE,KAAK,CAAC,EAAE,OAAO,OAAO,GAAG;AACzF,gBAAM,IAAIA,KAAI,IAAI,IAAI,GAAG,QAAQ,IAAI,EAAE,EAAE,KAAKA,KAAI,IAAI,IAAI,UAAU,EAAE,EAAE;AACxE,cAAI,CAAC,EAAG,QAAO,KAAK,GAAG,GAAG,CAAC,CAAC,sBAAsB,EAAE,sBAAsB,QAAQ,gBAAgB;AAAA,mBACzF,CAAC,SAAS,IAAI,EAAE,KAAK,EAAG,QAAO,KAAK,GAAG,GAAG,CAAC,CAAC,sBAAsB,EAAE,UAAU,EAAE,KAAK,gDAAgD;AAAA,QAChJ;AAAA,MACF,CAAC;AAAA,IACH;AACA,QAAI,EAAE,cAAc,WAAW;AAC7B,YAAM,MAAM,SAASF,MAAK,KAAK,QAAQ,GAAG,SAAS;AACnD,QAAE,KAAK,KAAK,QAAQ,CAAC,KAAK,MAAM;AAC9B,YAAI,IAAI,cAAc;AACpB,cAAI,IAAI,IAAI,IAAI,EAAE,GAAG,SAAS,SAAS,WAAW;AAChD,mBAAO,KAAK,GAAG,GAAG,CAAC,CAAC,iEAAiE;AAAA,UACvF;AACA,gBAAM,OAAO,eAAe,IAAI,QAAQ,GAAG,MAAM,eAAe,IAAI,IAAI,YAAY;AACpF,gBAAM,MAAM,CAAC,MAA0B,OAAO,KAAK,CAAC,KAAK;AACzD,cAAI,SAAS,UAAa,QAAQ,UAAa,MAAM,IAAI,IAAI,UAAU,KAAK,OAAO,IAAI,IAAI,WAAW,GAAG;AACvG,mBAAO,KAAK,GAAG,GAAG,CAAC,CAAC,gBAAgB,IAAI,YAAY,gCAAgC;AAAA,UACtF;AAAA,QACF,WAAW,CAAC,IAAI,SAAS;AACvB,iBAAO,KAAK,GAAG,GAAG,CAAC,CAAC,+FAA+F;AAAA,QACrH;AAAA,MACF,CAAC;AAAA,IACH;AAAA,EACF;AACA,SAAO;AACT;;;AC/GA,SAAS,cAAAG,mBAAkB;AAC3B,SAAS,QAAAC,aAAY;AASrB,IAAM,cAAc,CAAC,WAAW,SAAS;AAGlC,SAAS,uBAAuB,MAAc,MAAyB;AAC5E,QAAM,SAAmB,CAAC;AAC1B,OAAK,KAAK,QAAQ,CAAC,KAAK,MAAM;AAC5B,UAAM,KAAK,GAAG,IAAI,IAAI,IAAI,CAAC;AAC3B,eAAW,KAAK,aAAa;AAC3B,YAAM,EAAE,KAAAC,KAAI,IAAI,gBAAgB,IAAI,CAAC,CAAC;AACtC,UAAIA,KAAI,SAAS,EAAG,QAAO,KAAK,GAAG,EAAE,KAAK,CAAC,KAAK,IAAI,CAAC,CAAC,8DAA8DA,KAAI,KAAK,IAAI,CAAC,EAAE;AAAA,IACtI;AACA,UAAM,EAAE,OAAO,IAAI,IAAI,YAAY,IAAI,MAAM;AAC7C,QAAI,IAAI,SAAS,EAAG,QAAO,KAAK,GAAG,EAAE,cAAc,IAAI,KAAK,IAAI,CAAC,mDAAmD;AACpH,UAAM,QAAQ,CAAC,GAAG,IAAI,IAAI,MAAM,IAAI,CAAC,MAAM,EAAE,IAAI,EAAE,OAAO,CAAC,MAAM,CAAE,YAAkC,SAAS,CAAC,CAAC,CAAC,CAAC;AAClH,QAAI,MAAM,SAAS,EAAG,QAAO,KAAK,GAAG,EAAE,0BAA0B,MAAM,KAAK,IAAI,CAAC,SAAS,YAAY,KAAK,IAAI,CAAC,GAAG;AAAA,EACrH,CAAC;AACD,SAAO;AACT;AAGO,SAAS,oBAAoB,KAAuB;AACzD,QAAM,WAAqB,CAAC;AAC5B,QAAM,SAAS,eAAe,GAAG;AACjC,QAAM,aAAa,oBAAI,IAAoB;AAC3C,QAAM,WAAWC,MAAK,OAAO,WAAW,WAAW;AACnD,MAAIC,YAAW,QAAQ,GAAG;AACxB,eAAW,KAAK,QAAQ,QAAQ,EAAE,MAAM;AACtC,YAAM,IAAI,WAAW,EAAE,aAAa,EAAE;AACtC,UAAI,EAAE,MAAM,OAAO,SAAS,CAAC,EAAG,YAAW,IAAI,EAAE,IAAI,CAAC;AAAA,IACxD;AAAA,EACF;AAEA,aAAW,KAAK,OAAO,WAAW;AAChC,UAAM,UAAUD,MAAK,EAAE,MAAM,kBAAkB;AAC/C,UAAM,UAAUA,MAAK,EAAE,MAAM,GAAG,mBAAmB,YAAY,UAAU;AACzE,QAAI,CAACC,YAAW,OAAO,KAAK,CAACA,YAAW,OAAO,EAAG;AAClD,UAAM,QAAQ,oBAAI,IAAuE;AACzF,QAAI;AACF,iBAAW,KAAK,iBAAiB,OAAO,EAAE,UAAU;AAClD,YAAI,EAAE,SAAS,SAAS,aAAc;AACtC,cAAM,MAAM,CAAC,MAAgB,OAAO,MAAM,WAAW,IAAI,WAAW,OAAO,KAAK,EAAE,CAAC,KAAK;AACxF,cAAM,IAAI,OAAO,EAAE,WAAW,MAAM,EAAE,GAAG;AAAA,UACvC,QAAQ,oBAAoB,CAAC,EAAE;AAAA,UAC/B,YAAY,IAAI,EAAE,WAAW,WAAW;AAAA,UACxC,WAAW,IAAI,EAAE,WAAW,UAAU;AAAA,QACxC,CAAC;AAAA,MACH;AAAA,IACF,QAAQ;AAAE;AAAA,IAAU;AAEpB,UAAM,OAAO,cAAc,KAAK,gBAAgB,QAAQ,OAAO,EAAE,IAAI;AACrE,SAAK,QAAQ,CAAC,KAAK,MAAM;AACvB,YAAM,IAAI,MAAM,IAAI,IAAI,MAAM,EAAE;AAChC,UAAI,CAAC,EAAG;AACR,YAAM,KAAK,UAAU,EAAE,IAAI,qBAAqB,IAAI,CAAC;AACrD,YAAM,SAAS,WAAW,IAAI,EAAE,IAAI;AACpC,YAAM,QAAQ,IAAI,eAAe,WAAW,IAAI,IAAI,YAAY,IAAI;AACpE,YAAM,SAAS,WAAW,UAAa,UAAU,SAAY,QAAQ,EAAE,aAAa,SAAS,EAAE,cAAc;AAE7G,YAAM,UAAU,CAAC,OAAe,QAA4B,SAAiB;AAC3E,YAAI,WAAW,OAAW;AAC1B,cAAM,MAAM,gBAAgB,IAAI,KAAK,CAAC,EAAE,OAAO,OAAO,CAAC,MAAM,KAAK,KAAK,KAAK,MAAM;AAClF,YAAI,IAAI,SAAS,EAAG,UAAS,KAAK,GAAG,EAAE,KAAK,KAAK,IAAI,IAAI,KAAK,IAAI,CAAC,qBAAqB,IAAI,IAAI,CAAC,OAAO,QAAQ,CAAC,CAAC,YAAY;AAAA,MAChI;AACA,cAAQ,WAAW,EAAE,QAAQ,QAAQ;AACrC,cAAQ,WAAW,QAAQ,QAAQ;AAEnC,YAAM,EAAE,MAAM,IAAI,YAAY,IAAI,MAAM;AACxC,UAAI,MAAM,WAAW,EAAG;AACxB,YAAM,OAAO,UAAU,IAAI,SAAS,IAAI,cAAc,IAAI,WAAW,EAAE,MAAM,EAAE,SAAS;AAExF,YAAM,eAAe,IAAI,WAAW,IAAI,KAAK,MAAM,OAAO,IAAI,gBAAgB,IAAI,KAAK,MAAM,MAAM,WAAW,IAAI,aAAa,EAAE,IAAI;AACrI,YAAM,QAAQ,WAAW,UAAa,CAAC,cACnC,UAAU,IAAI,SAAS,IAAI,cAAc,IAAI,WAAW,UAAU,OAAO,SAAS,EAAE,SAAS,IAC7F;AACJ,iBAAW,KAAK,OAAO;AACrB,YAAK,EAAE,QAAQ,OAAO,EAAE,OAAO,QAAU,EAAE,QAAQ,OAAO,EAAE,OAAO,OAAQ;AACzE,mBAAS,KAAK,GAAG,EAAE,YAAY,EAAE,GAAG,IAAI,EAAE,GAAG,IAAI,EAAE,IAAI,mBAAmB,IAAI,MAAM,KAAK,iBAAiB;AAAA,QAC5G,YAAY,EAAE,SAAS,UAAU,EAAE,SAAS,kBAAkB,EAAE,QAAQ,GAAG;AACzE,mBAAS,KAAK,GAAG,EAAE,YAAY,EAAE,GAAG,IAAI,EAAE,GAAG,IAAI,EAAE,IAAI,0CAA0C;AAAA,QACnG;AAAA,MACF;AAEA,YAAM,SAAS,IAAI,gBAAgB,IAAI,MAAM,GAAG,EAAE,OAAO,OAAK,EAAE,KAAK,CAAC;AACtE,UAAI,MAAM,SAAS,KAAK,OAAO,SAAS,KAAK,GAAG;AAC9C,cAAM,QAAQ,UAAU,OAAO,MAAM,KAAK;AAC1C,cAAM,QAAQ,MAAM,KAAK,EAAE,OAAO,OAAK,MAAM,UAAU,MAAM,aAAa,EAAE;AAC5E,YAAI,MAAM,SAAS,MAAO,UAAS,KAAK,GAAG,EAAE,wBAAwB,MAAM,MAAM,cAAc,KAAK,sCAAsC;AAAA,MAC5I;AAAA,IACF,CAAC;AAAA,EACH;AACA,SAAO;AACT;;;ACrGA,SAAS,QAAAC,aAAY;AACrB,SAAS,cAAAC,mBAAkB;AAY3B,IAAM,KAAK,CAAC,MAAc,GAAG,KAAK,MAAM,IAAI,GAAI,CAAC;AAE1C,SAAS,eAAe,KAA4B;AACzD,QAAM,SAAmB,CAAC;AAC1B,QAAM,WAAqB,CAAC;AAC5B,QAAM,MAAM,IAAI,UAAU,aAAa,GAAG,CAAC;AAC3C,QAAM,SAAS,eAAe,GAAG;AACjC,QAAM,aAAa,oBAAI,IAAoB;AAC3C,QAAM,WAAWC,MAAK,OAAO,WAAW,WAAW;AACnD,MAAIC,YAAW,QAAQ,GAAG;AACxB,QAAI;AAAE,iBAAW,KAAK,QAAQ,QAAQ,EAAE,KAAM,YAAW,IAAI,EAAE,IAAI,WAAW,EAAE,SAAS,KAAK,CAAC;AAAA,IAAG,QAAQ;AAAA,IAA2B;AAAA,EACvI;AACA,QAAM,IAAI;AACV,aAAW,KAAK,WAAW,GAAG,GAAG;AAC/B,eAAW,KAAK,EAAE,SAAS;AACzB,UAAI,EAAE,OAAQ,QAAO,KAAK,GAAG,EAAE,GAAG,IAAI,EAAE,KAAK,QAAQ,EAAE,IAAI,cAAc,EAAE,MAAM,kBAAkB;AAAA,IACrG;AACA,eAAW,KAAK,EAAE,QAAQ;AACxB,YAAM,KAAK,GAAG,EAAE,GAAG,cAAc,EAAE,IAAI,KAAK,EAAE,EAAE;AAChD,YAAM,MAAM,EAAE,IAAI;AAClB,UAAI,OAAO,WAAW,IAAI,GAAG,KAAK,EAAE,QAAQ,YAAa,WAAW,IAAI,GAAG,MAAO,WAAW,IAAI,EAAE,GAAG,KAAK,KAAK,MAAO;AACrH,eAAO,KAAK,GAAG,EAAE,8BAA8B,GAAG,gDAAgD;AAAA,MACpG;AACA,YAAM,OAAO,UAAU,EAAE,KAAK,KAAK,EAAE,KAAK,IAAI,OAAK,EAAE,KAAK,CAAC;AAC3D,UAAI,CAAC,KAAM;AACX,iBAAW,KAAK,KAAK,QAAQ;AAC3B,YAAI,EAAE,GAAI;AACV,gBAAQ,EAAE,KAAK;AAAA,UACb,KAAK;AAAS,qBAAS,KAAK,GAAG,EAAE,WAAW,GAAG,EAAE,KAAK,CAAC,YAAY,GAAG,EAAE,QAAQ,CAAC,SAAI,GAAG,EAAE,QAAQ,CAAC,KAAK,KAAK,MAAM,gBAAgB,GAAG,KAAK,IAAI,CAAC,GAAG,EAAE,KAAK,SAAS,IAAI,KAAK,EAAE,KAAK,MAAM,aAAa,EAAE,GAAG;AAAG;AAAA,UAC9M,KAAK;AAAS,qBAAS,KAAK,GAAG,EAAE,WAAW,GAAG,EAAE,KAAK,CAAC,UAAU,GAAG,EAAE,QAAQ,CAAC,GAAG,EAAE,SAAS,EAAE,UAAU,EAAE,KAAK,SAAS,EAAE,KAAK,MAAM,EAAE,EAAE;AAAG;AAAA,UAC7I,KAAK;AAAW,qBAAS,KAAK,GAAG,EAAE,UAAU,GAAG,EAAE,KAAK,CAAC,YAAY,GAAG,EAAE,UAAU,CAAC,SAAI,GAAG,EAAE,UAAU,CAAC,EAAE;AAAG;AAAA,UAC7G,KAAK;AAAS,qBAAS,KAAK,GAAG,EAAE,WAAW,GAAG,EAAE,KAAK,CAAC,UAAU,GAAG,EAAE,QAAQ,CAAC,GAAG,EAAE,SAAS,EAAE,UAAU,EAAE,KAAK,SAAS,EAAE,KAAK,MAAM,EAAE,EAAE;AAAG;AAAA,UAC7I,KAAK;AAAW,qBAAS,KAAK,GAAG,EAAE,aAAa,EAAE,KAAK,WAAW,GAAG,EAAE,KAAK,CAAC,6BAA6B;AAAG;AAAA,QAC/G;AAAA,MACF;AAAA,IACF;AACA,eAAW,KAAK,EAAE,UAAU;AAC1B,YAAM,KAAK,GAAG,EAAE,GAAG,gBAAgB,EAAE,IAAI,KAAK,EAAE,EAAE;AAClD,UAAI,EAAE,SAAS,UAAW,QAAO,KAAK,GAAG,EAAE,cAAc,EAAE,IAAI,OAAO,6BAA6B;AACnG,UAAI,EAAE,SAAS,WAAW,EAAE,IAAI,SAAS,UAAU,EAAE,IAAI,SAAS,SAAS;AACzE,eAAO,KAAK,GAAG,EAAE,kDAAkD;AAAA,MACrE;AACA,UAAI,EAAE,SAAS,WAAW,EAAE,MAAM,WAAW,KAAK,EAAE,SAAS,WAAW;AACtE,iBAAS,KAAK,GAAG,EAAE,gGAAgG;AAAA,MACrH;AAAA,IACF;AAAA,EACF;AACA,SAAO,EAAE,QAAQ,SAAS;AAC5B;;;AdpCO,SAAS,SAAS,KAAuB;AAC9C,QAAM,SAAmB,CAAC;AAG1B,SAAO,KAAK,GAAG,kBAAkB,GAAG,CAAC;AAErC,QAAM,WAAW,cAAc,WAAW,CAAC;AAC3C,QAAM,SAAS,eAAe,GAAG;AAGjC,QAAM,aAAyB,CAAC;AAChC,QAAM,UAAU;AAAA,IACd,EAAE,MAAM,UAAU,MAAM,OAAO,UAAU;AAAA,IACzC,GAAG,OAAO;AAAA,EACZ;AAEA,aAAW,KAAK,SAAS;AACvB,QAAI,CAACC,YAAW,EAAE,IAAI,EAAG;AACzB,UAAM,QAAQ,UAAU,EAAE,IAAI;AAC9B,eAAW,KAAK,OAAO;AACrB,UAAI,CAAC,EAAE,SAAS,MAAM,EAAG;AACzB,YAAM,YAAY,EAAE,QAAQ,QAAQ,EAAE;AACtC,YAAM,QAAQ,SAAS,IAAI,SAAS;AACpC,UAAI,CAAC,MAAO;AAEZ,YAAM,WAAWC,MAAK,EAAE,MAAM,CAAC;AAC/B,YAAM,UAAU,GAAG,EAAE,IAAI,IAAI,CAAC;AAE9B,UAAI;AACJ,UAAI;AACF,eAAO,QAAQ,QAAQ;AAAA,MACzB,SAAS,GAAG;AACV,eAAO,KAAK,GAAG,OAAO,yBAA0B,EAAY,OAAO,EAAE;AACrE;AAAA,MACF;AAEA,iBAAW,KAAK,EAAE,MAAM,SAAS,UAAU,WAAW,OAAO,KAAK,CAAC;AAAA,IACrE;AAAA,EACF;AAIA,QAAM,UAAU,mBAAmB,UAAU;AAC7C,aAAW,SAAS,YAAY;AAC9B,UAAM,WAAW,MAAM,MAAM,YACzB,CAAC,QAAgC,mBAAmB,MAAM,OAAO,KAAK,OAAO,IAC7E;AACJ,WAAO,KAAK,GAAG,mBAAmB,MAAM,MAAM,MAAM,OAAO,MAAM,MAAM,QAAQ,CAAC;AAChF,WAAO,KAAK,GAAG,oBAAoB,MAAM,MAAM,MAAM,OAAO,MAAM,MAAM,QAAQ,CAAC;AAAA,EACnF;AAGA,aAAW,SAAS,YAAY;AAC9B,WAAO,KAAK,GAAG,iBAAiB,MAAM,MAAM,MAAM,OAAO,MAAM,IAAI,CAAC;AAAA,EACtE;AAGA,QAAM,aAAa,iBAAiB;AACpC,aAAW,SAAS,YAAY;AAC9B,gBAAY,YAAY,MAAM,MAAM,MAAM,WAAW,MAAM,IAAI;AAAA,EACjE;AACA,SAAO,KAAK,GAAG,WAAW,MAAM;AAGhC,aAAW,SAAS,YAAY;AAC9B,WAAO,KAAK,GAAG,iBAAiB,MAAM,MAAM,MAAM,OAAO,MAAM,IAAI,CAAC;AACpE,WAAO,KAAK,GAAG,iBAAiB,MAAM,MAAM,MAAM,OAAO,MAAM,IAAI,CAAC;AAAA,EACtE;AAGA,aAAW,SAAS,YAAY;AAC9B,QAAI,MAAM,cAAc,eAAe,MAAM,cAAc,kBAAkB;AAE3E,YAAM,OAAO,MAAM,cAAc,cAAc,cAAc,KAAK,aAAa,MAAM,KAAK,IAAI,IAAI,MAAM,KAAK;AAC7G,aAAO,KAAK,GAAG,sBAAsB,MAAM,MAAM,EAAE,GAAG,MAAM,MAAM,KAAK,CAAC,CAAC;AAAA,IAC3E;AAAA,EACF;AAGA,aAAW,SAAS,YAAY;AAC9B,WAAO,KAAK,GAAG,mBAAmB,MAAM,MAAM,MAAM,OAAO,MAAM,MAAM,UAAU,CAAC;AAAA,EACpF;AAGA,SAAO,KAAK,GAAG,cAAc,YAAY,SAAS,UAAU,CAAC;AAG7D,aAAW,SAAS,YAAY;AAC9B,WAAO,KAAK,GAAG,oBAAoB,MAAM,MAAM,MAAM,WAAW,MAAM,MAAM,UAAU,CAAC;AAAA,EACzF;AAGA,QAAM,YAAY,CAAC,MAAc,WAAW,KAAK,OAAK,EAAE,SAAS,UAAU,CAAC,MAAM,GAAG,QAAQ;AAC7F,SAAO,KAAK,GAAG,eAAe,UAAU,OAAO,GAAG,UAAU,gBAAgB,GAAG,UAAU,CAAC;AAE1F,SAAO,KAAK,GAAG,eAAe,YAAY,UAAU,CAAC;AAErD,QAAM,iBAAiB,oBAAI,IAAoB;AAC/C,aAAW,SAAS,YAAY;AAC9B,QAAI,MAAM,cAAc,QAAS;AACjC,eAAW,OAAO,MAAM,KAAK,KAAM,KAAI,IAAI,GAAI,gBAAe,IAAI,IAAI,IAAI,OAAO,IAAI,SAAS,KAAK,CAAC;AAAA,EACtG;AACA,SAAO,KAAK,GAAG,iBAAiB,KAAK,YAAY,YAAY,cAAc,CAAC;AAG5E,aAAW,SAAS,YAAY;AAC9B,QAAI,MAAM,cAAc,eAAgB,QAAO,KAAK,GAAG,uBAAuB,MAAM,MAAM,MAAM,IAAI,CAAC;AAAA,EACvG;AAEA,SAAO,KAAK,GAAG,eAAe,GAAG,EAAE,MAAM;AAGzC,QAAM,QAAQ,aAAa,GAAG;AAC9B,aAAW,SAAS,YAAY;AAC9B,WAAO,KAAK,GAAG,eAAe,MAAM,MAAM,MAAM,OAAO,MAAM,MAAM,KAAK,CAAC;AAAA,EAC3E;AAGA,aAAW,SAAS,YAAY;AAC9B,QAAI,CAAC,MAAM,MAAM,SAAU;AAC3B,aAAS,IAAI,GAAG,IAAI,MAAM,KAAK,KAAK,QAAQ,KAAK;AAC/C,YAAM,MAAM,MAAM,KAAK,KAAK,CAAC;AAC7B,YAAM,MAAM,IAAI;AAChB,UAAI,QAAQ,UAAa,QAAQ,GAAI;AACrC,YAAM,MAAM,OAAO,GAAG;AACtB,UAAI,MAAM,GAAG,KAAK,MAAM,GAAG;AACzB,eAAO;AAAA,UACL,GAAG,MAAM,IAAI,IAAI,IAAI,CAAC,cAAc,GAAG;AAAA,QACzC;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAGA,aAAW,KAAK,SAAS;AACvB,QAAI,CAACD,YAAW,EAAE,IAAI,EAAG;AACzB,UAAM,QAAQ,UAAU,EAAE,IAAI;AAC9B,eAAW,KAAK,OAAO;AACrB,UAAI,CAAC,EAAE,SAAS,UAAU,EAAG;AAC7B,YAAM,OAAO,EAAE,QAAQ,YAAY,EAAE;AACrC,YAAM,aAAa,OAAO,QAAQ,kBAAkB,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,MAAM,MAAM,IAAI;AAChF,UAAI,CAAC,WAAY;AACjB,YAAM,CAAC,SAAS,IAAI;AACpB,YAAM,QAAQ,SAAS,IAAI,SAAS;AACpC,UAAI,CAAC,MAAO;AAGZ,YAAM,SAAS,oBAAI,IAAY;AAC/B,iBAAW,SAAS,YAAY;AAC9B,YAAI,MAAM,cAAc,UAAW;AACnC,cAAM,WAAW,MAAM,KAAK,MAAM,GAAG,EAAE,CAAC;AACxC,YAAI,aAAa,EAAE,KAAM;AACzB,mBAAW,OAAO,MAAM,KAAK,MAAM;AACjC,cAAI,IAAI,GAAI,QAAO,IAAI,IAAI,EAAE;AAAA,QAC/B;AAAA,MACF;AAEA,YAAM,WAAWC,MAAK,EAAE,MAAM,CAAC;AAC/B,YAAM,UAAU,GAAG,EAAE,IAAI,IAAI,CAAC;AAC9B,aAAO,KAAK,GAAG,oBAAoB,SAAS,UAAU,QAAQ,WAAW,KAAK,CAAC;AAAA,IACjF;AAAA,EACF;AAEA,SAAO;AACT;;;AenMA,SAAS,qBAAqB;AAC9B,SAAS,WAAAC,UAAS,QAAAC,aAAY;;;ACG9B,SAAS,cAAAC,mBAAkB;AAC3B,SAAS,SAAS,QAAAC,aAAY;;;ACY9B,IAAM,gBAAgB;AAEtB,SAAS,WAAW,GAA0B;AAC5C,MAAI,IAAI;AACR,WAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;AACjC,UAAM,IAAI,EAAE,CAAC,GAAG,IAAI,GAAG,IAAI,KAAK,EAAE,MAAM;AACxC,SAAK,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE;AAAA,EAC3B;AACA,SAAO,IAAI;AACb;AAEA,SAAS,UAAU,KAAoB,MAAM,MAAY;AACvD,QAAM,MAAY,CAAC;AACnB,aAAW,KAAK,KAAK;AACnB,UAAM,OAAO,IAAI,IAAI,SAAS,CAAC;AAC/B,QAAI,CAAC,QAAQ,KAAK,MAAM,EAAE,IAAI,KAAK,GAAG,EAAE,IAAI,KAAK,CAAC,IAAI,IAAK,KAAI,KAAK,CAAC;AAAA,EACvE;AACA,SAAO,IAAI,SAAS,KAAK,KAAK,MAAM,IAAI,CAAC,EAAE,IAAI,IAAI,IAAI,SAAS,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,IAAI,IAAI,IAAI,SAAS,CAAC,EAAE,CAAC,KAAK,IAAK,KAAI,IAAI;AACxH,SAAO;AACT;AAEA,SAAS,cAAc,GAAO,GAAO,GAAe;AAClD,QAAM,KAAK,EAAE,IAAI,EAAE,GAAG,KAAK,EAAE,IAAI,EAAE;AACnC,QAAM,KAAK,KAAK,KAAK,KAAK;AAC1B,QAAM,IAAI,KAAK,IAAI,KAAK,IAAI,GAAG,KAAK,IAAI,KAAK,EAAE,IAAI,EAAE,KAAK,MAAM,EAAE,IAAI,EAAE,KAAK,MAAM,EAAE,CAAC,IAAI;AAC1F,SAAO,KAAK,MAAM,EAAE,KAAK,EAAE,IAAI,IAAI,KAAK,EAAE,KAAK,EAAE,IAAI,IAAI,GAAG;AAC9D;AAGO,SAAS,eAAe,SAAwB,OAAuB,MAAM,GAAgB;AAClG,QAAM,MAAM,gBAAgB;AAC5B,QAAM,OAAO,UAAU,OAAO;AAC9B,QAAM,QAA0C,CAAC;AACjD,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,UAAM,IAAI,KAAK,CAAC,GAAG,IAAI,MAAM,IAAI,KAAK,KAAK,MAAM;AACjD,QAAI,KAAK,MAAM,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,IAAI,OAAO,IAAK;AACnD,UAAM,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE;AACrD,UAAM,OAAO,MAAM,KAAK,CAAC,MAAM,cAAc,GAAG,EAAE,OAAO,EAAE,GAAG,IAAI,OAAO,cAAc,GAAG,EAAE,OAAO,EAAE,GAAG,IAAI,OAAO,cAAc,KAAK,EAAE,OAAO,EAAE,GAAG,IAAI,GAAG;AAC3J,UAAM,KAAK,EAAE,GAAG,GAAG,MAAM,OAAO,KAAK,OAAO,EAAE,CAAC;AAAA,EACjD;AACA,QAAM,IAAI,MAAM;AAChB,MAAI,IAAI,EAAG,QAAO;AAClB,QAAM,OAAO,WAAW,MAAM,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,KAAK,IAAI,IAAI;AAC1D,QAAM,OAAO,MAAM,IAAI,CAAC,MAAM;AAC5B,UAAM,KAAK,EAAE,EAAE,IAAI,EAAE,EAAE,GAAG,KAAK,EAAE,EAAE,IAAI,EAAE,EAAE;AAC3C,UAAM,IAAI,KAAK,MAAM,IAAI,EAAE;AAC3B,UAAM,KAAM,CAAC,KAAK,IAAK,MAAM,KAAM,KAAK,IAAK;AAC7C,WAAO,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,IAAI,KAAK,EAAE,MAAM,GAAG,EAAE,EAAE,IAAI,KAAK,EAAE,KAAK,GAAG,GAAG,EAAE,GAAG,KAAK,GAAG,GAAG,KAAK,EAAE,EAAE;AAAA,EAC9F,CAAC;AACD,QAAM,MAAY,CAAC;AACnB,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,UAAM,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,GAAG,KAAK,KAAK,CAAC;AAC7C,UAAM,MAAM,GAAG,EAAE,IAAI,GAAG,EAAE,IAAI,GAAG,EAAE,IAAI,GAAG,EAAE;AAC5C,QAAI,KAAK,IAAI,GAAG,IAAI,MAAM;AAAE,UAAI,KAAK,GAAG,CAAC;AAAG;AAAA,IAAU;AACtD,UAAM,MAAM,GAAG,EAAE,IAAI,GAAG,EAAE,KAAK,GAAG,EAAE,KAAK,GAAG,EAAE,IAAI,GAAG,EAAE,KAAK,GAAG,EAAE,KAAK;AACtE,QAAI,KAAK,EAAE,GAAG,GAAG,EAAE,IAAI,GAAG,EAAE,IAAI,GAAG,GAAG,GAAG,EAAE,IAAI,GAAG,EAAE,IAAI,EAAE,CAAC;AAAA,EAC7D;AACA,QAAM,QAAQ,KAAK,IAAI,WAAW,MAAM,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;AACxD,QAAM,MAAM,KAAK,IAAI,WAAW,GAAG,CAAC;AACpC,MAAI,EAAE,MAAM,MAAM,MAAM,QAAQ,OAAO,KAAK,IAAI,GAAG,KAAK,KAAK,KAAK,KAAK,WAAW,GAAG,CAAC,MAAM,KAAM,QAAO;AACzG,SAAO;AACT;AAGO,SAAS,YAAY,SAAwB,OAAuB,MAAM,GAAW;AAC1F,QAAM,MAAM,eAAe,SAAS,OAAO,GAAG;AAC9C,SAAO,KAAK,IAAI,WAAW,OAAO,OAAO,CAAC;AAC5C;;;ADrEA,IAAM,kBAAkB,CAAC,QAAQ,kBAAkB,gBAAgB,gBAAgB;AAG5E,SAAS,qBAAqB,SAAiC;AACpE,QAAM,MAAsB,CAAC;AAC7B,QAAM,aAAa,QAAQ,OAAO;AAClC,aAAW,SAAS,iBAAiB;AACnC,UAAM,WAAWC,MAAK,SAAS,GAAG,mBAAmB,KAAK,KAAK,KAAK,UAAU;AAC9E,QAAI,CAACC,YAAW,QAAQ,EAAG;AAC3B,UAAM,YAAY,oBAAI,IAAoB;AAC1C,UAAM,UAAUD,MAAK,SAAS,GAAG,KAAK,MAAM;AAC5C,QAAI,UAAU,oBAAoBC,YAAW,OAAO,GAAG;AACrD,UAAI;AACF,mBAAW,KAAK,cAAc,YAAY,OAAO,QAAQ,OAAO,EAAE,IAAI,GAAG;AACvE,gBAAM,IAAI,WAAW,EAAE,aAAa,EAAE;AACtC,cAAI,EAAE,MAAM,OAAO,SAAS,CAAC,KAAK,IAAI,EAAG,WAAU,IAAI,EAAE,IAAI,CAAC;AAAA,QAChE;AAAA,MACF,QAAQ;AAAA,MAA4C;AAAA,IACtD;AACA,QAAI;AACF,iBAAW,KAAK,iBAAiB,QAAQ,EAAE,UAAU;AACnD,YAAI,EAAE,SAAS,SAAS,aAAc;AACtC,cAAM,KAAK,OAAO,EAAE,YAAY,MAAM,EAAE;AACxC,cAAM,KAAK,oBAAoB,CAAC;AAChC,YAAI,KAAK;AAAA,UACP,OAAO,EAAE,GAAG,GAAG,SAAS,GAAG,GAAG,QAAQ;AAAA,UAAG,KAAK,EAAE,GAAG,GAAG,OAAO,GAAG,GAAG,MAAM;AAAA,UACzE,MAAM,UAAU,mBAAmB,KAAK,UAAU,IAAI,EAAE,KAAK,KAAK;AAAA,QACpE,CAAC;AAAA,MACH;AAAA,IACF,QAAQ;AAAA,IAAa;AAAA,EACvB;AACA,SAAO;AACT;AAGO,SAAS,cAAc,MAAsB;AAClD,SAAO,KAAK,UAAU,IAA8B,KAAK;AAC3D;;;AE7CO,IAAM,YAAY;AACzB,IAAM,iBAAiB;AAmEhB,SAAS,YAAY,OAAe,UAAqB,OAAmB,QAAQ,KAAmB;AAC5G,QAAM,WAAqB,CAAC;AAC5B,QAAM,aAA0B,CAAC;AACjC,QAAM,UAAU,oBAAI,IAAkB;AAKtC,QAAM,gBAAgB,qBAAqB,QAAQ;AACnD,QAAM,EAAE,UAAU,UAAU,IAAI,uBAAuB,aAAa;AAGpE,aAAW,KAAK,UAAU;AACxB,QAAI,EAAE,SAAS,WAAW,GAAG;AAC3B,YAAM,KAAK,EAAE,SAAS,CAAC;AACvB,eAAS;AAAA,QACP,UAAU,KAAK,MAAM,GAAG,QAAQ,cAAc,EAAE,EAAE,QAAQ,CAAC,CAAC,KAAK,EAAE,EAAE,QAAQ,CAAC,CAAC;AAAA,MACjF;AAAA,IACF;AAAA,EACF;AAEA,QAAM,QAAQ,WAAW,SAAS;AAGlC,QAAM,UAAU,oBAAI,IAAsC;AAC1D,aAAW,QAAQ,OAAO;AACxB,QAAI,MAAM,KAAK,CAAC,KAAK,MAAM,KAAK,CAAC,EAAG;AACpC,QAAI,WAAwB;AAC5B,QAAI,WAAW;AACf,eAAW,QAAQ,OAAO;AAExB,UAAI,KAAK,cAAc,EAAG;AAC1B,UAAI,KAAK,aAAa,YAAY,eAAe,KAAK,GAAG,KAAK,GAAG,KAAK,OAAO,GAAG;AAC9E,mBAAW;AACX,mBAAW,KAAK;AAAA,MAClB;AAAA,IACF;AACA,QAAI,UAAU;AACZ,cAAQ,IAAI,KAAK,IAAI,QAAQ;AAC7B,cAAQ,IAAI,KAAK,IAAI,EAAE,GAAG,KAAK,GAAG,GAAG,KAAK,EAAE,CAAC;AAAA,IAC/C,OAAO;AACL,iBAAW,KAAK,EAAE,MAAM,aAAa,OAAO,UAAU,CAAC,KAAK,EAAE,EAAE,CAAC;AACjE,eAAS;AAAA,QACP,UAAU,KAAK,eAAe,KAAK,EAAE,QAAQ,KAAK,MAAM,CAAC,KAAK,KAAK,CAAC,KAAK,KAAK,MAAM,CAAC,KAAK,KAAK,CAAC;AAAA,MAClG;AAAA,IACF;AAAA,EACF;AAGA,QAAM,UAAU,iBAAiB,OAAO,SAAS,SAAS,KAAK;AAC/D,aAAW,KAAK,GAAG,QAAQ,UAAU;AACrC,WAAS,KAAK,GAAG,QAAQ,QAAQ;AACjC,SAAO,EAAE,SAAS,YAAY,SAAS;AACzC;AAWA,SAAS,iBACP,OACA,SACA,OACA,OACiD;AACjD,QAAM,WAAqB,CAAC;AAC5B,QAAM,aAA0B,CAAC;AAEjC,QAAM,SAAS,oBAAI,IAAoB;AACvC,aAAW,CAAC,IAAI,IAAI,KAAK,SAAS;AAChC,UAAMC,OAAM,OAAO,IAAI,IAAI;AAC3B,QAAIA,KAAK,CAAAA,KAAI,KAAK,EAAE;AAAA,QACf,QAAO,IAAI,MAAM,CAAC,EAAE,CAAC;AAAA,EAC5B;AAEA,aAAW,CAAC,MAAMA,IAAG,KAAK,QAAQ;AAChC,QAAIA,KAAI,SAAS,EAAG;AACpB,eAAW,KAAK,EAAE,MAAM,UAAU,OAAO,UAAUA,KAAI,CAAC;AACxD,aAAS;AAAA,MACP,UAAU,KAAK,eAAeA,KAAI,KAAK,IAAI,CAAC,6BAA6B,QAAQ,KAAK,YAAY,KAAK,CAAC,MAAMA,KAAI,MAAM,CAAC,EAAE,KAAK,IAAI,CAAC,IAAIA,KAAI,SAAS,IAAI,wBAAwB,qBAAqB,qCAAqCA,KAAI,CAAC,CAAC;AAAA,IACpP;AAAA,EACF;AAGA,QAAM,YAAY,oBAAI,IAAoB;AAC1C,aAAW,CAAC,IAAI,IAAI,KAAK,SAAS;AAChC,UAAM,OAAO,MAAM,IAAI,EAAE;AACzB,QAAI,SAAsB;AAC1B,eAAW,SAAS,OAAO,KAAK,GAAG;AACjC,UAAI,UAAU,QAAQ,MAAM,cAAc,KAAK,WAAY;AAC3D,UAAI,UAAU,MAAM,cAAc,OAAO,WAAY;AACrD,UAAI,eAAe,KAAK,GAAG,KAAK,GAAG,MAAM,OAAO,EAAG,UAAS;AAAA,IAC9D;AACA,QAAI,CAAC,OAAQ;AACb,UAAM,OAAO,UAAU,IAAI,MAAM;AACjC,QAAI,KAAM,MAAK,KAAK,EAAE;AAAA,QACjB,WAAU,IAAI,QAAQ,CAAC,EAAE,CAAC;AAAA,EACjC;AAEA,aAAW,CAAC,OAAO,KAAK,KAAK,WAAW;AACtC,UAAM,WAAW,OAAO,IAAI,KAAK;AACjC,eAAW,KAAK,EAAE,MAAM,YAAY,OAAO,UAAU,UAAU,QAAQ,MAAM,CAAC;AAC9E,aAAS;AAAA,MACP,UAAU,KAAK,eAAe,SAAS,KAAK,IAAI,CAAC,aAAa,QAAQ,MAAM,YAAY,KAAK,CAAC,cAAc,MAAM,KAAK,IAAI,CAAC;AAAA,IAC9H;AAAA,EACF;AAEA,SAAO,EAAE,UAAU,WAAW;AAChC;AAEA,SAAS,QAAQ,GAAW,OAAuB;AACjD,SAAO,GAAG,EAAE,QAAQ,CAAC,CAAC,IAAI,KAAK;AACjC;AAkBA,SAAS,qBAAqB,UAAgC;AAC5D,MAAI,SAAS,CAAC,GAAG,QAAQ;AACzB,MAAI,UAAU;AAEd,SAAO,SAAS;AACd,cAAU;AAEV,UAAM,eAA2C,CAAC;AAClD,eAAW,OAAO,QAAQ;AACxB,mBAAa,KAAK,EAAE,GAAG,IAAI,QAAQ,GAAG,IAAI,OAAO,CAAC;AAClD,mBAAa,KAAK,EAAE,GAAG,IAAI,MAAM,GAAG,IAAI,KAAK,CAAC;AAAA,IAChD;AAEA,UAAM,aAAwB,CAAC;AAE/B,aAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,YAAM,MAAM,OAAO,CAAC;AACpB,YAAM,KAAK,IAAI,OAAO,IAAI;AAC1B,YAAM,KAAK,IAAI,OAAO,IAAI;AAC1B,YAAM,QAAQ,KAAK,KAAK,KAAK;AAE7B,YAAM,SAAS,KAAK,KAAK,KAAK;AAC9B,UAAI,QAAQ,YAAY,WAAW;AACjC,mBAAW,KAAK,GAAG;AACnB;AAAA,MACF;AAEA,YAAM,cAAqD,CAAC;AAG5D,iBAAW,MAAM,cAAc;AAC7B,YAAI,KAAK,IAAI,GAAG,IAAI,IAAI,MAAM,IAAI,aAAa,KAAK,IAAI,GAAG,IAAI,IAAI,MAAM,IAAI,UAAW;AACxF,YAAI,KAAK,IAAI,GAAG,IAAI,IAAI,IAAI,IAAI,aAAa,KAAK,IAAI,GAAG,IAAI,IAAI,IAAI,IAAI,UAAW;AAEpF,cAAM,MAAM,GAAG,IAAI,IAAI,UAAU,MAAM,GAAG,IAAI,IAAI,UAAU,MAAM;AAClE,YAAI,IAAI,UAAU,cAAc,IAAI,KAAK,UAAU,UAAW;AAE9D,cAAM,WAAW,IAAI,SAAS,IAAI;AAClC,cAAM,WAAW,IAAI,SAAS,IAAI;AAClC,cAAM,UAAU,GAAG,IAAI,aAAa,GAAG,IAAI,aAAa,GAAG,IAAI,aAAa,GAAG,IAAI;AACnF,YAAI,SAAS,YAAY,WAAW;AAClC,sBAAY,KAAK,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,EAAE,CAAC;AAAA,QAC1C;AAAA,MACF;AAKA,eAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,YAAI,MAAM,EAAG;AACb,cAAM,QAAQ,OAAO,CAAC;AACtB,cAAM,KAAK,MAAM,OAAO,MAAM;AAC9B,cAAM,KAAK,MAAM,OAAO,MAAM;AAG9B,cAAM,MAAM,KAAK,KAAK,KAAK;AAC3B,YAAI,KAAK,IAAI,GAAG,IAAI,MAAO;AAG3B,cAAM,KAAK,MAAM,SAAS,IAAI;AAC9B,cAAM,KAAK,MAAM,SAAS,IAAI;AAC9B,cAAM,KAAK,KAAK,KAAK,KAAK,MAAM;AAChC,cAAM,KAAK,KAAK,KAAK,KAAK,MAAM;AAEhC,YAAI,IAAI,UAAU,cAAc,IAAI,KAAK,UAAU,UAAW;AAC9D,cAAM,WAAW,KAAK,MAAM,IAAI,EAAE;AAClC,YAAI,IAAI,YAAY,cAAc,IAAI,KAAK,YAAY,UAAW;AAElE,oBAAY,KAAK;AAAA,UACf,GAAG,IAAI,SAAS,IAAI;AAAA,UACpB,GAAG,IAAI,SAAS,IAAI;AAAA,UACpB;AAAA,QACF,CAAC;AAAA,MACH;AAEA,UAAI,YAAY,WAAW,GAAG;AAC5B,mBAAW,KAAK,GAAG;AAAA,MACrB,OAAO;AACL,kBAAU;AACV,oBAAY,KAAK,CAAC,GAAG,MAAM,EAAE,IAAI,EAAE,CAAC;AAIpC,cAAM,SAAS,CAAC,YAAY,CAAC,CAAC;AAC9B,iBAAS,IAAI,GAAG,IAAI,YAAY,QAAQ,KAAK;AAC3C,cAAI,KAAK,IAAI,YAAY,CAAC,EAAE,IAAI,OAAO,OAAO,SAAS,CAAC,EAAE,CAAC,IAAI,SAAS,WAAW;AACjF,mBAAO,KAAK,YAAY,CAAC,CAAC;AAAA,UAC5B;AAAA,QACF;AAEA,YAAI,QAAQ,IAAI,QAAQ,QAAQ,IAAI;AACpC,mBAAW,MAAM,QAAQ;AACvB,qBAAW,KAAK,EAAE,QAAQ,OAAO,QAAQ,OAAO,MAAM,GAAG,GAAG,MAAM,GAAG,GAAG,IAAI,IAAI,GAAG,CAAC;AACpF,kBAAQ,GAAG;AACX,kBAAQ,GAAG;AAAA,QACb;AACA,mBAAW,KAAK,EAAE,QAAQ,OAAO,QAAQ,OAAO,MAAM,IAAI,MAAM,MAAM,IAAI,MAAM,IAAI,IAAI,GAAG,CAAC;AAAA,MAC9F;AAAA,IACF;AAEA,aAAS;AAAA,EACX;AAEA,SAAO;AACT;AAIA,SAAS,uBAAuB,UAG9B;AACA,QAAM,WAAqB,CAAC;AAE5B,WAAS,mBAAmB,GAAW,GAAmB;AACxD,eAAWC,MAAK,UAAU;AACxB,UAAI,KAAK,IAAIA,GAAE,IAAI,CAAC,IAAI,aAAa,KAAK,IAAIA,GAAE,IAAI,CAAC,IAAI,WAAW;AAClE,eAAOA;AAAA,MACT;AAAA,IACF;AACA,UAAM,IAAY,EAAE,GAAG,GAAG,IAAI,SAAS,QAAQ,UAAU,CAAC,EAAE;AAC5D,aAAS,KAAK,CAAC;AACf,WAAO;AAAA,EACT;AAGA,QAAM,YAAwB,CAAC;AAE/B,aAAW,OAAO,UAAU;AAC1B,UAAM,KAAK,mBAAmB,IAAI,QAAQ,IAAI,MAAM;AACpD,UAAM,KAAK,mBAAmB,IAAI,MAAM,IAAI,IAAI;AAChD,QAAI,OAAO,GAAI;AAGf,UAAM,cAAc,GAAG,SAAS,KAAK,CAAC,OAAO,GAAG,OAAO,EAAE;AACzD,QAAI,YAAa;AAEjB,UAAM,MAAM,EAAE,MAAM,IAAI,IAAI,IAAI,UAAU,IAAI,GAAG;AACjD,UAAM,MAAM,EAAE,MAAM,IAAI,IAAI,IAAI,UAAU,IAAI,GAAG;AACjD,QAAI,OAAO;AACX,QAAI,OAAO;AACX,QAAI,UAAU;AACd,QAAI,UAAU;AAEd,OAAG,SAAS,KAAK,GAAG;AACpB,OAAG,SAAS,KAAK,GAAG;AACpB,cAAU,KAAK,KAAK,GAAG;AAAA,EACzB;AAGA,aAAW,KAAK,UAAU;AACxB,MAAE,SAAS,KAAK,CAAC,GAAG,MAAM;AACxB,YAAM,SAAS,KAAK,MAAM,EAAE,GAAG,IAAI,EAAE,GAAG,EAAE,GAAG,IAAI,EAAE,CAAC;AACpD,YAAM,SAAS,KAAK,MAAM,EAAE,GAAG,IAAI,EAAE,GAAG,EAAE,GAAG,IAAI,EAAE,CAAC;AACpD,aAAO,SAAS;AAAA,IAClB,CAAC;AAAA,EACH;AAKA,aAAW,MAAM,WAAW;AAC1B,UAAM,IAAI,GAAG;AACb,UAAM,UAAU,EAAE,SAAS,QAAQ,GAAG,IAAI;AAC1C,QAAI,YAAY,IAAI;AAElB,SAAG,OAAO,GAAG;AACb;AAAA,IACF;AACA,UAAM,WAAW,UAAU,IAAI,EAAE,SAAS,UAAU,EAAE,SAAS;AAC/D,OAAG,OAAO,EAAE,SAAS,OAAO;AAAA,EAC9B;AAEA,SAAO,EAAE,UAAU,UAAU;AAC/B;AAIA,SAAS,WAAW,WAA+B;AACjD,QAAM,QAAgB,CAAC;AAEvB,aAAW,WAAW,WAAW;AAC/B,QAAI,QAAQ,QAAS;AAErB,UAAM,UAAsC,CAAC;AAC7C,QAAI,UAAU;AACd,QAAI,QAAQ;AAEZ,OAAG;AACD,cAAQ,UAAU;AAClB,cAAQ,KAAK,EAAE,GAAG,QAAQ,KAAK,GAAG,GAAG,QAAQ,KAAK,EAAE,CAAC;AACrD,gBAAU,QAAQ;AAClB;AAAA,IACF,SAAS,YAAY,WAAW,QAAQ;AAExC,QAAI,SAAS,eAAgB;AAI7B,QAAIC,cAAa;AACjB,aAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;AACvC,YAAM,KAAK,IAAI,KAAK,QAAQ;AAC5B,MAAAA,eAAc,QAAQ,CAAC,EAAE,IAAI,QAAQ,CAAC,EAAE;AACxC,MAAAA,eAAc,QAAQ,CAAC,EAAE,IAAI,QAAQ,CAAC,EAAE;AAAA,IAC1C;AACA,IAAAA,eAAc;AAEd,UAAM,KAAK,EAAE,SAAS,YAAAA,YAAW,CAAC;AAAA,EACpC;AAEA,SAAO;AACT;AAIO,SAAS,eAAe,IAAY,IAAY,SAA8C;AACnG,MAAI,YAAY;AAChB,WAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;AACvC,UAAM,KAAK,IAAI,KAAK,QAAQ;AAC5B,UAAM,KAAK,QAAQ,CAAC,EAAE;AACtB,UAAM,KAAK,QAAQ,CAAC,EAAE;AACtB,UAAM,KAAK,QAAQ,CAAC,EAAE;AACtB,UAAM,KAAK,QAAQ,CAAC,EAAE;AAEtB,QAAK,MAAM,MAAM,KAAK,MAAQ,MAAM,MAAM,KAAK,IAAK;AAClD,YAAM,KAAK,KAAK,OAAO,KAAK;AAC5B,YAAM,aAAa,KAAK,KAAK,KAAK;AAClC,UAAI,KAAK,WAAY;AAAA,IACvB;AAAA,EACF;AACA,SAAO,YAAY,MAAM;AAC3B;;;ACjaO,SAAS,YAAY,OAA6C;AACvE,SAAO;AAAA,IACL,MAAM,CAAC,MAAM,MAAM,CAAC;AAAA,IACpB,OAAO,CAAC,GAAG,MAAM;AAAE,YAAM,CAAC,IAAI;AAAA,IAAG;AAAA,EACnC;AACF;AAGO,IAAMC,mBAAkB,CAAC,QAAQ,kBAAkB,gBAAgB,gBAAgB;AAEnF,SAAS,eAAe,OAA6B;AAC1D,SAAO,gBAAgB,MAAM,KAAK,uBAAuB,CAAC;AAC5D;AAEA,SAAS,OAAO,OAAqB,MAA+C;AAClF,QAAM,OAAO,MAAM,KAAK,IAAI;AAC5B,MAAI,SAAS,OAAW,QAAO;AAC/B,MAAI;AAAE,WAAO,iBAAiB,MAAM,IAAI;AAAA,EAAG,QAAQ;AAAE,WAAO;AAAA,EAAM;AACpE;AASO,IAAM,mBAAmB;AAEhC,IAAM,eAAe;AAyBd,SAAS,qBAAqB,OAAqB,MAA8B;AACtF,QAAM,YAAY,mBAAmB,UAAU,eAAe,KAAK,CAAC;AACpE,QAAM,UAAwB,CAAC;AAC/B,aAAW,OAAO,MAAM;AACtB,UAAM,MAAM,oBAAI,IAAsC;AACtD,UAAM,YAA2B,CAAC;AAClC,eAAW,SAASA,kBAAiB;AACnC,YAAM,KAAK,OAAO,OAAO,GAAG,GAAG,IAAI,KAAK,UAAU;AAClD,UAAI,CAAC,GAAI;AACT,UAAI,IAAI,OAAO,EAAE;AACjB,iBAAW,KAAK,GAAG,UAAU;AAC3B,YAAI,EAAE,SAAS,SAAS,gBAAgB,EAAE,SAAS,YAAY,SAAS,EAAG;AAC3E,cAAM,KAAK,OAAO,EAAE,YAAY,MAAM,EAAE;AACxC,YAAI,CAAC,GAAI;AACT,cAAM,IAAI,EAAE,SAAS,YAAY,CAAC;AAClC,cAAM,IAAI,EAAE,SAAS,YAAY,EAAE,SAAS,YAAY,SAAS,CAAC;AAClE,cAAM,KAAK,EAAE,GAAG,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,GAAG,KAAK,EAAE,GAAG,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE;AACzD,kBAAU,KAAK,EAAE,OAAO,IAAI,OAAO,IAAI,OAAO,WAAW,IAAI,MAAM,QAAQ,CAAC;AAC5E,kBAAU,KAAK,EAAE,OAAO,IAAI,OAAO,IAAI,OAAO,WAAW,IAAI,MAAM,MAAM,CAAC;AAAA,MAC5E;AAAA,IACF;AAGA,UAAM,UAAU,oBAAI,IAAmB;AACvC,eAAW,WAAW,iBAAiB,WAAW,SAAS,GAAG;AAC5D,UAAI,QAAQ,UAAU,EAAG;AACzB,YAAM,YAAY,cAAc,OAAO;AACvC,YAAM,SAAS,QAAQ,OAAO,QAAM,CAAC,KAAK,GAAG,OAAO,SAAS,CAAC;AAG9D,YAAM,UAAU,IAAI,IAAI,OAAO,OAAO,QAAM,YAAY,GAAG,OAAO,GAAG,OAAO,SAAS,IAAI,YAAY,EAAE,IAAI,QAAM,IAAI,GAAG,KAAK,CAAC,CAAC;AAC/H,iBAAW,MAAM,QAAQ;AACvB,YAAI,QAAQ,IAAI,IAAI,GAAG,KAAK,CAAC,EAAG;AAChC,gBAAQ,IAAI,GAAG,GAAG,KAAK,IAAI,GAAG,SAAS,IAAI,GAAG,IAAI,IAAI,SAAS;AAC/D,gBAAQ,KAAK,EAAE,OAAO,KAAK,OAAO,GAAG,OAAO,WAAW,GAAG,WAAW,MAAM,GAAG,MAAM,MAAM,GAAG,OAAO,IAAI,UAAU,CAAC;AAAA,MACrH;AAAA,IACF;AACA,QAAI,QAAQ,SAAS,EAAG;AAExB,eAAW,CAAC,OAAO,EAAE,KAAK,KAAK;AAC7B,UAAI,QAAQ;AACZ,iBAAW,KAAK,GAAG,UAAU;AAC3B,YAAI,EAAE,SAAS,SAAS,gBAAgB,EAAE,SAAS,YAAY,SAAS,EAAG;AAC3E,cAAM,KAAK,OAAO,EAAE,YAAY,MAAM,EAAE;AACxC,cAAM,KAAK,QAAQ,IAAI,GAAG,KAAK,IAAI,EAAE,QAAQ;AAC7C,cAAM,KAAK,QAAQ,IAAI,GAAG,KAAK,IAAI,EAAE,MAAM;AAC3C,YAAI,CAAC,MAAM,CAAC,GAAI;AAChB,cAAM,SAAS,EAAE,SAAS;AAC1B,YAAI,GAAI,QAAO,CAAC,IAAI,MAAM,OAAO,CAAC,GAAG,EAAE;AACvC,YAAI,GAAI,QAAO,OAAO,SAAS,CAAC,IAAI,MAAM,OAAO,OAAO,SAAS,CAAC,GAAG,EAAE;AACvE,gBAAQ;AAAA,MACV;AACA,UAAI,MAAO,OAAM,MAAM,GAAG,GAAG,IAAI,KAAK,YAAY,2BAA2B,EAAE,CAAC;AAAA,IAClF;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,MAAM,GAAa,IAAqB;AAC/C,SAAQ,EAAE,WAAW,IAAI,CAAC,GAAG,GAAG,GAAG,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;AAC3D;AAGA,SAAS,iBAAiB,WAA0B,WAAoC;AACtF,QAAM,UAAU,oBAAI,IAAY;AAChC,QAAM,WAA4B,CAAC;AACnC,WAAS,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK;AACzC,QAAI,QAAQ,IAAI,CAAC,EAAG;AACpB,YAAQ,IAAI,CAAC;AACb,UAAM,UAAyB,CAAC,UAAU,CAAC,CAAC;AAC5C,aAAS,IAAI,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK;AAC7C,UAAI,CAAC,QAAQ,IAAI,CAAC,KAAK,KAAK,UAAU,CAAC,EAAE,OAAO,UAAU,CAAC,EAAE,KAAK,IAAI,WAAW;AAC/E,gBAAQ,KAAK,UAAU,CAAC,CAAC;AACzB,gBAAQ,IAAI,CAAC;AAAA,MACf;AAAA,IACF;AACA,aAAS,KAAK,OAAO;AAAA,EACvB;AACA,SAAO;AACT;AAGA,SAAS,YAAY,OAAc,MAAa,IAAmB;AACjE,QAAM,IAAI,KAAK,MAAM,KAAK,IAAI,MAAM,GAAG,KAAK,IAAI,MAAM,CAAC;AACvD,QAAM,IAAI,KAAK,MAAM,GAAG,IAAI,MAAM,GAAG,GAAG,IAAI,MAAM,CAAC;AACnD,MAAI,IAAI,KAAK,IAAI,IAAI,CAAC,IAAI,MAAM,KAAK;AACrC,MAAI,IAAI,IAAK,KAAI,MAAM;AACvB,SAAO;AACT;AAEA,IAAM,MAAM,CAAC,MAAa,GAAG,EAAE,EAAE,QAAQ,CAAC,CAAC,IAAI,EAAE,EAAE,QAAQ,CAAC,CAAC;AAC7D,IAAM,OAAO,CAAC,GAAU,MAAa,KAAK,IAAI,EAAE,IAAI,EAAE,CAAC,KAAK,QAAQ,KAAK,IAAI,EAAE,IAAI,EAAE,CAAC,KAAK;AAE3F,SAAS,cAAc,SAA+B;AACpD,QAAM,SAAS,oBAAI,IAA6C;AAChE,aAAW,MAAM,SAAS;AACxB,UAAM,IAAI,IAAI,GAAG,KAAK;AACtB,UAAM,QAAQ,OAAO,IAAI,CAAC;AAC1B,QAAI,MAAO,OAAM;AAAA,QACZ,QAAO,IAAI,GAAG,EAAE,OAAO,GAAG,OAAO,OAAO,EAAE,CAAC;AAAA,EAClD;AACA,MAAI,OAAwC,EAAE,OAAO,QAAQ,CAAC,EAAE,OAAO,OAAO,EAAE;AAChF,aAAW,SAAS,OAAO,OAAO,GAAG;AACnC,QAAI,MAAM,QAAQ,KAAK,MAAO,QAAO;AAAA,EACvC;AACA,SAAO,KAAK;AACd;AAEA,SAAS,KAAK,GAAU,GAAkB;AACxC,SAAO,KAAK,MAAM,EAAE,IAAI,EAAE,MAAM,KAAK,EAAE,IAAI,EAAE,MAAM,CAAC;AACtD;AAUA,SAAS,iBAAiB,OAAqB,OAAmC;AAChF,QAAM,WAAW,MAAM,KAAK,kBAAkB;AAC9C,MAAI,aAAa,OAAW,QAAO;AACnC,QAAM,SAAS,aAAa,QAAQ,EAAE,KACnC,IAAI,CAAC,OAAO,EAAE,IAAI,EAAE,IAAI,WAAW,WAAW,EAAE,aAAa,EAAE,EAAE,EAAE,EACnE,OAAO,CAAC,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,EACjC,KAAK,CAAC,GAAG,MAAM,EAAE,YAAY,EAAE,SAAS;AAC3C,QAAM,OAAO,OAAO,KAAK,CAAC,MAAM,EAAE,OAAO,KAAK,GAAG;AACjD,MAAI,SAAS,OAAW,QAAO;AAC/B,QAAM,OAAO,IAAI,IAAI,OAAO,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC;AAC3D,QAAMC,OAAM,oBAAI,IAAY;AAC5B,aAAW,SAASD,kBAAiB;AACnC,UAAM,MAAM,MAAM,KAAK,UAAU,KAAK,MAAM;AAC5C,UAAM,KAAK,OAAO,OAAO,UAAU,KAAK,UAAU;AAClD,QAAI,QAAQ,UAAa,CAAC,GAAI;AAC9B,UAAM,QAAQ,oBAAI,IAAqC;AACvD,eAAW,KAAK,GAAG,SAAU,OAAM,IAAI,OAAO,EAAE,YAAY,MAAM,EAAE,GAAI,EAAE,cAAc,CAAC,CAA6B;AACtH,eAAW,OAAO,aAAa,GAAG,EAAE,MAAM;AACxC,YAAM,OAAO,KAAK,IAAI,IAAI,iBAAiB,EAAE;AAC7C,UAAI,SAAS,QAAW;AAAE,QAAAC,KAAI,IAAI,IAAI,EAAE;AAAG;AAAA,MAAU;AACrD,YAAM,IAAI,MAAM,IAAI,IAAI,EAAE,KAAK,CAAC;AAChC,YAAM,QAAQ,OAAO,KAAK,CAAC,MAAM,EAAE,YAAY,OAAO,IAAI;AAC1D,YAAM,WAAW,KAAK,IAAI,IAAI,gBAAgB,EAAE,KAAK,OAAO;AAC5D,YAAM,SAAS,QAAQ,OAAO,EAAE,WAAW,KAAK;AAChD,YAAM,MAAM,aAAa,SAAY,WAAW,YAAY,OAAO,EAAE,UAAU,KAAK;AACpF,UAAI,UAAU,OAAO,aAAa,MAAM,OAAO,UAAW,CAAAA,KAAI,IAAI,IAAI,EAAE;AAAA,IAC1E;AAAA,EACF;AACA,SAAOA;AACT;AAEA,SAAS,iBAAiB,OAAqB,KAAa,MAAsC;AAChG,QAAM,WAAsB,CAAC;AAC7B,aAAW,SAASD,kBAAiB;AACnC,UAAM,KAAK,OAAO,OAAO,GAAG,GAAG,IAAI,KAAK,UAAU;AAClD,QAAI,CAAC,GAAI;AACT,QAAI;AACF,iBAAW,KAAK,GAAG,UAAU;AAC3B,YAAI,EAAE,SAAS,SAAS,aAAc;AACtC,cAAM,KAAK,OAAO,EAAE,YAAY,MAAM,EAAE;AACxC,YAAI,CAAC,MAAO,QAAQ,CAAC,KAAK,IAAI,EAAE,EAAI;AACpC,cAAM,KAAK,oBAAoB,CAAC;AAChC,YAAI,GAAG,SAAS,UAAW;AAC3B,iBAAS,KAAK,EAAE,QAAQ,GAAG,SAAS,QAAQ,GAAG,SAAS,MAAM,GAAG,OAAO,MAAM,GAAG,OAAO,GAAG,CAAC;AAAA,MAC9F;AAAA,IACF,QAAQ;AAAA,IAAa;AAAA,EACvB;AACA,SAAO;AACT;AASO,SAAS,iBAAiB,OAAqB,OAA2B;AAC/E,QAAM,WAAW,MAAM,KAAK,GAAG,KAAK,YAAY;AAChD,MAAI,aAAa,OAAW,QAAO,EAAE,UAAU,CAAC,GAAG,OAAO,KAAK;AAC/D,QAAM,OAAO,aAAa,QAAQ,EAAE;AACpC,MAAI,KAAK,WAAW,EAAG,QAAO,EAAE,UAAU,CAAC,GAAG,OAAO,KAAK;AAE1D,QAAM,WAAW,iBAAiB,OAAO,KAAK;AAC9C,WAAS,KAAK,GAAG,iBAAiB,OAAO,UAAU,iBAAiB,OAAO,KAAK,CAAC,CAAC;AAClF,MAAI,SAAS,WAAW,GAAG;AACzB,WAAO,EAAE,UAAU,CAAC,GAAG,KAAK,8DAA8D,GAAG,OAAO,KAAK;AAAA,EAC3G;AACA,QAAM,QAAQ,KAAK,IAAI,CAAC,SAAS;AAAA,IAC/B,IAAI,IAAI;AAAA,IAAI,GAAG,WAAW,IAAI,KAAK,EAAE;AAAA,IAAG,GAAG,WAAW,IAAI,KAAK,EAAE;AAAA,IAAG,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC;AAAA,EACxF,EAAE;AACF,QAAM,QAAQ,YAAY,OAAO,UAAU,OAAO,eAAe,KAAK,CAAC;AACvE,SAAO,EAAE,UAAU,MAAM,UAAU,MAAM;AAC3C;;;AJlPO,SAAS,uBACd,UACA,WACqB;AACrB,QAAM,OAAOE,SAAQ,SAAS,IAAI;AAClC,QAAM,MAAM,SAAS,IAAI;AACzB,QAAM,QAAsB,YAAY,MAAM,EAAE,MAAM,CAAC,MAAO,EAAE,WAAW,SAAS,IAAI,SAAY,IAAI,KAAK,CAAC,GAAI,OAAO,IAAI,MAAM;AACnI,QAAM,EAAE,UAAU,MAAM,IAAI,iBAAiB,OAAO,SAAS,IAAI;AACjE,QAAM,aAA0B,QAAQ,CAAC,GAAG,MAAM,UAAU,IAAI,CAAC;AACjE,MAAI,CAAC,SAAS,MAAM,QAAQ,SAAS,EAAG,QAAO,EAAE,UAAU,gBAAgB,OAAO,WAAW;AAG7F,QAAM,QAAQ,qBAAqB,SAAS,IAAI;AAChD,MAAI,UAAW,OAAM,KAAK,GAAG,qBAAqB,SAAS,CAAC;AAE5D,QAAM,YAAY,IAAI,IAAI,MAAM,WAAW,OAAO,CAAC,MAAM,EAAE,SAAS,QAAQ,EAAE,QAAQ,CAAC,MAAM,EAAE,SAAS,MAAM,CAAC,CAAC,CAAC;AACjH,WAAS,SAAS,MAAM,MAAM,SAAS,OAAO,cAAc,aAAa,IAAI,CAAC,GAAG,SAAS;AAC1F,SAAO,EAAE,UAAU,gBAAgB,MAAM,WAAW;AACtD;AAIA,SAAS,SAAS,WAAmB,eAAkC,OAAuB,KAAa,WAA8B;AACvI,QAAMC,YAA6B,CAAC;AACpC,aAAW,CAAC,SAAS,IAAI,KAAK,eAAe;AAE3C,UAAM,OAAO,KAAK,QAAQ,IAAI,CAAC,MAAM;AAAA,MACnC,OAAO,EAAE,EAAE,QAAQ,CAAC,CAAC;AAAA,MACrB,OAAO,EAAE,EAAE,QAAQ,CAAC,CAAC;AAAA,IACvB,CAAqB;AACrB,QAAI,KAAK,WAAW,EAAG;AACvB,UAAM,QAAQ,KAAK,CAAC,GAAG,OAAO,KAAK,KAAK,SAAS,CAAC;AAClD,QAAI,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,MAAM,CAAC,MAAM,KAAK,CAAC,EAAG,MAAK,KAAK,CAAC,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;AAChF,IAAAA,UAAS,KAAK;AAAA,MACZ,MAAM;AAAA,MACN,YAAY,UAAU,IAAI,OAAO,IAC7B,EAAE,IAAI,SAAS,UAAU,GAAG,WAAW,KAAK,IAC5C,EAAE,IAAI,SAAS,UAAU,OAAO,YAAY,KAAK,SAAS,OAAO,GAAG,EAAE,QAAQ,CAAC,CAAC,EAAE;AAAA,MACtF,UAAU,EAAE,MAAM,WAAW,aAAa,CAAC,IAAI,EAAE;AAAA,IACnD,CAAC;AAAA,EACH;AACA,QAAM,KAA+B,EAAE,MAAM,qBAAqB,UAAAA,UAAS;AAC3E,gBAAcC,MAAK,WAAW,eAAe,GAAG,2BAA2B,EAAE,GAAG,OAAO;AACzF;;;AKxEA,SAAS,cAAAC,mBAAkB;AAC3B,SAAS,WAAAC,UAAS,QAAAC,aAAY;AAU9B,IAAMC,aAAY;AAGlB,IAAMC,mBAAkB,CAAC,QAAQ,kBAAkB,gBAAgB,gBAAgB;AAE5E,SAAS,iBAAiB,KAAuB;AACtD,QAAM,WAAqB,CAAC;AAC5B,QAAM,SAAS,eAAe,GAAG;AAEjC,QAAM,OAAO,aAAa,GAAG;AAE7B,QAAM,UAAU;AAAA,IACd,EAAE,MAAM,UAAU,MAAM,OAAO,UAAU;AAAA,IACzC,GAAG,OAAO;AAAA,EACZ;AAGA,QAAM,iBAAiB,oBAAI,IAAgC;AAC3D,aAAW,KAAK,SAAS;AACvB,QAAI,CAACC,YAAW,EAAE,IAAI,EAAG;AACzB,eAAW,SAAS,CAAC,QAAQ,kBAAkB,cAAc,GAAG;AAC9D,YAAM,WAAW,mBAAmB,KAAK;AACzC,UAAI,CAAC,SAAU;AACf,YAAM,OAAOC,MAAK,EAAE,MAAM,GAAG,QAAQ,UAAU;AAC/C,UAAI,CAACD,YAAW,IAAI,EAAG;AACvB,UAAI;AACF,cAAM,KAAK,iBAAiB,IAAI;AAChC,mBAAW,KAAK,GAAG,UAAU;AAC3B,cAAI,EAAE,SAAS,SAAS,aAAc;AACtC,gBAAM,KAAK,OAAO,EAAE,YAAY,MAAM,EAAE;AACxC,cAAI,CAAC,GAAI;AACT,gBAAM,KAAK,oBAAoB,CAAC;AAChC,yBAAe,IAAI,IAAI,EAAE,QAAQ,GAAG,OAAO,CAAC;AAAA,QAC9C;AAAA,MACF,QAAQ;AAAA,MAAa;AAAA,IACvB;AAAA,EACF;AAGA,aAAW,KAAK,CAAC,GAAG,OAAO,SAAS,GAAG;AACrC,QAAI,CAACA,YAAW,EAAE,IAAI,EAAG;AAGzB,aAAS,KAAK,GAAG,yBAAyB,GAAG,IAAI,CAAC;AAGlD,aAAS,KAAK,GAAG,qBAAqB,GAAG,gBAAgB,IAAI,CAAC;AAG9D,aAAS,KAAK,GAAG,sBAAsB,GAAG,IAAI,CAAC;AAG/C,aAAS,KAAK,GAAG,oBAAoB,GAAG,IAAI,CAAC;AAAA,EAC/C;AAEA,SAAO;AACT;AAKA,IAAM,cAAc;AACpB,IAAM,gBAAgB,CAAC,UAAU,kBAAkB;AASnD,SAAS,yBAAyB,UAA0C,MAAwB;AAClG,QAAM,WAAqB,CAAC;AAM5B,QAAM,YAAwB,CAAC;AAC/B,QAAM,WAAsB,CAAC;AAC7B,QAAM,UAAiB,CAAC;AAExB,QAAM,UAAU,CAAC,UAAuD;AACtE,UAAM,IAAI,oBAAI,IAAoC;AAClD,UAAM,IAAIC,MAAK,SAAS,MAAM,GAAG,KAAK,MAAM;AAC5C,QAAI,CAACD,YAAW,CAAC,EAAG,QAAO;AAC3B,QAAI;AAAE,iBAAW,KAAK,cAAcE,SAAQ,SAAS,IAAI,GAAG,OAAO,QAAQ,CAAC,EAAE,IAAI,EAAG,KAAI,EAAE,GAAI,GAAE,IAAI,EAAE,IAAI,CAAC;AAAA,IAAG,QAAQ;AAAA,IAAa;AACpI,WAAO;AAAA,EACT;AAEA,aAAW,SAASH,kBAAiB;AACnC,UAAM,WAAW,mBAAmB,KAAK;AACzC,QAAI,CAAC,SAAU;AACf,UAAM,OAAOE,MAAK,SAAS,MAAM,GAAG,QAAQ,UAAU;AACtD,QAAI,CAACD,YAAW,IAAI,EAAG;AACvB,UAAM,QAAQ,QAAQ,KAAK;AAC3B,QAAI;AACF,YAAM,KAAK,iBAAiB,IAAI;AAChC,iBAAW,KAAK,GAAG,UAAU;AAC3B,YAAI,EAAE,SAAS,SAAS,aAAc;AACtC,cAAM,KAAK,OAAO,EAAE,YAAY,MAAM,EAAE;AACxC,YAAI,CAAC,GAAI;AACT,cAAM,KAAK,oBAAoB,CAAC;AAChC,cAAM,IAAI,WAAW,MAAM,IAAI,EAAE,GAAG,aAAa,EAAE,KAAK;AACxD,kBAAU,KAAK,EAAE,GAAG,GAAG,SAAS,GAAG,GAAG,SAAS,MAAM,SAAS,WAAW,IAAI,MAAM,CAAC;AACpF,kBAAU,KAAK,EAAE,GAAG,GAAG,OAAO,GAAG,GAAG,OAAO,MAAM,OAAO,WAAW,IAAI,MAAM,CAAC;AAC9E,cAAM,MAAM,EAAE,YAAY,MAAM,YAAY,EAAE,OAAO,EAAE,GAAG,GAAG,SAAS,GAAG,GAAG,QAAQ,GAAG,KAAK,EAAE,GAAG,GAAG,OAAO,GAAG,GAAG,MAAM,GAAG,KAAK,EAAE,WAAW,IAA8D,CAAC,IAAI;AAC/M,iBAAS,KAAK,EAAE,IAAI,GAAG,SAAS,IAAI,GAAG,SAAS,IAAI,GAAG,OAAO,IAAI,GAAG,OAAO,MAAM,IAAI,GAAG,WAAW,IAAI,OAAO,IAAI,CAAC;AAAA,MACtH;AAAA,IACF,QAAQ;AAAA,IAAa;AAAA,EACvB;AAEA,aAAW,SAAS,eAAe;AACjC,UAAM,WAAW,mBAAmB,KAAK;AACzC,QAAI,CAAC,SAAU;AACf,UAAM,OAAOC,MAAK,SAAS,MAAM,GAAG,QAAQ,UAAU;AACtD,QAAI,CAACD,YAAW,IAAI,EAAG;AACvB,UAAM,QAAQ,QAAQ,KAAK;AAC3B,QAAI;AACF,YAAM,KAAK,iBAAiB,IAAI;AAChC,iBAAW,KAAK,GAAG,UAAU;AAC3B,YAAI,EAAE,SAAS,SAAS,QAAS;AACjC,cAAM,CAAC,GAAG,CAAC,IAAI,EAAE,SAAS;AAC1B,cAAM,IAAI,MAAM,IAAI,OAAO,EAAE,YAAY,MAAM,EAAE,CAAC;AAClD,cAAM,KAAK,WAAW,GAAG,UAAU,EAAE,KAAK;AAC1C,cAAM,KAAK,WAAW,GAAG,UAAU,EAAE,KAAK;AAC1C,cAAM,IAAI,KAAK,IAAI,IAAI,EAAE,IAAI;AAC7B,gBAAQ,KAAK,EAAE,IAAI,IAAI,GAAG,IAAI,IAAI,GAAG,IAAI,IAAI,GAAG,IAAI,IAAI,EAAE,CAAC;AAAA,MAC7D;AAAA,IACF,QAAQ;AAAA,IAAa;AAAA,EACvB;AAGA,QAAM,eAA6B,CAAC;AACpC;AACE,UAAM,OAAOC,MAAK,SAAS,MAAM,iBAAiB;AAClD,UAAM,QAAQ,QAAQ,MAAM;AAC5B,UAAM,OAAO,QAAQ,SAAS;AAC9B,QAAID,YAAW,IAAI,KAAK,MAAM,OAAO,GAAG;AACtC,UAAI;AACF,mBAAW,KAAK,iBAAiB,IAAI,EAAE,UAAU;AAC/C,cAAI,EAAE,SAAS,SAAS,UAAW;AACnC,gBAAM,OAAO,KAAK,IAAI,OAAO,EAAE,YAAY,MAAM,EAAE,CAAC,GAAG,WAAW;AAClE,cAAI,MAAM,IAAI,IAAI,EAAG,cAAa,KAAM,EAAE,SAAS,YAA6B,CAAC,KAAK,CAAC,CAAC;AAAA,QAC1F;AAAA,MACF,QAAQ;AAAA,MAAa;AAAA,IACvB;AAAA,EACF;AAEA,QAAMG,QAAO,CAAC,GAAyC,MACrD,EAAE,cAAc,EAAE,aAAa,EAAE,UAAU,EAAE;AAE/C,aAAW,MAAM,WAAW;AAC1B,UAAM,aAAa,UAAU;AAAA,MAC3B,CAAC,MAAM,MAAM,MAAM,CAACA,MAAK,GAAG,EAAE,KAAK,KAAK,IAAI,EAAE,IAAI,GAAG,CAAC,IAAIL,cAAa,KAAK,IAAI,EAAE,IAAI,GAAG,CAAC,IAAIA;AAAA,IAChG;AACA,QAAI,WAAY;AAEhB,UAAM,SAAS,SAAS,KAAK,CAAC,QAAQ,CAACK,MAAK,KAAK,EAAE,MAAM,IAAI,MACzD,aAAa,GAAG,GAAG,GAAG,GAAG,IAAI,KAAK,KAAK,IAAI,IAAI,MAAML,UAAS,IAAI,WAAW,IAC7E,iBAAiB,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK,IAAI,IAAI,MAAMA,UAAS,IAAI,WAAW,EAAE;AAC9G,QAAI,OAAQ;AAEZ,UAAM,WAAW,QAAQ,KAAK,CAAC,MAC7B,GAAG,KAAK,EAAE,KAAK,eAAe,GAAG,KAAK,EAAE,KAAK,eAAe,GAAG,KAAK,EAAE,KAAK,eAAe,GAAG,KAAK,EAAE,KAAK,WAAW;AACtH,QAAI,SAAU;AAEd,UAAM,gBAAgB,aAAa,KAAK,UAAQ,KAAK,KAAK,CAAC,GAAG,MAAM;AAClE,YAAM,IAAI,MAAM,IAAI,KAAK,KAAK,MAAM;AACpC,aAAO,iBAAiB,GAAG,GAAG,GAAG,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,GAAGA,aAAY,WAAW;AAAA,IACrF,CAAC,CAAC;AACF,QAAI,cAAe;AAEnB,QAAI,cAAc;AAClB,QAAI,YAAY;AAChB,QAAI,cAAc;AAClB,eAAW,SAAS,WAAW;AAC7B,UAAI,UAAU,MAAMK,MAAK,OAAO,EAAE,EAAG;AACrC,YAAM,IAAI,KAAK,MAAM,MAAM,IAAI,GAAG,GAAG,MAAM,IAAI,GAAG,CAAC;AACnD,UAAI,IAAI,aAAa;AAAE,sBAAc;AAAG,oBAAY,MAAM;AAAW,sBAAc,MAAM;AAAA,MAAM;AAAA,IACjG;AACA,UAAM,cAAc,cAAc,WAAW,cAAc,SAAS,IAAI,WAAW,cAAc,YAAY,QAAQ,CAAC,CAAC,IAAI,IAAI,MAAM;AACrI,aAAS;AAAA,MACP,UAAU,SAAS,IAAI,IAAI,GAAG,KAAK,aAAa,GAAG,SAAS,IAAI,GAAG,IAAI,KAAK,GAAG,EAAE,QAAQ,CAAC,CAAC,KAAK,GAAG,EAAE,QAAQ,CAAC,CAAC,kCAAkC,WAAW;AAAA,IAC9J;AAAA,EACF;AAEA,SAAO;AACT;AAIA,SAAS,aAAa,IAAY,IAAY,GAAgB,KAAsB;AAClF,MAAI,KAAK,IAAI,KAAK,MAAM,KAAK,EAAE,IAAI,KAAK,EAAE,EAAE,IAAI,EAAE,CAAC,IAAI,IAAK,QAAO;AACnE,QAAM,MAAM,IAAI,KAAK;AACrB,QAAM,MAAQ,KAAK,MAAM,KAAK,EAAE,IAAI,KAAK,EAAE,EAAE,IAAI,EAAE,MAAM,KAAK,KAAK,EAAE,KAAK,IAAK,MAAO,OAAO;AAC7F,QAAM,QAAQ,MAAM,KAAK,IAAI,EAAE,GAAG,IAAI;AACtC,SAAO,KAAK,KAAK,IAAI,EAAE,KAAK,IAAI,SAAS,KAAK,MAAM;AACtD;AAEA,SAAS,iBAAiB,IAAY,IAAY,IAAY,IAAY,IAAY,IAAY,KAAsB;AACtH,QAAM,KAAK,KAAK,IAAI,KAAK,KAAK;AAC9B,QAAM,MAAM,KAAK,MAAM,IAAI,EAAE;AAC7B,MAAI,MAAM,KAAM,QAAO;AACvB,QAAM,KAAK,KAAK,KAAK,KAAK,KAAK;AAC/B,QAAM,SAAS,KAAK,MAAM,MAAM,KAAK,MAAM;AAC3C,MAAI,QAAQ,CAAC,OAAO,QAAQ,MAAM,IAAK,QAAO;AAC9C,QAAM,SAAS,KAAK,IAAI,EAAE,KAAK,MAAM,MAAM,KAAK,MAAM,EAAE;AACxD,SAAO,UAAU;AACnB;AAIA,SAAS,qBACP,UACA,gBACA,MACU;AACV,QAAM,WAAqB,CAAC;AAE5B,aAAW,aAAa,CAAC,QAAQ,QAAQ,GAAG;AAC1C,UAAM,UAAUF,MAAK,SAAS,MAAM,GAAG,SAAS,MAAM;AACtD,QAAI,CAACD,YAAW,OAAO,EAAG;AAE1B,UAAM,OAAO,cAAcE,SAAQ,SAAS,IAAI,GAAG,WAAW,QAAQ,OAAO,EAAE,IAAI;AACnF,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,YAAM,MAAM,KAAK,CAAC;AAClB,YAAM,SAAS,IAAI;AACnB,YAAM,WAAW,WAAW,IAAI,YAAY,EAAE;AAC9C,YAAM,QAAQ,WAAW,IAAI,SAAS,EAAE;AAExC,UAAI,CAAC,UAAU,MAAM,QAAQ,KAAK,MAAM,KAAK,EAAG;AAEhD,YAAM,UAAU,eAAe,IAAI,MAAM;AACzC,UAAI,CAAC,QAAS;AAEd,YAAM,YAAY,QAAQ;AAC1B,UAAI,WAAW,YAAY,CAACJ,YAAW;AACrC,iBAAS;AAAA,UACP,UAAU,SAAS,IAAI,IAAI,SAAS,QAAQ,IAAI,CAAC,KAAK,IAAI,EAAE,wBAAwB,MAAM,oBAAoB,QAAQ,eAAe,UAAU,QAAQ,CAAC,CAAC,QAAQ,WAAW,WAAW,QAAQ,CAAC,CAAC,IAAI,IAAI;AAAA,QAC3M;AAAA,MACF;AACA,UAAI,WAAW,YAAY,QAAQ,SAASA,YAAW;AACrD,iBAAS;AAAA,UACP,UAAU,SAAS,IAAI,IAAI,SAAS,QAAQ,IAAI,CAAC,KAAK,IAAI,EAAE,sBAAsB,MAAM,kBAAkB,QAAQ,eAAe,UAAU,QAAQ,CAAC,CAAC,QAAQ,WAAW,WAAW,QAAQ,CAAC,CAAC,IAAI,IAAI,kBAAkB,QAAQ,OAAO,QAAQ,CAAC,CAAC,IAAI,IAAI;AAAA,QAC1P;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;AAKA,IAAM,kBAAoE;AAAA,EACxE,MAAM,EAAE,MAAM,GAAG,QAAQ,IAAI;AAAA,EAAG,QAAQ,EAAE,MAAM,KAAK,QAAQ,IAAI;AAAA,EAAG,SAAS,EAAE,MAAM,GAAG,QAAQ,IAAI;AACtG;AAEA,SAAS,sBAAsB,UAA0C,MAAwB;AAC/F,QAAM,UAAyB,CAAC;AAChC,aAAW,aAAa,CAAC,QAAQ,UAAU,SAAS,GAAG;AACrD,UAAM,UAAUG,MAAK,SAAS,MAAM,GAAG,SAAS,MAAM;AACtD,QAAI,CAACD,YAAW,OAAO,EAAG;AAC1B,UAAM,OAAO,cAAcE,SAAQ,SAAS,IAAI,GAAG,WAAW,QAAQ,OAAO,EAAE,IAAI;AACnF,UAAM,IAAI,gBAAgB,SAAS;AACnC,eAAW,OAAO,MAAM;AACtB,YAAM,WAAW,WAAW,IAAI,YAAY,EAAE;AAC9C,YAAM,QAAQ,WAAW,IAAI,SAAS,EAAE;AACxC,UAAI,CAAC,IAAI,WAAW,MAAM,QAAQ,KAAK,MAAM,KAAK,EAAG;AACrD,YAAM,OAAO,IAAI,gBAAgB,UAAa,IAAI,gBAAgB,KAAK,WAAW,IAAI,WAAW,KAAK,IAAI,EAAE;AAC5G,YAAM,SAAS,WAAW,IAAI,UAAU,EAAE,KAAK,EAAE;AACjD,cAAQ,KAAK,EAAE,IAAI,IAAI,IAAI,OAAO,SAAS,MAAM,OAAO,WAAW,QAAQ,IAAI,SAAS,UAAU,OAAO,MAAM,OAAO,CAAC;AAAA,IACzH;AAAA,EACF;AACA,SAAO,eAAe,SAASJ,YAAW,IAAI,EAAE,IAAI,CAAC,MAAM,UAAU,SAAS,IAAI,MAAM,EAAE,OAAO,EAAE;AACrG;AAIA,SAAS,oBAAoB,UAA0C,MAAwB;AAC7F,QAAM,QAAqB,CAAC;AAC5B,aAAW,SAAS,CAAC,QAAQ,gBAAgB,GAAG;AAC9C,UAAM,WAAW,mBAAmB,KAAK;AACzC,UAAM,OAAOG,MAAK,SAAS,MAAM,GAAG,QAAQ,UAAU;AACtD,QAAI,CAAC,YAAY,CAACD,YAAW,IAAI,EAAG;AACpC,UAAM,YAAY,oBAAI,IAAoB;AAC1C,UAAM,UAAUC,MAAK,SAAS,MAAM,GAAG,KAAK,MAAM;AAClD,QAAID,YAAW,OAAO,GAAG;AACvB,UAAI;AAAE,mBAAW,KAAK,cAAcE,SAAQ,SAAS,IAAI,GAAG,OAAO,QAAQ,OAAO,EAAE,IAAI,EAAG,WAAU,IAAI,EAAE,IAAI,WAAW,EAAE,aAAa,EAAE,KAAK,CAAC;AAAA,MAAG,QAAQ;AAAA,MAAa;AAAA,IAC3K;AACA,QAAI;AACF,iBAAW,KAAK,iBAAiB,IAAI,EAAE,UAAU;AAC/C,YAAI,EAAE,SAAS,SAAS,gBAAgB,EAAE,YAAY,IAAK;AAC3D,cAAM,KAAK,OAAO,EAAE,YAAY,MAAM,EAAE;AACxC,YAAI,CAAC,GAAI;AACT,cAAM,KAAK,oBAAoB,CAAC;AAChC,cAAM,KAAK,EAAE,IAAI,OAAO,SAAS,MAAM,OAAO,GAAG,EAAE,GAAG,GAAG,SAAS,GAAG,GAAG,QAAQ,GAAG,GAAG,EAAE,GAAG,GAAG,OAAO,GAAG,GAAG,MAAM,GAAG,WAAW,UAAU,IAAI,EAAE,KAAK,IAAI,CAAC;AAAA,MAC3J;AAAA,IACF,QAAQ;AAAA,IAAa;AAAA,EACvB;AACA,SAAO,aAAa,OAAOJ,YAAWA,aAAY,IAAI,IAAI,EAAE,IAAI,CAAC,MAAM,UAAU,SAAS,IAAI,MAAM,EAAE,OAAO,EAAE;AACjH;;;AC1TA,SAAS,cAAAM,mBAAkB;AAC3B,SAAS,QAAAC,aAAY;AAOrB,IAAM,cAAc;AAWpB,IAAM,gBAAgB,CAAC,QAAQ,UAAU,SAAS;AAQ3C,SAAS,oBAAoB,KAAuB;AACzD,QAAM,SAAmB,CAAC;AAC1B,QAAM,SAAS,eAAe,GAAG;AACjC,QAAM,QAAQ,aAAa,GAAG;AAC9B,QAAM,YAAY,gBAAgB,KAAK,WAAW;AAElD,QAAM,UAAU;AAAA,IACd,EAAE,MAAM,UAAU,MAAM,OAAO,UAAU;AAAA,IACzC,GAAG,OAAO;AAAA,EACZ;AAEA,aAAW,KAAK,SAAS;AACvB,QAAI,CAACC,YAAW,EAAE,IAAI,EAAG;AACzB,UAAM,QAAQ,UAAU,EAAE,IAAI;AAG9B,UAAM,QAAmB,CAAC;AAC1B,eAAW,SAAS,CAAC,QAAQ,kBAAkB,cAAc,GAAG;AAC9D,YAAM,WAAW,mBAAmB,KAAK;AACzC,UAAI,CAAC,SAAU;AACf,YAAM,OAAOC,MAAK,EAAE,MAAM,GAAG,QAAQ,UAAU;AAC/C,UAAI,CAACD,YAAW,IAAI,EAAG;AACvB,UAAI;AACF,cAAM,KAAK,iBAAiB,IAAI;AAChC,mBAAW,KAAK,GAAG,UAAU;AAC3B,cAAI,EAAE,SAAS,SAAS,aAAc;AACtC,gBAAM,KAAK,OAAO,EAAE,YAAY,MAAM,EAAE;AACxC,cAAI,CAAC,GAAI;AACT,gBAAM,KAAK,oBAAoB,CAAC;AAChC,gBAAM,KAAK;AAAA,YACT;AAAA,YACA,SAAS,GAAG;AAAA,YAAS,SAAS,GAAG;AAAA,YACjC,OAAO,GAAG;AAAA,YAAO,OAAO,GAAG;AAAA,YAC3B,QAAQ,GAAG;AAAA,UACb,CAAC;AAAA,QACH;AAAA,MACF,QAAQ;AAAA,MAAa;AAAA,IACvB;AAEA,QAAI,MAAM,WAAW,EAAG;AAGxB,eAAW,SAAS,eAAe;AACjC,YAAM,UAAUC,MAAK,EAAE,MAAM,GAAG,KAAK,MAAM;AAC3C,UAAI,CAAC,MAAM,SAAS,GAAG,KAAK,MAAM,EAAG;AAErC,YAAM,MAAM,QAAQ,OAAO;AAC3B,YAAM,WAAW,IAAI,QAAQ,SAAS,QAAQ;AAC9C,YAAM,WAAW,IAAI,QAAQ,SAAS,QAAQ;AAC9C,UAAI,CAAC,YAAY,CAAC,SAAU;AAE5B,UAAI,WAAW;AAEf,eAAS,IAAI,GAAG,IAAI,IAAI,KAAK,QAAQ,KAAK;AACxC,cAAM,MAAM,IAAI,KAAK,CAAC;AACtB,cAAM,QAAQ,WAAW,IAAI,UAAU,EAAE;AACzC,cAAM,QAAQ,WAAW,IAAI,UAAU,EAAE;AAGzC,YAAI,MAAM,KAAK,KAAK,MAAM,KAAK,EAAG;AAGlC,cAAM,mBAAmB,WAAW,IAAI,YAAY,EAAE;AACtD,YAAI,CAAC,MAAM,gBAAgB,KAAK,IAAI,aAAa,GAAI;AAGrD,cAAM,QAAQ,gBAAgB,OAAO,OAAO,OAAO,WAAW,IAAI,OAAO;AAEzE,YAAI,CAAC,OAAO;AACV,iBAAO;AAAA,YACL,GAAG,EAAE,IAAI,IAAI,KAAK,QAAQ,IAAI,CAAC,KAAK,IAAI,EAAE,WAAW,KAAK,YAAY,KAAK,gCAA2B,CAAC,UAAU,YAAY,CAAC,CAAC,IAAI,KAAK;AAAA,UAC1I;AACA;AAAA,QACF;AAGA,YAAI,WAAW,MAAM,SAAS,QAAQ,CAAC;AACvC,YAAI,CAAC,IAAI,WAAW,IAAI,YAAY,IAAI;AACtC,cAAI,UAAU,MAAM;AAAA,QACtB;AACA,mBAAW;AAAA,MACb;AAEA,UAAI,UAAU;AAEZ,cAAM,eAAe,IAAI,QAAQ,OAAO,OAAK,MAAM,YAAY,MAAM,QAAQ;AAC7E,YAAI,CAAC,aAAa,SAAS,SAAS,GAAG;AAErC,gBAAM,QAAQ,aAAa,QAAQ,IAAI;AACvC,uBAAa,OAAO,QAAQ,GAAG,GAAG,SAAS;AAAA,QAC7C;AACA,YAAI,CAAC,aAAa,SAAS,UAAU,GAAG;AACtC,gBAAM,UAAU,aAAa,QAAQ,SAAS;AAC9C,uBAAa,OAAO,UAAU,GAAG,GAAG,UAAU;AAAA,QAChD;AACA,cAAM,YAAY,IAAI,KAAK,IAAI,SAAO;AACpC,gBAAM,QAAgC,CAAC;AACvC,qBAAW,KAAK,cAAc;AAC5B,gBAAI,IAAI,CAAC,MAAM,OAAW,OAAM,CAAC,IAAI,IAAI,CAAC;AAAA,UAC5C;AACA,iBAAO;AAAA,QACT,CAAC;AACD,iBAAS,SAAS,EAAE,SAAS,cAAc,MAAM,UAAU,CAAC;AAAA,MAC9D;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;AAEA,SAAS,gBACP,IACA,IACA,OACA,WACA,iBAC6C;AAC7C,MAAI,aAAa;AACjB,MAAI,eAAe;AACnB,MAAI,WAAW;AAEf,aAAW,QAAQ,OAAO;AACxB,UAAM,KAAK,KAAK,QAAQ,KAAK;AAC7B,UAAM,KAAK,KAAK,QAAQ,KAAK;AAC7B,UAAM,QAAQ,KAAK,KAAK,KAAK;AAC7B,QAAI,QAAQ,MAAO;AAGnB,UAAM,MAAM,KAAK,KAAK,WAAW,MAAM,KAAK,KAAK,WAAW,MAAM;AAClE,UAAM,WAAW,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,CAAC,CAAC;AAE3C,UAAM,WAAW,KAAK,UAAU,WAAW;AAC3C,UAAM,WAAW,KAAK,UAAU,WAAW;AAC3C,UAAMC,QAAO,KAAK,MAAM,KAAK,aAAa,KAAK,KAAK,aAAa,CAAC;AAGlE,QAAI,mBAAmB,oBAAoB,IAAI;AAC7C,UAAI,KAAK,OAAO,iBAAiB;AAC/B,eAAO,EAAE,QAAQ,KAAK,IAAI,UAAU,WAAW,KAAK,OAAO;AAAA,MAC7D;AACA;AAAA,IACF;AAEA,QAAIA,QAAO,UAAU;AACnB,iBAAWA;AACX,mBAAa,KAAK;AAClB,qBAAe,WAAW,KAAK;AAAA,IACjC;AAAA,EACF;AAEA,MAAI,WAAW,aAAa,CAAC,gBAAiB,QAAO;AACrD,MAAI,CAAC,WAAY,QAAO;AAExB,SAAO,EAAE,QAAQ,YAAY,UAAU,aAAa;AACtD;;;AC5KO,SAAS,cAAc,KAA2B;AACvD,QAAM,SAAS,eAAe,GAAG;AACjC,SAAO,qBAAqB,SAAS,GAAG,GAAG,CAAC,UAAU,GAAG,OAAO,UAAU,IAAI,OAAK,EAAE,IAAI,CAAC,CAAC;AAC7F;;;ACZA,SAAS,QAAAC,cAAY;AAMd,SAAS,oBAAoB,KAAuB;AACzD,QAAM,SAAS,eAAe,GAAG;AACjC,QAAM,UAAU,CAAC;AACjB,aAAW,KAAK,OAAO,WAAW;AAChC,UAAM,QAAQ,UAAU,EAAE,IAAI,EAAE,OAAO,OAAK,EAAE,SAAS,MAAM,CAAC;AAC9D,QAAI,CAAC,MAAM,SAAS,iBAAiB,EAAG;AACxC,eAAW,KAAK,OAAO;AACrB,UAAI;AACF,gBAAQ,KAAK,EAAE,MAAM,GAAG,EAAE,IAAI,IAAI,CAAC,IAAI,WAAW,EAAE,QAAQ,QAAQ,EAAE,GAAG,MAAM,QAAQC,OAAK,EAAE,MAAM,CAAC,CAAC,EAAE,CAAC;AAAA,MAC3G,QAAQ;AAAA,MAAiD;AAAA,IAC3D;AAAA,EACF;AACA,SAAO,cAAc,OAAO;AAC9B;;;ACnBA,SAAS,cAAAC,mBAAkB;AAC3B,SAAS,QAAAC,cAAY;AAKrB,IAAM,SAAiC,EAAE,MAAM,QAAQ,cAAc,QAAQ,QAAQ,UAAU,OAAO,QAAQ;AAOvG,SAAS,eAAe,KAAuB;AACpD,QAAM,SAAS,eAAe,GAAG;AACjC,QAAM,OAAO,oBAAI,IAAsB;AACvC,QAAM,OAAO,CAAC,EAAE,MAAM,UAAU,MAAM,OAAO,UAAU,GAAG,GAAG,OAAO,SAAS;AAC7E,aAAW,KAAK,MAAM;AACpB,eAAW,SAAS,OAAO,KAAK,MAAM,GAAG;AACvC,YAAM,OAAOC,OAAK,EAAE,MAAM,GAAG,KAAK,MAAM;AACxC,UAAI,CAACC,YAAW,IAAI,EAAG;AACvB,UAAI;AACJ,UAAI;AAAE,eAAO,QAAQ,IAAI,EAAE;AAAA,MAAM,QAAQ;AAAE;AAAA,MAAU;AACrD,WAAK,QAAQ,CAAC,KAAK,MAAM;AACvB,cAAM,QAAQ,UAAU,kBAAkB,IAAI,gBAAgB,IAAI,MAAM,GAAG,IAAI,CAAC,IAAI,UAAU,EAAE;AAChG,mBAAW,OAAO,OAAO;AACvB,gBAAM,IAAI,IAAI,KAAK;AACnB,cAAI,CAAC,EAAG;AACR,gBAAM,IAAI,GAAG,OAAO,KAAK,CAAC,IAAI,CAAC;AAC/B,gBAAM,KAAK,GAAG,EAAE,IAAI,IAAI,KAAK,QAAQ,IAAI,CAAC;AAC1C,gBAAM,OAAO,KAAK,IAAI,CAAC;AACvB,cAAI,KAAM,MAAK,KAAK,EAAE;AAAA,cAAQ,MAAK,IAAI,GAAG,CAAC,EAAE,CAAC;AAAA,QAChD;AAAA,MACF,CAAC;AAAA,IACH;AAAA,EACF;AACA,QAAM,MAAgB,CAAC;AACvB,aAAW,CAAC,GAAG,EAAE,KAAK,MAAM;AAC1B,QAAI,GAAG,SAAS,EAAG;AACnB,UAAM,CAAC,OAAO,CAAC,IAAI,EAAE,MAAM,GAAG;AAC9B,QAAI,KAAK,GAAG,GAAG,CAAC,CAAC,KAAK,KAAK,YAAY,CAAC,aAAa,GAAG,MAAM,WAAW,GAAG,KAAK,IAAI,CAAC,GAAG;AAAA,EAC3F;AACA,SAAO;AACT;;;ACtCA,SAAS,cAAAC,oBAAkB;AAC3B,SAAS,QAAAC,cAAY;AAOrB,IAAM,cAAc,CAAC,aAAa,SAAS,UAAU,UAAU,UAAU,QAAQ;AAEjF,IAAM,OAAO,oBAAI,IAAI,CAAC,aAAa,SAAS,CAAC;AAC7C,IAAM,SAAS,CAAC,QAAQ,QAAQ;AAChC,IAAM,OAAO;AAIb,SAAS,OAAO,MAAwC;AACtD,MAAI,CAACC,aAAW,IAAI,EAAG,QAAO,CAAC;AAC/B,MAAI;AAAE,WAAO,QAAQ,IAAI,EAAE;AAAA,EAAM,QAAQ;AAAE,WAAO,CAAC;AAAA,EAAG;AACxD;AAGA,SAAS,aAAa,KAA6B,QAAkB,OAA+C;AAClH,SAAO,MAAM,KAAK,CAAC,MAAM;AACvB,UAAM,IAAI,WAAW,CAAC;AACtB,QAAI,QAAQ;AACZ,eAAW,KAAK,QAAQ;AACtB,YAAM,OAAO,IAAI,CAAC,KAAK,IAAI,KAAK;AAChC,UAAI,CAAC,IAAK;AACV,UAAI,EAAE,CAAC,MAAM,OAAW,QAAO;AAC/B,UAAI,CAAC,UAAU,KAAK,EAAE,CAAC,CAAC,EAAG,QAAO;AAClC,UAAI,YAAY,SAAS,CAAC,EAAG,SAAQ;AAAA,IACvC;AACA,WAAO;AAAA,EACT,CAAC;AACH;AAGA,IAAM,QAAQ,CAAC,MAAe,OAAO,SAAS,OAAO,CAAC,CAAC,IAAI,OAAO,KAAK,MAAM,OAAO,CAAC,IAAI,GAAG,IAAI,GAAG,IAAI;AACvG,IAAM,MAAM,CAAC,SAAgB,KAAK,MAAM,GAAG,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE,EAAE,EAAE,KAAK,IAAI,KAAK,KAAK,SAAS,OAAO,aAAQ;AAEtG,SAAS,eAAe,KAAuB;AACpD,QAAM,WAAW,cAAc,WAAW,CAAC;AAC3C,QAAM,SAAS,eAAe,GAAG;AACjC,QAAM,OAAO,CAAC,EAAE,MAAM,UAAU,MAAM,OAAO,UAAU,GAAG,GAAG,OAAO,SAAS;AAC7E,QAAM,UAAU,YAAY,GAAG;AAC/B,QAAM,MAAgB,CAAC;AAEvB,aAAW,CAAC,OAAO,GAAG,KAAK,CAAC,GAAG,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC,GAAG;AAC/E,QAAI,CAAC,IAAI,aAAa,KAAK,IAAI,KAAK,EAAG;AACvC,UAAM,SAAS,gBAAgB,KAAK;AACpC,UAAM,aAAa,OAAO,OAAO,CAAC,MAAM,YAAY,SAAS,CAAC,CAAC;AAC/D,QAAI,WAAW,WAAW,EAAG;AAC7B,UAAM,MAAa,CAAC;AACpB,eAAW,KAAK,MAAM;AACpB,iBAAW,OAAO,OAAOC,OAAK,EAAE,MAAM,GAAG,KAAK,MAAM,CAAC,GAAG;AACtD,YAAI,IAAI,WAAW,CAAC,WAAW,KAAK,CAAC,OAAO,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,EAAG;AACnE,YAAI,KAAK,EAAE,IAAI,GAAG,EAAE,IAAI,IAAI,IAAI,EAAE,IAAI,IAAI,IAAI,IAAI,IAAI,CAAC;AAAA,MACzD;AAAA,IACF;AACA,QAAI,IAAI,WAAW,EAAG;AAEtB,UAAM,QAAQ,CAAC,GAAG,QAAQ,MAAM,OAAO,CAAC,EAAE,OAAO,CAAC,MAAM,EAAE,UAAU,IAAI,SAAS;AACjF,UAAM,SAAS,oBAAI,IAAmB;AACtC,UAAM,YAAmB,CAAC;AAC1B,eAAW,KAAK,KAAK;AACnB,YAAM,IAAI,aAAa,EAAE,KAAK,QAAQ,KAAK;AAC3C,UAAI,CAAC,GAAG;AAAE,kBAAU,KAAK,CAAC;AAAG;AAAA,MAAU;AACvC,YAAM,OAAO,OAAO,IAAI,EAAE,EAAE;AAC5B,UAAI,KAAM,MAAK,KAAK,CAAC;AAAA,UAAQ,QAAO,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;AAAA,IACnD;AACA,UAAM,QAAkB,CAAC;AACzB,QAAI,OAAO,OAAO,GAAG;AACnB,YAAM,UAAU,CAAC,GAAG,MAAM,EAAE,IAAI,CAAC,CAAC,IAAI,IAAI,MAAM,GAAG,EAAE,WAAM,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,GAAG,EAAE,KAAK,IAAI;AAClG,YAAM,MAAM,OAAO,OAAO,CAAC,MAAM,CAAC,GAAG,OAAO,OAAO,CAAC,EAAE,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,OAAO,EAAE,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,CAAC,CAAC;AACzG,YAAM,KAAK,kBAAkB,IAAI,SAAS,KAAK,OAAO,8BAAyB,IAAI,KAAK,GAAG,CAAC,uBAAuB;AAAA,IACrH;AACA,QAAI,UAAU,SAAS,GAAG;AACxB,YAAM,QAAQ,WAAW,OAAO,CAAC,MAAM,UAAU,KAAK,CAAC,OAAO,EAAE,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,CAAC;AACrF,YAAM,QAAQ,oBAAI,IAAoB;AACtC,iBAAW,KAAK,WAAW;AACzB,cAAM,IAAI,MAAM,IAAI,CAAC,MAAO,EAAE,IAAI,CAAC,IAAI,MAAM,EAAE,IAAI,CAAC,CAAC,IAAI,GAAI,EAAE,KAAK,MAAG;AACvE,cAAM,IAAI,IAAI,MAAM,IAAI,CAAC,KAAK,KAAK,CAAC;AAAA,MACtC;AACA,YAAM,MAAM,CAAC,GAAG,KAAK,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,MAAM,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,QAAK,CAAC,EAAE,EAAE,KAAK,IAAI;AACtG,YAAM,KAAK,GAAG,UAAU,MAAM,OAAO,MAAM,IAAI,aAAa,MAAM,KAAK,MAAG,CAAC,KAAK,GAAG,GAAG,MAAM,OAAO,IAAI,aAAQ,EAAE,kBAAa,IAAI,SAAS,wDAAwD;AAAA,IACrM;AACA,QAAI,KAAK,UAAU,KAAK,KAAK,IAAI,MAAM,4BAA4B,MAAM,KAAK,IAAI,CAAC,EAAE;AAAA,EACvF;AAEA,aAAW,SAAS,QAAQ;AAC1B,UAAM,WAAkB,CAAC;AACzB,eAAW,KAAK,MAAM;AACpB,iBAAW,OAAO,OAAOA,OAAK,EAAE,MAAM,GAAG,KAAK,MAAM,CAAC,GAAG;AACtD,YAAI,EAAE,IAAI,UAAU,IAAI,KAAK,EAAG,UAAS,KAAK,EAAE,IAAI,GAAG,EAAE,IAAI,IAAI,IAAI,EAAE,IAAI,IAAI,IAAI,IAAI,IAAI,CAAC;AAAA,MAC9F;AAAA,IACF;AACA,QAAI,SAAS,SAAS,GAAG;AACvB,UAAI,KAAK,UAAU,KAAK,KAAK,SAAS,MAAM,qFAAqF,IAAI,QAAQ,CAAC,EAAE;AAAA,IAClJ;AAAA,EACF;AACA,SAAO;AACT;;;A1B5EO,SAAS,MAAM,KAA0B;AAE9C,QAAM,QAAQ,cAAc,GAAG;AAG/B,QAAM,gBAAgB,oBAAoB,GAAG;AAG7C,QAAM,SAAS,CAAC,GAAG,eAAe,GAAG,SAAS,GAAG,CAAC;AAGlD,QAAM,WAAW,CAAC,GAAG,iBAAiB,GAAG,GAAG,GAAG,aAAa,GAAG,GAAG,GAAG,oBAAoB,GAAG,GAAG,GAAG,oBAAoB,GAAG,GAAG,GAAG,eAAe,GAAG,EAAE,UAAU,GAAG,eAAe,GAAG,CAAC;AAInL,WAAS,KAAK,GAAG,YAAY,GAAG,CAAC;AACjC,SAAO,KAAK,GAAG,UAAU,GAAG,CAAC;AAG7B,QAAM,YAAsB,CAAC;AAC7B,QAAM,aAA0B,CAAC;AACjC,QAAM,SAAS,eAAe,GAAG;AAEjC,aAAW,YAAY,OAAO,WAAW;AACvC,UAAM,eAAeC,OAAK,SAAS,MAAM,WAAW;AACpD,QAAI,CAACC,aAAW,YAAY,EAAG;AAE/B,UAAM,SAAS,uBAAuB,UAAU,OAAO,SAAS;AAChE,aAAS,KAAK,GAAG,OAAO,QAAQ;AAChC,eAAW,KAAK,GAAG,OAAO,UAAU;AACpC,QAAI,OAAO,gBAAgB;AACzB,gBAAU,KAAK,GAAG,SAAS,IAAI,gBAAgB;AAAA,IACjD;AAAA,EACF;AAEA,SAAO,EAAE,QAAQ,UAAU,WAAW,kBAAkB,MAAM,QAAQ,OAAO,YAAY,OAAO,eAAe,GAAG,EAAE;AACtH;AAQO,SAAS,aAAa,KAA0B;AACrD,QAAM,UAAU,YAAYD,OAAK,OAAO,GAAG,mBAAmB,CAAC;AAC/D,MAAI;AACF,aAAS,KAAK,OAAO;AACrB,WAAO,MAAM,OAAO;AAAA,EACtB,UAAE;AACA,WAAO,SAAS,EAAE,WAAW,MAAM,OAAO,KAAK,CAAC;AAAA,EAClD;AACF;AAEA,SAAS,SAAS,MAAc,IAAY;AAC1C,aAAW,KAAKE,aAAY,MAAM,EAAE,eAAe,KAAK,CAAC,GAAG;AAC1D,UAAM,MAAMF,OAAK,MAAM,EAAE,IAAI,GAAG,OAAOA,OAAK,IAAI,EAAE,IAAI;AACtD,QAAI,EAAE,YAAY,GAAG;AAAE,gBAAU,IAAI;AAAG,eAAS,KAAK,IAAI;AAAA,IAAG,WACpD,yBAAyB,KAAK,EAAE,IAAI,EAAG,cAAa,KAAK,IAAI;AAAA,QACjE,aAAY,KAAK,IAAI;AAAA,EAC5B;AACF;","names":["existsSync","readdirSync","join","existsSync","join","key","key","ids","key","existsSync","join","join","existsSync","ids","existsSync","join","bad","join","existsSync","join","existsSync","join","existsSync","existsSync","join","dirname","join","existsSync","join","join","existsSync","ids","v","signedArea","BOUNDARY_TABLES","ids","dirname","features","join","existsSync","dirname","join","TOLERANCE","BOUNDARY_TABLES","existsSync","join","dirname","same","existsSync","join","existsSync","join","dist","join","join","existsSync","join","join","existsSync","existsSync","join","existsSync","join","join","existsSync","readdirSync"]}
|
|
@@ -0,0 +1,35 @@
|
|
|
1
|
+
#!/usr/bin/env node
|
|
2
|
+
|
|
3
|
+
// src/utils/units-core.ts
|
|
4
|
+
var UNIT_TO_M = { m: 1, ft: 0.3048, in: 0.0254, mm: 1e-3 };
|
|
5
|
+
function unitsOfMetadata(text) {
|
|
6
|
+
try {
|
|
7
|
+
const u = text ? JSON.parse(text).units : void 0;
|
|
8
|
+
if (typeof u === "string" && u in UNIT_TO_M) return u;
|
|
9
|
+
} catch {
|
|
10
|
+
}
|
|
11
|
+
return "m";
|
|
12
|
+
}
|
|
13
|
+
|
|
14
|
+
// src/utils/units.ts
|
|
15
|
+
import { readFileSync } from "fs";
|
|
16
|
+
import { join } from "path";
|
|
17
|
+
function projectUnits(dir) {
|
|
18
|
+
let text;
|
|
19
|
+
try {
|
|
20
|
+
text = readFileSync(join(dir, "project_metadata.json"), "utf8");
|
|
21
|
+
} catch {
|
|
22
|
+
}
|
|
23
|
+
return unitsOfMetadata(text);
|
|
24
|
+
}
|
|
25
|
+
function metersToProject(dir, meters) {
|
|
26
|
+
return meters / UNIT_TO_M[projectUnits(dir)];
|
|
27
|
+
}
|
|
28
|
+
|
|
29
|
+
export {
|
|
30
|
+
UNIT_TO_M,
|
|
31
|
+
unitsOfMetadata,
|
|
32
|
+
projectUnits,
|
|
33
|
+
metersToProject
|
|
34
|
+
};
|
|
35
|
+
//# sourceMappingURL=chunk-LWYIPR64.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"sources":["../src/utils/units-core.ts","../src/utils/units.ts"],"sourcesContent":["/** Project units without file access (shared with the browser IFC importer). */\n\n/** Project units → meters. Values are stored in the unit declared in project_metadata.json (default m). */\nexport const UNIT_TO_M: Record<string, number> = { m: 1, ft: 0.3048, in: 0.0254, mm: 0.001 };\n\n/** The units declared in project_metadata.json text (\"m\" when missing or invalid). */\nexport function unitsOfMetadata(text: string | undefined): string {\n try {\n const u = text ? JSON.parse(text).units : undefined;\n if (typeof u === 'string' && u in UNIT_TO_M) return u;\n } catch { /* invalid metadata */ }\n return 'm';\n}\n","import { readFileSync } from 'node:fs';\nimport { join } from 'node:path';\nimport { UNIT_TO_M, unitsOfMetadata } from './units-core.js';\n\nexport { UNIT_TO_M, unitsOfMetadata };\n\n/** The project's declared units (\"m\" when missing or invalid; validateStructure reports bad metadata). */\nexport function projectUnits(dir: string): string {\n let text: string | undefined;\n try { text = readFileSync(join(dir, 'project_metadata.json'), 'utf8'); } catch { /* missing metadata */ }\n return unitsOfMetadata(text);\n}\n\n/** A physical length given in meters, expressed in the project's units (e.g. 0.05 m → 0.164 ft). */\nexport function metersToProject(dir: string, meters: number): number {\n return meters / UNIT_TO_M[projectUnits(dir)];\n}\n"],"mappings":";;;AAGO,IAAM,YAAoC,EAAE,GAAG,GAAG,IAAI,QAAQ,IAAI,QAAQ,IAAI,KAAM;AAGpF,SAAS,gBAAgB,MAAkC;AAChE,MAAI;AACF,UAAM,IAAI,OAAO,KAAK,MAAM,IAAI,EAAE,QAAQ;AAC1C,QAAI,OAAO,MAAM,YAAY,KAAK,UAAW,QAAO;AAAA,EACtD,QAAQ;AAAA,EAAyB;AACjC,SAAO;AACT;;;ACZA,SAAS,oBAAoB;AAC7B,SAAS,YAAY;AAMd,SAAS,aAAa,KAAqB;AAChD,MAAI;AACJ,MAAI;AAAE,WAAO,aAAa,KAAK,KAAK,uBAAuB,GAAG,MAAM;AAAA,EAAG,QAAQ;AAAA,EAAyB;AACxG,SAAO,gBAAgB,IAAI;AAC7B;AAGO,SAAS,gBAAgB,KAAa,QAAwB;AACnE,SAAO,SAAS,UAAU,aAAa,GAAG,CAAC;AAC7C;","names":[]}
|