@mitre/hdf-parsers 3.0.1 → 3.1.0

package/LICENSE.md

@@ -0,0 +1,55 @@
+# License
+
+Copyright © 2025 The MITRE Corporation.
+
+Approved for Public Release; Distribution Unlimited. Case Number 18-3678.
+
+Licensed under the Apache License, Version 2.0 (the "License"); you may
+not use this file except in compliance with the License. You may obtain a
+copy of the License at
+
+    http://www.apache.org/licenses/LICENSE-2.0
+
+Unless required by applicable law or agreed to in writing, software
+distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
+WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the
+License for the specific language governing permissions and limitations
+under the License.
+
+## Redistribution Terms
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are
+met:
+
+- Redistributions of source code must retain the above copyright/digital
+  rights legend, this list of conditions and the following Notice.
+- Redistributions in binary form must reproduce the above
+  copyright/digital rights legend, this list of conditions and the
+  following Notice in the documentation and/or other materials provided
+  with the distribution.
+- Neither the name of The MITRE Corporation nor the names of its contributors
+  may be used to endorse or promote products derived from this software
+  without specific prior written permission.
+
+## Notice
+
+The MITRE Corporation grants permission to reproduce, distribute, modify, and
+otherwise use this software to the extent permitted by the licensed terms
+provided in the LICENSE file included with this project.
+
+This software was produced by The MITRE Corporation for the U.S. Government
+under contract. As such the U.S. Government has certain use and data
+rights in this software. No use other than those granted to the U.S.
+Government, or to those acting on behalf of the U.S. Government, under
+these contract arrangements is authorized without the express written
+permission of The MITRE Corporation.
+
+Some files in this codebase were generated by generative AI, under the
+direction and review of The MITRE Corporation employees, for the purpose of
+development efficiency. All AI-generated code functionality was validated
+by standard quality and assurance testing.
+
+For further information, please contact The MITRE Corporation,
+Contracts Management Office, 7515 Colshire Drive, McLean, VA 22102-7539,
+(703) 983-6000.

package/README.md

