agentic-flow 2.0.7 → 2.0.8

package/dist/agentdb/index.d.ts

@@ -23,4 +23,6 @@ export { CausalMemoryGraph } from 'agentdb';
 export { CausalRecall } from 'agentdb';
 export { NightlyLearner } from 'agentdb';
 export { ExplainableRecall } from 'agentdb';
+export { controllerPrerequisites, noArgControllers, getControllerPrerequisite, filterBySafety } from './prerequisites.js';
+export type { ControllerPrerequisite, ControllerRequirement, ControllerSafety } from './prerequisites.js';
 //# sourceMappingURL=index.d.ts.map

package/dist/agentdb/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/agentdb/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAGH,OAAO,EAAE,eAAe,EAAE,MAAM,SAAS,CAAC;AAC1C,OAAO,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AACvC,OAAO,EAAE,gBAAgB,EAAE,MAAM,SAAS,CAAC;AAC3C,OAAO,EAAE,iBAAiB,EAAE,MAAM,SAAS,CAAC;AAC5C,OAAO,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AACvC,OAAO,EAAE,cAAc,EAAE,MAAM,SAAS,CAAC;AACzC,OAAO,EAAE,iBAAiB,EAAE,MAAM,SAAS,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/agentdb/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAGH,OAAO,EAAE,eAAe,EAAE,MAAM,SAAS,CAAC;AAC1C,OAAO,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AACvC,OAAO,EAAE,gBAAgB,EAAE,MAAM,SAAS,CAAC;AAC3C,OAAO,EAAE,iBAAiB,EAAE,MAAM,SAAS,CAAC;AAC5C,OAAO,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AACvC,OAAO,EAAE,cAAc,EAAE,MAAM,SAAS,CAAC;AACzC,OAAO,EAAE,iBAAiB,EAAE,MAAM,SAAS,CAAC;AAM5C,OAAO,EACL,uBAAuB,EACvB,gBAAgB,EAChB,yBAAyB,EACzB,cAAc,EACf,MAAM,oBAAoB,CAAC;AAC5B,YAAY,EACV,sBAAsB,EACtB,qBAAqB,EACrB,gBAAgB,EACjB,MAAM,oBAAoB,CAAC"}

package/dist/agentdb/index.js

@@ -24,6 +24,11 @@ export { CausalMemoryGraph } from 'agentdb';
 export { CausalRecall } from 'agentdb';
 export { NightlyLearner } from 'agentdb';
 export { ExplainableRecall } from 'agentdb';
+// Controller activation registry (issue #146 Gap 2). Exported as a no-op
+// re-export so it works whether the installed agentdb publishes the registry
+// natively or not — the local `prerequisites.ts` shim below provides a
+// subset for older agentdb versions.
+export { controllerPrerequisites, noArgControllers, getControllerPrerequisite, filterBySafety } from './prerequisites.js';
 // Note: These are custom types not exported from agentdb v1.3.9
 // Users should import from agentdb directly if needed
 // export type { LearningSystem } from 'agentdb/...';

package/dist/agentdb/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/agentdb/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH,0FAA0F;AAC1F,OAAO,EAAE,eAAe,EAAE,MAAM,SAAS,CAAC;AAC1C,OAAO,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AACvC,OAAO,EAAE,gBAAgB,EAAE,MAAM,SAAS,CAAC;AAC3C,OAAO,EAAE,iBAAiB,EAAE,MAAM,SAAS,CAAC;AAC5C,OAAO,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AACvC,OAAO,EAAE,cAAc,EAAE,MAAM,SAAS,CAAC;AACzC,OAAO,EAAE,iBAAiB,EAAE,MAAM,SAAS,CAAC;AAE5C,gEAAgE;AAChE,sDAAsD;AACtD,qDAAqD;AACrD,oDAAoD;AAEpD,sDAAsD;AACtD,8EAA8E","sourcesContent":["/**\n * AgentDB Re-exports for Backwards Compatibility\n *\n * This module provides backwards-compatible exports for code that previously\n * used embedded AgentDB controllers. Now proxies to agentdb npm package.\n *\n * @deprecated Import directly from specific agentdb paths for better tree-shaking\n * @since v1.7.0 - Integrated agentdb as proper dependency\n *\n * Example migration:\n * ```typescript\n * // Old (still works)\n * import { ReflexionMemory } from 'agentic-flow/agentdb';\n *\n * // New (recommended)\n * import { ReflexionMemory } from 'agentdb/controllers/ReflexionMemory';\n * ```\n */\n\n// Import from agentdb package - using direct package imports for bundler moduleResolution\nexport { ReflexionMemory } from 'agentdb';\nexport { SkillLibrary } from 'agentdb';\nexport { EmbeddingService } from 'agentdb';\nexport { CausalMemoryGraph } from 'agentdb';\nexport { CausalRecall } from 'agentdb';\nexport { NightlyLearner } from 'agentdb';\nexport { ExplainableRecall } from 'agentdb';\n\n// Note: These are custom types not exported from agentdb v1.3.9\n// Users should import from agentdb directly if needed\n// export type { LearningSystem } from 'agentdb/...';\n// export type { ReasoningBank } from 'agentdb/...';\n\n// Note: Optimizations not available in agentdb v1.3.9\n// Users can implement custom optimizations or use AgentDB's built-in features\n"]}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/agentdb/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH,0FAA0F;AAC1F,OAAO,EAAE,eAAe,EAAE,MAAM,SAAS,CAAC;AAC1C,OAAO,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AACvC,OAAO,EAAE,gBAAgB,EAAE,MAAM,SAAS,CAAC;AAC3C,OAAO,EAAE,iBAAiB,EAAE,MAAM,SAAS,CAAC;AAC5C,OAAO,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AACvC,OAAO,EAAE,cAAc,EAAE,MAAM,SAAS,CAAC;AACzC,OAAO,EAAE,iBAAiB,EAAE,MAAM,SAAS,CAAC;AAE5C,yEAAyE;AACzE,6EAA6E;AAC7E,uEAAuE;AACvE,qCAAqC;AACrC,OAAO,EACL,uBAAuB,EACvB,gBAAgB,EAChB,yBAAyB,EACzB,cAAc,EACf,MAAM,oBAAoB,CAAC;AAO5B,gEAAgE;AAChE,sDAAsD;AACtD,qDAAqD;AACrD,oDAAoD;AAEpD,sDAAsD;AACtD,8EAA8E","sourcesContent":["/**\n * AgentDB Re-exports for Backwards Compatibility\n *\n * This module provides backwards-compatible exports for code that previously\n * used embedded AgentDB controllers. Now proxies to agentdb npm package.\n *\n * @deprecated Import directly from specific agentdb paths for better tree-shaking\n * @since v1.7.0 - Integrated agentdb as proper dependency\n *\n * Example migration:\n * ```typescript\n * // Old (still works)\n * import { ReflexionMemory } from 'agentic-flow/agentdb';\n *\n * // New (recommended)\n * import { ReflexionMemory } from 'agentdb/controllers/ReflexionMemory';\n * ```\n */\n\n// Import from agentdb package - using direct package imports for bundler moduleResolution\nexport { ReflexionMemory } from 'agentdb';\nexport { SkillLibrary } from 'agentdb';\nexport { EmbeddingService } from 'agentdb';\nexport { CausalMemoryGraph } from 'agentdb';\nexport { CausalRecall } from 'agentdb';\nexport { NightlyLearner } from 'agentdb';\nexport { ExplainableRecall } from 'agentdb';\n\n// Controller activation registry (issue #146 Gap 2). Exported as a no-op\n// re-export so it works whether the installed agentdb publishes the registry\n// natively or not — the local `prerequisites.ts` shim below provides a\n// subset for older agentdb versions.\nexport {\n  controllerPrerequisites,\n  noArgControllers,\n  getControllerPrerequisite,\n  filterBySafety\n} from './prerequisites.js';\nexport type {\n  ControllerPrerequisite,\n  ControllerRequirement,\n  ControllerSafety\n} from './prerequisites.js';\n\n// Note: These are custom types not exported from agentdb v1.3.9\n// Users should import from agentdb directly if needed\n// export type { LearningSystem } from 'agentdb/...';\n// export type { ReasoningBank } from 'agentdb/...';\n\n// Note: Optimizations not available in agentdb v1.3.9\n// Users can implement custom optimizations or use AgentDB's built-in features\n"]}

package/dist/agentdb/prerequisites.d.ts

@@ -0,0 +1,25 @@
+/**
+ * Controller Prerequisites — local shim for `agentic-flow/agentdb`.
+ *
+ * Mirrors the registry that lives in the upstream `agentdb` package
+ * (`agentdb/dist/controllers/prerequisites.js`). Exposing it through the
+ * `agentic-flow/agentdb` re-export means consumers (e.g. ruflo) can rely on
+ * a single import surface regardless of which agentdb version is installed.
+ *
+ * Issue #146 Gap 2.
+ */
+export type ControllerRequirement = 'database' | 'embedder' | 'vectorBackend' | 'graphBackend' | 'learningBackend' | 'config' | 'wasm' | 'networkEndpoint';
+export type ControllerSafety = 'pure' | 'opens-resource' | 'opens-network';
+export interface ControllerPrerequisite {
+    name: string;
+    requirements: ControllerRequirement[];
+    optional: ControllerRequirement[];
+    arity: number;
+    safety: ControllerSafety;
+    description: string;
+}
+export declare const controllerPrerequisites: readonly ControllerPrerequisite[];
+export declare const noArgControllers: readonly ControllerPrerequisite[];
+export declare function getControllerPrerequisite(name: string): ControllerPrerequisite | null;
+export declare function filterBySafety(safety: readonly ControllerSafety[]): readonly ControllerPrerequisite[];
+//# sourceMappingURL=prerequisites.d.ts.map

