@graphrefly/graphrefly 0.44.0 → 0.45.0

package/dist/index-BIYAkbAi.d.cts

@@ -1,26 +0,0 @@
-import { C as CatchOptions, a as ClassifyResult, D as Decision, b as DecisionAction, G as GateController, c as GateOptions, P as PipelineGraph, S as StepRef, T as TerminalCause, d as decisionKeyOf, p as pipelineGraph } from './pipeline-graph-CIKhynsF.cjs';
-
-/**
- * Orchestration patterns (roadmap §4.1).
- *
- * Domain-layer helpers that build workflow shapes on top of core + extra primitives.
- * Exported under the `patterns.orchestration` namespace to avoid collisions with
- * Phase 2 operator names (for example `gate`, `forEach`).
- */
-
-declare const index_CatchOptions: typeof CatchOptions;
-declare const index_ClassifyResult: typeof ClassifyResult;
-declare const index_Decision: typeof Decision;
-declare const index_DecisionAction: typeof DecisionAction;
-declare const index_GateController: typeof GateController;
-declare const index_GateOptions: typeof GateOptions;
-declare const index_PipelineGraph: typeof PipelineGraph;
-declare const index_StepRef: typeof StepRef;
-declare const index_TerminalCause: typeof TerminalCause;
-declare const index_decisionKeyOf: typeof decisionKeyOf;
-declare const index_pipelineGraph: typeof pipelineGraph;
-declare namespace index {
-  export { index_CatchOptions as CatchOptions, index_ClassifyResult as ClassifyResult, index_Decision as Decision, index_DecisionAction as DecisionAction, index_GateController as GateController, index_GateOptions as GateOptions, index_PipelineGraph as PipelineGraph, index_StepRef as StepRef, index_TerminalCause as TerminalCause, index_decisionKeyOf as decisionKeyOf, index_pipelineGraph as pipelineGraph };
-}
-
-export { index as i };

package/dist/index-BQSKmbuG.d.cts

