@adaas/a-frame 0.0.23 → 0.1.2

package/dist/node/chunk-KKL2DF2D.cjs

@@ -0,0 +1,518 @@
+'use strict';
+
+var chunkC37B34MH_cjs = require('./chunk-C37B34MH.cjs');
+var chunkHAORARSB_cjs = require('./chunk-HAORARSB.cjs');
+var chunk64QCZG53_cjs = require('./chunk-64QCZG53.cjs');
+var aConcept = require('@adaas/a-concept');
+
+var A_FrameDynamicPatch = class extends aConcept.A_Entity {
+  static get concept() {
+    return "a-frame";
+  }
+  // component count change vs. previous patch
+  fromNew(options) {
+    this.version = options.version;
+    this.timestamp = options.timestamp;
+    this.reason = options.reason;
+    this.encoded = options.encoded;
+    this.delta = options.delta;
+  }
+  toJSON() {
+    return {
+      ...super.toJSON(),
+      version: this.version,
+      timestamp: this.timestamp,
+      reason: this.reason,
+      encoded: this.encoded,
+      delta: this.delta
+    };
+  }
+};
+
+// src/lib/A-FrameDynamicContent/A-FrameDynamicContent.constants.ts
+var A_FrameDynamicContentFeatures = {
+  Generate: "_A_FRAME_DYNAMIC_CONTENT_GENERATE",
+  Patch: "_A_FRAME_DYNAMIC_CONTENT_PATCH"
+};
+var A_FrameDynamicContentOperation = class extends aConcept.A_Fragment {
+  constructor(params = {}) {
+    super({ name: "a-frame-dynamic-content-operation-context" });
+    this._meta = /* @__PURE__ */ new Map();
+    this._meta.set("params", params);
+  }
+  get params() {
+    return this._meta.get("params");
+  }
+  get(key) {
+    return this._meta.get(key);
+  }
+  set(key, value) {
+    this._meta.set(key, value);
+  }
+};
+var A_FrameDynamicContentError = class extends aConcept.A_Error {
+};
+A_FrameDynamicContentError.GenerationFailed = "GenerationFailed";
+A_FrameDynamicContentError.PatchFailed = "PatchFailed";
+A_FrameDynamicContentError.InvalidPatch = "InvalidPatch";
+A_FrameDynamicContentError.PieceNotFound = "PieceNotFound";
+var _A_FrameDynamicContentIndex = class _A_FrameDynamicContentIndex extends aConcept.A_Fragment {
+  constructor() {
+    super(...arguments);
+    /** Ordered list of segment IDs — defines the canonical reading order. */
+    this._order = [];
+    /** O(1) lookup by id. */
+    this._map = /* @__PURE__ */ new Map();
+  }
+  // ── Accessors ─────────────────────────────────────────────────────────────
+  get count() {
+    return this._order.length;
+  }
+  get size() {
+    return this._order.length;
+  }
+  // ── Basic mutation ────────────────────────────────────────────────────────
+  /** Append one or more segments to the end. */
+  add(...segments) {
+    segments.forEach((seg) => {
+      this._map.set(seg.id, seg);
+      if (!this._order.includes(seg.id)) {
+        this._order.push(seg.id);
+      }
+    });
+  }
+  /** Replace the content of an existing segment in-place (position unchanged). */
+  update(segment) {
+    this._map.set(segment.id, segment);
+    if (!this._order.includes(segment.id)) {
+      this._order.push(segment.id);
+    }
+  }
+  /** Remove a segment by id. */
+  remove(id) {
+    this._map.delete(id);
+    const idx = this._order.indexOf(id);
+    if (idx !== -1) this._order.splice(idx, 1);
+  }
+  /** Remove all segments. */
+  clear() {
+    this._map.clear();
+    this._order = [];
+  }
+  // ── Positional insertion ──────────────────────────────────────────────────
+  /** Insert `segment` immediately before the segment with `targetId`. */
+  insertBefore(targetId, segment) {
+    this._map.set(segment.id, segment);
+    const targetIdx = this._order.indexOf(targetId);
+    if (targetIdx === -1) {
+      this._order.push(segment.id);
+    } else {
+      this._order.splice(targetIdx, 0, segment.id);
+    }
+  }
+  /** Insert `segment` immediately after the segment with `targetId`. */
+  insertAfter(targetId, segment) {
+    this._map.set(segment.id, segment);
+    const targetIdx = this._order.indexOf(targetId);
+    if (targetIdx === -1) {
+      this._order.push(segment.id);
+    } else {
+      this._order.splice(targetIdx + 1, 0, segment.id);
+    }
+  }
+  /** Swap the content of `targetId` with `segment`, keeping the same position. */
+  replace(targetId, segment) {
+    const pos = this._order.indexOf(targetId);
+    if (pos === -1) return;
+    this._map.delete(targetId);
+    this._map.set(segment.id, segment);
+    this._order[pos] = segment.id;
+  }
+  // ── Position management ────────────────────────────────────────────────────
+  /** Move the segment with `id` to absolute zero-based `newPosition`. */
+  moveTo(id, newPosition) {
+    const from = this._order.indexOf(id);
+    if (from === -1) return;
+    this._order.splice(from, 1);
+    const clipped = Math.max(0, Math.min(newPosition, this._order.length));
+    this._order.splice(clipped, 0, id);
+  }
+  /** Move `id` to directly before `targetId`. */
+  moveBefore(id, targetId) {
+    const from = this._order.indexOf(id);
+    if (from === -1) return;
+    this._order.splice(from, 1);
+    const to = this._order.indexOf(targetId);
+    this._order.splice(to === -1 ? 0 : to, 0, id);
+  }
+  /** Move `id` to directly after `targetId`. */
+  moveAfter(id, targetId) {
+    const from = this._order.indexOf(id);
+    if (from === -1) return;
+    this._order.splice(from, 1);
+    const to = this._order.indexOf(targetId);
+    this._order.splice(to === -1 ? this._order.length : to + 1, 0, id);
+  }
+  // ── Patch operation dispatch ──────────────────────────────────────────────
+  /**
+   * Apply a single `A_FrameContentPatchOperation` to the index.
+   * For `add` and `replace` the caller must supply the resolved `segment`.
+   * For `remove` only the `op` is needed.
+   */
+  applyOperation(op, segment) {
+    switch (op.action) {
+      case "remove": {
+        if (op.targetId) this.remove(op.targetId);
+        break;
+      }
+      case "replace": {
+        if (op.targetId && segment) this.replace(op.targetId, segment);
+        break;
+      }
+      case "add": {
+        if (!segment) break;
+        if (!op.targetId || op.position === "append") {
+          this.add(segment);
+        } else if (op.position === "before") {
+          this.insertBefore(op.targetId, segment);
+        } else {
+          this.insertAfter(op.targetId, segment);
+        }
+        break;
+      }
+    }
+  }
+  // ── Lookup ────────────────────────────────────────────────────────────────
+  get(id) {
+    return this._map.get(id);
+  }
+  /** Returns all segments in their current canonical order. */
+  list() {
+    return this._order.map((id) => this._map.get(id)).filter((s) => s !== void 0);
+  }
+  // ── Search ────────────────────────────────────────────────────────────────
+  /**
+   * Computes the centroid (element-wise mean) of all embedded segments.
+   * Returns `null` when no segments have been embedded yet.
+   * The centroid represents the overall semantic "centre of gravity" of this
+   * content block and is used by `A_FrameDynamicContent.compareTo()` to
+   * measure similarity between two content instances.
+   */
+  centroid() {
+    const embedded = this.list().filter((s) => s.isEmbed && s.vector);
+    if (embedded.length === 0) return null;
+    const dim = embedded[0].vector.length;
+    const sum = new Float32Array(dim);
+    for (const seg of embedded) {
+      const vals = seg.vector.values;
+      for (let i = 0; i < dim; i++) sum[i] += vals[i];
+    }
+    for (let i = 0; i < dim; i++) sum[i] /= embedded.length;
+    return new chunkHAORARSB_cjs.A_FrameVector(sum);
+  }
+  /**
+   * Rank all embedded segments by cosine similarity to the query vector.
+   */
+  search(vector, topK = _A_FrameDynamicContentIndex.PATCH_PIECE_LIMIT) {
+    const queryVec = vector.normalize();
+    return this.list().filter((s) => s.isEmbed && s.vector).map((s) => ({
+      segment: s,
+      score: queryVec.dot(s.vector.normalize())
+    })).sort((a, b) => b.score - a.score).slice(0, topK);
+  }
+  /**
+   * Rank segments by how many instruction keywords appear in their content.
+   * Words shorter than 4 characters are ignored.
+   */
+  searchByKeywords(instruction, topK = _A_FrameDynamicContentIndex.PATCH_PIECE_LIMIT) {
+    const keywords = instruction.toLowerCase().split(/\W+/).filter((w) => w.length > 3);
+    if (keywords.length === 0) return [];
+    return this.list().map((segment) => {
+      const lower = segment.content.toLowerCase();
+      const score = keywords.reduce(
+        (acc, kw) => acc + (lower.includes(kw) ? 1 : 0),
+        0
+      );
+      return { segment, score };
+    }).filter((s) => s.score > 0).sort((a, b) => b.score - a.score).slice(0, topK);
+  }
+  /**
+   * Select at most `limit` segments most relevant to a patch instruction.
+   *
+   * Priority:
+   *   1. Vector search  — when `vector` is provided and segments carry embeddings.
+   *   2. Keyword search — fallback when embeddings are absent or vector is null.
+   *   3. Identity       — first N segments when neither search finds candidates.
+   */
+  selectForPatch(vector, instruction, limit = _A_FrameDynamicContentIndex.PATCH_PIECE_LIMIT) {
+    const all = this.list();
+    if (all.length <= limit) return all;
+    if (vector) {
+      const hasEmbedded = all.some((s) => s.isEmbed);
+      if (hasEmbedded) {
+        const results = this.search(vector, limit);
+        if (results.length > 0) return results.map((r) => r.segment);
+      }
+    }
+    const kwResults = this.searchByKeywords(instruction, limit);
+    if (kwResults.length > 0) return kwResults.map((r) => r.segment);
+    return all.slice(0, limit);
+  }
+  // ── Similarity helpers ────────────────────────────────────────────────────
+  cosineSimilarity(a, b) {
+    if (!b) return 0;
+    const dot = a.dot(b);
+    const mag = a.magnitude() * b.magnitude();
+    return mag === 0 ? 0 : dot / mag;
+  }
+};
+/** Maximum segments forwarded to the server in a single patch request. */
+_A_FrameDynamicContentIndex.PATCH_PIECE_LIMIT = 5;
+var A_FrameDynamicContentIndex = _A_FrameDynamicContentIndex;
+
+// src/lib/A-FrameDynamicContent/A-FrameDynamicContent.entity.ts
+var A_FrameDynamicContent = class extends aConcept.A_Entity {
+  static get concept() {
+    return "a-frame";
+  }
+  /**
+   * 
+   */
+  get scope() {
+    if (!this._scope) {
+      this._scope = aConcept.A_Context.allocate(this, new aConcept.A_Scope({ name: `${this.aseid.id}-scope` }));
+    }
+    return this._scope;
+  }
+  get index() {
+    const index = this.scope.resolve(A_FrameDynamicContentIndex);
+    return index;
+  }
+  fromNew(options) {
+    super.fromNew(options);
+    const index = new A_FrameDynamicContentIndex({ name: `${this.aseid.id}` });
+    this.scope.register(index);
+    this.createdAt = Date.now();
+    this.prompt = options.prompt;
+    this.model = options.options?.model || chunk64QCZG53_cjs.A_FRAME_MODELS.LYRA;
+    this._system = options.options?.system;
+    this._patchPieceLimit = options.options?.patchPieceLimit || A_FrameDynamicContentIndex.PATCH_PIECE_LIMIT;
+    this._history = [];
+    this._version = 0;
+  }
+  // ── Accessors ────────────────────────────────────────────────────────────
+  /** Ordered list of content pieces (output of the last generate or patch). */
+  get segments() {
+    return this.index.list();
+  }
+  /** Full content reconstructed from all segments in index order. */
+  get content() {
+    return this.index.list().map((s) => s.content).join("\n");
+  }
+  /** Alias for `content` — kept for backward compatibility. */
+  get text() {
+    return this.content;
+  }
+  /** Immutable patch history. */
+  get history() {
+    return this._history;
+  }
+  /** Current content version (increments with each patch). */
+  get version() {
+    return this._version;
+  }
+  /** The AI model name to use for generation / patching. */
+  get modelName() {
+    return this.model;
+  }
+  /** Optional system prompt forwarded to the AI for generation and patching. */
+  get systemPrompt() {
+    return this._system;
+  }
+  // ── Main pipeline ─────────────────────────────────────────────────────────
+  /**
+   * Generate content from the entity's prompt.
+   * Populates `pieces` and creates the first history entry.
+   */
+  async generate() {
+    const operation = new A_FrameDynamicContentOperation();
+    if (!this.scope.isInheritedFrom(aConcept.A_Context.scope(this)))
+      this.scope.inherit(aConcept.A_Context.scope(this));
+    const executionScope = new aConcept.A_Scope({
+      name: "a-frame-dynamic-content-generate",
+      fragments: [operation]
+    }).inherit(this.scope);
+    try {
+      await this.call(A_FrameDynamicContentFeatures.Generate, executionScope);
+      executionScope.destroy();
+    } catch (err) {
+      executionScope.destroy();
+      throw new A_FrameDynamicContentError({
+        title: A_FrameDynamicContentError.GenerationFailed,
+        description: `Failed to generate content: ${err instanceof Error ? err.message : String(err)}`
+      });
+    }
+  }
+  /**
+   * Apply a natural-language patch instruction to the current pieces.
+   *
+   * When `targetSegments` is provided the caller pins the exact segments to
+   * patch — no embedding or semantic search is performed.  Every supplied
+   * segment must already belong to this content's index; unknown segments
+   * are rejected with an error.
+   *
+   * When omitted, the server identifies which segments to modify using
+   * semantic search over segment embeddings (original behaviour).
+   */
+  async patch(instruction, targetSegments) {
+    if (!this.scope.isInheritedFrom(aConcept.A_Context.scope(this)))
+      this.scope.inherit(aConcept.A_Context.scope(this));
+    const executionScope = new aConcept.A_Scope({
+      name: "a-frame-dynamic-content-patch"
+    }).inherit(this.scope);
+    let segments;
+    if (targetSegments !== void 0) {
+      const pinned = Array.isArray(targetSegments) ? targetSegments : [targetSegments];
+      const unknown = pinned.filter((s) => !this.index.get(s.id));
+      if (unknown.length > 0) {
+        executionScope.destroy();
+        throw new A_FrameDynamicContentError({
+          title: A_FrameDynamicContentError.PatchFailed,
+          description: `Segment(s) not found in this content's index: ` + unknown.map((s) => `"${s.id}"`).join(", ") + `. Only segments that belong to this DynamicContent instance can be targeted.`
+        });
+      }
+      segments = pinned;
+    } else {
+      const inputSegment = new chunkC37B34MH_cjs.A_FrameSegment({
+        content: instruction,
+        options: { task: "query" }
+      });
+      executionScope.register(inputSegment);
+      await inputSegment.embed();
+      segments = this.index.selectForPatch(inputSegment.vector ?? null, instruction, this._patchPieceLimit);
+    }
+    const operation = new A_FrameDynamicContentOperation({
+      instruction,
+      segments
+    });
+    executionScope.register(operation);
+    try {
+      await this.call(A_FrameDynamicContentFeatures.Patch, executionScope);
+      executionScope.destroy();
+    } catch (err) {
+      executionScope.destroy();
+      throw new A_FrameDynamicContentError({
+        title: A_FrameDynamicContentError.PatchFailed,
+        description: `Failed to patch content: ${err instanceof Error ? err.message : String(err)}`
+      });
+    }
+  }
+  // ── Comparison ────────────────────────────────────────────────────────────
+  /**
+   * Returns a cosine similarity score (0–1) between this content and `other`.
+   *
+   * The score is computed from the centroid of each content's embedded
+   * segments — the element-wise mean of all segment vectors.  Two contents
+   * about the same topic should score close to 1; unrelated contents will
+   * score near 0.
+   *
+   * Returns 0 if either content has no embedded segments.
+   *
+   * @example
+   * const cats1 = new A_FrameDynamicContent({ prompt: 'Article about cats' });
+   * const cats2 = new A_FrameDynamicContent({ prompt: 'Article about cats' });
+   * const cars  = new A_FrameDynamicContent({ prompt: 'Article about cars' });
+   * // After generate() on all three:
+   * cats1.compareTo(cats2); // ~0.92 — high
+   * cats1.compareTo(cars);  // ~0.45 — low
+   */
+  compareTo(other) {
+    const centroidA = this.index.centroid();
+    const centroidB = other.index.centroid();
+    if (!centroidA || !centroidB) return 0;
+    return centroidA.cosineSimilarity(centroidB);
+  }
+  // ── Hydration ─────────────────────────────────────────────────────────────
+  /**
+   * Populate index from the segments created by the channel after a generate response.
+   * Creates the first history entry.
+   */
+  hydrateFromGeneration(segments, meta) {
+    segments.forEach((s) => this.index.add(s));
+    this._history.push(new A_FrameDynamicPatch({
+      version: this._version,
+      timestamp: Date.now(),
+      reason: `Generated for: "${this.prompt}"`,
+      encoded: Buffer.from(JSON.stringify(this.index.list())).toString("base64"),
+      delta: this.index.size
+    }));
+  }
+  /**
+   * Apply a patch diff returned by the server to the current piece list.
+   * Increments the version and records a history entry.
+   */
+  hydrateFromPatch(patchResult, meta) {
+    const prevCount = this.index.size;
+    const normalize = (s) => s.toLowerCase().replace(/[^\w\s]/g, "").replace(/\s+/g, " ").trim();
+    const existingNormalized = this.index.list().map((s) => normalize(s.content));
+    const isNearDuplicate = (newContent) => {
+      const norm = normalize(newContent);
+      if (norm.length < 8) return false;
+      return existingNormalized.some(
+        (existing) => existing === norm || // exact match
+        existing.includes(norm)
+        // new text is a strict substring of something existing
+        // Note: do NOT check norm.includes(existing) — that would block  
+        // valid extensions where new content starts with an existing phrase.
+      );
+    };
+    for (const op of patchResult.operations) {
+      if (!["add", "replace", "remove"].includes(op.action)) continue;
+      let segment;
+      if (op.segment) {
+        const dup = (op.action === "add" || op.action === "replace") && isNearDuplicate(op.segment.content);
+        if (dup) continue;
+        segment = new chunkC37B34MH_cjs.A_FrameSegment({ content: op.segment.content, options: { task: "document" } });
+        if (op.segment.embedding?.length) {
+          segment.hydrateFromEmbedding(new Float32Array(op.segment.embedding));
+        }
+      }
+      if (op.action === "add") {
+        const validPositions = /* @__PURE__ */ new Set(["before", "after", "append", void 0]);
+        if (!validPositions.has(op.position)) {
+          op.position = "append";
+          op.targetId = void 0;
+        }
+      }
+      this.index.applyOperation(op, segment);
+    }
+    this._version++;
+    this._history.push(new A_FrameDynamicPatch({
+      version: this._version,
+      timestamp: Date.now(),
+      reason: patchResult.patchSummary,
+      encoded: Buffer.from(JSON.stringify(this.index.list())).toString("base64"),
+      delta: this.index.size - prevCount
+    }));
+  }
+  // ── Serialisation ──────────────────────────────────────────────────────────
+  toJSON() {
+    return {
+      ...super.toJSON(),
+      prompt: this.prompt,
+      metadata: {
+        model: this.model,
+        createdAt: this.createdAt
+      },
+      history: this._history.map((item) => item.toJSON())
+    };
+  }
+};
+
+exports.A_FrameDynamicContent = A_FrameDynamicContent;
+exports.A_FrameDynamicContentError = A_FrameDynamicContentError;
+exports.A_FrameDynamicContentFeatures = A_FrameDynamicContentFeatures;
+exports.A_FrameDynamicContentOperation = A_FrameDynamicContentOperation;
+exports.A_FrameDynamicPatch = A_FrameDynamicPatch;
+//# sourceMappingURL=chunk-KKL2DF2D.cjs.map
+//# sourceMappingURL=chunk-KKL2DF2D.cjs.map