@@ -90,7 +90,7 @@ import (
 	"fmt"
 	"os"
 
-	parsers "github.com/mitre/hdf-parsers/go"
+	parsers "github.com/mitre/hdf-libs/hdf-parsers/go"
 )
 
 func main() {

package/dist/index.d.ts

@@ -1,31 +1,64 @@
-import type { HdfResults, HdfBaseline } from '@mitre/hdf-schema';
-export { flattenOverlays } from './flatten.js';
-export type { FlattenResult, FlattenMetadata, BaselineMerge } from './flatten.js';
+import { HdfBaseline, HdfResults } from "@mitre/hdf-schema";
+
+//#region typescript/flatten.d.ts
+interface FlattenResult {
+  results: HdfResults;
+  metadata: FlattenMetadata;
+}
+interface FlattenMetadata {
+  originalBaselineCount: number;
+  flattenedBaselineCount: number;
+  merges: BaselineMerge[];
+  warnings: string[];
+}
+interface BaselineMerge {
+  rootBaseline: string;
+  absorbedBaselines: string[];
+  controlsBefore: number;
+  controlsAfter: number;
+  pattern: 'deep' | 'wide' | 'hybrid';
+}
+/**
+ * Flatten overlay/wrapper baselines in an HDF Results document.
+ *
+ * Handles:
+ * - Deep nesting (overlay chains with shared control IDs via parentBaseline)
+ * - Wide nesting (wrapper profiles aggregating independent bases)
+ * - Hybrid (both patterns in one document)
+ *
+ * @param results - Parsed HDF Results (from parseResults() or equivalent)
+ * @returns FlattenResult with flattened data and merge metadata
+ */
+declare function flattenOverlays(results: HdfResults): FlattenResult;
+//#endregion
+//#region typescript/index.d.ts
 /**
  * Result of parsing operation
  */
-export interface ParseResult<T> {
-    success: boolean;
-    data?: T;
-    error?: string;
-    type?: 'results' | 'baseline';
+interface ParseResult<T> {
+  success: boolean;
+  data?: T;
+  error?: string;
+  type?: 'results' | 'baseline';
 }
 /**
  * Parse HDF Results document from string or bytes
  * @param input - JSON string or Uint8Array to parse
  * @returns ParseResult with parsed data or error
  */
-export 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
  */
-export declare function parseBaseline(input: string | Uint8Array): ParseResult<HdfBaseline>;
+declare function parseBaseline(input: string | Uint8Array): ParseResult<HdfBaseline>;
 /**
  * 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
  */
-export declare function parse(input: string | Uint8Array): ParseResult<HdfResults | HdfBaseline>;
+declare function parse(input: string | Uint8Array): ParseResult<HdfResults | HdfBaseline>;
+//#endregion
+export { type BaselineMerge, type FlattenMetadata, type FlattenResult, ParseResult, flattenOverlays, parse, parseBaseline, parseResults };
 //# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../typescript/index.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AACjE,OAAO,EAAE,eAAe,EAAE,MAAM,cAAc,CAAC;AAC/C,YAAY,EAAE,aAAa,EAAE,eAAe,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AAGlF;;GAEG;AACH,MAAM,WAAW,WAAW,CAAC,CAAC;IAC5B,OAAO,EAAE,OAAO,CAAC;IACjB,IAAI,CAAC,EAAE,CAAC,CAAC;IACT,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,IAAI,CAAC,EAAE,SAAS,GAAG,UAAU,CAAC;CAC/B;AAED;;;;GAIG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,MAAM,GAAG,UAAU,GAAG,WAAW,CAAC,UAAU,CAAC,CA+ChF;AAED;;;;GAIG;AACH,wBAAgB,aAAa,CAAC,KAAK,EAAE,MAAM,GAAG,UAAU,GAAG,WAAW,CAAC,WAAW,CAAC,CA8ClF;AAED;;;;GAIG;AACH,wBAAgB,KAAK,CAAC,KAAK,EAAE,MAAM,GAAG,UAAU,GAAG,WAAW,CAAC,UAAU,GAAG,WAAW,CAAC,CAqEvF"}
+{"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"}

package/dist/index.js

@@ -1,177 +1,303 @@
-export { flattenOverlays } from './flatten.js';
-import { validateResults, validateBaseline, validate as autoValidate } from '@mitre/hdf-validators';
+import { validate, validateBaseline, validateResults } from "@mitre/hdf-validators";
+//#region typescript/flatten.ts
+/** BFS from root, returns names in top-down order. Cycle-safe. */
+function collectTree(root, childrenMap) {
+	const order = [];
+	const seen = /* @__PURE__ */ new Set();
+	const queue = [root];
+	while (queue.length > 0) {
+		const name = queue.shift();
+		if (seen.has(name)) continue;
+		seen.add(name);
+		order.push(name);
+		for (const child of childrenMap.get(name) || []) queue.push(child);
+	}
+	return order;
+}
+/** Classify merge pattern based on tree shape */
+function detectPattern(root, childrenMap) {
+	const rootChildren = childrenMap.get(root) || [];
+	if (rootChildren.length <= 1) return "deep";
+	for (const child of rootChildren) if ((childrenMap.get(child) || []).length > 0) return "hybrid";
+	return "wide";
+}
+/** Merge incoming requirement fields onto existing */
+function mergeRequirement(existing, incoming) {
+	const result = { ...existing };
+	result.impact = incoming.impact;
+	if (incoming.results && incoming.results.length > 0) result.results = incoming.results;
+	if (incoming.code && incoming.code.trim() !== "") result.code = incoming.code;
+	if (incoming.tags) result.tags = {
+		...existing.tags,
+		...incoming.tags
+	};
+	if (incoming.severity !== void 0) result.severity = incoming.severity;
+	if (incoming.effectiveStatus !== void 0 && incoming.results && incoming.results.length > 0) result.effectiveStatus = incoming.effectiveStatus;
+	if (incoming.descriptions && incoming.descriptions.length > 0) {
+		const descMap = new Map((existing.descriptions || []).map((d) => [d.label, d]));
+		for (const d of incoming.descriptions) descMap.set(d.label, d);
+		result.descriptions = [...descMap.values()];
+	}
+	return result;
+}
+/**
+* Resolve parentBaseline for a baseline.
+* InSpec parent_profile can use depends-name aliases (e.g., 'k8s' instead of
+* 'k8s-node-stig-baseline'). When the value isn't a direct profile name,
+* find who depends on this baseline — that's the actual parent.
+*/
+function resolveParentBaseline(b, byName, allBaselines) {
+	if (!b.parentBaseline) return void 0;
+	if (byName.has(b.parentBaseline)) return b.parentBaseline;
+	for (const candidate of allBaselines) if (candidate.depends?.some((d) => d.name === b.name)) return candidate.name;
+}
+/**
+* Flatten overlay/wrapper baselines in an HDF Results document.
+*
+* Handles:
+* - Deep nesting (overlay chains with shared control IDs via parentBaseline)
+* - Wide nesting (wrapper profiles aggregating independent bases)
+* - Hybrid (both patterns in one document)
+*
+* @param results - Parsed HDF Results (from parseResults() or equivalent)
+* @returns FlattenResult with flattened data and merge metadata
+*/
+function flattenOverlays(results) {
+	const { baselines } = results;
+	const warnings = [];
+	const merges = [];
+	if (!baselines || baselines.length === 0) return {
+		results: {
+			...results,
+			baselines: []
+		},
+		metadata: {
+			originalBaselineCount: 0,
+			flattenedBaselineCount: 0,
+			merges: [],
+			warnings: []
+		}
+	};
+	const byName = /* @__PURE__ */ new Map();
+	for (const b of baselines) {
+		if (byName.has(b.name)) warnings.push(`Duplicate baseline name "${b.name}" — later entry overwrites earlier`);
+		byName.set(b.name, b);
+	}
+	const resolvedParent = /* @__PURE__ */ new Map();
+	for (const b of baselines) {
+		const parent = resolveParentBaseline(b, byName, baselines);
+		resolvedParent.set(b.name, parent);
+		if (b.parentBaseline && !parent) warnings.push(`Baseline "${b.name}" references nonexistent parent "${b.parentBaseline}"`);
+	}
+	const childrenMap = /* @__PURE__ */ new Map();
+	for (const b of baselines) {
+		const parent = resolvedParent.get(b.name);
+		if (parent) {
+			const list = childrenMap.get(parent) || [];
+			list.push(b.name);
+			childrenMap.set(parent, list);
+		}
+	}
+	const roots = [];
+	const visited = /* @__PURE__ */ new Set();
+	for (const b of baselines) if (!resolvedParent.get(b.name)) roots.push(b.name);
+	function markReachable(start) {
+		const stack = [start];
+		while (stack.length > 0) {
+			const name = stack.pop();
+			if (visited.has(name)) continue;
+			visited.add(name);
+			const children = childrenMap.get(name);
+			if (children) for (const child of children) stack.push(child);
+		}
+	}
+	for (const r of roots) markReachable(r);
+	for (const b of baselines) if (!visited.has(b.name)) {
+		warnings.push(`Circular parentBaseline detected involving "${b.name}"`);
+		roots.push(b.name);
+		markReachable(b.name);
+	}
+	const flatBaselines = [];
+	for (const rootName of roots) {
+		const root = byName.get(rootName);
+		const treeNames = collectTree(rootName, childrenMap);
+		if (treeNames.length === 1) {
+			flatBaselines.push(root);
+			continue;
+		}
+		const bottomUp = [...treeNames].reverse();
+		const merged = /* @__PURE__ */ new Map();
+		let controlsBefore = 0;
+		const absorbed = [];
+		for (const name of bottomUp) {
+			const b = byName.get(name);
+			controlsBefore += b.requirements.length;
+			if (name !== rootName) absorbed.push(name);
+			for (const req of b.requirements) if (merged.has(req.id)) merged.set(req.id, mergeRequirement(merged.get(req.id), req));
+			else merged.set(req.id, { ...req });
+		}
+		const mergedReqs = [...merged.values()];
+		const pattern = detectPattern(rootName, childrenMap);
+		merges.push({
+			rootBaseline: rootName,
+			absorbedBaselines: absorbed,
+			controlsBefore,
+			controlsAfter: mergedReqs.length,
+			pattern
+		});
+		const out = {
+			...root,
+			requirements: mergedReqs
+		};
+		delete out.parentBaseline;
+		delete out.depends;
+		flatBaselines.push(out);
+	}
+	return {
+		results: {
+			...results,
+			baselines: flatBaselines
+		},
+		metadata: {
+			originalBaselineCount: baselines.length,
+			flattenedBaselineCount: flatBaselines.length,
+			merges,
+			warnings
+		}
+	};
+}
+//#endregion
+//#region typescript/index.ts
 /**
- * Parse HDF Results document from string or bytes
- * @param input - JSON string or Uint8Array to parse
- * @returns ParseResult with parsed data or error
- */
-export function parseResults(input) {
-    // Convert Uint8Array to string if needed
-    const jsonStr = typeof input === 'string' ? input : new TextDecoder().decode(input);
-    // Check for empty input
-    if (jsonStr.trim().length === 0) {
-        return {
-            success: false,
-            error: 'Input is empty'
-        };
-    }
-    // Parse JSON
-    let data;
-    try {
-        data = JSON.parse(jsonStr);
-    }
-    catch (err) {
-        return {
-            success: false,
-            error: `Invalid JSON: ${err instanceof Error ? err.message : String(err)}`
-        };
-    }
-    // Check for trailing garbage by re-serializing and comparing length
-    // This catches cases like: {"valid":"json"}garbage
-    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'
-        };
-    }
-    // Validate against schema
-    const validationResult = validateResults(data);
-    if (!validationResult.valid) {
-        return {
-            success: false,
-            error: `Schema validation failed: ${validationResult.getErrorMessage()}`
-        };
-    }
-    return {
-        success: true,
-        data: data
-    };
+* 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);
+	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 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,
+		error: `Schema validation failed: ${validationResult.getErrorMessage()}`
+	};
+	return {
+		success: true,
+		data
+	};
 }
 /**
- * Parse HDF Baseline document from string or bytes
- * @param input - JSON string or Uint8Array to parse
- * @returns ParseResult with parsed data or error
- */
-export function parseBaseline(input) {
-    // Convert Uint8Array to string if needed
-    const jsonStr = typeof input === 'string' ? input : new TextDecoder().decode(input);
-    // Check for empty input
-    if (jsonStr.trim().length === 0) {
-        return {
-            success: false,
-            error: 'Input is empty'
-        };
-    }
-    // Parse JSON
-    let data;
-    try {
-        data = JSON.parse(jsonStr);
-    }
-    catch (err) {
-        return {
-            success: false,
-            error: `Invalid JSON: ${err instanceof Error ? err.message : String(err)}`
-        };
-    }
-    // Check for trailing garbage
-    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'
-        };
-    }
-    // Validate against schema
-    const validationResult = validateBaseline(data);
-    if (!validationResult.valid) {
-        return {
-            success: false,
-            error: `Schema validation failed: ${validationResult.getErrorMessage()}`
-        };
-    }
-    return {
-        success: true,
-        data: data
-    };
+* Parse HDF Baseline document from string or bytes
+* @param input - JSON string or Uint8Array to parse
+* @returns ParseResult with parsed data or error
+*/
+function parseBaseline(input) {
+	const jsonStr = 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 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 = validateBaseline(data);
+	if (!validationResult.valid) return {
+		success: false,
+		error: `Schema validation failed: ${validationResult.getErrorMessage()}`
+	};
+	return {
+		success: true,
+		data
+	};
 }
 /**
- * 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
- */
-export function parse(input) {
-    // Convert Uint8Array to string if needed
-    const jsonStr = typeof input === 'string' ? input : new TextDecoder().decode(input);
-    // Check for empty input
-    if (jsonStr.trim().length === 0) {
-        return {
-            success: false,
-            error: 'Input is empty'
-        };
-    }
-    // Parse JSON
-    let data;
-    try {
-        data = JSON.parse(jsonStr);
-    }
-    catch (err) {
-        return {
-            success: false,
-            error: `Invalid JSON: ${err instanceof Error ? err.message : String(err)}`
-        };
-    }
-    // Check for trailing garbage
-    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'
-        };
-    }
-    // Auto-validate and detect type
-    const validationResult = autoValidate(data);
-    if (!validationResult.valid) {
-        return {
-            success: false,
-            error: `Schema validation failed: ${validationResult.getErrorMessage()}`
-        };
-    }
-    // Determine type based on structure
-    if (typeof data === 'object' && data !== null) {
-        const obj = data;
-        // HDF Results has 'baselines' array at root
-        if ('baselines' in obj) {
-            return {
-                success: true,
-                data: data,
-                type: 'results'
-            };
-        }
-        // HDF Baseline has 'name' and 'requirements' at root
-        if ('name' in obj && 'requirements' in obj) {
-            return {
-                success: true,
-                data: data,
-                type: 'baseline'
-            };
-        }
-    }
-    return {
-        success: false,
-        error: 'Unable to determine HDF document type'
-    };
+* 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
+*/
+function parse(input) {
+	const jsonStr = 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 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,
+		error: `Schema validation failed: ${validationResult.getErrorMessage()}`
+	};
+	if (typeof data === "object" && data !== null) {
+		const obj = data;
+		if ("baselines" in obj) return {
+			success: true,
+			data,
+			type: "results"
+		};
+		if ("name" in obj && "requirements" in obj) return {
+			success: true,
+			data,
+			type: "baseline"
+		};
+	}
+	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
- */
+* 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) {
-    // Remove all whitespace and compare
-    const normalizeWhitespace = (s) => s.replace(/\s+/g, '');
-    return normalizeWhitespace(a) === normalizeWhitespace(b);
+	const normalizeWhitespace = (s) => s.replace(/\s+/g, "");
+	return normalizeWhitespace(a) === normalizeWhitespace(b);
 }