@@ -1,127 +0,0 @@
-import { N as Node } from './node-kK3CvTrR.cjs';
-
-/**
- * A Nanostores-compatible atom.
- *
- * @category compat
- */
-interface NanoAtom<T> {
-    /** Get current value. */
-    get(): T;
-    /** Set a new value (writable atoms only). */
-    set(value: T): void;
-    /** Subscribe to value changes. Callback receives the new value.
-     * Returns unsubscribe function. Called immediately with current value. */
-    subscribe(cb: (value: T) => void): () => void;
-    /** Listen to value changes (no immediate call). Returns unsubscribe. */
-    listen(cb: (value: T) => void): () => void;
-    /** The underlying GraphReFly node. */
-    readonly _node: Node<T>;
-}
-/**
- * A Nanostores-compatible computed store.
- *
- * @category compat
- */
-interface NanoComputed<T> {
-    /** Get current value. */
-    get(): T;
-    /** Subscribe to value changes. Called immediately with current value.
-     * Returns unsubscribe function. */
-    subscribe(cb: (value: T) => void): () => void;
-    /** Listen to value changes (no immediate call). Returns unsubscribe. */
-    listen(cb: (value: T) => void): () => void;
-    /** The underlying GraphReFly node. */
-    readonly _node: Node<T>;
-}
-/**
- * A Nanostores-compatible map.
- *
- * @category compat
- */
-interface NanoMap<T extends Record<string, unknown>> extends NanoAtom<T> {
-    /** Set a single key. */
-    setKey<K extends keyof T>(key: K, value: T[K]): void;
-}
-/**
- * Creates a nanostores-compatible atom.
- *
- * @param initial - Initial value.
- * @returns `NanoAtom<T>`
- *
- * @category compat
- */
-declare function atom<T>(initial: T): NanoAtom<T>;
-/**
- * Creates a nanostores-compatible computed store.
- *
- * @param stores - One or more atoms/computed stores.
- * @param fn - Compute function.
- * @returns `NanoComputed<T>`
- *
- * @category compat
- */
-declare function computed<T, A>(storeA: NanoAtom<A> | NanoComputed<A>, fn: (a: A) => T): NanoComputed<T>;
-declare function computed<T, A, B>(stores: [NanoAtom<A> | NanoComputed<A>, NanoAtom<B> | NanoComputed<B>], fn: (a: A, b: B) => T): NanoComputed<T>;
-declare function computed<T, A, B, C>(stores: [
-    NanoAtom<A> | NanoComputed<A>,
-    NanoAtom<B> | NanoComputed<B>,
-    NanoAtom<C> | NanoComputed<C>
-], fn: (a: A, b: B, c: C) => T): NanoComputed<T>;
-/**
- * Creates a nanostores-compatible map.
- *
- * @param initial - Initial object value.
- * @returns `NanoMap<T>`
- *
- * @category compat
- */
-declare function map<T extends Record<string, unknown>>(initial: T): NanoMap<T>;
-/**
- * Returns the current value of the store.
- *
- * @category compat
- */
-declare function getValue<T>(store: NanoAtom<T> | NanoComputed<T>): T;
-/**
- * Adds a listener for the store start (first listener connected).
- *
- * @category compat
- */
-declare function onStart(store: NanoAtom<any> | NanoComputed<any>, cb: () => void): void;
-/**
- * Adds a listener for the store stop (last listener disconnected).
- *
- * @category compat
- */
-declare function onStop(store: NanoAtom<any> | NanoComputed<any>, cb: () => void): void;
-/**
- * Adds a listener for the store mount (first listener connected).
- *
- * @returns A cleanup function called when the last listener is removed.
- * @category compat
- */
-declare function onMount(store: NanoAtom<any> | NanoComputed<any>, cb: () => (() => void) | undefined): void;
-/**
- * Batches multiple store updates.
- *
- * @category compat
- */
-declare function action<Args extends any[], Return>(_store: NanoAtom<any> | NanoComputed<any>, _name: string, fn: (...args: Args) => Return): (...args: Args) => Return;
-
-type index_NanoAtom<T> = NanoAtom<T>;
-type index_NanoComputed<T> = NanoComputed<T>;
-type index_NanoMap<T extends Record<string, unknown>> = NanoMap<T>;
-declare const index_action: typeof action;
-declare const index_atom: typeof atom;
-declare const index_computed: typeof computed;
-declare const index_getValue: typeof getValue;
-declare const index_map: typeof map;
-declare const index_onMount: typeof onMount;
-declare const index_onStart: typeof onStart;
-declare const index_onStop: typeof onStop;
-declare namespace index {
-  export { type index_NanoAtom as NanoAtom, type index_NanoComputed as NanoComputed, type index_NanoMap as NanoMap, index_action as action, index_atom as atom, index_computed as computed, index_getValue as getValue, index_map as map, index_onMount as onMount, index_onStart as onStart, index_onStop as onStop };
-}
-
-export { type NanoAtom as N, type NanoComputed as a, type NanoMap as b, action as c, atom as d, computed as e, onStart as f, getValue as g, onStop as h, index as i, map as m, onMount as o };

package/dist/index-BaQaY_IQ.d.cts

