@convex-dev/rag 0.1.7

package/dist/client/index.d.ts

@@ -0,0 +1,442 @@
+import type { EmbeddingModelV1 } from "@ai-sdk/provider";
+import { generateText, type CoreMessage } from "ai";
+import { type FunctionArgs, type FunctionReturnType, type GenericActionCtx, type GenericDataModel, type GenericMutationCtx, type PaginationOptions, type PaginationResult, type RegisteredAction, type RegisteredMutation } from "convex/server";
+import { type Value } from "convex/values";
+import { vEntryId, vNamespaceId, type Chunk, type Entry, type EntryFilterValues, type EntryId, type Namespace, type NamespaceId, type SearchEntry, type SearchResult, type Status } from "../shared.js";
+import { type RAGComponent, type RunActionCtx, type RunMutationCtx, type RunQueryCtx } from "./types.js";
+import { type ChunkerAction, type OnComplete, type OnCompleteNamespace } from "../shared.js";
+import { defaultChunker } from "./defaultChunker.js";
+export { defaultChunker, vEntryId, vNamespaceId };
+export type { ChunkerAction, Entry, EntryId, RAGComponent, NamespaceId, OnComplete, OnCompleteNamespace, SearchEntry, SearchResult, Status, };
+export { type VEntry, type VSearchEntry, vEntry, vSearchEntry, vSearchResult, vOnCompleteArgs, } from "../shared.js";
+export { contentHashFromArrayBuffer, guessMimeTypeFromExtension, guessMimeTypeFromContents, } from "./fileUtils.js";
+type Importance = number;
+export declare class RAG<FitlerSchemas extends Record<string, Value> = Record<string, Value>, EntryMetadata extends Record<string, Value> = Record<string, Value>> {
+    component: RAGComponent;
+    options: {
+        embeddingDimension: number;
+        textEmbeddingModel: EmbeddingModelV1<string>;
+        filterNames?: FilterNames<FitlerSchemas>;
+    };
+    /**
+     * A component to use for Retrieval-Augmented Generation.
+     * Create one for each model and embedding dimension you want to use.
+     * When migrating between models / embedding lengths, create multiple
+     * instances and do your `add`s with the appropriate instance, and searches
+     * against the appropriate instance to get results with those parameters.
+     *
+     * The filterNames need to match the names of the filters you provide when
+     * adding and when searching. Use the type parameter to make this type safe.
+     *
+     * The second type parameter makes the entry metadata type safe. E.g. you can
+     * do rag.add(ctx, {
+     *   namespace: "my-namespace",
+     *   metadata: {
+     *     source: "website" as const,
+     *   },
+     * })
+     * and then entry results will have the metadata type `{ source: "website" }`.
+     */
+    constructor(component: RAGComponent, options: {
+        embeddingDimension: number;
+        textEmbeddingModel: EmbeddingModelV1<string>;
+        filterNames?: FilterNames<FitlerSchemas>;
+    });
+    /**
+     * Add an entry to the store. It will chunk the text with the `defaultChunker`
+     * if you don't provide chunks, and embed the chunks with the default model
+     * if you don't provide chunk embeddings.
+     *
+     * If you provide a key, it will replace an existing entry with the same key.
+     * If you don't provide a key, it will always create a new entry.
+     * If you provide a contentHash, it will deduplicate the entry if it already exists.
+     * The filterValues you provide can be used later to search for it.
+     */
+    add(ctx: RunMutationCtx, args: NamespaceSelection & EntryArgs<FitlerSchemas, EntryMetadata> & ({
+        /**
+         * You can provide your own chunks to finely control the splitting.
+         * These can also include your own provided embeddings, so you can
+         * control what content is embedded, which can differ from the content
+         * in the chunks.
+         */
+        chunks: Iterable<InputChunk> | AsyncIterable<InputChunk>;
+        /** @deprecated You cannot specify both chunks and text currently. */
+        text?: undefined;
+    } | {
+        /**
+         * If you don't provide chunks, we will split the text into chunks
+         * using the default chunker and embed them with the default model.
+         */
+        text: string;
+        /** @deprecated You cannot specify both chunks and text currently. */
+        chunks?: undefined;
+    })): Promise<{
+        entryId: EntryId;
+        status: Status;
+        created: boolean;
+        replacedVersion: Entry<FitlerSchemas, EntryMetadata> | null;
+    }>;
+    /**
+     * Add an entry to the store asynchronously.
+     *
+     * This is useful if you want to chunk the entry in a separate process,
+     * or if you want to chunk the entry in a separate process.
+     *
+     * The chunkerAction is a function that splits the entry into chunks and
+     * embeds them. It should be passed as internal.foo.myChunkerAction
+     * e.g.
+     * ```ts
+     * export const myChunkerAction = rag.defineChunkerAction(async (ctx, args) => {
+     *   // ...
+     *   return { chunks: [chunk1, chunk2, chunk3] };
+     * });
+     *
+     * // in your mutation
+     *   const entryId = await rag.addAsync(ctx, {
+     *     key: "myfile.txt",
+     *     namespace: "my-namespace",
+     *     chunkerAction: internal.foo.myChunkerAction,
+     *   });
+     * ```
+     */
+    addAsync(ctx: RunMutationCtx, args: NamespaceSelection & EntryArgs<FitlerSchemas, EntryMetadata> & {
+        /**
+         * A function that splits the entry into chunks and embeds them.
+         * This should be passed as internal.foo.myChunkerAction
+         * e.g.
+         * ```ts
+         * export const myChunkerAction = rag.defineChunkerAction();
+         *
+         * // in your mutation
+         *   const entryId = await rag.addAsync(ctx, {
+         *     key: "myfile.txt",
+         *     namespace: "my-namespace",
+         *     chunker: internal.foo.myChunkerAction,
+         *   });
+         */
+        chunkerAction: ChunkerAction;
+    }): Promise<{
+        entryId: EntryId;
+        status: "ready" | "pending";
+    }>;
+    /**
+     * Search for entries in a namespace with configurable filters.
+     * You can provide a query string or target embedding, as well as search
+     * parameters to filter and constrain the results.
+     */
+    search(ctx: RunActionCtx, args: {
+        /**
+         * The namespace to search in. e.g. a userId if entries are per-user.
+         * Note: it will only match entries in the namespace that match the
+         * modelId, embedding dimension, and filterNames of the RAG instance.
+         */
+        namespace: string;
+        /**
+         * The query to search for. Optional if embedding is provided.
+         */
+        query?: string;
+    } & SearchOptions<FitlerSchemas>): Promise<{
+        results: SearchResult[];
+        text: string;
+        entries: SearchEntry<FitlerSchemas, EntryMetadata>[];
+    }>;
+    /**
+     * Generate text based on Retrieval-Augmented Generation.
+     *
+     * This will search for entries in the namespace based on the prompt and use
+     * the results as context to generate text, using the search options args.
+     * You can override the default "system" message to provide instructions on
+     * using the context and answering in the appropriate style.
+     * You can provide "messages" in addition to the prompt to provide
+     * extra context / conversation history.
+     */
+    generateText(ctx: RunActionCtx, args: {
+        /**
+         * The search options to use for context search, including the namespace.
+         */
+        search: SearchOptions<FitlerSchemas> & {
+            /**
+             * The namespace to search in. e.g. a userId if entries are per-user.
+             */
+            namespace: string;
+        };
+        /**
+         * Required. The prompt to use for context search, as well as the final
+         * message to the LLM when generating text.
+         * Can be used along with "messages"
+         */
+        prompt: string;
+        /**
+         * Additional messages to add to the context. Can be provided in addition
+         * to the prompt, in which case it will precede the prompt.
+         */
+        messages?: CoreMessage[];
+    } & Parameters<typeof generateText>[0]): Promise<Awaited<ReturnType<typeof generateText>> & {
+        context: {
+            results: SearchResult[];
+            text: string;
+            entries: SearchEntry<FitlerSchemas, EntryMetadata>[];
+        };
+    }>;
+    /**
+     * List all entries in a namespace.
+     */
+    list(ctx: RunQueryCtx, args: {
+        namespaceId: NamespaceId;
+        paginationOpts: PaginationOptions;
+        order?: "desc" | "asc";
+        status?: Status;
+    }): Promise<PaginationResult<Entry<FitlerSchemas, EntryMetadata>>>;
+    /**
+     * Get entry metadata by its id.
+     */
+    getEntry(ctx: RunQueryCtx, args: {
+        entryId: EntryId;
+    }): Promise<Entry<FitlerSchemas, EntryMetadata> | null>;
+    /**
+     * Find an existing entry by its content hash, which you can use to copy
+     * new results into a new entry when migrating, or avoiding duplicating work
+     * when updating content.
+     */
+    findExistingEntryByContentHash(ctx: RunQueryCtx, args: {
+        namespace: string;
+        key: string;
+        /** The hash of the entry contents to try to match. */
+        contentHash: string;
+    }): Promise<Entry<FitlerSchemas, EntryMetadata> | null>;
+    /**
+     * Get a namespace that matches the modelId, embedding dimension, and
+     * filterNames of the RAG instance. If it doesn't exist, it will be created.
+     */
+    getOrCreateNamespace(ctx: RunMutationCtx, args: {
+        /**
+         * The namespace to get or create. e.g. a userId if entries are per-user.
+         */
+        namespace: string;
+        /**
+         * If it isn't in existence, what the new namespace status should be.
+         */
+        status?: "pending" | "ready";
+        /**
+         * This will be called when then namespace leaves the "pending" state.
+         * Either if the namespace is created or if the namespace is replaced
+         * along the way.
+         */
+        onComplete?: OnCompleteNamespace;
+    }): Promise<{
+        namespaceId: NamespaceId;
+        status: "pending" | "ready";
+    }>;
+    /**
+     * Get a namespace that matches the modelId, embedding dimension, and
+     * filterNames of the RAG instance. If it doesn't exist, it will return null.
+     */
+    getNamespace(ctx: RunQueryCtx, args: {
+        namespace: string;
+    }): Promise<Namespace | null>;
+    /**
+     * List all chunks for an entry, paginated.
+     */
+    listChunks(ctx: RunQueryCtx, args: {
+        paginationOpts: PaginationOptions;
+        entryId: EntryId;
+    }): Promise<PaginationResult<Chunk>>;
+    /**
+     * Delete an entry and all its chunks.
+     */
+    delete(ctx: RunMutationCtx, args: {
+        entryId: EntryId;
+    }): Promise<void>;
+    /**
+     * Define a function that can be provided to the `onComplete` parameter of
+     * `add` or `addAsync` like:
+     * ```ts
+     * const onComplete = rag.defineOnComplete(async (ctx, args) => {
+     *   // ...
+     * });
+     *
+     * // in your mutation
+     *   await rag.add(ctx, {
+     *     namespace: "my-namespace",
+     *     onComplete: internal.foo.onComplete,
+     *   });
+     * ```
+     * It will be called when the entry is no longer "pending".
+     * This is usually when it's "ready" but it can be "replaced" if a newer
+     * entry is ready before this one.
+     */
+    defineOnComplete<DataModel extends GenericDataModel>(fn: (ctx: GenericMutationCtx<DataModel>, args: FunctionArgs<OnComplete<FitlerSchemas, EntryMetadata>>) => Promise<void>): RegisteredMutation<"internal", FunctionArgs<OnComplete<FitlerSchemas, EntryMetadata>>, null>;
+    /**
+     * Define a function that can be provided to the `chunkerAction` parameter of
+     * `addAsync` like:
+     * ```ts
+     * const chunkerAction = rag.defineChunkerAction(async (ctx, args) => {
+     *   // ...
+     * });
+     *
+     * // in your mutation
+     *   const entryId = await rag.addAsync(ctx, {
+     *     key: "myfile.txt",
+     *     namespace: "my-namespace",
+     *     chunkerAction: internal.foo.myChunkerAction,
+     *   });
+     * ```
+     * It will be called when the entry is added, or when the entry is replaced
+     * along the way.
+     */
+    defineChunkerAction<DataModel extends GenericDataModel>(fn: (ctx: GenericActionCtx<DataModel>, args: {
+        namespace: Namespace;
+        entry: Entry<FitlerSchemas, EntryMetadata>;
+    }) => AsyncIterable<InputChunk> | Promise<{
+        chunks: InputChunk[];
+    }>): RegisteredAction<"internal", FunctionArgs<ChunkerAction>, FunctionReturnType<ChunkerAction>>;
+}
+/**
+ * Rank results from multiple results, e.g. from vector search and text search.
+ * Uses the "Recriprocal Rank Fusion" algorithm.
+ * @param sortedResults The results arrays ordered by most important first.
+ */
+export declare function hybridRank<T extends string>(sortedResults: T[][], opts?: {
+    /**
+     * A constant used to change the bias of the top results in each list vs.
+     * results in the middle of multiple lists.
+     * A higher k means less of a bias toward the top few results.
+     */
+    k: number;
+    /**
+     * The weights of each sortedResults array.
+     * Used to prefer results from one sortedResults array over another.
+     */
+    weights: number[];
+    /**
+     * The cutoff score for a result to be returned.
+     */
+    cutoffScore?: number;
+}): T[];
+type MastraChunk = {
+    text: string;
+    metadata: Record<string, Value>;
+    embedding?: Array<number>;
+};
+type LangChainChunk = {
+    id?: string;
+    pageContent: string;
+    metadata: Record<string, Value>;
+    embedding?: Array<number>;
+};
+export type InputChunk = string | ((MastraChunk | LangChainChunk) & {
+    keywords?: string;
+});
+type FilterNames<FiltersSchemas extends Record<string, Value>> = (keyof FiltersSchemas & string)[];
+type NamespaceSelection = {
+    /**
+     * A namespace is an isolated search space - no search can access entities
+     * in other namespaces. Often this is used to segment user documents from
+     * each other, but can be an arbitrary delineation. All filters apply
+     * within a namespace.
+     */
+    namespace: string;
+} | {
+    /**
+     * The namespaceId, which is returned when creating a namespace
+     * or looking it up.
+     * There can be multiple namespaceIds for the same namespace, e.g.
+     * one for each modelId, embedding dimension, and filterNames.
+     * Each of them have a separate "status" and only one is ever "ready" for
+     * any given "namespace" (e.g. a userId).
+     */
+    namespaceId: NamespaceId;
+};
+type EntryArgs<FitlerSchemas extends Record<string, Value>, EntryMetadata extends Record<string, Value>> = {
+    /**
+     * This key allows replacing an existing entry by key.
+     * Within a namespace, there will only be one "ready" entry per key.
+     * When adding a new one, it will start as "pending" and after all
+     * chunks are added, it will be promoted to "ready".
+     */
+    key?: string | undefined;
+    /**
+     * The title of the entry. Used for default prompting to contextualize
+     * the entry results. Also may be used for keyword search in the future.
+     */
+    title?: string;
+    /**
+     * Metadata about the entry that is not indexed or filtered or searched.
+     * Provided as a convenience to store associated information, such as
+     * the storageId or url to the source material.
+     */
+    metadata?: EntryMetadata;
+    /**
+     * Filters to apply to the entry. These can be OR'd together in search.
+     * To represent AND logic, your filter can be an object or array with
+     * multiple values. e.g. saving the result with:
+     * `{ name: "categoryAndPriority", value: ["articles", "high"] }`
+     * and searching with the same value will return entries that match that
+     * value exactly.
+     */
+    filterValues?: EntryFilterValues<FitlerSchemas>[];
+    /**
+     * The importance of the entry. This is used to scale the vector search
+     * score of each chunk.
+     */
+    importance?: Importance;
+    /**
+     * The hash of the entry contents. This is used to deduplicate entries.
+     * You can look up existing entries by content hash within a namespace.
+     * It will also return an existing entry if you add an entry with the
+     * same content hash.
+     */
+    contentHash?: string;
+    /**
+     * A function that is called when the entry is added.
+     */
+    onComplete?: OnComplete;
+};
+type SearchOptions<FitlerSchemas extends Record<string, Value>> = {
+    /**
+     * The embedding to search for. If provided, it will be used instead
+     * of the query for vector search.
+     */
+    embedding?: Array<number>;
+    /**
+     * Filters to apply to the search. These are OR'd together. To represent
+     * AND logic, your filter can be an object or array with multiple values.
+     * e.g. `[{ category: "articles" }, { priority: "high" }]` will return
+     * entries that have "articles" category OR "high" priority.
+     * `[{ category_priority: ["articles", "high"] }]` will return
+     * entries that have "articles" category AND "high" priority.
+     * This requires inserting the entries with these filter values exactly.
+     * e.g. if you insert a entry with
+     * `{ team_user: { team: "team1", user: "user1" } }`, it will not match
+     * `{ team_user: { team: "team1" } }` but it will match
+     */
+    filters?: EntryFilterValues<FitlerSchemas>[];
+    /**
+     * The maximum number of messages to fetch. Default is 10.
+     * This is the number *before* the chunkContext is applied.
+     * e.g. { before: 2, after: 1 } means 4x the limit is returned.
+     */
+    limit?: number;
+    /**
+     * What chunks around the search results to include.
+     * Default: { before: 0, after: 0 }
+     * e.g. { before: 2, after: 1 } means 2 chunks before + 1 chunk after.
+     * If `chunk4` was the only result, the results returned would be:
+     * `[{ content: [chunk2, chunk3, chunk4, chunk5], score, ... }]`
+     * The results don't overlap, and bias toward giving "before" context.
+     * So if `chunk7` was also a result, the results returned would be:
+     * `[
+     *   { content: [chunk2, chunk3, chunk4], score, ... }
+     *   { content: [chunk5, chunk6, chunk7, chunk8], score, ... },
+     * ]`
+     */
+    chunkContext?: {
+        before: number;
+        after: number;
+    };
+    /**
+     * The minimum score to return a result.
+     */
+    vectorScoreThreshold?: number;
+};
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/client/index.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,kBAAkB,CAAC;AACzD,OAAO,EAAoB,YAAY,EAAE,KAAK,WAAW,EAAE,MAAM,IAAI,CAAC;AAEtE,OAAO,EAIL,KAAK,YAAY,EAEjB,KAAK,kBAAkB,EACvB,KAAK,gBAAgB,EACrB,KAAK,gBAAgB,EACrB,KAAK,kBAAkB,EACvB,KAAK,iBAAiB,EACtB,KAAK,gBAAgB,EACrB,KAAK,gBAAgB,EACrB,KAAK,kBAAkB,EACxB,MAAM,eAAe,CAAC;AACvB,OAAO,EAAE,KAAK,KAAK,EAAE,MAAM,eAAe,CAAC;AAC3C,OAAO,EAIL,QAAQ,EACR,YAAY,EAEZ,KAAK,KAAK,EAEV,KAAK,KAAK,EACV,KAAK,iBAAiB,EACtB,KAAK,OAAO,EACZ,KAAK,SAAS,EACd,KAAK,WAAW,EAChB,KAAK,WAAW,EAChB,KAAK,YAAY,EACjB,KAAK,MAAM,EACZ,MAAM,cAAc,CAAC;AACtB,OAAO,EACL,KAAK,YAAY,EACjB,KAAK,YAAY,EACjB,KAAK,cAAc,EACnB,KAAK,WAAW,EACjB,MAAM,YAAY,CAAC;AACpB,OAAO,EACL,KAAK,aAAa,EAClB,KAAK,UAAU,EACf,KAAK,mBAAmB,EACzB,MAAM,cAAc,CAAC;AAEtB,OAAO,EAAE,cAAc,EAAE,MAAM,qBAAqB,CAAC;AAErD,OAAO,EAAE,cAAc,EAAE,QAAQ,EAAE,YAAY,EAAE,CAAC;AAClD,YAAY,EACV,aAAa,EACb,KAAK,EACL,OAAO,EACP,YAAY,EACZ,WAAW,EACX,UAAU,EACV,mBAAmB,EACnB,WAAW,EACX,YAAY,EACZ,MAAM,GACP,CAAC;AAEF,OAAO,EACL,KAAK,MAAM,EACX,KAAK,YAAY,EACjB,MAAM,EACN,YAAY,EACZ,aAAa,EACb,eAAe,GAChB,MAAM,cAAc,CAAC;AACtB,OAAO,EACL,0BAA0B,EAC1B,0BAA0B,EAC1B,yBAAyB,GAC1B,MAAM,gBAAgB,CAAC;AAMxB,KAAK,UAAU,GAAG,MAAM,CAAC;AAEzB,qBAAa,GAAG,CACd,aAAa,SAAS,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,EACnE,aAAa,SAAS,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC;IAsB1D,SAAS,EAAE,YAAY;IACvB,OAAO,EAAE;QACd,kBAAkB,EAAE,MAAM,CAAC;QAC3B,kBAAkB,EAAE,gBAAgB,CAAC,MAAM,CAAC,CAAC;QAC7C,WAAW,CAAC,EAAE,WAAW,CAAC,aAAa,CAAC,CAAC;KAC1C;IAzBH;;;;;;;;;;;;;;;;;;OAkBG;gBAEM,SAAS,EAAE,YAAY,EACvB,OAAO,EAAE;QACd,kBAAkB,EAAE,MAAM,CAAC;QAC3B,kBAAkB,EAAE,gBAAgB,CAAC,MAAM,CAAC,CAAC;QAC7C,WAAW,CAAC,EAAE,WAAW,CAAC,aAAa,CAAC,CAAC;KAC1C;IAGH;;;;;;;;;OASG;IACG,GAAG,CACP,GAAG,EAAE,cAAc,EACnB,IAAI,EAAE,kBAAkB,GACtB,SAAS,CAAC,aAAa,EAAE,aAAa,CAAC,GACvC,CACI;QACE;;;;;WAKG;QACH,MAAM,EAAE,QAAQ,CAAC,UAAU,CAAC,GAAG,aAAa,CAAC,UAAU,CAAC,CAAC;QACzD,qEAAqE;QACrE,IAAI,CAAC,EAAE,SAAS,CAAC;KAClB,GACD;QACE;;;WAGG;QACH,IAAI,EAAE,MAAM,CAAC;QACb,qEAAqE;QACrE,MAAM,CAAC,EAAE,SAAS,CAAC;KACpB,CACJ,GACF,OAAO,CAAC;QACT,OAAO,EAAE,OAAO,CAAC;QACjB,MAAM,EAAE,MAAM,CAAC;QACf,OAAO,EAAE,OAAO,CAAC;QACjB,eAAe,EAAE,KAAK,CAAC,aAAa,EAAE,aAAa,CAAC,GAAG,IAAI,CAAC;KAC7D,CAAC;IA4GF;;;;;;;;;;;;;;;;;;;;;;OAsBG;IACG,QAAQ,CACZ,GAAG,EAAE,cAAc,EACnB,IAAI,EAAE,kBAAkB,GACtB,SAAS,CAAC,aAAa,EAAE,aAAa,CAAC,GAAG;QACxC;;;;;;;;;;;;;WAaG;QACH,aAAa,EAAE,aAAa,CAAC;KAC9B,GACF,OAAO,CAAC;QAAE,OAAO,EAAE,OAAO,CAAC;QAAC,MAAM,EAAE,OAAO,GAAG,SAAS,CAAA;KAAE,CAAC;IAsC7D;;;;OAIG;IACG,MAAM,CACV,GAAG,EAAE,YAAY,EACjB,IAAI,EAAE;QACJ;;;;WAIG;QACH,SAAS,EAAE,MAAM,CAAC;QAClB;;WAEG;QACH,KAAK,CAAC,EAAE,MAAM,CAAC;KAChB,GAAG,aAAa,CAAC,aAAa,CAAC,GAC/B,OAAO,CAAC;QACT,OAAO,EAAE,YAAY,EAAE,CAAC;QACxB,IAAI,EAAE,MAAM,CAAC;QACb,OAAO,EAAE,WAAW,CAAC,aAAa,EAAE,aAAa,CAAC,EAAE,CAAC;KACtD,CAAC;IAyDF;;;;;;;;;OASG;IACG,YAAY,CAChB,GAAG,EAAE,YAAY,EACjB,IAAI,EAAE;QACJ;;WAEG;QACH,MAAM,EAAE,aAAa,CAAC,aAAa,CAAC,GAAG;YACrC;;eAEG;YACH,SAAS,EAAE,MAAM,CAAC;SACnB,CAAC;QACF;;;;WAIG;QACH,MAAM,EAAE,MAAM,CAAC;QACf;;;WAGG;QACH,QAAQ,CAAC,EAAE,WAAW,EAAE,CAAC;KAC1B,GAAG,UAAU,CAAC,OAAO,YAAY,CAAC,CAAC,CAAC,CAAC,GACrC,OAAO,CACR,OAAO,CAAC,UAAU,CAAC,OAAO,YAAY,CAAC,CAAC,GAAG;QACzC,OAAO,EAAE;YACP,OAAO,EAAE,YAAY,EAAE,CAAC;YACxB,IAAI,EAAE,MAAM,CAAC;YACb,OAAO,EAAE,WAAW,CAAC,aAAa,EAAE,aAAa,CAAC,EAAE,CAAC;SACtD,CAAC;KACH,CACF;IA8ED;;OAEG;IACG,IAAI,CACR,GAAG,EAAE,WAAW,EAChB,IAAI,EAAE;QACJ,WAAW,EAAE,WAAW,CAAC;QACzB,cAAc,EAAE,iBAAiB,CAAC;QAClC,KAAK,CAAC,EAAE,MAAM,GAAG,KAAK,CAAC;QACvB,MAAM,CAAC,EAAE,MAAM,CAAC;KACjB,GACA,OAAO,CAAC,gBAAgB,CAAC,KAAK,CAAC,aAAa,EAAE,aAAa,CAAC,CAAC,CAAC;IAUjE;;OAEG;IACG,QAAQ,CACZ,GAAG,EAAE,WAAW,EAChB,IAAI,EAAE;QACJ,OAAO,EAAE,OAAO,CAAC;KAClB,GACA,OAAO,CAAC,KAAK,CAAC,aAAa,EAAE,aAAa,CAAC,GAAG,IAAI,CAAC;IAOtD;;;;OAIG;IACG,8BAA8B,CAClC,GAAG,EAAE,WAAW,EAChB,IAAI,EAAE;QACJ,SAAS,EAAE,MAAM,CAAC;QAClB,GAAG,EAAE,MAAM,CAAC;QACZ,sDAAsD;QACtD,WAAW,EAAE,MAAM,CAAC;KACrB,GACA,OAAO,CAAC,KAAK,CAAC,aAAa,EAAE,aAAa,CAAC,GAAG,IAAI,CAAC;IAYtD;;;OAGG;IACG,oBAAoB,CACxB,GAAG,EAAE,cAAc,EACnB,IAAI,EAAE;QACJ;;WAEG;QACH,SAAS,EAAE,MAAM,CAAC;QAClB;;WAEG;QACH,MAAM,CAAC,EAAE,SAAS,GAAG,OAAO,CAAC;QAC7B;;;;WAIG;QACH,UAAU,CAAC,EAAE,mBAAmB,CAAC;KAClC,GACA,OAAO,CAAC;QACT,WAAW,EAAE,WAAW,CAAC;QACzB,MAAM,EAAE,SAAS,GAAG,OAAO,CAAC;KAC7B,CAAC;IAsBF;;;OAGG;IACG,YAAY,CAChB,GAAG,EAAE,WAAW,EAChB,IAAI,EAAE;QACJ,SAAS,EAAE,MAAM,CAAC;KACnB,GACA,OAAO,CAAC,SAAS,GAAG,IAAI,CAAC;IAS5B;;OAEG;IACG,UAAU,CACd,GAAG,EAAE,WAAW,EAChB,IAAI,EAAE;QACJ,cAAc,EAAE,iBAAiB,CAAC;QAClC,OAAO,EAAE,OAAO,CAAC;KAClB,GACA,OAAO,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC;IAOnC;;OAEG;IACG,MAAM,CAAC,GAAG,EAAE,cAAc,EAAE,IAAI,EAAE;QAAE,OAAO,EAAE,OAAO,CAAA;KAAE;IAO5D;;;;;;;;;;;;;;;;;OAiBG;IACH,gBAAgB,CAAC,SAAS,SAAS,gBAAgB,EACjD,EAAE,EAAE,CACF,GAAG,EAAE,kBAAkB,CAAC,SAAS,CAAC,EAClC,IAAI,EAAE,YAAY,CAAC,UAAU,CAAC,aAAa,EAAE,aAAa,CAAC,CAAC,KACzD,OAAO,CAAC,IAAI,CAAC,GACjB,kBAAkB,CACnB,UAAU,EACV,YAAY,CAAC,UAAU,CAAC,aAAa,EAAE,aAAa,CAAC,CAAC,EACtD,IAAI,CACL;IAOD;;;;;;;;;;;;;;;;;OAiBG;IACH,mBAAmB,CAAC,SAAS,SAAS,gBAAgB,EACpD,EAAE,EAAE,CACF,GAAG,EAAE,gBAAgB,CAAC,SAAS,CAAC,EAChC,IAAI,EAAE;QAAE,SAAS,EAAE,SAAS,CAAC;QAAC,KAAK,EAAE,KAAK,CAAC,aAAa,EAAE,aAAa,CAAC,CAAA;KAAE,KACvE,aAAa,CAAC,UAAU,CAAC,GAAG,OAAO,CAAC;QAAE,MAAM,EAAE,UAAU,EAAE,CAAA;KAAE,CAAC,GACjE,gBAAgB,CACjB,UAAU,EACV,YAAY,CAAC,aAAa,CAAC,EAC3B,kBAAkB,CAAC,aAAa,CAAC,CAClC;CAwEF;AA+GD;;;;GAIG;AACH,wBAAgB,UAAU,CAAC,CAAC,SAAS,MAAM,EACzC,aAAa,EAAE,CAAC,EAAE,EAAE,EACpB,IAAI,CAAC,EAAE;IACL;;;;OAIG;IACH,CAAC,EAAE,MAAM,CAAC;IACV;;;OAGG;IACH,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB;;OAEG;IACH,WAAW,CAAC,EAAE,MAAM,CAAC;CACtB,GACA,CAAC,EAAE,CAcL;AAED,KAAK,WAAW,GAAG;IACjB,IAAI,EAAE,MAAM,CAAC;IACb,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IAChC,SAAS,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;CAC3B,CAAC;AAEF,KAAK,cAAc,GAAG;IACpB,EAAE,CAAC,EAAE,MAAM,CAAC;IACZ,WAAW,EAAE,MAAM,CAAC;IACpB,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IAChC,SAAS,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;CAC3B,CAAC;AAEF,MAAM,MAAM,UAAU,GAClB,MAAM,GACN,CAAC,CAAC,WAAW,GAAG,cAAc,CAAC,GAAG;IAGhC,QAAQ,CAAC,EAAE,MAAM,CAAC;CAInB,CAAC,CAAC;AAEP,KAAK,WAAW,CAAC,cAAc,SAAS,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,IAC3D,CAAC,MAAM,cAAc,GAAG,MAAM,CAAC,EAAE,CAAC;AAEpC,KAAK,kBAAkB,GACnB;IACE;;;;;OAKG;IACH,SAAS,EAAE,MAAM,CAAC;CACnB,GACD;IACE;;;;;;;OAOG;IACH,WAAW,EAAE,WAAW,CAAC;CAC1B,CAAC;AAEN,KAAK,SAAS,CACZ,aAAa,SAAS,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,EAC3C,aAAa,SAAS,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,IACzC;IACF;;;;;OAKG;IACH,GAAG,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IACzB;;;OAGG;IACH,KAAK,CAAC,EAAE,MAAM,CAAC;IACf;;;;OAIG;IACH,QAAQ,CAAC,EAAE,aAAa,CAAC;IACzB;;;;;;;OAOG;IACH,YAAY,CAAC,EAAE,iBAAiB,CAAC,aAAa,CAAC,EAAE,CAAC;IAClD;;;OAGG;IACH,UAAU,CAAC,EAAE,UAAU,CAAC;IACxB;;;;;OAKG;IACH,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB;;OAEG;IACH,UAAU,CAAC,EAAE,UAAU,CAAC;CACzB,CAAC;AAEF,KAAK,aAAa,CAAC,aAAa,SAAS,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,IAAI;IAChE;;;OAGG;IACH,SAAS,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;IAC1B;;;;;;;;;;;OAWG;IACH,OAAO,CAAC,EAAE,iBAAiB,CAAC,aAAa,CAAC,EAAE,CAAC;IAC7C;;;;OAIG;IACH,KAAK,CAAC,EAAE,MAAM,CAAC;IACf;;;;;;;;;;;;OAYG;IACH,YAAY,CAAC,EAAE;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC;IACjD;;OAEG;IACH,oBAAoB,CAAC,EAAE,MAAM,CAAC;CAC/B,CAAC"}