package/dist/node/chunk-KKL2DF2D.cjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../src/lib/A-FrameDynamicPatch/A-FrameDynamicPatch.entity.ts","../../src/lib/A-FrameDynamicContent/A-FrameDynamicContent.constants.ts","../../src/lib/A-FrameDynamicContent/A-FrameDynamicContentOperation.context.ts","../../src/lib/A-FrameDynamicContent/A-FrameDynamicContent.error.ts","../../src/lib/A-FrameDynamicContent/A-FrameDynamicContentIndex.context.ts","../../src/lib/A-FrameDynamicContent/A-FrameDynamicContent.entity.ts"],"names":["A_Entity","A_Fragment","A_Error","A_FrameVector","A_Context","A_Scope","A_FRAME_MODELS","A_FrameSegment"],"mappings":";;;;;;;AAIO,IAAM,mBAAA,GAAN,cAAkCA,iBAAA,CAAmE;AAAA,EAExG,WAAW,OAAA,GAAkB;AACzB,IAAA,OAAO,SAAA;AAAA,EACX;AAAA;AAAA,EAUA,QAAQ,OAAA,EAAmC;AACvC,IAAA,IAAA,CAAK,UAAU,OAAA,CAAQ,OAAA;AACvB,IAAA,IAAA,CAAK,YAAY,OAAA,CAAQ,SAAA;AACzB,IAAA,IAAA,CAAK,SAAS,OAAA,CAAQ,MAAA;AACtB,IAAA,IAAA,CAAK,UAAU,OAAA,CAAQ,OAAA;AACvB,IAAA,IAAA,CAAK,QAAQ,OAAA,CAAQ,KAAA;AAAA,EACzB;AAAA,EAGA,MAAA,GAAyC;AACrC,IAAA,OAAO;AAAA,MACH,GAAG,MAAM,MAAA,EAAO;AAAA,MAChB,SAAS,IAAA,CAAK,OAAA;AAAA,MACd,WAAW,IAAA,CAAK,SAAA;AAAA,MAChB,QAAQ,IAAA,CAAK,MAAA;AAAA,MACb,SAAS,IAAA,CAAK,OAAA;AAAA,MACd,OAAO,IAAA,CAAK;AAAA,KAChB;AAAA,EACJ;AACJ;;;ACpCO,IAAM,6BAAA,GAAgC;AAAA,EACzC,QAAA,EAAU,mCAAA;AAAA,EACV,KAAA,EAAO;AACX;ACDO,IAAM,8BAAA,GAAN,cAEGC,mBAAA,CAAW;AAAA,EAIjB,WAAA,CAAY,MAAA,GAAuB,EAAC,EAAmB;AACnD,IAAA,KAAA,CAAM,EAAE,IAAA,EAAM,2CAAA,EAA6C,CAAA;AAH/D,IAAA,IAAA,CAAU,KAAA,uBAA8B,GAAA,EAAI;AAIxC,IAAA,IAAA,CAAK,KAAA,CAAM,GAAA,CAAI,QAAA,EAAU,MAAM,CAAA;AAAA,EACnC;AAAA,EAEA,IAAI,MAAA,GAAuB;AACvB,IAAA,OAAO,IAAA,CAAK,KAAA,CAAM,GAAA,CAAI,QAAQ,CAAA;AAAA,EAClC;AAAA,EAEA,IAAI,GAAA,EAAa;AACb,IAAA,OAAO,IAAA,CAAK,KAAA,CAAM,GAAA,CAAI,GAAG,CAAA;AAAA,EAC7B;AAAA,EAEA,GAAA,CAAI,KAAa,KAAA,EAAY;AACzB,IAAA,IAAA,CAAK,KAAA,CAAM,GAAA,CAAI,GAAA,EAAK,KAAK,CAAA;AAAA,EAC7B;AACJ;ACtBO,IAAM,0BAAA,GAAN,cAAyCC,gBAAA,CAAQ;AAMxD;AANa,0BAAA,CAEO,gBAAA,GAAmB,kBAAA;AAF1B,0BAAA,CAGO,WAAA,GAAc,aAAA;AAHrB,0BAAA,CAIO,YAAA,GAAe,cAAA;AAJtB,0BAAA,CAKO,aAAA,GAAgB,eAAA;ACI7B,IAAM,2BAAA,GAAN,MAAM,2BAAA,SAAmCD,mBAAAA,CAAW;AAAA,EAApD,WAAA,GAAA;AAAA,IAAA,KAAA,CAAA,GAAA,SAAA,CAAA;AAMH;AAAA,IAAA,IAAA,CAAQ,SAAmB,EAAC;AAG5B;AAAA,IAAA,IAAA,CAAQ,IAAA,uBAAwC,GAAA,EAAI;AAAA,EAAA;AAAA;AAAA,EAIpD,IAAI,KAAA,GAAgB;AAChB,IAAA,OAAO,KAAK,MAAA,CAAO,MAAA;AAAA,EACvB;AAAA,EAEA,IAAI,IAAA,GAAe;AACf,IAAA,OAAO,KAAK,MAAA,CAAO,MAAA;AAAA,EACvB;AAAA;AAAA;AAAA,EAKA,OAAO,QAAA,EAAkC;AACrC,IAAA,QAAA,CAAS,QAAQ,CAAA,GAAA,KAAO;AACpB,MAAA,IAAA,CAAK,IAAA,CAAK,GAAA,CAAI,GAAA,CAAI,EAAA,EAAc,GAAG,CAAA;AACnC,MAAA,IAAI,CAAC,IAAA,CAAK,MAAA,CAAO,QAAA,CAAS,GAAA,CAAI,EAAY,CAAA,EAAG;AACzC,QAAA,IAAA,CAAK,MAAA,CAAO,IAAA,CAAK,GAAA,CAAI,EAAY,CAAA;AAAA,MACrC;AAAA,IACJ,CAAC,CAAA;AAAA,EACL;AAAA;AAAA,EAGA,OAAO,OAAA,EAA+B;AAClC,IAAA,IAAA,CAAK,IAAA,CAAK,GAAA,CAAI,OAAA,CAAQ,EAAA,EAAI,OAAO,CAAA;AACjC,IAAA,IAAI,CAAC,IAAA,CAAK,MAAA,CAAO,QAAA,CAAS,OAAA,CAAQ,EAAE,CAAA,EAAG;AACnC,MAAA,IAAA,CAAK,MAAA,CAAO,IAAA,CAAK,OAAA,CAAQ,EAAE,CAAA;AAAA,IAC/B;AAAA,EACJ;AAAA;AAAA,EAGA,OAAO,EAAA,EAAkB;AACrB,IAAA,IAAA,CAAK,IAAA,CAAK,OAAO,EAAE,CAAA;AACnB,IAAA,MAAM,GAAA,GAAM,IAAA,CAAK,MAAA,CAAO,OAAA,CAAQ,EAAE,CAAA;AAClC,IAAA,IAAI,QAAQ,EAAA,EAAI,IAAA,CAAK,MAAA,CAAO,MAAA,CAAO,KAAK,CAAC,CAAA;AAAA,EAC7C;AAAA;AAAA,EAGA,KAAA,GAAc;AACV,IAAA,IAAA,CAAK,KAAK,KAAA,EAAM;AAChB,IAAA,IAAA,CAAK,SAAS,EAAC;AAAA,EACnB;AAAA;AAAA;AAAA,EAKA,YAAA,CAAa,UAAkB,OAAA,EAA+B;AAC1D,IAAA,IAAA,CAAK,IAAA,CAAK,GAAA,CAAI,OAAA,CAAQ,EAAA,EAAI,OAAO,CAAA;AACjC,IAAA,MAAM,SAAA,GAAY,IAAA,CAAK,MAAA,CAAO,OAAA,CAAQ,QAAQ,CAAA;AAC9C,IAAA,IAAI,cAAc,EAAA,EAAI;AAClB,MAAA,IAAA,CAAK,MAAA,CAAO,IAAA,CAAK,OAAA,CAAQ,EAAE,CAAA;AAAA,IAC/B,CAAA,MAAO;AACH,MAAA,IAAA,CAAK,MAAA,CAAO,MAAA,CAAO,SAAA,EAAW,CAAA,EAAG,QAAQ,EAAE,CAAA;AAAA,IAC/C;AAAA,EACJ;AAAA;AAAA,EAGA,WAAA,CAAY,UAAkB,OAAA,EAA+B;AACzD,IAAA,IAAA,CAAK,IAAA,CAAK,GAAA,CAAI,OAAA,CAAQ,EAAA,EAAI,OAAO,CAAA;AACjC,IAAA,MAAM,SAAA,GAAY,IAAA,CAAK,MAAA,CAAO,OAAA,CAAQ,QAAQ,CAAA;AAC9C,IAAA,IAAI,cAAc,EAAA,EAAI;AAClB,MAAA,IAAA,CAAK,MAAA,CAAO,IAAA,CAAK,OAAA,CAAQ,EAAE,CAAA;AAAA,IAC/B,CAAA,MAAO;AACH,MAAA,IAAA,CAAK,OAAO,MAAA,CAAO,SAAA,GAAY,CAAA,EAAG,CAAA,EAAG,QAAQ,EAAE,CAAA;AAAA,IACnD;AAAA,EACJ;AAAA;AAAA,EAGA,OAAA,CAAQ,UAAkB,OAAA,EAA+B;AACrD,IAAA,MAAM,GAAA,GAAM,IAAA,CAAK,MAAA,CAAO,OAAA,CAAQ,QAAQ,CAAA;AACxC,IAAA,IAAI,QAAQ,EAAA,EAAI;AAChB,IAAA,IAAA,CAAK,IAAA,CAAK,OAAO,QAAQ,CAAA;AACzB,IAAA,IAAA,CAAK,IAAA,CAAK,GAAA,CAAI,OAAA,CAAQ,EAAA,EAAI,OAAO,CAAA;AACjC,IAAA,IAAA,CAAK,MAAA,CAAO,GAAG,CAAA,GAAI,OAAA,CAAQ,EAAA;AAAA,EAC/B;AAAA;AAAA;AAAA,EAKA,MAAA,CAAO,IAAY,WAAA,EAA2B;AAC1C,IAAA,MAAM,IAAA,GAAO,IAAA,CAAK,MAAA,CAAO,OAAA,CAAQ,EAAE,CAAA;AACnC,IAAA,IAAI,SAAS,EAAA,EAAI;AACjB,IAAA,IAAA,CAAK,MAAA,CAAO,MAAA,CAAO,IAAA,EAAM,CAAC,CAAA;AAC1B,IAAA,MAAM,OAAA,GAAU,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,IAAA,CAAK,IAAI,WAAA,EAAa,IAAA,CAAK,MAAA,CAAO,MAAM,CAAC,CAAA;AACrE,IAAA,IAAA,CAAK,MAAA,CAAO,MAAA,CAAO,OAAA,EAAS,CAAA,EAAG,EAAE,CAAA;AAAA,EACrC;AAAA;AAAA,EAGA,UAAA,CAAW,IAAY,QAAA,EAAwB;AAC3C,IAAA,MAAM,IAAA,GAAO,IAAA,CAAK,MAAA,CAAO,OAAA,CAAQ,EAAE,CAAA;AACnC,IAAA,IAAI,SAAS,EAAA,EAAI;AACjB,IAAA,IAAA,CAAK,MAAA,CAAO,MAAA,CAAO,IAAA,EAAM,CAAC,CAAA;AAC1B,IAAA,MAAM,EAAA,GAAK,IAAA,CAAK,MAAA,CAAO,OAAA,CAAQ,QAAQ,CAAA;AACvC,IAAA,IAAA,CAAK,OAAO,MAAA,CAAO,EAAA,KAAO,KAAK,CAAA,GAAI,EAAA,EAAI,GAAG,EAAE,CAAA;AAAA,EAChD;AAAA;AAAA,EAGA,SAAA,CAAU,IAAY,QAAA,EAAwB;AAC1C,IAAA,MAAM,IAAA,GAAO,IAAA,CAAK,MAAA,CAAO,OAAA,CAAQ,EAAE,CAAA;AACnC,IAAA,IAAI,SAAS,EAAA,EAAI;AACjB,IAAA,IAAA,CAAK,MAAA,CAAO,MAAA,CAAO,IAAA,EAAM,CAAC,CAAA;AAC1B,IAAA,MAAM,EAAA,GAAK,IAAA,CAAK,MAAA,CAAO,OAAA,CAAQ,QAAQ,CAAA;AACvC,IAAA,IAAA,CAAK,MAAA,CAAO,MAAA,CAAO,EAAA,KAAO,EAAA,GAAK,IAAA,CAAK,OAAO,MAAA,GAAS,EAAA,GAAK,CAAA,EAAG,CAAA,EAAG,EAAE,CAAA;AAAA,EACrE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,cAAA,CAAe,IAAkC,OAAA,EAAgC;AAC7E,IAAA,QAAQ,GAAG,MAAA;AAAQ,MACf,KAAK,QAAA,EAAU;AACX,QAAA,IAAI,EAAA,CAAG,QAAA,EAAU,IAAA,CAAK,MAAA,CAAO,GAAG,QAAQ,CAAA;AACxC,QAAA;AAAA,MACJ;AAAA,MACA,KAAK,SAAA,EAAW;AACZ,QAAA,IAAI,GAAG,QAAA,IAAY,OAAA,OAAc,OAAA,CAAQ,EAAA,CAAG,UAAU,OAAO,CAAA;AAC7D,QAAA;AAAA,MACJ;AAAA,MACA,KAAK,KAAA,EAAO;AACR,QAAA,IAAI,CAAC,OAAA,EAAS;AACd,QAAA,IAAI,CAAC,EAAA,CAAG,QAAA,IAAY,EAAA,CAAG,aAAa,QAAA,EAAU;AAC1C,UAAA,IAAA,CAAK,IAAI,OAAO,CAAA;AAAA,QACpB,CAAA,MAAA,IAAW,EAAA,CAAG,QAAA,KAAa,QAAA,EAAU;AACjC,UAAA,IAAA,CAAK,YAAA,CAAa,EAAA,CAAG,QAAA,EAAU,OAAO,CAAA;AAAA,QAC1C,CAAA,MAAO;AAEH,UAAA,IAAA,CAAK,WAAA,CAAY,EAAA,CAAG,QAAA,EAAU,OAAO,CAAA;AAAA,QACzC;AACA,QAAA;AAAA,MACJ;AAAA;AACJ,EACJ;AAAA;AAAA,EAIA,IAAI,EAAA,EAAwC;AACxC,IAAA,OAAO,IAAA,CAAK,IAAA,CAAK,GAAA,CAAI,EAAE,CAAA;AAAA,EAC3B;AAAA;AAAA,EAGA,IAAA,GAAyB;AACrB,IAAA,OAAO,IAAA,CAAK,MAAA,CACP,GAAA,CAAI,CAAA,EAAA,KAAM,KAAK,IAAA,CAAK,GAAA,CAAI,EAAE,CAAC,CAAA,CAC3B,MAAA,CAAO,CAAC,CAAA,KAA2B,MAAM,MAAS,CAAA;AAAA,EAC3D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,QAAA,GAAiC;AAC7B,IAAA,MAAM,QAAA,GAAW,KAAK,IAAA,EAAK,CAAE,OAAO,CAAA,CAAA,KAAK,CAAA,CAAE,OAAA,IAAW,CAAA,CAAE,MAAM,CAAA;AAC9D,IAAA,IAAI,QAAA,CAAS,MAAA,KAAW,CAAA,EAAG,OAAO,IAAA;AAElC,IAAA,MAAM,GAAA,GAAM,QAAA,CAAS,CAAC,CAAA,CAAE,MAAA,CAAQ,MAAA;AAChC,IAAA,MAAM,GAAA,GAAM,IAAI,YAAA,CAAa,GAAG,CAAA;AAEhC,IAAA,KAAA,MAAW,OAAO,QAAA,EAAU;AACxB,MAAA,MAAM,IAAA,GAAO,IAAI,MAAA,CAAQ,MAAA;AACzB,MAAA,KAAA,IAAS,CAAA,GAAI,GAAG,CAAA,GAAI,GAAA,EAAK,KAAK,GAAA,CAAI,CAAC,CAAA,IAAK,IAAA,CAAK,CAAC,CAAA;AAAA,IAClD;AACA,IAAA,KAAA,IAAS,CAAA,GAAI,GAAG,CAAA,GAAI,GAAA,EAAK,KAAK,GAAA,CAAI,CAAC,KAAK,QAAA,CAAS,MAAA;AAEjD,IAAA,OAAO,IAAIE,gCAAc,GAAG,CAAA;AAAA,EAChC;AAAA;AAAA;AAAA;AAAA,EAKA,MAAA,CACI,MAAA,EACA,IAAA,GAAe,2BAAA,CAA2B,iBAAA,EACD;AACzC,IAAA,MAAM,QAAA,GAAW,OAAO,SAAA,EAAU;AAElC,IAAA,OAAO,IAAA,CAAK,IAAA,EAAK,CACZ,MAAA,CAAO,CAAA,CAAA,KAAK,CAAA,CAAE,OAAA,IAAW,CAAA,CAAE,MAAM,CAAA,CACjC,GAAA,CAAI,CAAA,CAAA,MAAM;AAAA,MACP,OAAA,EAAS,CAAA;AAAA,MACT,OAAO,QAAA,CAAS,GAAA,CAAI,CAAA,CAAE,MAAA,CAAQ,WAAW;AAAA,KAC7C,CAAE,CAAA,CACD,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,CAAE,KAAA,GAAQ,CAAA,CAAE,KAAK,CAAA,CAChC,KAAA,CAAM,GAAG,IAAI,CAAA;AAAA,EACtB;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,gBAAA,CACI,WAAA,EACA,IAAA,GAAe,2BAAA,CAA2B,iBAAA,EACD;AACzC,IAAA,MAAM,QAAA,GAAW,WAAA,CACZ,WAAA,EAAY,CACZ,KAAA,CAAM,KAAK,CAAA,CACX,MAAA,CAAO,CAAA,CAAA,KAAK,CAAA,CAAE,MAAA,GAAS,CAAC,CAAA;AAE7B,IAAA,IAAI,QAAA,CAAS,MAAA,KAAW,CAAA,EAAG,OAAO,EAAC;AAEnC,IAAA,OAAO,IAAA,CAAK,IAAA,EAAK,CACZ,GAAA,CAAI,CAAA,OAAA,KAAW;AACZ,MAAA,MAAM,KAAA,GAAQ,OAAA,CAAQ,OAAA,CAAQ,WAAA,EAAY;AAC1C,MAAA,MAAM,QAAQ,QAAA,CAAS,MAAA;AAAA,QACnB,CAAC,KAAK,EAAA,KAAO,GAAA,IAAO,MAAM,QAAA,CAAS,EAAE,IAAI,CAAA,GAAI,CAAA,CAAA;AAAA,QAC7C;AAAA,OACJ;AACA,MAAA,OAAO,EAAE,SAAS,KAAA,EAAM;AAAA,IAC5B,CAAC,CAAA,CACA,MAAA,CAAO,OAAK,CAAA,CAAE,KAAA,GAAQ,CAAC,CAAA,CACvB,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,KAAM,EAAE,KAAA,GAAQ,CAAA,CAAE,KAAK,CAAA,CAChC,KAAA,CAAM,GAAG,IAAI,CAAA;AAAA,EACtB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,cAAA,CACI,MAAA,EACA,WAAA,EACA,KAAA,GAAgB,4BAA2B,iBAAA,EAC3B;AAChB,IAAA,MAAM,GAAA,GAAM,KAAK,IAAA,EAAK;AACtB,IAAA,IAAI,GAAA,CAAI,MAAA,IAAU,KAAA,EAAO,OAAO,GAAA;AAGhC,IAAA,IAAI,MAAA,EAAQ;AACR,MAAA,MAAM,WAAA,GAAc,GAAA,CAAI,IAAA,CAAK,CAAA,CAAA,KAAK,EAAE,OAAO,CAAA;AAC3C,MAAA,IAAI,WAAA,EAAa;AACb,QAAA,MAAM,OAAA,GAAU,IAAA,CAAK,MAAA,CAAO,MAAA,EAAQ,KAAK,CAAA;AACzC,QAAA,IAAI,OAAA,CAAQ,SAAS,CAAA,EAAG,OAAO,QAAQ,GAAA,CAAI,CAAA,CAAA,KAAK,EAAE,OAAO,CAAA;AAAA,MAC7D;AAAA,IACJ;AAGA,IAAA,MAAM,SAAA,GAAY,IAAA,CAAK,gBAAA,CAAiB,WAAA,EAAa,KAAK,CAAA;AAC1D,IAAA,IAAI,SAAA,CAAU,SAAS,CAAA,EAAG,OAAO,UAAU,GAAA,CAAI,CAAA,CAAA,KAAK,EAAE,OAAO,CAAA;AAG7D,IAAA,OAAO,GAAA,CAAI,KAAA,CAAM,CAAA,EAAG,KAAK,CAAA;AAAA,EAC7B;AAAA;AAAA,EAIA,gBAAA,CAAiB,GAAkB,CAAA,EAA2B;AAC1D,IAAA,IAAI,CAAC,GAAG,OAAO,CAAA;AACf,IAAA,MAAM,GAAA,GAAM,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA;AACnB,IAAA,MAAM,GAAA,GAAM,CAAA,CAAE,SAAA,EAAU,GAAI,EAAE,SAAA,EAAU;AACxC,IAAA,OAAO,GAAA,KAAQ,CAAA,GAAI,CAAA,GAAI,GAAA,GAAM,GAAA;AAAA,EACjC;AACJ,CAAA;AAAA;AAnRa,2BAAA,CAGO,iBAAA,GAAoB,CAAA;AAHjC,IAAM,0BAAA,GAAN,2BAAA;;;ACGA,IAAM,qBAAA,GAAN,cAAoCH,iBAAAA,CAAuE;AAAA,EAE9G,WAAW,OAAA,GAAkB;AACzB,IAAA,OAAO,SAAA;AAAA,EACX;AAAA;AAAA;AAAA;AAAA,EAyBA,IAAI,KAAA,GAAiB;AACjB,IAAA,IAAI,CAAC,KAAK,MAAA,EAAQ;AACd,MAAA,IAAA,CAAK,MAAA,GAASI,kBAAA,CAAU,QAAA,CAAS,IAAA,EAAM,IAAIC,gBAAA,CAAQ,EAAE,IAAA,EAAM,CAAA,EAAG,IAAA,CAAK,KAAA,CAAM,EAAE,CAAA,MAAA,CAAA,EAAU,CAAC,CAAA;AAAA,IAC1F;AAEA,IAAA,OAAO,IAAA,CAAK,MAAA;AAAA,EAChB;AAAA,EAEA,IAAI,KAAA,GAAoC;AACpC,IAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,KAAA,CAAM,OAAA,CAAQ,0BAA0B,CAAA;AAC3D,IAAA,OAAO,KAAA;AAAA,EACX;AAAA,EAEA,QAAQ,OAAA,EAAqC;AAEzC,IAAA,KAAA,CAAM,QAAQ,OAAO,CAAA;AAErB,IAAA,MAAM,KAAA,GAAQ,IAAI,0BAAA,CAA2B,EAAE,IAAA,EAAM,GAAG,IAAA,CAAK,KAAA,CAAM,EAAE,CAAA,CAAA,EAAI,CAAA;AACzE,IAAA,IAAA,CAAK,KAAA,CAAM,SAAS,KAAK,CAAA;AAEzB,IAAA,IAAA,CAAK,SAAA,GAAY,KAAK,GAAA,EAAI;AAE1B,IAAA,IAAA,CAAK,SAAS,OAAA,CAAQ,MAAA;AACtB,IAAA,IAAA,CAAK,KAAA,GAAQ,OAAA,CAAQ,OAAA,EAAS,KAAA,IAASC,gCAAA,CAAe,IAAA;AACtD,IAAA,IAAA,CAAK,OAAA,GAAU,QAAQ,OAAA,EAAS,MAAA;AAChC,IAAA,IAAA,CAAK,gBAAA,GAAmB,OAAA,CAAQ,OAAA,EAAS,eAAA,IAAmB,0BAAA,CAA2B,iBAAA;AAEvF,IAAA,IAAA,CAAK,WAAW,EAAC;AACjB,IAAA,IAAA,CAAK,QAAA,GAAW,CAAA;AAAA,EACpB;AAAA;AAAA;AAAA,EAKA,IAAI,QAAA,GAA0C;AAC1C,IAAA,OAAO,IAAA,CAAK,MAAM,IAAA,EAAK;AAAA,EAC3B;AAAA;AAAA,EAGA,IAAI,OAAA,GAAkB;AAClB,IAAA,OAAO,IAAA,CAAK,KAAA,CAAM,IAAA,EAAK,CAClB,GAAA,CAAI,OAAK,CAAA,CAAE,OAAO,CAAA,CAClB,IAAA,CAAK,IAAI,CAAA;AAAA,EAClB;AAAA;AAAA,EAGA,IAAI,IAAA,GAAe;AACf,IAAA,OAAO,IAAA,CAAK,OAAA;AAAA,EAChB;AAAA;AAAA,EAGA,IAAI,OAAA,GAA8C;AAC9C,IAAA,OAAO,IAAA,CAAK,QAAA;AAAA,EAChB;AAAA;AAAA,EAGA,IAAI,OAAA,GAAkB;AAClB,IAAA,OAAO,IAAA,CAAK,QAAA;AAAA,EAChB;AAAA;AAAA,EAGA,IAAI,SAAA,GAAoB;AACpB,IAAA,OAAO,IAAA,CAAK,KAAA;AAAA,EAChB;AAAA;AAAA,EAGA,IAAI,YAAA,GAAmC;AACnC,IAAA,OAAO,IAAA,CAAK,OAAA;AAAA,EAChB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,MAAM,QAAA,GAA0B;AAC5B,IAAA,MAAM,SAAA,GAAY,IAAI,8BAAA,EAA+B;AAErD,IAAA,IAAI,CAAC,IAAA,CAAK,KAAA,CAAM,gBAAgBF,kBAAA,CAAU,KAAA,CAAM,IAAI,CAAC,CAAA;AACjD,MAAA,IAAA,CAAK,KAAA,CAAM,OAAA,CAAQA,kBAAA,CAAU,KAAA,CAAM,IAAI,CAAC,CAAA;AAE5C,IAAA,MAAM,cAAA,GAAiB,IAAIC,gBAAA,CAAQ;AAAA,MAC/B,IAAA,EAAM,kCAAA;AAAA,MACN,SAAA,EAAW,CAAC,SAAS;AAAA,KACxB,CAAA,CAAE,OAAA,CAAQ,IAAA,CAAK,KAAK,CAAA;AAErB,IAAA,IAAI;AACA,MAAA,MAAM,IAAA,CAAK,IAAA,CAAK,6BAAA,CAA8B,QAAA,EAAU,cAAc,CAAA;AACtE,MAAA,cAAA,CAAe,OAAA,EAAQ;AAAA,IAC3B,SAAS,GAAA,EAAK;AACV,MAAA,cAAA,CAAe,OAAA,EAAQ;AACvB,MAAA,MAAM,IAAI,0BAAA,CAA2B;AAAA,QACjC,OAAO,0BAAA,CAA2B,gBAAA;AAAA,QAClC,WAAA,EAAa,+BAA+B,GAAA,YAAe,KAAA,GAAQ,IAAI,OAAA,GAAU,MAAA,CAAO,GAAG,CAAC,CAAA;AAAA,OAC/F,CAAA;AAAA,IACL;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaA,MAAM,KAAA,CAAM,WAAA,EAAqB,cAAA,EAAmE;AAChG,IAAA,IAAI,CAAC,IAAA,CAAK,KAAA,CAAM,gBAAgBD,kBAAA,CAAU,KAAA,CAAM,IAAI,CAAC,CAAA;AACjD,MAAA,IAAA,CAAK,KAAA,CAAM,OAAA,CAAQA,kBAAA,CAAU,KAAA,CAAM,IAAI,CAAC,CAAA;AAE5C,IAAA,MAAM,cAAA,GAAiB,IAAIC,gBAAA,CAAQ;AAAA,MAC/B,IAAA,EAAM;AAAA,KACT,CAAA,CAAE,OAAA,CAAQ,IAAA,CAAK,KAAK,CAAA;AAErB,IAAA,IAAI,QAAA;AAEJ,IAAA,IAAI,mBAAmB,MAAA,EAAW;AAE9B,MAAA,MAAM,SAAS,KAAA,CAAM,OAAA,CAAQ,cAAc,CAAA,GAAI,cAAA,GAAiB,CAAC,cAAc,CAAA;AAG/E,MAAA,MAAM,OAAA,GAAU,MAAA,CAAO,MAAA,CAAO,CAAA,CAAA,KAAK,CAAC,KAAK,KAAA,CAAM,GAAA,CAAI,CAAA,CAAE,EAAY,CAAC,CAAA;AAClE,MAAA,IAAI,OAAA,CAAQ,SAAS,CAAA,EAAG;AACpB,QAAA,cAAA,CAAe,OAAA,EAAQ;AACvB,QAAA,MAAM,IAAI,0BAAA,CAA2B;AAAA,UACjC,OAAO,0BAAA,CAA2B,WAAA;AAAA,UAClC,WAAA,EACI,CAAA,8CAAA,CAAA,GACA,OAAA,CAAQ,GAAA,CAAI,CAAA,CAAA,KAAK,CAAA,CAAA,EAAI,CAAA,CAAE,EAAE,CAAA,CAAA,CAAG,CAAA,CAAE,IAAA,CAAK,IAAI,CAAA,GACvC,CAAA,4EAAA;AAAA,SACP,CAAA;AAAA,MACL;AAEA,MAAA,QAAA,GAAW,MAAA;AAAA,IACf,CAAA,MAAO;AAEH,MAAA,MAAM,YAAA,GAAe,IAAIE,gCAAA,CAAe;AAAA,QACpC,OAAA,EAAS,WAAA;AAAA,QACT,OAAA,EAAS,EAAE,IAAA,EAAM,OAAA;AAAQ,OAC5B,CAAA;AAED,MAAA,cAAA,CAAe,SAAS,YAAY,CAAA;AAEpC,MAAA,MAAM,aAAa,KAAA,EAAM;AAEzB,MAAA,QAAA,GAAW,IAAA,CAAK,MAAM,cAAA,CAAe,YAAA,CAAa,UAAU,IAAA,EAAM,WAAA,EAAa,KAAK,gBAAgB,CAAA;AAAA,IACxG;AAEA,IAAA,MAAM,SAAA,GAAY,IAAI,8BAAA,CAA+B;AAAA,MACjD,WAAA;AAAA,MACA;AAAA,KACH,CAAA;AAED,IAAA,cAAA,CAAe,SAAS,SAAS,CAAA;AAEjC,IAAA,IAAI;AACA,MAAA,MAAM,IAAA,CAAK,IAAA,CAAK,6BAAA,CAA8B,KAAA,EAAO,cAAc,CAAA;AACnE,MAAA,cAAA,CAAe,OAAA,EAAQ;AAAA,IAC3B,SAAS,GAAA,EAAK;AACV,MAAA,cAAA,CAAe,OAAA,EAAQ;AACvB,MAAA,MAAM,IAAI,0BAAA,CAA2B;AAAA,QACjC,OAAO,0BAAA,CAA2B,WAAA;AAAA,QAClC,WAAA,EAAa,4BAA4B,GAAA,YAAe,KAAA,GAAQ,IAAI,OAAA,GAAU,MAAA,CAAO,GAAG,CAAC,CAAA;AAAA,OAC5F,CAAA;AAAA,IACL;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAsBA,UAAU,KAAA,EAAsC;AAC5C,IAAA,MAAM,SAAA,GAAY,IAAA,CAAK,KAAA,CAAM,QAAA,EAAS;AACtC,IAAA,MAAM,SAAA,GAAY,KAAA,CAAM,KAAA,CAAM,QAAA,EAAS;AACvC,IAAA,IAAI,CAAC,SAAA,IAAa,CAAC,SAAA,EAAW,OAAO,CAAA;AACrC,IAAA,OAAO,SAAA,CAAU,iBAAiB,SAAS,CAAA;AAAA,EAC/C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,qBAAA,CACI,UACA,IAAA,EACI;AAEJ,IAAA,QAAA,CAAS,QAAQ,CAAA,CAAA,KAAK,IAAA,CAAK,KAAA,CAAM,GAAA,CAAI,CAAC,CAAC,CAAA;AAEvC,IAAA,IAAA,CAAK,QAAA,CAAS,IAAA,CAAK,IAAI,mBAAA,CAAoB;AAAA,MACvC,SAAS,IAAA,CAAK,QAAA;AAAA,MACd,SAAA,EAAW,KAAK,GAAA,EAAI;AAAA,MACpB,MAAA,EAAQ,CAAA,gBAAA,EAAmB,IAAA,CAAK,MAAM,CAAA,CAAA,CAAA;AAAA,MACtC,OAAA,EAAS,MAAA,CAAO,IAAA,CAAK,IAAA,CAAK,SAAA,CAAU,IAAA,CAAK,KAAA,CAAM,IAAA,EAAM,CAAC,CAAA,CAAE,QAAA,CAAS,QAAQ,CAAA;AAAA,MACzE,KAAA,EAAO,KAAK,KAAA,CAAM;AAAA,KACrB,CAAC,CAAA;AAAA,EACN;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,gBAAA,CACI,aACA,IAAA,EACI;AAEJ,IAAA,MAAM,SAAA,GAAY,KAAK,KAAA,CAAM,IAAA;AAI7B,IAAA,MAAM,SAAA,GAAY,CAAC,CAAA,KACf,CAAA,CAAE,aAAY,CAAE,OAAA,CAAQ,UAAA,EAAY,EAAE,CAAA,CAAE,OAAA,CAAQ,MAAA,EAAQ,GAAG,EAAE,IAAA,EAAK;AAEtE,IAAA,MAAM,kBAAA,GAAqB,IAAA,CAAK,KAAA,CAAM,IAAA,EAAK,CAAE,IAAI,CAAA,CAAA,KAAK,SAAA,CAAU,CAAA,CAAE,OAAO,CAAC,CAAA;AAC1E,IAAA,MAAM,eAAA,GAAkB,CAAC,UAAA,KAAgC;AACrD,MAAA,MAAM,IAAA,GAAO,UAAU,UAAU,CAAA;AACjC,MAAA,IAAI,IAAA,CAAK,MAAA,GAAS,CAAA,EAAG,OAAO,KAAA;AAC5B,MAAA,OAAO,kBAAA,CAAmB,IAAA;AAAA,QAAK,cAC3B,QAAA,KAAa,IAAA;AAAA,QACb,QAAA,CAAS,SAAS,IAAI;AAAA;AAAA;AAAA;AAAA,OAG1B;AAAA,IACJ,CAAA;AAEA,IAAA,KAAA,MAAW,EAAA,IAAM,YAAY,UAAA,EAAY;AAErC,MAAA,IAAI,CAAC,CAAC,KAAA,EAAO,SAAA,EAAW,QAAQ,CAAA,CAAE,QAAA,CAAS,EAAA,CAAG,MAAM,CAAA,EAAG;AAEvD,MAAA,IAAI,OAAA;AACJ,MAAA,IAAI,GAAG,OAAA,EAAS;AAEZ,QAAA,MAAM,GAAA,GAAA,CAAO,EAAA,CAAG,MAAA,KAAW,KAAA,IAAS,EAAA,CAAG,WAAW,SAAA,KAAc,eAAA,CAAgB,EAAA,CAAG,OAAA,CAAQ,OAAO,CAAA;AAClG,QAAA,IAAI,GAAA,EAAK;AAET,QAAA,OAAA,GAAU,IAAIA,gCAAA,CAAe,EAAE,OAAA,EAAS,EAAA,CAAG,OAAA,CAAQ,OAAA,EAAS,OAAA,EAAS,EAAE,IAAA,EAAM,UAAA,EAAW,EAAG,CAAA;AAC3F,QAAA,IAAI,EAAA,CAAG,OAAA,CAAQ,SAAA,EAAW,MAAA,EAAQ;AAC9B,UAAA,OAAA,CAAQ,qBAAqB,IAAI,YAAA,CAAa,EAAA,CAAG,OAAA,CAAQ,SAAS,CAAC,CAAA;AAAA,QACvE;AAAA,MACJ;AAGA,MAAA,IAAI,EAAA,CAAG,WAAW,KAAA,EAAO;AACrB,QAAA,MAAM,cAAA,uBAAqB,GAAA,CAAI,CAAC,UAAU,OAAA,EAAS,QAAA,EAAU,MAAS,CAAC,CAAA;AACvE,QAAA,IAAI,CAAC,cAAA,CAAe,GAAA,CAAI,EAAA,CAAG,QAAe,CAAA,EAAG;AAEzC,UAAC,GAAW,QAAA,GAAW,QAAA;AACvB,UAAC,GAAW,QAAA,GAAW,MAAA;AAAA,QAC3B;AAAA,MACJ;AAEA,MAAA,IAAA,CAAK,KAAA,CAAM,cAAA,CAAe,EAAA,EAAI,OAAO,CAAA;AAAA,IACzC;AAEA,IAAA,IAAA,CAAK,QAAA,EAAA;AAEL,IAAA,IAAA,CAAK,QAAA,CAAS,IAAA,CAAK,IAAI,mBAAA,CAAoB;AAAA,MACvC,SAAS,IAAA,CAAK,QAAA;AAAA,MACd,SAAA,EAAW,KAAK,GAAA,EAAI;AAAA,MACpB,QAAQ,WAAA,CAAY,YAAA;AAAA,MACpB,OAAA,EAAS,MAAA,CAAO,IAAA,CAAK,IAAA,CAAK,SAAA,CAAU,IAAA,CAAK,KAAA,CAAM,IAAA,EAAM,CAAC,CAAA,CAAE,QAAA,CAAS,QAAQ,CAAA;AAAA,MACzE,KAAA,EAAO,IAAA,CAAK,KAAA,CAAM,IAAA,GAAO;AAAA,KAC5B,CAAC,CAAA;AAAA,EACN;AAAA;AAAA,EAIA,MAAA,GAA2C;AACvC,IAAA,OAAO;AAAA,MACH,GAAG,MAAM,MAAA,EAAO;AAAA,MAChB,QAAQ,IAAA,CAAK,MAAA;AAAA,MACb,QAAA,EAAU;AAAA,QACN,OAAO,IAAA,CAAK,KAAA;AAAA,QACZ,WAAW,IAAA,CAAK;AAAA,OACpB;AAAA,MACA,SAAS,IAAA,CAAK,QAAA,CAAS,IAAI,CAAA,IAAA,KAAQ,IAAA,CAAK,QAAQ;AAAA,KACpD;AAAA,EACJ;AAEJ","file":"chunk-KKL2DF2D.cjs","sourcesContent":["import { A_Entity } from \"@adaas/a-concept\";\nimport { A_FrameDynamicPatch_Init, A_FrameDynamicPatch_Serialized } from \"./A-FrameDynamicPatch.types\";\n\n\nexport class A_FrameDynamicPatch extends A_Entity<A_FrameDynamicPatch_Init, A_FrameDynamicPatch_Serialized> {\n\n    static get concept(): string {\n        return 'a-frame';\n    }\n\n    version!: number;\n    timestamp!: number;\n    reason!: string;\n    encoded!: string;      // base64-encoded snapshot of components at this version\n    delta!: number;        // component count change vs. previous patch\n\n\n\n    fromNew(options: A_FrameDynamicPatch_Init) {\n        this.version = options.version;\n        this.timestamp = options.timestamp;\n        this.reason = options.reason;\n        this.encoded = options.encoded;\n        this.delta = options.delta;\n    }\n\n\n    toJSON(): A_FrameDynamicPatch_Serialized {\n        return {\n            ...super.toJSON(),\n            version: this.version,\n            timestamp: this.timestamp,\n            reason: this.reason,\n            encoded: this.encoded,\n            delta: this.delta,\n        }\n    }\n}","\nexport const A_FrameDynamicContentFeatures = {\n    Generate: '_A_FRAME_DYNAMIC_CONTENT_GENERATE',\n    Patch: '_A_FRAME_DYNAMIC_CONTENT_PATCH',\n} as const;\n","import { A_Fragment } from \"@adaas/a-concept\";\n\n\nexport class A_FrameDynamicContentOperation<\n    _InputParams = any,\n> extends A_Fragment {\n\n    protected _meta: Map<string, any> = new Map();\n\n    constructor(params: _InputParams = {} as _InputParams) {\n        super({ name: 'a-frame-dynamic-content-operation-context' });\n        this._meta.set('params', params);\n    }\n\n    get params(): _InputParams {\n        return this._meta.get('params');\n    }\n\n    get(key: string) {\n        return this._meta.get(key);\n    }\n\n    set(key: string, value: any) {\n        this._meta.set(key, value);\n    }\n}\n","import { A_Error } from \"@adaas/a-concept\";\n\n\nexport class A_FrameDynamicContentError extends A_Error {\n\n    static readonly GenerationFailed = 'GenerationFailed';\n    static readonly PatchFailed = 'PatchFailed';\n    static readonly InvalidPatch = 'InvalidPatch';\n    static readonly PieceNotFound = 'PieceNotFound';\n}\n","import { A_Fragment } from \"@adaas/a-concept\";\nimport { A_FrameVector } from \"../A-FrameVector/A-FrameVector.entity\";\nimport { A_FrameContentPatchOperation } from \"./A-FrameDynamicContent.types\";\nimport { A_FrameSegment } from \"../A-FrameSegment\";\n\n\nexport interface A_FrameDynamicContentIndex_SearchResult {\n    segment: A_FrameSegment;\n    score: number;\n}\n\n\nexport class A_FrameDynamicContentIndex extends A_Fragment {\n\n    /** Maximum segments forwarded to the server in a single patch request. */\n    static readonly PATCH_PIECE_LIMIT = 5;\n\n    /** Ordered list of segment IDs — defines the canonical reading order. */\n    private _order: string[] = [];\n\n    /** O(1) lookup by id. */\n    private _map: Map<string, A_FrameSegment> = new Map();\n\n    // ── Accessors ─────────────────────────────────────────────────────────────\n\n    get count(): number {\n        return this._order.length;\n    }\n\n    get size(): number {\n        return this._order.length;\n    }\n\n    // ── Basic mutation ────────────────────────────────────────────────────────\n\n    /** Append one or more segments to the end. */\n    add(...segments: A_FrameSegment[]): void {\n        segments.forEach(seg => {\n            this._map.set(seg.id as string, seg);\n            if (!this._order.includes(seg.id as string)) {\n                this._order.push(seg.id as string);\n            }\n        });\n    }\n\n    /** Replace the content of an existing segment in-place (position unchanged). */\n    update(segment: A_FrameSegment): void {\n        this._map.set(segment.id, segment);\n        if (!this._order.includes(segment.id)) {\n            this._order.push(segment.id);\n        }\n    }\n\n    /** Remove a segment by id. */\n    remove(id: string): void {\n        this._map.delete(id);\n        const idx = this._order.indexOf(id);\n        if (idx !== -1) this._order.splice(idx, 1);\n    }\n\n    /** Remove all segments. */\n    clear(): void {\n        this._map.clear();\n        this._order = [];\n    }\n\n    // ── Positional insertion ──────────────────────────────────────────────────\n\n    /** Insert `segment` immediately before the segment with `targetId`. */\n    insertBefore(targetId: string, segment: A_FrameSegment): void {\n        this._map.set(segment.id, segment);\n        const targetIdx = this._order.indexOf(targetId);\n        if (targetIdx === -1) {\n            this._order.push(segment.id);\n        } else {\n            this._order.splice(targetIdx, 0, segment.id);\n        }\n    }\n\n    /** Insert `segment` immediately after the segment with `targetId`. */\n    insertAfter(targetId: string, segment: A_FrameSegment): void {\n        this._map.set(segment.id, segment);\n        const targetIdx = this._order.indexOf(targetId);\n        if (targetIdx === -1) {\n            this._order.push(segment.id);\n        } else {\n            this._order.splice(targetIdx + 1, 0, segment.id);\n        }\n    }\n\n    /** Swap the content of `targetId` with `segment`, keeping the same position. */\n    replace(targetId: string, segment: A_FrameSegment): void {\n        const pos = this._order.indexOf(targetId);\n        if (pos === -1) return;\n        this._map.delete(targetId);\n        this._map.set(segment.id, segment);\n        this._order[pos] = segment.id;\n    }\n\n    // ── Position management ────────────────────────────────────────────────────\n\n    /** Move the segment with `id` to absolute zero-based `newPosition`. */\n    moveTo(id: string, newPosition: number): void {\n        const from = this._order.indexOf(id);\n        if (from === -1) return;\n        this._order.splice(from, 1);\n        const clipped = Math.max(0, Math.min(newPosition, this._order.length));\n        this._order.splice(clipped, 0, id);\n    }\n\n    /** Move `id` to directly before `targetId`. */\n    moveBefore(id: string, targetId: string): void {\n        const from = this._order.indexOf(id);\n        if (from === -1) return;\n        this._order.splice(from, 1);\n        const to = this._order.indexOf(targetId);\n        this._order.splice(to === -1 ? 0 : to, 0, id);\n    }\n\n    /** Move `id` to directly after `targetId`. */\n    moveAfter(id: string, targetId: string): void {\n        const from = this._order.indexOf(id);\n        if (from === -1) return;\n        this._order.splice(from, 1);\n        const to = this._order.indexOf(targetId);\n        this._order.splice(to === -1 ? this._order.length : to + 1, 0, id);\n    }\n\n    // ── Patch operation dispatch ──────────────────────────────────────────────\n\n    /**\n     * Apply a single `A_FrameContentPatchOperation` to the index.\n     * For `add` and `replace` the caller must supply the resolved `segment`.\n     * For `remove` only the `op` is needed.\n     */\n    applyOperation(op: A_FrameContentPatchOperation, segment?: A_FrameSegment): void {\n        switch (op.action) {\n            case 'remove': {\n                if (op.targetId) this.remove(op.targetId);\n                break;\n            }\n            case 'replace': {\n                if (op.targetId && segment) this.replace(op.targetId, segment);\n                break;\n            }\n            case 'add': {\n                if (!segment) break;\n                if (!op.targetId || op.position === 'append') {\n                    this.add(segment);\n                } else if (op.position === 'before') {\n                    this.insertBefore(op.targetId, segment);\n                } else {\n                    // 'after' is the default\n                    this.insertAfter(op.targetId, segment);\n                }\n                break;\n            }\n        }\n    }\n\n    // ── Lookup ────────────────────────────────────────────────────────────────\n\n    get(id: string): A_FrameSegment | undefined {\n        return this._map.get(id);\n    }\n\n    /** Returns all segments in their current canonical order. */\n    list(): A_FrameSegment[] {\n        return this._order\n            .map(id => this._map.get(id))\n            .filter((s): s is A_FrameSegment => s !== undefined);\n    }\n\n    // ── Search ────────────────────────────────────────────────────────────────\n\n    /**\n     * Computes the centroid (element-wise mean) of all embedded segments.\n     * Returns `null` when no segments have been embedded yet.\n     * The centroid represents the overall semantic \"centre of gravity\" of this\n     * content block and is used by `A_FrameDynamicContent.compareTo()` to\n     * measure similarity between two content instances.\n     */\n    centroid(): A_FrameVector | null {\n        const embedded = this.list().filter(s => s.isEmbed && s.vector);\n        if (embedded.length === 0) return null;\n\n        const dim = embedded[0].vector!.length;\n        const sum = new Float32Array(dim);\n\n        for (const seg of embedded) {\n            const vals = seg.vector!.values;\n            for (let i = 0; i < dim; i++) sum[i] += vals[i];\n        }\n        for (let i = 0; i < dim; i++) sum[i] /= embedded.length;\n\n        return new A_FrameVector(sum);\n    }\n\n    /**\n     * Rank all embedded segments by cosine similarity to the query vector.\n     */\n    search(\n        vector: A_FrameVector,\n        topK: number = A_FrameDynamicContentIndex.PATCH_PIECE_LIMIT,\n    ): A_FrameDynamicContentIndex_SearchResult[] {\n        const queryVec = vector.normalize();\n\n        return this.list()\n            .filter(s => s.isEmbed && s.vector)\n            .map(s => ({\n                segment: s,\n                score: queryVec.dot(s.vector!.normalize()),\n            }))\n            .sort((a, b) => b.score - a.score)\n            .slice(0, topK);\n    }\n\n    /**\n     * Rank segments by how many instruction keywords appear in their content.\n     * Words shorter than 4 characters are ignored.\n     */\n    searchByKeywords(\n        instruction: string,\n        topK: number = A_FrameDynamicContentIndex.PATCH_PIECE_LIMIT,\n    ): A_FrameDynamicContentIndex_SearchResult[] {\n        const keywords = instruction\n            .toLowerCase()\n            .split(/\\W+/)\n            .filter(w => w.length > 3);\n\n        if (keywords.length === 0) return [];\n\n        return this.list()\n            .map(segment => {\n                const lower = segment.content.toLowerCase();\n                const score = keywords.reduce(\n                    (acc, kw) => acc + (lower.includes(kw) ? 1 : 0),\n                    0,\n                );\n                return { segment, score };\n            })\n            .filter(s => s.score > 0)\n            .sort((a, b) => b.score - a.score)\n            .slice(0, topK);\n    }\n\n    /**\n     * Select at most `limit` segments most relevant to a patch instruction.\n     *\n     * Priority:\n     *   1. Vector search  — when `vector` is provided and segments carry embeddings.\n     *   2. Keyword search — fallback when embeddings are absent or vector is null.\n     *   3. Identity       — first N segments when neither search finds candidates.\n     */\n    selectForPatch(\n        vector: A_FrameVector | null,\n        instruction: string,\n        limit: number = A_FrameDynamicContentIndex.PATCH_PIECE_LIMIT,\n    ): A_FrameSegment[] {\n        const all = this.list();\n        if (all.length <= limit) return all;\n\n        // 1. Vector search\n        if (vector) {\n            const hasEmbedded = all.some(s => s.isEmbed);\n            if (hasEmbedded) {\n                const results = this.search(vector, limit);\n                if (results.length > 0) return results.map(r => r.segment);\n            }\n        }\n\n        // 2. Keyword fallback\n        const kwResults = this.searchByKeywords(instruction, limit);\n        if (kwResults.length > 0) return kwResults.map(r => r.segment);\n\n        // 3. Identity\n        return all.slice(0, limit);\n    }\n\n    // ── Similarity helpers ────────────────────────────────────────────────────\n\n    cosineSimilarity(a: A_FrameVector, b?: A_FrameVector): number {\n        if (!b) return 0;\n        const dot = a.dot(b);\n        const mag = a.magnitude() * b.magnitude();\n        return mag === 0 ? 0 : dot / mag;\n    }\n}\n","import { A_Context, A_Entity, A_Scope } from \"@adaas/a-concept\";\nimport {\n    A_FrameContentPatchResponse,\n    A_FrameDynamicContent_Init,\n    A_FrameDynamicContent_Serialized,\n} from \"./A-FrameDynamicContent.types\";\nimport { A_FrameDynamicContentFeatures } from \"./A-FrameDynamicContent.constants\";\nimport { A_FrameDynamicContentOperation } from \"./A-FrameDynamicContentOperation.context\";\nimport { A_FrameDynamicContentError } from \"./A-FrameDynamicContent.error\";\nimport { A_FrameDynamicPatch } from \"../A-FrameDynamicPatch/A-FrameDynamicPatch.entity\";\nimport { A_FrameDynamicContentIndex } from \"./A-FrameDynamicContentIndex.context\";\nimport { A_FrameSegment } from \"../A-FrameSegment\";\nimport { A_FRAME_MODELS } from \"../A-FrameModels/A-FrameModels.constants\";\n\n\nexport class A_FrameDynamicContent extends A_Entity<A_FrameDynamicContent_Init, A_FrameDynamicContent_Serialized> {\n\n    static get concept(): string {\n        return 'a-frame';\n    }\n\n    // ── Identity ─────────────────────────────────────────────────────────────\n    prompt!: string;\n    createdAt!: number;\n\n    // ── Config ───────────────────────────────────────────────────────────────\n    private model!: string;\n    private _system!: string | undefined;\n\n    // ── State ────────────────────────────────────────────────────────────────\n    private _history!: A_FrameDynamicPatch[];\n    private _version!: number;\n    private _patchPieceLimit!: number;\n\n    // ── Initialisation ───────────────────────────────────────────────────────\n\n    /**\n     * The scope of the current Content stores all related data to it \n     */\n    protected _scope!: A_Scope\n\n    /**\n     * \n     */\n    get scope(): A_Scope {\n        if (!this._scope) {\n            this._scope = A_Context.allocate(this, new A_Scope({ name: `${this.aseid.id}-scope` }));\n        }\n\n        return this._scope;\n    }\n\n    get index(): A_FrameDynamicContentIndex {\n        const index = this.scope.resolve(A_FrameDynamicContentIndex)!;\n        return index;\n    }\n\n    fromNew(options: A_FrameDynamicContent_Init) {\n\n        super.fromNew(options);\n\n        const index = new A_FrameDynamicContentIndex({ name: `${this.aseid.id}` });\n        this.scope.register(index);\n\n        this.createdAt = Date.now();\n\n        this.prompt = options.prompt;\n        this.model = options.options?.model || A_FRAME_MODELS.LYRA;\n        this._system = options.options?.system;\n        this._patchPieceLimit = options.options?.patchPieceLimit || A_FrameDynamicContentIndex.PATCH_PIECE_LIMIT;\n\n        this._history = [];\n        this._version = 0;\n    }\n\n    // ── Accessors ────────────────────────────────────────────────────────────\n\n    /** Ordered list of content pieces (output of the last generate or patch). */\n    get segments(): ReadonlyArray<A_FrameSegment> {\n        return this.index.list();\n    }\n\n    /** Full content reconstructed from all segments in index order. */\n    get content(): string {\n        return this.index.list()\n            .map(s => s.content)\n            .join('\\n');\n    }\n\n    /** Alias for `content` — kept for backward compatibility. */\n    get text(): string {\n        return this.content;\n    }\n\n    /** Immutable patch history. */\n    get history(): ReadonlyArray<A_FrameDynamicPatch> {\n        return this._history;\n    }\n\n    /** Current content version (increments with each patch). */\n    get version(): number {\n        return this._version;\n    }\n\n    /** The AI model name to use for generation / patching. */\n    get modelName(): string {\n        return this.model;\n    }\n\n    /** Optional system prompt forwarded to the AI for generation and patching. */\n    get systemPrompt(): string | undefined {\n        return this._system;\n    }\n\n    // ── Main pipeline ─────────────────────────────────────────────────────────\n\n    /**\n     * Generate content from the entity's prompt.\n     * Populates `pieces` and creates the first history entry.\n     */\n    async generate(): Promise<void> {\n        const operation = new A_FrameDynamicContentOperation();\n\n        if (!this.scope.isInheritedFrom(A_Context.scope(this)))\n            this.scope.inherit(A_Context.scope(this));\n\n        const executionScope = new A_Scope({\n            name: 'a-frame-dynamic-content-generate',\n            fragments: [operation],\n        }).inherit(this.scope);\n\n        try {\n            await this.call(A_FrameDynamicContentFeatures.Generate, executionScope);\n            executionScope.destroy();\n        } catch (err) {\n            executionScope.destroy();\n            throw new A_FrameDynamicContentError({\n                title: A_FrameDynamicContentError.GenerationFailed,\n                description: `Failed to generate content: ${err instanceof Error ? err.message : String(err)}`,\n            });\n        }\n    }\n\n    /**\n     * Apply a natural-language patch instruction to the current pieces.\n     *\n     * When `targetSegments` is provided the caller pins the exact segments to\n     * patch — no embedding or semantic search is performed.  Every supplied\n     * segment must already belong to this content's index; unknown segments\n     * are rejected with an error.\n     *\n     * When omitted, the server identifies which segments to modify using\n     * semantic search over segment embeddings (original behaviour).\n     */\n    async patch(instruction: string, targetSegments?: A_FrameSegment | A_FrameSegment[]): Promise<void> {\n        if (!this.scope.isInheritedFrom(A_Context.scope(this)))\n            this.scope.inherit(A_Context.scope(this));\n\n        const executionScope = new A_Scope({\n            name: 'a-frame-dynamic-content-patch',\n        }).inherit(this.scope);\n\n        let segments: A_FrameSegment[];\n\n        if (targetSegments !== undefined) {\n            // ── Pinned segments path ──────────────────────────────────────────\n            const pinned = Array.isArray(targetSegments) ? targetSegments : [targetSegments];\n\n            // Validate every pinned segment is part of this content's index\n            const unknown = pinned.filter(s => !this.index.get(s.id as string));\n            if (unknown.length > 0) {\n                executionScope.destroy();\n                throw new A_FrameDynamicContentError({\n                    title: A_FrameDynamicContentError.PatchFailed,\n                    description:\n                        `Segment(s) not found in this content's index: ` +\n                        unknown.map(s => `\"${s.id}\"`).join(', ') +\n                        `. Only segments that belong to this DynamicContent instance can be targeted.`,\n                });\n            }\n\n            segments = pinned;\n        } else {\n            // ── Semantic search path (original behaviour) ─────────────────────\n            const inputSegment = new A_FrameSegment({\n                content: instruction,\n                options: { task: 'query' },\n            });\n\n            executionScope.register(inputSegment);\n\n            await inputSegment.embed();\n\n            segments = this.index.selectForPatch(inputSegment.vector ?? null, instruction, this._patchPieceLimit);\n        }\n\n        const operation = new A_FrameDynamicContentOperation({\n            instruction,\n            segments,\n        });\n\n        executionScope.register(operation);\n\n        try {\n            await this.call(A_FrameDynamicContentFeatures.Patch, executionScope);\n            executionScope.destroy();\n        } catch (err) {\n            executionScope.destroy();\n            throw new A_FrameDynamicContentError({\n                title: A_FrameDynamicContentError.PatchFailed,\n                description: `Failed to patch content: ${err instanceof Error ? err.message : String(err)}`,\n            });\n        }\n    }\n\n    // ── Comparison ────────────────────────────────────────────────────────────\n\n    /**\n     * Returns a cosine similarity score (0–1) between this content and `other`.\n     *\n     * The score is computed from the centroid of each content's embedded\n     * segments — the element-wise mean of all segment vectors.  Two contents\n     * about the same topic should score close to 1; unrelated contents will\n     * score near 0.\n     *\n     * Returns 0 if either content has no embedded segments.\n     *\n     * @example\n     * const cats1 = new A_FrameDynamicContent({ prompt: 'Article about cats' });\n     * const cats2 = new A_FrameDynamicContent({ prompt: 'Article about cats' });\n     * const cars  = new A_FrameDynamicContent({ prompt: 'Article about cars' });\n     * // After generate() on all three:\n     * cats1.compareTo(cats2); // ~0.92 — high\n     * cats1.compareTo(cars);  // ~0.45 — low\n     */\n    compareTo(other: A_FrameDynamicContent): number {\n        const centroidA = this.index.centroid();\n        const centroidB = other.index.centroid();\n        if (!centroidA || !centroidB) return 0;\n        return centroidA.cosineSimilarity(centroidB);\n    }\n\n    // ── Hydration ─────────────────────────────────────────────────────────────\n\n    /**\n     * Populate index from the segments created by the channel after a generate response.\n     * Creates the first history entry.\n     */\n    hydrateFromGeneration(\n        segments: A_FrameSegment[],\n        meta: { model: string; serverVersion: string },\n    ): void {\n\n        segments.forEach(s => this.index.add(s));\n\n        this._history.push(new A_FrameDynamicPatch({\n            version: this._version,\n            timestamp: Date.now(),\n            reason: `Generated for: \"${this.prompt}\"`,\n            encoded: Buffer.from(JSON.stringify(this.index.list())).toString('base64'),\n            delta: this.index.size,\n        }));\n    }\n\n    /**\n     * Apply a patch diff returned by the server to the current piece list.\n     * Increments the version and records a history entry.\n     */\n    hydrateFromPatch(\n        patchResult: A_FrameContentPatchResponse,\n        meta: { model: string; serverVersion: string },\n    ): void {\n\n        const prevCount = this.index.size;\n\n        // Pre-compute normalized content set for near-duplicate detection.\n        // Normalization: lowercase, strip punctuation, collapse whitespace.\n        const normalize = (s: string): string =>\n            s.toLowerCase().replace(/[^\\w\\s]/g, '').replace(/\\s+/g, ' ').trim();\n\n        const existingNormalized = this.index.list().map(s => normalize(s.content));\n        const isNearDuplicate = (newContent: string): boolean => {\n            const norm = normalize(newContent);\n            if (norm.length < 8) return false; // too short to matter\n            return existingNormalized.some(existing =>\n                existing === norm ||          // exact match\n                existing.includes(norm)       // new text is a strict substring of something existing\n                // Note: do NOT check norm.includes(existing) — that would block  \n                // valid extensions where new content starts with an existing phrase.\n            );\n        };\n\n        for (const op of patchResult.operations) {\n            // Validate action\n            if (!['add', 'replace', 'remove'].includes(op.action)) continue;\n\n            let segment: A_FrameSegment | undefined;\n            if (op.segment) {\n                // Guard: LLM sometimes returns existing (or near-duplicate) content — skip those.\n                const dup = (op.action === 'add' || op.action === 'replace') && isNearDuplicate(op.segment.content);\n                if (dup) continue;\n\n                segment = new A_FrameSegment({ content: op.segment.content, options: { task: 'document' } });\n                if (op.segment.embedding?.length) {\n                    segment.hydrateFromEmbedding(new Float32Array(op.segment.embedding));\n                }\n            }\n\n            // Validate position for 'add' operations — reject composite strings like \"before|after|append\"\n            if (op.action === 'add') {\n                const validPositions = new Set(['before', 'after', 'append', undefined]);\n                if (!validPositions.has(op.position as any)) {\n                    // Malformed position — treat as append\n                    (op as any).position = 'append';\n                    (op as any).targetId = undefined;\n                }\n            }\n\n            this.index.applyOperation(op, segment);\n        }\n\n        this._version++;\n\n        this._history.push(new A_FrameDynamicPatch({\n            version: this._version,\n            timestamp: Date.now(),\n            reason: patchResult.patchSummary,\n            encoded: Buffer.from(JSON.stringify(this.index.list())).toString('base64'),\n            delta: this.index.size - prevCount,\n        }));\n    }\n\n    // ── Serialisation ──────────────────────────────────────────────────────────\n\n    toJSON(): A_FrameDynamicContent_Serialized {\n        return {\n            ...super.toJSON(),\n            prompt: this.prompt,\n            metadata: {\n                model: this.model,\n                createdAt: this.createdAt,\n            },\n            history: this._history.map(item => item.toJSON()),\n        };\n    }\n\n}\n\n"]}