agent-nuvira 3.3.13 → 3.3.15

package/dist/learning/knowledge-base.d.ts

@@ -15,6 +15,22 @@
  * vector namespace (`knowledge-<tag>`), so tags never bleed into each other and
  * a tag can be forgotten without touching anything else.
  *
+ * Retrieval is relevance-FLOORED (`DEFAULT_KNOWLEDGE_MIN_SIMILARITY`), because
+ * "the nearest k neighbours" is not the same claim as "k relevant passages":
+ * an unrelated question must be able to come back empty rather than receive the
+ * closest six chunks of a document it has nothing to do with.
+ *
+ * Retrieval is also HYBRID (Phase 2.2–2.4): a dense (vector) half and a lexical
+ * (BM25, see `lexical-search.ts`) half are fused with Reciprocal Rank Fusion and
+ * then capped per source document. The two halves fail on different questions —
+ * embeddings miss the exact identifier, clause number or error code a user pastes
+ * in, and BM25 misses a paraphrase with no shared words — so ranking both and
+ * fusing their RANKS (not their incomparable scores) gets both. The cosine floor
+ * still governs DENSE evidence; lexical evidence is governed by its own term
+ * overlap, which is why an unrelated question (no shared vocabulary) still comes
+ * back empty from both halves. `fusion: 'dense'` reproduces vector-only
+ * retrieval for a caller that wants it or for the eval to compare against.
+ *
  * The retrieved chunks are USER DATA; the model supplies the generic half of an
  * answer (and `web-research` supplies the net-based half). `formatKnowledgeContext`
  * labels each chunk with its source file so the model can attribute precisely
@@ -34,11 +50,71 @@ export declare const KNOWLEDGE_NAMESPACE_PREFIX = "knowledge-";
 export declare const KNOWLEDGE_MANIFEST_FILE = "knowledge-index.json";
 /** Default chunks returned per query. */
 export declare const DEFAULT_KNOWLEDGE_TOP_K = 6;
