graphbox 1.2.2 → 1.3.0

package/dist/experiments/experiments/path-ranking.d.ts

@@ -0,0 +1,29 @@
+/**
+ * Path Salience Ranking Experiments
+ *
+ * Evaluates the Mutual Information-based path ranking algorithm.
+ * Measures MI quality, node coverage, and path diversity across benchmark datasets.
+ */
+/**
+ * Run MI ranking quality experiments on benchmark datasets.
+ *
+ * Measures mean MI, node coverage, and path diversity for Path Salience Ranking.
+ */
+export declare const runMIRankingQualityExperiments: () => Promise<void>;
+/**
+ * Run statistical significance tests for Path Salience Ranking.
+ *
+ * Compares Path Salience against Random baseline using Mann-Whitney U test.
+ */
+export declare const runStatisticalSignificanceExperiments: () => Promise<void>;
+/**
+ * Run ranking benchmark experiments.
+ *
+ * Compares Path Salience against Shortest Path and Random baselines.
+ */
+export declare const runRankingBenchmarkExperiments: () => Promise<void>;
+/**
+ * Run all path ranking experiments.
+ */
+export declare const runPathRankingExperiments: () => Promise<void>;
+//# sourceMappingURL=path-ranking.d.ts.map

package/dist/experiments/experiments/path-ranking.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"path-ranking.d.ts","sourceRoot":"","sources":["../../../src/experiments/experiments/path-ranking.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAWH;;;;GAIG;AACH,eAAO,MAAM,8BAA8B,QAAa,OAAO,CAAC,IAAI,CA2BnE,CAAC;AAEF;;;;GAIG;AACH,eAAO,MAAM,qCAAqC,QAAa,OAAO,CAAC,IAAI,CA6C1E,CAAC;AAEF;;;;GAIG;AACH,eAAO,MAAM,8BAA8B,QAAa,OAAO,CAAC,IAAI,CAiDnE,CAAC;AAEF;;GAEG;AACH,eAAO,MAAM,yBAAyB,QAAa,OAAO,CAAC,IAAI,CAa9D,CAAC"}

package/dist/experiments/experiments/salience-coverage-comparison.d.ts

@@ -0,0 +1,19 @@
+/**
+ * Salience Coverage Comparison Experiments
+ *
+ * Evaluates novel expansion algorithms (EGE, PPME, RSGE), baseline variants,
+ * and intelligent termination strategies (IDT) on their ability to discover
+ * high-salience paths.
+ *
+ * Ground truth: Paths ranked highly by Path Salience algorithm (MI-based ranking)
+ * Metric: What percentage of top-K salient paths does each method discover?
+ */
+/**
+ * Run salience coverage experiments comparing all methods
+ */
+export declare const runSalienceCoverageExperiments: () => Promise<void>;
+/**
+ * Main entry point for running all experiments
+ */
+export declare const runAllSalienceCoverageExperiments: () => Promise<void>;
+//# sourceMappingURL=salience-coverage-comparison.d.ts.map

package/dist/experiments/experiments/salience-coverage-comparison.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"salience-coverage-comparison.d.ts","sourceRoot":"","sources":["../../../src/experiments/experiments/salience-coverage-comparison.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AA8WH;;GAEG;AACH,eAAO,MAAM,8BAA8B,QAAa,OAAO,CAAC,IAAI,CA+CnE,CAAC;AAEF;;GAEG;AACH,eAAO,MAAM,iCAAiC,QAAa,OAAO,CAAC,IAAI,CAEtE,CAAC"}

package/dist/experiments/experiments/seeded-expansion.d.ts

