@vexcms/better-auth 0.1.0-alpha.2 → 0.1.0-alpha.3

package/dist/convex/getAuth.d.ts

@@ -9,18 +9,21 @@ import type { CollectionSlug, VexApiAuth } from "@vexcms/core";
  * `identity.sessionId` (appended to every token by the plugin) → session
  * document → `session.activeOrganizationId` → organization document.
  * Documents are read fresh on every request, so role changes and
- * `identity.sessionId` (appended to every token by the plugin) → session
- * document → `session.activeOrganizationId` → organization document.
- * Documents are read fresh on every request, so role changes and
  * org switches apply immediately — claims are only used as ids, never
  * as authorization data.
  *
+ * `orgCollectionSlug` is only required when `resolveOrgs` is true — a
+ * project with organizations disabled can omit it entirely. Passing
+ * `resolveOrgs: true` without an `orgCollectionSlug` skips org resolution
+ * (same as `resolveOrgs: false`) rather than throwing, since the omission
+ * is a config mistake, not a request-time error worth failing loudly for.
+ *
  * @returns { user, organization }, @see {@link VexApiAuth}
  *
  */
 export declare function createGetAuth<TCollectionSlug extends CollectionSlug = CollectionSlug>(props: {
     userCollectionSlug: TCollectionSlug;
-    orgCollectionSlug: TCollectionSlug;
+    orgCollectionSlug?: TCollectionSlug;
     sessionCollectionSlug: TCollectionSlug;
     resolveOrgs?: boolean;
 }): <DataModel extends GenericDataModel>(ctx: GenericQueryCtx<DataModel> | GenericMutationCtx<DataModel>) => Promise<VexApiAuth>;

package/dist/convex/getAuth.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"getAuth.d.ts","sourceRoot":"","sources":["../../src/convex/getAuth.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,gBAAgB,EAAE,kBAAkB,EAAE,eAAe,EAAE,MAAM,eAAe,CAAC;AAE3F,OAAO,KAAK,EAAE,cAAc,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAE/D;;;;;;;;;;;;;;;;;GAiBG;AACH,wBAAgB,aAAa,CAAC,eAAe,SAAS,cAAc,GAAG,cAAc,EAAE,KAAK,EAAE;IAC5F,kBAAkB,EAAE,eAAe,CAAC;IACpC,iBAAiB,EAAE,eAAe,CAAC;IACnC,qBAAqB,EAAE,eAAe,CAAC;IACvC,WAAW,CAAC,EAAE,OAAO,CAAC;CACvB,IACe,SAAS,SAAS,gBAAgB,EAC9C,KAAK,eAAe,CAAC,SAAS,CAAC,GAAG,kBAAkB,CAAC,SAAS,CAAC,KAC9D,OAAO,CAAC,UAAU,CAAC,CA0BvB"}
+{"version":3,"file":"getAuth.d.ts","sourceRoot":"","sources":["../../src/convex/getAuth.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,gBAAgB,EAAE,kBAAkB,EAAE,eAAe,EAAE,MAAM,eAAe,CAAC;AAE3F,OAAO,KAAK,EAAE,cAAc,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAE/D;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,wBAAgB,aAAa,CAAC,eAAe,SAAS,cAAc,GAAG,cAAc,EAAE,KAAK,EAAE;IAC5F,kBAAkB,EAAE,eAAe,CAAC;IACpC,iBAAiB,CAAC,EAAE,eAAe,CAAC;IACpC,qBAAqB,EAAE,eAAe,CAAC;IACvC,WAAW,CAAC,EAAE,OAAO,CAAC;CACvB,IACe,SAAS,SAAS,gBAAgB,EAC9C,KAAK,eAAe,CAAC,SAAS,CAAC,GAAG,kBAAkB,CAAC,SAAS,CAAC,KAC9D,OAAO,CAAC,UAAU,CAAC,CA2BvB"}

package/dist/index.js

@@ -2201,13 +2201,14 @@ function createGetAuth(props) {
     if (user === null) {
       return { user };
     }
-    if (!props.resolveOrgs) {
+    if (!props.resolveOrgs || !props.orgCollectionSlug) {
       return { user };
     }
+    const orgCollectionSlug = props.orgCollectionSlug;
     const sessionId = identity.sessionId;
     const session = sessionId ? await ctx.db.get(props.sessionCollectionSlug, sessionId) : null;
     const orgId = session?.activeOrganizationId;
-    const organization = orgId ? await ctx.db.get(props.orgCollectionSlug, orgId) ?? void 0 : void 0;
+    const organization = orgId ? await ctx.db.get(orgCollectionSlug, orgId) ?? void 0 : void 0;
     return { user, organization };
   };
 }

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/adapter.ts","../src/convex/adapter.ts","../src/convex/db.ts","../../../node_modules/.pnpm/convex-helpers@0.1.120_@standard-schema+spec@1.1.0_convex@1.44.0_react@19.2.7__hono@4.1_fda37119e0b134c2babc8f4bd1faf097/node_modules/convex-helpers/index.js","../../../node_modules/.pnpm/convex-helpers@0.1.120_@standard-schema+spec@1.1.0_convex@1.44.0_react@19.2.7__hono@4.1_fda37119e0b134c2babc8f4bd1faf097/node_modules/convex-helpers/server/stream.js","../src/convex/utils.ts","../src/convex/getAuth.ts","../src/convex/index.ts"],"sourcesContent":["import type {\n  AuthCollectionConfig,\n  AuthFieldMeta,\n  BaseFieldInput,\n  CollectionSlug,\n  FieldAdminConfigInput,\n  VexAuthAdapter,\n} from \"@vexcms/core\";\nimport {\n  array,\n  AuthCollectionMeta,\n  checkbox,\n  date,\n  defineCollection,\n  number,\n  select,\n  text,\n} from \"@vexcms/core\";\nimport type { BetterAuthOptions, DBFieldAttribute } from \"better-auth\";\nimport { getAuthTables } from \"better-auth/db\";\n\n/**\n * Options for `betterAuthAdapter()`.\n *\n * Accepts the same `BetterAuthOptions` object you pass to `betterAuth()`\n * on the server. Only schema-affecting properties (modelNames,\n * additionalFields, plugins) are read. Runtime options (database, secret,\n * baseURL) are ignored.\n */\nexport interface BetterAuthAdapterOptions {\n  config: BetterAuthOptions;\n}\n\nconst AUTH_COLLECTION_TYPES = {\n  user: \"user\",\n  session: \"session\",\n  account: \"account\",\n  verification: \"verification\",\n} as const;\n\n/** Fields on the user table that end-users are allowed to edit. */\nconst EDITABLE_FIELDS = new Set([\n  \"name\",\n  \"email\",\n  \"image\",\n  \"role\",\n  \"banned\",\n  \"banReason\",\n  \"banExpires\",\n]);\n\n/** Fields that should be hidden in the admin UI for security. */\nconst HIDDEN_FIELDS = new Set([\n  \"hashedPassword\",\n  \"password\",\n  \"twoFactorSecret\",\n  \"twoFactorBackupCodes\",\n  \"token\",\n  \"secret\",\n  \"code\",\n]);\n\n/**\n * Creates a Vex auth adapter from a Better Auth configuration.\n *\n * Introspects Better Auth's full merged schema (base fields + plugin fields\n * + additionalFields) via `getAuthTables()` and converts each table into a\n * standard Vex `CollectionConfig` using Vex field builders.\n *\n * Mappings from Better Auth `DBFieldAttribute` to Vex fields:\n * - `type` → Vex field type (`string`→text, `boolean`→checkbox, `number`→number,\n *   `date`/`timestamp`→date, `json`→text fallback, array→select)\n * - `required` → field `required`\n * - `defaultValue` → field `defaultValue`\n * - `unique`/`index` → field `index` (index name: `by_<field>_unique` or `by_<field>`)\n * - `references` → `relationship` field\n * - System fields get `admin.readOnly: true` and `meta.locked: true`\n * - Sensitive fields get `admin.hidden: true`\n *\n * @param props — Adapter options; pass your Better Auth config object wrapped\n *   in `{ config: authOptions }`. Optional — when omitted, uses default\n *   Better Auth tables with no plugins or additional fields.\n * @returns A `VexAuthAdapter` ready for `defineConfig({ auth: … })`.\n *\n * @example\n * ```ts\n * import { betterAuthAdapter } from \"@vexcms/better-auth\";\n * import { authOptions } from \"~/auth/server\";\n *\n * export default defineConfig({\n *   auth: betterAuthAdapter({ config: authOptions }),\n *   collections: [posts],\n * });\n * ```\n */\nexport function betterAuthAdapter(\n  props?: BetterAuthAdapterOptions,\n): VexAuthAdapter {\n  const tables = getAuthTables(props?.config ?? {});\n  const collections: AuthCollectionConfig[] = [];\n  const authCollections = [\n    { type: AUTH_COLLECTION_TYPES.user, slug: props?.config?.user?.modelName },\n    {\n      type: AUTH_COLLECTION_TYPES.session,\n      slug: props?.config?.session?.modelName,\n    },\n    {\n      type: AUTH_COLLECTION_TYPES.account,\n      slug: props?.config?.account?.modelName,\n    },\n    {\n      type: AUTH_COLLECTION_TYPES.verification,\n      slug: props?.config?.verification?.modelName,\n    },\n  ] as const;\n\n  for (const [tableKey, tableDef] of Object.entries(tables)) {\n    const slug = tableDef.modelName ?? tableKey;\n    const fields: AuthCollectionConfig[\"fields\"] = {};\n\n    addAuthCollectionFields({\n      attributes: tableDef.fields,\n      slug,\n      fields,\n      config: props?.config,\n      extractId: true,\n    });\n\n    const authCollectionType = authCollections.find(\n      (ac) => ac.slug === slug,\n    )?.type;\n    if (authCollectionType) {\n      switch (authCollectionType) {\n        case \"user\": {\n          const additionalFields = props?.config?.user?.additionalFields;\n          addAuthCollectionFields({\n            attributes: additionalFields,\n            slug,\n            fields,\n            config: props?.config,\n          });\n          break;\n        }\n        case \"session\": {\n          const additionalFields = props?.config?.session?.additionalFields;\n          addAuthCollectionFields({\n            attributes: additionalFields,\n            slug,\n            fields,\n            config: props?.config,\n          });\n          break;\n        }\n        case \"account\": {\n          const additionalFields = props?.config?.account?.additionalFields;\n          addAuthCollectionFields({\n            attributes: additionalFields,\n            slug,\n            fields,\n            config: props?.config,\n          });\n          break;\n        }\n        case \"verification\": {\n          const additionalFields =\n            props?.config?.verification?.additionalFields;\n          addAuthCollectionFields({\n            attributes: additionalFields,\n            slug,\n            fields,\n            config: props?.config,\n          });\n          break;\n        }\n        default:\n          break;\n      }\n    }\n\n    const isProtected = slug !== \"user\" && slug !== \"users\";\n\n    collections.push(\n      defineCollection<AuthFieldMeta, AuthCollectionMeta>({\n        slug: slug as CollectionSlug,\n        fields,\n        meta: isProtected ? { protected: true } : undefined,\n      }),\n    );\n  }\n\n  const userSlug = tables.user?.modelName ?? \"user\";\n  return {\n    name: \"better-auth\",\n    collections,\n    userCollection: userSlug as CollectionSlug,\n  };\n}\n\n/**\n * Converts a set of Better Auth field attributes into Vex field definitions\n * and appends them to the given collection `fields` map.\n *\n * Iterates over `attributes`, calls {@link betterAuthAttrToVexField} for each\n * entry, and mutates `props.fields` in place. When `extractId` is `true`,\n * the `id` field is skipped because Convex auto-generates `_id`.\n *\n * @param props — Field extraction options.\n * @param props.attributes — Better Auth `DBFieldAttribute` map to convert.\n * @param props.slug — Collection slug (used for relationship target resolution).\n * @param props.fields — Mutable Vex collection fields object to populate.\n * @param props.config — Better Auth options (for model name / additional fields lookups).\n * @param props.extractId — When `true`, skips the `id` field.\n *\n * @internal\n */\nexport function addAuthCollectionFields(props: {\n  attributes?: Record<string, DBFieldAttribute>;\n  slug: string;\n  fields: AuthCollectionConfig[\"fields\"];\n  config?: BetterAuthOptions;\n  extractId?: boolean;\n}) {\n  if (!props.attributes) return;\n  for (const [fieldName, attr] of Object.entries(props.attributes)) {\n    if (props.extractId === true && fieldName === \"id\") continue;\n    const field = betterAuthAttrToVexField(\n      fieldName,\n      attr,\n      props.slug,\n      props?.config,\n    );\n    if (field) props.fields[fieldName] = field;\n  }\n}\n\n/**\n * Maps a single Better Auth `DBFieldAttribute` to a Vex field builder call.\n *\n * Handles all Better Auth scalar types: `string`, `boolean`, `number`, `date`,\n * `timestamp`, `json`, and enum arrays. Maps overlapping properties\n * (`required`, `defaultValue`, `unique`/`index`, `references`) to their\n * Vex equivalents. Sets `admin.readOnly` and `meta.locked` on system\n * fields, and `admin.hidden` on sensitive fields.\n *\n * @param fieldName — The field name from Better Auth.\n * @param attr — The Better Auth field attribute.\n * @param tableSlug — The collection slug (for relationship targets).\n * @param authOptions -- The betterAuth options\n * @returns A Vex field instance, or `null` if the type is unsupported.\n *\n * @internal\n */\nfunction betterAuthAttrToVexField(\n  fieldName: string,\n  attr: DBFieldAttribute,\n  tableSlug: string,\n  authOptions?: BetterAuthOptions,\n) {\n  // Skip id — Convex auto-generates _id\n  if (fieldName === \"id\") return null;\n\n  const isUserTable =\n    tableSlug === authOptions?.user?.modelName ||\n    tableSlug === \"user\" ||\n    tableSlug === \"users\";\n  const isEditable = isUserTable && EDITABLE_FIELDS.has(fieldName);\n  const isHidden = HIDDEN_FIELDS.has(fieldName);\n\n  const admin: FieldAdminConfigInput = {};\n  if (!isEditable) admin.readOnly = true;\n  if (isHidden) admin.hidden = true;\n\n  // eslint-disable-next-line @typescript-eslint/no-explicit-any\n  const baseOptions: { defaultValue: any } & BaseFieldInput<AuthFieldMeta> = {\n    defaultValue: undefined,\n  };\n  if (Object.keys(admin).length > 0) baseOptions.admin = admin;\n  if (!isEditable) baseOptions.meta = { locked: true };\n  if (attr.required) baseOptions.required = attr.required;\n  if (\n    attr.defaultValue !== undefined &&\n    typeof attr.defaultValue !== \"function\"\n  ) {\n    baseOptions.defaultValue = attr.defaultValue;\n  }\n  if (attr.unique || attr.index) {\n    baseOptions.index = `by_${fieldName}`;\n  }\n\n  if (attr.references) {\n    return text(baseOptions);\n  }\n\n  if (Array.isArray(attr.type)) {\n    return select({\n      options: attr.type.map((v: string) => ({ value: v, label: v })),\n      ...baseOptions,\n    });\n  }\n\n  switch (attr.type) {\n    case \"string\":\n      return text(baseOptions);\n    case \"string[]\":\n      return array({\n        ...baseOptions,\n        items: text(baseOptions),\n      });\n    case \"boolean\":\n      return checkbox(baseOptions);\n    case \"number\":\n      return number(baseOptions);\n    case \"number[]\":\n      return array({\n        ...baseOptions,\n        items: number(baseOptions),\n      });\n    case \"date\":\n      return date(baseOptions);\n    case \"json\":\n      // Fall back to text until a dedicated json field type is wired\n      // TODO: create json field\n      return text(baseOptions);\n    default:\n      // Unknown type — skip rather than crash\n      return null;\n  }\n}\n","import type { Where } from \"better-auth/types\";\nimport type { GenericActionCtx, GenericDataModel } from \"convex/server\";\nimport { anyApi } from \"convex/server\";\nimport {\n  createAdapterFactory,\n  type DBAdapterDebugLogOption,\n} from \"better-auth/adapters\";\nimport { getAuthTables } from \"better-auth/db\";\n\ntype ConvexCleanedWhere = Where & {\n  value: boolean | null | number | number[] | string | string[];\n};\n\nconst parseWhere = (where?: Where[]): ConvexCleanedWhere[] => {\n  return (where?.map((where) => {\n    if (where.value instanceof Date) {\n      return { ...where, value: where.value.getTime() };\n    }\n    return where;\n  }) ?? []) as ConvexCleanedWhere[];\n};\n\n/**\n * Creates the Convex database adapter for Better Auth.\n *\n * @param ctx - The Convex action context\n * @param config - Optional debug log configuration\n * @returns AdapterFactory<BetterAuthOptions>\n */\nexport function convexAdapter<DataModel extends GenericDataModel>(\n  ctx: GenericActionCtx<DataModel>,\n  config: { debugLogs?: DBAdapterDebugLogOption } = {},\n) {\n  return createAdapterFactory({\n    adapter: ({ options }) => {\n      options.telemetry = { enabled: false };\n      const betterAuthSchema = getAuthTables(options);\n      const betterAuthSchemaJson = JSON.stringify(betterAuthSchema);\n\n      return {\n        id: \"convex\",\n        options: { isRunMutationCtx: \"runMutation\" in ctx },\n\n        // Use anyApi to reference db operations, call via ctx.runMutation/ctx.runQuery\n        create: async ({ data, model, select }) => {\n          return await ctx.runMutation(anyApi.auth.db.dbCreate, {\n            betterAuthSchema: betterAuthSchemaJson,\n            data,\n            model,\n            select,\n          });\n        },\n\n        findOne: async ({ model, select, where }) => {\n          return await ctx.runQuery(anyApi.auth.db.dbFindOne, {\n            betterAuthSchema: betterAuthSchemaJson,\n            model,\n            select,\n            where: parseWhere(where),\n          });\n        },\n\n        findMany: async ({ limit, model, sortBy, where }) => {\n          return await ctx.runQuery(anyApi.auth.db.dbFindMany, {\n            betterAuthSchema: betterAuthSchemaJson,\n            limit,\n            model,\n            sortBy,\n            where: parseWhere(where),\n          });\n        },\n\n        count: async ({ model, where }) => {\n          return await ctx.runQuery(anyApi.auth.db.dbCount, {\n            betterAuthSchema: betterAuthSchemaJson,\n            model,\n            where: parseWhere(where),\n          });\n        },\n\n        update: async ({ model, update, where }) => {\n          return await ctx.runMutation(anyApi.auth.db.dbUpdate, {\n            betterAuthSchema: betterAuthSchemaJson,\n            model,\n            update,\n            where: parseWhere(where),\n          });\n        },\n\n        updateMany: async ({ model, update, where }) => {\n          return await ctx.runMutation(anyApi.auth.db.dbUpdateMany, {\n            betterAuthSchema: betterAuthSchemaJson,\n            model,\n            update,\n            where: parseWhere(where),\n          });\n        },\n\n        delete: async ({ model, where }) => {\n          return await ctx.runMutation(anyApi.auth.db.dbDelete, {\n            betterAuthSchema: betterAuthSchemaJson,\n            model,\n            where: parseWhere(where),\n          });\n        },\n\n        deleteMany: async ({ model, where }) => {\n          return await ctx.runMutation(anyApi.auth.db.dbDeleteMany, {\n            betterAuthSchema: betterAuthSchemaJson,\n            model,\n            where: parseWhere(where),\n          });\n        },\n\n        transaction: async () => {\n          throw new Error(\"Transactions not supported\");\n        },\n      };\n    },\n    config: {\n      adapterId: \"convex\",\n      adapterName: \"Convex Adapter\",\n      customTransformInput: ({ data, fieldAttributes }) =>\n        data && fieldAttributes.type === \"date\"\n          ? new Date(data).getTime()\n          : data,\n      customTransformOutput: ({ data, fieldAttributes }) =>\n        data && fieldAttributes.type === \"date\"\n          ? new Date(data).getTime()\n          : data,\n      debugLogs: config.debugLogs ?? false,\n      disableIdGeneration: true,\n      mapKeysTransformInput: { id: \"_id\" },\n      mapKeysTransformOutput: { _id: \"id\" },\n      supportsArrays: true,\n      supportsDates: false,\n      supportsJSON: true,\n      supportsNumericIds: false,\n      transaction: false,\n      usePlural: false,\n    },\n  });\n}\n","/* eslint-disable jsdoc/require-jsdoc */\nimport type { BetterAuthDBSchema } from \"better-auth/db\";\nimport type {\n  GenericQueryCtx,\n  GenericMutationCtx,\n  GenericDataModel,\n  SchemaDefinition,\n} from \"convex/server\";\nimport type { GenericId } from \"convex/values\";\n\nimport { v } from \"convex/values\";\n\nimport {\n  checkUniqueFields,\n  listOne,\n  paginate,\n  selectFields,\n  type WhereClause,\n} from \"./utils\";\n\n// Helper to get Better Auth schema - we'll pass it from the adapter\nconst getBetterAuthSchema = (schemaJson: string): BetterAuthDBSchema => {\n  return JSON.parse(schemaJson);\n};\n\ninterface CreateArgs {\n  betterAuthSchema: string;\n  data: any;\n  model: string;\n  select?: string[];\n}\n\nexport const create = {\n  args: {\n    betterAuthSchema: v.string(),\n    data: v.any(),\n    model: v.string(),\n    select: v.optional(v.array(v.string())),\n  },\n  handler: async (\n    ctx: GenericMutationCtx<GenericDataModel>,\n    { betterAuthSchema, data, model, select }: CreateArgs,\n    schema: SchemaDefinition<any, any>,\n  ) => {\n    const authSchema = getBetterAuthSchema(betterAuthSchema);\n\n    await checkUniqueFields(ctx, schema, authSchema, model, data as any);\n\n    const id = await ctx.db.insert(model as any, data as any);\n    const doc = await ctx.db.get(id);\n    if (!doc) {\n      throw new Error(`Failed to create ${model}`);\n    }\n\n    return selectFields(doc, select);\n  },\n};\n\ninterface FindOneArgs {\n  betterAuthSchema: string;\n  model: string;\n  select?: string[];\n  where: unknown[];\n}\n\nexport const findOne = {\n  args: {\n    betterAuthSchema: v.string(),\n    model: v.string(),\n    select: v.optional(v.array(v.string())),\n    where: v.array(v.any()),\n  },\n  handler: async (\n    ctx: GenericQueryCtx<GenericDataModel>,\n    { betterAuthSchema, model, select, where }: FindOneArgs,\n    schema: SchemaDefinition<any, any>,\n  ) => {\n    const authSchema = getBetterAuthSchema(betterAuthSchema);\n    const result = await listOne(ctx, schema, authSchema, {\n      model,\n      select,\n      where: where as WhereClause[],\n    });\n\n    return result;\n  },\n};\n\ninterface FindManyArgs {\n  betterAuthSchema: string;\n  limit?: number;\n  model: string;\n  sortBy?: { direction: \"asc\" | \"desc\"; field: string };\n  where?: unknown[];\n}\n\nexport const findMany = {\n  args: {\n    betterAuthSchema: v.string(),\n    limit: v.optional(v.number()),\n    model: v.string(),\n    sortBy: v.optional(\n      v.object({\n        direction: v.union(v.literal(\"asc\"), v.literal(\"desc\")),\n        field: v.string(),\n      }),\n    ),\n    where: v.optional(v.array(v.any())),\n  },\n  handler: async (\n    ctx: GenericQueryCtx<GenericDataModel>,\n    { betterAuthSchema, limit, model, sortBy, where }: FindManyArgs,\n    schema: SchemaDefinition<any, any>,\n  ) => {\n    const authSchema = getBetterAuthSchema(betterAuthSchema);\n    const parsedWhere = (where ?? []) as WhereClause[];\n\n    // Handle OR connector by running parallel queries\n    if (parsedWhere.some((w) => w.connector === \"OR\")) {\n      const results = await Promise.all(\n        parsedWhere.map(async (w) => {\n          const result = await paginate(ctx, schema, authSchema, {\n            model,\n            paginationOpts: { cursor: null, numItems: limit ?? 200 },\n            sortBy,\n            where: [w],\n          });\n          return result.page;\n        }),\n      );\n\n      // De-duplicate and flatten\n      const seen = new Set<string>();\n      const uniqueDocs: any[] = [];\n      for (const docs of results) {\n        for (const doc of docs) {\n          const docId = doc._id as string;\n          if (!seen.has(docId)) {\n            seen.add(docId);\n            uniqueDocs.push(doc);\n          }\n        }\n      }\n\n      // Apply sorting if needed\n      if (sortBy) {\n        uniqueDocs.sort((a, b) => {\n          const aVal = a[sortBy.field];\n          const bVal = b[sortBy.field];\n          if (aVal === bVal) {\n            return 0;\n          }\n          const comparison = aVal > bVal ? 1 : -1;\n          return sortBy.direction === \"desc\" ? -comparison : comparison;\n        });\n      }\n\n      return uniqueDocs.slice(0, limit);\n    }\n\n    // Normal case without OR\n    const result = await paginate(ctx, schema, authSchema, {\n      model,\n      paginationOpts: { cursor: null, numItems: limit ?? 200 },\n      sortBy,\n      where: parsedWhere,\n    });\n\n    return result.page;\n  },\n};\n\ninterface CountArgs {\n  betterAuthSchema: string;\n  model: string;\n  where?: unknown[];\n}\n\nexport const count = {\n  args: {\n    betterAuthSchema: v.string(),\n    model: v.string(),\n    where: v.optional(v.array(v.any())),\n  },\n  handler: async (\n    ctx: GenericQueryCtx<GenericDataModel>,\n    { betterAuthSchema, model, where }: CountArgs,\n    schema: SchemaDefinition<any, any>,\n  ) => {\n    const authSchema = getBetterAuthSchema(betterAuthSchema);\n    const parsedWhere = (where ?? []) as WhereClause[];\n\n    // Handle OR connector\n    if (parsedWhere.some((w) => w.connector === \"OR\")) {\n      const results = await Promise.all(\n        parsedWhere.map(async (w) => {\n          const result = await paginate(ctx, schema, authSchema, {\n            model,\n            paginationOpts: { cursor: null, numItems: 200 },\n            where: [w],\n          });\n          return result.page;\n        }),\n      );\n\n      // De-duplicate and count\n      const seen = new Set<string>();\n      for (const docs of results) {\n        for (const doc of docs) {\n          const docId = doc._id as string;\n          seen.add(docId);\n        }\n      }\n      return seen.size;\n    }\n\n    // Normal case\n    const result = await paginate(ctx, schema, authSchema, {\n      model,\n      paginationOpts: { cursor: null, numItems: 200 },\n      where: parsedWhere,\n    });\n\n    return result.page.length;\n  },\n};\n\ninterface UpdateArgs {\n  betterAuthSchema: string;\n  model: string;\n  update: any;\n  where: unknown[];\n}\n\nexport const update = {\n  args: {\n    betterAuthSchema: v.string(),\n    model: v.string(),\n    update: v.any(),\n    where: v.array(v.any()),\n  },\n  handler: async (\n    ctx: GenericMutationCtx<GenericDataModel>,\n    { betterAuthSchema, model, update, where }: UpdateArgs,\n    schema: SchemaDefinition<any, any>,\n  ) => {\n    const authSchema = getBetterAuthSchema(betterAuthSchema);\n    const parsedWhere = where as WhereClause[];\n\n    // Find the document to update\n    const doc = await listOne(ctx, schema, authSchema, {\n      model,\n      where: parsedWhere,\n    });\n\n    if (!doc) {\n      return null;\n    }\n\n    // Check unique fields before update\n    await checkUniqueFields(ctx, schema, authSchema, model, update as any, doc);\n\n    await ctx.db.patch(doc._id as GenericId<any>, update as any);\n    return await ctx.db.get(doc._id as GenericId<any>);\n  },\n};\n\n// Update many operation\nexport const updateMany = {\n  args: {\n    betterAuthSchema: v.string(),\n    model: v.string(),\n    update: v.any(),\n    where: v.array(v.any()),\n  },\n  handler: async (\n    ctx: GenericMutationCtx<GenericDataModel>,\n    { betterAuthSchema, model, update, where }: UpdateArgs,\n    schema: SchemaDefinition<any, any>,\n  ) => {\n    const authSchema = getBetterAuthSchema(betterAuthSchema);\n    const parsedWhere = where as WhereClause[];\n\n    const result = await paginate(ctx, schema, authSchema, {\n      model,\n      paginationOpts: { cursor: null, numItems: 200 },\n      where: parsedWhere,\n    });\n\n    // Check unique fields if updating multiple docs\n    if (result.page.length > 1) {\n      const uniqueFieldKeys = Object.keys(update as any).filter(\n        (key) => authSchema[model]?.fields?.[key]?.unique,\n      );\n      if (uniqueFieldKeys.length > 0) {\n        throw new Error(\n          `Attempted to set unique fields in multiple documents in ${model} with the same value. Fields: ${uniqueFieldKeys.join(\", \")}`,\n        );\n      }\n    }\n\n    // Update each document\n    for (const doc of result.page) {\n      await checkUniqueFields(\n        ctx,\n        schema,\n        authSchema,\n        model,\n        update as any,\n        doc,\n      );\n      await ctx.db.patch(doc._id as GenericId<any>, update as any);\n    }\n\n    return result.page.length;\n  },\n};\n\ninterface DeleteArgs {\n  betterAuthSchema: string;\n  model: string;\n  where: unknown[];\n}\n\nexport const deleteOne = {\n  args: {\n    betterAuthSchema: v.string(),\n    model: v.string(),\n    where: v.array(v.any()),\n  },\n  handler: async (\n    ctx: GenericMutationCtx<GenericDataModel>,\n    { betterAuthSchema, model, where }: DeleteArgs,\n    schema: SchemaDefinition<any, any>,\n  ) => {\n    const authSchema = getBetterAuthSchema(betterAuthSchema);\n    const parsedWhere = where as WhereClause[];\n\n    const doc = await listOne(ctx, schema, authSchema, {\n      model,\n      where: parsedWhere,\n    });\n\n    if (!doc) {\n      return;\n    }\n\n    await ctx.db.delete(doc._id as GenericId<any>);\n  },\n};\n\n// Delete many operation\nexport const deleteMany = {\n  args: {\n    betterAuthSchema: v.string(),\n    model: v.string(),\n    where: v.array(v.any()),\n  },\n  handler: async (\n    ctx: GenericMutationCtx<GenericDataModel>,\n    { betterAuthSchema, model, where }: DeleteArgs,\n    schema: SchemaDefinition<any, any>,\n  ) => {\n    const authSchema = getBetterAuthSchema(betterAuthSchema);\n    const parsedWhere = where as WhereClause[];\n\n    const result = await paginate(ctx, schema, authSchema, {\n      model,\n      paginationOpts: { cursor: null, numItems: 200 },\n      where: parsedWhere,\n    });\n\n    // Delete each document\n    for (const doc of result.page) {\n      await ctx.db.delete(doc._id as GenericId<any>);\n    }\n\n    return result.page.length;\n  },\n};\n","/**\n * asyncMap returns the results of applying an async function over an list.\n *\n * The list can even be a promise, or an iterable like a Set.\n * @param list - Iterable object of items, e.g. an Array, Set, Object.keys\n * @param asyncTransform\n * @returns\n */\nexport async function asyncMap(list, asyncTransform) {\n    const promises = [];\n    let index = 0;\n    list = await list;\n    for (const item of list) {\n        promises.push(asyncTransform(item, index));\n        index += 1;\n    }\n    return Promise.all(promises);\n}\n/**\n * Filters out null elements from an array.\n * @param list List of elements that might be null.\n * @returns List of elements with nulls removed.\n */\nexport function pruneNull(list) {\n    return list.filter((i) => i !== null);\n}\nexport class NullDocumentError extends Error {\n}\n/**\n * Throws if there is a null element in the array.\n * @param list List of elements that might have a null element.\n * @returns Same list of elements with a refined type.\n */\nexport function nullThrows(doc, message) {\n    if (doc === null) {\n        throw new NullDocumentError(message ?? \"Unexpected null document.\");\n    }\n    return doc;\n}\n/**\n * pick helps you pick keys from an object more concisely.\n *\n * e.g. `pick({a: v.string(), b: v.number()}, [\"a\"])` is equivalent to\n * `{a: v.string()}`\n * The alternative could be something like:\n * ```js\n * const obj = { a: v.string(), b: v.number() };\n * // pick does the following\n * const { a } = obj;\n * const onlyA = { a };\n * ```\n *\n * @param obj The object to pick from. Often like { a: v.string() }\n * @param keys The keys to pick from the object.\n * @returns A new object with only the keys you picked and their values.\n */\nexport function pick(obj, keys) {\n    return Object.fromEntries(Object.entries(obj).filter(([k]) => keys.includes(k)));\n}\n/**\n * omit helps you omit keys from an object more concisely.\n *\n * e.g. `omit({a: v.string(), b: v.number()}, [\"a\"])` is equivalent to\n * `{b: v.number()}`\n *\n * The alternative could be something like:\n * ```js\n * const obj = { a: v.string(), b: v.number() };\n * // omit does the following\n * const { a, ...rest } = obj;\n * const withoutA = rest;\n * ```\n *\n * @param obj The object to return a copy of without the specified keys.\n * @param keys The keys to omit from the object.\n * @returns A new object with the keys you omitted removed.\n */\nexport function omit(obj, keys) {\n    return Object.fromEntries(Object.entries(obj).filter(([k]) => !keys.includes(k)));\n}\n/**\n * Removes the _id and _creationTime fields from an object.\n * This enables easily cloning a Convex document like:\n * ```ts\n * const doc = await db.get(id);\n * const clone = withoutSystemFields(doc);\n * await db.insert(table, clone);\n * ```\n * @param obj The object to remove the _id and _creationTime fields from.\n * @returns A new object with the _id and _creationTime fields removed.\n */\nexport function withoutSystemFields(obj) {\n    return omit(obj, [\"_id\", \"_creationTime\"]);\n}\n// Type utils:\nconst _error = Symbol();\n/**\n * A utility to validate truthiness at runtime, providing a type guard\n *\n * @example\n * ```ts\n * const x: string | null = getValue();\n * assert(x);\n * // x is now of type string\n * ```\n * You can also provide a function, to avoid doing expensive string templating.\n * @param arg A value to assert the truthiness of.\n * @param message An optional message to throw if the value is not truthy, or a function to generate the message.\n */\nexport function assert(value, message) {\n    if (!value) {\n        throw new Error(typeof message === \"function\" ? message() : message);\n    }\n}\n","import { convexToJson, compareValues, jsonToConvex, getDocumentSize, } from \"convex/values\";\n// From https://docs.convex.dev/production/state/limits#transactions\nconst MAX_DOCUMENT_SCAN_LEN = 32000;\n// Value used to trigger page split suggestions. This is kind of\n// a backstop value to mitigate additional scans over the full\n// original range if documents change later. Making it smaller\n// would result in more splits (equal to the divisor) as the\n// number of documents scanned approaches the max.\nconst SOFT_MAX_SCAN_LEN = MAX_DOCUMENT_SCAN_LEN / 2;\n//\n// Helper functions\n//\nfunction makeExclusive(boundType) {\n    if (boundType === \"gt\" || boundType === \"gte\") {\n        return \"gt\";\n    }\n    return \"lt\";\n}\n/** Split a range query between two index keys into a series of range queries\n * that should be executed in sequence. This is necessary because Convex only\n * supports range queries of the form\n * q.eq(\"f1\", v).eq(\"f2\", v).lt(\"f3\", v).gt(\"f3\", v).\n * i.e. all fields must be equal except for the last field, which can have\n * two inequalities.\n *\n * For example, the range from >[1, 2, 3] to <=[1, 3, 2] would be split into\n * the following queries:\n * 1. q.eq(\"f1\", 1).eq(\"f2\", 2).gt(\"f3\", 3)\n * 2. q.eq(\"f1\", 1).gt(\"f2\", 2).lt(\"f2\", 3)\n * 3. q.eq(\"f1\", 1).eq(\"f2\", 3).lte(\"f3\", 2)\n */\nfunction splitRange(indexFields, \n// For descending queries, the resulting queries are reversed.\norder, startBound, endBound, startBoundType, endBoundType) {\n    // Three parts to the split:\n    // 1. reduce down from startBound to common prefix\n    // 2. range with common prefix\n    // 3. build back up from common prefix to endBound\n    const commonPrefix = [];\n    while (startBound.length > 0 &&\n        endBound.length > 0 &&\n        compareValues(startBound[0], endBound[0]) === 0) {\n        const indexField = indexFields[0];\n        indexFields = indexFields.slice(1);\n        const eqBound = startBound[0];\n        startBound = startBound.slice(1);\n        endBound = endBound.slice(1);\n        commonPrefix.push([\"eq\", indexField, eqBound]);\n    }\n    const makeCompare = (boundType, key) => {\n        const range = commonPrefix.slice();\n        let i = 0;\n        for (; i < key.length - 1; i++) {\n            range.push([\"eq\", indexFields[i], key[i]]);\n        }\n        if (i < key.length) {\n            range.push([boundType, indexFields[i], key[i]]);\n        }\n        return range;\n    };\n    // Stage 1.\n    const startRanges = [];\n    while (startBound.length > 1) {\n        startRanges.push(makeCompare(startBoundType, startBound));\n        startBoundType = makeExclusive(startBoundType);\n        startBound = startBound.slice(0, -1);\n    }\n    // Stage 3.\n    const endRanges = [];\n    while (endBound.length > 1) {\n        endRanges.push(makeCompare(endBoundType, endBound));\n        endBoundType = makeExclusive(endBoundType);\n        endBound = endBound.slice(0, -1);\n    }\n    endRanges.reverse();\n    // Stage 2.\n    let middleRange;\n    if (endBound.length === 0) {\n        middleRange = makeCompare(startBoundType, startBound);\n    }\n    else if (startBound.length === 0) {\n        middleRange = makeCompare(endBoundType, endBound);\n    }\n    else {\n        const startValue = startBound[0];\n        const endValue = endBound[0];\n        middleRange = commonPrefix.slice();\n        middleRange.push([startBoundType, indexFields[0], startValue]);\n        middleRange.push([endBoundType, indexFields[0], endValue]);\n    }\n    const ranges = [...startRanges, middleRange, ...endRanges];\n    if (order === \"desc\") {\n        ranges.reverse();\n    }\n    return ranges;\n}\nfunction rangeToQuery(range) {\n    return (q) => {\n        for (const [boundType, field, value] of range) {\n            q = q[boundType](field, value);\n        }\n        return q;\n    };\n}\n/**\n * Get the ordered list of fields for a given table's index based on the schema.\n *\n * - For \"by_creation_time\", returns [\"_creationTime\", \"_id\"].\n * - For \"by_id\", returns [\"_id\"].\n * - Otherwise, looks up the named index in the schema and returns its fields\n *   followed by [\"_creationTime\", \"_id\"].\n * e.g. for an index defined like `.index(\"abc\", [\"a\", \"b\"])`,\n * returns [\"a\", \"b\", \"_creationTime\", \"_id\"].\n */\nexport function getIndexFields(table, index, schema) {\n    const indexDescriptor = String(index ?? \"by_creation_time\");\n    if (indexDescriptor === \"by_creation_time\") {\n        return [\"_creationTime\", \"_id\"];\n    }\n    if (indexDescriptor === \"by_id\") {\n        return [\"_id\"];\n    }\n    if (!schema) {\n        throw new Error(\"schema is required to infer index fields\");\n    }\n    const tableInfo = schema.tables[table];\n    const indexInfo = tableInfo.indexes.find((index) => index.indexDescriptor === indexDescriptor);\n    if (!indexInfo) {\n        throw new Error(`Index ${indexDescriptor} not found in table ${table}`);\n    }\n    const fields = indexInfo.fields.slice();\n    fields.push(\"_creationTime\");\n    fields.push(\"_id\");\n    return fields;\n}\nfunction getIndexKey(doc, indexFields) {\n    const key = [];\n    for (const field of indexFields) {\n        let obj = doc;\n        for (const subfield of field.split(\".\")) {\n            obj = obj[subfield];\n        }\n        key.push(obj);\n    }\n    return key;\n}\n/**\n * A \"stream\" is an async iterable of query results, ordered by an index on a table.\n *\n * Use it as you would use `ctx.db`.\n * If using pagination in a reactive query, see the warnings on the `paginator`\n * function. TL;DR: you need to pass in `endCursor` to prevent holes or overlaps\n * between pages.\n *\n * Once you have a stream, you can use `mergeStreams` or `filterStream` to make\n * more streams. Then use `queryStream` to convert it into an OrderedQuery,\n * so you can call `.paginate()`, `.collect()`, etc.\n */\nexport function stream(db, schema) {\n    return new StreamDatabaseReader(db, schema);\n}\n/**\n * A \"QueryStream\" is an async iterable of query results, ordered by indexed fields.\n */\nexport class QueryStream {\n    /// Methods for creating new streams as modifications of the current stream.\n    /**\n     * Create a new stream with a TypeScript filter applied.\n     *\n     * This is similar to `db.query(tableName).filter(predicate)`, but it's more\n     * general because it can call arbitrary TypeScript code, including more\n     * database queries.\n     *\n     * All documents filtered out are still considered \"read\" from the database;\n     * they are just excluded from the output stream.\n     *\n     * In contrast to `filter` from convex-helpers/server/filter, this filterWith\n     * is applied *before* any pagination. That means if the filter excludes a lot\n     * of documents, the `.paginate()` method will read a lot of documents until\n     * it gets as many documents as it wants. If you run into issues with reading\n     * too much data, you can pass `maximumRowsRead` to `paginate()`.\n     */\n    filterWith(predicate) {\n        const order = this.getOrder();\n        return new FlatMapStream(this, async (doc) => {\n            const filtered = (await predicate(doc)) ? doc : null;\n            return new SingletonStream(filtered, order, [], [], []);\n        }, []);\n    }\n    /**\n     * Create a new stream where each element is the result of applying the mapper\n     * function to the elements of the original stream.\n     *\n     * Similar to how [1, 2, 3].map(x => x * 2) => [2, 4, 6]\n     */\n    map(mapper) {\n        const order = this.getOrder();\n        return new FlatMapStream(this, async (doc) => {\n            const mapped = await mapper(doc);\n            return new SingletonStream(mapped, order, [], [], []);\n        }, []);\n    }\n    /**\n     * Similar to flatMap on an array, but iterate over a stream, and the for each\n     * element, iterate over the stream created by the mapper function.\n     *\n     * Ordered by the original stream order, then the mapped stream. Similar to\n     * how [\"a\", \"b\"].flatMap(letter => [letter, letter]) => [\"a\", \"a\", \"b\", \"b\"]\n     *\n     * @param mapper A function that takes a document and returns a new stream.\n     * @param mappedIndexFields The index fields of the streams created by mapper.\n     * @returns A stream of documents returned by the mapper streams,\n     *   grouped by the documents in the original stream.\n     */\n    flatMap(mapper, mappedIndexFields) {\n        normalizeIndexFields(mappedIndexFields);\n        return new FlatMapStream(this, mapper, mappedIndexFields);\n    }\n    /**\n     * Get the first item from the original stream for each distinct value of the\n     * selected index fields.\n     *\n     * e.g. if the stream has an equality filter on `a`, and index fields `[a, b, c]`,\n     * we can do `stream.distinct([\"b\"])` to get a stream of the first item for\n     * each distinct value of `b`.\n     * Similarly, you could do `stream.distinct([\"a\", \"b\"])` with the same result,\n     * or `stream.distinct([\"a\", \"b\", \"c\"])` to get the original stream.\n     *\n     * This stream efficiently skips past items with the same value for the selected\n     * distinct index fields.\n     *\n     * This can be used to perform a loose index scan.\n     */\n    distinct(distinctIndexFields) {\n        return new DistinctStream(this, distinctIndexFields);\n    }\n    /// Implementation of OrderedQuery\n    filter(_predicate) {\n        throw new Error(\"Cannot call .filter() directly on a query stream. Use .filterWith() for filtering or .collect() if you want to convert the stream to an array first.\");\n    }\n    async paginate(opts) {\n        if (opts.numItems === 0) {\n            if (opts.cursor === null) {\n                throw new Error(\".paginate called with cursor of null and 0 for numItems. \" +\n                    \"This is not supported, as null is not a valid continueCursor. \" +\n                    \"Advice: avoid calling paginate entirely in these cases.\");\n            }\n            return {\n                page: [],\n                isDone: false,\n                continueCursor: opts.cursor,\n            };\n        }\n        const order = this.getOrder();\n        let newStartKey = {\n            key: [],\n            inclusive: true,\n        };\n        if (opts.cursor !== null) {\n            newStartKey = {\n                key: deserializeCursor(opts.cursor),\n                inclusive: false,\n            };\n        }\n        let newEndKey = {\n            key: [],\n            inclusive: true,\n        };\n        const maxRowsToRead = opts.maximumRowsRead;\n        let maxRows = opts.numItems;\n        if (opts.endCursor) {\n            newEndKey = {\n                key: deserializeCursor(opts.endCursor),\n                inclusive: true,\n            };\n            // If there's an endCursor, continue until we get there even if it's more\n            // than numItems.\n            maxRows = undefined;\n        }\n        const newLowerBound = order === \"asc\" ? newStartKey : newEndKey;\n        const newUpperBound = order === \"asc\" ? newEndKey : newStartKey;\n        const narrowStream = this.narrow({\n            lowerBound: newLowerBound.key,\n            lowerBoundInclusive: newLowerBound.inclusive,\n            upperBound: newUpperBound.key,\n            upperBoundInclusive: newUpperBound.inclusive,\n        });\n        const page = [];\n        const indexKeys = [];\n        let hasMore = opts.endCursor && opts.endCursor !== \"[]\";\n        let continueCursor = opts.endCursor ?? \"[]\";\n        const maxBytesToRead = opts.maximumBytesRead;\n        const trackBandwidth = maxBytesToRead !== undefined;\n        let totalBytesRead = 0;\n        let hitLimit = false;\n        for await (const [doc, indexKey, bandwidth] of narrowStream.iterWithKeys(trackBandwidth)) {\n            if (doc !== null) {\n                page.push(doc);\n            }\n            indexKeys.push(indexKey);\n            totalBytesRead += bandwidth;\n            if ((maxBytesToRead !== undefined && totalBytesRead >= maxBytesToRead) ||\n                (maxRowsToRead !== undefined && indexKeys.length >= maxRowsToRead)) {\n                hitLimit = true;\n            }\n            if (hitLimit || (maxRows !== undefined && page.length >= maxRows)) {\n                hasMore = true;\n                continueCursor = serializeCursor(indexKey);\n                break;\n            }\n        }\n        let pageStatus = undefined;\n        let splitCursor = undefined;\n        if (hitLimit) {\n            pageStatus = \"SplitRequired\";\n            splitCursor = indexKeys[Math.floor((indexKeys.length - 1) / 2)];\n        }\n        else if (indexKeys.length >= SOFT_MAX_SCAN_LEN ||\n            page.length > opts.numItems + 1) {\n            pageStatus = \"SplitRecommended\";\n            splitCursor = indexKeys[Math.floor((indexKeys.length - 1) / 2)];\n        }\n        return {\n            page,\n            isDone: !hasMore,\n            continueCursor,\n            pageStatus,\n            splitCursor: splitCursor ? serializeCursor(splitCursor) : undefined,\n        };\n    }\n    async collect() {\n        return await this.take(Infinity);\n    }\n    async take(n) {\n        const results = [];\n        for await (const [doc] of this.iterWithKeys()) {\n            if (doc === null) {\n                continue;\n            }\n            results.push(doc);\n            if (results.length === n) {\n                break;\n            }\n        }\n        return results;\n    }\n    async unique() {\n        const docs = await this.take(2);\n        if (docs.length === 2) {\n            throw new Error(\"Query is not unique\");\n        }\n        return docs[0] ?? null;\n    }\n    async first() {\n        const docs = await this.take(1);\n        return docs[0] ?? null;\n    }\n    [Symbol.asyncIterator]() {\n        const iterator = this.iterWithKeys()[Symbol.asyncIterator]();\n        return {\n            async next() {\n                const result = await iterator.next();\n                if (result.done) {\n                    return { done: true, value: undefined };\n                }\n                return { done: false, value: result.value[0] };\n            },\n        };\n    }\n}\nexport class StreamDatabaseReader {\n    db;\n    schema;\n    // TODO: support system tables\n    system;\n    constructor(db, schema) {\n        this.db = db;\n        this.schema = schema;\n        this.system = db.system;\n    }\n    query(tableName) {\n        return new StreamQueryInitializer(this, tableName);\n    }\n    get(_id) {\n        throw new Error(\"get() not supported for `paginator`\");\n    }\n    normalizeId(_tableName, _id) {\n        throw new Error(\"normalizeId() not supported for `paginator`.\");\n    }\n}\nexport class StreamableQuery extends QueryStream {\n}\nexport class StreamQueryInitializer extends StreamableQuery {\n    parent;\n    table;\n    constructor(parent, table) {\n        super();\n        this.parent = parent;\n        this.table = table;\n    }\n    fullTableScan() {\n        return this.withIndex(\"by_creation_time\");\n    }\n    withIndex(indexName, indexRange) {\n        const indexFields = getIndexFields(this.table, indexName, this.parent.schema);\n        const q = new ReflectIndexRange(indexFields);\n        if (indexRange) {\n            indexRange(q);\n        }\n        return new StreamQuery(this, indexName, q, indexRange);\n    }\n    withSearchIndex(_indexName, _searchFilter) {\n        throw new Error(\"Cannot paginate withSearchIndex\");\n    }\n    inner() {\n        return this.fullTableScan();\n    }\n    order(order) {\n        return this.inner().order(order);\n    }\n    reflect() {\n        return this.inner().reflect();\n    }\n    iterWithKeys(trackBandwidth = false) {\n        return this.inner().iterWithKeys(trackBandwidth);\n    }\n    getOrder() {\n        return this.inner().getOrder();\n    }\n    getEqualityIndexFilter() {\n        return this.inner().getEqualityIndexFilter();\n    }\n    getIndexFields() {\n        return this.inner().getIndexFields();\n    }\n    narrow(indexBounds) {\n        return this.inner().narrow(indexBounds);\n    }\n}\n// Not to be confused with QueryStream or StreamableQuery.\nexport class StreamQuery extends StreamableQuery {\n    parent;\n    index;\n    q;\n    indexRange;\n    constructor(parent, index, q, indexRange) {\n        super();\n        this.parent = parent;\n        this.index = index;\n        this.q = q;\n        this.indexRange = indexRange;\n    }\n    order(order) {\n        return new OrderedStreamQuery(this, order);\n    }\n    inner() {\n        return this.order(\"asc\");\n    }\n    reflect() {\n        return this.inner().reflect();\n    }\n    iterWithKeys(trackBandwidth = false) {\n        return this.inner().iterWithKeys(trackBandwidth);\n    }\n    getOrder() {\n        return this.inner().getOrder();\n    }\n    getEqualityIndexFilter() {\n        return this.inner().getEqualityIndexFilter();\n    }\n    getIndexFields() {\n        return this.inner().getIndexFields();\n    }\n    narrow(indexBounds) {\n        return this.inner().narrow(indexBounds);\n    }\n}\nexport class OrderedStreamQuery extends StreamableQuery {\n    parent;\n    order;\n    constructor(parent, order) {\n        super();\n        this.parent = parent;\n        this.order = order;\n    }\n    reflect() {\n        return {\n            db: this.parent.parent.parent.db,\n            schema: this.parent.parent.parent.schema,\n            table: this.parent.parent.table,\n            index: this.parent.index,\n            indexFields: this.parent.q.indexFields,\n            order: this.order,\n            bounds: {\n                lowerBound: this.parent.q.lowerBoundIndexKey ?? [],\n                lowerBoundInclusive: this.parent.q.lowerBoundInclusive,\n                upperBound: this.parent.q.upperBoundIndexKey ?? [],\n                upperBoundInclusive: this.parent.q.upperBoundInclusive,\n            },\n            indexRange: this.parent.indexRange,\n        };\n    }\n    /**\n     * inner() is as if you had used ctx.db to construct the query.\n     */\n    inner() {\n        const { db, table, index, order, indexRange } = this.reflect();\n        return db.query(table).withIndex(index, indexRange).order(order);\n    }\n    iterWithKeys(trackBandwidth = false) {\n        const { indexFields } = this.reflect();\n        const iterable = this.inner();\n        return {\n            [Symbol.asyncIterator]() {\n                const iterator = iterable[Symbol.asyncIterator]();\n                return {\n                    async next() {\n                        const result = await iterator.next();\n                        if (result.done) {\n                            return { done: true, value: undefined };\n                        }\n                        const doc = result.value;\n                        const bandwidth = trackBandwidth ? getDocumentSize(doc) : 0;\n                        return {\n                            done: false,\n                            value: [doc, getIndexKey(doc, indexFields), bandwidth],\n                        };\n                    },\n                };\n            },\n        };\n    }\n    getOrder() {\n        return this.order;\n    }\n    getEqualityIndexFilter() {\n        return this.parent.q.equalityIndexFilter;\n    }\n    getIndexFields() {\n        return this.parent.q.indexFields;\n    }\n    narrow(indexBounds) {\n        const { db, table, index, order, bounds, schema } = this.reflect();\n        let maxLowerBound = bounds.lowerBound;\n        let maxLowerBoundInclusive = bounds.lowerBoundInclusive;\n        if (compareKeys({\n            value: indexBounds.lowerBound,\n            kind: indexBounds.lowerBoundInclusive ? \"predecessor\" : \"successor\",\n        }, {\n            value: bounds.lowerBound,\n            kind: bounds.lowerBoundInclusive ? \"predecessor\" : \"successor\",\n        }) > 0) {\n            maxLowerBound = indexBounds.lowerBound;\n            maxLowerBoundInclusive = indexBounds.lowerBoundInclusive;\n        }\n        let minUpperBound = bounds.upperBound;\n        let minUpperBoundInclusive = bounds.upperBoundInclusive;\n        if (compareKeys({\n            value: indexBounds.upperBound,\n            kind: indexBounds.upperBoundInclusive ? \"successor\" : \"predecessor\",\n        }, {\n            value: bounds.upperBound,\n            kind: bounds.upperBoundInclusive ? \"successor\" : \"predecessor\",\n        }) < 0) {\n            minUpperBound = indexBounds.upperBound;\n            minUpperBoundInclusive = indexBounds.upperBoundInclusive;\n        }\n        return streamIndexRange(db, schema, table, index, {\n            lowerBound: maxLowerBound,\n            lowerBoundInclusive: maxLowerBoundInclusive,\n            upperBound: minUpperBound,\n            upperBoundInclusive: minUpperBoundInclusive,\n        }, order);\n    }\n}\n/**\n * Create a stream of documents using the given index and bounds.\n */\nexport function streamIndexRange(db, schema, table, index, bounds, order) {\n    const indexFields = getIndexFields(table, index, schema);\n    const splitBounds = splitRange(indexFields, order, bounds.lowerBound, bounds.upperBound, bounds.lowerBoundInclusive ? \"gte\" : \"gt\", bounds.upperBoundInclusive ? \"lte\" : \"lt\");\n    const subQueries = splitBounds.map((splitBound) => stream(db, schema)\n        .query(table)\n        .withIndex(index, rangeToQuery(splitBound))\n        .order(order));\n    return new ConcatStreams(...subQueries);\n}\nclass ReflectIndexRange {\n    indexFields;\n    #hasSuffix = false;\n    lowerBoundIndexKey = undefined;\n    lowerBoundInclusive = true;\n    upperBoundIndexKey = undefined;\n    upperBoundInclusive = true;\n    equalityIndexFilter = [];\n    constructor(indexFields) {\n        this.indexFields = indexFields;\n    }\n    eq(field, value) {\n        if (!this.#canLowerBound(field) || !this.#canUpperBound(field)) {\n            throw new Error(`Cannot use eq on field '${field}'`);\n        }\n        this.lowerBoundIndexKey = this.lowerBoundIndexKey ?? [];\n        this.lowerBoundIndexKey.push(value);\n        this.upperBoundIndexKey = this.upperBoundIndexKey ?? [];\n        this.upperBoundIndexKey.push(value);\n        this.equalityIndexFilter.push(value);\n        return this;\n    }\n    lt(field, value) {\n        if (!this.#canUpperBound(field)) {\n            throw new Error(`Cannot use lt on field '${field}'`);\n        }\n        this.upperBoundIndexKey = this.upperBoundIndexKey ?? [];\n        this.upperBoundIndexKey.push(value);\n        this.upperBoundInclusive = false;\n        this.#hasSuffix = true;\n        return this;\n    }\n    lte(field, value) {\n        if (!this.#canUpperBound(field)) {\n            throw new Error(`Cannot use lte on field '${field}'`);\n        }\n        this.upperBoundIndexKey = this.upperBoundIndexKey ?? [];\n        this.upperBoundIndexKey.push(value);\n        this.#hasSuffix = true;\n        return this;\n    }\n    gt(field, value) {\n        if (!this.#canLowerBound(field)) {\n            throw new Error(`Cannot use gt on field '${field}'`);\n        }\n        this.lowerBoundIndexKey = this.lowerBoundIndexKey ?? [];\n        this.lowerBoundIndexKey.push(value);\n        this.lowerBoundInclusive = false;\n        this.#hasSuffix = true;\n        return this;\n    }\n    gte(field, value) {\n        if (!this.#canLowerBound(field)) {\n            throw new Error(`Cannot use gte on field '${field}'`);\n        }\n        this.lowerBoundIndexKey = this.lowerBoundIndexKey ?? [];\n        this.lowerBoundIndexKey.push(value);\n        this.#hasSuffix = true;\n        return this;\n    }\n    #canLowerBound(field) {\n        const currentLowerBoundLength = this.lowerBoundIndexKey?.length ?? 0;\n        const currentUpperBoundLength = this.upperBoundIndexKey?.length ?? 0;\n        if (currentLowerBoundLength > currentUpperBoundLength) {\n            // Already have a lower bound.\n            return false;\n        }\n        if (currentLowerBoundLength === currentUpperBoundLength &&\n            this.#hasSuffix) {\n            // Already have a lower bound and an upper bound.\n            return false;\n        }\n        return (currentLowerBoundLength < this.indexFields.length &&\n            this.indexFields[currentLowerBoundLength] === field);\n    }\n    #canUpperBound(field) {\n        const currentLowerBoundLength = this.lowerBoundIndexKey?.length ?? 0;\n        const currentUpperBoundLength = this.upperBoundIndexKey?.length ?? 0;\n        if (currentUpperBoundLength > currentLowerBoundLength) {\n            // Already have an upper bound.\n            return false;\n        }\n        if (currentLowerBoundLength === currentUpperBoundLength &&\n            this.#hasSuffix) {\n            // Already have a lower bound and an upper bound.\n            return false;\n        }\n        return (currentUpperBoundLength < this.indexFields.length &&\n            this.indexFields[currentUpperBoundLength] === field);\n    }\n}\n/**\n * Merge multiple streams, provided in any order, into a single stream.\n *\n * The streams will be merged into a stream of documents ordered by the index keys,\n * i.e. by \"author\" (then by the implicit \"_creationTime\").\n *\n * e.g. ```ts\n * mergedStream([\n *   stream(db, schema).query(\"messages\").withIndex(\"by_author\", q => q.eq(\"author\", \"user3\")),\n *   stream(db, schema).query(\"messages\").withIndex(\"by_author\", q => q.eq(\"author\", \"user1\")),\n *   stream(db, schema).query(\"messages\").withIndex(\"by_author\", q => q.eq(\"author\", \"user2\")),\n * ], [\"author\"])\n * ```\n *\n * returns a stream of messages for user1, then user2, then user3.\n *\n * You can also use `orderByIndexFields` to change the indexed fields before merging, which changes the order of the merged stream.\n * This only works if the streams are already ordered by `orderByIndexFields`,\n * which happens if each does a .eq(field, value) on all index fields before `orderByIndexFields`.\n *\n * e.g. if the \"by_author\" index is defined as being ordered by [\"author\", \"_creationTime\"],\n * and each query does an equality lookup on \"author\", each individual query before merging is in fact ordered by \"_creationTime\".\n *\n * e.g. ```ts\n * mergedStream([\n *   stream(db, schema).query(\"messages\").withIndex(\"by_author\", q => q.eq(\"author\", \"user3\")),\n *   stream(db, schema).query(\"messages\").withIndex(\"by_author\", q => q.eq(\"author\", \"user1\")),\n *   stream(db, schema).query(\"messages\").withIndex(\"by_author\", q => q.eq(\"author\", \"user2\")),\n * ], [\"_creationTime\"])\n * ```\n *\n * This returns a stream of messages from all three users, sorted by creation time.\n */\nexport function mergedStream(streams, orderByIndexFields) {\n    return new MergedStream(streams, orderByIndexFields);\n}\nexport class MergedStream extends QueryStream {\n    #order;\n    #streams;\n    #equalityIndexFilter;\n    #indexFields;\n    constructor(streams, orderByIndexFields) {\n        super();\n        if (streams.length === 0) {\n            throw new Error(\"Cannot union empty array of streams\");\n        }\n        this.#order = allSame(streams.map((stream) => stream.getOrder()), \"Cannot merge streams with different orders\");\n        this.#streams = streams.map((stream) => new OrderByStream(stream, orderByIndexFields));\n        this.#indexFields = allSame(this.#streams.map((stream) => stream.getIndexFields()), \"Cannot merge streams with different index fields. Consider using .orderBy()\");\n        // Calculate common prefix of equality index filters.\n        this.#equalityIndexFilter = commonPrefix(this.#streams.map((stream) => stream.getEqualityIndexFilter()));\n    }\n    iterWithKeys(trackBandwidth = false) {\n        const iterables = this.#streams.map((stream) => stream.iterWithKeys(trackBandwidth));\n        const comparisonInversion = this.#order === \"asc\" ? 1 : -1;\n        return {\n            [Symbol.asyncIterator]() {\n                const iterators = iterables.map((iterable) => iterable[Symbol.asyncIterator]());\n                const results = Array(iterators.length);\n                // Track bandwidth from pre-fetched documents not yet yielded\n                const pendingBandwidth = Array(iterators.length).fill(0);\n                return {\n                    async next() {\n                        let bandwidthThisIteration = 0;\n                        // Fill results from iterators with no value yet.\n                        await Promise.all(iterators.map(async (iterator, i) => {\n                            if (!results[i]) {\n                                const result = await iterator.next();\n                                results[i] = result;\n                                // Track bandwidth from pre-fetched documents\n                                if (trackBandwidth && !result.done && result.value) {\n                                    pendingBandwidth[i] = result.value[2];\n                                }\n                            }\n                        }));\n                        // Sum all pending bandwidth (pre-fetched docs) for this iteration\n                        if (trackBandwidth) {\n                            for (let i = 0; i < pendingBandwidth.length; i++) {\n                                bandwidthThisIteration += pendingBandwidth[i];\n                                pendingBandwidth[i] = 0;\n                            }\n                        }\n                        // Find index for the value with the lowest index key.\n                        let minIndexKeyAndIndex = undefined;\n                        for (let i = 0; i < results.length; i++) {\n                            const result = results[i];\n                            if (result.done || !result.value) {\n                                continue;\n                            }\n                            const [_, resultIndexKey] = result.value;\n                            if (minIndexKeyAndIndex === undefined) {\n                                minIndexKeyAndIndex = [resultIndexKey, i];\n                                continue;\n                            }\n                            const [prevMin] = minIndexKeyAndIndex;\n                            if (compareKeys({ value: resultIndexKey, kind: \"exact\" }, { value: prevMin, kind: \"exact\" }) *\n                                comparisonInversion <\n                                0) {\n                                minIndexKeyAndIndex = [resultIndexKey, i];\n                            }\n                        }\n                        if (minIndexKeyAndIndex === undefined) {\n                            return { done: true, value: undefined };\n                        }\n                        const [_, minIndex] = minIndexKeyAndIndex;\n                        const [doc, indexKey] = results[minIndex].value;\n                        // indicate that we've used this result\n                        results[minIndex] = undefined;\n                        return {\n                            done: false,\n                            value: [doc, indexKey, bandwidthThisIteration],\n                        };\n                    },\n                };\n            },\n        };\n    }\n    getOrder() {\n        return this.#order;\n    }\n    getEqualityIndexFilter() {\n        return this.#equalityIndexFilter;\n    }\n    getIndexFields() {\n        return this.#indexFields;\n    }\n    narrow(indexBounds) {\n        return new MergedStream(this.#streams.map((stream) => stream.narrow(indexBounds)), this.#indexFields);\n    }\n}\nfunction allSame(values, errorMessage) {\n    const first = values[0];\n    for (const value of values) {\n        if (compareValues(value, first)) {\n            throw new Error(errorMessage);\n        }\n    }\n    return first;\n}\nfunction commonPrefix(values) {\n    let commonPrefix = values[0];\n    for (const value of values) {\n        for (let i = 0; i < commonPrefix.length; i++) {\n            if (i >= value.length || compareValues(commonPrefix[i], value[i])) {\n                commonPrefix = commonPrefix.slice(0, i);\n                break;\n            }\n        }\n    }\n    return commonPrefix;\n}\n/**\n * Concatenate multiple streams into a single stream.\n * This assumes that the streams correspond to disjoint index ranges,\n * and are provided in the same order as the index ranges.\n *\n * e.g. ```ts\n * new ConcatStreams(\n *   stream(db, schema).query(\"messages\").withIndex(\"by_author\", q => q.eq(\"author\", \"user1\")),\n *   stream(db, schema).query(\"messages\").withIndex(\"by_author\", q => q.eq(\"author\", \"user2\")),\n * )\n * ```\n *\n * is valid, but if the stream arguments were reversed, or the queries were\n * `.order(\"desc\")`, it would be invalid.\n *\n * It's not recommended to use `ConcatStreams` directly, since it has the same\n * behavior as `MergedStream`, but with fewer runtime checks.\n */\nclass ConcatStreams extends QueryStream {\n    #order;\n    #streams;\n    #equalityIndexFilter;\n    #indexFields;\n    constructor(...streams) {\n        super();\n        this.#streams = streams;\n        if (streams.length === 0) {\n            throw new Error(\"Cannot concat empty array of streams\");\n        }\n        this.#order = allSame(streams.map((stream) => stream.getOrder()), \"Cannot concat streams with different orders. Consider using .orderBy()\");\n        this.#indexFields = allSame(streams.map((stream) => stream.getIndexFields()), \"Cannot concat streams with different index fields. Consider using .orderBy()\");\n        this.#equalityIndexFilter = commonPrefix(streams.map((stream) => stream.getEqualityIndexFilter()));\n    }\n    iterWithKeys(trackBandwidth = false) {\n        const iterables = this.#streams.map((stream) => stream.iterWithKeys(trackBandwidth));\n        const comparisonInversion = this.#order === \"asc\" ? 1 : -1;\n        let previousIndexKey = undefined;\n        return {\n            [Symbol.asyncIterator]() {\n                const iterators = iterables.map((iterable) => iterable[Symbol.asyncIterator]());\n                return {\n                    async next() {\n                        while (iterators.length > 0) {\n                            const result = await iterators[0].next();\n                            if (result.done) {\n                                iterators.shift();\n                            }\n                            else {\n                                const [_, indexKey] = result.value;\n                                if (previousIndexKey !== undefined &&\n                                    compareKeys({\n                                        value: previousIndexKey,\n                                        kind: \"exact\",\n                                    }, {\n                                        value: indexKey,\n                                        kind: \"exact\",\n                                    }) *\n                                        comparisonInversion >\n                                        0) {\n                                    throw new Error(`ConcatStreams in wrong order: ${JSON.stringify(previousIndexKey)}, ${JSON.stringify(indexKey)}`);\n                                }\n                                previousIndexKey = indexKey;\n                                return result;\n                            }\n                        }\n                        return { done: true, value: undefined };\n                    },\n                };\n            },\n        };\n    }\n    getOrder() {\n        return this.#order;\n    }\n    getEqualityIndexFilter() {\n        return this.#equalityIndexFilter;\n    }\n    getIndexFields() {\n        return this.#indexFields;\n    }\n    narrow(indexBounds) {\n        return new ConcatStreams(...this.#streams.map((stream) => stream.narrow(indexBounds)));\n    }\n}\nclass FlatMapStreamIterator {\n    #outerStream;\n    #outerIterator;\n    #currentOuterItem = null;\n    #mapper;\n    #mappedIndexFields;\n    #trackBandwidth;\n    constructor(outerStream, mapper, mappedIndexFields, trackBandwidth) {\n        this.#outerIterator = outerStream\n            .iterWithKeys(trackBandwidth)[Symbol.asyncIterator]();\n        this.#outerStream = outerStream;\n        this.#mapper = mapper;\n        this.#mappedIndexFields = mappedIndexFields;\n        this.#trackBandwidth = trackBandwidth;\n    }\n    singletonSkipInnerStream() {\n        // If the outer stream is a filtered value, yield a singleton\n        // filtered value from the inner stream, with index key of nulls.\n        const indexKey = this.#mappedIndexFields.map(() => null);\n        return new SingletonStream(null, this.#outerStream.getOrder(), this.#mappedIndexFields, indexKey, indexKey);\n    }\n    async setCurrentOuterItem(item) {\n        const [t, indexKey, bandwidth] = item;\n        let innerStream;\n        if (t === null) {\n            innerStream = this.singletonSkipInnerStream();\n        }\n        else {\n            innerStream = await this.#mapper(t);\n            if (!equalIndexFields(innerStream.getIndexFields(), this.#mappedIndexFields)) {\n                throw new Error(`FlatMapStream: inner stream has different index fields than expected: ${JSON.stringify(innerStream.getIndexFields())} vs ${JSON.stringify(this.#mappedIndexFields)}`);\n            }\n            if (innerStream.getOrder() !== this.#outerStream.getOrder()) {\n                throw new Error(`FlatMapStream: inner stream has different order than outer stream: ${innerStream.getOrder()} vs ${this.#outerStream.getOrder()}`);\n            }\n        }\n        this.#currentOuterItem = {\n            t,\n            indexKey,\n            innerIterator: innerStream\n                .iterWithKeys(this.#trackBandwidth)[Symbol.asyncIterator](),\n            count: 0,\n            bandwidth,\n        };\n    }\n    async next() {\n        if (this.#currentOuterItem === null) {\n            const result = await this.#outerIterator.next();\n            if (result.done) {\n                return { done: true, value: undefined };\n            }\n            await this.setCurrentOuterItem(result.value);\n            return await this.next();\n        }\n        const result = await this.#currentOuterItem.innerIterator.next();\n        if (result.done) {\n            if (this.#currentOuterItem.count > 0) {\n                this.#currentOuterItem = null;\n            }\n            else {\n                // The inner stream was completely empty, so we should inject a null\n                // (which will be skipped by everything except the maximumRowsRead count)\n                // to account for the cost of the outer stream.\n                this.#currentOuterItem.innerIterator = this.singletonSkipInnerStream()\n                    .iterWithKeys(this.#trackBandwidth)[Symbol.asyncIterator]();\n            }\n            return await this.next();\n        }\n        const [u, indexKey, innerBandwidth] = result.value;\n        this.#currentOuterItem.count++;\n        const fullIndexKey = [...this.#currentOuterItem.indexKey, ...indexKey];\n        // On first yield for this outer item, include outer bandwidth\n        const bandwidth = (this.#currentOuterItem.count === 1\n            ? this.#currentOuterItem.bandwidth\n            : 0) + innerBandwidth;\n        return { done: false, value: [u, fullIndexKey, bandwidth] };\n    }\n}\nclass FlatMapStream extends QueryStream {\n    #stream;\n    #mapper;\n    #mappedIndexFields;\n    constructor(stream, mapper, mappedIndexFields) {\n        super();\n        this.#stream = stream;\n        this.#mapper = mapper;\n        this.#mappedIndexFields = mappedIndexFields;\n    }\n    iterWithKeys(trackBandwidth = false) {\n        const outerStream = this.#stream;\n        const mapper = this.#mapper;\n        const mappedIndexFields = this.#mappedIndexFields;\n        return {\n            [Symbol.asyncIterator]() {\n                return new FlatMapStreamIterator(outerStream, mapper, mappedIndexFields, trackBandwidth);\n            },\n        };\n    }\n    getOrder() {\n        return this.#stream.getOrder();\n    }\n    getEqualityIndexFilter() {\n        return this.#stream.getEqualityIndexFilter();\n    }\n    getIndexFields() {\n        return [...this.#stream.getIndexFields(), ...this.#mappedIndexFields];\n    }\n    narrow(indexBounds) {\n        const outerLength = this.#stream.getIndexFields().length;\n        const outerLowerBound = indexBounds.lowerBound.slice(0, outerLength);\n        const outerUpperBound = indexBounds.upperBound.slice(0, outerLength);\n        const innerLowerBound = indexBounds.lowerBound.slice(outerLength);\n        const innerUpperBound = indexBounds.upperBound.slice(outerLength);\n        const outerIndexBounds = {\n            lowerBound: outerLowerBound,\n            lowerBoundInclusive: innerLowerBound.length === 0 ? indexBounds.lowerBoundInclusive : true,\n            upperBound: outerUpperBound,\n            upperBoundInclusive: innerUpperBound.length === 0 ? indexBounds.upperBoundInclusive : true,\n        };\n        const innerIndexBounds = {\n            lowerBound: innerLowerBound,\n            lowerBoundInclusive: innerLowerBound.length === 0 ? true : indexBounds.lowerBoundInclusive,\n            upperBound: innerUpperBound,\n            upperBoundInclusive: innerUpperBound.length === 0 ? true : indexBounds.upperBoundInclusive,\n        };\n        return new FlatMapStream(this.#stream.narrow(outerIndexBounds), async (t) => {\n            const innerStream = await this.#mapper(t);\n            return innerStream.narrow(innerIndexBounds);\n        }, this.#mappedIndexFields);\n    }\n}\nexport class SingletonStream extends QueryStream {\n    #value;\n    #order;\n    #indexFields;\n    #indexKey;\n    #equalityIndexFilter;\n    #bandwidth;\n    constructor(value, order = \"asc\", indexFields, indexKey, equalityIndexFilter, bandwidth = 0) {\n        super();\n        this.#value = value;\n        this.#order = order;\n        this.#indexFields = indexFields;\n        this.#indexKey = indexKey;\n        this.#equalityIndexFilter = equalityIndexFilter;\n        this.#bandwidth = bandwidth;\n        if (indexKey.length !== indexFields.length) {\n            throw new Error(`indexKey must have the same length as indexFields: ${JSON.stringify(indexKey)} vs ${JSON.stringify(indexFields)}`);\n        }\n    }\n    iterWithKeys(_trackBandwidth = false) {\n        const value = this.#value;\n        const indexKey = this.#indexKey;\n        const bandwidth = this.#bandwidth;\n        return {\n            [Symbol.asyncIterator]() {\n                let sent = false;\n                return {\n                    async next() {\n                        if (sent) {\n                            return { done: true, value: undefined };\n                        }\n                        sent = true;\n                        return {\n                            done: false,\n                            value: [value, indexKey, bandwidth],\n                        };\n                    },\n                };\n            },\n        };\n    }\n    getOrder() {\n        return this.#order;\n    }\n    getIndexFields() {\n        return this.#indexFields;\n    }\n    getEqualityIndexFilter() {\n        return this.#equalityIndexFilter;\n    }\n    narrow(indexBounds) {\n        const compareLowerBound = compareKeys({\n            value: indexBounds.lowerBound,\n            kind: indexBounds.lowerBoundInclusive ? \"exact\" : \"successor\",\n        }, {\n            value: this.#indexKey,\n            kind: \"exact\",\n        });\n        const compareUpperBound = compareKeys({\n            value: this.#indexKey,\n            kind: \"exact\",\n        }, {\n            value: indexBounds.upperBound,\n            kind: indexBounds.upperBoundInclusive ? \"exact\" : \"predecessor\",\n        });\n        // If lowerBound <= this.indexKey <= upperBound, return this.value\n        if (compareLowerBound <= 0 && compareUpperBound <= 0) {\n            return new SingletonStream(this.#value, this.#order, this.#indexFields, this.#indexKey, this.#equalityIndexFilter);\n        }\n        return new EmptyStream(this.#order, this.#indexFields);\n    }\n}\n/**\n * This is a completely empty stream that yields no values, and in particular\n * does not count towards maximumRowsRead.\n * Compare to SingletonStream(null, ...), which yields no values but does count\n * towards maximumRowsRead.\n */\nexport class EmptyStream extends QueryStream {\n    #order;\n    #indexFields;\n    constructor(order, indexFields) {\n        super();\n        this.#order = order;\n        this.#indexFields = indexFields;\n    }\n    iterWithKeys(_trackBandwidth = false) {\n        return {\n            [Symbol.asyncIterator]() {\n                return {\n                    async next() {\n                        return { done: true, value: undefined };\n                    },\n                };\n            },\n        };\n    }\n    getOrder() {\n        return this.#order;\n    }\n    getIndexFields() {\n        return this.#indexFields;\n    }\n    getEqualityIndexFilter() {\n        return [];\n    }\n    narrow(_indexBounds) {\n        return this;\n    }\n}\nfunction normalizeIndexFields(indexFields) {\n    // Append _creationTime and _id to the index fields if they're not already there\n    if (!indexFields.includes(\"_creationTime\")) {\n        // With one exception: if indexFields is [\"_id\"], we don't need to add _creationTime\n        if (indexFields.length !== 1 || indexFields[0] !== \"_id\") {\n            indexFields.push(\"_creationTime\");\n        }\n    }\n    if (!indexFields.includes(\"_id\")) {\n        indexFields.push(\"_id\");\n    }\n}\n// Given a stream ordered by `indexFields`, where the first `equalityIndexLength`\n// fields are bounded by equality filters, return a generator of the possible\n// index fields used for ordering.\nfunction* getOrderingIndexFields(stream) {\n    const streamEqualityIndexLength = stream.getEqualityIndexFilter().length;\n    const streamIndexFields = stream.getIndexFields();\n    for (let i = 0; i <= streamEqualityIndexLength; i++) {\n        yield streamIndexFields.slice(i);\n    }\n}\nclass OrderByStream extends QueryStream {\n    #staticFilter;\n    #stream;\n    #indexFields;\n    constructor(stream, indexFields) {\n        super();\n        this.#stream = stream;\n        this.#indexFields = indexFields;\n        normalizeIndexFields(this.#indexFields);\n        // indexFields must be a suffix of the stream's index fields, and include\n        // all of the non-equality index fields.\n        const streamIndexFields = stream.getIndexFields();\n        const orderingIndexFields = Array.from(getOrderingIndexFields(stream));\n        if (!orderingIndexFields.some((orderingIndexFields) => equalIndexFields(orderingIndexFields, indexFields))) {\n            throw new Error(`indexFields must be some sequence of fields the stream is ordered by: ${JSON.stringify(indexFields)}, ${JSON.stringify(streamIndexFields)} (${stream.getEqualityIndexFilter().length} equality fields)`);\n        }\n        this.#staticFilter = stream\n            .getEqualityIndexFilter()\n            .slice(0, streamIndexFields.length - indexFields.length);\n    }\n    getOrder() {\n        return this.#stream.getOrder();\n    }\n    getEqualityIndexFilter() {\n        return this.#stream\n            .getEqualityIndexFilter()\n            .slice(this.#staticFilter.length);\n    }\n    getIndexFields() {\n        return this.#indexFields;\n    }\n    iterWithKeys(trackBandwidth = false) {\n        const iterable = this.#stream.iterWithKeys(trackBandwidth);\n        const staticFilter = this.#staticFilter;\n        return {\n            [Symbol.asyncIterator]() {\n                const iterator = iterable[Symbol.asyncIterator]();\n                return {\n                    async next() {\n                        const result = await iterator.next();\n                        if (result.done) {\n                            return result;\n                        }\n                        const [doc, indexKey, bandwidth] = result.value;\n                        return {\n                            done: false,\n                            value: [doc, indexKey.slice(staticFilter.length), bandwidth],\n                        };\n                    },\n                };\n            },\n        };\n    }\n    narrow(indexBounds) {\n        return new OrderByStream(this.#stream.narrow({\n            lowerBound: [...this.#staticFilter, ...indexBounds.lowerBound],\n            lowerBoundInclusive: indexBounds.lowerBoundInclusive,\n            upperBound: [...this.#staticFilter, ...indexBounds.upperBound],\n            upperBoundInclusive: indexBounds.upperBoundInclusive,\n        }), this.#indexFields);\n    }\n}\nclass DistinctStream extends QueryStream {\n    #distinctIndexFieldsLength;\n    #stream;\n    #distinctIndexFields;\n    constructor(stream, distinctIndexFields) {\n        super();\n        this.#stream = stream;\n        this.#distinctIndexFields = distinctIndexFields;\n        // distinctIndexFields must be a prefix of the stream's ordering index fields\n        let distinctIndexFieldsLength = undefined;\n        for (const orderingIndexFields of getOrderingIndexFields(stream)) {\n            const prefix = orderingIndexFields.slice(0, distinctIndexFields.length);\n            if (equalIndexFields(prefix, distinctIndexFields)) {\n                const equalityLength = stream.getIndexFields().length - orderingIndexFields.length;\n                distinctIndexFieldsLength = equalityLength + distinctIndexFields.length;\n                break;\n            }\n        }\n        if (distinctIndexFieldsLength === undefined) {\n            throw new Error(`distinctIndexFields must be a prefix of the stream's ordering index fields: ${JSON.stringify(distinctIndexFields)}, ${JSON.stringify(stream.getIndexFields())} (${stream.getEqualityIndexFilter().length} equality fields)`);\n        }\n        this.#distinctIndexFieldsLength = distinctIndexFieldsLength;\n    }\n    iterWithKeys(trackBandwidth = false) {\n        const stream = this.#stream;\n        const distinctIndexFieldsLength = this.#distinctIndexFieldsLength;\n        return {\n            [Symbol.asyncIterator]() {\n                let currentStream = stream;\n                let currentIterator = currentStream\n                    .iterWithKeys(trackBandwidth)[Symbol.asyncIterator]();\n                return {\n                    async next() {\n                        const result = await currentIterator.next();\n                        if (result.done) {\n                            return { done: true, value: undefined };\n                        }\n                        const [doc, indexKey, bandwidth] = result.value;\n                        if (doc === null) {\n                            // If the original stream has a post-filter `.filterWith`, we will\n                            // iterate over filtered items -- possibly many with the same set of\n                            // distinct index fields -- before finding the first item for the set\n                            // of distinct index fields.\n                            // So it's recommended to put `.filterWith` after `.distinct`.\n                            return {\n                                done: false,\n                                value: [null, indexKey, bandwidth],\n                            };\n                        }\n                        const distinctIndexKey = indexKey.slice(0, distinctIndexFieldsLength);\n                        if (stream.getOrder() === \"asc\") {\n                            currentStream = currentStream.narrow({\n                                lowerBound: distinctIndexKey,\n                                lowerBoundInclusive: false,\n                                upperBound: [],\n                                upperBoundInclusive: true,\n                            });\n                        }\n                        else {\n                            currentStream = currentStream.narrow({\n                                lowerBound: [],\n                                lowerBoundInclusive: true,\n                                upperBound: distinctIndexKey,\n                                upperBoundInclusive: false,\n                            });\n                        }\n                        currentIterator = currentStream\n                            .iterWithKeys(trackBandwidth)[Symbol.asyncIterator]();\n                        return result;\n                    },\n                };\n            },\n        };\n    }\n    narrow(indexBounds) {\n        const indexBoundsPrefix = {\n            ...indexBounds,\n            lowerBound: indexBounds.lowerBound.slice(0, this.#distinctIndexFieldsLength),\n            upperBound: indexBounds.upperBound.slice(0, this.#distinctIndexFieldsLength),\n        };\n        return new DistinctStream(this.#stream.narrow(indexBoundsPrefix), this.#distinctIndexFields);\n    }\n    getOrder() {\n        return this.#stream.getOrder();\n    }\n    getIndexFields() {\n        return this.#stream.getIndexFields();\n    }\n    getEqualityIndexFilter() {\n        return this.#stream.getEqualityIndexFilter();\n    }\n}\nfunction equalIndexFields(indexFields1, indexFields2) {\n    if (indexFields1.length !== indexFields2.length) {\n        return false;\n    }\n    for (let i = 0; i < indexFields1.length; i++) {\n        if (indexFields1[i] !== indexFields2[i]) {\n            return false;\n        }\n    }\n    return true;\n}\nfunction getValueAtIndex(v, index) {\n    if (index >= v.length) {\n        return undefined;\n    }\n    return { kind: \"found\", value: v[index] };\n}\nfunction compareDanglingSuffix(shorterKeyKind, longerKeyKind, shorterKey, longerKey) {\n    if (shorterKeyKind === \"exact\" && longerKeyKind === \"exact\") {\n        throw new Error(`Exact keys are not the same length:  ${JSON.stringify(shorterKey.value)}, ${JSON.stringify(longerKey.value)}`);\n    }\n    if (shorterKeyKind === \"exact\") {\n        throw new Error(`Exact key is shorter than prefix: ${JSON.stringify(shorterKey.value)}, ${JSON.stringify(longerKey.value)}`);\n    }\n    if (shorterKeyKind === \"predecessor\" && longerKeyKind === \"successor\") {\n        // successor is longer than predecessor, so it is bigger\n        return -1;\n    }\n    if (shorterKeyKind === \"successor\" && longerKeyKind === \"predecessor\") {\n        // successor is shorter than predecessor, so it is larger\n        return 1;\n    }\n    if (shorterKeyKind === \"predecessor\" && longerKeyKind === \"predecessor\") {\n        // predecessor of [2, 3] contains [2, 1] while predecessor of [2] doesn't, so longer predecessors are larger\n        return -1;\n    }\n    if (shorterKeyKind === \"successor\" && longerKeyKind === \"successor\") {\n        // successor of [2, 3] contains [2, 4] while successor of [2] doesn't, so longer successors are smaller\n        return 1;\n    }\n    if (shorterKeyKind === \"predecessor\" && longerKeyKind === \"exact\") {\n        return -1;\n    }\n    if (shorterKeyKind === \"successor\" && longerKeyKind === \"exact\") {\n        return 1;\n    }\n    throw new Error(`Unexpected key kinds: ${shorterKeyKind}, ${longerKeyKind}`);\n}\nfunction compareKeys(key1, key2) {\n    let i = 0;\n    while (i < Math.max(key1.value.length, key2.value.length)) {\n        const v1 = getValueAtIndex(key1.value, i);\n        const v2 = getValueAtIndex(key2.value, i);\n        if (v1 === undefined) {\n            return compareDanglingSuffix(key1.kind, key2.kind, key1, key2);\n        }\n        if (v2 === undefined) {\n            return -1 * compareDanglingSuffix(key2.kind, key1.kind, key2, key1);\n        }\n        const result = compareValues(v1.value, v2.value);\n        if (result !== 0) {\n            return result;\n        }\n        // if the prefixes are the same so far, keep going with the comparison\n        i++;\n    }\n    if (key1.kind === key2.kind) {\n        return 0;\n    }\n    // keys are the same length and values\n    if (key1.kind === \"exact\") {\n        if (key2.kind === \"successor\") {\n            return -1;\n        }\n        else {\n            return 1;\n        }\n    }\n    if (key1.kind === \"predecessor\") {\n        return -1;\n    }\n    if (key1.kind === \"successor\") {\n        return 1;\n    }\n    // Note: we're being cautious here, but we aren't checking above that the type\n    // of key2.kind is valid...\n    throw new Error(`Unexpected key kind: ${key1.kind}`);\n}\nfunction serializeCursor(key) {\n    return JSON.stringify(convexToJson(key.map((v) => v === undefined\n        ? \"undefined\"\n        : typeof v === \"string\" && v.endsWith(\"undefined\")\n            ? // in the unlikely case their string was \"undefined\"\n                // or \"_undefined\" etc, we escape it.\n                \"_\" + v\n            : v)));\n}\nfunction deserializeCursor(cursor) {\n    return jsonToConvex(JSON.parse(cursor)).map((v) => {\n        if (typeof v === \"string\") {\n            if (v === \"undefined\") {\n                // This is a special case for the undefined value.\n                // It's not a valid value in the index, but it's a valid value in the\n                // cursor.\n                return undefined;\n            }\n            if (v.endsWith(\"undefined\")) {\n                // in the unlikely case their string was \"undefined\" it was changed to\n                // \"_undefined\" in the serialization process.\n                // NB: if their string was \"_undefined\" it was changed to\n                // \"__undefined\" in the serialization process, and so on.\n                return v.slice(1);\n            }\n        }\n        return v;\n    });\n}\n","/* eslint-disable jsdoc/require-jsdoc */\nimport type { BetterAuthDBSchema } from \"better-auth/db\";\nimport type {\n  DocumentByName,\n  GenericDataModel,\n  GenericQueryCtx,\n  PaginationOptions,\n  PaginationResult,\n  SchemaDefinition,\n  TableNamesInDataModel,\n} from \"convex/server\";\nimport type { GenericId } from \"convex/values\";\n\nimport { asyncMap } from \"convex-helpers\";\nimport { mergedStream, stream } from \"convex-helpers/server/stream\";\n\nexport type QueryArgs = {\n  limit?: number;\n  model: string;\n  offset?: number;\n  select?: string[];\n  sortBy?: {\n    direction: \"asc\" | \"desc\";\n    field: string;\n  };\n  where?: WhereClause[];\n};\n\nexport type WhereClause = {\n  connector?: \"AND\" | \"OR\";\n  field: string;\n  operator?:\n    | \"contains\"\n    | \"ends_with\"\n    | \"eq\"\n    | \"gt\"\n    | \"gte\"\n    | \"in\"\n    | \"lt\"\n    | \"lte\"\n    | \"ne\"\n    | \"not_in\"\n    | \"starts_with\";\n  value: boolean | null | number | number[] | string | string[];\n};\n\nexport const isUniqueField = (\n  betterAuthSchema: BetterAuthDBSchema,\n  model: string,\n  field: string,\n): boolean => {\n  const fields = betterAuthSchema[model]?.fields;\n  if (!fields) {\n    return false;\n  }\n  return Object.entries(fields)\n    .filter(([, value]) => value.unique)\n    .map(([key]) => key)\n    .includes(field);\n};\n\nexport const hasUniqueFields = (\n  betterAuthSchema: BetterAuthDBSchema,\n  model: string,\n  input: Record<string, any>,\n): boolean => {\n  for (const field of Object.keys(input)) {\n    if (isUniqueField(betterAuthSchema, model, field)) {\n      return true;\n    }\n  }\n  return false;\n};\n\nexport const findIndex = (\n  schema: SchemaDefinition<any, any>,\n  args: QueryArgs,\n) => {\n  if (\n    (args.where?.length ?? 0) > 1 &&\n    args.where?.some((w) => w.connector === \"OR\")\n  ) {\n    throw new Error(\n      `OR connector not supported with multiple where statements in findIndex, split up the where statements before calling findIndex: ${JSON.stringify(args.where)}`,\n    );\n  }\n  const where = args.where?.filter((w) => {\n    return (\n      (!w.operator ||\n        [\"eq\", \"gt\", \"gte\", \"in\", \"lt\", \"lte\", \"not_in\"].includes(\n          w.operator,\n        )) &&\n      w.field !== \"_id\"\n    );\n  });\n  if (!where?.length && !args.sortBy) {\n    return;\n  }\n  const lowerBounds =\n    where?.filter((w) => w.operator === \"lt\" || w.operator === \"lte\") ?? [];\n  if (lowerBounds.length > 1) {\n    throw new Error(\n      `cannot have more than one lower bound where clause: ${JSON.stringify(where)}`,\n    );\n  }\n  const upperBounds =\n    where?.filter((w) => w.operator === \"gt\" || w.operator === \"gte\") ?? [];\n  if (upperBounds.length > 1) {\n    throw new Error(\n      `cannot have more than one upper bound where clause: ${JSON.stringify(where)}`,\n    );\n  }\n  const lowerBound = lowerBounds[0];\n  const upperBound = upperBounds[0];\n  if (lowerBound && upperBound && lowerBound.field !== upperBound.field) {\n    throw new Error(\n      `lower bound and upper bound must have the same field: ${JSON.stringify(where)}`,\n    );\n  }\n  const boundField = lowerBound?.field ?? upperBound?.field;\n  if (\n    boundField &&\n    where?.some(\n      (w) => w.field === boundField && w !== lowerBound && w !== upperBound,\n    )\n  ) {\n    throw new Error(\n      `too many where clauses on the bound field: ${JSON.stringify(where)}`,\n    );\n  }\n  const indexEqFields =\n    where\n      ?.filter((w) => !w.operator || w.operator === \"eq\")\n      .sort((a, b) => {\n        return a.field.localeCompare(b.field);\n      })\n      .map((w) => [w.field, w.value]) ?? [];\n  if (!indexEqFields?.length && !boundField && !args.sortBy) {\n    return;\n  }\n  const table = schema.tables[args.model as keyof typeof schema.tables];\n  if (!table) {\n    throw new Error(`Table ${args.model} not found`);\n  }\n  const indexes = table[\" indexes\"]();\n  const sortField = args.sortBy?.field;\n\n  // We internally use _creationTime in place of Better Auth's createdAt\n  const indexFields = indexEqFields\n    .map(([field]) => field)\n    .concat(\n      boundField && boundField !== \"createdAt\"\n        ? `${indexEqFields.length ? \"_\" : \"\"}${boundField}`\n        : \"\",\n    )\n    .concat(\n      sortField && sortField !== \"createdAt\" && boundField !== sortField\n        ? `${indexEqFields.length || boundField ? \"_\" : \"\"}${sortField}`\n        : \"\",\n    )\n    .filter(Boolean);\n  if (!indexFields.length && !boundField && !sortField) {\n    return;\n  }\n  // Use the built in _creationTime index if bounding or sorting by createdAt\n  // with no other fields\n  const index = !indexFields.length\n    ? {\n        fields: [],\n        indexDescriptor: \"by_creation_time\",\n      }\n    : indexes.find(({ fields }: { fields: string[] }) => {\n        const fieldsMatch = indexFields.every(\n          (field, idx) => field === fields[idx],\n        );\n        // If sorting by createdAt, no intermediate fields can be on the index\n        // as they may override the createdAt sort order.\n        const boundFieldMatch =\n          boundField === \"createdAt\" || sortField === \"createdAt\"\n            ? indexFields.length === fields.length\n            : true;\n        return fieldsMatch && boundFieldMatch;\n      });\n  if (!index) {\n    return { indexFields };\n  }\n  return {\n    boundField,\n    index: {\n      fields: [...index.fields, \"_creationTime\"],\n      indexDescriptor: index.indexDescriptor,\n    },\n    sortField,\n    values: {\n      eq: indexEqFields.map(([, value]) => value),\n      gt: upperBound?.operator === \"gt\" ? upperBound.value : undefined,\n      gte: upperBound?.operator === \"gte\" ? upperBound.value : undefined,\n      lt: lowerBound?.operator === \"lt\" ? lowerBound.value : undefined,\n      lte: lowerBound?.operator === \"lte\" ? lowerBound.value : undefined,\n    },\n  };\n};\n\nexport const checkUniqueFields = async <\n  Schema extends SchemaDefinition<any, any>,\n>(\n  ctx: GenericQueryCtx<GenericDataModel>,\n  schema: Schema,\n  betterAuthSchema: BetterAuthDBSchema,\n  table: string,\n  input: Record<string, any>,\n  doc?: Record<string, any>,\n) => {\n  if (!hasUniqueFields(betterAuthSchema, table, input)) {\n    return;\n  }\n  for (const field of Object.keys(input)) {\n    if (!isUniqueField(betterAuthSchema, table, field)) {\n      continue;\n    }\n    const { index } =\n      findIndex(schema, {\n        model: table,\n        where: [{ field, operator: \"eq\", value: input[field] }],\n      }) ?? {};\n    if (!index) {\n      throw new Error(`No index found for ${table}.${field}`);\n    }\n    const existingDoc = await ctx.db\n      .query(table as any)\n      .withIndex(index.indexDescriptor, (q) => q.eq(field, input[field]))\n      .unique();\n    if (existingDoc && existingDoc._id !== doc?._id) {\n      throw new Error(`${table} ${field} already exists`);\n    }\n  }\n};\n\nexport const selectFields = <\n  T extends TableNamesInDataModel<GenericDataModel>,\n  D extends DocumentByName<GenericDataModel, T>,\n>(\n  doc: D | null,\n  select?: string[],\n): D | null => {\n  if (!doc) {\n    return null;\n  }\n  if (!select?.length) {\n    return doc;\n  }\n  return select.reduce((acc, field) => {\n    (acc as any)[field] = doc[field];\n    return acc;\n  }, {} as D);\n};\n\nexport const filterByWhere = <\n  T extends TableNamesInDataModel<GenericDataModel>,\n  D extends DocumentByName<GenericDataModel, T>,\n>(\n  doc: D | null,\n  where?: WhereClause[],\n  // Optionally filter which where clauses to apply.\n  filterWhere?: (w: WhereClause) => any,\n): boolean => {\n  if (!doc) {\n    return false;\n  }\n  for (const w of where ?? []) {\n    if (filterWhere && !filterWhere(w)) {\n      continue;\n    }\n    const value = doc[w.field as keyof typeof doc] as WhereClause[\"value\"];\n    const isLessThan = (val: typeof value, wVal: typeof w.value) => {\n      if (!wVal) {\n        return false;\n      }\n      if (!val) {\n        return true;\n      }\n      return val < wVal;\n    };\n    const isGreaterThan = (val: typeof value, wVal: typeof w.value) => {\n      if (!val) {\n        return false;\n      }\n      if (!wVal) {\n        return true;\n      }\n      return val > wVal;\n    };\n    const filter = (w: WhereClause) => {\n      switch (w.operator) {\n        case \"contains\": {\n          return typeof value === \"string\" && value.includes(w.value as string);\n        }\n        case \"ends_with\": {\n          return typeof value === \"string\" && value.endsWith(w.value as string);\n        }\n        case \"eq\":\n        case undefined: {\n          return value === w.value;\n        }\n        case \"gt\": {\n          return isGreaterThan(value, w.value);\n        }\n        case \"gte\": {\n          return value === w.value || isGreaterThan(value, w.value);\n        }\n        case \"in\": {\n          return Array.isArray(w.value) && (w.value as any[]).includes(value);\n        }\n        case \"lt\": {\n          return isLessThan(value, w.value);\n        }\n        case \"lte\": {\n          return value === w.value || isLessThan(value, w.value);\n        }\n        case \"ne\": {\n          return value !== w.value;\n        }\n        case \"not_in\": {\n          return Array.isArray(w.value) && !(w.value as any[]).includes(value);\n        }\n        case \"starts_with\": {\n          return (\n            typeof value === \"string\" && value.startsWith(w.value as string)\n          );\n        }\n      }\n    };\n    if (!filter(w)) {\n      return false;\n    }\n  }\n  return true;\n};\n\nconst generateQuery = (\n  ctx: GenericQueryCtx<GenericDataModel>,\n  schema: SchemaDefinition<any, any>,\n  args: QueryArgs,\n) => {\n  const { boundField, index, indexFields, values } =\n    findIndex(schema, args) ?? {};\n  const query = stream(ctx.db as any, schema).query(args.model as any);\n  const hasValues =\n    values?.eq?.length ??\n    values?.lt ??\n    values?.lte ??\n    values?.gt ??\n    values?.gte;\n  const indexedQuery =\n    index && index.indexDescriptor !== \"by_creation_time\"\n      ? query.withIndex(\n          index.indexDescriptor,\n          hasValues\n            ? (q: any) => {\n                for (const [idx, value] of (values?.eq ?? []).entries()) {\n                  q = q.eq(index.fields[idx], value);\n                }\n                if (values?.lt) {\n                  q = q.lt(boundField, values.lt);\n                }\n                if (values?.lte) {\n                  q = q.lte(boundField, values.lte);\n                }\n                if (values?.gt) {\n                  q = q.gt(boundField, values.gt);\n                }\n                if (values?.gte) {\n                  q = q.gte(boundField, values.gte);\n                }\n                return q;\n              }\n            : undefined,\n        )\n      : query;\n  const orderedQuery = args.sortBy\n    ? indexedQuery.order(args.sortBy.direction === \"desc\" ? \"desc\" : \"asc\")\n    : indexedQuery;\n  const filteredQuery = orderedQuery.filterWith(async (doc) => {\n    if (!index && indexFields?.length) {\n      console.warn(\n        `Querying without an index on table \"${args.model}\".\\n` +\n          `This can cause performance issues, and may hit the document read limit.\\n` +\n          `To fix, add an index that begins with the following fields in order:\\n` +\n          `[${indexFields.join(\", \")}]`,\n      );\n      // No index, handle all where clauses statically.\n      return filterByWhere(doc, args.where);\n    }\n    return filterByWhere(\n      doc,\n      args.where,\n      // Index used for all eq and range clauses, apply remaining clauses\n      // incompatible with Convex statically.\n      (w) =>\n        w.operator &&\n        [\"contains\", \"ends_with\", \"ne\", \"not_in\", \"starts_with\"].includes(\n          w.operator,\n        ),\n    );\n  });\n  return filteredQuery;\n};\n\nexport const paginate = async <\n  Doc extends DocumentByName<GenericDataModel, T>,\n  T extends TableNamesInDataModel<GenericDataModel>,\n>(\n  ctx: GenericQueryCtx<GenericDataModel>,\n  schema: SchemaDefinition<any, any>,\n  betterAuthSchema: BetterAuthDBSchema,\n  args: QueryArgs & {\n    paginationOpts: PaginationOptions;\n  },\n): Promise<PaginationResult<Doc>> => {\n  if (args.offset) {\n    throw new Error(`offset not supported: ${JSON.stringify(args.offset)}`);\n  }\n  if (args.where?.some((w) => w.connector === \"OR\") && args.where?.length > 1) {\n    throw new Error(\n      `OR connector not supported with multiple where statements in paginate, split up the where statements before calling paginate: ${JSON.stringify(args.where)}`,\n    );\n  }\n  if (\n    args.where?.some(\n      (w) =>\n        w.field === \"_id\" &&\n        w.operator &&\n        ![\"eq\", \"in\", \"not_in\"].includes(w.operator),\n    )\n  ) {\n    throw new Error(\n      `_id can only be used with eq, in, or not_in operator: ${JSON.stringify(args.where)}`,\n    );\n  }\n  // If any where clause is \"eq\" (or missing operator) on a unique field,\n  // we can only return a single document, so we get it and use any other\n  // where clauses as static filters.\n  const uniqueWhere = args.where?.find(\n    (w) =>\n      (!w.operator || w.operator === \"eq\") &&\n      (isUniqueField(betterAuthSchema, args.model, w.field) ||\n        w.field === \"_id\"),\n  );\n  if (uniqueWhere) {\n    const { index } =\n      findIndex(schema, {\n        model: args.model,\n        where: [uniqueWhere],\n      }) ?? {};\n\n    let doc;\n    if (uniqueWhere.field === \"_id\") {\n      doc = await ctx.db.get(uniqueWhere.value as GenericId<T>);\n    } else if (index?.indexDescriptor) {\n      doc = await ctx.db\n        .query(args.model as any)\n        .withIndex(index.indexDescriptor, (q) =>\n          q.eq(index.fields[0], uniqueWhere.value),\n        )\n        .unique();\n    } else {\n      // No index found - fall back to collect() for unique field lookup\n      const results = await ctx.db.query(args.model as any).collect();\n      doc =\n        results.find((d: any) => d[uniqueWhere.field] === uniqueWhere.value) ??\n        null;\n    }\n\n    // Apply all other clauses as static filters to our 0 or 1 result.\n    if (filterByWhere(doc, args.where, (w) => w !== uniqueWhere)) {\n      return {\n        continueCursor: \"\",\n        isDone: true,\n        page: [selectFields(doc, args.select)].filter(Boolean) as Doc[],\n      };\n    }\n    return {\n      continueCursor: \"\",\n      isDone: true,\n      page: [],\n    };\n  }\n\n  const paginationOpts = {\n    ...args.paginationOpts,\n    // If maximumRowsRead is not at least 1 higher than numItems, bad cursors\n    // and incorrect paging will result (at least with convex-test).\n    maximumRowsRead: Math.max((args.paginationOpts.numItems ?? 0) + 1, 200),\n  };\n\n  // Large queries using \"in\" clause will crash, but these are only currently\n  // possible with the organization plugin listing all members with a high\n  // limit. For cases like this we need to create proper convex queries in\n  // the component as an alternative to using Better Auth api's.\n  const inWhere = args.where?.find((w) => w.operator === \"in\");\n  if (inWhere) {\n    if (!Array.isArray(inWhere.value)) {\n      throw new Error(\"in clause value must be an array\");\n    }\n    // For ids, just use asyncMap + .get()\n    if (inWhere.field === \"_id\") {\n      const docs = await asyncMap(inWhere.value as any[], async (value) => {\n        return ctx.db.get(value as GenericId<T>);\n      });\n      const filteredDocs = docs\n        .flatMap((doc) => (doc ? [doc] : []))\n        .filter((doc) => filterByWhere(doc, args.where, (w) => w !== inWhere));\n\n      return {\n        continueCursor: \"\",\n        isDone: true,\n        page: filteredDocs.sort((a, b) => {\n          if (args.sortBy?.field === \"createdAt\") {\n            return args.sortBy.direction === \"asc\"\n              ? (a._creationTime as number) - (b._creationTime as number)\n              : (b._creationTime as number) - (a._creationTime as number);\n          }\n          if (args.sortBy) {\n            const aValue = a[args.sortBy.field];\n            const bValue = b[args.sortBy.field];\n            if (aValue === bValue) {\n              return 0;\n            }\n            return args.sortBy.direction === \"asc\"\n              ? aValue! > bValue!\n                ? 1\n                : -1\n              : aValue! > bValue!\n                ? -1\n                : 1;\n          }\n          return 0;\n        }) as Doc[],\n      };\n    }\n    const streams = inWhere.value.map((value) => {\n      return generateQuery(ctx, schema, {\n        ...args,\n        where: args.where?.map((w) => {\n          if (w === inWhere) {\n            return { ...w, operator: \"eq\" as const, value };\n          }\n          return w;\n        }),\n      });\n    });\n    const result = await mergedStream(\n      streams,\n      [\n        args.sortBy?.field !== \"createdAt\" && args.sortBy?.field,\n        \"_creationTime\",\n      ].flatMap((f) => (f ? [f] : [])),\n    ).paginate(paginationOpts);\n    return {\n      ...result,\n      page: await asyncMap(result.page, (doc) =>\n        selectFields(doc, args.select),\n      ),\n    };\n  }\n\n  const query = generateQuery(ctx, schema, args);\n  const result = await query.paginate(paginationOpts);\n  return {\n    ...result,\n    page: await asyncMap(result.page, (doc) => selectFields(doc, args.select)),\n  };\n};\n\nexport const listOne = async <\n  Doc extends DocumentByName<GenericDataModel, T>,\n  T extends TableNamesInDataModel<GenericDataModel>,\n>(\n  ctx: GenericQueryCtx<GenericDataModel>,\n  schema: SchemaDefinition<any, any>,\n  betterAuthSchema: BetterAuthDBSchema,\n  args: QueryArgs,\n): Promise<Doc | null> => {\n  return (\n    await paginate(ctx, schema, betterAuthSchema, {\n      ...args,\n      paginationOpts: {\n        cursor: null,\n        numItems: 1,\n      },\n    })\n  ).page[0] as Doc | null;\n};\n","import type { GenericDataModel, GenericMutationCtx, GenericQueryCtx } from \"convex/server\";\nimport type { GenericId } from \"convex/values\";\nimport type { CollectionSlug, VexApiAuth } from \"@vexcms/core\";\n\n/**\n * Builds the `getAuth` resolver for `collectionsApi` from better-auth's\n * conventions — no per-app auth plumbing.\n *\n * Resolution chain, all from the validated JWT the `convex()` better-auth\n * plugin mints: `identity.subject` (user doc id) → user document;\n * `identity.sessionId` (appended to every token by the plugin) → session\n * document → `session.activeOrganizationId` → organization document.\n * Documents are read fresh on every request, so role changes and\n * `identity.sessionId` (appended to every token by the plugin) → session\n * document → `session.activeOrganizationId` → organization document.\n * Documents are read fresh on every request, so role changes and\n * org switches apply immediately — claims are only used as ids, never\n * as authorization data.\n *\n * @returns { user, organization }, @see {@link VexApiAuth}\n *\n */\nexport function createGetAuth<TCollectionSlug extends CollectionSlug = CollectionSlug>(props: {\n  userCollectionSlug: TCollectionSlug;\n  orgCollectionSlug: TCollectionSlug;\n  sessionCollectionSlug: TCollectionSlug;\n  resolveOrgs?: boolean;\n}) {\n  return async <DataModel extends GenericDataModel>(\n    ctx: GenericQueryCtx<DataModel> | GenericMutationCtx<DataModel>,\n  ): Promise<VexApiAuth> => {\n    const identity = await ctx.auth.getUserIdentity();\n    if (identity === null) {\n      return { user: null }; // unauthenticated → downstream deny (no roles)\n    }\n\n    const user = await ctx.db.get(\n      props.userCollectionSlug,\n      identity.subject as GenericId<TCollectionSlug>,\n    );\n    if (user === null) {\n      return { user }; // token for a deleted user → deny\n    }\n\n    if (!props.resolveOrgs) {\n      return { user };\n    }\n    const sessionId = identity.sessionId as GenericId<TCollectionSlug> | undefined;\n    const session = sessionId ? await ctx.db.get(props.sessionCollectionSlug, sessionId) : null;\n    const orgId = session?.activeOrganizationId as GenericId<TCollectionSlug> | undefined;\n    const organization = orgId\n      ? ((await ctx.db.get(props.orgCollectionSlug, orgId)) ?? undefined)\n      : undefined;\n\n    return { user, organization };\n  };\n}\n","import type {\n  GenericActionCtx,\n  GenericDataModel,\n  GenericMutationCtx,\n  GenericQueryCtx,\n  MutationBuilder,\n  QueryBuilder,\n  SchemaDefinition,\n} from \"convex/server\";\nimport { convexAdapter } from \"./adapter\";\nimport * as DB from \"./db\";\n\n/**\n * Arguments for authDbApi — same pattern as queryApi/mutationApi in @vexcms/core.\n *\n * The user imports their Convex schema from `convex/schema.ts` and passes it here.\n */\nexport type AuthDbApiOptions<DataModel extends GenericDataModel> = {\n  /** The user's Convex schema (from `convex/schema.ts`). */\n  schema: SchemaDefinition<any, any>;\n  /** The user's `internalMutation` from `convex/_generated/server`. */\n  internalMutation: MutationBuilder<DataModel, \"internal\">;\n  /** The user's `internalQuery` from `convex/_generated/server`. */\n  internalQuery: QueryBuilder<DataModel, \"internal\">;\n};\n\n/**\n * Creates the auth DB operations as proper Convex functions.\n *\n * Use this in www/convex/auth/db.ts to export the db operations:\n * ```ts\n * import { authDbApi } from \"@vexcms/better-auth/convex\"\n * import { internalMutation, internalQuery } from \"../../_generated/server\"\n * import schema from \"../schema\"\n *\n * export const { dbCreate, dbFindOne, dbFindMany, dbCount, dbUpdate, dbUpdateMany, dbDelete, dbDeleteMany } = authDbApi({\n *   schema,\n *   internalMutation,\n *   internalQuery,\n * })\n * ```\n *\n * This follows the exact same pattern as queryApi/mutationApi in @vexcms/core.\n * The returned functions are proper Convex FunctionReferences available as\n * internal.auth.db.dbCreate, etc. in the user's Convex API.\n * @param options - The user's Convex schema plus their `internalMutation`\n *   and `internalQuery` builders, used to construct the auth DB functions.\n * @returns An object exposing `dbCreate`, `dbFindOne`, `dbFindMany`,\n *   `dbCount`, `dbUpdate`, `dbUpdateMany`, `dbDelete`, and `dbDeleteMany` as\n *   internal Convex function references, ready to re-export from the\n *   user's Convex API.\n */\nexport function authDbApi<DataModel extends GenericDataModel>(\n  options: AuthDbApiOptions<DataModel>,\n) {\n  return {\n    dbCreate: options.internalMutation({\n      ...DB.create,\n      handler: async (ctx, args) =>\n        await DB.create.handler(\n          ctx as unknown as GenericMutationCtx<GenericDataModel>,\n          args,\n          options.schema,\n        ),\n    }),\n\n    dbFindOne: options.internalQuery({\n      ...DB.findOne,\n      handler: async (ctx, args) =>\n        await DB.findOne.handler(\n          ctx as unknown as GenericQueryCtx<GenericDataModel>,\n          args,\n          options.schema,\n        ),\n    }),\n\n    dbFindMany: options.internalQuery({\n      ...DB.findMany,\n      handler: async (ctx, args) =>\n        await DB.findMany.handler(\n          ctx as unknown as GenericQueryCtx<GenericDataModel>,\n          args,\n          options.schema,\n        ),\n    }),\n\n    dbCount: options.internalQuery({\n      ...DB.count,\n      handler: async (ctx, args) =>\n        await DB.count.handler(\n          ctx as unknown as GenericQueryCtx<GenericDataModel>,\n          args,\n          options.schema,\n        ),\n    }),\n\n    dbUpdate: options.internalMutation({\n      ...DB.update,\n      handler: async (ctx, args) =>\n        await DB.update.handler(\n          ctx as unknown as GenericMutationCtx<GenericDataModel>,\n          args,\n          options.schema,\n        ),\n    }),\n\n    dbUpdateMany: options.internalMutation({\n      ...DB.updateMany,\n      handler: async (ctx, args) =>\n        await DB.updateMany.handler(\n          ctx as unknown as GenericMutationCtx<GenericDataModel>,\n          args,\n          options.schema,\n        ),\n    }),\n\n    dbDelete: options.internalMutation({\n      ...DB.deleteOne,\n      handler: async (ctx, args) =>\n        await DB.deleteOne.handler(\n          ctx as unknown as GenericMutationCtx<GenericDataModel>,\n          args,\n          options.schema,\n        ),\n    }),\n\n    dbDeleteMany: options.internalMutation({\n      ...DB.deleteMany,\n      handler: async (ctx, args) =>\n        await DB.deleteMany.handler(\n          ctx as unknown as GenericMutationCtx<GenericDataModel>,\n          args,\n          options.schema,\n        ),\n    }),\n  };\n}\n\n/**\n * Creates the Better Auth Convex adapter.\n *\n * Use this in www/convex/auth/index.ts inside createAuth:\n * ```ts\n * import { createBetterAuthAdapter } from \"@vexcms/better-auth/convex\"\n * import { dbCreate, dbFindOne, ... } from \"./db\"\n *\n * export const createAuth = (ctx) => {\n *   return betterAuth({\n *     database: createBetterAuthAdapter(ctx, { dbCreate, dbFindOne, ... }),\n *     ...authOptions,\n *   })\n * }\n * ```\n *\n * The adapter uses anyApi to reference the db operations (anyApi.auth.db.dbCreate etc.)\n * and calls them via ctx.runMutation/ctx.runQuery.\n * @param ctx ActionCtx from better-auth convex library\n * @returns AdapterFactory\n */\nexport function createBetterAuthAdapter<DataModel extends GenericDataModel>(\n  ctx: GenericActionCtx<DataModel>,\n) {\n  return convexAdapter(ctx);\n}\n\nexport { convexAdapter } from \"./adapter\";\nexport * from \"./types\";\nexport * from \"./getAuth\";\n"],"mappings":";AAQA;AAAA,EACE;AAAA,EAEA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,OACK;AAEP,SAAS,qBAAqB;AAc9B,IAAM,wBAAwB;AAAA,EAC5B,MAAM;AAAA,EACN,SAAS;AAAA,EACT,SAAS;AAAA,EACT,cAAc;AAChB;AAGA,IAAM,kBAAkB,oBAAI,IAAI;AAAA,EAC9B;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAGD,IAAM,gBAAgB,oBAAI,IAAI;AAAA,EAC5B;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAmCM,SAAS,kBACd,OACgB;AAChB,QAAM,SAAS,cAAc,OAAO,UAAU,CAAC,CAAC;AAChD,QAAM,cAAsC,CAAC;AAC7C,QAAM,kBAAkB;AAAA,IACtB,EAAE,MAAM,sBAAsB,MAAM,MAAM,OAAO,QAAQ,MAAM,UAAU;AAAA,IACzE;AAAA,MACE,MAAM,sBAAsB;AAAA,MAC5B,MAAM,OAAO,QAAQ,SAAS;AAAA,IAChC;AAAA,IACA;AAAA,MACE,MAAM,sBAAsB;AAAA,MAC5B,MAAM,OAAO,QAAQ,SAAS;AAAA,IAChC;AAAA,IACA;AAAA,MACE,MAAM,sBAAsB;AAAA,MAC5B,MAAM,OAAO,QAAQ,cAAc;AAAA,IACrC;AAAA,EACF;AAEA,aAAW,CAAC,UAAU,QAAQ,KAAK,OAAO,QAAQ,MAAM,GAAG;AACzD,UAAM,OAAO,SAAS,aAAa;AACnC,UAAM,SAAyC,CAAC;AAEhD,4BAAwB;AAAA,MACtB,YAAY,SAAS;AAAA,MACrB;AAAA,MACA;AAAA,MACA,QAAQ,OAAO;AAAA,MACf,WAAW;AAAA,IACb,CAAC;AAED,UAAM,qBAAqB,gBAAgB;AAAA,MACzC,CAAC,OAAO,GAAG,SAAS;AAAA,IACtB,GAAG;AACH,QAAI,oBAAoB;AACtB,cAAQ,oBAAoB;AAAA,QAC1B,KAAK,QAAQ;AACX,gBAAM,mBAAmB,OAAO,QAAQ,MAAM;AAC9C,kCAAwB;AAAA,YACtB,YAAY;AAAA,YACZ;AAAA,YACA;AAAA,YACA,QAAQ,OAAO;AAAA,UACjB,CAAC;AACD;AAAA,QACF;AAAA,QACA,KAAK,WAAW;AACd,gBAAM,mBAAmB,OAAO,QAAQ,SAAS;AACjD,kCAAwB;AAAA,YACtB,YAAY;AAAA,YACZ;AAAA,YACA;AAAA,YACA,QAAQ,OAAO;AAAA,UACjB,CAAC;AACD;AAAA,QACF;AAAA,QACA,KAAK,WAAW;AACd,gBAAM,mBAAmB,OAAO,QAAQ,SAAS;AACjD,kCAAwB;AAAA,YACtB,YAAY;AAAA,YACZ;AAAA,YACA;AAAA,YACA,QAAQ,OAAO;AAAA,UACjB,CAAC;AACD;AAAA,QACF;AAAA,QACA,KAAK,gBAAgB;AACnB,gBAAM,mBACJ,OAAO,QAAQ,cAAc;AAC/B,kCAAwB;AAAA,YACtB,YAAY;AAAA,YACZ;AAAA,YACA;AAAA,YACA,QAAQ,OAAO;AAAA,UACjB,CAAC;AACD;AAAA,QACF;AAAA,QACA;AACE;AAAA,MACJ;AAAA,IACF;AAEA,UAAM,cAAc,SAAS,UAAU,SAAS;AAEhD,gBAAY;AAAA,MACV,iBAAoD;AAAA,QAClD;AAAA,QACA;AAAA,QACA,MAAM,cAAc,EAAE,WAAW,KAAK,IAAI;AAAA,MAC5C,CAAC;AAAA,IACH;AAAA,EACF;AAEA,QAAM,WAAW,OAAO,MAAM,aAAa;AAC3C,SAAO;AAAA,IACL,MAAM;AAAA,IACN;AAAA,IACA,gBAAgB;AAAA,EAClB;AACF;AAmBO,SAAS,wBAAwB,OAMrC;AACD,MAAI,CAAC,MAAM,WAAY;AACvB,aAAW,CAAC,WAAW,IAAI,KAAK,OAAO,QAAQ,MAAM,UAAU,GAAG;AAChE,QAAI,MAAM,cAAc,QAAQ,cAAc,KAAM;AACpD,UAAM,QAAQ;AAAA,MACZ;AAAA,MACA;AAAA,MACA,MAAM;AAAA,MACN,OAAO;AAAA,IACT;AACA,QAAI,MAAO,OAAM,OAAO,SAAS,IAAI;AAAA,EACvC;AACF;AAmBA,SAAS,yBACP,WACA,MACA,WACA,aACA;AAEA,MAAI,cAAc,KAAM,QAAO;AAE/B,QAAM,cACJ,cAAc,aAAa,MAAM,aACjC,cAAc,UACd,cAAc;AAChB,QAAM,aAAa,eAAe,gBAAgB,IAAI,SAAS;AAC/D,QAAM,WAAW,cAAc,IAAI,SAAS;AAE5C,QAAM,QAA+B,CAAC;AACtC,MAAI,CAAC,WAAY,OAAM,WAAW;AAClC,MAAI,SAAU,OAAM,SAAS;AAG7B,QAAM,cAAqE;AAAA,IACzE,cAAc;AAAA,EAChB;AACA,MAAI,OAAO,KAAK,KAAK,EAAE,SAAS,EAAG,aAAY,QAAQ;AACvD,MAAI,CAAC,WAAY,aAAY,OAAO,EAAE,QAAQ,KAAK;AACnD,MAAI,KAAK,SAAU,aAAY,WAAW,KAAK;AAC/C,MACE,KAAK,iBAAiB,UACtB,OAAO,KAAK,iBAAiB,YAC7B;AACA,gBAAY,eAAe,KAAK;AAAA,EAClC;AACA,MAAI,KAAK,UAAU,KAAK,OAAO;AAC7B,gBAAY,QAAQ,MAAM,SAAS;AAAA,EACrC;AAEA,MAAI,KAAK,YAAY;AACnB,WAAO,KAAK,WAAW;AAAA,EACzB;AAEA,MAAI,MAAM,QAAQ,KAAK,IAAI,GAAG;AAC5B,WAAO,OAAO;AAAA,MACZ,SAAS,KAAK,KAAK,IAAI,CAACA,QAAe,EAAE,OAAOA,IAAG,OAAOA,GAAE,EAAE;AAAA,MAC9D,GAAG;AAAA,IACL,CAAC;AAAA,EACH;AAEA,UAAQ,KAAK,MAAM;AAAA,IACjB,KAAK;AACH,aAAO,KAAK,WAAW;AAAA,IACzB,KAAK;AACH,aAAO,MAAM;AAAA,QACX,GAAG;AAAA,QACH,OAAO,KAAK,WAAW;AAAA,MACzB,CAAC;AAAA,IACH,KAAK;AACH,aAAO,SAAS,WAAW;AAAA,IAC7B,KAAK;AACH,aAAO,OAAO,WAAW;AAAA,IAC3B,KAAK;AACH,aAAO,MAAM;AAAA,QACX,GAAG;AAAA,QACH,OAAO,OAAO,WAAW;AAAA,MAC3B,CAAC;AAAA,IACH,KAAK;AACH,aAAO,KAAK,WAAW;AAAA,IACzB,KAAK;AAGH,aAAO,KAAK,WAAW;AAAA,IACzB;AAEE,aAAO;AAAA,EACX;AACF;;;ACrUA,SAAS,cAAc;AACvB;AAAA,EACE;AAAA,OAEK;AACP,SAAS,iBAAAC,sBAAqB;AAM9B,IAAM,aAAa,CAAC,UAA0C;AAC5D,SAAQ,OAAO,IAAI,CAACC,WAAU;AAC5B,QAAIA,OAAM,iBAAiB,MAAM;AAC/B,aAAO,EAAE,GAAGA,QAAO,OAAOA,OAAM,MAAM,QAAQ,EAAE;AAAA,IAClD;AACA,WAAOA;AAAA,EACT,CAAC,KAAK,CAAC;AACT;AASO,SAAS,cACd,KACA,SAAkD,CAAC,GACnD;AACA,SAAO,qBAAqB;AAAA,IAC1B,SAAS,CAAC,EAAE,QAAQ,MAAM;AACxB,cAAQ,YAAY,EAAE,SAAS,MAAM;AACrC,YAAM,mBAAmBD,eAAc,OAAO;AAC9C,YAAM,uBAAuB,KAAK,UAAU,gBAAgB;AAE5D,aAAO;AAAA,QACL,IAAI;AAAA,QACJ,SAAS,EAAE,kBAAkB,iBAAiB,IAAI;AAAA;AAAA,QAGlD,QAAQ,OAAO,EAAE,MAAM,OAAO,QAAAE,QAAO,MAAM;AACzC,iBAAO,MAAM,IAAI,YAAY,OAAO,KAAK,GAAG,UAAU;AAAA,YACpD,kBAAkB;AAAA,YAClB;AAAA,YACA;AAAA,YACA,QAAAA;AAAA,UACF,CAAC;AAAA,QACH;AAAA,QAEA,SAAS,OAAO,EAAE,OAAO,QAAAA,SAAQ,MAAM,MAAM;AAC3C,iBAAO,MAAM,IAAI,SAAS,OAAO,KAAK,GAAG,WAAW;AAAA,YAClD,kBAAkB;AAAA,YAClB;AAAA,YACA,QAAAA;AAAA,YACA,OAAO,WAAW,KAAK;AAAA,UACzB,CAAC;AAAA,QACH;AAAA,QAEA,UAAU,OAAO,EAAE,OAAO,OAAO,QAAQ,MAAM,MAAM;AACnD,iBAAO,MAAM,IAAI,SAAS,OAAO,KAAK,GAAG,YAAY;AAAA,YACnD,kBAAkB;AAAA,YAClB;AAAA,YACA;AAAA,YACA;AAAA,YACA,OAAO,WAAW,KAAK;AAAA,UACzB,CAAC;AAAA,QACH;AAAA,QAEA,OAAO,OAAO,EAAE,OAAO,MAAM,MAAM;AACjC,iBAAO,MAAM,IAAI,SAAS,OAAO,KAAK,GAAG,SAAS;AAAA,YAChD,kBAAkB;AAAA,YAClB;AAAA,YACA,OAAO,WAAW,KAAK;AAAA,UACzB,CAAC;AAAA,QACH;AAAA,QAEA,QAAQ,OAAO,EAAE,OAAO,QAAAC,SAAQ,MAAM,MAAM;AAC1C,iBAAO,MAAM,IAAI,YAAY,OAAO,KAAK,GAAG,UAAU;AAAA,YACpD,kBAAkB;AAAA,YAClB;AAAA,YACA,QAAAA;AAAA,YACA,OAAO,WAAW,KAAK;AAAA,UACzB,CAAC;AAAA,QACH;AAAA,QAEA,YAAY,OAAO,EAAE,OAAO,QAAAA,SAAQ,MAAM,MAAM;AAC9C,iBAAO,MAAM,IAAI,YAAY,OAAO,KAAK,GAAG,cAAc;AAAA,YACxD,kBAAkB;AAAA,YAClB;AAAA,YACA,QAAAA;AAAA,YACA,OAAO,WAAW,KAAK;AAAA,UACzB,CAAC;AAAA,QACH;AAAA,QAEA,QAAQ,OAAO,EAAE,OAAO,MAAM,MAAM;AAClC,iBAAO,MAAM,IAAI,YAAY,OAAO,KAAK,GAAG,UAAU;AAAA,YACpD,kBAAkB;AAAA,YAClB;AAAA,YACA,OAAO,WAAW,KAAK;AAAA,UACzB,CAAC;AAAA,QACH;AAAA,QAEA,YAAY,OAAO,EAAE,OAAO,MAAM,MAAM;AACtC,iBAAO,MAAM,IAAI,YAAY,OAAO,KAAK,GAAG,cAAc;AAAA,YACxD,kBAAkB;AAAA,YAClB;AAAA,YACA,OAAO,WAAW,KAAK;AAAA,UACzB,CAAC;AAAA,QACH;AAAA,QAEA,aAAa,YAAY;AACvB,gBAAM,IAAI,MAAM,4BAA4B;AAAA,QAC9C;AAAA,MACF;AAAA,IACF;AAAA,IACA,QAAQ;AAAA,MACN,WAAW;AAAA,MACX,aAAa;AAAA,MACb,sBAAsB,CAAC,EAAE,MAAM,gBAAgB,MAC7C,QAAQ,gBAAgB,SAAS,SAC7B,IAAI,KAAK,IAAI,EAAE,QAAQ,IACvB;AAAA,MACN,uBAAuB,CAAC,EAAE,MAAM,gBAAgB,MAC9C,QAAQ,gBAAgB,SAAS,SAC7B,IAAI,KAAK,IAAI,EAAE,QAAQ,IACvB;AAAA,MACN,WAAW,OAAO,aAAa;AAAA,MAC/B,qBAAqB;AAAA,MACrB,uBAAuB,EAAE,IAAI,MAAM;AAAA,MACnC,wBAAwB,EAAE,KAAK,KAAK;AAAA,MACpC,gBAAgB;AAAA,MAChB,eAAe;AAAA,MACf,cAAc;AAAA,MACd,oBAAoB;AAAA,MACpB,aAAa;AAAA,MACb,WAAW;AAAA,IACb;AAAA,EACF,CAAC;AACH;;;ACpIA,SAAS,SAAS;;;ACFlB,eAAsB,SAAS,MAAM,gBAAgB;AACjD,QAAM,WAAW,CAAC;AAClB,MAAI,QAAQ;AACZ,SAAO,MAAM;AACb,aAAW,QAAQ,MAAM;AACrB,aAAS,KAAK,eAAe,MAAM,KAAK,CAAC;AACzC,aAAS;AAAA,EACb;AACA,SAAO,QAAQ,IAAI,QAAQ;AAC/B;;;ACjBA,SAAS,cAAc,eAAe,cAAc,uBAAwB;AAE5E,IAAM,wBAAwB;AAM9B,IAAM,oBAAoB,wBAAwB;AAIlD,SAAS,cAAc,WAAW;AAC9B,MAAI,cAAc,QAAQ,cAAc,OAAO;AAC3C,WAAO;AAAA,EACX;AACA,SAAO;AACX;AAcA,SAAS,WAAW,aAEpB,OAAO,YAAY,UAAU,gBAAgB,cAAc;AAKvD,QAAMC,gBAAe,CAAC;AACtB,SAAO,WAAW,SAAS,KACvB,SAAS,SAAS,KAClB,cAAc,WAAW,CAAC,GAAG,SAAS,CAAC,CAAC,MAAM,GAAG;AACjD,UAAM,aAAa,YAAY,CAAC;AAChC,kBAAc,YAAY,MAAM,CAAC;AACjC,UAAM,UAAU,WAAW,CAAC;AAC5B,iBAAa,WAAW,MAAM,CAAC;AAC/B,eAAW,SAAS,MAAM,CAAC;AAC3B,IAAAA,cAAa,KAAK,CAAC,MAAM,YAAY,OAAO,CAAC;AAAA,EACjD;AACA,QAAM,cAAc,CAAC,WAAW,QAAQ;AACpC,UAAM,QAAQA,cAAa,MAAM;AACjC,QAAI,IAAI;AACR,WAAO,IAAI,IAAI,SAAS,GAAG,KAAK;AAC5B,YAAM,KAAK,CAAC,MAAM,YAAY,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;AAAA,IAC7C;AACA,QAAI,IAAI,IAAI,QAAQ;AAChB,YAAM,KAAK,CAAC,WAAW,YAAY,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;AAAA,IAClD;AACA,WAAO;AAAA,EACX;AAEA,QAAM,cAAc,CAAC;AACrB,SAAO,WAAW,SAAS,GAAG;AAC1B,gBAAY,KAAK,YAAY,gBAAgB,UAAU,CAAC;AACxD,qBAAiB,cAAc,cAAc;AAC7C,iBAAa,WAAW,MAAM,GAAG,EAAE;AAAA,EACvC;AAEA,QAAM,YAAY,CAAC;AACnB,SAAO,SAAS,SAAS,GAAG;AACxB,cAAU,KAAK,YAAY,cAAc,QAAQ,CAAC;AAClD,mBAAe,cAAc,YAAY;AACzC,eAAW,SAAS,MAAM,GAAG,EAAE;AAAA,EACnC;AACA,YAAU,QAAQ;AAElB,MAAI;AACJ,MAAI,SAAS,WAAW,GAAG;AACvB,kBAAc,YAAY,gBAAgB,UAAU;AAAA,EACxD,WACS,WAAW,WAAW,GAAG;AAC9B,kBAAc,YAAY,cAAc,QAAQ;AAAA,EACpD,OACK;AACD,UAAM,aAAa,WAAW,CAAC;AAC/B,UAAM,WAAW,SAAS,CAAC;AAC3B,kBAAcA,cAAa,MAAM;AACjC,gBAAY,KAAK,CAAC,gBAAgB,YAAY,CAAC,GAAG,UAAU,CAAC;AAC7D,gBAAY,KAAK,CAAC,cAAc,YAAY,CAAC,GAAG,QAAQ,CAAC;AAAA,EAC7D;AACA,QAAM,SAAS,CAAC,GAAG,aAAa,aAAa,GAAG,SAAS;AACzD,MAAI,UAAU,QAAQ;AAClB,WAAO,QAAQ;AAAA,EACnB;AACA,SAAO;AACX;AACA,SAAS,aAAa,OAAO;AACzB,SAAO,CAAC,MAAM;AACV,eAAW,CAAC,WAAW,OAAO,KAAK,KAAK,OAAO;AAC3C,UAAI,EAAE,SAAS,EAAE,OAAO,KAAK;AAAA,IACjC;AACA,WAAO;AAAA,EACX;AACJ;AAWO,SAAS,eAAe,OAAO,OAAO,QAAQ;AACjD,QAAM,kBAAkB,OAAO,SAAS,kBAAkB;AAC1D,MAAI,oBAAoB,oBAAoB;AACxC,WAAO,CAAC,iBAAiB,KAAK;AAAA,EAClC;AACA,MAAI,oBAAoB,SAAS;AAC7B,WAAO,CAAC,KAAK;AAAA,EACjB;AACA,MAAI,CAAC,QAAQ;AACT,UAAM,IAAI,MAAM,0CAA0C;AAAA,EAC9D;AACA,QAAM,YAAY,OAAO,OAAO,KAAK;AACrC,QAAM,YAAY,UAAU,QAAQ,KAAK,CAACC,WAAUA,OAAM,oBAAoB,eAAe;AAC7F,MAAI,CAAC,WAAW;AACZ,UAAM,IAAI,MAAM,SAAS,eAAe,uBAAuB,KAAK,EAAE;AAAA,EAC1E;AACA,QAAM,SAAS,UAAU,OAAO,MAAM;AACtC,SAAO,KAAK,eAAe;AAC3B,SAAO,KAAK,KAAK;AACjB,SAAO;AACX;AACA,SAAS,YAAY,KAAK,aAAa;AACnC,QAAM,MAAM,CAAC;AACb,aAAW,SAAS,aAAa;AAC7B,QAAI,MAAM;AACV,eAAW,YAAY,MAAM,MAAM,GAAG,GAAG;AACrC,YAAM,IAAI,QAAQ;AAAA,IACtB;AACA,QAAI,KAAK,GAAG;AAAA,EAChB;AACA,SAAO;AACX;AAaO,SAAS,OAAO,IAAI,QAAQ;AAC/B,SAAO,IAAI,qBAAqB,IAAI,MAAM;AAC9C;AAIO,IAAM,cAAN,MAAkB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAkBrB,WAAW,WAAW;AAClB,UAAM,QAAQ,KAAK,SAAS;AAC5B,WAAO,IAAI,cAAc,MAAM,OAAO,QAAQ;AAC1C,YAAM,WAAY,MAAM,UAAU,GAAG,IAAK,MAAM;AAChD,aAAO,IAAI,gBAAgB,UAAU,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;AAAA,IAC1D,GAAG,CAAC,CAAC;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,IAAI,QAAQ;AACR,UAAM,QAAQ,KAAK,SAAS;AAC5B,WAAO,IAAI,cAAc,MAAM,OAAO,QAAQ;AAC1C,YAAM,SAAS,MAAM,OAAO,GAAG;AAC/B,aAAO,IAAI,gBAAgB,QAAQ,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;AAAA,IACxD,GAAG,CAAC,CAAC;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaA,QAAQ,QAAQ,mBAAmB;AAC/B,yBAAqB,iBAAiB;AACtC,WAAO,IAAI,cAAc,MAAM,QAAQ,iBAAiB;AAAA,EAC5D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAgBA,SAAS,qBAAqB;AAC1B,WAAO,IAAI,eAAe,MAAM,mBAAmB;AAAA,EACvD;AAAA;AAAA,EAEA,OAAO,YAAY;AACf,UAAM,IAAI,MAAM,sJAAsJ;AAAA,EAC1K;AAAA,EACA,MAAM,SAAS,MAAM;AACjB,QAAI,KAAK,aAAa,GAAG;AACrB,UAAI,KAAK,WAAW,MAAM;AACtB,cAAM,IAAI,MAAM,gLAE6C;AAAA,MACjE;AACA,aAAO;AAAA,QACH,MAAM,CAAC;AAAA,QACP,QAAQ;AAAA,QACR,gBAAgB,KAAK;AAAA,MACzB;AAAA,IACJ;AACA,UAAM,QAAQ,KAAK,SAAS;AAC5B,QAAI,cAAc;AAAA,MACd,KAAK,CAAC;AAAA,MACN,WAAW;AAAA,IACf;AACA,QAAI,KAAK,WAAW,MAAM;AACtB,oBAAc;AAAA,QACV,KAAK,kBAAkB,KAAK,MAAM;AAAA,QAClC,WAAW;AAAA,MACf;AAAA,IACJ;AACA,QAAI,YAAY;AAAA,MACZ,KAAK,CAAC;AAAA,MACN,WAAW;AAAA,IACf;AACA,UAAM,gBAAgB,KAAK;AAC3B,QAAI,UAAU,KAAK;AACnB,QAAI,KAAK,WAAW;AAChB,kBAAY;AAAA,QACR,KAAK,kBAAkB,KAAK,SAAS;AAAA,QACrC,WAAW;AAAA,MACf;AAGA,gBAAU;AAAA,IACd;AACA,UAAM,gBAAgB,UAAU,QAAQ,cAAc;AACtD,UAAM,gBAAgB,UAAU,QAAQ,YAAY;AACpD,UAAM,eAAe,KAAK,OAAO;AAAA,MAC7B,YAAY,cAAc;AAAA,MAC1B,qBAAqB,cAAc;AAAA,MACnC,YAAY,cAAc;AAAA,MAC1B,qBAAqB,cAAc;AAAA,IACvC,CAAC;AACD,UAAM,OAAO,CAAC;AACd,UAAM,YAAY,CAAC;AACnB,QAAI,UAAU,KAAK,aAAa,KAAK,cAAc;AACnD,QAAI,iBAAiB,KAAK,aAAa;AACvC,UAAM,iBAAiB,KAAK;AAC5B,UAAM,iBAAiB,mBAAmB;AAC1C,QAAI,iBAAiB;AACrB,QAAI,WAAW;AACf,qBAAiB,CAAC,KAAK,UAAU,SAAS,KAAK,aAAa,aAAa,cAAc,GAAG;AACtF,UAAI,QAAQ,MAAM;AACd,aAAK,KAAK,GAAG;AAAA,MACjB;AACA,gBAAU,KAAK,QAAQ;AACvB,wBAAkB;AAClB,UAAK,mBAAmB,UAAa,kBAAkB,kBAClD,kBAAkB,UAAa,UAAU,UAAU,eAAgB;AACpE,mBAAW;AAAA,MACf;AACA,UAAI,YAAa,YAAY,UAAa,KAAK,UAAU,SAAU;AAC/D,kBAAU;AACV,yBAAiB,gBAAgB,QAAQ;AACzC;AAAA,MACJ;AAAA,IACJ;AACA,QAAI,aAAa;AACjB,QAAI,cAAc;AAClB,QAAI,UAAU;AACV,mBAAa;AACb,oBAAc,UAAU,KAAK,OAAO,UAAU,SAAS,KAAK,CAAC,CAAC;AAAA,IAClE,WACS,UAAU,UAAU,qBACzB,KAAK,SAAS,KAAK,WAAW,GAAG;AACjC,mBAAa;AACb,oBAAc,UAAU,KAAK,OAAO,UAAU,SAAS,KAAK,CAAC,CAAC;AAAA,IAClE;AACA,WAAO;AAAA,MACH;AAAA,MACA,QAAQ,CAAC;AAAA,MACT;AAAA,MACA;AAAA,MACA,aAAa,cAAc,gBAAgB,WAAW,IAAI;AAAA,IAC9D;AAAA,EACJ;AAAA,EACA,MAAM,UAAU;AACZ,WAAO,MAAM,KAAK,KAAK,QAAQ;AAAA,EACnC;AAAA,EACA,MAAM,KAAK,GAAG;AACV,UAAM,UAAU,CAAC;AACjB,qBAAiB,CAAC,GAAG,KAAK,KAAK,aAAa,GAAG;AAC3C,UAAI,QAAQ,MAAM;AACd;AAAA,MACJ;AACA,cAAQ,KAAK,GAAG;AAChB,UAAI,QAAQ,WAAW,GAAG;AACtB;AAAA,MACJ;AAAA,IACJ;AACA,WAAO;AAAA,EACX;AAAA,EACA,MAAM,SAAS;AACX,UAAM,OAAO,MAAM,KAAK,KAAK,CAAC;AAC9B,QAAI,KAAK,WAAW,GAAG;AACnB,YAAM,IAAI,MAAM,qBAAqB;AAAA,IACzC;AACA,WAAO,KAAK,CAAC,KAAK;AAAA,EACtB;AAAA,EACA,MAAM,QAAQ;AACV,UAAM,OAAO,MAAM,KAAK,KAAK,CAAC;AAC9B,WAAO,KAAK,CAAC,KAAK;AAAA,EACtB;AAAA,EACA,CAAC,OAAO,aAAa,IAAI;AACrB,UAAM,WAAW,KAAK,aAAa,EAAE,OAAO,aAAa,EAAE;AAC3D,WAAO;AAAA,MACH,MAAM,OAAO;AACT,cAAM,SAAS,MAAM,SAAS,KAAK;AACnC,YAAI,OAAO,MAAM;AACb,iBAAO,EAAE,MAAM,MAAM,OAAO,OAAU;AAAA,QAC1C;AACA,eAAO,EAAE,MAAM,OAAO,OAAO,OAAO,MAAM,CAAC,EAAE;AAAA,MACjD;AAAA,IACJ;AAAA,EACJ;AACJ;AACO,IAAM,uBAAN,MAA2B;AAAA,EAC9B;AAAA,EACA;AAAA;AAAA,EAEA;AAAA,EACA,YAAY,IAAI,QAAQ;AACpB,SAAK,KAAK;AACV,SAAK,SAAS;AACd,SAAK,SAAS,GAAG;AAAA,EACrB;AAAA,EACA,MAAM,WAAW;AACb,WAAO,IAAI,uBAAuB,MAAM,SAAS;AAAA,EACrD;AAAA,EACA,IAAI,KAAK;AACL,UAAM,IAAI,MAAM,qCAAqC;AAAA,EACzD;AAAA,EACA,YAAY,YAAY,KAAK;AACzB,UAAM,IAAI,MAAM,8CAA8C;AAAA,EAClE;AACJ;AACO,IAAM,kBAAN,cAA8B,YAAY;AACjD;AACO,IAAM,yBAAN,cAAqC,gBAAgB;AAAA,EACxD;AAAA,EACA;AAAA,EACA,YAAY,QAAQ,OAAO;AACvB,UAAM;AACN,SAAK,SAAS;AACd,SAAK,QAAQ;AAAA,EACjB;AAAA,EACA,gBAAgB;AACZ,WAAO,KAAK,UAAU,kBAAkB;AAAA,EAC5C;AAAA,EACA,UAAU,WAAW,YAAY;AAC7B,UAAM,cAAc,eAAe,KAAK,OAAO,WAAW,KAAK,OAAO,MAAM;AAC5E,UAAM,IAAI,IAAI,kBAAkB,WAAW;AAC3C,QAAI,YAAY;AACZ,iBAAW,CAAC;AAAA,IAChB;AACA,WAAO,IAAI,YAAY,MAAM,WAAW,GAAG,UAAU;AAAA,EACzD;AAAA,EACA,gBAAgB,YAAY,eAAe;AACvC,UAAM,IAAI,MAAM,iCAAiC;AAAA,EACrD;AAAA,EACA,QAAQ;AACJ,WAAO,KAAK,cAAc;AAAA,EAC9B;AAAA,EACA,MAAM,OAAO;AACT,WAAO,KAAK,MAAM,EAAE,MAAM,KAAK;AAAA,EACnC;AAAA,EACA,UAAU;AACN,WAAO,KAAK,MAAM,EAAE,QAAQ;AAAA,EAChC;AAAA,EACA,aAAa,iBAAiB,OAAO;AACjC,WAAO,KAAK,MAAM,EAAE,aAAa,cAAc;AAAA,EACnD;AAAA,EACA,WAAW;AACP,WAAO,KAAK,MAAM,EAAE,SAAS;AAAA,EACjC;AAAA,EACA,yBAAyB;AACrB,WAAO,KAAK,MAAM,EAAE,uBAAuB;AAAA,EAC/C;AAAA,EACA,iBAAiB;AACb,WAAO,KAAK,MAAM,EAAE,eAAe;AAAA,EACvC;AAAA,EACA,OAAO,aAAa;AAChB,WAAO,KAAK,MAAM,EAAE,OAAO,WAAW;AAAA,EAC1C;AACJ;AAEO,IAAM,cAAN,cAA0B,gBAAgB;AAAA,EAC7C;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA,YAAY,QAAQ,OAAO,GAAG,YAAY;AACtC,UAAM;AACN,SAAK,SAAS;AACd,SAAK,QAAQ;AACb,SAAK,IAAI;AACT,SAAK,aAAa;AAAA,EACtB;AAAA,EACA,MAAM,OAAO;AACT,WAAO,IAAI,mBAAmB,MAAM,KAAK;AAAA,EAC7C;AAAA,EACA,QAAQ;AACJ,WAAO,KAAK,MAAM,KAAK;AAAA,EAC3B;AAAA,EACA,UAAU;AACN,WAAO,KAAK,MAAM,EAAE,QAAQ;AAAA,EAChC;AAAA,EACA,aAAa,iBAAiB,OAAO;AACjC,WAAO,KAAK,MAAM,EAAE,aAAa,cAAc;AAAA,EACnD;AAAA,EACA,WAAW;AACP,WAAO,KAAK,MAAM,EAAE,SAAS;AAAA,EACjC;AAAA,EACA,yBAAyB;AACrB,WAAO,KAAK,MAAM,EAAE,uBAAuB;AAAA,EAC/C;AAAA,EACA,iBAAiB;AACb,WAAO,KAAK,MAAM,EAAE,eAAe;AAAA,EACvC;AAAA,EACA,OAAO,aAAa;AAChB,WAAO,KAAK,MAAM,EAAE,OAAO,WAAW;AAAA,EAC1C;AACJ;AACO,IAAM,qBAAN,cAAiC,gBAAgB;AAAA,EACpD;AAAA,EACA;AAAA,EACA,YAAY,QAAQ,OAAO;AACvB,UAAM;AACN,SAAK,SAAS;AACd,SAAK,QAAQ;AAAA,EACjB;AAAA,EACA,UAAU;AACN,WAAO;AAAA,MACH,IAAI,KAAK,OAAO,OAAO,OAAO;AAAA,MAC9B,QAAQ,KAAK,OAAO,OAAO,OAAO;AAAA,MAClC,OAAO,KAAK,OAAO,OAAO;AAAA,MAC1B,OAAO,KAAK,OAAO;AAAA,MACnB,aAAa,KAAK,OAAO,EAAE;AAAA,MAC3B,OAAO,KAAK;AAAA,MACZ,QAAQ;AAAA,QACJ,YAAY,KAAK,OAAO,EAAE,sBAAsB,CAAC;AAAA,QACjD,qBAAqB,KAAK,OAAO,EAAE;AAAA,QACnC,YAAY,KAAK,OAAO,EAAE,sBAAsB,CAAC;AAAA,QACjD,qBAAqB,KAAK,OAAO,EAAE;AAAA,MACvC;AAAA,MACA,YAAY,KAAK,OAAO;AAAA,IAC5B;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA,EAIA,QAAQ;AACJ,UAAM,EAAE,IAAI,OAAO,OAAO,OAAO,WAAW,IAAI,KAAK,QAAQ;AAC7D,WAAO,GAAG,MAAM,KAAK,EAAE,UAAU,OAAO,UAAU,EAAE,MAAM,KAAK;AAAA,EACnE;AAAA,EACA,aAAa,iBAAiB,OAAO;AACjC,UAAM,EAAE,YAAY,IAAI,KAAK,QAAQ;AACrC,UAAM,WAAW,KAAK,MAAM;AAC5B,WAAO;AAAA,MACH,CAAC,OAAO,aAAa,IAAI;AACrB,cAAM,WAAW,SAAS,OAAO,aAAa,EAAE;AAChD,eAAO;AAAA,UACH,MAAM,OAAO;AACT,kBAAM,SAAS,MAAM,SAAS,KAAK;AACnC,gBAAI,OAAO,MAAM;AACb,qBAAO,EAAE,MAAM,MAAM,OAAO,OAAU;AAAA,YAC1C;AACA,kBAAM,MAAM,OAAO;AACnB,kBAAM,YAAY,iBAAiB,gBAAgB,GAAG,IAAI;AAC1D,mBAAO;AAAA,cACH,MAAM;AAAA,cACN,OAAO,CAAC,KAAK,YAAY,KAAK,WAAW,GAAG,SAAS;AAAA,YACzD;AAAA,UACJ;AAAA,QACJ;AAAA,MACJ;AAAA,IACJ;AAAA,EACJ;AAAA,EACA,WAAW;AACP,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,yBAAyB;AACrB,WAAO,KAAK,OAAO,EAAE;AAAA,EACzB;AAAA,EACA,iBAAiB;AACb,WAAO,KAAK,OAAO,EAAE;AAAA,EACzB;AAAA,EACA,OAAO,aAAa;AAChB,UAAM,EAAE,IAAI,OAAO,OAAO,OAAO,QAAQ,OAAO,IAAI,KAAK,QAAQ;AACjE,QAAI,gBAAgB,OAAO;AAC3B,QAAI,yBAAyB,OAAO;AACpC,QAAI,YAAY;AAAA,MACZ,OAAO,YAAY;AAAA,MACnB,MAAM,YAAY,sBAAsB,gBAAgB;AAAA,IAC5D,GAAG;AAAA,MACC,OAAO,OAAO;AAAA,MACd,MAAM,OAAO,sBAAsB,gBAAgB;AAAA,IACvD,CAAC,IAAI,GAAG;AACJ,sBAAgB,YAAY;AAC5B,+BAAyB,YAAY;AAAA,IACzC;AACA,QAAI,gBAAgB,OAAO;AAC3B,QAAI,yBAAyB,OAAO;AACpC,QAAI,YAAY;AAAA,MACZ,OAAO,YAAY;AAAA,MACnB,MAAM,YAAY,sBAAsB,cAAc;AAAA,IAC1D,GAAG;AAAA,MACC,OAAO,OAAO;AAAA,MACd,MAAM,OAAO,sBAAsB,cAAc;AAAA,IACrD,CAAC,IAAI,GAAG;AACJ,sBAAgB,YAAY;AAC5B,+BAAyB,YAAY;AAAA,IACzC;AACA,WAAO,iBAAiB,IAAI,QAAQ,OAAO,OAAO;AAAA,MAC9C,YAAY;AAAA,MACZ,qBAAqB;AAAA,MACrB,YAAY;AAAA,MACZ,qBAAqB;AAAA,IACzB,GAAG,KAAK;AAAA,EACZ;AACJ;AAIO,SAAS,iBAAiB,IAAI,QAAQ,OAAO,OAAO,QAAQ,OAAO;AACtE,QAAM,cAAc,eAAe,OAAO,OAAO,MAAM;AACvD,QAAM,cAAc,WAAW,aAAa,OAAO,OAAO,YAAY,OAAO,YAAY,OAAO,sBAAsB,QAAQ,MAAM,OAAO,sBAAsB,QAAQ,IAAI;AAC7K,QAAM,aAAa,YAAY,IAAI,CAAC,eAAe,OAAO,IAAI,MAAM,EAC/D,MAAM,KAAK,EACX,UAAU,OAAO,aAAa,UAAU,CAAC,EACzC,MAAM,KAAK,CAAC;AACjB,SAAO,IAAI,cAAc,GAAG,UAAU;AAC1C;AACA,IAAM,oBAAN,MAAwB;AAAA,EACpB;AAAA,EACA,aAAa;AAAA,EACb,qBAAqB;AAAA,EACrB,sBAAsB;AAAA,EACtB,qBAAqB;AAAA,EACrB,sBAAsB;AAAA,EACtB,sBAAsB,CAAC;AAAA,EACvB,YAAY,aAAa;AACrB,SAAK,cAAc;AAAA,EACvB;AAAA,EACA,GAAG,OAAO,OAAO;AACb,QAAI,CAAC,KAAK,eAAe,KAAK,KAAK,CAAC,KAAK,eAAe,KAAK,GAAG;AAC5D,YAAM,IAAI,MAAM,2BAA2B,KAAK,GAAG;AAAA,IACvD;AACA,SAAK,qBAAqB,KAAK,sBAAsB,CAAC;AACtD,SAAK,mBAAmB,KAAK,KAAK;AAClC,SAAK,qBAAqB,KAAK,sBAAsB,CAAC;AACtD,SAAK,mBAAmB,KAAK,KAAK;AAClC,SAAK,oBAAoB,KAAK,KAAK;AACnC,WAAO;AAAA,EACX;AAAA,EACA,GAAG,OAAO,OAAO;AACb,QAAI,CAAC,KAAK,eAAe,KAAK,GAAG;AAC7B,YAAM,IAAI,MAAM,2BAA2B,KAAK,GAAG;AAAA,IACvD;AACA,SAAK,qBAAqB,KAAK,sBAAsB,CAAC;AACtD,SAAK,mBAAmB,KAAK,KAAK;AAClC,SAAK,sBAAsB;AAC3B,SAAK,aAAa;AAClB,WAAO;AAAA,EACX;AAAA,EACA,IAAI,OAAO,OAAO;AACd,QAAI,CAAC,KAAK,eAAe,KAAK,GAAG;AAC7B,YAAM,IAAI,MAAM,4BAA4B,KAAK,GAAG;AAAA,IACxD;AACA,SAAK,qBAAqB,KAAK,sBAAsB,CAAC;AACtD,SAAK,mBAAmB,KAAK,KAAK;AAClC,SAAK,aAAa;AAClB,WAAO;AAAA,EACX;AAAA,EACA,GAAG,OAAO,OAAO;AACb,QAAI,CAAC,KAAK,eAAe,KAAK,GAAG;AAC7B,YAAM,IAAI,MAAM,2BAA2B,KAAK,GAAG;AAAA,IACvD;AACA,SAAK,qBAAqB,KAAK,sBAAsB,CAAC;AACtD,SAAK,mBAAmB,KAAK,KAAK;AAClC,SAAK,sBAAsB;AAC3B,SAAK,aAAa;AAClB,WAAO;AAAA,EACX;AAAA,EACA,IAAI,OAAO,OAAO;AACd,QAAI,CAAC,KAAK,eAAe,KAAK,GAAG;AAC7B,YAAM,IAAI,MAAM,4BAA4B,KAAK,GAAG;AAAA,IACxD;AACA,SAAK,qBAAqB,KAAK,sBAAsB,CAAC;AACtD,SAAK,mBAAmB,KAAK,KAAK;AAClC,SAAK,aAAa;AAClB,WAAO;AAAA,EACX;AAAA,EACA,eAAe,OAAO;AAClB,UAAM,0BAA0B,KAAK,oBAAoB,UAAU;AACnE,UAAM,0BAA0B,KAAK,oBAAoB,UAAU;AACnE,QAAI,0BAA0B,yBAAyB;AAEnD,aAAO;AAAA,IACX;AACA,QAAI,4BAA4B,2BAC5B,KAAK,YAAY;AAEjB,aAAO;AAAA,IACX;AACA,WAAQ,0BAA0B,KAAK,YAAY,UAC/C,KAAK,YAAY,uBAAuB,MAAM;AAAA,EACtD;AAAA,EACA,eAAe,OAAO;AAClB,UAAM,0BAA0B,KAAK,oBAAoB,UAAU;AACnE,UAAM,0BAA0B,KAAK,oBAAoB,UAAU;AACnE,QAAI,0BAA0B,yBAAyB;AAEnD,aAAO;AAAA,IACX;AACA,QAAI,4BAA4B,2BAC5B,KAAK,YAAY;AAEjB,aAAO;AAAA,IACX;AACA,WAAQ,0BAA0B,KAAK,YAAY,UAC/C,KAAK,YAAY,uBAAuB,MAAM;AAAA,EACtD;AACJ;AAkCO,SAAS,aAAa,SAAS,oBAAoB;AACtD,SAAO,IAAI,aAAa,SAAS,kBAAkB;AACvD;AACO,IAAM,eAAN,MAAM,sBAAqB,YAAY;AAAA,EAC1C;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA,YAAY,SAAS,oBAAoB;AACrC,UAAM;AACN,QAAI,QAAQ,WAAW,GAAG;AACtB,YAAM,IAAI,MAAM,qCAAqC;AAAA,IACzD;AACA,SAAK,SAAS,QAAQ,QAAQ,IAAI,CAACC,YAAWA,QAAO,SAAS,CAAC,GAAG,4CAA4C;AAC9G,SAAK,WAAW,QAAQ,IAAI,CAACA,YAAW,IAAI,cAAcA,SAAQ,kBAAkB,CAAC;AACrF,SAAK,eAAe,QAAQ,KAAK,SAAS,IAAI,CAACA,YAAWA,QAAO,eAAe,CAAC,GAAG,6EAA6E;AAEjK,SAAK,uBAAuB,aAAa,KAAK,SAAS,IAAI,CAACA,YAAWA,QAAO,uBAAuB,CAAC,CAAC;AAAA,EAC3G;AAAA,EACA,aAAa,iBAAiB,OAAO;AACjC,UAAM,YAAY,KAAK,SAAS,IAAI,CAACA,YAAWA,QAAO,aAAa,cAAc,CAAC;AACnF,UAAM,sBAAsB,KAAK,WAAW,QAAQ,IAAI;AACxD,WAAO;AAAA,MACH,CAAC,OAAO,aAAa,IAAI;AACrB,cAAM,YAAY,UAAU,IAAI,CAAC,aAAa,SAAS,OAAO,aAAa,EAAE,CAAC;AAC9E,cAAM,UAAU,MAAM,UAAU,MAAM;AAEtC,cAAM,mBAAmB,MAAM,UAAU,MAAM,EAAE,KAAK,CAAC;AACvD,eAAO;AAAA,UACH,MAAM,OAAO;AACT,gBAAI,yBAAyB;AAE7B,kBAAM,QAAQ,IAAI,UAAU,IAAI,OAAO,UAAU,MAAM;AACnD,kBAAI,CAAC,QAAQ,CAAC,GAAG;AACb,sBAAM,SAAS,MAAM,SAAS,KAAK;AACnC,wBAAQ,CAAC,IAAI;AAEb,oBAAI,kBAAkB,CAAC,OAAO,QAAQ,OAAO,OAAO;AAChD,mCAAiB,CAAC,IAAI,OAAO,MAAM,CAAC;AAAA,gBACxC;AAAA,cACJ;AAAA,YACJ,CAAC,CAAC;AAEF,gBAAI,gBAAgB;AAChB,uBAAS,IAAI,GAAG,IAAI,iBAAiB,QAAQ,KAAK;AAC9C,0CAA0B,iBAAiB,CAAC;AAC5C,iCAAiB,CAAC,IAAI;AAAA,cAC1B;AAAA,YACJ;AAEA,gBAAI,sBAAsB;AAC1B,qBAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;AACrC,oBAAM,SAAS,QAAQ,CAAC;AACxB,kBAAI,OAAO,QAAQ,CAAC,OAAO,OAAO;AAC9B;AAAA,cACJ;AACA,oBAAM,CAACC,IAAG,cAAc,IAAI,OAAO;AACnC,kBAAI,wBAAwB,QAAW;AACnC,sCAAsB,CAAC,gBAAgB,CAAC;AACxC;AAAA,cACJ;AACA,oBAAM,CAAC,OAAO,IAAI;AAClB,kBAAI,YAAY,EAAE,OAAO,gBAAgB,MAAM,QAAQ,GAAG,EAAE,OAAO,SAAS,MAAM,QAAQ,CAAC,IACvF,sBACA,GAAG;AACH,sCAAsB,CAAC,gBAAgB,CAAC;AAAA,cAC5C;AAAA,YACJ;AACA,gBAAI,wBAAwB,QAAW;AACnC,qBAAO,EAAE,MAAM,MAAM,OAAO,OAAU;AAAA,YAC1C;AACA,kBAAM,CAAC,GAAG,QAAQ,IAAI;AACtB,kBAAM,CAAC,KAAK,QAAQ,IAAI,QAAQ,QAAQ,EAAE;AAE1C,oBAAQ,QAAQ,IAAI;AACpB,mBAAO;AAAA,cACH,MAAM;AAAA,cACN,OAAO,CAAC,KAAK,UAAU,sBAAsB;AAAA,YACjD;AAAA,UACJ;AAAA,QACJ;AAAA,MACJ;AAAA,IACJ;AAAA,EACJ;AAAA,EACA,WAAW;AACP,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,yBAAyB;AACrB,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,iBAAiB;AACb,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,OAAO,aAAa;AAChB,WAAO,IAAI,cAAa,KAAK,SAAS,IAAI,CAACD,YAAWA,QAAO,OAAO,WAAW,CAAC,GAAG,KAAK,YAAY;AAAA,EACxG;AACJ;AACA,SAAS,QAAQ,QAAQ,cAAc;AACnC,QAAM,QAAQ,OAAO,CAAC;AACtB,aAAW,SAAS,QAAQ;AACxB,QAAI,cAAc,OAAO,KAAK,GAAG;AAC7B,YAAM,IAAI,MAAM,YAAY;AAAA,IAChC;AAAA,EACJ;AACA,SAAO;AACX;AACA,SAAS,aAAa,QAAQ;AAC1B,MAAIF,gBAAe,OAAO,CAAC;AAC3B,aAAW,SAAS,QAAQ;AACxB,aAAS,IAAI,GAAG,IAAIA,cAAa,QAAQ,KAAK;AAC1C,UAAI,KAAK,MAAM,UAAU,cAAcA,cAAa,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG;AAC/D,QAAAA,gBAAeA,cAAa,MAAM,GAAG,CAAC;AACtC;AAAA,MACJ;AAAA,IACJ;AAAA,EACJ;AACA,SAAOA;AACX;AAmBA,IAAM,gBAAN,MAAM,uBAAsB,YAAY;AAAA,EACpC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA,eAAe,SAAS;AACpB,UAAM;AACN,SAAK,WAAW;AAChB,QAAI,QAAQ,WAAW,GAAG;AACtB,YAAM,IAAI,MAAM,sCAAsC;AAAA,IAC1D;AACA,SAAK,SAAS,QAAQ,QAAQ,IAAI,CAACE,YAAWA,QAAO,SAAS,CAAC,GAAG,wEAAwE;AAC1I,SAAK,eAAe,QAAQ,QAAQ,IAAI,CAACA,YAAWA,QAAO,eAAe,CAAC,GAAG,8EAA8E;AAC5J,SAAK,uBAAuB,aAAa,QAAQ,IAAI,CAACA,YAAWA,QAAO,uBAAuB,CAAC,CAAC;AAAA,EACrG;AAAA,EACA,aAAa,iBAAiB,OAAO;AACjC,UAAM,YAAY,KAAK,SAAS,IAAI,CAACA,YAAWA,QAAO,aAAa,cAAc,CAAC;AACnF,UAAM,sBAAsB,KAAK,WAAW,QAAQ,IAAI;AACxD,QAAI,mBAAmB;AACvB,WAAO;AAAA,MACH,CAAC,OAAO,aAAa,IAAI;AACrB,cAAM,YAAY,UAAU,IAAI,CAAC,aAAa,SAAS,OAAO,aAAa,EAAE,CAAC;AAC9E,eAAO;AAAA,UACH,MAAM,OAAO;AACT,mBAAO,UAAU,SAAS,GAAG;AACzB,oBAAM,SAAS,MAAM,UAAU,CAAC,EAAE,KAAK;AACvC,kBAAI,OAAO,MAAM;AACb,0BAAU,MAAM;AAAA,cACpB,OACK;AACD,sBAAM,CAAC,GAAG,QAAQ,IAAI,OAAO;AAC7B,oBAAI,qBAAqB,UACrB,YAAY;AAAA,kBACR,OAAO;AAAA,kBACP,MAAM;AAAA,gBACV,GAAG;AAAA,kBACC,OAAO;AAAA,kBACP,MAAM;AAAA,gBACV,CAAC,IACG,sBACA,GAAG;AACP,wBAAM,IAAI,MAAM,iCAAiC,KAAK,UAAU,gBAAgB,CAAC,KAAK,KAAK,UAAU,QAAQ,CAAC,EAAE;AAAA,gBACpH;AACA,mCAAmB;AACnB,uBAAO;AAAA,cACX;AAAA,YACJ;AACA,mBAAO,EAAE,MAAM,MAAM,OAAO,OAAU;AAAA,UAC1C;AAAA,QACJ;AAAA,MACJ;AAAA,IACJ;AAAA,EACJ;AAAA,EACA,WAAW;AACP,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,yBAAyB;AACrB,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,iBAAiB;AACb,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,OAAO,aAAa;AAChB,WAAO,IAAI,eAAc,GAAG,KAAK,SAAS,IAAI,CAACA,YAAWA,QAAO,OAAO,WAAW,CAAC,CAAC;AAAA,EACzF;AACJ;AACA,IAAM,wBAAN,MAA4B;AAAA,EACxB;AAAA,EACA;AAAA,EACA,oBAAoB;AAAA,EACpB;AAAA,EACA;AAAA,EACA;AAAA,EACA,YAAY,aAAa,QAAQ,mBAAmB,gBAAgB;AAChE,SAAK,iBAAiB,YACjB,aAAa,cAAc,EAAE,OAAO,aAAa,EAAE;AACxD,SAAK,eAAe;AACpB,SAAK,UAAU;AACf,SAAK,qBAAqB;AAC1B,SAAK,kBAAkB;AAAA,EAC3B;AAAA,EACA,2BAA2B;AAGvB,UAAM,WAAW,KAAK,mBAAmB,IAAI,MAAM,IAAI;AACvD,WAAO,IAAI,gBAAgB,MAAM,KAAK,aAAa,SAAS,GAAG,KAAK,oBAAoB,UAAU,QAAQ;AAAA,EAC9G;AAAA,EACA,MAAM,oBAAoB,MAAM;AAC5B,UAAM,CAAC,GAAG,UAAU,SAAS,IAAI;AACjC,QAAI;AACJ,QAAI,MAAM,MAAM;AACZ,oBAAc,KAAK,yBAAyB;AAAA,IAChD,OACK;AACD,oBAAc,MAAM,KAAK,QAAQ,CAAC;AAClC,UAAI,CAAC,iBAAiB,YAAY,eAAe,GAAG,KAAK,kBAAkB,GAAG;AAC1E,cAAM,IAAI,MAAM,yEAAyE,KAAK,UAAU,YAAY,eAAe,CAAC,CAAC,OAAO,KAAK,UAAU,KAAK,kBAAkB,CAAC,EAAE;AAAA,MACzL;AACA,UAAI,YAAY,SAAS,MAAM,KAAK,aAAa,SAAS,GAAG;AACzD,cAAM,IAAI,MAAM,sEAAsE,YAAY,SAAS,CAAC,OAAO,KAAK,aAAa,SAAS,CAAC,EAAE;AAAA,MACrJ;AAAA,IACJ;AACA,SAAK,oBAAoB;AAAA,MACrB;AAAA,MACA;AAAA,MACA,eAAe,YACV,aAAa,KAAK,eAAe,EAAE,OAAO,aAAa,EAAE;AAAA,MAC9D,OAAO;AAAA,MACP;AAAA,IACJ;AAAA,EACJ;AAAA,EACA,MAAM,OAAO;AACT,QAAI,KAAK,sBAAsB,MAAM;AACjC,YAAME,UAAS,MAAM,KAAK,eAAe,KAAK;AAC9C,UAAIA,QAAO,MAAM;AACb,eAAO,EAAE,MAAM,MAAM,OAAO,OAAU;AAAA,MAC1C;AACA,YAAM,KAAK,oBAAoBA,QAAO,KAAK;AAC3C,aAAO,MAAM,KAAK,KAAK;AAAA,IAC3B;AACA,UAAM,SAAS,MAAM,KAAK,kBAAkB,cAAc,KAAK;AAC/D,QAAI,OAAO,MAAM;AACb,UAAI,KAAK,kBAAkB,QAAQ,GAAG;AAClC,aAAK,oBAAoB;AAAA,MAC7B,OACK;AAID,aAAK,kBAAkB,gBAAgB,KAAK,yBAAyB,EAChE,aAAa,KAAK,eAAe,EAAE,OAAO,aAAa,EAAE;AAAA,MAClE;AACA,aAAO,MAAM,KAAK,KAAK;AAAA,IAC3B;AACA,UAAM,CAAC,GAAG,UAAU,cAAc,IAAI,OAAO;AAC7C,SAAK,kBAAkB;AACvB,UAAM,eAAe,CAAC,GAAG,KAAK,kBAAkB,UAAU,GAAG,QAAQ;AAErE,UAAM,aAAa,KAAK,kBAAkB,UAAU,IAC9C,KAAK,kBAAkB,YACvB,KAAK;AACX,WAAO,EAAE,MAAM,OAAO,OAAO,CAAC,GAAG,cAAc,SAAS,EAAE;AAAA,EAC9D;AACJ;AACA,IAAM,gBAAN,MAAM,uBAAsB,YAAY;AAAA,EACpC;AAAA,EACA;AAAA,EACA;AAAA,EACA,YAAYF,SAAQ,QAAQ,mBAAmB;AAC3C,UAAM;AACN,SAAK,UAAUA;AACf,SAAK,UAAU;AACf,SAAK,qBAAqB;AAAA,EAC9B;AAAA,EACA,aAAa,iBAAiB,OAAO;AACjC,UAAM,cAAc,KAAK;AACzB,UAAM,SAAS,KAAK;AACpB,UAAM,oBAAoB,KAAK;AAC/B,WAAO;AAAA,MACH,CAAC,OAAO,aAAa,IAAI;AACrB,eAAO,IAAI,sBAAsB,aAAa,QAAQ,mBAAmB,cAAc;AAAA,MAC3F;AAAA,IACJ;AAAA,EACJ;AAAA,EACA,WAAW;AACP,WAAO,KAAK,QAAQ,SAAS;AAAA,EACjC;AAAA,EACA,yBAAyB;AACrB,WAAO,KAAK,QAAQ,uBAAuB;AAAA,EAC/C;AAAA,EACA,iBAAiB;AACb,WAAO,CAAC,GAAG,KAAK,QAAQ,eAAe,GAAG,GAAG,KAAK,kBAAkB;AAAA,EACxE;AAAA,EACA,OAAO,aAAa;AAChB,UAAM,cAAc,KAAK,QAAQ,eAAe,EAAE;AAClD,UAAM,kBAAkB,YAAY,WAAW,MAAM,GAAG,WAAW;AACnE,UAAM,kBAAkB,YAAY,WAAW,MAAM,GAAG,WAAW;AACnE,UAAM,kBAAkB,YAAY,WAAW,MAAM,WAAW;AAChE,UAAM,kBAAkB,YAAY,WAAW,MAAM,WAAW;AAChE,UAAM,mBAAmB;AAAA,MACrB,YAAY;AAAA,MACZ,qBAAqB,gBAAgB,WAAW,IAAI,YAAY,sBAAsB;AAAA,MACtF,YAAY;AAAA,MACZ,qBAAqB,gBAAgB,WAAW,IAAI,YAAY,sBAAsB;AAAA,IAC1F;AACA,UAAM,mBAAmB;AAAA,MACrB,YAAY;AAAA,MACZ,qBAAqB,gBAAgB,WAAW,IAAI,OAAO,YAAY;AAAA,MACvE,YAAY;AAAA,MACZ,qBAAqB,gBAAgB,WAAW,IAAI,OAAO,YAAY;AAAA,IAC3E;AACA,WAAO,IAAI,eAAc,KAAK,QAAQ,OAAO,gBAAgB,GAAG,OAAO,MAAM;AACzE,YAAM,cAAc,MAAM,KAAK,QAAQ,CAAC;AACxC,aAAO,YAAY,OAAO,gBAAgB;AAAA,IAC9C,GAAG,KAAK,kBAAkB;AAAA,EAC9B;AACJ;AACO,IAAM,kBAAN,MAAM,yBAAwB,YAAY;AAAA,EAC7C;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA,YAAY,OAAO,QAAQ,OAAO,aAAa,UAAU,qBAAqB,YAAY,GAAG;AACzF,UAAM;AACN,SAAK,SAAS;AACd,SAAK,SAAS;AACd,SAAK,eAAe;AACpB,SAAK,YAAY;AACjB,SAAK,uBAAuB;AAC5B,SAAK,aAAa;AAClB,QAAI,SAAS,WAAW,YAAY,QAAQ;AACxC,YAAM,IAAI,MAAM,sDAAsD,KAAK,UAAU,QAAQ,CAAC,OAAO,KAAK,UAAU,WAAW,CAAC,EAAE;AAAA,IACtI;AAAA,EACJ;AAAA,EACA,aAAa,kBAAkB,OAAO;AAClC,UAAM,QAAQ,KAAK;AACnB,UAAM,WAAW,KAAK;AACtB,UAAM,YAAY,KAAK;AACvB,WAAO;AAAA,MACH,CAAC,OAAO,aAAa,IAAI;AACrB,YAAI,OAAO;AACX,eAAO;AAAA,UACH,MAAM,OAAO;AACT,gBAAI,MAAM;AACN,qBAAO,EAAE,MAAM,MAAM,OAAO,OAAU;AAAA,YAC1C;AACA,mBAAO;AACP,mBAAO;AAAA,cACH,MAAM;AAAA,cACN,OAAO,CAAC,OAAO,UAAU,SAAS;AAAA,YACtC;AAAA,UACJ;AAAA,QACJ;AAAA,MACJ;AAAA,IACJ;AAAA,EACJ;AAAA,EACA,WAAW;AACP,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,iBAAiB;AACb,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,yBAAyB;AACrB,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,OAAO,aAAa;AAChB,UAAM,oBAAoB,YAAY;AAAA,MAClC,OAAO,YAAY;AAAA,MACnB,MAAM,YAAY,sBAAsB,UAAU;AAAA,IACtD,GAAG;AAAA,MACC,OAAO,KAAK;AAAA,MACZ,MAAM;AAAA,IACV,CAAC;AACD,UAAM,oBAAoB,YAAY;AAAA,MAClC,OAAO,KAAK;AAAA,MACZ,MAAM;AAAA,IACV,GAAG;AAAA,MACC,OAAO,YAAY;AAAA,MACnB,MAAM,YAAY,sBAAsB,UAAU;AAAA,IACtD,CAAC;AAED,QAAI,qBAAqB,KAAK,qBAAqB,GAAG;AAClD,aAAO,IAAI,iBAAgB,KAAK,QAAQ,KAAK,QAAQ,KAAK,cAAc,KAAK,WAAW,KAAK,oBAAoB;AAAA,IACrH;AACA,WAAO,IAAI,YAAY,KAAK,QAAQ,KAAK,YAAY;AAAA,EACzD;AACJ;AAOO,IAAM,cAAN,cAA0B,YAAY;AAAA,EACzC;AAAA,EACA;AAAA,EACA,YAAY,OAAO,aAAa;AAC5B,UAAM;AACN,SAAK,SAAS;AACd,SAAK,eAAe;AAAA,EACxB;AAAA,EACA,aAAa,kBAAkB,OAAO;AAClC,WAAO;AAAA,MACH,CAAC,OAAO,aAAa,IAAI;AACrB,eAAO;AAAA,UACH,MAAM,OAAO;AACT,mBAAO,EAAE,MAAM,MAAM,OAAO,OAAU;AAAA,UAC1C;AAAA,QACJ;AAAA,MACJ;AAAA,IACJ;AAAA,EACJ;AAAA,EACA,WAAW;AACP,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,iBAAiB;AACb,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,yBAAyB;AACrB,WAAO,CAAC;AAAA,EACZ;AAAA,EACA,OAAO,cAAc;AACjB,WAAO;AAAA,EACX;AACJ;AACA,SAAS,qBAAqB,aAAa;AAEvC,MAAI,CAAC,YAAY,SAAS,eAAe,GAAG;AAExC,QAAI,YAAY,WAAW,KAAK,YAAY,CAAC,MAAM,OAAO;AACtD,kBAAY,KAAK,eAAe;AAAA,IACpC;AAAA,EACJ;AACA,MAAI,CAAC,YAAY,SAAS,KAAK,GAAG;AAC9B,gBAAY,KAAK,KAAK;AAAA,EAC1B;AACJ;AAIA,UAAU,uBAAuBA,SAAQ;AACrC,QAAM,4BAA4BA,QAAO,uBAAuB,EAAE;AAClE,QAAM,oBAAoBA,QAAO,eAAe;AAChD,WAAS,IAAI,GAAG,KAAK,2BAA2B,KAAK;AACjD,UAAM,kBAAkB,MAAM,CAAC;AAAA,EACnC;AACJ;AACA,IAAM,gBAAN,MAAM,uBAAsB,YAAY;AAAA,EACpC;AAAA,EACA;AAAA,EACA;AAAA,EACA,YAAYA,SAAQ,aAAa;AAC7B,UAAM;AACN,SAAK,UAAUA;AACf,SAAK,eAAe;AACpB,yBAAqB,KAAK,YAAY;AAGtC,UAAM,oBAAoBA,QAAO,eAAe;AAChD,UAAM,sBAAsB,MAAM,KAAK,uBAAuBA,OAAM,CAAC;AACrE,QAAI,CAAC,oBAAoB,KAAK,CAACG,yBAAwB,iBAAiBA,sBAAqB,WAAW,CAAC,GAAG;AACxG,YAAM,IAAI,MAAM,yEAAyE,KAAK,UAAU,WAAW,CAAC,KAAK,KAAK,UAAU,iBAAiB,CAAC,KAAKH,QAAO,uBAAuB,EAAE,MAAM,mBAAmB;AAAA,IAC5N;AACA,SAAK,gBAAgBA,QAChB,uBAAuB,EACvB,MAAM,GAAG,kBAAkB,SAAS,YAAY,MAAM;AAAA,EAC/D;AAAA,EACA,WAAW;AACP,WAAO,KAAK,QAAQ,SAAS;AAAA,EACjC;AAAA,EACA,yBAAyB;AACrB,WAAO,KAAK,QACP,uBAAuB,EACvB,MAAM,KAAK,cAAc,MAAM;AAAA,EACxC;AAAA,EACA,iBAAiB;AACb,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,aAAa,iBAAiB,OAAO;AACjC,UAAM,WAAW,KAAK,QAAQ,aAAa,cAAc;AACzD,UAAM,eAAe,KAAK;AAC1B,WAAO;AAAA,MACH,CAAC,OAAO,aAAa,IAAI;AACrB,cAAM,WAAW,SAAS,OAAO,aAAa,EAAE;AAChD,eAAO;AAAA,UACH,MAAM,OAAO;AACT,kBAAM,SAAS,MAAM,SAAS,KAAK;AACnC,gBAAI,OAAO,MAAM;AACb,qBAAO;AAAA,YACX;AACA,kBAAM,CAAC,KAAK,UAAU,SAAS,IAAI,OAAO;AAC1C,mBAAO;AAAA,cACH,MAAM;AAAA,cACN,OAAO,CAAC,KAAK,SAAS,MAAM,aAAa,MAAM,GAAG,SAAS;AAAA,YAC/D;AAAA,UACJ;AAAA,QACJ;AAAA,MACJ;AAAA,IACJ;AAAA,EACJ;AAAA,EACA,OAAO,aAAa;AAChB,WAAO,IAAI,eAAc,KAAK,QAAQ,OAAO;AAAA,MACzC,YAAY,CAAC,GAAG,KAAK,eAAe,GAAG,YAAY,UAAU;AAAA,MAC7D,qBAAqB,YAAY;AAAA,MACjC,YAAY,CAAC,GAAG,KAAK,eAAe,GAAG,YAAY,UAAU;AAAA,MAC7D,qBAAqB,YAAY;AAAA,IACrC,CAAC,GAAG,KAAK,YAAY;AAAA,EACzB;AACJ;AACA,IAAM,iBAAN,MAAM,wBAAuB,YAAY;AAAA,EACrC;AAAA,EACA;AAAA,EACA;AAAA,EACA,YAAYA,SAAQ,qBAAqB;AACrC,UAAM;AACN,SAAK,UAAUA;AACf,SAAK,uBAAuB;AAE5B,QAAI,4BAA4B;AAChC,eAAW,uBAAuB,uBAAuBA,OAAM,GAAG;AAC9D,YAAM,SAAS,oBAAoB,MAAM,GAAG,oBAAoB,MAAM;AACtE,UAAI,iBAAiB,QAAQ,mBAAmB,GAAG;AAC/C,cAAM,iBAAiBA,QAAO,eAAe,EAAE,SAAS,oBAAoB;AAC5E,oCAA4B,iBAAiB,oBAAoB;AACjE;AAAA,MACJ;AAAA,IACJ;AACA,QAAI,8BAA8B,QAAW;AACzC,YAAM,IAAI,MAAM,+EAA+E,KAAK,UAAU,mBAAmB,CAAC,KAAK,KAAK,UAAUA,QAAO,eAAe,CAAC,CAAC,KAAKA,QAAO,uBAAuB,EAAE,MAAM,mBAAmB;AAAA,IAChP;AACA,SAAK,6BAA6B;AAAA,EACtC;AAAA,EACA,aAAa,iBAAiB,OAAO;AACjC,UAAMA,UAAS,KAAK;AACpB,UAAM,4BAA4B,KAAK;AACvC,WAAO;AAAA,MACH,CAAC,OAAO,aAAa,IAAI;AACrB,YAAI,gBAAgBA;AACpB,YAAI,kBAAkB,cACjB,aAAa,cAAc,EAAE,OAAO,aAAa,EAAE;AACxD,eAAO;AAAA,UACH,MAAM,OAAO;AACT,kBAAM,SAAS,MAAM,gBAAgB,KAAK;AAC1C,gBAAI,OAAO,MAAM;AACb,qBAAO,EAAE,MAAM,MAAM,OAAO,OAAU;AAAA,YAC1C;AACA,kBAAM,CAAC,KAAK,UAAU,SAAS,IAAI,OAAO;AAC1C,gBAAI,QAAQ,MAAM;AAMd,qBAAO;AAAA,gBACH,MAAM;AAAA,gBACN,OAAO,CAAC,MAAM,UAAU,SAAS;AAAA,cACrC;AAAA,YACJ;AACA,kBAAM,mBAAmB,SAAS,MAAM,GAAG,yBAAyB;AACpE,gBAAIA,QAAO,SAAS,MAAM,OAAO;AAC7B,8BAAgB,cAAc,OAAO;AAAA,gBACjC,YAAY;AAAA,gBACZ,qBAAqB;AAAA,gBACrB,YAAY,CAAC;AAAA,gBACb,qBAAqB;AAAA,cACzB,CAAC;AAAA,YACL,OACK;AACD,8BAAgB,cAAc,OAAO;AAAA,gBACjC,YAAY,CAAC;AAAA,gBACb,qBAAqB;AAAA,gBACrB,YAAY;AAAA,gBACZ,qBAAqB;AAAA,cACzB,CAAC;AAAA,YACL;AACA,8BAAkB,cACb,aAAa,cAAc,EAAE,OAAO,aAAa,EAAE;AACxD,mBAAO;AAAA,UACX;AAAA,QACJ;AAAA,MACJ;AAAA,IACJ;AAAA,EACJ;AAAA,EACA,OAAO,aAAa;AAChB,UAAM,oBAAoB;AAAA,MACtB,GAAG;AAAA,MACH,YAAY,YAAY,WAAW,MAAM,GAAG,KAAK,0BAA0B;AAAA,MAC3E,YAAY,YAAY,WAAW,MAAM,GAAG,KAAK,0BAA0B;AAAA,IAC/E;AACA,WAAO,IAAI,gBAAe,KAAK,QAAQ,OAAO,iBAAiB,GAAG,KAAK,oBAAoB;AAAA,EAC/F;AAAA,EACA,WAAW;AACP,WAAO,KAAK,QAAQ,SAAS;AAAA,EACjC;AAAA,EACA,iBAAiB;AACb,WAAO,KAAK,QAAQ,eAAe;AAAA,EACvC;AAAA,EACA,yBAAyB;AACrB,WAAO,KAAK,QAAQ,uBAAuB;AAAA,EAC/C;AACJ;AACA,SAAS,iBAAiB,cAAc,cAAc;AAClD,MAAI,aAAa,WAAW,aAAa,QAAQ;AAC7C,WAAO;AAAA,EACX;AACA,WAAS,IAAI,GAAG,IAAI,aAAa,QAAQ,KAAK;AAC1C,QAAI,aAAa,CAAC,MAAM,aAAa,CAAC,GAAG;AACrC,aAAO;AAAA,IACX;AAAA,EACJ;AACA,SAAO;AACX;AACA,SAAS,gBAAgBI,IAAG,OAAO;AAC/B,MAAI,SAASA,GAAE,QAAQ;AACnB,WAAO;AAAA,EACX;AACA,SAAO,EAAE,MAAM,SAAS,OAAOA,GAAE,KAAK,EAAE;AAC5C;AACA,SAAS,sBAAsB,gBAAgB,eAAe,YAAY,WAAW;AACjF,MAAI,mBAAmB,WAAW,kBAAkB,SAAS;AACzD,UAAM,IAAI,MAAM,wCAAwC,KAAK,UAAU,WAAW,KAAK,CAAC,KAAK,KAAK,UAAU,UAAU,KAAK,CAAC,EAAE;AAAA,EAClI;AACA,MAAI,mBAAmB,SAAS;AAC5B,UAAM,IAAI,MAAM,qCAAqC,KAAK,UAAU,WAAW,KAAK,CAAC,KAAK,KAAK,UAAU,UAAU,KAAK,CAAC,EAAE;AAAA,EAC/H;AACA,MAAI,mBAAmB,iBAAiB,kBAAkB,aAAa;AAEnE,WAAO;AAAA,EACX;AACA,MAAI,mBAAmB,eAAe,kBAAkB,eAAe;AAEnE,WAAO;AAAA,EACX;AACA,MAAI,mBAAmB,iBAAiB,kBAAkB,eAAe;AAErE,WAAO;AAAA,EACX;AACA,MAAI,mBAAmB,eAAe,kBAAkB,aAAa;AAEjE,WAAO;AAAA,EACX;AACA,MAAI,mBAAmB,iBAAiB,kBAAkB,SAAS;AAC/D,WAAO;AAAA,EACX;AACA,MAAI,mBAAmB,eAAe,kBAAkB,SAAS;AAC7D,WAAO;AAAA,EACX;AACA,QAAM,IAAI,MAAM,yBAAyB,cAAc,KAAK,aAAa,EAAE;AAC/E;AACA,SAAS,YAAY,MAAM,MAAM;AAC7B,MAAI,IAAI;AACR,SAAO,IAAI,KAAK,IAAI,KAAK,MAAM,QAAQ,KAAK,MAAM,MAAM,GAAG;AACvD,UAAM,KAAK,gBAAgB,KAAK,OAAO,CAAC;AACxC,UAAM,KAAK,gBAAgB,KAAK,OAAO,CAAC;AACxC,QAAI,OAAO,QAAW;AAClB,aAAO,sBAAsB,KAAK,MAAM,KAAK,MAAM,MAAM,IAAI;AAAA,IACjE;AACA,QAAI,OAAO,QAAW;AAClB,aAAO,KAAK,sBAAsB,KAAK,MAAM,KAAK,MAAM,MAAM,IAAI;AAAA,IACtE;AACA,UAAM,SAAS,cAAc,GAAG,OAAO,GAAG,KAAK;AAC/C,QAAI,WAAW,GAAG;AACd,aAAO;AAAA,IACX;AAEA;AAAA,EACJ;AACA,MAAI,KAAK,SAAS,KAAK,MAAM;AACzB,WAAO;AAAA,EACX;AAEA,MAAI,KAAK,SAAS,SAAS;AACvB,QAAI,KAAK,SAAS,aAAa;AAC3B,aAAO;AAAA,IACX,OACK;AACD,aAAO;AAAA,IACX;AAAA,EACJ;AACA,MAAI,KAAK,SAAS,eAAe;AAC7B,WAAO;AAAA,EACX;AACA,MAAI,KAAK,SAAS,aAAa;AAC3B,WAAO;AAAA,EACX;AAGA,QAAM,IAAI,MAAM,wBAAwB,KAAK,IAAI,EAAE;AACvD;AACA,SAAS,gBAAgB,KAAK;AAC1B,SAAO,KAAK,UAAU,aAAa,IAAI,IAAI,CAACA,OAAMA,OAAM,SAClD,cACA,OAAOA,OAAM,YAAYA,GAAE,SAAS,WAAW;AAAA;AAAA;AAAA,IAGzC,MAAMA;AAAA,MACRA,EAAC,CAAC,CAAC;AACjB;AACA,SAAS,kBAAkB,QAAQ;AAC/B,SAAO,aAAa,KAAK,MAAM,MAAM,CAAC,EAAE,IAAI,CAACA,OAAM;AAC/C,QAAI,OAAOA,OAAM,UAAU;AACvB,UAAIA,OAAM,aAAa;AAInB,eAAO;AAAA,MACX;AACA,UAAIA,GAAE,SAAS,WAAW,GAAG;AAKzB,eAAOA,GAAE,MAAM,CAAC;AAAA,MACpB;AAAA,IACJ;AACA,WAAOA;AAAA,EACX,CAAC;AACL;;;ACx3CO,IAAM,gBAAgB,CAC3B,kBACA,OACA,UACY;AACZ,QAAM,SAAS,iBAAiB,KAAK,GAAG;AACxC,MAAI,CAAC,QAAQ;AACX,WAAO;AAAA,EACT;AACA,SAAO,OAAO,QAAQ,MAAM,EACzB,OAAO,CAAC,CAAC,EAAE,KAAK,MAAM,MAAM,MAAM,EAClC,IAAI,CAAC,CAAC,GAAG,MAAM,GAAG,EAClB,SAAS,KAAK;AACnB;AAEO,IAAM,kBAAkB,CAC7B,kBACA,OACA,UACY;AACZ,aAAW,SAAS,OAAO,KAAK,KAAK,GAAG;AACtC,QAAI,cAAc,kBAAkB,OAAO,KAAK,GAAG;AACjD,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;AAEO,IAAM,YAAY,CACvB,QACA,SACG;AACH,OACG,KAAK,OAAO,UAAU,KAAK,KAC5B,KAAK,OAAO,KAAK,CAAC,MAAM,EAAE,cAAc,IAAI,GAC5C;AACA,UAAM,IAAI;AAAA,MACR,mIAAmI,KAAK,UAAU,KAAK,KAAK,CAAC;AAAA,IAC/J;AAAA,EACF;AACA,QAAM,QAAQ,KAAK,OAAO,OAAO,CAAC,MAAM;AACtC,YACG,CAAC,EAAE,YACF,CAAC,MAAM,MAAM,OAAO,MAAM,MAAM,OAAO,QAAQ,EAAE;AAAA,MAC/C,EAAE;AAAA,IACJ,MACF,EAAE,UAAU;AAAA,EAEhB,CAAC;AACD,MAAI,CAAC,OAAO,UAAU,CAAC,KAAK,QAAQ;AAClC;AAAA,EACF;AACA,QAAM,cACJ,OAAO,OAAO,CAAC,MAAM,EAAE,aAAa,QAAQ,EAAE,aAAa,KAAK,KAAK,CAAC;AACxE,MAAI,YAAY,SAAS,GAAG;AAC1B,UAAM,IAAI;AAAA,MACR,uDAAuD,KAAK,UAAU,KAAK,CAAC;AAAA,IAC9E;AAAA,EACF;AACA,QAAM,cACJ,OAAO,OAAO,CAAC,MAAM,EAAE,aAAa,QAAQ,EAAE,aAAa,KAAK,KAAK,CAAC;AACxE,MAAI,YAAY,SAAS,GAAG;AAC1B,UAAM,IAAI;AAAA,MACR,uDAAuD,KAAK,UAAU,KAAK,CAAC;AAAA,IAC9E;AAAA,EACF;AACA,QAAM,aAAa,YAAY,CAAC;AAChC,QAAM,aAAa,YAAY,CAAC;AAChC,MAAI,cAAc,cAAc,WAAW,UAAU,WAAW,OAAO;AACrE,UAAM,IAAI;AAAA,MACR,yDAAyD,KAAK,UAAU,KAAK,CAAC;AAAA,IAChF;AAAA,EACF;AACA,QAAM,aAAa,YAAY,SAAS,YAAY;AACpD,MACE,cACA,OAAO;AAAA,IACL,CAAC,MAAM,EAAE,UAAU,cAAc,MAAM,cAAc,MAAM;AAAA,EAC7D,GACA;AACA,UAAM,IAAI;AAAA,MACR,8CAA8C,KAAK,UAAU,KAAK,CAAC;AAAA,IACrE;AAAA,EACF;AACA,QAAM,gBACJ,OACI,OAAO,CAAC,MAAM,CAAC,EAAE,YAAY,EAAE,aAAa,IAAI,EACjD,KAAK,CAAC,GAAG,MAAM;AACd,WAAO,EAAE,MAAM,cAAc,EAAE,KAAK;AAAA,EACtC,CAAC,EACA,IAAI,CAAC,MAAM,CAAC,EAAE,OAAO,EAAE,KAAK,CAAC,KAAK,CAAC;AACxC,MAAI,CAAC,eAAe,UAAU,CAAC,cAAc,CAAC,KAAK,QAAQ;AACzD;AAAA,EACF;AACA,QAAM,QAAQ,OAAO,OAAO,KAAK,KAAmC;AACpE,MAAI,CAAC,OAAO;AACV,UAAM,IAAI,MAAM,SAAS,KAAK,KAAK,YAAY;AAAA,EACjD;AACA,QAAM,UAAU,MAAM,UAAU,EAAE;AAClC,QAAM,YAAY,KAAK,QAAQ;AAG/B,QAAM,cAAc,cACjB,IAAI,CAAC,CAAC,KAAK,MAAM,KAAK,EACtB;AAAA,IACC,cAAc,eAAe,cACzB,GAAG,cAAc,SAAS,MAAM,EAAE,GAAG,UAAU,KAC/C;AAAA,EACN,EACC;AAAA,IACC,aAAa,cAAc,eAAe,eAAe,YACrD,GAAG,cAAc,UAAU,aAAa,MAAM,EAAE,GAAG,SAAS,KAC5D;AAAA,EACN,EACC,OAAO,OAAO;AACjB,MAAI,CAAC,YAAY,UAAU,CAAC,cAAc,CAAC,WAAW;AACpD;AAAA,EACF;AAGA,QAAM,QAAQ,CAAC,YAAY,SACvB;AAAA,IACE,QAAQ,CAAC;AAAA,IACT,iBAAiB;AAAA,EACnB,IACA,QAAQ,KAAK,CAAC,EAAE,OAAO,MAA4B;AACjD,UAAM,cAAc,YAAY;AAAA,MAC9B,CAAC,OAAO,QAAQ,UAAU,OAAO,GAAG;AAAA,IACtC;AAGA,UAAM,kBACJ,eAAe,eAAe,cAAc,cACxC,YAAY,WAAW,OAAO,SAC9B;AACN,WAAO,eAAe;AAAA,EACxB,CAAC;AACL,MAAI,CAAC,OAAO;AACV,WAAO,EAAE,YAAY;AAAA,EACvB;AACA,SAAO;AAAA,IACL;AAAA,IACA,OAAO;AAAA,MACL,QAAQ,CAAC,GAAG,MAAM,QAAQ,eAAe;AAAA,MACzC,iBAAiB,MAAM;AAAA,IACzB;AAAA,IACA;AAAA,IACA,QAAQ;AAAA,MACN,IAAI,cAAc,IAAI,CAAC,CAAC,EAAE,KAAK,MAAM,KAAK;AAAA,MAC1C,IAAI,YAAY,aAAa,OAAO,WAAW,QAAQ;AAAA,MACvD,KAAK,YAAY,aAAa,QAAQ,WAAW,QAAQ;AAAA,MACzD,IAAI,YAAY,aAAa,OAAO,WAAW,QAAQ;AAAA,MACvD,KAAK,YAAY,aAAa,QAAQ,WAAW,QAAQ;AAAA,IAC3D;AAAA,EACF;AACF;AAEO,IAAM,oBAAoB,OAG/B,KACA,QACA,kBACA,OACA,OACA,QACG;AACH,MAAI,CAAC,gBAAgB,kBAAkB,OAAO,KAAK,GAAG;AACpD;AAAA,EACF;AACA,aAAW,SAAS,OAAO,KAAK,KAAK,GAAG;AACtC,QAAI,CAAC,cAAc,kBAAkB,OAAO,KAAK,GAAG;AAClD;AAAA,IACF;AACA,UAAM,EAAE,MAAM,IACZ,UAAU,QAAQ;AAAA,MAChB,OAAO;AAAA,MACP,OAAO,CAAC,EAAE,OAAO,UAAU,MAAM,OAAO,MAAM,KAAK,EAAE,CAAC;AAAA,IACxD,CAAC,KAAK,CAAC;AACT,QAAI,CAAC,OAAO;AACV,YAAM,IAAI,MAAM,sBAAsB,KAAK,IAAI,KAAK,EAAE;AAAA,IACxD;AACA,UAAM,cAAc,MAAM,IAAI,GAC3B,MAAM,KAAY,EAClB,UAAU,MAAM,iBAAiB,CAAC,MAAM,EAAE,GAAG,OAAO,MAAM,KAAK,CAAC,CAAC,EACjE,OAAO;AACV,QAAI,eAAe,YAAY,QAAQ,KAAK,KAAK;AAC/C,YAAM,IAAI,MAAM,GAAG,KAAK,IAAI,KAAK,iBAAiB;AAAA,IACpD;AAAA,EACF;AACF;AAEO,IAAM,eAAe,CAI1B,KACAC,YACa;AACb,MAAI,CAAC,KAAK;AACR,WAAO;AAAA,EACT;AACA,MAAI,CAACA,SAAQ,QAAQ;AACnB,WAAO;AAAA,EACT;AACA,SAAOA,QAAO,OAAO,CAAC,KAAK,UAAU;AACnC,IAAC,IAAY,KAAK,IAAI,IAAI,KAAK;AAC/B,WAAO;AAAA,EACT,GAAG,CAAC,CAAM;AACZ;AAEO,IAAM,gBAAgB,CAI3B,KACA,OAEA,gBACY;AACZ,MAAI,CAAC,KAAK;AACR,WAAO;AAAA,EACT;AACA,aAAW,KAAK,SAAS,CAAC,GAAG;AAC3B,QAAI,eAAe,CAAC,YAAY,CAAC,GAAG;AAClC;AAAA,IACF;AACA,UAAM,QAAQ,IAAI,EAAE,KAAyB;AAC7C,UAAM,aAAa,CAAC,KAAmB,SAAyB;AAC9D,UAAI,CAAC,MAAM;AACT,eAAO;AAAA,MACT;AACA,UAAI,CAAC,KAAK;AACR,eAAO;AAAA,MACT;AACA,aAAO,MAAM;AAAA,IACf;AACA,UAAM,gBAAgB,CAAC,KAAmB,SAAyB;AACjE,UAAI,CAAC,KAAK;AACR,eAAO;AAAA,MACT;AACA,UAAI,CAAC,MAAM;AACT,eAAO;AAAA,MACT;AACA,aAAO,MAAM;AAAA,IACf;AACA,UAAM,SAAS,CAACC,OAAmB;AACjC,cAAQA,GAAE,UAAU;AAAA,QAClB,KAAK,YAAY;AACf,iBAAO,OAAO,UAAU,YAAY,MAAM,SAASA,GAAE,KAAe;AAAA,QACtE;AAAA,QACA,KAAK,aAAa;AAChB,iBAAO,OAAO,UAAU,YAAY,MAAM,SAASA,GAAE,KAAe;AAAA,QACtE;AAAA,QACA,KAAK;AAAA,QACL,KAAK,QAAW;AACd,iBAAO,UAAUA,GAAE;AAAA,QACrB;AAAA,QACA,KAAK,MAAM;AACT,iBAAO,cAAc,OAAOA,GAAE,KAAK;AAAA,QACrC;AAAA,QACA,KAAK,OAAO;AACV,iBAAO,UAAUA,GAAE,SAAS,cAAc,OAAOA,GAAE,KAAK;AAAA,QAC1D;AAAA,QACA,KAAK,MAAM;AACT,iBAAO,MAAM,QAAQA,GAAE,KAAK,KAAMA,GAAE,MAAgB,SAAS,KAAK;AAAA,QACpE;AAAA,QACA,KAAK,MAAM;AACT,iBAAO,WAAW,OAAOA,GAAE,KAAK;AAAA,QAClC;AAAA,QACA,KAAK,OAAO;AACV,iBAAO,UAAUA,GAAE,SAAS,WAAW,OAAOA,GAAE,KAAK;AAAA,QACvD;AAAA,QACA,KAAK,MAAM;AACT,iBAAO,UAAUA,GAAE;AAAA,QACrB;AAAA,QACA,KAAK,UAAU;AACb,iBAAO,MAAM,QAAQA,GAAE,KAAK,KAAK,CAAEA,GAAE,MAAgB,SAAS,KAAK;AAAA,QACrE;AAAA,QACA,KAAK,eAAe;AAClB,iBACE,OAAO,UAAU,YAAY,MAAM,WAAWA,GAAE,KAAe;AAAA,QAEnE;AAAA,MACF;AAAA,IACF;AACA,QAAI,CAAC,OAAO,CAAC,GAAG;AACd,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;AAEA,IAAM,gBAAgB,CACpB,KACA,QACA,SACG;AACH,QAAM,EAAE,YAAY,OAAO,aAAa,OAAO,IAC7C,UAAU,QAAQ,IAAI,KAAK,CAAC;AAC9B,QAAM,QAAQ,OAAO,IAAI,IAAW,MAAM,EAAE,MAAM,KAAK,KAAY;AACnE,QAAM,YACJ,QAAQ,IAAI,UACZ,QAAQ,MACR,QAAQ,OACR,QAAQ,MACR,QAAQ;AACV,QAAM,eACJ,SAAS,MAAM,oBAAoB,qBAC/B,MAAM;AAAA,IACJ,MAAM;AAAA,IACN,YACI,CAAC,MAAW;AACV,iBAAW,CAAC,KAAK,KAAK,MAAM,QAAQ,MAAM,CAAC,GAAG,QAAQ,GAAG;AACvD,YAAI,EAAE,GAAG,MAAM,OAAO,GAAG,GAAG,KAAK;AAAA,MACnC;AACA,UAAI,QAAQ,IAAI;AACd,YAAI,EAAE,GAAG,YAAY,OAAO,EAAE;AAAA,MAChC;AACA,UAAI,QAAQ,KAAK;AACf,YAAI,EAAE,IAAI,YAAY,OAAO,GAAG;AAAA,MAClC;AACA,UAAI,QAAQ,IAAI;AACd,YAAI,EAAE,GAAG,YAAY,OAAO,EAAE;AAAA,MAChC;AACA,UAAI,QAAQ,KAAK;AACf,YAAI,EAAE,IAAI,YAAY,OAAO,GAAG;AAAA,MAClC;AACA,aAAO;AAAA,IACT,IACA;AAAA,EACN,IACA;AACN,QAAM,eAAe,KAAK,SACtB,aAAa,MAAM,KAAK,OAAO,cAAc,SAAS,SAAS,KAAK,IACpE;AACJ,QAAM,gBAAgB,aAAa,WAAW,OAAO,QAAQ;AAC3D,QAAI,CAAC,SAAS,aAAa,QAAQ;AACjC,cAAQ;AAAA,QACN,uCAAuC,KAAK,KAAK;AAAA;AAAA;AAAA,GAG3C,YAAY,KAAK,IAAI,CAAC;AAAA,MAC9B;AAEA,aAAO,cAAc,KAAK,KAAK,KAAK;AAAA,IACtC;AACA,WAAO;AAAA,MACL;AAAA,MACA,KAAK;AAAA;AAAA;AAAA,MAGL,CAAC,MACC,EAAE,YACF,CAAC,YAAY,aAAa,MAAM,UAAU,aAAa,EAAE;AAAA,QACvD,EAAE;AAAA,MACJ;AAAA,IACJ;AAAA,EACF,CAAC;AACD,SAAO;AACT;AAEO,IAAM,WAAW,OAItB,KACA,QACA,kBACA,SAGmC;AACnC,MAAI,KAAK,QAAQ;AACf,UAAM,IAAI,MAAM,yBAAyB,KAAK,UAAU,KAAK,MAAM,CAAC,EAAE;AAAA,EACxE;AACA,MAAI,KAAK,OAAO,KAAK,CAAC,MAAM,EAAE,cAAc,IAAI,KAAK,KAAK,OAAO,SAAS,GAAG;AAC3E,UAAM,IAAI;AAAA,MACR,iIAAiI,KAAK,UAAU,KAAK,KAAK,CAAC;AAAA,IAC7J;AAAA,EACF;AACA,MACE,KAAK,OAAO;AAAA,IACV,CAAC,MACC,EAAE,UAAU,SACZ,EAAE,YACF,CAAC,CAAC,MAAM,MAAM,QAAQ,EAAE,SAAS,EAAE,QAAQ;AAAA,EAC/C,GACA;AACA,UAAM,IAAI;AAAA,MACR,yDAAyD,KAAK,UAAU,KAAK,KAAK,CAAC;AAAA,IACrF;AAAA,EACF;AAIA,QAAM,cAAc,KAAK,OAAO;AAAA,IAC9B,CAAC,OACE,CAAC,EAAE,YAAY,EAAE,aAAa,UAC9B,cAAc,kBAAkB,KAAK,OAAO,EAAE,KAAK,KAClD,EAAE,UAAU;AAAA,EAClB;AACA,MAAI,aAAa;AACf,UAAM,EAAE,MAAM,IACZ,UAAU,QAAQ;AAAA,MAChB,OAAO,KAAK;AAAA,MACZ,OAAO,CAAC,WAAW;AAAA,IACrB,CAAC,KAAK,CAAC;AAET,QAAI;AACJ,QAAI,YAAY,UAAU,OAAO;AAC/B,YAAM,MAAM,IAAI,GAAG,IAAI,YAAY,KAAqB;AAAA,IAC1D,WAAW,OAAO,iBAAiB;AACjC,YAAM,MAAM,IAAI,GACb,MAAM,KAAK,KAAY,EACvB;AAAA,QAAU,MAAM;AAAA,QAAiB,CAAC,MACjC,EAAE,GAAG,MAAM,OAAO,CAAC,GAAG,YAAY,KAAK;AAAA,MACzC,EACC,OAAO;AAAA,IACZ,OAAO;AAEL,YAAM,UAAU,MAAM,IAAI,GAAG,MAAM,KAAK,KAAY,EAAE,QAAQ;AAC9D,YACE,QAAQ,KAAK,CAAC,MAAW,EAAE,YAAY,KAAK,MAAM,YAAY,KAAK,KACnE;AAAA,IACJ;AAGA,QAAI,cAAc,KAAK,KAAK,OAAO,CAAC,MAAM,MAAM,WAAW,GAAG;AAC5D,aAAO;AAAA,QACL,gBAAgB;AAAA,QAChB,QAAQ;AAAA,QACR,MAAM,CAAC,aAAa,KAAK,KAAK,MAAM,CAAC,EAAE,OAAO,OAAO;AAAA,MACvD;AAAA,IACF;AACA,WAAO;AAAA,MACL,gBAAgB;AAAA,MAChB,QAAQ;AAAA,MACR,MAAM,CAAC;AAAA,IACT;AAAA,EACF;AAEA,QAAM,iBAAiB;AAAA,IACrB,GAAG,KAAK;AAAA;AAAA;AAAA,IAGR,iBAAiB,KAAK,KAAK,KAAK,eAAe,YAAY,KAAK,GAAG,GAAG;AAAA,EACxE;AAMA,QAAM,UAAU,KAAK,OAAO,KAAK,CAAC,MAAM,EAAE,aAAa,IAAI;AAC3D,MAAI,SAAS;AACX,QAAI,CAAC,MAAM,QAAQ,QAAQ,KAAK,GAAG;AACjC,YAAM,IAAI,MAAM,kCAAkC;AAAA,IACpD;AAEA,QAAI,QAAQ,UAAU,OAAO;AAC3B,YAAM,OAAO,MAAM,SAAS,QAAQ,OAAgB,OAAO,UAAU;AACnE,eAAO,IAAI,GAAG,IAAI,KAAqB;AAAA,MACzC,CAAC;AACD,YAAM,eAAe,KAClB,QAAQ,CAAC,QAAS,MAAM,CAAC,GAAG,IAAI,CAAC,CAAE,EACnC,OAAO,CAAC,QAAQ,cAAc,KAAK,KAAK,OAAO,CAAC,MAAM,MAAM,OAAO,CAAC;AAEvE,aAAO;AAAA,QACL,gBAAgB;AAAA,QAChB,QAAQ;AAAA,QACR,MAAM,aAAa,KAAK,CAAC,GAAG,MAAM;AAChC,cAAI,KAAK,QAAQ,UAAU,aAAa;AACtC,mBAAO,KAAK,OAAO,cAAc,QAC5B,EAAE,gBAA4B,EAAE,gBAChC,EAAE,gBAA4B,EAAE;AAAA,UACvC;AACA,cAAI,KAAK,QAAQ;AACf,kBAAM,SAAS,EAAE,KAAK,OAAO,KAAK;AAClC,kBAAM,SAAS,EAAE,KAAK,OAAO,KAAK;AAClC,gBAAI,WAAW,QAAQ;AACrB,qBAAO;AAAA,YACT;AACA,mBAAO,KAAK,OAAO,cAAc,QAC7B,SAAU,SACR,IACA,KACF,SAAU,SACR,KACA;AAAA,UACR;AACA,iBAAO;AAAA,QACT,CAAC;AAAA,MACH;AAAA,IACF;AACA,UAAM,UAAU,QAAQ,MAAM,IAAI,CAAC,UAAU;AAC3C,aAAO,cAAc,KAAK,QAAQ;AAAA,QAChC,GAAG;AAAA,QACH,OAAO,KAAK,OAAO,IAAI,CAAC,MAAM;AAC5B,cAAI,MAAM,SAAS;AACjB,mBAAO,EAAE,GAAG,GAAG,UAAU,MAAe,MAAM;AAAA,UAChD;AACA,iBAAO;AAAA,QACT,CAAC;AAAA,MACH,CAAC;AAAA,IACH,CAAC;AACD,UAAMC,UAAS,MAAM;AAAA,MACnB;AAAA,MACA;AAAA,QACE,KAAK,QAAQ,UAAU,eAAe,KAAK,QAAQ;AAAA,QACnD;AAAA,MACF,EAAE,QAAQ,CAAC,MAAO,IAAI,CAAC,CAAC,IAAI,CAAC,CAAE;AAAA,IACjC,EAAE,SAAS,cAAc;AACzB,WAAO;AAAA,MACL,GAAGA;AAAA,MACH,MAAM,MAAM;AAAA,QAASA,QAAO;AAAA,QAAM,CAAC,QACjC,aAAa,KAAK,KAAK,MAAM;AAAA,MAC/B;AAAA,IACF;AAAA,EACF;AAEA,QAAM,QAAQ,cAAc,KAAK,QAAQ,IAAI;AAC7C,QAAM,SAAS,MAAM,MAAM,SAAS,cAAc;AAClD,SAAO;AAAA,IACL,GAAG;AAAA,IACH,MAAM,MAAM,SAAS,OAAO,MAAM,CAAC,QAAQ,aAAa,KAAK,KAAK,MAAM,CAAC;AAAA,EAC3E;AACF;AAEO,IAAM,UAAU,OAIrB,KACA,QACA,kBACA,SACwB;AACxB,UACE,MAAM,SAAS,KAAK,QAAQ,kBAAkB;AAAA,IAC5C,GAAG;AAAA,IACH,gBAAgB;AAAA,MACd,QAAQ;AAAA,MACR,UAAU;AAAA,IACZ;AAAA,EACF,CAAC,GACD,KAAK,CAAC;AACV;;;AH3jBA,IAAM,sBAAsB,CAAC,eAA2C;AACtE,SAAO,KAAK,MAAM,UAAU;AAC9B;AASO,IAAM,SAAS;AAAA,EACpB,MAAM;AAAA,IACJ,kBAAkB,EAAE,OAAO;AAAA,IAC3B,MAAM,EAAE,IAAI;AAAA,IACZ,OAAO,EAAE,OAAO;AAAA,IAChB,QAAQ,EAAE,SAAS,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;AAAA,EACxC;AAAA,EACA,SAAS,OACP,KACA,EAAE,kBAAkB,MAAM,OAAO,QAAAC,QAAO,GACxC,WACG;AACH,UAAM,aAAa,oBAAoB,gBAAgB;AAEvD,UAAM,kBAAkB,KAAK,QAAQ,YAAY,OAAO,IAAW;AAEnE,UAAM,KAAK,MAAM,IAAI,GAAG,OAAO,OAAc,IAAW;AACxD,UAAM,MAAM,MAAM,IAAI,GAAG,IAAI,EAAE;AAC/B,QAAI,CAAC,KAAK;AACR,YAAM,IAAI,MAAM,oBAAoB,KAAK,EAAE;AAAA,IAC7C;AAEA,WAAO,aAAa,KAAKA,OAAM;AAAA,EACjC;AACF;AASO,IAAM,UAAU;AAAA,EACrB,MAAM;AAAA,IACJ,kBAAkB,EAAE,OAAO;AAAA,IAC3B,OAAO,EAAE,OAAO;AAAA,IAChB,QAAQ,EAAE,SAAS,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;AAAA,IACtC,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC;AAAA,EACxB;AAAA,EACA,SAAS,OACP,KACA,EAAE,kBAAkB,OAAO,QAAAA,SAAQ,MAAM,GACzC,WACG;AACH,UAAM,aAAa,oBAAoB,gBAAgB;AACvD,UAAM,SAAS,MAAM,QAAQ,KAAK,QAAQ,YAAY;AAAA,MACpD;AAAA,MACA,QAAAA;AAAA,MACA;AAAA,IACF,CAAC;AAED,WAAO;AAAA,EACT;AACF;AAUO,IAAM,WAAW;AAAA,EACtB,MAAM;AAAA,IACJ,kBAAkB,EAAE,OAAO;AAAA,IAC3B,OAAO,EAAE,SAAS,EAAE,OAAO,CAAC;AAAA,IAC5B,OAAO,EAAE,OAAO;AAAA,IAChB,QAAQ,EAAE;AAAA,MACR,EAAE,OAAO;AAAA,QACP,WAAW,EAAE,MAAM,EAAE,QAAQ,KAAK,GAAG,EAAE,QAAQ,MAAM,CAAC;AAAA,QACtD,OAAO,EAAE,OAAO;AAAA,MAClB,CAAC;AAAA,IACH;AAAA,IACA,OAAO,EAAE,SAAS,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;AAAA,EACpC;AAAA,EACA,SAAS,OACP,KACA,EAAE,kBAAkB,OAAO,OAAO,QAAQ,MAAM,GAChD,WACG;AACH,UAAM,aAAa,oBAAoB,gBAAgB;AACvD,UAAM,cAAe,SAAS,CAAC;AAG/B,QAAI,YAAY,KAAK,CAAC,MAAM,EAAE,cAAc,IAAI,GAAG;AACjD,YAAM,UAAU,MAAM,QAAQ;AAAA,QAC5B,YAAY,IAAI,OAAO,MAAM;AAC3B,gBAAMC,UAAS,MAAM,SAAS,KAAK,QAAQ,YAAY;AAAA,YACrD;AAAA,YACA,gBAAgB,EAAE,QAAQ,MAAM,UAAU,SAAS,IAAI;AAAA,YACvD;AAAA,YACA,OAAO,CAAC,CAAC;AAAA,UACX,CAAC;AACD,iBAAOA,QAAO;AAAA,QAChB,CAAC;AAAA,MACH;AAGA,YAAM,OAAO,oBAAI,IAAY;AAC7B,YAAM,aAAoB,CAAC;AAC3B,iBAAW,QAAQ,SAAS;AAC1B,mBAAW,OAAO,MAAM;AACtB,gBAAM,QAAQ,IAAI;AAClB,cAAI,CAAC,KAAK,IAAI,KAAK,GAAG;AACpB,iBAAK,IAAI,KAAK;AACd,uBAAW,KAAK,GAAG;AAAA,UACrB;AAAA,QACF;AAAA,MACF;AAGA,UAAI,QAAQ;AACV,mBAAW,KAAK,CAAC,GAAG,MAAM;AACxB,gBAAM,OAAO,EAAE,OAAO,KAAK;AAC3B,gBAAM,OAAO,EAAE,OAAO,KAAK;AAC3B,cAAI,SAAS,MAAM;AACjB,mBAAO;AAAA,UACT;AACA,gBAAM,aAAa,OAAO,OAAO,IAAI;AACrC,iBAAO,OAAO,cAAc,SAAS,CAAC,aAAa;AAAA,QACrD,CAAC;AAAA,MACH;AAEA,aAAO,WAAW,MAAM,GAAG,KAAK;AAAA,IAClC;AAGA,UAAM,SAAS,MAAM,SAAS,KAAK,QAAQ,YAAY;AAAA,MACrD;AAAA,MACA,gBAAgB,EAAE,QAAQ,MAAM,UAAU,SAAS,IAAI;AAAA,MACvD;AAAA,MACA,OAAO;AAAA,IACT,CAAC;AAED,WAAO,OAAO;AAAA,EAChB;AACF;AAQO,IAAM,QAAQ;AAAA,EACnB,MAAM;AAAA,IACJ,kBAAkB,EAAE,OAAO;AAAA,IAC3B,OAAO,EAAE,OAAO;AAAA,IAChB,OAAO,EAAE,SAAS,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;AAAA,EACpC;AAAA,EACA,SAAS,OACP,KACA,EAAE,kBAAkB,OAAO,MAAM,GACjC,WACG;AACH,UAAM,aAAa,oBAAoB,gBAAgB;AACvD,UAAM,cAAe,SAAS,CAAC;AAG/B,QAAI,YAAY,KAAK,CAAC,MAAM,EAAE,cAAc,IAAI,GAAG;AACjD,YAAM,UAAU,MAAM,QAAQ;AAAA,QAC5B,YAAY,IAAI,OAAO,MAAM;AAC3B,gBAAMA,UAAS,MAAM,SAAS,KAAK,QAAQ,YAAY;AAAA,YACrD;AAAA,YACA,gBAAgB,EAAE,QAAQ,MAAM,UAAU,IAAI;AAAA,YAC9C,OAAO,CAAC,CAAC;AAAA,UACX,CAAC;AACD,iBAAOA,QAAO;AAAA,QAChB,CAAC;AAAA,MACH;AAGA,YAAM,OAAO,oBAAI,IAAY;AAC7B,iBAAW,QAAQ,SAAS;AAC1B,mBAAW,OAAO,MAAM;AACtB,gBAAM,QAAQ,IAAI;AAClB,eAAK,IAAI,KAAK;AAAA,QAChB;AAAA,MACF;AACA,aAAO,KAAK;AAAA,IACd;AAGA,UAAM,SAAS,MAAM,SAAS,KAAK,QAAQ,YAAY;AAAA,MACrD;AAAA,MACA,gBAAgB,EAAE,QAAQ,MAAM,UAAU,IAAI;AAAA,MAC9C,OAAO;AAAA,IACT,CAAC;AAED,WAAO,OAAO,KAAK;AAAA,EACrB;AACF;AASO,IAAM,SAAS;AAAA,EACpB,MAAM;AAAA,IACJ,kBAAkB,EAAE,OAAO;AAAA,IAC3B,OAAO,EAAE,OAAO;AAAA,IAChB,QAAQ,EAAE,IAAI;AAAA,IACd,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC;AAAA,EACxB;AAAA,EACA,SAAS,OACP,KACA,EAAE,kBAAkB,OAAO,QAAAC,SAAQ,MAAM,GACzC,WACG;AACH,UAAM,aAAa,oBAAoB,gBAAgB;AACvD,UAAM,cAAc;AAGpB,UAAM,MAAM,MAAM,QAAQ,KAAK,QAAQ,YAAY;AAAA,MACjD;AAAA,MACA,OAAO;AAAA,IACT,CAAC;AAED,QAAI,CAAC,KAAK;AACR,aAAO;AAAA,IACT;AAGA,UAAM,kBAAkB,KAAK,QAAQ,YAAY,OAAOA,SAAe,GAAG;AAE1E,UAAM,IAAI,GAAG,MAAM,IAAI,KAAuBA,OAAa;AAC3D,WAAO,MAAM,IAAI,GAAG,IAAI,IAAI,GAAqB;AAAA,EACnD;AACF;AAGO,IAAM,aAAa;AAAA,EACxB,MAAM;AAAA,IACJ,kBAAkB,EAAE,OAAO;AAAA,IAC3B,OAAO,EAAE,OAAO;AAAA,IAChB,QAAQ,EAAE,IAAI;AAAA,IACd,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC;AAAA,EACxB;AAAA,EACA,SAAS,OACP,KACA,EAAE,kBAAkB,OAAO,QAAAA,SAAQ,MAAM,GACzC,WACG;AACH,UAAM,aAAa,oBAAoB,gBAAgB;AACvD,UAAM,cAAc;AAEpB,UAAM,SAAS,MAAM,SAAS,KAAK,QAAQ,YAAY;AAAA,MACrD;AAAA,MACA,gBAAgB,EAAE,QAAQ,MAAM,UAAU,IAAI;AAAA,MAC9C,OAAO;AAAA,IACT,CAAC;AAGD,QAAI,OAAO,KAAK,SAAS,GAAG;AAC1B,YAAM,kBAAkB,OAAO,KAAKA,OAAa,EAAE;AAAA,QACjD,CAAC,QAAQ,WAAW,KAAK,GAAG,SAAS,GAAG,GAAG;AAAA,MAC7C;AACA,UAAI,gBAAgB,SAAS,GAAG;AAC9B,cAAM,IAAI;AAAA,UACR,2DAA2D,KAAK,iCAAiC,gBAAgB,KAAK,IAAI,CAAC;AAAA,QAC7H;AAAA,MACF;AAAA,IACF;AAGA,eAAW,OAAO,OAAO,MAAM;AAC7B,YAAM;AAAA,QACJ;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACAA;AAAA,QACA;AAAA,MACF;AACA,YAAM,IAAI,GAAG,MAAM,IAAI,KAAuBA,OAAa;AAAA,IAC7D;AAEA,WAAO,OAAO,KAAK;AAAA,EACrB;AACF;AAQO,IAAM,YAAY;AAAA,EACvB,MAAM;AAAA,IACJ,kBAAkB,EAAE,OAAO;AAAA,IAC3B,OAAO,EAAE,OAAO;AAAA,IAChB,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC;AAAA,EACxB;AAAA,EACA,SAAS,OACP,KACA,EAAE,kBAAkB,OAAO,MAAM,GACjC,WACG;AACH,UAAM,aAAa,oBAAoB,gBAAgB;AACvD,UAAM,cAAc;AAEpB,UAAM,MAAM,MAAM,QAAQ,KAAK,QAAQ,YAAY;AAAA,MACjD;AAAA,MACA,OAAO;AAAA,IACT,CAAC;AAED,QAAI,CAAC,KAAK;AACR;AAAA,IACF;AAEA,UAAM,IAAI,GAAG,OAAO,IAAI,GAAqB;AAAA,EAC/C;AACF;AAGO,IAAM,aAAa;AAAA,EACxB,MAAM;AAAA,IACJ,kBAAkB,EAAE,OAAO;AAAA,IAC3B,OAAO,EAAE,OAAO;AAAA,IAChB,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC;AAAA,EACxB;AAAA,EACA,SAAS,OACP,KACA,EAAE,kBAAkB,OAAO,MAAM,GACjC,WACG;AACH,UAAM,aAAa,oBAAoB,gBAAgB;AACvD,UAAM,cAAc;AAEpB,UAAM,SAAS,MAAM,SAAS,KAAK,QAAQ,YAAY;AAAA,MACrD;AAAA,MACA,gBAAgB,EAAE,QAAQ,MAAM,UAAU,IAAI;AAAA,MAC9C,OAAO;AAAA,IACT,CAAC;AAGD,eAAW,OAAO,OAAO,MAAM;AAC7B,YAAM,IAAI,GAAG,OAAO,IAAI,GAAqB;AAAA,IAC/C;AAEA,WAAO,OAAO,KAAK;AAAA,EACrB;AACF;;;AIrWO,SAAS,cAAuE,OAKpF;AACD,SAAO,OACL,QACwB;AACxB,UAAM,WAAW,MAAM,IAAI,KAAK,gBAAgB;AAChD,QAAI,aAAa,MAAM;AACrB,aAAO,EAAE,MAAM,KAAK;AAAA,IACtB;AAEA,UAAM,OAAO,MAAM,IAAI,GAAG;AAAA,MACxB,MAAM;AAAA,MACN,SAAS;AAAA,IACX;AACA,QAAI,SAAS,MAAM;AACjB,aAAO,EAAE,KAAK;AAAA,IAChB;AAEA,QAAI,CAAC,MAAM,aAAa;AACtB,aAAO,EAAE,KAAK;AAAA,IAChB;AACA,UAAM,YAAY,SAAS;AAC3B,UAAM,UAAU,YAAY,MAAM,IAAI,GAAG,IAAI,MAAM,uBAAuB,SAAS,IAAI;AACvF,UAAM,QAAQ,SAAS;AACvB,UAAM,eAAe,QACf,MAAM,IAAI,GAAG,IAAI,MAAM,mBAAmB,KAAK,KAAM,SACvD;AAEJ,WAAO,EAAE,MAAM,aAAa;AAAA,EAC9B;AACF;;;ACJO,SAAS,UACd,SACA;AACA,SAAO;AAAA,IACL,UAAU,QAAQ,iBAAiB;AAAA,MACjC,GAAM;AAAA,MACN,SAAS,OAAO,KAAK,SACnB,MAAS,OAAO;AAAA,QACd;AAAA,QACA;AAAA,QACA,QAAQ;AAAA,MACV;AAAA,IACJ,CAAC;AAAA,IAED,WAAW,QAAQ,cAAc;AAAA,MAC/B,GAAM;AAAA,MACN,SAAS,OAAO,KAAK,SACnB,MAAS,QAAQ;AAAA,QACf;AAAA,QACA;AAAA,QACA,QAAQ;AAAA,MACV;AAAA,IACJ,CAAC;AAAA,IAED,YAAY,QAAQ,cAAc;AAAA,MAChC,GAAM;AAAA,MACN,SAAS,OAAO,KAAK,SACnB,MAAS,SAAS;AAAA,QAChB;AAAA,QACA;AAAA,QACA,QAAQ;AAAA,MACV;AAAA,IACJ,CAAC;AAAA,IAED,SAAS,QAAQ,cAAc;AAAA,MAC7B,GAAM;AAAA,MACN,SAAS,OAAO,KAAK,SACnB,MAAS,MAAM;AAAA,QACb;AAAA,QACA;AAAA,QACA,QAAQ;AAAA,MACV;AAAA,IACJ,CAAC;AAAA,IAED,UAAU,QAAQ,iBAAiB;AAAA,MACjC,GAAM;AAAA,MACN,SAAS,OAAO,KAAK,SACnB,MAAS,OAAO;AAAA,QACd;AAAA,QACA;AAAA,QACA,QAAQ;AAAA,MACV;AAAA,IACJ,CAAC;AAAA,IAED,cAAc,QAAQ,iBAAiB;AAAA,MACrC,GAAM;AAAA,MACN,SAAS,OAAO,KAAK,SACnB,MAAS,WAAW;AAAA,QAClB;AAAA,QACA;AAAA,QACA,QAAQ;AAAA,MACV;AAAA,IACJ,CAAC;AAAA,IAED,UAAU,QAAQ,iBAAiB;AAAA,MACjC,GAAM;AAAA,MACN,SAAS,OAAO,KAAK,SACnB,MAAS,UAAU;AAAA,QACjB;AAAA,QACA;AAAA,QACA,QAAQ;AAAA,MACV;AAAA,IACJ,CAAC;AAAA,IAED,cAAc,QAAQ,iBAAiB;AAAA,MACrC,GAAM;AAAA,MACN,SAAS,OAAO,KAAK,SACnB,MAAS,WAAW;AAAA,QAClB;AAAA,QACA;AAAA,QACA,QAAQ;AAAA,MACV;AAAA,IACJ,CAAC;AAAA,EACH;AACF;AAuBO,SAAS,wBACd,KACA;AACA,SAAO,cAAc,GAAG;AAC1B;","names":["v","getAuthTables","where","select","update","commonPrefix","index","stream","_","result","orderingIndexFields","v","select","w","result","select","result","update"]}
+{"version":3,"sources":["../src/adapter.ts","../src/convex/adapter.ts","../src/convex/db.ts","../../../node_modules/.pnpm/convex-helpers@0.1.120_@standard-schema+spec@1.1.0_convex@1.44.0_react@19.2.7__hono@4.1_fda37119e0b134c2babc8f4bd1faf097/node_modules/convex-helpers/index.js","../../../node_modules/.pnpm/convex-helpers@0.1.120_@standard-schema+spec@1.1.0_convex@1.44.0_react@19.2.7__hono@4.1_fda37119e0b134c2babc8f4bd1faf097/node_modules/convex-helpers/server/stream.js","../src/convex/utils.ts","../src/convex/getAuth.ts","../src/convex/index.ts"],"sourcesContent":["import type {\n  AuthCollectionConfig,\n  AuthFieldMeta,\n  BaseFieldInput,\n  CollectionSlug,\n  FieldAdminConfigInput,\n  VexAuthAdapter,\n} from \"@vexcms/core\";\nimport {\n  array,\n  AuthCollectionMeta,\n  checkbox,\n  date,\n  defineCollection,\n  number,\n  select,\n  text,\n} from \"@vexcms/core\";\nimport type { BetterAuthOptions, DBFieldAttribute } from \"better-auth\";\nimport { getAuthTables } from \"better-auth/db\";\n\n/**\n * Options for `betterAuthAdapter()`.\n *\n * Accepts the same `BetterAuthOptions` object you pass to `betterAuth()`\n * on the server. Only schema-affecting properties (modelNames,\n * additionalFields, plugins) are read. Runtime options (database, secret,\n * baseURL) are ignored.\n */\nexport interface BetterAuthAdapterOptions {\n  config: BetterAuthOptions;\n}\n\nconst AUTH_COLLECTION_TYPES = {\n  user: \"user\",\n  session: \"session\",\n  account: \"account\",\n  verification: \"verification\",\n} as const;\n\n/** Fields on the user table that end-users are allowed to edit. */\nconst EDITABLE_FIELDS = new Set([\n  \"name\",\n  \"email\",\n  \"image\",\n  \"role\",\n  \"banned\",\n  \"banReason\",\n  \"banExpires\",\n]);\n\n/** Fields that should be hidden in the admin UI for security. */\nconst HIDDEN_FIELDS = new Set([\n  \"hashedPassword\",\n  \"password\",\n  \"twoFactorSecret\",\n  \"twoFactorBackupCodes\",\n  \"token\",\n  \"secret\",\n  \"code\",\n]);\n\n/**\n * Creates a Vex auth adapter from a Better Auth configuration.\n *\n * Introspects Better Auth's full merged schema (base fields + plugin fields\n * + additionalFields) via `getAuthTables()` and converts each table into a\n * standard Vex `CollectionConfig` using Vex field builders.\n *\n * Mappings from Better Auth `DBFieldAttribute` to Vex fields:\n * - `type` → Vex field type (`string`→text, `boolean`→checkbox, `number`→number,\n *   `date`/`timestamp`→date, `json`→text fallback, array→select)\n * - `required` → field `required`\n * - `defaultValue` → field `defaultValue`\n * - `unique`/`index` → field `index` (index name: `by_<field>_unique` or `by_<field>`)\n * - `references` → `relationship` field\n * - System fields get `admin.readOnly: true` and `meta.locked: true`\n * - Sensitive fields get `admin.hidden: true`\n *\n * @param props — Adapter options; pass your Better Auth config object wrapped\n *   in `{ config: authOptions }`. Optional — when omitted, uses default\n *   Better Auth tables with no plugins or additional fields.\n * @returns A `VexAuthAdapter` ready for `defineConfig({ auth: … })`.\n *\n * @example\n * ```ts\n * import { betterAuthAdapter } from \"@vexcms/better-auth\";\n * import { authOptions } from \"~/auth/server\";\n *\n * export default defineConfig({\n *   auth: betterAuthAdapter({ config: authOptions }),\n *   collections: [posts],\n * });\n * ```\n */\nexport function betterAuthAdapter(\n  props?: BetterAuthAdapterOptions,\n): VexAuthAdapter {\n  const tables = getAuthTables(props?.config ?? {});\n  const collections: AuthCollectionConfig[] = [];\n  const authCollections = [\n    { type: AUTH_COLLECTION_TYPES.user, slug: props?.config?.user?.modelName },\n    {\n      type: AUTH_COLLECTION_TYPES.session,\n      slug: props?.config?.session?.modelName,\n    },\n    {\n      type: AUTH_COLLECTION_TYPES.account,\n      slug: props?.config?.account?.modelName,\n    },\n    {\n      type: AUTH_COLLECTION_TYPES.verification,\n      slug: props?.config?.verification?.modelName,\n    },\n  ] as const;\n\n  for (const [tableKey, tableDef] of Object.entries(tables)) {\n    const slug = tableDef.modelName ?? tableKey;\n    const fields: AuthCollectionConfig[\"fields\"] = {};\n\n    addAuthCollectionFields({\n      attributes: tableDef.fields,\n      slug,\n      fields,\n      config: props?.config,\n      extractId: true,\n    });\n\n    const authCollectionType = authCollections.find(\n      (ac) => ac.slug === slug,\n    )?.type;\n    if (authCollectionType) {\n      switch (authCollectionType) {\n        case \"user\": {\n          const additionalFields = props?.config?.user?.additionalFields;\n          addAuthCollectionFields({\n            attributes: additionalFields,\n            slug,\n            fields,\n            config: props?.config,\n          });\n          break;\n        }\n        case \"session\": {\n          const additionalFields = props?.config?.session?.additionalFields;\n          addAuthCollectionFields({\n            attributes: additionalFields,\n            slug,\n            fields,\n            config: props?.config,\n          });\n          break;\n        }\n        case \"account\": {\n          const additionalFields = props?.config?.account?.additionalFields;\n          addAuthCollectionFields({\n            attributes: additionalFields,\n            slug,\n            fields,\n            config: props?.config,\n          });\n          break;\n        }\n        case \"verification\": {\n          const additionalFields =\n            props?.config?.verification?.additionalFields;\n          addAuthCollectionFields({\n            attributes: additionalFields,\n            slug,\n            fields,\n            config: props?.config,\n          });\n          break;\n        }\n        default:\n          break;\n      }\n    }\n\n    const isProtected = slug !== \"user\" && slug !== \"users\";\n\n    collections.push(\n      defineCollection<AuthFieldMeta, AuthCollectionMeta>({\n        slug: slug as CollectionSlug,\n        fields,\n        meta: isProtected ? { protected: true } : undefined,\n      }),\n    );\n  }\n\n  const userSlug = tables.user?.modelName ?? \"user\";\n  return {\n    name: \"better-auth\",\n    collections,\n    userCollection: userSlug as CollectionSlug,\n  };\n}\n\n/**\n * Converts a set of Better Auth field attributes into Vex field definitions\n * and appends them to the given collection `fields` map.\n *\n * Iterates over `attributes`, calls {@link betterAuthAttrToVexField} for each\n * entry, and mutates `props.fields` in place. When `extractId` is `true`,\n * the `id` field is skipped because Convex auto-generates `_id`.\n *\n * @param props — Field extraction options.\n * @param props.attributes — Better Auth `DBFieldAttribute` map to convert.\n * @param props.slug — Collection slug (used for relationship target resolution).\n * @param props.fields — Mutable Vex collection fields object to populate.\n * @param props.config — Better Auth options (for model name / additional fields lookups).\n * @param props.extractId — When `true`, skips the `id` field.\n *\n * @internal\n */\nexport function addAuthCollectionFields(props: {\n  attributes?: Record<string, DBFieldAttribute>;\n  slug: string;\n  fields: AuthCollectionConfig[\"fields\"];\n  config?: BetterAuthOptions;\n  extractId?: boolean;\n}) {\n  if (!props.attributes) return;\n  for (const [fieldName, attr] of Object.entries(props.attributes)) {\n    if (props.extractId === true && fieldName === \"id\") continue;\n    const field = betterAuthAttrToVexField(\n      fieldName,\n      attr,\n      props.slug,\n      props?.config,\n    );\n    if (field) props.fields[fieldName] = field;\n  }\n}\n\n/**\n * Maps a single Better Auth `DBFieldAttribute` to a Vex field builder call.\n *\n * Handles all Better Auth scalar types: `string`, `boolean`, `number`, `date`,\n * `timestamp`, `json`, and enum arrays. Maps overlapping properties\n * (`required`, `defaultValue`, `unique`/`index`, `references`) to their\n * Vex equivalents. Sets `admin.readOnly` and `meta.locked` on system\n * fields, and `admin.hidden` on sensitive fields.\n *\n * @param fieldName — The field name from Better Auth.\n * @param attr — The Better Auth field attribute.\n * @param tableSlug — The collection slug (for relationship targets).\n * @param authOptions -- The betterAuth options\n * @returns A Vex field instance, or `null` if the type is unsupported.\n *\n * @internal\n */\nfunction betterAuthAttrToVexField(\n  fieldName: string,\n  attr: DBFieldAttribute,\n  tableSlug: string,\n  authOptions?: BetterAuthOptions,\n) {\n  // Skip id — Convex auto-generates _id\n  if (fieldName === \"id\") return null;\n\n  const isUserTable =\n    tableSlug === authOptions?.user?.modelName ||\n    tableSlug === \"user\" ||\n    tableSlug === \"users\";\n  const isEditable = isUserTable && EDITABLE_FIELDS.has(fieldName);\n  const isHidden = HIDDEN_FIELDS.has(fieldName);\n\n  const admin: FieldAdminConfigInput = {};\n  if (!isEditable) admin.readOnly = true;\n  if (isHidden) admin.hidden = true;\n\n  // eslint-disable-next-line @typescript-eslint/no-explicit-any\n  const baseOptions: { defaultValue: any } & BaseFieldInput<AuthFieldMeta> = {\n    defaultValue: undefined,\n  };\n  if (Object.keys(admin).length > 0) baseOptions.admin = admin;\n  if (!isEditable) baseOptions.meta = { locked: true };\n  if (attr.required) baseOptions.required = attr.required;\n  if (\n    attr.defaultValue !== undefined &&\n    typeof attr.defaultValue !== \"function\"\n  ) {\n    baseOptions.defaultValue = attr.defaultValue;\n  }\n  if (attr.unique || attr.index) {\n    baseOptions.index = `by_${fieldName}`;\n  }\n\n  if (attr.references) {\n    return text(baseOptions);\n  }\n\n  if (Array.isArray(attr.type)) {\n    return select({\n      options: attr.type.map((v: string) => ({ value: v, label: v })),\n      ...baseOptions,\n    });\n  }\n\n  switch (attr.type) {\n    case \"string\":\n      return text(baseOptions);\n    case \"string[]\":\n      return array({\n        ...baseOptions,\n        items: text(baseOptions),\n      });\n    case \"boolean\":\n      return checkbox(baseOptions);\n    case \"number\":\n      return number(baseOptions);\n    case \"number[]\":\n      return array({\n        ...baseOptions,\n        items: number(baseOptions),\n      });\n    case \"date\":\n      return date(baseOptions);\n    case \"json\":\n      // Fall back to text until a dedicated json field type is wired\n      // TODO: create json field\n      return text(baseOptions);\n    default:\n      // Unknown type — skip rather than crash\n      return null;\n  }\n}\n","import type { Where } from \"better-auth/types\";\nimport type { GenericActionCtx, GenericDataModel } from \"convex/server\";\nimport { anyApi } from \"convex/server\";\nimport {\n  createAdapterFactory,\n  type DBAdapterDebugLogOption,\n} from \"better-auth/adapters\";\nimport { getAuthTables } from \"better-auth/db\";\n\ntype ConvexCleanedWhere = Where & {\n  value: boolean | null | number | number[] | string | string[];\n};\n\nconst parseWhere = (where?: Where[]): ConvexCleanedWhere[] => {\n  return (where?.map((where) => {\n    if (where.value instanceof Date) {\n      return { ...where, value: where.value.getTime() };\n    }\n    return where;\n  }) ?? []) as ConvexCleanedWhere[];\n};\n\n/**\n * Creates the Convex database adapter for Better Auth.\n *\n * @param ctx - The Convex action context\n * @param config - Optional debug log configuration\n * @returns AdapterFactory<BetterAuthOptions>\n */\nexport function convexAdapter<DataModel extends GenericDataModel>(\n  ctx: GenericActionCtx<DataModel>,\n  config: { debugLogs?: DBAdapterDebugLogOption } = {},\n) {\n  return createAdapterFactory({\n    adapter: ({ options }) => {\n      options.telemetry = { enabled: false };\n      const betterAuthSchema = getAuthTables(options);\n      const betterAuthSchemaJson = JSON.stringify(betterAuthSchema);\n\n      return {\n        id: \"convex\",\n        options: { isRunMutationCtx: \"runMutation\" in ctx },\n\n        // Use anyApi to reference db operations, call via ctx.runMutation/ctx.runQuery\n        create: async ({ data, model, select }) => {\n          return await ctx.runMutation(anyApi.auth.db.dbCreate, {\n            betterAuthSchema: betterAuthSchemaJson,\n            data,\n            model,\n            select,\n          });\n        },\n\n        findOne: async ({ model, select, where }) => {\n          return await ctx.runQuery(anyApi.auth.db.dbFindOne, {\n            betterAuthSchema: betterAuthSchemaJson,\n            model,\n            select,\n            where: parseWhere(where),\n          });\n        },\n\n        findMany: async ({ limit, model, sortBy, where }) => {\n          return await ctx.runQuery(anyApi.auth.db.dbFindMany, {\n            betterAuthSchema: betterAuthSchemaJson,\n            limit,\n            model,\n            sortBy,\n            where: parseWhere(where),\n          });\n        },\n\n        count: async ({ model, where }) => {\n          return await ctx.runQuery(anyApi.auth.db.dbCount, {\n            betterAuthSchema: betterAuthSchemaJson,\n            model,\n            where: parseWhere(where),\n          });\n        },\n\n        update: async ({ model, update, where }) => {\n          return await ctx.runMutation(anyApi.auth.db.dbUpdate, {\n            betterAuthSchema: betterAuthSchemaJson,\n            model,\n            update,\n            where: parseWhere(where),\n          });\n        },\n\n        updateMany: async ({ model, update, where }) => {\n          return await ctx.runMutation(anyApi.auth.db.dbUpdateMany, {\n            betterAuthSchema: betterAuthSchemaJson,\n            model,\n            update,\n            where: parseWhere(where),\n          });\n        },\n\n        delete: async ({ model, where }) => {\n          return await ctx.runMutation(anyApi.auth.db.dbDelete, {\n            betterAuthSchema: betterAuthSchemaJson,\n            model,\n            where: parseWhere(where),\n          });\n        },\n\n        deleteMany: async ({ model, where }) => {\n          return await ctx.runMutation(anyApi.auth.db.dbDeleteMany, {\n            betterAuthSchema: betterAuthSchemaJson,\n            model,\n            where: parseWhere(where),\n          });\n        },\n\n        transaction: async () => {\n          throw new Error(\"Transactions not supported\");\n        },\n      };\n    },\n    config: {\n      adapterId: \"convex\",\n      adapterName: \"Convex Adapter\",\n      customTransformInput: ({ data, fieldAttributes }) =>\n        data && fieldAttributes.type === \"date\"\n          ? new Date(data).getTime()\n          : data,\n      customTransformOutput: ({ data, fieldAttributes }) =>\n        data && fieldAttributes.type === \"date\"\n          ? new Date(data).getTime()\n          : data,\n      debugLogs: config.debugLogs ?? false,\n      disableIdGeneration: true,\n      mapKeysTransformInput: { id: \"_id\" },\n      mapKeysTransformOutput: { _id: \"id\" },\n      supportsArrays: true,\n      supportsDates: false,\n      supportsJSON: true,\n      supportsNumericIds: false,\n      transaction: false,\n      usePlural: false,\n    },\n  });\n}\n","/* eslint-disable jsdoc/require-jsdoc */\nimport type { BetterAuthDBSchema } from \"better-auth/db\";\nimport type {\n  GenericQueryCtx,\n  GenericMutationCtx,\n  GenericDataModel,\n  SchemaDefinition,\n} from \"convex/server\";\nimport type { GenericId } from \"convex/values\";\n\nimport { v } from \"convex/values\";\n\nimport {\n  checkUniqueFields,\n  listOne,\n  paginate,\n  selectFields,\n  type WhereClause,\n} from \"./utils\";\n\n// Helper to get Better Auth schema - we'll pass it from the adapter\nconst getBetterAuthSchema = (schemaJson: string): BetterAuthDBSchema => {\n  return JSON.parse(schemaJson);\n};\n\ninterface CreateArgs {\n  betterAuthSchema: string;\n  data: any;\n  model: string;\n  select?: string[];\n}\n\nexport const create = {\n  args: {\n    betterAuthSchema: v.string(),\n    data: v.any(),\n    model: v.string(),\n    select: v.optional(v.array(v.string())),\n  },\n  handler: async (\n    ctx: GenericMutationCtx<GenericDataModel>,\n    { betterAuthSchema, data, model, select }: CreateArgs,\n    schema: SchemaDefinition<any, any>,\n  ) => {\n    const authSchema = getBetterAuthSchema(betterAuthSchema);\n\n    await checkUniqueFields(ctx, schema, authSchema, model, data as any);\n\n    const id = await ctx.db.insert(model as any, data as any);\n    const doc = await ctx.db.get(id);\n    if (!doc) {\n      throw new Error(`Failed to create ${model}`);\n    }\n\n    return selectFields(doc, select);\n  },\n};\n\ninterface FindOneArgs {\n  betterAuthSchema: string;\n  model: string;\n  select?: string[];\n  where: unknown[];\n}\n\nexport const findOne = {\n  args: {\n    betterAuthSchema: v.string(),\n    model: v.string(),\n    select: v.optional(v.array(v.string())),\n    where: v.array(v.any()),\n  },\n  handler: async (\n    ctx: GenericQueryCtx<GenericDataModel>,\n    { betterAuthSchema, model, select, where }: FindOneArgs,\n    schema: SchemaDefinition<any, any>,\n  ) => {\n    const authSchema = getBetterAuthSchema(betterAuthSchema);\n    const result = await listOne(ctx, schema, authSchema, {\n      model,\n      select,\n      where: where as WhereClause[],\n    });\n\n    return result;\n  },\n};\n\ninterface FindManyArgs {\n  betterAuthSchema: string;\n  limit?: number;\n  model: string;\n  sortBy?: { direction: \"asc\" | \"desc\"; field: string };\n  where?: unknown[];\n}\n\nexport const findMany = {\n  args: {\n    betterAuthSchema: v.string(),\n    limit: v.optional(v.number()),\n    model: v.string(),\n    sortBy: v.optional(\n      v.object({\n        direction: v.union(v.literal(\"asc\"), v.literal(\"desc\")),\n        field: v.string(),\n      }),\n    ),\n    where: v.optional(v.array(v.any())),\n  },\n  handler: async (\n    ctx: GenericQueryCtx<GenericDataModel>,\n    { betterAuthSchema, limit, model, sortBy, where }: FindManyArgs,\n    schema: SchemaDefinition<any, any>,\n  ) => {\n    const authSchema = getBetterAuthSchema(betterAuthSchema);\n    const parsedWhere = (where ?? []) as WhereClause[];\n\n    // Handle OR connector by running parallel queries\n    if (parsedWhere.some((w) => w.connector === \"OR\")) {\n      const results = await Promise.all(\n        parsedWhere.map(async (w) => {\n          const result = await paginate(ctx, schema, authSchema, {\n            model,\n            paginationOpts: { cursor: null, numItems: limit ?? 200 },\n            sortBy,\n            where: [w],\n          });\n          return result.page;\n        }),\n      );\n\n      // De-duplicate and flatten\n      const seen = new Set<string>();\n      const uniqueDocs: any[] = [];\n      for (const docs of results) {\n        for (const doc of docs) {\n          const docId = doc._id as string;\n          if (!seen.has(docId)) {\n            seen.add(docId);\n            uniqueDocs.push(doc);\n          }\n        }\n      }\n\n      // Apply sorting if needed\n      if (sortBy) {\n        uniqueDocs.sort((a, b) => {\n          const aVal = a[sortBy.field];\n          const bVal = b[sortBy.field];\n          if (aVal === bVal) {\n            return 0;\n          }\n          const comparison = aVal > bVal ? 1 : -1;\n          return sortBy.direction === \"desc\" ? -comparison : comparison;\n        });\n      }\n\n      return uniqueDocs.slice(0, limit);\n    }\n\n    // Normal case without OR\n    const result = await paginate(ctx, schema, authSchema, {\n      model,\n      paginationOpts: { cursor: null, numItems: limit ?? 200 },\n      sortBy,\n      where: parsedWhere,\n    });\n\n    return result.page;\n  },\n};\n\ninterface CountArgs {\n  betterAuthSchema: string;\n  model: string;\n  where?: unknown[];\n}\n\nexport const count = {\n  args: {\n    betterAuthSchema: v.string(),\n    model: v.string(),\n    where: v.optional(v.array(v.any())),\n  },\n  handler: async (\n    ctx: GenericQueryCtx<GenericDataModel>,\n    { betterAuthSchema, model, where }: CountArgs,\n    schema: SchemaDefinition<any, any>,\n  ) => {\n    const authSchema = getBetterAuthSchema(betterAuthSchema);\n    const parsedWhere = (where ?? []) as WhereClause[];\n\n    // Handle OR connector\n    if (parsedWhere.some((w) => w.connector === \"OR\")) {\n      const results = await Promise.all(\n        parsedWhere.map(async (w) => {\n          const result = await paginate(ctx, schema, authSchema, {\n            model,\n            paginationOpts: { cursor: null, numItems: 200 },\n            where: [w],\n          });\n          return result.page;\n        }),\n      );\n\n      // De-duplicate and count\n      const seen = new Set<string>();\n      for (const docs of results) {\n        for (const doc of docs) {\n          const docId = doc._id as string;\n          seen.add(docId);\n        }\n      }\n      return seen.size;\n    }\n\n    // Normal case\n    const result = await paginate(ctx, schema, authSchema, {\n      model,\n      paginationOpts: { cursor: null, numItems: 200 },\n      where: parsedWhere,\n    });\n\n    return result.page.length;\n  },\n};\n\ninterface UpdateArgs {\n  betterAuthSchema: string;\n  model: string;\n  update: any;\n  where: unknown[];\n}\n\nexport const update = {\n  args: {\n    betterAuthSchema: v.string(),\n    model: v.string(),\n    update: v.any(),\n    where: v.array(v.any()),\n  },\n  handler: async (\n    ctx: GenericMutationCtx<GenericDataModel>,\n    { betterAuthSchema, model, update, where }: UpdateArgs,\n    schema: SchemaDefinition<any, any>,\n  ) => {\n    const authSchema = getBetterAuthSchema(betterAuthSchema);\n    const parsedWhere = where as WhereClause[];\n\n    // Find the document to update\n    const doc = await listOne(ctx, schema, authSchema, {\n      model,\n      where: parsedWhere,\n    });\n\n    if (!doc) {\n      return null;\n    }\n\n    // Check unique fields before update\n    await checkUniqueFields(ctx, schema, authSchema, model, update as any, doc);\n\n    await ctx.db.patch(doc._id as GenericId<any>, update as any);\n    return await ctx.db.get(doc._id as GenericId<any>);\n  },\n};\n\n// Update many operation\nexport const updateMany = {\n  args: {\n    betterAuthSchema: v.string(),\n    model: v.string(),\n    update: v.any(),\n    where: v.array(v.any()),\n  },\n  handler: async (\n    ctx: GenericMutationCtx<GenericDataModel>,\n    { betterAuthSchema, model, update, where }: UpdateArgs,\n    schema: SchemaDefinition<any, any>,\n  ) => {\n    const authSchema = getBetterAuthSchema(betterAuthSchema);\n    const parsedWhere = where as WhereClause[];\n\n    const result = await paginate(ctx, schema, authSchema, {\n      model,\n      paginationOpts: { cursor: null, numItems: 200 },\n      where: parsedWhere,\n    });\n\n    // Check unique fields if updating multiple docs\n    if (result.page.length > 1) {\n      const uniqueFieldKeys = Object.keys(update as any).filter(\n        (key) => authSchema[model]?.fields?.[key]?.unique,\n      );\n      if (uniqueFieldKeys.length > 0) {\n        throw new Error(\n          `Attempted to set unique fields in multiple documents in ${model} with the same value. Fields: ${uniqueFieldKeys.join(\", \")}`,\n        );\n      }\n    }\n\n    // Update each document\n    for (const doc of result.page) {\n      await checkUniqueFields(\n        ctx,\n        schema,\n        authSchema,\n        model,\n        update as any,\n        doc,\n      );\n      await ctx.db.patch(doc._id as GenericId<any>, update as any);\n    }\n\n    return result.page.length;\n  },\n};\n\ninterface DeleteArgs {\n  betterAuthSchema: string;\n  model: string;\n  where: unknown[];\n}\n\nexport const deleteOne = {\n  args: {\n    betterAuthSchema: v.string(),\n    model: v.string(),\n    where: v.array(v.any()),\n  },\n  handler: async (\n    ctx: GenericMutationCtx<GenericDataModel>,\n    { betterAuthSchema, model, where }: DeleteArgs,\n    schema: SchemaDefinition<any, any>,\n  ) => {\n    const authSchema = getBetterAuthSchema(betterAuthSchema);\n    const parsedWhere = where as WhereClause[];\n\n    const doc = await listOne(ctx, schema, authSchema, {\n      model,\n      where: parsedWhere,\n    });\n\n    if (!doc) {\n      return;\n    }\n\n    await ctx.db.delete(doc._id as GenericId<any>);\n  },\n};\n\n// Delete many operation\nexport const deleteMany = {\n  args: {\n    betterAuthSchema: v.string(),\n    model: v.string(),\n    where: v.array(v.any()),\n  },\n  handler: async (\n    ctx: GenericMutationCtx<GenericDataModel>,\n    { betterAuthSchema, model, where }: DeleteArgs,\n    schema: SchemaDefinition<any, any>,\n  ) => {\n    const authSchema = getBetterAuthSchema(betterAuthSchema);\n    const parsedWhere = where as WhereClause[];\n\n    const result = await paginate(ctx, schema, authSchema, {\n      model,\n      paginationOpts: { cursor: null, numItems: 200 },\n      where: parsedWhere,\n    });\n\n    // Delete each document\n    for (const doc of result.page) {\n      await ctx.db.delete(doc._id as GenericId<any>);\n    }\n\n    return result.page.length;\n  },\n};\n","/**\n * asyncMap returns the results of applying an async function over an list.\n *\n * The list can even be a promise, or an iterable like a Set.\n * @param list - Iterable object of items, e.g. an Array, Set, Object.keys\n * @param asyncTransform\n * @returns\n */\nexport async function asyncMap(list, asyncTransform) {\n    const promises = [];\n    let index = 0;\n    list = await list;\n    for (const item of list) {\n        promises.push(asyncTransform(item, index));\n        index += 1;\n    }\n    return Promise.all(promises);\n}\n/**\n * Filters out null elements from an array.\n * @param list List of elements that might be null.\n * @returns List of elements with nulls removed.\n */\nexport function pruneNull(list) {\n    return list.filter((i) => i !== null);\n}\nexport class NullDocumentError extends Error {\n}\n/**\n * Throws if there is a null element in the array.\n * @param list List of elements that might have a null element.\n * @returns Same list of elements with a refined type.\n */\nexport function nullThrows(doc, message) {\n    if (doc === null) {\n        throw new NullDocumentError(message ?? \"Unexpected null document.\");\n    }\n    return doc;\n}\n/**\n * pick helps you pick keys from an object more concisely.\n *\n * e.g. `pick({a: v.string(), b: v.number()}, [\"a\"])` is equivalent to\n * `{a: v.string()}`\n * The alternative could be something like:\n * ```js\n * const obj = { a: v.string(), b: v.number() };\n * // pick does the following\n * const { a } = obj;\n * const onlyA = { a };\n * ```\n *\n * @param obj The object to pick from. Often like { a: v.string() }\n * @param keys The keys to pick from the object.\n * @returns A new object with only the keys you picked and their values.\n */\nexport function pick(obj, keys) {\n    return Object.fromEntries(Object.entries(obj).filter(([k]) => keys.includes(k)));\n}\n/**\n * omit helps you omit keys from an object more concisely.\n *\n * e.g. `omit({a: v.string(), b: v.number()}, [\"a\"])` is equivalent to\n * `{b: v.number()}`\n *\n * The alternative could be something like:\n * ```js\n * const obj = { a: v.string(), b: v.number() };\n * // omit does the following\n * const { a, ...rest } = obj;\n * const withoutA = rest;\n * ```\n *\n * @param obj The object to return a copy of without the specified keys.\n * @param keys The keys to omit from the object.\n * @returns A new object with the keys you omitted removed.\n */\nexport function omit(obj, keys) {\n    return Object.fromEntries(Object.entries(obj).filter(([k]) => !keys.includes(k)));\n}\n/**\n * Removes the _id and _creationTime fields from an object.\n * This enables easily cloning a Convex document like:\n * ```ts\n * const doc = await db.get(id);\n * const clone = withoutSystemFields(doc);\n * await db.insert(table, clone);\n * ```\n * @param obj The object to remove the _id and _creationTime fields from.\n * @returns A new object with the _id and _creationTime fields removed.\n */\nexport function withoutSystemFields(obj) {\n    return omit(obj, [\"_id\", \"_creationTime\"]);\n}\n// Type utils:\nconst _error = Symbol();\n/**\n * A utility to validate truthiness at runtime, providing a type guard\n *\n * @example\n * ```ts\n * const x: string | null = getValue();\n * assert(x);\n * // x is now of type string\n * ```\n * You can also provide a function, to avoid doing expensive string templating.\n * @param arg A value to assert the truthiness of.\n * @param message An optional message to throw if the value is not truthy, or a function to generate the message.\n */\nexport function assert(value, message) {\n    if (!value) {\n        throw new Error(typeof message === \"function\" ? message() : message);\n    }\n}\n","import { convexToJson, compareValues, jsonToConvex, getDocumentSize, } from \"convex/values\";\n// From https://docs.convex.dev/production/state/limits#transactions\nconst MAX_DOCUMENT_SCAN_LEN = 32000;\n// Value used to trigger page split suggestions. This is kind of\n// a backstop value to mitigate additional scans over the full\n// original range if documents change later. Making it smaller\n// would result in more splits (equal to the divisor) as the\n// number of documents scanned approaches the max.\nconst SOFT_MAX_SCAN_LEN = MAX_DOCUMENT_SCAN_LEN / 2;\n//\n// Helper functions\n//\nfunction makeExclusive(boundType) {\n    if (boundType === \"gt\" || boundType === \"gte\") {\n        return \"gt\";\n    }\n    return \"lt\";\n}\n/** Split a range query between two index keys into a series of range queries\n * that should be executed in sequence. This is necessary because Convex only\n * supports range queries of the form\n * q.eq(\"f1\", v).eq(\"f2\", v).lt(\"f3\", v).gt(\"f3\", v).\n * i.e. all fields must be equal except for the last field, which can have\n * two inequalities.\n *\n * For example, the range from >[1, 2, 3] to <=[1, 3, 2] would be split into\n * the following queries:\n * 1. q.eq(\"f1\", 1).eq(\"f2\", 2).gt(\"f3\", 3)\n * 2. q.eq(\"f1\", 1).gt(\"f2\", 2).lt(\"f2\", 3)\n * 3. q.eq(\"f1\", 1).eq(\"f2\", 3).lte(\"f3\", 2)\n */\nfunction splitRange(indexFields, \n// For descending queries, the resulting queries are reversed.\norder, startBound, endBound, startBoundType, endBoundType) {\n    // Three parts to the split:\n    // 1. reduce down from startBound to common prefix\n    // 2. range with common prefix\n    // 3. build back up from common prefix to endBound\n    const commonPrefix = [];\n    while (startBound.length > 0 &&\n        endBound.length > 0 &&\n        compareValues(startBound[0], endBound[0]) === 0) {\n        const indexField = indexFields[0];\n        indexFields = indexFields.slice(1);\n        const eqBound = startBound[0];\n        startBound = startBound.slice(1);\n        endBound = endBound.slice(1);\n        commonPrefix.push([\"eq\", indexField, eqBound]);\n    }\n    const makeCompare = (boundType, key) => {\n        const range = commonPrefix.slice();\n        let i = 0;\n        for (; i < key.length - 1; i++) {\n            range.push([\"eq\", indexFields[i], key[i]]);\n        }\n        if (i < key.length) {\n            range.push([boundType, indexFields[i], key[i]]);\n        }\n        return range;\n    };\n    // Stage 1.\n    const startRanges = [];\n    while (startBound.length > 1) {\n        startRanges.push(makeCompare(startBoundType, startBound));\n        startBoundType = makeExclusive(startBoundType);\n        startBound = startBound.slice(0, -1);\n    }\n    // Stage 3.\n    const endRanges = [];\n    while (endBound.length > 1) {\n        endRanges.push(makeCompare(endBoundType, endBound));\n        endBoundType = makeExclusive(endBoundType);\n        endBound = endBound.slice(0, -1);\n    }\n    endRanges.reverse();\n    // Stage 2.\n    let middleRange;\n    if (endBound.length === 0) {\n        middleRange = makeCompare(startBoundType, startBound);\n    }\n    else if (startBound.length === 0) {\n        middleRange = makeCompare(endBoundType, endBound);\n    }\n    else {\n        const startValue = startBound[0];\n        const endValue = endBound[0];\n        middleRange = commonPrefix.slice();\n        middleRange.push([startBoundType, indexFields[0], startValue]);\n        middleRange.push([endBoundType, indexFields[0], endValue]);\n    }\n    const ranges = [...startRanges, middleRange, ...endRanges];\n    if (order === \"desc\") {\n        ranges.reverse();\n    }\n    return ranges;\n}\nfunction rangeToQuery(range) {\n    return (q) => {\n        for (const [boundType, field, value] of range) {\n            q = q[boundType](field, value);\n        }\n        return q;\n    };\n}\n/**\n * Get the ordered list of fields for a given table's index based on the schema.\n *\n * - For \"by_creation_time\", returns [\"_creationTime\", \"_id\"].\n * - For \"by_id\", returns [\"_id\"].\n * - Otherwise, looks up the named index in the schema and returns its fields\n *   followed by [\"_creationTime\", \"_id\"].\n * e.g. for an index defined like `.index(\"abc\", [\"a\", \"b\"])`,\n * returns [\"a\", \"b\", \"_creationTime\", \"_id\"].\n */\nexport function getIndexFields(table, index, schema) {\n    const indexDescriptor = String(index ?? \"by_creation_time\");\n    if (indexDescriptor === \"by_creation_time\") {\n        return [\"_creationTime\", \"_id\"];\n    }\n    if (indexDescriptor === \"by_id\") {\n        return [\"_id\"];\n    }\n    if (!schema) {\n        throw new Error(\"schema is required to infer index fields\");\n    }\n    const tableInfo = schema.tables[table];\n    const indexInfo = tableInfo.indexes.find((index) => index.indexDescriptor === indexDescriptor);\n    if (!indexInfo) {\n        throw new Error(`Index ${indexDescriptor} not found in table ${table}`);\n    }\n    const fields = indexInfo.fields.slice();\n    fields.push(\"_creationTime\");\n    fields.push(\"_id\");\n    return fields;\n}\nfunction getIndexKey(doc, indexFields) {\n    const key = [];\n    for (const field of indexFields) {\n        let obj = doc;\n        for (const subfield of field.split(\".\")) {\n            obj = obj[subfield];\n        }\n        key.push(obj);\n    }\n    return key;\n}\n/**\n * A \"stream\" is an async iterable of query results, ordered by an index on a table.\n *\n * Use it as you would use `ctx.db`.\n * If using pagination in a reactive query, see the warnings on the `paginator`\n * function. TL;DR: you need to pass in `endCursor` to prevent holes or overlaps\n * between pages.\n *\n * Once you have a stream, you can use `mergeStreams` or `filterStream` to make\n * more streams. Then use `queryStream` to convert it into an OrderedQuery,\n * so you can call `.paginate()`, `.collect()`, etc.\n */\nexport function stream(db, schema) {\n    return new StreamDatabaseReader(db, schema);\n}\n/**\n * A \"QueryStream\" is an async iterable of query results, ordered by indexed fields.\n */\nexport class QueryStream {\n    /// Methods for creating new streams as modifications of the current stream.\n    /**\n     * Create a new stream with a TypeScript filter applied.\n     *\n     * This is similar to `db.query(tableName).filter(predicate)`, but it's more\n     * general because it can call arbitrary TypeScript code, including more\n     * database queries.\n     *\n     * All documents filtered out are still considered \"read\" from the database;\n     * they are just excluded from the output stream.\n     *\n     * In contrast to `filter` from convex-helpers/server/filter, this filterWith\n     * is applied *before* any pagination. That means if the filter excludes a lot\n     * of documents, the `.paginate()` method will read a lot of documents until\n     * it gets as many documents as it wants. If you run into issues with reading\n     * too much data, you can pass `maximumRowsRead` to `paginate()`.\n     */\n    filterWith(predicate) {\n        const order = this.getOrder();\n        return new FlatMapStream(this, async (doc) => {\n            const filtered = (await predicate(doc)) ? doc : null;\n            return new SingletonStream(filtered, order, [], [], []);\n        }, []);\n    }\n    /**\n     * Create a new stream where each element is the result of applying the mapper\n     * function to the elements of the original stream.\n     *\n     * Similar to how [1, 2, 3].map(x => x * 2) => [2, 4, 6]\n     */\n    map(mapper) {\n        const order = this.getOrder();\n        return new FlatMapStream(this, async (doc) => {\n            const mapped = await mapper(doc);\n            return new SingletonStream(mapped, order, [], [], []);\n        }, []);\n    }\n    /**\n     * Similar to flatMap on an array, but iterate over a stream, and the for each\n     * element, iterate over the stream created by the mapper function.\n     *\n     * Ordered by the original stream order, then the mapped stream. Similar to\n     * how [\"a\", \"b\"].flatMap(letter => [letter, letter]) => [\"a\", \"a\", \"b\", \"b\"]\n     *\n     * @param mapper A function that takes a document and returns a new stream.\n     * @param mappedIndexFields The index fields of the streams created by mapper.\n     * @returns A stream of documents returned by the mapper streams,\n     *   grouped by the documents in the original stream.\n     */\n    flatMap(mapper, mappedIndexFields) {\n        normalizeIndexFields(mappedIndexFields);\n        return new FlatMapStream(this, mapper, mappedIndexFields);\n    }\n    /**\n     * Get the first item from the original stream for each distinct value of the\n     * selected index fields.\n     *\n     * e.g. if the stream has an equality filter on `a`, and index fields `[a, b, c]`,\n     * we can do `stream.distinct([\"b\"])` to get a stream of the first item for\n     * each distinct value of `b`.\n     * Similarly, you could do `stream.distinct([\"a\", \"b\"])` with the same result,\n     * or `stream.distinct([\"a\", \"b\", \"c\"])` to get the original stream.\n     *\n     * This stream efficiently skips past items with the same value for the selected\n     * distinct index fields.\n     *\n     * This can be used to perform a loose index scan.\n     */\n    distinct(distinctIndexFields) {\n        return new DistinctStream(this, distinctIndexFields);\n    }\n    /// Implementation of OrderedQuery\n    filter(_predicate) {\n        throw new Error(\"Cannot call .filter() directly on a query stream. Use .filterWith() for filtering or .collect() if you want to convert the stream to an array first.\");\n    }\n    async paginate(opts) {\n        if (opts.numItems === 0) {\n            if (opts.cursor === null) {\n                throw new Error(\".paginate called with cursor of null and 0 for numItems. \" +\n                    \"This is not supported, as null is not a valid continueCursor. \" +\n                    \"Advice: avoid calling paginate entirely in these cases.\");\n            }\n            return {\n                page: [],\n                isDone: false,\n                continueCursor: opts.cursor,\n            };\n        }\n        const order = this.getOrder();\n        let newStartKey = {\n            key: [],\n            inclusive: true,\n        };\n        if (opts.cursor !== null) {\n            newStartKey = {\n                key: deserializeCursor(opts.cursor),\n                inclusive: false,\n            };\n        }\n        let newEndKey = {\n            key: [],\n            inclusive: true,\n        };\n        const maxRowsToRead = opts.maximumRowsRead;\n        let maxRows = opts.numItems;\n        if (opts.endCursor) {\n            newEndKey = {\n                key: deserializeCursor(opts.endCursor),\n                inclusive: true,\n            };\n            // If there's an endCursor, continue until we get there even if it's more\n            // than numItems.\n            maxRows = undefined;\n        }\n        const newLowerBound = order === \"asc\" ? newStartKey : newEndKey;\n        const newUpperBound = order === \"asc\" ? newEndKey : newStartKey;\n        const narrowStream = this.narrow({\n            lowerBound: newLowerBound.key,\n            lowerBoundInclusive: newLowerBound.inclusive,\n            upperBound: newUpperBound.key,\n            upperBoundInclusive: newUpperBound.inclusive,\n        });\n        const page = [];\n        const indexKeys = [];\n        let hasMore = opts.endCursor && opts.endCursor !== \"[]\";\n        let continueCursor = opts.endCursor ?? \"[]\";\n        const maxBytesToRead = opts.maximumBytesRead;\n        const trackBandwidth = maxBytesToRead !== undefined;\n        let totalBytesRead = 0;\n        let hitLimit = false;\n        for await (const [doc, indexKey, bandwidth] of narrowStream.iterWithKeys(trackBandwidth)) {\n            if (doc !== null) {\n                page.push(doc);\n            }\n            indexKeys.push(indexKey);\n            totalBytesRead += bandwidth;\n            if ((maxBytesToRead !== undefined && totalBytesRead >= maxBytesToRead) ||\n                (maxRowsToRead !== undefined && indexKeys.length >= maxRowsToRead)) {\n                hitLimit = true;\n            }\n            if (hitLimit || (maxRows !== undefined && page.length >= maxRows)) {\n                hasMore = true;\n                continueCursor = serializeCursor(indexKey);\n                break;\n            }\n        }\n        let pageStatus = undefined;\n        let splitCursor = undefined;\n        if (hitLimit) {\n            pageStatus = \"SplitRequired\";\n            splitCursor = indexKeys[Math.floor((indexKeys.length - 1) / 2)];\n        }\n        else if (indexKeys.length >= SOFT_MAX_SCAN_LEN ||\n            page.length > opts.numItems + 1) {\n            pageStatus = \"SplitRecommended\";\n            splitCursor = indexKeys[Math.floor((indexKeys.length - 1) / 2)];\n        }\n        return {\n            page,\n            isDone: !hasMore,\n            continueCursor,\n            pageStatus,\n            splitCursor: splitCursor ? serializeCursor(splitCursor) : undefined,\n        };\n    }\n    async collect() {\n        return await this.take(Infinity);\n    }\n    async take(n) {\n        const results = [];\n        for await (const [doc] of this.iterWithKeys()) {\n            if (doc === null) {\n                continue;\n            }\n            results.push(doc);\n            if (results.length === n) {\n                break;\n            }\n        }\n        return results;\n    }\n    async unique() {\n        const docs = await this.take(2);\n        if (docs.length === 2) {\n            throw new Error(\"Query is not unique\");\n        }\n        return docs[0] ?? null;\n    }\n    async first() {\n        const docs = await this.take(1);\n        return docs[0] ?? null;\n    }\n    [Symbol.asyncIterator]() {\n        const iterator = this.iterWithKeys()[Symbol.asyncIterator]();\n        return {\n            async next() {\n                const result = await iterator.next();\n                if (result.done) {\n                    return { done: true, value: undefined };\n                }\n                return { done: false, value: result.value[0] };\n            },\n        };\n    }\n}\nexport class StreamDatabaseReader {\n    db;\n    schema;\n    // TODO: support system tables\n    system;\n    constructor(db, schema) {\n        this.db = db;\n        this.schema = schema;\n        this.system = db.system;\n    }\n    query(tableName) {\n        return new StreamQueryInitializer(this, tableName);\n    }\n    get(_id) {\n        throw new Error(\"get() not supported for `paginator`\");\n    }\n    normalizeId(_tableName, _id) {\n        throw new Error(\"normalizeId() not supported for `paginator`.\");\n    }\n}\nexport class StreamableQuery extends QueryStream {\n}\nexport class StreamQueryInitializer extends StreamableQuery {\n    parent;\n    table;\n    constructor(parent, table) {\n        super();\n        this.parent = parent;\n        this.table = table;\n    }\n    fullTableScan() {\n        return this.withIndex(\"by_creation_time\");\n    }\n    withIndex(indexName, indexRange) {\n        const indexFields = getIndexFields(this.table, indexName, this.parent.schema);\n        const q = new ReflectIndexRange(indexFields);\n        if (indexRange) {\n            indexRange(q);\n        }\n        return new StreamQuery(this, indexName, q, indexRange);\n    }\n    withSearchIndex(_indexName, _searchFilter) {\n        throw new Error(\"Cannot paginate withSearchIndex\");\n    }\n    inner() {\n        return this.fullTableScan();\n    }\n    order(order) {\n        return this.inner().order(order);\n    }\n    reflect() {\n        return this.inner().reflect();\n    }\n    iterWithKeys(trackBandwidth = false) {\n        return this.inner().iterWithKeys(trackBandwidth);\n    }\n    getOrder() {\n        return this.inner().getOrder();\n    }\n    getEqualityIndexFilter() {\n        return this.inner().getEqualityIndexFilter();\n    }\n    getIndexFields() {\n        return this.inner().getIndexFields();\n    }\n    narrow(indexBounds) {\n        return this.inner().narrow(indexBounds);\n    }\n}\n// Not to be confused with QueryStream or StreamableQuery.\nexport class StreamQuery extends StreamableQuery {\n    parent;\n    index;\n    q;\n    indexRange;\n    constructor(parent, index, q, indexRange) {\n        super();\n        this.parent = parent;\n        this.index = index;\n        this.q = q;\n        this.indexRange = indexRange;\n    }\n    order(order) {\n        return new OrderedStreamQuery(this, order);\n    }\n    inner() {\n        return this.order(\"asc\");\n    }\n    reflect() {\n        return this.inner().reflect();\n    }\n    iterWithKeys(trackBandwidth = false) {\n        return this.inner().iterWithKeys(trackBandwidth);\n    }\n    getOrder() {\n        return this.inner().getOrder();\n    }\n    getEqualityIndexFilter() {\n        return this.inner().getEqualityIndexFilter();\n    }\n    getIndexFields() {\n        return this.inner().getIndexFields();\n    }\n    narrow(indexBounds) {\n        return this.inner().narrow(indexBounds);\n    }\n}\nexport class OrderedStreamQuery extends StreamableQuery {\n    parent;\n    order;\n    constructor(parent, order) {\n        super();\n        this.parent = parent;\n        this.order = order;\n    }\n    reflect() {\n        return {\n            db: this.parent.parent.parent.db,\n            schema: this.parent.parent.parent.schema,\n            table: this.parent.parent.table,\n            index: this.parent.index,\n            indexFields: this.parent.q.indexFields,\n            order: this.order,\n            bounds: {\n                lowerBound: this.parent.q.lowerBoundIndexKey ?? [],\n                lowerBoundInclusive: this.parent.q.lowerBoundInclusive,\n                upperBound: this.parent.q.upperBoundIndexKey ?? [],\n                upperBoundInclusive: this.parent.q.upperBoundInclusive,\n            },\n            indexRange: this.parent.indexRange,\n        };\n    }\n    /**\n     * inner() is as if you had used ctx.db to construct the query.\n     */\n    inner() {\n        const { db, table, index, order, indexRange } = this.reflect();\n        return db.query(table).withIndex(index, indexRange).order(order);\n    }\n    iterWithKeys(trackBandwidth = false) {\n        const { indexFields } = this.reflect();\n        const iterable = this.inner();\n        return {\n            [Symbol.asyncIterator]() {\n                const iterator = iterable[Symbol.asyncIterator]();\n                return {\n                    async next() {\n                        const result = await iterator.next();\n                        if (result.done) {\n                            return { done: true, value: undefined };\n                        }\n                        const doc = result.value;\n                        const bandwidth = trackBandwidth ? getDocumentSize(doc) : 0;\n                        return {\n                            done: false,\n                            value: [doc, getIndexKey(doc, indexFields), bandwidth],\n                        };\n                    },\n                };\n            },\n        };\n    }\n    getOrder() {\n        return this.order;\n    }\n    getEqualityIndexFilter() {\n        return this.parent.q.equalityIndexFilter;\n    }\n    getIndexFields() {\n        return this.parent.q.indexFields;\n    }\n    narrow(indexBounds) {\n        const { db, table, index, order, bounds, schema } = this.reflect();\n        let maxLowerBound = bounds.lowerBound;\n        let maxLowerBoundInclusive = bounds.lowerBoundInclusive;\n        if (compareKeys({\n            value: indexBounds.lowerBound,\n            kind: indexBounds.lowerBoundInclusive ? \"predecessor\" : \"successor\",\n        }, {\n            value: bounds.lowerBound,\n            kind: bounds.lowerBoundInclusive ? \"predecessor\" : \"successor\",\n        }) > 0) {\n            maxLowerBound = indexBounds.lowerBound;\n            maxLowerBoundInclusive = indexBounds.lowerBoundInclusive;\n        }\n        let minUpperBound = bounds.upperBound;\n        let minUpperBoundInclusive = bounds.upperBoundInclusive;\n        if (compareKeys({\n            value: indexBounds.upperBound,\n            kind: indexBounds.upperBoundInclusive ? \"successor\" : \"predecessor\",\n        }, {\n            value: bounds.upperBound,\n            kind: bounds.upperBoundInclusive ? \"successor\" : \"predecessor\",\n        }) < 0) {\n            minUpperBound = indexBounds.upperBound;\n            minUpperBoundInclusive = indexBounds.upperBoundInclusive;\n        }\n        return streamIndexRange(db, schema, table, index, {\n            lowerBound: maxLowerBound,\n            lowerBoundInclusive: maxLowerBoundInclusive,\n            upperBound: minUpperBound,\n            upperBoundInclusive: minUpperBoundInclusive,\n        }, order);\n    }\n}\n/**\n * Create a stream of documents using the given index and bounds.\n */\nexport function streamIndexRange(db, schema, table, index, bounds, order) {\n    const indexFields = getIndexFields(table, index, schema);\n    const splitBounds = splitRange(indexFields, order, bounds.lowerBound, bounds.upperBound, bounds.lowerBoundInclusive ? \"gte\" : \"gt\", bounds.upperBoundInclusive ? \"lte\" : \"lt\");\n    const subQueries = splitBounds.map((splitBound) => stream(db, schema)\n        .query(table)\n        .withIndex(index, rangeToQuery(splitBound))\n        .order(order));\n    return new ConcatStreams(...subQueries);\n}\nclass ReflectIndexRange {\n    indexFields;\n    #hasSuffix = false;\n    lowerBoundIndexKey = undefined;\n    lowerBoundInclusive = true;\n    upperBoundIndexKey = undefined;\n    upperBoundInclusive = true;\n    equalityIndexFilter = [];\n    constructor(indexFields) {\n        this.indexFields = indexFields;\n    }\n    eq(field, value) {\n        if (!this.#canLowerBound(field) || !this.#canUpperBound(field)) {\n            throw new Error(`Cannot use eq on field '${field}'`);\n        }\n        this.lowerBoundIndexKey = this.lowerBoundIndexKey ?? [];\n        this.lowerBoundIndexKey.push(value);\n        this.upperBoundIndexKey = this.upperBoundIndexKey ?? [];\n        this.upperBoundIndexKey.push(value);\n        this.equalityIndexFilter.push(value);\n        return this;\n    }\n    lt(field, value) {\n        if (!this.#canUpperBound(field)) {\n            throw new Error(`Cannot use lt on field '${field}'`);\n        }\n        this.upperBoundIndexKey = this.upperBoundIndexKey ?? [];\n        this.upperBoundIndexKey.push(value);\n        this.upperBoundInclusive = false;\n        this.#hasSuffix = true;\n        return this;\n    }\n    lte(field, value) {\n        if (!this.#canUpperBound(field)) {\n            throw new Error(`Cannot use lte on field '${field}'`);\n        }\n        this.upperBoundIndexKey = this.upperBoundIndexKey ?? [];\n        this.upperBoundIndexKey.push(value);\n        this.#hasSuffix = true;\n        return this;\n    }\n    gt(field, value) {\n        if (!this.#canLowerBound(field)) {\n            throw new Error(`Cannot use gt on field '${field}'`);\n        }\n        this.lowerBoundIndexKey = this.lowerBoundIndexKey ?? [];\n        this.lowerBoundIndexKey.push(value);\n        this.lowerBoundInclusive = false;\n        this.#hasSuffix = true;\n        return this;\n    }\n    gte(field, value) {\n        if (!this.#canLowerBound(field)) {\n            throw new Error(`Cannot use gte on field '${field}'`);\n        }\n        this.lowerBoundIndexKey = this.lowerBoundIndexKey ?? [];\n        this.lowerBoundIndexKey.push(value);\n        this.#hasSuffix = true;\n        return this;\n    }\n    #canLowerBound(field) {\n        const currentLowerBoundLength = this.lowerBoundIndexKey?.length ?? 0;\n        const currentUpperBoundLength = this.upperBoundIndexKey?.length ?? 0;\n        if (currentLowerBoundLength > currentUpperBoundLength) {\n            // Already have a lower bound.\n            return false;\n        }\n        if (currentLowerBoundLength === currentUpperBoundLength &&\n            this.#hasSuffix) {\n            // Already have a lower bound and an upper bound.\n            return false;\n        }\n        return (currentLowerBoundLength < this.indexFields.length &&\n            this.indexFields[currentLowerBoundLength] === field);\n    }\n    #canUpperBound(field) {\n        const currentLowerBoundLength = this.lowerBoundIndexKey?.length ?? 0;\n        const currentUpperBoundLength = this.upperBoundIndexKey?.length ?? 0;\n        if (currentUpperBoundLength > currentLowerBoundLength) {\n            // Already have an upper bound.\n            return false;\n        }\n        if (currentLowerBoundLength === currentUpperBoundLength &&\n            this.#hasSuffix) {\n            // Already have a lower bound and an upper bound.\n            return false;\n        }\n        return (currentUpperBoundLength < this.indexFields.length &&\n            this.indexFields[currentUpperBoundLength] === field);\n    }\n}\n/**\n * Merge multiple streams, provided in any order, into a single stream.\n *\n * The streams will be merged into a stream of documents ordered by the index keys,\n * i.e. by \"author\" (then by the implicit \"_creationTime\").\n *\n * e.g. ```ts\n * mergedStream([\n *   stream(db, schema).query(\"messages\").withIndex(\"by_author\", q => q.eq(\"author\", \"user3\")),\n *   stream(db, schema).query(\"messages\").withIndex(\"by_author\", q => q.eq(\"author\", \"user1\")),\n *   stream(db, schema).query(\"messages\").withIndex(\"by_author\", q => q.eq(\"author\", \"user2\")),\n * ], [\"author\"])\n * ```\n *\n * returns a stream of messages for user1, then user2, then user3.\n *\n * You can also use `orderByIndexFields` to change the indexed fields before merging, which changes the order of the merged stream.\n * This only works if the streams are already ordered by `orderByIndexFields`,\n * which happens if each does a .eq(field, value) on all index fields before `orderByIndexFields`.\n *\n * e.g. if the \"by_author\" index is defined as being ordered by [\"author\", \"_creationTime\"],\n * and each query does an equality lookup on \"author\", each individual query before merging is in fact ordered by \"_creationTime\".\n *\n * e.g. ```ts\n * mergedStream([\n *   stream(db, schema).query(\"messages\").withIndex(\"by_author\", q => q.eq(\"author\", \"user3\")),\n *   stream(db, schema).query(\"messages\").withIndex(\"by_author\", q => q.eq(\"author\", \"user1\")),\n *   stream(db, schema).query(\"messages\").withIndex(\"by_author\", q => q.eq(\"author\", \"user2\")),\n * ], [\"_creationTime\"])\n * ```\n *\n * This returns a stream of messages from all three users, sorted by creation time.\n */\nexport function mergedStream(streams, orderByIndexFields) {\n    return new MergedStream(streams, orderByIndexFields);\n}\nexport class MergedStream extends QueryStream {\n    #order;\n    #streams;\n    #equalityIndexFilter;\n    #indexFields;\n    constructor(streams, orderByIndexFields) {\n        super();\n        if (streams.length === 0) {\n            throw new Error(\"Cannot union empty array of streams\");\n        }\n        this.#order = allSame(streams.map((stream) => stream.getOrder()), \"Cannot merge streams with different orders\");\n        this.#streams = streams.map((stream) => new OrderByStream(stream, orderByIndexFields));\n        this.#indexFields = allSame(this.#streams.map((stream) => stream.getIndexFields()), \"Cannot merge streams with different index fields. Consider using .orderBy()\");\n        // Calculate common prefix of equality index filters.\n        this.#equalityIndexFilter = commonPrefix(this.#streams.map((stream) => stream.getEqualityIndexFilter()));\n    }\n    iterWithKeys(trackBandwidth = false) {\n        const iterables = this.#streams.map((stream) => stream.iterWithKeys(trackBandwidth));\n        const comparisonInversion = this.#order === \"asc\" ? 1 : -1;\n        return {\n            [Symbol.asyncIterator]() {\n                const iterators = iterables.map((iterable) => iterable[Symbol.asyncIterator]());\n                const results = Array(iterators.length);\n                // Track bandwidth from pre-fetched documents not yet yielded\n                const pendingBandwidth = Array(iterators.length).fill(0);\n                return {\n                    async next() {\n                        let bandwidthThisIteration = 0;\n                        // Fill results from iterators with no value yet.\n                        await Promise.all(iterators.map(async (iterator, i) => {\n                            if (!results[i]) {\n                                const result = await iterator.next();\n                                results[i] = result;\n                                // Track bandwidth from pre-fetched documents\n                                if (trackBandwidth && !result.done && result.value) {\n                                    pendingBandwidth[i] = result.value[2];\n                                }\n                            }\n                        }));\n                        // Sum all pending bandwidth (pre-fetched docs) for this iteration\n                        if (trackBandwidth) {\n                            for (let i = 0; i < pendingBandwidth.length; i++) {\n                                bandwidthThisIteration += pendingBandwidth[i];\n                                pendingBandwidth[i] = 0;\n                            }\n                        }\n                        // Find index for the value with the lowest index key.\n                        let minIndexKeyAndIndex = undefined;\n                        for (let i = 0; i < results.length; i++) {\n                            const result = results[i];\n                            if (result.done || !result.value) {\n                                continue;\n                            }\n                            const [_, resultIndexKey] = result.value;\n                            if (minIndexKeyAndIndex === undefined) {\n                                minIndexKeyAndIndex = [resultIndexKey, i];\n                                continue;\n                            }\n                            const [prevMin] = minIndexKeyAndIndex;\n                            if (compareKeys({ value: resultIndexKey, kind: \"exact\" }, { value: prevMin, kind: \"exact\" }) *\n                                comparisonInversion <\n                                0) {\n                                minIndexKeyAndIndex = [resultIndexKey, i];\n                            }\n                        }\n                        if (minIndexKeyAndIndex === undefined) {\n                            return { done: true, value: undefined };\n                        }\n                        const [_, minIndex] = minIndexKeyAndIndex;\n                        const [doc, indexKey] = results[minIndex].value;\n                        // indicate that we've used this result\n                        results[minIndex] = undefined;\n                        return {\n                            done: false,\n                            value: [doc, indexKey, bandwidthThisIteration],\n                        };\n                    },\n                };\n            },\n        };\n    }\n    getOrder() {\n        return this.#order;\n    }\n    getEqualityIndexFilter() {\n        return this.#equalityIndexFilter;\n    }\n    getIndexFields() {\n        return this.#indexFields;\n    }\n    narrow(indexBounds) {\n        return new MergedStream(this.#streams.map((stream) => stream.narrow(indexBounds)), this.#indexFields);\n    }\n}\nfunction allSame(values, errorMessage) {\n    const first = values[0];\n    for (const value of values) {\n        if (compareValues(value, first)) {\n            throw new Error(errorMessage);\n        }\n    }\n    return first;\n}\nfunction commonPrefix(values) {\n    let commonPrefix = values[0];\n    for (const value of values) {\n        for (let i = 0; i < commonPrefix.length; i++) {\n            if (i >= value.length || compareValues(commonPrefix[i], value[i])) {\n                commonPrefix = commonPrefix.slice(0, i);\n                break;\n            }\n        }\n    }\n    return commonPrefix;\n}\n/**\n * Concatenate multiple streams into a single stream.\n * This assumes that the streams correspond to disjoint index ranges,\n * and are provided in the same order as the index ranges.\n *\n * e.g. ```ts\n * new ConcatStreams(\n *   stream(db, schema).query(\"messages\").withIndex(\"by_author\", q => q.eq(\"author\", \"user1\")),\n *   stream(db, schema).query(\"messages\").withIndex(\"by_author\", q => q.eq(\"author\", \"user2\")),\n * )\n * ```\n *\n * is valid, but if the stream arguments were reversed, or the queries were\n * `.order(\"desc\")`, it would be invalid.\n *\n * It's not recommended to use `ConcatStreams` directly, since it has the same\n * behavior as `MergedStream`, but with fewer runtime checks.\n */\nclass ConcatStreams extends QueryStream {\n    #order;\n    #streams;\n    #equalityIndexFilter;\n    #indexFields;\n    constructor(...streams) {\n        super();\n        this.#streams = streams;\n        if (streams.length === 0) {\n            throw new Error(\"Cannot concat empty array of streams\");\n        }\n        this.#order = allSame(streams.map((stream) => stream.getOrder()), \"Cannot concat streams with different orders. Consider using .orderBy()\");\n        this.#indexFields = allSame(streams.map((stream) => stream.getIndexFields()), \"Cannot concat streams with different index fields. Consider using .orderBy()\");\n        this.#equalityIndexFilter = commonPrefix(streams.map((stream) => stream.getEqualityIndexFilter()));\n    }\n    iterWithKeys(trackBandwidth = false) {\n        const iterables = this.#streams.map((stream) => stream.iterWithKeys(trackBandwidth));\n        const comparisonInversion = this.#order === \"asc\" ? 1 : -1;\n        let previousIndexKey = undefined;\n        return {\n            [Symbol.asyncIterator]() {\n                const iterators = iterables.map((iterable) => iterable[Symbol.asyncIterator]());\n                return {\n                    async next() {\n                        while (iterators.length > 0) {\n                            const result = await iterators[0].next();\n                            if (result.done) {\n                                iterators.shift();\n                            }\n                            else {\n                                const [_, indexKey] = result.value;\n                                if (previousIndexKey !== undefined &&\n                                    compareKeys({\n                                        value: previousIndexKey,\n                                        kind: \"exact\",\n                                    }, {\n                                        value: indexKey,\n                                        kind: \"exact\",\n                                    }) *\n                                        comparisonInversion >\n                                        0) {\n                                    throw new Error(`ConcatStreams in wrong order: ${JSON.stringify(previousIndexKey)}, ${JSON.stringify(indexKey)}`);\n                                }\n                                previousIndexKey = indexKey;\n                                return result;\n                            }\n                        }\n                        return { done: true, value: undefined };\n                    },\n                };\n            },\n        };\n    }\n    getOrder() {\n        return this.#order;\n    }\n    getEqualityIndexFilter() {\n        return this.#equalityIndexFilter;\n    }\n    getIndexFields() {\n        return this.#indexFields;\n    }\n    narrow(indexBounds) {\n        return new ConcatStreams(...this.#streams.map((stream) => stream.narrow(indexBounds)));\n    }\n}\nclass FlatMapStreamIterator {\n    #outerStream;\n    #outerIterator;\n    #currentOuterItem = null;\n    #mapper;\n    #mappedIndexFields;\n    #trackBandwidth;\n    constructor(outerStream, mapper, mappedIndexFields, trackBandwidth) {\n        this.#outerIterator = outerStream\n            .iterWithKeys(trackBandwidth)[Symbol.asyncIterator]();\n        this.#outerStream = outerStream;\n        this.#mapper = mapper;\n        this.#mappedIndexFields = mappedIndexFields;\n        this.#trackBandwidth = trackBandwidth;\n    }\n    singletonSkipInnerStream() {\n        // If the outer stream is a filtered value, yield a singleton\n        // filtered value from the inner stream, with index key of nulls.\n        const indexKey = this.#mappedIndexFields.map(() => null);\n        return new SingletonStream(null, this.#outerStream.getOrder(), this.#mappedIndexFields, indexKey, indexKey);\n    }\n    async setCurrentOuterItem(item) {\n        const [t, indexKey, bandwidth] = item;\n        let innerStream;\n        if (t === null) {\n            innerStream = this.singletonSkipInnerStream();\n        }\n        else {\n            innerStream = await this.#mapper(t);\n            if (!equalIndexFields(innerStream.getIndexFields(), this.#mappedIndexFields)) {\n                throw new Error(`FlatMapStream: inner stream has different index fields than expected: ${JSON.stringify(innerStream.getIndexFields())} vs ${JSON.stringify(this.#mappedIndexFields)}`);\n            }\n            if (innerStream.getOrder() !== this.#outerStream.getOrder()) {\n                throw new Error(`FlatMapStream: inner stream has different order than outer stream: ${innerStream.getOrder()} vs ${this.#outerStream.getOrder()}`);\n            }\n        }\n        this.#currentOuterItem = {\n            t,\n            indexKey,\n            innerIterator: innerStream\n                .iterWithKeys(this.#trackBandwidth)[Symbol.asyncIterator](),\n            count: 0,\n            bandwidth,\n        };\n    }\n    async next() {\n        if (this.#currentOuterItem === null) {\n            const result = await this.#outerIterator.next();\n            if (result.done) {\n                return { done: true, value: undefined };\n            }\n            await this.setCurrentOuterItem(result.value);\n            return await this.next();\n        }\n        const result = await this.#currentOuterItem.innerIterator.next();\n        if (result.done) {\n            if (this.#currentOuterItem.count > 0) {\n                this.#currentOuterItem = null;\n            }\n            else {\n                // The inner stream was completely empty, so we should inject a null\n                // (which will be skipped by everything except the maximumRowsRead count)\n                // to account for the cost of the outer stream.\n                this.#currentOuterItem.innerIterator = this.singletonSkipInnerStream()\n                    .iterWithKeys(this.#trackBandwidth)[Symbol.asyncIterator]();\n            }\n            return await this.next();\n        }\n        const [u, indexKey, innerBandwidth] = result.value;\n        this.#currentOuterItem.count++;\n        const fullIndexKey = [...this.#currentOuterItem.indexKey, ...indexKey];\n        // On first yield for this outer item, include outer bandwidth\n        const bandwidth = (this.#currentOuterItem.count === 1\n            ? this.#currentOuterItem.bandwidth\n            : 0) + innerBandwidth;\n        return { done: false, value: [u, fullIndexKey, bandwidth] };\n    }\n}\nclass FlatMapStream extends QueryStream {\n    #stream;\n    #mapper;\n    #mappedIndexFields;\n    constructor(stream, mapper, mappedIndexFields) {\n        super();\n        this.#stream = stream;\n        this.#mapper = mapper;\n        this.#mappedIndexFields = mappedIndexFields;\n    }\n    iterWithKeys(trackBandwidth = false) {\n        const outerStream = this.#stream;\n        const mapper = this.#mapper;\n        const mappedIndexFields = this.#mappedIndexFields;\n        return {\n            [Symbol.asyncIterator]() {\n                return new FlatMapStreamIterator(outerStream, mapper, mappedIndexFields, trackBandwidth);\n            },\n        };\n    }\n    getOrder() {\n        return this.#stream.getOrder();\n    }\n    getEqualityIndexFilter() {\n        return this.#stream.getEqualityIndexFilter();\n    }\n    getIndexFields() {\n        return [...this.#stream.getIndexFields(), ...this.#mappedIndexFields];\n    }\n    narrow(indexBounds) {\n        const outerLength = this.#stream.getIndexFields().length;\n        const outerLowerBound = indexBounds.lowerBound.slice(0, outerLength);\n        const outerUpperBound = indexBounds.upperBound.slice(0, outerLength);\n        const innerLowerBound = indexBounds.lowerBound.slice(outerLength);\n        const innerUpperBound = indexBounds.upperBound.slice(outerLength);\n        const outerIndexBounds = {\n            lowerBound: outerLowerBound,\n            lowerBoundInclusive: innerLowerBound.length === 0 ? indexBounds.lowerBoundInclusive : true,\n            upperBound: outerUpperBound,\n            upperBoundInclusive: innerUpperBound.length === 0 ? indexBounds.upperBoundInclusive : true,\n        };\n        const innerIndexBounds = {\n            lowerBound: innerLowerBound,\n            lowerBoundInclusive: innerLowerBound.length === 0 ? true : indexBounds.lowerBoundInclusive,\n            upperBound: innerUpperBound,\n            upperBoundInclusive: innerUpperBound.length === 0 ? true : indexBounds.upperBoundInclusive,\n        };\n        return new FlatMapStream(this.#stream.narrow(outerIndexBounds), async (t) => {\n            const innerStream = await this.#mapper(t);\n            return innerStream.narrow(innerIndexBounds);\n        }, this.#mappedIndexFields);\n    }\n}\nexport class SingletonStream extends QueryStream {\n    #value;\n    #order;\n    #indexFields;\n    #indexKey;\n    #equalityIndexFilter;\n    #bandwidth;\n    constructor(value, order = \"asc\", indexFields, indexKey, equalityIndexFilter, bandwidth = 0) {\n        super();\n        this.#value = value;\n        this.#order = order;\n        this.#indexFields = indexFields;\n        this.#indexKey = indexKey;\n        this.#equalityIndexFilter = equalityIndexFilter;\n        this.#bandwidth = bandwidth;\n        if (indexKey.length !== indexFields.length) {\n            throw new Error(`indexKey must have the same length as indexFields: ${JSON.stringify(indexKey)} vs ${JSON.stringify(indexFields)}`);\n        }\n    }\n    iterWithKeys(_trackBandwidth = false) {\n        const value = this.#value;\n        const indexKey = this.#indexKey;\n        const bandwidth = this.#bandwidth;\n        return {\n            [Symbol.asyncIterator]() {\n                let sent = false;\n                return {\n                    async next() {\n                        if (sent) {\n                            return { done: true, value: undefined };\n                        }\n                        sent = true;\n                        return {\n                            done: false,\n                            value: [value, indexKey, bandwidth],\n                        };\n                    },\n                };\n            },\n        };\n    }\n    getOrder() {\n        return this.#order;\n    }\n    getIndexFields() {\n        return this.#indexFields;\n    }\n    getEqualityIndexFilter() {\n        return this.#equalityIndexFilter;\n    }\n    narrow(indexBounds) {\n        const compareLowerBound = compareKeys({\n            value: indexBounds.lowerBound,\n            kind: indexBounds.lowerBoundInclusive ? \"exact\" : \"successor\",\n        }, {\n            value: this.#indexKey,\n            kind: \"exact\",\n        });\n        const compareUpperBound = compareKeys({\n            value: this.#indexKey,\n            kind: \"exact\",\n        }, {\n            value: indexBounds.upperBound,\n            kind: indexBounds.upperBoundInclusive ? \"exact\" : \"predecessor\",\n        });\n        // If lowerBound <= this.indexKey <= upperBound, return this.value\n        if (compareLowerBound <= 0 && compareUpperBound <= 0) {\n            return new SingletonStream(this.#value, this.#order, this.#indexFields, this.#indexKey, this.#equalityIndexFilter);\n        }\n        return new EmptyStream(this.#order, this.#indexFields);\n    }\n}\n/**\n * This is a completely empty stream that yields no values, and in particular\n * does not count towards maximumRowsRead.\n * Compare to SingletonStream(null, ...), which yields no values but does count\n * towards maximumRowsRead.\n */\nexport class EmptyStream extends QueryStream {\n    #order;\n    #indexFields;\n    constructor(order, indexFields) {\n        super();\n        this.#order = order;\n        this.#indexFields = indexFields;\n    }\n    iterWithKeys(_trackBandwidth = false) {\n        return {\n            [Symbol.asyncIterator]() {\n                return {\n                    async next() {\n                        return { done: true, value: undefined };\n                    },\n                };\n            },\n        };\n    }\n    getOrder() {\n        return this.#order;\n    }\n    getIndexFields() {\n        return this.#indexFields;\n    }\n    getEqualityIndexFilter() {\n        return [];\n    }\n    narrow(_indexBounds) {\n        return this;\n    }\n}\nfunction normalizeIndexFields(indexFields) {\n    // Append _creationTime and _id to the index fields if they're not already there\n    if (!indexFields.includes(\"_creationTime\")) {\n        // With one exception: if indexFields is [\"_id\"], we don't need to add _creationTime\n        if (indexFields.length !== 1 || indexFields[0] !== \"_id\") {\n            indexFields.push(\"_creationTime\");\n        }\n    }\n    if (!indexFields.includes(\"_id\")) {\n        indexFields.push(\"_id\");\n    }\n}\n// Given a stream ordered by `indexFields`, where the first `equalityIndexLength`\n// fields are bounded by equality filters, return a generator of the possible\n// index fields used for ordering.\nfunction* getOrderingIndexFields(stream) {\n    const streamEqualityIndexLength = stream.getEqualityIndexFilter().length;\n    const streamIndexFields = stream.getIndexFields();\n    for (let i = 0; i <= streamEqualityIndexLength; i++) {\n        yield streamIndexFields.slice(i);\n    }\n}\nclass OrderByStream extends QueryStream {\n    #staticFilter;\n    #stream;\n    #indexFields;\n    constructor(stream, indexFields) {\n        super();\n        this.#stream = stream;\n        this.#indexFields = indexFields;\n        normalizeIndexFields(this.#indexFields);\n        // indexFields must be a suffix of the stream's index fields, and include\n        // all of the non-equality index fields.\n        const streamIndexFields = stream.getIndexFields();\n        const orderingIndexFields = Array.from(getOrderingIndexFields(stream));\n        if (!orderingIndexFields.some((orderingIndexFields) => equalIndexFields(orderingIndexFields, indexFields))) {\n            throw new Error(`indexFields must be some sequence of fields the stream is ordered by: ${JSON.stringify(indexFields)}, ${JSON.stringify(streamIndexFields)} (${stream.getEqualityIndexFilter().length} equality fields)`);\n        }\n        this.#staticFilter = stream\n            .getEqualityIndexFilter()\n            .slice(0, streamIndexFields.length - indexFields.length);\n    }\n    getOrder() {\n        return this.#stream.getOrder();\n    }\n    getEqualityIndexFilter() {\n        return this.#stream\n            .getEqualityIndexFilter()\n            .slice(this.#staticFilter.length);\n    }\n    getIndexFields() {\n        return this.#indexFields;\n    }\n    iterWithKeys(trackBandwidth = false) {\n        const iterable = this.#stream.iterWithKeys(trackBandwidth);\n        const staticFilter = this.#staticFilter;\n        return {\n            [Symbol.asyncIterator]() {\n                const iterator = iterable[Symbol.asyncIterator]();\n                return {\n                    async next() {\n                        const result = await iterator.next();\n                        if (result.done) {\n                            return result;\n                        }\n                        const [doc, indexKey, bandwidth] = result.value;\n                        return {\n                            done: false,\n                            value: [doc, indexKey.slice(staticFilter.length), bandwidth],\n                        };\n                    },\n                };\n            },\n        };\n    }\n    narrow(indexBounds) {\n        return new OrderByStream(this.#stream.narrow({\n            lowerBound: [...this.#staticFilter, ...indexBounds.lowerBound],\n            lowerBoundInclusive: indexBounds.lowerBoundInclusive,\n            upperBound: [...this.#staticFilter, ...indexBounds.upperBound],\n            upperBoundInclusive: indexBounds.upperBoundInclusive,\n        }), this.#indexFields);\n    }\n}\nclass DistinctStream extends QueryStream {\n    #distinctIndexFieldsLength;\n    #stream;\n    #distinctIndexFields;\n    constructor(stream, distinctIndexFields) {\n        super();\n        this.#stream = stream;\n        this.#distinctIndexFields = distinctIndexFields;\n        // distinctIndexFields must be a prefix of the stream's ordering index fields\n        let distinctIndexFieldsLength = undefined;\n        for (const orderingIndexFields of getOrderingIndexFields(stream)) {\n            const prefix = orderingIndexFields.slice(0, distinctIndexFields.length);\n            if (equalIndexFields(prefix, distinctIndexFields)) {\n                const equalityLength = stream.getIndexFields().length - orderingIndexFields.length;\n                distinctIndexFieldsLength = equalityLength + distinctIndexFields.length;\n                break;\n            }\n        }\n        if (distinctIndexFieldsLength === undefined) {\n            throw new Error(`distinctIndexFields must be a prefix of the stream's ordering index fields: ${JSON.stringify(distinctIndexFields)}, ${JSON.stringify(stream.getIndexFields())} (${stream.getEqualityIndexFilter().length} equality fields)`);\n        }\n        this.#distinctIndexFieldsLength = distinctIndexFieldsLength;\n    }\n    iterWithKeys(trackBandwidth = false) {\n        const stream = this.#stream;\n        const distinctIndexFieldsLength = this.#distinctIndexFieldsLength;\n        return {\n            [Symbol.asyncIterator]() {\n                let currentStream = stream;\n                let currentIterator = currentStream\n                    .iterWithKeys(trackBandwidth)[Symbol.asyncIterator]();\n                return {\n                    async next() {\n                        const result = await currentIterator.next();\n                        if (result.done) {\n                            return { done: true, value: undefined };\n                        }\n                        const [doc, indexKey, bandwidth] = result.value;\n                        if (doc === null) {\n                            // If the original stream has a post-filter `.filterWith`, we will\n                            // iterate over filtered items -- possibly many with the same set of\n                            // distinct index fields -- before finding the first item for the set\n                            // of distinct index fields.\n                            // So it's recommended to put `.filterWith` after `.distinct`.\n                            return {\n                                done: false,\n                                value: [null, indexKey, bandwidth],\n                            };\n                        }\n                        const distinctIndexKey = indexKey.slice(0, distinctIndexFieldsLength);\n                        if (stream.getOrder() === \"asc\") {\n                            currentStream = currentStream.narrow({\n                                lowerBound: distinctIndexKey,\n                                lowerBoundInclusive: false,\n                                upperBound: [],\n                                upperBoundInclusive: true,\n                            });\n                        }\n                        else {\n                            currentStream = currentStream.narrow({\n                                lowerBound: [],\n                                lowerBoundInclusive: true,\n                                upperBound: distinctIndexKey,\n                                upperBoundInclusive: false,\n                            });\n                        }\n                        currentIterator = currentStream\n                            .iterWithKeys(trackBandwidth)[Symbol.asyncIterator]();\n                        return result;\n                    },\n                };\n            },\n        };\n    }\n    narrow(indexBounds) {\n        const indexBoundsPrefix = {\n            ...indexBounds,\n            lowerBound: indexBounds.lowerBound.slice(0, this.#distinctIndexFieldsLength),\n            upperBound: indexBounds.upperBound.slice(0, this.#distinctIndexFieldsLength),\n        };\n        return new DistinctStream(this.#stream.narrow(indexBoundsPrefix), this.#distinctIndexFields);\n    }\n    getOrder() {\n        return this.#stream.getOrder();\n    }\n    getIndexFields() {\n        return this.#stream.getIndexFields();\n    }\n    getEqualityIndexFilter() {\n        return this.#stream.getEqualityIndexFilter();\n    }\n}\nfunction equalIndexFields(indexFields1, indexFields2) {\n    if (indexFields1.length !== indexFields2.length) {\n        return false;\n    }\n    for (let i = 0; i < indexFields1.length; i++) {\n        if (indexFields1[i] !== indexFields2[i]) {\n            return false;\n        }\n    }\n    return true;\n}\nfunction getValueAtIndex(v, index) {\n    if (index >= v.length) {\n        return undefined;\n    }\n    return { kind: \"found\", value: v[index] };\n}\nfunction compareDanglingSuffix(shorterKeyKind, longerKeyKind, shorterKey, longerKey) {\n    if (shorterKeyKind === \"exact\" && longerKeyKind === \"exact\") {\n        throw new Error(`Exact keys are not the same length:  ${JSON.stringify(shorterKey.value)}, ${JSON.stringify(longerKey.value)}`);\n    }\n    if (shorterKeyKind === \"exact\") {\n        throw new Error(`Exact key is shorter than prefix: ${JSON.stringify(shorterKey.value)}, ${JSON.stringify(longerKey.value)}`);\n    }\n    if (shorterKeyKind === \"predecessor\" && longerKeyKind === \"successor\") {\n        // successor is longer than predecessor, so it is bigger\n        return -1;\n    }\n    if (shorterKeyKind === \"successor\" && longerKeyKind === \"predecessor\") {\n        // successor is shorter than predecessor, so it is larger\n        return 1;\n    }\n    if (shorterKeyKind === \"predecessor\" && longerKeyKind === \"predecessor\") {\n        // predecessor of [2, 3] contains [2, 1] while predecessor of [2] doesn't, so longer predecessors are larger\n        return -1;\n    }\n    if (shorterKeyKind === \"successor\" && longerKeyKind === \"successor\") {\n        // successor of [2, 3] contains [2, 4] while successor of [2] doesn't, so longer successors are smaller\n        return 1;\n    }\n    if (shorterKeyKind === \"predecessor\" && longerKeyKind === \"exact\") {\n        return -1;\n    }\n    if (shorterKeyKind === \"successor\" && longerKeyKind === \"exact\") {\n        return 1;\n    }\n    throw new Error(`Unexpected key kinds: ${shorterKeyKind}, ${longerKeyKind}`);\n}\nfunction compareKeys(key1, key2) {\n    let i = 0;\n    while (i < Math.max(key1.value.length, key2.value.length)) {\n        const v1 = getValueAtIndex(key1.value, i);\n        const v2 = getValueAtIndex(key2.value, i);\n        if (v1 === undefined) {\n            return compareDanglingSuffix(key1.kind, key2.kind, key1, key2);\n        }\n        if (v2 === undefined) {\n            return -1 * compareDanglingSuffix(key2.kind, key1.kind, key2, key1);\n        }\n        const result = compareValues(v1.value, v2.value);\n        if (result !== 0) {\n            return result;\n        }\n        // if the prefixes are the same so far, keep going with the comparison\n        i++;\n    }\n    if (key1.kind === key2.kind) {\n        return 0;\n    }\n    // keys are the same length and values\n    if (key1.kind === \"exact\") {\n        if (key2.kind === \"successor\") {\n            return -1;\n        }\n        else {\n            return 1;\n        }\n    }\n    if (key1.kind === \"predecessor\") {\n        return -1;\n    }\n    if (key1.kind === \"successor\") {\n        return 1;\n    }\n    // Note: we're being cautious here, but we aren't checking above that the type\n    // of key2.kind is valid...\n    throw new Error(`Unexpected key kind: ${key1.kind}`);\n}\nfunction serializeCursor(key) {\n    return JSON.stringify(convexToJson(key.map((v) => v === undefined\n        ? \"undefined\"\n        : typeof v === \"string\" && v.endsWith(\"undefined\")\n            ? // in the unlikely case their string was \"undefined\"\n                // or \"_undefined\" etc, we escape it.\n                \"_\" + v\n            : v)));\n}\nfunction deserializeCursor(cursor) {\n    return jsonToConvex(JSON.parse(cursor)).map((v) => {\n        if (typeof v === \"string\") {\n            if (v === \"undefined\") {\n                // This is a special case for the undefined value.\n                // It's not a valid value in the index, but it's a valid value in the\n                // cursor.\n                return undefined;\n            }\n            if (v.endsWith(\"undefined\")) {\n                // in the unlikely case their string was \"undefined\" it was changed to\n                // \"_undefined\" in the serialization process.\n                // NB: if their string was \"_undefined\" it was changed to\n                // \"__undefined\" in the serialization process, and so on.\n                return v.slice(1);\n            }\n        }\n        return v;\n    });\n}\n","/* eslint-disable jsdoc/require-jsdoc */\nimport type { BetterAuthDBSchema } from \"better-auth/db\";\nimport type {\n  DocumentByName,\n  GenericDataModel,\n  GenericQueryCtx,\n  PaginationOptions,\n  PaginationResult,\n  SchemaDefinition,\n  TableNamesInDataModel,\n} from \"convex/server\";\nimport type { GenericId } from \"convex/values\";\n\nimport { asyncMap } from \"convex-helpers\";\nimport { mergedStream, stream } from \"convex-helpers/server/stream\";\n\nexport type QueryArgs = {\n  limit?: number;\n  model: string;\n  offset?: number;\n  select?: string[];\n  sortBy?: {\n    direction: \"asc\" | \"desc\";\n    field: string;\n  };\n  where?: WhereClause[];\n};\n\nexport type WhereClause = {\n  connector?: \"AND\" | \"OR\";\n  field: string;\n  operator?:\n    | \"contains\"\n    | \"ends_with\"\n    | \"eq\"\n    | \"gt\"\n    | \"gte\"\n    | \"in\"\n    | \"lt\"\n    | \"lte\"\n    | \"ne\"\n    | \"not_in\"\n    | \"starts_with\";\n  value: boolean | null | number | number[] | string | string[];\n};\n\nexport const isUniqueField = (\n  betterAuthSchema: BetterAuthDBSchema,\n  model: string,\n  field: string,\n): boolean => {\n  const fields = betterAuthSchema[model]?.fields;\n  if (!fields) {\n    return false;\n  }\n  return Object.entries(fields)\n    .filter(([, value]) => value.unique)\n    .map(([key]) => key)\n    .includes(field);\n};\n\nexport const hasUniqueFields = (\n  betterAuthSchema: BetterAuthDBSchema,\n  model: string,\n  input: Record<string, any>,\n): boolean => {\n  for (const field of Object.keys(input)) {\n    if (isUniqueField(betterAuthSchema, model, field)) {\n      return true;\n    }\n  }\n  return false;\n};\n\nexport const findIndex = (\n  schema: SchemaDefinition<any, any>,\n  args: QueryArgs,\n) => {\n  if (\n    (args.where?.length ?? 0) > 1 &&\n    args.where?.some((w) => w.connector === \"OR\")\n  ) {\n    throw new Error(\n      `OR connector not supported with multiple where statements in findIndex, split up the where statements before calling findIndex: ${JSON.stringify(args.where)}`,\n    );\n  }\n  const where = args.where?.filter((w) => {\n    return (\n      (!w.operator ||\n        [\"eq\", \"gt\", \"gte\", \"in\", \"lt\", \"lte\", \"not_in\"].includes(\n          w.operator,\n        )) &&\n      w.field !== \"_id\"\n    );\n  });\n  if (!where?.length && !args.sortBy) {\n    return;\n  }\n  const lowerBounds =\n    where?.filter((w) => w.operator === \"lt\" || w.operator === \"lte\") ?? [];\n  if (lowerBounds.length > 1) {\n    throw new Error(\n      `cannot have more than one lower bound where clause: ${JSON.stringify(where)}`,\n    );\n  }\n  const upperBounds =\n    where?.filter((w) => w.operator === \"gt\" || w.operator === \"gte\") ?? [];\n  if (upperBounds.length > 1) {\n    throw new Error(\n      `cannot have more than one upper bound where clause: ${JSON.stringify(where)}`,\n    );\n  }\n  const lowerBound = lowerBounds[0];\n  const upperBound = upperBounds[0];\n  if (lowerBound && upperBound && lowerBound.field !== upperBound.field) {\n    throw new Error(\n      `lower bound and upper bound must have the same field: ${JSON.stringify(where)}`,\n    );\n  }\n  const boundField = lowerBound?.field ?? upperBound?.field;\n  if (\n    boundField &&\n    where?.some(\n      (w) => w.field === boundField && w !== lowerBound && w !== upperBound,\n    )\n  ) {\n    throw new Error(\n      `too many where clauses on the bound field: ${JSON.stringify(where)}`,\n    );\n  }\n  const indexEqFields =\n    where\n      ?.filter((w) => !w.operator || w.operator === \"eq\")\n      .sort((a, b) => {\n        return a.field.localeCompare(b.field);\n      })\n      .map((w) => [w.field, w.value]) ?? [];\n  if (!indexEqFields?.length && !boundField && !args.sortBy) {\n    return;\n  }\n  const table = schema.tables[args.model as keyof typeof schema.tables];\n  if (!table) {\n    throw new Error(`Table ${args.model} not found`);\n  }\n  const indexes = table[\" indexes\"]();\n  const sortField = args.sortBy?.field;\n\n  // We internally use _creationTime in place of Better Auth's createdAt\n  const indexFields = indexEqFields\n    .map(([field]) => field)\n    .concat(\n      boundField && boundField !== \"createdAt\"\n        ? `${indexEqFields.length ? \"_\" : \"\"}${boundField}`\n        : \"\",\n    )\n    .concat(\n      sortField && sortField !== \"createdAt\" && boundField !== sortField\n        ? `${indexEqFields.length || boundField ? \"_\" : \"\"}${sortField}`\n        : \"\",\n    )\n    .filter(Boolean);\n  if (!indexFields.length && !boundField && !sortField) {\n    return;\n  }\n  // Use the built in _creationTime index if bounding or sorting by createdAt\n  // with no other fields\n  const index = !indexFields.length\n    ? {\n        fields: [],\n        indexDescriptor: \"by_creation_time\",\n      }\n    : indexes.find(({ fields }: { fields: string[] }) => {\n        const fieldsMatch = indexFields.every(\n          (field, idx) => field === fields[idx],\n        );\n        // If sorting by createdAt, no intermediate fields can be on the index\n        // as they may override the createdAt sort order.\n        const boundFieldMatch =\n          boundField === \"createdAt\" || sortField === \"createdAt\"\n            ? indexFields.length === fields.length\n            : true;\n        return fieldsMatch && boundFieldMatch;\n      });\n  if (!index) {\n    return { indexFields };\n  }\n  return {\n    boundField,\n    index: {\n      fields: [...index.fields, \"_creationTime\"],\n      indexDescriptor: index.indexDescriptor,\n    },\n    sortField,\n    values: {\n      eq: indexEqFields.map(([, value]) => value),\n      gt: upperBound?.operator === \"gt\" ? upperBound.value : undefined,\n      gte: upperBound?.operator === \"gte\" ? upperBound.value : undefined,\n      lt: lowerBound?.operator === \"lt\" ? lowerBound.value : undefined,\n      lte: lowerBound?.operator === \"lte\" ? lowerBound.value : undefined,\n    },\n  };\n};\n\nexport const checkUniqueFields = async <\n  Schema extends SchemaDefinition<any, any>,\n>(\n  ctx: GenericQueryCtx<GenericDataModel>,\n  schema: Schema,\n  betterAuthSchema: BetterAuthDBSchema,\n  table: string,\n  input: Record<string, any>,\n  doc?: Record<string, any>,\n) => {\n  if (!hasUniqueFields(betterAuthSchema, table, input)) {\n    return;\n  }\n  for (const field of Object.keys(input)) {\n    if (!isUniqueField(betterAuthSchema, table, field)) {\n      continue;\n    }\n    const { index } =\n      findIndex(schema, {\n        model: table,\n        where: [{ field, operator: \"eq\", value: input[field] }],\n      }) ?? {};\n    if (!index) {\n      throw new Error(`No index found for ${table}.${field}`);\n    }\n    const existingDoc = await ctx.db\n      .query(table as any)\n      .withIndex(index.indexDescriptor, (q) => q.eq(field, input[field]))\n      .unique();\n    if (existingDoc && existingDoc._id !== doc?._id) {\n      throw new Error(`${table} ${field} already exists`);\n    }\n  }\n};\n\nexport const selectFields = <\n  T extends TableNamesInDataModel<GenericDataModel>,\n  D extends DocumentByName<GenericDataModel, T>,\n>(\n  doc: D | null,\n  select?: string[],\n): D | null => {\n  if (!doc) {\n    return null;\n  }\n  if (!select?.length) {\n    return doc;\n  }\n  return select.reduce((acc, field) => {\n    (acc as any)[field] = doc[field];\n    return acc;\n  }, {} as D);\n};\n\nexport const filterByWhere = <\n  T extends TableNamesInDataModel<GenericDataModel>,\n  D extends DocumentByName<GenericDataModel, T>,\n>(\n  doc: D | null,\n  where?: WhereClause[],\n  // Optionally filter which where clauses to apply.\n  filterWhere?: (w: WhereClause) => any,\n): boolean => {\n  if (!doc) {\n    return false;\n  }\n  for (const w of where ?? []) {\n    if (filterWhere && !filterWhere(w)) {\n      continue;\n    }\n    const value = doc[w.field as keyof typeof doc] as WhereClause[\"value\"];\n    const isLessThan = (val: typeof value, wVal: typeof w.value) => {\n      if (!wVal) {\n        return false;\n      }\n      if (!val) {\n        return true;\n      }\n      return val < wVal;\n    };\n    const isGreaterThan = (val: typeof value, wVal: typeof w.value) => {\n      if (!val) {\n        return false;\n      }\n      if (!wVal) {\n        return true;\n      }\n      return val > wVal;\n    };\n    const filter = (w: WhereClause) => {\n      switch (w.operator) {\n        case \"contains\": {\n          return typeof value === \"string\" && value.includes(w.value as string);\n        }\n        case \"ends_with\": {\n          return typeof value === \"string\" && value.endsWith(w.value as string);\n        }\n        case \"eq\":\n        case undefined: {\n          return value === w.value;\n        }\n        case \"gt\": {\n          return isGreaterThan(value, w.value);\n        }\n        case \"gte\": {\n          return value === w.value || isGreaterThan(value, w.value);\n        }\n        case \"in\": {\n          return Array.isArray(w.value) && (w.value as any[]).includes(value);\n        }\n        case \"lt\": {\n          return isLessThan(value, w.value);\n        }\n        case \"lte\": {\n          return value === w.value || isLessThan(value, w.value);\n        }\n        case \"ne\": {\n          return value !== w.value;\n        }\n        case \"not_in\": {\n          return Array.isArray(w.value) && !(w.value as any[]).includes(value);\n        }\n        case \"starts_with\": {\n          return (\n            typeof value === \"string\" && value.startsWith(w.value as string)\n          );\n        }\n      }\n    };\n    if (!filter(w)) {\n      return false;\n    }\n  }\n  return true;\n};\n\nconst generateQuery = (\n  ctx: GenericQueryCtx<GenericDataModel>,\n  schema: SchemaDefinition<any, any>,\n  args: QueryArgs,\n) => {\n  const { boundField, index, indexFields, values } =\n    findIndex(schema, args) ?? {};\n  const query = stream(ctx.db as any, schema).query(args.model as any);\n  const hasValues =\n    values?.eq?.length ??\n    values?.lt ??\n    values?.lte ??\n    values?.gt ??\n    values?.gte;\n  const indexedQuery =\n    index && index.indexDescriptor !== \"by_creation_time\"\n      ? query.withIndex(\n          index.indexDescriptor,\n          hasValues\n            ? (q: any) => {\n                for (const [idx, value] of (values?.eq ?? []).entries()) {\n                  q = q.eq(index.fields[idx], value);\n                }\n                if (values?.lt) {\n                  q = q.lt(boundField, values.lt);\n                }\n                if (values?.lte) {\n                  q = q.lte(boundField, values.lte);\n                }\n                if (values?.gt) {\n                  q = q.gt(boundField, values.gt);\n                }\n                if (values?.gte) {\n                  q = q.gte(boundField, values.gte);\n                }\n                return q;\n              }\n            : undefined,\n        )\n      : query;\n  const orderedQuery = args.sortBy\n    ? indexedQuery.order(args.sortBy.direction === \"desc\" ? \"desc\" : \"asc\")\n    : indexedQuery;\n  const filteredQuery = orderedQuery.filterWith(async (doc) => {\n    if (!index && indexFields?.length) {\n      console.warn(\n        `Querying without an index on table \"${args.model}\".\\n` +\n          `This can cause performance issues, and may hit the document read limit.\\n` +\n          `To fix, add an index that begins with the following fields in order:\\n` +\n          `[${indexFields.join(\", \")}]`,\n      );\n      // No index, handle all where clauses statically.\n      return filterByWhere(doc, args.where);\n    }\n    return filterByWhere(\n      doc,\n      args.where,\n      // Index used for all eq and range clauses, apply remaining clauses\n      // incompatible with Convex statically.\n      (w) =>\n        w.operator &&\n        [\"contains\", \"ends_with\", \"ne\", \"not_in\", \"starts_with\"].includes(\n          w.operator,\n        ),\n    );\n  });\n  return filteredQuery;\n};\n\nexport const paginate = async <\n  Doc extends DocumentByName<GenericDataModel, T>,\n  T extends TableNamesInDataModel<GenericDataModel>,\n>(\n  ctx: GenericQueryCtx<GenericDataModel>,\n  schema: SchemaDefinition<any, any>,\n  betterAuthSchema: BetterAuthDBSchema,\n  args: QueryArgs & {\n    paginationOpts: PaginationOptions;\n  },\n): Promise<PaginationResult<Doc>> => {\n  if (args.offset) {\n    throw new Error(`offset not supported: ${JSON.stringify(args.offset)}`);\n  }\n  if (args.where?.some((w) => w.connector === \"OR\") && args.where?.length > 1) {\n    throw new Error(\n      `OR connector not supported with multiple where statements in paginate, split up the where statements before calling paginate: ${JSON.stringify(args.where)}`,\n    );\n  }\n  if (\n    args.where?.some(\n      (w) =>\n        w.field === \"_id\" &&\n        w.operator &&\n        ![\"eq\", \"in\", \"not_in\"].includes(w.operator),\n    )\n  ) {\n    throw new Error(\n      `_id can only be used with eq, in, or not_in operator: ${JSON.stringify(args.where)}`,\n    );\n  }\n  // If any where clause is \"eq\" (or missing operator) on a unique field,\n  // we can only return a single document, so we get it and use any other\n  // where clauses as static filters.\n  const uniqueWhere = args.where?.find(\n    (w) =>\n      (!w.operator || w.operator === \"eq\") &&\n      (isUniqueField(betterAuthSchema, args.model, w.field) ||\n        w.field === \"_id\"),\n  );\n  if (uniqueWhere) {\n    const { index } =\n      findIndex(schema, {\n        model: args.model,\n        where: [uniqueWhere],\n      }) ?? {};\n\n    let doc;\n    if (uniqueWhere.field === \"_id\") {\n      doc = await ctx.db.get(uniqueWhere.value as GenericId<T>);\n    } else if (index?.indexDescriptor) {\n      doc = await ctx.db\n        .query(args.model as any)\n        .withIndex(index.indexDescriptor, (q) =>\n          q.eq(index.fields[0], uniqueWhere.value),\n        )\n        .unique();\n    } else {\n      // No index found - fall back to collect() for unique field lookup\n      const results = await ctx.db.query(args.model as any).collect();\n      doc =\n        results.find((d: any) => d[uniqueWhere.field] === uniqueWhere.value) ??\n        null;\n    }\n\n    // Apply all other clauses as static filters to our 0 or 1 result.\n    if (filterByWhere(doc, args.where, (w) => w !== uniqueWhere)) {\n      return {\n        continueCursor: \"\",\n        isDone: true,\n        page: [selectFields(doc, args.select)].filter(Boolean) as Doc[],\n      };\n    }\n    return {\n      continueCursor: \"\",\n      isDone: true,\n      page: [],\n    };\n  }\n\n  const paginationOpts = {\n    ...args.paginationOpts,\n    // If maximumRowsRead is not at least 1 higher than numItems, bad cursors\n    // and incorrect paging will result (at least with convex-test).\n    maximumRowsRead: Math.max((args.paginationOpts.numItems ?? 0) + 1, 200),\n  };\n\n  // Large queries using \"in\" clause will crash, but these are only currently\n  // possible with the organization plugin listing all members with a high\n  // limit. For cases like this we need to create proper convex queries in\n  // the component as an alternative to using Better Auth api's.\n  const inWhere = args.where?.find((w) => w.operator === \"in\");\n  if (inWhere) {\n    if (!Array.isArray(inWhere.value)) {\n      throw new Error(\"in clause value must be an array\");\n    }\n    // For ids, just use asyncMap + .get()\n    if (inWhere.field === \"_id\") {\n      const docs = await asyncMap(inWhere.value as any[], async (value) => {\n        return ctx.db.get(value as GenericId<T>);\n      });\n      const filteredDocs = docs\n        .flatMap((doc) => (doc ? [doc] : []))\n        .filter((doc) => filterByWhere(doc, args.where, (w) => w !== inWhere));\n\n      return {\n        continueCursor: \"\",\n        isDone: true,\n        page: filteredDocs.sort((a, b) => {\n          if (args.sortBy?.field === \"createdAt\") {\n            return args.sortBy.direction === \"asc\"\n              ? (a._creationTime as number) - (b._creationTime as number)\n              : (b._creationTime as number) - (a._creationTime as number);\n          }\n          if (args.sortBy) {\n            const aValue = a[args.sortBy.field];\n            const bValue = b[args.sortBy.field];\n            if (aValue === bValue) {\n              return 0;\n            }\n            return args.sortBy.direction === \"asc\"\n              ? aValue! > bValue!\n                ? 1\n                : -1\n              : aValue! > bValue!\n                ? -1\n                : 1;\n          }\n          return 0;\n        }) as Doc[],\n      };\n    }\n    const streams = inWhere.value.map((value) => {\n      return generateQuery(ctx, schema, {\n        ...args,\n        where: args.where?.map((w) => {\n          if (w === inWhere) {\n            return { ...w, operator: \"eq\" as const, value };\n          }\n          return w;\n        }),\n      });\n    });\n    const result = await mergedStream(\n      streams,\n      [\n        args.sortBy?.field !== \"createdAt\" && args.sortBy?.field,\n        \"_creationTime\",\n      ].flatMap((f) => (f ? [f] : [])),\n    ).paginate(paginationOpts);\n    return {\n      ...result,\n      page: await asyncMap(result.page, (doc) =>\n        selectFields(doc, args.select),\n      ),\n    };\n  }\n\n  const query = generateQuery(ctx, schema, args);\n  const result = await query.paginate(paginationOpts);\n  return {\n    ...result,\n    page: await asyncMap(result.page, (doc) => selectFields(doc, args.select)),\n  };\n};\n\nexport const listOne = async <\n  Doc extends DocumentByName<GenericDataModel, T>,\n  T extends TableNamesInDataModel<GenericDataModel>,\n>(\n  ctx: GenericQueryCtx<GenericDataModel>,\n  schema: SchemaDefinition<any, any>,\n  betterAuthSchema: BetterAuthDBSchema,\n  args: QueryArgs,\n): Promise<Doc | null> => {\n  return (\n    await paginate(ctx, schema, betterAuthSchema, {\n      ...args,\n      paginationOpts: {\n        cursor: null,\n        numItems: 1,\n      },\n    })\n  ).page[0] as Doc | null;\n};\n","import type { GenericDataModel, GenericMutationCtx, GenericQueryCtx } from \"convex/server\";\nimport type { GenericId } from \"convex/values\";\nimport type { CollectionSlug, VexApiAuth } from \"@vexcms/core\";\n\n/**\n * Builds the `getAuth` resolver for `collectionsApi` from better-auth's\n * conventions — no per-app auth plumbing.\n *\n * Resolution chain, all from the validated JWT the `convex()` better-auth\n * plugin mints: `identity.subject` (user doc id) → user document;\n * `identity.sessionId` (appended to every token by the plugin) → session\n * document → `session.activeOrganizationId` → organization document.\n * Documents are read fresh on every request, so role changes and\n * org switches apply immediately — claims are only used as ids, never\n * as authorization data.\n *\n * `orgCollectionSlug` is only required when `resolveOrgs` is true — a\n * project with organizations disabled can omit it entirely. Passing\n * `resolveOrgs: true` without an `orgCollectionSlug` skips org resolution\n * (same as `resolveOrgs: false`) rather than throwing, since the omission\n * is a config mistake, not a request-time error worth failing loudly for.\n *\n * @returns { user, organization }, @see {@link VexApiAuth}\n *\n */\nexport function createGetAuth<TCollectionSlug extends CollectionSlug = CollectionSlug>(props: {\n  userCollectionSlug: TCollectionSlug;\n  orgCollectionSlug?: TCollectionSlug;\n  sessionCollectionSlug: TCollectionSlug;\n  resolveOrgs?: boolean;\n}) {\n  return async <DataModel extends GenericDataModel>(\n    ctx: GenericQueryCtx<DataModel> | GenericMutationCtx<DataModel>,\n  ): Promise<VexApiAuth> => {\n    const identity = await ctx.auth.getUserIdentity();\n    if (identity === null) {\n      return { user: null }; // unauthenticated → downstream deny (no roles)\n    }\n\n    const user = await ctx.db.get(\n      props.userCollectionSlug,\n      identity.subject as GenericId<TCollectionSlug>,\n    );\n    if (user === null) {\n      return { user }; // token for a deleted user → deny\n    }\n\n    if (!props.resolveOrgs || !props.orgCollectionSlug) {\n      return { user };\n    }\n    const orgCollectionSlug = props.orgCollectionSlug;\n    const sessionId = identity.sessionId as GenericId<TCollectionSlug> | undefined;\n    const session = sessionId ? await ctx.db.get(props.sessionCollectionSlug, sessionId) : null;\n    const orgId = session?.activeOrganizationId as GenericId<TCollectionSlug> | undefined;\n    const organization = orgId\n      ? ((await ctx.db.get(orgCollectionSlug, orgId)) ?? undefined)\n      : undefined;\n\n    return { user, organization };\n  };\n}\n","import type {\n  GenericActionCtx,\n  GenericDataModel,\n  GenericMutationCtx,\n  GenericQueryCtx,\n  MutationBuilder,\n  QueryBuilder,\n  SchemaDefinition,\n} from \"convex/server\";\nimport { convexAdapter } from \"./adapter\";\nimport * as DB from \"./db\";\n\n/**\n * Arguments for authDbApi — same pattern as queryApi/mutationApi in @vexcms/core.\n *\n * The user imports their Convex schema from `convex/schema.ts` and passes it here.\n */\nexport type AuthDbApiOptions<DataModel extends GenericDataModel> = {\n  /** The user's Convex schema (from `convex/schema.ts`). */\n  schema: SchemaDefinition<any, any>;\n  /** The user's `internalMutation` from `convex/_generated/server`. */\n  internalMutation: MutationBuilder<DataModel, \"internal\">;\n  /** The user's `internalQuery` from `convex/_generated/server`. */\n  internalQuery: QueryBuilder<DataModel, \"internal\">;\n};\n\n/**\n * Creates the auth DB operations as proper Convex functions.\n *\n * Use this in www/convex/auth/db.ts to export the db operations:\n * ```ts\n * import { authDbApi } from \"@vexcms/better-auth/convex\"\n * import { internalMutation, internalQuery } from \"../../_generated/server\"\n * import schema from \"../schema\"\n *\n * export const { dbCreate, dbFindOne, dbFindMany, dbCount, dbUpdate, dbUpdateMany, dbDelete, dbDeleteMany } = authDbApi({\n *   schema,\n *   internalMutation,\n *   internalQuery,\n * })\n * ```\n *\n * This follows the exact same pattern as queryApi/mutationApi in @vexcms/core.\n * The returned functions are proper Convex FunctionReferences available as\n * internal.auth.db.dbCreate, etc. in the user's Convex API.\n * @param options - The user's Convex schema plus their `internalMutation`\n *   and `internalQuery` builders, used to construct the auth DB functions.\n * @returns An object exposing `dbCreate`, `dbFindOne`, `dbFindMany`,\n *   `dbCount`, `dbUpdate`, `dbUpdateMany`, `dbDelete`, and `dbDeleteMany` as\n *   internal Convex function references, ready to re-export from the\n *   user's Convex API.\n */\nexport function authDbApi<DataModel extends GenericDataModel>(\n  options: AuthDbApiOptions<DataModel>,\n) {\n  return {\n    dbCreate: options.internalMutation({\n      ...DB.create,\n      handler: async (ctx, args) =>\n        await DB.create.handler(\n          ctx as unknown as GenericMutationCtx<GenericDataModel>,\n          args,\n          options.schema,\n        ),\n    }),\n\n    dbFindOne: options.internalQuery({\n      ...DB.findOne,\n      handler: async (ctx, args) =>\n        await DB.findOne.handler(\n          ctx as unknown as GenericQueryCtx<GenericDataModel>,\n          args,\n          options.schema,\n        ),\n    }),\n\n    dbFindMany: options.internalQuery({\n      ...DB.findMany,\n      handler: async (ctx, args) =>\n        await DB.findMany.handler(\n          ctx as unknown as GenericQueryCtx<GenericDataModel>,\n          args,\n          options.schema,\n        ),\n    }),\n\n    dbCount: options.internalQuery({\n      ...DB.count,\n      handler: async (ctx, args) =>\n        await DB.count.handler(\n          ctx as unknown as GenericQueryCtx<GenericDataModel>,\n          args,\n          options.schema,\n        ),\n    }),\n\n    dbUpdate: options.internalMutation({\n      ...DB.update,\n      handler: async (ctx, args) =>\n        await DB.update.handler(\n          ctx as unknown as GenericMutationCtx<GenericDataModel>,\n          args,\n          options.schema,\n        ),\n    }),\n\n    dbUpdateMany: options.internalMutation({\n      ...DB.updateMany,\n      handler: async (ctx, args) =>\n        await DB.updateMany.handler(\n          ctx as unknown as GenericMutationCtx<GenericDataModel>,\n          args,\n          options.schema,\n        ),\n    }),\n\n    dbDelete: options.internalMutation({\n      ...DB.deleteOne,\n      handler: async (ctx, args) =>\n        await DB.deleteOne.handler(\n          ctx as unknown as GenericMutationCtx<GenericDataModel>,\n          args,\n          options.schema,\n        ),\n    }),\n\n    dbDeleteMany: options.internalMutation({\n      ...DB.deleteMany,\n      handler: async (ctx, args) =>\n        await DB.deleteMany.handler(\n          ctx as unknown as GenericMutationCtx<GenericDataModel>,\n          args,\n          options.schema,\n        ),\n    }),\n  };\n}\n\n/**\n * Creates the Better Auth Convex adapter.\n *\n * Use this in www/convex/auth/index.ts inside createAuth:\n * ```ts\n * import { createBetterAuthAdapter } from \"@vexcms/better-auth/convex\"\n * import { dbCreate, dbFindOne, ... } from \"./db\"\n *\n * export const createAuth = (ctx) => {\n *   return betterAuth({\n *     database: createBetterAuthAdapter(ctx, { dbCreate, dbFindOne, ... }),\n *     ...authOptions,\n *   })\n * }\n * ```\n *\n * The adapter uses anyApi to reference the db operations (anyApi.auth.db.dbCreate etc.)\n * and calls them via ctx.runMutation/ctx.runQuery.\n * @param ctx ActionCtx from better-auth convex library\n * @returns AdapterFactory\n */\nexport function createBetterAuthAdapter<DataModel extends GenericDataModel>(\n  ctx: GenericActionCtx<DataModel>,\n) {\n  return convexAdapter(ctx);\n}\n\nexport { convexAdapter } from \"./adapter\";\nexport * from \"./types\";\nexport * from \"./getAuth\";\n"],"mappings":";AAQA;AAAA,EACE;AAAA,EAEA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,OACK;AAEP,SAAS,qBAAqB;AAc9B,IAAM,wBAAwB;AAAA,EAC5B,MAAM;AAAA,EACN,SAAS;AAAA,EACT,SAAS;AAAA,EACT,cAAc;AAChB;AAGA,IAAM,kBAAkB,oBAAI,IAAI;AAAA,EAC9B;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAGD,IAAM,gBAAgB,oBAAI,IAAI;AAAA,EAC5B;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAmCM,SAAS,kBACd,OACgB;AAChB,QAAM,SAAS,cAAc,OAAO,UAAU,CAAC,CAAC;AAChD,QAAM,cAAsC,CAAC;AAC7C,QAAM,kBAAkB;AAAA,IACtB,EAAE,MAAM,sBAAsB,MAAM,MAAM,OAAO,QAAQ,MAAM,UAAU;AAAA,IACzE;AAAA,MACE,MAAM,sBAAsB;AAAA,MAC5B,MAAM,OAAO,QAAQ,SAAS;AAAA,IAChC;AAAA,IACA;AAAA,MACE,MAAM,sBAAsB;AAAA,MAC5B,MAAM,OAAO,QAAQ,SAAS;AAAA,IAChC;AAAA,IACA;AAAA,MACE,MAAM,sBAAsB;AAAA,MAC5B,MAAM,OAAO,QAAQ,cAAc;AAAA,IACrC;AAAA,EACF;AAEA,aAAW,CAAC,UAAU,QAAQ,KAAK,OAAO,QAAQ,MAAM,GAAG;AACzD,UAAM,OAAO,SAAS,aAAa;AACnC,UAAM,SAAyC,CAAC;AAEhD,4BAAwB;AAAA,MACtB,YAAY,SAAS;AAAA,MACrB;AAAA,MACA;AAAA,MACA,QAAQ,OAAO;AAAA,MACf,WAAW;AAAA,IACb,CAAC;AAED,UAAM,qBAAqB,gBAAgB;AAAA,MACzC,CAAC,OAAO,GAAG,SAAS;AAAA,IACtB,GAAG;AACH,QAAI,oBAAoB;AACtB,cAAQ,oBAAoB;AAAA,QAC1B,KAAK,QAAQ;AACX,gBAAM,mBAAmB,OAAO,QAAQ,MAAM;AAC9C,kCAAwB;AAAA,YACtB,YAAY;AAAA,YACZ;AAAA,YACA;AAAA,YACA,QAAQ,OAAO;AAAA,UACjB,CAAC;AACD;AAAA,QACF;AAAA,QACA,KAAK,WAAW;AACd,gBAAM,mBAAmB,OAAO,QAAQ,SAAS;AACjD,kCAAwB;AAAA,YACtB,YAAY;AAAA,YACZ;AAAA,YACA;AAAA,YACA,QAAQ,OAAO;AAAA,UACjB,CAAC;AACD;AAAA,QACF;AAAA,QACA,KAAK,WAAW;AACd,gBAAM,mBAAmB,OAAO,QAAQ,SAAS;AACjD,kCAAwB;AAAA,YACtB,YAAY;AAAA,YACZ;AAAA,YACA;AAAA,YACA,QAAQ,OAAO;AAAA,UACjB,CAAC;AACD;AAAA,QACF;AAAA,QACA,KAAK,gBAAgB;AACnB,gBAAM,mBACJ,OAAO,QAAQ,cAAc;AAC/B,kCAAwB;AAAA,YACtB,YAAY;AAAA,YACZ;AAAA,YACA;AAAA,YACA,QAAQ,OAAO;AAAA,UACjB,CAAC;AACD;AAAA,QACF;AAAA,QACA;AACE;AAAA,MACJ;AAAA,IACF;AAEA,UAAM,cAAc,SAAS,UAAU,SAAS;AAEhD,gBAAY;AAAA,MACV,iBAAoD;AAAA,QAClD;AAAA,QACA;AAAA,QACA,MAAM,cAAc,EAAE,WAAW,KAAK,IAAI;AAAA,MAC5C,CAAC;AAAA,IACH;AAAA,EACF;AAEA,QAAM,WAAW,OAAO,MAAM,aAAa;AAC3C,SAAO;AAAA,IACL,MAAM;AAAA,IACN;AAAA,IACA,gBAAgB;AAAA,EAClB;AACF;AAmBO,SAAS,wBAAwB,OAMrC;AACD,MAAI,CAAC,MAAM,WAAY;AACvB,aAAW,CAAC,WAAW,IAAI,KAAK,OAAO,QAAQ,MAAM,UAAU,GAAG;AAChE,QAAI,MAAM,cAAc,QAAQ,cAAc,KAAM;AACpD,UAAM,QAAQ;AAAA,MACZ;AAAA,MACA;AAAA,MACA,MAAM;AAAA,MACN,OAAO;AAAA,IACT;AACA,QAAI,MAAO,OAAM,OAAO,SAAS,IAAI;AAAA,EACvC;AACF;AAmBA,SAAS,yBACP,WACA,MACA,WACA,aACA;AAEA,MAAI,cAAc,KAAM,QAAO;AAE/B,QAAM,cACJ,cAAc,aAAa,MAAM,aACjC,cAAc,UACd,cAAc;AAChB,QAAM,aAAa,eAAe,gBAAgB,IAAI,SAAS;AAC/D,QAAM,WAAW,cAAc,IAAI,SAAS;AAE5C,QAAM,QAA+B,CAAC;AACtC,MAAI,CAAC,WAAY,OAAM,WAAW;AAClC,MAAI,SAAU,OAAM,SAAS;AAG7B,QAAM,cAAqE;AAAA,IACzE,cAAc;AAAA,EAChB;AACA,MAAI,OAAO,KAAK,KAAK,EAAE,SAAS,EAAG,aAAY,QAAQ;AACvD,MAAI,CAAC,WAAY,aAAY,OAAO,EAAE,QAAQ,KAAK;AACnD,MAAI,KAAK,SAAU,aAAY,WAAW,KAAK;AAC/C,MACE,KAAK,iBAAiB,UACtB,OAAO,KAAK,iBAAiB,YAC7B;AACA,gBAAY,eAAe,KAAK;AAAA,EAClC;AACA,MAAI,KAAK,UAAU,KAAK,OAAO;AAC7B,gBAAY,QAAQ,MAAM,SAAS;AAAA,EACrC;AAEA,MAAI,KAAK,YAAY;AACnB,WAAO,KAAK,WAAW;AAAA,EACzB;AAEA,MAAI,MAAM,QAAQ,KAAK,IAAI,GAAG;AAC5B,WAAO,OAAO;AAAA,MACZ,SAAS,KAAK,KAAK,IAAI,CAACA,QAAe,EAAE,OAAOA,IAAG,OAAOA,GAAE,EAAE;AAAA,MAC9D,GAAG;AAAA,IACL,CAAC;AAAA,EACH;AAEA,UAAQ,KAAK,MAAM;AAAA,IACjB,KAAK;AACH,aAAO,KAAK,WAAW;AAAA,IACzB,KAAK;AACH,aAAO,MAAM;AAAA,QACX,GAAG;AAAA,QACH,OAAO,KAAK,WAAW;AAAA,MACzB,CAAC;AAAA,IACH,KAAK;AACH,aAAO,SAAS,WAAW;AAAA,IAC7B,KAAK;AACH,aAAO,OAAO,WAAW;AAAA,IAC3B,KAAK;AACH,aAAO,MAAM;AAAA,QACX,GAAG;AAAA,QACH,OAAO,OAAO,WAAW;AAAA,MAC3B,CAAC;AAAA,IACH,KAAK;AACH,aAAO,KAAK,WAAW;AAAA,IACzB,KAAK;AAGH,aAAO,KAAK,WAAW;AAAA,IACzB;AAEE,aAAO;AAAA,EACX;AACF;;;ACrUA,SAAS,cAAc;AACvB;AAAA,EACE;AAAA,OAEK;AACP,SAAS,iBAAAC,sBAAqB;AAM9B,IAAM,aAAa,CAAC,UAA0C;AAC5D,SAAQ,OAAO,IAAI,CAACC,WAAU;AAC5B,QAAIA,OAAM,iBAAiB,MAAM;AAC/B,aAAO,EAAE,GAAGA,QAAO,OAAOA,OAAM,MAAM,QAAQ,EAAE;AAAA,IAClD;AACA,WAAOA;AAAA,EACT,CAAC,KAAK,CAAC;AACT;AASO,SAAS,cACd,KACA,SAAkD,CAAC,GACnD;AACA,SAAO,qBAAqB;AAAA,IAC1B,SAAS,CAAC,EAAE,QAAQ,MAAM;AACxB,cAAQ,YAAY,EAAE,SAAS,MAAM;AACrC,YAAM,mBAAmBD,eAAc,OAAO;AAC9C,YAAM,uBAAuB,KAAK,UAAU,gBAAgB;AAE5D,aAAO;AAAA,QACL,IAAI;AAAA,QACJ,SAAS,EAAE,kBAAkB,iBAAiB,IAAI;AAAA;AAAA,QAGlD,QAAQ,OAAO,EAAE,MAAM,OAAO,QAAAE,QAAO,MAAM;AACzC,iBAAO,MAAM,IAAI,YAAY,OAAO,KAAK,GAAG,UAAU;AAAA,YACpD,kBAAkB;AAAA,YAClB;AAAA,YACA;AAAA,YACA,QAAAA;AAAA,UACF,CAAC;AAAA,QACH;AAAA,QAEA,SAAS,OAAO,EAAE,OAAO,QAAAA,SAAQ,MAAM,MAAM;AAC3C,iBAAO,MAAM,IAAI,SAAS,OAAO,KAAK,GAAG,WAAW;AAAA,YAClD,kBAAkB;AAAA,YAClB;AAAA,YACA,QAAAA;AAAA,YACA,OAAO,WAAW,KAAK;AAAA,UACzB,CAAC;AAAA,QACH;AAAA,QAEA,UAAU,OAAO,EAAE,OAAO,OAAO,QAAQ,MAAM,MAAM;AACnD,iBAAO,MAAM,IAAI,SAAS,OAAO,KAAK,GAAG,YAAY;AAAA,YACnD,kBAAkB;AAAA,YAClB;AAAA,YACA;AAAA,YACA;AAAA,YACA,OAAO,WAAW,KAAK;AAAA,UACzB,CAAC;AAAA,QACH;AAAA,QAEA,OAAO,OAAO,EAAE,OAAO,MAAM,MAAM;AACjC,iBAAO,MAAM,IAAI,SAAS,OAAO,KAAK,GAAG,SAAS;AAAA,YAChD,kBAAkB;AAAA,YAClB;AAAA,YACA,OAAO,WAAW,KAAK;AAAA,UACzB,CAAC;AAAA,QACH;AAAA,QAEA,QAAQ,OAAO,EAAE,OAAO,QAAAC,SAAQ,MAAM,MAAM;AAC1C,iBAAO,MAAM,IAAI,YAAY,OAAO,KAAK,GAAG,UAAU;AAAA,YACpD,kBAAkB;AAAA,YAClB;AAAA,YACA,QAAAA;AAAA,YACA,OAAO,WAAW,KAAK;AAAA,UACzB,CAAC;AAAA,QACH;AAAA,QAEA,YAAY,OAAO,EAAE,OAAO,QAAAA,SAAQ,MAAM,MAAM;AAC9C,iBAAO,MAAM,IAAI,YAAY,OAAO,KAAK,GAAG,cAAc;AAAA,YACxD,kBAAkB;AAAA,YAClB;AAAA,YACA,QAAAA;AAAA,YACA,OAAO,WAAW,KAAK;AAAA,UACzB,CAAC;AAAA,QACH;AAAA,QAEA,QAAQ,OAAO,EAAE,OAAO,MAAM,MAAM;AAClC,iBAAO,MAAM,IAAI,YAAY,OAAO,KAAK,GAAG,UAAU;AAAA,YACpD,kBAAkB;AAAA,YAClB;AAAA,YACA,OAAO,WAAW,KAAK;AAAA,UACzB,CAAC;AAAA,QACH;AAAA,QAEA,YAAY,OAAO,EAAE,OAAO,MAAM,MAAM;AACtC,iBAAO,MAAM,IAAI,YAAY,OAAO,KAAK,GAAG,cAAc;AAAA,YACxD,kBAAkB;AAAA,YAClB;AAAA,YACA,OAAO,WAAW,KAAK;AAAA,UACzB,CAAC;AAAA,QACH;AAAA,QAEA,aAAa,YAAY;AACvB,gBAAM,IAAI,MAAM,4BAA4B;AAAA,QAC9C;AAAA,MACF;AAAA,IACF;AAAA,IACA,QAAQ;AAAA,MACN,WAAW;AAAA,MACX,aAAa;AAAA,MACb,sBAAsB,CAAC,EAAE,MAAM,gBAAgB,MAC7C,QAAQ,gBAAgB,SAAS,SAC7B,IAAI,KAAK,IAAI,EAAE,QAAQ,IACvB;AAAA,MACN,uBAAuB,CAAC,EAAE,MAAM,gBAAgB,MAC9C,QAAQ,gBAAgB,SAAS,SAC7B,IAAI,KAAK,IAAI,EAAE,QAAQ,IACvB;AAAA,MACN,WAAW,OAAO,aAAa;AAAA,MAC/B,qBAAqB;AAAA,MACrB,uBAAuB,EAAE,IAAI,MAAM;AAAA,MACnC,wBAAwB,EAAE,KAAK,KAAK;AAAA,MACpC,gBAAgB;AAAA,MAChB,eAAe;AAAA,MACf,cAAc;AAAA,MACd,oBAAoB;AAAA,MACpB,aAAa;AAAA,MACb,WAAW;AAAA,IACb;AAAA,EACF,CAAC;AACH;;;ACpIA,SAAS,SAAS;;;ACFlB,eAAsB,SAAS,MAAM,gBAAgB;AACjD,QAAM,WAAW,CAAC;AAClB,MAAI,QAAQ;AACZ,SAAO,MAAM;AACb,aAAW,QAAQ,MAAM;AACrB,aAAS,KAAK,eAAe,MAAM,KAAK,CAAC;AACzC,aAAS;AAAA,EACb;AACA,SAAO,QAAQ,IAAI,QAAQ;AAC/B;;;ACjBA,SAAS,cAAc,eAAe,cAAc,uBAAwB;AAE5E,IAAM,wBAAwB;AAM9B,IAAM,oBAAoB,wBAAwB;AAIlD,SAAS,cAAc,WAAW;AAC9B,MAAI,cAAc,QAAQ,cAAc,OAAO;AAC3C,WAAO;AAAA,EACX;AACA,SAAO;AACX;AAcA,SAAS,WAAW,aAEpB,OAAO,YAAY,UAAU,gBAAgB,cAAc;AAKvD,QAAMC,gBAAe,CAAC;AACtB,SAAO,WAAW,SAAS,KACvB,SAAS,SAAS,KAClB,cAAc,WAAW,CAAC,GAAG,SAAS,CAAC,CAAC,MAAM,GAAG;AACjD,UAAM,aAAa,YAAY,CAAC;AAChC,kBAAc,YAAY,MAAM,CAAC;AACjC,UAAM,UAAU,WAAW,CAAC;AAC5B,iBAAa,WAAW,MAAM,CAAC;AAC/B,eAAW,SAAS,MAAM,CAAC;AAC3B,IAAAA,cAAa,KAAK,CAAC,MAAM,YAAY,OAAO,CAAC;AAAA,EACjD;AACA,QAAM,cAAc,CAAC,WAAW,QAAQ;AACpC,UAAM,QAAQA,cAAa,MAAM;AACjC,QAAI,IAAI;AACR,WAAO,IAAI,IAAI,SAAS,GAAG,KAAK;AAC5B,YAAM,KAAK,CAAC,MAAM,YAAY,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;AAAA,IAC7C;AACA,QAAI,IAAI,IAAI,QAAQ;AAChB,YAAM,KAAK,CAAC,WAAW,YAAY,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;AAAA,IAClD;AACA,WAAO;AAAA,EACX;AAEA,QAAM,cAAc,CAAC;AACrB,SAAO,WAAW,SAAS,GAAG;AAC1B,gBAAY,KAAK,YAAY,gBAAgB,UAAU,CAAC;AACxD,qBAAiB,cAAc,cAAc;AAC7C,iBAAa,WAAW,MAAM,GAAG,EAAE;AAAA,EACvC;AAEA,QAAM,YAAY,CAAC;AACnB,SAAO,SAAS,SAAS,GAAG;AACxB,cAAU,KAAK,YAAY,cAAc,QAAQ,CAAC;AAClD,mBAAe,cAAc,YAAY;AACzC,eAAW,SAAS,MAAM,GAAG,EAAE;AAAA,EACnC;AACA,YAAU,QAAQ;AAElB,MAAI;AACJ,MAAI,SAAS,WAAW,GAAG;AACvB,kBAAc,YAAY,gBAAgB,UAAU;AAAA,EACxD,WACS,WAAW,WAAW,GAAG;AAC9B,kBAAc,YAAY,cAAc,QAAQ;AAAA,EACpD,OACK;AACD,UAAM,aAAa,WAAW,CAAC;AAC/B,UAAM,WAAW,SAAS,CAAC;AAC3B,kBAAcA,cAAa,MAAM;AACjC,gBAAY,KAAK,CAAC,gBAAgB,YAAY,CAAC,GAAG,UAAU,CAAC;AAC7D,gBAAY,KAAK,CAAC,cAAc,YAAY,CAAC,GAAG,QAAQ,CAAC;AAAA,EAC7D;AACA,QAAM,SAAS,CAAC,GAAG,aAAa,aAAa,GAAG,SAAS;AACzD,MAAI,UAAU,QAAQ;AAClB,WAAO,QAAQ;AAAA,EACnB;AACA,SAAO;AACX;AACA,SAAS,aAAa,OAAO;AACzB,SAAO,CAAC,MAAM;AACV,eAAW,CAAC,WAAW,OAAO,KAAK,KAAK,OAAO;AAC3C,UAAI,EAAE,SAAS,EAAE,OAAO,KAAK;AAAA,IACjC;AACA,WAAO;AAAA,EACX;AACJ;AAWO,SAAS,eAAe,OAAO,OAAO,QAAQ;AACjD,QAAM,kBAAkB,OAAO,SAAS,kBAAkB;AAC1D,MAAI,oBAAoB,oBAAoB;AACxC,WAAO,CAAC,iBAAiB,KAAK;AAAA,EAClC;AACA,MAAI,oBAAoB,SAAS;AAC7B,WAAO,CAAC,KAAK;AAAA,EACjB;AACA,MAAI,CAAC,QAAQ;AACT,UAAM,IAAI,MAAM,0CAA0C;AAAA,EAC9D;AACA,QAAM,YAAY,OAAO,OAAO,KAAK;AACrC,QAAM,YAAY,UAAU,QAAQ,KAAK,CAACC,WAAUA,OAAM,oBAAoB,eAAe;AAC7F,MAAI,CAAC,WAAW;AACZ,UAAM,IAAI,MAAM,SAAS,eAAe,uBAAuB,KAAK,EAAE;AAAA,EAC1E;AACA,QAAM,SAAS,UAAU,OAAO,MAAM;AACtC,SAAO,KAAK,eAAe;AAC3B,SAAO,KAAK,KAAK;AACjB,SAAO;AACX;AACA,SAAS,YAAY,KAAK,aAAa;AACnC,QAAM,MAAM,CAAC;AACb,aAAW,SAAS,aAAa;AAC7B,QAAI,MAAM;AACV,eAAW,YAAY,MAAM,MAAM,GAAG,GAAG;AACrC,YAAM,IAAI,QAAQ;AAAA,IACtB;AACA,QAAI,KAAK,GAAG;AAAA,EAChB;AACA,SAAO;AACX;AAaO,SAAS,OAAO,IAAI,QAAQ;AAC/B,SAAO,IAAI,qBAAqB,IAAI,MAAM;AAC9C;AAIO,IAAM,cAAN,MAAkB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAkBrB,WAAW,WAAW;AAClB,UAAM,QAAQ,KAAK,SAAS;AAC5B,WAAO,IAAI,cAAc,MAAM,OAAO,QAAQ;AAC1C,YAAM,WAAY,MAAM,UAAU,GAAG,IAAK,MAAM;AAChD,aAAO,IAAI,gBAAgB,UAAU,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;AAAA,IAC1D,GAAG,CAAC,CAAC;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,IAAI,QAAQ;AACR,UAAM,QAAQ,KAAK,SAAS;AAC5B,WAAO,IAAI,cAAc,MAAM,OAAO,QAAQ;AAC1C,YAAM,SAAS,MAAM,OAAO,GAAG;AAC/B,aAAO,IAAI,gBAAgB,QAAQ,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;AAAA,IACxD,GAAG,CAAC,CAAC;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaA,QAAQ,QAAQ,mBAAmB;AAC/B,yBAAqB,iBAAiB;AACtC,WAAO,IAAI,cAAc,MAAM,QAAQ,iBAAiB;AAAA,EAC5D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAgBA,SAAS,qBAAqB;AAC1B,WAAO,IAAI,eAAe,MAAM,mBAAmB;AAAA,EACvD;AAAA;AAAA,EAEA,OAAO,YAAY;AACf,UAAM,IAAI,MAAM,sJAAsJ;AAAA,EAC1K;AAAA,EACA,MAAM,SAAS,MAAM;AACjB,QAAI,KAAK,aAAa,GAAG;AACrB,UAAI,KAAK,WAAW,MAAM;AACtB,cAAM,IAAI,MAAM,gLAE6C;AAAA,MACjE;AACA,aAAO;AAAA,QACH,MAAM,CAAC;AAAA,QACP,QAAQ;AAAA,QACR,gBAAgB,KAAK;AAAA,MACzB;AAAA,IACJ;AACA,UAAM,QAAQ,KAAK,SAAS;AAC5B,QAAI,cAAc;AAAA,MACd,KAAK,CAAC;AAAA,MACN,WAAW;AAAA,IACf;AACA,QAAI,KAAK,WAAW,MAAM;AACtB,oBAAc;AAAA,QACV,KAAK,kBAAkB,KAAK,MAAM;AAAA,QAClC,WAAW;AAAA,MACf;AAAA,IACJ;AACA,QAAI,YAAY;AAAA,MACZ,KAAK,CAAC;AAAA,MACN,WAAW;AAAA,IACf;AACA,UAAM,gBAAgB,KAAK;AAC3B,QAAI,UAAU,KAAK;AACnB,QAAI,KAAK,WAAW;AAChB,kBAAY;AAAA,QACR,KAAK,kBAAkB,KAAK,SAAS;AAAA,QACrC,WAAW;AAAA,MACf;AAGA,gBAAU;AAAA,IACd;AACA,UAAM,gBAAgB,UAAU,QAAQ,cAAc;AACtD,UAAM,gBAAgB,UAAU,QAAQ,YAAY;AACpD,UAAM,eAAe,KAAK,OAAO;AAAA,MAC7B,YAAY,cAAc;AAAA,MAC1B,qBAAqB,cAAc;AAAA,MACnC,YAAY,cAAc;AAAA,MAC1B,qBAAqB,cAAc;AAAA,IACvC,CAAC;AACD,UAAM,OAAO,CAAC;AACd,UAAM,YAAY,CAAC;AACnB,QAAI,UAAU,KAAK,aAAa,KAAK,cAAc;AACnD,QAAI,iBAAiB,KAAK,aAAa;AACvC,UAAM,iBAAiB,KAAK;AAC5B,UAAM,iBAAiB,mBAAmB;AAC1C,QAAI,iBAAiB;AACrB,QAAI,WAAW;AACf,qBAAiB,CAAC,KAAK,UAAU,SAAS,KAAK,aAAa,aAAa,cAAc,GAAG;AACtF,UAAI,QAAQ,MAAM;AACd,aAAK,KAAK,GAAG;AAAA,MACjB;AACA,gBAAU,KAAK,QAAQ;AACvB,wBAAkB;AAClB,UAAK,mBAAmB,UAAa,kBAAkB,kBAClD,kBAAkB,UAAa,UAAU,UAAU,eAAgB;AACpE,mBAAW;AAAA,MACf;AACA,UAAI,YAAa,YAAY,UAAa,KAAK,UAAU,SAAU;AAC/D,kBAAU;AACV,yBAAiB,gBAAgB,QAAQ;AACzC;AAAA,MACJ;AAAA,IACJ;AACA,QAAI,aAAa;AACjB,QAAI,cAAc;AAClB,QAAI,UAAU;AACV,mBAAa;AACb,oBAAc,UAAU,KAAK,OAAO,UAAU,SAAS,KAAK,CAAC,CAAC;AAAA,IAClE,WACS,UAAU,UAAU,qBACzB,KAAK,SAAS,KAAK,WAAW,GAAG;AACjC,mBAAa;AACb,oBAAc,UAAU,KAAK,OAAO,UAAU,SAAS,KAAK,CAAC,CAAC;AAAA,IAClE;AACA,WAAO;AAAA,MACH;AAAA,MACA,QAAQ,CAAC;AAAA,MACT;AAAA,MACA;AAAA,MACA,aAAa,cAAc,gBAAgB,WAAW,IAAI;AAAA,IAC9D;AAAA,EACJ;AAAA,EACA,MAAM,UAAU;AACZ,WAAO,MAAM,KAAK,KAAK,QAAQ;AAAA,EACnC;AAAA,EACA,MAAM,KAAK,GAAG;AACV,UAAM,UAAU,CAAC;AACjB,qBAAiB,CAAC,GAAG,KAAK,KAAK,aAAa,GAAG;AAC3C,UAAI,QAAQ,MAAM;AACd;AAAA,MACJ;AACA,cAAQ,KAAK,GAAG;AAChB,UAAI,QAAQ,WAAW,GAAG;AACtB;AAAA,MACJ;AAAA,IACJ;AACA,WAAO;AAAA,EACX;AAAA,EACA,MAAM,SAAS;AACX,UAAM,OAAO,MAAM,KAAK,KAAK,CAAC;AAC9B,QAAI,KAAK,WAAW,GAAG;AACnB,YAAM,IAAI,MAAM,qBAAqB;AAAA,IACzC;AACA,WAAO,KAAK,CAAC,KAAK;AAAA,EACtB;AAAA,EACA,MAAM,QAAQ;AACV,UAAM,OAAO,MAAM,KAAK,KAAK,CAAC;AAC9B,WAAO,KAAK,CAAC,KAAK;AAAA,EACtB;AAAA,EACA,CAAC,OAAO,aAAa,IAAI;AACrB,UAAM,WAAW,KAAK,aAAa,EAAE,OAAO,aAAa,EAAE;AAC3D,WAAO;AAAA,MACH,MAAM,OAAO;AACT,cAAM,SAAS,MAAM,SAAS,KAAK;AACnC,YAAI,OAAO,MAAM;AACb,iBAAO,EAAE,MAAM,MAAM,OAAO,OAAU;AAAA,QAC1C;AACA,eAAO,EAAE,MAAM,OAAO,OAAO,OAAO,MAAM,CAAC,EAAE;AAAA,MACjD;AAAA,IACJ;AAAA,EACJ;AACJ;AACO,IAAM,uBAAN,MAA2B;AAAA,EAC9B;AAAA,EACA;AAAA;AAAA,EAEA;AAAA,EACA,YAAY,IAAI,QAAQ;AACpB,SAAK,KAAK;AACV,SAAK,SAAS;AACd,SAAK,SAAS,GAAG;AAAA,EACrB;AAAA,EACA,MAAM,WAAW;AACb,WAAO,IAAI,uBAAuB,MAAM,SAAS;AAAA,EACrD;AAAA,EACA,IAAI,KAAK;AACL,UAAM,IAAI,MAAM,qCAAqC;AAAA,EACzD;AAAA,EACA,YAAY,YAAY,KAAK;AACzB,UAAM,IAAI,MAAM,8CAA8C;AAAA,EAClE;AACJ;AACO,IAAM,kBAAN,cAA8B,YAAY;AACjD;AACO,IAAM,yBAAN,cAAqC,gBAAgB;AAAA,EACxD;AAAA,EACA;AAAA,EACA,YAAY,QAAQ,OAAO;AACvB,UAAM;AACN,SAAK,SAAS;AACd,SAAK,QAAQ;AAAA,EACjB;AAAA,EACA,gBAAgB;AACZ,WAAO,KAAK,UAAU,kBAAkB;AAAA,EAC5C;AAAA,EACA,UAAU,WAAW,YAAY;AAC7B,UAAM,cAAc,eAAe,KAAK,OAAO,WAAW,KAAK,OAAO,MAAM;AAC5E,UAAM,IAAI,IAAI,kBAAkB,WAAW;AAC3C,QAAI,YAAY;AACZ,iBAAW,CAAC;AAAA,IAChB;AACA,WAAO,IAAI,YAAY,MAAM,WAAW,GAAG,UAAU;AAAA,EACzD;AAAA,EACA,gBAAgB,YAAY,eAAe;AACvC,UAAM,IAAI,MAAM,iCAAiC;AAAA,EACrD;AAAA,EACA,QAAQ;AACJ,WAAO,KAAK,cAAc;AAAA,EAC9B;AAAA,EACA,MAAM,OAAO;AACT,WAAO,KAAK,MAAM,EAAE,MAAM,KAAK;AAAA,EACnC;AAAA,EACA,UAAU;AACN,WAAO,KAAK,MAAM,EAAE,QAAQ;AAAA,EAChC;AAAA,EACA,aAAa,iBAAiB,OAAO;AACjC,WAAO,KAAK,MAAM,EAAE,aAAa,cAAc;AAAA,EACnD;AAAA,EACA,WAAW;AACP,WAAO,KAAK,MAAM,EAAE,SAAS;AAAA,EACjC;AAAA,EACA,yBAAyB;AACrB,WAAO,KAAK,MAAM,EAAE,uBAAuB;AAAA,EAC/C;AAAA,EACA,iBAAiB;AACb,WAAO,KAAK,MAAM,EAAE,eAAe;AAAA,EACvC;AAAA,EACA,OAAO,aAAa;AAChB,WAAO,KAAK,MAAM,EAAE,OAAO,WAAW;AAAA,EAC1C;AACJ;AAEO,IAAM,cAAN,cAA0B,gBAAgB;AAAA,EAC7C;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA,YAAY,QAAQ,OAAO,GAAG,YAAY;AACtC,UAAM;AACN,SAAK,SAAS;AACd,SAAK,QAAQ;AACb,SAAK,IAAI;AACT,SAAK,aAAa;AAAA,EACtB;AAAA,EACA,MAAM,OAAO;AACT,WAAO,IAAI,mBAAmB,MAAM,KAAK;AAAA,EAC7C;AAAA,EACA,QAAQ;AACJ,WAAO,KAAK,MAAM,KAAK;AAAA,EAC3B;AAAA,EACA,UAAU;AACN,WAAO,KAAK,MAAM,EAAE,QAAQ;AAAA,EAChC;AAAA,EACA,aAAa,iBAAiB,OAAO;AACjC,WAAO,KAAK,MAAM,EAAE,aAAa,cAAc;AAAA,EACnD;AAAA,EACA,WAAW;AACP,WAAO,KAAK,MAAM,EAAE,SAAS;AAAA,EACjC;AAAA,EACA,yBAAyB;AACrB,WAAO,KAAK,MAAM,EAAE,uBAAuB;AAAA,EAC/C;AAAA,EACA,iBAAiB;AACb,WAAO,KAAK,MAAM,EAAE,eAAe;AAAA,EACvC;AAAA,EACA,OAAO,aAAa;AAChB,WAAO,KAAK,MAAM,EAAE,OAAO,WAAW;AAAA,EAC1C;AACJ;AACO,IAAM,qBAAN,cAAiC,gBAAgB;AAAA,EACpD;AAAA,EACA;AAAA,EACA,YAAY,QAAQ,OAAO;AACvB,UAAM;AACN,SAAK,SAAS;AACd,SAAK,QAAQ;AAAA,EACjB;AAAA,EACA,UAAU;AACN,WAAO;AAAA,MACH,IAAI,KAAK,OAAO,OAAO,OAAO;AAAA,MAC9B,QAAQ,KAAK,OAAO,OAAO,OAAO;AAAA,MAClC,OAAO,KAAK,OAAO,OAAO;AAAA,MAC1B,OAAO,KAAK,OAAO;AAAA,MACnB,aAAa,KAAK,OAAO,EAAE;AAAA,MAC3B,OAAO,KAAK;AAAA,MACZ,QAAQ;AAAA,QACJ,YAAY,KAAK,OAAO,EAAE,sBAAsB,CAAC;AAAA,QACjD,qBAAqB,KAAK,OAAO,EAAE;AAAA,QACnC,YAAY,KAAK,OAAO,EAAE,sBAAsB,CAAC;AAAA,QACjD,qBAAqB,KAAK,OAAO,EAAE;AAAA,MACvC;AAAA,MACA,YAAY,KAAK,OAAO;AAAA,IAC5B;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA,EAIA,QAAQ;AACJ,UAAM,EAAE,IAAI,OAAO,OAAO,OAAO,WAAW,IAAI,KAAK,QAAQ;AAC7D,WAAO,GAAG,MAAM,KAAK,EAAE,UAAU,OAAO,UAAU,EAAE,MAAM,KAAK;AAAA,EACnE;AAAA,EACA,aAAa,iBAAiB,OAAO;AACjC,UAAM,EAAE,YAAY,IAAI,KAAK,QAAQ;AACrC,UAAM,WAAW,KAAK,MAAM;AAC5B,WAAO;AAAA,MACH,CAAC,OAAO,aAAa,IAAI;AACrB,cAAM,WAAW,SAAS,OAAO,aAAa,EAAE;AAChD,eAAO;AAAA,UACH,MAAM,OAAO;AACT,kBAAM,SAAS,MAAM,SAAS,KAAK;AACnC,gBAAI,OAAO,MAAM;AACb,qBAAO,EAAE,MAAM,MAAM,OAAO,OAAU;AAAA,YAC1C;AACA,kBAAM,MAAM,OAAO;AACnB,kBAAM,YAAY,iBAAiB,gBAAgB,GAAG,IAAI;AAC1D,mBAAO;AAAA,cACH,MAAM;AAAA,cACN,OAAO,CAAC,KAAK,YAAY,KAAK,WAAW,GAAG,SAAS;AAAA,YACzD;AAAA,UACJ;AAAA,QACJ;AAAA,MACJ;AAAA,IACJ;AAAA,EACJ;AAAA,EACA,WAAW;AACP,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,yBAAyB;AACrB,WAAO,KAAK,OAAO,EAAE;AAAA,EACzB;AAAA,EACA,iBAAiB;AACb,WAAO,KAAK,OAAO,EAAE;AAAA,EACzB;AAAA,EACA,OAAO,aAAa;AAChB,UAAM,EAAE,IAAI,OAAO,OAAO,OAAO,QAAQ,OAAO,IAAI,KAAK,QAAQ;AACjE,QAAI,gBAAgB,OAAO;AAC3B,QAAI,yBAAyB,OAAO;AACpC,QAAI,YAAY;AAAA,MACZ,OAAO,YAAY;AAAA,MACnB,MAAM,YAAY,sBAAsB,gBAAgB;AAAA,IAC5D,GAAG;AAAA,MACC,OAAO,OAAO;AAAA,MACd,MAAM,OAAO,sBAAsB,gBAAgB;AAAA,IACvD,CAAC,IAAI,GAAG;AACJ,sBAAgB,YAAY;AAC5B,+BAAyB,YAAY;AAAA,IACzC;AACA,QAAI,gBAAgB,OAAO;AAC3B,QAAI,yBAAyB,OAAO;AACpC,QAAI,YAAY;AAAA,MACZ,OAAO,YAAY;AAAA,MACnB,MAAM,YAAY,sBAAsB,cAAc;AAAA,IAC1D,GAAG;AAAA,MACC,OAAO,OAAO;AAAA,MACd,MAAM,OAAO,sBAAsB,cAAc;AAAA,IACrD,CAAC,IAAI,GAAG;AACJ,sBAAgB,YAAY;AAC5B,+BAAyB,YAAY;AAAA,IACzC;AACA,WAAO,iBAAiB,IAAI,QAAQ,OAAO,OAAO;AAAA,MAC9C,YAAY;AAAA,MACZ,qBAAqB;AAAA,MACrB,YAAY;AAAA,MACZ,qBAAqB;AAAA,IACzB,GAAG,KAAK;AAAA,EACZ;AACJ;AAIO,SAAS,iBAAiB,IAAI,QAAQ,OAAO,OAAO,QAAQ,OAAO;AACtE,QAAM,cAAc,eAAe,OAAO,OAAO,MAAM;AACvD,QAAM,cAAc,WAAW,aAAa,OAAO,OAAO,YAAY,OAAO,YAAY,OAAO,sBAAsB,QAAQ,MAAM,OAAO,sBAAsB,QAAQ,IAAI;AAC7K,QAAM,aAAa,YAAY,IAAI,CAAC,eAAe,OAAO,IAAI,MAAM,EAC/D,MAAM,KAAK,EACX,UAAU,OAAO,aAAa,UAAU,CAAC,EACzC,MAAM,KAAK,CAAC;AACjB,SAAO,IAAI,cAAc,GAAG,UAAU;AAC1C;AACA,IAAM,oBAAN,MAAwB;AAAA,EACpB;AAAA,EACA,aAAa;AAAA,EACb,qBAAqB;AAAA,EACrB,sBAAsB;AAAA,EACtB,qBAAqB;AAAA,EACrB,sBAAsB;AAAA,EACtB,sBAAsB,CAAC;AAAA,EACvB,YAAY,aAAa;AACrB,SAAK,cAAc;AAAA,EACvB;AAAA,EACA,GAAG,OAAO,OAAO;AACb,QAAI,CAAC,KAAK,eAAe,KAAK,KAAK,CAAC,KAAK,eAAe,KAAK,GAAG;AAC5D,YAAM,IAAI,MAAM,2BAA2B,KAAK,GAAG;AAAA,IACvD;AACA,SAAK,qBAAqB,KAAK,sBAAsB,CAAC;AACtD,SAAK,mBAAmB,KAAK,KAAK;AAClC,SAAK,qBAAqB,KAAK,sBAAsB,CAAC;AACtD,SAAK,mBAAmB,KAAK,KAAK;AAClC,SAAK,oBAAoB,KAAK,KAAK;AACnC,WAAO;AAAA,EACX;AAAA,EACA,GAAG,OAAO,OAAO;AACb,QAAI,CAAC,KAAK,eAAe,KAAK,GAAG;AAC7B,YAAM,IAAI,MAAM,2BAA2B,KAAK,GAAG;AAAA,IACvD;AACA,SAAK,qBAAqB,KAAK,sBAAsB,CAAC;AACtD,SAAK,mBAAmB,KAAK,KAAK;AAClC,SAAK,sBAAsB;AAC3B,SAAK,aAAa;AAClB,WAAO;AAAA,EACX;AAAA,EACA,IAAI,OAAO,OAAO;AACd,QAAI,CAAC,KAAK,eAAe,KAAK,GAAG;AAC7B,YAAM,IAAI,MAAM,4BAA4B,KAAK,GAAG;AAAA,IACxD;AACA,SAAK,qBAAqB,KAAK,sBAAsB,CAAC;AACtD,SAAK,mBAAmB,KAAK,KAAK;AAClC,SAAK,aAAa;AAClB,WAAO;AAAA,EACX;AAAA,EACA,GAAG,OAAO,OAAO;AACb,QAAI,CAAC,KAAK,eAAe,KAAK,GAAG;AAC7B,YAAM,IAAI,MAAM,2BAA2B,KAAK,GAAG;AAAA,IACvD;AACA,SAAK,qBAAqB,KAAK,sBAAsB,CAAC;AACtD,SAAK,mBAAmB,KAAK,KAAK;AAClC,SAAK,sBAAsB;AAC3B,SAAK,aAAa;AAClB,WAAO;AAAA,EACX;AAAA,EACA,IAAI,OAAO,OAAO;AACd,QAAI,CAAC,KAAK,eAAe,KAAK,GAAG;AAC7B,YAAM,IAAI,MAAM,4BAA4B,KAAK,GAAG;AAAA,IACxD;AACA,SAAK,qBAAqB,KAAK,sBAAsB,CAAC;AACtD,SAAK,mBAAmB,KAAK,KAAK;AAClC,SAAK,aAAa;AAClB,WAAO;AAAA,EACX;AAAA,EACA,eAAe,OAAO;AAClB,UAAM,0BAA0B,KAAK,oBAAoB,UAAU;AACnE,UAAM,0BAA0B,KAAK,oBAAoB,UAAU;AACnE,QAAI,0BAA0B,yBAAyB;AAEnD,aAAO;AAAA,IACX;AACA,QAAI,4BAA4B,2BAC5B,KAAK,YAAY;AAEjB,aAAO;AAAA,IACX;AACA,WAAQ,0BAA0B,KAAK,YAAY,UAC/C,KAAK,YAAY,uBAAuB,MAAM;AAAA,EACtD;AAAA,EACA,eAAe,OAAO;AAClB,UAAM,0BAA0B,KAAK,oBAAoB,UAAU;AACnE,UAAM,0BAA0B,KAAK,oBAAoB,UAAU;AACnE,QAAI,0BAA0B,yBAAyB;AAEnD,aAAO;AAAA,IACX;AACA,QAAI,4BAA4B,2BAC5B,KAAK,YAAY;AAEjB,aAAO;AAAA,IACX;AACA,WAAQ,0BAA0B,KAAK,YAAY,UAC/C,KAAK,YAAY,uBAAuB,MAAM;AAAA,EACtD;AACJ;AAkCO,SAAS,aAAa,SAAS,oBAAoB;AACtD,SAAO,IAAI,aAAa,SAAS,kBAAkB;AACvD;AACO,IAAM,eAAN,MAAM,sBAAqB,YAAY;AAAA,EAC1C;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA,YAAY,SAAS,oBAAoB;AACrC,UAAM;AACN,QAAI,QAAQ,WAAW,GAAG;AACtB,YAAM,IAAI,MAAM,qCAAqC;AAAA,IACzD;AACA,SAAK,SAAS,QAAQ,QAAQ,IAAI,CAACC,YAAWA,QAAO,SAAS,CAAC,GAAG,4CAA4C;AAC9G,SAAK,WAAW,QAAQ,IAAI,CAACA,YAAW,IAAI,cAAcA,SAAQ,kBAAkB,CAAC;AACrF,SAAK,eAAe,QAAQ,KAAK,SAAS,IAAI,CAACA,YAAWA,QAAO,eAAe,CAAC,GAAG,6EAA6E;AAEjK,SAAK,uBAAuB,aAAa,KAAK,SAAS,IAAI,CAACA,YAAWA,QAAO,uBAAuB,CAAC,CAAC;AAAA,EAC3G;AAAA,EACA,aAAa,iBAAiB,OAAO;AACjC,UAAM,YAAY,KAAK,SAAS,IAAI,CAACA,YAAWA,QAAO,aAAa,cAAc,CAAC;AACnF,UAAM,sBAAsB,KAAK,WAAW,QAAQ,IAAI;AACxD,WAAO;AAAA,MACH,CAAC,OAAO,aAAa,IAAI;AACrB,cAAM,YAAY,UAAU,IAAI,CAAC,aAAa,SAAS,OAAO,aAAa,EAAE,CAAC;AAC9E,cAAM,UAAU,MAAM,UAAU,MAAM;AAEtC,cAAM,mBAAmB,MAAM,UAAU,MAAM,EAAE,KAAK,CAAC;AACvD,eAAO;AAAA,UACH,MAAM,OAAO;AACT,gBAAI,yBAAyB;AAE7B,kBAAM,QAAQ,IAAI,UAAU,IAAI,OAAO,UAAU,MAAM;AACnD,kBAAI,CAAC,QAAQ,CAAC,GAAG;AACb,sBAAM,SAAS,MAAM,SAAS,KAAK;AACnC,wBAAQ,CAAC,IAAI;AAEb,oBAAI,kBAAkB,CAAC,OAAO,QAAQ,OAAO,OAAO;AAChD,mCAAiB,CAAC,IAAI,OAAO,MAAM,CAAC;AAAA,gBACxC;AAAA,cACJ;AAAA,YACJ,CAAC,CAAC;AAEF,gBAAI,gBAAgB;AAChB,uBAAS,IAAI,GAAG,IAAI,iBAAiB,QAAQ,KAAK;AAC9C,0CAA0B,iBAAiB,CAAC;AAC5C,iCAAiB,CAAC,IAAI;AAAA,cAC1B;AAAA,YACJ;AAEA,gBAAI,sBAAsB;AAC1B,qBAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;AACrC,oBAAM,SAAS,QAAQ,CAAC;AACxB,kBAAI,OAAO,QAAQ,CAAC,OAAO,OAAO;AAC9B;AAAA,cACJ;AACA,oBAAM,CAACC,IAAG,cAAc,IAAI,OAAO;AACnC,kBAAI,wBAAwB,QAAW;AACnC,sCAAsB,CAAC,gBAAgB,CAAC;AACxC;AAAA,cACJ;AACA,oBAAM,CAAC,OAAO,IAAI;AAClB,kBAAI,YAAY,EAAE,OAAO,gBAAgB,MAAM,QAAQ,GAAG,EAAE,OAAO,SAAS,MAAM,QAAQ,CAAC,IACvF,sBACA,GAAG;AACH,sCAAsB,CAAC,gBAAgB,CAAC;AAAA,cAC5C;AAAA,YACJ;AACA,gBAAI,wBAAwB,QAAW;AACnC,qBAAO,EAAE,MAAM,MAAM,OAAO,OAAU;AAAA,YAC1C;AACA,kBAAM,CAAC,GAAG,QAAQ,IAAI;AACtB,kBAAM,CAAC,KAAK,QAAQ,IAAI,QAAQ,QAAQ,EAAE;AAE1C,oBAAQ,QAAQ,IAAI;AACpB,mBAAO;AAAA,cACH,MAAM;AAAA,cACN,OAAO,CAAC,KAAK,UAAU,sBAAsB;AAAA,YACjD;AAAA,UACJ;AAAA,QACJ;AAAA,MACJ;AAAA,IACJ;AAAA,EACJ;AAAA,EACA,WAAW;AACP,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,yBAAyB;AACrB,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,iBAAiB;AACb,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,OAAO,aAAa;AAChB,WAAO,IAAI,cAAa,KAAK,SAAS,IAAI,CAACD,YAAWA,QAAO,OAAO,WAAW,CAAC,GAAG,KAAK,YAAY;AAAA,EACxG;AACJ;AACA,SAAS,QAAQ,QAAQ,cAAc;AACnC,QAAM,QAAQ,OAAO,CAAC;AACtB,aAAW,SAAS,QAAQ;AACxB,QAAI,cAAc,OAAO,KAAK,GAAG;AAC7B,YAAM,IAAI,MAAM,YAAY;AAAA,IAChC;AAAA,EACJ;AACA,SAAO;AACX;AACA,SAAS,aAAa,QAAQ;AAC1B,MAAIF,gBAAe,OAAO,CAAC;AAC3B,aAAW,SAAS,QAAQ;AACxB,aAAS,IAAI,GAAG,IAAIA,cAAa,QAAQ,KAAK;AAC1C,UAAI,KAAK,MAAM,UAAU,cAAcA,cAAa,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG;AAC/D,QAAAA,gBAAeA,cAAa,MAAM,GAAG,CAAC;AACtC;AAAA,MACJ;AAAA,IACJ;AAAA,EACJ;AACA,SAAOA;AACX;AAmBA,IAAM,gBAAN,MAAM,uBAAsB,YAAY;AAAA,EACpC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA,eAAe,SAAS;AACpB,UAAM;AACN,SAAK,WAAW;AAChB,QAAI,QAAQ,WAAW,GAAG;AACtB,YAAM,IAAI,MAAM,sCAAsC;AAAA,IAC1D;AACA,SAAK,SAAS,QAAQ,QAAQ,IAAI,CAACE,YAAWA,QAAO,SAAS,CAAC,GAAG,wEAAwE;AAC1I,SAAK,eAAe,QAAQ,QAAQ,IAAI,CAACA,YAAWA,QAAO,eAAe,CAAC,GAAG,8EAA8E;AAC5J,SAAK,uBAAuB,aAAa,QAAQ,IAAI,CAACA,YAAWA,QAAO,uBAAuB,CAAC,CAAC;AAAA,EACrG;AAAA,EACA,aAAa,iBAAiB,OAAO;AACjC,UAAM,YAAY,KAAK,SAAS,IAAI,CAACA,YAAWA,QAAO,aAAa,cAAc,CAAC;AACnF,UAAM,sBAAsB,KAAK,WAAW,QAAQ,IAAI;AACxD,QAAI,mBAAmB;AACvB,WAAO;AAAA,MACH,CAAC,OAAO,aAAa,IAAI;AACrB,cAAM,YAAY,UAAU,IAAI,CAAC,aAAa,SAAS,OAAO,aAAa,EAAE,CAAC;AAC9E,eAAO;AAAA,UACH,MAAM,OAAO;AACT,mBAAO,UAAU,SAAS,GAAG;AACzB,oBAAM,SAAS,MAAM,UAAU,CAAC,EAAE,KAAK;AACvC,kBAAI,OAAO,MAAM;AACb,0BAAU,MAAM;AAAA,cACpB,OACK;AACD,sBAAM,CAAC,GAAG,QAAQ,IAAI,OAAO;AAC7B,oBAAI,qBAAqB,UACrB,YAAY;AAAA,kBACR,OAAO;AAAA,kBACP,MAAM;AAAA,gBACV,GAAG;AAAA,kBACC,OAAO;AAAA,kBACP,MAAM;AAAA,gBACV,CAAC,IACG,sBACA,GAAG;AACP,wBAAM,IAAI,MAAM,iCAAiC,KAAK,UAAU,gBAAgB,CAAC,KAAK,KAAK,UAAU,QAAQ,CAAC,EAAE;AAAA,gBACpH;AACA,mCAAmB;AACnB,uBAAO;AAAA,cACX;AAAA,YACJ;AACA,mBAAO,EAAE,MAAM,MAAM,OAAO,OAAU;AAAA,UAC1C;AAAA,QACJ;AAAA,MACJ;AAAA,IACJ;AAAA,EACJ;AAAA,EACA,WAAW;AACP,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,yBAAyB;AACrB,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,iBAAiB;AACb,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,OAAO,aAAa;AAChB,WAAO,IAAI,eAAc,GAAG,KAAK,SAAS,IAAI,CAACA,YAAWA,QAAO,OAAO,WAAW,CAAC,CAAC;AAAA,EACzF;AACJ;AACA,IAAM,wBAAN,MAA4B;AAAA,EACxB;AAAA,EACA;AAAA,EACA,oBAAoB;AAAA,EACpB;AAAA,EACA;AAAA,EACA;AAAA,EACA,YAAY,aAAa,QAAQ,mBAAmB,gBAAgB;AAChE,SAAK,iBAAiB,YACjB,aAAa,cAAc,EAAE,OAAO,aAAa,EAAE;AACxD,SAAK,eAAe;AACpB,SAAK,UAAU;AACf,SAAK,qBAAqB;AAC1B,SAAK,kBAAkB;AAAA,EAC3B;AAAA,EACA,2BAA2B;AAGvB,UAAM,WAAW,KAAK,mBAAmB,IAAI,MAAM,IAAI;AACvD,WAAO,IAAI,gBAAgB,MAAM,KAAK,aAAa,SAAS,GAAG,KAAK,oBAAoB,UAAU,QAAQ;AAAA,EAC9G;AAAA,EACA,MAAM,oBAAoB,MAAM;AAC5B,UAAM,CAAC,GAAG,UAAU,SAAS,IAAI;AACjC,QAAI;AACJ,QAAI,MAAM,MAAM;AACZ,oBAAc,KAAK,yBAAyB;AAAA,IAChD,OACK;AACD,oBAAc,MAAM,KAAK,QAAQ,CAAC;AAClC,UAAI,CAAC,iBAAiB,YAAY,eAAe,GAAG,KAAK,kBAAkB,GAAG;AAC1E,cAAM,IAAI,MAAM,yEAAyE,KAAK,UAAU,YAAY,eAAe,CAAC,CAAC,OAAO,KAAK,UAAU,KAAK,kBAAkB,CAAC,EAAE;AAAA,MACzL;AACA,UAAI,YAAY,SAAS,MAAM,KAAK,aAAa,SAAS,GAAG;AACzD,cAAM,IAAI,MAAM,sEAAsE,YAAY,SAAS,CAAC,OAAO,KAAK,aAAa,SAAS,CAAC,EAAE;AAAA,MACrJ;AAAA,IACJ;AACA,SAAK,oBAAoB;AAAA,MACrB;AAAA,MACA;AAAA,MACA,eAAe,YACV,aAAa,KAAK,eAAe,EAAE,OAAO,aAAa,EAAE;AAAA,MAC9D,OAAO;AAAA,MACP;AAAA,IACJ;AAAA,EACJ;AAAA,EACA,MAAM,OAAO;AACT,QAAI,KAAK,sBAAsB,MAAM;AACjC,YAAME,UAAS,MAAM,KAAK,eAAe,KAAK;AAC9C,UAAIA,QAAO,MAAM;AACb,eAAO,EAAE,MAAM,MAAM,OAAO,OAAU;AAAA,MAC1C;AACA,YAAM,KAAK,oBAAoBA,QAAO,KAAK;AAC3C,aAAO,MAAM,KAAK,KAAK;AAAA,IAC3B;AACA,UAAM,SAAS,MAAM,KAAK,kBAAkB,cAAc,KAAK;AAC/D,QAAI,OAAO,MAAM;AACb,UAAI,KAAK,kBAAkB,QAAQ,GAAG;AAClC,aAAK,oBAAoB;AAAA,MAC7B,OACK;AAID,aAAK,kBAAkB,gBAAgB,KAAK,yBAAyB,EAChE,aAAa,KAAK,eAAe,EAAE,OAAO,aAAa,EAAE;AAAA,MAClE;AACA,aAAO,MAAM,KAAK,KAAK;AAAA,IAC3B;AACA,UAAM,CAAC,GAAG,UAAU,cAAc,IAAI,OAAO;AAC7C,SAAK,kBAAkB;AACvB,UAAM,eAAe,CAAC,GAAG,KAAK,kBAAkB,UAAU,GAAG,QAAQ;AAErE,UAAM,aAAa,KAAK,kBAAkB,UAAU,IAC9C,KAAK,kBAAkB,YACvB,KAAK;AACX,WAAO,EAAE,MAAM,OAAO,OAAO,CAAC,GAAG,cAAc,SAAS,EAAE;AAAA,EAC9D;AACJ;AACA,IAAM,gBAAN,MAAM,uBAAsB,YAAY;AAAA,EACpC;AAAA,EACA;AAAA,EACA;AAAA,EACA,YAAYF,SAAQ,QAAQ,mBAAmB;AAC3C,UAAM;AACN,SAAK,UAAUA;AACf,SAAK,UAAU;AACf,SAAK,qBAAqB;AAAA,EAC9B;AAAA,EACA,aAAa,iBAAiB,OAAO;AACjC,UAAM,cAAc,KAAK;AACzB,UAAM,SAAS,KAAK;AACpB,UAAM,oBAAoB,KAAK;AAC/B,WAAO;AAAA,MACH,CAAC,OAAO,aAAa,IAAI;AACrB,eAAO,IAAI,sBAAsB,aAAa,QAAQ,mBAAmB,cAAc;AAAA,MAC3F;AAAA,IACJ;AAAA,EACJ;AAAA,EACA,WAAW;AACP,WAAO,KAAK,QAAQ,SAAS;AAAA,EACjC;AAAA,EACA,yBAAyB;AACrB,WAAO,KAAK,QAAQ,uBAAuB;AAAA,EAC/C;AAAA,EACA,iBAAiB;AACb,WAAO,CAAC,GAAG,KAAK,QAAQ,eAAe,GAAG,GAAG,KAAK,kBAAkB;AAAA,EACxE;AAAA,EACA,OAAO,aAAa;AAChB,UAAM,cAAc,KAAK,QAAQ,eAAe,EAAE;AAClD,UAAM,kBAAkB,YAAY,WAAW,MAAM,GAAG,WAAW;AACnE,UAAM,kBAAkB,YAAY,WAAW,MAAM,GAAG,WAAW;AACnE,UAAM,kBAAkB,YAAY,WAAW,MAAM,WAAW;AAChE,UAAM,kBAAkB,YAAY,WAAW,MAAM,WAAW;AAChE,UAAM,mBAAmB;AAAA,MACrB,YAAY;AAAA,MACZ,qBAAqB,gBAAgB,WAAW,IAAI,YAAY,sBAAsB;AAAA,MACtF,YAAY;AAAA,MACZ,qBAAqB,gBAAgB,WAAW,IAAI,YAAY,sBAAsB;AAAA,IAC1F;AACA,UAAM,mBAAmB;AAAA,MACrB,YAAY;AAAA,MACZ,qBAAqB,gBAAgB,WAAW,IAAI,OAAO,YAAY;AAAA,MACvE,YAAY;AAAA,MACZ,qBAAqB,gBAAgB,WAAW,IAAI,OAAO,YAAY;AAAA,IAC3E;AACA,WAAO,IAAI,eAAc,KAAK,QAAQ,OAAO,gBAAgB,GAAG,OAAO,MAAM;AACzE,YAAM,cAAc,MAAM,KAAK,QAAQ,CAAC;AACxC,aAAO,YAAY,OAAO,gBAAgB;AAAA,IAC9C,GAAG,KAAK,kBAAkB;AAAA,EAC9B;AACJ;AACO,IAAM,kBAAN,MAAM,yBAAwB,YAAY;AAAA,EAC7C;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA,YAAY,OAAO,QAAQ,OAAO,aAAa,UAAU,qBAAqB,YAAY,GAAG;AACzF,UAAM;AACN,SAAK,SAAS;AACd,SAAK,SAAS;AACd,SAAK,eAAe;AACpB,SAAK,YAAY;AACjB,SAAK,uBAAuB;AAC5B,SAAK,aAAa;AAClB,QAAI,SAAS,WAAW,YAAY,QAAQ;AACxC,YAAM,IAAI,MAAM,sDAAsD,KAAK,UAAU,QAAQ,CAAC,OAAO,KAAK,UAAU,WAAW,CAAC,EAAE;AAAA,IACtI;AAAA,EACJ;AAAA,EACA,aAAa,kBAAkB,OAAO;AAClC,UAAM,QAAQ,KAAK;AACnB,UAAM,WAAW,KAAK;AACtB,UAAM,YAAY,KAAK;AACvB,WAAO;AAAA,MACH,CAAC,OAAO,aAAa,IAAI;AACrB,YAAI,OAAO;AACX,eAAO;AAAA,UACH,MAAM,OAAO;AACT,gBAAI,MAAM;AACN,qBAAO,EAAE,MAAM,MAAM,OAAO,OAAU;AAAA,YAC1C;AACA,mBAAO;AACP,mBAAO;AAAA,cACH,MAAM;AAAA,cACN,OAAO,CAAC,OAAO,UAAU,SAAS;AAAA,YACtC;AAAA,UACJ;AAAA,QACJ;AAAA,MACJ;AAAA,IACJ;AAAA,EACJ;AAAA,EACA,WAAW;AACP,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,iBAAiB;AACb,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,yBAAyB;AACrB,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,OAAO,aAAa;AAChB,UAAM,oBAAoB,YAAY;AAAA,MAClC,OAAO,YAAY;AAAA,MACnB,MAAM,YAAY,sBAAsB,UAAU;AAAA,IACtD,GAAG;AAAA,MACC,OAAO,KAAK;AAAA,MACZ,MAAM;AAAA,IACV,CAAC;AACD,UAAM,oBAAoB,YAAY;AAAA,MAClC,OAAO,KAAK;AAAA,MACZ,MAAM;AAAA,IACV,GAAG;AAAA,MACC,OAAO,YAAY;AAAA,MACnB,MAAM,YAAY,sBAAsB,UAAU;AAAA,IACtD,CAAC;AAED,QAAI,qBAAqB,KAAK,qBAAqB,GAAG;AAClD,aAAO,IAAI,iBAAgB,KAAK,QAAQ,KAAK,QAAQ,KAAK,cAAc,KAAK,WAAW,KAAK,oBAAoB;AAAA,IACrH;AACA,WAAO,IAAI,YAAY,KAAK,QAAQ,KAAK,YAAY;AAAA,EACzD;AACJ;AAOO,IAAM,cAAN,cAA0B,YAAY;AAAA,EACzC;AAAA,EACA;AAAA,EACA,YAAY,OAAO,aAAa;AAC5B,UAAM;AACN,SAAK,SAAS;AACd,SAAK,eAAe;AAAA,EACxB;AAAA,EACA,aAAa,kBAAkB,OAAO;AAClC,WAAO;AAAA,MACH,CAAC,OAAO,aAAa,IAAI;AACrB,eAAO;AAAA,UACH,MAAM,OAAO;AACT,mBAAO,EAAE,MAAM,MAAM,OAAO,OAAU;AAAA,UAC1C;AAAA,QACJ;AAAA,MACJ;AAAA,IACJ;AAAA,EACJ;AAAA,EACA,WAAW;AACP,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,iBAAiB;AACb,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,yBAAyB;AACrB,WAAO,CAAC;AAAA,EACZ;AAAA,EACA,OAAO,cAAc;AACjB,WAAO;AAAA,EACX;AACJ;AACA,SAAS,qBAAqB,aAAa;AAEvC,MAAI,CAAC,YAAY,SAAS,eAAe,GAAG;AAExC,QAAI,YAAY,WAAW,KAAK,YAAY,CAAC,MAAM,OAAO;AACtD,kBAAY,KAAK,eAAe;AAAA,IACpC;AAAA,EACJ;AACA,MAAI,CAAC,YAAY,SAAS,KAAK,GAAG;AAC9B,gBAAY,KAAK,KAAK;AAAA,EAC1B;AACJ;AAIA,UAAU,uBAAuBA,SAAQ;AACrC,QAAM,4BAA4BA,QAAO,uBAAuB,EAAE;AAClE,QAAM,oBAAoBA,QAAO,eAAe;AAChD,WAAS,IAAI,GAAG,KAAK,2BAA2B,KAAK;AACjD,UAAM,kBAAkB,MAAM,CAAC;AAAA,EACnC;AACJ;AACA,IAAM,gBAAN,MAAM,uBAAsB,YAAY;AAAA,EACpC;AAAA,EACA;AAAA,EACA;AAAA,EACA,YAAYA,SAAQ,aAAa;AAC7B,UAAM;AACN,SAAK,UAAUA;AACf,SAAK,eAAe;AACpB,yBAAqB,KAAK,YAAY;AAGtC,UAAM,oBAAoBA,QAAO,eAAe;AAChD,UAAM,sBAAsB,MAAM,KAAK,uBAAuBA,OAAM,CAAC;AACrE,QAAI,CAAC,oBAAoB,KAAK,CAACG,yBAAwB,iBAAiBA,sBAAqB,WAAW,CAAC,GAAG;AACxG,YAAM,IAAI,MAAM,yEAAyE,KAAK,UAAU,WAAW,CAAC,KAAK,KAAK,UAAU,iBAAiB,CAAC,KAAKH,QAAO,uBAAuB,EAAE,MAAM,mBAAmB;AAAA,IAC5N;AACA,SAAK,gBAAgBA,QAChB,uBAAuB,EACvB,MAAM,GAAG,kBAAkB,SAAS,YAAY,MAAM;AAAA,EAC/D;AAAA,EACA,WAAW;AACP,WAAO,KAAK,QAAQ,SAAS;AAAA,EACjC;AAAA,EACA,yBAAyB;AACrB,WAAO,KAAK,QACP,uBAAuB,EACvB,MAAM,KAAK,cAAc,MAAM;AAAA,EACxC;AAAA,EACA,iBAAiB;AACb,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,aAAa,iBAAiB,OAAO;AACjC,UAAM,WAAW,KAAK,QAAQ,aAAa,cAAc;AACzD,UAAM,eAAe,KAAK;AAC1B,WAAO;AAAA,MACH,CAAC,OAAO,aAAa,IAAI;AACrB,cAAM,WAAW,SAAS,OAAO,aAAa,EAAE;AAChD,eAAO;AAAA,UACH,MAAM,OAAO;AACT,kBAAM,SAAS,MAAM,SAAS,KAAK;AACnC,gBAAI,OAAO,MAAM;AACb,qBAAO;AAAA,YACX;AACA,kBAAM,CAAC,KAAK,UAAU,SAAS,IAAI,OAAO;AAC1C,mBAAO;AAAA,cACH,MAAM;AAAA,cACN,OAAO,CAAC,KAAK,SAAS,MAAM,aAAa,MAAM,GAAG,SAAS;AAAA,YAC/D;AAAA,UACJ;AAAA,QACJ;AAAA,MACJ;AAAA,IACJ;AAAA,EACJ;AAAA,EACA,OAAO,aAAa;AAChB,WAAO,IAAI,eAAc,KAAK,QAAQ,OAAO;AAAA,MACzC,YAAY,CAAC,GAAG,KAAK,eAAe,GAAG,YAAY,UAAU;AAAA,MAC7D,qBAAqB,YAAY;AAAA,MACjC,YAAY,CAAC,GAAG,KAAK,eAAe,GAAG,YAAY,UAAU;AAAA,MAC7D,qBAAqB,YAAY;AAAA,IACrC,CAAC,GAAG,KAAK,YAAY;AAAA,EACzB;AACJ;AACA,IAAM,iBAAN,MAAM,wBAAuB,YAAY;AAAA,EACrC;AAAA,EACA;AAAA,EACA;AAAA,EACA,YAAYA,SAAQ,qBAAqB;AACrC,UAAM;AACN,SAAK,UAAUA;AACf,SAAK,uBAAuB;AAE5B,QAAI,4BAA4B;AAChC,eAAW,uBAAuB,uBAAuBA,OAAM,GAAG;AAC9D,YAAM,SAAS,oBAAoB,MAAM,GAAG,oBAAoB,MAAM;AACtE,UAAI,iBAAiB,QAAQ,mBAAmB,GAAG;AAC/C,cAAM,iBAAiBA,QAAO,eAAe,EAAE,SAAS,oBAAoB;AAC5E,oCAA4B,iBAAiB,oBAAoB;AACjE;AAAA,MACJ;AAAA,IACJ;AACA,QAAI,8BAA8B,QAAW;AACzC,YAAM,IAAI,MAAM,+EAA+E,KAAK,UAAU,mBAAmB,CAAC,KAAK,KAAK,UAAUA,QAAO,eAAe,CAAC,CAAC,KAAKA,QAAO,uBAAuB,EAAE,MAAM,mBAAmB;AAAA,IAChP;AACA,SAAK,6BAA6B;AAAA,EACtC;AAAA,EACA,aAAa,iBAAiB,OAAO;AACjC,UAAMA,UAAS,KAAK;AACpB,UAAM,4BAA4B,KAAK;AACvC,WAAO;AAAA,MACH,CAAC,OAAO,aAAa,IAAI;AACrB,YAAI,gBAAgBA;AACpB,YAAI,kBAAkB,cACjB,aAAa,cAAc,EAAE,OAAO,aAAa,EAAE;AACxD,eAAO;AAAA,UACH,MAAM,OAAO;AACT,kBAAM,SAAS,MAAM,gBAAgB,KAAK;AAC1C,gBAAI,OAAO,MAAM;AACb,qBAAO,EAAE,MAAM,MAAM,OAAO,OAAU;AAAA,YAC1C;AACA,kBAAM,CAAC,KAAK,UAAU,SAAS,IAAI,OAAO;AAC1C,gBAAI,QAAQ,MAAM;AAMd,qBAAO;AAAA,gBACH,MAAM;AAAA,gBACN,OAAO,CAAC,MAAM,UAAU,SAAS;AAAA,cACrC;AAAA,YACJ;AACA,kBAAM,mBAAmB,SAAS,MAAM,GAAG,yBAAyB;AACpE,gBAAIA,QAAO,SAAS,MAAM,OAAO;AAC7B,8BAAgB,cAAc,OAAO;AAAA,gBACjC,YAAY;AAAA,gBACZ,qBAAqB;AAAA,gBACrB,YAAY,CAAC;AAAA,gBACb,qBAAqB;AAAA,cACzB,CAAC;AAAA,YACL,OACK;AACD,8BAAgB,cAAc,OAAO;AAAA,gBACjC,YAAY,CAAC;AAAA,gBACb,qBAAqB;AAAA,gBACrB,YAAY;AAAA,gBACZ,qBAAqB;AAAA,cACzB,CAAC;AAAA,YACL;AACA,8BAAkB,cACb,aAAa,cAAc,EAAE,OAAO,aAAa,EAAE;AACxD,mBAAO;AAAA,UACX;AAAA,QACJ;AAAA,MACJ;AAAA,IACJ;AAAA,EACJ;AAAA,EACA,OAAO,aAAa;AAChB,UAAM,oBAAoB;AAAA,MACtB,GAAG;AAAA,MACH,YAAY,YAAY,WAAW,MAAM,GAAG,KAAK,0BAA0B;AAAA,MAC3E,YAAY,YAAY,WAAW,MAAM,GAAG,KAAK,0BAA0B;AAAA,IAC/E;AACA,WAAO,IAAI,gBAAe,KAAK,QAAQ,OAAO,iBAAiB,GAAG,KAAK,oBAAoB;AAAA,EAC/F;AAAA,EACA,WAAW;AACP,WAAO,KAAK,QAAQ,SAAS;AAAA,EACjC;AAAA,EACA,iBAAiB;AACb,WAAO,KAAK,QAAQ,eAAe;AAAA,EACvC;AAAA,EACA,yBAAyB;AACrB,WAAO,KAAK,QAAQ,uBAAuB;AAAA,EAC/C;AACJ;AACA,SAAS,iBAAiB,cAAc,cAAc;AAClD,MAAI,aAAa,WAAW,aAAa,QAAQ;AAC7C,WAAO;AAAA,EACX;AACA,WAAS,IAAI,GAAG,IAAI,aAAa,QAAQ,KAAK;AAC1C,QAAI,aAAa,CAAC,MAAM,aAAa,CAAC,GAAG;AACrC,aAAO;AAAA,IACX;AAAA,EACJ;AACA,SAAO;AACX;AACA,SAAS,gBAAgBI,IAAG,OAAO;AAC/B,MAAI,SAASA,GAAE,QAAQ;AACnB,WAAO;AAAA,EACX;AACA,SAAO,EAAE,MAAM,SAAS,OAAOA,GAAE,KAAK,EAAE;AAC5C;AACA,SAAS,sBAAsB,gBAAgB,eAAe,YAAY,WAAW;AACjF,MAAI,mBAAmB,WAAW,kBAAkB,SAAS;AACzD,UAAM,IAAI,MAAM,wCAAwC,KAAK,UAAU,WAAW,KAAK,CAAC,KAAK,KAAK,UAAU,UAAU,KAAK,CAAC,EAAE;AAAA,EAClI;AACA,MAAI,mBAAmB,SAAS;AAC5B,UAAM,IAAI,MAAM,qCAAqC,KAAK,UAAU,WAAW,KAAK,CAAC,KAAK,KAAK,UAAU,UAAU,KAAK,CAAC,EAAE;AAAA,EAC/H;AACA,MAAI,mBAAmB,iBAAiB,kBAAkB,aAAa;AAEnE,WAAO;AAAA,EACX;AACA,MAAI,mBAAmB,eAAe,kBAAkB,eAAe;AAEnE,WAAO;AAAA,EACX;AACA,MAAI,mBAAmB,iBAAiB,kBAAkB,eAAe;AAErE,WAAO;AAAA,EACX;AACA,MAAI,mBAAmB,eAAe,kBAAkB,aAAa;AAEjE,WAAO;AAAA,EACX;AACA,MAAI,mBAAmB,iBAAiB,kBAAkB,SAAS;AAC/D,WAAO;AAAA,EACX;AACA,MAAI,mBAAmB,eAAe,kBAAkB,SAAS;AAC7D,WAAO;AAAA,EACX;AACA,QAAM,IAAI,MAAM,yBAAyB,cAAc,KAAK,aAAa,EAAE;AAC/E;AACA,SAAS,YAAY,MAAM,MAAM;AAC7B,MAAI,IAAI;AACR,SAAO,IAAI,KAAK,IAAI,KAAK,MAAM,QAAQ,KAAK,MAAM,MAAM,GAAG;AACvD,UAAM,KAAK,gBAAgB,KAAK,OAAO,CAAC;AACxC,UAAM,KAAK,gBAAgB,KAAK,OAAO,CAAC;AACxC,QAAI,OAAO,QAAW;AAClB,aAAO,sBAAsB,KAAK,MAAM,KAAK,MAAM,MAAM,IAAI;AAAA,IACjE;AACA,QAAI,OAAO,QAAW;AAClB,aAAO,KAAK,sBAAsB,KAAK,MAAM,KAAK,MAAM,MAAM,IAAI;AAAA,IACtE;AACA,UAAM,SAAS,cAAc,GAAG,OAAO,GAAG,KAAK;AAC/C,QAAI,WAAW,GAAG;AACd,aAAO;AAAA,IACX;AAEA;AAAA,EACJ;AACA,MAAI,KAAK,SAAS,KAAK,MAAM;AACzB,WAAO;AAAA,EACX;AAEA,MAAI,KAAK,SAAS,SAAS;AACvB,QAAI,KAAK,SAAS,aAAa;AAC3B,aAAO;AAAA,IACX,OACK;AACD,aAAO;AAAA,IACX;AAAA,EACJ;AACA,MAAI,KAAK,SAAS,eAAe;AAC7B,WAAO;AAAA,EACX;AACA,MAAI,KAAK,SAAS,aAAa;AAC3B,WAAO;AAAA,EACX;AAGA,QAAM,IAAI,MAAM,wBAAwB,KAAK,IAAI,EAAE;AACvD;AACA,SAAS,gBAAgB,KAAK;AAC1B,SAAO,KAAK,UAAU,aAAa,IAAI,IAAI,CAACA,OAAMA,OAAM,SAClD,cACA,OAAOA,OAAM,YAAYA,GAAE,SAAS,WAAW;AAAA;AAAA;AAAA,IAGzC,MAAMA;AAAA,MACRA,EAAC,CAAC,CAAC;AACjB;AACA,SAAS,kBAAkB,QAAQ;AAC/B,SAAO,aAAa,KAAK,MAAM,MAAM,CAAC,EAAE,IAAI,CAACA,OAAM;AAC/C,QAAI,OAAOA,OAAM,UAAU;AACvB,UAAIA,OAAM,aAAa;AAInB,eAAO;AAAA,MACX;AACA,UAAIA,GAAE,SAAS,WAAW,GAAG;AAKzB,eAAOA,GAAE,MAAM,CAAC;AAAA,MACpB;AAAA,IACJ;AACA,WAAOA;AAAA,EACX,CAAC;AACL;;;ACx3CO,IAAM,gBAAgB,CAC3B,kBACA,OACA,UACY;AACZ,QAAM,SAAS,iBAAiB,KAAK,GAAG;AACxC,MAAI,CAAC,QAAQ;AACX,WAAO;AAAA,EACT;AACA,SAAO,OAAO,QAAQ,MAAM,EACzB,OAAO,CAAC,CAAC,EAAE,KAAK,MAAM,MAAM,MAAM,EAClC,IAAI,CAAC,CAAC,GAAG,MAAM,GAAG,EAClB,SAAS,KAAK;AACnB;AAEO,IAAM,kBAAkB,CAC7B,kBACA,OACA,UACY;AACZ,aAAW,SAAS,OAAO,KAAK,KAAK,GAAG;AACtC,QAAI,cAAc,kBAAkB,OAAO,KAAK,GAAG;AACjD,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;AAEO,IAAM,YAAY,CACvB,QACA,SACG;AACH,OACG,KAAK,OAAO,UAAU,KAAK,KAC5B,KAAK,OAAO,KAAK,CAAC,MAAM,EAAE,cAAc,IAAI,GAC5C;AACA,UAAM,IAAI;AAAA,MACR,mIAAmI,KAAK,UAAU,KAAK,KAAK,CAAC;AAAA,IAC/J;AAAA,EACF;AACA,QAAM,QAAQ,KAAK,OAAO,OAAO,CAAC,MAAM;AACtC,YACG,CAAC,EAAE,YACF,CAAC,MAAM,MAAM,OAAO,MAAM,MAAM,OAAO,QAAQ,EAAE;AAAA,MAC/C,EAAE;AAAA,IACJ,MACF,EAAE,UAAU;AAAA,EAEhB,CAAC;AACD,MAAI,CAAC,OAAO,UAAU,CAAC,KAAK,QAAQ;AAClC;AAAA,EACF;AACA,QAAM,cACJ,OAAO,OAAO,CAAC,MAAM,EAAE,aAAa,QAAQ,EAAE,aAAa,KAAK,KAAK,CAAC;AACxE,MAAI,YAAY,SAAS,GAAG;AAC1B,UAAM,IAAI;AAAA,MACR,uDAAuD,KAAK,UAAU,KAAK,CAAC;AAAA,IAC9E;AAAA,EACF;AACA,QAAM,cACJ,OAAO,OAAO,CAAC,MAAM,EAAE,aAAa,QAAQ,EAAE,aAAa,KAAK,KAAK,CAAC;AACxE,MAAI,YAAY,SAAS,GAAG;AAC1B,UAAM,IAAI;AAAA,MACR,uDAAuD,KAAK,UAAU,KAAK,CAAC;AAAA,IAC9E;AAAA,EACF;AACA,QAAM,aAAa,YAAY,CAAC;AAChC,QAAM,aAAa,YAAY,CAAC;AAChC,MAAI,cAAc,cAAc,WAAW,UAAU,WAAW,OAAO;AACrE,UAAM,IAAI;AAAA,MACR,yDAAyD,KAAK,UAAU,KAAK,CAAC;AAAA,IAChF;AAAA,EACF;AACA,QAAM,aAAa,YAAY,SAAS,YAAY;AACpD,MACE,cACA,OAAO;AAAA,IACL,CAAC,MAAM,EAAE,UAAU,cAAc,MAAM,cAAc,MAAM;AAAA,EAC7D,GACA;AACA,UAAM,IAAI;AAAA,MACR,8CAA8C,KAAK,UAAU,KAAK,CAAC;AAAA,IACrE;AAAA,EACF;AACA,QAAM,gBACJ,OACI,OAAO,CAAC,MAAM,CAAC,EAAE,YAAY,EAAE,aAAa,IAAI,EACjD,KAAK,CAAC,GAAG,MAAM;AACd,WAAO,EAAE,MAAM,cAAc,EAAE,KAAK;AAAA,EACtC,CAAC,EACA,IAAI,CAAC,MAAM,CAAC,EAAE,OAAO,EAAE,KAAK,CAAC,KAAK,CAAC;AACxC,MAAI,CAAC,eAAe,UAAU,CAAC,cAAc,CAAC,KAAK,QAAQ;AACzD;AAAA,EACF;AACA,QAAM,QAAQ,OAAO,OAAO,KAAK,KAAmC;AACpE,MAAI,CAAC,OAAO;AACV,UAAM,IAAI,MAAM,SAAS,KAAK,KAAK,YAAY;AAAA,EACjD;AACA,QAAM,UAAU,MAAM,UAAU,EAAE;AAClC,QAAM,YAAY,KAAK,QAAQ;AAG/B,QAAM,cAAc,cACjB,IAAI,CAAC,CAAC,KAAK,MAAM,KAAK,EACtB;AAAA,IACC,cAAc,eAAe,cACzB,GAAG,cAAc,SAAS,MAAM,EAAE,GAAG,UAAU,KAC/C;AAAA,EACN,EACC;AAAA,IACC,aAAa,cAAc,eAAe,eAAe,YACrD,GAAG,cAAc,UAAU,aAAa,MAAM,EAAE,GAAG,SAAS,KAC5D;AAAA,EACN,EACC,OAAO,OAAO;AACjB,MAAI,CAAC,YAAY,UAAU,CAAC,cAAc,CAAC,WAAW;AACpD;AAAA,EACF;AAGA,QAAM,QAAQ,CAAC,YAAY,SACvB;AAAA,IACE,QAAQ,CAAC;AAAA,IACT,iBAAiB;AAAA,EACnB,IACA,QAAQ,KAAK,CAAC,EAAE,OAAO,MAA4B;AACjD,UAAM,cAAc,YAAY;AAAA,MAC9B,CAAC,OAAO,QAAQ,UAAU,OAAO,GAAG;AAAA,IACtC;AAGA,UAAM,kBACJ,eAAe,eAAe,cAAc,cACxC,YAAY,WAAW,OAAO,SAC9B;AACN,WAAO,eAAe;AAAA,EACxB,CAAC;AACL,MAAI,CAAC,OAAO;AACV,WAAO,EAAE,YAAY;AAAA,EACvB;AACA,SAAO;AAAA,IACL;AAAA,IACA,OAAO;AAAA,MACL,QAAQ,CAAC,GAAG,MAAM,QAAQ,eAAe;AAAA,MACzC,iBAAiB,MAAM;AAAA,IACzB;AAAA,IACA;AAAA,IACA,QAAQ;AAAA,MACN,IAAI,cAAc,IAAI,CAAC,CAAC,EAAE,KAAK,MAAM,KAAK;AAAA,MAC1C,IAAI,YAAY,aAAa,OAAO,WAAW,QAAQ;AAAA,MACvD,KAAK,YAAY,aAAa,QAAQ,WAAW,QAAQ;AAAA,MACzD,IAAI,YAAY,aAAa,OAAO,WAAW,QAAQ;AAAA,MACvD,KAAK,YAAY,aAAa,QAAQ,WAAW,QAAQ;AAAA,IAC3D;AAAA,EACF;AACF;AAEO,IAAM,oBAAoB,OAG/B,KACA,QACA,kBACA,OACA,OACA,QACG;AACH,MAAI,CAAC,gBAAgB,kBAAkB,OAAO,KAAK,GAAG;AACpD;AAAA,EACF;AACA,aAAW,SAAS,OAAO,KAAK,KAAK,GAAG;AACtC,QAAI,CAAC,cAAc,kBAAkB,OAAO,KAAK,GAAG;AAClD;AAAA,IACF;AACA,UAAM,EAAE,MAAM,IACZ,UAAU,QAAQ;AAAA,MAChB,OAAO;AAAA,MACP,OAAO,CAAC,EAAE,OAAO,UAAU,MAAM,OAAO,MAAM,KAAK,EAAE,CAAC;AAAA,IACxD,CAAC,KAAK,CAAC;AACT,QAAI,CAAC,OAAO;AACV,YAAM,IAAI,MAAM,sBAAsB,KAAK,IAAI,KAAK,EAAE;AAAA,IACxD;AACA,UAAM,cAAc,MAAM,IAAI,GAC3B,MAAM,KAAY,EAClB,UAAU,MAAM,iBAAiB,CAAC,MAAM,EAAE,GAAG,OAAO,MAAM,KAAK,CAAC,CAAC,EACjE,OAAO;AACV,QAAI,eAAe,YAAY,QAAQ,KAAK,KAAK;AAC/C,YAAM,IAAI,MAAM,GAAG,KAAK,IAAI,KAAK,iBAAiB;AAAA,IACpD;AAAA,EACF;AACF;AAEO,IAAM,eAAe,CAI1B,KACAC,YACa;AACb,MAAI,CAAC,KAAK;AACR,WAAO;AAAA,EACT;AACA,MAAI,CAACA,SAAQ,QAAQ;AACnB,WAAO;AAAA,EACT;AACA,SAAOA,QAAO,OAAO,CAAC,KAAK,UAAU;AACnC,IAAC,IAAY,KAAK,IAAI,IAAI,KAAK;AAC/B,WAAO;AAAA,EACT,GAAG,CAAC,CAAM;AACZ;AAEO,IAAM,gBAAgB,CAI3B,KACA,OAEA,gBACY;AACZ,MAAI,CAAC,KAAK;AACR,WAAO;AAAA,EACT;AACA,aAAW,KAAK,SAAS,CAAC,GAAG;AAC3B,QAAI,eAAe,CAAC,YAAY,CAAC,GAAG;AAClC;AAAA,IACF;AACA,UAAM,QAAQ,IAAI,EAAE,KAAyB;AAC7C,UAAM,aAAa,CAAC,KAAmB,SAAyB;AAC9D,UAAI,CAAC,MAAM;AACT,eAAO;AAAA,MACT;AACA,UAAI,CAAC,KAAK;AACR,eAAO;AAAA,MACT;AACA,aAAO,MAAM;AAAA,IACf;AACA,UAAM,gBAAgB,CAAC,KAAmB,SAAyB;AACjE,UAAI,CAAC,KAAK;AACR,eAAO;AAAA,MACT;AACA,UAAI,CAAC,MAAM;AACT,eAAO;AAAA,MACT;AACA,aAAO,MAAM;AAAA,IACf;AACA,UAAM,SAAS,CAACC,OAAmB;AACjC,cAAQA,GAAE,UAAU;AAAA,QAClB,KAAK,YAAY;AACf,iBAAO,OAAO,UAAU,YAAY,MAAM,SAASA,GAAE,KAAe;AAAA,QACtE;AAAA,QACA,KAAK,aAAa;AAChB,iBAAO,OAAO,UAAU,YAAY,MAAM,SAASA,GAAE,KAAe;AAAA,QACtE;AAAA,QACA,KAAK;AAAA,QACL,KAAK,QAAW;AACd,iBAAO,UAAUA,GAAE;AAAA,QACrB;AAAA,QACA,KAAK,MAAM;AACT,iBAAO,cAAc,OAAOA,GAAE,KAAK;AAAA,QACrC;AAAA,QACA,KAAK,OAAO;AACV,iBAAO,UAAUA,GAAE,SAAS,cAAc,OAAOA,GAAE,KAAK;AAAA,QAC1D;AAAA,QACA,KAAK,MAAM;AACT,iBAAO,MAAM,QAAQA,GAAE,KAAK,KAAMA,GAAE,MAAgB,SAAS,KAAK;AAAA,QACpE;AAAA,QACA,KAAK,MAAM;AACT,iBAAO,WAAW,OAAOA,GAAE,KAAK;AAAA,QAClC;AAAA,QACA,KAAK,OAAO;AACV,iBAAO,UAAUA,GAAE,SAAS,WAAW,OAAOA,GAAE,KAAK;AAAA,QACvD;AAAA,QACA,KAAK,MAAM;AACT,iBAAO,UAAUA,GAAE;AAAA,QACrB;AAAA,QACA,KAAK,UAAU;AACb,iBAAO,MAAM,QAAQA,GAAE,KAAK,KAAK,CAAEA,GAAE,MAAgB,SAAS,KAAK;AAAA,QACrE;AAAA,QACA,KAAK,eAAe;AAClB,iBACE,OAAO,UAAU,YAAY,MAAM,WAAWA,GAAE,KAAe;AAAA,QAEnE;AAAA,MACF;AAAA,IACF;AACA,QAAI,CAAC,OAAO,CAAC,GAAG;AACd,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;AAEA,IAAM,gBAAgB,CACpB,KACA,QACA,SACG;AACH,QAAM,EAAE,YAAY,OAAO,aAAa,OAAO,IAC7C,UAAU,QAAQ,IAAI,KAAK,CAAC;AAC9B,QAAM,QAAQ,OAAO,IAAI,IAAW,MAAM,EAAE,MAAM,KAAK,KAAY;AACnE,QAAM,YACJ,QAAQ,IAAI,UACZ,QAAQ,MACR,QAAQ,OACR,QAAQ,MACR,QAAQ;AACV,QAAM,eACJ,SAAS,MAAM,oBAAoB,qBAC/B,MAAM;AAAA,IACJ,MAAM;AAAA,IACN,YACI,CAAC,MAAW;AACV,iBAAW,CAAC,KAAK,KAAK,MAAM,QAAQ,MAAM,CAAC,GAAG,QAAQ,GAAG;AACvD,YAAI,EAAE,GAAG,MAAM,OAAO,GAAG,GAAG,KAAK;AAAA,MACnC;AACA,UAAI,QAAQ,IAAI;AACd,YAAI,EAAE,GAAG,YAAY,OAAO,EAAE;AAAA,MAChC;AACA,UAAI,QAAQ,KAAK;AACf,YAAI,EAAE,IAAI,YAAY,OAAO,GAAG;AAAA,MAClC;AACA,UAAI,QAAQ,IAAI;AACd,YAAI,EAAE,GAAG,YAAY,OAAO,EAAE;AAAA,MAChC;AACA,UAAI,QAAQ,KAAK;AACf,YAAI,EAAE,IAAI,YAAY,OAAO,GAAG;AAAA,MAClC;AACA,aAAO;AAAA,IACT,IACA;AAAA,EACN,IACA;AACN,QAAM,eAAe,KAAK,SACtB,aAAa,MAAM,KAAK,OAAO,cAAc,SAAS,SAAS,KAAK,IACpE;AACJ,QAAM,gBAAgB,aAAa,WAAW,OAAO,QAAQ;AAC3D,QAAI,CAAC,SAAS,aAAa,QAAQ;AACjC,cAAQ;AAAA,QACN,uCAAuC,KAAK,KAAK;AAAA;AAAA;AAAA,GAG3C,YAAY,KAAK,IAAI,CAAC;AAAA,MAC9B;AAEA,aAAO,cAAc,KAAK,KAAK,KAAK;AAAA,IACtC;AACA,WAAO;AAAA,MACL;AAAA,MACA,KAAK;AAAA;AAAA;AAAA,MAGL,CAAC,MACC,EAAE,YACF,CAAC,YAAY,aAAa,MAAM,UAAU,aAAa,EAAE;AAAA,QACvD,EAAE;AAAA,MACJ;AAAA,IACJ;AAAA,EACF,CAAC;AACD,SAAO;AACT;AAEO,IAAM,WAAW,OAItB,KACA,QACA,kBACA,SAGmC;AACnC,MAAI,KAAK,QAAQ;AACf,UAAM,IAAI,MAAM,yBAAyB,KAAK,UAAU,KAAK,MAAM,CAAC,EAAE;AAAA,EACxE;AACA,MAAI,KAAK,OAAO,KAAK,CAAC,MAAM,EAAE,cAAc,IAAI,KAAK,KAAK,OAAO,SAAS,GAAG;AAC3E,UAAM,IAAI;AAAA,MACR,iIAAiI,KAAK,UAAU,KAAK,KAAK,CAAC;AAAA,IAC7J;AAAA,EACF;AACA,MACE,KAAK,OAAO;AAAA,IACV,CAAC,MACC,EAAE,UAAU,SACZ,EAAE,YACF,CAAC,CAAC,MAAM,MAAM,QAAQ,EAAE,SAAS,EAAE,QAAQ;AAAA,EAC/C,GACA;AACA,UAAM,IAAI;AAAA,MACR,yDAAyD,KAAK,UAAU,KAAK,KAAK,CAAC;AAAA,IACrF;AAAA,EACF;AAIA,QAAM,cAAc,KAAK,OAAO;AAAA,IAC9B,CAAC,OACE,CAAC,EAAE,YAAY,EAAE,aAAa,UAC9B,cAAc,kBAAkB,KAAK,OAAO,EAAE,KAAK,KAClD,EAAE,UAAU;AAAA,EAClB;AACA,MAAI,aAAa;AACf,UAAM,EAAE,MAAM,IACZ,UAAU,QAAQ;AAAA,MAChB,OAAO,KAAK;AAAA,MACZ,OAAO,CAAC,WAAW;AAAA,IACrB,CAAC,KAAK,CAAC;AAET,QAAI;AACJ,QAAI,YAAY,UAAU,OAAO;AAC/B,YAAM,MAAM,IAAI,GAAG,IAAI,YAAY,KAAqB;AAAA,IAC1D,WAAW,OAAO,iBAAiB;AACjC,YAAM,MAAM,IAAI,GACb,MAAM,KAAK,KAAY,EACvB;AAAA,QAAU,MAAM;AAAA,QAAiB,CAAC,MACjC,EAAE,GAAG,MAAM,OAAO,CAAC,GAAG,YAAY,KAAK;AAAA,MACzC,EACC,OAAO;AAAA,IACZ,OAAO;AAEL,YAAM,UAAU,MAAM,IAAI,GAAG,MAAM,KAAK,KAAY,EAAE,QAAQ;AAC9D,YACE,QAAQ,KAAK,CAAC,MAAW,EAAE,YAAY,KAAK,MAAM,YAAY,KAAK,KACnE;AAAA,IACJ;AAGA,QAAI,cAAc,KAAK,KAAK,OAAO,CAAC,MAAM,MAAM,WAAW,GAAG;AAC5D,aAAO;AAAA,QACL,gBAAgB;AAAA,QAChB,QAAQ;AAAA,QACR,MAAM,CAAC,aAAa,KAAK,KAAK,MAAM,CAAC,EAAE,OAAO,OAAO;AAAA,MACvD;AAAA,IACF;AACA,WAAO;AAAA,MACL,gBAAgB;AAAA,MAChB,QAAQ;AAAA,MACR,MAAM,CAAC;AAAA,IACT;AAAA,EACF;AAEA,QAAM,iBAAiB;AAAA,IACrB,GAAG,KAAK;AAAA;AAAA;AAAA,IAGR,iBAAiB,KAAK,KAAK,KAAK,eAAe,YAAY,KAAK,GAAG,GAAG;AAAA,EACxE;AAMA,QAAM,UAAU,KAAK,OAAO,KAAK,CAAC,MAAM,EAAE,aAAa,IAAI;AAC3D,MAAI,SAAS;AACX,QAAI,CAAC,MAAM,QAAQ,QAAQ,KAAK,GAAG;AACjC,YAAM,IAAI,MAAM,kCAAkC;AAAA,IACpD;AAEA,QAAI,QAAQ,UAAU,OAAO;AAC3B,YAAM,OAAO,MAAM,SAAS,QAAQ,OAAgB,OAAO,UAAU;AACnE,eAAO,IAAI,GAAG,IAAI,KAAqB;AAAA,MACzC,CAAC;AACD,YAAM,eAAe,KAClB,QAAQ,CAAC,QAAS,MAAM,CAAC,GAAG,IAAI,CAAC,CAAE,EACnC,OAAO,CAAC,QAAQ,cAAc,KAAK,KAAK,OAAO,CAAC,MAAM,MAAM,OAAO,CAAC;AAEvE,aAAO;AAAA,QACL,gBAAgB;AAAA,QAChB,QAAQ;AAAA,QACR,MAAM,aAAa,KAAK,CAAC,GAAG,MAAM;AAChC,cAAI,KAAK,QAAQ,UAAU,aAAa;AACtC,mBAAO,KAAK,OAAO,cAAc,QAC5B,EAAE,gBAA4B,EAAE,gBAChC,EAAE,gBAA4B,EAAE;AAAA,UACvC;AACA,cAAI,KAAK,QAAQ;AACf,kBAAM,SAAS,EAAE,KAAK,OAAO,KAAK;AAClC,kBAAM,SAAS,EAAE,KAAK,OAAO,KAAK;AAClC,gBAAI,WAAW,QAAQ;AACrB,qBAAO;AAAA,YACT;AACA,mBAAO,KAAK,OAAO,cAAc,QAC7B,SAAU,SACR,IACA,KACF,SAAU,SACR,KACA;AAAA,UACR;AACA,iBAAO;AAAA,QACT,CAAC;AAAA,MACH;AAAA,IACF;AACA,UAAM,UAAU,QAAQ,MAAM,IAAI,CAAC,UAAU;AAC3C,aAAO,cAAc,KAAK,QAAQ;AAAA,QAChC,GAAG;AAAA,QACH,OAAO,KAAK,OAAO,IAAI,CAAC,MAAM;AAC5B,cAAI,MAAM,SAAS;AACjB,mBAAO,EAAE,GAAG,GAAG,UAAU,MAAe,MAAM;AAAA,UAChD;AACA,iBAAO;AAAA,QACT,CAAC;AAAA,MACH,CAAC;AAAA,IACH,CAAC;AACD,UAAMC,UAAS,MAAM;AAAA,MACnB;AAAA,MACA;AAAA,QACE,KAAK,QAAQ,UAAU,eAAe,KAAK,QAAQ;AAAA,QACnD;AAAA,MACF,EAAE,QAAQ,CAAC,MAAO,IAAI,CAAC,CAAC,IAAI,CAAC,CAAE;AAAA,IACjC,EAAE,SAAS,cAAc;AACzB,WAAO;AAAA,MACL,GAAGA;AAAA,MACH,MAAM,MAAM;AAAA,QAASA,QAAO;AAAA,QAAM,CAAC,QACjC,aAAa,KAAK,KAAK,MAAM;AAAA,MAC/B;AAAA,IACF;AAAA,EACF;AAEA,QAAM,QAAQ,cAAc,KAAK,QAAQ,IAAI;AAC7C,QAAM,SAAS,MAAM,MAAM,SAAS,cAAc;AAClD,SAAO;AAAA,IACL,GAAG;AAAA,IACH,MAAM,MAAM,SAAS,OAAO,MAAM,CAAC,QAAQ,aAAa,KAAK,KAAK,MAAM,CAAC;AAAA,EAC3E;AACF;AAEO,IAAM,UAAU,OAIrB,KACA,QACA,kBACA,SACwB;AACxB,UACE,MAAM,SAAS,KAAK,QAAQ,kBAAkB;AAAA,IAC5C,GAAG;AAAA,IACH,gBAAgB;AAAA,MACd,QAAQ;AAAA,MACR,UAAU;AAAA,IACZ;AAAA,EACF,CAAC,GACD,KAAK,CAAC;AACV;;;AH3jBA,IAAM,sBAAsB,CAAC,eAA2C;AACtE,SAAO,KAAK,MAAM,UAAU;AAC9B;AASO,IAAM,SAAS;AAAA,EACpB,MAAM;AAAA,IACJ,kBAAkB,EAAE,OAAO;AAAA,IAC3B,MAAM,EAAE,IAAI;AAAA,IACZ,OAAO,EAAE,OAAO;AAAA,IAChB,QAAQ,EAAE,SAAS,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;AAAA,EACxC;AAAA,EACA,SAAS,OACP,KACA,EAAE,kBAAkB,MAAM,OAAO,QAAAC,QAAO,GACxC,WACG;AACH,UAAM,aAAa,oBAAoB,gBAAgB;AAEvD,UAAM,kBAAkB,KAAK,QAAQ,YAAY,OAAO,IAAW;AAEnE,UAAM,KAAK,MAAM,IAAI,GAAG,OAAO,OAAc,IAAW;AACxD,UAAM,MAAM,MAAM,IAAI,GAAG,IAAI,EAAE;AAC/B,QAAI,CAAC,KAAK;AACR,YAAM,IAAI,MAAM,oBAAoB,KAAK,EAAE;AAAA,IAC7C;AAEA,WAAO,aAAa,KAAKA,OAAM;AAAA,EACjC;AACF;AASO,IAAM,UAAU;AAAA,EACrB,MAAM;AAAA,IACJ,kBAAkB,EAAE,OAAO;AAAA,IAC3B,OAAO,EAAE,OAAO;AAAA,IAChB,QAAQ,EAAE,SAAS,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;AAAA,IACtC,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC;AAAA,EACxB;AAAA,EACA,SAAS,OACP,KACA,EAAE,kBAAkB,OAAO,QAAAA,SAAQ,MAAM,GACzC,WACG;AACH,UAAM,aAAa,oBAAoB,gBAAgB;AACvD,UAAM,SAAS,MAAM,QAAQ,KAAK,QAAQ,YAAY;AAAA,MACpD;AAAA,MACA,QAAAA;AAAA,MACA;AAAA,IACF,CAAC;AAED,WAAO;AAAA,EACT;AACF;AAUO,IAAM,WAAW;AAAA,EACtB,MAAM;AAAA,IACJ,kBAAkB,EAAE,OAAO;AAAA,IAC3B,OAAO,EAAE,SAAS,EAAE,OAAO,CAAC;AAAA,IAC5B,OAAO,EAAE,OAAO;AAAA,IAChB,QAAQ,EAAE;AAAA,MACR,EAAE,OAAO;AAAA,QACP,WAAW,EAAE,MAAM,EAAE,QAAQ,KAAK,GAAG,EAAE,QAAQ,MAAM,CAAC;AAAA,QACtD,OAAO,EAAE,OAAO;AAAA,MAClB,CAAC;AAAA,IACH;AAAA,IACA,OAAO,EAAE,SAAS,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;AAAA,EACpC;AAAA,EACA,SAAS,OACP,KACA,EAAE,kBAAkB,OAAO,OAAO,QAAQ,MAAM,GAChD,WACG;AACH,UAAM,aAAa,oBAAoB,gBAAgB;AACvD,UAAM,cAAe,SAAS,CAAC;AAG/B,QAAI,YAAY,KAAK,CAAC,MAAM,EAAE,cAAc,IAAI,GAAG;AACjD,YAAM,UAAU,MAAM,QAAQ;AAAA,QAC5B,YAAY,IAAI,OAAO,MAAM;AAC3B,gBAAMC,UAAS,MAAM,SAAS,KAAK,QAAQ,YAAY;AAAA,YACrD;AAAA,YACA,gBAAgB,EAAE,QAAQ,MAAM,UAAU,SAAS,IAAI;AAAA,YACvD;AAAA,YACA,OAAO,CAAC,CAAC;AAAA,UACX,CAAC;AACD,iBAAOA,QAAO;AAAA,QAChB,CAAC;AAAA,MACH;AAGA,YAAM,OAAO,oBAAI,IAAY;AAC7B,YAAM,aAAoB,CAAC;AAC3B,iBAAW,QAAQ,SAAS;AAC1B,mBAAW,OAAO,MAAM;AACtB,gBAAM,QAAQ,IAAI;AAClB,cAAI,CAAC,KAAK,IAAI,KAAK,GAAG;AACpB,iBAAK,IAAI,KAAK;AACd,uBAAW,KAAK,GAAG;AAAA,UACrB;AAAA,QACF;AAAA,MACF;AAGA,UAAI,QAAQ;AACV,mBAAW,KAAK,CAAC,GAAG,MAAM;AACxB,gBAAM,OAAO,EAAE,OAAO,KAAK;AAC3B,gBAAM,OAAO,EAAE,OAAO,KAAK;AAC3B,cAAI,SAAS,MAAM;AACjB,mBAAO;AAAA,UACT;AACA,gBAAM,aAAa,OAAO,OAAO,IAAI;AACrC,iBAAO,OAAO,cAAc,SAAS,CAAC,aAAa;AAAA,QACrD,CAAC;AAAA,MACH;AAEA,aAAO,WAAW,MAAM,GAAG,KAAK;AAAA,IAClC;AAGA,UAAM,SAAS,MAAM,SAAS,KAAK,QAAQ,YAAY;AAAA,MACrD;AAAA,MACA,gBAAgB,EAAE,QAAQ,MAAM,UAAU,SAAS,IAAI;AAAA,MACvD;AAAA,MACA,OAAO;AAAA,IACT,CAAC;AAED,WAAO,OAAO;AAAA,EAChB;AACF;AAQO,IAAM,QAAQ;AAAA,EACnB,MAAM;AAAA,IACJ,kBAAkB,EAAE,OAAO;AAAA,IAC3B,OAAO,EAAE,OAAO;AAAA,IAChB,OAAO,EAAE,SAAS,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;AAAA,EACpC;AAAA,EACA,SAAS,OACP,KACA,EAAE,kBAAkB,OAAO,MAAM,GACjC,WACG;AACH,UAAM,aAAa,oBAAoB,gBAAgB;AACvD,UAAM,cAAe,SAAS,CAAC;AAG/B,QAAI,YAAY,KAAK,CAAC,MAAM,EAAE,cAAc,IAAI,GAAG;AACjD,YAAM,UAAU,MAAM,QAAQ;AAAA,QAC5B,YAAY,IAAI,OAAO,MAAM;AAC3B,gBAAMA,UAAS,MAAM,SAAS,KAAK,QAAQ,YAAY;AAAA,YACrD;AAAA,YACA,gBAAgB,EAAE,QAAQ,MAAM,UAAU,IAAI;AAAA,YAC9C,OAAO,CAAC,CAAC;AAAA,UACX,CAAC;AACD,iBAAOA,QAAO;AAAA,QAChB,CAAC;AAAA,MACH;AAGA,YAAM,OAAO,oBAAI,IAAY;AAC7B,iBAAW,QAAQ,SAAS;AAC1B,mBAAW,OAAO,MAAM;AACtB,gBAAM,QAAQ,IAAI;AAClB,eAAK,IAAI,KAAK;AAAA,QAChB;AAAA,MACF;AACA,aAAO,KAAK;AAAA,IACd;AAGA,UAAM,SAAS,MAAM,SAAS,KAAK,QAAQ,YAAY;AAAA,MACrD;AAAA,MACA,gBAAgB,EAAE,QAAQ,MAAM,UAAU,IAAI;AAAA,MAC9C,OAAO;AAAA,IACT,CAAC;AAED,WAAO,OAAO,KAAK;AAAA,EACrB;AACF;AASO,IAAM,SAAS;AAAA,EACpB,MAAM;AAAA,IACJ,kBAAkB,EAAE,OAAO;AAAA,IAC3B,OAAO,EAAE,OAAO;AAAA,IAChB,QAAQ,EAAE,IAAI;AAAA,IACd,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC;AAAA,EACxB;AAAA,EACA,SAAS,OACP,KACA,EAAE,kBAAkB,OAAO,QAAAC,SAAQ,MAAM,GACzC,WACG;AACH,UAAM,aAAa,oBAAoB,gBAAgB;AACvD,UAAM,cAAc;AAGpB,UAAM,MAAM,MAAM,QAAQ,KAAK,QAAQ,YAAY;AAAA,MACjD;AAAA,MACA,OAAO;AAAA,IACT,CAAC;AAED,QAAI,CAAC,KAAK;AACR,aAAO;AAAA,IACT;AAGA,UAAM,kBAAkB,KAAK,QAAQ,YAAY,OAAOA,SAAe,GAAG;AAE1E,UAAM,IAAI,GAAG,MAAM,IAAI,KAAuBA,OAAa;AAC3D,WAAO,MAAM,IAAI,GAAG,IAAI,IAAI,GAAqB;AAAA,EACnD;AACF;AAGO,IAAM,aAAa;AAAA,EACxB,MAAM;AAAA,IACJ,kBAAkB,EAAE,OAAO;AAAA,IAC3B,OAAO,EAAE,OAAO;AAAA,IAChB,QAAQ,EAAE,IAAI;AAAA,IACd,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC;AAAA,EACxB;AAAA,EACA,SAAS,OACP,KACA,EAAE,kBAAkB,OAAO,QAAAA,SAAQ,MAAM,GACzC,WACG;AACH,UAAM,aAAa,oBAAoB,gBAAgB;AACvD,UAAM,cAAc;AAEpB,UAAM,SAAS,MAAM,SAAS,KAAK,QAAQ,YAAY;AAAA,MACrD;AAAA,MACA,gBAAgB,EAAE,QAAQ,MAAM,UAAU,IAAI;AAAA,MAC9C,OAAO;AAAA,IACT,CAAC;AAGD,QAAI,OAAO,KAAK,SAAS,GAAG;AAC1B,YAAM,kBAAkB,OAAO,KAAKA,OAAa,EAAE;AAAA,QACjD,CAAC,QAAQ,WAAW,KAAK,GAAG,SAAS,GAAG,GAAG;AAAA,MAC7C;AACA,UAAI,gBAAgB,SAAS,GAAG;AAC9B,cAAM,IAAI;AAAA,UACR,2DAA2D,KAAK,iCAAiC,gBAAgB,KAAK,IAAI,CAAC;AAAA,QAC7H;AAAA,MACF;AAAA,IACF;AAGA,eAAW,OAAO,OAAO,MAAM;AAC7B,YAAM;AAAA,QACJ;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACAA;AAAA,QACA;AAAA,MACF;AACA,YAAM,IAAI,GAAG,MAAM,IAAI,KAAuBA,OAAa;AAAA,IAC7D;AAEA,WAAO,OAAO,KAAK;AAAA,EACrB;AACF;AAQO,IAAM,YAAY;AAAA,EACvB,MAAM;AAAA,IACJ,kBAAkB,EAAE,OAAO;AAAA,IAC3B,OAAO,EAAE,OAAO;AAAA,IAChB,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC;AAAA,EACxB;AAAA,EACA,SAAS,OACP,KACA,EAAE,kBAAkB,OAAO,MAAM,GACjC,WACG;AACH,UAAM,aAAa,oBAAoB,gBAAgB;AACvD,UAAM,cAAc;AAEpB,UAAM,MAAM,MAAM,QAAQ,KAAK,QAAQ,YAAY;AAAA,MACjD;AAAA,MACA,OAAO;AAAA,IACT,CAAC;AAED,QAAI,CAAC,KAAK;AACR;AAAA,IACF;AAEA,UAAM,IAAI,GAAG,OAAO,IAAI,GAAqB;AAAA,EAC/C;AACF;AAGO,IAAM,aAAa;AAAA,EACxB,MAAM;AAAA,IACJ,kBAAkB,EAAE,OAAO;AAAA,IAC3B,OAAO,EAAE,OAAO;AAAA,IAChB,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC;AAAA,EACxB;AAAA,EACA,SAAS,OACP,KACA,EAAE,kBAAkB,OAAO,MAAM,GACjC,WACG;AACH,UAAM,aAAa,oBAAoB,gBAAgB;AACvD,UAAM,cAAc;AAEpB,UAAM,SAAS,MAAM,SAAS,KAAK,QAAQ,YAAY;AAAA,MACrD;AAAA,MACA,gBAAgB,EAAE,QAAQ,MAAM,UAAU,IAAI;AAAA,MAC9C,OAAO;AAAA,IACT,CAAC;AAGD,eAAW,OAAO,OAAO,MAAM;AAC7B,YAAM,IAAI,GAAG,OAAO,IAAI,GAAqB;AAAA,IAC/C;AAEA,WAAO,OAAO,KAAK;AAAA,EACrB;AACF;;;AIlWO,SAAS,cAAuE,OAKpF;AACD,SAAO,OACL,QACwB;AACxB,UAAM,WAAW,MAAM,IAAI,KAAK,gBAAgB;AAChD,QAAI,aAAa,MAAM;AACrB,aAAO,EAAE,MAAM,KAAK;AAAA,IACtB;AAEA,UAAM,OAAO,MAAM,IAAI,GAAG;AAAA,MACxB,MAAM;AAAA,MACN,SAAS;AAAA,IACX;AACA,QAAI,SAAS,MAAM;AACjB,aAAO,EAAE,KAAK;AAAA,IAChB;AAEA,QAAI,CAAC,MAAM,eAAe,CAAC,MAAM,mBAAmB;AAClD,aAAO,EAAE,KAAK;AAAA,IAChB;AACA,UAAM,oBAAoB,MAAM;AAChC,UAAM,YAAY,SAAS;AAC3B,UAAM,UAAU,YAAY,MAAM,IAAI,GAAG,IAAI,MAAM,uBAAuB,SAAS,IAAI;AACvF,UAAM,QAAQ,SAAS;AACvB,UAAM,eAAe,QACf,MAAM,IAAI,GAAG,IAAI,mBAAmB,KAAK,KAAM,SACjD;AAEJ,WAAO,EAAE,MAAM,aAAa;AAAA,EAC9B;AACF;;;ACRO,SAAS,UACd,SACA;AACA,SAAO;AAAA,IACL,UAAU,QAAQ,iBAAiB;AAAA,MACjC,GAAM;AAAA,MACN,SAAS,OAAO,KAAK,SACnB,MAAS,OAAO;AAAA,QACd;AAAA,QACA;AAAA,QACA,QAAQ;AAAA,MACV;AAAA,IACJ,CAAC;AAAA,IAED,WAAW,QAAQ,cAAc;AAAA,MAC/B,GAAM;AAAA,MACN,SAAS,OAAO,KAAK,SACnB,MAAS,QAAQ;AAAA,QACf;AAAA,QACA;AAAA,QACA,QAAQ;AAAA,MACV;AAAA,IACJ,CAAC;AAAA,IAED,YAAY,QAAQ,cAAc;AAAA,MAChC,GAAM;AAAA,MACN,SAAS,OAAO,KAAK,SACnB,MAAS,SAAS;AAAA,QAChB;AAAA,QACA;AAAA,QACA,QAAQ;AAAA,MACV;AAAA,IACJ,CAAC;AAAA,IAED,SAAS,QAAQ,cAAc;AAAA,MAC7B,GAAM;AAAA,MACN,SAAS,OAAO,KAAK,SACnB,MAAS,MAAM;AAAA,QACb;AAAA,QACA;AAAA,QACA,QAAQ;AAAA,MACV;AAAA,IACJ,CAAC;AAAA,IAED,UAAU,QAAQ,iBAAiB;AAAA,MACjC,GAAM;AAAA,MACN,SAAS,OAAO,KAAK,SACnB,MAAS,OAAO;AAAA,QACd;AAAA,QACA;AAAA,QACA,QAAQ;AAAA,MACV;AAAA,IACJ,CAAC;AAAA,IAED,cAAc,QAAQ,iBAAiB;AAAA,MACrC,GAAM;AAAA,MACN,SAAS,OAAO,KAAK,SACnB,MAAS,WAAW;AAAA,QAClB;AAAA,QACA;AAAA,QACA,QAAQ;AAAA,MACV;AAAA,IACJ,CAAC;AAAA,IAED,UAAU,QAAQ,iBAAiB;AAAA,MACjC,GAAM;AAAA,MACN,SAAS,OAAO,KAAK,SACnB,MAAS,UAAU;AAAA,QACjB;AAAA,QACA;AAAA,QACA,QAAQ;AAAA,MACV;AAAA,IACJ,CAAC;AAAA,IAED,cAAc,QAAQ,iBAAiB;AAAA,MACrC,GAAM;AAAA,MACN,SAAS,OAAO,KAAK,SACnB,MAAS,WAAW;AAAA,QAClB;AAAA,QACA;AAAA,QACA,QAAQ;AAAA,MACV;AAAA,IACJ,CAAC;AAAA,EACH;AACF;AAuBO,SAAS,wBACd,KACA;AACA,SAAO,cAAc,GAAG;AAC1B;","names":["v","getAuthTables","where","select","update","commonPrefix","index","stream","_","result","orderingIndexFields","v","select","w","result","select","result","update"]}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@vexcms/better-auth",
-  "version": "0.1.0-alpha.2",
+  "version": "0.1.0-alpha.3",
   "description": "better-auth adapter for VexCMS on Convex",
   "keywords": [
     "cms",
@@ -35,7 +35,7 @@
   "peerDependencies": {
     "better-auth": ">=1.6.23 <1.7.0",
     "convex": ">=1.44.0 <2",
-    "@vexcms/core": "^0.1.0-alpha.2"
+    "@vexcms/core": "^0.1.0-alpha.3"
   },
   "devDependencies": {
     "@types/node": "20.19.43",
@@ -47,7 +47,7 @@
     "tsup": "8.5.1",
     "typescript": "6.0.3",
     "vitest": "4.1.10",
-    "@vexcms/core": "0.1.0-alpha.2",
+    "@vexcms/core": "0.1.0-alpha.3",
     "@vexcms/tsconfig": "0.0.0"
   },
   "publishConfig": {