@querykitjs/core 1.1.0 → 2.0.0

package/dist/index.d.ts

@@ -1,75 +1,5 @@
-/**
- * Filter operatorlari — yagona runtime manba. `FilterOperator` tipi (`types.ts`)
- * shundan chiqadi; `@querykitjs/zod` shu massivdan zod enum quradi.
- */
-declare const FILTER_OPERATORS: readonly ["=", "!=", ">", ">=", "<", "<=", "eq", "ne", "gt", "gte", "lt", "lte", "like", "ilike", "notLike", "contains", "startsWith", "endsWith", "%_%", "%_", "_%", "in", "notIn", "between", "notBetween", "isNull", "isNotNull"];
-
-/**
- * `@querykitjs/core` — ORM-agnostik query DSL tiplari. Backend adapterlar
- * (`@querykitjs/drizzle-pg`) va frontend (`@querykitjs/web`) shu bir xil kontraktga
- * tayanadi. Tiplar ustun-kaliti (`TKey`) bo'yicha generic; adapterlar uni o'z
- * kalit tipiga (Drizzle jadval ustuni yoki entity maydoni) ixtisoslashtiradi.
- */
-
-/** Qo'llab-quvvatlanadigan filter operatorlari (token va nom aliaslari). */
-type FilterOperator = (typeof FILTER_OPERATORS)[number];
-type FilterScalar = string | number | boolean | Date | null;
-type FilterValue = FilterScalar | FilterScalar[];
-/** Bitta maydon sharti (`operation` default `"="`). */
-interface FieldCondition<TKey extends string = string> {
-    key: TKey;
-    operation?: FilterOperator;
-    value?: FilterValue;
-}
-interface AndGroup<TKey extends string = string, TRaw = never> {
-    and: FilterNode<TKey, TRaw>[];
-}
-interface OrGroup<TKey extends string = string, TRaw = never> {
-    or: FilterNode<TKey, TRaw>[];
-}
-interface NotGroup<TKey extends string = string, TRaw = never> {
-    not: FilterNode<TKey, TRaw>;
-}
-/**
- * Filter daraxti tuguni: maydon sharti, mantiqiy guruh, yoki adapter qo'shadigan
- * raw escape-hatch (`TRaw`, masalan Drizzle `SQL`; default `never`).
- */
-type FilterNode<TKey extends string = string, TRaw = never> = FieldCondition<TKey> | AndGroup<TKey, TRaw> | OrGroup<TKey, TRaw> | NotGroup<TKey, TRaw> | TRaw;
-/** Public filter: daraxt/tugun yoki flat massiv (implicit AND). */
-type Filter<TKey extends string = string, TRaw = never> = FilterNode<TKey, TRaw> | FieldCondition<TKey>[];
-type SortDirection = "asc" | "desc";
-/** One sort field — `{ key, direction }`. */
-interface SortItem<TKey extends string = string> {
-    key: TKey;
-    direction?: SortDirection;
-}
-/** Sort is **always an array** of {@link SortItem} (multi-field capable). */
-type Sort<TKey extends string = string> = SortItem<TKey>[];
-/** Offset (sahifali) paginatsiya meta'si. */
-interface OffsetMeta {
-    total_items: number;
-    total_pages: number;
-    current_page: number;
-    per_page: number;
-    has_next: boolean;
-    has_prev: boolean;
-}
-/** Infinite-scroll paginatsiya meta'si. */
-interface InfiniteMeta {
-    limit: number;
-    offset: number;
-    count: number;
-    has_more: boolean;
-    next_offset: number | null;
-}
-/** Cursor (keyset) paginatsiya meta'si. */
-interface CursorMeta {
-    limit: number;
-    has_next: boolean;
-    has_prev: boolean;
-    next_cursor: string | null;
-    prev_cursor: string | null;
-}
+import { F as FilterValue, a as FieldCondition, b as FilterScalar, c as FilterNode, A as AndGroup, O as OrGroup, N as NotGroup, S as SkippedCondition } from './raw-Bx8c-TrC.js';
+export { d as AggregateSpec, e as AllRows, C as CursorMeta, D as DEFAULT_LIMIT, f as DEFAULT_MAX_CONDITIONS, g as DEFAULT_MAX_FILTER_DEPTH, h as DEFAULT_MAX_IN_ITEMS, i as DEFAULT_MAX_LIKE_WILDCARDS, j as DEFAULT_MAX_LIMIT, k as DEFAULT_MAX_OFFSET, l as DEFAULT_MAX_PER_PAGE, m as DEFAULT_MAX_SORT_FIELDS, n as DEFAULT_MAX_STRING_LENGTH, o as DEFAULT_PER_PAGE, p as DEFAULT_QUERY_LIMITS, q as FILTER_OPERATORS, r as Filter, s as FilterOperator, t as Filterable, I as InfiniteMeta, L as LooseKey, M as MutationCount, u as MutationOptions, v as MutationRows, w as OffsetMeta, Q as QueryLimits, R as RelationRule, x as Relations, y as Scope, z as ScopeIn, B as SkipReason, E as SkipSite, G as Sort, H as SortDirection, J as SortItem, T as TEXT_FILTER_OPERATORS, U as UpsertOptions, W as WireBaseParams, K as WireCursorParams, P as WireInfiniteParams, V as WireOffsetParams, X as raw, Y as resolveLimits } from './raw-Bx8c-TrC.js';
 
 /**
  * Filter shartlarini tipli, ergonomik quruvchilar to'plamini qaytaradi. Kalit
@@ -100,6 +30,7 @@ declare function createFilters<TKey extends string = string, TRaw = never>(): {
     in: (key: TKey, value: Array<string | number>) => FieldCondition<TKey>;
     notIn: (key: TKey, value: Array<string | number>) => FieldCondition<TKey>;
     between: (key: TKey, min: FilterScalar | Date, max: FilterScalar | Date) => FieldCondition<TKey>;
+    notBetween: (key: TKey, min: FilterScalar | Date, max: FilterScalar | Date) => FieldCondition<TKey>;
     /** Diapazon — ikkita shart (`>=` va `<=`) massivi (flat filterga spread qilinadi). */
     range: (key: TKey, from: FilterScalar | Date, to: FilterScalar | Date) => FieldCondition<TKey>[];
     isNull: (key: TKey) => FieldCondition<TKey>;