@@ -0,0 +1,43 @@
+/**
+ * Seeded Node Expansion Experiments
+ *
+ * Evaluates N-seed expansion variants:
+ * - N=1: Ego-network sampling (single seed)
+ * - N=2: Bidirectional expansion (two seeds)
+ * - N≥3: Multi-seed expansion (three or more seeds)
+ */
+/**
+ * Run N-seed comparison experiments.
+ *
+ * Compares all methods (DP, BFS, FB, Random) across N=1, N=2, N=3 variants.
+ */
+export declare const runNSeedComparisonExperiments: () => Promise<void>;
+/**
+ * Run N=2 hub traversal experiments.
+ *
+ * Measures hub avoidance for bidirectional expansion specifically.
+ */
+export declare const runN2HubTraversalExperiments: () => Promise<void>;
+/**
+ * Run N=2 path diversity experiments.
+ *
+ * Measures path diversity for bidirectional expansion.
+ */
+export declare const runN2PathDiversityExperiments: () => Promise<void>;
+/**
+ * Run N-seed generalization experiments.
+ *
+ * Shows how N-seed expansion generalizes across different N values.
+ */
+export declare const runNSeedGeneralizationExperiments: () => Promise<void>;
+/**
+ * Run structural representativeness experiments.
+ *
+ * Measures how well sampled subgraphs represent the ground truth ego network.
+ */
+export declare const runStructuralRepresentativenessExperiments: () => Promise<void>;
+/**
+ * Run all seeded expansion experiments.
+ */
+export declare const runSeededExpansionExperiments: () => Promise<void>;
+//# sourceMappingURL=seeded-expansion.d.ts.map

package/dist/experiments/experiments/seeded-expansion.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"seeded-expansion.d.ts","sourceRoot":"","sources":["../../../src/experiments/experiments/seeded-expansion.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAWH;;;;GAIG;AACH,eAAO,MAAM,6BAA6B,QAAa,OAAO,CAAC,IAAI,CAkJlE,CAAC;AAEF;;;;GAIG;AACH,eAAO,MAAM,4BAA4B,QAAa,OAAO,CAAC,IAAI,CAsCjE,CAAC;AAEF;;;;GAIG;AACH,eAAO,MAAM,6BAA6B,QAAa,OAAO,CAAC,IAAI,CA6ClE,CAAC;AAEF;;;;GAIG;AACH,eAAO,MAAM,iCAAiC,QAAa,OAAO,CAAC,IAAI,CA6CtE,CAAC;AAEF;;;;GAIG;AACH,eAAO,MAAM,0CAA0C,QAAa,OAAO,CAAC,IAAI,CAyD/E,CAAC;AAEF;;GAEG;AACH,eAAO,MAAM,6BAA6B,QAAa,OAAO,CAAC,IAAI,CAmBlE,CAAC"}

package/dist/experiments/fixtures/mock-graph-expander.d.ts

@@ -1,5 +1,5 @@
 import { TestGraph, TestNode } from '../../generation/generators/types';
-import { GraphExpander, Neighbor } from '../../interfaces/graph-expander';
+import { GraphExpander, Neighbor, PriorityOptions } from '../../interfaces/graph-expander';
 /**
  * Mock implementation of GraphExpander for testing bidirectional BFS.
  * Loads graph structure from TestGraph fixture.
@@ -15,6 +15,7 @@ export declare class MockGraphExpander implements GraphExpander<TestNode> {
     getDegree(nodeId: string): number;
     getNode(nodeId: string): Promise<TestNode | null>;
     addEdge(source: string, target: string, relationshipType: string): void;
+    calculatePriority(nodeId: string, options?: PriorityOptions): number;
     /**
      * Get all edges discovered during BFS traversal.
      */