-/** One document recorded under a tag. */
+/**
+ * Relevance floor for retrieval.
+ *
+ * Every backend scores in cosine similarity, where 1 means "the same direction"
+ * and 0 means "unrelated", so a hit below this is at best a weak topic touch.
+ * The floor is what makes an HONEST empty answer reachable: nearest-neighbour
+ * search always returns its k nearest neighbours, so without a floor the k-th
+ * can be a passage about something else entirely and an unrelated question still
+ * receives a confident-looking block of the wrong document. A hit below the
+ * floor is not evidence about the question, so it is dropped here rather than
+ * left to the model to notice and ignore.
+ *
+ * CALIBRATED, NOT GUESSED. Cosine similarity between a question and its own
+ * document is a property of the EMBEDDING MODEL, so this number only means
+ * anything next to the model that produced the vectors. On the eval corpus with
+ * the retrieval model (`RETRIEVAL_MODEL`, bge-small-en-v1.5), unrelated
+ * questions reach up to 0.425 and the lowest-scoring CORRECT answer sits at
+ * 0.635 (p50 0.772). 0.5 is the round value inside that
+ * measured gap with margin on both sides: above every leak probe and below every
+ * correct answer. `tests/live/knowledge-eval-live.test.ts` prints the band and
+ * FAILS if the shipped floor falls outside it, so this is re-measurable rather
+ * than folklore.
+ *
+ * IT IS TIER-SPECIFIC, and the embedder is TIERED. If the local ONNX model
+ * cannot load, `embed` falls back to a different model — Python
+ * `all-MiniLM-L6-v2`, on a different similarity scale — or to a zero vector,
+ * WITHOUT throwing. A floor calibrated for one model is simply wrong for
+ * another, and wrong in a way that looks measured. The live eval therefore proves
+ * which model actually ran (an identity probe) before it reports a band, and
+ * fails loudly if they disagree. The offline eval uses its OWN floor and says so
+ * (`KNOWLEDGE_EVAL_OFFLINE_MIN_SIMILARITY`), because a bag-of-words vectorizer is
+ * not on this model's scale at all.
+ */
+export declare const DEFAULT_KNOWLEDGE_MIN_SIMILARITY = 0.5;
+/**
+ * How many chunks ONE source document may contribute to a result.
+ *
+ * Fusion alone can hand the whole top-k to whichever document the query happens
+ * to touch most, because a long document has more chances to contain a term —
+ * so a single highly-ranked file would crowd out the shorter document that
+ * actually answers the question. The cap promotes diversity of SOURCES.
+ *
+ * It is deliberately relaxed to "no cap" when the candidate pool has only one
+ * source: the common case is a tag holding a single document, and capping it
+ * there would throw away half the passages for no diversity to gain.
+ */
+export declare const DEFAULT_KNOWLEDGE_MAX_PER_SOURCE = 3;
+/**
+ * One document recorded under a tag.
+ *
+ * `docId` and `contentHash` are what make the SECOND ingest of the same folder
+ * cheap and correct: the id addresses the document's stored text (so a section
+ * can be read verbatim), and the hash says whether anything inside it changed
+ * (so an unchanged file is not extracted, chunked and embedded again).
+ */
 export interface KnowledgeDocument {
+    /** Stable id derived from `path` — the key of the stored extracted text. */
+    docId: string;
     path: string;
+    /** First heading of the document, or its basename when it has none. */
+    title: string;
     chunks: number;
     addedAt: number;
+    /** SHA-1 of the extracted text — the change detector for re-ingest. */
+    contentHash: string;
 }
 /** Manifest entry for a tag. */
 export interface KnowledgeTagEntry {
@@ -58,12 +134,27 @@ export interface KnowledgeHit {
     sourcePath: string;
     chunkIndex: number;
     similarity: number;
+    /**
+     * The heading chain the passage sits under, e.g. `Auth Design > Token refresh`.
+     * Empty for a document with no headings (or a non-Markdown one), which is why
+     * it is optional in the rendered citation rather than printed as `unknown`.
+     */
+    headingPath?: string;
+    /**
+     * WHY this passage is here: `dense` means it cleared the cosine floor, `term`
+     * means it is a lexical-only match whose similarity is below the floor. The
+     * distinction is rendered in the citation, because a passage presented with a
+     * low `sim` and no explanation reads as a mistake rather than as a term match.
+     */
+    evidence?: 'dense' | 'term';
 }
 /** Result of an ingest call. */
 export interface IngestResult {
     tag: string;
     files: number;
     chunks: number;
+    /** Documents whose content hash matched the recorded one — nothing re-embedded. */
+    unchanged: number;
     skipped: Array<{
         path: string;
         reason: string;
@@ -74,6 +165,34 @@ export interface KnowledgeOptions {
     chunkTokens?: number;
     overlapTokens?: number;
     topK?: number;
+    /**
+     * Relevance floor for `queryKnowledge` — hits scoring below this cosine
+     * similarity are dropped. Defaults to `DEFAULT_KNOWLEDGE_MIN_SIMILARITY`.
+     */
+    minSimilarity?: number;
+    /**
+     * How to retrieve: `hybrid` (default) fuses dense + lexical evidence; `dense`
+     * reproduces vector-only retrieval. Query-only.
+     */
+    fusion?: 'hybrid' | 'dense';
+    /**
+     * Lexical (BM25) floor for a candidate matched ONLY by the lexical half — a
+     * dense hit is already gated by `minSimilarity`. 0 (default) keeps any passage
+     * that shares a content term with the question. Query-only.
+     */
+    minLexicalScore?: number;
+    /**
+     * Chunks one source document may contribute to a result. Defaults to
+     * `DEFAULT_KNOWLEDGE_MAX_PER_SOURCE`, and is relaxed automatically when only
+     * one source is in the candidate pool. Query-only.
+     */
+    maxPerSource?: number;
+    /**
+     * Ingest-only. Called once per chunk that could NOT be embedded and was
+     * therefore not indexed, so a caller can report the shortfall instead of a
+     * document that looks fully indexed while part of it is missing.
+     */
+    onChunkSkipped?: (reason: string) => void;
     /**
      * Embedding function override. Defaults to the local embedder. Injectable so
      * callers (and tests) can supply a deterministic/dummy vectorizer without
@@ -97,6 +216,8 @@ export declare function readKnowledgeManifest(): KnowledgeManifest;
 export declare function listKnowledgeTags(): KnowledgeTagEntry[];
 /** One tag's manifest entry, or null. */
 export declare function getKnowledgeTag(tag: string): KnowledgeTagEntry | null;
+/** Stable id for a document, derived from its path. */
+export declare function documentIdFor(sourcePath: string): string;
 /** Recursively collect files under a path (bounded, ignores build/vendor dirs). */
 export declare function collectKnowledgeFiles(root: string, out?: string[], depth?: number): string[];
 /**
@@ -104,16 +225,121 @@ export declare function collectKnowledgeFiles(root: string, out?: string[], dept
  * so re-ingesting a changed document overwrites its chunks rather than
  * duplicating them.
  */
-export declare function ingestKnowledgeText(tag: string, sourcePath: string, text: string, opts?: KnowledgeOptions): Promise<number>;
+export declare function ingestKnowledgeText(tag: string, sourcePath: string, text: string, opts?: KnowledgeOptions, 
+/**
+ * How many chunks this same `<tag>:<sourcePath>` contributed LAST time, so a
+ * document that got shorter has its retired tail removed. `ingestKnowledge`
+ * passes the count it reads from the manifest.
+ */
+previousChunkCount?: number): Promise<number>;
 /**
  * Ingest one or more files/directories under a tag. Extraction, chunking and
  * embedding happen ONCE here; later questions only embed a short query.
  */
 export declare function ingestKnowledge(tag: string, paths: string[], opts?: KnowledgeOptions): Promise<IngestResult>;
-/** Embed the question and return the tag's top-k chunks. Never throws. */
+/**
+ * Embed the question and return the tag's top-k chunks. Never throws.
+ *
+ * Two retrievers run over the same namespace and their RANKS are fused:
+ *
+ *   1. **Dense** — cosine over the stored vectors, gated by `minSimilarity`.
+ *      This is the Phase-0 relevance floor and it is unchanged: a passage the
+ *      embeddings do not consider related is not dense evidence.
+ *   2. **Lexical** — BM25 over the stored chunk text, which can find the exact
+ *      term a dense retriever missed. A lexical hit is evidence by itself, so it
+ *      is admitted even when its cosine sits below the floor — that is the whole
+ *      reason the second retriever exists, and it is why `minSimilarity` alone
+ *      can no longer force an empty result for a question that shares vocabulary
+ *      with the corpus. Pass `fusion: 'dense'` to get the old, purely-cosine
+ *      behaviour.
+ *
+ * Reciprocal Rank Fusion scores each candidate `Σ 1/(RRF_K + rank)`. Scores are
+ * never summed across halves — cosine and BM25 are on different scales, and
+ * adding them would silently weight whichever happens to have the larger range.
+ * RRF only needs each half to ORDER its candidates, so a backend change cannot
+ * move the fusion.
+ *
+ * The fused ranking is then capped per source document, so one long file cannot
+ * take every slot from the shorter one that answers the question.
+ */
 export declare function queryKnowledge(tag: string, question: string, opts?: KnowledgeOptions): Promise<KnowledgeHit[]>;
+/** Cap on a read, so "the whole document" cannot become an unbounded prompt. */
+export declare const MAX_READ_CHARS = 40000;
+/** One heading in a document's table of contents. */
+export interface KnowledgeSectionInfo {
+    title: string;
+    headingPath: string;
+    level: number;
+    chars: number;
+}
+/** A document in a tag's table of contents. */
+export interface KnowledgeDocumentOutline {
+    docId: string;
+    path: string;
+    title: string;
+    chunks: number;
+    addedAt: number;
+    sections: KnowledgeSectionInfo[];
+}
+/**
+ * Read a document's text, or one of its sections.
+ *
+ * `section` is matched against the section's heading path, case-insensitively,
+ * with or without the ancestors (`"Token refresh"` finds
+ * `Auth Design > Token refresh`, and so does the full path). An unknown section
+ * returns the available ones instead of the whole document, because silently
+ * answering a narrower question with everything is how a reader concludes the
+ * document says something it never said.
+ */
+export declare function readKnowledgeDocument(tag: string, docRef: string, section?: string): {
+    ok: true;
+    text: string;
+    truncated: boolean;
+    path: string;
+    headingPath?: string;
+} | {
+    ok: false;
+    reason: string;
+};
+/** Every document under a tag, with its heading tree. */
+export declare function listKnowledgeSections(tag: string, docRef?: string): KnowledgeDocumentOutline[];
+/**
+ * Remove one document from a tag: its chunks, its stored text, its manifest row.
+ * Used by `syncKnowledgeTag` when a file is no longer present under a synced
+ * root, and by the CLI to drop a single document without forgetting the tag.
+ */
+export declare function removeKnowledgeDocument(tag: string, docRef: string): Promise<boolean>;
 /** Remove a tag's vectors and manifest entry. Returns true when something was removed. */
 export declare function forgetKnowledgeTag(tag: string): Promise<boolean>;
+/** What a sync changed. `changed` and `added` re-embedded; `unchanged` did not. */
+export interface SyncResult {
+    tag: string;
+    added: number;
+    changed: number;
+    unchanged: number;
+    /** Documents dropped because they are no longer under a synced root. */
+    removed: string[];
+    chunks: number;
+    skipped: Array<{
+        path: string;
+        reason: string;
+    }>;
+}
+/**
+ * Bring a tag up to date with the folders it is kept in step with.
+ *
+ * This is `add` plus the two things a folder being kept in step needs: content
+ * hashes mean an unchanged file is not re-extracted, re-chunked or re-embedded,
+ * and a file that has DISAPPEARED stops being served.
+ *
+ * Removal is scoped to the roots the caller actually synced. Syncing `./specs`
+ * must not delete documents ingested from somewhere else, so a document is only
+ * pruned when it lives under one of the synced directories AND was absent from
+ * that directory's enumeration — a precise rule, rather than "anything not in
+ * this list", which would quietly empty a tag the first time it was called with
+ * the wrong path.
+ */
+export declare function syncKnowledgeTag(tag: string, paths: string[], opts?: KnowledgeOptions): Promise<SyncResult>;
 /**
  * Render retrieved chunks as context that ATTRIBUTES each part to the user's
  * data. The model can then answer the data half from here and the generic half

package/dist/learning/knowledge-base.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"knowledge-base.d.ts","sourceRoot":"","sources":["../../src/learning/knowledge-base.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AASH,OAAO,EAAa,oBAAoB,EAAE,sBAAsB,EAAE,MAAM,gBAAgB,CAAC;AAKzF,iHAAiH;AACjH,eAAO,MAAM,gBAAgB,QAAmC,CAAC;AAEjE,iFAAiF;AACjF,eAAO,MAAM,0BAA0B,eAAe,CAAC;AAEvD,mFAAmF;AACnF,eAAO,MAAM,uBAAuB,yBAAyB,CAAC;AAE9D,yCAAyC;AACzC,eAAO,MAAM,uBAAuB,IAAI,CAAC;AAgBzC,yCAAyC;AACzC,MAAM,WAAW,iBAAiB;IAChC,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,MAAM,CAAC;IACf,OAAO,EAAE,MAAM,CAAC;CACjB;AAED,gCAAgC;AAChC,MAAM,WAAW,iBAAiB;IAChC,GAAG,EAAE,MAAM,CAAC;IACZ,SAAS,EAAE,MAAM,CAAC;IAClB,UAAU,EAAE,MAAM,CAAC;IACnB,SAAS,EAAE,iBAAiB,EAAE,CAAC;CAChC;AAED,UAAU,iBAAiB;IACzB,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,iBAAiB,CAAC,CAAC;CACzC;AAED,uCAAuC;AACvC,MAAM,WAAW,YAAY;IAC3B,GAAG,EAAE,MAAM,CAAC;IACZ,IAAI,EAAE,MAAM,CAAC;IACb,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,gCAAgC;AAChC,MAAM,WAAW,YAAY;IAC3B,GAAG,EAAE,MAAM,CAAC;IACZ,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;IACf,OAAO,EAAE,KAAK,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;CAClD;AAED,sCAAsC;AACtC,MAAM,WAAW,gBAAgB;IAC/B,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,IAAI,CAAC,EAAE,MAAM,CAAC;IACd;;;;OAIG;IACH,OAAO,CAAC,EAAE,CAAC,IAAI,EAAE,MAAM,KAAK,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;CAC/C;AAcD;;;;GAIG;AACH,wBAAgB,qBAAqB,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAOzD;AAED,mEAAmE;AACnE,wBAAgB,mBAAmB,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAExD;AAED,qEAAqE;AACrE,wBAAgB,eAAe,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAEnD;AAQD,iFAAiF;AACjF,wBAAgB,qBAAqB,IAAI,iBAAiB,CASzD;AAWD,8EAA8E;AAC9E,wBAAgB,iBAAiB,IAAI,iBAAiB,EAAE,CAEvD;AAED,yCAAyC;AACzC,wBAAgB,eAAe,CAAC,GAAG,EAAE,MAAM,GAAG,iBAAiB,GAAG,IAAI,CAGrE;AAID,mFAAmF;AACnF,wBAAgB,qBAAqB,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,GAAE,MAAM,EAAO,EAAE,KAAK,SAAI,GAAG,MAAM,EAAE,CAyB3F;AAkCD;;;;GAIG;AACH,wBAAsB,mBAAmB,CACvC,GAAG,EAAE,MAAM,EACX,UAAU,EAAE,MAAM,EAClB,IAAI,EAAE,MAAM,EACZ,IAAI,GAAE,gBAAqB,GAC1B,OAAO,CAAC,MAAM,CAAC,CA4BjB;AAED;;;GAGG;AACH,wBAAsB,eAAe,CACnC,GAAG,EAAE,MAAM,EACX,KAAK,EAAE,MAAM,EAAE,EACf,IAAI,GAAE,gBAAqB,GAC1B,OAAO,CAAC,YAAY,CAAC,CAmDvB;AAID,0EAA0E;AAC1E,wBAAsB,cAAc,CAClC,GAAG,EAAE,MAAM,EACX,QAAQ,EAAE,MAAM,EAChB,IAAI,GAAE,gBAAqB,GAC1B,OAAO,CAAC,YAAY,EAAE,CAAC,CAsBzB;AAID,0FAA0F;AAC1F,wBAAsB,kBAAkB,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC,CAYtE;AAID;;;;GAIG;AACH,wBAAgB,sBAAsB,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,YAAY,EAAE,GAAG,MAAM,CAehF;AAGD,OAAO,EAAE,oBAAoB,EAAE,sBAAsB,EAAE,CAAC"}
+{"version":3,"file":"knowledge-base.d.ts","sourceRoot":"","sources":["../../src/learning/knowledge-base.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA0CG;AAUH,OAAO,EAAE,oBAAoB,EAAE,sBAAsB,EAAE,MAAM,gBAAgB,CAAC;AAQ9E,iHAAiH;AACjH,eAAO,MAAM,gBAAgB,QAAmC,CAAC;AAEjE,iFAAiF;AACjF,eAAO,MAAM,0BAA0B,eAAe,CAAC;AAEvD,mFAAmF;AACnF,eAAO,MAAM,uBAAuB,yBAAyB,CAAC;AAE9D,yCAAyC;AACzC,eAAO,MAAM,uBAAuB,IAAI,CAAC;AAEzC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAgCG;AACH,eAAO,MAAM,gCAAgC,MAAM,CAAC;AAEpD;;;;;;;;;;;GAWG;AACH,eAAO,MAAM,gCAAgC,IAAI,CAAC;AAmClD;;;;;;;GAOG;AACH,MAAM,WAAW,iBAAiB;IAChC,4EAA4E;IAC5E,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,MAAM,CAAC;IACb,uEAAuE;IACvE,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;IACf,OAAO,EAAE,MAAM,CAAC;IAChB,uEAAuE;IACvE,WAAW,EAAE,MAAM,CAAC;CACrB;AAED,gCAAgC;AAChC,MAAM,WAAW,iBAAiB;IAChC,GAAG,EAAE,MAAM,CAAC;IACZ,SAAS,EAAE,MAAM,CAAC;IAClB,UAAU,EAAE,MAAM,CAAC;IACnB,SAAS,EAAE,iBAAiB,EAAE,CAAC;CAChC;AAED,UAAU,iBAAiB;IACzB,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,iBAAiB,CAAC,CAAC;CACzC;AAED,uCAAuC;AACvC,MAAM,WAAW,YAAY;IAC3B,GAAG,EAAE,MAAM,CAAC;IACZ,IAAI,EAAE,MAAM,CAAC;IACb,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,EAAE,MAAM,CAAC;IACnB;;;;OAIG;IACH,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB;;;;;OAKG;IACH,QAAQ,CAAC,EAAE,OAAO,GAAG,MAAM,CAAC;CAC7B;AAED,gCAAgC;AAChC,MAAM,WAAW,YAAY;IAC3B,GAAG,EAAE,MAAM,CAAC;IACZ,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;IACf,mFAAmF;IACnF,SAAS,EAAE,MAAM,CAAC;IAClB,OAAO,EAAE,KAAK,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;CAClD;AAED,sCAAsC;AACtC,MAAM,WAAW,gBAAgB;IAC/B,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,IAAI,CAAC,EAAE,MAAM,CAAC;IACd;;;OAGG;IACH,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB;;;OAGG;IACH,MAAM,CAAC,EAAE,QAAQ,GAAG,OAAO,CAAC;IAC5B;;;;OAIG;IACH,eAAe,CAAC,EAAE,MAAM,CAAC;IACzB;;;;OAIG;IACH,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB;;;;OAIG;IACH,cAAc,CAAC,EAAE,CAAC,MAAM,EAAE,MAAM,KAAK,IAAI,CAAC;IAC1C;;;;OAIG;IACH,OAAO,CAAC,EAAE,CAAC,IAAI,EAAE,MAAM,KAAK,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;CAC/C;AAcD;;;;GAIG;AACH,wBAAgB,qBAAqB,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAOzD;AAED,mEAAmE;AACnE,wBAAgB,mBAAmB,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAExD;AAED,qEAAqE;AACrE,wBAAgB,eAAe,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAEnD;AAQD,iFAAiF;AACjF,wBAAgB,qBAAqB,IAAI,iBAAiB,CASzD;AAWD,8EAA8E;AAC9E,wBAAgB,iBAAiB,IAAI,iBAAiB,EAAE,CAEvD;AAED,yCAAyC;AACzC,wBAAgB,eAAe,CAAC,GAAG,EAAE,MAAM,GAAG,iBAAiB,GAAG,IAAI,CAGrE;AAeD,uDAAuD;AACvD,wBAAgB,aAAa,CAAC,UAAU,EAAE,MAAM,GAAG,MAAM,CAExD;AAoDD,mFAAmF;AACnF,wBAAgB,qBAAqB,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,GAAE,MAAM,EAAO,EAAE,KAAK,SAAI,GAAG,MAAM,EAAE,CAyB3F;AAkCD;;;;GAIG;AACH,wBAAsB,mBAAmB,CACvC,GAAG,EAAE,MAAM,EACX,UAAU,EAAE,MAAM,EAClB,IAAI,EAAE,MAAM,EACZ,IAAI,GAAE,gBAAqB;AAC3B;;;;GAIG;AACH,kBAAkB,SAAI,GACrB,OAAO,CAAC,MAAM,CAAC,CAsDjB;AAED;;;GAGG;AACH,wBAAsB,eAAe,CACnC,GAAG,EAAE,MAAM,EACX,KAAK,EAAE,MAAM,EAAE,EACf,IAAI,GAAE,gBAAqB,GAC1B,OAAO,CAAC,YAAY,CAAC,CAyGvB;AAkBD;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,wBAAsB,cAAc,CAClC,GAAG,EAAE,MAAM,EACX,QAAQ,EAAE,MAAM,EAChB,IAAI,GAAE,gBAAqB,GAC1B,OAAO,CAAC,YAAY,EAAE,CAAC,CAwGzB;AAWD,gFAAgF;AAChF,eAAO,MAAM,cAAc,QAAS,CAAC;AAErC,qDAAqD;AACrD,MAAM,WAAW,oBAAoB;IACnC,KAAK,EAAE,MAAM,CAAC;IACd,WAAW,EAAE,MAAM,CAAC;IACpB,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;CACf;AAED,+CAA+C;AAC/C,MAAM,WAAW,wBAAwB;IACvC,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;IACf,OAAO,EAAE,MAAM,CAAC;IAChB,QAAQ,EAAE,oBAAoB,EAAE,CAAC;CAClC;AAiCD;;;;;;;;;GASG;AACH,wBAAgB,qBAAqB,CACnC,GAAG,EAAE,MAAM,EACX,MAAM,EAAE,MAAM,EACd,OAAO,CAAC,EAAE,MAAM,GACf;IAAE,EAAE,EAAE,IAAI,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,OAAO,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,WAAW,CAAC,EAAE,MAAM,CAAA;CAAE,GAAG;IAAE,EAAE,EAAE,KAAK,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CA2CpH;AAED,yDAAyD;AACzD,wBAAgB,qBAAqB,CAAC,GAAG,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,MAAM,GAAG,wBAAwB,EAAE,CAsB9F;AAED;;;;GAIG;AACH,wBAAsB,uBAAuB,CAAC,GAAG,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC,CA2B3F;AAED,0FAA0F;AAC1F,wBAAsB,kBAAkB,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC,CAoBtE;AAID,mFAAmF;AACnF,MAAM,WAAW,UAAU;IACzB,GAAG,EAAE,MAAM,CAAC;IACZ,KAAK,EAAE,MAAM,CAAC;IACd,OAAO,EAAE,MAAM,CAAC;IAChB,SAAS,EAAE,MAAM,CAAC;IAClB,wEAAwE;IACxE,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,MAAM,EAAE,MAAM,CAAC;IACf,OAAO,EAAE,KAAK,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;CAClD;AAYD;;;;;;;;;;;;;GAaG;AACH,wBAAsB,gBAAgB,CACpC,GAAG,EAAE,MAAM,EACX,KAAK,EAAE,MAAM,EAAE,EACf,IAAI,GAAE,gBAAqB,GAC1B,OAAO,CAAC,UAAU,CAAC,CA8DrB;AAID;;;;GAIG;AACH,wBAAgB,sBAAsB,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,YAAY,EAAE,GAAG,MAAM,CA2BhF;AAGD,OAAO,EAAE,oBAAoB,EAAE,sBAAsB,EAAE,CAAC"}