@@ -125,6 +56,7 @@ declare const f: {
     in: (key: string, value: Array<string | number>) => FieldCondition<string>;
     notIn: (key: string, value: Array<string | number>) => FieldCondition<string>;
     between: (key: string, min: FilterScalar | Date, max: FilterScalar | Date) => FieldCondition<string>;
+    notBetween: (key: string, min: FilterScalar | Date, max: FilterScalar | Date) => FieldCondition<string>;
     /** Diapazon — ikkita shart (`>=` va `<=`) massivi (flat filterga spread qilinadi). */
     range: (key: string, from: FilterScalar | Date, to: FilterScalar | Date) => FieldCondition<string>[];
     isNull: (key: string) => FieldCondition<string>;
@@ -135,13 +67,50 @@ declare const f: {
 };
 
 /**
- * Umumiy pagination default'lari — yagona manba. Backend adapter (`createRegistry`
- * options) va frontend (`createQuery` config) shu qiymatlarni fallback sifatida
- * ishlatadi, shuning uchun ular hech qachon bir-biridan farq qilmaydi.
+ * querykit xatolari. Backend adapterlari (`drizzle-pg`, `mongoose`) `strict`
+ * rejimda shu bitta klassni tashlaydi — ya'ni ikkala backend uchun xatoni
+ * ushlash usuli bir xil.
  */
-/** Offset (list) sahifa o'lchami default'i. */
-declare const DEFAULT_PER_PAGE = 20;
-/** Infinite/cursor `limit` default'i. */
-declare const DEFAULT_LIMIT = 20;
 
-export { type AndGroup, type CursorMeta, DEFAULT_LIMIT, DEFAULT_PER_PAGE, FILTER_OPERATORS, type FieldCondition, type Filter, type FilterNode, type FilterOperator, type FilterScalar, type FilterValue, type InfiniteMeta, type NotGroup, type OffsetMeta, type OrGroup, type Sort, type SortDirection, type SortItem, createFilters, f };
+/**
+ * `strict` rejimda noto'g'ri so'rov shartida tashlanadi (noma'lum kalit yoki
+ * operatorga mos kelmagan qiymat). Backend'da 400 qilib qaytarish uchun:
+ *
+ * ```ts
+ * try {
+ *   return await usersRepository.findList(params);
+ * } catch (err) {
+ *   if (err instanceof QueryKitError) return c.json({ error: err.message }, 400);
+ *   throw err;
+ * }
+ * ```
+ */
+declare class QueryKitError extends Error {
+    /** Barqaror kod — `instanceof` ishlamaydigan chegaralarda (RPC, worker) tekshirish uchun. */
+    readonly code = "QUERYKIT_INVALID_CONDITION";
+    /** Tashlab yuborilgan shart haqida to'liq ma'lumot (hook argumenti bilan bir xil shakl). */
+    readonly info: SkippedCondition;
+    constructor(info: SkippedCondition);
+}
+/**
+ * A read ran past its time limit (`maxTimeMS` on MongoDB). Kept apart from
+ * {@link QueryKitError}: the request was valid, the database was slow — map it to
+ * 503 / 504, not 400.
+ */
+declare class QueryKitTimeoutError extends Error {
+    /** Collection / model name. */
+    readonly source: string;
+    /** The limit that was hit, in milliseconds. */
+    readonly maxTimeMS: number;
+    /** Stable code for boundaries where `instanceof` does not work. */
+    readonly code = "QUERYKIT_TIMEOUT";
+    constructor(
+    /** Collection / model name. */
+    source: string, 
+    /** The limit that was hit, in milliseconds. */
+    maxTimeMS: number, options?: {
+        cause?: unknown;
+    });
+}
+
+export { AndGroup, FieldCondition, FilterNode, FilterScalar, FilterValue, NotGroup, OrGroup, QueryKitError, QueryKitTimeoutError, SkippedCondition, createFilters, f };

package/dist/index.js

@@ -1,3 +1,5 @@
+export { DEFAULT_LIMIT, DEFAULT_MAX_CONDITIONS, DEFAULT_MAX_FILTER_DEPTH, DEFAULT_MAX_IN_ITEMS, DEFAULT_MAX_LIKE_WILDCARDS, DEFAULT_MAX_LIMIT, DEFAULT_MAX_OFFSET, DEFAULT_MAX_PER_PAGE, DEFAULT_MAX_SORT_FIELDS, DEFAULT_MAX_STRING_LENGTH, DEFAULT_PER_PAGE, DEFAULT_QUERY_LIMITS, QueryKitError, QueryKitTimeoutError, raw, resolveLimits } from './chunk-NHNDPIPM.js';
+
 // src/filters.ts
 function field(key, operation, value) {
   return { key, operation, value };
@@ -19,6 +21,7 @@ function createFilters() {
     in: (key, value) => field(key, "in", value),
     notIn: (key, value) => field(key, "notIn", value),
     between: (key, min, max) => field(key, "between", [min, max]),
+    notBetween: (key, min, max) => field(key, "notBetween", [min, max]),
     /** Diapazon — ikkita shart (`>=` va `<=`) massivi (flat filterga spread qilinadi). */
     range: (key, from, to) => [
       field(key, ">=", from),
@@ -31,11 +34,7 @@ function createFilters() {
     not: (node) => ({ not: node })
   };
 }
-var f = createFilters();
-
-// src/defaults.ts
-var DEFAULT_PER_PAGE = 20;
-var DEFAULT_LIMIT = 20;
+var f = /* @__PURE__ */ createFilters();
 
 // src/operators.ts
 var FILTER_OPERATORS = [
@@ -69,8 +68,18 @@ var FILTER_OPERATORS = [
   "notBetween",
   "isNull",
   "isNotNull"
+], TEXT_FILTER_OPERATORS = [
+  "like",
+  "ilike",
+  "notLike",
+  "contains",
+  "startsWith",
+  "endsWith",
+  "%_%",
+  "%_",
+  "_%"
 ];
 
-export { DEFAULT_LIMIT, DEFAULT_PER_PAGE, FILTER_OPERATORS, createFilters, f };
+export { FILTER_OPERATORS, TEXT_FILTER_OPERATORS, createFilters, f };
 //# sourceMappingURL=index.js.map
 //# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/filters.ts","../src/defaults.ts","../src/operators.ts"],"names":[],"mappings":";AAEA,SAAS,KAAA,CAA2B,GAAA,EAAW,SAAA,EAA2B,KAAA,EAA2C;AACnH,EAAA,OAAO,EAAE,GAAA,EAAK,SAAA,EAAW,KAAA,EAAM;AACjC;AAeO,SAAS,aAAA,GAA4D;AAG1E,EAAA,OAAO;AAAA,IACL,IAAI,CAAC,GAAA,EAAW,UAAuB,KAAA,CAAM,GAAA,EAAK,KAAK,KAAK,CAAA;AAAA,IAC5D,IAAI,CAAC,GAAA,EAAW,UAAuB,KAAA,CAAM,GAAA,EAAK,MAAM,KAAK,CAAA;AAAA,IAC7D,IAAI,CAAC,GAAA,EAAW,UAAuB,KAAA,CAAM,GAAA,EAAK,KAAK,KAAK,CAAA;AAAA,IAC5D,KAAK,CAAC,GAAA,EAAW,UAAuB,KAAA,CAAM,GAAA,EAAK,MAAM,KAAK,CAAA;AAAA,IAC9D,IAAI,CAAC,GAAA,EAAW,UAAuB,KAAA,CAAM,GAAA,EAAK,KAAK,KAAK,CAAA;AAAA,IAC5D,KAAK,CAAC,GAAA,EAAW,UAAuB,KAAA,CAAM,GAAA,EAAK,MAAM,KAAK,CAAA;AAAA,IAE9D,UAAU,CAAC,GAAA,EAAW,UAAkB,KAAA,CAAM,GAAA,EAAK,OAAO,KAAK,CAAA;AAAA,IAC/D,YAAY,CAAC,GAAA,EAAW,UAAkB,KAAA,CAAM,GAAA,EAAK,MAAM,KAAK,CAAA;AAAA,IAChE,UAAU,CAAC,GAAA,EAAW,UAAkB,KAAA,CAAM,GAAA,EAAK,MAAM,KAAK,CAAA;AAAA,IAC9D,MAAM,CAAC,GAAA,EAAW,UAAkB,KAAA,CAAM,GAAA,EAAK,QAAQ,KAAK,CAAA;AAAA,IAC5D,OAAO,CAAC,GAAA,EAAW,UAAkB,KAAA,CAAM,GAAA,EAAK,SAAS,KAAK,CAAA;AAAA,IAC9D,SAAS,CAAC,GAAA,EAAW,UAAkB,KAAA,CAAM,GAAA,EAAK,WAAW,KAAK,CAAA;AAAA,IAElE,IAAI,CAAC,GAAA,EAAW,UAAkC,KAAA,CAAM,GAAA,EAAK,MAAM,KAAK,CAAA;AAAA,IACxE,OAAO,CAAC,GAAA,EAAW,UAAkC,KAAA,CAAM,GAAA,EAAK,SAAS,KAAK,CAAA;AAAA,IAC9E,OAAA,EAAS,CAAC,GAAA,EAAW,GAAA,EAA0B,GAAA,KAA6B,KAAA,CAAM,GAAA,EAAK,SAAA,EAAW,CAAC,GAAA,EAAK,GAAG,CAAgB,CAAA;AAAA;AAAA,IAE3H,KAAA,EAAO,CAAC,GAAA,EAAW,IAAA,EAA2B,EAAA,KAAoD;AAAA,MAChG,KAAA,CAAM,GAAA,EAAK,IAAA,EAAM,IAAmB,CAAA;AAAA,MACpC,KAAA,CAAM,GAAA,EAAK,IAAA,EAAM,EAAiB;AAAA,KACpC;AAAA,IAEA,MAAA,EAAQ,CAAC,GAAA,KAAc,KAAA,CAAM,KAAK,QAAQ,CAAA;AAAA,IAC1C,SAAA,EAAW,CAAC,GAAA,KAAc,KAAA,CAAM,KAAK,WAAW,CAAA;AAAA,IAEhD,GAAA,EAAK,CAAA,GAAI,KAAA,MAAyC,EAAE,KAAK,KAAA,EAAM,CAAA;AAAA,IAC/D,EAAA,EAAI,CAAA,GAAI,KAAA,MAAwC,EAAE,IAAI,KAAA,EAAM,CAAA;AAAA,IAC5D,GAAA,EAAK,CAAC,IAAA,MAAsC,EAAE,KAAK,IAAA,EAAK;AAAA,GAC1D;AACF;AAGO,IAAM,IAAI,aAAA;;;ACjDV,IAAM,gBAAA,GAAmB;AAGzB,IAAM,aAAA,GAAgB;;;ACNtB,IAAM,gBAAA,GAAmB;AAAA,EAC9B,GAAA;AAAA,EACA,IAAA;AAAA,EACA,GAAA;AAAA,EACA,IAAA;AAAA,EACA,GAAA;AAAA,EACA,IAAA;AAAA,EACA,IAAA;AAAA,EACA,IAAA;AAAA,EACA,IAAA;AAAA,EACA,KAAA;AAAA,EACA,IAAA;AAAA,EACA,KAAA;AAAA,EACA,MAAA;AAAA,EACA,OAAA;AAAA,EACA,SAAA;AAAA,EACA,UAAA;AAAA,EACA,YAAA;AAAA,EACA,UAAA;AAAA,EACA,KAAA;AAAA;AAAA,EACA,IAAA;AAAA;AAAA,EACA,IAAA;AAAA;AAAA,EACA,IAAA;AAAA,EACA,OAAA;AAAA,EACA,SAAA;AAAA,EACA,YAAA;AAAA,EACA,QAAA;AAAA,EACA;AACF","file":"index.js","sourcesContent":["import type { AndGroup, FieldCondition, FilterNode, FilterOperator, FilterScalar, FilterValue, NotGroup, OrGroup } from \"./types\";\n\nfunction field<TKey extends string>(key: TKey, operation: FilterOperator, value?: FilterValue): FieldCondition<TKey> {\n  return { key, operation, value };\n}\n\n/**\n * Filter shartlarini tipli, ergonomik quruvchilar to'plamini qaytaradi. Kalit\n * tipiga (`TKey`) bog'lanadi; adapterlar uni o'z ustun/maydon kaliti bilan\n * chaqiradi. `TRaw` — guruhlarga (`and/or/not`) qo'shsa bo'ladigan raw tugun tipi.\n *\n * @typeParam TKey - ustun/maydon kaliti (string union).\n * @typeParam TRaw - raw escape-hatch tugun tipi (masalan Drizzle `SQL`).\n * @example\n * ```ts\n * const f = createFilters<\"status\" | \"age\">();\n * f.and(f.eq(\"status\", \"active\"), f.gte(\"age\", 18));\n * ```\n */\nexport function createFilters<TKey extends string = string, TRaw = never>() {\n  type Node = FilterNode<TKey, TRaw>;\n\n  return {\n    eq: (key: TKey, value: FilterValue) => field(key, \"=\", value),\n    ne: (key: TKey, value: FilterValue) => field(key, \"!=\", value),\n    gt: (key: TKey, value: FilterValue) => field(key, \">\", value),\n    gte: (key: TKey, value: FilterValue) => field(key, \">=\", value),\n    lt: (key: TKey, value: FilterValue) => field(key, \"<\", value),\n    lte: (key: TKey, value: FilterValue) => field(key, \"<=\", value),\n\n    contains: (key: TKey, value: string) => field(key, \"%_%\", value),\n    startsWith: (key: TKey, value: string) => field(key, \"%_\", value),\n    endsWith: (key: TKey, value: string) => field(key, \"_%\", value),\n    like: (key: TKey, value: string) => field(key, \"like\", value),\n    ilike: (key: TKey, value: string) => field(key, \"ilike\", value),\n    notLike: (key: TKey, value: string) => field(key, \"notLike\", value),\n\n    in: (key: TKey, value: Array<string | number>) => field(key, \"in\", value),\n    notIn: (key: TKey, value: Array<string | number>) => field(key, \"notIn\", value),\n    between: (key: TKey, min: FilterScalar | Date, max: FilterScalar | Date) => field(key, \"between\", [min, max] as FilterValue),\n    /** Diapazon — ikkita shart (`>=` va `<=`) massivi (flat filterga spread qilinadi). */\n    range: (key: TKey, from: FilterScalar | Date, to: FilterScalar | Date): FieldCondition<TKey>[] => [\n      field(key, \">=\", from as FilterValue),\n      field(key, \"<=\", to as FilterValue),\n    ],\n\n    isNull: (key: TKey) => field(key, \"isNull\"),\n    isNotNull: (key: TKey) => field(key, \"isNotNull\"),\n\n    and: (...nodes: Node[]): AndGroup<TKey, TRaw> => ({ and: nodes }),\n    or: (...nodes: Node[]): OrGroup<TKey, TRaw> => ({ or: nodes }),\n    not: (node: Node): NotGroup<TKey, TRaw> => ({ not: node }),\n  };\n}\n\n/** Tipsiz (kalitga bog'lanmagan) filter quruvchilar — tez foydalanish uchun. */\nexport const f = createFilters();\n","/**\n * Umumiy pagination default'lari — yagona manba. Backend adapter (`createRegistry`\n * options) va frontend (`createQuery` config) shu qiymatlarni fallback sifatida\n * ishlatadi, shuning uchun ular hech qachon bir-biridan farq qilmaydi.\n */\n\n/** Offset (list) sahifa o'lchami default'i. */\nexport const DEFAULT_PER_PAGE = 20;\n\n/** Infinite/cursor `limit` default'i. */\nexport const DEFAULT_LIMIT = 20;\n","/**\n * Filter operatorlari — yagona runtime manba. `FilterOperator` tipi (`types.ts`)\n * shundan chiqadi; `@querykitjs/zod` shu massivdan zod enum quradi.\n */\nexport const FILTER_OPERATORS = [\n  \"=\",\n  \"!=\",\n  \">\",\n  \">=\",\n  \"<\",\n  \"<=\",\n  \"eq\",\n  \"ne\",\n  \"gt\",\n  \"gte\",\n  \"lt\",\n  \"lte\",\n  \"like\",\n  \"ilike\",\n  \"notLike\",\n  \"contains\",\n  \"startsWith\",\n  \"endsWith\",\n  \"%_%\", // contains\n  \"%_\", // startsWith\n  \"_%\", // endsWith\n  \"in\",\n  \"notIn\",\n  \"between\",\n  \"notBetween\",\n  \"isNull\",\n  \"isNotNull\",\n] as const;\n"]}
+{"version":3,"sources":["../src/filters.ts","../src/operators.ts"],"names":[],"mappings":";;;AAEA,SAAS,KAAA,CAA2B,GAAA,EAAW,SAAA,EAA2B,KAAA,EAA2C;AACnH,EAAA,OAAO,EAAE,GAAA,EAAK,SAAA,EAAW,KAAA,EAAM;AACjC;AAeO,SAAS,aAAA,GAA4D;AAG1E,EAAA,OAAO;AAAA,IACL,IAAI,CAAC,GAAA,EAAW,UAAuB,KAAA,CAAM,GAAA,EAAK,KAAK,KAAK,CAAA;AAAA,IAC5D,IAAI,CAAC,GAAA,EAAW,UAAuB,KAAA,CAAM,GAAA,EAAK,MAAM,KAAK,CAAA;AAAA,IAC7D,IAAI,CAAC,GAAA,EAAW,UAAuB,KAAA,CAAM,GAAA,EAAK,KAAK,KAAK,CAAA;AAAA,IAC5D,KAAK,CAAC,GAAA,EAAW,UAAuB,KAAA,CAAM,GAAA,EAAK,MAAM,KAAK,CAAA;AAAA,IAC9D,IAAI,CAAC,GAAA,EAAW,UAAuB,KAAA,CAAM,GAAA,EAAK,KAAK,KAAK,CAAA;AAAA,IAC5D,KAAK,CAAC,GAAA,EAAW,UAAuB,KAAA,CAAM,GAAA,EAAK,MAAM,KAAK,CAAA;AAAA,IAE9D,UAAU,CAAC,GAAA,EAAW,UAAkB,KAAA,CAAM,GAAA,EAAK,OAAO,KAAK,CAAA;AAAA,IAC/D,YAAY,CAAC,GAAA,EAAW,UAAkB,KAAA,CAAM,GAAA,EAAK,MAAM,KAAK,CAAA;AAAA,IAChE,UAAU,CAAC,GAAA,EAAW,UAAkB,KAAA,CAAM,GAAA,EAAK,MAAM,KAAK,CAAA;AAAA,IAC9D,MAAM,CAAC,GAAA,EAAW,UAAkB,KAAA,CAAM,GAAA,EAAK,QAAQ,KAAK,CAAA;AAAA,IAC5D,OAAO,CAAC,GAAA,EAAW,UAAkB,KAAA,CAAM,GAAA,EAAK,SAAS,KAAK,CAAA;AAAA,IAC9D,SAAS,CAAC,GAAA,EAAW,UAAkB,KAAA,CAAM,GAAA,EAAK,WAAW,KAAK,CAAA;AAAA,IAElE,IAAI,CAAC,GAAA,EAAW,UAAkC,KAAA,CAAM,GAAA,EAAK,MAAM,KAAK,CAAA;AAAA,IACxE,OAAO,CAAC,GAAA,EAAW,UAAkC,KAAA,CAAM,GAAA,EAAK,SAAS,KAAK,CAAA;AAAA,IAC9E,OAAA,EAAS,CAAC,GAAA,EAAW,GAAA,EAA0B,GAAA,KAA6B,KAAA,CAAM,GAAA,EAAK,SAAA,EAAW,CAAC,GAAA,EAAK,GAAG,CAAgB,CAAA;AAAA,IAC3H,UAAA,EAAY,CAAC,GAAA,EAAW,GAAA,EAA0B,GAAA,KAA6B,KAAA,CAAM,GAAA,EAAK,YAAA,EAAc,CAAC,GAAA,EAAK,GAAG,CAAgB,CAAA;AAAA;AAAA,IAEjI,KAAA,EAAO,CAAC,GAAA,EAAW,IAAA,EAA2B,EAAA,KAAoD;AAAA,MAChG,KAAA,CAAM,GAAA,EAAK,IAAA,EAAM,IAAmB,CAAA;AAAA,MACpC,KAAA,CAAM,GAAA,EAAK,IAAA,EAAM,EAAiB;AAAA,KACpC;AAAA,IAEA,MAAA,EAAQ,CAAC,GAAA,KAAc,KAAA,CAAM,KAAK,QAAQ,CAAA;AAAA,IAC1C,SAAA,EAAW,CAAC,GAAA,KAAc,KAAA,CAAM,KAAK,WAAW,CAAA;AAAA,IAEhD,GAAA,EAAK,CAAA,GAAI,KAAA,MAAyC,EAAE,KAAK,KAAA,EAAM,CAAA;AAAA,IAC/D,EAAA,EAAI,CAAA,GAAI,KAAA,MAAwC,EAAE,IAAI,KAAA,EAAM,CAAA;AAAA,IAC5D,GAAA,EAAK,CAAC,IAAA,MAAsC,EAAE,KAAK,IAAA,EAAK;AAAA,GAC1D;AACF;AAGO,IAAM,oBAAoB,aAAA;;;ACrD1B,IAAM,gBAAA,GAAmB;AAAA,EAC9B,GAAA;AAAA,EACA,IAAA;AAAA,EACA,GAAA;AAAA,EACA,IAAA;AAAA,EACA,GAAA;AAAA,EACA,IAAA;AAAA,EACA,IAAA;AAAA,EACA,IAAA;AAAA,EACA,IAAA;AAAA,EACA,KAAA;AAAA,EACA,IAAA;AAAA,EACA,KAAA;AAAA,EACA,MAAA;AAAA,EACA,OAAA;AAAA,EACA,SAAA;AAAA,EACA,UAAA;AAAA,EACA,YAAA;AAAA,EACA,UAAA;AAAA,EACA,KAAA;AAAA;AAAA,EACA,IAAA;AAAA;AAAA,EACA,IAAA;AAAA;AAAA,EACA,IAAA;AAAA,EACA,OAAA;AAAA,EACA,SAAA;AAAA,EACA,YAAA;AAAA,EACA,QAAA;AAAA,EACA;AACF,CAAA,CAAA,CASa,qBAAA,GAAwB;AAAA,EACnC,MAAA;AAAA,EACA,OAAA;AAAA,EACA,SAAA;AAAA,EACA,UAAA;AAAA,EACA,YAAA;AAAA,EACA,UAAA;AAAA,EACA,KAAA;AAAA,EACA,IAAA;AAAA,EACA;AACF","file":"index.js","sourcesContent":["import type { AndGroup, FieldCondition, FilterNode, FilterOperator, FilterScalar, FilterValue, NotGroup, OrGroup } from \"./types\";\n\nfunction field<TKey extends string>(key: TKey, operation: FilterOperator, value?: FilterValue): FieldCondition<TKey> {\n  return { key, operation, value };\n}\n\n/**\n * Filter shartlarini tipli, ergonomik quruvchilar to'plamini qaytaradi. Kalit\n * tipiga (`TKey`) bog'lanadi; adapterlar uni o'z ustun/maydon kaliti bilan\n * chaqiradi. `TRaw` — guruhlarga (`and/or/not`) qo'shsa bo'ladigan raw tugun tipi.\n *\n * @typeParam TKey - ustun/maydon kaliti (string union).\n * @typeParam TRaw - raw escape-hatch tugun tipi (masalan Drizzle `SQL`).\n * @example\n * ```ts\n * const f = createFilters<\"status\" | \"age\">();\n * f.and(f.eq(\"status\", \"active\"), f.gte(\"age\", 18));\n * ```\n */\nexport function createFilters<TKey extends string = string, TRaw = never>() {\n  type Node = FilterNode<TKey, TRaw>;\n\n  return {\n    eq: (key: TKey, value: FilterValue) => field(key, \"=\", value),\n    ne: (key: TKey, value: FilterValue) => field(key, \"!=\", value),\n    gt: (key: TKey, value: FilterValue) => field(key, \">\", value),\n    gte: (key: TKey, value: FilterValue) => field(key, \">=\", value),\n    lt: (key: TKey, value: FilterValue) => field(key, \"<\", value),\n    lte: (key: TKey, value: FilterValue) => field(key, \"<=\", value),\n\n    contains: (key: TKey, value: string) => field(key, \"%_%\", value),\n    startsWith: (key: TKey, value: string) => field(key, \"%_\", value),\n    endsWith: (key: TKey, value: string) => field(key, \"_%\", value),\n    like: (key: TKey, value: string) => field(key, \"like\", value),\n    ilike: (key: TKey, value: string) => field(key, \"ilike\", value),\n    notLike: (key: TKey, value: string) => field(key, \"notLike\", value),\n\n    in: (key: TKey, value: Array<string | number>) => field(key, \"in\", value),\n    notIn: (key: TKey, value: Array<string | number>) => field(key, \"notIn\", value),\n    between: (key: TKey, min: FilterScalar | Date, max: FilterScalar | Date) => field(key, \"between\", [min, max] as FilterValue),\n    notBetween: (key: TKey, min: FilterScalar | Date, max: FilterScalar | Date) => field(key, \"notBetween\", [min, max] as FilterValue),\n    /** Diapazon — ikkita shart (`>=` va `<=`) massivi (flat filterga spread qilinadi). */\n    range: (key: TKey, from: FilterScalar | Date, to: FilterScalar | Date): FieldCondition<TKey>[] => [\n      field(key, \">=\", from as FilterValue),\n      field(key, \"<=\", to as FilterValue),\n    ],\n\n    isNull: (key: TKey) => field(key, \"isNull\"),\n    isNotNull: (key: TKey) => field(key, \"isNotNull\"),\n\n    and: (...nodes: Node[]): AndGroup<TKey, TRaw> => ({ and: nodes }),\n    or: (...nodes: Node[]): OrGroup<TKey, TRaw> => ({ or: nodes }),\n    not: (node: Node): NotGroup<TKey, TRaw> => ({ not: node }),\n  };\n}\n\n/** Tipsiz (kalitga bog'lanmagan) filter quruvchilar — tez foydalanish uchun. */\nexport const f = /* @__PURE__ */ createFilters();\n","/**\n * Filter operatorlari — yagona runtime manba. `FilterOperator` tipi (`types.ts`)\n * shundan chiqadi; `@querykitjs/zod` shu massivdan zod enum quradi.\n */\nexport const FILTER_OPERATORS = [\n  \"=\",\n  \"!=\",\n  \">\",\n  \">=\",\n  \"<\",\n  \"<=\",\n  \"eq\",\n  \"ne\",\n  \"gt\",\n  \"gte\",\n  \"lt\",\n  \"lte\",\n  \"like\",\n  \"ilike\",\n  \"notLike\",\n  \"contains\",\n  \"startsWith\",\n  \"endsWith\",\n  \"%_%\", // contains\n  \"%_\", // startsWith\n  \"_%\", // endsWith\n  \"in\",\n  \"notIn\",\n  \"between\",\n  \"notBetween\",\n  \"isNull\",\n  \"isNotNull\",\n] as const;\n\n/**\n * Qiymati **text pattern** bo'lgan operatorlar. Backend adapterlari wire qiymatni\n * ustun/path tipiga cast qilishda shularni chetlab o'tadi — aks holda\n * `ilike(dateColumn, \"%2026%\")` ISO string o'rniga `String(Date)` olardi\n * (`\"Mon Jul 28 2026 …\"`). Ro'yxat ikki adapterda divergent bo'lmasligi uchun\n * shu yerda — yagona manba.\n */\nexport const TEXT_FILTER_OPERATORS = [\n  \"like\",\n  \"ilike\",\n  \"notLike\",\n  \"contains\",\n  \"startsWith\",\n  \"endsWith\",\n  \"%_%\",\n  \"%_\",\n  \"_%\",\n] as const satisfies readonly (typeof FILTER_OPERATORS)[number][];\n"]}

package/dist/internal.cjs

@@ -0,0 +1,357 @@
+'use strict';
+
+var chunkVD7XT52J_cjs = require('./chunk-VD7XT52J.cjs');
+
+// src/internal/cursor.ts
+function encodeCursor(value) {
+  let normalized = value instanceof Date ? value.toISOString() : value, json = JSON.stringify({ v: normalized });
+  return Buffer.from(json, "utf8").toString("base64url");
+}
+function decodeCursor(cursor) {
+  if (cursor)
+    try {
+      let json = Buffer.from(cursor, "base64url").toString("utf8");
+      return JSON.parse(json).v;
+    } catch {
+      return;
+    }
+}
+var isScalar = (value) => typeof value == "string" || typeof value == "boolean" || typeof value == "number" && Number.isFinite(value), scalarOf = (value) => {
+  let normalized = value instanceof Date ? value.toISOString() : typeof value == "object" && value !== null && typeof value.toJSON == "function" ? value.toJSON() : value;
+  return isScalar(normalized) ? normalized : void 0;
+};
+async function sign(body, secret) {
+  let encoder = new TextEncoder(), key = await crypto.subtle.importKey("raw", encoder.encode(secret), { name: "HMAC", hash: "SHA-256" }, false, ["sign"]), signature = await crypto.subtle.sign("HMAC", key, encoder.encode(body));
+  return Buffer.from(signature).toString("base64url");
+}
+function sameSignature(a, b) {
+  if (a.length !== b.length) return false;
+  let diff = 0;
+  for (let index = 0; index < a.length; index++) diff |= a.charCodeAt(index) ^ b.charCodeAt(index);
+  return diff === 0;
+}
+async function encodeCursorToken(payload, secret) {
+  let body = JSON.stringify({ v: 2, k: scalarOf(payload.k) ?? null, id: scalarOf(payload.id) ?? null }), signed = secret ? JSON.stringify({ ...JSON.parse(body), s: await sign(body, secret) }) : body;
+  return Buffer.from(signed, "utf8").toString("base64url");
+}
+async function decodeCursorToken(token, options) {
+  if (!token) return;
+  let refuse = () => {
+    throw new chunkVD7XT52J_cjs.QueryKitError({ source: options.source, site: "cursorKey", key: options.key ?? "cursor", reason: "invalid-value" });
+  }, payload;
+  try {
+    payload = JSON.parse(Buffer.from(token, "base64url").toString("utf8"));
+  } catch {
+    return refuse();
+  }
+  if (typeof payload != "object" || payload === null || payload.v !== 2 || !isScalar(payload.k) || !isScalar(payload.id)) return refuse();
+  if (options.secret) {
+    let body = JSON.stringify({ v: 2, k: payload.k, id: payload.id });
+    if (typeof payload.s != "string" || !sameSignature(payload.s, await sign(body, options.secret))) return refuse();
+  }
+  return { k: payload.k, id: payload.id };
+}
+
+// src/internal/diagnostics.ts
+function reportSkip(diag, info) {
+  if (!diag) return;
+  let full = { ...info, source: diag.source };
+  if (diag.strict) throw new chunkVD7XT52J_cjs.QueryKitError(full);
+  diag.onSkipped?.(full);
+}
+
+// src/internal/context.ts
+function loadAsyncLocalStorage() {
+  let asyncHooks = typeof process < "u" && typeof process.getBuiltinModule == "function" ? process.getBuiltinModule("node:async_hooks") : void 0;
+  if (!asyncHooks?.AsyncLocalStorage)
+    throw new Error("querykit: the repository context needs node:async_hooks (Node >= 22.12 or Bun) \u2014 a querykit adapter cannot run in this runtime");
+  return asyncHooks.AsyncLocalStorage;
+}
+function createContextStore() {
+  let AsyncLocalStorage = loadAsyncLocalStorage(), als = new AsyncLocalStorage();
+  return {
+    get: () => als.getStore(),
+    run: (patch, fn) => als.run({ ...als.getStore(), ...patch }, fn)
+  };
+}
+
+// src/internal/sort.ts
+function normalizeSort(sort, diag) {
+  if (!sort) return [];
+  let items = [];
+  for (let item of sort)
+    item && typeof item.key == "string" && item.key ? items.push({ key: item.key, direction: item.direction ?? "asc" }) : reportSkip(diag, { site: "sort", key: "", reason: "invalid-value" });
+  return items;
+}
+
+// src/internal/pagination.ts
+function clampPageSize(requested, fallback, max) {
+  return Math.min(max, Math.max(1, Math.trunc(requested ?? fallback)));
+}
+function clampPage(requested) {
+  return Math.max(1, Math.trunc(requested ?? 1));
+}
+function clampOffset(requested) {
+  return Math.max(0, Math.trunc(requested ?? 0));
+}
+function offsetMeta(page, perPage, totalItems) {
+  let totalPages = Math.ceil(totalItems / perPage);
+  return {
+    total_items: totalItems,
+    total_pages: totalPages,
+    current_page: page,
+    per_page: perPage,
+    has_next: page < totalPages,
+    has_prev: page > 1
+  };
+}
+function offsetPageWithoutTotal(rows, page, perPage) {
+  let hasNext = rows.length > perPage;
+  return {
+    data: hasNext ? rows.slice(0, perPage) : [...rows],
+    meta: { total_items: null, total_pages: null, current_page: page, per_page: perPage, has_next: hasNext, has_prev: page > 1 }
+  };
+}
+function infinitePage(rows, limit, offset) {
+  let hasMore = rows.length > limit, data = hasMore ? rows.slice(0, limit) : [...rows];
+  return {
+    data,
+    meta: { limit, offset, count: data.length, has_more: hasMore, next_offset: hasMore ? offset + limit : null }
+  };
+}
+async function cursorPage(rows, options) {
+  let { limit, direction, hasCursor, cursorField, idField, secret } = options, hasExtra = rows.length > limit, data = hasExtra ? rows.slice(0, limit) : [...rows];
+  direction === "backward" && (data = data.reverse());
+  let first = data[0], last = data[data.length - 1], hasNext = direction === "forward" ? hasExtra : hasCursor, hasPrev = direction === "forward" ? hasCursor : hasExtra;
+  return {
+    data,
+    meta: {
+      limit,
+      has_next: hasNext,
+      has_prev: hasPrev,
+      next_cursor: hasNext && last ? await encodeCursorToken({ k: last[cursorField], id: last[idField] }, secret) : null,
+      prev_cursor: hasPrev && first ? await encodeCursorToken({ k: first[cursorField], id: first[idField] }, secret) : null
+    }
+  };
+}
+
+// src/internal/mutation.ts
+var isPlainObject = (value) => typeof value == "object" && value !== null && !Array.isArray(value) && Object.getPrototypeOf(value) === Object.prototype;
+function isAllRows(filter) {
+  return isPlainObject(filter) && filter.all === true && Object.keys(filter).length === 1;
+}
+function isEmptyFilter(filter) {
+  return filter == null || Array.isArray(filter) && filter.length === 0 || isPlainObject(filter) && Object.keys(filter).length === 0;
+}
+function refuseEmptyFilter(source, method) {
+  throw new chunkVD7XT52J_cjs.QueryKitError({ source, site: "mutation", key: method, reason: "empty-filter" });
+}
+
+// src/internal/scope.ts
+var isPlainObject2 = (value) => typeof value == "object" && value !== null && !Array.isArray(value) && Object.getPrototypeOf(value) === Object.prototype, isInScope = (value) => isPlainObject2(value) && Object.keys(value).length === 1 && Array.isArray(value.in);
+function scopeConditions(scope) {
+  return Object.entries(scope ?? {}).map(
+    ([key, value]) => isInScope(value) ? { key, operation: "in", value: [...value.in] } : { key, operation: "=", value }
+  );
+}
+function scopeDefaults(scope) {
+  return Object.fromEntries(Object.entries(scope ?? {}).filter(([, value]) => !isInScope(value)));
+}
+
+// src/internal/with.ts
+var isPlainObject3 = (value) => typeof value == "object" && value !== null && !Array.isArray(value) && Object.getPrototypeOf(value) === Object.prototype, ruleOf = (relations, name) => {
+  let rule = relations && Object.prototype.hasOwnProperty.call(relations, name) ? relations[name] : void 0;
+  return isPlainObject3(rule) && (rule.columns === "*" || Array.isArray(rule.columns)) ? rule : void 0;
+}, selectedKeys = (selection) => {
+  if (typeof selection == "string") return selection.split(/\s+/).filter(Boolean);
+  if (isPlainObject3(selection)) return Object.keys(selection).filter((key) => !!selection[key]);
+};
+function checkWith(withValue, relations, dialect, source, path = "") {
+  if (withValue == null) return;
+  let refuse = (key) => {
+    throw new chunkVD7XT52J_cjs.QueryKitError({ source, site: "with", key: path + key, reason: "forbidden-key" });
+  };
+  if (!isPlainObject3(withValue)) return refuse("with");
+  let checked = {};
+  for (let [name, value] of Object.entries(withValue)) {
+    if (value === false || value === void 0) continue;
+    let rule = ruleOf(relations, name) ?? refuse(name), listed = rule.columns === "*" ? void 0 : new Set(rule.columns), selectListed = () => Object.fromEntries([...listed].map((column) => [column, true]));
+    if (value === true) {
+      checked[name] = listed ? { [dialect.columns]: selectListed() } : true;
+      continue;
+    }
+    isPlainObject3(value) || refuse(name);
+    let options = value, out = {};
+    for (let [key, option] of Object.entries(options)) {
+      let at = `${name}.${key}`;
+      if (key === dialect.columns) {
+        let keys = selectedKeys(option) ?? refuse(at);
+        for (let column of keys) listed && (column.startsWith("-") || !listed.has(column)) && refuse(`${name}.${column}`);
+        out[key] = option;
+      } else if (key === dialect.nested)
+        out[key] = checkWith(option, rule.nested, dialect, source, `${name}.`);
+      else if (dialect.filters.includes(key))
+        checkFilterFields(option, rule, dialect, (field) => refuse(`${name}.${field}`)), out[key] = option;
+      else if (dialect.paging.includes(key))
+        out[key] = option;
+      else if (key === dialect.orderBy) {
+        for (let item of Array.isArray(option) ? option : [option])
+          for (let column of selectedKeys(item) ?? refuse(at)) listed && !listed.has(column) && refuse(`${name}.${column}`);
+        out[key] = option;
+      } else if (key === dialect.options) {
+        for (let sub of Object.keys(isPlainObject3(option) ? option : refuse(at))) dialect.paging.includes(sub) || refuse(`${at}.${sub}`);
+        out[key] = option;
+      } else
+        refuse(at);
+    }
+    listed && out[dialect.columns] === void 0 && (out[dialect.columns] = selectListed()), checked[name] = out;
+  }
+  return checked;
+}
+function checkFilterFields(filter, rule, dialect, refuse) {
+  isPlainObject3(filter) || refuse("filter");
+  for (let [key, value] of Object.entries(filter))
+    if (dialect.logical.includes(key))
+      for (let part of Array.isArray(value) ? value : [value]) checkFilterFields(part, rule, dialect, refuse);
+    else (key.startsWith("$") || !rule.filterable || rule.filterable[key] === void 0) && refuse(key);
+}
+
+// src/internal/limits.ts
+var isRecord = (value) => typeof value == "object" && value !== null && !Array.isArray(value), formatLimit = (limit, max) => `${limit} (${max})`;
+function findFilterLimitViolation(filter, limits) {
+  let hit = (limit, path) => ({ limit, max: limits[limit], path }), pending = [], push = (children, depth, path) => {
+    for (let index = children.length - 1; index >= 0; index--) pending.push([children[index], depth, [...path, index]]);
+  };
+  Array.isArray(filter) ? push(filter, 1, []) : filter !== void 0 && pending.push([filter, 1, []]);
+  let conditions = 0;
+  for (let next = pending.pop(); next; next = pending.pop()) {
+    let [node, depth, path] = next;
+    if (depth > limits.maxDepth) return hit("maxDepth", path);
+    if (!isRecord(node)) continue;
+    if ("key" in node) {
+      if (++conditions > limits.maxConditions) return hit("maxConditions", path);
+      let { value } = node, valuePath = [...path, "value"];
+      if (Array.isArray(value) && value.length > limits.maxInItems) return hit("maxInItems", valuePath);
+      let tooLong = (Array.isArray(value) ? value : [value]).findIndex((item) => typeof item == "string" && item.length > limits.maxStringLength);
+      if (tooLong >= 0) return hit("maxStringLength", Array.isArray(value) ? [...valuePath, tooLong] : valuePath);
+      continue;
+    }
+    let group = "and" in node ? "and" : "or" in node ? "or" : void 0;
+    if (group) {
+      let children = node[group];
+      Array.isArray(children) && push(children, depth + 1, [...path, group]);
+    } else "not" in node && pending.push([node.not, depth + 1, [...path, "not"]]);
+  }
+}
+var LIKE_OPERATORS = /* @__PURE__ */ new Set(["like", "ilike", "notLike"]), isLikeOperator = (operation) => LIKE_OPERATORS.has(operation);
+function likeWildcards(pattern) {
+  let count = 0, previous = "";
+  for (let index = 0; index < pattern.length; index++) {
+    let char = pattern[index];
+    if (char === "\\") {
+      index++, previous = "";
+      continue;
+    }
+    (char === "_" || char === "%" && previous !== "%") && count++, previous = char;
+  }
+  return count;
+}
+var offsetOf = (page, perPage) => ((page ?? 1) - 1) * (perPage ?? 20);
+
+// src/internal/policy.ts
+var DEFAULT_OPERATORS = ["=", "in"], OPERATOR_TOKEN = {
+  eq: "=",
+  ne: "!=",
+  gt: ">",
+  gte: ">=",
+  lt: "<",
+  lte: "<=",
+  contains: "%_%",
+  startsWith: "%_",
+  endsWith: "_%"
+}, tokenOf = (operation) => OPERATOR_TOKEN[operation] ?? operation, isRecord2 = (value) => typeof value == "object" && value !== null && !Array.isArray(value);
+function filterRules(options, canonical) {
+  let rules = /* @__PURE__ */ new Map();
+  if (options.filterable) {
+    for (let [key, operators] of Object.entries(options.filterable))
+      operators && rules.set(canonical(key), operators === "*" ? "*" : new Set(operators.map(tokenOf)));
+    return rules;
+  }
+  let fields = options.allowedColumns ?? (options.forcedColumns ? Object.keys(options.forcedColumns).filter((key) => options.forcedColumns[key]) : [options.primaryKey]), equality = new Set(DEFAULT_OPERATORS);
+  for (let field of fields) rules.set(canonical(field), equality);
+  return rules;
+}
+function resolvePolicy(options) {
+  let limits = chunkVD7XT52J_cjs.resolveLimits(options.limits), canonical = (key) => options.fieldOf(key) ?? key, rules = filterRules(options, canonical), sortable = new Set((options.sortable ?? [options.primaryKey, ...options.createdAt ? [options.createdAt] : []]).map(canonical)), refuse = (site, key, reason, operation) => {
+    throw new chunkVD7XT52J_cjs.QueryKitError({ source: options.source, site, key, reason, ...operation ? { operation } : {} });
+  }, checkCondition = (node) => {
+    let key = String(node.key), field = options.fieldOf(key);
+    if (field === void 0) return;
+    let operation = typeof node.operation == "string" ? node.operation : "=", rule = rules.get(field);
+    rule || refuse("filter", key, "forbidden-key", operation), rule !== "*" && !rule.has(tokenOf(operation)) && refuse("filter", key, "forbidden-operator", operation), isLikeOperator(operation) && typeof node.value == "string" && likeWildcards(node.value) > limits.maxLikeWildcards && refuse("filter", "maxLikeWildcards", "limit-exceeded", operation);
+  }, checkSortKey = (site, key) => {
+    let field = options.fieldOf(key);
+    field !== void 0 && !sortable.has(field) && refuse(site, key, "forbidden-key");
+  };
+  return {
+    limits,
+    checkFilter(filter) {
+      let violation = findFilterLimitViolation(filter, limits);
+      violation && refuse("filter", violation.limit, "limit-exceeded");
+      let pending = Array.isArray(filter) ? [...filter] : [filter];
+      for (; pending.length > 0; ) {
+        let node = pending.pop();
+        isRecord2(node) && ("key" in node ? checkCondition(node) : Array.isArray(node.and) ? pending.push(...node.and) : Array.isArray(node.or) ? pending.push(...node.or) : "not" in node ? pending.push(node.not) : !chunkVD7XT52J_cjs.isRaw(node) && !options.isNative?.(node) && refuse("filter", Object.keys(node)[0] ?? "", "forbidden-key"));
+      }
+    },
+    checkSort(sort) {
+      if (sort) {
+        sort.length > limits.maxSortFields && refuse("sort", "maxSortFields", "limit-exceeded");
+        for (let item of sort) item && typeof item.key == "string" && item.key && checkSortKey("sort", item.key);
+      }
+    },
+    checkCursorKey(key) {
+      checkSortKey("cursorKey", key);
+    },
+    checkPage(page) {
+      ("offset" in page ? page.offset : offsetOf(page.page, page.perPage)) > limits.maxOffset && refuse("page", "maxOffset", "limit-exceeded");
+    },
+    checkAggregateKey(key) {
+      let field = options.fieldOf(key);
+      field !== void 0 && !rules.has(field) && refuse("aggregate", key, "forbidden-key");
+    }
+  };
+}
+
+Object.defineProperty(exports, "isRaw", {
+  enumerable: true,
+  get: function () { return chunkVD7XT52J_cjs.isRaw; }
+});
+exports.checkWith = checkWith;
+exports.clampOffset = clampOffset;
+exports.clampPage = clampPage;
+exports.clampPageSize = clampPageSize;
+exports.createContextStore = createContextStore;
+exports.cursorPage = cursorPage;
+exports.decodeCursor = decodeCursor;
+exports.decodeCursorToken = decodeCursorToken;
+exports.encodeCursor = encodeCursor;
+exports.encodeCursorToken = encodeCursorToken;
+exports.findFilterLimitViolation = findFilterLimitViolation;
+exports.formatLimit = formatLimit;
+exports.infinitePage = infinitePage;
+exports.isAllRows = isAllRows;
+exports.isEmptyFilter = isEmptyFilter;
+exports.isLikeOperator = isLikeOperator;
+exports.likeWildcards = likeWildcards;
+exports.normalizeSort = normalizeSort;
+exports.offsetMeta = offsetMeta;
+exports.offsetOf = offsetOf;
+exports.offsetPageWithoutTotal = offsetPageWithoutTotal;
+exports.refuseEmptyFilter = refuseEmptyFilter;
+exports.reportSkip = reportSkip;
+exports.resolvePolicy = resolvePolicy;
+exports.scopeConditions = scopeConditions;
+exports.scopeDefaults = scopeDefaults;
+//# sourceMappingURL=internal.cjs.map
+//# sourceMappingURL=internal.cjs.map