package/dist/experiments/fixtures/mock-graph-expander.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"mock-graph-expander.d.ts","sourceRoot":"","sources":["../../../src/experiments/fixtures/mock-graph-expander.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAY,SAAS,EAAE,QAAQ,EAAE,MAAM,mCAAmC,CAAC;AACvF,OAAO,KAAK,EAAE,aAAa,EAAE,QAAQ,EAAE,MAAM,iCAAiC,CAAC;AAE/E;;;GAGG;AACH,qBAAa,iBAAkB,YAAW,aAAa,CAAC,QAAQ,CAAC;IAChE,OAAO,CAAC,SAAS,CAAsC;IACvD,OAAO,CAAC,OAAO,CAAkC;IACjD,OAAO,CAAC,KAAK,CAAoC;IACjD,OAAO,CAAC,eAAe,CAA2E;gBAEtF,KAAK,EAAE,SAAS;IAU5B,OAAO,CAAC,cAAc;IA6BhB,YAAY,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC;IAIvD,SAAS,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM;IAI3B,OAAO,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,QAAQ,GAAG,IAAI,CAAC;IAIvD,OAAO,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,gBAAgB,EAAE,MAAM,GAAG,IAAI;IAIvE;;OAEG;IACH,kBAAkB,IAAI,KAAK,CAAC;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAC;QAAC,gBAAgB,EAAE,MAAM,CAAA;KAAE,CAAC;IAIzF;;OAEG;IACH,oBAAoB,IAAI,IAAI;CAG5B"}
+{"version":3,"file":"mock-graph-expander.d.ts","sourceRoot":"","sources":["../../../src/experiments/fixtures/mock-graph-expander.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAY,SAAS,EAAE,QAAQ,EAAE,MAAM,mCAAmC,CAAC;AACvF,OAAO,KAAK,EAAE,aAAa,EAAE,QAAQ,EAAE,eAAe,EAAE,MAAM,iCAAiC,CAAC;AAEhG;;;GAGG;AACH,qBAAa,iBAAkB,YAAW,aAAa,CAAC,QAAQ,CAAC;IAChE,OAAO,CAAC,SAAS,CAAsC;IACvD,OAAO,CAAC,OAAO,CAAkC;IACjD,OAAO,CAAC,KAAK,CAAoC;IACjD,OAAO,CAAC,eAAe,CAA2E;gBAEtF,KAAK,EAAE,SAAS;IAU5B,OAAO,CAAC,cAAc;IA6BhB,YAAY,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC;IAIvD,SAAS,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM;IAI3B,OAAO,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,QAAQ,GAAG,IAAI,CAAC;IAIvD,OAAO,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,gBAAgB,EAAE,MAAM,GAAG,IAAI;IAIvE,iBAAiB,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,GAAE,eAAoB,GAAG,MAAM;IAgBxE;;OAEG;IACH,kBAAkB,IAAI,KAAK,CAAC;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAC;QAAC,gBAAgB,EAAE,MAAM,CAAA;KAAE,CAAC;IAIzF;;OAEG;IACH,oBAAoB,IAAI,IAAI;CAG5B"}

package/dist/experiments/metrics/collector.d.ts

@@ -0,0 +1,49 @@
+import { Metric, MetricCategory, MetricsOutput } from './types.js';
+export declare class MetricsCollector {
+    private metrics;
+    /**
+     * Record a metric entry.
+     *
+     * @param category - The metric category (e.g., "hub-traversal")
+     * @param data - The metric data (typed)
+     */
+    record<T extends Metric>(category: MetricCategory, data: T): void;
+    /**
+     * Record multiple metrics of the same category at once.
+     * @param category
+     * @param data
+     */
+    recordBatch<T extends Metric>(category: MetricCategory, data: T[]): void;
+    /**
+     * Get all metrics for a category.
+     * @param category
+     */
+    get(category: MetricCategory): Metric[];
+    /**
+     * Get all metrics as a record.
+     */
+    getAll(): Record<MetricCategory, Metric[]>;
+    /**
+     * Clear all metrics (useful for testing).
+     */
+    clear(): void;
+    /**
+     * Check if any metrics have been collected.
+     */
+    isEmpty(): boolean;
+    /**
+     * Get count of metrics by category.
+     * @param category
+     */
+    count(category?: MetricCategory): number;
+    /**
+     * Serialize to MetricsOutput format for JSON writing.
+     */
+    serialize(): MetricsOutput;
+}
+/**
+ * Global singleton instance for convenience.
+ * Can also create individual instances for isolation.
+ */
+export declare const metrics: MetricsCollector;
+//# sourceMappingURL=collector.d.ts.map

package/dist/experiments/metrics/collector.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"collector.d.ts","sourceRoot":"","sources":["../../../src/experiments/metrics/collector.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EACX,MAAM,EACN,cAAc,EACd,aAAa,EACb,MAAM,YAAY,CAAC;AAEpB,qBAAa,gBAAgB;IAC5B,OAAO,CAAC,OAAO,CAA4C;IAE3D;;;;;OAKG;IACH,MAAM,CAAC,CAAC,SAAS,MAAM,EAAE,QAAQ,EAAE,cAAc,EAAE,IAAI,EAAE,CAAC,GAAG,IAAI;IAUjE;;;;OAIG;IACH,WAAW,CAAC,CAAC,SAAS,MAAM,EAAE,QAAQ,EAAE,cAAc,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,IAAI;IAUxE;;;OAGG;IACH,GAAG,CAAC,QAAQ,EAAE,cAAc,GAAG,MAAM,EAAE;IAIvC;;OAEG;IACH,MAAM,IAAI,MAAM,CAAC,cAAc,EAAE,MAAM,EAAE,CAAC;IAQ1C;;OAEG;IACH,KAAK,IAAI,IAAI;IAIb;;OAEG;IACH,OAAO,IAAI,OAAO;IAIlB;;;OAGG;IACH,KAAK,CAAC,QAAQ,CAAC,EAAE,cAAc,GAAG,MAAM;IAWxC;;OAEG;IACH,SAAS,IAAI,aAAa;CAO1B;AAED;;;GAGG;AACH,eAAO,MAAM,OAAO,kBAAyB,CAAC"}

package/dist/experiments/metrics/hub-avoidance-calculator.d.ts

@@ -0,0 +1,97 @@
+import { ExpansionStats } from '../../algorithms/traversal/degree-prioritised-expansion.js';
+import { BfsExpansionStats } from '../baselines/standard-bfs.js';
+/**
+ * Hub-avoidance metrics computed from degree distribution.
+ */
+export interface HubAvoidanceMetrics {
+    /** Proportion of expanded nodes that are hubs (0-1, lower is better) */
+    hubTraversalRate: number;
+    /** Distribution of expanded nodes across degree buckets */
+    degreeDistribution: Map<string, number>;
+    /** Ratio of peripheral nodes expanded to hub nodes expanded (higher is better) */
+    peripheralCoverageRatio: number;
+    /** Total nodes expanded */
+    totalExpanded: number;
+    /** Number of hub nodes expanded (degree >= hubThreshold) */
+    hubCount: number;
+    /** Number of peripheral nodes expanded (degree <= peripheralThreshold) */
+    peripheralCount: number;
+}
+/**
+ * Compute hub-avoidance metrics from expansion stats.
+ *
+ * The degree distribution map contains bucket counts like:
+ * - "1-5": 150      (peripheral)
+ * - "6-10": 80      (peripheral)
+ * - "11-50": 60
+ * - "51-100": 30
+ * - "101-500": 15   (hub)
+ * - "501-1000": 5   (hub)
+ * - "1000+": 2      (hub)
+ *
+ * Hub-avoidance means:
+ * - Low hub traversal rate (fewer nodes from "101-500", "501-1000", "1000+")
+ * - High peripheral coverage ratio (more peripheral nodes relative to hubs)
+ *
+ * @param stats - Expansion stats containing degree distribution
+ * @param hubThreshold - Minimum degree for hub classification (default: 100)
+ * @param peripheralThreshold - Maximum degree for peripheral classification (default: 10)
+ * @returns Hub-avoidance metrics
+ */
+export declare const calculateHubAvoidanceMetrics: (stats: BfsExpansionStats | ExpansionStats, hubThreshold?: number, peripheralThreshold?: number) => HubAvoidanceMetrics;
+/**
+ * Convert hub-avoidance metrics to a plain object for serialisation.
+ *
+ * @param metrics - Hub-avoidance metrics
+ * @returns Plain object with serialisable values
+ */
+export declare const hubAvoidanceMetricsToObject: (metrics: HubAvoidanceMetrics) => Record<string, number | string>;
+/**
+ * Format hub-avoidance metrics as percentages for display.
+ *
+ * @param metrics - Hub-avoidance metrics
+ * @returns Object with formatted percentage strings
+ */
+export declare const formatHubAvoidanceMetrics: (metrics: HubAvoidanceMetrics) => {
+    hubTraversalRate: string;
+    peripheralCoverageRatio: string;
+    degreeDistribution: Record<string, string>;
+};
+/**
+ * Compare hub-avoidance metrics between two algorithms.
+ *
+ * Returns which algorithm has better hub avoidance (lower hub traversal).
+ *
+ * @param metrics1 - First algorithm's metrics
+ * @param metrics2 - Second algorithm's metrics
+ * @returns Comparison result
+ */
+export interface HubAvoidanceComparison {
+    /** Which metrics have lower hub rate (-1, 0, or 1) */
+    lowerHubRate: number;
+    /** Difference in hub traversal rate (metrics1 - metrics2) */
+    hubRateDelta: number;
+    /** Ratio of peripheral coverage (metrics1 / metrics2) */
+    peripheralRatioDelta: number;
+    /** Whether metrics1 has better hub avoidance overall */
+    better: boolean;
+}
+export declare const compareHubAvoidance: (metrics1: HubAvoidanceMetrics, metrics2: HubAvoidanceMetrics) => HubAvoidanceComparison;
+/**
+ * Compute hub-avoidance metrics for table rendering.
+ *
+ * This function aggregates degree distribution data into a format
+ * suitable for LaTeX table generation.
+ *
+ * @param statsArray - Array of expansion stats from multiple runs
+ * @param hubThreshold - Hub threshold (default: 100)
+ * @returns Aggregated hub-avoidance metrics
+ */
+export interface AggregatedHubAvoidanceMetrics {
+    meanHubTraversalRate: number;
+    meanPeripheralCoverageRatio: number;
+    degreeDistributionPct: Record<string, number>;
+    totalRuns: number;
+}
+export declare const aggregateHubAvoidanceMetrics: (statsArray: Array<BfsExpansionStats | ExpansionStats>, hubThreshold?: number) => AggregatedHubAvoidanceMetrics;
+//# sourceMappingURL=hub-avoidance-calculator.d.ts.map

package/dist/experiments/metrics/hub-avoidance-calculator.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"hub-avoidance-calculator.d.ts","sourceRoot":"","sources":["../../../src/experiments/metrics/hub-avoidance-calculator.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,4DAA4D,CAAC;AACjG,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,8BAA8B,CAAC;AAwBtE;;GAEG;AACH,MAAM,WAAW,mBAAmB;IACnC,wEAAwE;IACxE,gBAAgB,EAAE,MAAM,CAAC;IAEzB,2DAA2D;IAC3D,kBAAkB,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAExC,kFAAkF;IAClF,uBAAuB,EAAE,MAAM,CAAC;IAEhC,2BAA2B;IAC3B,aAAa,EAAE,MAAM,CAAC;IAEtB,4DAA4D;IAC5D,QAAQ,EAAE,MAAM,CAAC;IAEjB,0EAA0E;IAC1E,eAAe,EAAE,MAAM,CAAC;CACxB;AAED;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,eAAO,MAAM,4BAA4B,GAAI,OAAO,iBAAiB,GAAG,cAAc,EAAE,eAAc,MAAwC,EAAE,sBAAqB,MAA+C,KAAG,mBA0CtN,CAAC;AAuBF;;;;;GAKG;AACH,eAAO,MAAM,2BAA2B,GAAI,SAAS,mBAAmB,KAAG,MAAM,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CAexG,CAAC;AAEF;;;;;GAKG;AACH,eAAO,MAAM,yBAAyB,GAAI,SAAS,mBAAmB,KAAG;IACxE,gBAAgB,EAAE,MAAM,CAAC;IACzB,uBAAuB,EAAE,MAAM,CAAC;IAChC,kBAAkB,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CAgB3C,CAAC;AAEF;;;;;;;;GAQG;AACH,MAAM,WAAW,sBAAsB;IACtC,sDAAsD;IACtD,YAAY,EAAE,MAAM,CAAC;IAErB,6DAA6D;IAC7D,YAAY,EAAE,MAAM,CAAC;IAErB,yDAAyD;IACzD,oBAAoB,EAAE,MAAM,CAAC;IAE7B,wDAAwD;IACxD,MAAM,EAAE,OAAO,CAAC;CAChB;AAED,eAAO,MAAM,mBAAmB,GAAI,UAAU,mBAAmB,EAAE,UAAU,mBAAmB,KAAG,sBAclG,CAAC;AAEF;;;;;;;;;GASG;AACH,MAAM,WAAW,6BAA6B;IAC7C,oBAAoB,EAAE,MAAM,CAAC;IAC7B,2BAA2B,EAAE,MAAM,CAAC;IACpC,qBAAqB,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC9C,SAAS,EAAE,MAAM,CAAC;CAClB;AAED,eAAO,MAAM,4BAA4B,GAAI,YAAY,KAAK,CAAC,iBAAiB,GAAG,cAAc,CAAC,EAAE,eAAc,MAAwC,KAAG,6BAkD5J,CAAC"}

package/dist/experiments/metrics/index.d.ts

@@ -0,0 +1,10 @@
+/**
+ * Metrics Framework
+ *
+ * Reusable, repeatable, reproducible metrics collection.
+ */
+export * from './collector.js';
+export * from './hub-avoidance-calculator.js';
+export * from './storage.js';
+export * from './types.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/experiments/metrics/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/experiments/metrics/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,cAAc,gBAAgB,CAAC;AAC/B,cAAc,+BAA+B,CAAC;AAC9C,cAAc,cAAc,CAAC;AAC7B,cAAc,YAAY,CAAC"}

package/dist/experiments/metrics/storage.d.ts

@@ -0,0 +1,29 @@
+import { MetricsOutput } from './types.js';
+export interface StorageOptions {
+    outputPath: string;
+    pretty?: boolean;
+}
+/**
+ * Write metrics to a JSON file.
+ * @param metrics
+ * @param options
+ */
+export declare const writeMetrics: (metrics: MetricsOutput, options: StorageOptions) => void;
+/**
+ * Read metrics from a JSON file.
+ * @param inputPath
+ */
+export declare const readMetrics: (inputPath: string) => MetricsOutput | null;
+/**
+ * Resolve output path relative to project root.
+ * @param fromPath
+ * @param outputPath
+ */
+export declare const resolveOutputPath: (fromPath: string, outputPath?: string) => string;
+/**
+ * Merge multiple metrics outputs into one.
+ * Later metrics take precedence for conflicts.
+ * @param metricsList
+ */
+export declare const mergeMetrics: (...metricsList: MetricsOutput[]) => MetricsOutput;
+//# sourceMappingURL=storage.d.ts.map

package/dist/experiments/metrics/storage.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"storage.d.ts","sourceRoot":"","sources":["../../../src/experiments/metrics/storage.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAKH,OAAO,KAAK,EAAyB,aAAa,EAAE,MAAM,YAAY,CAAC;AAEvE,MAAM,WAAW,cAAc;IAC9B,UAAU,EAAE,MAAM,CAAC;IACnB,MAAM,CAAC,EAAE,OAAO,CAAC;CACjB;AAED;;;;GAIG;AACH,eAAO,MAAM,YAAY,GAAI,SAAS,aAAa,EAAE,SAAS,cAAc,KAAG,IAc9E,CAAC;AAEF;;;GAGG;AACH,eAAO,MAAM,WAAW,GAAI,WAAW,MAAM,KAAG,aAAa,GAAG,IAW/D,CAAC;AAEF;;;;GAIG;AACH,eAAO,MAAM,iBAAiB,GAAI,UAAU,MAAM,EAAE,aAAY,MAA4B,KAAG,MAAkD,CAAC;AAElJ;;;;GAIG;AACH,eAAO,MAAM,YAAY,GAAI,GAAG,aAAa,aAAa,EAAE,KAAG,aAkB9D,CAAC"}