+//#endregion
+export { flattenOverlays, parse, parseBaseline, parseResults };
+
 //# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../typescript/index.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,eAAe,EAAE,MAAM,cAAc,CAAC;AAE/C,OAAO,EAAE,eAAe,EAAE,gBAAgB,EAAE,QAAQ,IAAI,YAAY,EAAE,MAAM,uBAAuB,CAAC;AAYpG;;;;GAIG;AACH,MAAM,UAAU,YAAY,CAAC,KAA0B;IACrD,yCAAyC;IACzC,MAAM,OAAO,GAAG,OAAO,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,WAAW,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAEpF,wBAAwB;IACxB,IAAI,OAAO,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAChC,OAAO;YACL,OAAO,EAAE,KAAK;YACd,KAAK,EAAE,gBAAgB;SACxB,CAAC;IACJ,CAAC;IAED,aAAa;IACb,IAAI,IAAa,CAAC;IAClB,IAAI,CAAC;QACH,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;IAC7B,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,OAAO;YACL,OAAO,EAAE,KAAK;YACd,KAAK,EAAE,iBAAiB,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE;SAC3E,CAAC;IACJ,CAAC;IAED,oEAAoE;IACpE,mDAAmD;IACnD,MAAM,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;IACxC,MAAM,YAAY,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC;IACpC,IAAI,UAAU,CAAC,MAAM,KAAK,YAAY,CAAC,MAAM,IAAI,CAAC,sBAAsB,CAAC,UAAU,EAAE,YAAY,CAAC,EAAE,CAAC;QACnG,OAAO;YACL,OAAO,EAAE,KAAK;YACd,KAAK,EAAE,4DAA4D;SACpE,CAAC;IACJ,CAAC;IAED,0BAA0B;IAC1B,MAAM,gBAAgB,GAAG,eAAe,CAAC,IAAI,CAAC,CAAC;IAC/C,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,CAAC;QAC5B,OAAO;YACL,OAAO,EAAE,KAAK;YACd,KAAK,EAAE,6BAA6B,gBAAgB,CAAC,eAAe,EAAE,EAAE;SACzE,CAAC;IACJ,CAAC;IAED,OAAO;QACL,OAAO,EAAE,IAAI;QACb,IAAI,EAAE,IAAkB;KACzB,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,aAAa,CAAC,KAA0B;IACtD,yCAAyC;IACzC,MAAM,OAAO,GAAG,OAAO,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,WAAW,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAEpF,wBAAwB;IACxB,IAAI,OAAO,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAChC,OAAO;YACL,OAAO,EAAE,KAAK;YACd,KAAK,EAAE,gBAAgB;SACxB,CAAC;IACJ,CAAC;IAED,aAAa;IACb,IAAI,IAAa,CAAC;IAClB,IAAI,CAAC;QACH,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;IAC7B,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,OAAO;YACL,OAAO,EAAE,KAAK;YACd,KAAK,EAAE,iBAAiB,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE;SAC3E,CAAC;IACJ,CAAC;IAED,6BAA6B;IAC7B,MAAM,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;IACxC,MAAM,YAAY,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC;IACpC,IAAI,UAAU,CAAC,MAAM,KAAK,YAAY,CAAC,MAAM,IAAI,CAAC,sBAAsB,CAAC,UAAU,EAAE,YAAY,CAAC,EAAE,CAAC;QACnG,OAAO;YACL,OAAO,EAAE,KAAK;YACd,KAAK,EAAE,4DAA4D;SACpE,CAAC;IACJ,CAAC;IAED,0BAA0B;IAC1B,MAAM,gBAAgB,GAAG,gBAAgB,CAAC,IAAI,CAAC,CAAC;IAChD,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,CAAC;QAC5B,OAAO;YACL,OAAO,EAAE,KAAK;YACd,KAAK,EAAE,6BAA6B,gBAAgB,CAAC,eAAe,EAAE,EAAE;SACzE,CAAC;IACJ,CAAC;IAED,OAAO;QACL,OAAO,EAAE,IAAI;QACb,IAAI,EAAE,IAAmB;KAC1B,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,KAAK,CAAC,KAA0B;IAC9C,yCAAyC;IACzC,MAAM,OAAO,GAAG,OAAO,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,WAAW,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAEpF,wBAAwB;IACxB,IAAI,OAAO,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAChC,OAAO;YACL,OAAO,EAAE,KAAK;YACd,KAAK,EAAE,gBAAgB;SACxB,CAAC;IACJ,CAAC;IAED,aAAa;IACb,IAAI,IAAa,CAAC;IAClB,IAAI,CAAC;QACH,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;IAC7B,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,OAAO;YACL,OAAO,EAAE,KAAK;YACd,KAAK,EAAE,iBAAiB,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE;SAC3E,CAAC;IACJ,CAAC;IAED,6BAA6B;IAC7B,MAAM,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;IACxC,MAAM,YAAY,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC;IACpC,IAAI,UAAU,CAAC,MAAM,KAAK,YAAY,CAAC,MAAM,IAAI,CAAC,sBAAsB,CAAC,UAAU,EAAE,YAAY,CAAC,EAAE,CAAC;QACnG,OAAO;YACL,OAAO,EAAE,KAAK;YACd,KAAK,EAAE,4DAA4D;SACpE,CAAC;IACJ,CAAC;IAED,gCAAgC;IAChC,MAAM,gBAAgB,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC;IAC5C,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,CAAC;QAC5B,OAAO;YACL,OAAO,EAAE,KAAK;YACd,KAAK,EAAE,6BAA6B,gBAAgB,CAAC,eAAe,EAAE,EAAE;SACzE,CAAC;IACJ,CAAC;IAED,oCAAoC;IACpC,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;QAC9C,MAAM,GAAG,GAAG,IAA+B,CAAC;QAE5C,4CAA4C;QAC5C,IAAI,WAAW,IAAI,GAAG,EAAE,CAAC;YACvB,OAAO;gBACL,OAAO,EAAE,IAAI;gBACb,IAAI,EAAE,IAAkB;gBACxB,IAAI,EAAE,SAAS;aAChB,CAAC;QACJ,CAAC;QAED,qDAAqD;QACrD,IAAI,MAAM,IAAI,GAAG,IAAI,cAAc,IAAI,GAAG,EAAE,CAAC;YAC3C,OAAO;gBACL,OAAO,EAAE,IAAI;gBACb,IAAI,EAAE,IAAmB;gBACzB,IAAI,EAAE,UAAU;aACjB,CAAC;QACJ,CAAC;IACH,CAAC;IAED,OAAO;QACL,OAAO,EAAE,KAAK;QACd,KAAK,EAAE,uCAAuC;KAC/C,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,SAAS,sBAAsB,CAAC,CAAS,EAAE,CAAS;IAClD,oCAAoC;IACpC,MAAM,mBAAmB,GAAG,CAAC,CAAS,EAAU,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;IACzE,OAAO,mBAAmB,CAAC,CAAC,CAAC,KAAK,mBAAmB,CAAC,CAAC,CAAC,CAAC;AAC3D,CAAC"}
