@remnic/core 9.69.55 → 9.69.57

package/dist/graph.d.ts

@@ -1,22 +1,325 @@
-import './capabilities.js';
-export { A as ActivationPath, f as ActivationPredecessor, C as CAUSAL_PHRASES, D as DEFAULT_GRAPH_TRAVERSAL_CONFIDENCE_FLOOR, h as DEFAULT_GRAPH_TRAVERSAL_PAGERANK_ITERATIONS, i as GraphConfig, a as GraphEdge, j as GraphHealthFileStats, b as GraphHealthReport, c as GraphIndex, G as GraphType, k as analyzeGraphHealth, l as appendEdge, m as applyLateralInhibition, n as applyPageRankRefinement, o as clampConfidenceFloor, p as clampPageRankIterations, q as detectCausalPhrase, s as ensureGraphsDir, t as graphFilePath, u as graphsDir, v as readAllEdges, w as readEdges, x as readEdgesStrict, r as reconstructActivationPath } from './graph-DRkl22KE.js';
-export { GraphLockLostError, withGraphWriteLock } from './graph-write-lock.js';
-import './types-Du6VdoAg.js';
-import './message-parts/index.js';
-import './bounded-jsonl-state.js';
-import './operator-doctor-types.js';
-import './external-wiki-config.js';
-import './recall-state-view.js';
-import './contradiction-config.js';
-import './graph-path-scoring-config.js';
-import './background-generation-config.js';
-import './deep-recall-config.js';
-import './recall-navigation-config.js';
-import './recall-recognition-tier.js';
-import './causal-trajectory.js';
-import './objective-state.js';
-import './active-context-config.js';
-import './local-llm-config.js';
-import './semantic-merge-config.js';
-import './types-continuity.js';
-import './utils/serialize-mutations.js';
+/**
+ * Multi-Graph Memory (MAGMA/SYNAPSE-inspired, v8.2)
+ *
+ * Maintains three typed edge graphs:
+ *   entity.jsonl  — memories sharing a named entity (entityRef)
+ *   time.jsonl    — consecutive memories in the same thread/session
+ *   causal.jsonl  — memories linked by causal language heuristics
+ *
+ * Stored under `<memoryDir>/state/graphs/`.
+ * All writes are fail-open: errors are caught/logged, never thrown.
+ */
+import type { GraphConstructionCapabilitySet } from "./capabilities.js";
+import { reconstructActivationPath, type ActivationPredecessor } from "./graph-path-reconstruction.js";
+export { reconstructActivationPath, type ActivationPredecessor };
+import { GraphLockLostError, withGraphWriteLock } from "./graph-write-lock.js";
+export type GraphType = "entity" | "time" | "causal";
+export interface ActivationPath {
+    /** Node ids from the seed (inclusive) to the reached node (inclusive). */
+    nodeIds: string[];
+    /** Edge confidences, parallel to the hops in {@link nodeIds}. */
+    edgeConfidences: number[];
+    /** Graph types, parallel to the hops in {@link nodeIds}. */
+    graphTypes: GraphType[];
+}
+export interface GraphEdge {
+    from: string;
+    to: string;
+    type: GraphType;
+    weight: number;
+    label: string;
+    ts: string;
+    confidence?: number;
+    lastReinforcedAt?: string;
+}
+export interface GraphConfig {
+    multiGraphMemoryEnabled: boolean;
+    entityGraphEnabled: boolean;
+    timeGraphEnabled: boolean;
+    causalGraphEnabled: boolean;
+    maxGraphTraversalSteps: number;
+    graphActivationDecay: number;
+    maxEntityGraphEdgesPerMemory: number;
+    graphLateralInhibitionEnabled: boolean;
+    graphLateralInhibitionBeta: number;
+    graphLateralInhibitionTopM: number;
+    /**
+     * Issue #681 PR 3/3 — minimum edge confidence required for traversal.
+     * Edges with confidence below this floor are pruned. Legacy edges
+     * (no `confidence` field) are treated as 1.0 and always pass.
+     * Range `[0, 1]`. Default 0.2.
+     */
+    graphTraversalConfidenceFloor: number;
+    /**
+     * Issue #681 PR 3/3 — number of PageRank-style refinement iterations
+     * applied on top of BFS activation. Set to 0 to disable refinement
+     * and return raw BFS scores. Default 8.
+     */
+    graphTraversalPageRankIterations: number;
+    /**
+     * Issue #1904 — incremental GraphIndex edge cache. When true (the default,
+     * and the value when omitted), a single-writer edge append is pushed into the
+     * warm edge cache in place (revalidated by file size for cross-process
+     * coherence) instead of nulling the cache and paying a full 6 MB re-read +
+     * parse on the next traversal. Set false to restore the pre-#1904
+     * null-on-every-write behavior. Optional here (unlike the required
+     * PluginConfig field parseConfig always sets) so GraphConfig can still be
+     * constructed directly with a partial config; only an explicit `false` opts
+     * out, so an omitted field keeps the incremental default.
+     */
+    graphEdgeCacheIncrementalEnabled?: boolean;
+}
+/** Default minimum edge confidence required for traversal (issue #681 PR 3/3). */
+export declare const DEFAULT_GRAPH_TRAVERSAL_CONFIDENCE_FLOOR = 0.2;
+/** Default PageRank-style refinement iteration count (issue #681 PR 3/3). */
+export declare const DEFAULT_GRAPH_TRAVERSAL_PAGERANK_ITERATIONS = 8;
+export declare const CAUSAL_PHRASES: string[];
+export declare function graphsDir(memoryDir: string): string;
+export declare function graphFilePath(memoryDir: string, type: GraphType): string;
+export declare function ensureGraphsDir(memoryDir: string): Promise<void>;
+export { withGraphWriteLock, GraphLockLostError };
+export declare function appendEdge(memoryDir: string, edge: GraphEdge): Promise<void>;
+/**
+ * Read all edges of a given type from the JSONL file.
+ * Returns [] if the file doesn't exist or any read error occurs (fail-open).
+ *
+ * Production traversal callers (recall/PageRank) depend on this fail-open
+ * posture so a temporarily missing or unreadable graph file never blocks
+ * a recall. Maintenance jobs that need to distinguish ENOENT from real
+ * I/O failures must use {@link readEdgesStrict} instead.
+ */
+export declare function readEdges(memoryDir: string, type: GraphType): Promise<GraphEdge[]>;
+/**
+ * Same as {@link readEdges} but only swallows `ENOENT`; all other read
+ * errors (`EACCES`, `EIO`, …) are propagated. Used by the graph-edge
+ * decay maintenance job so I/O outages surface as a failed run instead
+ * of being silently reported as "no edges to decay" (issue #729 /
+ * Codex P1, line 120).
+ */
+export declare function readEdgesStrict(memoryDir: string, type: GraphType): Promise<GraphEdge[]>;
+/**
+ * Read edges from all enabled graph types.
+ */
+export declare function readAllEdges(memoryDir: string, graphCaps: Pick<GraphConstructionCapabilitySet, "entityGraph" | "timeGraph" | "causalGraph">): Promise<GraphEdge[]>;
+export interface GraphHealthFileStats {
+    type: GraphType;
+    filePath: string;
+    exists: boolean;
+    totalLines: number;
+    validEdges: number;
+    corruptLines: number;
+    uniqueNodes: number;
+}
+export interface GraphHealthReport {
+    generatedAt: string;
+    enabledTypes: GraphType[];
+    totals: {
+        totalLines: number;
+        validEdges: number;
+        corruptLines: number;
+        uniqueNodes: number;
+    };
+    files: GraphHealthFileStats[];
+    repairGuidance?: string[];
+}
+export declare function analyzeGraphHealth(memoryDir: string, options?: {
+    entityGraphEnabled?: boolean;
+    timeGraphEnabled?: boolean;
+    causalGraphEnabled?: boolean;
+    includeRepairGuidance?: boolean;
+}): Promise<GraphHealthReport>;
+/**
+ * Detect causal signal phrases in text. Returns the first matched phrase, or null.
+ */
+export declare function detectCausalPhrase(text: string): string | null;
+export declare class GraphIndex {
+    private readonly memoryDir;
+    private readonly cfg;
+    private edgeCache;
+    private static readonly EDGE_CACHE_TTL_MS;
+    constructor(memoryDir: string, cfg: GraphConfig);
+    /** Clear the edge cache so the next spreadingActivation() re-reads from disk.
+     *  Call after any code path that appends edges outside of onMemoryWritten(). */
+    invalidateEdgeCache(): void;
+    private loadEdgesCached;
+    /**
+     * Identity ({ size, mtimeMs, ino }) of each ENABLED graph file (issue #1904).
+     * Missing files (ENOENT) and any stat error map to the all-zero sentinel so
+     * the baseline is fail-open: a later revalidation sees a mismatch (or a peer
+     * creation flipping ino from 0 to non-zero) and forces a full reload rather
+     * than trusting a stale incremental push.
+     */
+    private readEnabledGraphFileMeta;
+    /** True iff both metadata maps carry identical identity for every key. */
+    private graphFileMetaEqual;
+    /**
+     * Re-stat every graph file whose identity the cache just committed and return
+     * false if any has moved since (issue #1904, Codex). Closes the validation→
+     * in-place-push TOCTOU window: a peer process (concurrent CLI / daemon /
+     * decay job) can append between edgeFilesUnchangedExceptOurAppends()'s final
+     * stat and the allEdges.push(...). Without this re-check the cache would be
+     * accepted with identity predating the peer write and miss the peer edge for
+     * the TTL. A residual infinitesimal window (peer writes during this re-stat)
+     * remains and is TTL-bounded.
+     */
+    private edgeCacheIdentityUnchangedSinceCommit;
+    /**
+     * Called after a memory is written to disk.
+     *
+     * Throws when an edge append fails (after logging): the merged-target rewrite
+     * path depends on the rejection to restore the edges `removeNodeEdgesForRewrite`
+     * dropped — swallowing here left that restore dead and the prior edge set
+     * permanently lost (#2330). Fail-open is the CALLER's decision; the create
+     * paths already catch (see persistence-index.buildGraphEdge).
+     *
+     * @param memoryPath - relative path from memoryDir (e.g. "facts/2026-02-22/abc.md")
+     * @param entityRef  - entityRef frontmatter field (if any)
+     * @param content    - full memory text (for causal detection)
+     * @param created    - ISO timestamp of this memory
+     * @param threadId   - current thread ID (for time graph)
+     * @param recentInThread - paths of the N most-recent memories in this thread (for time graph)
+     * @param entitySiblings - paths of other memories that share the same entityRef (for entity graph)
+     */
+    onMemoryWritten(opts: {
+        memoryPath: string;
+        entityRef?: string;
+        content: string;
+        created: string;
+        threadId?: string;
+        recentInThread?: string[];
+        entitySiblings?: string[];
+        causalPredecessor?: string;
+        /**
+         * Optional frozen gate overrides (from GraphConstructionCapabilitySet).
+         * When provided, these take precedence over `this.cfg` so the caller's
+         * operation-scoped snapshot is the single source of truth (#1566).
+         */
+        graphCapsOverride?: {
+            entityGraph: boolean;
+            timeGraph: boolean;
+            causalGraph: boolean;
+            multiGraphMemory: boolean;
+        };
+    }): Promise<GraphEdge[]>;
+    /**
+     * Cross-process coherence check for the incremental edge cache (issue #1904).
+     *
+     * Returns true iff every ENABLED graph file's current identity is explained
+     * ENTIRELY by THIS call's own append — no other process wrote to any graph
+     * file since load. Per file:
+     *   - inode must be unchanged. A local append (`appendFile`) keeps the inode;
+     *     an external atomic temp+rename rewrite (e.g. the edge-decay job) changes
+     *     it, so an inode change — even one that preserves byte length, such as
+     *     decaying confidence 0.9->0.8 — forces a reload (Codex).
+     *   - a file WE appended to (delta > 0): size must equal baseline + our exact
+     *     appended bytes. If it was absent at load (sentinel ino 0), our append
+     *     created it, so we accept size === delta and adopt the new identity.
+     *   - a file we did NOT touch (delta 0): size AND mtime must be unchanged, so
+     *     an in-place equal-length rewrite (mtime bump) or a peer append (size
+     *     bump) both force a reload.
+     * On success it commits the new identity baseline so the next append
+     * revalidates against post-this-write truth. Fail-open: an unreadable file
+     * (non-ENOENT) returns false, forcing a full reload.
+     */
+    private edgeFilesUnchangedExceptOurAppends;
+    /**
+     * Spreading activation BFS (SYNAPSE-inspired).
+     *
+     * Starting from `seeds`, traverse the combined graph for up to `maxSteps` hops.
+     * Each candidate gets an activation score = edge.weight × edgeConfidence × decay^hop.
+     *
+     * Issue #681 PR 3/3 — confidence-aware traversal:
+     *   - Each edge's `weight` is multiplied by its `confidence` (legacy edges
+     *     missing `confidence` are treated as 1.0, preserving prior behavior).
+     *   - Edges with `confidence < graphTraversalConfidenceFloor` are pruned and
+     *     contribute neither activation nor downstream neighbors.
+     *   - When `graphTraversalPageRankIterations > 0`, an additional PageRank-
+     *     style refinement pass redistributes activation along confidence-weighted
+     *     edges, sharpening the ranking among multi-hop candidates.
+     *   - Per-result provenance includes the highest-confidence edge that landed
+     *     on each candidate, so the X-ray surface can attribute pruning and
+     *     ranking decisions back to specific edges.
+     *
+     * @param seeds    - initial memory paths to expand from (e.g. QMD top results)
+     * @param maxSteps - max BFS hops (from config: maxGraphTraversalSteps)
+     * @returns Array of {path, score, edgeConfidence, ...} sorted descending, not including seed paths
+     */
+    spreadingActivation(seeds: string[], maxSteps?: number, opts?: {
+        /**
+         * Issue #681 — when `true`, bypasses the configured
+         * `graphTraversalConfidenceFloor` and includes low-confidence
+         * edges in traversal.  Equivalent to forcing the floor to `0`.
+         * Default `false` (floor from config is applied).
+         */
+        includeLowConfidence?: boolean;
+        /** Record one shortest seed-to-candidate path in each result. */
+        recordPaths?: boolean;
+        /** Absolute deadline in ms-since-epoch for post-retrieval assembly. */
+        deadlineAtMs?: number;
+    }): Promise<Array<{
+        path: string;
+        score: number;
+        seed: string;
+        hopDepth: number;
+        decayedWeight: number;
+        graphType: "entity" | "time" | "causal";
+        /**
+         * Confidence of the edge that produced this candidate's recorded
+         * provenance (the strongest edge along the chosen entry path).
+         * In `[0, 1]`. Legacy edges without `confidence` surface as 1.0.
+         */
+        edgeConfidence: number;
+        activationPath?: ActivationPath | null;
+    }>>;
+}
+/**
+ * Clamp `graphTraversalConfidenceFloor` into the legal range `[0, 1]`.
+ * Non-finite or non-numeric values fall back to the documented default
+ * so misconfiguration cannot silently disable the floor or reject every edge.
+ *
+ * Exported for tests; call sites in `spreadingActivation` use it to make
+ * the contract explicit at every boundary.
+ */
+export declare function clampConfidenceFloor(raw: unknown): number;
+/**
+ * Clamp `graphTraversalPageRankIterations` into a non-negative integer.
+ * Negative or non-finite values fall back to 0 (disable refinement) so
+ * misconfiguration cannot stall recall in an unbounded loop.
+ */
+export declare function clampPageRankIterations(raw: unknown): number;
+/**
+ * PageRank-style refinement on top of the BFS activation map.
+ *
+ * Each iteration redistributes a fraction of every node's score along
+ * its outgoing edges, scaled by edge confidence. Confidence below
+ * `floor` is filtered out before redistribution, mirroring the BFS
+ * pruning rule. Mutates `scores` in place.
+ *
+ * Exported for tests; in production, call sites pass the same adjacency
+ * map already used by BFS so behavior stays consistent.
+ */
+export declare function applyPageRankRefinement(scores: Map<string, number>, adj: Map<string, GraphEdge[]>, opts: {
+    iterations: number;
+    floor: number;
+    damping: number;
+    deadlineAtMs?: number;
+}): void;
+/**
+ * Lateral inhibition (Synapse-inspired).
+ *
+ * For each node, the top-M higher-activation competitors exert inhibition
+ * proportional to their activation difference. Output is clamped to [0, ∞).
+ *
+ * No sigmoid is applied here — downstream `normalizeGraphActivationScore`
+ * already applies x/(1+x) soft squash, so adding a sigmoid would double-
+ * normalize and cap graph influence at ~50%.
+ *
+ * Formula: u_hat_i = max(0, u_i - beta * sum_{k in top-M where u_k > u_i}(u_k - u_i))
+ *
+ * When beta=0 or topM=0, returns original scores unchanged (no-op).
+ */
+export declare function applyLateralInhibition(scores: Map<string, number>, opts: {
+    beta: number;
+    topM: number;
+}): Map<string, number>;
+//# sourceMappingURL=graph.d.ts.map

