@mitre/hdf-utilities 3.6.0 → 3.7.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (20) hide show
  1. package/README.md +1 -1
  2. package/dist/csv/index.d.ts +18 -13
  3. package/dist/csv/index.d.ts.map +1 -1
  4. package/dist/csv/index.js +12 -6
  5. package/dist/csv/index.js.map +1 -1
  6. package/dist/hash/index.d.ts +8 -9
  7. package/dist/hash/index.d.ts.map +1 -1
  8. package/dist/index.d.ts +41 -29
  9. package/dist/index.d.ts.map +1 -1
  10. package/dist/index.js +24 -5
  11. package/dist/index.js.map +1 -1
  12. package/dist/object/index.d.ts +3 -4
  13. package/dist/object/index.d.ts.map +1 -1
  14. package/dist/string/index.d.ts +8 -9
  15. package/dist/string/index.d.ts.map +1 -1
  16. package/dist/xml/index.d.ts +8 -8
  17. package/dist/xml/index.d.ts.map +1 -1
  18. package/dist/xml/index.js +9 -6
  19. package/dist/xml/index.js.map +1 -1
  20. package/package.json +1 -1
package/dist/index.js.map CHANGED
@@ -1 +1 @@
1
- {"version":3,"file":"index.js","names":["cvss40Data"],"sources":["../src/severity/index.ts","../src/status/index.ts","../src/cvss/cvss40-data.json","../src/cvss/index.ts","../src/cpe/index.ts","../src/purl/index.ts","../src/size/index.ts"],"sourcesContent":["/**\n * Severity-to-impact mapping utilities.\n *\n * These define the canonical bidirectional mapping between severity labels\n * (critical, high, medium, low, informational) and HDF impact scores (0.0–1.0),\n * aligned with CVSS 3.x severity bands normalized to 0–1.\n *\n * Threshold ranges (used by impactToSeverity):\n * >=0.9 = critical (CVSS 9.0–10.0)\n * [0.7, 0.9) = high (CVSS 7.0–8.9)\n * [0.4, 0.7) = medium (CVSS 4.0–6.9)\n * (0.0, 0.4) = low (CVSS 0.1–3.9)\n * 0.0 = informational (CVSS 0.0)\n */\n\nconst severityMap: Record<string, number> = {\n critical: 0.9,\n high: 0.7,\n medium: 0.5,\n low: 0.3,\n info: 0.0,\n none: 0.0,\n informational: 0.0,\n information: 0.0,\n};\n\n/**\n * Map a severity string to an impact score.\n *\n * @param severity - Severity level (case-insensitive), or null for no severity assessment\n * @returns Impact score between 0.0 and 1.0; null when input is null; defaults to 0.5 for unrecognized values\n */\nexport function severityToImpact(severity: null): null;\nexport function severityToImpact(severity: string | undefined): number;\nexport function severityToImpact(severity: string | null | undefined): number | null;\nexport function severityToImpact(severity: string | null | undefined): number | null {\n if (severity === null) return null;\n // Absent field: match Go's zero-value semantics (\"\" → the 0.5 default)\n // rather than throwing on .toLowerCase() of undefined.\n const normalized = (severity ?? '').toLowerCase();\n // Own-property guard: a prototype-named token (\"constructor\") must take the\n // default like any unknown word, not return an inherited Object member.\n return Object.prototype.hasOwnProperty.call(severityMap, normalized)\n ? severityMap[normalized]!\n : 0.5;\n}\n\n/**\n * Map severity to impact, checking custom aliases first, then the shared\n * standard map, then the caller default. Case-insensitive. Use for tools with\n * non-standard severity labels (sonarqube BLOCKER, veracode numeric levels,\n * grype critical=0.9). Absent (undefined/null) values take the default —\n * matching the Go peer's zero-value \"\" behavior. TS mirror of Go's\n * SeverityToImpactWithAliases; converters must not hand-roll local severity\n * maps around it (that fork is how Go/TS impact divergence happens).\n */\nexport function severityToImpactWithAliases(\n severity: string | null | undefined,\n aliases: Record<string, number>,\n defaultVal: number,\n): number {\n const lower = (severity ?? '').toLowerCase();\n // Own-property guards: prototype-named tokens (\"constructor\") must take the\n // default like any unknown word, not resolve to an inherited Object member.\n if (Object.prototype.hasOwnProperty.call(aliases, lower)) return aliases[lower]!;\n if (Object.prototype.hasOwnProperty.call(severityMap, lower)) return severityMap[lower]!;\n return defaultVal;\n}\n\n/**\n * Round an HDF impact value to 2 decimal places — its canonical precision —\n * eliminating the representation noise that binary float division leaves behind\n * (e.g. 9.8 / 10 = 0.9800000000000001). Impact is defined on 0.0–1.0 with a\n * natural 0.01 grid (a 1-decimal CVSS score / 10), so this is lossless in\n * intent. Use it wherever impact is COMPUTED (divided or otherwise\n * arithmetically derived), not when assigned from a literal band.\n */\nexport function roundImpact(x: number): number {\n return Math.round(x * 100) / 100;\n}\n\n/**\n * Map an impact score to a severity string.\n *\n * @param impact - Impact score (0.0 to 1.0), or null for no impact assessment\n * @returns Severity level string, or null when input is null\n */\nexport function impactToSeverity(impact: null): null;\nexport function impactToSeverity(impact: number): string;\nexport function impactToSeverity(impact: number | null): string | null;\nexport function impactToSeverity(impact: number | null): string | null {\n if (impact === null) return null;\n if (impact >= 0.9) return 'critical';\n if (impact >= 0.7) return 'high';\n if (impact >= 0.4) return 'medium';\n if (impact > 0.0) return 'low';\n return 'informational';\n}\n\n/**\n * Map a raw CVSS base score (0.0–10.0) to a FIRST qualitative severity band.\n *\n * Bands per FIRST CVSS v3.x / v4.0 spec:\n * none = 0.0\n * low = 0.1 – 3.9\n * medium = 4.0 – 6.9\n * high = 7.0 – 8.9\n * critical = 9.0 – 10.0\n *\n * Out-of-range inputs are clamped: scores < 0.1 → \"none\" (band floor),\n * scores > 10.0 → \"critical\". This matches scanner behavior of treating\n * malformed scores as informational/critical extremes rather than throwing.\n *\n * @param score - CVSS base score\n * @returns FIRST severity band label\n */\nexport function cvssScoreToSeverity(\n score: number,\n): 'none' | 'low' | 'medium' | 'high' | 'critical' {\n if (!Number.isFinite(score) || score < 0.1) return 'none';\n if (score < 4.0) return 'low';\n if (score < 7.0) return 'medium';\n if (score < 9.0) return 'high';\n return 'critical';\n}\n\n// Severity vocabulary values that assert \"no rating was made\" (grype Unknown,\n// Dependency-Track UNASSIGNED, Microsoft Graph unSpecified). Distinct from the\n// zero-impact RATED tier (info/none/informational) and from grype's\n// negligible, which is the lowest rating, not an absent one.\nconst unratedSeverityTokens = new Set(['unknown', 'unassigned', 'unspecified']);\n\n/**\n * Report whether a source severity carries no rating at all: the field is\n * absent/blank, or the token is an explicit no-rating value. Tokens the\n * vocabulary simply doesn't recognize are NOT unrated — an unknown word is not\n * an assertion of unratedness. Converters use this to emit the shared unrated\n * marker so a defaulted impact stays distinguishable from a genuine medium.\n */\nexport function isUnratedSeverity(severity?: string | null): boolean {\n if (severity === undefined || severity === null) return true;\n const s = severity.trim().toLowerCase();\n return s === '' || unratedSeverityTokens.has(s);\n}\n","/**\n * Canonical HDF result-status ordering and effective-status computation.\n *\n * This is the single source of truth for worst-wins roll-up and\n * effective-status selection across hdf-libs (mirrored in Go as\n * hdf-utilities/go status.go). The precedence rules are published in\n * site/docs/architecture/status-determination.md; do not re-implement them.\n */\n\nimport { parseTimestamp } from '../string/index.js';\n\n/** Canonical worst-wins ordering, worst first. */\nexport const STATUS_SEVERITY_ORDER = [\n 'error',\n 'failed',\n 'passed',\n 'notApplicable',\n 'notReviewed',\n] as const;\n\n/** A member of the canonical ordering, as a literal union. */\nexport type StatusSeverity = (typeof STATUS_SEVERITY_ORDER)[number];\n\n/** Widened view for lookups over arbitrary input strings. */\nconst SEVERITY_LOOKUP: readonly string[] = STATUS_SEVERITY_ORDER;\n\n/** Severity rank of a status: higher = worse. Unknown statuses rank -1. */\nexport function statusRank(status: string): number {\n const idx = SEVERITY_LOOKUP.indexOf(status);\n return idx === -1 ? -1 : SEVERITY_LOOKUP.length - 1 - idx;\n}\n\n/**\n * Rolls a list of result statuses up to the worst one. An empty list (or a\n * list of only unknown statuses) rolls up to \"notReviewed\".\n */\nexport function worstStatus(statuses: readonly string[]): string {\n let worst = 'notReviewed';\n let worstRank = -1;\n for (const s of statuses) {\n const r = statusRank(s);\n if (r > worstRank) {\n worstRank = r;\n worst = s;\n }\n }\n return worst;\n}\n\n/**\n * Neutral shape of a status override for effective-status computation.\n * Callers map their concrete types (schema objects or raw JSON) onto it.\n */\nexport interface StatusOverrideInput {\n /** Empty/undefined means the override carries no status and never governs. */\n status?: string;\n /** RFC3339 timestamp; undefined sorts earliest. */\n appliedAt?: string;\n /** RFC3339 timestamp; undefined means the override never expires. */\n expiresAt?: string;\n}\n\nfunction isExpired(override: StatusOverrideInput, ref: Date): boolean {\n if (!override.expiresAt) return false;\n // parseTimestamp normalizes zone-less values to UTC (a raw `new Date` would\n // read them as host-local and make expiry host-timezone-dependent).\n const expires = parseTimestamp(override.expiresAt);\n return expires !== null && expires <= ref;\n}\n\n/**\n * Selects the override that governs a requirement: the most recently applied\n * (by appliedAt) non-expired override that carries a status — matching the\n * schema's definition of disposition (\"the most recent non-expired\n * override\"). Returns undefined when no override governs.\n */\nexport function governingStatusOverride(\n overrides: readonly StatusOverrideInput[],\n referenceTimestamp?: string\n): StatusOverrideInput | undefined {\n const i = governingStatusOverrideIndex(overrides, referenceTimestamp);\n return i >= 0 ? overrides[i] : undefined;\n}\n\n/**\n * Returns the index of the most recently applied (by appliedAt) non-expired\n * override among those for which `eligible` returns true, or -1 when none\n * qualifies. Generalizes governing-override selection to per-field\n * eligibility: the schema defines effectiveStatus, effectiveImpact, and\n * disposition each as \"the most recent non-expired override\" carrying the\n * relevant field, so callers pass the field-presence check as the predicate.\n */\nexport function governingOverrideIndex(\n overrides: readonly StatusOverrideInput[],\n eligible: (index: number) => boolean,\n referenceTimestamp?: string\n): number {\n const ref = refTime(referenceTimestamp);\n let governing = -1;\n for (let i = 0; i < overrides.length; i++) {\n const override = overrides[i];\n if (!override || !eligible(i) || isExpired(override, ref)) continue;\n if (governing === -1 || appliedTime(override) > appliedTime(overrides[governing]!)) {\n governing = i;\n }\n }\n return governing;\n}\n\n/**\n * Index variant of {@link governingStatusOverride}: returns -1 when no\n * override governs. Callers holding richer concrete override types use the\n * index to recover their own object.\n */\nexport function governingStatusOverrideIndex(\n overrides: readonly StatusOverrideInput[],\n referenceTimestamp?: string\n): number {\n return governingOverrideIndex(overrides, (i) => !!overrides[i]?.status, referenceTimestamp);\n}\n\nfunction appliedTime(override: StatusOverrideInput): number {\n if (!override.appliedAt) return Number.NEGATIVE_INFINITY;\n return parseTimestamp(override.appliedAt)?.getTime() ?? Number.NEGATIVE_INFINITY;\n}\n\nfunction refTime(referenceTimestamp?: string): Date {\n const parsed = referenceTimestamp ? parseTimestamp(referenceTimestamp) : null;\n return parsed ?? new Date();\n}\n\n/** Neutral shape of a requirement for effective-status computation. */\nexport interface EffectiveStatusInput {\n impact: number;\n resultStatuses?: readonly string[];\n overrides?: readonly StatusOverrideInput[];\n}\n\n/**\n * Determines a requirement's effective status — the single canonical\n * implementation of the ladder in status-determination.md:\n *\n * 1. the governing (most recent non-expired) status override's status\n * 2. else result roll-up \"error\" → \"error\"\n * 3. else impact === 0 → \"notApplicable\"\n * 4. else worst-wins roll-up of the result statuses (empty → \"notReviewed\")\n *\n * The stored effectiveStatus field is an output cache and is never read: the\n * only sanctioned channel for status to diverge from the results is a\n * governing override.\n */\nexport function computeEffectiveStatus(\n input: EffectiveStatusInput,\n referenceTimestamp?: string\n): string {\n const governing = governingStatusOverride(input.overrides ?? [], referenceTimestamp);\n if (governing?.status) return governing.status;\n const rolledUp = worstStatus(input.resultStatuses ?? []);\n if (rolledUp === 'error') {\n return 'error';\n }\n if (input.impact === 0) {\n return 'notApplicable';\n }\n return rolledUp;\n}\n","","/**\n * CVSS vector parsing and validation utilities.\n *\n * Supports CVSS 2.0 (legacy, no prefix), 3.0, 3.1, and 4.0 vector strings.\n * Parsing is permissive: it splits any well-shaped key:value pair separated\n * by `/`. Validation is strict per the FIRST grammar for each version.\n *\n * References:\n * - CVSS 2.0: https://www.first.org/cvss/v2/guide\n * - CVSS 3.1: https://www.first.org/cvss/v3.1/specification-document\n * - CVSS 4.0: https://www.first.org/cvss/v4.0/specification-document\n */\n\nimport cvss40Data from './cvss40-data.json';\n\nexport interface ParsedCvssVector {\n /** \"2.0\" | \"3.0\" | \"3.1\" | \"4.0\" | \"unknown\" */\n version: string;\n /** Metric name -> metric value (e.g. \"AV\" -> \"N\"). Order-preserving via Map. */\n metrics: Map<string, string>;\n}\n\nexport interface CvssValidationResult {\n valid: boolean;\n errors: string[];\n}\n\n/**\n * Allowed values for each metric, keyed by CVSS major version.\n *\n * Sourced from FIRST specifications (linked above). Only metrics present\n * in a given version's grammar appear in that version's map; unknown metrics\n * encountered during validation are ignored (forward-compat).\n */\nconst METRIC_VALUES: Record<string, Record<string, string[]>> = {\n '2.0': {\n AV: ['L', 'A', 'N'],\n AC: ['H', 'M', 'L'],\n Au: ['M', 'S', 'N'],\n C: ['N', 'P', 'C'],\n I: ['N', 'P', 'C'],\n A: ['N', 'P', 'C'],\n // Temporal\n E: ['U', 'POC', 'F', 'H', 'ND'],\n RL: ['OF', 'TF', 'W', 'U', 'ND'],\n RC: ['UC', 'UR', 'C', 'ND'],\n // Environmental\n CDP: ['N', 'L', 'LM', 'MH', 'H', 'ND'],\n TD: ['N', 'L', 'M', 'H', 'ND'],\n CR: ['L', 'M', 'H', 'ND'],\n IR: ['L', 'M', 'H', 'ND'],\n AR: ['L', 'M', 'H', 'ND'],\n },\n '3.0': {\n AV: ['N', 'A', 'L', 'P'],\n AC: ['L', 'H'],\n PR: ['N', 'L', 'H'],\n UI: ['N', 'R'],\n S: ['U', 'C'],\n C: ['N', 'L', 'H'],\n I: ['N', 'L', 'H'],\n A: ['N', 'L', 'H'],\n // Temporal\n E: ['X', 'U', 'P', 'F', 'H'],\n RL: ['X', 'O', 'T', 'W', 'U'],\n RC: ['X', 'U', 'R', 'C'],\n // Environmental\n CR: ['X', 'L', 'M', 'H'],\n IR: ['X', 'L', 'M', 'H'],\n AR: ['X', 'L', 'M', 'H'],\n MAV: ['X', 'N', 'A', 'L', 'P'],\n MAC: ['X', 'L', 'H'],\n MPR: ['X', 'N', 'L', 'H'],\n MUI: ['X', 'N', 'R'],\n MS: ['X', 'U', 'C'],\n MC: ['X', 'N', 'L', 'H'],\n MI: ['X', 'N', 'L', 'H'],\n MA: ['X', 'N', 'L', 'H'],\n },\n '3.1': {\n AV: ['N', 'A', 'L', 'P'],\n AC: ['L', 'H'],\n PR: ['N', 'L', 'H'],\n UI: ['N', 'R'],\n S: ['U', 'C'],\n C: ['N', 'L', 'H'],\n I: ['N', 'L', 'H'],\n A: ['N', 'L', 'H'],\n // Temporal\n E: ['X', 'U', 'P', 'F', 'H'],\n RL: ['X', 'O', 'T', 'W', 'U'],\n RC: ['X', 'U', 'R', 'C'],\n // Environmental\n CR: ['X', 'L', 'M', 'H'],\n IR: ['X', 'L', 'M', 'H'],\n AR: ['X', 'L', 'M', 'H'],\n MAV: ['X', 'N', 'A', 'L', 'P'],\n MAC: ['X', 'L', 'H'],\n MPR: ['X', 'N', 'L', 'H'],\n MUI: ['X', 'N', 'R'],\n MS: ['X', 'U', 'C'],\n MC: ['X', 'N', 'L', 'H'],\n MI: ['X', 'N', 'L', 'H'],\n MA: ['X', 'N', 'L', 'H'],\n },\n '4.0': {\n // Base\n AV: ['N', 'A', 'L', 'P'],\n AC: ['L', 'H'],\n AT: ['N', 'P'],\n PR: ['N', 'L', 'H'],\n UI: ['N', 'P', 'A'],\n VC: ['H', 'L', 'N'],\n VI: ['H', 'L', 'N'],\n VA: ['H', 'L', 'N'],\n SC: ['H', 'L', 'N'],\n SI: ['H', 'L', 'N'],\n SA: ['H', 'L', 'N'],\n // Threat\n E: ['X', 'A', 'P', 'U'],\n // Environmental (modified base) — same enums as their base counterparts plus X\n MAV: ['X', 'N', 'A', 'L', 'P'],\n MAC: ['X', 'L', 'H'],\n MAT: ['X', 'N', 'P'],\n MPR: ['X', 'N', 'L', 'H'],\n MUI: ['X', 'N', 'P', 'A'],\n MVC: ['X', 'H', 'L', 'N'],\n MVI: ['X', 'H', 'L', 'N'],\n MVA: ['X', 'H', 'L', 'N'],\n MSC: ['X', 'H', 'L', 'N'],\n MSI: ['X', 'S', 'H', 'L', 'N'],\n MSA: ['X', 'S', 'H', 'L', 'N'],\n // Requirements\n CR: ['X', 'H', 'M', 'L'],\n IR: ['X', 'H', 'M', 'L'],\n AR: ['X', 'H', 'M', 'L'],\n // Supplemental\n S: ['X', 'N', 'P'],\n AU: ['X', 'N', 'Y'],\n R: ['X', 'A', 'U', 'I'],\n V: ['X', 'D', 'C'],\n RE: ['X', 'L', 'M', 'H'],\n U: ['X', 'Clear', 'Green', 'Amber', 'Red'],\n },\n};\n\nconst REQUIRED_METRICS: Record<string, string[]> = {\n '2.0': ['AV', 'AC', 'Au', 'C', 'I', 'A'],\n '3.0': ['AV', 'AC', 'PR', 'UI', 'S', 'C', 'I', 'A'],\n '3.1': ['AV', 'AC', 'PR', 'UI', 'S', 'C', 'I', 'A'],\n '4.0': ['AV', 'AC', 'AT', 'PR', 'UI', 'VC', 'VI', 'VA', 'SC', 'SI', 'SA'],\n};\n\n/**\n * Parse a CVSS vector string into version + metric map.\n *\n * Version detection rule: a leading `CVSS:X.Y` segment yields version \"X.Y\".\n * Otherwise (legacy v2 vectors), version is \"2.0\". Malformed input yields\n * \"unknown\" with an empty metric map; no exceptions are thrown.\n *\n * @param vector - CVSS vector string (e.g. \"CVSS:3.1/AV:N/AC:L/...\")\n * @returns Parsed version + metric map\n */\nexport function parseCvssVector(vector: string): ParsedCvssVector {\n const metrics = new Map<string, string>();\n if (typeof vector !== 'string' || vector.length === 0) {\n return { version: 'unknown', metrics };\n }\n\n const segments = vector.split('/').filter((s) => s.length > 0);\n if (segments.length === 0) {\n return { version: 'unknown', metrics };\n }\n\n let version = '2.0';\n let start = 0;\n const first = segments[0];\n if (first === undefined) {\n return { version: 'unknown', metrics };\n }\n if (first.startsWith('CVSS:')) {\n version = first.slice(5);\n start = 1;\n } else if (!first.includes(':')) {\n // No prefix AND first segment isn't a key:value pair — bail.\n return { version: 'unknown', metrics };\n }\n\n for (let i = start; i < segments.length; i++) {\n const seg = segments[i];\n if (seg === undefined) {\n continue;\n }\n const colon = seg.indexOf(':');\n if (colon <= 0 || colon === seg.length - 1) {\n // Skip malformed segments (no colon, empty key, or empty value).\n continue;\n }\n const key = seg.slice(0, colon);\n const value = seg.slice(colon + 1);\n metrics.set(key, value);\n }\n\n return { version, metrics };\n}\n\n/**\n * Validate a CVSS vector string against the FIRST grammar for its version.\n *\n * Checks:\n * - Version is one of the supported set (2.0, 3.0, 3.1, 4.0).\n * - All required base metrics for the version are present.\n * - All known metric values are within the allowed enum.\n *\n * Unknown metric keys are tolerated (forward-compat with future minor versions\n * or scanner-specific extensions). To check a v2 vector without the CVSS:\n * prefix, callers may pass version=\"2.0\" explicitly; otherwise the parser\n * defaults to \"2.0\" on prefix absence.\n *\n * @param vector - CVSS vector string\n * @param version - Optional explicit version override (else inferred)\n * @returns `{ valid, errors[] }` — never throws\n */\nexport function validateCvssVector(\n vector: string,\n version?: string,\n): CvssValidationResult {\n const errors: string[] = [];\n\n if (typeof vector !== 'string' || vector.length === 0) {\n return { valid: false, errors: ['vector is empty'] };\n }\n\n const parsed = parseCvssVector(vector);\n const v = version ?? parsed.version;\n\n const grammar = METRIC_VALUES[v];\n const required = REQUIRED_METRICS[v];\n if (!grammar || !required) {\n errors.push(`unsupported CVSS version: ${v}`);\n return { valid: false, errors };\n }\n\n for (const req of required) {\n if (!parsed.metrics.has(req)) {\n errors.push(`missing required metric: ${req}`);\n }\n }\n\n for (const [key, value] of parsed.metrics.entries()) {\n const allowed = grammar[key];\n if (!allowed) {\n // Unknown metric: forward-compat — no error.\n continue;\n }\n if (!allowed.includes(value)) {\n errors.push(`invalid value for metric ${key}: ${value} (allowed: ${allowed.join(',')})`);\n }\n }\n\n return { valid: errors.length === 0, errors };\n}\n\n/** A computed CVSS score. */\nexport interface CvssScore {\n /** CVSS major.minor version the score was computed under (currently always \"3.1\"). */\n version: string;\n /** Base score (0.0–10.0). */\n baseScore: number;\n /**\n * Temporal (Threat) score (0.0–10.0). Equals baseScore when no temporal\n * metrics (E/RL/RC) are present, per the CVSS 3.1 spec.\n */\n temporalScore: number;\n}\n\n// CVSS 3.1 metric weights (FIRST v3.1 specification §7). Privileges Required is\n// scope-dependent, hence two tables.\nconst CVSS31_AV: Record<string, number> = { N: 0.85, A: 0.62, L: 0.55, P: 0.2 };\nconst CVSS31_AC: Record<string, number> = { L: 0.77, H: 0.44 };\nconst CVSS31_UI: Record<string, number> = { N: 0.85, R: 0.62 };\nconst CVSS31_CIA: Record<string, number> = { N: 0.0, L: 0.22, H: 0.56 };\nconst CVSS31_PR_UNCHANGED: Record<string, number> = { N: 0.85, L: 0.62, H: 0.27 };\nconst CVSS31_PR_CHANGED: Record<string, number> = { N: 0.85, L: 0.68, H: 0.5 };\nconst CVSS31_E: Record<string, number> = { X: 1.0, H: 1.0, F: 0.97, P: 0.94, U: 0.91 };\nconst CVSS31_RL: Record<string, number> = { X: 1.0, U: 1.0, W: 0.97, T: 0.96, O: 0.95 };\nconst CVSS31_RC: Record<string, number> = { X: 1.0, C: 1.0, R: 0.96, U: 0.92 };\n\n/**\n * CVSS 3.1 Roundup (spec §7.4): the smallest number, to one decimal place, that\n * is >= the input — computed via integer math to avoid the floating-point edge\n * cases 3.0 rounding suffered.\n */\nfunction roundUp31(x: number): number {\n const intInput = Math.round(x * 100000);\n if (intInput % 10000 === 0) {\n return intInput / 100000;\n }\n return (Math.floor(intInput / 10000) + 1) / 10;\n}\n\nfunction cvss31TemporalWeight(\n table: Record<string, number>,\n metrics: Map<string, string>,\n key: string,\n): number {\n const v = metrics.get(key);\n if (v === undefined) {\n return 1.0; // absent → X\n }\n const w = table[v];\n if (w === undefined) {\n throw new Error(`cvss: invalid 3.1 ${key} value \"${v}\"`);\n }\n return w;\n}\n\n/**\n * Compute the CVSS 3.1 Base and Temporal (Threat) scores for a vector string.\n *\n * Only CVSS 3.1 is supported here — CVSS 4.0's MacroVector engine lives\n * separately — so any other version throws rather than returning a wrong number.\n * The peer of the Go `ComputeCvssScore` (kept byte-identical via shared fixtures).\n *\n * @throws if the version is not 3.1, a required base metric is missing, or any\n * metric value is out of the 3.1 enum.\n */\nexport function computeCvssScore(vector: string): CvssScore {\n const { version, metrics } = parseCvssVector(vector);\n if (version !== '3.1') {\n throw new Error(`cvss: score compute supports only CVSS 3.1, got \"${version}\"`);\n }\n for (const k of ['AV', 'AC', 'PR', 'UI', 'S', 'C', 'I', 'A']) {\n if (!metrics.has(k)) {\n throw new Error(`cvss: missing required 3.1 base metric \"${k}\"`);\n }\n }\n\n const scope = metrics.get('S');\n if (scope !== 'U' && scope !== 'C') {\n throw new Error(`cvss: invalid 3.1 Scope value \"${scope ?? ''}\"`);\n }\n const scopeChanged = scope === 'C';\n\n const prTable = scopeChanged ? CVSS31_PR_CHANGED : CVSS31_PR_UNCHANGED;\n const lookup = (table: Record<string, number>, metric: string): number => {\n const key = metrics.get(metric);\n const w = key === undefined ? undefined : table[key];\n if (w === undefined) {\n throw new Error(`cvss: invalid 3.1 metric value ${metric}:\"${key ?? ''}\"`);\n }\n return w;\n };\n const av = lookup(CVSS31_AV, 'AV');\n const ac = lookup(CVSS31_AC, 'AC');\n const ui = lookup(CVSS31_UI, 'UI');\n const pr = lookup(prTable, 'PR');\n const c = lookup(CVSS31_CIA, 'C');\n const i = lookup(CVSS31_CIA, 'I');\n const a = lookup(CVSS31_CIA, 'A');\n\n const iss = 1 - (1 - c) * (1 - i) * (1 - a);\n const impact = scopeChanged\n ? 7.52 * (iss - 0.029) - 3.25 * Math.pow(iss - 0.02, 15)\n : 6.42 * iss;\n const exploitability = 8.22 * av * ac * pr * ui;\n\n let baseScore: number;\n if (impact <= 0) {\n baseScore = 0.0;\n } else if (scopeChanged) {\n baseScore = roundUp31(Math.min(1.08 * (impact + exploitability), 10));\n } else {\n baseScore = roundUp31(Math.min(impact + exploitability, 10));\n }\n\n const e = cvss31TemporalWeight(CVSS31_E, metrics, 'E');\n const rl = cvss31TemporalWeight(CVSS31_RL, metrics, 'RL');\n const rc = cvss31TemporalWeight(CVSS31_RC, metrics, 'RC');\n const temporalScore = roundUp31(baseScore * e * rl * rc);\n\n return { version: '3.1', baseScore, temporalScore };\n}\n\n// --- CVSS 4.0 scoring (MacroVector engine) ---\n//\n// A faithful port of the FIRST reference calculator (FIRSTdotorg/cvss-v4-calculator:\n// cvss_score.js), driven by the MacroVector lookup + max tables extracted verbatim\n// into cvss40-data.json. The Go peer (go/cvss.go) reads the byte-identical data\n// file and shares the parity fixture, so the two languages score identically.\n\ninterface Cvss40Tables {\n lookup: Record<string, number>;\n maxComposed: {\n eq1: Record<string, string[]>;\n eq2: Record<string, string[]>;\n eq3: Record<string, Record<string, string[]>>;\n eq4: Record<string, string[]>;\n eq5: Record<string, string[]>;\n };\n maxSeverity: {\n eq1: Record<string, number>;\n eq2: Record<string, number>;\n eq3eq6: Record<string, Record<string, number>>;\n eq4: Record<string, number>;\n eq5: Record<string, number>;\n };\n}\nconst CVSS40 = cvss40Data as Cvss40Tables;\n\n// Per-metric severity index tables (FIRST reference cvss_score.js). Lower = worse.\nconst CVSS40_AV: Record<string, number> = { N: 0.0, A: 0.1, L: 0.2, P: 0.3 };\nconst CVSS40_PR: Record<string, number> = { N: 0.0, L: 0.1, H: 0.2 };\nconst CVSS40_UI: Record<string, number> = { N: 0.0, P: 0.1, A: 0.2 };\nconst CVSS40_AC: Record<string, number> = { L: 0.0, H: 0.1 };\nconst CVSS40_AT: Record<string, number> = { N: 0.0, P: 0.1 };\nconst CVSS40_VC: Record<string, number> = { H: 0.0, L: 0.1, N: 0.2 };\nconst CVSS40_SC: Record<string, number> = { H: 0.1, L: 0.2, N: 0.3 };\nconst CVSS40_SI: Record<string, number> = { S: 0.0, H: 0.1, L: 0.2, N: 0.3 };\nconst CVSS40_CR: Record<string, number> = { H: 0.0, M: 0.1, L: 0.2 };\n\n/** Throw on an unexpected missing table entry rather than fabricate a value. */\nfunction req<T>(value: T | undefined, what: string): T {\n if (value === undefined) {\n throw new Error(`cvss: 4.0 data table missing ${what}`);\n }\n return value;\n}\n\n/**\n * Resolve the effective value of a metric, mirroring the reference m(): E:X and\n * unset default to A (worst case); CR/IR/AR:X and unset default to H; a present,\n * non-X Modified (M-prefixed) metric overrides its base.\n */\nfunction cvss40Metric(sel: Map<string, string>, metric: string): string {\n const selected = sel.get(metric) ?? '';\n if (metric === 'E' && (selected === '' || selected === 'X')) {\n return 'A';\n }\n if ((metric === 'CR' || metric === 'IR' || metric === 'AR') && (selected === '' || selected === 'X')) {\n return 'H';\n }\n const modified = sel.get('M' + metric);\n if (modified !== undefined && modified !== 'X') {\n return modified;\n }\n return selected;\n}\n\nfunction cvss40MacroVectorFromSel(sel: Map<string, string>): string {\n const mv = (k: string): string => cvss40Metric(sel, k);\n\n // EQ1 (the \"not all three N\" term of the reference's level-1 clause is\n // redundant here: the level-0 branch already consumes the all-three-N case).\n let eq1 = '2';\n if (mv('AV') === 'N' && mv('PR') === 'N' && mv('UI') === 'N') {\n eq1 = '0';\n } else if ((mv('AV') === 'N' || mv('PR') === 'N' || mv('UI') === 'N') && mv('AV') !== 'P') {\n eq1 = '1';\n }\n\n let eq2 = '1';\n if (mv('AC') === 'L' && mv('AT') === 'N') {\n eq2 = '0';\n }\n\n let eq3 = '2';\n if (mv('VC') === 'H' && mv('VI') === 'H') {\n eq3 = '0';\n } else if (mv('VC') === 'H' || mv('VI') === 'H' || mv('VA') === 'H') {\n eq3 = '1';\n }\n\n let eq4 = '2';\n if (mv('MSI') === 'S' || mv('MSA') === 'S') {\n eq4 = '0';\n } else if (mv('SC') === 'H' || mv('SI') === 'H' || mv('SA') === 'H') {\n eq4 = '1';\n }\n\n let eq5 = '2';\n if (mv('E') === 'A') {\n eq5 = '0';\n } else if (mv('E') === 'P') {\n eq5 = '1';\n }\n\n let eq6 = '1';\n if (\n (mv('CR') === 'H' && mv('VC') === 'H') ||\n (mv('IR') === 'H' && mv('VI') === 'H') ||\n (mv('AR') === 'H' && mv('VA') === 'H')\n ) {\n eq6 = '0';\n }\n\n return eq1 + eq2 + eq3 + eq4 + eq5 + eq6;\n}\n\n/** Parse a CVSS 4.0 vector and return its MacroVector string. */\nexport function cvss40MacroVector(vector: string): string {\n return cvss40MacroVectorFromSel(parseCvssVector(vector).metrics);\n}\n\n/** Pull a metric's value out of a composed max-vector string (reference extractValueMetric). */\nfunction cvss40ExtractMetric(metric: string, s: string): string {\n const idx = s.indexOf(metric);\n if (idx < 0) {\n return '';\n }\n const rest = s.slice(idx + metric.length + 1);\n const slash = rest.indexOf('/');\n return slash >= 0 ? rest.slice(0, slash) : rest;\n}\n\n/** value minus the lower macro's score, or NaN when that lower macro does not exist. */\nfunction cvss40AvailDist(value: number, lowerMacro: string): number {\n const s = CVSS40.lookup[lowerMacro];\n return s === undefined ? NaN : value - s;\n}\n\nfunction cvss40Score(sel: Map<string, string>): number {\n const mv = (k: string): string => cvss40Metric(sel, k);\n\n if (\n mv('VC') === 'N' && mv('VI') === 'N' && mv('VA') === 'N' &&\n mv('SC') === 'N' && mv('SI') === 'N' && mv('SA') === 'N'\n ) {\n return 0.0;\n }\n\n const macro = cvss40MacroVectorFromSel(sel);\n let value = req(CVSS40.lookup[macro], `lookup[${macro}]`);\n\n // Definite per-position digit chars (charAt never yields undefined).\n const c0 = macro.charAt(0);\n const c1 = macro.charAt(1);\n const c2 = macro.charAt(2);\n const c3 = macro.charAt(3);\n const c4 = macro.charAt(4);\n const c5 = macro.charAt(5);\n\n const d = (i: number): number => macro.charCodeAt(i) - 48;\n const eq3 = d(2);\n const eq6 = d(5);\n const rep = (i: number, digit: number): string =>\n macro.slice(0, i) + String(digit) + macro.slice(i + 1);\n\n const availDistEq1 = cvss40AvailDist(value, rep(0, d(0) + 1));\n const availDistEq2 = cvss40AvailDist(value, rep(1, d(1) + 1));\n const availDistEq4 = cvss40AvailDist(value, rep(3, d(3) + 1));\n const availDistEq5 = cvss40AvailDist(value, rep(4, d(4) + 1));\n\n // eq3 and eq6 are coupled.\n let availDistEq3eq6 = NaN;\n if ((eq3 === 1 && eq6 === 1) || (eq3 === 0 && eq6 === 1)) {\n availDistEq3eq6 = cvss40AvailDist(value, rep(2, eq3 + 1));\n } else if (eq3 === 1 && eq6 === 0) {\n availDistEq3eq6 = cvss40AvailDist(value, rep(5, eq6 + 1));\n } else if (eq3 === 0 && eq6 === 0) {\n const left = CVSS40.lookup[rep(5, eq6 + 1)];\n const right = CVSS40.lookup[rep(2, eq3 + 1)];\n if (left !== undefined && right !== undefined) {\n availDistEq3eq6 = value - Math.max(left, right);\n } else if (right !== undefined) {\n availDistEq3eq6 = value - right;\n }\n } else {\n availDistEq3eq6 = cvss40AvailDist(value, macro.slice(0, 2) + String(eq3 + 1) + macro.slice(3, 5) + String(eq6 + 1));\n }\n\n const eq1Maxes = req(CVSS40.maxComposed.eq1[c0], `maxComposed.eq1[${c0}]`);\n const eq2Maxes = req(CVSS40.maxComposed.eq2[c1], `maxComposed.eq2[${c1}]`);\n const eq3eq6Maxes = req(\n req(CVSS40.maxComposed.eq3[c2], `maxComposed.eq3[${c2}]`)[c5],\n `maxComposed.eq3[${c2}][${c5}]`,\n );\n const eq4Maxes = req(CVSS40.maxComposed.eq4[c3], `maxComposed.eq4[${c3}]`);\n const eq5Maxes = req(CVSS40.maxComposed.eq5[c4], `maxComposed.eq5[${c4}]`);\n\n const maxVectors: string[] = [];\n for (const a of eq1Maxes) {\n for (const b of eq2Maxes) {\n for (const c of eq3eq6Maxes) {\n for (const e of eq4Maxes) {\n for (const f of eq5Maxes) {\n maxVectors.push(a + b + c + e + f);\n }\n }\n }\n }\n }\n\n const dist = (table: Record<string, number>, metric: string, maxVector: string): number =>\n req(table[mv(metric)], `level ${metric}:${mv(metric)}`) -\n req(table[cvss40ExtractMetric(metric, maxVector)], `max level ${metric}`);\n\n let sdAV = 0, sdPR = 0, sdUI = 0, sdAC = 0, sdAT = 0, sdVC = 0, sdVI = 0, sdVA = 0;\n let sdSC = 0, sdSI = 0, sdSA = 0, sdCR = 0, sdIR = 0, sdAR = 0;\n for (const maxVector of maxVectors) {\n sdAV = dist(CVSS40_AV, 'AV', maxVector);\n sdPR = dist(CVSS40_PR, 'PR', maxVector);\n sdUI = dist(CVSS40_UI, 'UI', maxVector);\n sdAC = dist(CVSS40_AC, 'AC', maxVector);\n sdAT = dist(CVSS40_AT, 'AT', maxVector);\n sdVC = dist(CVSS40_VC, 'VC', maxVector);\n sdVI = dist(CVSS40_VC, 'VI', maxVector);\n sdVA = dist(CVSS40_VC, 'VA', maxVector);\n sdSC = dist(CVSS40_SC, 'SC', maxVector);\n sdSI = dist(CVSS40_SI, 'SI', maxVector);\n sdSA = dist(CVSS40_SI, 'SA', maxVector);\n sdCR = dist(CVSS40_CR, 'CR', maxVector);\n sdIR = dist(CVSS40_CR, 'IR', maxVector);\n sdAR = dist(CVSS40_CR, 'AR', maxVector);\n if (\n [sdAV, sdPR, sdUI, sdAC, sdAT, sdVC, sdVI, sdVA, sdSC, sdSI, sdSA, sdCR, sdIR, sdAR].some(\n (v) => v < 0,\n )\n ) {\n continue;\n }\n break;\n }\n\n const curEq1 = sdAV + sdPR + sdUI;\n const curEq2 = sdAC + sdAT;\n const curEq3eq6 = sdVC + sdVI + sdVA + sdCR + sdIR + sdAR;\n const curEq4 = sdSC + sdSI + sdSA;\n\n const step = 0.1;\n const maxSevEq1 = req(CVSS40.maxSeverity.eq1[c0], `maxSeverity.eq1[${c0}]`) * step;\n const maxSevEq2 = req(CVSS40.maxSeverity.eq2[c1], `maxSeverity.eq2[${c1}]`) * step;\n const maxSevEq3eq6 =\n req(\n req(CVSS40.maxSeverity.eq3eq6[c2], `maxSeverity.eq3eq6[${c2}]`)[c5],\n `maxSeverity.eq3eq6[${c2}][${c5}]`,\n ) * step;\n const maxSevEq4 = req(CVSS40.maxSeverity.eq4[c3], `maxSeverity.eq4[${c3}]`) * step;\n\n let nExisting = 0;\n let normEq1 = 0, normEq2 = 0, normEq3eq6 = 0, normEq4 = 0;\n const normEq5 = 0; // eq5 proportion is always 0 per the reference\n if (!Number.isNaN(availDistEq1)) {\n nExisting++;\n normEq1 = availDistEq1 * (curEq1 / maxSevEq1);\n }\n if (!Number.isNaN(availDistEq2)) {\n nExisting++;\n normEq2 = availDistEq2 * (curEq2 / maxSevEq2);\n }\n if (!Number.isNaN(availDistEq3eq6)) {\n nExisting++;\n normEq3eq6 = availDistEq3eq6 * (curEq3eq6 / maxSevEq3eq6);\n }\n if (!Number.isNaN(availDistEq4)) {\n nExisting++;\n normEq4 = availDistEq4 * (curEq4 / maxSevEq4);\n }\n if (!Number.isNaN(availDistEq5)) {\n nExisting++;\n }\n\n const meanDistance =\n nExisting === 0 ? 0 : (normEq1 + normEq2 + normEq3eq6 + normEq4 + normEq5) / nExisting;\n\n value -= meanDistance;\n if (value < 0) {\n value = 0.0;\n }\n if (value > 10) {\n value = 10.0;\n }\n return Math.round(value * 10) / 10;\n}\n\n/** Remove the E: segment so the Base score reflects the worst-case default (E:X → E:A). */\nfunction cvss40StripExploitMaturity(vector: string): string {\n return vector\n .split('/')\n .filter((seg) => !seg.startsWith('E:'))\n .join('/');\n}\n\n/**\n * Compute the CVSS 4.0 score for a vector string, split into a Base score\n * (`baseScore`, with Exploit Maturity stripped to its worst-case default E:A) and\n * a Threat score (`temporalScore`, with the E value present in the vector). For a\n * base-only vector the two are equal. The peer of the Go `ComputeCvss40Score`,\n * kept byte-identical via the shared data file and parity fixture.\n *\n * @throws if the version is not 4.0, a required base metric is missing, or any\n * metric value is out of the 4.0 enum.\n */\nexport function computeCvss40Score(vector: string): CvssScore {\n const { version } = parseCvssVector(vector);\n if (version !== '4.0') {\n throw new Error(`cvss: 4.0 score compute supports only CVSS 4.0, got \"${version}\"`);\n }\n const { valid, errors } = validateCvssVector(vector, '4.0');\n if (!valid) {\n throw new Error(`cvss: invalid 4.0 vector: ${errors.join('; ')}`);\n }\n\n const temporalScore = cvss40Score(parseCvssVector(vector).metrics);\n const baseScore = cvss40Score(parseCvssVector(cvss40StripExploitMaturity(vector)).metrics);\n return { version: '4.0', baseScore, temporalScore };\n}\n","/**\n * CPE 2.3 URI parser for HDF converters.\n *\n * Common Platform Enumeration (CPE) 2.3 URIs identify affected products.\n * Container scanners (grype, twistlock, snyk) emit them in vulnerability\n * findings. This module provides an accept-and-warn parser: any input that\n * carries the `cpe:2.3:` prefix is best-effort parsed; deviations from the\n * canonical 13-field form are reported via `warnings` rather than rejected.\n *\n * Canonical form:\n * `cpe:2.3:part:vendor:product:version:update:edition:language:sw_edition:target_sw:target_hw:other`\n *\n * Reference: NIST IR 7695 (https://csrc.nist.gov/publications/detail/nistir/7695/final)\n */\n\n/** Valid CPE 2.3 `part` values. */\nexport type CpePart = 'a' | 'o' | 'h' | '*';\n\n/**\n * Parsed CPE 2.3 URI.\n *\n * `warnings` collects any deviations from the canonical form (truncation,\n * extra fields, unknown `part`). An empty array means the input was a strict\n * 13-field, valid-part CPE.\n */\nexport interface ParsedCpe {\n /** The original input string, unmodified. */\n raw: string;\n /** Application kind. `'a'` (app), `'o'` (OS), `'h'` (hardware), `'*'` (any). */\n part: CpePart | string;\n vendor: string;\n product: string;\n version: string;\n update: string;\n edition: string;\n language: string;\n swEdition: string;\n targetSw: string;\n targetHw: string;\n other: string;\n /** Deviation messages; empty when the input is a canonical 13-field CPE. */\n warnings: string[];\n}\n\nconst CPE_PREFIX = 'cpe:2.3:';\nconst EXPECTED_TOTAL_FIELDS = 13; // \"cpe\", \"2.3\", and 11 product fields = 13 colon-separated tokens\nconst PRODUCT_FIELD_COUNT = 11; // part + 10 attribute fields\nconst VALID_PARTS = new Set(['a', 'o', 'h', '*']);\n\n/**\n * Split a CPE 2.3 body on unescaped `:` separators.\n *\n * Per CPE 2.3 spec section 6.1.2.4, `:` and `\\` inside a field must be\n * escaped as `\\:` and `\\\\`. We respect those escapes during the split and\n * unescape the result.\n */\nfunction splitOnUnescapedColons(body: string): string[] {\n const result: string[] = [];\n let current = '';\n for (let i = 0; i < body.length; i++) {\n const ch = body[i];\n if (ch === '\\\\' && i + 1 < body.length) {\n const next = body[i + 1];\n // Preserve known escapes (\\: and \\\\) as a literal next character.\n if (next === ':' || next === '\\\\') {\n current += next;\n i++;\n continue;\n }\n // Unknown escape — keep the backslash and continue.\n current += ch;\n continue;\n }\n if (ch === ':') {\n result.push(current);\n current = '';\n continue;\n }\n current += ch;\n }\n result.push(current);\n return result;\n}\n\n/**\n * Parse a CPE 2.3 URI.\n *\n * Accept-and-warn semantics:\n * - Input missing the `cpe:2.3:` prefix → returns `null`.\n * - Input with the prefix but fewer than 11 product fields → fields are\n * padded with `\"*\"` and a `truncated:` warning is added.\n * - Input with more than 11 product fields → extras are dropped and an\n * `\"extra fields ignored\"` warning is added.\n * - Unknown `part` value → kept as-is in the result, `\"unknown part: X\"`\n * warning is added.\n * - `\\:` and `\\\\` escapes inside fields are honored during splitting and\n * unescaped in the returned field values.\n *\n * @param cpeUri - CPE 2.3 URI string\n * @returns Parsed CPE with warnings, or `null` if input lacks the prefix\n *\n * @example\n * ```typescript\n * parseCpe('cpe:2.3:a:openssl:openssl:1.1.1k:*:*:*:*:*:*:*');\n * // { part: 'a', vendor: 'openssl', product: 'openssl', version: '1.1.1k', ... warnings: [] }\n *\n * parseCpe('cpe:2.3:a:openssl:openssl:1.1.1k');\n * // truncated input → padded with '*', warnings: ['truncated: expected 13 colon-separated fields, got 6']\n *\n * parseCpe('openssl:1.1.1k'); // null — no prefix\n * ```\n */\nexport function parseCpe(cpeUri: string): ParsedCpe | null {\n if (!cpeUri.startsWith(CPE_PREFIX)) {\n return null;\n }\n\n const warnings: string[] = [];\n const body = cpeUri.slice(CPE_PREFIX.length);\n\n // Special case: bare prefix `cpe:2.3:` — all fields empty, still warn.\n // This is the \"I have nothing useful here\" form; padding with \"*\" would\n // suggest the parser inferred wildcards, which it didn't.\n const isBarePrefix = body.length === 0;\n\n const bodyParts = isBarePrefix ? [] : splitOnUnescapedColons(body);\n\n // Total colon-separated fields including the prefix \"cpe\" and \"2.3\" markers.\n const totalFields = isBarePrefix ? 2 : 2 + bodyParts.length;\n\n if (bodyParts.length > PRODUCT_FIELD_COUNT) {\n warnings.push('extra fields ignored');\n } else if (bodyParts.length < PRODUCT_FIELD_COUNT) {\n warnings.push(\n `truncated: expected ${EXPECTED_TOTAL_FIELDS} colon-separated fields, got ${totalFields}`,\n );\n }\n\n // Pad missing fields. For a bare prefix, pad with \"\" (no inferred data).\n // For partial input, pad missing trailing fields with \"*\" (wildcard).\n const padValue = isBarePrefix ? '' : '*';\n const fields: string[] = bodyParts.slice(0, PRODUCT_FIELD_COUNT);\n while (fields.length < PRODUCT_FIELD_COUNT) {\n fields.push(padValue);\n }\n\n // fields is padded to PRODUCT_FIELD_COUNT above, so every slot is present;\n // the destructuring defaults only satisfy the compiler's indexed-access check.\n const [\n part = '',\n vendor = '',\n product = '',\n version = '',\n update = '',\n edition = '',\n language = '',\n swEdition = '',\n targetSw = '',\n targetHw = '',\n other = '',\n ] = fields;\n\n if (!VALID_PARTS.has(part)) {\n warnings.push(`unknown part: ${part}`);\n }\n\n return {\n raw: cpeUri,\n part,\n vendor,\n product,\n version,\n update,\n edition,\n language,\n swEdition,\n targetSw,\n targetHw,\n other,\n warnings,\n };\n}\n","/**\n * Package URL (PURL) parser for SBOM and CVE-scanner ingestion.\n *\n * PURL is the canonical package identifier used by CycloneDX, SPDX, OSV,\n * GitHub Advisory Database, and most modern scanners. Spec:\n * https://github.com/package-url/purl-spec/blob/master/PURL-SPECIFICATION.rst\n *\n * Grammar: `pkg:type/namespace/name@version?qualifiers#subpath`\n *\n * This parser is intentionally accept-and-warn. Scanners occasionally emit\n * slightly malformed PURLs (qualifier with no `=`, missing name, etc.) and\n * we'd rather record a warning than fail ingestion.\n */\n\n/**\n * Result of parsing a PURL string.\n */\nexport interface ParsedPurl {\n /** Original input string, unmodified. */\n raw: string;\n /** Package type (e.g., \"npm\", \"rpm\", \"pypi\", \"maven\"). Lowercased. */\n type: string;\n /** Namespace segment (e.g., \"redhat\" for RPM, \"org.apache...\" for Maven). */\n namespace: string | null;\n /** Package name. Empty string (with a warning) if the input lacks one. */\n name: string;\n /** Version after the `@` separator. URL-decoded. */\n version: string | null;\n /** Qualifier key-value pairs from the `?` segment. */\n qualifiers: Map<string, string>;\n /** Subpath from the `#` fragment. */\n subpath: string | null;\n /** Deviations or oddities encountered during parsing. */\n warnings: string[];\n}\n\nconst PURL_PREFIX = 'pkg:';\n\n/**\n * Parse a Package URL string.\n *\n * Returns `null` only when the input is missing the mandatory `pkg:` prefix\n * or the type segment. Other deviations are surfaced via `warnings` on the\n * returned object.\n *\n * @param purlStr - PURL string, e.g. `pkg:npm/lodash@4.17.21`\n * @returns Parsed PURL or `null` if the input is unrecoverably malformed\n *\n * @example\n * ```typescript\n * const r = parsePurl('pkg:rpm/redhat/openssl@1.1.1k-7.el8_4?arch=x86_64');\n * r?.type; // \"rpm\"\n * r?.namespace; // \"redhat\"\n * r?.name; // \"openssl\"\n * r?.qualifiers.get('arch'); // \"x86_64\"\n * ```\n */\nexport function parsePurl(purlStr: string): ParsedPurl | null {\n if (!purlStr || !purlStr.startsWith(PURL_PREFIX)) {\n return null;\n }\n\n const raw = purlStr;\n const warnings: string[] = [];\n\n // Strip prefix. Per spec, scheme is case-insensitive but only `pkg:` is\n // valid; we already matched it.\n let remainder = purlStr.slice(PURL_PREFIX.length);\n\n // Per spec, leading slashes after the scheme are stripped. This also means\n // `pkg:/foo` and `pkg:foo` are equivalent, but `pkg:/` with no following\n // type segment is still invalid.\n while (remainder.startsWith('/')) {\n remainder = remainder.slice(1);\n }\n\n if (remainder.length === 0) {\n return null;\n }\n\n // Extract subpath (fragment). Per spec, the fragment is everything after\n // the first `#`. Splitting before qualifiers keeps `#` inside qualifier\n // values out of scope (which is fine — qualifier values do not legally\n // contain raw `#`; they would be percent-encoded).\n let subpath: string | null = null;\n const hashIdx = remainder.indexOf('#');\n if (hashIdx !== -1) {\n subpath = remainder.slice(hashIdx + 1);\n remainder = remainder.slice(0, hashIdx);\n if (subpath.length === 0) {\n subpath = null;\n }\n }\n\n // Extract qualifiers (query string). Everything after the first `?`.\n const qualifiers = new Map<string, string>();\n const qIdx = remainder.indexOf('?');\n if (qIdx !== -1) {\n const qStr = remainder.slice(qIdx + 1);\n remainder = remainder.slice(0, qIdx);\n parseQualifiers(qStr, qualifiers, warnings);\n }\n\n // Strip a trailing slash from the path portion. Spec allows it; we silently\n // normalize.\n while (remainder.endsWith('/')) {\n remainder = remainder.slice(0, -1);\n }\n\n // Type is everything up to the first `/`.\n const firstSlash = remainder.indexOf('/');\n let type: string;\n let pathPart: string;\n if (firstSlash === -1) {\n type = remainder;\n pathPart = '';\n } else {\n type = remainder.slice(0, firstSlash);\n pathPart = remainder.slice(firstSlash + 1);\n }\n\n if (type.length === 0) {\n return null;\n }\n type = type.toLowerCase();\n\n // Split version off the path part. Per spec, the version separator is the\n // LAST `@` in the path — names may contain `@` (e.g., npm scoped packages\n // when not percent-encoded).\n let version: string | null = null;\n const lastAt = pathPart.lastIndexOf('@');\n let nameAndNs = pathPart;\n if (lastAt !== -1) {\n version = pathPart.slice(lastAt + 1);\n nameAndNs = pathPart.slice(0, lastAt);\n version = safeDecode(version);\n }\n\n // Namespace is everything before the last `/` in the name+namespace\n // section; the final segment is the name.\n let namespace: string | null = null;\n let name: string;\n const lastSlash = nameAndNs.lastIndexOf('/');\n if (lastSlash === -1) {\n name = nameAndNs;\n } else {\n namespace = nameAndNs.slice(0, lastSlash);\n name = nameAndNs.slice(lastSlash + 1);\n }\n\n // Decode percent-encoded segments.\n if (namespace !== null) {\n // Decode each path segment independently to preserve embedded `/`.\n namespace = namespace.split('/').map(safeDecode).join('/');\n }\n name = safeDecode(name);\n\n if (name.length === 0) {\n warnings.push('PURL is missing the name segment');\n }\n\n // Normalize empty namespace to null.\n if (namespace !== null && namespace.length === 0) {\n namespace = null;\n }\n\n // Normalize empty version to null.\n if (version !== null && version.length === 0) {\n version = null;\n }\n\n return {\n raw,\n type,\n namespace,\n name,\n version,\n qualifiers,\n subpath,\n warnings,\n };\n}\n\n/**\n * Parse the `?key=value&key=value` qualifier string. Empty segments are\n * skipped silently; segments with no `=` are recorded with empty value and\n * a warning. Values are URL-decoded.\n */\nfunction parseQualifiers(\n qStr: string,\n out: Map<string, string>,\n warnings: string[],\n): void {\n const parts = qStr.split('&');\n for (const part of parts) {\n if (part.length === 0) {\n continue;\n }\n const eq = part.indexOf('=');\n if (eq === -1) {\n out.set(part, '');\n warnings.push(`qualifier \"${part}\" has no value`);\n continue;\n }\n const key = part.slice(0, eq);\n const value = part.slice(eq + 1);\n out.set(key, safeDecode(value));\n }\n}\n\n/**\n * decodeURIComponent that returns the original string on failure rather than\n * throwing. PURLs in the wild occasionally contain stray `%` characters that\n * aren't legitimate percent-encoding.\n */\nfunction safeDecode(s: string): string {\n try {\n return decodeURIComponent(s);\n } catch {\n return s;\n }\n}\n","// Schema-free input-size guard — the TS peer of hdf-utilities/go/size.go, kept\n// at behavioural parity. The engine loader runs it as its FIRST operation,\n// before any parse, to defend against memory exhaustion on untrusted input.\n\n/** Default maximum input size (50 MB), matching the Go DefaultMaxInputSize. */\nexport const DEFAULT_MAX_INPUT_SIZE = 50 * 1024 * 1024;\n\n/**\n * validateInputSize throws if input exceeds maxSize bytes (maxSize <= 0 uses\n * DEFAULT_MAX_INPUT_SIZE). Byte length is measured on the UTF-8 encoding for a\n * string input, so it matches the Go []byte length for the same document.\n */\nexport function validateInputSize(input: string | Uint8Array, maxSize = 0): void {\n const limit = maxSize > 0 ? maxSize : DEFAULT_MAX_INPUT_SIZE;\n if (typeof input !== 'string') {\n if (input.length > limit) throw tooLarge(limit, input.length);\n return;\n }\n // UTF-8 never uses fewer than one byte per code unit nor more than three, so\n // the cheap bound settles most inputs before anything reads the string.\n if (input.length * 3 <= limit) return;\n const len = utf8ByteLength(input);\n if (len > limit) throw tooLarge(limit, len);\n}\n\nfunction tooLarge(limit: number, len: number): Error {\n return new Error(`input exceeds maximum allowed size of ${limit} bytes (${len} bytes provided)`);\n}\n\n/**\n * UTF-8 byte length, counted rather than encoded: a TextEncoder pass would\n * allocate a full copy of the very input this guard exists to reject.\n * An unpaired surrogate counts as the three-byte replacement character, which\n * is what TextEncoder emits for one.\n */\nfunction utf8ByteLength(s: string): number {\n let bytes = 0;\n for (let i = 0; i < s.length; i++) {\n const c = s.charCodeAt(i);\n if (c < 0x80) {\n bytes += 1;\n } else if (c < 0x800) {\n bytes += 2;\n } else if (c >= 0xd800 && c <= 0xdbff && (s.charCodeAt(i + 1) & 0xfc00) === 0xdc00) {\n bytes += 4;\n i++;\n } else {\n bytes += 3;\n }\n }\n return bytes;\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;AAeA,MAAM,cAAsC;CAC1C,UAAU;CACV,MAAM;CACN,QAAQ;CACR,KAAK;CACL,MAAM;CACN,MAAM;CACN,eAAe;CACf,aAAa;AACf;AAWA,SAAgB,iBAAiB,UAAoD;CACnF,IAAI,aAAa,MAAM,OAAO;CAG9B,MAAM,cAAc,YAAY,GAAA,CAAI,YAAY;CAGhD,OAAO,OAAO,UAAU,eAAe,KAAK,aAAa,UAAU,IAC/D,YAAY,cACZ;AACN;;;;;;;;;;AAWA,SAAgB,4BACd,UACA,SACA,YACQ;CACR,MAAM,SAAS,YAAY,GAAA,CAAI,YAAY;CAG3C,IAAI,OAAO,UAAU,eAAe,KAAK,SAAS,KAAK,GAAG,OAAO,QAAQ;CACzE,IAAI,OAAO,UAAU,eAAe,KAAK,aAAa,KAAK,GAAG,OAAO,YAAY;CACjF,OAAO;AACT;;;;;;;;;AAUA,SAAgB,YAAY,GAAmB;CAC7C,OAAO,KAAK,MAAM,IAAI,GAAG,IAAI;AAC/B;AAWA,SAAgB,iBAAiB,QAAsC;CACrE,IAAI,WAAW,MAAM,OAAO;CAC5B,IAAI,UAAU,IAAK,OAAO;CAC1B,IAAI,UAAU,IAAK,OAAO;CAC1B,IAAI,UAAU,IAAK,OAAO;CAC1B,IAAI,SAAS,GAAK,OAAO;CACzB,OAAO;AACT;;;;;;;;;;;;;;;;;;AAmBA,SAAgB,oBACd,OACiD;CACjD,IAAI,CAAC,OAAO,SAAS,KAAK,KAAK,QAAQ,IAAK,OAAO;CACnD,IAAI,QAAQ,GAAK,OAAO;CACxB,IAAI,QAAQ,GAAK,OAAO;CACxB,IAAI,QAAQ,GAAK,OAAO;CACxB,OAAO;AACT;AAMA,MAAM,wCAAwB,IAAI,IAAI;CAAC;CAAW;CAAc;AAAa,CAAC;;;;;;;;AAS9E,SAAgB,kBAAkB,UAAmC;CACnE,IAAI,aAAa,KAAA,KAAa,aAAa,MAAM,OAAO;CACxD,MAAM,IAAI,SAAS,KAAK,CAAC,CAAC,YAAY;CACtC,OAAO,MAAM,MAAM,sBAAsB,IAAI,CAAC;AAChD;;;;;;;;;;;;ACnIA,MAAa,wBAAwB;CACnC;CACA;CACA;CACA;CACA;AACF;;AAMA,MAAM,kBAAqC;;AAG3C,SAAgB,WAAW,QAAwB;CACjD,MAAM,MAAM,gBAAgB,QAAQ,MAAM;CAC1C,OAAO,QAAQ,KAAK,KAAK,gBAAgB,SAAS,IAAI;AACxD;;;;;AAMA,SAAgB,YAAY,UAAqC;CAC/D,IAAI,QAAQ;CACZ,IAAI,YAAY;CAChB,KAAK,MAAM,KAAK,UAAU;EACxB,MAAM,IAAI,WAAW,CAAC;EACtB,IAAI,IAAI,WAAW;GACjB,YAAY;GACZ,QAAQ;EACV;CACF;CACA,OAAO;AACT;AAeA,SAAS,UAAU,UAA+B,KAAoB;CACpE,IAAI,CAAC,SAAS,WAAW,OAAO;CAGhC,MAAM,UAAU,eAAe,SAAS,SAAS;CACjD,OAAO,YAAY,QAAQ,WAAW;AACxC;;;;;;;AAQA,SAAgB,wBACd,WACA,oBACiC;CACjC,MAAM,IAAI,6BAA6B,WAAW,kBAAkB;CACpE,OAAO,KAAK,IAAI,UAAU,KAAK,KAAA;AACjC;;;;;;;;;AAUA,SAAgB,uBACd,WACA,UACA,oBACQ;CACR,MAAM,MAAM,QAAQ,kBAAkB;CACtC,IAAI,YAAY;CAChB,KAAK,IAAI,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK;EACzC,MAAM,WAAW,UAAU;EAC3B,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,KAAK,UAAU,UAAU,GAAG,GAAG;EAC3D,IAAI,cAAc,MAAM,YAAY,QAAQ,IAAI,YAAY,UAAU,UAAW,GAC/E,YAAY;CAEhB;CACA,OAAO;AACT;;;;;;AAOA,SAAgB,6BACd,WACA,oBACQ;CACR,OAAO,uBAAuB,YAAY,MAAM,CAAC,CAAC,UAAU,EAAE,EAAE,QAAQ,kBAAkB;AAC5F;AAEA,SAAS,YAAY,UAAuC;CAC1D,IAAI,CAAC,SAAS,WAAW,OAAO,OAAO;CACvC,OAAO,eAAe,SAAS,SAAS,CAAC,EAAE,QAAQ,KAAK,OAAO;AACjE;AAEA,SAAS,QAAQ,oBAAmC;CAElD,QADe,qBAAqB,eAAe,kBAAkB,IAAI,yBACxD,IAAI,KAAK;AAC5B;;;;;;;;;;;;;;AAsBA,SAAgB,uBACd,OACA,oBACQ;CACR,MAAM,YAAY,wBAAwB,MAAM,aAAa,CAAC,GAAG,kBAAkB;CACnF,IAAI,WAAW,QAAQ,OAAO,UAAU;CACxC,MAAM,WAAW,YAAY,MAAM,kBAAkB,CAAC,CAAC;CACvD,IAAI,aAAa,SACf,OAAO;CAET,IAAI,MAAM,WAAW,GACnB,OAAO;CAET,OAAO;AACT;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AEnIA,MAAM,gBAA0D;CAC9D,OAAO;EACL,IAAI;GAAC;GAAK;GAAK;EAAG;EAClB,IAAI;GAAC;GAAK;GAAK;EAAG;EAClB,IAAI;GAAC;GAAK;GAAK;EAAG;EAClB,GAAG;GAAC;GAAK;GAAK;EAAG;EACjB,GAAG;GAAC;GAAK;GAAK;EAAG;EACjB,GAAG;GAAC;GAAK;GAAK;EAAG;EAEjB,GAAG;GAAC;GAAK;GAAO;GAAK;GAAK;EAAI;EAC9B,IAAI;GAAC;GAAM;GAAM;GAAK;GAAK;EAAI;EAC/B,IAAI;GAAC;GAAM;GAAM;GAAK;EAAI;EAE1B,KAAK;GAAC;GAAK;GAAK;GAAM;GAAM;GAAK;EAAI;EACrC,IAAI;GAAC;GAAK;GAAK;GAAK;GAAK;EAAI;EAC7B,IAAI;GAAC;GAAK;GAAK;GAAK;EAAI;EACxB,IAAI;GAAC;GAAK;GAAK;GAAK;EAAI;EACxB,IAAI;GAAC;GAAK;GAAK;GAAK;EAAI;CAC1B;CACA,OAAO;EACL,IAAI;GAAC;GAAK;GAAK;GAAK;EAAG;EACvB,IAAI,CAAC,KAAK,GAAG;EACb,IAAI;GAAC;GAAK;GAAK;EAAG;EAClB,IAAI,CAAC,KAAK,GAAG;EACb,GAAG,CAAC,KAAK,GAAG;EACZ,GAAG;GAAC;GAAK;GAAK;EAAG;EACjB,GAAG;GAAC;GAAK;GAAK;EAAG;EACjB,GAAG;GAAC;GAAK;GAAK;EAAG;EAEjB,GAAG;GAAC;GAAK;GAAK;GAAK;GAAK;EAAG;EAC3B,IAAI;GAAC;GAAK;GAAK;GAAK;GAAK;EAAG;EAC5B,IAAI;GAAC;GAAK;GAAK;GAAK;EAAG;EAEvB,IAAI;GAAC;GAAK;GAAK;GAAK;EAAG;EACvB,IAAI;GAAC;GAAK;GAAK;GAAK;EAAG;EACvB,IAAI;GAAC;GAAK;GAAK;GAAK;EAAG;EACvB,KAAK;GAAC;GAAK;GAAK;GAAK;GAAK;EAAG;EAC7B,KAAK;GAAC;GAAK;GAAK;EAAG;EACnB,KAAK;GAAC;GAAK;GAAK;GAAK;EAAG;EACxB,KAAK;GAAC;GAAK;GAAK;EAAG;EACnB,IAAI;GAAC;GAAK;GAAK;EAAG;EAClB,IAAI;GAAC;GAAK;GAAK;GAAK;EAAG;EACvB,IAAI;GAAC;GAAK;GAAK;GAAK;EAAG;EACvB,IAAI;GAAC;GAAK;GAAK;GAAK;EAAG;CACzB;CACA,OAAO;EACL,IAAI;GAAC;GAAK;GAAK;GAAK;EAAG;EACvB,IAAI,CAAC,KAAK,GAAG;EACb,IAAI;GAAC;GAAK;GAAK;EAAG;EAClB,IAAI,CAAC,KAAK,GAAG;EACb,GAAG,CAAC,KAAK,GAAG;EACZ,GAAG;GAAC;GAAK;GAAK;EAAG;EACjB,GAAG;GAAC;GAAK;GAAK;EAAG;EACjB,GAAG;GAAC;GAAK;GAAK;EAAG;EAEjB,GAAG;GAAC;GAAK;GAAK;GAAK;GAAK;EAAG;EAC3B,IAAI;GAAC;GAAK;GAAK;GAAK;GAAK;EAAG;EAC5B,IAAI;GAAC;GAAK;GAAK;GAAK;EAAG;EAEvB,IAAI;GAAC;GAAK;GAAK;GAAK;EAAG;EACvB,IAAI;GAAC;GAAK;GAAK;GAAK;EAAG;EACvB,IAAI;GAAC;GAAK;GAAK;GAAK;EAAG;EACvB,KAAK;GAAC;GAAK;GAAK;GAAK;GAAK;EAAG;EAC7B,KAAK;GAAC;GAAK;GAAK;EAAG;EACnB,KAAK;GAAC;GAAK;GAAK;GAAK;EAAG;EACxB,KAAK;GAAC;GAAK;GAAK;EAAG;EACnB,IAAI;GAAC;GAAK;GAAK;EAAG;EAClB,IAAI;GAAC;GAAK;GAAK;GAAK;EAAG;EACvB,IAAI;GAAC;GAAK;GAAK;GAAK;EAAG;EACvB,IAAI;GAAC;GAAK;GAAK;GAAK;EAAG;CACzB;CACA,OAAO;EAEL,IAAI;GAAC;GAAK;GAAK;GAAK;EAAG;EACvB,IAAI,CAAC,KAAK,GAAG;EACb,IAAI,CAAC,KAAK,GAAG;EACb,IAAI;GAAC;GAAK;GAAK;EAAG;EAClB,IAAI;GAAC;GAAK;GAAK;EAAG;EAClB,IAAI;GAAC;GAAK;GAAK;EAAG;EAClB,IAAI;GAAC;GAAK;GAAK;EAAG;EAClB,IAAI;GAAC;GAAK;GAAK;EAAG;EAClB,IAAI;GAAC;GAAK;GAAK;EAAG;EAClB,IAAI;GAAC;GAAK;GAAK;EAAG;EAClB,IAAI;GAAC;GAAK;GAAK;EAAG;EAElB,GAAG;GAAC;GAAK;GAAK;GAAK;EAAG;EAEtB,KAAK;GAAC;GAAK;GAAK;GAAK;GAAK;EAAG;EAC7B,KAAK;GAAC;GAAK;GAAK;EAAG;EACnB,KAAK;GAAC;GAAK;GAAK;EAAG;EACnB,KAAK;GAAC;GAAK;GAAK;GAAK;EAAG;EACxB,KAAK;GAAC;GAAK;GAAK;GAAK;EAAG;EACxB,KAAK;GAAC;GAAK;GAAK;GAAK;EAAG;EACxB,KAAK;GAAC;GAAK;GAAK;GAAK;EAAG;EACxB,KAAK;GAAC;GAAK;GAAK;GAAK;EAAG;EACxB,KAAK;GAAC;GAAK;GAAK;GAAK;EAAG;EACxB,KAAK;GAAC;GAAK;GAAK;GAAK;GAAK;EAAG;EAC7B,KAAK;GAAC;GAAK;GAAK;GAAK;GAAK;EAAG;EAE7B,IAAI;GAAC;GAAK;GAAK;GAAK;EAAG;EACvB,IAAI;GAAC;GAAK;GAAK;GAAK;EAAG;EACvB,IAAI;GAAC;GAAK;GAAK;GAAK;EAAG;EAEvB,GAAG;GAAC;GAAK;GAAK;EAAG;EACjB,IAAI;GAAC;GAAK;GAAK;EAAG;EAClB,GAAG;GAAC;GAAK;GAAK;GAAK;EAAG;EACtB,GAAG;GAAC;GAAK;GAAK;EAAG;EACjB,IAAI;GAAC;GAAK;GAAK;GAAK;EAAG;EACvB,GAAG;GAAC;GAAK;GAAS;GAAS;GAAS;EAAK;CAC3C;AACF;AAEA,MAAM,mBAA6C;CACjD,OAAO;EAAC;EAAM;EAAM;EAAM;EAAK;EAAK;CAAG;CACvC,OAAO;EAAC;EAAM;EAAM;EAAM;EAAM;EAAK;EAAK;EAAK;CAAG;CAClD,OAAO;EAAC;EAAM;EAAM;EAAM;EAAM;EAAK;EAAK;EAAK;CAAG;CAClD,OAAO;EAAC;EAAM;EAAM;EAAM;EAAM;EAAM;EAAM;EAAM;EAAM;EAAM;EAAM;CAAI;AAC1E;;;;;;;;;;;AAYA,SAAgB,gBAAgB,QAAkC;CAChE,MAAM,0BAAU,IAAI,IAAoB;CACxC,IAAI,OAAO,WAAW,YAAY,OAAO,WAAW,GAClD,OAAO;EAAE,SAAS;EAAW;CAAQ;CAGvC,MAAM,WAAW,OAAO,MAAM,GAAG,CAAC,CAAC,QAAQ,MAAM,EAAE,SAAS,CAAC;CAC7D,IAAI,SAAS,WAAW,GACtB,OAAO;EAAE,SAAS;EAAW;CAAQ;CAGvC,IAAI,UAAU;CACd,IAAI,QAAQ;CACZ,MAAM,QAAQ,SAAS;CACvB,IAAI,UAAU,KAAA,GACZ,OAAO;EAAE,SAAS;EAAW;CAAQ;CAEvC,IAAI,MAAM,WAAW,OAAO,GAAG;EAC7B,UAAU,MAAM,MAAM,CAAC;EACvB,QAAQ;CACV,OAAO,IAAI,CAAC,MAAM,SAAS,GAAG,GAE5B,OAAO;EAAE,SAAS;EAAW;CAAQ;CAGvC,KAAK,IAAI,IAAI,OAAO,IAAI,SAAS,QAAQ,KAAK;EAC5C,MAAM,MAAM,SAAS;EACrB,IAAI,QAAQ,KAAA,GACV;EAEF,MAAM,QAAQ,IAAI,QAAQ,GAAG;EAC7B,IAAI,SAAS,KAAK,UAAU,IAAI,SAAS,GAEvC;EAEF,MAAM,MAAM,IAAI,MAAM,GAAG,KAAK;EAC9B,MAAM,QAAQ,IAAI,MAAM,QAAQ,CAAC;EACjC,QAAQ,IAAI,KAAK,KAAK;CACxB;CAEA,OAAO;EAAE;EAAS;CAAQ;AAC5B;;;;;;;;;;;;;;;;;;AAmBA,SAAgB,mBACd,QACA,SACsB;CACtB,MAAM,SAAmB,CAAC;CAE1B,IAAI,OAAO,WAAW,YAAY,OAAO,WAAW,GAClD,OAAO;EAAE,OAAO;EAAO,QAAQ,CAAC,iBAAiB;CAAE;CAGrD,MAAM,SAAS,gBAAgB,MAAM;CACrC,MAAM,IAAI,WAAW,OAAO;CAE5B,MAAM,UAAU,cAAc;CAC9B,MAAM,WAAW,iBAAiB;CAClC,IAAI,CAAC,WAAW,CAAC,UAAU;EACzB,OAAO,KAAK,6BAA6B,GAAG;EAC5C,OAAO;GAAE,OAAO;GAAO;EAAO;CAChC;CAEA,KAAK,MAAM,OAAO,UAChB,IAAI,CAAC,OAAO,QAAQ,IAAI,GAAG,GACzB,OAAO,KAAK,4BAA4B,KAAK;CAIjD,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,QAAQ,GAAG;EACnD,MAAM,UAAU,QAAQ;EACxB,IAAI,CAAC,SAEH;EAEF,IAAI,CAAC,QAAQ,SAAS,KAAK,GACzB,OAAO,KAAK,4BAA4B,IAAI,IAAI,MAAM,aAAa,QAAQ,KAAK,GAAG,EAAE,EAAE;CAE3F;CAEA,OAAO;EAAE,OAAO,OAAO,WAAW;EAAG;CAAO;AAC9C;AAiBA,MAAM,YAAoC;CAAE,GAAG;CAAM,GAAG;CAAM,GAAG;CAAM,GAAG;AAAI;AAC9E,MAAM,YAAoC;CAAE,GAAG;CAAM,GAAG;AAAK;AAC7D,MAAM,YAAoC;CAAE,GAAG;CAAM,GAAG;AAAK;AAC7D,MAAM,aAAqC;CAAE,GAAG;CAAK,GAAG;CAAM,GAAG;AAAK;AACtE,MAAM,sBAA8C;CAAE,GAAG;CAAM,GAAG;CAAM,GAAG;AAAK;AAChF,MAAM,oBAA4C;CAAE,GAAG;CAAM,GAAG;CAAM,GAAG;AAAI;AAC7E,MAAM,WAAmC;CAAE,GAAG;CAAK,GAAG;CAAK,GAAG;CAAM,GAAG;CAAM,GAAG;AAAK;AACrF,MAAM,YAAoC;CAAE,GAAG;CAAK,GAAG;CAAK,GAAG;CAAM,GAAG;CAAM,GAAG;AAAK;AACtF,MAAM,YAAoC;CAAE,GAAG;CAAK,GAAG;CAAK,GAAG;CAAM,GAAG;AAAK;;;;;;AAO7E,SAAS,UAAU,GAAmB;CACpC,MAAM,WAAW,KAAK,MAAM,IAAI,GAAM;CACtC,IAAI,WAAW,QAAU,GACvB,OAAO,WAAW;CAEpB,QAAQ,KAAK,MAAM,WAAW,GAAK,IAAI,KAAK;AAC9C;AAEA,SAAS,qBACP,OACA,SACA,KACQ;CACR,MAAM,IAAI,QAAQ,IAAI,GAAG;CACzB,IAAI,MAAM,KAAA,GACR,OAAO;CAET,MAAM,IAAI,MAAM;CAChB,IAAI,MAAM,KAAA,GACR,MAAM,IAAI,MAAM,qBAAqB,IAAI,UAAU,EAAE,EAAE;CAEzD,OAAO;AACT;;;;;;;;;;;AAYA,SAAgB,iBAAiB,QAA2B;CAC1D,MAAM,EAAE,SAAS,YAAY,gBAAgB,MAAM;CACnD,IAAI,YAAY,OACd,MAAM,IAAI,MAAM,oDAAoD,QAAQ,EAAE;CAEhF,KAAK,MAAM,KAAK;EAAC;EAAM;EAAM;EAAM;EAAM;EAAK;EAAK;EAAK;CAAG,GACzD,IAAI,CAAC,QAAQ,IAAI,CAAC,GAChB,MAAM,IAAI,MAAM,2CAA2C,EAAE,EAAE;CAInE,MAAM,QAAQ,QAAQ,IAAI,GAAG;CAC7B,IAAI,UAAU,OAAO,UAAU,KAC7B,MAAM,IAAI,MAAM,kCAAkC,SAAS,GAAG,EAAE;CAElE,MAAM,eAAe,UAAU;CAE/B,MAAM,UAAU,eAAe,oBAAoB;CACnD,MAAM,UAAU,OAA+B,WAA2B;EACxE,MAAM,MAAM,QAAQ,IAAI,MAAM;EAC9B,MAAM,IAAI,QAAQ,KAAA,IAAY,KAAA,IAAY,MAAM;EAChD,IAAI,MAAM,KAAA,GACR,MAAM,IAAI,MAAM,kCAAkC,OAAO,IAAI,OAAO,GAAG,EAAE;EAE3E,OAAO;CACT;CACA,MAAM,KAAK,OAAO,WAAW,IAAI;CACjC,MAAM,KAAK,OAAO,WAAW,IAAI;CACjC,MAAM,KAAK,OAAO,WAAW,IAAI;CACjC,MAAM,KAAK,OAAO,SAAS,IAAI;CAC/B,MAAM,IAAI,OAAO,YAAY,GAAG;CAChC,MAAM,IAAI,OAAO,YAAY,GAAG;CAChC,MAAM,IAAI,OAAO,YAAY,GAAG;CAEhC,MAAM,MAAM,KAAK,IAAI,MAAM,IAAI,MAAM,IAAI;CACzC,MAAM,SAAS,eACX,QAAQ,MAAM,QAAS,OAAO,KAAK,IAAI,MAAM,KAAM,EAAE,IACrD,OAAO;CACX,MAAM,iBAAiB,OAAO,KAAK,KAAK,KAAK;CAE7C,IAAI;CACJ,IAAI,UAAU,GACZ,YAAY;MACP,IAAI,cACT,YAAY,UAAU,KAAK,IAAI,QAAQ,SAAS,iBAAiB,EAAE,CAAC;MAEpE,YAAY,UAAU,KAAK,IAAI,SAAS,gBAAgB,EAAE,CAAC;CAG7D,MAAM,IAAI,qBAAqB,UAAU,SAAS,GAAG;CACrD,MAAM,KAAK,qBAAqB,WAAW,SAAS,IAAI;CACxD,MAAM,KAAK,qBAAqB,WAAW,SAAS,IAAI;CACxD,MAAM,gBAAgB,UAAU,YAAY,IAAI,KAAK,EAAE;CAEvD,OAAO;EAAE,SAAS;EAAO;EAAW;CAAc;AACpD;AA0BA,MAAM,SAASA;AAGf,MAAM,YAAoC;CAAE,GAAG;CAAK,GAAG;CAAK,GAAG;CAAK,GAAG;AAAI;AAC3E,MAAM,YAAoC;CAAE,GAAG;CAAK,GAAG;CAAK,GAAG;AAAI;AACnE,MAAM,YAAoC;CAAE,GAAG;CAAK,GAAG;CAAK,GAAG;AAAI;AACnE,MAAM,YAAoC;CAAE,GAAG;CAAK,GAAG;AAAI;AAC3D,MAAM,YAAoC;CAAE,GAAG;CAAK,GAAG;AAAI;AAC3D,MAAM,YAAoC;CAAE,GAAG;CAAK,GAAG;CAAK,GAAG;AAAI;AACnE,MAAM,YAAoC;CAAE,GAAG;CAAK,GAAG;CAAK,GAAG;AAAI;AACnE,MAAM,YAAoC;CAAE,GAAG;CAAK,GAAG;CAAK,GAAG;CAAK,GAAG;AAAI;AAC3E,MAAM,YAAoC;CAAE,GAAG;CAAK,GAAG;CAAK,GAAG;AAAI;;AAGnE,SAAS,IAAO,OAAsB,MAAiB;CACrD,IAAI,UAAU,KAAA,GACZ,MAAM,IAAI,MAAM,gCAAgC,MAAM;CAExD,OAAO;AACT;;;;;;AAOA,SAAS,aAAa,KAA0B,QAAwB;CACtE,MAAM,WAAW,IAAI,IAAI,MAAM,KAAK;CACpC,IAAI,WAAW,QAAQ,aAAa,MAAM,aAAa,MACrD,OAAO;CAET,KAAK,WAAW,QAAQ,WAAW,QAAQ,WAAW,UAAU,aAAa,MAAM,aAAa,MAC9F,OAAO;CAET,MAAM,WAAW,IAAI,IAAI,MAAM,MAAM;CACrC,IAAI,aAAa,KAAA,KAAa,aAAa,KACzC,OAAO;CAET,OAAO;AACT;AAEA,SAAS,yBAAyB,KAAkC;CAClE,MAAM,MAAM,MAAsB,aAAa,KAAK,CAAC;CAIrD,IAAI,MAAM;CACV,IAAI,GAAG,IAAI,MAAM,OAAO,GAAG,IAAI,MAAM,OAAO,GAAG,IAAI,MAAM,KACvD,MAAM;MACD,KAAK,GAAG,IAAI,MAAM,OAAO,GAAG,IAAI,MAAM,OAAO,GAAG,IAAI,MAAM,QAAQ,GAAG,IAAI,MAAM,KACpF,MAAM;CAGR,IAAI,MAAM;CACV,IAAI,GAAG,IAAI,MAAM,OAAO,GAAG,IAAI,MAAM,KACnC,MAAM;CAGR,IAAI,MAAM;CACV,IAAI,GAAG,IAAI,MAAM,OAAO,GAAG,IAAI,MAAM,KACnC,MAAM;MACD,IAAI,GAAG,IAAI,MAAM,OAAO,GAAG,IAAI,MAAM,OAAO,GAAG,IAAI,MAAM,KAC9D,MAAM;CAGR,IAAI,MAAM;CACV,IAAI,GAAG,KAAK,MAAM,OAAO,GAAG,KAAK,MAAM,KACrC,MAAM;MACD,IAAI,GAAG,IAAI,MAAM,OAAO,GAAG,IAAI,MAAM,OAAO,GAAG,IAAI,MAAM,KAC9D,MAAM;CAGR,IAAI,MAAM;CACV,IAAI,GAAG,GAAG,MAAM,KACd,MAAM;MACD,IAAI,GAAG,GAAG,MAAM,KACrB,MAAM;CAGR,IAAI,MAAM;CACV,IACG,GAAG,IAAI,MAAM,OAAO,GAAG,IAAI,MAAM,OACjC,GAAG,IAAI,MAAM,OAAO,GAAG,IAAI,MAAM,OACjC,GAAG,IAAI,MAAM,OAAO,GAAG,IAAI,MAAM,KAElC,MAAM;CAGR,OAAO,MAAM,MAAM,MAAM,MAAM,MAAM;AACvC;;AAGA,SAAgB,kBAAkB,QAAwB;CACxD,OAAO,yBAAyB,gBAAgB,MAAM,CAAC,CAAC,OAAO;AACjE;;AAGA,SAAS,oBAAoB,QAAgB,GAAmB;CAC9D,MAAM,MAAM,EAAE,QAAQ,MAAM;CAC5B,IAAI,MAAM,GACR,OAAO;CAET,MAAM,OAAO,EAAE,MAAM,MAAM,OAAO,SAAS,CAAC;CAC5C,MAAM,QAAQ,KAAK,QAAQ,GAAG;CAC9B,OAAO,SAAS,IAAI,KAAK,MAAM,GAAG,KAAK,IAAI;AAC7C;;AAGA,SAAS,gBAAgB,OAAe,YAA4B;CAClE,MAAM,IAAI,OAAO,OAAO;CACxB,OAAO,MAAM,KAAA,IAAY,MAAM,QAAQ;AACzC;AAEA,SAAS,YAAY,KAAkC;CACrD,MAAM,MAAM,MAAsB,aAAa,KAAK,CAAC;CAErD,IACE,GAAG,IAAI,MAAM,OAAO,GAAG,IAAI,MAAM,OAAO,GAAG,IAAI,MAAM,OACrD,GAAG,IAAI,MAAM,OAAO,GAAG,IAAI,MAAM,OAAO,GAAG,IAAI,MAAM,KAErD,OAAO;CAGT,MAAM,QAAQ,yBAAyB,GAAG;CAC1C,IAAI,QAAQ,IAAI,OAAO,OAAO,QAAQ,UAAU,MAAM,EAAE;CAGxD,MAAM,KAAK,MAAM,OAAO,CAAC;CACzB,MAAM,KAAK,MAAM,OAAO,CAAC;CACzB,MAAM,KAAK,MAAM,OAAO,CAAC;CACzB,MAAM,KAAK,MAAM,OAAO,CAAC;CACzB,MAAM,KAAK,MAAM,OAAO,CAAC;CACzB,MAAM,KAAK,MAAM,OAAO,CAAC;CAEzB,MAAM,KAAK,MAAsB,MAAM,WAAW,CAAC,IAAI;CACvD,MAAM,MAAM,EAAE,CAAC;CACf,MAAM,MAAM,EAAE,CAAC;CACf,MAAM,OAAO,GAAW,UACtB,MAAM,MAAM,GAAG,CAAC,IAAI,OAAO,KAAK,IAAI,MAAM,MAAM,IAAI,CAAC;CAEvD,MAAM,eAAe,gBAAgB,OAAO,IAAI,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;CAC5D,MAAM,eAAe,gBAAgB,OAAO,IAAI,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;CAC5D,MAAM,eAAe,gBAAgB,OAAO,IAAI,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;CAC5D,MAAM,eAAe,gBAAgB,OAAO,IAAI,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;CAG5D,IAAI,kBAAkB;CACtB,IAAK,QAAQ,KAAK,QAAQ,KAAO,QAAQ,KAAK,QAAQ,GACpD,kBAAkB,gBAAgB,OAAO,IAAI,GAAG,MAAM,CAAC,CAAC;MACnD,IAAI,QAAQ,KAAK,QAAQ,GAC9B,kBAAkB,gBAAgB,OAAO,IAAI,GAAG,MAAM,CAAC,CAAC;MACnD,IAAI,QAAQ,KAAK,QAAQ,GAAG;EACjC,MAAM,OAAO,OAAO,OAAO,IAAI,GAAG,MAAM,CAAC;EACzC,MAAM,QAAQ,OAAO,OAAO,IAAI,GAAG,MAAM,CAAC;EAC1C,IAAI,SAAS,KAAA,KAAa,UAAU,KAAA,GAClC,kBAAkB,QAAQ,KAAK,IAAI,MAAM,KAAK;OACzC,IAAI,UAAU,KAAA,GACnB,kBAAkB,QAAQ;CAE9B,OACE,kBAAkB,gBAAgB,OAAO,MAAM,MAAM,GAAG,CAAC,IAAI,OAAO,MAAM,CAAC,IAAI,MAAM,MAAM,GAAG,CAAC,IAAI,OAAO,MAAM,CAAC,CAAC;CAGpH,MAAM,WAAW,IAAI,OAAO,YAAY,IAAI,KAAK,mBAAmB,GAAG,EAAE;CACzE,MAAM,WAAW,IAAI,OAAO,YAAY,IAAI,KAAK,mBAAmB,GAAG,EAAE;CACzE,MAAM,cAAc,IAClB,IAAI,OAAO,YAAY,IAAI,KAAK,mBAAmB,GAAG,EAAE,CAAC,CAAC,KAC1D,mBAAmB,GAAG,IAAI,GAAG,EAC/B;CACA,MAAM,WAAW,IAAI,OAAO,YAAY,IAAI,KAAK,mBAAmB,GAAG,EAAE;CACzE,MAAM,WAAW,IAAI,OAAO,YAAY,IAAI,KAAK,mBAAmB,GAAG,EAAE;CAEzE,MAAM,aAAuB,CAAC;CAC9B,KAAK,MAAM,KAAK,UACd,KAAK,MAAM,KAAK,UACd,KAAK,MAAM,KAAK,aACd,KAAK,MAAM,KAAK,UACd,KAAK,MAAM,KAAK,UACd,WAAW,KAAK,IAAI,IAAI,IAAI,IAAI,CAAC;CAO3C,MAAM,QAAQ,OAA+B,QAAgB,cAC3D,IAAI,MAAM,GAAG,MAAM,IAAI,SAAS,OAAO,GAAG,GAAG,MAAM,GAAG,IACtD,IAAI,MAAM,oBAAoB,QAAQ,SAAS,IAAI,aAAa,QAAQ;CAE1E,IAAI,OAAO,GAAG,OAAO,GAAG,OAAO,GAAG,OAAO,GAAG,OAAO,GAAG,OAAO,GAAG,OAAO,GAAG,OAAO;CACjF,IAAI,OAAO,GAAG,OAAO,GAAG,OAAO,GAAG,OAAO,GAAG,OAAO,GAAG,OAAO;CAC7D,KAAK,MAAM,aAAa,YAAY;EAClC,OAAO,KAAK,WAAW,MAAM,SAAS;EACtC,OAAO,KAAK,WAAW,MAAM,SAAS;EACtC,OAAO,KAAK,WAAW,MAAM,SAAS;EACtC,OAAO,KAAK,WAAW,MAAM,SAAS;EACtC,OAAO,KAAK,WAAW,MAAM,SAAS;EACtC,OAAO,KAAK,WAAW,MAAM,SAAS;EACtC,OAAO,KAAK,WAAW,MAAM,SAAS;EACtC,OAAO,KAAK,WAAW,MAAM,SAAS;EACtC,OAAO,KAAK,WAAW,MAAM,SAAS;EACtC,OAAO,KAAK,WAAW,MAAM,SAAS;EACtC,OAAO,KAAK,WAAW,MAAM,SAAS;EACtC,OAAO,KAAK,WAAW,MAAM,SAAS;EACtC,OAAO,KAAK,WAAW,MAAM,SAAS;EACtC,OAAO,KAAK,WAAW,MAAM,SAAS;EACtC,IACE;GAAC;GAAM;GAAM;GAAM;GAAM;GAAM;GAAM;GAAM;GAAM;GAAM;GAAM;GAAM;GAAM;GAAM;EAAI,CAAC,CAAC,MAClF,MAAM,IAAI,CACb,GAEA;EAEF;CACF;CAEA,MAAM,SAAS,OAAO,OAAO;CAC7B,MAAM,SAAS,OAAO;CACtB,MAAM,YAAY,OAAO,OAAO,OAAO,OAAO,OAAO;CACrD,MAAM,SAAS,OAAO,OAAO;CAE7B,MAAM,OAAO;CACb,MAAM,YAAY,IAAI,OAAO,YAAY,IAAI,KAAK,mBAAmB,GAAG,EAAE,IAAI;CAC9E,MAAM,YAAY,IAAI,OAAO,YAAY,IAAI,KAAK,mBAAmB,GAAG,EAAE,IAAI;CAC9E,MAAM,eACJ,IACE,IAAI,OAAO,YAAY,OAAO,KAAK,sBAAsB,GAAG,EAAE,CAAC,CAAC,KAChE,sBAAsB,GAAG,IAAI,GAAG,EAClC,IAAI;CACN,MAAM,YAAY,IAAI,OAAO,YAAY,IAAI,KAAK,mBAAmB,GAAG,EAAE,IAAI;CAE9E,IAAI,YAAY;CAChB,IAAI,UAAU,GAAG,UAAU,GAAG,aAAa,GAAG,UAAU;CACxD,MAAM,UAAU;CAChB,IAAI,CAAC,OAAO,MAAM,YAAY,GAAG;EAC/B;EACA,UAAU,gBAAgB,SAAS;CACrC;CACA,IAAI,CAAC,OAAO,MAAM,YAAY,GAAG;EAC/B;EACA,UAAU,gBAAgB,SAAS;CACrC;CACA,IAAI,CAAC,OAAO,MAAM,eAAe,GAAG;EAClC;EACA,aAAa,mBAAmB,YAAY;CAC9C;CACA,IAAI,CAAC,OAAO,MAAM,YAAY,GAAG;EAC/B;EACA,UAAU,gBAAgB,SAAS;CACrC;CACA,IAAI,CAAC,OAAO,MAAM,YAAY,GAC5B;CAGF,MAAM,eACJ,cAAc,IAAI,KAAK,UAAU,UAAU,aAAa,UAAU,WAAW;CAE/E,SAAS;CACT,IAAI,QAAQ,GACV,QAAQ;CAEV,IAAI,QAAQ,IACV,QAAQ;CAEV,OAAO,KAAK,MAAM,QAAQ,EAAE,IAAI;AAClC;;AAGA,SAAS,2BAA2B,QAAwB;CAC1D,OAAO,OACJ,MAAM,GAAG,CAAC,CACV,QAAQ,QAAQ,CAAC,IAAI,WAAW,IAAI,CAAC,CAAC,CACtC,KAAK,GAAG;AACb;;;;;;;;;;;AAYA,SAAgB,mBAAmB,QAA2B;CAC5D,MAAM,EAAE,YAAY,gBAAgB,MAAM;CAC1C,IAAI,YAAY,OACd,MAAM,IAAI,MAAM,wDAAwD,QAAQ,EAAE;CAEpF,MAAM,EAAE,OAAO,WAAW,mBAAmB,QAAQ,KAAK;CAC1D,IAAI,CAAC,OACH,MAAM,IAAI,MAAM,6BAA6B,OAAO,KAAK,IAAI,GAAG;CAGlE,MAAM,gBAAgB,YAAY,gBAAgB,MAAM,CAAC,CAAC,OAAO;CAEjE,OAAO;EAAE,SAAS;EAAO,WADP,YAAY,gBAAgB,2BAA2B,MAAM,CAAC,CAAC,CAAC,OACjD;EAAG;CAAc;AACpD;;;ACtpBA,MAAM,aAAa;AACnB,MAAM,wBAAwB;AAC9B,MAAM,sBAAsB;AAC5B,MAAM,8BAAc,IAAI,IAAI;CAAC;CAAK;CAAK;CAAK;AAAG,CAAC;;;;;;;;AAShD,SAAS,uBAAuB,MAAwB;CACtD,MAAM,SAAmB,CAAC;CAC1B,IAAI,UAAU;CACd,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;EACpC,MAAM,KAAK,KAAK;EAChB,IAAI,OAAO,QAAQ,IAAI,IAAI,KAAK,QAAQ;GACtC,MAAM,OAAO,KAAK,IAAI;GAEtB,IAAI,SAAS,OAAO,SAAS,MAAM;IACjC,WAAW;IACX;IACA;GACF;GAEA,WAAW;GACX;EACF;EACA,IAAI,OAAO,KAAK;GACd,OAAO,KAAK,OAAO;GACnB,UAAU;GACV;EACF;EACA,WAAW;CACb;CACA,OAAO,KAAK,OAAO;CACnB,OAAO;AACT;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA8BA,SAAgB,SAAS,QAAkC;CACzD,IAAI,CAAC,OAAO,WAAW,UAAU,GAC/B,OAAO;CAGT,MAAM,WAAqB,CAAC;CAC5B,MAAM,OAAO,OAAO,MAAM,CAAiB;CAK3C,MAAM,eAAe,KAAK,WAAW;CAErC,MAAM,YAAY,eAAe,CAAC,IAAI,uBAAuB,IAAI;CAGjE,MAAM,cAAc,eAAe,IAAI,IAAI,UAAU;CAErD,IAAI,UAAU,SAAS,qBACrB,SAAS,KAAK,sBAAsB;MAC/B,IAAI,UAAU,SAAS,qBAC5B,SAAS,KACP,uBAAuB,sBAAsB,+BAA+B,aAC9E;CAKF,MAAM,WAAW,eAAe,KAAK;CACrC,MAAM,SAAmB,UAAU,MAAM,GAAG,mBAAmB;CAC/D,OAAO,OAAO,SAAS,qBACrB,OAAO,KAAK,QAAQ;CAKtB,MAAM,CACJ,OAAO,IACP,SAAS,IACT,UAAU,IACV,UAAU,IACV,SAAS,IACT,UAAU,IACV,WAAW,IACX,YAAY,IACZ,WAAW,IACX,WAAW,IACX,QAAQ,MACN;CAEJ,IAAI,CAAC,YAAY,IAAI,IAAI,GACvB,SAAS,KAAK,iBAAiB,MAAM;CAGvC,OAAO;EACL,KAAK;EACL;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;CACF;AACF;;;ACjJA,MAAM,cAAc;;;;;;;;;;;;;;;;;;;;AAqBpB,SAAgB,UAAU,SAAoC;CAC5D,IAAI,CAAC,WAAW,CAAC,QAAQ,WAAW,WAAW,GAC7C,OAAO;CAGT,MAAM,MAAM;CACZ,MAAM,WAAqB,CAAC;CAI5B,IAAI,YAAY,QAAQ,MAAM,CAAkB;CAKhD,OAAO,UAAU,WAAW,GAAG,GAC7B,YAAY,UAAU,MAAM,CAAC;CAG/B,IAAI,UAAU,WAAW,GACvB,OAAO;CAOT,IAAI,UAAyB;CAC7B,MAAM,UAAU,UAAU,QAAQ,GAAG;CACrC,IAAI,YAAY,IAAI;EAClB,UAAU,UAAU,MAAM,UAAU,CAAC;EACrC,YAAY,UAAU,MAAM,GAAG,OAAO;EACtC,IAAI,QAAQ,WAAW,GACrB,UAAU;CAEd;CAGA,MAAM,6BAAa,IAAI,IAAoB;CAC3C,MAAM,OAAO,UAAU,QAAQ,GAAG;CAClC,IAAI,SAAS,IAAI;EACf,MAAM,OAAO,UAAU,MAAM,OAAO,CAAC;EACrC,YAAY,UAAU,MAAM,GAAG,IAAI;EACnC,gBAAgB,MAAM,YAAY,QAAQ;CAC5C;CAIA,OAAO,UAAU,SAAS,GAAG,GAC3B,YAAY,UAAU,MAAM,GAAG,EAAE;CAInC,MAAM,aAAa,UAAU,QAAQ,GAAG;CACxC,IAAI;CACJ,IAAI;CACJ,IAAI,eAAe,IAAI;EACrB,OAAO;EACP,WAAW;CACb,OAAO;EACL,OAAO,UAAU,MAAM,GAAG,UAAU;EACpC,WAAW,UAAU,MAAM,aAAa,CAAC;CAC3C;CAEA,IAAI,KAAK,WAAW,GAClB,OAAO;CAET,OAAO,KAAK,YAAY;CAKxB,IAAI,UAAyB;CAC7B,MAAM,SAAS,SAAS,YAAY,GAAG;CACvC,IAAI,YAAY;CAChB,IAAI,WAAW,IAAI;EACjB,UAAU,SAAS,MAAM,SAAS,CAAC;EACnC,YAAY,SAAS,MAAM,GAAG,MAAM;EACpC,UAAU,WAAW,OAAO;CAC9B;CAIA,IAAI,YAA2B;CAC/B,IAAI;CACJ,MAAM,YAAY,UAAU,YAAY,GAAG;CAC3C,IAAI,cAAc,IAChB,OAAO;MACF;EACL,YAAY,UAAU,MAAM,GAAG,SAAS;EACxC,OAAO,UAAU,MAAM,YAAY,CAAC;CACtC;CAGA,IAAI,cAAc,MAEhB,YAAY,UAAU,MAAM,GAAG,CAAC,CAAC,IAAI,UAAU,CAAC,CAAC,KAAK,GAAG;CAE3D,OAAO,WAAW,IAAI;CAEtB,IAAI,KAAK,WAAW,GAClB,SAAS,KAAK,kCAAkC;CAIlD,IAAI,cAAc,QAAQ,UAAU,WAAW,GAC7C,YAAY;CAId,IAAI,YAAY,QAAQ,QAAQ,WAAW,GACzC,UAAU;CAGZ,OAAO;EACL;EACA;EACA;EACA;EACA;EACA;EACA;EACA;CACF;AACF;;;;;;AAOA,SAAS,gBACP,MACA,KACA,UACM;CACN,MAAM,QAAQ,KAAK,MAAM,GAAG;CAC5B,KAAK,MAAM,QAAQ,OAAO;EACxB,IAAI,KAAK,WAAW,GAClB;EAEF,MAAM,KAAK,KAAK,QAAQ,GAAG;EAC3B,IAAI,OAAO,IAAI;GACb,IAAI,IAAI,MAAM,EAAE;GAChB,SAAS,KAAK,cAAc,KAAK,eAAe;GAChD;EACF;EACA,MAAM,MAAM,KAAK,MAAM,GAAG,EAAE;EAC5B,MAAM,QAAQ,KAAK,MAAM,KAAK,CAAC;EAC/B,IAAI,IAAI,KAAK,WAAW,KAAK,CAAC;CAChC;AACF;;;;;;AAOA,SAAS,WAAW,GAAmB;CACrC,IAAI;EACF,OAAO,mBAAmB,CAAC;CAC7B,QAAQ;EACN,OAAO;CACT;AACF;;;;ACxNA,MAAa,yBAAyB,KAAK,OAAO;;;;;;AAOlD,SAAgB,kBAAkB,OAA4B,UAAU,GAAS;CAC/E,MAAM,QAAQ,UAAU,IAAI,UAAU;CACtC,IAAI,OAAO,UAAU,UAAU;EAC7B,IAAI,MAAM,SAAS,OAAO,MAAM,SAAS,OAAO,MAAM,MAAM;EAC5D;CACF;CAGA,IAAI,MAAM,SAAS,KAAK,OAAO;CAC/B,MAAM,MAAM,eAAe,KAAK;CAChC,IAAI,MAAM,OAAO,MAAM,SAAS,OAAO,GAAG;AAC5C;AAEA,SAAS,SAAS,OAAe,KAAoB;CACnD,uBAAO,IAAI,MAAM,yCAAyC,MAAM,UAAU,IAAI,iBAAiB;AACjG;;;;;;;AAQA,SAAS,eAAe,GAAmB;CACzC,IAAI,QAAQ;CACZ,KAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;EACjC,MAAM,IAAI,EAAE,WAAW,CAAC;EACxB,IAAI,IAAI,KACN,SAAS;OACJ,IAAI,IAAI,MACb,SAAS;OACJ,IAAI,KAAK,SAAU,KAAK,UAAW,EAAE,WAAW,IAAI,CAAC,IAAI,WAAY,OAAQ;GAClF,SAAS;GACT;EACF,OACE,SAAS;CAEb;CACA,OAAO;AACT"}
1
+ {"version":3,"file":"index.js","names":["cvss40Data"],"sources":["../src/severity/index.ts","../src/status/index.ts","../src/cvss/cvss40-data.json","../src/cvss/index.ts","../src/cpe/index.ts","../src/purl/index.ts","../src/size/index.ts"],"sourcesContent":["/**\n * Severity-to-impact mapping utilities.\n *\n * These define the canonical bidirectional mapping between severity labels\n * (critical, high, medium, low, informational) and HDF impact scores (0.0–1.0),\n * aligned with CVSS 3.x severity bands normalized to 0–1.\n *\n * Threshold ranges (used by impactToSeverity):\n * >=0.9 = critical (CVSS 9.0–10.0)\n * [0.7, 0.9) = high (CVSS 7.0–8.9)\n * [0.4, 0.7) = medium (CVSS 4.0–6.9)\n * (0.0, 0.4) = low (CVSS 0.1–3.9)\n * 0.0 = informational (CVSS 0.0)\n */\n\nconst severityMap: Record<string, number> = {\n critical: 0.9,\n high: 0.7,\n medium: 0.5,\n low: 0.3,\n info: 0.0,\n none: 0.0,\n informational: 0.0,\n information: 0.0,\n};\n\n/**\n * Map a severity string to an impact score.\n *\n * @param severity - Severity level (case-insensitive), or null for no severity assessment\n * @returns Impact score between 0.0 and 1.0; null when input is null; defaults to 0.5 for unrecognized values\n */\nexport function severityToImpact(severity: null): null;\nexport function severityToImpact(severity: string | undefined): number;\nexport function severityToImpact(severity: string | null | undefined): number | null;\nexport function severityToImpact(severity: string | null | undefined): number | null {\n if (severity === null) return null;\n // Absent field: match Go's zero-value semantics (\"\" → the 0.5 default)\n // rather than throwing on .toLowerCase() of undefined.\n const normalized = (severity ?? '').toLowerCase();\n // Own-property guard: a prototype-named token (\"constructor\") must take the\n // default like any unknown word, not return an inherited Object member.\n return Object.prototype.hasOwnProperty.call(severityMap, normalized)\n ? severityMap[normalized]!\n : 0.5;\n}\n\n/**\n * Map severity to impact, checking custom aliases first, then the shared\n * standard map, then the caller default. Case-insensitive. Use for tools with\n * non-standard severity labels (sonarqube BLOCKER, veracode numeric levels,\n * grype critical=0.9). Absent (undefined/null) values take the default —\n * matching the Go peer's zero-value \"\" behavior. TS mirror of Go's\n * SeverityToImpactWithAliases; converters must not hand-roll local severity\n * maps around it (that fork is how Go/TS impact divergence happens).\n */\nexport function severityToImpactWithAliases(\n severity: string | null | undefined,\n aliases: Record<string, number>,\n defaultVal: number,\n): number {\n const lower = (severity ?? '').toLowerCase();\n // Own-property guards: prototype-named tokens (\"constructor\") must take the\n // default like any unknown word, not resolve to an inherited Object member.\n if (Object.prototype.hasOwnProperty.call(aliases, lower)) return aliases[lower]!;\n if (Object.prototype.hasOwnProperty.call(severityMap, lower)) return severityMap[lower]!;\n return defaultVal;\n}\n\n/**\n * Round an HDF impact value to 2 decimal places — its canonical precision —\n * eliminating the representation noise that binary float division leaves behind\n * (e.g. 9.8 / 10 = 0.9800000000000001). Impact is defined on 0.0–1.0 with a\n * natural 0.01 grid (a 1-decimal CVSS score / 10), so this is lossless in\n * intent. Use it wherever impact is COMPUTED (divided or otherwise\n * arithmetically derived), not when assigned from a literal band.\n */\nexport function roundImpact(x: number): number {\n return Math.round(x * 100) / 100;\n}\n\n/**\n * Map an impact score to a severity string.\n *\n * @param impact - Impact score (0.0 to 1.0), or null for no impact assessment\n * @returns Severity level string, or null when input is null\n */\nexport function impactToSeverity(impact: null): null;\nexport function impactToSeverity(impact: number): string;\nexport function impactToSeverity(impact: number | null): string | null;\nexport function impactToSeverity(impact: number | null): string | null {\n if (impact === null) return null;\n if (impact >= 0.9) return 'critical';\n if (impact >= 0.7) return 'high';\n if (impact >= 0.4) return 'medium';\n if (impact > 0.0) return 'low';\n return 'informational';\n}\n\n/**\n * Map a raw CVSS base score (0.0–10.0) to a FIRST qualitative severity band.\n *\n * Bands per FIRST CVSS v3.x / v4.0 spec:\n * none = 0.0\n * low = 0.1 – 3.9\n * medium = 4.0 – 6.9\n * high = 7.0 – 8.9\n * critical = 9.0 – 10.0\n *\n * Out-of-range inputs are clamped: scores < 0.1 → \"none\" (band floor),\n * scores > 10.0 → \"critical\". This matches scanner behavior of treating\n * malformed scores as informational/critical extremes rather than throwing.\n *\n * @param score - CVSS base score\n * @returns FIRST severity band label\n */\nexport function cvssScoreToSeverity(\n score: number,\n): 'none' | 'low' | 'medium' | 'high' | 'critical' {\n if (!Number.isFinite(score) || score < 0.1) return 'none';\n if (score < 4.0) return 'low';\n if (score < 7.0) return 'medium';\n if (score < 9.0) return 'high';\n return 'critical';\n}\n\n// Severity vocabulary values that assert \"no rating was made\" (grype Unknown,\n// Dependency-Track UNASSIGNED, Microsoft Graph unSpecified). Distinct from the\n// zero-impact RATED tier (info/none/informational) and from grype's\n// negligible, which is the lowest rating, not an absent one.\nconst unratedSeverityTokens = new Set(['unknown', 'unassigned', 'unspecified']);\n\n/**\n * Report whether a source severity carries no rating at all: the field is\n * absent/blank, or the token is an explicit no-rating value. Tokens the\n * vocabulary simply doesn't recognize are NOT unrated — an unknown word is not\n * an assertion of unratedness. Converters use this to emit the shared unrated\n * marker so a defaulted impact stays distinguishable from a genuine medium.\n */\nexport function isUnratedSeverity(severity?: string | null): boolean {\n if (severity === undefined || severity === null) return true;\n const s = severity.trim().toLowerCase();\n return s === '' || unratedSeverityTokens.has(s);\n}\n","/**\n * Canonical HDF result-status ordering and effective-status computation.\n *\n * This is the single source of truth for worst-wins roll-up and\n * effective-status selection across hdf-libs (mirrored in Go as\n * hdf-utilities/go status.go). The precedence rules are published in\n * site/docs/architecture/status-determination.md; do not re-implement them.\n */\n\nimport { parseTimestamp } from '../string/index.js';\n\n/** Canonical worst-wins ordering, worst first. */\nexport const STATUS_SEVERITY_ORDER = [\n 'error',\n 'failed',\n 'passed',\n 'notApplicable',\n 'notReviewed',\n] as const;\n\n/** A member of the canonical ordering, as a literal union. */\nexport type StatusSeverity = (typeof STATUS_SEVERITY_ORDER)[number];\n\n/** Widened view for lookups over arbitrary input strings. */\nconst SEVERITY_LOOKUP: readonly string[] = STATUS_SEVERITY_ORDER;\n\n/** Severity rank of a status: higher = worse. Unknown statuses rank -1. */\nexport function statusRank(status: string): number {\n const idx = SEVERITY_LOOKUP.indexOf(status);\n return idx === -1 ? -1 : SEVERITY_LOOKUP.length - 1 - idx;\n}\n\n/**\n * Rolls a list of result statuses up to the worst one. An empty list (or a\n * list of only unknown statuses) rolls up to \"notReviewed\".\n */\nexport function worstStatus(statuses: readonly string[]): string {\n let worst = 'notReviewed';\n let worstRank = -1;\n for (const s of statuses) {\n const r = statusRank(s);\n if (r > worstRank) {\n worstRank = r;\n worst = s;\n }\n }\n return worst;\n}\n\n/**\n * Neutral shape of a status override for effective-status computation.\n * Callers map their concrete types (schema objects or raw JSON) onto it.\n */\nexport interface StatusOverrideInput {\n /** Empty/undefined means the override carries no status and never governs. */\n status?: string;\n /** RFC3339 timestamp; undefined sorts earliest. */\n appliedAt?: string;\n /** RFC3339 timestamp; undefined means the override never expires. */\n expiresAt?: string;\n}\n\nfunction isExpired(override: StatusOverrideInput, ref: Date): boolean {\n if (!override.expiresAt) return false;\n // parseTimestamp normalizes zone-less values to UTC (a raw `new Date` would\n // read them as host-local and make expiry host-timezone-dependent).\n const expires = parseTimestamp(override.expiresAt);\n return expires !== null && expires <= ref;\n}\n\n/**\n * Selects the override that governs a requirement: the most recently applied\n * (by appliedAt) non-expired override that carries a status — matching the\n * schema's definition of disposition (\"the most recent non-expired\n * override\"). Returns undefined when no override governs.\n */\nexport function governingStatusOverride(\n overrides: readonly StatusOverrideInput[],\n referenceTimestamp?: string\n): StatusOverrideInput | undefined {\n const i = governingStatusOverrideIndex(overrides, referenceTimestamp);\n return i >= 0 ? overrides[i] : undefined;\n}\n\n/**\n * Returns the index of the most recently applied (by appliedAt) non-expired\n * override among those for which `eligible` returns true, or -1 when none\n * qualifies. Generalizes governing-override selection to per-field\n * eligibility: the schema defines effectiveStatus, effectiveImpact, and\n * disposition each as \"the most recent non-expired override\" carrying the\n * relevant field, so callers pass the field-presence check as the predicate.\n */\nexport function governingOverrideIndex(\n overrides: readonly StatusOverrideInput[],\n eligible: (index: number) => boolean,\n referenceTimestamp?: string\n): number {\n const ref = refTime(referenceTimestamp);\n let governing = -1;\n for (let i = 0; i < overrides.length; i++) {\n const override = overrides[i];\n if (!override || !eligible(i) || isExpired(override, ref)) continue;\n if (governing === -1 || appliedTime(override) > appliedTime(overrides[governing]!)) {\n governing = i;\n }\n }\n return governing;\n}\n\n/**\n * Index variant of {@link governingStatusOverride}: returns -1 when no\n * override governs. Callers holding richer concrete override types use the\n * index to recover their own object.\n */\nexport function governingStatusOverrideIndex(\n overrides: readonly StatusOverrideInput[],\n referenceTimestamp?: string\n): number {\n return governingOverrideIndex(overrides, (i) => !!overrides[i]?.status, referenceTimestamp);\n}\n\nfunction appliedTime(override: StatusOverrideInput): number {\n if (!override.appliedAt) return Number.NEGATIVE_INFINITY;\n return parseTimestamp(override.appliedAt)?.getTime() ?? Number.NEGATIVE_INFINITY;\n}\n\nfunction refTime(referenceTimestamp?: string): Date {\n const parsed = referenceTimestamp ? parseTimestamp(referenceTimestamp) : null;\n return parsed ?? new Date();\n}\n\n/** Neutral shape of a requirement for effective-status computation. */\nexport interface EffectiveStatusInput {\n impact: number;\n resultStatuses?: readonly string[];\n overrides?: readonly StatusOverrideInput[];\n}\n\n/**\n * Determines a requirement's effective status — the single canonical\n * implementation of the ladder in status-determination.md:\n *\n * 1. the governing (most recent non-expired) status override's status\n * 2. else result roll-up \"error\" → \"error\"\n * 3. else impact === 0 → \"notApplicable\"\n * 4. else worst-wins roll-up of the result statuses (empty → \"notReviewed\")\n *\n * The stored effectiveStatus field is an output cache and is never read: the\n * only sanctioned channel for status to diverge from the results is a\n * governing override.\n */\nexport function computeEffectiveStatus(\n input: EffectiveStatusInput,\n referenceTimestamp?: string\n): string {\n const governing = governingStatusOverride(input.overrides ?? [], referenceTimestamp);\n if (governing?.status) return governing.status;\n const rolledUp = worstStatus(input.resultStatuses ?? []);\n if (rolledUp === 'error') {\n return 'error';\n }\n if (input.impact === 0) {\n return 'notApplicable';\n }\n return rolledUp;\n}\n","","/**\n * CVSS vector parsing and validation utilities.\n *\n * Supports CVSS 2.0 (legacy, no prefix), 3.0, 3.1, and 4.0 vector strings.\n * Parsing is permissive: it splits any well-shaped key:value pair separated\n * by `/`. Validation is strict per the FIRST grammar for each version.\n *\n * References:\n * - CVSS 2.0: https://www.first.org/cvss/v2/guide\n * - CVSS 3.1: https://www.first.org/cvss/v3.1/specification-document\n * - CVSS 4.0: https://www.first.org/cvss/v4.0/specification-document\n */\n\nimport cvss40Data from './cvss40-data.json';\n\nexport interface ParsedCvssVector {\n /** \"2.0\" | \"3.0\" | \"3.1\" | \"4.0\" | \"unknown\" */\n version: string;\n /** Metric name -> metric value (e.g. \"AV\" -> \"N\"). Order-preserving via Map. */\n metrics: Map<string, string>;\n}\n\nexport interface CvssValidationResult {\n valid: boolean;\n errors: string[];\n}\n\n/**\n * Allowed values for each metric, keyed by CVSS major version.\n *\n * Sourced from FIRST specifications (linked above). Only metrics present\n * in a given version's grammar appear in that version's map; unknown metrics\n * encountered during validation are ignored (forward-compat).\n */\nconst METRIC_VALUES: Record<string, Record<string, string[]>> = {\n '2.0': {\n AV: ['L', 'A', 'N'],\n AC: ['H', 'M', 'L'],\n Au: ['M', 'S', 'N'],\n C: ['N', 'P', 'C'],\n I: ['N', 'P', 'C'],\n A: ['N', 'P', 'C'],\n // Temporal\n E: ['U', 'POC', 'F', 'H', 'ND'],\n RL: ['OF', 'TF', 'W', 'U', 'ND'],\n RC: ['UC', 'UR', 'C', 'ND'],\n // Environmental\n CDP: ['N', 'L', 'LM', 'MH', 'H', 'ND'],\n TD: ['N', 'L', 'M', 'H', 'ND'],\n CR: ['L', 'M', 'H', 'ND'],\n IR: ['L', 'M', 'H', 'ND'],\n AR: ['L', 'M', 'H', 'ND'],\n },\n '3.0': {\n AV: ['N', 'A', 'L', 'P'],\n AC: ['L', 'H'],\n PR: ['N', 'L', 'H'],\n UI: ['N', 'R'],\n S: ['U', 'C'],\n C: ['N', 'L', 'H'],\n I: ['N', 'L', 'H'],\n A: ['N', 'L', 'H'],\n // Temporal\n E: ['X', 'U', 'P', 'F', 'H'],\n RL: ['X', 'O', 'T', 'W', 'U'],\n RC: ['X', 'U', 'R', 'C'],\n // Environmental\n CR: ['X', 'L', 'M', 'H'],\n IR: ['X', 'L', 'M', 'H'],\n AR: ['X', 'L', 'M', 'H'],\n MAV: ['X', 'N', 'A', 'L', 'P'],\n MAC: ['X', 'L', 'H'],\n MPR: ['X', 'N', 'L', 'H'],\n MUI: ['X', 'N', 'R'],\n MS: ['X', 'U', 'C'],\n MC: ['X', 'N', 'L', 'H'],\n MI: ['X', 'N', 'L', 'H'],\n MA: ['X', 'N', 'L', 'H'],\n },\n '3.1': {\n AV: ['N', 'A', 'L', 'P'],\n AC: ['L', 'H'],\n PR: ['N', 'L', 'H'],\n UI: ['N', 'R'],\n S: ['U', 'C'],\n C: ['N', 'L', 'H'],\n I: ['N', 'L', 'H'],\n A: ['N', 'L', 'H'],\n // Temporal\n E: ['X', 'U', 'P', 'F', 'H'],\n RL: ['X', 'O', 'T', 'W', 'U'],\n RC: ['X', 'U', 'R', 'C'],\n // Environmental\n CR: ['X', 'L', 'M', 'H'],\n IR: ['X', 'L', 'M', 'H'],\n AR: ['X', 'L', 'M', 'H'],\n MAV: ['X', 'N', 'A', 'L', 'P'],\n MAC: ['X', 'L', 'H'],\n MPR: ['X', 'N', 'L', 'H'],\n MUI: ['X', 'N', 'R'],\n MS: ['X', 'U', 'C'],\n MC: ['X', 'N', 'L', 'H'],\n MI: ['X', 'N', 'L', 'H'],\n MA: ['X', 'N', 'L', 'H'],\n },\n '4.0': {\n // Base\n AV: ['N', 'A', 'L', 'P'],\n AC: ['L', 'H'],\n AT: ['N', 'P'],\n PR: ['N', 'L', 'H'],\n UI: ['N', 'P', 'A'],\n VC: ['H', 'L', 'N'],\n VI: ['H', 'L', 'N'],\n VA: ['H', 'L', 'N'],\n SC: ['H', 'L', 'N'],\n SI: ['H', 'L', 'N'],\n SA: ['H', 'L', 'N'],\n // Threat\n E: ['X', 'A', 'P', 'U'],\n // Environmental (modified base) — same enums as their base counterparts plus X\n MAV: ['X', 'N', 'A', 'L', 'P'],\n MAC: ['X', 'L', 'H'],\n MAT: ['X', 'N', 'P'],\n MPR: ['X', 'N', 'L', 'H'],\n MUI: ['X', 'N', 'P', 'A'],\n MVC: ['X', 'H', 'L', 'N'],\n MVI: ['X', 'H', 'L', 'N'],\n MVA: ['X', 'H', 'L', 'N'],\n MSC: ['X', 'H', 'L', 'N'],\n MSI: ['X', 'S', 'H', 'L', 'N'],\n MSA: ['X', 'S', 'H', 'L', 'N'],\n // Requirements\n CR: ['X', 'H', 'M', 'L'],\n IR: ['X', 'H', 'M', 'L'],\n AR: ['X', 'H', 'M', 'L'],\n // Supplemental\n S: ['X', 'N', 'P'],\n AU: ['X', 'N', 'Y'],\n R: ['X', 'A', 'U', 'I'],\n V: ['X', 'D', 'C'],\n RE: ['X', 'L', 'M', 'H'],\n U: ['X', 'Clear', 'Green', 'Amber', 'Red'],\n },\n};\n\nconst REQUIRED_METRICS: Record<string, string[]> = {\n '2.0': ['AV', 'AC', 'Au', 'C', 'I', 'A'],\n '3.0': ['AV', 'AC', 'PR', 'UI', 'S', 'C', 'I', 'A'],\n '3.1': ['AV', 'AC', 'PR', 'UI', 'S', 'C', 'I', 'A'],\n '4.0': ['AV', 'AC', 'AT', 'PR', 'UI', 'VC', 'VI', 'VA', 'SC', 'SI', 'SA'],\n};\n\n/**\n * Parse a CVSS vector string into version + metric map.\n *\n * Version detection rule: a leading `CVSS:X.Y` segment yields version \"X.Y\".\n * Otherwise (legacy v2 vectors), version is \"2.0\". Malformed input yields\n * \"unknown\" with an empty metric map; no exceptions are thrown.\n *\n * @param vector - CVSS vector string (e.g. \"CVSS:3.1/AV:N/AC:L/...\")\n * @returns Parsed version + metric map\n */\nexport function parseCvssVector(vector: string): ParsedCvssVector {\n const metrics = new Map<string, string>();\n if (typeof vector !== 'string' || vector.length === 0) {\n return { version: 'unknown', metrics };\n }\n\n const segments = vector.split('/').filter((s) => s.length > 0);\n if (segments.length === 0) {\n return { version: 'unknown', metrics };\n }\n\n let version = '2.0';\n let start = 0;\n const first = segments[0];\n if (first === undefined) {\n return { version: 'unknown', metrics };\n }\n if (first.startsWith('CVSS:')) {\n version = first.slice(5);\n start = 1;\n } else if (!first.includes(':')) {\n // No prefix AND first segment isn't a key:value pair — bail.\n return { version: 'unknown', metrics };\n }\n\n for (let i = start; i < segments.length; i++) {\n const seg = segments[i];\n if (seg === undefined) {\n continue;\n }\n const colon = seg.indexOf(':');\n if (colon <= 0 || colon === seg.length - 1) {\n // Skip malformed segments (no colon, empty key, or empty value).\n continue;\n }\n const key = seg.slice(0, colon);\n const value = seg.slice(colon + 1);\n metrics.set(key, value);\n }\n\n return { version, metrics };\n}\n\n/**\n * Validate a CVSS vector string against the FIRST grammar for its version.\n *\n * Checks:\n * - Version is one of the supported set (2.0, 3.0, 3.1, 4.0).\n * - All required base metrics for the version are present.\n * - All known metric values are within the allowed enum.\n *\n * Unknown metric keys are tolerated (forward-compat with future minor versions\n * or scanner-specific extensions). To check a v2 vector without the CVSS:\n * prefix, callers may pass version=\"2.0\" explicitly; otherwise the parser\n * defaults to \"2.0\" on prefix absence.\n *\n * @param vector - CVSS vector string\n * @param version - Optional explicit version override (else inferred)\n * @returns `{ valid, errors[] }` — never throws\n */\nexport function validateCvssVector(\n vector: string,\n version?: string,\n): CvssValidationResult {\n const errors: string[] = [];\n\n if (typeof vector !== 'string' || vector.length === 0) {\n return { valid: false, errors: ['vector is empty'] };\n }\n\n const parsed = parseCvssVector(vector);\n const v = version ?? parsed.version;\n\n const grammar = METRIC_VALUES[v];\n const required = REQUIRED_METRICS[v];\n if (!grammar || !required) {\n errors.push(`unsupported CVSS version: ${v}`);\n return { valid: false, errors };\n }\n\n for (const req of required) {\n if (!parsed.metrics.has(req)) {\n errors.push(`missing required metric: ${req}`);\n }\n }\n\n for (const [key, value] of parsed.metrics.entries()) {\n const allowed = grammar[key];\n if (!allowed) {\n // Unknown metric: forward-compat — no error.\n continue;\n }\n if (!allowed.includes(value)) {\n errors.push(`invalid value for metric ${key}: ${value} (allowed: ${allowed.join(',')})`);\n }\n }\n\n return { valid: errors.length === 0, errors };\n}\n\n/** A computed CVSS score. */\nexport interface CvssScore {\n /** CVSS major.minor version the score was computed under (currently always \"3.1\"). */\n version: string;\n /** Base score (0.0–10.0). */\n baseScore: number;\n /**\n * Temporal (Threat) score (0.0–10.0). Equals baseScore when no temporal\n * metrics (E/RL/RC) are present, per the CVSS 3.1 spec.\n */\n temporalScore: number;\n}\n\n// CVSS 3.1 metric weights (FIRST v3.1 specification §7). Privileges Required is\n// scope-dependent, hence two tables.\nconst CVSS31_AV: Record<string, number> = { N: 0.85, A: 0.62, L: 0.55, P: 0.2 };\nconst CVSS31_AC: Record<string, number> = { L: 0.77, H: 0.44 };\nconst CVSS31_UI: Record<string, number> = { N: 0.85, R: 0.62 };\nconst CVSS31_CIA: Record<string, number> = { N: 0.0, L: 0.22, H: 0.56 };\nconst CVSS31_PR_UNCHANGED: Record<string, number> = { N: 0.85, L: 0.62, H: 0.27 };\nconst CVSS31_PR_CHANGED: Record<string, number> = { N: 0.85, L: 0.68, H: 0.5 };\nconst CVSS31_E: Record<string, number> = { X: 1.0, H: 1.0, F: 0.97, P: 0.94, U: 0.91 };\nconst CVSS31_RL: Record<string, number> = { X: 1.0, U: 1.0, W: 0.97, T: 0.96, O: 0.95 };\nconst CVSS31_RC: Record<string, number> = { X: 1.0, C: 1.0, R: 0.96, U: 0.92 };\n\n/**\n * CVSS 3.1 Roundup (spec §7.4): the smallest number, to one decimal place, that\n * is >= the input — computed via integer math to avoid the floating-point edge\n * cases 3.0 rounding suffered.\n */\nfunction roundUp31(x: number): number {\n const intInput = Math.round(x * 100000);\n if (intInput % 10000 === 0) {\n return intInput / 100000;\n }\n return (Math.floor(intInput / 10000) + 1) / 10;\n}\n\nfunction cvss31TemporalWeight(\n table: Record<string, number>,\n metrics: Map<string, string>,\n key: string,\n): number {\n const v = metrics.get(key);\n if (v === undefined) {\n return 1.0; // absent → X\n }\n const w = table[v];\n if (w === undefined) {\n throw new Error(`cvss: invalid 3.1 ${key} value \"${v}\"`);\n }\n return w;\n}\n\n/**\n * Compute the CVSS 3.1 Base and Temporal (Threat) scores for a vector string.\n *\n * Only CVSS 3.1 is supported here — CVSS 4.0's MacroVector engine lives\n * separately — so any other version throws rather than returning a wrong number.\n * The peer of the Go `ComputeCvssScore` (kept byte-identical via shared fixtures).\n *\n * @throws if the version is not 3.1, a required base metric is missing, or any\n * metric value is out of the 3.1 enum.\n */\nexport function computeCvssScore(vector: string): CvssScore {\n const { version, metrics } = parseCvssVector(vector);\n if (version !== '3.1') {\n throw new Error(`cvss: score compute supports only CVSS 3.1, got \"${version}\"`);\n }\n for (const k of ['AV', 'AC', 'PR', 'UI', 'S', 'C', 'I', 'A']) {\n if (!metrics.has(k)) {\n throw new Error(`cvss: missing required 3.1 base metric \"${k}\"`);\n }\n }\n\n const scope = metrics.get('S');\n if (scope !== 'U' && scope !== 'C') {\n throw new Error(`cvss: invalid 3.1 Scope value \"${scope ?? ''}\"`);\n }\n const scopeChanged = scope === 'C';\n\n const prTable = scopeChanged ? CVSS31_PR_CHANGED : CVSS31_PR_UNCHANGED;\n const lookup = (table: Record<string, number>, metric: string): number => {\n const key = metrics.get(metric);\n const w = key === undefined ? undefined : table[key];\n if (w === undefined) {\n throw new Error(`cvss: invalid 3.1 metric value ${metric}:\"${key ?? ''}\"`);\n }\n return w;\n };\n const av = lookup(CVSS31_AV, 'AV');\n const ac = lookup(CVSS31_AC, 'AC');\n const ui = lookup(CVSS31_UI, 'UI');\n const pr = lookup(prTable, 'PR');\n const c = lookup(CVSS31_CIA, 'C');\n const i = lookup(CVSS31_CIA, 'I');\n const a = lookup(CVSS31_CIA, 'A');\n\n const iss = 1 - (1 - c) * (1 - i) * (1 - a);\n const impact = scopeChanged\n ? 7.52 * (iss - 0.029) - 3.25 * Math.pow(iss - 0.02, 15)\n : 6.42 * iss;\n const exploitability = 8.22 * av * ac * pr * ui;\n\n let baseScore: number;\n if (impact <= 0) {\n baseScore = 0.0;\n } else if (scopeChanged) {\n baseScore = roundUp31(Math.min(1.08 * (impact + exploitability), 10));\n } else {\n baseScore = roundUp31(Math.min(impact + exploitability, 10));\n }\n\n const e = cvss31TemporalWeight(CVSS31_E, metrics, 'E');\n const rl = cvss31TemporalWeight(CVSS31_RL, metrics, 'RL');\n const rc = cvss31TemporalWeight(CVSS31_RC, metrics, 'RC');\n const temporalScore = roundUp31(baseScore * e * rl * rc);\n\n return { version: '3.1', baseScore, temporalScore };\n}\n\n// --- CVSS 4.0 scoring (MacroVector engine) ---\n//\n// A faithful port of the FIRST reference calculator (FIRSTdotorg/cvss-v4-calculator:\n// cvss_score.js), driven by the MacroVector lookup + max tables extracted verbatim\n// into cvss40-data.json. The Go peer (go/cvss.go) reads the byte-identical data\n// file and shares the parity fixture, so the two languages score identically.\n\ninterface Cvss40Tables {\n lookup: Record<string, number>;\n maxComposed: {\n eq1: Record<string, string[]>;\n eq2: Record<string, string[]>;\n eq3: Record<string, Record<string, string[]>>;\n eq4: Record<string, string[]>;\n eq5: Record<string, string[]>;\n };\n maxSeverity: {\n eq1: Record<string, number>;\n eq2: Record<string, number>;\n eq3eq6: Record<string, Record<string, number>>;\n eq4: Record<string, number>;\n eq5: Record<string, number>;\n };\n}\nconst CVSS40 = cvss40Data as Cvss40Tables;\n\n// Per-metric severity index tables (FIRST reference cvss_score.js). Lower = worse.\nconst CVSS40_AV: Record<string, number> = { N: 0.0, A: 0.1, L: 0.2, P: 0.3 };\nconst CVSS40_PR: Record<string, number> = { N: 0.0, L: 0.1, H: 0.2 };\nconst CVSS40_UI: Record<string, number> = { N: 0.0, P: 0.1, A: 0.2 };\nconst CVSS40_AC: Record<string, number> = { L: 0.0, H: 0.1 };\nconst CVSS40_AT: Record<string, number> = { N: 0.0, P: 0.1 };\nconst CVSS40_VC: Record<string, number> = { H: 0.0, L: 0.1, N: 0.2 };\nconst CVSS40_SC: Record<string, number> = { H: 0.1, L: 0.2, N: 0.3 };\nconst CVSS40_SI: Record<string, number> = { S: 0.0, H: 0.1, L: 0.2, N: 0.3 };\nconst CVSS40_CR: Record<string, number> = { H: 0.0, M: 0.1, L: 0.2 };\n\n/** Throw on an unexpected missing table entry rather than fabricate a value. */\nfunction req<T>(value: T | undefined, what: string): T {\n if (value === undefined) {\n throw new Error(`cvss: 4.0 data table missing ${what}`);\n }\n return value;\n}\n\n/**\n * Resolve the effective value of a metric, mirroring the reference m(): E:X and\n * unset default to A (worst case); CR/IR/AR:X and unset default to H; a present,\n * non-X Modified (M-prefixed) metric overrides its base.\n */\nfunction cvss40Metric(sel: Map<string, string>, metric: string): string {\n const selected = sel.get(metric) ?? '';\n if (metric === 'E' && (selected === '' || selected === 'X')) {\n return 'A';\n }\n if ((metric === 'CR' || metric === 'IR' || metric === 'AR') && (selected === '' || selected === 'X')) {\n return 'H';\n }\n const modified = sel.get('M' + metric);\n if (modified !== undefined && modified !== 'X') {\n return modified;\n }\n return selected;\n}\n\nfunction cvss40MacroVectorFromSel(sel: Map<string, string>): string {\n const mv = (k: string): string => cvss40Metric(sel, k);\n\n // EQ1 (the \"not all three N\" term of the reference's level-1 clause is\n // redundant here: the level-0 branch already consumes the all-three-N case).\n let eq1 = '2';\n if (mv('AV') === 'N' && mv('PR') === 'N' && mv('UI') === 'N') {\n eq1 = '0';\n } else if ((mv('AV') === 'N' || mv('PR') === 'N' || mv('UI') === 'N') && mv('AV') !== 'P') {\n eq1 = '1';\n }\n\n let eq2 = '1';\n if (mv('AC') === 'L' && mv('AT') === 'N') {\n eq2 = '0';\n }\n\n let eq3 = '2';\n if (mv('VC') === 'H' && mv('VI') === 'H') {\n eq3 = '0';\n } else if (mv('VC') === 'H' || mv('VI') === 'H' || mv('VA') === 'H') {\n eq3 = '1';\n }\n\n let eq4 = '2';\n if (mv('MSI') === 'S' || mv('MSA') === 'S') {\n eq4 = '0';\n } else if (mv('SC') === 'H' || mv('SI') === 'H' || mv('SA') === 'H') {\n eq4 = '1';\n }\n\n let eq5 = '2';\n if (mv('E') === 'A') {\n eq5 = '0';\n } else if (mv('E') === 'P') {\n eq5 = '1';\n }\n\n let eq6 = '1';\n if (\n (mv('CR') === 'H' && mv('VC') === 'H') ||\n (mv('IR') === 'H' && mv('VI') === 'H') ||\n (mv('AR') === 'H' && mv('VA') === 'H')\n ) {\n eq6 = '0';\n }\n\n return eq1 + eq2 + eq3 + eq4 + eq5 + eq6;\n}\n\n/** Parse a CVSS 4.0 vector and return its MacroVector string. */\nexport function cvss40MacroVector(vector: string): string {\n return cvss40MacroVectorFromSel(parseCvssVector(vector).metrics);\n}\n\n/** Pull a metric's value out of a composed max-vector string (reference extractValueMetric). */\nfunction cvss40ExtractMetric(metric: string, s: string): string {\n const idx = s.indexOf(metric);\n if (idx < 0) {\n return '';\n }\n const rest = s.slice(idx + metric.length + 1);\n const slash = rest.indexOf('/');\n return slash >= 0 ? rest.slice(0, slash) : rest;\n}\n\n/** value minus the lower macro's score, or NaN when that lower macro does not exist. */\nfunction cvss40AvailDist(value: number, lowerMacro: string): number {\n const s = CVSS40.lookup[lowerMacro];\n return s === undefined ? NaN : value - s;\n}\n\nfunction cvss40Score(sel: Map<string, string>): number {\n const mv = (k: string): string => cvss40Metric(sel, k);\n\n if (\n mv('VC') === 'N' && mv('VI') === 'N' && mv('VA') === 'N' &&\n mv('SC') === 'N' && mv('SI') === 'N' && mv('SA') === 'N'\n ) {\n return 0.0;\n }\n\n const macro = cvss40MacroVectorFromSel(sel);\n let value = req(CVSS40.lookup[macro], `lookup[${macro}]`);\n\n // Definite per-position digit chars (charAt never yields undefined).\n const c0 = macro.charAt(0);\n const c1 = macro.charAt(1);\n const c2 = macro.charAt(2);\n const c3 = macro.charAt(3);\n const c4 = macro.charAt(4);\n const c5 = macro.charAt(5);\n\n const d = (i: number): number => macro.charCodeAt(i) - 48;\n const eq3 = d(2);\n const eq6 = d(5);\n const rep = (i: number, digit: number): string =>\n macro.slice(0, i) + String(digit) + macro.slice(i + 1);\n\n const availDistEq1 = cvss40AvailDist(value, rep(0, d(0) + 1));\n const availDistEq2 = cvss40AvailDist(value, rep(1, d(1) + 1));\n const availDistEq4 = cvss40AvailDist(value, rep(3, d(3) + 1));\n const availDistEq5 = cvss40AvailDist(value, rep(4, d(4) + 1));\n\n // eq3 and eq6 are coupled.\n let availDistEq3eq6 = NaN;\n if ((eq3 === 1 && eq6 === 1) || (eq3 === 0 && eq6 === 1)) {\n availDistEq3eq6 = cvss40AvailDist(value, rep(2, eq3 + 1));\n } else if (eq3 === 1 && eq6 === 0) {\n availDistEq3eq6 = cvss40AvailDist(value, rep(5, eq6 + 1));\n } else if (eq3 === 0 && eq6 === 0) {\n const left = CVSS40.lookup[rep(5, eq6 + 1)];\n const right = CVSS40.lookup[rep(2, eq3 + 1)];\n if (left !== undefined && right !== undefined) {\n availDistEq3eq6 = value - Math.max(left, right);\n } else if (right !== undefined) {\n availDistEq3eq6 = value - right;\n }\n } else {\n availDistEq3eq6 = cvss40AvailDist(value, macro.slice(0, 2) + String(eq3 + 1) + macro.slice(3, 5) + String(eq6 + 1));\n }\n\n const eq1Maxes = req(CVSS40.maxComposed.eq1[c0], `maxComposed.eq1[${c0}]`);\n const eq2Maxes = req(CVSS40.maxComposed.eq2[c1], `maxComposed.eq2[${c1}]`);\n const eq3eq6Maxes = req(\n req(CVSS40.maxComposed.eq3[c2], `maxComposed.eq3[${c2}]`)[c5],\n `maxComposed.eq3[${c2}][${c5}]`,\n );\n const eq4Maxes = req(CVSS40.maxComposed.eq4[c3], `maxComposed.eq4[${c3}]`);\n const eq5Maxes = req(CVSS40.maxComposed.eq5[c4], `maxComposed.eq5[${c4}]`);\n\n const maxVectors: string[] = [];\n for (const a of eq1Maxes) {\n for (const b of eq2Maxes) {\n for (const c of eq3eq6Maxes) {\n for (const e of eq4Maxes) {\n for (const f of eq5Maxes) {\n maxVectors.push(a + b + c + e + f);\n }\n }\n }\n }\n }\n\n const dist = (table: Record<string, number>, metric: string, maxVector: string): number =>\n req(table[mv(metric)], `level ${metric}:${mv(metric)}`) -\n req(table[cvss40ExtractMetric(metric, maxVector)], `max level ${metric}`);\n\n let sdAV = 0, sdPR = 0, sdUI = 0, sdAC = 0, sdAT = 0, sdVC = 0, sdVI = 0, sdVA = 0;\n let sdSC = 0, sdSI = 0, sdSA = 0, sdCR = 0, sdIR = 0, sdAR = 0;\n for (const maxVector of maxVectors) {\n sdAV = dist(CVSS40_AV, 'AV', maxVector);\n sdPR = dist(CVSS40_PR, 'PR', maxVector);\n sdUI = dist(CVSS40_UI, 'UI', maxVector);\n sdAC = dist(CVSS40_AC, 'AC', maxVector);\n sdAT = dist(CVSS40_AT, 'AT', maxVector);\n sdVC = dist(CVSS40_VC, 'VC', maxVector);\n sdVI = dist(CVSS40_VC, 'VI', maxVector);\n sdVA = dist(CVSS40_VC, 'VA', maxVector);\n sdSC = dist(CVSS40_SC, 'SC', maxVector);\n sdSI = dist(CVSS40_SI, 'SI', maxVector);\n sdSA = dist(CVSS40_SI, 'SA', maxVector);\n sdCR = dist(CVSS40_CR, 'CR', maxVector);\n sdIR = dist(CVSS40_CR, 'IR', maxVector);\n sdAR = dist(CVSS40_CR, 'AR', maxVector);\n if (\n [sdAV, sdPR, sdUI, sdAC, sdAT, sdVC, sdVI, sdVA, sdSC, sdSI, sdSA, sdCR, sdIR, sdAR].some(\n (v) => v < 0,\n )\n ) {\n continue;\n }\n break;\n }\n\n const curEq1 = sdAV + sdPR + sdUI;\n const curEq2 = sdAC + sdAT;\n const curEq3eq6 = sdVC + sdVI + sdVA + sdCR + sdIR + sdAR;\n const curEq4 = sdSC + sdSI + sdSA;\n\n const step = 0.1;\n const maxSevEq1 = req(CVSS40.maxSeverity.eq1[c0], `maxSeverity.eq1[${c0}]`) * step;\n const maxSevEq2 = req(CVSS40.maxSeverity.eq2[c1], `maxSeverity.eq2[${c1}]`) * step;\n const maxSevEq3eq6 =\n req(\n req(CVSS40.maxSeverity.eq3eq6[c2], `maxSeverity.eq3eq6[${c2}]`)[c5],\n `maxSeverity.eq3eq6[${c2}][${c5}]`,\n ) * step;\n const maxSevEq4 = req(CVSS40.maxSeverity.eq4[c3], `maxSeverity.eq4[${c3}]`) * step;\n\n let nExisting = 0;\n let normEq1 = 0, normEq2 = 0, normEq3eq6 = 0, normEq4 = 0;\n const normEq5 = 0; // eq5 proportion is always 0 per the reference\n if (!Number.isNaN(availDistEq1)) {\n nExisting++;\n normEq1 = availDistEq1 * (curEq1 / maxSevEq1);\n }\n if (!Number.isNaN(availDistEq2)) {\n nExisting++;\n normEq2 = availDistEq2 * (curEq2 / maxSevEq2);\n }\n if (!Number.isNaN(availDistEq3eq6)) {\n nExisting++;\n normEq3eq6 = availDistEq3eq6 * (curEq3eq6 / maxSevEq3eq6);\n }\n if (!Number.isNaN(availDistEq4)) {\n nExisting++;\n normEq4 = availDistEq4 * (curEq4 / maxSevEq4);\n }\n if (!Number.isNaN(availDistEq5)) {\n nExisting++;\n }\n\n const meanDistance =\n nExisting === 0 ? 0 : (normEq1 + normEq2 + normEq3eq6 + normEq4 + normEq5) / nExisting;\n\n value -= meanDistance;\n if (value < 0) {\n value = 0.0;\n }\n if (value > 10) {\n value = 10.0;\n }\n return Math.round(value * 10) / 10;\n}\n\n/** Remove the E: segment so the Base score reflects the worst-case default (E:X → E:A). */\nfunction cvss40StripExploitMaturity(vector: string): string {\n return vector\n .split('/')\n .filter((seg) => !seg.startsWith('E:'))\n .join('/');\n}\n\n/**\n * Compute the CVSS 4.0 score for a vector string, split into a Base score\n * (`baseScore`, with Exploit Maturity stripped to its worst-case default E:A) and\n * a Threat score (`temporalScore`, with the E value present in the vector). For a\n * base-only vector the two are equal. The peer of the Go `ComputeCvss40Score`,\n * kept byte-identical via the shared data file and parity fixture.\n *\n * @throws if the version is not 4.0, a required base metric is missing, or any\n * metric value is out of the 4.0 enum.\n */\nexport function computeCvss40Score(vector: string): CvssScore {\n const { version } = parseCvssVector(vector);\n if (version !== '4.0') {\n throw new Error(`cvss: 4.0 score compute supports only CVSS 4.0, got \"${version}\"`);\n }\n const { valid, errors } = validateCvssVector(vector, '4.0');\n if (!valid) {\n throw new Error(`cvss: invalid 4.0 vector: ${errors.join('; ')}`);\n }\n\n const temporalScore = cvss40Score(parseCvssVector(vector).metrics);\n const baseScore = cvss40Score(parseCvssVector(cvss40StripExploitMaturity(vector)).metrics);\n return { version: '4.0', baseScore, temporalScore };\n}\n","/**\n * CPE 2.3 URI parser for HDF converters.\n *\n * Common Platform Enumeration (CPE) 2.3 URIs identify affected products.\n * Container scanners (grype, twistlock, snyk) emit them in vulnerability\n * findings. This module provides an accept-and-warn parser: any input that\n * carries the `cpe:2.3:` prefix is best-effort parsed; deviations from the\n * canonical 13-field form are reported via `warnings` rather than rejected.\n *\n * Canonical form:\n * `cpe:2.3:part:vendor:product:version:update:edition:language:sw_edition:target_sw:target_hw:other`\n *\n * Reference: NIST IR 7695 (https://csrc.nist.gov/publications/detail/nistir/7695/final)\n */\n\n/** Valid CPE 2.3 `part` values. */\nexport type CpePart = 'a' | 'o' | 'h' | '*';\n\n/**\n * Parsed CPE 2.3 URI.\n *\n * `warnings` collects any deviations from the canonical form (truncation,\n * extra fields, unknown `part`). An empty array means the input was a strict\n * 13-field, valid-part CPE.\n */\nexport interface ParsedCpe {\n /** The original input string, unmodified. */\n raw: string;\n /** Application kind. `'a'` (app), `'o'` (OS), `'h'` (hardware), `'*'` (any). */\n part: CpePart | string;\n vendor: string;\n product: string;\n version: string;\n update: string;\n edition: string;\n language: string;\n swEdition: string;\n targetSw: string;\n targetHw: string;\n other: string;\n /** Deviation messages; empty when the input is a canonical 13-field CPE. */\n warnings: string[];\n}\n\nconst CPE_PREFIX = 'cpe:2.3:';\nconst EXPECTED_TOTAL_FIELDS = 13; // \"cpe\", \"2.3\", and 11 product fields = 13 colon-separated tokens\nconst PRODUCT_FIELD_COUNT = 11; // part + 10 attribute fields\nconst VALID_PARTS = new Set(['a', 'o', 'h', '*']);\n\n/**\n * Split a CPE 2.3 body on unescaped `:` separators.\n *\n * Per CPE 2.3 spec section 6.1.2.4, `:` and `\\` inside a field must be\n * escaped as `\\:` and `\\\\`. We respect those escapes during the split and\n * unescape the result.\n */\nfunction splitOnUnescapedColons(body: string): string[] {\n const result: string[] = [];\n let current = '';\n for (let i = 0; i < body.length; i++) {\n const ch = body[i];\n if (ch === '\\\\' && i + 1 < body.length) {\n const next = body[i + 1];\n // Preserve known escapes (\\: and \\\\) as a literal next character.\n if (next === ':' || next === '\\\\') {\n current += next;\n i++;\n continue;\n }\n // Unknown escape — keep the backslash and continue.\n current += ch;\n continue;\n }\n if (ch === ':') {\n result.push(current);\n current = '';\n continue;\n }\n current += ch;\n }\n result.push(current);\n return result;\n}\n\n/**\n * Parse a CPE 2.3 URI.\n *\n * Accept-and-warn semantics:\n * - Input missing the `cpe:2.3:` prefix → returns `null`.\n * - Input with the prefix but fewer than 11 product fields → fields are\n * padded with `\"*\"` and a `truncated:` warning is added.\n * - Input with more than 11 product fields → extras are dropped and an\n * `\"extra fields ignored\"` warning is added.\n * - Unknown `part` value → kept as-is in the result, `\"unknown part: X\"`\n * warning is added.\n * - `\\:` and `\\\\` escapes inside fields are honored during splitting and\n * unescaped in the returned field values.\n *\n * @param cpeUri - CPE 2.3 URI string\n * @returns Parsed CPE with warnings, or `null` if input lacks the prefix\n *\n * @example\n * ```typescript\n * parseCpe('cpe:2.3:a:openssl:openssl:1.1.1k:*:*:*:*:*:*:*');\n * // { part: 'a', vendor: 'openssl', product: 'openssl', version: '1.1.1k', ... warnings: [] }\n *\n * parseCpe('cpe:2.3:a:openssl:openssl:1.1.1k');\n * // truncated input → padded with '*', warnings: ['truncated: expected 13 colon-separated fields, got 6']\n *\n * parseCpe('openssl:1.1.1k'); // null — no prefix\n * ```\n */\nexport function parseCpe(cpeUri: string): ParsedCpe | null {\n if (!cpeUri.startsWith(CPE_PREFIX)) {\n return null;\n }\n\n const warnings: string[] = [];\n const body = cpeUri.slice(CPE_PREFIX.length);\n\n // Special case: bare prefix `cpe:2.3:` — all fields empty, still warn.\n // This is the \"I have nothing useful here\" form; padding with \"*\" would\n // suggest the parser inferred wildcards, which it didn't.\n const isBarePrefix = body.length === 0;\n\n const bodyParts = isBarePrefix ? [] : splitOnUnescapedColons(body);\n\n // Total colon-separated fields including the prefix \"cpe\" and \"2.3\" markers.\n const totalFields = isBarePrefix ? 2 : 2 + bodyParts.length;\n\n if (bodyParts.length > PRODUCT_FIELD_COUNT) {\n warnings.push('extra fields ignored');\n } else if (bodyParts.length < PRODUCT_FIELD_COUNT) {\n warnings.push(\n `truncated: expected ${EXPECTED_TOTAL_FIELDS} colon-separated fields, got ${totalFields}`,\n );\n }\n\n // Pad missing fields. For a bare prefix, pad with \"\" (no inferred data).\n // For partial input, pad missing trailing fields with \"*\" (wildcard).\n const padValue = isBarePrefix ? '' : '*';\n const fields: string[] = bodyParts.slice(0, PRODUCT_FIELD_COUNT);\n while (fields.length < PRODUCT_FIELD_COUNT) {\n fields.push(padValue);\n }\n\n // fields is padded to PRODUCT_FIELD_COUNT above, so every slot is present;\n // the destructuring defaults only satisfy the compiler's indexed-access check.\n const [\n part = '',\n vendor = '',\n product = '',\n version = '',\n update = '',\n edition = '',\n language = '',\n swEdition = '',\n targetSw = '',\n targetHw = '',\n other = '',\n ] = fields;\n\n if (!VALID_PARTS.has(part)) {\n warnings.push(`unknown part: ${part}`);\n }\n\n return {\n raw: cpeUri,\n part,\n vendor,\n product,\n version,\n update,\n edition,\n language,\n swEdition,\n targetSw,\n targetHw,\n other,\n warnings,\n };\n}\n","/**\n * Package URL (PURL) parser for SBOM and CVE-scanner ingestion.\n *\n * PURL is the canonical package identifier used by CycloneDX, SPDX, OSV,\n * GitHub Advisory Database, and most modern scanners. Spec:\n * https://github.com/package-url/purl-spec/blob/master/PURL-SPECIFICATION.rst\n *\n * Grammar: `pkg:type/namespace/name@version?qualifiers#subpath`\n *\n * This parser is intentionally accept-and-warn. Scanners occasionally emit\n * slightly malformed PURLs (qualifier with no `=`, missing name, etc.) and\n * we'd rather record a warning than fail ingestion.\n */\n\n/**\n * Result of parsing a PURL string.\n */\nexport interface ParsedPurl {\n /** Original input string, unmodified. */\n raw: string;\n /** Package type (e.g., \"npm\", \"rpm\", \"pypi\", \"maven\"). Lowercased. */\n type: string;\n /** Namespace segment (e.g., \"redhat\" for RPM, \"org.apache...\" for Maven). */\n namespace: string | null;\n /** Package name. Empty string (with a warning) if the input lacks one. */\n name: string;\n /** Version after the `@` separator. URL-decoded. */\n version: string | null;\n /** Qualifier key-value pairs from the `?` segment. */\n qualifiers: Map<string, string>;\n /** Subpath from the `#` fragment. */\n subpath: string | null;\n /** Deviations or oddities encountered during parsing. */\n warnings: string[];\n}\n\nconst PURL_PREFIX = 'pkg:';\n\n/**\n * Parse a Package URL string.\n *\n * Returns `null` only when the input is missing the mandatory `pkg:` prefix\n * or the type segment. Other deviations are surfaced via `warnings` on the\n * returned object.\n *\n * @param purlStr - PURL string, e.g. `pkg:npm/lodash@4.17.21`\n * @returns Parsed PURL or `null` if the input is unrecoverably malformed\n *\n * @example\n * ```typescript\n * const r = parsePurl('pkg:rpm/redhat/openssl@1.1.1k-7.el8_4?arch=x86_64');\n * r?.type; // \"rpm\"\n * r?.namespace; // \"redhat\"\n * r?.name; // \"openssl\"\n * r?.qualifiers.get('arch'); // \"x86_64\"\n * ```\n */\nexport function parsePurl(purlStr: string): ParsedPurl | null {\n if (!purlStr || !purlStr.startsWith(PURL_PREFIX)) {\n return null;\n }\n\n const raw = purlStr;\n const warnings: string[] = [];\n\n // Strip prefix. Per spec, scheme is case-insensitive but only `pkg:` is\n // valid; we already matched it.\n let remainder = purlStr.slice(PURL_PREFIX.length);\n\n // Per spec, leading slashes after the scheme are stripped. This also means\n // `pkg:/foo` and `pkg:foo` are equivalent, but `pkg:/` with no following\n // type segment is still invalid.\n while (remainder.startsWith('/')) {\n remainder = remainder.slice(1);\n }\n\n if (remainder.length === 0) {\n return null;\n }\n\n // Extract subpath (fragment). Per spec, the fragment is everything after\n // the first `#`. Splitting before qualifiers keeps `#` inside qualifier\n // values out of scope (which is fine — qualifier values do not legally\n // contain raw `#`; they would be percent-encoded).\n let subpath: string | null = null;\n const hashIdx = remainder.indexOf('#');\n if (hashIdx !== -1) {\n subpath = remainder.slice(hashIdx + 1);\n remainder = remainder.slice(0, hashIdx);\n if (subpath.length === 0) {\n subpath = null;\n }\n }\n\n // Extract qualifiers (query string). Everything after the first `?`.\n const qualifiers = new Map<string, string>();\n const qIdx = remainder.indexOf('?');\n if (qIdx !== -1) {\n const qStr = remainder.slice(qIdx + 1);\n remainder = remainder.slice(0, qIdx);\n parseQualifiers(qStr, qualifiers, warnings);\n }\n\n // Strip a trailing slash from the path portion. Spec allows it; we silently\n // normalize.\n while (remainder.endsWith('/')) {\n remainder = remainder.slice(0, -1);\n }\n\n // Type is everything up to the first `/`.\n const firstSlash = remainder.indexOf('/');\n let type: string;\n let pathPart: string;\n if (firstSlash === -1) {\n type = remainder;\n pathPart = '';\n } else {\n type = remainder.slice(0, firstSlash);\n pathPart = remainder.slice(firstSlash + 1);\n }\n\n if (type.length === 0) {\n return null;\n }\n type = type.toLowerCase();\n\n // Split version off the path part. Per spec, the version separator is the\n // LAST `@` in the path — names may contain `@` (e.g., npm scoped packages\n // when not percent-encoded).\n let version: string | null = null;\n const lastAt = pathPart.lastIndexOf('@');\n let nameAndNs = pathPart;\n if (lastAt !== -1) {\n version = pathPart.slice(lastAt + 1);\n nameAndNs = pathPart.slice(0, lastAt);\n version = safeDecode(version);\n }\n\n // Namespace is everything before the last `/` in the name+namespace\n // section; the final segment is the name.\n let namespace: string | null = null;\n let name: string;\n const lastSlash = nameAndNs.lastIndexOf('/');\n if (lastSlash === -1) {\n name = nameAndNs;\n } else {\n namespace = nameAndNs.slice(0, lastSlash);\n name = nameAndNs.slice(lastSlash + 1);\n }\n\n // Decode percent-encoded segments.\n if (namespace !== null) {\n // Decode each path segment independently to preserve embedded `/`.\n namespace = namespace.split('/').map(safeDecode).join('/');\n }\n name = safeDecode(name);\n\n if (name.length === 0) {\n warnings.push('PURL is missing the name segment');\n }\n\n // Normalize empty namespace to null.\n if (namespace !== null && namespace.length === 0) {\n namespace = null;\n }\n\n // Normalize empty version to null.\n if (version !== null && version.length === 0) {\n version = null;\n }\n\n return {\n raw,\n type,\n namespace,\n name,\n version,\n qualifiers,\n subpath,\n warnings,\n };\n}\n\n/**\n * Parse the `?key=value&key=value` qualifier string. Empty segments are\n * skipped silently; segments with no `=` are recorded with empty value and\n * a warning. Values are URL-decoded.\n */\nfunction parseQualifiers(\n qStr: string,\n out: Map<string, string>,\n warnings: string[],\n): void {\n const parts = qStr.split('&');\n for (const part of parts) {\n if (part.length === 0) {\n continue;\n }\n const eq = part.indexOf('=');\n if (eq === -1) {\n out.set(part, '');\n warnings.push(`qualifier \"${part}\" has no value`);\n continue;\n }\n const key = part.slice(0, eq);\n const value = part.slice(eq + 1);\n out.set(key, safeDecode(value));\n }\n}\n\n/**\n * decodeURIComponent that returns the original string on failure rather than\n * throwing. PURLs in the wild occasionally contain stray `%` characters that\n * aren't legitimate percent-encoding.\n */\nfunction safeDecode(s: string): string {\n try {\n return decodeURIComponent(s);\n } catch {\n return s;\n }\n}\n","// Schema-free input-size guard — the TS peer of hdf-utilities/go/size.go, kept\n// at behavioural parity. The engine loader runs it as its FIRST operation,\n// before any parse, to defend against memory exhaustion on untrusted input.\n\n/** Default maximum input size (256 MB), matching the Go DefaultMaxInputSize. */\nexport const DEFAULT_MAX_INPUT_SIZE = 256 * 1024 * 1024;\n\n// configuredMaxInputSize, when > 0, overrides DEFAULT_MAX_INPUT_SIZE for callers\n// that pass maxSize <= 0 (\"use the default\"). A host sets it once from its own\n// configuration so a raised ceiling reaches every converter's size guard — which\n// passes 0 — without threading a value through every call site. The Go peer is\n// hdfutil.configuredMaxInputSize / SetDefaultMaxInputSize.\nlet configuredMaxInputSize = 0;\n\n/**\n * setDefaultMaxInputSize sets the process-wide fallback used when a caller passes\n * maxSize <= 0. A value <= 0 restores the built-in DEFAULT_MAX_INPUT_SIZE.\n */\nexport function setDefaultMaxInputSize(maxSize: number): void {\n configuredMaxInputSize = maxSize > 0 ? maxSize : 0;\n}\n\n/**\n * resolveMaxInputSize returns the effective byte limit for a caller-supplied\n * maxSize: the explicit value when > 0, else the configured process default, else\n * DEFAULT_MAX_INPUT_SIZE. An explicit limit always wins.\n */\nexport function resolveMaxInputSize(maxSize = 0): number {\n if (maxSize > 0) return maxSize;\n if (configuredMaxInputSize > 0) return configuredMaxInputSize;\n return DEFAULT_MAX_INPUT_SIZE;\n}\n\n/**\n * validateInputSize throws if input exceeds the effective limit for maxSize (see\n * resolveMaxInputSize; maxSize <= 0 uses the configured default or\n * DEFAULT_MAX_INPUT_SIZE). Byte length is measured on the UTF-8 encoding for a\n * string input, so it matches the Go []byte length for the same document.\n */\nexport function validateInputSize(input: string | Uint8Array, maxSize = 0): void {\n const limit = resolveMaxInputSize(maxSize);\n if (typeof input !== 'string') {\n if (input.length > limit) throw tooLarge(limit, input.length);\n return;\n }\n // UTF-8 never uses fewer than one byte per code unit nor more than three, so\n // the cheap bound settles most inputs before anything reads the string.\n if (input.length * 3 <= limit) return;\n const len = utf8ByteLength(input);\n if (len > limit) throw tooLarge(limit, len);\n}\n\nfunction tooLarge(limit: number, len: number): Error {\n return new Error(`input exceeds maximum allowed size of ${limit} bytes (${len} bytes provided)`);\n}\n\n/**\n * UTF-8 byte length, counted rather than encoded: a TextEncoder pass would\n * allocate a full copy of the very input this guard exists to reject.\n * An unpaired surrogate counts as the three-byte replacement character, which\n * is what TextEncoder emits for one.\n */\nfunction utf8ByteLength(s: string): number {\n let bytes = 0;\n for (let i = 0; i < s.length; i++) {\n const c = s.charCodeAt(i);\n if (c < 0x80) {\n bytes += 1;\n } else if (c < 0x800) {\n bytes += 2;\n } else if (c >= 0xd800 && c <= 0xdbff && (s.charCodeAt(i + 1) & 0xfc00) === 0xdc00) {\n bytes += 4;\n i++;\n } else {\n bytes += 3;\n }\n }\n return bytes;\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;AAeA,MAAM,cAAsC;CAC1C,UAAU;CACV,MAAM;CACN,QAAQ;CACR,KAAK;CACL,MAAM;CACN,MAAM;CACN,eAAe;CACf,aAAa;AACf;AAWA,SAAgB,iBAAiB,UAAoD;CACnF,IAAI,aAAa,MAAM,OAAO;CAG9B,MAAM,cAAc,YAAY,GAAA,CAAI,YAAY;CAGhD,OAAO,OAAO,UAAU,eAAe,KAAK,aAAa,UAAU,IAC/D,YAAY,cACZ;AACN;;;;;;;;;;AAWA,SAAgB,4BACd,UACA,SACA,YACQ;CACR,MAAM,SAAS,YAAY,GAAA,CAAI,YAAY;CAG3C,IAAI,OAAO,UAAU,eAAe,KAAK,SAAS,KAAK,GAAG,OAAO,QAAQ;CACzE,IAAI,OAAO,UAAU,eAAe,KAAK,aAAa,KAAK,GAAG,OAAO,YAAY;CACjF,OAAO;AACT;;;;;;;;;AAUA,SAAgB,YAAY,GAAmB;CAC7C,OAAO,KAAK,MAAM,IAAI,GAAG,IAAI;AAC/B;AAWA,SAAgB,iBAAiB,QAAsC;CACrE,IAAI,WAAW,MAAM,OAAO;CAC5B,IAAI,UAAU,IAAK,OAAO;CAC1B,IAAI,UAAU,IAAK,OAAO;CAC1B,IAAI,UAAU,IAAK,OAAO;CAC1B,IAAI,SAAS,GAAK,OAAO;CACzB,OAAO;AACT;;;;;;;;;;;;;;;;;;AAmBA,SAAgB,oBACd,OACiD;CACjD,IAAI,CAAC,OAAO,SAAS,KAAK,KAAK,QAAQ,IAAK,OAAO;CACnD,IAAI,QAAQ,GAAK,OAAO;CACxB,IAAI,QAAQ,GAAK,OAAO;CACxB,IAAI,QAAQ,GAAK,OAAO;CACxB,OAAO;AACT;AAMA,MAAM,wCAAwB,IAAI,IAAI;CAAC;CAAW;CAAc;AAAa,CAAC;;;;;;;;AAS9E,SAAgB,kBAAkB,UAAmC;CACnE,IAAI,aAAa,KAAA,KAAa,aAAa,MAAM,OAAO;CACxD,MAAM,IAAI,SAAS,KAAK,CAAC,CAAC,YAAY;CACtC,OAAO,MAAM,MAAM,sBAAsB,IAAI,CAAC;AAChD;;;;;;;;;;;;ACnIA,MAAa,wBAAwB;CACnC;CACA;CACA;CACA;CACA;AACF;;AAMA,MAAM,kBAAqC;;AAG3C,SAAgB,WAAW,QAAwB;CACjD,MAAM,MAAM,gBAAgB,QAAQ,MAAM;CAC1C,OAAO,QAAQ,KAAK,KAAK,gBAAgB,SAAS,IAAI;AACxD;;;;;AAMA,SAAgB,YAAY,UAAqC;CAC/D,IAAI,QAAQ;CACZ,IAAI,YAAY;CAChB,KAAK,MAAM,KAAK,UAAU;EACxB,MAAM,IAAI,WAAW,CAAC;EACtB,IAAI,IAAI,WAAW;GACjB,YAAY;GACZ,QAAQ;EACV;CACF;CACA,OAAO;AACT;AAeA,SAAS,UAAU,UAA+B,KAAoB;CACpE,IAAI,CAAC,SAAS,WAAW,OAAO;CAGhC,MAAM,UAAU,eAAe,SAAS,SAAS;CACjD,OAAO,YAAY,QAAQ,WAAW;AACxC;;;;;;;AAQA,SAAgB,wBACd,WACA,oBACiC;CACjC,MAAM,IAAI,6BAA6B,WAAW,kBAAkB;CACpE,OAAO,KAAK,IAAI,UAAU,KAAK,KAAA;AACjC;;;;;;;;;AAUA,SAAgB,uBACd,WACA,UACA,oBACQ;CACR,MAAM,MAAM,QAAQ,kBAAkB;CACtC,IAAI,YAAY;CAChB,KAAK,IAAI,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK;EACzC,MAAM,WAAW,UAAU;EAC3B,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,KAAK,UAAU,UAAU,GAAG,GAAG;EAC3D,IAAI,cAAc,MAAM,YAAY,QAAQ,IAAI,YAAY,UAAU,UAAW,GAC/E,YAAY;CAEhB;CACA,OAAO;AACT;;;;;;AAOA,SAAgB,6BACd,WACA,oBACQ;CACR,OAAO,uBAAuB,YAAY,MAAM,CAAC,CAAC,UAAU,EAAE,EAAE,QAAQ,kBAAkB;AAC5F;AAEA,SAAS,YAAY,UAAuC;CAC1D,IAAI,CAAC,SAAS,WAAW,OAAO,OAAO;CACvC,OAAO,eAAe,SAAS,SAAS,CAAC,EAAE,QAAQ,KAAK,OAAO;AACjE;AAEA,SAAS,QAAQ,oBAAmC;CAElD,QADe,qBAAqB,eAAe,kBAAkB,IAAI,yBACxD,IAAI,KAAK;AAC5B;;;;;;;;;;;;;;AAsBA,SAAgB,uBACd,OACA,oBACQ;CACR,MAAM,YAAY,wBAAwB,MAAM,aAAa,CAAC,GAAG,kBAAkB;CACnF,IAAI,WAAW,QAAQ,OAAO,UAAU;CACxC,MAAM,WAAW,YAAY,MAAM,kBAAkB,CAAC,CAAC;CACvD,IAAI,aAAa,SACf,OAAO;CAET,IAAI,MAAM,WAAW,GACnB,OAAO;CAET,OAAO;AACT;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AEnIA,MAAM,gBAA0D;CAC9D,OAAO;EACL,IAAI;GAAC;GAAK;GAAK;EAAG;EAClB,IAAI;GAAC;GAAK;GAAK;EAAG;EAClB,IAAI;GAAC;GAAK;GAAK;EAAG;EAClB,GAAG;GAAC;GAAK;GAAK;EAAG;EACjB,GAAG;GAAC;GAAK;GAAK;EAAG;EACjB,GAAG;GAAC;GAAK;GAAK;EAAG;EAEjB,GAAG;GAAC;GAAK;GAAO;GAAK;GAAK;EAAI;EAC9B,IAAI;GAAC;GAAM;GAAM;GAAK;GAAK;EAAI;EAC/B,IAAI;GAAC;GAAM;GAAM;GAAK;EAAI;EAE1B,KAAK;GAAC;GAAK;GAAK;GAAM;GAAM;GAAK;EAAI;EACrC,IAAI;GAAC;GAAK;GAAK;GAAK;GAAK;EAAI;EAC7B,IAAI;GAAC;GAAK;GAAK;GAAK;EAAI;EACxB,IAAI;GAAC;GAAK;GAAK;GAAK;EAAI;EACxB,IAAI;GAAC;GAAK;GAAK;GAAK;EAAI;CAC1B;CACA,OAAO;EACL,IAAI;GAAC;GAAK;GAAK;GAAK;EAAG;EACvB,IAAI,CAAC,KAAK,GAAG;EACb,IAAI;GAAC;GAAK;GAAK;EAAG;EAClB,IAAI,CAAC,KAAK,GAAG;EACb,GAAG,CAAC,KAAK,GAAG;EACZ,GAAG;GAAC;GAAK;GAAK;EAAG;EACjB,GAAG;GAAC;GAAK;GAAK;EAAG;EACjB,GAAG;GAAC;GAAK;GAAK;EAAG;EAEjB,GAAG;GAAC;GAAK;GAAK;GAAK;GAAK;EAAG;EAC3B,IAAI;GAAC;GAAK;GAAK;GAAK;GAAK;EAAG;EAC5B,IAAI;GAAC;GAAK;GAAK;GAAK;EAAG;EAEvB,IAAI;GAAC;GAAK;GAAK;GAAK;EAAG;EACvB,IAAI;GAAC;GAAK;GAAK;GAAK;EAAG;EACvB,IAAI;GAAC;GAAK;GAAK;GAAK;EAAG;EACvB,KAAK;GAAC;GAAK;GAAK;GAAK;GAAK;EAAG;EAC7B,KAAK;GAAC;GAAK;GAAK;EAAG;EACnB,KAAK;GAAC;GAAK;GAAK;GAAK;EAAG;EACxB,KAAK;GAAC;GAAK;GAAK;EAAG;EACnB,IAAI;GAAC;GAAK;GAAK;EAAG;EAClB,IAAI;GAAC;GAAK;GAAK;GAAK;EAAG;EACvB,IAAI;GAAC;GAAK;GAAK;GAAK;EAAG;EACvB,IAAI;GAAC;GAAK;GAAK;GAAK;EAAG;CACzB;CACA,OAAO;EACL,IAAI;GAAC;GAAK;GAAK;GAAK;EAAG;EACvB,IAAI,CAAC,KAAK,GAAG;EACb,IAAI;GAAC;GAAK;GAAK;EAAG;EAClB,IAAI,CAAC,KAAK,GAAG;EACb,GAAG,CAAC,KAAK,GAAG;EACZ,GAAG;GAAC;GAAK;GAAK;EAAG;EACjB,GAAG;GAAC;GAAK;GAAK;EAAG;EACjB,GAAG;GAAC;GAAK;GAAK;EAAG;EAEjB,GAAG;GAAC;GAAK;GAAK;GAAK;GAAK;EAAG;EAC3B,IAAI;GAAC;GAAK;GAAK;GAAK;GAAK;EAAG;EAC5B,IAAI;GAAC;GAAK;GAAK;GAAK;EAAG;EAEvB,IAAI;GAAC;GAAK;GAAK;GAAK;EAAG;EACvB,IAAI;GAAC;GAAK;GAAK;GAAK;EAAG;EACvB,IAAI;GAAC;GAAK;GAAK;GAAK;EAAG;EACvB,KAAK;GAAC;GAAK;GAAK;GAAK;GAAK;EAAG;EAC7B,KAAK;GAAC;GAAK;GAAK;EAAG;EACnB,KAAK;GAAC;GAAK;GAAK;GAAK;EAAG;EACxB,KAAK;GAAC;GAAK;GAAK;EAAG;EACnB,IAAI;GAAC;GAAK;GAAK;EAAG;EAClB,IAAI;GAAC;GAAK;GAAK;GAAK;EAAG;EACvB,IAAI;GAAC;GAAK;GAAK;GAAK;EAAG;EACvB,IAAI;GAAC;GAAK;GAAK;GAAK;EAAG;CACzB;CACA,OAAO;EAEL,IAAI;GAAC;GAAK;GAAK;GAAK;EAAG;EACvB,IAAI,CAAC,KAAK,GAAG;EACb,IAAI,CAAC,KAAK,GAAG;EACb,IAAI;GAAC;GAAK;GAAK;EAAG;EAClB,IAAI;GAAC;GAAK;GAAK;EAAG;EAClB,IAAI;GAAC;GAAK;GAAK;EAAG;EAClB,IAAI;GAAC;GAAK;GAAK;EAAG;EAClB,IAAI;GAAC;GAAK;GAAK;EAAG;EAClB,IAAI;GAAC;GAAK;GAAK;EAAG;EAClB,IAAI;GAAC;GAAK;GAAK;EAAG;EAClB,IAAI;GAAC;GAAK;GAAK;EAAG;EAElB,GAAG;GAAC;GAAK;GAAK;GAAK;EAAG;EAEtB,KAAK;GAAC;GAAK;GAAK;GAAK;GAAK;EAAG;EAC7B,KAAK;GAAC;GAAK;GAAK;EAAG;EACnB,KAAK;GAAC;GAAK;GAAK;EAAG;EACnB,KAAK;GAAC;GAAK;GAAK;GAAK;EAAG;EACxB,KAAK;GAAC;GAAK;GAAK;GAAK;EAAG;EACxB,KAAK;GAAC;GAAK;GAAK;GAAK;EAAG;EACxB,KAAK;GAAC;GAAK;GAAK;GAAK;EAAG;EACxB,KAAK;GAAC;GAAK;GAAK;GAAK;EAAG;EACxB,KAAK;GAAC;GAAK;GAAK;GAAK;EAAG;EACxB,KAAK;GAAC;GAAK;GAAK;GAAK;GAAK;EAAG;EAC7B,KAAK;GAAC;GAAK;GAAK;GAAK;GAAK;EAAG;EAE7B,IAAI;GAAC;GAAK;GAAK;GAAK;EAAG;EACvB,IAAI;GAAC;GAAK;GAAK;GAAK;EAAG;EACvB,IAAI;GAAC;GAAK;GAAK;GAAK;EAAG;EAEvB,GAAG;GAAC;GAAK;GAAK;EAAG;EACjB,IAAI;GAAC;GAAK;GAAK;EAAG;EAClB,GAAG;GAAC;GAAK;GAAK;GAAK;EAAG;EACtB,GAAG;GAAC;GAAK;GAAK;EAAG;EACjB,IAAI;GAAC;GAAK;GAAK;GAAK;EAAG;EACvB,GAAG;GAAC;GAAK;GAAS;GAAS;GAAS;EAAK;CAC3C;AACF;AAEA,MAAM,mBAA6C;CACjD,OAAO;EAAC;EAAM;EAAM;EAAM;EAAK;EAAK;CAAG;CACvC,OAAO;EAAC;EAAM;EAAM;EAAM;EAAM;EAAK;EAAK;EAAK;CAAG;CAClD,OAAO;EAAC;EAAM;EAAM;EAAM;EAAM;EAAK;EAAK;EAAK;CAAG;CAClD,OAAO;EAAC;EAAM;EAAM;EAAM;EAAM;EAAM;EAAM;EAAM;EAAM;EAAM;EAAM;CAAI;AAC1E;;;;;;;;;;;AAYA,SAAgB,gBAAgB,QAAkC;CAChE,MAAM,0BAAU,IAAI,IAAoB;CACxC,IAAI,OAAO,WAAW,YAAY,OAAO,WAAW,GAClD,OAAO;EAAE,SAAS;EAAW;CAAQ;CAGvC,MAAM,WAAW,OAAO,MAAM,GAAG,CAAC,CAAC,QAAQ,MAAM,EAAE,SAAS,CAAC;CAC7D,IAAI,SAAS,WAAW,GACtB,OAAO;EAAE,SAAS;EAAW;CAAQ;CAGvC,IAAI,UAAU;CACd,IAAI,QAAQ;CACZ,MAAM,QAAQ,SAAS;CACvB,IAAI,UAAU,KAAA,GACZ,OAAO;EAAE,SAAS;EAAW;CAAQ;CAEvC,IAAI,MAAM,WAAW,OAAO,GAAG;EAC7B,UAAU,MAAM,MAAM,CAAC;EACvB,QAAQ;CACV,OAAO,IAAI,CAAC,MAAM,SAAS,GAAG,GAE5B,OAAO;EAAE,SAAS;EAAW;CAAQ;CAGvC,KAAK,IAAI,IAAI,OAAO,IAAI,SAAS,QAAQ,KAAK;EAC5C,MAAM,MAAM,SAAS;EACrB,IAAI,QAAQ,KAAA,GACV;EAEF,MAAM,QAAQ,IAAI,QAAQ,GAAG;EAC7B,IAAI,SAAS,KAAK,UAAU,IAAI,SAAS,GAEvC;EAEF,MAAM,MAAM,IAAI,MAAM,GAAG,KAAK;EAC9B,MAAM,QAAQ,IAAI,MAAM,QAAQ,CAAC;EACjC,QAAQ,IAAI,KAAK,KAAK;CACxB;CAEA,OAAO;EAAE;EAAS;CAAQ;AAC5B;;;;;;;;;;;;;;;;;;AAmBA,SAAgB,mBACd,QACA,SACsB;CACtB,MAAM,SAAmB,CAAC;CAE1B,IAAI,OAAO,WAAW,YAAY,OAAO,WAAW,GAClD,OAAO;EAAE,OAAO;EAAO,QAAQ,CAAC,iBAAiB;CAAE;CAGrD,MAAM,SAAS,gBAAgB,MAAM;CACrC,MAAM,IAAI,WAAW,OAAO;CAE5B,MAAM,UAAU,cAAc;CAC9B,MAAM,WAAW,iBAAiB;CAClC,IAAI,CAAC,WAAW,CAAC,UAAU;EACzB,OAAO,KAAK,6BAA6B,GAAG;EAC5C,OAAO;GAAE,OAAO;GAAO;EAAO;CAChC;CAEA,KAAK,MAAM,OAAO,UAChB,IAAI,CAAC,OAAO,QAAQ,IAAI,GAAG,GACzB,OAAO,KAAK,4BAA4B,KAAK;CAIjD,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,QAAQ,GAAG;EACnD,MAAM,UAAU,QAAQ;EACxB,IAAI,CAAC,SAEH;EAEF,IAAI,CAAC,QAAQ,SAAS,KAAK,GACzB,OAAO,KAAK,4BAA4B,IAAI,IAAI,MAAM,aAAa,QAAQ,KAAK,GAAG,EAAE,EAAE;CAE3F;CAEA,OAAO;EAAE,OAAO,OAAO,WAAW;EAAG;CAAO;AAC9C;AAiBA,MAAM,YAAoC;CAAE,GAAG;CAAM,GAAG;CAAM,GAAG;CAAM,GAAG;AAAI;AAC9E,MAAM,YAAoC;CAAE,GAAG;CAAM,GAAG;AAAK;AAC7D,MAAM,YAAoC;CAAE,GAAG;CAAM,GAAG;AAAK;AAC7D,MAAM,aAAqC;CAAE,GAAG;CAAK,GAAG;CAAM,GAAG;AAAK;AACtE,MAAM,sBAA8C;CAAE,GAAG;CAAM,GAAG;CAAM,GAAG;AAAK;AAChF,MAAM,oBAA4C;CAAE,GAAG;CAAM,GAAG;CAAM,GAAG;AAAI;AAC7E,MAAM,WAAmC;CAAE,GAAG;CAAK,GAAG;CAAK,GAAG;CAAM,GAAG;CAAM,GAAG;AAAK;AACrF,MAAM,YAAoC;CAAE,GAAG;CAAK,GAAG;CAAK,GAAG;CAAM,GAAG;CAAM,GAAG;AAAK;AACtF,MAAM,YAAoC;CAAE,GAAG;CAAK,GAAG;CAAK,GAAG;CAAM,GAAG;AAAK;;;;;;AAO7E,SAAS,UAAU,GAAmB;CACpC,MAAM,WAAW,KAAK,MAAM,IAAI,GAAM;CACtC,IAAI,WAAW,QAAU,GACvB,OAAO,WAAW;CAEpB,QAAQ,KAAK,MAAM,WAAW,GAAK,IAAI,KAAK;AAC9C;AAEA,SAAS,qBACP,OACA,SACA,KACQ;CACR,MAAM,IAAI,QAAQ,IAAI,GAAG;CACzB,IAAI,MAAM,KAAA,GACR,OAAO;CAET,MAAM,IAAI,MAAM;CAChB,IAAI,MAAM,KAAA,GACR,MAAM,IAAI,MAAM,qBAAqB,IAAI,UAAU,EAAE,EAAE;CAEzD,OAAO;AACT;;;;;;;;;;;AAYA,SAAgB,iBAAiB,QAA2B;CAC1D,MAAM,EAAE,SAAS,YAAY,gBAAgB,MAAM;CACnD,IAAI,YAAY,OACd,MAAM,IAAI,MAAM,oDAAoD,QAAQ,EAAE;CAEhF,KAAK,MAAM,KAAK;EAAC;EAAM;EAAM;EAAM;EAAM;EAAK;EAAK;EAAK;CAAG,GACzD,IAAI,CAAC,QAAQ,IAAI,CAAC,GAChB,MAAM,IAAI,MAAM,2CAA2C,EAAE,EAAE;CAInE,MAAM,QAAQ,QAAQ,IAAI,GAAG;CAC7B,IAAI,UAAU,OAAO,UAAU,KAC7B,MAAM,IAAI,MAAM,kCAAkC,SAAS,GAAG,EAAE;CAElE,MAAM,eAAe,UAAU;CAE/B,MAAM,UAAU,eAAe,oBAAoB;CACnD,MAAM,UAAU,OAA+B,WAA2B;EACxE,MAAM,MAAM,QAAQ,IAAI,MAAM;EAC9B,MAAM,IAAI,QAAQ,KAAA,IAAY,KAAA,IAAY,MAAM;EAChD,IAAI,MAAM,KAAA,GACR,MAAM,IAAI,MAAM,kCAAkC,OAAO,IAAI,OAAO,GAAG,EAAE;EAE3E,OAAO;CACT;CACA,MAAM,KAAK,OAAO,WAAW,IAAI;CACjC,MAAM,KAAK,OAAO,WAAW,IAAI;CACjC,MAAM,KAAK,OAAO,WAAW,IAAI;CACjC,MAAM,KAAK,OAAO,SAAS,IAAI;CAC/B,MAAM,IAAI,OAAO,YAAY,GAAG;CAChC,MAAM,IAAI,OAAO,YAAY,GAAG;CAChC,MAAM,IAAI,OAAO,YAAY,GAAG;CAEhC,MAAM,MAAM,KAAK,IAAI,MAAM,IAAI,MAAM,IAAI;CACzC,MAAM,SAAS,eACX,QAAQ,MAAM,QAAS,OAAO,KAAK,IAAI,MAAM,KAAM,EAAE,IACrD,OAAO;CACX,MAAM,iBAAiB,OAAO,KAAK,KAAK,KAAK;CAE7C,IAAI;CACJ,IAAI,UAAU,GACZ,YAAY;MACP,IAAI,cACT,YAAY,UAAU,KAAK,IAAI,QAAQ,SAAS,iBAAiB,EAAE,CAAC;MAEpE,YAAY,UAAU,KAAK,IAAI,SAAS,gBAAgB,EAAE,CAAC;CAG7D,MAAM,IAAI,qBAAqB,UAAU,SAAS,GAAG;CACrD,MAAM,KAAK,qBAAqB,WAAW,SAAS,IAAI;CACxD,MAAM,KAAK,qBAAqB,WAAW,SAAS,IAAI;CACxD,MAAM,gBAAgB,UAAU,YAAY,IAAI,KAAK,EAAE;CAEvD,OAAO;EAAE,SAAS;EAAO;EAAW;CAAc;AACpD;AA0BA,MAAM,SAASA;AAGf,MAAM,YAAoC;CAAE,GAAG;CAAK,GAAG;CAAK,GAAG;CAAK,GAAG;AAAI;AAC3E,MAAM,YAAoC;CAAE,GAAG;CAAK,GAAG;CAAK,GAAG;AAAI;AACnE,MAAM,YAAoC;CAAE,GAAG;CAAK,GAAG;CAAK,GAAG;AAAI;AACnE,MAAM,YAAoC;CAAE,GAAG;CAAK,GAAG;AAAI;AAC3D,MAAM,YAAoC;CAAE,GAAG;CAAK,GAAG;AAAI;AAC3D,MAAM,YAAoC;CAAE,GAAG;CAAK,GAAG;CAAK,GAAG;AAAI;AACnE,MAAM,YAAoC;CAAE,GAAG;CAAK,GAAG;CAAK,GAAG;AAAI;AACnE,MAAM,YAAoC;CAAE,GAAG;CAAK,GAAG;CAAK,GAAG;CAAK,GAAG;AAAI;AAC3E,MAAM,YAAoC;CAAE,GAAG;CAAK,GAAG;CAAK,GAAG;AAAI;;AAGnE,SAAS,IAAO,OAAsB,MAAiB;CACrD,IAAI,UAAU,KAAA,GACZ,MAAM,IAAI,MAAM,gCAAgC,MAAM;CAExD,OAAO;AACT;;;;;;AAOA,SAAS,aAAa,KAA0B,QAAwB;CACtE,MAAM,WAAW,IAAI,IAAI,MAAM,KAAK;CACpC,IAAI,WAAW,QAAQ,aAAa,MAAM,aAAa,MACrD,OAAO;CAET,KAAK,WAAW,QAAQ,WAAW,QAAQ,WAAW,UAAU,aAAa,MAAM,aAAa,MAC9F,OAAO;CAET,MAAM,WAAW,IAAI,IAAI,MAAM,MAAM;CACrC,IAAI,aAAa,KAAA,KAAa,aAAa,KACzC,OAAO;CAET,OAAO;AACT;AAEA,SAAS,yBAAyB,KAAkC;CAClE,MAAM,MAAM,MAAsB,aAAa,KAAK,CAAC;CAIrD,IAAI,MAAM;CACV,IAAI,GAAG,IAAI,MAAM,OAAO,GAAG,IAAI,MAAM,OAAO,GAAG,IAAI,MAAM,KACvD,MAAM;MACD,KAAK,GAAG,IAAI,MAAM,OAAO,GAAG,IAAI,MAAM,OAAO,GAAG,IAAI,MAAM,QAAQ,GAAG,IAAI,MAAM,KACpF,MAAM;CAGR,IAAI,MAAM;CACV,IAAI,GAAG,IAAI,MAAM,OAAO,GAAG,IAAI,MAAM,KACnC,MAAM;CAGR,IAAI,MAAM;CACV,IAAI,GAAG,IAAI,MAAM,OAAO,GAAG,IAAI,MAAM,KACnC,MAAM;MACD,IAAI,GAAG,IAAI,MAAM,OAAO,GAAG,IAAI,MAAM,OAAO,GAAG,IAAI,MAAM,KAC9D,MAAM;CAGR,IAAI,MAAM;CACV,IAAI,GAAG,KAAK,MAAM,OAAO,GAAG,KAAK,MAAM,KACrC,MAAM;MACD,IAAI,GAAG,IAAI,MAAM,OAAO,GAAG,IAAI,MAAM,OAAO,GAAG,IAAI,MAAM,KAC9D,MAAM;CAGR,IAAI,MAAM;CACV,IAAI,GAAG,GAAG,MAAM,KACd,MAAM;MACD,IAAI,GAAG,GAAG,MAAM,KACrB,MAAM;CAGR,IAAI,MAAM;CACV,IACG,GAAG,IAAI,MAAM,OAAO,GAAG,IAAI,MAAM,OACjC,GAAG,IAAI,MAAM,OAAO,GAAG,IAAI,MAAM,OACjC,GAAG,IAAI,MAAM,OAAO,GAAG,IAAI,MAAM,KAElC,MAAM;CAGR,OAAO,MAAM,MAAM,MAAM,MAAM,MAAM;AACvC;;AAGA,SAAgB,kBAAkB,QAAwB;CACxD,OAAO,yBAAyB,gBAAgB,MAAM,CAAC,CAAC,OAAO;AACjE;;AAGA,SAAS,oBAAoB,QAAgB,GAAmB;CAC9D,MAAM,MAAM,EAAE,QAAQ,MAAM;CAC5B,IAAI,MAAM,GACR,OAAO;CAET,MAAM,OAAO,EAAE,MAAM,MAAM,OAAO,SAAS,CAAC;CAC5C,MAAM,QAAQ,KAAK,QAAQ,GAAG;CAC9B,OAAO,SAAS,IAAI,KAAK,MAAM,GAAG,KAAK,IAAI;AAC7C;;AAGA,SAAS,gBAAgB,OAAe,YAA4B;CAClE,MAAM,IAAI,OAAO,OAAO;CACxB,OAAO,MAAM,KAAA,IAAY,MAAM,QAAQ;AACzC;AAEA,SAAS,YAAY,KAAkC;CACrD,MAAM,MAAM,MAAsB,aAAa,KAAK,CAAC;CAErD,IACE,GAAG,IAAI,MAAM,OAAO,GAAG,IAAI,MAAM,OAAO,GAAG,IAAI,MAAM,OACrD,GAAG,IAAI,MAAM,OAAO,GAAG,IAAI,MAAM,OAAO,GAAG,IAAI,MAAM,KAErD,OAAO;CAGT,MAAM,QAAQ,yBAAyB,GAAG;CAC1C,IAAI,QAAQ,IAAI,OAAO,OAAO,QAAQ,UAAU,MAAM,EAAE;CAGxD,MAAM,KAAK,MAAM,OAAO,CAAC;CACzB,MAAM,KAAK,MAAM,OAAO,CAAC;CACzB,MAAM,KAAK,MAAM,OAAO,CAAC;CACzB,MAAM,KAAK,MAAM,OAAO,CAAC;CACzB,MAAM,KAAK,MAAM,OAAO,CAAC;CACzB,MAAM,KAAK,MAAM,OAAO,CAAC;CAEzB,MAAM,KAAK,MAAsB,MAAM,WAAW,CAAC,IAAI;CACvD,MAAM,MAAM,EAAE,CAAC;CACf,MAAM,MAAM,EAAE,CAAC;CACf,MAAM,OAAO,GAAW,UACtB,MAAM,MAAM,GAAG,CAAC,IAAI,OAAO,KAAK,IAAI,MAAM,MAAM,IAAI,CAAC;CAEvD,MAAM,eAAe,gBAAgB,OAAO,IAAI,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;CAC5D,MAAM,eAAe,gBAAgB,OAAO,IAAI,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;CAC5D,MAAM,eAAe,gBAAgB,OAAO,IAAI,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;CAC5D,MAAM,eAAe,gBAAgB,OAAO,IAAI,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;CAG5D,IAAI,kBAAkB;CACtB,IAAK,QAAQ,KAAK,QAAQ,KAAO,QAAQ,KAAK,QAAQ,GACpD,kBAAkB,gBAAgB,OAAO,IAAI,GAAG,MAAM,CAAC,CAAC;MACnD,IAAI,QAAQ,KAAK,QAAQ,GAC9B,kBAAkB,gBAAgB,OAAO,IAAI,GAAG,MAAM,CAAC,CAAC;MACnD,IAAI,QAAQ,KAAK,QAAQ,GAAG;EACjC,MAAM,OAAO,OAAO,OAAO,IAAI,GAAG,MAAM,CAAC;EACzC,MAAM,QAAQ,OAAO,OAAO,IAAI,GAAG,MAAM,CAAC;EAC1C,IAAI,SAAS,KAAA,KAAa,UAAU,KAAA,GAClC,kBAAkB,QAAQ,KAAK,IAAI,MAAM,KAAK;OACzC,IAAI,UAAU,KAAA,GACnB,kBAAkB,QAAQ;CAE9B,OACE,kBAAkB,gBAAgB,OAAO,MAAM,MAAM,GAAG,CAAC,IAAI,OAAO,MAAM,CAAC,IAAI,MAAM,MAAM,GAAG,CAAC,IAAI,OAAO,MAAM,CAAC,CAAC;CAGpH,MAAM,WAAW,IAAI,OAAO,YAAY,IAAI,KAAK,mBAAmB,GAAG,EAAE;CACzE,MAAM,WAAW,IAAI,OAAO,YAAY,IAAI,KAAK,mBAAmB,GAAG,EAAE;CACzE,MAAM,cAAc,IAClB,IAAI,OAAO,YAAY,IAAI,KAAK,mBAAmB,GAAG,EAAE,CAAC,CAAC,KAC1D,mBAAmB,GAAG,IAAI,GAAG,EAC/B;CACA,MAAM,WAAW,IAAI,OAAO,YAAY,IAAI,KAAK,mBAAmB,GAAG,EAAE;CACzE,MAAM,WAAW,IAAI,OAAO,YAAY,IAAI,KAAK,mBAAmB,GAAG,EAAE;CAEzE,MAAM,aAAuB,CAAC;CAC9B,KAAK,MAAM,KAAK,UACd,KAAK,MAAM,KAAK,UACd,KAAK,MAAM,KAAK,aACd,KAAK,MAAM,KAAK,UACd,KAAK,MAAM,KAAK,UACd,WAAW,KAAK,IAAI,IAAI,IAAI,IAAI,CAAC;CAO3C,MAAM,QAAQ,OAA+B,QAAgB,cAC3D,IAAI,MAAM,GAAG,MAAM,IAAI,SAAS,OAAO,GAAG,GAAG,MAAM,GAAG,IACtD,IAAI,MAAM,oBAAoB,QAAQ,SAAS,IAAI,aAAa,QAAQ;CAE1E,IAAI,OAAO,GAAG,OAAO,GAAG,OAAO,GAAG,OAAO,GAAG,OAAO,GAAG,OAAO,GAAG,OAAO,GAAG,OAAO;CACjF,IAAI,OAAO,GAAG,OAAO,GAAG,OAAO,GAAG,OAAO,GAAG,OAAO,GAAG,OAAO;CAC7D,KAAK,MAAM,aAAa,YAAY;EAClC,OAAO,KAAK,WAAW,MAAM,SAAS;EACtC,OAAO,KAAK,WAAW,MAAM,SAAS;EACtC,OAAO,KAAK,WAAW,MAAM,SAAS;EACtC,OAAO,KAAK,WAAW,MAAM,SAAS;EACtC,OAAO,KAAK,WAAW,MAAM,SAAS;EACtC,OAAO,KAAK,WAAW,MAAM,SAAS;EACtC,OAAO,KAAK,WAAW,MAAM,SAAS;EACtC,OAAO,KAAK,WAAW,MAAM,SAAS;EACtC,OAAO,KAAK,WAAW,MAAM,SAAS;EACtC,OAAO,KAAK,WAAW,MAAM,SAAS;EACtC,OAAO,KAAK,WAAW,MAAM,SAAS;EACtC,OAAO,KAAK,WAAW,MAAM,SAAS;EACtC,OAAO,KAAK,WAAW,MAAM,SAAS;EACtC,OAAO,KAAK,WAAW,MAAM,SAAS;EACtC,IACE;GAAC;GAAM;GAAM;GAAM;GAAM;GAAM;GAAM;GAAM;GAAM;GAAM;GAAM;GAAM;GAAM;GAAM;EAAI,CAAC,CAAC,MAClF,MAAM,IAAI,CACb,GAEA;EAEF;CACF;CAEA,MAAM,SAAS,OAAO,OAAO;CAC7B,MAAM,SAAS,OAAO;CACtB,MAAM,YAAY,OAAO,OAAO,OAAO,OAAO,OAAO;CACrD,MAAM,SAAS,OAAO,OAAO;CAE7B,MAAM,OAAO;CACb,MAAM,YAAY,IAAI,OAAO,YAAY,IAAI,KAAK,mBAAmB,GAAG,EAAE,IAAI;CAC9E,MAAM,YAAY,IAAI,OAAO,YAAY,IAAI,KAAK,mBAAmB,GAAG,EAAE,IAAI;CAC9E,MAAM,eACJ,IACE,IAAI,OAAO,YAAY,OAAO,KAAK,sBAAsB,GAAG,EAAE,CAAC,CAAC,KAChE,sBAAsB,GAAG,IAAI,GAAG,EAClC,IAAI;CACN,MAAM,YAAY,IAAI,OAAO,YAAY,IAAI,KAAK,mBAAmB,GAAG,EAAE,IAAI;CAE9E,IAAI,YAAY;CAChB,IAAI,UAAU,GAAG,UAAU,GAAG,aAAa,GAAG,UAAU;CACxD,MAAM,UAAU;CAChB,IAAI,CAAC,OAAO,MAAM,YAAY,GAAG;EAC/B;EACA,UAAU,gBAAgB,SAAS;CACrC;CACA,IAAI,CAAC,OAAO,MAAM,YAAY,GAAG;EAC/B;EACA,UAAU,gBAAgB,SAAS;CACrC;CACA,IAAI,CAAC,OAAO,MAAM,eAAe,GAAG;EAClC;EACA,aAAa,mBAAmB,YAAY;CAC9C;CACA,IAAI,CAAC,OAAO,MAAM,YAAY,GAAG;EAC/B;EACA,UAAU,gBAAgB,SAAS;CACrC;CACA,IAAI,CAAC,OAAO,MAAM,YAAY,GAC5B;CAGF,MAAM,eACJ,cAAc,IAAI,KAAK,UAAU,UAAU,aAAa,UAAU,WAAW;CAE/E,SAAS;CACT,IAAI,QAAQ,GACV,QAAQ;CAEV,IAAI,QAAQ,IACV,QAAQ;CAEV,OAAO,KAAK,MAAM,QAAQ,EAAE,IAAI;AAClC;;AAGA,SAAS,2BAA2B,QAAwB;CAC1D,OAAO,OACJ,MAAM,GAAG,CAAC,CACV,QAAQ,QAAQ,CAAC,IAAI,WAAW,IAAI,CAAC,CAAC,CACtC,KAAK,GAAG;AACb;;;;;;;;;;;AAYA,SAAgB,mBAAmB,QAA2B;CAC5D,MAAM,EAAE,YAAY,gBAAgB,MAAM;CAC1C,IAAI,YAAY,OACd,MAAM,IAAI,MAAM,wDAAwD,QAAQ,EAAE;CAEpF,MAAM,EAAE,OAAO,WAAW,mBAAmB,QAAQ,KAAK;CAC1D,IAAI,CAAC,OACH,MAAM,IAAI,MAAM,6BAA6B,OAAO,KAAK,IAAI,GAAG;CAGlE,MAAM,gBAAgB,YAAY,gBAAgB,MAAM,CAAC,CAAC,OAAO;CAEjE,OAAO;EAAE,SAAS;EAAO,WADP,YAAY,gBAAgB,2BAA2B,MAAM,CAAC,CAAC,CAAC,OACjD;EAAG;CAAc;AACpD;;;ACtpBA,MAAM,aAAa;AACnB,MAAM,wBAAwB;AAC9B,MAAM,sBAAsB;AAC5B,MAAM,8BAAc,IAAI,IAAI;CAAC;CAAK;CAAK;CAAK;AAAG,CAAC;;;;;;;;AAShD,SAAS,uBAAuB,MAAwB;CACtD,MAAM,SAAmB,CAAC;CAC1B,IAAI,UAAU;CACd,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;EACpC,MAAM,KAAK,KAAK;EAChB,IAAI,OAAO,QAAQ,IAAI,IAAI,KAAK,QAAQ;GACtC,MAAM,OAAO,KAAK,IAAI;GAEtB,IAAI,SAAS,OAAO,SAAS,MAAM;IACjC,WAAW;IACX;IACA;GACF;GAEA,WAAW;GACX;EACF;EACA,IAAI,OAAO,KAAK;GACd,OAAO,KAAK,OAAO;GACnB,UAAU;GACV;EACF;EACA,WAAW;CACb;CACA,OAAO,KAAK,OAAO;CACnB,OAAO;AACT;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA8BA,SAAgB,SAAS,QAAkC;CACzD,IAAI,CAAC,OAAO,WAAW,UAAU,GAC/B,OAAO;CAGT,MAAM,WAAqB,CAAC;CAC5B,MAAM,OAAO,OAAO,MAAM,CAAiB;CAK3C,MAAM,eAAe,KAAK,WAAW;CAErC,MAAM,YAAY,eAAe,CAAC,IAAI,uBAAuB,IAAI;CAGjE,MAAM,cAAc,eAAe,IAAI,IAAI,UAAU;CAErD,IAAI,UAAU,SAAS,qBACrB,SAAS,KAAK,sBAAsB;MAC/B,IAAI,UAAU,SAAS,qBAC5B,SAAS,KACP,uBAAuB,sBAAsB,+BAA+B,aAC9E;CAKF,MAAM,WAAW,eAAe,KAAK;CACrC,MAAM,SAAmB,UAAU,MAAM,GAAG,mBAAmB;CAC/D,OAAO,OAAO,SAAS,qBACrB,OAAO,KAAK,QAAQ;CAKtB,MAAM,CACJ,OAAO,IACP,SAAS,IACT,UAAU,IACV,UAAU,IACV,SAAS,IACT,UAAU,IACV,WAAW,IACX,YAAY,IACZ,WAAW,IACX,WAAW,IACX,QAAQ,MACN;CAEJ,IAAI,CAAC,YAAY,IAAI,IAAI,GACvB,SAAS,KAAK,iBAAiB,MAAM;CAGvC,OAAO;EACL,KAAK;EACL;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;CACF;AACF;;;ACjJA,MAAM,cAAc;;;;;;;;;;;;;;;;;;;;AAqBpB,SAAgB,UAAU,SAAoC;CAC5D,IAAI,CAAC,WAAW,CAAC,QAAQ,WAAW,WAAW,GAC7C,OAAO;CAGT,MAAM,MAAM;CACZ,MAAM,WAAqB,CAAC;CAI5B,IAAI,YAAY,QAAQ,MAAM,CAAkB;CAKhD,OAAO,UAAU,WAAW,GAAG,GAC7B,YAAY,UAAU,MAAM,CAAC;CAG/B,IAAI,UAAU,WAAW,GACvB,OAAO;CAOT,IAAI,UAAyB;CAC7B,MAAM,UAAU,UAAU,QAAQ,GAAG;CACrC,IAAI,YAAY,IAAI;EAClB,UAAU,UAAU,MAAM,UAAU,CAAC;EACrC,YAAY,UAAU,MAAM,GAAG,OAAO;EACtC,IAAI,QAAQ,WAAW,GACrB,UAAU;CAEd;CAGA,MAAM,6BAAa,IAAI,IAAoB;CAC3C,MAAM,OAAO,UAAU,QAAQ,GAAG;CAClC,IAAI,SAAS,IAAI;EACf,MAAM,OAAO,UAAU,MAAM,OAAO,CAAC;EACrC,YAAY,UAAU,MAAM,GAAG,IAAI;EACnC,gBAAgB,MAAM,YAAY,QAAQ;CAC5C;CAIA,OAAO,UAAU,SAAS,GAAG,GAC3B,YAAY,UAAU,MAAM,GAAG,EAAE;CAInC,MAAM,aAAa,UAAU,QAAQ,GAAG;CACxC,IAAI;CACJ,IAAI;CACJ,IAAI,eAAe,IAAI;EACrB,OAAO;EACP,WAAW;CACb,OAAO;EACL,OAAO,UAAU,MAAM,GAAG,UAAU;EACpC,WAAW,UAAU,MAAM,aAAa,CAAC;CAC3C;CAEA,IAAI,KAAK,WAAW,GAClB,OAAO;CAET,OAAO,KAAK,YAAY;CAKxB,IAAI,UAAyB;CAC7B,MAAM,SAAS,SAAS,YAAY,GAAG;CACvC,IAAI,YAAY;CAChB,IAAI,WAAW,IAAI;EACjB,UAAU,SAAS,MAAM,SAAS,CAAC;EACnC,YAAY,SAAS,MAAM,GAAG,MAAM;EACpC,UAAU,WAAW,OAAO;CAC9B;CAIA,IAAI,YAA2B;CAC/B,IAAI;CACJ,MAAM,YAAY,UAAU,YAAY,GAAG;CAC3C,IAAI,cAAc,IAChB,OAAO;MACF;EACL,YAAY,UAAU,MAAM,GAAG,SAAS;EACxC,OAAO,UAAU,MAAM,YAAY,CAAC;CACtC;CAGA,IAAI,cAAc,MAEhB,YAAY,UAAU,MAAM,GAAG,CAAC,CAAC,IAAI,UAAU,CAAC,CAAC,KAAK,GAAG;CAE3D,OAAO,WAAW,IAAI;CAEtB,IAAI,KAAK,WAAW,GAClB,SAAS,KAAK,kCAAkC;CAIlD,IAAI,cAAc,QAAQ,UAAU,WAAW,GAC7C,YAAY;CAId,IAAI,YAAY,QAAQ,QAAQ,WAAW,GACzC,UAAU;CAGZ,OAAO;EACL;EACA;EACA;EACA;EACA;EACA;EACA;EACA;CACF;AACF;;;;;;AAOA,SAAS,gBACP,MACA,KACA,UACM;CACN,MAAM,QAAQ,KAAK,MAAM,GAAG;CAC5B,KAAK,MAAM,QAAQ,OAAO;EACxB,IAAI,KAAK,WAAW,GAClB;EAEF,MAAM,KAAK,KAAK,QAAQ,GAAG;EAC3B,IAAI,OAAO,IAAI;GACb,IAAI,IAAI,MAAM,EAAE;GAChB,SAAS,KAAK,cAAc,KAAK,eAAe;GAChD;EACF;EACA,MAAM,MAAM,KAAK,MAAM,GAAG,EAAE;EAC5B,MAAM,QAAQ,KAAK,MAAM,KAAK,CAAC;EAC/B,IAAI,IAAI,KAAK,WAAW,KAAK,CAAC;CAChC;AACF;;;;;;AAOA,SAAS,WAAW,GAAmB;CACrC,IAAI;EACF,OAAO,mBAAmB,CAAC;CAC7B,QAAQ;EACN,OAAO;CACT;AACF;;;;ACxNA,MAAa,yBAAyB;AAOtC,IAAI,yBAAyB;;;;;AAM7B,SAAgB,uBAAuB,SAAuB;CAC5D,yBAAyB,UAAU,IAAI,UAAU;AACnD;;;;;;AAOA,SAAgB,oBAAoB,UAAU,GAAW;CACvD,IAAI,UAAU,GAAG,OAAO;CACxB,IAAI,yBAAyB,GAAG,OAAO;CACvC,OAAO;AACT;;;;;;;AAQA,SAAgB,kBAAkB,OAA4B,UAAU,GAAS;CAC/E,MAAM,QAAQ,oBAAoB,OAAO;CACzC,IAAI,OAAO,UAAU,UAAU;EAC7B,IAAI,MAAM,SAAS,OAAO,MAAM,SAAS,OAAO,MAAM,MAAM;EAC5D;CACF;CAGA,IAAI,MAAM,SAAS,KAAK,OAAO;CAC/B,MAAM,MAAM,eAAe,KAAK;CAChC,IAAI,MAAM,OAAO,MAAM,SAAS,OAAO,GAAG;AAC5C;AAEA,SAAS,SAAS,OAAe,KAAoB;CACnD,uBAAO,IAAI,MAAM,yCAAyC,MAAM,UAAU,IAAI,iBAAiB;AACjG;;;;;;;AAQA,SAAS,eAAe,GAAmB;CACzC,IAAI,QAAQ;CACZ,KAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;EACjC,MAAM,IAAI,EAAE,WAAW,CAAC;EACxB,IAAI,IAAI,KACN,SAAS;OACJ,IAAI,IAAI,MACb,SAAS;OACJ,IAAI,KAAK,SAAU,KAAK,UAAW,EAAE,WAAW,IAAI,CAAC,IAAI,WAAY,OAAQ;GAClF,SAAS;GACT;EACF,OACE,SAAS;CAEb;CACA,OAAO;AACT"}
package/dist/object/index.d.ts CHANGED
@@ -17,7 +17,7 @@
17
17
  * @param maxDepth - Maximum recursion depth (default 100). Nodes beyond this depth are silently skipped.
18
18
  * @returns Flat array of all matched values
19
19
  */
20
- declare function findValuesByKey(obj: unknown, key: string, maxDepth?: number): unknown[];
20
+ export declare function findValuesByKey(obj: unknown, key: string, maxDepth?: number): unknown[];
21
21
  /**
22
22
  * Extract all values for a named field from an array of objects.
23
23
  *
@@ -27,7 +27,7 @@ declare function findValuesByKey(obj: unknown, key: string, maxDepth?: number):
27
27
  * @param column - Property name to extract
28
28
  * @returns Array of values for that column
29
29
  */
30
- declare function extractColumn(rows: Record<string, unknown>[], column: string): unknown[];
30
+ export declare function extractColumn(rows: Record<string, unknown>[], column: string): unknown[];
31
31
  /**
32
32
  * Filter an array of objects to rows where a column matches a value.
33
33
  *
@@ -38,7 +38,6 @@ declare function extractColumn(rows: Record<string, unknown>[], column: string):
38
38
  * @param value - Value to match against
39
39
  * @returns Filtered array of matching rows
40
40
  */
41
- declare function findRows(rows: Record<string, unknown>[], column: string, value: unknown): Record<string, unknown>[];
41
+ export declare function findRows(rows: Record<string, unknown>[], column: string, value: unknown): Record<string, unknown>[];
42
42
  //#endregion
43
- export { extractColumn, findRows, findValuesByKey };
44
43
  //# sourceMappingURL=index.d.ts.map
package/dist/object/index.d.ts.map CHANGED
@@ -1 +1 @@
1
- {"version":3,"file":"index.d.ts","names":[],"sources":["../../src/object/index.ts"],"mappings":";;;;;;;;;;;;;;;;;;;iBAmBgB,gBACd,cACA,aACA;;;;;;;;;;iBA+Cc,cACd,MAAM,2BACN;;;;;;;;;;;iBAec,SACd,MAAM,2BACN,gBACA,iBACC"}
1
+ {"version":3,"file":"index.d.ts","names":[],"sources":["../../src/object/index.ts"],"mappings":";;;;;;;;;;;;;;;;;;;wBAmBgB,gBACd,cACA,aACA;;;;;;;;;;wBA+Cc,cACd,MAAM,2BACN;;;;;;;;;;;wBAec,SACd,MAAM,2BACN,gBACA,iBACC"}
package/dist/string/index.d.ts CHANGED
@@ -25,7 +25,7 @@
25
25
  * stripHtml('no tags here'); // 'no tags here'
26
26
  * ```
27
27
  */
28
- declare function stripHtml(html: string): string;
28
+ export declare function stripHtml(html: string): string;
29
29
  /**
30
30
  * Replace every `<...>` tag span with `replacement`, in a single linear scan.
31
31
  *
@@ -43,7 +43,7 @@ declare function stripHtml(html: string): string;
43
43
  * @param html - String potentially containing HTML tags
44
44
  * @param replacement - What each tag span becomes (`' '` or `''`)
45
45
  */
46
- declare function replaceHtmlTags(html: string, replacement: string): string;
46
+ export declare function replaceHtmlTags(html: string, replacement: string): string;
47
47
  /**
48
48
  * Parse a timestamp string in various common formats into a Date.
49
49
  *
@@ -64,7 +64,7 @@ declare function replaceHtmlTags(html: string, replacement: string): string;
64
64
  * parseTimestamp(''); // null
65
65
  * ```
66
66
  */
67
- declare function parseTimestamp(s: string): Date | null;
67
+ export declare function parseTimestamp(s: string): Date | null;
68
68
  /**
69
69
  * Trim trailing fractional-second zeros from an RFC3339 UTC timestamp string,
70
70
  * matching Go's RFC3339Nano marshaling (which drops trailing zeros and the
@@ -74,7 +74,7 @@ declare function parseTimestamp(s: string): Date | null;
74
74
  * trimUtcFraction('2024-11-15T10:30:00.000Z'); // '2024-11-15T10:30:00Z'
75
75
  * trimUtcFraction('2024-01-01T00:00:00.120Z'); // '2024-01-01T00:00:00.12Z'
76
76
  */
77
- declare function trimUtcFraction(s: string): string;
77
+ export declare function trimUtcFraction(s: string): string;
78
78
  /**
79
79
  * Format a Date as HDF's canonical timestamp: RFC3339 in UTC with trailing
80
80
  * fractional-second zeros trimmed. Byte-identical to what the Go converters
@@ -83,7 +83,7 @@ declare function trimUtcFraction(s: string): string;
83
83
  * @example
84
84
  * formatTimestamp(new Date('2024-11-15T10:30:00Z')); // '2024-11-15T10:30:00Z'
85
85
  */
86
- declare function formatTimestamp(d: Date): string;
86
+ export declare function formatTimestamp(d: Date): string;
87
87
  /**
88
88
  * Format a Date as RFC3339 in UTC truncated to whole seconds (no fractional
89
89
  * part). For exporters whose target format conventionally uses whole-second
@@ -93,13 +93,13 @@ declare function formatTimestamp(d: Date): string;
93
93
  * @example
94
94
  * formatTimestampSeconds(new Date('2024-11-15T10:30:00.123Z')); // '2024-11-15T10:30:00Z'
95
95
  */
96
- declare function formatTimestampSeconds(d: Date): string;
96
+ export declare function formatTimestampSeconds(d: Date): string;
97
97
  /**
98
98
  * Base64-encode the UTF-8 bytes of a string. Runtime-agnostic (TextEncoder +
99
99
  * btoa) so library code stays usable from browser bundles, where Node's
100
100
  * `Buffer` does not exist. Equivalent to `Buffer.from(text, 'utf-8').toString('base64')`.
101
101
  */
102
- declare function encodeBase64Utf8(text: string): string;
102
+ export declare function encodeBase64Utf8(text: string): string;
103
103
  /**
104
104
  * Rewrite zone-less timestamps in a raw HDF document to HDF's canonical
105
105
  * trimmed-UTC RFC3339 form, before the document is parsed.
@@ -114,7 +114,6 @@ declare function encodeBase64Utf8(text: string): string;
114
114
  *
115
115
  * Mirrored by NormalizeHDFTimestamps in hdf-utilities/go/timestamp.go.
116
116
  */
117
- declare function normalizeHdfTimestamps(json: string): string;
117
+ export declare function normalizeHdfTimestamps(json: string): string;
118
118
  //#endregion
119
- export { encodeBase64Utf8, formatTimestamp, formatTimestampSeconds, normalizeHdfTimestamps, parseTimestamp, replaceHtmlTags, stripHtml, trimUtcFraction };
120
119
  //# sourceMappingURL=index.d.ts.map
package/dist/string/index.d.ts.map CHANGED
@@ -1 +1 @@
1
- {"version":3,"file":"index.d.ts","names":[],"sources":["../../src/string/index.ts"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;iBA2BgB,UAAU;;;;;;;;;;;;;;;;;;iBAqBV,gBAAgB,cAAc;;;;;;;;;;;;;;;;;;;;;iBAmD9B,eAAe,YAAY;;;;;;;;;;iBAkC3B,gBAAgB;;;;;;;;;iBAqBhB,gBAAgB,GAAG;;;;;;;;;;iBAanB,uBAAuB,GAAG;;;;;;iBAa1B,iBAAiB;;;;;;;;;;;;;;;iBA0BjB,uBAAuB"}
1
+ {"version":3,"file":"index.d.ts","names":[],"sources":["../../src/string/index.ts"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;wBA2BgB,UAAU;;;;;;;;;;;;;;;;;;wBAqBV,gBAAgB,cAAc;;;;;;;;;;;;;;;;;;;;;wBAmD9B,eAAe,YAAY;;;;;;;;;;wBAkC3B,gBAAgB;;;;;;;;;wBAqBhB,gBAAgB,GAAG;;;;;;;;;;wBAanB,uBAAuB,GAAG;;;;;;wBAa1B,iBAAiB;;;;;;;;;;;;;;;wBA0BjB,uBAAuB"}
package/dist/xml/index.d.ts CHANGED
@@ -15,7 +15,7 @@ import { X2jOptions, XmlBuilderOptions } from "fast-xml-parser";
15
15
  * // Returns: { root: { item: { id: '1', '#text': 'Test' } } }
16
16
  * ```
17
17
  */
18
- declare function parseXml(xml: string, options?: Partial<X2jOptions> & {
18
+ export declare function parseXml(xml: string, options?: Partial<X2jOptions> & {
19
19
  maxSize?: number;
20
20
  }): Record<string, unknown>;
21
21
  /**
@@ -34,7 +34,7 @@ declare function parseXml(xml: string, options?: Partial<X2jOptions> & {
34
34
  * // Returns formatted XML string
35
35
  * ```
36
36
  */
37
- declare function buildXml(obj: Record<string, unknown> | unknown[], options?: Partial<XmlBuilderOptions>): string;
37
+ export declare function buildXml(obj: Record<string, unknown> | unknown[], options?: Partial<XmlBuilderOptions>): string;
38
38
  /**
39
39
  * Validate if a string is well-formed XML
40
40
  *
@@ -53,15 +53,15 @@ declare function buildXml(obj: Record<string, unknown> | unknown[], options?: Pa
53
53
  * The one home for this rule: an emitter deciding what to replace and a
54
54
  * validator deciding what to reject must not answer it differently.
55
55
  */
56
- declare function isXmlChar(ch: string): boolean;
56
+ export declare function isXmlChar(ch: string): boolean;
57
57
  /**
58
58
  * Replace every character XML 1.0 forbids with U+FFFD, which is what Go's
59
59
  * encoding/xml does. XML defines no escape for these — a numeric reference to a
60
60
  * C0 control is itself illegal — so the choice is a replacement character or a
61
61
  * document no conforming parser will read.
62
62
  */
63
- declare function xmlSafeText(value: string): string;
64
- declare function isValidXml(xml: string): boolean;
63
+ export declare function xmlSafeText(value: string): string;
64
+ export declare function isValidXml(xml: string): boolean;
65
65
  /**
66
66
  * Parse XML with array handling for repeated elements
67
67
  * Forces specified tag names to always be arrays, even if only one element exists
@@ -78,7 +78,7 @@ declare function isValidXml(xml: string): boolean;
78
78
  * // Without arrayTags, would return: { root: { item: 'Test' } }
79
79
  * ```
80
80
  */
81
- declare function parseXmlWithArrays(xml: string, arrayTags: string[], options?: Partial<X2jOptions> & {
81
+ export declare function parseXmlWithArrays(xml: string, arrayTags: string[], options?: Partial<X2jOptions> & {
82
82
  maxSize?: number;
83
83
  }): Record<string, unknown>;
84
84
  /**
@@ -94,7 +94,7 @@ declare function parseXmlWithArrays(xml: string, arrayTags: string[], options?:
94
94
  * // Returns: 'Bold and italic'
95
95
  * ```
96
96
  */
97
- declare function extractTextFromXml(xml: string): string;
97
+ export declare function extractTextFromXml(xml: string): string;
98
98
  //#endregion
99
- export { buildXml, extractTextFromXml, findValuesByKey as findXmlValues, isValidXml, isXmlChar, parseXml, parseXmlWithArrays, xmlSafeText };
99
+ export { findValuesByKey as findXmlValues };
100
100
  //# sourceMappingURL=index.d.ts.map
package/dist/xml/index.d.ts.map CHANGED
@@ -1 +1 @@
1
- {"version":3,"file":"index.d.ts","names":[],"sources":["../../src/xml/index.ts"],"mappings":";;;;;;;;;;;;;;;;;iBAuDgB,SACd,aACA,UAAU,QAAQ;EAAgB;IACjC;;;;;;;;;;;;;;;;;iBAsCa,SACd,KAAK,qCACL,UAAU,QAAQ;;;;;;;;;;;;;;;;;;;iBA6BJ,UAAU;;;;;;;iBAkBV,YAAY;iBAMZ,WAAW;;;;;;;;;;;;;;;;;iBAgCX,mBACd,aACA,qBACA,UAAU,QAAQ;EAAgB;IACjC;;;;;;;;;;;;;;iBAoCa,mBAAmB"}
1
+ {"version":3,"file":"index.d.ts","names":[],"sources":["../../src/xml/index.ts"],"mappings":";;;;;;;;;;;;;;;;;wBAuDgB,SACd,aACA,UAAU,QAAQ;EAAgB;IACjC;;;;;;;;;;;;;;;;;wBAsCa,SACd,KAAK,qCACL,UAAU,QAAQ;;;;;;;;;;;;;;;;;;;wBA6BJ,UAAU;;;;;;;wBAkBV,YAAY;wBAMZ,WAAW;;;;;;;;;;;;;;;;;wBAgCX,mBACd,aACA,qBACA,UAAU,QAAQ;EAAgB;IACjC;;;;;;;;;;;;;;wBAoCa,mBAAmB"}
package/dist/xml/index.js CHANGED
@@ -52,10 +52,11 @@ function parseXml(xml, options) {
52
52
  if (options?.maxSize !== void 0 && xml.length > options.maxSize) throw new Error(`Input exceeds maximum allowed size: ${xml.length} bytes exceeds limit of ${options.maxSize} bytes`);
53
53
  const validation = XMLValidator.validate(xml);
54
54
  if (validation !== true) throw new Error(`Invalid XML: ${validation.err.msg}`);
55
- return new XMLParser({
55
+ const mergedOptions = {
56
56
  ...DEFAULT_PARSE_OPTIONS,
57
57
  ...options
58
- }).parse(xml);
58
+ };
59
+ return new XMLParser(mergedOptions).parse(xml);
59
60
  }
60
61
  /**
61
62
  * Build XML string from JavaScript object
@@ -74,10 +75,11 @@ function parseXml(xml, options) {
74
75
  * ```
75
76
  */
76
77
  function buildXml(obj, options) {
77
- return new XMLBuilder({
78
+ const mergedOptions = {
78
79
  ...DEFAULT_BUILD_OPTIONS,
79
80
  ...options
80
- }).build(obj);
81
+ };
82
+ return new XMLBuilder(mergedOptions).build(obj);
81
83
  }
82
84
  /**
83
85
  * Validate if a string is well-formed XML
@@ -137,11 +139,12 @@ function parseXmlWithArrays(xml, arrayTags, options) {
137
139
  if (options?.maxSize !== void 0 && xml.length > options.maxSize) throw new Error(`Input exceeds maximum allowed size: ${xml.length} bytes exceeds limit of ${options.maxSize} bytes`);
138
140
  const validation = XMLValidator.validate(xml);
139
141
  if (validation !== true) throw new Error(`Invalid XML: ${validation.err.msg}`);
140
- return new XMLParser({
142
+ const mergedOptions = {
141
143
  ...DEFAULT_PARSE_OPTIONS,
142
144
  ...options,
143
145
  isArray: (tagName) => arrayTags.includes(tagName)
144
- }).parse(xml);
146
+ };
147
+ return new XMLParser(mergedOptions).parse(xml);
145
148
  }
146
149
  /**
147
150
  * Extract text content from XML, stripping all tags