cognitive-core 0.2.4 → 0.3.1

package/dist/memory/playbook.d.ts

@@ -5,9 +5,12 @@
  * Uses SqlitePersistence for storage and InvertedIndex
  * for fast candidate narrowing before similarity scoring.
  */
-import type { Playbook, PlaybookOrigin } from '../types/index.js';
+import type { Playbook, PlaybookOrigin, Experience } from '../types/index.js';
 import { createPlaybook } from '../types/index.js';
-import type { SqlitePersistence } from '../persistence/index.js';
+import type { SqlitePersistence, PlaybookFrontierRow } from '../persistence/index.js';
+import type { EmbeddingProvider } from '../embeddings/provider.js';
+import { type FusionStrategy as SkillTreeFusionStrategy } from 'skill-tree';
+import type { PlaybookApplicabilityDecision } from './playbook-applicability.js';
 /**
  * Match result for playbook retrieval
  */
@@ -15,7 +18,42 @@ export interface PlaybookMatch {
     playbook: Playbook;
     score: number;
     matchType: 'situation' | 'trigger' | 'domain';
+    /** Retrieval implementation that produced the match, for diagnostics. */
+    retrievalMethod?: 'legacy' | 'frontier' | 'skill-tree-hybrid';
+    /** Query-time serving decision when the applicability gate is enabled. */
+    applicabilityDecision?: PlaybookApplicabilityDecision;
 }
+/**
+ * A playbook with its Pareto-frontier contribution stats.
+ */
+export interface FrontierMember {
+    playbook: Playbook;
+    /** Number of (sig, experience) pairs this playbook tops in the queried scope */
+    totalWins: number;
+    /** Subset of totalWins where it tops uniquely (no tie) */
+    uniqueWins: number;
+}
+export interface StructuralPlaybookWriter {
+    write(playbook: Playbook): Promise<string>;
+    delete(playbook: Pick<Playbook, 'id' | 'name'>): Promise<void>;
+    /** Write the rebuildable operational-state sidecar (.ccore/state.json). */
+    writeState(playbook: Playbook): Promise<void>;
+}
+/**
+ * Objective preference for multi-objective Pareto routing.
+ *
+ *   - `'best'` (default): single-objective dominance using the quality
+ *     frontier — current behavior.
+ *   - `'cheap'`: cartesian dominance restricted to the `cost` objective.
+ *   - `'fast'`: cartesian dominance restricted to the `latency` objective.
+ *   - `{ objectives: [...] }`: cartesian dominance restricted to the
+ *     given objective set. Pass a single-element array for single-axis
+ *     selection, multi-element for multi-objective Pareto on a custom
+ *     subset of recorded objectives.
+ */
+export type ObjectivePreference = 'best' | 'cheap' | 'fast' | {
+    objectives: string[];
+};
 /**
  * Options for finding matching playbooks
  */
@@ -27,6 +65,8 @@ export interface FindMatchingOptions {
     minScore?: number;
     /** MMR lambda: 0.0 = pure diversity, 1.0 = pure relevance (default: 1.0 — no MMR) */
     lambda?: number;
+    /** skill-tree hybrid retrieval ordering fusion (when supported by caller). */
+    fusion?: SkillTreeFusionStrategy;
 }
 /**
  * Playbook Library - Store and retrieve adaptive guidance
@@ -36,14 +76,119 @@ export declare class PlaybookLibrary {
     private _index;
     private initialized;
     private _resolver;
+    /** Optional embedding provider — when set, findMatching scores by vector cosine
+     * (semantic) instead of lexical textSimilarity. Embed on add so the vector is
+     * stored alongside the playbook row. Pass null to revert to lexical. */
+    private embedder;
+    /** When true, force lexical scoring even if an embedder is attached (ablation). */
+    private _forceLexical;
+    /** Near-dup merge threshold (cosine). 0 = disabled. */
+    private _mergeThreshold;
+    /** Whether write-time curation (near-dup merge) is enabled. */
+    private _curationEnabled;
+    /** Minimum evidence (successCount+failureCount) before prune eligibility. */
+    private _pruneMinEvidence;
+    /**
+     * F2: When true and an embedder is attached, anti-pattern exclusion uses
+     * embedding cosine similarity instead of lexical textSimilarity.
+     * Default true.  Set false to revert to old lexical guard (ablation).
+     */
+    private _semanticAntiPatterns;
+    /** Optional Phase 3 writer for stable procedural-memory SKILL.md files. */
+    private _structuralWriter;
+    /**
+     * F2: Cosine threshold above which a query is considered to match an
+     * anti-pattern (and the playbook is excluded).  Default 0.6.
+     * Semantic cosine scores are denser than lexical textSimilarity scores,
+     * so the threshold is lower than the lexical 0.7 guard.
+     */
+    private _semanticAntiPatternThreshold;
+    /**
+     * F2: In-memory cache of anti-pattern embeddings keyed by playbook id.
+     * Populated lazily on first retrieval and reused across queries.
+     * Key: `${playbookId}::${antiPatternIndex}` → embedding vector.
+     * Avoids re-embedding the same anti-pattern strings on every query.
+     */
+    private _antiPatternEmbeddingCache;
     constructor(persistence: SqlitePersistence);