package/dist/graph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph.d.ts","sourceRoot":"","sources":["../src/graph.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAOH,OAAO,KAAK,EAAE,8BAA8B,EAAE,MAAM,mBAAmB,CAAC;AACxE,OAAO,EAGL,yBAAyB,EAEzB,KAAK,qBAAqB,EAC3B,MAAM,gCAAgC,CAAC;AACxC,OAAO,EAAE,yBAAyB,EAAE,KAAK,qBAAqB,EAAE,CAAC;AACjE,OAAO,EAEL,kBAAkB,EAClB,kBAAkB,EAEnB,MAAM,uBAAuB,CAAC;AAG/B,MAAM,MAAM,SAAS,GAAG,QAAQ,GAAG,MAAM,GAAG,QAAQ,CAAC;AAErD,MAAM,WAAW,cAAc;IAC7B,0EAA0E;IAC1E,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,iEAAiE;IACjE,eAAe,EAAE,MAAM,EAAE,CAAC;IAC1B,4DAA4D;IAC5D,UAAU,EAAE,SAAS,EAAE,CAAC;CACzB;AAED,MAAM,WAAW,SAAS;IACxB,IAAI,EAAE,MAAM,CAAC;IACb,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,SAAS,CAAC;IAChB,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;IACd,EAAE,EAAE,MAAM,CAAC;IAMX,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,gBAAgB,CAAC,EAAE,MAAM,CAAC;CAC3B;AAED,MAAM,WAAW,WAAW;IAC1B,uBAAuB,EAAE,OAAO,CAAC;IACjC,kBAAkB,EAAE,OAAO,CAAC;IAC5B,gBAAgB,EAAE,OAAO,CAAC;IAC1B,kBAAkB,EAAE,OAAO,CAAC;IAC5B,sBAAsB,EAAE,MAAM,CAAC;IAC/B,oBAAoB,EAAE,MAAM,CAAC;IAC7B,4BAA4B,EAAE,MAAM,CAAC;IACrC,6BAA6B,EAAE,OAAO,CAAC;IACvC,0BAA0B,EAAE,MAAM,CAAC;IACnC,0BAA0B,EAAE,MAAM,CAAC;IACnC;;;;;OAKG;IACH,6BAA6B,EAAE,MAAM,CAAC;IACtC;;;;OAIG;IACH,gCAAgC,EAAE,MAAM,CAAC;IACzC;;;;;;;;;;OAUG;IACH,gCAAgC,CAAC,EAAE,OAAO,CAAC;CAC5C;AAED,kFAAkF;AAClF,eAAO,MAAM,wCAAwC,MAAM,CAAC;AAC5D,6EAA6E;AAC7E,eAAO,MAAM,2CAA2C,IAAI,CAAC;AAG7D,eAAO,MAAM,cAAc,UAA4E,CAAC;AAExG,wBAAgB,SAAS,CAAC,SAAS,EAAE,MAAM,GAAG,MAAM,CAEnD;AAED,wBAAgB,aAAa,CAAC,SAAS,EAAE,MAAM,EAAE,IAAI,EAAE,SAAS,GAAG,MAAM,CAExE;AAED,wBAAsB,eAAe,CAAC,SAAS,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAEtE;AAMD,OAAO,EAAE,kBAAkB,EAAE,kBAAkB,EAAE,CAAC;AAElD,wBAAsB,UAAU,CAAC,SAAS,EAAE,MAAM,EAAE,IAAI,EAAE,SAAS,GAAG,OAAO,CAAC,IAAI,CAAC,CAoBlF;AAoCD;;;;;;;;GAQG;AACH,wBAAsB,SAAS,CAAC,SAAS,EAAE,MAAM,EAAE,IAAI,EAAE,SAAS,GAAG,OAAO,CAAC,SAAS,EAAE,CAAC,CAQxF;AAED;;;;;;GAMG;AACH,wBAAsB,eAAe,CAAC,SAAS,EAAE,MAAM,EAAE,IAAI,EAAE,SAAS,GAAG,OAAO,CAAC,SAAS,EAAE,CAAC,CAW9F;AAED;;GAEG;AACH,wBAAsB,YAAY,CAChC,SAAS,EAAE,MAAM,EACjB,SAAS,EAAE,IAAI,CAAC,8BAA8B,EAAE,aAAa,GAAG,WAAW,GAAG,aAAa,CAAC,GAC3F,OAAO,CAAC,SAAS,EAAE,CAAC,CAOtB;AAED,MAAM,WAAW,oBAAoB;IACnC,IAAI,EAAE,SAAS,CAAC;IAChB,QAAQ,EAAE,MAAM,CAAC;IACjB,MAAM,EAAE,OAAO,CAAC;IAChB,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,EAAE,MAAM,CAAC;IACnB,YAAY,EAAE,MAAM,CAAC;IACrB,WAAW,EAAE,MAAM,CAAC;CACrB;AAED,MAAM,WAAW,iBAAiB;IAChC,WAAW,EAAE,MAAM,CAAC;IACpB,YAAY,EAAE,SAAS,EAAE,CAAC;IAC1B,MAAM,EAAE;QACN,UAAU,EAAE,MAAM,CAAC;QACnB,UAAU,EAAE,MAAM,CAAC;QACnB,YAAY,EAAE,MAAM,CAAC;QACrB,WAAW,EAAE,MAAM,CAAC;KACrB,CAAC;IACF,KAAK,EAAE,oBAAoB,EAAE,CAAC;IAC9B,cAAc,CAAC,EAAE,MAAM,EAAE,CAAC;CAC3B;AAkBD,wBAAsB,kBAAkB,CACtC,SAAS,EAAE,MAAM,EACjB,OAAO,CAAC,EAAE;IACR,kBAAkB,CAAC,EAAE,OAAO,CAAC;IAC7B,gBAAgB,CAAC,EAAE,OAAO,CAAC;IAC3B,kBAAkB,CAAC,EAAE,OAAO,CAAC;IAC7B,qBAAqB,CAAC,EAAE,OAAO,CAAC;CACjC,GACA,OAAO,CAAC,iBAAiB,CAAC,CA4F5B;AAED;;GAEG;AACH,wBAAgB,kBAAkB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAM9D;AAuBD,qBAAa,UAAU;IACrB,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAS;IACnC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAc;IAMlC,OAAO,CAAC,SAAS,CAaD;IAChB,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,iBAAiB,CAAW;gBAExC,SAAS,EAAE,MAAM,EAAE,GAAG,EAAE,WAAW;IAK/C;oFACgF;IAChF,mBAAmB,IAAI,IAAI;YAIb,eAAe;IAyC7B;;;;;;OAMG;YACW,wBAAwB;IAiBtC,0EAA0E;IAC1E,OAAO,CAAC,kBAAkB;IAe1B;;;;;;;;;OASG;YACW,qCAAqC;IA2BnD;;;;;;;;;;;;;;;;OAgBG;IACG,eAAe,CAAC,IAAI,EAAE;QAC1B,UAAU,EAAE,MAAM,CAAC;QACnB,SAAS,CAAC,EAAE,MAAM,CAAC;QACnB,OAAO,EAAE,MAAM,CAAC;QAChB,OAAO,EAAE,MAAM,CAAC;QAChB,QAAQ,CAAC,EAAE,MAAM,CAAC;QAClB,cAAc,CAAC,EAAE,MAAM,EAAE,CAAC;QAC1B,cAAc,CAAC,EAAE,MAAM,EAAE,CAAC;QAC1B,iBAAiB,CAAC,EAAE,MAAM,CAAC;QAC3B;;;;WAIG;QACH,iBAAiB,CAAC,EAAE;YAClB,WAAW,EAAE,OAAO,CAAC;YACrB,SAAS,EAAE,OAAO,CAAC;YACnB,WAAW,EAAE,OAAO,CAAC;YACrB,gBAAgB,EAAE,OAAO,CAAC;SAC3B,CAAC;KACH,GAAG,OAAO,CAAC,SAAS,EAAE,CAAC;IA8GxB;;;;;;;;;;;;;;;;;;;OAmBG;YACW,kCAAkC;IAqDhD;;;;;;;;;;;;;;;;;;;;;OAqBG;IACG,mBAAmB,CACvB,KAAK,EAAE,MAAM,EAAE,EACf,QAAQ,CAAC,EAAE,MAAM,EACjB,IAAI,CAAC,EAAE;QACL;;;;;WAKG;QACH,oBAAoB,CAAC,EAAE,OAAO,CAAC;QAC/B,iEAAiE;QACjE,WAAW,CAAC,EAAE,OAAO,CAAC;QACtB,uEAAuE;QACvE,YAAY,CAAC,EAAE,MAAM,CAAC;KACvB,GACA,OAAO,CACR,KAAK,CAAC;QACJ,IAAI,EAAE,MAAM,CAAC;QACb,KAAK,EAAE,MAAM,CAAC;QACd,IAAI,EAAE,MAAM,CAAC;QACb,QAAQ,EAAE,MAAM,CAAC;QACjB,aAAa,EAAE,MAAM,CAAC;QACtB,SAAS,EAAE,QAAQ,GAAG,MAAM,GAAG,QAAQ,CAAC;QACxC;;;;WAIG;QACH,cAAc,EAAE,MAAM,CAAC;QACvB,cAAc,CAAC,EAAE,cAAc,GAAG,IAAI,CAAC;KACxC,CAAC,CACH;CAiNF;AAED;;;;;;;GAOG;AACH,wBAAgB,oBAAoB,CAAC,GAAG,EAAE,OAAO,GAAG,MAAM,CAOzD;AAED;;;;GAIG;AACH,wBAAgB,uBAAuB,CAAC,GAAG,EAAE,OAAO,GAAG,MAAM,CAI5D;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,uBAAuB,CACrC,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,EAC3B,GAAG,EAAE,GAAG,CAAC,MAAM,EAAE,SAAS,EAAE,CAAC,EAC7B,IAAI,EAAE;IAAE,UAAU,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,MAAM,CAAC;IAAC,YAAY,CAAC,EAAE,MAAM,CAAA;CAAE,GAClF,IAAI,CAoEN;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAgB,sBAAsB,CACpC,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,EAC3B,IAAI,EAAE;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,GACnC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAmBrB"}