@@ -1,231 +0,0 @@
-import { N as Node } from './node-kK3CvTrR.cjs';
-import { a as GraphOptions, G as Graph } from './graph-CWvEUQAq.cjs';
-
-/**
- * Domain templates (roadmap §8.2).
- *
- * Opinionated Graph factories for common "info → action" domains.
- * Each template wires up §8.1 reduction primitives (stratify, funnel, feedback,
- * budgetGate, scorer) with domain-specific stages. Users fork/extend by
- * accessing named nodes and swapping stages.
- *
- * **Source injection (option B):** templates accept a `source` node, not a
- * hardcoded adapter. Pass `fromOTel(...)`, `fromGitHook(...)`, or a test
- * `state()` — the topology is the same.
- *
- * @module
- */
-
-/** Stratification branch config for observability signals. */
-type ObservabilityBranch = {
-    name: string;
-    classify: (value: unknown) => boolean;
-};
-/** Options for {@link observabilityGraph}. */
-type ObservabilityGraphOptions = GraphOptions & {
-    /** Ingested signal source (e.g. fromOTel(...) or test state). */
-    source: Node<unknown>;
-    /**
-     * Classification rules for signal stratification.
-     * Default: errors / traces / metrics branches.
-     */
-    branches?: ObservabilityBranch[];
-    /**
-     * Correlation function: receives stratified branch values and produces
-     * correlated insights. Default: identity pass-through.
-     */
-    correlate?: (values: unknown[]) => unknown;
-    /**
-     * SLO verification function: returns a verification result for a
-     * correlated insight. Default: always passes.
-     */
-    sloCheck?: (value: unknown) => unknown;
-    /**
-     * Scorer weights for alert prioritization. One per branch.
-     * Default: equal weights [1, 1, 1].
-     */
-    weights?: number[];
-    /** Max feedback iterations for false-positive learning. Default: 5. */
-    maxFeedbackIterations?: number;
-};
-/**
- * OTel ingest → stratified reduction → correlation → SLO verification →
- * alert prioritization → output.
- *
- * Well-known node names:
- * - `"source"` — injected signal source
- * - `"stratify::branch/<name>"` — per-branch classification
- * - `"correlate"` — cross-branch correlation
- * - `"slo_value"`, `"slo_verified"` — SLO verification pair
- * - `"alerts"` — scored, prioritized output
- * - `"output"` — final output (alias for alerts)
- *
- * @category patterns
- */
-declare function observabilityGraph(name: string, opts: ObservabilityGraphOptions): Graph;
-/** A structured issue extracted from raw findings. */
-type ExtractedIssue = {
-    id: string;
-    title: string;
-    severity: number;
-    source: string;
-    raw: unknown;
-};
-/** Options for {@link issueTrackerGraph}. */
-type IssueTrackerGraphOptions = GraphOptions & {
-    /** Findings source (e.g. fromGitHook(...), fromFSWatch(...)). */
-    source: Node<unknown>;
-    /**
-     * Extract structured issues from raw findings.
-     * Default: wraps raw value as a single issue.
-     */
-    extract?: (raw: unknown) => ExtractedIssue;
-    /**
-     * Verify an extracted issue (assertion check).
-     * Default: always valid.
-     */
-    verify?: (issue: ExtractedIssue) => unknown;
-    /**
-     * Detect regression by comparing against known patterns.
-     * Receives (current issue, known patterns).
-     * Default: no regression detected.
-     */
-    detectRegression?: (issue: ExtractedIssue, known: unknown) => unknown;
-    /** Max feedback iterations for re-scanning. Default: 3. */
-    maxFeedbackIterations?: number;
-};
-/**
- * Findings ingest → extraction → verification → regression detection →
- * distillation → prioritized queue.
- *
- * Well-known node names:
- * - `"source"` — injected findings source
- * - `"extract"` — structured issue extraction
- * - `"verify"` — issue verification
- * - `"known_patterns"` — accumulated known issue patterns (state)
- * - `"regression"` — regression detection
- * - `"priority"` — severity-based prioritization
- * - `"output"` — final prioritized output
- *
- * @category patterns
- */
-declare function issueTrackerGraph(name: string, opts: IssueTrackerGraphOptions): Graph;
-/** Classification result from LLM moderation. */
-type ModerationResult = {
-    label: "safe" | "review" | "block";
-    confidence: number;
-    reason?: string;
-    original: unknown;
-};
-/** Options for {@link contentModerationGraph}. */
-type ContentModerationGraphOptions = GraphOptions & {
-    /** Content source (text/multimedia ingest). */
-    source: Node<unknown>;
-    /**
-     * Classification function: returns a ModerationResult.
-     * Default: labels everything "review" with confidence 0.5.
-     */
-    classify?: (content: unknown) => ModerationResult;
-    /** System prompt for LLM classification. */
-    systemPrompt?: string;
-    /** Scorer weights: [safe, review, block]. Default: [0.1, 1, 2]. */
-    weights?: [number, number, number];
-    /** Max feedback iterations for policy refinement. Default: 5. */
-    maxFeedbackIterations?: number;
-    /** Max review queue size. When set, oldest entries are trimmed on overflow. */
-    maxQueueSize?: number;
-};
-/**
- * Content ingest → LLM/rule classification → stratified routing (safe/review/block) →
- * human review queue → scorer → feedback (false positives → policy refinement) → output.
- *
- * Well-known node names:
- * - `"source"` — content ingest
- * - `"classify"` — LLM or rule-based classification
- * - `"stratify::branch/safe"`, `"stratify::branch/review"`, `"stratify::branch/block"` — routed branches
- * - `"review_queue"` — state node for human review items
- * - `"priority"` — scored priority output
- * - `"policy"` — writable state for policy refinement
- * - `"output"` — final moderation output
- *
- * @category patterns
- */
-declare function contentModerationGraph(name: string, opts: ContentModerationGraphOptions): Graph;
-/** Schema validation result. */
-type ValidationResult = {
-    valid: boolean;
-    errors: string[];
-    record: unknown;
-};
-/** Anomaly detection result. */
-type AnomalyResult = {
-    anomaly: boolean;
-    score: number;
-    detail?: string;
-    record: unknown;
-};
-/** Options for {@link dataQualityGraph}. */
-type DataQualityGraphOptions = GraphOptions & {
-    /** Data source (e.g. fromPrisma(...), fromKysely(...)). */
-    source: Node<unknown>;
-    /**
-     * Schema validation function.
-     * Default: always valid.
-     */
-    validate?: (record: unknown) => ValidationResult;
-    /**
-     * Anomaly detection function.
-     * Default: no anomaly.
-     */
-    detectAnomaly?: (record: unknown) => AnomalyResult;
-    /**
-     * Drift detection: compares current record against baseline.
-     * Default: no drift.
-     */
-    detectDrift?: (record: unknown, baseline: unknown) => unknown;
-    /**
-     * Remediation suggestion function.
-     * Default: no suggestion.
-     */
-    suggest?: (result: {
-        validation: ValidationResult;
-        anomaly: AnomalyResult;
-    }) => unknown;
-    /** Max feedback iterations for rule refinement. Default: 3. */
-    maxFeedbackIterations?: number;
-};
-/**
- * Data ingest → schema validation → anomaly detection → drift alerting →
- * auto-remediation suggestions → output.
- *
- * Well-known node names:
- * - `"source"` — data ingest
- * - `"validate"` — schema validation
- * - `"anomaly"` — anomaly detection
- * - `"baseline"` — rolling baseline state
- * - `"drift"` — drift detection
- * - `"remediate"` — auto-remediation suggestions
- * - `"output"` — combined quality report
- *
- * @category patterns
- */
-declare function dataQualityGraph(name: string, opts: DataQualityGraphOptions): Graph;
-
-type index_AnomalyResult = AnomalyResult;
-type index_ContentModerationGraphOptions = ContentModerationGraphOptions;
-type index_DataQualityGraphOptions = DataQualityGraphOptions;
-type index_ExtractedIssue = ExtractedIssue;
-type index_IssueTrackerGraphOptions = IssueTrackerGraphOptions;
-type index_ModerationResult = ModerationResult;
-type index_ObservabilityBranch = ObservabilityBranch;
-type index_ObservabilityGraphOptions = ObservabilityGraphOptions;
-type index_ValidationResult = ValidationResult;
-declare const index_contentModerationGraph: typeof contentModerationGraph;
-declare const index_dataQualityGraph: typeof dataQualityGraph;
-declare const index_issueTrackerGraph: typeof issueTrackerGraph;
-declare const index_observabilityGraph: typeof observabilityGraph;
-declare namespace index {
-  export { type index_AnomalyResult as AnomalyResult, type index_ContentModerationGraphOptions as ContentModerationGraphOptions, type index_DataQualityGraphOptions as DataQualityGraphOptions, type index_ExtractedIssue as ExtractedIssue, type index_IssueTrackerGraphOptions as IssueTrackerGraphOptions, type index_ModerationResult as ModerationResult, type index_ObservabilityBranch as ObservabilityBranch, type index_ObservabilityGraphOptions as ObservabilityGraphOptions, type index_ValidationResult as ValidationResult, index_contentModerationGraph as contentModerationGraph, index_dataQualityGraph as dataQualityGraph, index_issueTrackerGraph as issueTrackerGraph, index_observabilityGraph as observabilityGraph };
-}
-
-export { type AnomalyResult as A, type ContentModerationGraphOptions as C, type DataQualityGraphOptions as D, type ExtractedIssue as E, type IssueTrackerGraphOptions as I, type ModerationResult as M, type ObservabilityBranch as O, type ValidationResult as V, type ObservabilityGraphOptions as a, issueTrackerGraph as b, contentModerationGraph as c, dataQualityGraph as d, index as i, observabilityGraph as o };