+    /**
+     * Attach a semantic embedding provider. When set, `findMatching` scores
+     * candidates by vector cosine instead of lexical textSimilarity, and new
+     * playbooks are embedded on `add()`.  Pass null to revert to lexical.
+     */
+    setEmbeddingProvider(provider: EmbeddingProvider | null): void;
+    /**
+     * When true, force lexical scoring (Jaccard+trigram) even when an embedder
+     * is attached — corresponds to the `features.lexicalRetrieval` ablation flag.
+     */
+    setForceLexical(force: boolean): void;
+    /**
+     * True when retrieval scores candidates by embedding cosine (an embedder is
+     * attached and lexical scoring is not forced). Callers use this to pick the
+     * right relevance floor — semantic cosine scores are denser than lexical, so
+     * they tolerate (and require) a higher minScore. See PlaybookRetrievalConfig.
+     */
+    isSemanticScoring(): boolean;
+    /**
+     * F2: Configure semantic anti-pattern exclusion.
+     *
+     * @param enabled - When true (default), anti-pattern exclusion uses embedding
+     *   cosine similarity when an embedder is attached.  When false, falls back to
+     *   lexical textSimilarity > 0.7 (old behavior, ablation arm).
+     * @param threshold - Cosine similarity threshold above which a query matches
+     *   an anti-pattern and the playbook is excluded.  Default 0.6.  Lower than
+     *   the lexical 0.7 guard because semantic cosine scores are denser.
+     */
+    setSemanticAntiPatterns(enabled: boolean, threshold?: number): void;
+    setStructuralWriter(writer: StructuralPlaybookWriter | null): void;
+    private writeStructural;
+    /**
+     * Persist the rebuildable operational-state sidecar after a counter/confidence
+     * mutation (recordSuccess/Failure/recordApplicationOutcome). Non-fatal: SQLite
+     * stays canonical for ops state until the next reindex. No-op outside
+     * filesystem/dual-write mode (no structural writer attached).
+     */
+    private writeStateStructural;
+    private deleteStructural;
+    /**
+     * Configure write-time curation (PR-D2).
+     *
+     * @param enabled - When false, add() always appends (append-only ablation).
+     * @param mergeThreshold - Cosine similarity above which two playbooks are
+     *   treated as near-duplicates and merged (default 0.92).
+     * @param pruneMinEvidence - Minimum (successCount + failureCount) before a
+     *   playbook is eligible for harm-pruning (default 3).
+     */
+    setCurationConfig(opts: {
+        enabled: boolean;
+        mergeThreshold?: number;
+        pruneMinEvidence?: number;
+    }): void;
     init(): Promise<void>;
     /**
-     * Find playbooks matching a context
-     * Uses inverted index for candidate narrowing, then weighted scoring
-     * across situations, triggers, and anti-patterns.
+     * Find playbooks matching a context.
+     *
+     * Scoring path:
+     *   - When an embedding provider is attached AND `_forceLexical` is false
+     *     (the semantic path): embed the query + lazily embed any playbook that
+     *     lacks a stored vector, then score by cosine similarity. The InvertedIndex
+     *     is used only as a pre-filter candidate-narrowing step; when it returns
+     *     nothing a full-scan fallback is used so semantic retrieval is never
+     *     blocked by lexical index misses.
+     *   - Otherwise (lexical path): score by Jaccard+trigram textSimilarity as
+     *     before. This is the ablation path (`features.lexicalRetrieval: true`)
+     *     and the no-provider fallback.
      */
     findMatching(context: string, options?: FindMatchingOptions): Promise<PlaybookMatch[]>;
+    /**
+     * Find playbooks using skill-tree's tuned hybrid skill scorer.
+     *
+     * This treats playbooks as skill-tree Skills at retrieval time, without
+     * requiring playbooks to be published into skill-tree storage first. It gives
+     * the serving path access to skill-tree's body-indexed BM25 scorer, optional
+     * dense fusion, and calibrated [0,1] relevance scores.
+     */
+    findMatchingSkillTreeHybrid(context: string, options?: FindMatchingOptions): Promise<PlaybookMatch[]>;
     /**
      * Maximal Marginal Relevance reranking.
      * Selects top-k items balancing relevance and diversity.
@@ -66,6 +211,37 @@ export declare class PlaybookLibrary {
      * Record failure and capture context
      */
     recordFailure(id: string, trajectoryId: string, failureContext: string, failureMode: string): Promise<void>;
+    /**
+     * F6: Injection-presence credit — update counters by INJECTION-PRESENCE +
+     * TASK OUTCOME, not by lexical usage detection.
+     *
+     * Instead of waiting for usage-inference to confirm a playbook was "used"
+     * (which fails for distilled playbooks whose abstract tactics never lexically
+     * match concrete actions), we attribute a fractional share of each task's
+     * outcome to every playbook that was injected, weighted by its retrieval
+     * score. Weights across all injected playbooks sum to 1 per task, so total
+     * credit per task = 1 distributed by relevance.
+     *
+     * Fractional counts interact correctly with downstream consumers:
+     *   - helpfulnessPrior: (successCount+1)/(successCount+failureCount+2) —
+     *     fractional inputs produce a valid probability; Laplace smoothing (+2)
+     *     keeps it out of the 0/1 corners even for tiny weights.
+     *   - pruneHarmful: failureCount >= successCount + minEvidence — fractional
+     *     threshold means a playbook accumulates evidence gradually; a
+     *     minEvidence=3 threshold needs ~3 tasks worth of failure-weight before
+     *     pruning fires, which is correct (3 fractional tasks = 3 real tasks at
+     *     weight 1).
+     *   - Confidence grows via weight-scaled damped delta (same formula as
+     *     recordSuccess / recordFailure but multiplied by weight), completing
+     *     F3: distilled playbooks born at 0.6-0.7 climb past the 0.7 router
+     *     gate after a few attributed successes.
+     *
+     * @param id - Playbook id
+     * @param success - Whether the task succeeded
+     * @param weight - Relevance share [0,1]; weights over all injected playbooks
+     *   should sum to 1. When weight = 0 this is a no-op.
+     */
+    recordApplicationOutcome(id: string, success: boolean, weight: number): Promise<void>;
     /**
      * Add a context-specific refinement
      */
