@mitre/hdf-extension-graph 3.0.0 → 3.1.0-rc.1

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

@@ -1,8 +1,20 @@
 # @mitre/hdf-extension-graph
 
-Bidirectional extension graph processing for HDF baseline hierarchies. Builds a navigable graph from `HdfResults` files that reveals how baselines (profiles) and requirements (controls) relate across extension/overlay layers.
+Bidirectional extension graph processing for HDF baseline hierarchies.
 
-Ports the algorithm from Heimdall2's `context.ts` to the HDF v2 schema.
+## Why this exists
+
+HDF baseline documents can represent 'overlay' structures that form extension chains of parent baselines and their children. For example, a DISA STIG baseline defines hundreds of requirements; an organizational overlay on that DISA baseline can modify a subset for organization-specific policies; a project overlay can further tighten thresholds for a specific system. When an HDF results file contains multiple baselines linked via `parentBaseline`, understanding what each layer changed requires walking these chains bidirectionally.
+
+Without this library, answering "did this overlay change the impact of SV-238196, or inherit it unchanged?" requires manually cross-referencing requirements across baselines by ID. The extension graph provides:
+
+- **`root`** — jump from any overlay requirement to the original base definition
+- **`modifications`** — which fields (impact, title, severity, effectiveImpact, disposition) an overlay changed relative to its parent
+- **`isRedundant`** — whether an overlay re-declares a control without actually changing it
+- **`fullCode`** — the complete code from all layers in one string
+- **`extensionChain`** — the ordered list of baselines from root to leaf
+
+This is the same graph algorithm that powers Heimdall's control detail panel, extracted as a standalone library.
 
 ## Installation
 