package/dist/index-BmZXHqkE.d.ts

@@ -1,36 +0,0 @@
-import { N as Node } from './node-kK3CvTrR.js';
-
-/** Solid accessor function — returns current value when called. */
-type Accessor<T> = () => T;
-/**
- * Subscribe to a `Node<T>` as a Solid signal. Auto-cleans up with the owning scope.
- * Subscription lifecycle is tied to Solid scope cleanup (not node terminal messages).
- */
-declare function useSubscribe<T>(node: Node<T>): Accessor<T | undefined | null>;
-/**
- * Bind a writable `Node<T>` as a Solid resource tuple `[accessor, setter]`.
- * Setter always forwards `[[DIRTY], [DATA, value]]`, including `value === undefined`.
- * Subscription lifecycle is tied to Solid scope cleanup (not node terminal messages).
- */
-declare function useStore<T>(node: Node<T>): [Accessor<T | undefined | null>, (v: T) => void];
-/** Maps a key to an object of nodes. Used by `useSubscribeRecord`. */
-type NodeFactory<K, R extends Record<string, any>> = (key: K) => {
-    [P in keyof R]: Node<R[P]>;
-};
-/**
- * Subscribe to a dynamic set of keyed node records as a Solid accessor.
- * Re-subscribes all per-key fields whenever `keys` changes.
- * Key re-sync is gated to settled batches (`messageTier >= 3`) to avoid DIRTY-phase churn.
- */
-declare function useSubscribeRecord<K extends string, R extends Record<string, any>>(keysNode: Node<K[]>, factory: NodeFactory<K, R>): Accessor<Record<K, R>>;
-
-type index_Accessor<T> = Accessor<T>;
-type index_NodeFactory<K, R extends Record<string, any>> = NodeFactory<K, R>;
-declare const index_useStore: typeof useStore;
-declare const index_useSubscribe: typeof useSubscribe;
-declare const index_useSubscribeRecord: typeof useSubscribeRecord;
-declare namespace index {
-  export { type index_Accessor as Accessor, type index_NodeFactory as NodeFactory, index_useStore as useStore, index_useSubscribe as useSubscribe, index_useSubscribeRecord as useSubscribeRecord };
-}
-
-export { type Accessor as A, type NodeFactory as N, useSubscribe as a, useSubscribeRecord as b, index as i, useStore as u };