@@ -75,9 +251,270 @@ export declare class PlaybookLibrary {
      */
     evolve(id: string, newGuidance?: Partial<Playbook['guidance']>, newAntiPatterns?: string[]): Promise<Playbook | undefined>;
     /**
-     * Add a new playbook
+     * Record an outcome on the Pareto frontier.
+     *
+     * For each (taskSignature, experienceId), the frontier tracks each
+     * playbook's *best* observed score. Multiple playbooks coexist on the
+     * frontier for the same (sig, exp) when they tie. The router uses this
+     * to preserve specialist playbooks that are good on a subset of work
+     * but mediocre on average.
+     */
+    recordOutcomeOnSignature(playbookId: string, taskSignature: string, experienceId: string, score: number): Promise<void>;
+    /**
+     * Record a live outcome: stamps both the Pareto frontier AND the eval
+     * cache (as `judged_by = 'live'`). Live writes take priority over
+     * llm-judge predictions, so any prior judge guess for this
+     * (playbook, experience) pair is superseded by ground truth.
+     *
+     * Use this from the hot path (instant loop) so the cache and frontier
+     * accumulate ground-truth observations as solves happen. Phase 2's
+     * acceptance gate will read from the cache without paying for judge
+     * calls when live data already exists.
+     *
+     * If `objectives` is provided, also writes one row per objective into
+     * the cartesian frontier (multi-objective Pareto). Caller-supplied
+     * objectives must follow the higher-is-better convention.
+     */
+    recordLiveOutcome(playbookId: string, taskSignature: string, experienceId: string, score: number, objectives?: Record<string, number>): Promise<void>;
+    /**
+     * Get all frontier rows for a signature.
+     */
+    getFrontierForSignature(taskSignature: string): Promise<PlaybookFrontierRow[]>;
+    /**
+     * Get all frontier rows for a playbook, across every signature it
+     * participates in. An empty result means the playbook has no live
+     * frontier history yet (freshly-extracted or never-served) — callers
+     * that gate on dominance must treat "no frontier" as non-dominated to
+     * avoid deadlocking first-ever promotions.
+     */
+    getFrontierForPlaybook(playbookId: string): Promise<PlaybookFrontierRow[]>;
+    /**
+     * Get the dominator set: playbooks that survive Pareto dominance pruning
+     * across the (experience -> best playbooks) frontier for a signature.
+     *
+     * A playbook P is *dominated* if every (sig, exp) where P is on the
+     * frontier also has at least one non-dominated other playbook on the
+     * same frontier — i.e., P is never *uniquely* needed. Direct port of
+     * GEPA's `remove_dominated_programs` (gepa_utils.py:35-72), specialized
+     * to a single signature scope.
+     *
+     * Returns playbooks ranked by win frequency (descending). Used by the
+     * router to sample frontier members.
+     */
+    getDominatorPlaybooks(opts: {
+        taskSignature?: string;
+        domain?: string;
+    }): Promise<FrontierMember[]>;
+    /**
+     * Multi-objective variant of `getDominatorPlaybooks`. Computes
+     * dominance over the cartesian frontier (per-(exp, objective)) for
+     * a signature, restricted to a caller-supplied set of objectives.
+     *
+     * A playbook survives if, for some (experience, objective) pair, it
+     * is uniquely on the frontier OR no other surviving playbook covers
+     * all the pairs where it dominates. Direct port of
+     * `remove_dominated_programs` applied to the cartesian key space.
+     *
+     * `objectives` defaults to all objectives present in the cartesian
+     * frontier for this signature. Passing a subset narrows the dominance
+     * computation (e.g., `['cost']` for cost-only selection).
+     *
+     * Returns playbooks ranked by total (exp, objective) wins across the
+     * requested objectives.
+     */
+    getDominatorPlaybooksMultiObjective(opts: {
+        taskSignature: string;
+        objectives?: string[];
+        domain?: string;
+    }): Promise<FrontierMember[]>;
+    /**
+     * How many (sig, exp) pairs does this playbook currently dominate?
+     * Deletion paths (consolidation, GC) should check this before removing
+     * a playbook — a playbook with `uniqueWins > 0` is a specialist that
+     * can't be reproduced by the surviving playbooks.
+     */
+    getFrontierContribution(playbookId: string): Promise<{
+        uniqueWins: number;
+        totalWins: number;
+    }>;
+    /**
+     * Sample a minibatch of experiences for replay-based evaluation of
+     * a candidate mutation against this playbook.
+     *
+     * Two-stage strategy:
+     *   1. Frontier-first: take the most recent experiences where this
+     *      playbook has actually been scored (from `playbook_frontier`,
+     *      ranked by `recorded_at` desc). This is the GEPA-style "same
+     *      minibatch as the parent" semantics — the candidate is judged
+     *      on the workload the parent was already serving.
+     *   2. Fallback: if the playbook has no frontier history yet (typical
+     *      for freshly-extracted playbooks), use experiences linked to
+     *      its `evolution.createdFrom` trajectories.
+     *
+     * If `taskSignature` is provided, restricts stage 1 to rows on that
+     * signature only — the proper "same workload" semantics. Without it,
+     * stage 1 mixes signatures, which corrupts comparison.
+     *
+     * `poolAcrossSignatures` overrides that filter: when true, stage 1 uses
+     * the playbook's recent frontier rows ACROSS all `{domain}:{intent}`
+     * signatures even if `taskSignature` is supplied. This is the mutation
+     * GATE path (see MutationGate.propose): the frontier rows returned by
+     * `getFrontierByPlaybook` are ALREADY per-playbook, so every row is an
+     * application of THIS playbook and is inherently relevant regardless of
+     * task domain. A domain-general playbook's failure evidence otherwise
+     * shatters into ~1-per-signature buckets on real benchmarks (families
+     * like SkillFlow Cross-Format-Data-Reconciliation span retail-operations,
+     * cloud-finops, it-operations, … — many domains), which is always below
+     * `minMinibatchSize`, so the gate can never reach a real parent-vs-child
+     * comparison and always takes the sparse-minibatch auto-accept bypass.
+     * Pooling across signatures lets a playbook applied to ≥3 tasks reach a
+     * non-sparse minibatch. The recency sort keeps the newest applications,
+     * so pooling doesn't drag in stale evidence.
+     *
+     * Returns up to `k` experiences. Empty result means the caller should
+     * accept the mutation without a gate (no evidence either way).
+     */
+    sampleMinibatchForPlaybook(playbookId: string, k?: number, taskSignature?: string, poolAcrossSignatures?: boolean): Promise<Experience[]>;
+    /**
+     * Sample a stratified minibatch for two-parent merge acceptance.
+     *
+     * GEPA's merge acceptance (proposer/merge.py:258-288) samples from
+     * three buckets where the two parents disagreed: where A scored
+     * higher, where B scored higher, and where they tied. This tests
+     * the merged child specifically on the workloads that motivated the
+     * merge — the disjoint wins that each parent uniquely had.
+     *
+     * Stratification considers ONLY experiences where both parents have
+     * recorded scores on `taskSignature` — head-to-head pairs. Lopsided
+     * experiences (only one parent scored) are excluded; without both
+     * scores there's no comparison to bucket on.
+     *
+     * Returns the picked experiences plus the parents' scores on each
+     * (so the caller doesn't need to re-look them up — they are ground
+     * truth from the frontier, no judge call needed).
+     */
+    sampleMergeMinibatch(parentAId: string, parentBId: string, taskSignature: string, k?: number, rng?: () => number): Promise<{
+        experiences: Experience[];
+        parentAScoreByExp: Map<string, number>;
+        parentBScoreByExp: Map<string, number>;
+        buckets: {
+            aWins: string[];
+            bWins: string[];
+            tied: string[];
+        };
+    }>;
+    /**
+     * Get the content hash for a playbook (used as the eval-cache key).
+     * Convenience wrapper around `playbookHash()` for callers that don't
+     * want to import the utility directly.
+     */
+    hashOf(playbook: Playbook): string;
+    /**
+     * Frontier-aware variant of `findMatching`.
+     *
+     * When the task's signature has recorded outcomes, ranks dominator
+     * playbooks by their per-signature win count (Pareto sampling — direct
+     * port of GEPA's `select_program_candidate_from_pareto_front`,
+     * gepa_utils.py:90-117). Otherwise falls back to text-similarity
+     * matching (cold-start path).
+     *
+     * Returns a list of matches: the sampled dominator first, then other
+     * dominators by descending wins, then text-similarity matches to fill
+     * to `k`. Score is normalized so the sampled dominator gets 1.0.
+     */
+    findMatchingFrontierAware(context: string, taskSignature: string, options?: FindMatchingOptions & {
+        rng?: () => number;
+        /** Objective preference. Defaults to `'best'` (single-objective quality). */
+        prefer?: ObjectivePreference;
+    }): Promise<PlaybookMatch[]>;
+    /**
+     * Add a new playbook. When curation is enabled and an embedding provider is
+     * attached, checks for a near-duplicate first (cosine > _mergeThreshold).
+     * If found, merges the incoming playbook into the existing one (union of
+     * triggers/tactics, higher-confidence strategy, appends createdFrom id) and
+     * returns the existing id. Otherwise inserts as normal.
+     *
+     * When curation is disabled (features.curation = false), always appends.
+     *
+     * Returns the id of the playbook that was ultimately stored (existing or new).
+     */
+    add(playbook: Playbook): Promise<string>;
+    /**
+     * Upsert a playbook parsed from a canonical procedural-memory file.
+     *
+     * This intentionally bypasses near-duplicate curation: reindexing from the
+     * filesystem must reproduce the canonical files, not reinterpret them as new
+     * learned candidates that may be merged away.
+     */
+    upsertCanonical(playbook: Playbook): Promise<string>;
+    /**
+     * Drop a playbook's derived rows only — the delete-side counterpart of
+     * {@link upsertCanonical}. Unlike {@link delete}, this does NOT call the
+     * structural writer, so it is safe to invoke from a file-event handler
+     * reacting to a SKILL.md that was already removed on disk (the filesystem
+     * cascade): it removes the SQLite row + inverted-index entry without trying
+     * to re-delete the canonical file.
+     */
+    removeCanonical(id: string): Promise<boolean>;
+    /**
+     * Scan for an existing playbook whose embedding cosine similarity to the
+     * candidate exceeds _mergeThreshold. Returns the best match id or null.
+     *
+     * Lexical fallback when no embedder: use textSimilarity on index text.
+     * The lexical threshold is scaled down proportionally (~0.80) since
+     * textSimilarity scores are sparser.
+     */
+    private _findNearDup;
+    /**
+     * Merge a new playbook's content into an existing one in-place:
+     *   - Union applicability.triggers (dedup)
+     *   - Union guidance.tactics (dedup)
+     *   - Keep the higher-confidence strategy
+     *   - Append the new playbook's first createdFrom id (if any)
+     *
+     * Does NOT bump successCount/failureCount — those are updated via
+     * recordSuccess/recordFailure from the usage-inference path.
+     */
+    private _mergeInto;
+    /**
+     * ADDITIVE LEARNING (flag-gated by callers) — find an existing playbook
+     * similar enough to `candidate` to REFINE INTO, WITHOUT requiring an
+     * embedding provider. Similarity is embeddings-optional (cosine when both
+     * embeddings exist, else lexical strategy+situation blend). A non-empty
+     * domain intersection is REQUIRED whenever both declare domains, guarding
+     * against cross-domain over-merge. Returns the best matching existing id
+     * with similarity ≥ `threshold`, or null.
+     *
+     * `opts.candidates` overrides the search pool (e.g. to also scan playbooks
+     * distilled earlier in the same batch that aren't in the library yet);
+     * `opts.excludeId` skips a specific id.
+     */
+    findRefineTarget(candidate: Playbook, threshold: number, opts?: {
+        excludeId?: string;
+        candidates?: Playbook[];
+    }): Promise<string | null>;
+    /**
+     * ADDITIVE LEARNING — refine an existing playbook IN PLACE with a freshly
+     * distilled `incoming` one, instead of adding `incoming` as a new
+     * `distilled-<uuid>` row. This is how evidence COMPOUNDS onto one playbook:
+     *   - union situations / triggers / anti-patterns / domains / tactics
+     *   - keep the existing strategy (stable identity) + append a refinement note
+     *   - append incoming.createdFrom (dedup) — the compounding trajectory evidence
+     *   - accumulate success/failure counters
+     *   - BOUNDED confidence nudge (fraction of remaining headroom, capped 0.95),
+     *     never a raw max() — guards runaway inflation across repeated merges
+     *   - bump minor version; snapshot the prior version for history
+     * Returns the refined playbook, or undefined when `existingId` is unknown.
+     */
+    refineWithDistilled(existingId: string, incoming: Playbook): Promise<Playbook | undefined>;
+    /**
+     * Prune (delete) playbooks where failureCount >= successCount + minEvidence,
+     * ensuring at least minEvidence observations exist so zero/low-count noise
+     * never triggers pruning. Gated on features.curation.
+     *
+     * Returns the ids of pruned playbooks.
      */
-    add(playbook: Playbook): Promise<void>;
+    pruneHarmful(minEvidence?: number): Promise<string[]>;
     /**
      * Create and add a new playbook
      */

package/dist/memory/playbook.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"playbook.d.ts","sourceRoot":"","sources":["../../src/memory/playbook.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,KAAK,EACV,QAAQ,EACR,cAAc,EAIf,MAAM,mBAAmB,CAAC;AAC3B,OAAO,EAAE,cAAc,EAAuB,MAAM,mBAAmB,CAAC;AACxE,OAAO,KAAK,EAAE,iBAAiB,EAAe,MAAM,yBAAyB,CAAC;AAM9E;;GAEG;AACH,MAAM,WAAW,aAAa;IAC5B,QAAQ,EAAE,QAAQ,CAAC;IACnB,KAAK,EAAE,MAAM,CAAC;IACd,SAAS,EAAE,WAAW,GAAG,SAAS,GAAG,QAAQ,CAAC;CAC/C;AAED;;GAEG;AACH,MAAM,WAAW,mBAAmB;IAClC,CAAC,CAAC,EAAE,MAAM,CAAC;IACX,OAAO,CAAC,EAAE,MAAM,EAAE,CAAC;IACnB,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,mBAAmB,CAAC,EAAE,OAAO,CAAC;IAC9B,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,qFAAqF;IACrF,MAAM,CAAC,EAAE,MAAM,CAAC;CACjB;AAoDD;;GAEG;AACH,qBAAa,eAAe;IAC1B,OAAO,CAAC,WAAW,CAAoB;IACvC,OAAO,CAAC,MAAM,CAAsC;IACpD,OAAO,CAAC,WAAW,CAAS;IAC5B,OAAO,CAAC,SAAS,CAAyB;gBAE9B,WAAW,EAAE,iBAAiB;IAWpC,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC;IAgB3B;;;;OAIG;IACG,YAAY,CAChB,OAAO,EAAE,MAAM,EACf,OAAO,CAAC,EAAE,mBAAmB,GAC5B,OAAO,CAAC,aAAa,EAAE,CAAC;IA+E3B;;;OAGG;IACH,OAAO,CAAC,QAAQ;IAsChB;;OAEG;IACG,aAAa,CAAC,OAAO,EAAE,MAAM,EAAE,SAAS,SAAM,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC;IAY1E;;OAEG;IACG,mBAAmB,CAAC,OAAO,EAAE,MAAM,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC;IAY/D;;;OAGG;IACG,aAAa,CAAC,EAAE,EAAE,MAAM,EAAE,aAAa,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAkCtF;;OAEG;IACG,aAAa,CACjB,EAAE,EAAE,MAAM,EACV,YAAY,EAAE,MAAM,EACpB,cAAc,EAAE,MAAM,EACtB,WAAW,EAAE,MAAM,GAClB,OAAO,CAAC,IAAI,CAAC;IAqChB;;OAEG;IACG,aAAa,CACjB,EAAE,EAAE,MAAM,EACV,OAAO,EAAE,MAAM,EACf,QAAQ,EAAE,MAAM,EAChB,MAAM,EAAE,SAAS,GAAG,SAAS,GAAG,QAAQ,GACvC,OAAO,CAAC,IAAI,CAAC;IA6BhB;;OAEG;IACG,MAAM,CACV,EAAE,EAAE,MAAM,EACV,WAAW,CAAC,EAAE,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,EAC3C,eAAe,CAAC,EAAE,MAAM,EAAE,GACzB,OAAO,CAAC,QAAQ,GAAG,SAAS,CAAC;IAqChC;;OAEG;IACG,GAAG,CAAC,QAAQ,EAAE,QAAQ,GAAG,OAAO,CAAC,IAAI,CAAC;IAM5C;;OAEG;IACG,MAAM,CACV,KAAK,EAAE,UAAU,CAAC,OAAO,cAAc,CAAC,CAAC,CAAC,CAAC,GAC1C,OAAO,CAAC,QAAQ,CAAC;IAMpB;;OAEG;IACG,GAAG,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,QAAQ,GAAG,SAAS,CAAC;IAMpD;;OAEG;IACG,SAAS,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,QAAQ,GAAG,SAAS,CAAC;IAK5D;;OAEG;IACG,MAAM,CACV,WAAW,EAAE,MAAM,EACnB,SAAS,SAAO,GACf,OAAO,CAAC,QAAQ,GAAG,SAAS,CAAC;IAuBhC;;OAEG;IACG,WAAW,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC;IAOtD;;OAEG;IACG,gBAAgB,CAAC,CAAC,SAAK,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC;IAgBnD;;OAEG;IACG,iBAAiB,CAAC,aAAa,SAAM,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC;IAKjE;;OAEG;IACG,MAAM,IAAI,OAAO,CAAC,QAAQ,EAAE,CAAC;IAKnC;;OAEG;IACG,MAAM,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC;IAM1C;;OAEG;IACG,KAAK,IAAI,OAAO,CAAC,MAAM,CAAC;IAK9B;;OAEG;IACG,UAAU,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC;IAarC;;OAEG;IACG,WAAW,CAAC,MAAM,EAAE,cAAc,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC;IAK9D;;OAEG;IACG,cAAc,CAAC,MAAM,EAAE,cAAc,GAAG,OAAO,CAAC,MAAM,CAAC;IAU7D;;;;OAIG;IACG,qBAAqB,CAAC,YAAY,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;IAclE;;OAEG;IACG,oBAAoB,IAAI,OAAO,CAAC,MAAM,CAAC,cAAc,EAAE,MAAM,CAAC,CAAC;IAerE;;OAEG;IACG,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;IAI5B;;OAEG;IACH,OAAO,CAAC,UAAU;CAGnB;AAED;;GAEG;AACH,wBAAgB,qBAAqB,CAAC,WAAW,EAAE,iBAAiB,GAAG,eAAe,CAErF"}
+{"version":3,"file":"playbook.d.ts","sourceRoot":"","sources":["../../src/memory/playbook.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,KAAK,EACV,QAAQ,EACR,cAAc,EAKd,UAAU,EACX,MAAM,mBAAmB,CAAC;AAC3B,OAAO,EAAE,cAAc,EAAuB,MAAM,mBAAmB,CAAC;AACxE,OAAO,KAAK,EAAE,iBAAiB,EAAe,mBAAmB,EAAE,MAAM,yBAAyB,CAAC;AAGnG,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,2BAA2B,CAAC;AAMnE,OAAO,EAGL,KAAK,cAAc,IAAI,uBAAuB,EAC/C,MAAM,YAAY,CAAC;AACpB,OAAO,KAAK,EAAE,6BAA6B,EAAE,MAAM,6BAA6B,CAAC;AAEjF;;GAEG;AACH,MAAM,WAAW,aAAa;IAC5B,QAAQ,EAAE,QAAQ,CAAC;IACnB,KAAK,EAAE,MAAM,CAAC;IACd,SAAS,EAAE,WAAW,GAAG,SAAS,GAAG,QAAQ,CAAC;IAC9C,yEAAyE;IACzE,eAAe,CAAC,EAAE,QAAQ,GAAG,UAAU,GAAG,mBAAmB,CAAC;IAC9D,0EAA0E;IAC1E,qBAAqB,CAAC,EAAE,6BAA6B,CAAC;CACvD;AAED;;GAEG;AACH,MAAM,WAAW,cAAc;IAC7B,QAAQ,EAAE,QAAQ,CAAC;IACnB,gFAAgF;IAChF,SAAS,EAAE,MAAM,CAAC;IAClB,0DAA0D;IAC1D,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,MAAM,WAAW,wBAAwB;IACvC,KAAK,CAAC,QAAQ,EAAE,QAAQ,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;IAC3C,MAAM,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,IAAI,GAAG,MAAM,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IAC/D,2EAA2E;IAC3E,UAAU,CAAC,QAAQ,EAAE,QAAQ,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;CAC/C;AAED;;;;;;;;;;;GAWG;AACH,MAAM,MAAM,mBAAmB,GAAG,MAAM,GAAG,OAAO,GAAG,MAAM,GAAG;IAAE,UAAU,EAAE,MAAM,EAAE,CAAA;CAAE,CAAC;AAEvF;;GAEG;AACH,MAAM,WAAW,mBAAmB;IAClC,CAAC,CAAC,EAAE,MAAM,CAAC;IACX,OAAO,CAAC,EAAE,MAAM,EAAE,CAAC;IACnB,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,mBAAmB,CAAC,EAAE,OAAO,CAAC;IAC9B,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,qFAAqF;IACrF,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,8EAA8E;IAC9E,MAAM,CAAC,EAAE,uBAAuB,CAAC;CAClC;AAuHD;;GAEG;AACH,qBAAa,eAAe;IAC1B,OAAO,CAAC,WAAW,CAAoB;IACvC,OAAO,CAAC,MAAM,CAAsC;IACpD,OAAO,CAAC,WAAW,CAAS;IAC5B,OAAO,CAAC,SAAS,CAAyB;IAC1C;;4EAEwE;IACxE,OAAO,CAAC,QAAQ,CAAkC;IAClD,mFAAmF;IACnF,OAAO,CAAC,aAAa,CAAS;IAC9B,uDAAuD;IACvD,OAAO,CAAC,eAAe,CAAQ;IAC/B,+DAA+D;IAC/D,OAAO,CAAC,gBAAgB,CAAQ;IAChC,6EAA6E;IAC7E,OAAO,CAAC,iBAAiB,CAAK;IAC9B;;;;OAIG;IACH,OAAO,CAAC,qBAAqB,CAAQ;IACrC,2EAA2E;IAC3E,OAAO,CAAC,iBAAiB,CAAyC;IAClE;;;;;OAKG;IACH,OAAO,CAAC,6BAA6B,CAAO;IAC5C;;;;;OAKG;IACH,OAAO,CAAC,0BAA0B,CAA+B;gBAErD,WAAW,EAAE,iBAAiB;IAW1C;;;;OAIG;IACH,oBAAoB,CAAC,QAAQ,EAAE,iBAAiB,GAAG,IAAI,GAAG,IAAI;IAI9D;;;OAGG;IACH,eAAe,CAAC,KAAK,EAAE,OAAO,GAAG,IAAI;IAIrC;;;;;OAKG;IACH,iBAAiB,IAAI,OAAO;IAI5B;;;;;;;;;OASG;IACH,uBAAuB,CAAC,OAAO,EAAE,OAAO,EAAE,SAAS,CAAC,EAAE,MAAM,GAAG,IAAI;IAOnE,mBAAmB,CAAC,MAAM,EAAE,wBAAwB,GAAG,IAAI,GAAG,IAAI;YAIpD,eAAe;IAM7B;;;;;OAKG;YACW,oBAAoB;YASpB,gBAAgB;IAK9B;;;;;;;;OAQG;IACH,iBAAiB,CAAC,IAAI,EAAE;QACtB,OAAO,EAAE,OAAO,CAAC;QACjB,cAAc,CAAC,EAAE,MAAM,CAAC;QACxB,gBAAgB,CAAC,EAAE,MAAM,CAAC;KAC3B,GAAG,IAAI;IAMF,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC;IAgB3B;;;;;;;;;;;;;OAaG;IACG,YAAY,CAAC,OAAO,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,mBAAmB,GAAG,OAAO,CAAC,aAAa,EAAE,CAAC;IA+I5F;;;;;;;OAOG;IACG,2BAA2B,CAC/B,OAAO,EAAE,MAAM,EACf,OAAO,CAAC,EAAE,mBAAmB,GAC5B,OAAO,CAAC,aAAa,EAAE,CAAC;IAuD3B;;;OAGG;IACH,OAAO,CAAC,QAAQ;IAkChB;;OAEG;IACG,aAAa,CAAC,OAAO,EAAE,MAAM,EAAE,SAAS,SAAM,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC;IAY1E;;OAEG;IACG,mBAAmB,CAAC,OAAO,EAAE,MAAM,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC;IAU/D;;;OAGG;IACG,aAAa,CAAC,EAAE,EAAE,MAAM,EAAE,aAAa,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAmCtF;;OAEG;IACG,aAAa,CACjB,EAAE,EAAE,MAAM,EACV,YAAY,EAAE,MAAM,EACpB,cAAc,EAAE,MAAM,EACtB,WAAW,EAAE,MAAM,GAClB,OAAO,CAAC,IAAI,CAAC;IA0ChB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OA6BG;IACG,wBAAwB,CAAC,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAyC3F;;OAEG;IACG,aAAa,CACjB,EAAE,EAAE,MAAM,EACV,OAAO,EAAE,MAAM,EACf,QAAQ,EAAE,MAAM,EAChB,MAAM,EAAE,SAAS,GAAG,SAAS,GAAG,QAAQ,GACvC,OAAO,CAAC,IAAI,CAAC;IA8BhB;;OAEG;IACG,MAAM,CACV,EAAE,EAAE,MAAM,EACV,WAAW,CAAC,EAAE,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,EAC3C,eAAe,CAAC,EAAE,MAAM,EAAE,GACzB,OAAO,CAAC,QAAQ,GAAG,SAAS,CAAC;IA0ChC;;;;;;;;OAQG;IACG,wBAAwB,CAC5B,UAAU,EAAE,MAAM,EAClB,aAAa,EAAE,MAAM,EACrB,YAAY,EAAE,MAAM,EACpB,KAAK,EAAE,MAAM,GACZ,OAAO,CAAC,IAAI,CAAC;IAKhB;;;;;;;;;;;;;;OAcG;IACG,iBAAiB,CACrB,UAAU,EAAE,MAAM,EAClB,aAAa,EAAE,MAAM,EACrB,YAAY,EAAE,MAAM,EACpB,KAAK,EAAE,MAAM,EACb,UAAU,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,GAClC,OAAO,CAAC,IAAI,CAAC;IA0BhB;;OAEG;IACG,uBAAuB,CAAC,aAAa,EAAE,MAAM,GAAG,OAAO,CAAC,mBAAmB,EAAE,CAAC;IAKpF;;;;;;OAMG;IACG,sBAAsB,CAAC,UAAU,EAAE,MAAM,GAAG,OAAO,CAAC,mBAAmB,EAAE,CAAC;IAKhF;;;;;;;;;;;;OAYG;IACG,qBAAqB,CAAC,IAAI,EAAE;QAChC,aAAa,CAAC,EAAE,MAAM,CAAC;QACvB,MAAM,CAAC,EAAE,MAAM,CAAC;KACjB,GAAG,OAAO,CAAC,cAAc,EAAE,CAAC;IA4B7B;;;;;;;;;;;;;;;;OAgBG;IACG,mCAAmC,CAAC,IAAI,EAAE;QAC9C,aAAa,EAAE,MAAM,CAAC;QACtB,UAAU,CAAC,EAAE,MAAM,EAAE,CAAC;QACtB,MAAM,CAAC,EAAE,MAAM,CAAC;KACjB,GAAG,OAAO,CAAC,cAAc,EAAE,CAAC;IA8B7B;;;;;OAKG;IACG,uBAAuB,CAAC,UAAU,EAAE,MAAM,GAAG,OAAO,CAAC;QACzD,UAAU,EAAE,MAAM,CAAC;QACnB,SAAS,EAAE,MAAM,CAAC;KACnB,CAAC;IAKF;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OAoCG;IACG,0BAA0B,CAC9B,UAAU,EAAE,MAAM,EAClB,CAAC,SAAI,EACL,aAAa,CAAC,EAAE,MAAM,EACtB,oBAAoB,UAAQ,GAC3B,OAAO,CAAC,UAAU,EAAE,CAAC;IA+CxB;;;;;;;;;;;;;;;;;OAiBG;IACG,oBAAoB,CACxB,SAAS,EAAE,MAAM,EACjB,SAAS,EAAE,MAAM,EACjB,aAAa,EAAE,MAAM,EACrB,CAAC,SAAI,EACL,GAAG,GAAE,MAAM,MAAoB,GAC9B,OAAO,CAAC;QACT,WAAW,EAAE,UAAU,EAAE,CAAC;QAC1B,iBAAiB,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QACvC,iBAAiB,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QACvC,OAAO,EAAE;YAAE,KAAK,EAAE,MAAM,EAAE,CAAC;YAAC,KAAK,EAAE,MAAM,EAAE,CAAC;YAAC,IAAI,EAAE,MAAM,EAAE,CAAA;SAAE,CAAC;KAC/D,CAAC;IAsFF;;;;OAIG;IACH,MAAM,CAAC,QAAQ,EAAE,QAAQ,GAAG,MAAM;IAIlC;;;;;;;;;;;;OAYG;IACG,yBAAyB,CAC7B,OAAO,EAAE,MAAM,EACf,aAAa,EAAE,MAAM,EACrB,OAAO,CAAC,EAAE,mBAAmB,GAAG;QAC9B,GAAG,CAAC,EAAE,MAAM,MAAM,CAAC;QACnB,6EAA6E;QAC7E,MAAM,CAAC,EAAE,mBAAmB,CAAC;KAC9B,GACA,OAAO,CAAC,aAAa,EAAE,CAAC;IAuF3B;;;;;;;;;;OAUG;IACG,GAAG,CAAC,QAAQ,EAAE,QAAQ,GAAG,OAAO,CAAC,MAAM,CAAC;IAsB9C;;;;;;OAMG;IACG,eAAe,CAAC,QAAQ,EAAE,QAAQ,GAAG,OAAO,CAAC,MAAM,CAAC;IAU1D;;;;;;;OAOG;IACG,eAAe,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC;IAMnD;;;;;;;OAOG;YACW,YAAY;IA8B1B;;;;;;;;;OASG;YACW,UAAU;IAuCxB;;;;;;;;;;;;OAYG;IACG,gBAAgB,CACpB,SAAS,EAAE,QAAQ,EACnB,SAAS,EAAE,MAAM,EACjB,IAAI,CAAC,EAAE;QAAE,SAAS,CAAC,EAAE,MAAM,CAAC;QAAC,UAAU,CAAC,EAAE,QAAQ,EAAE,CAAA;KAAE,GACrD,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC;IAkBzB;;;;;;;;;;;;OAYG;IACG,mBAAmB,CAAC,UAAU,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,GAAG,OAAO,CAAC,QAAQ,GAAG,SAAS,CAAC;IAkEhG;;;;;;OAMG;IACG,YAAY,CAAC,WAAW,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;IAoB3D;;OAEG;IACG,MAAM,CAAC,KAAK,EAAE,UAAU,CAAC,OAAO,cAAc,CAAC,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,QAAQ,CAAC;IAM5E;;OAEG;IACG,GAAG,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,QAAQ,GAAG,SAAS,CAAC;IAMpD;;OAEG;IACG,SAAS,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,QAAQ,GAAG,SAAS,CAAC;IAK5D;;OAEG;IACG,MAAM,CAAC,WAAW,EAAE,MAAM,EAAE,SAAS,SAAO,GAAG,OAAO,CAAC,QAAQ,GAAG,SAAS,CAAC;IAqBlF;;OAEG;IACG,WAAW,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC;IAKtD;;OAEG;IACG,gBAAgB,CAAC,CAAC,SAAK,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC;IAcnD;;OAEG;IACG,iBAAiB,CAAC,aAAa,SAAM,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC;IAKjE;;OAEG;IACG,MAAM,IAAI,OAAO,CAAC,QAAQ,EAAE,CAAC;IAKnC;;OAEG;IACG,MAAM,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC;IAY1C;;OAEG;IACG,KAAK,IAAI,OAAO,CAAC,MAAM,CAAC;IAK9B;;OAEG;IACG,UAAU,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC;IAarC;;OAEG;IACG,WAAW,CAAC,MAAM,EAAE,cAAc,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC;IAK9D;;OAEG;IACG,cAAc,CAAC,MAAM,EAAE,cAAc,GAAG,OAAO,CAAC,MAAM,CAAC;IAS7D;;;;OAIG;IACG,qBAAqB,CAAC,YAAY,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;IAYlE;;OAEG;IACG,oBAAoB,IAAI,OAAO,CAAC,MAAM,CAAC,cAAc,EAAE,MAAM,CAAC,CAAC;IAerE;;OAEG;IACG,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;IAI5B;;OAEG;IACH,OAAO,CAAC,UAAU;CAGnB;AAoID;;GAEG;AACH,wBAAgB,qBAAqB,CAAC,WAAW,EAAE,iBAAiB,GAAG,eAAe,CAErF"}