package/dist/agentdb/prerequisites.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"prerequisites.d.ts","sourceRoot":"","sources":["../../src/agentdb/prerequisites.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,MAAM,MAAM,qBAAqB,GAC7B,UAAU,GACV,UAAU,GACV,eAAe,GACf,cAAc,GACd,iBAAiB,GACjB,QAAQ,GACR,MAAM,GACN,iBAAiB,CAAC;AAEtB,MAAM,MAAM,gBAAgB,GAAG,MAAM,GAAG,gBAAgB,GAAG,eAAe,CAAC;AAE3E,MAAM,WAAW,sBAAsB;IACrC,IAAI,EAAE,MAAM,CAAC;IACb,YAAY,EAAE,qBAAqB,EAAE,CAAC;IACtC,QAAQ,EAAE,qBAAqB,EAAE,CAAC;IAClC,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,gBAAgB,CAAC;IACzB,WAAW,EAAE,MAAM,CAAC;CACrB;AAED,eAAO,MAAM,uBAAuB,EAAE,SAAS,sBAAsB,EAiKnE,CAAC;AAEH,eAAO,MAAM,gBAAgB,EAAE,SAAS,sBAAsB,EAE7D,CAAC;AAEF,wBAAgB,yBAAyB,CAAC,IAAI,EAAE,MAAM,GAAG,sBAAsB,GAAG,IAAI,CAErF;AAED,wBAAgB,cAAc,CAC5B,MAAM,EAAE,SAAS,gBAAgB,EAAE,GAClC,SAAS,sBAAsB,EAAE,CAEnC"}

package/dist/agentdb/prerequisites.js

@@ -0,0 +1,180 @@
+/**
+ * Controller Prerequisites — local shim for `agentic-flow/agentdb`.
+ *
+ * Mirrors the registry that lives in the upstream `agentdb` package
+ * (`agentdb/dist/controllers/prerequisites.js`). Exposing it through the
+ * `agentic-flow/agentdb` re-export means consumers (e.g. ruflo) can rely on
+ * a single import surface regardless of which agentdb version is installed.
+ *
+ * Issue #146 Gap 2.
+ */
+export const controllerPrerequisites = Object.freeze([
+    {
+        name: 'AttentionService',
+        requirements: ['config'],
+        optional: ['wasm'],
+        arity: 1,
+        safety: 'opens-resource',
+        description: 'Self / cross / multi-head attention over embeddings.'
+    },
+    {
+        name: 'CausalMemoryGraph',
+        requirements: ['database'],
+        optional: ['embedder', 'graphBackend', 'vectorBackend', 'config'],
+        arity: 5,
+        safety: 'opens-resource',
+        description: 'Causal edge graph over memories.'
+    },
+    {
+        name: 'CausalRecall',
+        requirements: ['database', 'embedder'],
+        optional: ['vectorBackend', 'config'],
+        arity: 4,
+        safety: 'pure',
+        description: 'Causal-uplift reranker.'
+    },
+    {
+        name: 'ContextSynthesizer',
+        requirements: ['database'],
+        optional: ['embedder', 'config'],
+        arity: 3,
+        safety: 'pure',
+        description: 'Synthesises retrieved memories into context.'
+    },
+    {
+        name: 'EmbeddingService',
+        requirements: ['config'],
+        optional: [],
+        arity: 1,
+        safety: 'pure',
+        description: 'Text → vector embedder.'
+    },
+    {
+        name: 'EnhancedEmbeddingService',
+        requirements: ['config'],
+        optional: [],
+        arity: 1,
+        safety: 'pure',
+        description: 'EmbeddingService with caching and provider fallback.'
+    },
+    {
+        name: 'ExplainableRecall',
+        requirements: ['database', 'embedder'],
+        optional: ['vectorBackend'],
+        arity: 3,
+        safety: 'pure',
+        description: 'Recall with feature attributions.'
+    },
+    {
+        name: 'HNSWIndex',
+        requirements: ['database'],
+        optional: ['config'],
+        arity: 2,
+        safety: 'opens-resource',
+        description: 'On-disk HNSW vector index.'
+    },
+    {
+        name: 'LearningSystem',
+        requirements: ['database', 'embedder'],
+        optional: ['vectorBackend', 'config'],
+        arity: 4,
+        safety: 'pure',
+        description: 'Online learning consolidator.'
+    },
+    {
+        name: 'MMRDiversityRanker',
+        requirements: [],
+        optional: ['config'],
+        arity: 1,
+        safety: 'pure',
+        description: 'MMR diversity reranker.'
+    },
+    {
+        name: 'MemoryController',
+        requirements: [],
+        optional: ['vectorBackend', 'config'],
+        arity: 2,
+        safety: 'pure',
+        description: 'High-level memory orchestration.'
+    },
+    {
+        name: 'MetadataFilter',
+        requirements: [],
+        optional: [],
+        arity: 0,
+        safety: 'pure',
+        description: 'Pure utility for metadata predicates.'
+    },
+    {
+        name: 'NightlyLearner',
+        requirements: ['database', 'embedder'],
+        optional: ['config'],
+        arity: 3,
+        safety: 'pure',
+        description: 'Background consolidation pipeline.'
+    },
+    {
+        name: 'QUICClient',
+        requirements: ['config', 'networkEndpoint'],
+        optional: [],
+        arity: 1,
+        safety: 'opens-network',
+        description: 'QUIC sync client.'
+    },
+    {
+        name: 'QUICServer',
+        requirements: ['config'],
+        optional: [],
+        arity: 1,
+        safety: 'opens-network',
+        description: 'QUIC sync server.'
+    },
+    {
+        name: 'ReasoningBank',
+        requirements: ['database', 'embedder'],
+        optional: ['vectorBackend', 'graphBackend', 'config'],
+        arity: 5,
+        safety: 'pure',
+        description: 'Reasoning memory facade.'
+    },
+    {
+        name: 'ReflexionMemory',
+        requirements: ['database', 'embedder'],
+        optional: ['vectorBackend', 'learningBackend', 'graphBackend'],
+        arity: 5,
+        safety: 'pure',
+        description: 'Episodic replay memory.'
+    },
+    {
+        name: 'SkillLibrary',
+        requirements: ['database', 'embedder'],
+        optional: ['vectorBackend', 'graphBackend', 'config'],
+        arity: 5,
+        safety: 'pure',
+        description: 'Reusable skill registry.'
+    },
+    {
+        name: 'SyncCoordinator',
+        requirements: ['config'],
+        optional: ['networkEndpoint'],
+        arity: 1,
+        safety: 'opens-network',
+        description: 'Multi-peer QUIC sync coordinator.'
+    },
+    {
+        name: 'WASMVectorSearch',
+        requirements: ['wasm'],
+        optional: ['config'],
+        arity: 1,
+        safety: 'opens-resource',
+        description: 'Pure-WASM vector search index.'
+    }
+]);
+export const noArgControllers = Object.freeze(controllerPrerequisites.filter(c => c.requirements.length === 0));
+export function getControllerPrerequisite(name) {
+    return controllerPrerequisites.find(c => c.name === name) ?? null;
+}
+export function filterBySafety(safety) {
+    return controllerPrerequisites.filter(c => safety.includes(c.safety));
+}
+//# sourceMappingURL=prerequisites.js.map

