@mitre/hdf-parsers 3.1.0 → 3.3.0

package/README.md

@@ -18,13 +18,13 @@ Parse and load Heimdall Data Format (HDF) documents with validation. Provides a
 |-------------|----------------|
 | Parse JSON → typed objects | Validate JSON against schema |
 | "Load and validate this HDF file" | "Is this valid HDF?" |
-| Returns typed HdfResults/HdfBaseline | Returns validation errors |
+| Returns typed HDFResults/HDFBaseline | Returns validation errors |
 | One-step parse + validate | Schema validation only |
 | Used by CLI commands and tools | Used internally by parsers |
 
 **Example:**
 - `validateResults(data)` → `{ valid: true, errors: [] }` (validators - just validates)
-- `parseResults(json)` → `{ success: true, data: HdfResults }` (parsers - validates AND parses)
+- `parseResults(json)` → `{ success: true, data: HDFResults }` (parsers - validates AND parses)
 
 ## Installation
 
@@ -90,7 +90,7 @@ import (
 	"fmt"
 	"os"
 
-	parsers "github.com/mitre/hdf-libs/hdf-parsers/go"
+	parsers "github.com/mitre/hdf-libs/hdf-parsers/go/v3"
 )
 
 func main() {
@@ -137,23 +137,23 @@ if result.Success {
 
 ### TypeScript
 
-#### `parseResults(input: string | Uint8Array): ParseResult<HdfResults>`
+#### `parseResults(input: string | Uint8Array): ParseResult<HDFResults>`
 
 Parse HDF Results document from JSON string or bytes.
 
 - **Parameters:**
   - `input` - JSON string or Uint8Array to parse
-- **Returns:** `ParseResult<HdfResults>` with parsed data or error
+- **Returns:** `ParseResult<HDFResults>` with parsed data or error
 
-#### `parseBaseline(input: string | Uint8Array): ParseResult<HdfBaseline>`
+#### `parseBaseline(input: string | Uint8Array): ParseResult<HDFBaseline>`
 
 Parse HDF Baseline document from JSON string or bytes.
 
 - **Parameters:**
   - `input` - JSON string or Uint8Array to parse
-- **Returns:** `ParseResult<HdfBaseline>` with parsed data or error
+- **Returns:** `ParseResult<HDFBaseline>` with parsed data or error
 
-#### `parse(input: string | Uint8Array): ParseResult<HdfResults | HdfBaseline>`
+#### `parse(input: string | Uint8Array): ParseResult<HDFResults | HDFBaseline>`
 
 Parse HDF document with auto-detection of type (Results vs Baseline).
 
@@ -329,9 +329,9 @@ Get type-safe HDF objects:
 
 ```typescript
 import { parseResults } from '@mitre/hdf-parsers';
-import type { HdfResults } from '@mitre/hdf-schema';
+import type { HDFResults } from '@mitre/hdf-schema';
 
-function processResults(data: HdfResults) {
+function processResults(data: HDFResults) {
   // TypeScript knows the exact structure
   for (const baseline of data.baselines ?? []) {
     console.log(`Baseline: ${baseline.name}`);

package/dist/index.d.ts

@@ -1,8 +1,8 @@
-import { HdfBaseline, HdfResults } from "@mitre/hdf-schema";
+import { HDFBaseline, HDFComparison, HDFEvidencePackage, HDFPlan, HDFResults, HDFSystem } from "@mitre/hdf-schema";
 
 //#region typescript/flatten.d.ts
 interface FlattenResult {
-  results: HdfResults;
+  results: HDFResults;
   metadata: FlattenMetadata;
 }
 interface FlattenMetadata {
@@ -29,9 +29,16 @@ interface BaselineMerge {
  * @param results - Parsed HDF Results (from parseResults() or equivalent)
  * @returns FlattenResult with flattened data and merge metadata
  */
-declare function flattenOverlays(results: HdfResults): FlattenResult;
+declare function flattenOverlays(results: HDFResults): FlattenResult;
 //#endregion
 //#region typescript/index.d.ts
+/**
+ * Append Z (treat as UTC) to bare ISO timestamps in a JSON string so they
+ * pass schema validation. Exported so other workspace packages can use the
+ * same regex instead of re-implementing it. Matches the Go side at
+ * hdf-parsers/go/parsers.go.
+ */
+declare function normalizeTimestamps(input: string): string;
 /**
  * Result of parsing operation
  */
@@ -39,26 +46,42 @@ interface ParseResult<T> {
   success: boolean;
   data?: T;
   error?: string;
-  type?: 'results' | 'baseline';
+  type?: 'results' | 'baseline' | 'system' | 'plan' | 'evidencePackage' | 'comparison';
 }
 /**
  * Parse HDF Results document from string or bytes
  * @param input - JSON string or Uint8Array to parse
  * @returns ParseResult with parsed data or error
  */
-declare function parseResults(input: string | Uint8Array): ParseResult<HdfResults>;
+declare function parseResults(input: string | Uint8Array): ParseResult<HDFResults>;
 /**
  * Parse HDF Baseline document from string or bytes
  * @param input - JSON string or Uint8Array to parse
  * @returns ParseResult with parsed data or error
  */
-declare function parseBaseline(input: string | Uint8Array): ParseResult<HdfBaseline>;
+declare function parseBaseline(input: string | Uint8Array): ParseResult<HDFBaseline>;
+/**
+ * Parse HDF System document from string or bytes
+ */
+declare function parseSystem(input: string | Uint8Array): ParseResult<HDFSystem>;
+/**
+ * Parse HDF Plan document from string or bytes
+ */
+declare function parsePlan(input: string | Uint8Array): ParseResult<HDFPlan>;
+/**
+ * Parse HDF Evidence Package document from string or bytes
+ */
+declare function parseEvidencePackage(input: string | Uint8Array): ParseResult<HDFEvidencePackage>;
+/**
+ * Parse HDF Comparison document from string or bytes
+ */
+declare function parseComparison(input: string | Uint8Array): ParseResult<HDFComparison>;
 /**
  * Parse HDF document with auto-detection of type
  * @param input - JSON string or Uint8Array to parse
  * @returns ParseResult with parsed data, type indicator, or error
  */
-declare function parse(input: string | Uint8Array): ParseResult<HdfResults | HdfBaseline>;
+declare function parse(input: string | Uint8Array): ParseResult<HDFResults | HDFBaseline | HDFSystem | HDFPlan | HDFEvidencePackage | HDFComparison>;
 //#endregion
-export { type BaselineMerge, type FlattenMetadata, type FlattenResult, ParseResult, flattenOverlays, parse, parseBaseline, parseResults };
+export { type BaselineMerge, type FlattenMetadata, type FlattenResult, ParseResult, flattenOverlays, normalizeTimestamps, parse, parseBaseline, parseComparison, parseEvidencePackage, parsePlan, parseResults, parseSystem };
 //# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","names":[],"sources":["../typescript/flatten.ts","../typescript/index.ts"],"mappings":";;;UAIiB,aAAA;EACf,OAAA,EAAS,UAAA;EACT,QAAA,EAAU,eAAA;AAAA;AAAA,UAGK,eAAA;EACf,qBAAA;EACA,sBAAA;EACA,MAAA,EAAQ,aAAA;EACR,QAAA;AAAA;AAAA,UAGe,aAAA;EACf,YAAA;EACA,iBAAA;EACA,cAAA;EACA,aAAA;EACA,OAAA;AAAA;;;;;;;AALF;;;;;iBAgIgB,eAAA,CAAgB,OAAA,EAAS,UAAA,GAAa,aAAA;;;AA5ItD;;;AAAA,UCIiB,WAAA;EACf,OAAA;EACA,IAAA,GAAO,CAAA;EACP,KAAA;EACA,IAAA;AAAA;;ADHF;;;;iBCWgB,YAAA,CAAa,KAAA,WAAgB,UAAA,GAAa,WAAA,CAAY,UAAA;;;;;;iBAsDtD,aAAA,CAAc,KAAA,WAAgB,UAAA,GAAa,WAAA,CAAY,WAAA;AD1DvE;;;;;AAAA,iBC+GgB,KAAA,CAAM,KAAA,WAAgB,UAAA,GAAa,WAAA,CAAY,UAAA,GAAa,WAAA"}
+{"version":3,"file":"index.d.ts","names":[],"sources":["../typescript/flatten.ts","../typescript/index.ts"],"mappings":";;;UAIiB,aAAA;EACf,OAAA,EAAS,UAAA;EACT,QAAA,EAAU,eAAe;AAAA;AAAA,UAGV,eAAA;EACf,qBAAA;EACA,sBAAA;EACA,MAAA,EAAQ,aAAa;EACrB,QAAA;AAAA;AAAA,UAGe,aAAA;EACf,YAAA;EACA,iBAAA;EACA,cAAA;EACA,aAAA;EACA,OAAA;AAAA;;;;;;AARQ;AAGV;;;;;iBAgIgB,eAAA,CAAgB,OAAA,EAAS,UAAA,GAAa,aAAa;;;AA5InE;;;;;;AAAA,iBC2BgB,mBAAA,CAAoB,KAAa;;;ADzBtB;UCgCV,WAAA;EACf,OAAA;EACA,IAAA,GAAO,CAAC;EACR,KAAA;EACA,IAAA;AAAA;;;;;AD7BQ;iBCqCM,YAAA,CAAa,KAAA,WAAgB,UAAA,GAAa,WAAA,CAAY,UAAA;;;;;;iBAmDtD,aAAA,CAAc,KAAA,WAAgB,UAAA,GAAa,WAAA,CAAY,WAAA;;;;iBA6CvD,WAAA,CAAY,KAAA,WAAgB,UAAA,GAAa,WAAA,CAAY,SAAA;ADFrE;;;AAAA,iBCwBgB,SAAA,CAAU,KAAA,WAAgB,UAAA,GAAa,WAAA,CAAY,OAAA;;;;iBAsBnD,oBAAA,CAAqB,KAAA,WAAgB,UAAA,GAAa,WAAA,CAAY,kBAAA;AD9CX;;;AAAA,iBCoEnD,eAAA,CAAgB,KAAA,WAAgB,UAAA,GAAa,WAAA,CAAY,aAAA;AArLzE;;;;AAAiD;AAAjD,iBA6MgB,KAAA,CACd,KAAA,WAAgB,UAAA,GACf,WAAA,CAAY,UAAA,GAAa,WAAA,GAAc,SAAA,GAAY,OAAA,GAAU,kBAAA,GAAqB,aAAA"}

package/dist/index.js

@@ -1,4 +1,4 @@
-import { validate, validateBaseline, validateResults } from "@mitre/hdf-validators";
+import { validate, validateBaseline, validateComparison, validateEvidencePackage, validatePlan, validateResults, validateSystem } from "@mitre/hdf-validators";
 //#region typescript/flatten.ts
 /** BFS from root, returns names in top-down order. Cycle-safe. */
 function collectTree(root, childrenMap) {
@@ -168,13 +168,23 @@ function flattenOverlays(results) {
 }
 //#endregion
 //#region typescript/index.ts
+const NO_TZ_TIMESTAMP_REGEX = /"(\d{4}-\d{2}-\d{2}T\d{2}:\d{2}:\d{2}(?:\.\d+)?)"/g;
+/**
+* Append Z (treat as UTC) to bare ISO timestamps in a JSON string so they
+* pass schema validation. Exported so other workspace packages can use the
+* same regex instead of re-implementing it. Matches the Go side at
+* hdf-parsers/go/parsers.go.
+*/
+function normalizeTimestamps(input) {
+	return input.replace(NO_TZ_TIMESTAMP_REGEX, "\"$1Z\"");
+}
 /**
 * Parse HDF Results document from string or bytes
 * @param input - JSON string or Uint8Array to parse
 * @returns ParseResult with parsed data or error
 */
 function parseResults(input) {
-	const jsonStr = typeof input === "string" ? input : new TextDecoder().decode(input);
+	const jsonStr = normalizeTimestamps(typeof input === "string" ? input : new TextDecoder().decode(input));
 	if (jsonStr.trim().length === 0) return {
 		success: false,
 		error: "Input is empty"
@@ -188,12 +198,6 @@ function parseResults(input) {
 			error: `Invalid JSON: ${err instanceof Error ? err.message : String(err)}`
 		};
 	}
-	const serialized = JSON.stringify(data);
-	const trimmedInput = jsonStr.trim();
-	if (serialized.length !== trimmedInput.length && !isWhitespaceEquivalent(serialized, trimmedInput)) return {
-		success: false,
-		error: "Invalid JSON: unexpected trailing data after end of object"
-	};
 	const validationResult = validateResults(data);
 	if (!validationResult.valid) return {
 		success: false,
@@ -210,7 +214,7 @@ function parseResults(input) {
 * @returns ParseResult with parsed data or error
 */
 function parseBaseline(input) {
-	const jsonStr = typeof input === "string" ? input : new TextDecoder().decode(input);
+	const jsonStr = normalizeTimestamps(typeof input === "string" ? input : new TextDecoder().decode(input));
 	if (jsonStr.trim().length === 0) return {
 		success: false,
 		error: "Input is empty"
@@ -224,13 +228,119 @@ function parseBaseline(input) {
 			error: `Invalid JSON: ${err instanceof Error ? err.message : String(err)}`
 		};
 	}
-	const serialized = JSON.stringify(data);
-	const trimmedInput = jsonStr.trim();
-	if (serialized.length !== trimmedInput.length && !isWhitespaceEquivalent(serialized, trimmedInput)) return {
+	const validationResult = validateBaseline(data);
+	if (!validationResult.valid) return {
 		success: false,
-		error: "Invalid JSON: unexpected trailing data after end of object"
+		error: `Schema validation failed: ${validationResult.getErrorMessage()}`
 	};
-	const validationResult = validateBaseline(data);
+	return {
+		success: true,
+		data
+	};
+}
+/**
+* Parse HDF System document from string or bytes
+*/
+function parseSystem(input) {
+	const jsonStr = normalizeTimestamps(typeof input === "string" ? input : new TextDecoder().decode(input));
+	if (jsonStr.trim().length === 0) return {
+		success: false,
+		error: "Input is empty"
+	};
+	let data;
+	try {
+		data = JSON.parse(jsonStr);
+	} catch (err) {
+		return {
+			success: false,
+			error: `Invalid JSON: ${err instanceof Error ? err.message : String(err)}`
+		};
+	}
+	const validationResult = validateSystem(data);
+	if (!validationResult.valid) return {
+		success: false,
+		error: `Schema validation failed: ${validationResult.getErrorMessage()}`
+	};
+	return {
+		success: true,
+		data
+	};
+}
+/**
+* Parse HDF Plan document from string or bytes
+*/
+function parsePlan(input) {
+	const jsonStr = normalizeTimestamps(typeof input === "string" ? input : new TextDecoder().decode(input));
+	if (jsonStr.trim().length === 0) return {
+		success: false,
+		error: "Input is empty"
+	};
+	let data;
+	try {
+		data = JSON.parse(jsonStr);
+	} catch (err) {
+		return {
+			success: false,
+			error: `Invalid JSON: ${err instanceof Error ? err.message : String(err)}`
+		};
+	}
+	const validationResult = validatePlan(data);
+	if (!validationResult.valid) return {
+		success: false,
+		error: `Schema validation failed: ${validationResult.getErrorMessage()}`
+	};
+	return {
+		success: true,
+		data
+	};
+}
+/**
+* Parse HDF Evidence Package document from string or bytes
+*/
+function parseEvidencePackage(input) {
+	const jsonStr = normalizeTimestamps(typeof input === "string" ? input : new TextDecoder().decode(input));
+	if (jsonStr.trim().length === 0) return {
+		success: false,
+		error: "Input is empty"
+	};
+	let data;
+	try {
+		data = JSON.parse(jsonStr);
+	} catch (err) {
+		return {
+			success: false,
+			error: `Invalid JSON: ${err instanceof Error ? err.message : String(err)}`
+		};
+	}
+	const validationResult = validateEvidencePackage(data);
+	if (!validationResult.valid) return {
+		success: false,
+		error: `Schema validation failed: ${validationResult.getErrorMessage()}`
+	};
+	return {
+		success: true,
+		data
+	};
+}
+/**
+* Parse HDF Comparison document from string or bytes
+*/
+function parseComparison(input) {
+	const jsonStr = normalizeTimestamps(typeof input === "string" ? input : new TextDecoder().decode(input));
+	if (jsonStr.trim().length === 0) return {
+		success: false,
+		error: "Input is empty"
+	};
+	let data;
+	try {
+		data = JSON.parse(jsonStr);
+	} catch (err) {
+		return {
+			success: false,
+			error: `Invalid JSON: ${err instanceof Error ? err.message : String(err)}`
+		};
+	}
+	const validationResult = validateComparison(data);
 	if (!validationResult.valid) return {
 		success: false,
 		error: `Schema validation failed: ${validationResult.getErrorMessage()}`
@@ -246,7 +356,7 @@ function parseBaseline(input) {
 * @returns ParseResult with parsed data, type indicator, or error
 */
 function parse(input) {
-	const jsonStr = typeof input === "string" ? input : new TextDecoder().decode(input);
+	const jsonStr = normalizeTimestamps(typeof input === "string" ? input : new TextDecoder().decode(input));
 	if (jsonStr.trim().length === 0) return {
 		success: false,
 		error: "Input is empty"
@@ -260,12 +370,6 @@ function parse(input) {
 			error: `Invalid JSON: ${err instanceof Error ? err.message : String(err)}`
 		};
 	}
-	const serialized = JSON.stringify(data);
-	const trimmedInput = jsonStr.trim();
-	if (serialized.length !== trimmedInput.length && !isWhitespaceEquivalent(serialized, trimmedInput)) return {
-		success: false,
-		error: "Invalid JSON: unexpected trailing data after end of object"
-	};
 	const validationResult = validate(data);
 	if (!validationResult.valid) return {
 		success: false,
@@ -278,26 +382,38 @@ function parse(input) {
 			data,
 			type: "results"
 		};
+		if ("requirementDiffs" in obj) return {
+			success: true,
+			data,
+			type: "comparison"
+		};
+		if ("assessments" in obj) return {
+			success: true,
+			data,
+			type: "plan"
+		};
+		if ("contents" in obj) return {
+			success: true,
+			data,
+			type: "evidencePackage"
+		};
 		if ("name" in obj && "requirements" in obj) return {
 			success: true,
 			data,
 			type: "baseline"
 		};
+		if ("components" in obj) return {
+			success: true,
+			data,
+			type: "system"
+		};
 	}
 	return {
 		success: false,
 		error: "Unable to determine HDF document type"
 	};
 }
-/**
-* Check if two JSON strings are equivalent modulo whitespace
-* This is a simple heuristic - we check if one is just whitespace-padded version of other
-*/
-function isWhitespaceEquivalent(a, b) {
-	const normalizeWhitespace = (s) => s.replace(/\s+/g, "");
-	return normalizeWhitespace(a) === normalizeWhitespace(b);
-}
 //#endregion
-export { flattenOverlays, parse, parseBaseline, parseResults };
+export { flattenOverlays, normalizeTimestamps, parse, parseBaseline, parseComparison, parseEvidencePackage, parsePlan, parseResults, parseSystem };
 
 //# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","names":["autoValidate"],"sources":["../typescript/flatten.ts","../typescript/index.ts"],"sourcesContent":["import type { HdfResults, EvaluatedBaseline, EvaluatedRequirement } from '@mitre/hdf-schema';\n\n// ── Public Types ────────────────────────────────────────────\n\nexport interface FlattenResult {\n  results: HdfResults;\n  metadata: FlattenMetadata;\n}\n\nexport interface FlattenMetadata {\n  originalBaselineCount: number;\n  flattenedBaselineCount: number;\n  merges: BaselineMerge[];\n  warnings: string[];\n}\n\nexport interface BaselineMerge {\n  rootBaseline: string;\n  absorbedBaselines: string[];\n  controlsBefore: number;\n  controlsAfter: number;\n  pattern: 'deep' | 'wide' | 'hybrid';\n}\n\n// ── Internal Helpers ───────────────────────────────────────\n\n/** BFS from root, returns names in top-down order. Cycle-safe. */\nfunction collectTree(root: string, childrenMap: Map<string, string[]>): string[] {\n  const order: string[] = [];\n  const seen = new Set<string>();\n  const queue = [root];\n  while (queue.length > 0) {\n    const name = queue.shift()!;\n    if (seen.has(name)) continue;\n    seen.add(name);\n    order.push(name);\n    for (const child of (childrenMap.get(name) || [])) {\n      queue.push(child);\n    }\n  }\n  return order;\n}\n\n/** Classify merge pattern based on tree shape */\nfunction detectPattern(root: string, childrenMap: Map<string, string[]>): 'deep' | 'wide' | 'hybrid' {\n  const rootChildren = childrenMap.get(root) || [];\n  if (rootChildren.length <= 1) {\n    return 'deep';\n  }\n  for (const child of rootChildren) {\n    if ((childrenMap.get(child) || []).length > 0) {\n      return 'hybrid';\n    }\n  }\n  return 'wide';\n}\n\n/** Merge incoming requirement fields onto existing */\nfunction mergeRequirement(\n  existing: EvaluatedRequirement,\n  incoming: EvaluatedRequirement\n): EvaluatedRequirement {\n  const result: EvaluatedRequirement = { ...existing };\n\n  // Impact: incoming always wins (required field, always present)\n  result.impact = incoming.impact;\n\n  // Results: keep whichever is non-empty (base has them, overlay doesn't)\n  if (incoming.results && incoming.results.length > 0) {\n    result.results = incoming.results;\n  }\n\n  // Code: incoming wins if non-empty\n  if (incoming.code && incoming.code.trim() !== '') {\n    result.code = incoming.code;\n  }\n\n  // Tags: shallow merge (incoming keys override)\n  if (incoming.tags) {\n    result.tags = { ...existing.tags, ...incoming.tags };\n  }\n\n  // Severity: incoming wins if present, else keep existing\n  if (incoming.severity !== undefined) {\n    result.severity = incoming.severity;\n  }\n\n  // EffectiveStatus: incoming wins only if it has results (otherwise its\n  // effectiveStatus is a computed artifact from empty results, not intentional).\n  // Overlays typically have empty results — the base has the real test results.\n  if (incoming.effectiveStatus !== undefined && incoming.results && incoming.results.length > 0) {\n    result.effectiveStatus = incoming.effectiveStatus;\n  }\n\n  // Descriptions: merge by label (incoming overrides same label)\n  if (incoming.descriptions && incoming.descriptions.length > 0) {\n    const descMap = new Map(\n      (existing.descriptions || []).map(d => [d.label, d])\n    );\n    for (const d of incoming.descriptions) {\n      descMap.set(d.label, d);\n    }\n    result.descriptions = [...descMap.values()];\n  }\n\n  return result;\n}\n\n/**\n * Resolve parentBaseline for a baseline.\n * InSpec parent_profile can use depends-name aliases (e.g., 'k8s' instead of\n * 'k8s-node-stig-baseline'). When the value isn't a direct profile name,\n * find who depends on this baseline — that's the actual parent.\n */\nfunction resolveParentBaseline(\n  b: EvaluatedBaseline,\n  byName: Map<string, EvaluatedBaseline>,\n  allBaselines: EvaluatedBaseline[]\n): string | undefined {\n  if (!b.parentBaseline) return undefined;\n  if (byName.has(b.parentBaseline)) return b.parentBaseline;\n\n  // Alias resolution: find the profile whose depends array includes this baseline\n  for (const candidate of allBaselines) {\n    if (candidate.depends?.some((d) => d.name === b.name)) {\n      return candidate.name;\n    }\n  }\n  return undefined; // orphan\n}\n\n// ── Public API ──────────────────────────────────────────────\n\n/**\n * Flatten overlay/wrapper baselines in an HDF Results document.\n *\n * Handles:\n * - Deep nesting (overlay chains with shared control IDs via parentBaseline)\n * - Wide nesting (wrapper profiles aggregating independent bases)\n * - Hybrid (both patterns in one document)\n *\n * @param results - Parsed HDF Results (from parseResults() or equivalent)\n * @returns FlattenResult with flattened data and merge metadata\n */\nexport function flattenOverlays(results: HdfResults): FlattenResult {\n  const { baselines } = results;\n  const warnings: string[] = [];\n  const merges: BaselineMerge[] = [];\n\n  if (!baselines || baselines.length === 0) {\n    return {\n      results: { ...results, baselines: [] },\n      metadata: {\n        originalBaselineCount: 0,\n        flattenedBaselineCount: 0,\n        merges: [],\n        warnings: [],\n      },\n    };\n  }\n\n  // Index baselines by name\n  const byName = new Map<string, EvaluatedBaseline>();\n  for (const b of baselines) {\n    if (byName.has(b.name)) {\n      warnings.push(`Duplicate baseline name \"${b.name}\" — later entry overwrites earlier`);\n    }\n    byName.set(b.name, b);\n  }\n\n  // Resolve parentBaseline aliases and build parent map\n  const resolvedParent = new Map<string, string | undefined>();\n  for (const b of baselines) {\n    const parent = resolveParentBaseline(b, byName, baselines);\n    resolvedParent.set(b.name, parent);\n    if (b.parentBaseline && !parent) {\n      warnings.push(\n        `Baseline \"${b.name}\" references nonexistent parent \"${b.parentBaseline}\"`\n      );\n    }\n  }\n\n  // Build parent → children adjacency using resolved parents\n  const childrenMap = new Map<string, string[]>();\n  for (const b of baselines) {\n    const parent = resolvedParent.get(b.name);\n    if (parent) {\n      const list = childrenMap.get(parent) || [];\n      list.push(b.name);\n      childrenMap.set(parent, list);\n    }\n  }\n\n  // Find roots: no resolved parent\n  const roots: string[] = [];\n  const visited = new Set<string>();\n\n  for (const b of baselines) {\n    if (!resolvedParent.get(b.name)) {\n      roots.push(b.name);\n    }\n  }\n\n  // Mark reachable from roots (iterative DFS to avoid stack overflow on deep trees)\n  function markReachable(start: string): void {\n    const stack = [start];\n    while (stack.length > 0) {\n      const name = stack.pop()!;\n      if (visited.has(name)) continue;\n      visited.add(name);\n      const children = childrenMap.get(name);\n      if (children) {\n        for (const child of children) {\n          stack.push(child);\n        }\n      }\n    }\n  }\n  for (const r of roots) {\n    markReachable(r);\n  }\n\n  // Detect cycles: unvisited baselines are in cycles\n  for (const b of baselines) {\n    if (!visited.has(b.name)) {\n      warnings.push(`Circular parentBaseline detected involving \"${b.name}\"`);\n      roots.push(b.name);\n      markReachable(b.name);\n    }\n  }\n\n  // Process each root tree\n  const flatBaselines: EvaluatedBaseline[] = [];\n\n  for (const rootName of roots) {\n    const root = byName.get(rootName)!;\n    const treeNames = collectTree(rootName, childrenMap);\n\n    if (treeNames.length === 1) {\n      // Standalone baseline — pass through unchanged (preserve depends)\n      flatBaselines.push(root);\n      continue;\n    }\n\n    // Bottom-up order: reverse top-down BFS\n    const bottomUp = [...treeNames].reverse();\n\n    // Merge requirements across the tree\n    const merged = new Map<string, EvaluatedRequirement>();\n    let controlsBefore = 0;\n    const absorbed: string[] = [];\n\n    for (const name of bottomUp) {\n      const b = byName.get(name)!;\n      controlsBefore += b.requirements.length;\n      if (name !== rootName) {\n        absorbed.push(name);\n      }\n      for (const req of b.requirements) {\n        if (merged.has(req.id)) {\n          merged.set(req.id, mergeRequirement(merged.get(req.id)!, req));\n        } else {\n          merged.set(req.id, { ...req });\n        }\n      }\n    }\n\n    const mergedReqs = [...merged.values()];\n    const pattern = detectPattern(rootName, childrenMap);\n\n    merges.push({\n      rootBaseline: rootName,\n      absorbedBaselines: absorbed,\n      controlsBefore,\n      controlsAfter: mergedReqs.length,\n      pattern,\n    });\n\n    const out: EvaluatedBaseline = {\n      ...root,\n      requirements: mergedReqs,\n    };\n    delete out.parentBaseline;\n    delete out.depends;\n    flatBaselines.push(out);\n  }\n\n  return {\n    results: { ...results, baselines: flatBaselines },\n    metadata: {\n      originalBaselineCount: baselines.length,\n      flattenedBaselineCount: flatBaselines.length,\n      merges,\n      warnings,\n    },\n  };\n}\n","import type { HdfResults, HdfBaseline } from '@mitre/hdf-schema';\nexport { flattenOverlays } from './flatten.js';\nexport type { FlattenResult, FlattenMetadata, BaselineMerge } from './flatten.js';\nimport { validateResults, validateBaseline, validate as autoValidate } from '@mitre/hdf-validators';\n\n/**\n * Result of parsing operation\n */\nexport interface ParseResult<T> {\n  success: boolean;\n  data?: T;\n  error?: string;\n  type?: 'results' | 'baseline';\n}\n\n/**\n * Parse HDF Results document from string or bytes\n * @param input - JSON string or Uint8Array to parse\n * @returns ParseResult with parsed data or error\n */\nexport function parseResults(input: string | Uint8Array): ParseResult<HdfResults> {\n  // Convert Uint8Array to string if needed\n  const jsonStr = typeof input === 'string' ? input : new TextDecoder().decode(input);\n\n  // Check for empty input\n  if (jsonStr.trim().length === 0) {\n    return {\n      success: false,\n      error: 'Input is empty'\n    };\n  }\n\n  // Parse JSON\n  let data: unknown;\n  try {\n    data = JSON.parse(jsonStr);\n  } catch (err) {\n    return {\n      success: false,\n      error: `Invalid JSON: ${err instanceof Error ? err.message : String(err)}`\n    };\n  }\n\n  // Check for trailing garbage by re-serializing and comparing length\n  // This catches cases like: {\"valid\":\"json\"}garbage\n  const serialized = JSON.stringify(data);\n  const trimmedInput = jsonStr.trim();\n  if (serialized.length !== trimmedInput.length && !isWhitespaceEquivalent(serialized, trimmedInput)) {\n    return {\n      success: false,\n      error: 'Invalid JSON: unexpected trailing data after end of object'\n    };\n  }\n\n  // Validate against schema\n  const validationResult = validateResults(data);\n  if (!validationResult.valid) {\n    return {\n      success: false,\n      error: `Schema validation failed: ${validationResult.getErrorMessage()}`\n    };\n  }\n\n  return {\n    success: true,\n    data: data as HdfResults\n  };\n}\n\n/**\n * Parse HDF Baseline document from string or bytes\n * @param input - JSON string or Uint8Array to parse\n * @returns ParseResult with parsed data or error\n */\nexport function parseBaseline(input: string | Uint8Array): ParseResult<HdfBaseline> {\n  // Convert Uint8Array to string if needed\n  const jsonStr = typeof input === 'string' ? input : new TextDecoder().decode(input);\n\n  // Check for empty input\n  if (jsonStr.trim().length === 0) {\n    return {\n      success: false,\n      error: 'Input is empty'\n    };\n  }\n\n  // Parse JSON\n  let data: unknown;\n  try {\n    data = JSON.parse(jsonStr);\n  } catch (err) {\n    return {\n      success: false,\n      error: `Invalid JSON: ${err instanceof Error ? err.message : String(err)}`\n    };\n  }\n\n  // Check for trailing garbage\n  const serialized = JSON.stringify(data);\n  const trimmedInput = jsonStr.trim();\n  if (serialized.length !== trimmedInput.length && !isWhitespaceEquivalent(serialized, trimmedInput)) {\n    return {\n      success: false,\n      error: 'Invalid JSON: unexpected trailing data after end of object'\n    };\n  }\n\n  // Validate against schema\n  const validationResult = validateBaseline(data);\n  if (!validationResult.valid) {\n    return {\n      success: false,\n      error: `Schema validation failed: ${validationResult.getErrorMessage()}`\n    };\n  }\n\n  return {\n    success: true,\n    data: data as HdfBaseline\n  };\n}\n\n/**\n * Parse HDF document with auto-detection of type\n * @param input - JSON string or Uint8Array to parse\n * @returns ParseResult with parsed data, type indicator, or error\n */\nexport function parse(input: string | Uint8Array): ParseResult<HdfResults | HdfBaseline> {\n  // Convert Uint8Array to string if needed\n  const jsonStr = typeof input === 'string' ? input : new TextDecoder().decode(input);\n\n  // Check for empty input\n  if (jsonStr.trim().length === 0) {\n    return {\n      success: false,\n      error: 'Input is empty'\n    };\n  }\n\n  // Parse JSON\n  let data: unknown;\n  try {\n    data = JSON.parse(jsonStr);\n  } catch (err) {\n    return {\n      success: false,\n      error: `Invalid JSON: ${err instanceof Error ? err.message : String(err)}`\n    };\n  }\n\n  // Check for trailing garbage\n  const serialized = JSON.stringify(data);\n  const trimmedInput = jsonStr.trim();\n  if (serialized.length !== trimmedInput.length && !isWhitespaceEquivalent(serialized, trimmedInput)) {\n    return {\n      success: false,\n      error: 'Invalid JSON: unexpected trailing data after end of object'\n    };\n  }\n\n  // Auto-validate and detect type\n  const validationResult = autoValidate(data);\n  if (!validationResult.valid) {\n    return {\n      success: false,\n      error: `Schema validation failed: ${validationResult.getErrorMessage()}`\n    };\n  }\n\n  // Determine type based on structure\n  if (typeof data === 'object' && data !== null) {\n    const obj = data as Record<string, unknown>;\n\n    // HDF Results has 'baselines' array at root\n    if ('baselines' in obj) {\n      return {\n        success: true,\n        data: data as HdfResults,\n        type: 'results'\n      };\n    }\n\n    // HDF Baseline has 'name' and 'requirements' at root\n    if ('name' in obj && 'requirements' in obj) {\n      return {\n        success: true,\n        data: data as HdfBaseline,\n        type: 'baseline'\n      };\n    }\n  }\n\n  return {\n    success: false,\n    error: 'Unable to determine HDF document type'\n  };\n}\n\n/**\n * Check if two JSON strings are equivalent modulo whitespace\n * This is a simple heuristic - we check if one is just whitespace-padded version of other\n */\nfunction isWhitespaceEquivalent(a: string, b: string): boolean {\n  // Remove all whitespace and compare\n  const normalizeWhitespace = (s: string): string => s.replace(/\\s+/g, '');\n  return normalizeWhitespace(a) === normalizeWhitespace(b);\n}\n"],"mappings":";;;AA2BA,SAAS,YAAY,MAAc,aAA8C;CAC/E,MAAM,QAAkB,EAAE;CAC1B,MAAM,uBAAO,IAAI,KAAa;CAC9B,MAAM,QAAQ,CAAC,KAAK;AACpB,QAAO,MAAM,SAAS,GAAG;EACvB,MAAM,OAAO,MAAM,OAAO;AAC1B,MAAI,KAAK,IAAI,KAAK,CAAE;AACpB,OAAK,IAAI,KAAK;AACd,QAAM,KAAK,KAAK;AAChB,OAAK,MAAM,SAAU,YAAY,IAAI,KAAK,IAAI,EAAE,CAC9C,OAAM,KAAK,MAAM;;AAGrB,QAAO;;;AAIT,SAAS,cAAc,MAAc,aAAgE;CACnG,MAAM,eAAe,YAAY,IAAI,KAAK,IAAI,EAAE;AAChD,KAAI,aAAa,UAAU,EACzB,QAAO;AAET,MAAK,MAAM,SAAS,aAClB,MAAK,YAAY,IAAI,MAAM,IAAI,EAAE,EAAE,SAAS,EAC1C,QAAO;AAGX,QAAO;;;AAIT,SAAS,iBACP,UACA,UACsB;CACtB,MAAM,SAA+B,EAAE,GAAG,UAAU;AAGpD,QAAO,SAAS,SAAS;AAGzB,KAAI,SAAS,WAAW,SAAS,QAAQ,SAAS,EAChD,QAAO,UAAU,SAAS;AAI5B,KAAI,SAAS,QAAQ,SAAS,KAAK,MAAM,KAAK,GAC5C,QAAO,OAAO,SAAS;AAIzB,KAAI,SAAS,KACX,QAAO,OAAO;EAAE,GAAG,SAAS;EAAM,GAAG,SAAS;EAAM;AAItD,KAAI,SAAS,aAAa,KAAA,EACxB,QAAO,WAAW,SAAS;AAM7B,KAAI,SAAS,oBAAoB,KAAA,KAAa,SAAS,WAAW,SAAS,QAAQ,SAAS,EAC1F,QAAO,kBAAkB,SAAS;AAIpC,KAAI,SAAS,gBAAgB,SAAS,aAAa,SAAS,GAAG;EAC7D,MAAM,UAAU,IAAI,KACjB,SAAS,gBAAgB,EAAE,EAAE,KAAI,MAAK,CAAC,EAAE,OAAO,EAAE,CAAC,CACrD;AACD,OAAK,MAAM,KAAK,SAAS,aACvB,SAAQ,IAAI,EAAE,OAAO,EAAE;AAEzB,SAAO,eAAe,CAAC,GAAG,QAAQ,QAAQ,CAAC;;AAG7C,QAAO;;;;;;;;AAST,SAAS,sBACP,GACA,QACA,cACoB;AACpB,KAAI,CAAC,EAAE,eAAgB,QAAO,KAAA;AAC9B,KAAI,OAAO,IAAI,EAAE,eAAe,CAAE,QAAO,EAAE;AAG3C,MAAK,MAAM,aAAa,aACtB,KAAI,UAAU,SAAS,MAAM,MAAM,EAAE,SAAS,EAAE,KAAK,CACnD,QAAO,UAAU;;;;;;;;;;;;;AAmBvB,SAAgB,gBAAgB,SAAoC;CAClE,MAAM,EAAE,cAAc;CACtB,MAAM,WAAqB,EAAE;CAC7B,MAAM,SAA0B,EAAE;AAElC,KAAI,CAAC,aAAa,UAAU,WAAW,EACrC,QAAO;EACL,SAAS;GAAE,GAAG;GAAS,WAAW,EAAE;GAAE;EACtC,UAAU;GACR,uBAAuB;GACvB,wBAAwB;GACxB,QAAQ,EAAE;GACV,UAAU,EAAE;GACb;EACF;CAIH,MAAM,yBAAS,IAAI,KAAgC;AACnD,MAAK,MAAM,KAAK,WAAW;AACzB,MAAI,OAAO,IAAI,EAAE,KAAK,CACpB,UAAS,KAAK,4BAA4B,EAAE,KAAK,oCAAoC;AAEvF,SAAO,IAAI,EAAE,MAAM,EAAE;;CAIvB,MAAM,iCAAiB,IAAI,KAAiC;AAC5D,MAAK,MAAM,KAAK,WAAW;EACzB,MAAM,SAAS,sBAAsB,GAAG,QAAQ,UAAU;AAC1D,iBAAe,IAAI,EAAE,MAAM,OAAO;AAClC,MAAI,EAAE,kBAAkB,CAAC,OACvB,UAAS,KACP,aAAa,EAAE,KAAK,mCAAmC,EAAE,eAAe,GACzE;;CAKL,MAAM,8BAAc,IAAI,KAAuB;AAC/C,MAAK,MAAM,KAAK,WAAW;EACzB,MAAM,SAAS,eAAe,IAAI,EAAE,KAAK;AACzC,MAAI,QAAQ;GACV,MAAM,OAAO,YAAY,IAAI,OAAO,IAAI,EAAE;AAC1C,QAAK,KAAK,EAAE,KAAK;AACjB,eAAY,IAAI,QAAQ,KAAK;;;CAKjC,MAAM,QAAkB,EAAE;CAC1B,MAAM,0BAAU,IAAI,KAAa;AAEjC,MAAK,MAAM,KAAK,UACd,KAAI,CAAC,eAAe,IAAI,EAAE,KAAK,CAC7B,OAAM,KAAK,EAAE,KAAK;CAKtB,SAAS,cAAc,OAAqB;EAC1C,MAAM,QAAQ,CAAC,MAAM;AACrB,SAAO,MAAM,SAAS,GAAG;GACvB,MAAM,OAAO,MAAM,KAAK;AACxB,OAAI,QAAQ,IAAI,KAAK,CAAE;AACvB,WAAQ,IAAI,KAAK;GACjB,MAAM,WAAW,YAAY,IAAI,KAAK;AACtC,OAAI,SACF,MAAK,MAAM,SAAS,SAClB,OAAM,KAAK,MAAM;;;AAKzB,MAAK,MAAM,KAAK,MACd,eAAc,EAAE;AAIlB,MAAK,MAAM,KAAK,UACd,KAAI,CAAC,QAAQ,IAAI,EAAE,KAAK,EAAE;AACxB,WAAS,KAAK,+CAA+C,EAAE,KAAK,GAAG;AACvE,QAAM,KAAK,EAAE,KAAK;AAClB,gBAAc,EAAE,KAAK;;CAKzB,MAAM,gBAAqC,EAAE;AAE7C,MAAK,MAAM,YAAY,OAAO;EAC5B,MAAM,OAAO,OAAO,IAAI,SAAS;EACjC,MAAM,YAAY,YAAY,UAAU,YAAY;AAEpD,MAAI,UAAU,WAAW,GAAG;AAE1B,iBAAc,KAAK,KAAK;AACxB;;EAIF,MAAM,WAAW,CAAC,GAAG,UAAU,CAAC,SAAS;EAGzC,MAAM,yBAAS,IAAI,KAAmC;EACtD,IAAI,iBAAiB;EACrB,MAAM,WAAqB,EAAE;AAE7B,OAAK,MAAM,QAAQ,UAAU;GAC3B,MAAM,IAAI,OAAO,IAAI,KAAK;AAC1B,qBAAkB,EAAE,aAAa;AACjC,OAAI,SAAS,SACX,UAAS,KAAK,KAAK;AAErB,QAAK,MAAM,OAAO,EAAE,aAClB,KAAI,OAAO,IAAI,IAAI,GAAG,CACpB,QAAO,IAAI,IAAI,IAAI,iBAAiB,OAAO,IAAI,IAAI,GAAG,EAAG,IAAI,CAAC;OAE9D,QAAO,IAAI,IAAI,IAAI,EAAE,GAAG,KAAK,CAAC;;EAKpC,MAAM,aAAa,CAAC,GAAG,OAAO,QAAQ,CAAC;EACvC,MAAM,UAAU,cAAc,UAAU,YAAY;AAEpD,SAAO,KAAK;GACV,cAAc;GACd,mBAAmB;GACnB;GACA,eAAe,WAAW;GAC1B;GACD,CAAC;EAEF,MAAM,MAAyB;GAC7B,GAAG;GACH,cAAc;GACf;AACD,SAAO,IAAI;AACX,SAAO,IAAI;AACX,gBAAc,KAAK,IAAI;;AAGzB,QAAO;EACL,SAAS;GAAE,GAAG;GAAS,WAAW;GAAe;EACjD,UAAU;GACR,uBAAuB,UAAU;GACjC,wBAAwB,cAAc;GACtC;GACA;GACD;EACF;;;;;;;;;ACnRH,SAAgB,aAAa,OAAqD;CAEhF,MAAM,UAAU,OAAO,UAAU,WAAW,QAAQ,IAAI,aAAa,CAAC,OAAO,MAAM;AAGnF,KAAI,QAAQ,MAAM,CAAC,WAAW,EAC5B,QAAO;EACL,SAAS;EACT,OAAO;EACR;CAIH,IAAI;AACJ,KAAI;AACF,SAAO,KAAK,MAAM,QAAQ;UACnB,KAAK;AACZ,SAAO;GACL,SAAS;GACT,OAAO,iBAAiB,eAAe,QAAQ,IAAI,UAAU,OAAO,IAAI;GACzE;;CAKH,MAAM,aAAa,KAAK,UAAU,KAAK;CACvC,MAAM,eAAe,QAAQ,MAAM;AACnC,KAAI,WAAW,WAAW,aAAa,UAAU,CAAC,uBAAuB,YAAY,aAAa,CAChG,QAAO;EACL,SAAS;EACT,OAAO;EACR;CAIH,MAAM,mBAAmB,gBAAgB,KAAK;AAC9C,KAAI,CAAC,iBAAiB,MACpB,QAAO;EACL,SAAS;EACT,OAAO,6BAA6B,iBAAiB,iBAAiB;EACvE;AAGH,QAAO;EACL,SAAS;EACH;EACP;;;;;;;AAQH,SAAgB,cAAc,OAAsD;CAElF,MAAM,UAAU,OAAO,UAAU,WAAW,QAAQ,IAAI,aAAa,CAAC,OAAO,MAAM;AAGnF,KAAI,QAAQ,MAAM,CAAC,WAAW,EAC5B,QAAO;EACL,SAAS;EACT,OAAO;EACR;CAIH,IAAI;AACJ,KAAI;AACF,SAAO,KAAK,MAAM,QAAQ;UACnB,KAAK;AACZ,SAAO;GACL,SAAS;GACT,OAAO,iBAAiB,eAAe,QAAQ,IAAI,UAAU,OAAO,IAAI;GACzE;;CAIH,MAAM,aAAa,KAAK,UAAU,KAAK;CACvC,MAAM,eAAe,QAAQ,MAAM;AACnC,KAAI,WAAW,WAAW,aAAa,UAAU,CAAC,uBAAuB,YAAY,aAAa,CAChG,QAAO;EACL,SAAS;EACT,OAAO;EACR;CAIH,MAAM,mBAAmB,iBAAiB,KAAK;AAC/C,KAAI,CAAC,iBAAiB,MACpB,QAAO;EACL,SAAS;EACT,OAAO,6BAA6B,iBAAiB,iBAAiB;EACvE;AAGH,QAAO;EACL,SAAS;EACH;EACP;;;;;;;AAQH,SAAgB,MAAM,OAAmE;CAEvF,MAAM,UAAU,OAAO,UAAU,WAAW,QAAQ,IAAI,aAAa,CAAC,OAAO,MAAM;AAGnF,KAAI,QAAQ,MAAM,CAAC,WAAW,EAC5B,QAAO;EACL,SAAS;EACT,OAAO;EACR;CAIH,IAAI;AACJ,KAAI;AACF,SAAO,KAAK,MAAM,QAAQ;UACnB,KAAK;AACZ,SAAO;GACL,SAAS;GACT,OAAO,iBAAiB,eAAe,QAAQ,IAAI,UAAU,OAAO,IAAI;GACzE;;CAIH,MAAM,aAAa,KAAK,UAAU,KAAK;CACvC,MAAM,eAAe,QAAQ,MAAM;AACnC,KAAI,WAAW,WAAW,aAAa,UAAU,CAAC,uBAAuB,YAAY,aAAa,CAChG,QAAO;EACL,SAAS;EACT,OAAO;EACR;CAIH,MAAM,mBAAmBA,SAAa,KAAK;AAC3C,KAAI,CAAC,iBAAiB,MACpB,QAAO;EACL,SAAS;EACT,OAAO,6BAA6B,iBAAiB,iBAAiB;EACvE;AAIH,KAAI,OAAO,SAAS,YAAY,SAAS,MAAM;EAC7C,MAAM,MAAM;AAGZ,MAAI,eAAe,IACjB,QAAO;GACL,SAAS;GACH;GACN,MAAM;GACP;AAIH,MAAI,UAAU,OAAO,kBAAkB,IACrC,QAAO;GACL,SAAS;GACH;GACN,MAAM;GACP;;AAIL,QAAO;EACL,SAAS;EACT,OAAO;EACR;;;;;;AAOH,SAAS,uBAAuB,GAAW,GAAoB;CAE7D,MAAM,uBAAuB,MAAsB,EAAE,QAAQ,QAAQ,GAAG;AACxE,QAAO,oBAAoB,EAAE,KAAK,oBAAoB,EAAE"}