+{"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"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@mitre/hdf-parsers",
-  "version": "3.0.1",
+  "version": "3.1.0",
   "description": "Parse and load HDF documents with validation",
   "publishConfig": {
     "access": "public"
@@ -10,25 +10,13 @@
   "types": "./dist/index.d.ts",
   "exports": {
     ".": {
-      "import": "./dist/index.js",
-      "types": "./dist/index.d.ts"
+      "types": "./dist/index.d.ts",
+      "import": "./dist/index.js"
     }
   },
   "files": [
     "dist"
   ],
-  "scripts": {
-    "build": "pnpm clean && tsc",
-    "clean": "rimraf dist",
-    "test": "pnpm run test:ts && pnpm run test:go",
-    "test:ts": "vitest run",
-    "test:go": "cd go && go test ./...",
-    "test:watch": "vitest",
-    "test:coverage": "vitest run --coverage",
-    "type-check": "tsc --noEmit",
-    "lint": "eslint typescript",
-    "lint:fix": "eslint typescript --fix"
-  },
   "repository": {
     "type": "git",
     "url": "https://github.com/mitre/hdf-libs.git",
@@ -37,11 +25,11 @@
   "author": "MITRE Corporation",
   "license": "Apache-2.0",
   "dependencies": {
-    "@mitre/hdf-schema": "workspace:*",
-    "@mitre/hdf-validators": "workspace:*"
+    "@mitre/hdf-validators": "^3.1.0",
+    "@mitre/hdf-schema": "^3.1.0"
   },
   "engines": {
-    "node": ">=20.0.0"
+    "node": ">=22.0.0"
   },
   "keywords": [
     "hdf",
@@ -52,5 +40,17 @@
   "devDependencies": {
     "@stryker-mutator/core": "^9.5.1",
     "@stryker-mutator/vitest-runner": "^9.5.1"
+  },
+  "scripts": {
+    "build": "tsdown",
+    "clean": "rimraf dist",
+    "test": "pnpm run test:ts && pnpm run test:go",
+    "test:ts": "vitest run",
+    "test:go": "cd go && go test ./...",
+    "test:watch": "vitest",
+    "test:coverage": "vitest run --coverage",
+    "type-check": "tsc --noEmit",
+    "lint": "eslint typescript",
+    "lint:fix": "eslint typescript --fix"
   }
-}
+}

package/dist/flatten.d.ts

@@ -1,31 +0,0 @@
-import type { HdfResults } from '@mitre/hdf-schema';
-export interface FlattenResult {
-    results: HdfResults;
-    metadata: FlattenMetadata;
-}
-export interface FlattenMetadata {
-    originalBaselineCount: number;
-    flattenedBaselineCount: number;
-    merges: BaselineMerge[];
-    warnings: string[];
-}
-export interface BaselineMerge {
-    rootBaseline: string;
-    absorbedBaselines: string[];
-    controlsBefore: number;
-    controlsAfter: number;
-    pattern: 'deep' | 'wide' | 'hybrid';
-}
-/**
- * Flatten overlay/wrapper baselines in an HDF Results document.
- *
- * Handles:
- * - Deep nesting (overlay chains with shared control IDs via parentBaseline)
- * - Wide nesting (wrapper profiles aggregating independent bases)
- * - Hybrid (both patterns in one document)
- *
- * @param results - Parsed HDF Results (from parseResults() or equivalent)
- * @returns FlattenResult with flattened data and merge metadata
- */
-export declare function flattenOverlays(results: HdfResults): FlattenResult;
-//# sourceMappingURL=flatten.d.ts.map

package/dist/flatten.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"flatten.d.ts","sourceRoot":"","sources":["../typescript/flatten.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAA2C,MAAM,mBAAmB,CAAC;AAI7F,MAAM,WAAW,aAAa;IAC5B,OAAO,EAAE,UAAU,CAAC;IACpB,QAAQ,EAAE,eAAe,CAAC;CAC3B;AAED,MAAM,WAAW,eAAe;IAC9B,qBAAqB,EAAE,MAAM,CAAC;IAC9B,sBAAsB,EAAE,MAAM,CAAC;IAC/B,MAAM,EAAE,aAAa,EAAE,CAAC;IACxB,QAAQ,EAAE,MAAM,EAAE,CAAC;CACpB;AAED,MAAM,WAAW,aAAa;IAC5B,YAAY,EAAE,MAAM,CAAC;IACrB,iBAAiB,EAAE,MAAM,EAAE,CAAC;IAC5B,cAAc,EAAE,MAAM,CAAC;IACvB,aAAa,EAAE,MAAM,CAAC;IACtB,OAAO,EAAE,MAAM,GAAG,MAAM,GAAG,QAAQ,CAAC;CACrC;AA+GD;;;;;;;;;;GAUG;AACH,wBAAgB,eAAe,CAAC,OAAO,EAAE,UAAU,GAAG,aAAa,CAwJlE"}

package/dist/flatten.js

@@ -1,235 +0,0 @@
-// ── Internal Helpers ───────────────────────────────────────
-/** BFS from root, returns names in top-down order. Cycle-safe. */
-function collectTree(root, childrenMap) {
-    const order = [];
-    const seen = new Set();
-    const queue = [root];
-    while (queue.length > 0) {
-        const name = queue.shift();
-        if (seen.has(name))
-            continue;
-        seen.add(name);
-        order.push(name);
-        for (const child of (childrenMap.get(name) || [])) {
-            queue.push(child);
-        }
-    }
-    return order;
-}
-/** Classify merge pattern based on tree shape */
-function detectPattern(root, childrenMap) {
-    const rootChildren = childrenMap.get(root) || [];
-    if (rootChildren.length <= 1) {
-        return 'deep';
-    }
-    for (const child of rootChildren) {
-        if ((childrenMap.get(child) || []).length > 0) {
-            return 'hybrid';
-        }
-    }
-    return 'wide';
-}
-/** Merge incoming requirement fields onto existing */
-function mergeRequirement(existing, incoming) {
-    const result = { ...existing };
-    // Impact: incoming always wins (required field, always present)
-    result.impact = incoming.impact;
-    // Results: keep whichever is non-empty (base has them, overlay doesn't)
-    if (incoming.results && incoming.results.length > 0) {
-        result.results = incoming.results;
-    }
-    // Code: incoming wins if non-empty
-    if (incoming.code && incoming.code.trim() !== '') {
-        result.code = incoming.code;
-    }
-    // Tags: shallow merge (incoming keys override)
-    if (incoming.tags) {
-        result.tags = { ...existing.tags, ...incoming.tags };
-    }
-    // Severity: incoming wins if present, else keep existing
-    if (incoming.severity !== undefined) {
-        result.severity = incoming.severity;
-    }
-    // EffectiveStatus: incoming wins only if it has results (otherwise its
-    // effectiveStatus is a computed artifact from empty results, not intentional).
-    // Overlays typically have empty results — the base has the real test results.
-    if (incoming.effectiveStatus !== undefined && incoming.results && incoming.results.length > 0) {
-        result.effectiveStatus = incoming.effectiveStatus;
-    }
-    // Descriptions: merge by label (incoming overrides same label)
-    if (incoming.descriptions && incoming.descriptions.length > 0) {
-        const descMap = new Map((existing.descriptions || []).map(d => [d.label, d]));
-        for (const d of incoming.descriptions) {
-            descMap.set(d.label, d);
-        }
-        result.descriptions = [...descMap.values()];
-    }
-    return result;
-}
-/**
- * Resolve parentBaseline for a baseline.
- * InSpec parent_profile can use depends-name aliases (e.g., 'k8s' instead of
- * 'k8s-node-stig-baseline'). When the value isn't a direct profile name,
- * find who depends on this baseline — that's the actual parent.
- */
-function resolveParentBaseline(b, byName, allBaselines) {
-    if (!b.parentBaseline)
-        return undefined;
-    if (byName.has(b.parentBaseline))
-        return b.parentBaseline;
-    // Alias resolution: find the profile whose depends array includes this baseline
-    for (const candidate of allBaselines) {
-        if (candidate.depends?.some((d) => d.name === b.name)) {
-            return candidate.name;
-        }
-    }
-    return undefined; // orphan
-}
-// ── Public API ──────────────────────────────────────────────
-/**
- * Flatten overlay/wrapper baselines in an HDF Results document.
- *
- * Handles:
- * - Deep nesting (overlay chains with shared control IDs via parentBaseline)
- * - Wide nesting (wrapper profiles aggregating independent bases)
- * - Hybrid (both patterns in one document)
- *
- * @param results - Parsed HDF Results (from parseResults() or equivalent)
- * @returns FlattenResult with flattened data and merge metadata
- */
-export function flattenOverlays(results) {
-    const { baselines } = results;
-    const warnings = [];
-    const merges = [];
-    if (!baselines || baselines.length === 0) {
-        return {
-            results: { ...results, baselines: [] },
-            metadata: {
-                originalBaselineCount: 0,
-                flattenedBaselineCount: 0,
-                merges: [],
-                warnings: [],
-            },
-        };
-    }
-    // Index baselines by name
-    const byName = new Map();
-    for (const b of baselines) {
-        if (byName.has(b.name)) {
-            warnings.push(`Duplicate baseline name "${b.name}" — later entry overwrites earlier`);
-        }
-        byName.set(b.name, b);
-    }
-    // Resolve parentBaseline aliases and build parent map
-    const resolvedParent = new Map();
-    for (const b of baselines) {
-        const parent = resolveParentBaseline(b, byName, baselines);
-        resolvedParent.set(b.name, parent);
-        if (b.parentBaseline && !parent) {
-            warnings.push(`Baseline "${b.name}" references nonexistent parent "${b.parentBaseline}"`);
-        }
-    }
-    // Build parent → children adjacency using resolved parents
-    const childrenMap = new Map();
-    for (const b of baselines) {
-        const parent = resolvedParent.get(b.name);
-        if (parent) {
-            const list = childrenMap.get(parent) || [];
-            list.push(b.name);
-            childrenMap.set(parent, list);
-        }
-    }
-    // Find roots: no resolved parent
-    const roots = [];
-    const visited = new Set();
-    for (const b of baselines) {
-        if (!resolvedParent.get(b.name)) {
-            roots.push(b.name);
-        }
-    }
-    // Mark reachable from roots (iterative DFS to avoid stack overflow on deep trees)
-    function markReachable(start) {
-        const stack = [start];
-        while (stack.length > 0) {
-            const name = stack.pop();
-            if (visited.has(name))
-                continue;
-            visited.add(name);
-            const children = childrenMap.get(name);
-            if (children) {
-                for (const child of children) {
-                    stack.push(child);
-                }
-            }
-        }
-    }
-    for (const r of roots) {
-        markReachable(r);
-    }
-    // Detect cycles: unvisited baselines are in cycles
-    for (const b of baselines) {
-        if (!visited.has(b.name)) {
-            warnings.push(`Circular parentBaseline detected involving "${b.name}"`);
-            roots.push(b.name);
-            markReachable(b.name);
-        }
-    }
-    // Process each root tree
-    const flatBaselines = [];
-    for (const rootName of roots) {
-        const root = byName.get(rootName);
-        const treeNames = collectTree(rootName, childrenMap);
-        if (treeNames.length === 1) {
-            // Standalone baseline — pass through unchanged (preserve depends)
-            flatBaselines.push(root);
-            continue;
-        }
-        // Bottom-up order: reverse top-down BFS
-        const bottomUp = [...treeNames].reverse();
-        // Merge requirements across the tree
-        const merged = new Map();
-        let controlsBefore = 0;
-        const absorbed = [];
-        for (const name of bottomUp) {
-            const b = byName.get(name);
-            controlsBefore += b.requirements.length;
-            if (name !== rootName) {
-                absorbed.push(name);
-            }
-            for (const req of b.requirements) {
-                if (merged.has(req.id)) {
-                    merged.set(req.id, mergeRequirement(merged.get(req.id), req));
-                }
-                else {
-                    merged.set(req.id, { ...req });
-                }
-            }
-        }
-        const mergedReqs = [...merged.values()];
-        const pattern = detectPattern(rootName, childrenMap);
-        merges.push({
-            rootBaseline: rootName,
-            absorbedBaselines: absorbed,
-            controlsBefore,
-            controlsAfter: mergedReqs.length,
-            pattern,
-        });
-        const out = {
-            ...root,
-            requirements: mergedReqs,
-        };
-        delete out.parentBaseline;
-        delete out.depends;
-        flatBaselines.push(out);
-    }
-    return {
-        results: { ...results, baselines: flatBaselines },
-        metadata: {
-            originalBaselineCount: baselines.length,
-            flattenedBaselineCount: flatBaselines.length,
-            merges,
-            warnings,
-        },
-    };
-}
-//# sourceMappingURL=flatten.js.map

package/dist/flatten.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"flatten.js","sourceRoot":"","sources":["../typescript/flatten.ts"],"names":[],"mappings":"AAwBA,8DAA8D;AAE9D,kEAAkE;AAClE,SAAS,WAAW,CAAC,IAAY,EAAE,WAAkC;IACnE,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC;IACrB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QAC5B,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,SAAS;QAC7B,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACf,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjB,KAAK,MAAM,KAAK,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC;YAClD,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACpB,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,iDAAiD;AACjD,SAAS,aAAa,CAAC,IAAY,EAAE,WAAkC;IACrE,MAAM,YAAY,GAAG,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;IACjD,IAAI,YAAY,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;QAC7B,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,KAAK,MAAM,KAAK,IAAI,YAAY,EAAE,CAAC;QACjC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC9C,OAAO,QAAQ,CAAC;QAClB,CAAC;IACH,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,sDAAsD;AACtD,SAAS,gBAAgB,CACvB,QAA8B,EAC9B,QAA8B;IAE9B,MAAM,MAAM,GAAyB,EAAE,GAAG,QAAQ,EAAE,CAAC;IAErD,gEAAgE;IAChE,MAAM,CAAC,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC;IAEhC,wEAAwE;IACxE,IAAI,QAAQ,CAAC,OAAO,IAAI,QAAQ,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACpD,MAAM,CAAC,OAAO,GAAG,QAAQ,CAAC,OAAO,CAAC;IACpC,CAAC;IAED,mCAAmC;IACnC,IAAI,QAAQ,CAAC,IAAI,IAAI,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;QACjD,MAAM,CAAC,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC;IAC9B,CAAC;IAED,+CAA+C;IAC/C,IAAI,QAAQ,CAAC,IAAI,EAAE,CAAC;QAClB,MAAM,CAAC,IAAI,GAAG,EAAE,GAAG,QAAQ,CAAC,IAAI,EAAE,GAAG,QAAQ,CAAC,IAAI,EAAE,CAAC;IACvD,CAAC;IAED,yDAAyD;IACzD,IAAI,QAAQ,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;QACpC,MAAM,CAAC,QAAQ,GAAG,QAAQ,CAAC,QAAQ,CAAC;IACtC,CAAC;IAED,uEAAuE;IACvE,+EAA+E;IAC/E,8EAA8E;IAC9E,IAAI,QAAQ,CAAC,eAAe,KAAK,SAAS,IAAI,QAAQ,CAAC,OAAO,IAAI,QAAQ,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC9F,MAAM,CAAC,eAAe,GAAG,QAAQ,CAAC,eAAe,CAAC;IACpD,CAAC;IAED,+DAA+D;IAC/D,IAAI,QAAQ,CAAC,YAAY,IAAI,QAAQ,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC9D,MAAM,OAAO,GAAG,IAAI,GAAG,CACrB,CAAC,QAAQ,CAAC,YAAY,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CACrD,CAAC;QACF,KAAK,MAAM,CAAC,IAAI,QAAQ,CAAC,YAAY,EAAE,CAAC;YACtC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAC1B,CAAC;QACD,MAAM,CAAC,YAAY,GAAG,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;IAC9C,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;GAKG;AACH,SAAS,qBAAqB,CAC5B,CAAoB,EACpB,MAAsC,EACtC,YAAiC;IAEjC,IAAI,CAAC,CAAC,CAAC,cAAc;QAAE,OAAO,SAAS,CAAC;IACxC,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,cAAc,CAAC;QAAE,OAAO,CAAC,CAAC,cAAc,CAAC;IAE1D,gFAAgF;IAChF,KAAK,MAAM,SAAS,IAAI,YAAY,EAAE,CAAC;QACrC,IAAI,SAAS,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;YACtD,OAAO,SAAS,CAAC,IAAI,CAAC;QACxB,CAAC;IACH,CAAC;IACD,OAAO,SAAS,CAAC,CAAC,SAAS;AAC7B,CAAC;AAED,+DAA+D;AAE/D;;;;;;;;;;GAUG;AACH,MAAM,UAAU,eAAe,CAAC,OAAmB;IACjD,MAAM,EAAE,SAAS,EAAE,GAAG,OAAO,CAAC;IAC9B,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,MAAM,MAAM,GAAoB,EAAE,CAAC;IAEnC,IAAI,CAAC,SAAS,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACzC,OAAO;YACL,OAAO,EAAE,EAAE,GAAG,OAAO,EAAE,SAAS,EAAE,EAAE,EAAE;YACtC,QAAQ,EAAE;gBACR,qBAAqB,EAAE,CAAC;gBACxB,sBAAsB,EAAE,CAAC;gBACzB,MAAM,EAAE,EAAE;gBACV,QAAQ,EAAE,EAAE;aACb;SACF,CAAC;IACJ,CAAC;IAED,0BAA0B;IAC1B,MAAM,MAAM,GAAG,IAAI,GAAG,EAA6B,CAAC;IACpD,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;QAC1B,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;YACvB,QAAQ,CAAC,IAAI,CAAC,4BAA4B,CAAC,CAAC,IAAI,oCAAoC,CAAC,CAAC;QACxF,CAAC;QACD,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IACxB,CAAC;IAED,sDAAsD;IACtD,MAAM,cAAc,GAAG,IAAI,GAAG,EAA8B,CAAC;IAC7D,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;QAC1B,MAAM,MAAM,GAAG,qBAAqB,CAAC,CAAC,EAAE,MAAM,EAAE,SAAS,CAAC,CAAC;QAC3D,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QACnC,IAAI,CAAC,CAAC,cAAc,IAAI,CAAC,MAAM,EAAE,CAAC;YAChC,QAAQ,CAAC,IAAI,CACX,aAAa,CAAC,CAAC,IAAI,oCAAoC,CAAC,CAAC,cAAc,GAAG,CAC3E,CAAC;QACJ,CAAC;IACH,CAAC;IAED,2DAA2D;IAC3D,MAAM,WAAW,GAAG,IAAI,GAAG,EAAoB,CAAC;IAChD,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;QAC1B,MAAM,MAAM,GAAG,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAC1C,IAAI,MAAM,EAAE,CAAC;YACX,MAAM,IAAI,GAAG,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;YAC3C,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YAClB,WAAW,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QAChC,CAAC;IACH,CAAC;IAED,iCAAiC;IACjC,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAElC,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;QAC1B,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;YAChC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACrB,CAAC;IACH,CAAC;IAED,kFAAkF;IAClF,SAAS,aAAa,CAAC,KAAa;QAClC,MAAM,KAAK,GAAG,CAAC,KAAK,CAAC,CAAC;QACtB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;YAC1B,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC;gBAAE,SAAS;YAChC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAClB,MAAM,QAAQ,GAAG,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACvC,IAAI,QAAQ,EAAE,CAAC;gBACb,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;oBAC7B,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACpB,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,aAAa,CAAC,CAAC,CAAC,CAAC;IACnB,CAAC;IAED,mDAAmD;IACnD,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;QAC1B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;YACzB,QAAQ,CAAC,IAAI,CAAC,+CAA+C,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC;YACxE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YACnB,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACxB,CAAC;IACH,CAAC;IAED,yBAAyB;IACzB,MAAM,aAAa,GAAwB,EAAE,CAAC;IAE9C,KAAK,MAAM,QAAQ,IAAI,KAAK,EAAE,CAAC;QAC7B,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC;QACnC,MAAM,SAAS,GAAG,WAAW,CAAC,QAAQ,EAAE,WAAW,CAAC,CAAC;QAErD,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC3B,kEAAkE;YAClE,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACzB,SAAS;QACX,CAAC;QAED,wCAAwC;QACxC,MAAM,QAAQ,GAAG,CAAC,GAAG,SAAS,CAAC,CAAC,OAAO,EAAE,CAAC;QAE1C,qCAAqC;QACrC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAgC,CAAC;QACvD,IAAI,cAAc,GAAG,CAAC,CAAC;QACvB,MAAM,QAAQ,GAAa,EAAE,CAAC;QAE9B,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC5B,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC;YAC5B,cAAc,IAAI,CAAC,CAAC,YAAY,CAAC,MAAM,CAAC;YACxC,IAAI,IAAI,KAAK,QAAQ,EAAE,CAAC;gBACtB,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACtB,CAAC;YACD,KAAK,MAAM,GAAG,IAAI,CAAC,CAAC,YAAY,EAAE,CAAC;gBACjC,IAAI,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;oBACvB,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,gBAAgB,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAE,EAAE,GAAG,CAAC,CAAC,CAAC;gBACjE,CAAC;qBAAM,CAAC;oBACN,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,GAAG,GAAG,EAAE,CAAC,CAAC;gBACjC,CAAC;YACH,CAAC;QACH,CAAC;QAED,MAAM,UAAU,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;QACxC,MAAM,OAAO,GAAG,aAAa,CAAC,QAAQ,EAAE,WAAW,CAAC,CAAC;QAErD,MAAM,CAAC,IAAI,CAAC;YACV,YAAY,EAAE,QAAQ;YACtB,iBAAiB,EAAE,QAAQ;YAC3B,cAAc;YACd,aAAa,EAAE,UAAU,CAAC,MAAM;YAChC,OAAO;SACR,CAAC,CAAC;QAEH,MAAM,GAAG,GAAsB;YAC7B,GAAG,IAAI;YACP,YAAY,EAAE,UAAU;SACzB,CAAC;QACF,OAAO,GAAG,CAAC,cAAc,CAAC;QAC1B,OAAO,GAAG,CAAC,OAAO,CAAC;QACnB,aAAa,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC1B,CAAC;IAED,OAAO;QACL,OAAO,EAAE,EAAE,GAAG,OAAO,EAAE,SAAS,EAAE,aAAa,EAAE;QACjD,QAAQ,EAAE;YACR,qBAAqB,EAAE,SAAS,CAAC,MAAM;YACvC,sBAAsB,EAAE,aAAa,CAAC,MAAM;YAC5C,MAAM;YACN,QAAQ;SACT;KACF,CAAC;AACJ,CAAC"}