package/dist/agentdb/prerequisites.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"prerequisites.js","sourceRoot":"","sources":["../../src/agentdb/prerequisites.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAuBH,MAAM,CAAC,MAAM,uBAAuB,GAAsC,MAAM,CAAC,MAAM,CAAC;IACtF;QACE,IAAI,EAAE,kBAAkB;QACxB,YAAY,EAAE,CAAC,QAAQ,CAAC;QACxB,QAAQ,EAAE,CAAC,MAAM,CAAC;QAClB,KAAK,EAAE,CAAC;QACR,MAAM,EAAE,gBAAgB;QACxB,WAAW,EAAE,sDAAsD;KACpE;IACD;QACE,IAAI,EAAE,mBAAmB;QACzB,YAAY,EAAE,CAAC,UAAU,CAAC;QAC1B,QAAQ,EAAE,CAAC,UAAU,EAAE,cAAc,EAAE,eAAe,EAAE,QAAQ,CAAC;QACjE,KAAK,EAAE,CAAC;QACR,MAAM,EAAE,gBAAgB;QACxB,WAAW,EAAE,kCAAkC;KAChD;IACD;QACE,IAAI,EAAE,cAAc;QACpB,YAAY,EAAE,CAAC,UAAU,EAAE,UAAU,CAAC;QACtC,QAAQ,EAAE,CAAC,eAAe,EAAE,QAAQ,CAAC;QACrC,KAAK,EAAE,CAAC;QACR,MAAM,EAAE,MAAM;QACd,WAAW,EAAE,yBAAyB;KACvC;IACD;QACE,IAAI,EAAE,oBAAoB;QAC1B,YAAY,EAAE,CAAC,UAAU,CAAC;QAC1B,QAAQ,EAAE,CAAC,UAAU,EAAE,QAAQ,CAAC;QAChC,KAAK,EAAE,CAAC;QACR,MAAM,EAAE,MAAM;QACd,WAAW,EAAE,8CAA8C;KAC5D;IACD;QACE,IAAI,EAAE,kBAAkB;QACxB,YAAY,EAAE,CAAC,QAAQ,CAAC;QACxB,QAAQ,EAAE,EAAE;QACZ,KAAK,EAAE,CAAC;QACR,MAAM,EAAE,MAAM;QACd,WAAW,EAAE,yBAAyB;KACvC;IACD;QACE,IAAI,EAAE,0BAA0B;QAChC,YAAY,EAAE,CAAC,QAAQ,CAAC;QACxB,QAAQ,EAAE,EAAE;QACZ,KAAK,EAAE,CAAC;QACR,MAAM,EAAE,MAAM;QACd,WAAW,EAAE,sDAAsD;KACpE;IACD;QACE,IAAI,EAAE,mBAAmB;QACzB,YAAY,EAAE,CAAC,UAAU,EAAE,UAAU,CAAC;QACtC,QAAQ,EAAE,CAAC,eAAe,CAAC;QAC3B,KAAK,EAAE,CAAC;QACR,MAAM,EAAE,MAAM;QACd,WAAW,EAAE,mCAAmC;KACjD;IACD;QACE,IAAI,EAAE,WAAW;QACjB,YAAY,EAAE,CAAC,UAAU,CAAC;QAC1B,QAAQ,EAAE,CAAC,QAAQ,CAAC;QACpB,KAAK,EAAE,CAAC;QACR,MAAM,EAAE,gBAAgB;QACxB,WAAW,EAAE,4BAA4B;KAC1C;IACD;QACE,IAAI,EAAE,gBAAgB;QACtB,YAAY,EAAE,CAAC,UAAU,EAAE,UAAU,CAAC;QACtC,QAAQ,EAAE,CAAC,eAAe,EAAE,QAAQ,CAAC;QACrC,KAAK,EAAE,CAAC;QACR,MAAM,EAAE,MAAM;QACd,WAAW,EAAE,+BAA+B;KAC7C;IACD;QACE,IAAI,EAAE,oBAAoB;QAC1B,YAAY,EAAE,EAAE;QAChB,QAAQ,EAAE,CAAC,QAAQ,CAAC;QACpB,KAAK,EAAE,CAAC;QACR,MAAM,EAAE,MAAM;QACd,WAAW,EAAE,yBAAyB;KACvC;IACD;QACE,IAAI,EAAE,kBAAkB;QACxB,YAAY,EAAE,EAAE;QAChB,QAAQ,EAAE,CAAC,eAAe,EAAE,QAAQ,CAAC;QACrC,KAAK,EAAE,CAAC;QACR,MAAM,EAAE,MAAM;QACd,WAAW,EAAE,kCAAkC;KAChD;IACD;QACE,IAAI,EAAE,gBAAgB;QACtB,YAAY,EAAE,EAAE;QAChB,QAAQ,EAAE,EAAE;QACZ,KAAK,EAAE,CAAC;QACR,MAAM,EAAE,MAAM;QACd,WAAW,EAAE,uCAAuC;KACrD;IACD;QACE,IAAI,EAAE,gBAAgB;QACtB,YAAY,EAAE,CAAC,UAAU,EAAE,UAAU,CAAC;QACtC,QAAQ,EAAE,CAAC,QAAQ,CAAC;QACpB,KAAK,EAAE,CAAC;QACR,MAAM,EAAE,MAAM;QACd,WAAW,EAAE,oCAAoC;KAClD;IACD;QACE,IAAI,EAAE,YAAY;QAClB,YAAY,EAAE,CAAC,QAAQ,EAAE,iBAAiB,CAAC;QAC3C,QAAQ,EAAE,EAAE;QACZ,KAAK,EAAE,CAAC;QACR,MAAM,EAAE,eAAe;QACvB,WAAW,EAAE,mBAAmB;KACjC;IACD;QACE,IAAI,EAAE,YAAY;QAClB,YAAY,EAAE,CAAC,QAAQ,CAAC;QACxB,QAAQ,EAAE,EAAE;QACZ,KAAK,EAAE,CAAC;QACR,MAAM,EAAE,eAAe;QACvB,WAAW,EAAE,mBAAmB;KACjC;IACD;QACE,IAAI,EAAE,eAAe;QACrB,YAAY,EAAE,CAAC,UAAU,EAAE,UAAU,CAAC;QACtC,QAAQ,EAAE,CAAC,eAAe,EAAE,cAAc,EAAE,QAAQ,CAAC;QACrD,KAAK,EAAE,CAAC;QACR,MAAM,EAAE,MAAM;QACd,WAAW,EAAE,0BAA0B;KACxC;IACD;QACE,IAAI,EAAE,iBAAiB;QACvB,YAAY,EAAE,CAAC,UAAU,EAAE,UAAU,CAAC;QACtC,QAAQ,EAAE,CAAC,eAAe,EAAE,iBAAiB,EAAE,cAAc,CAAC;QAC9D,KAAK,EAAE,CAAC;QACR,MAAM,EAAE,MAAM;QACd,WAAW,EAAE,yBAAyB;KACvC;IACD;QACE,IAAI,EAAE,cAAc;QACpB,YAAY,EAAE,CAAC,UAAU,EAAE,UAAU,CAAC;QACtC,QAAQ,EAAE,CAAC,eAAe,EAAE,cAAc,EAAE,QAAQ,CAAC;QACrD,KAAK,EAAE,CAAC;QACR,MAAM,EAAE,MAAM;QACd,WAAW,EAAE,0BAA0B;KACxC;IACD;QACE,IAAI,EAAE,iBAAiB;QACvB,YAAY,EAAE,CAAC,QAAQ,CAAC;QACxB,QAAQ,EAAE,CAAC,iBAAiB,CAAC;QAC7B,KAAK,EAAE,CAAC;QACR,MAAM,EAAE,eAAe;QACvB,WAAW,EAAE,mCAAmC;KACjD;IACD;QACE,IAAI,EAAE,kBAAkB;QACxB,YAAY,EAAE,CAAC,MAAM,CAAC;QACtB,QAAQ,EAAE,CAAC,QAAQ,CAAC;QACpB,KAAK,EAAE,CAAC;QACR,MAAM,EAAE,gBAAgB;QACxB,WAAW,EAAE,gCAAgC;KAC9C;CACF,CAAC,CAAC;AAEH,MAAM,CAAC,MAAM,gBAAgB,GAAsC,MAAM,CAAC,MAAM,CAC9E,uBAAuB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,MAAM,KAAK,CAAC,CAAC,CACjE,CAAC;AAEF,MAAM,UAAU,yBAAyB,CAAC,IAAY;IACpD,OAAO,uBAAuB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC;AACpE,CAAC;AAED,MAAM,UAAU,cAAc,CAC5B,MAAmC;IAEnC,OAAO,uBAAuB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;AACxE,CAAC","sourcesContent":["/**\n * Controller Prerequisites — local shim for `agentic-flow/agentdb`.\n *\n * Mirrors the registry that lives in the upstream `agentdb` package\n * (`agentdb/dist/controllers/prerequisites.js`). Exposing it through the\n * `agentic-flow/agentdb` re-export means consumers (e.g. ruflo) can rely on\n * a single import surface regardless of which agentdb version is installed.\n *\n * Issue #146 Gap 2.\n */\n\nexport type ControllerRequirement =\n  | 'database'\n  | 'embedder'\n  | 'vectorBackend'\n  | 'graphBackend'\n  | 'learningBackend'\n  | 'config'\n  | 'wasm'\n  | 'networkEndpoint';\n\nexport type ControllerSafety = 'pure' | 'opens-resource' | 'opens-network';\n\nexport interface ControllerPrerequisite {\n  name: string;\n  requirements: ControllerRequirement[];\n  optional: ControllerRequirement[];\n  arity: number;\n  safety: ControllerSafety;\n  description: string;\n}\n\nexport const controllerPrerequisites: readonly ControllerPrerequisite[] = Object.freeze([\n  {\n    name: 'AttentionService',\n    requirements: ['config'],\n    optional: ['wasm'],\n    arity: 1,\n    safety: 'opens-resource',\n    description: 'Self / cross / multi-head attention over embeddings.'\n  },\n  {\n    name: 'CausalMemoryGraph',\n    requirements: ['database'],\n    optional: ['embedder', 'graphBackend', 'vectorBackend', 'config'],\n    arity: 5,\n    safety: 'opens-resource',\n    description: 'Causal edge graph over memories.'\n  },\n  {\n    name: 'CausalRecall',\n    requirements: ['database', 'embedder'],\n    optional: ['vectorBackend', 'config'],\n    arity: 4,\n    safety: 'pure',\n    description: 'Causal-uplift reranker.'\n  },\n  {\n    name: 'ContextSynthesizer',\n    requirements: ['database'],\n    optional: ['embedder', 'config'],\n    arity: 3,\n    safety: 'pure',\n    description: 'Synthesises retrieved memories into context.'\n  },\n  {\n    name: 'EmbeddingService',\n    requirements: ['config'],\n    optional: [],\n    arity: 1,\n    safety: 'pure',\n    description: 'Text → vector embedder.'\n  },\n  {\n    name: 'EnhancedEmbeddingService',\n    requirements: ['config'],\n    optional: [],\n    arity: 1,\n    safety: 'pure',\n    description: 'EmbeddingService with caching and provider fallback.'\n  },\n  {\n    name: 'ExplainableRecall',\n    requirements: ['database', 'embedder'],\n    optional: ['vectorBackend'],\n    arity: 3,\n    safety: 'pure',\n    description: 'Recall with feature attributions.'\n  },\n  {\n    name: 'HNSWIndex',\n    requirements: ['database'],\n    optional: ['config'],\n    arity: 2,\n    safety: 'opens-resource',\n    description: 'On-disk HNSW vector index.'\n  },\n  {\n    name: 'LearningSystem',\n    requirements: ['database', 'embedder'],\n    optional: ['vectorBackend', 'config'],\n    arity: 4,\n    safety: 'pure',\n    description: 'Online learning consolidator.'\n  },\n  {\n    name: 'MMRDiversityRanker',\n    requirements: [],\n    optional: ['config'],\n    arity: 1,\n    safety: 'pure',\n    description: 'MMR diversity reranker.'\n  },\n  {\n    name: 'MemoryController',\n    requirements: [],\n    optional: ['vectorBackend', 'config'],\n    arity: 2,\n    safety: 'pure',\n    description: 'High-level memory orchestration.'\n  },\n  {\n    name: 'MetadataFilter',\n    requirements: [],\n    optional: [],\n    arity: 0,\n    safety: 'pure',\n    description: 'Pure utility for metadata predicates.'\n  },\n  {\n    name: 'NightlyLearner',\n    requirements: ['database', 'embedder'],\n    optional: ['config'],\n    arity: 3,\n    safety: 'pure',\n    description: 'Background consolidation pipeline.'\n  },\n  {\n    name: 'QUICClient',\n    requirements: ['config', 'networkEndpoint'],\n    optional: [],\n    arity: 1,\n    safety: 'opens-network',\n    description: 'QUIC sync client.'\n  },\n  {\n    name: 'QUICServer',\n    requirements: ['config'],\n    optional: [],\n    arity: 1,\n    safety: 'opens-network',\n    description: 'QUIC sync server.'\n  },\n  {\n    name: 'ReasoningBank',\n    requirements: ['database', 'embedder'],\n    optional: ['vectorBackend', 'graphBackend', 'config'],\n    arity: 5,\n    safety: 'pure',\n    description: 'Reasoning memory facade.'\n  },\n  {\n    name: 'ReflexionMemory',\n    requirements: ['database', 'embedder'],\n    optional: ['vectorBackend', 'learningBackend', 'graphBackend'],\n    arity: 5,\n    safety: 'pure',\n    description: 'Episodic replay memory.'\n  },\n  {\n    name: 'SkillLibrary',\n    requirements: ['database', 'embedder'],\n    optional: ['vectorBackend', 'graphBackend', 'config'],\n    arity: 5,\n    safety: 'pure',\n    description: 'Reusable skill registry.'\n  },\n  {\n    name: 'SyncCoordinator',\n    requirements: ['config'],\n    optional: ['networkEndpoint'],\n    arity: 1,\n    safety: 'opens-network',\n    description: 'Multi-peer QUIC sync coordinator.'\n  },\n  {\n    name: 'WASMVectorSearch',\n    requirements: ['wasm'],\n    optional: ['config'],\n    arity: 1,\n    safety: 'opens-resource',\n    description: 'Pure-WASM vector search index.'\n  }\n]);\n\nexport const noArgControllers: readonly ControllerPrerequisite[] = Object.freeze(\n  controllerPrerequisites.filter(c => c.requirements.length === 0)\n);\n\nexport function getControllerPrerequisite(name: string): ControllerPrerequisite | null {\n  return controllerPrerequisites.find(c => c.name === name) ?? null;\n}\n\nexport function filterBySafety(\n  safety: readonly ControllerSafety[]\n): readonly ControllerPrerequisite[] {\n  return controllerPrerequisites.filter(c => safety.includes(c.safety));\n}\n"]}