@@ -139,6 +151,11 @@ interface Modification {
 }
 ```
 
+## Notes
+
+- **TypeScript only** — there is no Go implementation of hdf-extension-graph.
+- The HDF schemas consumed by this package are documented at <https://mitre.github.io/hdf-libs/schemas/>.
+
 ## License
 
 Apache-2.0

package/dist/index.d.ts

@@ -1,72 +1,74 @@
-import type { HdfResults, EvaluatedBaseline, EvaluatedRequirement } from '@mitre/hdf-schema';
+import { EvaluatedBaseline, EvaluatedRequirement, HdfResults } from "@mitre/hdf-schema";
+
+//#region src/index.d.ts
 /** A detected change between an overlay requirement and its parent. */
-export interface Modification {
-    field: string;
-    originalValue: unknown;
-    newValue: unknown;
-    inBaseline: string;
+interface Modification {
+  field: string;
+  originalValue: unknown;
+  newValue: unknown;
+  inBaseline: string;
 }
 /**
  * Wraps an EvaluatedRequirement with bidirectional extension links
  * and derived properties for navigating extension chains.
  */
-export declare class ContextualizedRequirement {
-    /** The original requirement data. */
-    readonly data: EvaluatedRequirement;
-    /** The baseline this requirement belongs to. */
-    readonly sourcedFrom: ContextualizedBaseline;
-    /** Requirements in parent baselines that this requirement extends (overlays). */
-    readonly extendsFrom: ContextualizedRequirement[];
-    /** Requirements in child baselines that extend this requirement. */
-    readonly extendedBy: ContextualizedRequirement[];
-    constructor(data: EvaluatedRequirement, sourcedFrom: ContextualizedBaseline);
-    /** The root (base) requirement at the bottom of the extension chain. */
-    get root(): ContextualizedRequirement;
-    /** True if this overlay adds no new code (empty/undefined or matches root). */
-    get isRedundant(): boolean;
-    /**
-     * Full code concatenated from all layers, with baseline name headers.
-     * Skips redundant overlay layers. Returns empty string if no code exists.
-     */
-    get fullCode(): string;
-    /** Ordered chain of baselines from root to this requirement's baseline. */
-    get extensionChain(): ContextualizedBaseline[];
-    /** Fields that differ between this requirement and its immediate parent. */
-    get modifications(): Modification[];
+declare class ContextualizedRequirement {
+  /** The original requirement data. */
+  readonly data: EvaluatedRequirement;
+  /** The baseline this requirement belongs to. */
+  readonly sourcedFrom: ContextualizedBaseline;
+  /** Requirements in parent baselines that this requirement extends (overlays). */
+  readonly extendsFrom: ContextualizedRequirement[];
+  /** Requirements in child baselines that extend this requirement. */
+  readonly extendedBy: ContextualizedRequirement[];
+  constructor(data: EvaluatedRequirement, sourcedFrom: ContextualizedBaseline);
+  /** The root (base) requirement at the bottom of the extension chain. */
+  get root(): ContextualizedRequirement;
+  /** True if this overlay adds no new code (empty/undefined or matches root). */
+  get isRedundant(): boolean;
+  /**
+   * Full code concatenated from all layers, with baseline name headers.
+   * Skips redundant overlay layers. Returns empty string if no code exists.
+   */
+  get fullCode(): string;
+  /** Ordered chain of baselines from root to this requirement's baseline. */
+  get extensionChain(): ContextualizedBaseline[];
+  /** Fields that differ between this requirement and its immediate parent. */
+  get modifications(): Modification[];
 }
 /**
  * Wraps an EvaluatedBaseline with bidirectional extension links
  * and contextualized requirements.
  */
-export declare class ContextualizedBaseline {
-    /** The original baseline data. */
-    readonly data: EvaluatedBaseline;
-    /** The HdfResults this baseline was sourced from. */
-    readonly sourcedFrom: HdfResults;
-    /** Parent baselines that this baseline extends. */
-    readonly extendsFrom: ContextualizedBaseline[];
-    /** Child baselines that extend this baseline. */
-    readonly extendedBy: ContextualizedBaseline[];
-    /** Contextualized wrappers for each requirement in this baseline. */
-    readonly requirements: ContextualizedRequirement[];
-    constructor(data: EvaluatedBaseline, sourcedFrom: HdfResults);
+declare class ContextualizedBaseline {
+  /** The original baseline data. */
+  readonly data: EvaluatedBaseline;
+  /** The HdfResults this baseline was sourced from. */
+  readonly sourcedFrom: HdfResults;
+  /** Parent baselines that this baseline extends. */
+  readonly extendsFrom: ContextualizedBaseline[];
+  /** Child baselines that extend this baseline. */
+  readonly extendedBy: ContextualizedBaseline[];
+  /** Contextualized wrappers for each requirement in this baseline. */
+  readonly requirements: ContextualizedRequirement[];
+  constructor(data: EvaluatedBaseline, sourcedFrom: HdfResults);
 }
 /**
  * A bidirectional extension graph built from an HDF Results file.
  * Contains all baselines and requirements with their extension relationships.
  */
-export declare class ExtensionGraph {
-    /** All contextualized baselines in the graph. */
-    readonly baselines: readonly ContextualizedBaseline[];
-    /** All contextualized requirements across all baselines. */
-    readonly requirements: readonly ContextualizedRequirement[];
-    constructor(baselines: readonly ContextualizedBaseline[], requirements: readonly ContextualizedRequirement[]);
-    /** Find a baseline by name. Returns undefined if not found. */
-    findBaseline(name: string): ContextualizedBaseline | undefined;
-    /** Find all requirements with the given id across all baselines. */
-    findRequirements(id: string): ContextualizedRequirement[];
-    /** Baselines that have no parent (root of extension chains). */
-    get rootBaselines(): ContextualizedBaseline[];
+declare class ExtensionGraph {
+  /** All contextualized baselines in the graph. */
+  readonly baselines: readonly ContextualizedBaseline[];
+  /** All contextualized requirements across all baselines. */
+  readonly requirements: readonly ContextualizedRequirement[];
+  constructor(baselines: readonly ContextualizedBaseline[], requirements: readonly ContextualizedRequirement[]);
+  /** Find a baseline by name. Returns undefined if not found. */
+  findBaseline(name: string): ContextualizedBaseline | undefined;
+  /** Find all requirements with the given id across all baselines. */
+  findRequirements(id: string): ContextualizedRequirement[];
+  /** Baselines that have no parent (root of extension chains). */
+  get rootBaselines(): ContextualizedBaseline[];
 }
 /**
  * Build a bidirectional extension graph from an HDF Results file.
@@ -77,5 +79,7 @@ export declare class ExtensionGraph {
  * 3. Collect all requirements into a flat array
  * 4. Link requirements by id matching across linked baselines
  */
-export declare function buildExtensionGraph(results: HdfResults): ExtensionGraph;
+declare function buildExtensionGraph(results: HdfResults): ExtensionGraph;
+//#endregion
+export { ContextualizedBaseline, ContextualizedRequirement, ExtensionGraph, Modification, buildExtensionGraph };
 //# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAE,iBAAiB,EAAE,oBAAoB,EAAE,MAAM,mBAAmB,CAAC;AAK7F,uEAAuE;AACvE,MAAM,WAAW,YAAY;IAC3B,KAAK,EAAE,MAAM,CAAC;IACd,aAAa,EAAE,OAAO,CAAC;IACvB,QAAQ,EAAE,OAAO,CAAC;IAClB,UAAU,EAAE,MAAM,CAAC;CACpB;AAED;;;GAGG;AACH,qBAAa,yBAAyB;IACpC,qCAAqC;IACrC,QAAQ,CAAC,IAAI,EAAE,oBAAoB,CAAC;IAEpC,gDAAgD;IAChD,QAAQ,CAAC,WAAW,EAAE,sBAAsB,CAAC;IAE7C,iFAAiF;IACjF,QAAQ,CAAC,WAAW,EAAE,yBAAyB,EAAE,CAAM;IAEvD,oEAAoE;IACpE,QAAQ,CAAC,UAAU,EAAE,yBAAyB,EAAE,CAAM;gBAE1C,IAAI,EAAE,oBAAoB,EAAE,WAAW,EAAE,sBAAsB;IAK3E,wEAAwE;IACxE,IAAI,IAAI,IAAI,yBAAyB,CAMpC;IAED,+EAA+E;IAC/E,IAAI,WAAW,IAAI,OAAO,CASzB;IAED;;;OAGG;IACH,IAAI,QAAQ,IAAI,MAAM,CAcrB;IAED,2EAA2E;IAC3E,IAAI,cAAc,IAAI,sBAAsB,EAAE,CAK7C;IAED,4EAA4E;IAC5E,IAAI,aAAa,IAAI,YAAY,EAAE,CAmBlC;CACF;AAED;;;GAGG;AACH,qBAAa,sBAAsB;IACjC,kCAAkC;IAClC,QAAQ,CAAC,IAAI,EAAE,iBAAiB,CAAC;IAEjC,qDAAqD;IACrD,QAAQ,CAAC,WAAW,EAAE,UAAU,CAAC;IAEjC,mDAAmD;IACnD,QAAQ,CAAC,WAAW,EAAE,sBAAsB,EAAE,CAAM;IAEpD,iDAAiD;IACjD,QAAQ,CAAC,UAAU,EAAE,sBAAsB,EAAE,CAAM;IAEnD,qEAAqE;IACrE,QAAQ,CAAC,YAAY,EAAE,yBAAyB,EAAE,CAAC;gBAEvC,IAAI,EAAE,iBAAiB,EAAE,WAAW,EAAE,UAAU;CAO7D;AAED;;;GAGG;AACH,qBAAa,cAAc;IACzB,iDAAiD;IACjD,QAAQ,CAAC,SAAS,EAAE,SAAS,sBAAsB,EAAE,CAAC;IAEtD,4DAA4D;IAC5D,QAAQ,CAAC,YAAY,EAAE,SAAS,yBAAyB,EAAE,CAAC;gBAG1D,SAAS,EAAE,SAAS,sBAAsB,EAAE,EAC5C,YAAY,EAAE,SAAS,yBAAyB,EAAE;IAMpD,+DAA+D;IAC/D,YAAY,CAAC,IAAI,EAAE,MAAM,GAAG,sBAAsB,GAAG,SAAS;IAI9D,oEAAoE;IACpE,gBAAgB,CAAC,EAAE,EAAE,MAAM,GAAG,yBAAyB,EAAE;IAIzD,gEAAgE;IAChE,IAAI,aAAa,IAAI,sBAAsB,EAAE,CAE5C;CACF;AAED;;;;;;;;GAQG;AACH,wBAAgB,mBAAmB,CAAC,OAAO,EAAE,UAAU,GAAG,cAAc,CAgDvE"}
+{"version":3,"file":"index.d.ts","names":[],"sources":["../src/index.ts"],"mappings":";;;;UAMiB,YAAA;EACf,KAAA;EACA,aAAA;EACA,QAAA;EACA,UAAA;AAAA;;;;;cAOW,yBAAA;EAAA;EAAA,SAEF,IAAA,EAAM,oBAAA;;WAGN,WAAA,EAAa,sBAAA;EAAA;EAAA,SAGb,WAAA,EAAa,yBAAA;EAGD;EAAA,SAAZ,UAAA,EAAY,yBAAA;cAET,IAAA,EAAM,oBAAA,EAAsB,WAAA,EAAa,sBAAA;EAMzC;EAAA,IAAR,IAAA,CAAA,GAAQ,yBAAA;EAiDS;EAAA,IAxCjB,WAAA,CAAA;EAwC6B;;;;EAAA,IAzB7B,QAAA,CAAA;EAnCK;EAAA,IAoDL,cAAA,CAAA,GAAkB,sBAAA;EAjDb;EAAA,IAyDL,aAAA,CAAA,GAAiB,YAAA;AAAA;;;;;cA0BV,sBAAA;EA3EC;EAAA,SA6EH,IAAA,EAAM,iBAAA;EArDX;EAAA,SAwDK,WAAA,EAAa,UAAA;EAvCA;EAAA,SA0Cb,WAAA,EAAa,sBAAA;EAlCD;EAAA,SAqCZ,UAAA,EAAY,sBAAA;EArCY;EAAA,SAwCxB,YAAA,EAAc,yBAAA;cAEX,IAAA,EAAM,iBAAA,EAAmB,WAAA,EAAa,UAAA;AAAA;;;;;cAavC,cAAA;EAbO;EAAA,SAeT,SAAA,WAAoB,sBAAA;EAf+B;EAAA,SAkBnD,YAAA,WAAuB,yBAAA;cAG9B,SAAA,WAAoB,sBAAA,IACpB,YAAA,WAAuB,yBAAA;EApCV;EA2Cf,YAAA,CAAa,IAAA,WAAe,sBAAA;EAxCN;EA6CtB,gBAAA,CAAiB,EAAA,WAAa,yBAAA;EA1CR;EAAA,IA+ClB,aAAA,CAAA,GAAiB,sBAAA;AAAA;;;;;;;;;;iBAcP,mBAAA,CAAoB,OAAA,EAAS,UAAA,GAAa,cAAA"}

package/dist/index.js

@@ -1,171 +1,148 @@
+//#region src/index.ts
 /** Fields compared for modification detection between overlay and parent. */
-const TRACKED_FIELDS = ['impact', 'title', 'severity'];
+const TRACKED_FIELDS = [
+	"impact",
+	"title",
+	"severity",
+	"effectiveImpact",
+	"disposition"
+];
 /**
- * Wraps an EvaluatedRequirement with bidirectional extension links
- * and derived properties for navigating extension chains.
- */
-export class ContextualizedRequirement {
-    constructor(data, sourcedFrom) {
-        /** Requirements in parent baselines that this requirement extends (overlays). */
-        this.extendsFrom = [];
-        /** Requirements in child baselines that extend this requirement. */
-        this.extendedBy = [];
-        this.data = data;
-        this.sourcedFrom = sourcedFrom;
-    }
-    /** The root (base) requirement at the bottom of the extension chain. */
-    get root() {
-        if (this.extendsFrom.length === 0) {
-            return this;
-        }
-        // Walk to the first parent's root (first match, like Heimdall2)
-        return this.extendsFrom[0].root;
-    }
-    /** True if this overlay adds no new code (empty/undefined or matches root). */
-    get isRedundant() {
-        if (this.extendsFrom.length === 0) {
-            return false;
-        }
-        const code = this.data.code;
-        if (!code) {
-            return true;
-        }
-        return code === this.root.data.code;
-    }
-    /**
-     * Full code concatenated from all layers, with baseline name headers.
-     * Skips redundant overlay layers. Returns empty string if no code exists.
-     */
-    get fullCode() {
-        if (this.isRedundant && this.extendsFrom.length > 0) {
-            return this.extendsFrom[0].fullCode;
-        }
-        const code = this.data.code;
-        if (!code) {
-            return '';
-        }
-        const header = `# ${this.sourcedFrom.data.name}\n${code}`;
-        if (this.extendsFrom.length === 0) {
-            return header;
-        }
-        const parentCode = this.extendsFrom[0].fullCode;
-        return parentCode ? `${header}\n\n${parentCode}` : header;
-    }
-    /** Ordered chain of baselines from root to this requirement's baseline. */
-    get extensionChain() {
-        if (this.extendsFrom.length === 0) {
-            return [this.sourcedFrom];
-        }
-        return [...this.extendsFrom[0].extensionChain, this.sourcedFrom];
-    }
-    /** Fields that differ between this requirement and its immediate parent. */
-    get modifications() {
-        if (this.extendsFrom.length === 0) {
-            return [];
-        }
-        const parent = this.extendsFrom[0];
-        const mods = [];
-        for (const field of TRACKED_FIELDS) {
-            const parentVal = parent.data[field];
-            const thisVal = this.data[field];
-            if (parentVal !== thisVal) {
-                mods.push({
-                    field,
-                    originalValue: parentVal,
-                    newValue: thisVal,
-                    inBaseline: this.sourcedFrom.data.name,
-                });
-            }
-        }
-        return mods;
-    }
-}
+* Wraps an EvaluatedRequirement with bidirectional extension links
+* and derived properties for navigating extension chains.
+*/
+var ContextualizedRequirement = class {
+	constructor(data, sourcedFrom) {
+		this.extendsFrom = [];
+		this.extendedBy = [];
+		this.data = data;
+		this.sourcedFrom = sourcedFrom;
+	}
+	/** The root (base) requirement at the bottom of the extension chain. */
+	get root() {
+		if (this.extendsFrom.length === 0) return this;
+		return this.extendsFrom[0].root;
+	}
+	/** True if this overlay adds no new code (empty/undefined or matches root). */
+	get isRedundant() {
+		if (this.extendsFrom.length === 0) return false;
+		const code = this.data.code;
+		if (!code) return true;
+		return code === this.root.data.code;
+	}
+	/**
+	* Full code concatenated from all layers, with baseline name headers.
+	* Skips redundant overlay layers. Returns empty string if no code exists.
+	*/
+	get fullCode() {
+		if (this.isRedundant && this.extendsFrom.length > 0) return this.extendsFrom[0].fullCode;
+		const code = this.data.code;
+		if (!code) return "";
+		const header = `# ${this.sourcedFrom.data.name}\n${code}`;
+		if (this.extendsFrom.length === 0) return header;
+		const parentCode = this.extendsFrom[0].fullCode;
+		return parentCode ? `${header}\n\n${parentCode}` : header;
+	}
+	/** Ordered chain of baselines from root to this requirement's baseline. */
+	get extensionChain() {
+		if (this.extendsFrom.length === 0) return [this.sourcedFrom];
+		return [...this.extendsFrom[0].extensionChain, this.sourcedFrom];
+	}
+	/** Fields that differ between this requirement and its immediate parent. */
+	get modifications() {
+		if (this.extendsFrom.length === 0) return [];
+		const parent = this.extendsFrom[0];
+		const mods = [];
+		for (const field of TRACKED_FIELDS) {
+			const parentVal = parent.data[field];
+			const thisVal = this.data[field];
+			if (parentVal !== thisVal) mods.push({
+				field,
+				originalValue: parentVal,
+				newValue: thisVal,
+				inBaseline: this.sourcedFrom.data.name
+			});
+		}
+		return mods;
+	}
+};
 /**
- * Wraps an EvaluatedBaseline with bidirectional extension links
- * and contextualized requirements.
- */
-export class ContextualizedBaseline {
-    constructor(data, sourcedFrom) {
-        /** Parent baselines that this baseline extends. */
-        this.extendsFrom = [];
-        /** Child baselines that extend this baseline. */
-        this.extendedBy = [];
-        this.data = data;
-        this.sourcedFrom = sourcedFrom;
-        this.requirements = data.requirements.map((req) => new ContextualizedRequirement(req, this));
-    }
-}
+* Wraps an EvaluatedBaseline with bidirectional extension links
+* and contextualized requirements.
+*/
+var ContextualizedBaseline = class {
+	constructor(data, sourcedFrom) {
+		this.extendsFrom = [];
+		this.extendedBy = [];
+		this.data = data;
+		this.sourcedFrom = sourcedFrom;
+		this.requirements = data.requirements.map((req) => new ContextualizedRequirement(req, this));
+	}
+};
 /**
- * A bidirectional extension graph built from an HDF Results file.
- * Contains all baselines and requirements with their extension relationships.
- */
-export class ExtensionGraph {
-    constructor(baselines, requirements) {
-        this.baselines = baselines;
-        this.requirements = requirements;
-    }
-    /** Find a baseline by name. Returns undefined if not found. */
-    findBaseline(name) {
-        return this.baselines.find((b) => b.data.name === name);
-    }
-    /** Find all requirements with the given id across all baselines. */
-    findRequirements(id) {
-        return this.requirements.filter((r) => r.data.id === id);
-    }
-    /** Baselines that have no parent (root of extension chains). */
-    get rootBaselines() {
-        return this.baselines.filter((b) => !b.data.parentBaseline);
-    }
-}
+* A bidirectional extension graph built from an HDF Results file.
+* Contains all baselines and requirements with their extension relationships.
+*/
+var ExtensionGraph = class {
+	constructor(baselines, requirements) {
+		this.baselines = baselines;
+		this.requirements = requirements;
+	}
+	/** Find a baseline by name. Returns undefined if not found. */
+	findBaseline(name) {
+		return this.baselines.find((b) => b.data.name === name);
+	}
+	/** Find all requirements with the given id across all baselines. */
+	findRequirements(id) {
+		return this.requirements.filter((r) => r.data.id === id);
+	}
+	/** Baselines that have no parent (root of extension chains). */
+	get rootBaselines() {
+		return this.baselines.filter((b) => !b.data.parentBaseline);
+	}
+};
 /**
- * Build a bidirectional extension graph from an HDF Results file.
- *
- * Four phases:
- * 1. Wrap each EvaluatedBaseline in a ContextualizedBaseline
- * 2. Link baselines via parentBaseline name matching (bidirectional)
- * 3. Collect all requirements into a flat array
- * 4. Link requirements by id matching across linked baselines
- */
-export function buildExtensionGraph(results) {
-    // Phase 1: Wrap baselines
-    const baselineMap = new Map();
-    const baselines = [];
-    for (const baseline of results.baselines) {
-        const ctx = new ContextualizedBaseline(baseline, results);
-        baselines.push(ctx);
-        baselineMap.set(baseline.name, ctx);
-    }
-    // Phase 2: Link baselines via parentBaseline
-    for (const ctx of baselines) {
-        const parentName = ctx.data.parentBaseline;
-        if (parentName) {
-            const parent = baselineMap.get(parentName);
-            if (parent) {
-                ctx.extendsFrom.push(parent);
-                parent.extendedBy.push(ctx);
-            }
-        }
-    }
-    // Phase 3: Collect all requirements
-    const allRequirements = [];
-    for (const ctx of baselines) {
-        allRequirements.push(...ctx.requirements);
-    }
-    // Phase 4: Link requirements by id across linked baselines
-    for (const ctx of baselines) {
-        if (ctx.extendsFrom.length === 0) {
-            continue;
-        }
-        for (const childReq of ctx.requirements) {
-            for (const parentBaseline of ctx.extendsFrom) {
-                const parentReq = parentBaseline.requirements.find((r) => r.data.id === childReq.data.id);
-                if (parentReq) {
-                    childReq.extendsFrom.push(parentReq);
-                    parentReq.extendedBy.push(childReq);
-                }
-            }
-        }
-    }
-    return new ExtensionGraph(baselines, allRequirements);
+* Build a bidirectional extension graph from an HDF Results file.
+*
+* Four phases:
+* 1. Wrap each EvaluatedBaseline in a ContextualizedBaseline
+* 2. Link baselines via parentBaseline name matching (bidirectional)
+* 3. Collect all requirements into a flat array
+* 4. Link requirements by id matching across linked baselines
+*/
+function buildExtensionGraph(results) {
+	const baselineMap = /* @__PURE__ */ new Map();
+	const baselines = [];
+	for (const baseline of results.baselines) {
+		const ctx = new ContextualizedBaseline(baseline, results);
+		baselines.push(ctx);
+		baselineMap.set(baseline.name, ctx);
+	}
+	for (const ctx of baselines) {
+		const parentName = ctx.data.parentBaseline;
+		if (parentName) {
+			const parent = baselineMap.get(parentName);
+			if (parent) {
+				ctx.extendsFrom.push(parent);
+				parent.extendedBy.push(ctx);
+			}
+		}
+	}
+	const allRequirements = [];
+	for (const ctx of baselines) allRequirements.push(...ctx.requirements);
+	for (const ctx of baselines) {
+		if (ctx.extendsFrom.length === 0) continue;
+		for (const childReq of ctx.requirements) for (const parentBaseline of ctx.extendsFrom) {
+			const parentReq = parentBaseline.requirements.find((r) => r.data.id === childReq.data.id);
+			if (parentReq) {
+				childReq.extendsFrom.push(parentReq);
+				parentReq.extendedBy.push(childReq);
+			}
+		}
+	}
+	return new ExtensionGraph(baselines, allRequirements);
 }
+//#endregion
+export { ContextualizedBaseline, ContextualizedRequirement, ExtensionGraph, buildExtensionGraph };
+
 //# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAEA,6EAA6E;AAC7E,MAAM,cAAc,GAAsB,CAAC,QAAQ,EAAE,OAAO,EAAE,UAAU,CAAU,CAAC;AAUnF;;;GAGG;AACH,MAAM,OAAO,yBAAyB;IAapC,YAAY,IAA0B,EAAE,WAAmC;QAN3E,iFAAiF;QACxE,gBAAW,GAAgC,EAAE,CAAC;QAEvD,oEAAoE;QAC3D,eAAU,GAAgC,EAAE,CAAC;QAGpD,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;IACjC,CAAC;IAED,wEAAwE;IACxE,IAAI,IAAI;QACN,IAAI,IAAI,CAAC,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAClC,OAAO,IAAI,CAAC;QACd,CAAC;QACD,gEAAgE;QAChE,OAAO,IAAI,CAAC,WAAW,CAAC,CAAC,CAAE,CAAC,IAAI,CAAC;IACnC,CAAC;IAED,+EAA+E;IAC/E,IAAI,WAAW;QACb,IAAI,IAAI,CAAC,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAClC,OAAO,KAAK,CAAC;QACf,CAAC;QACD,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;QAC5B,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,IAAI,KAAK,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;IACtC,CAAC;IAED;;;OAGG;IACH,IAAI,QAAQ;QACV,IAAI,IAAI,CAAC,WAAW,IAAI,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACpD,OAAO,IAAI,CAAC,WAAW,CAAC,CAAC,CAAE,CAAC,QAAQ,CAAC;QACvC,CAAC;QACD,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;QAC5B,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,OAAO,EAAE,CAAC;QACZ,CAAC;QACD,MAAM,MAAM,GAAG,KAAK,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;QAC1D,IAAI,IAAI,CAAC,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAClC,OAAO,MAAM,CAAC;QAChB,CAAC;QACD,MAAM,UAAU,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,CAAE,CAAC,QAAQ,CAAC;QACjD,OAAO,UAAU,CAAC,CAAC,CAAC,GAAG,MAAM,OAAO,UAAU,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC;IAC5D,CAAC;IAED,2EAA2E;IAC3E,IAAI,cAAc;QAChB,IAAI,IAAI,CAAC,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAClC,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QAC5B,CAAC;QACD,OAAO,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,CAAE,CAAC,cAAc,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;IACpE,CAAC;IAED,4EAA4E;IAC5E,IAAI,aAAa;QACf,IAAI,IAAI,CAAC,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAClC,OAAO,EAAE,CAAC;QACZ,CAAC;QACD,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,CAAE,CAAC;QACpC,MAAM,IAAI,GAAmB,EAAE,CAAC;QAChC,KAAK,MAAM,KAAK,IAAI,cAAc,EAAE,CAAC;YACnC,MAAM,SAAS,GAAI,MAAM,CAAC,IAAgC,CAAC,KAAK,CAAC,CAAC;YAClE,MAAM,OAAO,GAAI,IAAI,CAAC,IAAgC,CAAC,KAAK,CAAC,CAAC;YAC9D,IAAI,SAAS,KAAK,OAAO,EAAE,CAAC;gBAC1B,IAAI,CAAC,IAAI,CAAC;oBACR,KAAK;oBACL,aAAa,EAAE,SAAS;oBACxB,QAAQ,EAAE,OAAO;oBACjB,UAAU,EAAE,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI;iBACvC,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;CACF;AAED;;;GAGG;AACH,MAAM,OAAO,sBAAsB;IAgBjC,YAAY,IAAuB,EAAE,WAAuB;QAT5D,mDAAmD;QAC1C,gBAAW,GAA6B,EAAE,CAAC;QAEpD,iDAAiD;QACxC,eAAU,GAA6B,EAAE,CAAC;QAMjD,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;QAC/B,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CACvC,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,yBAAyB,CAAC,GAAG,EAAE,IAAI,CAAC,CAClD,CAAC;IACJ,CAAC;CACF;AAED;;;GAGG;AACH,MAAM,OAAO,cAAc;IAOzB,YACE,SAA4C,EAC5C,YAAkD;QAElD,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,IAAI,CAAC,YAAY,GAAG,YAAY,CAAC;IACnC,CAAC;IAED,+DAA+D;IAC/D,YAAY,CAAC,IAAY;QACvB,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC;IAC1D,CAAC;IAED,oEAAoE;IACpE,gBAAgB,CAAC,EAAU;QACzB,OAAO,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;IAC3D,CAAC;IAED,gEAAgE;IAChE,IAAI,aAAa;QACf,OAAO,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;IAC9D,CAAC;CACF;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,mBAAmB,CAAC,OAAmB;IACrD,0BAA0B;IAC1B,MAAM,WAAW,GAAG,IAAI,GAAG,EAAkC,CAAC;IAC9D,MAAM,SAAS,GAA6B,EAAE,CAAC;IAE/C,KAAK,MAAM,QAAQ,IAAI,OAAO,CAAC,SAAS,EAAE,CAAC;QACzC,MAAM,GAAG,GAAG,IAAI,sBAAsB,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;QAC1D,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACpB,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;IACtC,CAAC;IAED,6CAA6C;IAC7C,KAAK,MAAM,GAAG,IAAI,SAAS,EAAE,CAAC;QAC5B,MAAM,UAAU,GAAG,GAAG,CAAC,IAAI,CAAC,cAAc,CAAC;QAC3C,IAAI,UAAU,EAAE,CAAC;YACf,MAAM,MAAM,GAAG,WAAW,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;YAC3C,IAAI,MAAM,EAAE,CAAC;gBACX,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBAC7B,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAC9B,CAAC;QACH,CAAC;IACH,CAAC;IAED,oCAAoC;IACpC,MAAM,eAAe,GAAgC,EAAE,CAAC;IACxD,KAAK,MAAM,GAAG,IAAI,SAAS,EAAE,CAAC;QAC5B,eAAe,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,YAAY,CAAC,CAAC;IAC5C,CAAC;IAED,2DAA2D;IAC3D,KAAK,MAAM,GAAG,IAAI,SAAS,EAAE,CAAC;QAC5B,IAAI,GAAG,CAAC,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACjC,SAAS;QACX,CAAC;QACD,KAAK,MAAM,QAAQ,IAAI,GAAG,CAAC,YAAY,EAAE,CAAC;YACxC,KAAK,MAAM,cAAc,IAAI,GAAG,CAAC,WAAW,EAAE,CAAC;gBAC7C,MAAM,SAAS,GAAG,cAAc,CAAC,YAAY,CAAC,IAAI,CAChD,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,KAAK,QAAQ,CAAC,IAAI,CAAC,EAAE,CACtC,CAAC;gBACF,IAAI,SAAS,EAAE,CAAC;oBACd,QAAQ,CAAC,WAAW,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;oBACrC,SAAS,CAAC,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBACtC,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,IAAI,cAAc,CAAC,SAAS,EAAE,eAAe,CAAC,CAAC;AACxD,CAAC"}
+{"version":3,"file":"index.js","names":[],"sources":["../src/index.ts"],"sourcesContent":["import type { HdfResults, EvaluatedBaseline, EvaluatedRequirement } from '@mitre/hdf-schema';\n\n/** Fields compared for modification detection between overlay and parent. */\nconst TRACKED_FIELDS: readonly (string & keyof EvaluatedRequirement)[] = ['impact', 'title', 'severity', 'effectiveImpact', 'disposition'];\n\n/** A detected change between an overlay requirement and its parent. */\nexport interface Modification {\n  field: string;\n  originalValue: unknown;\n  newValue: unknown;\n  inBaseline: string;\n}\n\n/**\n * Wraps an EvaluatedRequirement with bidirectional extension links\n * and derived properties for navigating extension chains.\n */\nexport class ContextualizedRequirement {\n  /** The original requirement data. */\n  readonly data: EvaluatedRequirement;\n\n  /** The baseline this requirement belongs to. */\n  readonly sourcedFrom: ContextualizedBaseline;\n\n  /** Requirements in parent baselines that this requirement extends (overlays). */\n  readonly extendsFrom: ContextualizedRequirement[] = [];\n\n  /** Requirements in child baselines that extend this requirement. */\n  readonly extendedBy: ContextualizedRequirement[] = [];\n\n  constructor(data: EvaluatedRequirement, sourcedFrom: ContextualizedBaseline) {\n    this.data = data;\n    this.sourcedFrom = sourcedFrom;\n  }\n\n  /** The root (base) requirement at the bottom of the extension chain. */\n  get root(): ContextualizedRequirement {\n    if (this.extendsFrom.length === 0) {\n      return this;\n    }\n    // Walk to the first parent's root (first match, like Heimdall2)\n    return this.extendsFrom[0]!.root;\n  }\n\n  /** True if this overlay adds no new code (empty/undefined or matches root). */\n  get isRedundant(): boolean {\n    if (this.extendsFrom.length === 0) {\n      return false;\n    }\n    const code = this.data.code;\n    if (!code) {\n      return true;\n    }\n    return code === this.root.data.code;\n  }\n\n  /**\n   * Full code concatenated from all layers, with baseline name headers.\n   * Skips redundant overlay layers. Returns empty string if no code exists.\n   */\n  get fullCode(): string {\n    if (this.isRedundant && this.extendsFrom.length > 0) {\n      return this.extendsFrom[0]!.fullCode;\n    }\n    const code = this.data.code;\n    if (!code) {\n      return '';\n    }\n    const header = `# ${this.sourcedFrom.data.name}\\n${code}`;\n    if (this.extendsFrom.length === 0) {\n      return header;\n    }\n    const parentCode = this.extendsFrom[0]!.fullCode;\n    return parentCode ? `${header}\\n\\n${parentCode}` : header;\n  }\n\n  /** Ordered chain of baselines from root to this requirement's baseline. */\n  get extensionChain(): ContextualizedBaseline[] {\n    if (this.extendsFrom.length === 0) {\n      return [this.sourcedFrom];\n    }\n    return [...this.extendsFrom[0]!.extensionChain, this.sourcedFrom];\n  }\n\n  /** Fields that differ between this requirement and its immediate parent. */\n  get modifications(): Modification[] {\n    if (this.extendsFrom.length === 0) {\n      return [];\n    }\n    const parent = this.extendsFrom[0]!;\n    const mods: Modification[] = [];\n    for (const field of TRACKED_FIELDS) {\n      const parentVal = (parent.data as Record<string, unknown>)[field];\n      const thisVal = (this.data as Record<string, unknown>)[field];\n      if (parentVal !== thisVal) {\n        mods.push({\n          field,\n          originalValue: parentVal,\n          newValue: thisVal,\n          inBaseline: this.sourcedFrom.data.name,\n        });\n      }\n    }\n    return mods;\n  }\n}\n\n/**\n * Wraps an EvaluatedBaseline with bidirectional extension links\n * and contextualized requirements.\n */\nexport class ContextualizedBaseline {\n  /** The original baseline data. */\n  readonly data: EvaluatedBaseline;\n\n  /** The HdfResults this baseline was sourced from. */\n  readonly sourcedFrom: HdfResults;\n\n  /** Parent baselines that this baseline extends. */\n  readonly extendsFrom: ContextualizedBaseline[] = [];\n\n  /** Child baselines that extend this baseline. */\n  readonly extendedBy: ContextualizedBaseline[] = [];\n\n  /** Contextualized wrappers for each requirement in this baseline. */\n  readonly requirements: ContextualizedRequirement[];\n\n  constructor(data: EvaluatedBaseline, sourcedFrom: HdfResults) {\n    this.data = data;\n    this.sourcedFrom = sourcedFrom;\n    this.requirements = data.requirements.map(\n      (req) => new ContextualizedRequirement(req, this)\n    );\n  }\n}\n\n/**\n * A bidirectional extension graph built from an HDF Results file.\n * Contains all baselines and requirements with their extension relationships.\n */\nexport class ExtensionGraph {\n  /** All contextualized baselines in the graph. */\n  readonly baselines: readonly ContextualizedBaseline[];\n\n  /** All contextualized requirements across all baselines. */\n  readonly requirements: readonly ContextualizedRequirement[];\n\n  constructor(\n    baselines: readonly ContextualizedBaseline[],\n    requirements: readonly ContextualizedRequirement[]\n  ) {\n    this.baselines = baselines;\n    this.requirements = requirements;\n  }\n\n  /** Find a baseline by name. Returns undefined if not found. */\n  findBaseline(name: string): ContextualizedBaseline | undefined {\n    return this.baselines.find((b) => b.data.name === name);\n  }\n\n  /** Find all requirements with the given id across all baselines. */\n  findRequirements(id: string): ContextualizedRequirement[] {\n    return this.requirements.filter((r) => r.data.id === id);\n  }\n\n  /** Baselines that have no parent (root of extension chains). */\n  get rootBaselines(): ContextualizedBaseline[] {\n    return this.baselines.filter((b) => !b.data.parentBaseline);\n  }\n}\n\n/**\n * Build a bidirectional extension graph from an HDF Results file.\n *\n * Four phases:\n * 1. Wrap each EvaluatedBaseline in a ContextualizedBaseline\n * 2. Link baselines via parentBaseline name matching (bidirectional)\n * 3. Collect all requirements into a flat array\n * 4. Link requirements by id matching across linked baselines\n */\nexport function buildExtensionGraph(results: HdfResults): ExtensionGraph {\n  // Phase 1: Wrap baselines\n  const baselineMap = new Map<string, ContextualizedBaseline>();\n  const baselines: ContextualizedBaseline[] = [];\n\n  for (const baseline of results.baselines) {\n    const ctx = new ContextualizedBaseline(baseline, results);\n    baselines.push(ctx);\n    baselineMap.set(baseline.name, ctx);\n  }\n\n  // Phase 2: Link baselines via parentBaseline\n  for (const ctx of baselines) {\n    const parentName = ctx.data.parentBaseline;\n    if (parentName) {\n      const parent = baselineMap.get(parentName);\n      if (parent) {\n        ctx.extendsFrom.push(parent);\n        parent.extendedBy.push(ctx);\n      }\n    }\n  }\n\n  // Phase 3: Collect all requirements\n  const allRequirements: ContextualizedRequirement[] = [];\n  for (const ctx of baselines) {\n    allRequirements.push(...ctx.requirements);\n  }\n\n  // Phase 4: Link requirements by id across linked baselines\n  for (const ctx of baselines) {\n    if (ctx.extendsFrom.length === 0) {\n      continue;\n    }\n    for (const childReq of ctx.requirements) {\n      for (const parentBaseline of ctx.extendsFrom) {\n        const parentReq = parentBaseline.requirements.find(\n          (r) => r.data.id === childReq.data.id\n        );\n        if (parentReq) {\n          childReq.extendsFrom.push(parentReq);\n          parentReq.extendedBy.push(childReq);\n        }\n      }\n    }\n  }\n\n  return new ExtensionGraph(baselines, allRequirements);\n}\n"],"mappings":";;AAGA,MAAM,iBAAmE;CAAC;CAAU;CAAS;CAAY;CAAmB;CAAc;;;;;AAc1I,IAAa,4BAAb,MAAuC;CAarC,YAAY,MAA4B,aAAqC;qBALzB,EAAE;oBAGH,EAAE;AAGnD,OAAK,OAAO;AACZ,OAAK,cAAc;;;CAIrB,IAAI,OAAkC;AACpC,MAAI,KAAK,YAAY,WAAW,EAC9B,QAAO;AAGT,SAAO,KAAK,YAAY,GAAI;;;CAI9B,IAAI,cAAuB;AACzB,MAAI,KAAK,YAAY,WAAW,EAC9B,QAAO;EAET,MAAM,OAAO,KAAK,KAAK;AACvB,MAAI,CAAC,KACH,QAAO;AAET,SAAO,SAAS,KAAK,KAAK,KAAK;;;;;;CAOjC,IAAI,WAAmB;AACrB,MAAI,KAAK,eAAe,KAAK,YAAY,SAAS,EAChD,QAAO,KAAK,YAAY,GAAI;EAE9B,MAAM,OAAO,KAAK,KAAK;AACvB,MAAI,CAAC,KACH,QAAO;EAET,MAAM,SAAS,KAAK,KAAK,YAAY,KAAK,KAAK,IAAI;AACnD,MAAI,KAAK,YAAY,WAAW,EAC9B,QAAO;EAET,MAAM,aAAa,KAAK,YAAY,GAAI;AACxC,SAAO,aAAa,GAAG,OAAO,MAAM,eAAe;;;CAIrD,IAAI,iBAA2C;AAC7C,MAAI,KAAK,YAAY,WAAW,EAC9B,QAAO,CAAC,KAAK,YAAY;AAE3B,SAAO,CAAC,GAAG,KAAK,YAAY,GAAI,gBAAgB,KAAK,YAAY;;;CAInE,IAAI,gBAAgC;AAClC,MAAI,KAAK,YAAY,WAAW,EAC9B,QAAO,EAAE;EAEX,MAAM,SAAS,KAAK,YAAY;EAChC,MAAM,OAAuB,EAAE;AAC/B,OAAK,MAAM,SAAS,gBAAgB;GAClC,MAAM,YAAa,OAAO,KAAiC;GAC3D,MAAM,UAAW,KAAK,KAAiC;AACvD,OAAI,cAAc,QAChB,MAAK,KAAK;IACR;IACA,eAAe;IACf,UAAU;IACV,YAAY,KAAK,YAAY,KAAK;IACnC,CAAC;;AAGN,SAAO;;;;;;;AAQX,IAAa,yBAAb,MAAoC;CAgBlC,YAAY,MAAyB,aAAyB;qBARb,EAAE;oBAGH,EAAE;AAMhD,OAAK,OAAO;AACZ,OAAK,cAAc;AACnB,OAAK,eAAe,KAAK,aAAa,KACnC,QAAQ,IAAI,0BAA0B,KAAK,KAAK,CAClD;;;;;;;AAQL,IAAa,iBAAb,MAA4B;CAO1B,YACE,WACA,cACA;AACA,OAAK,YAAY;AACjB,OAAK,eAAe;;;CAItB,aAAa,MAAkD;AAC7D,SAAO,KAAK,UAAU,MAAM,MAAM,EAAE,KAAK,SAAS,KAAK;;;CAIzD,iBAAiB,IAAyC;AACxD,SAAO,KAAK,aAAa,QAAQ,MAAM,EAAE,KAAK,OAAO,GAAG;;;CAI1D,IAAI,gBAA0C;AAC5C,SAAO,KAAK,UAAU,QAAQ,MAAM,CAAC,EAAE,KAAK,eAAe;;;;;;;;;;;;AAa/D,SAAgB,oBAAoB,SAAqC;CAEvE,MAAM,8BAAc,IAAI,KAAqC;CAC7D,MAAM,YAAsC,EAAE;AAE9C,MAAK,MAAM,YAAY,QAAQ,WAAW;EACxC,MAAM,MAAM,IAAI,uBAAuB,UAAU,QAAQ;AACzD,YAAU,KAAK,IAAI;AACnB,cAAY,IAAI,SAAS,MAAM,IAAI;;AAIrC,MAAK,MAAM,OAAO,WAAW;EAC3B,MAAM,aAAa,IAAI,KAAK;AAC5B,MAAI,YAAY;GACd,MAAM,SAAS,YAAY,IAAI,WAAW;AAC1C,OAAI,QAAQ;AACV,QAAI,YAAY,KAAK,OAAO;AAC5B,WAAO,WAAW,KAAK,IAAI;;;;CAMjC,MAAM,kBAA+C,EAAE;AACvD,MAAK,MAAM,OAAO,UAChB,iBAAgB,KAAK,GAAG,IAAI,aAAa;AAI3C,MAAK,MAAM,OAAO,WAAW;AAC3B,MAAI,IAAI,YAAY,WAAW,EAC7B;AAEF,OAAK,MAAM,YAAY,IAAI,aACzB,MAAK,MAAM,kBAAkB,IAAI,aAAa;GAC5C,MAAM,YAAY,eAAe,aAAa,MAC3C,MAAM,EAAE,KAAK,OAAO,SAAS,KAAK,GACpC;AACD,OAAI,WAAW;AACb,aAAS,YAAY,KAAK,UAAU;AACpC,cAAU,WAAW,KAAK,SAAS;;;;AAM3C,QAAO,IAAI,eAAe,WAAW,gBAAgB"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@mitre/hdf-extension-graph",
-  "version": "3.0.0",
+  "version": "3.1.0-rc.1",
   "description": "Bidirectional extension graph processing for HDF profile/baseline hierarchies",
   "publishConfig": {
     "access": "public"
@@ -10,24 +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",
-    "test:ts": "vitest run",
-    "test:watch": "vitest",
-    "test:coverage": "vitest run --coverage",
-    "type-check": "tsc --noEmit",
-    "lint": "eslint src test",
-    "lint:fix": "eslint src test --fix"
-  },
   "repository": {
     "type": "git",
     "url": "https://github.com/mitre/hdf-libs.git",
@@ -36,10 +25,10 @@
   "author": "MITRE Corporation",
   "license": "Apache-2.0",
   "dependencies": {
-    "@mitre/hdf-schema": "workspace:*"
+    "@mitre/hdf-schema": "^3.1.0-rc.1"
   },
   "engines": {
-    "node": ">=20.0.0"
+    "node": ">=22.0.0"
   },
   "keywords": [
     "hdf",
@@ -48,5 +37,16 @@
     "overlay",
     "profile",
     "graph"
-  ]
-}
+  ],
+  "scripts": {
+    "build": "tsdown",
+    "clean": "rimraf dist",
+    "test": "pnpm run test:ts",
+    "test:ts": "vitest run",
+    "test:watch": "vitest",
+    "test:coverage": "vitest run --coverage",
+    "type-check": "tsc --noEmit",
+    "lint": "eslint src test",
+    "lint:fix": "eslint src test --fix"
+  }
+}