package/dist/graph.js

@@ -16,17 +16,17 @@ import {
   readAllEdges,
   readEdges,
   readEdgesStrict
-} from "./chunk-5FAGCOZD.js";
+} from "./chunk-GWK7FEUL.js";
 import {
   GraphLockLostError,
   withGraphWriteLock
 } from "./chunk-EUT2WCWS.js";
+import "./chunk-GKCXTSFF.js";
 import "./chunk-2LSZVONP.js";
 import "./chunk-DEUNUKTD.js";
 import {
   reconstructActivationPath
 } from "./chunk-LXY5VVGM.js";
-import "./chunk-GKCXTSFF.js";
 import "./chunk-FFAZ2XFU.js";
 import "./chunk-KNA3BXXL.js";
 import "./chunk-PZ5AY32C.js";

package/dist/harmonic-construction.d.ts

@@ -1,11 +1,10 @@
-import { AbstractionNode } from './abstraction-nodes.js';
-import { CueAnchorType, CueAnchor } from './cue-anchors.js';
-
-interface HarmonicCueAnchorInput {
+import { type AbstractionNode } from "./abstraction-nodes.js";
+import { type CueAnchor, type CueAnchorType } from "./cue-anchors.js";
+export interface HarmonicCueAnchorInput {
     type: CueAnchorType;
     value: string;
 }
-interface HarmonicConstructionInput {
+export interface HarmonicConstructionInput {
     sessionKey: string;
     recordedAt: string;
     episodeTitle?: string | null;
@@ -25,19 +24,18 @@ interface HarmonicConstructionInput {
         facts?: string[];
     }>;
 }
-declare function harmonicEntitySegment(name: string): string;
-declare function normalizedHarmonicEntityIdentity(name: string): string;
-declare function harmonicEntityReferenceMatches(entityRef: string, entityName: string, allowSegmentFallback: boolean): boolean;
-declare function normalizeCueAnchorInputs(value: unknown, maxAnchors?: number): HarmonicCueAnchorInput[];
-declare function deriveHarmonicRecords(input: HarmonicConstructionInput): {
+export declare function harmonicEntitySegment(name: string): string;
+export declare function normalizedHarmonicEntityIdentity(name: string): string;
+export declare function harmonicEntityReferenceMatches(entityRef: string, entityName: string, allowSegmentFallback: boolean): boolean;
+export declare function normalizeCueAnchorInputs(value: unknown, maxAnchors?: number): HarmonicCueAnchorInput[];
+export declare function deriveHarmonicRecords(input: HarmonicConstructionInput): {
     nodes: AbstractionNode[];
     anchors: CueAnchor[];
 };
-declare function persistHarmonicRecords(options: {
+export declare function persistHarmonicRecords(options: {
     memoryDir: string;
     abstractionNodeStoreDir?: string;
     nodes: AbstractionNode[];
     anchors: CueAnchor[];
 }): Promise<void>;
-
-export { type HarmonicConstructionInput, type HarmonicCueAnchorInput, deriveHarmonicRecords, harmonicEntityReferenceMatches, harmonicEntitySegment, normalizeCueAnchorInputs, normalizedHarmonicEntityIdentity, persistHarmonicRecords };
+//# sourceMappingURL=harmonic-construction.d.ts.map

package/dist/harmonic-construction.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"harmonic-construction.d.ts","sourceRoot":"","sources":["../src/harmonic-construction.ts"],"names":[],"mappings":"AACA,OAAO,EACL,KAAK,eAAe,EAGrB,MAAM,wBAAwB,CAAC;AAChC,OAAO,EAAE,KAAK,SAAS,EAAE,KAAK,aAAa,EAAoB,MAAM,kBAAkB,CAAC;AAKxF,MAAM,WAAW,sBAAsB;IACrC,IAAI,EAAE,aAAa,CAAC;IACpB,KAAK,EAAE,MAAM,CAAC;CACf;AAED,MAAM,WAAW,yBAAyB;IACxC,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,EAAE,MAAM,CAAC;IACnB,YAAY,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IAC7B,cAAc,EAAE,KAAK,CAAC;QACpB,QAAQ,EAAE,MAAM,CAAC;QACjB,OAAO,EAAE,MAAM,CAAC;QAChB,QAAQ,EAAE,MAAM,CAAC;QACjB,IAAI,EAAE,MAAM,EAAE,CAAC;QACf,UAAU,CAAC,EAAE,MAAM,CAAC;QACpB,SAAS,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;QAC1B,UAAU,CAAC,EAAE,sBAAsB,EAAE,GAAG,IAAI,CAAC;QAC7C,OAAO,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;KACzB,CAAC,CAAC;IACH,cAAc,EAAE,KAAK,CAAC;QACpB,IAAI,EAAE,MAAM,CAAC;QACb,IAAI,EAAE,MAAM,CAAC;QACb,KAAK,CAAC,EAAE,MAAM,EAAE,CAAC;KAClB,CAAC,CAAC;CACJ;AAgCD,wBAAgB,qBAAqB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAM1D;AAED,wBAAgB,gCAAgC,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAErE;AACD,wBAAgB,8BAA8B,CAC5C,SAAS,EAAE,MAAM,EACjB,UAAU,EAAE,MAAM,EAClB,oBAAoB,EAAE,OAAO,GAC5B,OAAO,CAKT;AAED,wBAAgB,wBAAwB,CAAC,KAAK,EAAE,OAAO,EAAE,UAAU,SAAI,GAAG,sBAAsB,EAAE,CAwBjG;AAmCD,wBAAgB,qBAAqB,CAAC,KAAK,EAAE,yBAAyB,GAAG;IACvE,KAAK,EAAE,eAAe,EAAE,CAAC;IACzB,OAAO,EAAE,SAAS,EAAE,CAAC;CACtB,CAiMA;AAED,wBAAsB,sBAAsB,CAAC,OAAO,EAAE;IACpD,SAAS,EAAE,MAAM,CAAC;IAClB,uBAAuB,CAAC,EAAE,MAAM,CAAC;IACjC,KAAK,EAAE,eAAe,EAAE,CAAC;IACzB,OAAO,EAAE,SAAS,EAAE,CAAC;CACtB,GAAG,OAAO,CAAC,IAAI,CAAC,CAehB"}

package/dist/harmonic-retrieval.d.ts

@@ -1,12 +1,11 @@
-import { AbstractionNode } from './abstraction-nodes.js';
-import { CueAnchorType, CueAnchor } from './cue-anchors.js';
-
-interface HarmonicMatchedAnchor {
+import { type AbstractionNode } from "./abstraction-nodes.js";
+import { type CueAnchor, type CueAnchorType } from "./cue-anchors.js";
+export interface HarmonicMatchedAnchor {
     anchorId: string;
     anchorType: CueAnchorType;
     anchorValue: string;
 }
-interface HarmonicRetrievalResult {
+export interface HarmonicRetrievalResult {
     node: AbstractionNode;
     score: number;
     nodeScore: number;
@@ -14,15 +13,15 @@ interface HarmonicRetrievalResult {
     matchedFields: string[];
     matchedAnchors: HarmonicMatchedAnchor[];
 }
-declare function readAbstractionNodes(options: {
+export declare function readAbstractionNodes(options: {
     memoryDir: string;
     abstractionNodeStoreDir?: string;
 }): Promise<AbstractionNode[]>;
-declare function readCueAnchors(options: {
+export declare function readCueAnchors(options: {
     memoryDir: string;
     abstractionNodeStoreDir?: string;
 }): Promise<CueAnchor[]>;
-interface ProjectedHarmonicGraph {
+export interface ProjectedHarmonicGraph {
     nodes: AbstractionNode[];
     anchors: CueAnchor[];
 }
@@ -42,7 +41,7 @@ interface ProjectedHarmonicGraph {
  *   one of that node's surviving active sources, and is dropped once no
  *   reference survives.
  */
-declare function readProjectedHarmonicGraph(options: {
+export declare function readProjectedHarmonicGraph(options: {
     memoryDir: string;
     abstractionNodeStoreDir?: string;
     anchorsEnabled: boolean;
@@ -50,7 +49,7 @@ declare function readProjectedHarmonicGraph(options: {
     temporalExpiredInInjection?: boolean;
     nowMs?: number;
 }): Promise<ProjectedHarmonicGraph>;
-declare function searchHarmonicRetrieval(options: {
+export declare function searchHarmonicRetrieval(options: {
     memoryDir: string;
     abstractionNodeStoreDir?: string;
     query: string;
@@ -60,5 +59,4 @@ declare function searchHarmonicRetrieval(options: {
     abortSignal?: AbortSignal;
     temporalExpiredInInjection?: boolean;
 }): Promise<HarmonicRetrievalResult[]>;
-
-export { type HarmonicMatchedAnchor, type HarmonicRetrievalResult, type ProjectedHarmonicGraph, readAbstractionNodes, readCueAnchors, readProjectedHarmonicGraph, searchHarmonicRetrieval };
+//# sourceMappingURL=harmonic-retrieval.d.ts.map

package/dist/harmonic-retrieval.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"harmonic-retrieval.d.ts","sourceRoot":"","sources":["../src/harmonic-retrieval.ts"],"names":[],"mappings":"AAIC,OAAO,EAIL,KAAK,eAAe,EACrB,MAAM,wBAAwB,CAAC;AACjC,OAAO,EAA+C,KAAK,SAAS,EAAE,KAAK,aAAa,EAAE,MAAM,kBAAkB,CAAC;AA0InH,MAAM,WAAW,qBAAqB;IACpC,QAAQ,EAAE,MAAM,CAAC;IACjB,UAAU,EAAE,aAAa,CAAC;IAC1B,WAAW,EAAE,MAAM,CAAC;CACrB;AAED,MAAM,WAAW,uBAAuB;IACtC,IAAI,EAAE,eAAe,CAAC;IACtB,KAAK,EAAE,MAAM,CAAC;IACd,SAAS,EAAE,MAAM,CAAC;IAClB,WAAW,EAAE,MAAM,CAAC;IACpB,aAAa,EAAE,MAAM,EAAE,CAAC;IACxB,cAAc,EAAE,qBAAqB,EAAE,CAAC;CACzC;AA+ED,wBAAsB,oBAAoB,CAAC,OAAO,EAAE;IAClD,SAAS,EAAE,MAAM,CAAC;IAClB,uBAAuB,CAAC,EAAE,MAAM,CAAC;CAClC,GAAG,OAAO,CAAC,eAAe,EAAE,CAAC,CAY7B;AAED,wBAAsB,cAAc,CAAC,OAAO,EAAE;IAC5C,SAAS,EAAE,MAAM,CAAC;IAClB,uBAAuB,CAAC,EAAE,MAAM,CAAC;CAClC,GAAG,OAAO,CAAC,SAAS,EAAE,CAAC,CAavB;AAED,MAAM,WAAW,sBAAsB;IACrC,KAAK,EAAE,eAAe,EAAE,CAAC;IACzB,OAAO,EAAE,SAAS,EAAE,CAAC;CACtB;AAED;;;;;;;;;;;;;;;GAeG;AACH,wBAAsB,0BAA0B,CAAC,OAAO,EAAE;IACxD,SAAS,EAAE,MAAM,CAAC;IAClB,uBAAuB,CAAC,EAAE,MAAM,CAAC;IACjC,cAAc,EAAE,OAAO,CAAC;IACxB,WAAW,CAAC,EAAE,WAAW,CAAC;IAC1B,0BAA0B,CAAC,EAAE,OAAO,CAAC;IACrC,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB,GAAG,OAAO,CAAC,sBAAsB,CAAC,CA2ClC;AAED,wBAAsB,uBAAuB,CAAC,OAAO,EAAE;IACrD,SAAS,EAAE,MAAM,CAAC;IAClB,uBAAuB,CAAC,EAAE,MAAM,CAAC;IACjC,KAAK,EAAE,MAAM,CAAC;IACd,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,cAAc,EAAE,OAAO,CAAC;IACxB,WAAW,CAAC,EAAE,WAAW,CAAC;IAC1B,0BAA0B,CAAC,EAAE,OAAO,CAAC;CACtC,GAAG,OAAO,CAAC,uBAAuB,EAAE,CAAC,CAiFrC"}

package/dist/harmonic-retrieval.js

@@ -3,7 +3,7 @@ import {
   readCueAnchors,
   readProjectedHarmonicGraph,
   searchHarmonicRetrieval
-} from "./chunk-TQT4AOPO.js";
+} from "./chunk-RN6ZCNM5.js";
 import "./chunk-BMWN7B3Y.js";
 import "./chunk-6CIAGZ6X.js";
 import "./chunk-YCVB7X56.js";

package/dist/himem.d.ts

@@ -8,7 +8,7 @@
  * Based on the HiMem paper: episodes are ephemeral, notes are reconsolidated
  * into a stable belief layer. This classification gates reconsolidation.
  */
-type MemoryKind = "episode" | "note";
+export type MemoryKind = "episode" | "note";
 /**
  * Classify a memory fact as "episode" (time-specific event) or "note"
  * (stable belief/preference/decision).
@@ -18,6 +18,5 @@ type MemoryKind = "episode" | "note";
  * @param category  - Category from extraction
  * @returns "episode" | "note"
  */
-declare function classifyMemoryKind(content: string, tags: string[], category: string): MemoryKind;
-
-export { type MemoryKind, classifyMemoryKind };
+export declare function classifyMemoryKind(content: string, tags: string[], category: string): MemoryKind;
+//# sourceMappingURL=himem.d.ts.map

package/dist/himem.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"himem.d.ts","sourceRoot":"","sources":["../src/himem.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,MAAM,MAAM,UAAU,GAAG,SAAS,GAAG,MAAM,CAAC;AAuF5C;;;;;;;;GAQG;AACH,wBAAgB,kBAAkB,CAChC,OAAO,EAAE,MAAM,EACf,IAAI,EAAE,MAAM,EAAE,EACd,QAAQ,EAAE,MAAM,GACf,UAAU,CAyCZ"}

package/dist/host-embedding-provider.d.ts

@@ -1,5 +1,5 @@
-type HostEmbeddingInputType = "query" | "document" | "semantic" | "classification" | "clustering";
-interface HostEmbeddingProvider {
+export type HostEmbeddingInputType = "query" | "document" | "semantic" | "classification" | "clustering";
+export interface HostEmbeddingProvider {
     id: string;
     model?: string;
     dimensions?: number;
@@ -13,9 +13,8 @@ interface HostEmbeddingProvider {
     }): Promise<Array<ArrayLike<number> | null>>;
     close?: () => Promise<void> | void;
 }
-declare function registerHostEmbeddingProvider(scope: string, provider: HostEmbeddingProvider): () => void;
-declare function getHostEmbeddingProvider(scope: string): HostEmbeddingProvider | undefined;
-declare function clearHostEmbeddingProvidersForTest(): void;
-declare function normalizeHostEmbeddingVector(value: unknown): number[] | null;
-
-export { type HostEmbeddingInputType, type HostEmbeddingProvider, clearHostEmbeddingProvidersForTest, getHostEmbeddingProvider, normalizeHostEmbeddingVector, registerHostEmbeddingProvider };
+export declare function registerHostEmbeddingProvider(scope: string, provider: HostEmbeddingProvider): () => void;
+export declare function getHostEmbeddingProvider(scope: string): HostEmbeddingProvider | undefined;
+export declare function clearHostEmbeddingProvidersForTest(): void;
+export declare function normalizeHostEmbeddingVector(value: unknown): number[] | null;
+//# sourceMappingURL=host-embedding-provider.d.ts.map

package/dist/host-embedding-provider.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"host-embedding-provider.d.ts","sourceRoot":"","sources":["../src/host-embedding-provider.ts"],"names":[],"mappings":"AAAA,MAAM,MAAM,sBAAsB,GAC9B,OAAO,GACP,UAAU,GACV,UAAU,GACV,gBAAgB,GAChB,YAAY,CAAC;AAEjB,MAAM,WAAW,qBAAqB;IACpC,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,KAAK,CACH,IAAI,EAAE,MAAM,EACZ,OAAO,CAAC,EAAE;QAAE,MAAM,CAAC,EAAE,WAAW,CAAC;QAAC,SAAS,CAAC,EAAE,sBAAsB,CAAA;KAAE,GACrE,OAAO,CAAC,SAAS,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC;IACrC,UAAU,CAAC,CACT,KAAK,EAAE,MAAM,EAAE,EACf,OAAO,CAAC,EAAE;QAAE,MAAM,CAAC,EAAE,WAAW,CAAC;QAAC,SAAS,CAAC,EAAE,sBAAsB,CAAA;KAAE,GACrE,OAAO,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;IAC5C,KAAK,CAAC,EAAE,MAAM,OAAO,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;CACpC;AAiBD,wBAAgB,6BAA6B,CAC3C,KAAK,EAAE,MAAM,EACb,QAAQ,EAAE,qBAAqB,GAC9B,MAAM,IAAI,CAeZ;AAED,wBAAgB,wBAAwB,CACtC,KAAK,EAAE,MAAM,GACZ,qBAAqB,GAAG,SAAS,CAEnC;AAED,wBAAgB,kCAAkC,IAAI,IAAI,CAEzD;AAED,wBAAgB,4BAA4B,CAAC,KAAK,EAAE,OAAO,GAAG,MAAM,EAAE,GAAG,IAAI,CAW5E"}

package/dist/http-retry.d.ts

@@ -12,7 +12,7 @@
  * Import via the `@remnic/core/http-retry` subpath (same pattern as
  * `@remnic/core/abort-error`) — the root index stays untouched.
  */
-interface RetryingFetchOptions {
+export interface RetryingFetchOptions {
     /** Request init for every attempt. Ignored when `buildInit` is set. */
     init?: RequestInit;
     /**
@@ -43,7 +43,7 @@ interface RetryingFetchOptions {
     /** Wraps a retryable (429/5xx) response; thrown when retries are exhausted. */
     retryableError: (response: Response) => Error | Promise<Error>;
 }
-interface NetworkErrorContext {
+export interface NetworkErrorContext {
     /** True when the helper's own timeout signal fired (not a caller abort). */
     timedOut: boolean;
 }
@@ -51,7 +51,7 @@ interface NetworkErrorContext {
  * Base class for connector API errors: a message plus optional HTTP
  * status and vendor detail. Vendor subclasses set their own `name`.
  */
-declare class ConnectorApiError extends Error {
+export declare class ConnectorApiError extends Error {
     readonly status?: number | undefined;
     readonly detail?: string | undefined;
     constructor(message: string, status?: number | undefined, detail?: string | undefined);
@@ -61,23 +61,22 @@ declare class ConnectorApiError extends Error {
  * paths or stack fragments; sync errors reach MCP clients verbatim, so
  * only the error name + code survive.
  */
-declare function describeNetworkError(err: unknown): string;
+export declare function describeNetworkError(err: unknown): string;
 /** Loop instead of `/\/+$/` — CodeQL js/polynomial-redos on user-set URLs. */
-declare function stripTrailingSlashes(value: string): string;
+export declare function stripTrailingSlashes(value: string): string;
 /** Release the socket back to the pool: an unconsumed response body pins the undici connection. */
-declare function discardResponseBody(response: Response): void;
+export declare function discardResponseBody(response: Response): void;
 /**
  * Parse a `Retry-After` header as delay in ms, capped at `capMs`:
  * delay-seconds first, then HTTP-date. `undefined` when absent or
  * unparseable.
  */
-declare function retryAfterHeaderMs(response: Response, capMs: number): number | undefined;
+export declare function retryAfterHeaderMs(response: Response, capMs: number): number | undefined;
 /**
  * Fetch with retries on network failures, 429, and 5xx. Returns the
  * final response (ok or non-retryable status) for the caller to
  * interpret; throws the vendor-wrapped error when retries are exhausted
  * or the transport fails.
  */
-declare function retryingFetch(url: string, options: RetryingFetchOptions): Promise<Response>;
-
-export { ConnectorApiError, type NetworkErrorContext, type RetryingFetchOptions, describeNetworkError, discardResponseBody, retryAfterHeaderMs, retryingFetch, stripTrailingSlashes };
+export declare function retryingFetch(url: string, options: RetryingFetchOptions): Promise<Response>;
+//# sourceMappingURL=http-retry.d.ts.map

package/dist/http-retry.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"http-retry.d.ts","sourceRoot":"","sources":["../src/http-retry.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,MAAM,WAAW,oBAAoB;IACnC,uEAAuE;IACvE,IAAI,CAAC,EAAE,WAAW,CAAC;IACnB;;;;;;OAMG;IACH,SAAS,CAAC,EAAE,MAAM,WAAW,GAAG,OAAO,CAAC,WAAW,CAAC,CAAC;IACrD,SAAS,CAAC,EAAE,OAAO,KAAK,CAAC;IACzB,KAAK,CAAC,EAAE,CAAC,EAAE,EAAE,MAAM,KAAK,OAAO,CAAC,IAAI,CAAC,CAAC;IACtC,MAAM,CAAC,EAAE,WAAW,CAAC;IACrB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,qEAAqE;IACrE,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,eAAe,CAAC,EAAE,MAAM,CAAC;IACzB,8DAA8D;IAC9D,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB;;;;OAIG;IACH,YAAY,CAAC,EAAE,CAAC,QAAQ,EAAE,QAAQ,KAAK,MAAM,GAAG,IAAI,GAAG,SAAS,GAAG,OAAO,CAAC,MAAM,GAAG,IAAI,GAAG,SAAS,CAAC,CAAC;IACtG,wEAAwE;IACxE,YAAY,EAAE,CAAC,GAAG,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,mBAAmB,KAAK,KAAK,CAAC;IACtF,+EAA+E;IAC/E,cAAc,EAAE,CAAC,QAAQ,EAAE,QAAQ,KAAK,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC;CAChE;AAED,MAAM,WAAW,mBAAmB;IAClC,4EAA4E;IAC5E,QAAQ,EAAE,OAAO,CAAC;CACnB;AAED;;;GAGG;AACH,qBAAa,iBAAkB,SAAQ,KAAK;IAGxC,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM;IACxB,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM;gBAFxB,OAAO,EAAE,MAAM,EACN,MAAM,CAAC,EAAE,MAAM,YAAA,EACf,MAAM,CAAC,EAAE,MAAM,YAAA;CAK3B;AAaD;;;;GAIG;AACH,wBAAgB,oBAAoB,CAAC,GAAG,EAAE,OAAO,GAAG,MAAM,CAIzD;AAED,8EAA8E;AAC9E,wBAAgB,oBAAoB,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAI1D;AAED,mGAAmG;AACnG,wBAAgB,mBAAmB,CAAC,QAAQ,EAAE,QAAQ,GAAG,IAAI,CAE5D;AAED;;;;GAIG;AACH,wBAAgB,kBAAkB,CAAC,QAAQ,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS,CAYxF;AAED;;;;;GAKG;AACH,wBAAsB,aAAa,CACjC,GAAG,EAAE,MAAM,EACX,OAAO,EAAE,oBAAoB,GAC5B,OAAO,CAAC,QAAQ,CAAC,CAqDnB"}

package/dist/hygiene.d.ts

@@ -1,17 +1,17 @@
-type HygieneWarning = {
+export type HygieneWarning = {
     path: string;
     bytes: number;
     budgetBytes: number;
     warnAtBytes: number;
     message: string;
 };
-declare function lintWorkspaceFiles(opts: {
+export declare function lintWorkspaceFiles(opts: {
     workspaceDir: string;
     paths: string[];
     budgetBytes: number;
     warnRatio: number;
 }): Promise<HygieneWarning[]>;
-declare function rotateMarkdownFileToArchive(opts: {
+export declare function rotateMarkdownFileToArchive(opts: {
     filePath: string;
     archiveDir: string;
     archivePrefix: string;
@@ -20,5 +20,4 @@ declare function rotateMarkdownFileToArchive(opts: {
     archivedPath: string;
     newContent: string;
 }>;
-
-export { type HygieneWarning, lintWorkspaceFiles, rotateMarkdownFileToArchive };
+//# sourceMappingURL=hygiene.d.ts.map

package/dist/hygiene.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"hygiene.d.ts","sourceRoot":"","sources":["../src/hygiene.ts"],"names":[],"mappings":"AAGA,MAAM,MAAM,cAAc,GAAG;IAC3B,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,CAAC;IACd,WAAW,EAAE,MAAM,CAAC;IACpB,WAAW,EAAE,MAAM,CAAC;IACpB,OAAO,EAAE,MAAM,CAAC;CACjB,CAAC;AAOF,wBAAsB,kBAAkB,CAAC,IAAI,EAAE;IAC7C,YAAY,EAAE,MAAM,CAAC;IACrB,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,WAAW,EAAE,MAAM,CAAC;IACpB,SAAS,EAAE,MAAM,CAAC;CACnB,GAAG,OAAO,CAAC,cAAc,EAAE,CAAC,CAyB5B;AAED,wBAAsB,2BAA2B,CAAC,IAAI,EAAE;IACtD,QAAQ,EAAE,MAAM,CAAC;IACjB,UAAU,EAAE,MAAM,CAAC;IACnB,aAAa,EAAE,MAAM,CAAC;IACtB,aAAa,EAAE,MAAM,CAAC;CACvB,GAAG,OAAO,CAAC;IAAE,YAAY,EAAE,MAAM,CAAC;IAAC,UAAU,EAAE,MAAM,CAAA;CAAE,CAAC,CAgCxD"}