package/dist/benchmarks/embeddings-benchmark.d.ts

@@ -0,0 +1,38 @@
+/**
+ * Embeddings Performance Benchmark Suite
+ *
+ * Measures performance of:
+ * - O(1) LRU Cache operations
+ * - Parallel batch embedding
+ * - 8x unrolled cosine similarity
+ * - Neural substrate operations
+ * - Overall throughput
+ */
+interface BenchmarkResult {
+    name: string;
+    iterations: number;
+    totalMs: number;
+    avgMs: number;
+    opsPerSec: number;
+    minMs: number;
+    maxMs: number;
+    p95Ms: number;
+}
+declare function benchmark(name: string, fn: () => Promise<void> | void, iterations?: number): Promise<BenchmarkResult>;
+declare function runBenchmarks(): Promise<{
+    results: BenchmarkResult[];
+    memory: {
+        heapBefore: number;
+        heapAfter: number;
+        heapDelta: number;
+        gcPauses: number;
+    };
+    throughput: {
+        textsProcessed: number;
+        totalTimeMs: number;
+        textsPerSecond: number;
+    };
+}>;
+export { runBenchmarks, benchmark };
+export type { BenchmarkResult };
+//# sourceMappingURL=embeddings-benchmark.d.ts.map

package/dist/benchmarks/embeddings-benchmark.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"embeddings-benchmark.d.ts","sourceRoot":"","sources":["../../src/benchmarks/embeddings-benchmark.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAcH,UAAU,eAAe;IACvB,IAAI,EAAE,MAAM,CAAC;IACb,UAAU,EAAE,MAAM,CAAC;IACnB,OAAO,EAAE,MAAM,CAAC;IAChB,KAAK,EAAE,MAAM,CAAC;IACd,SAAS,EAAE,MAAM,CAAC;IAClB,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;CACf;AAED,iBAAe,SAAS,CACtB,IAAI,EAAE,MAAM,EACZ,EAAE,EAAE,MAAM,OAAO,CAAC,IAAI,CAAC,GAAG,IAAI,EAC9B,UAAU,GAAE,MAAa,GACxB,OAAO,CAAC,eAAe,CAAC,CA6B1B;AAuOD,iBAAe,aAAa;;;oBAnEd,MAAM;mBACP,MAAM;mBACN,MAAM;kBACP,MAAM;;;wBAqCA,MAAM;qBACT,MAAM;wBACH,MAAM;;GA+GvB;AAKD,OAAO,EAAE,aAAa,EAAE,SAAS,EAAE,CAAC;AACpC,YAAY,EAAE,eAAe,EAAE,CAAC"}

package/dist/benchmarks/embeddings-benchmark.js