+{"version":3,"file":"index.js","names":["autoValidate"],"sources":["../typescript/flatten.ts","../typescript/index.ts"],"sourcesContent":["import type { HDFResults, EvaluatedBaseline, EvaluatedRequirement } from '@mitre/hdf-schema';\n\n// ── Public Types ────────────────────────────────────────────\n\nexport interface FlattenResult {\n  results: HDFResults;\n  metadata: FlattenMetadata;\n}\n\nexport interface FlattenMetadata {\n  originalBaselineCount: number;\n  flattenedBaselineCount: number;\n  merges: BaselineMerge[];\n  warnings: string[];\n}\n\nexport interface BaselineMerge {\n  rootBaseline: string;\n  absorbedBaselines: string[];\n  controlsBefore: number;\n  controlsAfter: number;\n  pattern: 'deep' | 'wide' | 'hybrid';\n}\n\n// ── Internal Helpers ───────────────────────────────────────\n\n/** BFS from root, returns names in top-down order. Cycle-safe. */\nfunction collectTree(root: string, childrenMap: Map<string, string[]>): string[] {\n  const order: string[] = [];\n  const seen = new Set<string>();\n  const queue = [root];\n  while (queue.length > 0) {\n    const name = queue.shift()!;\n    if (seen.has(name)) continue;\n    seen.add(name);\n    order.push(name);\n    for (const child of (childrenMap.get(name) || [])) {\n      queue.push(child);\n    }\n  }\n  return order;\n}\n\n/** Classify merge pattern based on tree shape */\nfunction detectPattern(root: string, childrenMap: Map<string, string[]>): 'deep' | 'wide' | 'hybrid' {\n  const rootChildren = childrenMap.get(root) || [];\n  if (rootChildren.length <= 1) {\n    return 'deep';\n  }\n  for (const child of rootChildren) {\n    if ((childrenMap.get(child) || []).length > 0) {\n      return 'hybrid';\n    }\n  }\n  return 'wide';\n}\n\n/** Merge incoming requirement fields onto existing */\nfunction mergeRequirement(\n  existing: EvaluatedRequirement,\n  incoming: EvaluatedRequirement\n): EvaluatedRequirement {\n  const result: EvaluatedRequirement = { ...existing };\n\n  // Impact: incoming always wins (required field, always present)\n  result.impact = incoming.impact;\n\n  // Results: keep whichever is non-empty (base has them, overlay doesn't)\n  if (incoming.results && incoming.results.length > 0) {\n    result.results = incoming.results;\n  }\n\n  // Code: incoming wins if non-empty\n  if (incoming.code && incoming.code.trim() !== '') {\n    result.code = incoming.code;\n  }\n\n  // Tags: shallow merge (incoming keys override)\n  if (incoming.tags) {\n    result.tags = { ...existing.tags, ...incoming.tags };\n  }\n\n  // Severity: incoming wins if present, else keep existing\n  if (incoming.severity !== undefined) {\n    result.severity = incoming.severity;\n  }\n\n  // EffectiveStatus: incoming wins only if it has results (otherwise its\n  // effectiveStatus is a computed artifact from empty results, not intentional).\n  // Overlays typically have empty results — the base has the real test results.\n  if (incoming.effectiveStatus !== undefined && incoming.results && incoming.results.length > 0) {\n    result.effectiveStatus = incoming.effectiveStatus;\n  }\n\n  // Descriptions: merge by label (incoming overrides same label)\n  if (incoming.descriptions && incoming.descriptions.length > 0) {\n    const descMap = new Map(\n      (existing.descriptions || []).map(d => [d.label, d])\n    );\n    for (const d of incoming.descriptions) {\n      descMap.set(d.label, d);\n    }\n    result.descriptions = [...descMap.values()];\n  }\n\n  return result;\n}\n\n/**\n * Resolve parentBaseline for a baseline.\n * InSpec parent_profile can use depends-name aliases (e.g., 'k8s' instead of\n * 'k8s-node-stig-baseline'). When the value isn't a direct profile name,\n * find who depends on this baseline — that's the actual parent.\n */\nfunction resolveParentBaseline(\n  b: EvaluatedBaseline,\n  byName: Map<string, EvaluatedBaseline>,\n  allBaselines: EvaluatedBaseline[]\n): string | undefined {\n  if (!b.parentBaseline) return undefined;\n  if (byName.has(b.parentBaseline)) return b.parentBaseline;\n\n  // Alias resolution: find the profile whose depends array includes this baseline\n  for (const candidate of allBaselines) {\n    if (candidate.depends?.some((d) => d.name === b.name)) {\n      return candidate.name;\n    }\n  }\n  return undefined; // orphan\n}\n\n// ── Public API ──────────────────────────────────────────────\n\n/**\n * Flatten overlay/wrapper baselines in an HDF Results document.\n *\n * Handles:\n * - Deep nesting (overlay chains with shared control IDs via parentBaseline)\n * - Wide nesting (wrapper profiles aggregating independent bases)\n * - Hybrid (both patterns in one document)\n *\n * @param results - Parsed HDF Results (from parseResults() or equivalent)\n * @returns FlattenResult with flattened data and merge metadata\n */\nexport function flattenOverlays(results: HDFResults): FlattenResult {\n  const { baselines } = results;\n  const warnings: string[] = [];\n  const merges: BaselineMerge[] = [];\n\n  if (!baselines || baselines.length === 0) {\n    return {\n      results: { ...results, baselines: [] },\n      metadata: {\n        originalBaselineCount: 0,\n        flattenedBaselineCount: 0,\n        merges: [],\n        warnings: [],\n      },\n    };\n  }\n\n  // Index baselines by name\n  const byName = new Map<string, EvaluatedBaseline>();\n  for (const b of baselines) {\n    if (byName.has(b.name)) {\n      warnings.push(`Duplicate baseline name \"${b.name}\" — later entry overwrites earlier`);\n    }\n    byName.set(b.name, b);\n  }\n\n  // Resolve parentBaseline aliases and build parent map\n  const resolvedParent = new Map<string, string | undefined>();\n  for (const b of baselines) {\n    const parent = resolveParentBaseline(b, byName, baselines);\n    resolvedParent.set(b.name, parent);\n    if (b.parentBaseline && !parent) {\n      warnings.push(\n        `Baseline \"${b.name}\" references nonexistent parent \"${b.parentBaseline}\"`\n      );\n    }\n  }\n\n  // Build parent → children adjacency using resolved parents\n  const childrenMap = new Map<string, string[]>();\n  for (const b of baselines) {\n    const parent = resolvedParent.get(b.name);\n    if (parent) {\n      const list = childrenMap.get(parent) || [];\n      list.push(b.name);\n      childrenMap.set(parent, list);\n    }\n  }\n\n  // Find roots: no resolved parent\n  const roots: string[] = [];\n  const visited = new Set<string>();\n\n  for (const b of baselines) {\n    if (!resolvedParent.get(b.name)) {\n      roots.push(b.name);\n    }\n  }\n\n  // Mark reachable from roots (iterative DFS to avoid stack overflow on deep trees)\n  function markReachable(start: string): void {\n    const stack = [start];\n    while (stack.length > 0) {\n      const name = stack.pop()!;\n      if (visited.has(name)) continue;\n      visited.add(name);\n      const children = childrenMap.get(name);\n      if (children) {\n        for (const child of children) {\n          stack.push(child);\n        }\n      }\n    }\n  }\n  for (const r of roots) {\n    markReachable(r);\n  }\n\n  // Detect cycles: unvisited baselines are in cycles\n  for (const b of baselines) {\n    if (!visited.has(b.name)) {\n      warnings.push(`Circular parentBaseline detected involving \"${b.name}\"`);\n      roots.push(b.name);\n      markReachable(b.name);\n    }\n  }\n\n  // Process each root tree\n  const flatBaselines: EvaluatedBaseline[] = [];\n\n  for (const rootName of roots) {\n    const root = byName.get(rootName)!;\n    const treeNames = collectTree(rootName, childrenMap);\n\n    if (treeNames.length === 1) {\n      // Standalone baseline — pass through unchanged (preserve depends)\n      flatBaselines.push(root);\n      continue;\n    }\n\n    // Bottom-up order: reverse top-down BFS\n    const bottomUp = [...treeNames].reverse();\n\n    // Merge requirements across the tree\n    const merged = new Map<string, EvaluatedRequirement>();\n    let controlsBefore = 0;\n    const absorbed: string[] = [];\n\n    for (const name of bottomUp) {\n      const b = byName.get(name)!;\n      controlsBefore += b.requirements.length;\n      if (name !== rootName) {\n        absorbed.push(name);\n      }\n      for (const req of b.requirements) {\n        if (merged.has(req.id)) {\n          merged.set(req.id, mergeRequirement(merged.get(req.id)!, req));\n        } else {\n          merged.set(req.id, { ...req });\n        }\n      }\n    }\n\n    const mergedReqs = [...merged.values()];\n    const pattern = detectPattern(rootName, childrenMap);\n\n    merges.push({\n      rootBaseline: rootName,\n      absorbedBaselines: absorbed,\n      controlsBefore,\n      controlsAfter: mergedReqs.length,\n      pattern,\n    });\n\n    const out: EvaluatedBaseline = {\n      ...root,\n      requirements: mergedReqs,\n    };\n    delete out.parentBaseline;\n    delete out.depends;\n    flatBaselines.push(out);\n  }\n\n  return {\n    results: { ...results, baselines: flatBaselines },\n    metadata: {\n      originalBaselineCount: baselines.length,\n      flattenedBaselineCount: flatBaselines.length,\n      merges,\n      warnings,\n    },\n  };\n}\n","import type {\n  HDFResults,\n  HDFBaseline,\n  HDFSystem,\n  HDFPlan,\n  HDFEvidencePackage,\n  HDFComparison,\n} from '@mitre/hdf-schema';\nexport { flattenOverlays } from './flatten.js';\nexport type { FlattenResult, FlattenMetadata, BaselineMerge } from './flatten.js';\nimport {\n  validateResults,\n  validateBaseline,\n  validateSystem,\n  validatePlan,\n  validateEvidencePackage,\n  validateComparison,\n  validate as autoValidate,\n} from '@mitre/hdf-validators';\n\n// JSON-quoted ISO 8601 timestamp with no trailing timezone — InSpec emits\n// these (e.g. \"2026-03-25T22:56:27.736808\"). ajv-formats requires RFC 3339\n// for `date-time` and rejects them.\nconst NO_TZ_TIMESTAMP_REGEX = /\"(\\d{4}-\\d{2}-\\d{2}T\\d{2}:\\d{2}:\\d{2}(?:\\.\\d+)?)\"/g;\n\n/**\n * Append Z (treat as UTC) to bare ISO timestamps in a JSON string so they\n * pass schema validation. Exported so other workspace packages can use the\n * same regex instead of re-implementing it. Matches the Go side at\n * hdf-parsers/go/parsers.go.\n */\nexport function normalizeTimestamps(input: string): string {\n  return input.replace(NO_TZ_TIMESTAMP_REGEX, '\"$1Z\"');\n}\n\n/**\n * Result of parsing operation\n */\nexport interface ParseResult<T> {\n  success: boolean;\n  data?: T;\n  error?: string;\n  type?: 'results' | 'baseline' | 'system' | 'plan' | 'evidencePackage' | 'comparison';\n}\n\n/**\n * Parse HDF Results document from string or bytes\n * @param input - JSON string or Uint8Array to parse\n * @returns ParseResult with parsed data or error\n */\nexport function parseResults(input: string | Uint8Array): ParseResult<HDFResults> {\n  // Convert Uint8Array to string if needed\n  const decoded = typeof input === 'string' ? input : new TextDecoder().decode(input);\n  const jsonStr = normalizeTimestamps(decoded);\n\n  // Check for empty input\n  if (jsonStr.trim().length === 0) {\n    return {\n      success: false,\n      error: 'Input is empty'\n    };\n  }\n\n  // Parse JSON\n  let data: unknown;\n  try {\n    data = JSON.parse(jsonStr);\n  } catch (err) {\n    return {\n      success: false,\n      error: `Invalid JSON: ${err instanceof Error ? err.message : String(err)}`\n    };\n  }\n\n  // JSON.parse already rejects trailing garbage (it throws on the first\n  // non-whitespace byte after the root value), so the catch above covers\n  // that case. A prior length-compare heuristic here false-positived on\n  // complex real-world inputs (e.g. `0.70` parsed as `0.7` would re-\n  // serialize to a different length) — caught by the cross-language\n  // parser parity test in typescript/parse-equivalence.test.ts.\n\n  // Validate against schema\n  const validationResult = validateResults(data);\n  if (!validationResult.valid) {\n    return {\n      success: false,\n      error: `Schema validation failed: ${validationResult.getErrorMessage()}`\n    };\n  }\n\n  return {\n    success: true,\n    data: data as HDFResults\n  };\n}\n\n/**\n * Parse HDF Baseline document from string or bytes\n * @param input - JSON string or Uint8Array to parse\n * @returns ParseResult with parsed data or error\n */\nexport function parseBaseline(input: string | Uint8Array): ParseResult<HDFBaseline> {\n  // Convert Uint8Array to string if needed\n  const decoded = typeof input === 'string' ? input : new TextDecoder().decode(input);\n  const jsonStr = normalizeTimestamps(decoded);\n\n  // Check for empty input\n  if (jsonStr.trim().length === 0) {\n    return {\n      success: false,\n      error: 'Input is empty'\n    };\n  }\n\n  // Parse JSON\n  let data: unknown;\n  try {\n    data = JSON.parse(jsonStr);\n  } catch (err) {\n    return {\n      success: false,\n      error: `Invalid JSON: ${err instanceof Error ? err.message : String(err)}`\n    };\n  }\n\n  // Trailing garbage already caught by the JSON.parse catch above; see\n  // parseResults for the full rationale.\n\n  // Validate against schema\n  const validationResult = validateBaseline(data);\n  if (!validationResult.valid) {\n    return {\n      success: false,\n      error: `Schema validation failed: ${validationResult.getErrorMessage()}`\n    };\n  }\n\n  return {\n    success: true,\n    data: data as HDFBaseline\n  };\n}\n\n/**\n * Parse HDF System document from string or bytes\n */\nexport function parseSystem(input: string | Uint8Array): ParseResult<HDFSystem> {\n  const decoded = typeof input === 'string' ? input : new TextDecoder().decode(input);\n  const jsonStr = normalizeTimestamps(decoded);\n  if (jsonStr.trim().length === 0) {\n    return { success: false, error: 'Input is empty' };\n  }\n  let data: unknown;\n  try {\n    data = JSON.parse(jsonStr);\n  } catch (err) {\n    return { success: false, error: `Invalid JSON: ${err instanceof Error ? err.message : String(err)}` };\n  }\n  const validationResult = validateSystem(data);\n  if (!validationResult.valid) {\n    return { success: false, error: `Schema validation failed: ${validationResult.getErrorMessage()}` };\n  }\n  return { success: true, data: data as HDFSystem };\n}\n\n/**\n * Parse HDF Plan document from string or bytes\n */\nexport function parsePlan(input: string | Uint8Array): ParseResult<HDFPlan> {\n  const decoded = typeof input === 'string' ? input : new TextDecoder().decode(input);\n  const jsonStr = normalizeTimestamps(decoded);\n  if (jsonStr.trim().length === 0) {\n    return { success: false, error: 'Input is empty' };\n  }\n  let data: unknown;\n  try {\n    data = JSON.parse(jsonStr);\n  } catch (err) {\n    return { success: false, error: `Invalid JSON: ${err instanceof Error ? err.message : String(err)}` };\n  }\n  const validationResult = validatePlan(data);\n  if (!validationResult.valid) {\n    return { success: false, error: `Schema validation failed: ${validationResult.getErrorMessage()}` };\n  }\n  return { success: true, data: data as HDFPlan };\n}\n\n/**\n * Parse HDF Evidence Package document from string or bytes\n */\nexport function parseEvidencePackage(input: string | Uint8Array): ParseResult<HDFEvidencePackage> {\n  const decoded = typeof input === 'string' ? input : new TextDecoder().decode(input);\n  const jsonStr = normalizeTimestamps(decoded);\n  if (jsonStr.trim().length === 0) {\n    return { success: false, error: 'Input is empty' };\n  }\n  let data: unknown;\n  try {\n    data = JSON.parse(jsonStr);\n  } catch (err) {\n    return { success: false, error: `Invalid JSON: ${err instanceof Error ? err.message : String(err)}` };\n  }\n  const validationResult = validateEvidencePackage(data);\n  if (!validationResult.valid) {\n    return { success: false, error: `Schema validation failed: ${validationResult.getErrorMessage()}` };\n  }\n  return { success: true, data: data as HDFEvidencePackage };\n}\n\n/**\n * Parse HDF Comparison document from string or bytes\n */\nexport function parseComparison(input: string | Uint8Array): ParseResult<HDFComparison> {\n  const decoded = typeof input === 'string' ? input : new TextDecoder().decode(input);\n  const jsonStr = normalizeTimestamps(decoded);\n  if (jsonStr.trim().length === 0) {\n    return { success: false, error: 'Input is empty' };\n  }\n  let data: unknown;\n  try {\n    data = JSON.parse(jsonStr);\n  } catch (err) {\n    return { success: false, error: `Invalid JSON: ${err instanceof Error ? err.message : String(err)}` };\n  }\n  const validationResult = validateComparison(data);\n  if (!validationResult.valid) {\n    return { success: false, error: `Schema validation failed: ${validationResult.getErrorMessage()}` };\n  }\n  return { success: true, data: data as HDFComparison };\n}\n\n/**\n * Parse HDF document with auto-detection of type\n * @param input - JSON string or Uint8Array to parse\n * @returns ParseResult with parsed data, type indicator, or error\n */\nexport function parse(\n  input: string | Uint8Array,\n): ParseResult<HDFResults | HDFBaseline | HDFSystem | HDFPlan | HDFEvidencePackage | HDFComparison> {\n  // Convert Uint8Array to string if needed\n  const decoded = typeof input === 'string' ? input : new TextDecoder().decode(input);\n  const jsonStr = normalizeTimestamps(decoded);\n\n  // Check for empty input\n  if (jsonStr.trim().length === 0) {\n    return {\n      success: false,\n      error: 'Input is empty'\n    };\n  }\n\n  // Parse JSON\n  let data: unknown;\n  try {\n    data = JSON.parse(jsonStr);\n  } catch (err) {\n    return {\n      success: false,\n      error: `Invalid JSON: ${err instanceof Error ? err.message : String(err)}`\n    };\n  }\n\n  // Trailing garbage already caught by the JSON.parse catch above; see\n  // parseResults for the full rationale.\n\n  // Auto-validate and detect type\n  const validationResult = autoValidate(data);\n  if (!validationResult.valid) {\n    return {\n      success: false,\n      error: `Schema validation failed: ${validationResult.getErrorMessage()}`\n    };\n  }\n\n  // Determine type based on structure\n  if (typeof data === 'object' && data !== null) {\n    const obj = data as Record<string, unknown>;\n\n    // HDF Results has 'baselines' array at root\n    if ('baselines' in obj) {\n      return {\n        success: true,\n        data: data as HDFResults,\n        type: 'results'\n      };\n    }\n\n    // HDF Comparison has 'requirementDiffs' at root (unique discriminator)\n    if ('requirementDiffs' in obj) {\n      return { success: true, data: data as HDFComparison, type: 'comparison' };\n    }\n\n    // HDF Plan has 'assessments' at root\n    if ('assessments' in obj) {\n      return { success: true, data: data as HDFPlan, type: 'plan' };\n    }\n\n    // HDF Evidence Package has 'contents' at root\n    if ('contents' in obj) {\n      return { success: true, data: data as HDFEvidencePackage, type: 'evidencePackage' };\n    }\n\n    // HDF Baseline has 'name' and 'requirements' at root\n    if ('name' in obj && 'requirements' in obj) {\n      return {\n        success: true,\n        data: data as HDFBaseline,\n        type: 'baseline'\n      };\n    }\n\n    // HDF System has 'components' at root (Results' baselines check already ruled out)\n    if ('components' in obj) {\n      return { success: true, data: data as HDFSystem, type: 'system' };\n    }\n  }\n\n  return {\n    success: false,\n    error: 'Unable to determine HDF document type'\n  };\n}\n\n"],"mappings":";;;AA2BA,SAAS,YAAY,MAAc,aAA8C;CAC/E,MAAM,QAAkB,CAAC;CACzB,MAAM,uBAAO,IAAI,IAAY;CAC7B,MAAM,QAAQ,CAAC,IAAI;CACnB,OAAO,MAAM,SAAS,GAAG;EACvB,MAAM,OAAO,MAAM,MAAM;EACzB,IAAI,KAAK,IAAI,IAAI,GAAG;EACpB,KAAK,IAAI,IAAI;EACb,MAAM,KAAK,IAAI;EACf,KAAK,MAAM,SAAU,YAAY,IAAI,IAAI,KAAK,CAAC,GAC7C,MAAM,KAAK,KAAK;CAEpB;CACA,OAAO;AACT;;AAGA,SAAS,cAAc,MAAc,aAAgE;CACnG,MAAM,eAAe,YAAY,IAAI,IAAI,KAAK,CAAC;CAC/C,IAAI,aAAa,UAAU,GACzB,OAAO;CAET,KAAK,MAAM,SAAS,cAClB,KAAK,YAAY,IAAI,KAAK,KAAK,CAAC,EAAA,CAAG,SAAS,GAC1C,OAAO;CAGX,OAAO;AACT;;AAGA,SAAS,iBACP,UACA,UACsB;CACtB,MAAM,SAA+B,EAAE,GAAG,SAAS;CAGnD,OAAO,SAAS,SAAS;CAGzB,IAAI,SAAS,WAAW,SAAS,QAAQ,SAAS,GAChD,OAAO,UAAU,SAAS;CAI5B,IAAI,SAAS,QAAQ,SAAS,KAAK,KAAK,MAAM,IAC5C,OAAO,OAAO,SAAS;CAIzB,IAAI,SAAS,MACX,OAAO,OAAO;EAAE,GAAG,SAAS;EAAM,GAAG,SAAS;CAAK;CAIrD,IAAI,SAAS,aAAa,KAAA,GACxB,OAAO,WAAW,SAAS;CAM7B,IAAI,SAAS,oBAAoB,KAAA,KAAa,SAAS,WAAW,SAAS,QAAQ,SAAS,GAC1F,OAAO,kBAAkB,SAAS;CAIpC,IAAI,SAAS,gBAAgB,SAAS,aAAa,SAAS,GAAG;EAC7D,MAAM,UAAU,IAAI,KACjB,SAAS,gBAAgB,CAAC,EAAA,CAAG,KAAI,MAAK,CAAC,EAAE,OAAO,CAAC,CAAC,CACrD;EACA,KAAK,MAAM,KAAK,SAAS,cACvB,QAAQ,IAAI,EAAE,OAAO,CAAC;EAExB,OAAO,eAAe,CAAC,GAAG,QAAQ,OAAO,CAAC;CAC5C;CAEA,OAAO;AACT;;;;;;;AAQA,SAAS,sBACP,GACA,QACA,cACoB;CACpB,IAAI,CAAC,EAAE,gBAAgB,OAAO,KAAA;CAC9B,IAAI,OAAO,IAAI,EAAE,cAAc,GAAG,OAAO,EAAE;CAG3C,KAAK,MAAM,aAAa,cACtB,IAAI,UAAU,SAAS,MAAM,MAAM,EAAE,SAAS,EAAE,IAAI,GAClD,OAAO,UAAU;AAIvB;;;;;;;;;;;;AAeA,SAAgB,gBAAgB,SAAoC;CAClE,MAAM,EAAE,cAAc;CACtB,MAAM,WAAqB,CAAC;CAC5B,MAAM,SAA0B,CAAC;CAEjC,IAAI,CAAC,aAAa,UAAU,WAAW,GACrC,OAAO;EACL,SAAS;GAAE,GAAG;GAAS,WAAW,CAAC;EAAE;EACrC,UAAU;GACR,uBAAuB;GACvB,wBAAwB;GACxB,QAAQ,CAAC;GACT,UAAU,CAAC;EACb;CACF;CAIF,MAAM,yBAAS,IAAI,IAA+B;CAClD,KAAK,MAAM,KAAK,WAAW;EACzB,IAAI,OAAO,IAAI,EAAE,IAAI,GACnB,SAAS,KAAK,4BAA4B,EAAE,KAAK,mCAAmC;EAEtF,OAAO,IAAI,EAAE,MAAM,CAAC;CACtB;CAGA,MAAM,iCAAiB,IAAI,IAAgC;CAC3D,KAAK,MAAM,KAAK,WAAW;EACzB,MAAM,SAAS,sBAAsB,GAAG,QAAQ,SAAS;EACzD,eAAe,IAAI,EAAE,MAAM,MAAM;EACjC,IAAI,EAAE,kBAAkB,CAAC,QACvB,SAAS,KACP,aAAa,EAAE,KAAK,mCAAmC,EAAE,eAAe,EAC1E;CAEJ;CAGA,MAAM,8BAAc,IAAI,IAAsB;CAC9C,KAAK,MAAM,KAAK,WAAW;EACzB,MAAM,SAAS,eAAe,IAAI,EAAE,IAAI;EACxC,IAAI,QAAQ;GACV,MAAM,OAAO,YAAY,IAAI,MAAM,KAAK,CAAC;GACzC,KAAK,KAAK,EAAE,IAAI;GAChB,YAAY,IAAI,QAAQ,IAAI;EAC9B;CACF;CAGA,MAAM,QAAkB,CAAC;CACzB,MAAM,0BAAU,IAAI,IAAY;CAEhC,KAAK,MAAM,KAAK,WACd,IAAI,CAAC,eAAe,IAAI,EAAE,IAAI,GAC5B,MAAM,KAAK,EAAE,IAAI;CAKrB,SAAS,cAAc,OAAqB;EAC1C,MAAM,QAAQ,CAAC,KAAK;EACpB,OAAO,MAAM,SAAS,GAAG;GACvB,MAAM,OAAO,MAAM,IAAI;GACvB,IAAI,QAAQ,IAAI,IAAI,GAAG;GACvB,QAAQ,IAAI,IAAI;GAChB,MAAM,WAAW,YAAY,IAAI,IAAI;GACrC,IAAI,UACF,KAAK,MAAM,SAAS,UAClB,MAAM,KAAK,KAAK;EAGtB;CACF;CACA,KAAK,MAAM,KAAK,OACd,cAAc,CAAC;CAIjB,KAAK,MAAM,KAAK,WACd,IAAI,CAAC,QAAQ,IAAI,EAAE,IAAI,GAAG;EACxB,SAAS,KAAK,+CAA+C,EAAE,KAAK,EAAE;EACtE,MAAM,KAAK,EAAE,IAAI;EACjB,cAAc,EAAE,IAAI;CACtB;CAIF,MAAM,gBAAqC,CAAC;CAE5C,KAAK,MAAM,YAAY,OAAO;EAC5B,MAAM,OAAO,OAAO,IAAI,QAAQ;EAChC,MAAM,YAAY,YAAY,UAAU,WAAW;EAEnD,IAAI,UAAU,WAAW,GAAG;GAE1B,cAAc,KAAK,IAAI;GACvB;EACF;EAGA,MAAM,WAAW,CAAC,GAAG,SAAS,CAAC,CAAC,QAAQ;EAGxC,MAAM,yBAAS,IAAI,IAAkC;EACrD,IAAI,iBAAiB;EACrB,MAAM,WAAqB,CAAC;EAE5B,KAAK,MAAM,QAAQ,UAAU;GAC3B,MAAM,IAAI,OAAO,IAAI,IAAI;GACzB,kBAAkB,EAAE,aAAa;GACjC,IAAI,SAAS,UACX,SAAS,KAAK,IAAI;GAEpB,KAAK,MAAM,OAAO,EAAE,cAClB,IAAI,OAAO,IAAI,IAAI,EAAE,GACnB,OAAO,IAAI,IAAI,IAAI,iBAAiB,OAAO,IAAI,IAAI,EAAE,GAAI,GAAG,CAAC;QAE7D,OAAO,IAAI,IAAI,IAAI,EAAE,GAAG,IAAI,CAAC;EAGnC;EAEA,MAAM,aAAa,CAAC,GAAG,OAAO,OAAO,CAAC;EACtC,MAAM,UAAU,cAAc,UAAU,WAAW;EAEnD,OAAO,KAAK;GACV,cAAc;GACd,mBAAmB;GACnB;GACA,eAAe,WAAW;GAC1B;EACF,CAAC;EAED,MAAM,MAAyB;GAC7B,GAAG;GACH,cAAc;EAChB;EACA,OAAO,IAAI;EACX,OAAO,IAAI;EACX,cAAc,KAAK,GAAG;CACxB;CAEA,OAAO;EACL,SAAS;GAAE,GAAG;GAAS,WAAW;EAAc;EAChD,UAAU;GACR,uBAAuB,UAAU;GACjC,wBAAwB,cAAc;GACtC;GACA;EACF;CACF;AACF;;;ACjRA,MAAM,wBAAwB;;;;;;;AAQ9B,SAAgB,oBAAoB,OAAuB;CACzD,OAAO,MAAM,QAAQ,uBAAuB,SAAO;AACrD;;;;;;AAiBA,SAAgB,aAAa,OAAqD;CAGhF,MAAM,UAAU,oBADA,OAAO,UAAU,WAAW,QAAQ,IAAI,YAAY,CAAC,CAAC,OAAO,KAAK,CACvC;CAG3C,IAAI,QAAQ,KAAK,CAAC,CAAC,WAAW,GAC5B,OAAO;EACL,SAAS;EACT,OAAO;CACT;CAIF,IAAI;CACJ,IAAI;EACF,OAAO,KAAK,MAAM,OAAO;CAC3B,SAAS,KAAK;EACZ,OAAO;GACL,SAAS;GACT,OAAO,iBAAiB,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;EACzE;CACF;CAUA,MAAM,mBAAmB,gBAAgB,IAAI;CAC7C,IAAI,CAAC,iBAAiB,OACpB,OAAO;EACL,SAAS;EACT,OAAO,6BAA6B,iBAAiB,gBAAgB;CACvE;CAGF,OAAO;EACL,SAAS;EACH;CACR;AACF;;;;;;AAOA,SAAgB,cAAc,OAAsD;CAGlF,MAAM,UAAU,oBADA,OAAO,UAAU,WAAW,QAAQ,IAAI,YAAY,CAAC,CAAC,OAAO,KAAK,CACvC;CAG3C,IAAI,QAAQ,KAAK,CAAC,CAAC,WAAW,GAC5B,OAAO;EACL,SAAS;EACT,OAAO;CACT;CAIF,IAAI;CACJ,IAAI;EACF,OAAO,KAAK,MAAM,OAAO;CAC3B,SAAS,KAAK;EACZ,OAAO;GACL,SAAS;GACT,OAAO,iBAAiB,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;EACzE;CACF;CAMA,MAAM,mBAAmB,iBAAiB,IAAI;CAC9C,IAAI,CAAC,iBAAiB,OACpB,OAAO;EACL,SAAS;EACT,OAAO,6BAA6B,iBAAiB,gBAAgB;CACvE;CAGF,OAAO;EACL,SAAS;EACH;CACR;AACF;;;;AAKA,SAAgB,YAAY,OAAoD;CAE9E,MAAM,UAAU,oBADA,OAAO,UAAU,WAAW,QAAQ,IAAI,YAAY,CAAC,CAAC,OAAO,KAAK,CACvC;CAC3C,IAAI,QAAQ,KAAK,CAAC,CAAC,WAAW,GAC5B,OAAO;EAAE,SAAS;EAAO,OAAO;CAAiB;CAEnD,IAAI;CACJ,IAAI;EACF,OAAO,KAAK,MAAM,OAAO;CAC3B,SAAS,KAAK;EACZ,OAAO;GAAE,SAAS;GAAO,OAAO,iBAAiB,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;EAAI;CACtG;CACA,MAAM,mBAAmB,eAAe,IAAI;CAC5C,IAAI,CAAC,iBAAiB,OACpB,OAAO;EAAE,SAAS;EAAO,OAAO,6BAA6B,iBAAiB,gBAAgB;CAAI;CAEpG,OAAO;EAAE,SAAS;EAAY;CAAkB;AAClD;;;;AAKA,SAAgB,UAAU,OAAkD;CAE1E,MAAM,UAAU,oBADA,OAAO,UAAU,WAAW,QAAQ,IAAI,YAAY,CAAC,CAAC,OAAO,KAAK,CACvC;CAC3C,IAAI,QAAQ,KAAK,CAAC,CAAC,WAAW,GAC5B,OAAO;EAAE,SAAS;EAAO,OAAO;CAAiB;CAEnD,IAAI;CACJ,IAAI;EACF,OAAO,KAAK,MAAM,OAAO;CAC3B,SAAS,KAAK;EACZ,OAAO;GAAE,SAAS;GAAO,OAAO,iBAAiB,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;EAAI;CACtG;CACA,MAAM,mBAAmB,aAAa,IAAI;CAC1C,IAAI,CAAC,iBAAiB,OACpB,OAAO;EAAE,SAAS;EAAO,OAAO,6BAA6B,iBAAiB,gBAAgB;CAAI;CAEpG,OAAO;EAAE,SAAS;EAAY;CAAgB;AAChD;;;;AAKA,SAAgB,qBAAqB,OAA6D;CAEhG,MAAM,UAAU,oBADA,OAAO,UAAU,WAAW,QAAQ,IAAI,YAAY,CAAC,CAAC,OAAO,KAAK,CACvC;CAC3C,IAAI,QAAQ,KAAK,CAAC,CAAC,WAAW,GAC5B,OAAO;EAAE,SAAS;EAAO,OAAO;CAAiB;CAEnD,IAAI;CACJ,IAAI;EACF,OAAO,KAAK,MAAM,OAAO;CAC3B,SAAS,KAAK;EACZ,OAAO;GAAE,SAAS;GAAO,OAAO,iBAAiB,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;EAAI;CACtG;CACA,MAAM,mBAAmB,wBAAwB,IAAI;CACrD,IAAI,CAAC,iBAAiB,OACpB,OAAO;EAAE,SAAS;EAAO,OAAO,6BAA6B,iBAAiB,gBAAgB;CAAI;CAEpG,OAAO;EAAE,SAAS;EAAY;CAA2B;AAC3D;;;;AAKA,SAAgB,gBAAgB,OAAwD;CAEtF,MAAM,UAAU,oBADA,OAAO,UAAU,WAAW,QAAQ,IAAI,YAAY,CAAC,CAAC,OAAO,KAAK,CACvC;CAC3C,IAAI,QAAQ,KAAK,CAAC,CAAC,WAAW,GAC5B,OAAO;EAAE,SAAS;EAAO,OAAO;CAAiB;CAEnD,IAAI;CACJ,IAAI;EACF,OAAO,KAAK,MAAM,OAAO;CAC3B,SAAS,KAAK;EACZ,OAAO;GAAE,SAAS;GAAO,OAAO,iBAAiB,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;EAAI;CACtG;CACA,MAAM,mBAAmB,mBAAmB,IAAI;CAChD,IAAI,CAAC,iBAAiB,OACpB,OAAO;EAAE,SAAS;EAAO,OAAO,6BAA6B,iBAAiB,gBAAgB;CAAI;CAEpG,OAAO;EAAE,SAAS;EAAY;CAAsB;AACtD;;;;;;AAOA,SAAgB,MACd,OACkG;CAGlG,MAAM,UAAU,oBADA,OAAO,UAAU,WAAW,QAAQ,IAAI,YAAY,CAAC,CAAC,OAAO,KAAK,CACvC;CAG3C,IAAI,QAAQ,KAAK,CAAC,CAAC,WAAW,GAC5B,OAAO;EACL,SAAS;EACT,OAAO;CACT;CAIF,IAAI;CACJ,IAAI;EACF,OAAO,KAAK,MAAM,OAAO;CAC3B,SAAS,KAAK;EACZ,OAAO;GACL,SAAS;GACT,OAAO,iBAAiB,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;EACzE;CACF;CAMA,MAAM,mBAAmBA,SAAa,IAAI;CAC1C,IAAI,CAAC,iBAAiB,OACpB,OAAO;EACL,SAAS;EACT,OAAO,6BAA6B,iBAAiB,gBAAgB;CACvE;CAIF,IAAI,OAAO,SAAS,YAAY,SAAS,MAAM;EAC7C,MAAM,MAAM;EAGZ,IAAI,eAAe,KACjB,OAAO;GACL,SAAS;GACH;GACN,MAAM;EACR;EAIF,IAAI,sBAAsB,KACxB,OAAO;GAAE,SAAS;GAAY;GAAuB,MAAM;EAAa;EAI1E,IAAI,iBAAiB,KACnB,OAAO;GAAE,SAAS;GAAY;GAAiB,MAAM;EAAO;EAI9D,IAAI,cAAc,KAChB,OAAO;GAAE,SAAS;GAAY;GAA4B,MAAM;EAAkB;EAIpF,IAAI,UAAU,OAAO,kBAAkB,KACrC,OAAO;GACL,SAAS;GACH;GACN,MAAM;EACR;EAIF,IAAI,gBAAgB,KAClB,OAAO;GAAE,SAAS;GAAY;GAAmB,MAAM;EAAS;CAEpE;CAEA,OAAO;EACL,SAAS;EACT,OAAO;CACT;AACF"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@mitre/hdf-parsers",
-  "version": "3.1.0",
+  "version": "3.3.0",
   "description": "Parse and load HDF documents with validation",
   "publishConfig": {
     "access": "public"
@@ -25,8 +25,8 @@
   "author": "MITRE Corporation",
   "license": "Apache-2.0",
   "dependencies": {
-    "@mitre/hdf-validators": "^3.1.0",
-    "@mitre/hdf-schema": "^3.1.0"
+    "@mitre/hdf-schema": "^3.3.0",
+    "@mitre/hdf-validators": "^3.3.0"
   },
   "engines": {
     "node": ">=22.0.0"
@@ -39,7 +39,8 @@
   ],
   "devDependencies": {
     "@stryker-mutator/core": "^9.5.1",
-    "@stryker-mutator/vitest-runner": "^9.5.1"
+    "@stryker-mutator/vitest-runner": "^9.5.1",
+    "@mitre/hdf-fixtures": "^3.3.0"
   },
   "scripts": {
     "build": "tsdown",