@@ -0,0 +1,282 @@
+/**
+ * Embeddings Performance Benchmark Suite
+ *
+ * Measures performance of:
+ * - O(1) LRU Cache operations
+ * - Parallel batch embedding
+ * - 8x unrolled cosine similarity
+ * - Neural substrate operations
+ * - Overall throughput
+ */
+import { performance } from 'perf_hooks';
+import { getOptimizedEmbedder, cosineSimilarity, euclideanDistance, normalizeVector } from '../embeddings/optimized-embedder.js';
+async function benchmark(name, fn, iterations = 1000) {
+    const times = [];
+    // Warmup
+    for (let i = 0; i < Math.min(10, iterations / 10); i++) {
+        await fn();
+    }
+    // Actual benchmark
+    for (let i = 0; i < iterations; i++) {
+        const start = performance.now();
+        await fn();
+        times.push(performance.now() - start);
+    }
+    times.sort((a, b) => a - b);
+    const totalMs = times.reduce((a, b) => a + b, 0);
+    const avgMs = totalMs / iterations;
+    return {
+        name,
+        iterations,
+        totalMs,
+        avgMs,
+        opsPerSec: 1000 / avgMs,
+        minMs: times[0],
+        maxMs: times[times.length - 1],
+        p95Ms: times[Math.floor(iterations * 0.95)]
+    };
+}
+function formatResult(result) {
+    return [
+        `  ${result.name}`,
+        `    Iterations: ${result.iterations.toLocaleString()}`,
+        `    Total: ${result.totalMs.toFixed(2)}ms`,
+        `    Avg: ${result.avgMs.toFixed(4)}ms`,
+        `    Ops/sec: ${result.opsPerSec.toFixed(2)}`,
+        `    Min: ${result.minMs.toFixed(4)}ms`,
+        `    Max: ${result.maxMs.toFixed(4)}ms`,
+        `    P95: ${result.p95Ms.toFixed(4)}ms`
+    ].join('\n');
+}
+// ============================================================================
+// Vector Operation Benchmarks
+// ============================================================================
+async function benchmarkCosineSimilarity() {
+    const dim = 384;
+    const a = new Float32Array(dim);
+    const b = new Float32Array(dim);
+    // Initialize with random values
+    for (let i = 0; i < dim; i++) {
+        a[i] = Math.random() - 0.5;
+        b[i] = Math.random() - 0.5;
+    }
+    normalizeVector(a);
+    normalizeVector(b);
+    return benchmark('Cosine Similarity (384d, 8x unrolled)', () => {
+        cosineSimilarity(a, b);
+    }, 100000);
+}
+async function benchmarkEuclideanDistance() {
+    const dim = 384;
+    const a = new Float32Array(dim);
+    const b = new Float32Array(dim);
+    for (let i = 0; i < dim; i++) {
+        a[i] = Math.random() - 0.5;
+        b[i] = Math.random() - 0.5;
+    }
+    return benchmark('Euclidean Distance (384d)', () => {
+        euclideanDistance(a, b);
+    }, 100000);
+}
+async function benchmarkNormalize() {
+    const dim = 384;
+    const vectors = [];
+    // Pre-create vectors
+    for (let i = 0; i < 1000; i++) {
+        const v = new Float32Array(dim);
+        for (let j = 0; j < dim; j++) {
+            v[j] = Math.random() - 0.5;
+        }
+        vectors.push(v);
+    }
+    let idx = 0;
+    return benchmark('Normalize Vector (384d)', () => {
+        normalizeVector(vectors[idx++ % 1000]);
+    }, 100000);
+}
+// ============================================================================
+// Cache Benchmarks
+// ============================================================================
+async function benchmarkCacheOperations() {
+    const embedder = getOptimizedEmbedder();
+    await embedder.init();
+    const results = [];
+    // Pre-populate cache
+    const texts = Array.from({ length: 256 }, (_, i) => `cache test text ${i}`);
+    for (const text of texts) {
+        await embedder.embed(text);
+    }
+    // Benchmark cache hits
+    results.push(await benchmark('Cache Hit (O(1) LRU)', async () => {
+        await embedder.embed(texts[Math.floor(Math.random() * 256)]);
+    }, 10000));
+    // Benchmark cache miss + embedding
+    let missIdx = 1000;
+    results.push(await benchmark('Cache Miss + Embed', async () => {
+        await embedder.embed(`unique text for miss ${missIdx++}`);
+    }, 100));
+    return results;
+}
+// ============================================================================
+// Batch Embedding Benchmarks
+// ============================================================================
+async function benchmarkBatchEmbedding() {
+    const embedder = getOptimizedEmbedder();
+    await embedder.init();
+    embedder.clearCache();
+    const results = [];
+    // Small batch
+    const smallBatch = Array.from({ length: 10 }, (_, i) => `small batch text ${i}`);
+    results.push(await benchmark('Batch Embed (10 texts, parallel)', async () => {
+        embedder.clearCache();
+        await embedder.embedBatch(smallBatch, 4);
+    }, 20));
+    // Medium batch
+    const mediumBatch = Array.from({ length: 50 }, (_, i) => `medium batch text ${i}`);
+    results.push(await benchmark('Batch Embed (50 texts, parallel)', async () => {
+        embedder.clearCache();
+        await embedder.embedBatch(mediumBatch, 4);
+    }, 10));
+    // Compare sequential vs parallel (simulated)
+    results.push(await benchmark('Batch Embed (10 texts, cached)', async () => {
+        await embedder.embedBatch(smallBatch, 4); // Should hit cache
+    }, 100));
+    return results;
+}
+// ============================================================================
+// Similarity Search Benchmarks
+// ============================================================================
+async function benchmarkSimilaritySearch() {
+    const embedder = getOptimizedEmbedder();
+    await embedder.init();
+    const results = [];
+    // Prepare candidates
+    const candidates = Array.from({ length: 100 }, (_, i) => `candidate document about topic ${i % 10} with content ${i}`);
+    // Pre-embed candidates
+    await embedder.embedBatch(candidates, 4);
+    results.push(await benchmark('Find Similar (100 candidates, top-5)', async () => {
+        await embedder.findSimilar('search query about topic 5', candidates, 5);
+    }, 50));
+    return results;
+}
+// ============================================================================
+// Memory Pressure Test
+// ============================================================================
+async function benchmarkMemoryPressure() {
+    const embedder = getOptimizedEmbedder();
+    await embedder.init();
+    embedder.clearCache();
+    // Force GC if available
+    if (global.gc)
+        global.gc();
+    const heapBefore = process.memoryUsage().heapUsed;
+    let gcPauses = 0;
+    // Generate 1000 embeddings
+    for (let i = 0; i < 1000; i++) {
+        await embedder.embed(`memory pressure test text ${i} with some content`);
+        // Detect potential GC pauses
+        const start = performance.now();
+        await new Promise(resolve => setImmediate(resolve));
+        if (performance.now() - start > 5)
+            gcPauses++;
+    }
+    const heapAfter = process.memoryUsage().heapUsed;
+    return {
+        heapBefore,
+        heapAfter,
+        heapDelta: heapAfter - heapBefore,
+        gcPauses
+    };
+}
+// ============================================================================
+// Throughput Test
+// ============================================================================
+async function benchmarkThroughput() {
+    const embedder = getOptimizedEmbedder();
+    await embedder.init();
+    embedder.clearCache();
+    const texts = Array.from({ length: 100 }, (_, i) => `throughput test document ${i} with varying content length ${i * 10}`);
+    const start = performance.now();
+    await embedder.embedBatch(texts, 4);
+    const totalTimeMs = performance.now() - start;
+    return {
+        textsProcessed: texts.length,
+        totalTimeMs,
+        textsPerSecond: (texts.length / totalTimeMs) * 1000
+    };
+}
+// ============================================================================
+// Main Benchmark Runner
+// ============================================================================
+async function runBenchmarks() {
+    console.log('\n' + '='.repeat(70));
+    console.log('  EMBEDDINGS PERFORMANCE BENCHMARK SUITE');
+    console.log('  agentic-flow v2.0.1-alpha.50');
+    console.log('='.repeat(70) + '\n');
+    const allResults = [];
+    // Vector Operations
+    console.log('📐 Vector Operations\n');
+    const cosineSim = await benchmarkCosineSimilarity();
+    console.log(formatResult(cosineSim) + '\n');
+    allResults.push(cosineSim);
+    const euclidean = await benchmarkEuclideanDistance();
+    console.log(formatResult(euclidean) + '\n');
+    allResults.push(euclidean);
+    const normalize = await benchmarkNormalize();
+    console.log(formatResult(normalize) + '\n');
+    allResults.push(normalize);
+    // Cache Operations
+    console.log('\n💾 Cache Operations (O(1) LRU)\n');
+    const cacheResults = await benchmarkCacheOperations();
+    for (const result of cacheResults) {
+        console.log(formatResult(result) + '\n');
+        allResults.push(result);
+    }
+    // Batch Embedding
+    console.log('\n⚡ Batch Embedding (Parallel Processing)\n');
+    const batchResults = await benchmarkBatchEmbedding();
+    for (const result of batchResults) {
+        console.log(formatResult(result) + '\n');
+        allResults.push(result);
+    }
+    // Similarity Search
+    console.log('\n🔍 Similarity Search\n');
+    const searchResults = await benchmarkSimilaritySearch();
+    for (const result of searchResults) {
+        console.log(formatResult(result) + '\n');
+        allResults.push(result);
+    }
+    // Memory Pressure
+    console.log('\n🧠 Memory Pressure Test\n');
+    const memoryResult = await benchmarkMemoryPressure();
+    console.log(`  Heap Before: ${(memoryResult.heapBefore / 1024 / 1024).toFixed(2)} MB`);
+    console.log(`  Heap After: ${(memoryResult.heapAfter / 1024 / 1024).toFixed(2)} MB`);
+    console.log(`  Heap Delta: ${(memoryResult.heapDelta / 1024 / 1024).toFixed(2)} MB`);
+    console.log(`  Potential GC Pauses: ${memoryResult.gcPauses}\n`);
+    // Throughput
+    console.log('\n🚀 Throughput Test\n');
+    const throughput = await benchmarkThroughput();
+    console.log(`  Texts Processed: ${throughput.textsProcessed}`);
+    console.log(`  Total Time: ${throughput.totalTimeMs.toFixed(2)} ms`);
+    console.log(`  Throughput: ${throughput.textsPerSecond.toFixed(2)} texts/sec\n`);
+    // Summary
+    console.log('\n' + '='.repeat(70));
+    console.log('  BENCHMARK SUMMARY');
+    console.log('='.repeat(70) + '\n');
+    console.log('  Key Metrics:');
+    console.log(`    • Cosine Similarity: ${cosineSim.opsPerSec.toFixed(0)} ops/sec`);
+    console.log(`    • Cache Hit: ${cacheResults[0].opsPerSec.toFixed(0)} ops/sec`);
+    console.log(`    • Batch Throughput: ${throughput.textsPerSecond.toFixed(1)} texts/sec`);
+    console.log(`    • Memory Efficiency: ${(memoryResult.heapDelta / 1024).toFixed(1)} KB for 1000 embeds`);
+    console.log('\n  Performance Characteristics:');
+    console.log('    ✓ O(1) LRU cache operations');
+    console.log('    ✓ 8x loop unrolling with ILP');
+    console.log('    ✓ Parallel batch processing');
+    console.log('    ✓ Pre-allocated tensor buffers');
+    console.log('    ✓ Minimal GC pressure\n');
+    return { results: allResults, memory: memoryResult, throughput };
+}
+// Run if executed directly
+runBenchmarks().catch(console.error);
+export { runBenchmarks, benchmark };
+//# sourceMappingURL=embeddings-benchmark.js.map

package/dist/benchmarks/embeddings-benchmark.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"embeddings-benchmark.js","sourceRoot":"","sources":["../../src/benchmarks/embeddings-benchmark.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AACzC,OAAO,EACL,oBAAoB,EACpB,gBAAgB,EAChB,iBAAiB,EACjB,eAAe,EAChB,MAAM,qCAAqC,CAAC;AAiB7C,KAAK,UAAU,SAAS,CACtB,IAAY,EACZ,EAA8B,EAC9B,aAAqB,IAAI;IAEzB,MAAM,KAAK,GAAa,EAAE,CAAC;IAE3B,SAAS;IACT,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,UAAU,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACvD,MAAM,EAAE,EAAE,CAAC;IACb,CAAC;IAED,mBAAmB;IACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;QACpC,MAAM,KAAK,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;QAChC,MAAM,EAAE,EAAE,CAAC;QACX,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC,CAAC;IACxC,CAAC;IAED,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC5B,MAAM,OAAO,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IACjD,MAAM,KAAK,GAAG,OAAO,GAAG,UAAU,CAAC;IAEnC,OAAO;QACL,IAAI;QACJ,UAAU;QACV,OAAO;QACP,KAAK;QACL,SAAS,EAAE,IAAI,GAAG,KAAK;QACvB,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;QACf,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;QAC9B,KAAK,EAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,GAAG,IAAI,CAAC,CAAC;KAC5C,CAAC;AACJ,CAAC;AAED,SAAS,YAAY,CAAC,MAAuB;IAC3C,OAAO;QACL,KAAK,MAAM,CAAC,IAAI,EAAE;QAClB,mBAAmB,MAAM,CAAC,UAAU,CAAC,cAAc,EAAE,EAAE;QACvD,cAAc,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI;QAC3C,YAAY,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI;QACvC,gBAAgB,MAAM,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;QAC7C,YAAY,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI;QACvC,YAAY,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI;QACvC,YAAY,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI;KACxC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AACf,CAAC;AAED,+EAA+E;AAC/E,8BAA8B;AAC9B,+EAA+E;AAE/E,KAAK,UAAU,yBAAyB;IACtC,MAAM,GAAG,GAAG,GAAG,CAAC;IAChB,MAAM,CAAC,GAAG,IAAI,YAAY,CAAC,GAAG,CAAC,CAAC;IAChC,MAAM,CAAC,GAAG,IAAI,YAAY,CAAC,GAAG,CAAC,CAAC;IAEhC,gCAAgC;IAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7B,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,GAAG,GAAG,CAAC;QAC3B,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,GAAG,GAAG,CAAC;IAC7B,CAAC;IACD,eAAe,CAAC,CAAC,CAAC,CAAC;IACnB,eAAe,CAAC,CAAC,CAAC,CAAC;IAEnB,OAAO,SAAS,CAAC,uCAAuC,EAAE,GAAG,EAAE;QAC7D,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACzB,CAAC,EAAE,MAAM,CAAC,CAAC;AACb,CAAC;AAED,KAAK,UAAU,0BAA0B;IACvC,MAAM,GAAG,GAAG,GAAG,CAAC;IAChB,MAAM,CAAC,GAAG,IAAI,YAAY,CAAC,GAAG,CAAC,CAAC;IAChC,MAAM,CAAC,GAAG,IAAI,YAAY,CAAC,GAAG,CAAC,CAAC;IAEhC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7B,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,GAAG,GAAG,CAAC;QAC3B,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,GAAG,GAAG,CAAC;IAC7B,CAAC;IAED,OAAO,SAAS,CAAC,2BAA2B,EAAE,GAAG,EAAE;QACjD,iBAAiB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1B,CAAC,EAAE,MAAM,CAAC,CAAC;AACb,CAAC;AAED,KAAK,UAAU,kBAAkB;IAC/B,MAAM,GAAG,GAAG,GAAG,CAAC;IAChB,MAAM,OAAO,GAAmB,EAAE,CAAC;IAEnC,qBAAqB;IACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9B,MAAM,CAAC,GAAG,IAAI,YAAY,CAAC,GAAG,CAAC,CAAC;QAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,GAAG,GAAG,CAAC;QAC7B,CAAC;QACD,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAClB,CAAC;IAED,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,OAAO,SAAS,CAAC,yBAAyB,EAAE,GAAG,EAAE;QAC/C,eAAe,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC;IACzC,CAAC,EAAE,MAAM,CAAC,CAAC;AACb,CAAC;AAED,+EAA+E;AAC/E,mBAAmB;AACnB,+EAA+E;AAE/E,KAAK,UAAU,wBAAwB;IACrC,MAAM,QAAQ,GAAG,oBAAoB,EAAE,CAAC;IACxC,MAAM,QAAQ,CAAC,IAAI,EAAE,CAAC;IAEtB,MAAM,OAAO,GAAsB,EAAE,CAAC;IAEtC,qBAAqB;IACrB,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,mBAAmB,CAAC,EAAE,CAAC,CAAC;IAC5E,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAC7B,CAAC;IAED,uBAAuB;IACvB,OAAO,CAAC,IAAI,CAAC,MAAM,SAAS,CAAC,sBAAsB,EAAE,KAAK,IAAI,EAAE;QAC9D,MAAM,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IAC/D,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;IAEX,mCAAmC;IACnC,IAAI,OAAO,GAAG,IAAI,CAAC;IACnB,OAAO,CAAC,IAAI,CAAC,MAAM,SAAS,CAAC,oBAAoB,EAAE,KAAK,IAAI,EAAE;QAC5D,MAAM,QAAQ,CAAC,KAAK,CAAC,wBAAwB,OAAO,EAAE,EAAE,CAAC,CAAC;IAC5D,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;IAET,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,+EAA+E;AAC/E,6BAA6B;AAC7B,+EAA+E;AAE/E,KAAK,UAAU,uBAAuB;IACpC,MAAM,QAAQ,GAAG,oBAAoB,EAAE,CAAC;IACxC,MAAM,QAAQ,CAAC,IAAI,EAAE,CAAC;IACtB,QAAQ,CAAC,UAAU,EAAE,CAAC;IAEtB,MAAM,OAAO,GAAsB,EAAE,CAAC;IAEtC,cAAc;IACd,MAAM,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,oBAAoB,CAAC,EAAE,CAAC,CAAC;IACjF,OAAO,CAAC,IAAI,CAAC,MAAM,SAAS,CAAC,kCAAkC,EAAE,KAAK,IAAI,EAAE;QAC1E,QAAQ,CAAC,UAAU,EAAE,CAAC;QACtB,MAAM,QAAQ,CAAC,UAAU,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;IAC3C,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAER,eAAe;IACf,MAAM,WAAW,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,qBAAqB,CAAC,EAAE,CAAC,CAAC;IACnF,OAAO,CAAC,IAAI,CAAC,MAAM,SAAS,CAAC,kCAAkC,EAAE,KAAK,IAAI,EAAE;QAC1E,QAAQ,CAAC,UAAU,EAAE,CAAC;QACtB,MAAM,QAAQ,CAAC,UAAU,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;IAC5C,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAER,6CAA6C;IAC7C,OAAO,CAAC,IAAI,CAAC,MAAM,SAAS,CAAC,gCAAgC,EAAE,KAAK,IAAI,EAAE;QACxE,MAAM,QAAQ,CAAC,UAAU,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,CAAC,mBAAmB;IAC/D,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;IAET,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,+EAA+E;AAC/E,+BAA+B;AAC/B,+EAA+E;AAE/E,KAAK,UAAU,yBAAyB;IACtC,MAAM,QAAQ,GAAG,oBAAoB,EAAE,CAAC;IACxC,MAAM,QAAQ,CAAC,IAAI,EAAE,CAAC;IAEtB,MAAM,OAAO,GAAsB,EAAE,CAAC;IAEtC,qBAAqB;IACrB,MAAM,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACtD,kCAAkC,CAAC,GAAG,EAAE,iBAAiB,CAAC,EAAE,CAC7D,CAAC;IAEF,uBAAuB;IACvB,MAAM,QAAQ,CAAC,UAAU,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;IAEzC,OAAO,CAAC,IAAI,CAAC,MAAM,SAAS,CAAC,sCAAsC,EAAE,KAAK,IAAI,EAAE;QAC9E,MAAM,QAAQ,CAAC,WAAW,CAAC,4BAA4B,EAAE,UAAU,EAAE,CAAC,CAAC,CAAC;IAC1E,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAER,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,+EAA+E;AAC/E,uBAAuB;AACvB,+EAA+E;AAE/E,KAAK,UAAU,uBAAuB;IAMpC,MAAM,QAAQ,GAAG,oBAAoB,EAAE,CAAC;IACxC,MAAM,QAAQ,CAAC,IAAI,EAAE,CAAC;IACtB,QAAQ,CAAC,UAAU,EAAE,CAAC;IAEtB,wBAAwB;IACxB,IAAI,MAAM,CAAC,EAAE;QAAE,MAAM,CAAC,EAAE,EAAE,CAAC;IAE3B,MAAM,UAAU,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC;IAClD,IAAI,QAAQ,GAAG,CAAC,CAAC;IAEjB,2BAA2B;IAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9B,MAAM,QAAQ,CAAC,KAAK,CAAC,6BAA6B,CAAC,oBAAoB,CAAC,CAAC;QAEzE,6BAA6B;QAC7B,MAAM,KAAK,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;QAChC,MAAM,IAAI,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC,CAAC;QACpD,IAAI,WAAW,CAAC,GAAG,EAAE,GAAG,KAAK,GAAG,CAAC;YAAE,QAAQ,EAAE,CAAC;IAChD,CAAC;IAED,MAAM,SAAS,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC;IAEjD,OAAO;QACL,UAAU;QACV,SAAS;QACT,SAAS,EAAE,SAAS,GAAG,UAAU;QACjC,QAAQ;KACT,CAAC;AACJ,CAAC;AAED,+EAA+E;AAC/E,kBAAkB;AAClB,+EAA+E;AAE/E,KAAK,UAAU,mBAAmB;IAKhC,MAAM,QAAQ,GAAG,oBAAoB,EAAE,CAAC;IACxC,MAAM,QAAQ,CAAC,IAAI,EAAE,CAAC;IACtB,QAAQ,CAAC,UAAU,EAAE,CAAC;IAEtB,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACjD,4BAA4B,CAAC,gCAAgC,CAAC,GAAG,EAAE,EAAE,CACtE,CAAC;IAEF,MAAM,KAAK,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;IAChC,MAAM,QAAQ,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IACpC,MAAM,WAAW,GAAG,WAAW,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC;IAE9C,OAAO;QACL,cAAc,EAAE,KAAK,CAAC,MAAM;QAC5B,WAAW;QACX,cAAc,EAAE,CAAC,KAAK,CAAC,MAAM,GAAG,WAAW,CAAC,GAAG,IAAI;KACpD,CAAC;AACJ,CAAC;AAED,+EAA+E;AAC/E,wBAAwB;AACxB,+EAA+E;AAE/E,KAAK,UAAU,aAAa;IAC1B,OAAO,CAAC,GAAG,CAAC,IAAI,GAAG,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;IACnC,OAAO,CAAC,GAAG,CAAC,0CAA0C,CAAC,CAAC;IACxD,OAAO,CAAC,GAAG,CAAC,gCAAgC,CAAC,CAAC;IAC9C,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC;IAEnC,MAAM,UAAU,GAAsB,EAAE,CAAC;IAEzC,oBAAoB;IACpB,OAAO,CAAC,GAAG,CAAC,wBAAwB,CAAC,CAAC;IAEtC,MAAM,SAAS,GAAG,MAAM,yBAAyB,EAAE,CAAC;IACpD,OAAO,CAAC,GAAG,CAAC,YAAY,CAAC,SAAS,CAAC,GAAG,IAAI,CAAC,CAAC;IAC5C,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IAE3B,MAAM,SAAS,GAAG,MAAM,0BAA0B,EAAE,CAAC;IACrD,OAAO,CAAC,GAAG,CAAC,YAAY,CAAC,SAAS,CAAC,GAAG,IAAI,CAAC,CAAC;IAC5C,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IAE3B,MAAM,SAAS,GAAG,MAAM,kBAAkB,EAAE,CAAC;IAC7C,OAAO,CAAC,GAAG,CAAC,YAAY,CAAC,SAAS,CAAC,GAAG,IAAI,CAAC,CAAC;IAC5C,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IAE3B,mBAAmB;IACnB,OAAO,CAAC,GAAG,CAAC,oCAAoC,CAAC,CAAC;IAElD,MAAM,YAAY,GAAG,MAAM,wBAAwB,EAAE,CAAC;IACtD,KAAK,MAAM,MAAM,IAAI,YAAY,EAAE,CAAC;QAClC,OAAO,CAAC,GAAG,CAAC,YAAY,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC;QACzC,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC1B,CAAC;IAED,kBAAkB;IAClB,OAAO,CAAC,GAAG,CAAC,6CAA6C,CAAC,CAAC;IAE3D,MAAM,YAAY,GAAG,MAAM,uBAAuB,EAAE,CAAC;IACrD,KAAK,MAAM,MAAM,IAAI,YAAY,EAAE,CAAC;QAClC,OAAO,CAAC,GAAG,CAAC,YAAY,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC;QACzC,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC1B,CAAC;IAED,oBAAoB;IACpB,OAAO,CAAC,GAAG,CAAC,0BAA0B,CAAC,CAAC;IAExC,MAAM,aAAa,GAAG,MAAM,yBAAyB,EAAE,CAAC;IACxD,KAAK,MAAM,MAAM,IAAI,aAAa,EAAE,CAAC;QACnC,OAAO,CAAC,GAAG,CAAC,YAAY,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC;QACzC,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC1B,CAAC;IAED,kBAAkB;IAClB,OAAO,CAAC,GAAG,CAAC,6BAA6B,CAAC,CAAC;IAE3C,MAAM,YAAY,GAAG,MAAM,uBAAuB,EAAE,CAAC;IACrD,OAAO,CAAC,GAAG,CAAC,kBAAkB,CAAC,YAAY,CAAC,UAAU,GAAG,IAAI,GAAG,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IACvF,OAAO,CAAC,GAAG,CAAC,iBAAiB,CAAC,YAAY,CAAC,SAAS,GAAG,IAAI,GAAG,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IACrF,OAAO,CAAC,GAAG,CAAC,iBAAiB,CAAC,YAAY,CAAC,SAAS,GAAG,IAAI,GAAG,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IACrF,OAAO,CAAC,GAAG,CAAC,0BAA0B,YAAY,CAAC,QAAQ,IAAI,CAAC,CAAC;IAEjE,aAAa;IACb,OAAO,CAAC,GAAG,CAAC,wBAAwB,CAAC,CAAC;IAEtC,MAAM,UAAU,GAAG,MAAM,mBAAmB,EAAE,CAAC;IAC/C,OAAO,CAAC,GAAG,CAAC,sBAAsB,UAAU,CAAC,cAAc,EAAE,CAAC,CAAC;IAC/D,OAAO,CAAC,GAAG,CAAC,iBAAiB,UAAU,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IACrE,OAAO,CAAC,GAAG,CAAC,iBAAiB,UAAU,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC;IAEjF,UAAU;IACV,OAAO,CAAC,GAAG,CAAC,IAAI,GAAG,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;IACnC,OAAO,CAAC,GAAG,CAAC,qBAAqB,CAAC,CAAC;IACnC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC;IAEnC,OAAO,CAAC,GAAG,CAAC,gBAAgB,CAAC,CAAC;IAC9B,OAAO,CAAC,GAAG,CAAC,4BAA4B,SAAS,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;IAClF,OAAO,CAAC,GAAG,CAAC,oBAAoB,YAAY,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;IAChF,OAAO,CAAC,GAAG,CAAC,2BAA2B,UAAU,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC;IACzF,OAAO,CAAC,GAAG,CAAC,4BAA4B,CAAC,YAAY,CAAC,SAAS,GAAG,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,qBAAqB,CAAC,CAAC;IAEzG,OAAO,CAAC,GAAG,CAAC,kCAAkC,CAAC,CAAC;IAChD,OAAO,CAAC,GAAG,CAAC,iCAAiC,CAAC,CAAC;IAC/C,OAAO,CAAC,GAAG,CAAC,kCAAkC,CAAC,CAAC;IAChD,OAAO,CAAC,GAAG,CAAC,iCAAiC,CAAC,CAAC;IAC/C,OAAO,CAAC,GAAG,CAAC,oCAAoC,CAAC,CAAC;IAClD,OAAO,CAAC,GAAG,CAAC,6BAA6B,CAAC,CAAC;IAE3C,OAAO,EAAE,OAAO,EAAE,UAAU,EAAE,MAAM,EAAE,YAAY,EAAE,UAAU,EAAE,CAAC;AACnE,CAAC;AAED,2BAA2B;AAC3B,aAAa,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;AAErC,OAAO,EAAE,aAAa,EAAE,SAAS,EAAE,CAAC","sourcesContent":["/**\n * Embeddings Performance Benchmark Suite\n *\n * Measures performance of:\n * - O(1) LRU Cache operations\n * - Parallel batch embedding\n * - 8x unrolled cosine similarity\n * - Neural substrate operations\n * - Overall throughput\n */\n\nimport { performance } from 'perf_hooks';\nimport {\n  getOptimizedEmbedder,\n  cosineSimilarity,\n  euclideanDistance,\n  normalizeVector\n} from '../embeddings/optimized-embedder.js';\n\n// ============================================================================\n// Benchmark Utilities\n// ============================================================================\n\ninterface BenchmarkResult {\n  name: string;\n  iterations: number;\n  totalMs: number;\n  avgMs: number;\n  opsPerSec: number;\n  minMs: number;\n  maxMs: number;\n  p95Ms: number;\n}\n\nasync function benchmark(\n  name: string,\n  fn: () => Promise<void> | void,\n  iterations: number = 1000\n): Promise<BenchmarkResult> {\n  const times: number[] = [];\n\n  // Warmup\n  for (let i = 0; i < Math.min(10, iterations / 10); i++) {\n    await fn();\n  }\n\n  // Actual benchmark\n  for (let i = 0; i < iterations; i++) {\n    const start = performance.now();\n    await fn();\n    times.push(performance.now() - start);\n  }\n\n  times.sort((a, b) => a - b);\n  const totalMs = times.reduce((a, b) => a + b, 0);\n  const avgMs = totalMs / iterations;\n\n  return {\n    name,\n    iterations,\n    totalMs,\n    avgMs,\n    opsPerSec: 1000 / avgMs,\n    minMs: times[0],\n    maxMs: times[times.length - 1],\n    p95Ms: times[Math.floor(iterations * 0.95)]\n  };\n}\n\nfunction formatResult(result: BenchmarkResult): string {\n  return [\n    `  ${result.name}`,\n    `    Iterations: ${result.iterations.toLocaleString()}`,\n    `    Total: ${result.totalMs.toFixed(2)}ms`,\n    `    Avg: ${result.avgMs.toFixed(4)}ms`,\n    `    Ops/sec: ${result.opsPerSec.toFixed(2)}`,\n    `    Min: ${result.minMs.toFixed(4)}ms`,\n    `    Max: ${result.maxMs.toFixed(4)}ms`,\n    `    P95: ${result.p95Ms.toFixed(4)}ms`\n  ].join('\\n');\n}\n\n// ============================================================================\n// Vector Operation Benchmarks\n// ============================================================================\n\nasync function benchmarkCosineSimilarity(): Promise<BenchmarkResult> {\n  const dim = 384;\n  const a = new Float32Array(dim);\n  const b = new Float32Array(dim);\n\n  // Initialize with random values\n  for (let i = 0; i < dim; i++) {\n    a[i] = Math.random() - 0.5;\n    b[i] = Math.random() - 0.5;\n  }\n  normalizeVector(a);\n  normalizeVector(b);\n\n  return benchmark('Cosine Similarity (384d, 8x unrolled)', () => {\n    cosineSimilarity(a, b);\n  }, 100000);\n}\n\nasync function benchmarkEuclideanDistance(): Promise<BenchmarkResult> {\n  const dim = 384;\n  const a = new Float32Array(dim);\n  const b = new Float32Array(dim);\n\n  for (let i = 0; i < dim; i++) {\n    a[i] = Math.random() - 0.5;\n    b[i] = Math.random() - 0.5;\n  }\n\n  return benchmark('Euclidean Distance (384d)', () => {\n    euclideanDistance(a, b);\n  }, 100000);\n}\n\nasync function benchmarkNormalize(): Promise<BenchmarkResult> {\n  const dim = 384;\n  const vectors: Float32Array[] = [];\n\n  // Pre-create vectors\n  for (let i = 0; i < 1000; i++) {\n    const v = new Float32Array(dim);\n    for (let j = 0; j < dim; j++) {\n      v[j] = Math.random() - 0.5;\n    }\n    vectors.push(v);\n  }\n\n  let idx = 0;\n  return benchmark('Normalize Vector (384d)', () => {\n    normalizeVector(vectors[idx++ % 1000]);\n  }, 100000);\n}\n\n// ============================================================================\n// Cache Benchmarks\n// ============================================================================\n\nasync function benchmarkCacheOperations(): Promise<BenchmarkResult[]> {\n  const embedder = getOptimizedEmbedder();\n  await embedder.init();\n\n  const results: BenchmarkResult[] = [];\n\n  // Pre-populate cache\n  const texts = Array.from({ length: 256 }, (_, i) => `cache test text ${i}`);\n  for (const text of texts) {\n    await embedder.embed(text);\n  }\n\n  // Benchmark cache hits\n  results.push(await benchmark('Cache Hit (O(1) LRU)', async () => {\n    await embedder.embed(texts[Math.floor(Math.random() * 256)]);\n  }, 10000));\n\n  // Benchmark cache miss + embedding\n  let missIdx = 1000;\n  results.push(await benchmark('Cache Miss + Embed', async () => {\n    await embedder.embed(`unique text for miss ${missIdx++}`);\n  }, 100));\n\n  return results;\n}\n\n// ============================================================================\n// Batch Embedding Benchmarks\n// ============================================================================\n\nasync function benchmarkBatchEmbedding(): Promise<BenchmarkResult[]> {\n  const embedder = getOptimizedEmbedder();\n  await embedder.init();\n  embedder.clearCache();\n\n  const results: BenchmarkResult[] = [];\n\n  // Small batch\n  const smallBatch = Array.from({ length: 10 }, (_, i) => `small batch text ${i}`);\n  results.push(await benchmark('Batch Embed (10 texts, parallel)', async () => {\n    embedder.clearCache();\n    await embedder.embedBatch(smallBatch, 4);\n  }, 20));\n\n  // Medium batch\n  const mediumBatch = Array.from({ length: 50 }, (_, i) => `medium batch text ${i}`);\n  results.push(await benchmark('Batch Embed (50 texts, parallel)', async () => {\n    embedder.clearCache();\n    await embedder.embedBatch(mediumBatch, 4);\n  }, 10));\n\n  // Compare sequential vs parallel (simulated)\n  results.push(await benchmark('Batch Embed (10 texts, cached)', async () => {\n    await embedder.embedBatch(smallBatch, 4); // Should hit cache\n  }, 100));\n\n  return results;\n}\n\n// ============================================================================\n// Similarity Search Benchmarks\n// ============================================================================\n\nasync function benchmarkSimilaritySearch(): Promise<BenchmarkResult[]> {\n  const embedder = getOptimizedEmbedder();\n  await embedder.init();\n\n  const results: BenchmarkResult[] = [];\n\n  // Prepare candidates\n  const candidates = Array.from({ length: 100 }, (_, i) =>\n    `candidate document about topic ${i % 10} with content ${i}`\n  );\n\n  // Pre-embed candidates\n  await embedder.embedBatch(candidates, 4);\n\n  results.push(await benchmark('Find Similar (100 candidates, top-5)', async () => {\n    await embedder.findSimilar('search query about topic 5', candidates, 5);\n  }, 50));\n\n  return results;\n}\n\n// ============================================================================\n// Memory Pressure Test\n// ============================================================================\n\nasync function benchmarkMemoryPressure(): Promise<{\n  heapBefore: number;\n  heapAfter: number;\n  heapDelta: number;\n  gcPauses: number;\n}> {\n  const embedder = getOptimizedEmbedder();\n  await embedder.init();\n  embedder.clearCache();\n\n  // Force GC if available\n  if (global.gc) global.gc();\n\n  const heapBefore = process.memoryUsage().heapUsed;\n  let gcPauses = 0;\n\n  // Generate 1000 embeddings\n  for (let i = 0; i < 1000; i++) {\n    await embedder.embed(`memory pressure test text ${i} with some content`);\n\n    // Detect potential GC pauses\n    const start = performance.now();\n    await new Promise(resolve => setImmediate(resolve));\n    if (performance.now() - start > 5) gcPauses++;\n  }\n\n  const heapAfter = process.memoryUsage().heapUsed;\n\n  return {\n    heapBefore,\n    heapAfter,\n    heapDelta: heapAfter - heapBefore,\n    gcPauses\n  };\n}\n\n// ============================================================================\n// Throughput Test\n// ============================================================================\n\nasync function benchmarkThroughput(): Promise<{\n  textsProcessed: number;\n  totalTimeMs: number;\n  textsPerSecond: number;\n}> {\n  const embedder = getOptimizedEmbedder();\n  await embedder.init();\n  embedder.clearCache();\n\n  const texts = Array.from({ length: 100 }, (_, i) =>\n    `throughput test document ${i} with varying content length ${i * 10}`\n  );\n\n  const start = performance.now();\n  await embedder.embedBatch(texts, 4);\n  const totalTimeMs = performance.now() - start;\n\n  return {\n    textsProcessed: texts.length,\n    totalTimeMs,\n    textsPerSecond: (texts.length / totalTimeMs) * 1000\n  };\n}\n\n// ============================================================================\n// Main Benchmark Runner\n// ============================================================================\n\nasync function runBenchmarks() {\n  console.log('\\n' + '='.repeat(70));\n  console.log('  EMBEDDINGS PERFORMANCE BENCHMARK SUITE');\n  console.log('  agentic-flow v2.0.1-alpha.50');\n  console.log('='.repeat(70) + '\\n');\n\n  const allResults: BenchmarkResult[] = [];\n\n  // Vector Operations\n  console.log('📐 Vector Operations\\n');\n\n  const cosineSim = await benchmarkCosineSimilarity();\n  console.log(formatResult(cosineSim) + '\\n');\n  allResults.push(cosineSim);\n\n  const euclidean = await benchmarkEuclideanDistance();\n  console.log(formatResult(euclidean) + '\\n');\n  allResults.push(euclidean);\n\n  const normalize = await benchmarkNormalize();\n  console.log(formatResult(normalize) + '\\n');\n  allResults.push(normalize);\n\n  // Cache Operations\n  console.log('\\n💾 Cache Operations (O(1) LRU)\\n');\n\n  const cacheResults = await benchmarkCacheOperations();\n  for (const result of cacheResults) {\n    console.log(formatResult(result) + '\\n');\n    allResults.push(result);\n  }\n\n  // Batch Embedding\n  console.log('\\n⚡ Batch Embedding (Parallel Processing)\\n');\n\n  const batchResults = await benchmarkBatchEmbedding();\n  for (const result of batchResults) {\n    console.log(formatResult(result) + '\\n');\n    allResults.push(result);\n  }\n\n  // Similarity Search\n  console.log('\\n🔍 Similarity Search\\n');\n\n  const searchResults = await benchmarkSimilaritySearch();\n  for (const result of searchResults) {\n    console.log(formatResult(result) + '\\n');\n    allResults.push(result);\n  }\n\n  // Memory Pressure\n  console.log('\\n🧠 Memory Pressure Test\\n');\n\n  const memoryResult = await benchmarkMemoryPressure();\n  console.log(`  Heap Before: ${(memoryResult.heapBefore / 1024 / 1024).toFixed(2)} MB`);\n  console.log(`  Heap After: ${(memoryResult.heapAfter / 1024 / 1024).toFixed(2)} MB`);\n  console.log(`  Heap Delta: ${(memoryResult.heapDelta / 1024 / 1024).toFixed(2)} MB`);\n  console.log(`  Potential GC Pauses: ${memoryResult.gcPauses}\\n`);\n\n  // Throughput\n  console.log('\\n🚀 Throughput Test\\n');\n\n  const throughput = await benchmarkThroughput();\n  console.log(`  Texts Processed: ${throughput.textsProcessed}`);\n  console.log(`  Total Time: ${throughput.totalTimeMs.toFixed(2)} ms`);\n  console.log(`  Throughput: ${throughput.textsPerSecond.toFixed(2)} texts/sec\\n`);\n\n  // Summary\n  console.log('\\n' + '='.repeat(70));\n  console.log('  BENCHMARK SUMMARY');\n  console.log('='.repeat(70) + '\\n');\n\n  console.log('  Key Metrics:');\n  console.log(`    • Cosine Similarity: ${cosineSim.opsPerSec.toFixed(0)} ops/sec`);\n  console.log(`    • Cache Hit: ${cacheResults[0].opsPerSec.toFixed(0)} ops/sec`);\n  console.log(`    • Batch Throughput: ${throughput.textsPerSecond.toFixed(1)} texts/sec`);\n  console.log(`    • Memory Efficiency: ${(memoryResult.heapDelta / 1024).toFixed(1)} KB for 1000 embeds`);\n\n  console.log('\\n  Performance Characteristics:');\n  console.log('    ✓ O(1) LRU cache operations');\n  console.log('    ✓ 8x loop unrolling with ILP');\n  console.log('    ✓ Parallel batch processing');\n  console.log('    ✓ Pre-allocated tensor buffers');\n  console.log('    ✓ Minimal GC pressure\\n');\n\n  return { results: allResults, memory: memoryResult, throughput };\n}\n\n// Run if executed directly\nrunBenchmarks().catch(console.error);\n\nexport { runBenchmarks, benchmark };\nexport type { BenchmarkResult };\n"]}