@orthacms/utils-server 0.4.3 → 0.5.0

package/dist/index.d.ts

@@ -1,4 +1,5 @@
 export { parseFilterTree } from './lib/filters/parse-filter-tree';
+export { FILTER_MAX_LENGTH } from './lib/filters/budgets';
 export { applyFilterTree, type ApplyFilterTreeOptions, type FilterExtensionResolver } from './lib/filters/tree-to-drizzle';
 export type { DbLike, TableLike } from './lib/filters/table-helpers';
 export { FilterOperator, ScalarFieldType, RelationKind, WithinLastUnit } from './lib/filters/types';

package/dist/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,eAAe,EAAE,MAAM,iCAAiC,CAAC;AAClE,OAAO,EACH,eAAe,EACf,KAAK,sBAAsB,EAC3B,KAAK,uBAAuB,EAC/B,MAAM,+BAA+B,CAAC;AACvC,YAAY,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,6BAA6B,CAAC;AACrE,OAAO,EACH,cAAc,EACd,eAAe,EACf,YAAY,EACZ,cAAc,EACjB,MAAM,qBAAqB,CAAC;AAC7B,OAAO,EACH,iBAAiB,EACjB,YAAY,EACf,MAAM,gCAAgC,CAAC;AACxC,YAAY,EACR,eAAe,EACf,iBAAiB,EACjB,WAAW,EACX,cAAc,EACd,aAAa,EACb,YAAY,EACZ,UAAU,EACV,WAAW,EACX,UAAU,EACb,MAAM,qBAAqB,CAAC;AAC7B,OAAO,EACH,eAAe,EACf,eAAe,EACf,qBAAqB,EACxB,MAAM,iCAAiC,CAAC;AACzC,OAAO,EAAE,QAAQ,EAAE,MAAM,iBAAiB,CAAC;AAC3C,OAAO,EACH,qBAAqB,EACrB,iBAAiB,EACjB,kBAAkB,EACrB,MAAM,iBAAiB,CAAC;AACzB,OAAO,EACH,OAAO,EACP,UAAU,EACV,eAAe,EACf,uBAAuB,EACvB,QAAQ,EACR,gBAAgB,EAChB,QAAQ,EACR,cAAc,EACd,WAAW,EACX,YAAY,EACZ,IAAI,EACJ,OAAO,EACP,SAAS,EACT,KAAK,OAAO,EACf,MAAM,WAAW,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,eAAe,EAAE,MAAM,iCAAiC,CAAC;AAClE,OAAO,EAAE,iBAAiB,EAAE,MAAM,uBAAuB,CAAC;AAC1D,OAAO,EACH,eAAe,EACf,KAAK,sBAAsB,EAC3B,KAAK,uBAAuB,EAC/B,MAAM,+BAA+B,CAAC;AACvC,YAAY,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,6BAA6B,CAAC;AACrE,OAAO,EACH,cAAc,EACd,eAAe,EACf,YAAY,EACZ,cAAc,EACjB,MAAM,qBAAqB,CAAC;AAC7B,OAAO,EACH,iBAAiB,EACjB,YAAY,EACf,MAAM,gCAAgC,CAAC;AACxC,YAAY,EACR,eAAe,EACf,iBAAiB,EACjB,WAAW,EACX,cAAc,EACd,aAAa,EACb,YAAY,EACZ,UAAU,EACV,WAAW,EACX,UAAU,EACb,MAAM,qBAAqB,CAAC;AAC7B,OAAO,EACH,eAAe,EACf,eAAe,EACf,qBAAqB,EACxB,MAAM,iCAAiC,CAAC;AACzC,OAAO,EAAE,QAAQ,EAAE,MAAM,iBAAiB,CAAC;AAC3C,OAAO,EACH,qBAAqB,EACrB,iBAAiB,EACjB,kBAAkB,EACrB,MAAM,iBAAiB,CAAC;AACzB,OAAO,EACH,OAAO,EACP,UAAU,EACV,eAAe,EACf,uBAAuB,EACvB,QAAQ,EACR,gBAAgB,EAChB,QAAQ,EACR,cAAc,EACd,WAAW,EACX,YAAY,EACZ,IAAI,EACJ,OAAO,EACP,SAAS,EACT,KAAK,OAAO,EACf,MAAM,WAAW,CAAC"}

package/dist/index.js

@@ -1,8 +1,10 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.NODE_ENVS = exports.defined = exports.when = exports.isProduction = exports.readNodeEnv = exports.readTrustProxy = exports.readFlag = exports.readOptionalList = exports.readList = exports.readOptionalPositiveInt = exports.readPositiveInt = exports.requireEnv = exports.readEnv = exports.violatedConstraint = exports.isUniqueViolation = exports.isForeignKeyViolation = exports.clampInt = exports.FilterSchemaException = exports.FilterErrorCode = exports.FilterException = exports.operatorsFor = exports.OPERATORS_BY_TYPE = exports.WithinLastUnit = exports.RelationKind = exports.ScalarFieldType = exports.FilterOperator = exports.applyFilterTree = exports.parseFilterTree = void 0;
+exports.NODE_ENVS = exports.defined = exports.when = exports.isProduction = exports.readNodeEnv = exports.readTrustProxy = exports.readFlag = exports.readOptionalList = exports.readList = exports.readOptionalPositiveInt = exports.readPositiveInt = exports.requireEnv = exports.readEnv = exports.violatedConstraint = exports.isUniqueViolation = exports.isForeignKeyViolation = exports.clampInt = exports.FilterSchemaException = exports.FilterErrorCode = exports.FilterException = exports.operatorsFor = exports.OPERATORS_BY_TYPE = exports.WithinLastUnit = exports.RelationKind = exports.ScalarFieldType = exports.FilterOperator = exports.applyFilterTree = exports.FILTER_MAX_LENGTH = exports.parseFilterTree = void 0;
 var parse_filter_tree_1 = require("./lib/filters/parse-filter-tree");
 Object.defineProperty(exports, "parseFilterTree", { enumerable: true, get: function () { return parse_filter_tree_1.parseFilterTree; } });
+var budgets_1 = require("./lib/filters/budgets");
+Object.defineProperty(exports, "FILTER_MAX_LENGTH", { enumerable: true, get: function () { return budgets_1.FILTER_MAX_LENGTH; } });
 var tree_to_drizzle_1 = require("./lib/filters/tree-to-drizzle");
 Object.defineProperty(exports, "applyFilterTree", { enumerable: true, get: function () { return tree_to_drizzle_1.applyFilterTree; } });
 var types_1 = require("./lib/filters/types");

package/dist/lib/filters/budgets.d.ts

@@ -0,0 +1,79 @@
+/**
+ * Every ceiling the filter engine imposes, in one place.
+ *
+ * The engine's job is to accept a tree a stranger wrote. What stops that tree
+ * from being unbounded work is this file — nothing else. Four of these budgets
+ * count *structure* (how many rules, how deep, how long an `IN` list); the
+ * fifth counts *text*, and it was missing.
+ *
+ * ## What the DTO cap covers, and what it does not
+ *
+ * {@link FILTER_MAX_LENGTH} is the cap a caller's DTO puts on the whole
+ * serialised filter — `@MaxLength(FILTER_MAX_LENGTH)` on `?filter=`. It lives
+ * here rather than in each plugin because it was declared separately in four of
+ * them and one copy had drifted to 8192, so "the filter cap" meant two numbers
+ * depending on which endpoint you asked.
+ *
+ * It is a **transport** guard, and it only guards the paths where the filter
+ * arrives as a string. It does not reach:
+ *
+ * - **Alarm rules.** `CreateAlarmRuleDto.filter` is an already-parsed object
+ *   (`@IsObject()`), because the authority on a filter tree's shape is this
+ *   parser rather than a second copy of the grammar in decorators. `@MaxLength`
+ *   is a string decorator and could not be applied to it.
+ * - **A stored alarm rule replayed from its `jsonb` column** — by the outbox
+ *   subscriber, the periodic sweep, or `POST /rules/:id/rescan`. Nothing
+ *   re-serialises it on the way out of the database, so there is no string to
+ *   measure.
+ * - **The copilot's `admin_content_search` tool.** Its `filter` argument is an
+ *   object too, and the registry's input check deliberately ignores `anyOf`, so
+ *   the tree's contents reach the parser unexamined.
+ * - **GraphQL's entry loader**, which builds an id-`in` tree in code and casts
+ *   past the DTO.
+ *
+ * On those four paths the parser *is* the boundary. That is why
+ * {@link DEFAULT_MAX_VALUE_LENGTH} exists: a budget declared on the DTO
+ * protects the endpoints that happen to have one, and a budget declared here
+ * protects every caller there will ever be.
+ */
+/**
+ * Max length of a serialised filter payload, for the `@MaxLength` a caller
+ * puts on its own `?filter=` / `filter` DTO field.
+ *
+ * A coarse first latch ahead of the engine's own budgets: it refuses an
+ * oversized payload before `JSON.parse` sees it. It is deliberately generous —
+ * roughly a hundred UUID clauses — because it is not the real bound; the node,
+ * depth, list and value budgets below are.
+ *
+ * **The one number, and every DTO imports it from here.** `activity`,
+ * `content` and `users` each declared their own `4096` and `alarms` a `8192`
+ * that was applied to nothing at all; four declarations of one rule is three
+ * chances to answer a caller differently on two endpoints for the same filter.
+ */
+export declare const FILTER_MAX_LENGTH = 4096;
+/** Default `schema.maxDepth` — how many dotted relation hops a path may walk. */
+export declare const DEFAULT_MAX_DEPTH = 3;
+/** Default `schema.maxNodes` — how many groups + rules one tree may hold. */
+export declare const DEFAULT_MAX_NODES = 50;
+/** Default `schema.maxGroupDepth` — how deep `and`/`or` nesting may go. */
+export declare const DEFAULT_MAX_GROUP_DEPTH = 5;
+/** Default `schema.maxInListLength` — how many values one `in`/`nin` may name. */
+export declare const DEFAULT_MAX_IN_LIST = 100;
+/**
+ * Default `schema.maxValueLength` — how long one clause's **string** value may
+ * be, applied to each element of an `in` list as well as to a bare scalar.
+ *
+ * The number is {@link FILTER_MAX_LENGTH} on purpose, and the equality is the
+ * argument for it: a filter that arrives as a string is already capped at that
+ * length in total, so no value inside one can be longer. This budget therefore
+ * cannot refuse anything an HTTP caller could already send — it exists for the
+ * paths listed at the top of this file, which never meet the DTO at all, and
+ * where the alternative bound was the 1 MB body limit.
+ *
+ * What it stops is a single arbitrarily long `LIKE` pattern: `~~` is scanned
+ * against every candidate row, so the cost of one clause is the pattern's
+ * length times the table's, and nothing above the parser was measuring the
+ * first factor.
+ */
+export declare const DEFAULT_MAX_VALUE_LENGTH = 4096;
+//# sourceMappingURL=budgets.d.ts.map

package/dist/lib/filters/budgets.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"budgets.d.ts","sourceRoot":"","sources":["../../../src/lib/filters/budgets.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAqCG;AAEH;;;;;;;;;;;;;GAaG;AACH,eAAO,MAAM,iBAAiB,OAAO,CAAC;AAEtC,iFAAiF;AACjF,eAAO,MAAM,iBAAiB,IAAI,CAAC;AAEnC,6EAA6E;AAC7E,eAAO,MAAM,iBAAiB,KAAK,CAAC;AAEpC,2EAA2E;AAC3E,eAAO,MAAM,uBAAuB,IAAI,CAAC;AAEzC,kFAAkF;AAClF,eAAO,MAAM,mBAAmB,MAAM,CAAC;AAEvC;;;;;;;;;;;;;;;GAeG;AACH,eAAO,MAAM,wBAAwB,OAAoB,CAAC"}

package/dist/lib/filters/budgets.js

@@ -0,0 +1,81 @@
+"use strict";
+/**
+ * Every ceiling the filter engine imposes, in one place.
+ *
+ * The engine's job is to accept a tree a stranger wrote. What stops that tree
+ * from being unbounded work is this file — nothing else. Four of these budgets
+ * count *structure* (how many rules, how deep, how long an `IN` list); the
+ * fifth counts *text*, and it was missing.
+ *
+ * ## What the DTO cap covers, and what it does not
+ *
+ * {@link FILTER_MAX_LENGTH} is the cap a caller's DTO puts on the whole
+ * serialised filter — `@MaxLength(FILTER_MAX_LENGTH)` on `?filter=`. It lives
+ * here rather than in each plugin because it was declared separately in four of
+ * them and one copy had drifted to 8192, so "the filter cap" meant two numbers
+ * depending on which endpoint you asked.
+ *
+ * It is a **transport** guard, and it only guards the paths where the filter
+ * arrives as a string. It does not reach:
+ *
+ * - **Alarm rules.** `CreateAlarmRuleDto.filter` is an already-parsed object
+ *   (`@IsObject()`), because the authority on a filter tree's shape is this
+ *   parser rather than a second copy of the grammar in decorators. `@MaxLength`
+ *   is a string decorator and could not be applied to it.
+ * - **A stored alarm rule replayed from its `jsonb` column** — by the outbox
+ *   subscriber, the periodic sweep, or `POST /rules/:id/rescan`. Nothing
+ *   re-serialises it on the way out of the database, so there is no string to
+ *   measure.
+ * - **The copilot's `admin_content_search` tool.** Its `filter` argument is an
+ *   object too, and the registry's input check deliberately ignores `anyOf`, so
+ *   the tree's contents reach the parser unexamined.
+ * - **GraphQL's entry loader**, which builds an id-`in` tree in code and casts
+ *   past the DTO.
+ *
+ * On those four paths the parser *is* the boundary. That is why
+ * {@link DEFAULT_MAX_VALUE_LENGTH} exists: a budget declared on the DTO
+ * protects the endpoints that happen to have one, and a budget declared here
+ * protects every caller there will ever be.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.DEFAULT_MAX_VALUE_LENGTH = exports.DEFAULT_MAX_IN_LIST = exports.DEFAULT_MAX_GROUP_DEPTH = exports.DEFAULT_MAX_NODES = exports.DEFAULT_MAX_DEPTH = exports.FILTER_MAX_LENGTH = void 0;
+/**
+ * Max length of a serialised filter payload, for the `@MaxLength` a caller
+ * puts on its own `?filter=` / `filter` DTO field.
+ *
+ * A coarse first latch ahead of the engine's own budgets: it refuses an
+ * oversized payload before `JSON.parse` sees it. It is deliberately generous —
+ * roughly a hundred UUID clauses — because it is not the real bound; the node,
+ * depth, list and value budgets below are.
+ *
+ * **The one number, and every DTO imports it from here.** `activity`,
+ * `content` and `users` each declared their own `4096` and `alarms` a `8192`
+ * that was applied to nothing at all; four declarations of one rule is three
+ * chances to answer a caller differently on two endpoints for the same filter.
+ */
+exports.FILTER_MAX_LENGTH = 4096;
+/** Default `schema.maxDepth` — how many dotted relation hops a path may walk. */
+exports.DEFAULT_MAX_DEPTH = 3;
+/** Default `schema.maxNodes` — how many groups + rules one tree may hold. */
+exports.DEFAULT_MAX_NODES = 50;
+/** Default `schema.maxGroupDepth` — how deep `and`/`or` nesting may go. */
+exports.DEFAULT_MAX_GROUP_DEPTH = 5;
+/** Default `schema.maxInListLength` — how many values one `in`/`nin` may name. */
+exports.DEFAULT_MAX_IN_LIST = 100;
+/**
+ * Default `schema.maxValueLength` — how long one clause's **string** value may
+ * be, applied to each element of an `in` list as well as to a bare scalar.
+ *
+ * The number is {@link FILTER_MAX_LENGTH} on purpose, and the equality is the
+ * argument for it: a filter that arrives as a string is already capped at that
+ * length in total, so no value inside one can be longer. This budget therefore
+ * cannot refuse anything an HTTP caller could already send — it exists for the
+ * paths listed at the top of this file, which never meet the DTO at all, and
+ * where the alternative bound was the 1 MB body limit.
+ *
+ * What it stops is a single arbitrarily long `LIKE` pattern: `~~` is scanned
+ * against every candidate row, so the cost of one clause is the pattern's
+ * length times the table's, and nothing above the parser was measuring the
+ * first factor.
+ */
+exports.DEFAULT_MAX_VALUE_LENGTH = exports.FILTER_MAX_LENGTH;

package/dist/lib/filters/filter-exceptions.d.ts

@@ -39,6 +39,13 @@ export declare const FilterErrorCode: {
     readonly EmptyInList: "FILTER_EMPTY_IN_LIST";
     /** `in`/`nin` value list exceeded `schema.maxInListLength` (default 100). */
     readonly MaxInListExceeded: "FILTER_MAX_IN_LIST_EXCEEDED";
+    /**
+     * A single clause's string value exceeded `schema.maxValueLength`
+     * (default 4096) — the engine's only budget over *text* rather than over
+     * the tree's structure. Reported per clause, naming the offending path, so
+     * a client can point at the rule rather than at the whole filter.
+     */
+    readonly ValueTooLong: "FILTER_VALUE_TOO_LONG";
 };
 /** One of the {@link FilterErrorCode} values. */
 export type FilterErrorCode = (typeof FilterErrorCode)[keyof typeof FilterErrorCode];

package/dist/lib/filters/filter-exceptions.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"filter-exceptions.d.ts","sourceRoot":"","sources":["../../../src/lib/filters/filter-exceptions.ts"],"names":[],"mappings":"AAAA,OAAO,EACH,mBAAmB,EACnB,4BAA4B,EAC/B,MAAM,gBAAgB,CAAC;AAExB,sDAAsD;AACtD,eAAO,MAAM,eAAe;IACxB,2DAA2D;;IAE3D,mDAAmD;;IAEnD,iDAAiD;;IAEjD,sDAAsD;;IAEtD;;;;;;OAMG;;IAEH,8DAA8D;;IAE9D,oEAAoE;;IAEpE,uEAAuE;;IAEvE,uDAAuD;;IAEvD,2DAA2D;;IAE3D,oDAAoD;;IAEpD,iEAAiE;;IAEjE;;;;OAIG;;IAEH,6EAA6E;;CAEvE,CAAC;AAEX,iDAAiD;AACjD,MAAM,MAAM,eAAe,GACvB,CAAC,OAAO,eAAe,CAAC,CAAC,MAAM,OAAO,eAAe,CAAC,CAAC;AAE3D;;;;;;;;;;;;;;;;;;GAkBG;AACH,qBAAa,eAAgB,SAAQ,mBAAmB;IACpD,uCAAuC;IACvC,SAAgB,IAAI,EAAE,eAAe,CAAC;IACtC,yDAAyD;IACzD,SAAgB,OAAO,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC;gBAGvD,IAAI,EAAE,eAAe,EACrB,OAAO,EAAE,MAAM,EACf,OAAO,GAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAM;CAkB5C;AAED;;;;;;;;;;;;;;;GAeG;AACH,qBAAa,qBAAsB,SAAQ,4BAA4B;IACnE,wEAAwE;IACxE,SAAgB,IAAI,2BAA2B;gBAEnC,OAAO,EAAE,MAAM;CAQ9B"}
+{"version":3,"file":"filter-exceptions.d.ts","sourceRoot":"","sources":["../../../src/lib/filters/filter-exceptions.ts"],"names":[],"mappings":"AAAA,OAAO,EACH,mBAAmB,EACnB,4BAA4B,EAC/B,MAAM,gBAAgB,CAAC;AAExB,sDAAsD;AACtD,eAAO,MAAM,eAAe;IACxB,2DAA2D;;IAE3D,mDAAmD;;IAEnD,iDAAiD;;IAEjD,sDAAsD;;IAEtD;;;;;;OAMG;;IAEH,8DAA8D;;IAE9D,oEAAoE;;IAEpE,uEAAuE;;IAEvE,uDAAuD;;IAEvD,2DAA2D;;IAE3D,oDAAoD;;IAEpD,iEAAiE;;IAEjE;;;;OAIG;;IAEH,6EAA6E;;IAE7E;;;;;OAKG;;CAEG,CAAC;AAEX,iDAAiD;AACjD,MAAM,MAAM,eAAe,GACvB,CAAC,OAAO,eAAe,CAAC,CAAC,MAAM,OAAO,eAAe,CAAC,CAAC;AAE3D;;;;;;;;;;;;;;;;;;GAkBG;AACH,qBAAa,eAAgB,SAAQ,mBAAmB;IACpD,uCAAuC;IACvC,SAAgB,IAAI,EAAE,eAAe,CAAC;IACtC,yDAAyD;IACzD,SAAgB,OAAO,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC;gBAGvD,IAAI,EAAE,eAAe,EACrB,OAAO,EAAE,MAAM,EACf,OAAO,GAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAM;CAkB5C;AAED;;;;;;;;;;;;;;;GAeG;AACH,qBAAa,qBAAsB,SAAQ,4BAA4B;IACnE,wEAAwE;IACxE,SAAgB,IAAI,2BAA2B;gBAEnC,OAAO,EAAE,MAAM;CAQ9B"}

package/dist/lib/filters/filter-exceptions.js

@@ -41,7 +41,14 @@ exports.FilterErrorCode = {
      */
     EmptyInList: 'FILTER_EMPTY_IN_LIST',
     /** `in`/`nin` value list exceeded `schema.maxInListLength` (default 100). */
-    MaxInListExceeded: 'FILTER_MAX_IN_LIST_EXCEEDED'
+    MaxInListExceeded: 'FILTER_MAX_IN_LIST_EXCEEDED',
+    /**
+     * A single clause's string value exceeded `schema.maxValueLength`
+     * (default 4096) — the engine's only budget over *text* rather than over
+     * the tree's structure. Reported per clause, naming the offending path, so
+     * a client can point at the rule rather than at the whole filter.
+     */
+    ValueTooLong: 'FILTER_VALUE_TOO_LONG'
 };
 /**
  * Typed 400 exception thrown by the filter parser.

package/dist/lib/filters/parse-filter-tree.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"parse-filter-tree.d.ts","sourceRoot":"","sources":["../../../src/lib/filters/parse-filter-tree.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,YAAY,EAAgB,UAAU,EAAE,MAAM,SAAS,CAAC;AAOtE;;;;;;;;;;;;;GAaG;AACH,wBAAgB,eAAe,CAC3B,SAAS,EAAE,OAAO,EAClB,MAAM,EAAE,YAAY,GACrB,UAAU,GAAG,IAAI,CAoCnB"}
+{"version":3,"file":"parse-filter-tree.d.ts","sourceRoot":"","sources":["../../../src/lib/filters/parse-filter-tree.ts"],"names":[],"mappings":"AASA,OAAO,KAAK,EAAE,YAAY,EAAgB,UAAU,EAAE,MAAM,SAAS,CAAC;AAEtE;;;;;;;;;;;;;GAaG;AACH,wBAAgB,eAAe,CAC3B,SAAS,EAAE,OAAO,EAClB,MAAM,EAAE,YAAY,GACrB,UAAU,GAAG,IAAI,CAqCnB"}

package/dist/lib/filters/parse-filter-tree.js

@@ -1,12 +1,9 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.parseFilterTree = parseFilterTree;
+const budgets_1 = require("./budgets");
 const filter_exceptions_1 = require("./filter-exceptions");
 const resolve_leaf_1 = require("./resolve-leaf");
-const DEFAULT_MAX_DEPTH = 3;
-const DEFAULT_MAX_NODES = 50;
-const DEFAULT_MAX_GROUP_DEPTH = 5;
-const DEFAULT_MAX_IN_LIST = 100;
 /**
  * Parse a `filter` payload into a tree the translator can walk. Two
  * input shapes are accepted:
@@ -44,10 +41,11 @@ function parseFilterTree(rawFilter, schema) {
         return null;
     const ctx = {
         nodeCount: 0,
-        maxNodes: schema.maxNodes ?? DEFAULT_MAX_NODES,
-        maxGroupDepth: schema.maxGroupDepth ?? DEFAULT_MAX_GROUP_DEPTH,
-        maxDepth: schema.maxDepth ?? DEFAULT_MAX_DEPTH,
-        maxInListLength: schema.maxInListLength ?? DEFAULT_MAX_IN_LIST
+        maxNodes: schema.maxNodes ?? budgets_1.DEFAULT_MAX_NODES,
+        maxGroupDepth: schema.maxGroupDepth ?? budgets_1.DEFAULT_MAX_GROUP_DEPTH,
+        maxDepth: schema.maxDepth ?? budgets_1.DEFAULT_MAX_DEPTH,
+        maxInListLength: schema.maxInListLength ?? budgets_1.DEFAULT_MAX_IN_LIST,
+        maxValueLength: schema.maxValueLength ?? budgets_1.DEFAULT_MAX_VALUE_LENGTH
     };
     return walkNode(obj, schema, 0, ctx);
 }
@@ -97,7 +95,7 @@ function walkNode(raw, schema, depth, ctx) {
             throw new filter_exceptions_1.FilterException(filter_exceptions_1.FilterErrorCode.InvalidNode, 'rule `op` must be a non-empty string');
         }
         const path = field.split('.');
-        const leaf = (0, resolve_leaf_1.resolveLeaf)(path, op, node.value, schema, ctx.maxDepth, ctx.maxInListLength);
+        const leaf = (0, resolve_leaf_1.resolveLeaf)(path, op, node.value, schema, ctx);
         return toRule(leaf);
     }
     throw new filter_exceptions_1.FilterException(filter_exceptions_1.FilterErrorCode.InvalidNode, 'tree node must have `and`, `or`, or (`field` + `op`)');

package/dist/lib/filters/resolve-leaf.d.ts

@@ -1,8 +1,21 @@
 import type { FilterSchema, ParsedFilter } from './types';
+/**
+ * The per-leaf budgets, passed as one object rather than as a growing tail of
+ * positional numbers — three `number` parameters in a row is a call site where
+ * transposing two of them typechecks.
+ */
+export interface LeafLimits {
+    /** How many dotted relation hops the path may walk. */
+    maxDepth: number;
+    /** How many values one `in`/`nin` may name. */
+    maxInListLength: number;
+    /** How long one string value may be — see `budgets.ts`. */
+    maxValueLength: number;
+}
 /**
  * Walk a single dotted path against the schema, validate the operator,
  * and coerce the value to the declared type. Produces the `ParsedFilter`
  * leaf shape the tree parser tags with `kind: 'rule'`.
  */
-export declare function resolveLeaf(path: string[], op: string, value: unknown, schema: FilterSchema, maxDepth: number, maxInListLength: number): ParsedFilter;
+export declare function resolveLeaf(path: string[], op: string, value: unknown, schema: FilterSchema, limits: LeafLimits): ParsedFilter;
 //# sourceMappingURL=resolve-leaf.d.ts.map

package/dist/lib/filters/resolve-leaf.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"resolve-leaf.d.ts","sourceRoot":"","sources":["../../../src/lib/filters/resolve-leaf.ts"],"names":[],"mappings":"AAQA,OAAO,KAAK,EACR,YAAY,EACZ,YAAY,EAGf,MAAM,SAAS,CAAC;AAQjB;;;;GAIG;AACH,wBAAgB,WAAW,CACvB,IAAI,EAAE,MAAM,EAAE,EACd,EAAE,EAAE,MAAM,EACV,KAAK,EAAE,OAAO,EACd,MAAM,EAAE,YAAY,EACpB,QAAQ,EAAE,MAAM,EAChB,eAAe,EAAE,MAAM,GACxB,YAAY,CAkEd"}
+{"version":3,"file":"resolve-leaf.d.ts","sourceRoot":"","sources":["../../../src/lib/filters/resolve-leaf.ts"],"names":[],"mappings":"AAQA,OAAO,KAAK,EACR,YAAY,EACZ,YAAY,EAGf,MAAM,SAAS,CAAC;AAQjB;;;;GAIG;AACH,MAAM,WAAW,UAAU;IACvB,uDAAuD;IACvD,QAAQ,EAAE,MAAM,CAAC;IACjB,+CAA+C;IAC/C,eAAe,EAAE,MAAM,CAAC;IACxB,2DAA2D;IAC3D,cAAc,EAAE,MAAM,CAAC;CAC1B;AAED;;;;GAIG;AACH,wBAAgB,WAAW,CACvB,IAAI,EAAE,MAAM,EAAE,EACd,EAAE,EAAE,MAAM,EACV,KAAK,EAAE,OAAO,EACd,MAAM,EAAE,YAAY,EACpB,MAAM,EAAE,UAAU,GACnB,YAAY,CA6Dd"}

package/dist/lib/filters/resolve-leaf.js

@@ -13,7 +13,8 @@ const UUID_CANONICAL = /^[0-9a-f]{8}-[0-9a-f]{4}-[0-9a-f]{4}-[0-9a-f]{4}-[0-9a-f
  * and coerce the value to the declared type. Produces the `ParsedFilter`
  * leaf shape the tree parser tags with `kind: 'rule'`.
  */
-function resolveLeaf(path, op, value, schema, maxDepth, maxInListLength) {
+function resolveLeaf(path, op, value, schema, limits) {
+    const { maxDepth } = limits;
     if (path.length === 0) {
         throw new filter_exceptions_1.FilterException(filter_exceptions_1.FilterErrorCode.EmptyPath, 'empty filter path');
     }
@@ -37,7 +38,7 @@ function resolveLeaf(path, op, value, schema, maxDepth, maxInListLength) {
             return {
                 path,
                 op: op,
-                value: coerce(value, field, op, path, maxInListLength)
+                value: coerce(value, field, op, path, limits)
             };
         }
         const rel = (0, own_property_1.own)(relations, seg);
@@ -69,7 +70,8 @@ function assertOperatorAllowed(field, op, path) {
     }
     throw new filter_exceptions_1.FilterException(filter_exceptions_1.FilterErrorCode.OperatorNotAllowed, `operator "${op}" is not available on "${path.join('.')}" (a ${field.type} field)`, { path: path.join('.'), op, fieldType: field.type, allowed });
 }
-function coerce(raw, field, op, path, maxInListLength) {
+function coerce(raw, field, op, path, limits) {
+    const { maxInListLength } = limits;
     const pathStr = path.join('.');
     if (op === types_1.FilterOperator.WithinLast) {
         return withinLastValue(raw, pathStr);
@@ -99,9 +101,9 @@ function coerce(raw, field, op, path, maxInListLength) {
         if (items.length > maxInListLength) {
             throw new filter_exceptions_1.FilterException(filter_exceptions_1.FilterErrorCode.MaxInListExceeded, `${op} value list exceeds max length ${maxInListLength}`, { path: pathStr, op, maxInListLength, length: items.length });
         }
-        return items.map((v) => scalarOf(v, field, pathStr));
+        return items.map((v) => scalarOf(v, field, pathStr, limits));
     }
-    return scalarOf(raw, field, pathStr);
+    return scalarOf(raw, field, pathStr, limits);
 }
 /** Units a `within_last` window may name, as a set for membership checks. */
 const WITHIN_LAST_UNITS = new Set(Object.values(types_1.WithinLastUnit));
@@ -131,7 +133,7 @@ function withinLastValue(raw, pathStr) {
     }
     return { n, unit: unit };
 }
-function scalarOf(v, field, pathStr) {
+function scalarOf(v, field, pathStr, limits) {
     // A filter value has to be a scalar. `String(v)` on anything else produces
     // a plausible-looking string that is then MATCHED AGAINST rather than
     // rejected: `null` → `"null"`, a missing `value` key → `"undefined"`,
@@ -148,7 +150,24 @@ function scalarOf(v, field, pathStr) {
             ? 'value is required'
             : 'value must be a string, number or boolean', { path: pathStr, expectedType: field.type });
     }
+    // The only budget that counts *text*. Every other ceiling in this engine
+    // bounds the tree's structure — nodes, hops, group nesting, `in` list
+    // length — and a single clause can carry an arbitrarily long string through
+    // all of them. On the endpoints that own a DTO the `@MaxLength` on the
+    // whole serialised filter caps this first; on the paths that never meet one
+    // (an alarm rule replayed out of its `jsonb` column, the copilot's search
+    // tool, an internally-built tree) this check is the only bound there is,
+    // and the alternative was the 1 MB body limit. Applied to a `number` or
+    // `boolean` too, which is free: their `String(v)` is a handful of
+    // characters and can never trip it.
     const s = typeof v === 'string' ? v : String(v);
+    if (s.length > limits.maxValueLength) {
+        throw new filter_exceptions_1.FilterException(filter_exceptions_1.FilterErrorCode.ValueTooLong, `value exceeds max length ${limits.maxValueLength}`, {
+            path: pathStr,
+            maxValueLength: limits.maxValueLength,
+            length: s.length
+        });
+    }
     switch (field.type) {
         case types_1.ScalarFieldType.String:
             return s;

package/dist/lib/filters/types.d.ts

@@ -202,6 +202,16 @@ export interface FilterSchema {
      * elements inside one rule's value list).
      */
     maxInListLength?: number;
+    /**
+     * Longest string one clause's value may be — applied to each element of an
+     * `in` list as well as to a bare scalar. Defaults to 4096.
+     *
+     * The engine's only ceiling over **text**. Every other budget here bounds
+     * the tree's *structure*, and a caller that never passes a DTO (an alarm
+     * rule replayed out of storage, the copilot's search tool) can carry a
+     * megabyte-long `LIKE` pattern through all of them.
+     */
+    maxValueLength?: number;
 }
 /** Time units a {@link FilterOperator.WithinLast} window may be measured in. */
 export declare const WithinLastUnit: {

package/dist/lib/filters/types.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../src/lib/filters/types.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,aAAa,CAAC;AACzD,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,iBAAiB,CAAC;AAEjD;;;;;;;;;GASG;AACH,MAAM,MAAM,aAAa,GAAG,CAAC,MAAM,EAAE,SAAS,KAAK,GAAG,GAAG,SAAS,CAAC;AAEnE,8EAA8E;AAC9E,eAAO,MAAM,cAAc;;;;;;;;;;;;;IAavB;;;;;;;;;;;;OAYG;;CAEG,CAAC;AAEX,8EAA8E;AAC9E,MAAM,MAAM,cAAc,GACtB,CAAC,OAAO,cAAc,CAAC,CAAC,MAAM,OAAO,cAAc,CAAC,CAAC;AAEzD,+DAA+D;AAC/D,eAAO,MAAM,eAAe;;;;;;;CAOlB,CAAC;AAEX,oDAAoD;AACpD,MAAM,MAAM,eAAe,GACvB,CAAC,OAAO,eAAe,CAAC,CAAC,MAAM,OAAO,eAAe,CAAC,CAAC;AAE3D,sEAAsE;AACtE,eAAO,MAAM,YAAY;;;;;;CAMf,CAAC;AAEX,0CAA0C;AAC1C,MAAM,MAAM,YAAY,GAAG,CAAC,OAAO,YAAY,CAAC,CAAC,MAAM,OAAO,YAAY,CAAC,CAAC;AAE5E;;;;;;;;GAQG;AACH,MAAM,WAAW,iBAAiB;IAC9B,+DAA+D;IAC/D,IAAI,EAAE,eAAe,CAAC;IACtB,uCAAuC;IACvC,UAAU,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;CAClC;AAED,oCAAoC;AACpC,MAAM,MAAM,WAAW,GAAG,MAAM,CAAC,MAAM,EAAE,iBAAiB,CAAC,CAAC;AAE5D;;;GAGG;AACH,MAAM,MAAM,cAAc,GACpB;IACI,iEAAiE;IACjE,IAAI,EAAE,YAAY,GAAG,aAAa,CAAC;IACnC,sCAAsC;IACtC,KAAK,EAAE,KAAK,CAAC;IACb,0DAA0D;IAC1D,EAAE,EAAE,SAAS,CAAC;IACd,oDAAoD;IACpD,SAAS,CAAC,EAAE,SAAS,CAAC;IACtB;;;;;;OAMG;IACH,KAAK,CAAC,EAAE,aAAa,CAAC;IACtB,MAAM,CAAC,EAAE,WAAW,CAAC;IACrB,SAAS,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC;CAC9C,GACD;IACI,mCAAmC;IACnC,IAAI,EAAE,aAAa,CAAC;IACpB,oBAAoB;IACpB,KAAK,EAAE,KAAK,CAAC;IACb,mEAAmE;IACnE,EAAE,EAAE,SAAS,CAAC;IACd,oDAAoD;IACpD,SAAS,CAAC,EAAE,SAAS,CAAC;IACtB,gEAAgE;IAChE,KAAK,CAAC,EAAE,aAAa,CAAC;IACtB,MAAM,CAAC,EAAE,WAAW,CAAC;IACrB,SAAS,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC;CAC9C,GACD;IACI,gEAAgE;IAChE,IAAI,EAAE,cAAc,CAAC;IACrB,gCAAgC;IAChC,OAAO,EAAE,KAAK,CAAC;IACf,wDAAwD;IACxD,EAAE,EAAE,SAAS,CAAC;IACd,wDAAwD;IACxD,QAAQ,EAAE,SAAS,CAAC;IACpB,+DAA+D;IAC/D,KAAK,CAAC,EAAE,KAAK,CAAC;IACd,SAAS,CAAC,EAAE,SAAS,CAAC;IACtB,SAAS,CAAC,EAAE,SAAS,CAAC;IACtB;;;;;;OAMG;IACH,KAAK,CAAC,EAAE,aAAa,CAAC;IACtB,MAAM,CAAC,EAAE,WAAW,CAAC;IACrB,SAAS,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC;CAC9C,GACD;IACI,uDAAuD;IACvD,IAAI,EAAE,kBAAkB,CAAC;IACzB,yCAAyC;IACzC,KAAK,EAAE,KAAK,CAAC;IACb,4DAA4D;IAC5D,EAAE,EAAE,SAAS,CAAC;IACd;;;;;OAKG;IACH,KAAK,EAAE,MAAM,CAAC;IACd;;;;OAIG;IACH,KAAK,CAAC,EAAE,aAAa,CAAC;IACtB,MAAM,CAAC,EAAE,WAAW,CAAC;IACrB,SAAS,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC;CAC9C,CAAC;AAER,8CAA8C;AAC9C,MAAM,WAAW,YAAY;IACzB,wCAAwC;IACxC,MAAM,CAAC,EAAE,WAAW,CAAC;IACrB,iDAAiD;IACjD,SAAS,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC;IAC3C;;;;;;;;;;;OAWG;IACH,eAAe,CAAC,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC;IACtC,gDAAgD;IAChD,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB;;;;OAIG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB;;;;OAIG;IACH,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB;;;;;OAKG;IACH,eAAe,CAAC,EAAE,MAAM,CAAC;CAC5B;AAED,gFAAgF;AAChF,eAAO,MAAM,cAAc;;;;CAIjB,CAAC;AAEX,gDAAgD;AAChD,MAAM,MAAM,cAAc,GACtB,CAAC,OAAO,cAAc,CAAC,CAAC,MAAM,OAAO,cAAc,CAAC,CAAC;AAEzD,iDAAiD;AACjD,MAAM,WAAW,eAAe;IAC5B,kEAAkE;IAClE,CAAC,EAAE,MAAM,CAAC;IACV,kCAAkC;IAClC,IAAI,EAAE,cAAc,CAAC;CACxB;AAED,oDAAoD;AACpD,MAAM,WAAW,YAAY;IACzB,qEAAqE;IACrE,IAAI,EAAE,MAAM,EAAE,CAAC;IACf,0BAA0B;IAC1B,EAAE,EAAE,cAAc,CAAC;IACnB,8EAA8E;IAC9E,KAAK,EAAE,OAAO,CAAC;CAClB;AAED,wEAAwE;AACxE,MAAM,WAAW,UAAW,SAAQ,YAAY;IAC5C,IAAI,EAAE,MAAM,CAAC;CAChB;AAED,gFAAgF;AAChF,MAAM,WAAW,WAAW;IACxB,IAAI,EAAE,OAAO,CAAC;IACd,UAAU,EAAE,KAAK,GAAG,IAAI,CAAC;IACzB,QAAQ,EAAE,UAAU,EAAE,CAAC;CAC1B;AAED;;;;GAIG;AACH,MAAM,MAAM,UAAU,GAAG,UAAU,GAAG,WAAW,CAAC"}
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../src/lib/filters/types.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,aAAa,CAAC;AACzD,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,iBAAiB,CAAC;AAEjD;;;;;;;;;GASG;AACH,MAAM,MAAM,aAAa,GAAG,CAAC,MAAM,EAAE,SAAS,KAAK,GAAG,GAAG,SAAS,CAAC;AAEnE,8EAA8E;AAC9E,eAAO,MAAM,cAAc;;;;;;;;;;;;;IAavB;;;;;;;;;;;;OAYG;;CAEG,CAAC;AAEX,8EAA8E;AAC9E,MAAM,MAAM,cAAc,GACtB,CAAC,OAAO,cAAc,CAAC,CAAC,MAAM,OAAO,cAAc,CAAC,CAAC;AAEzD,+DAA+D;AAC/D,eAAO,MAAM,eAAe;;;;;;;CAOlB,CAAC;AAEX,oDAAoD;AACpD,MAAM,MAAM,eAAe,GACvB,CAAC,OAAO,eAAe,CAAC,CAAC,MAAM,OAAO,eAAe,CAAC,CAAC;AAE3D,sEAAsE;AACtE,eAAO,MAAM,YAAY;;;;;;CAMf,CAAC;AAEX,0CAA0C;AAC1C,MAAM,MAAM,YAAY,GAAG,CAAC,OAAO,YAAY,CAAC,CAAC,MAAM,OAAO,YAAY,CAAC,CAAC;AAE5E;;;;;;;;GAQG;AACH,MAAM,WAAW,iBAAiB;IAC9B,+DAA+D;IAC/D,IAAI,EAAE,eAAe,CAAC;IACtB,uCAAuC;IACvC,UAAU,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;CAClC;AAED,oCAAoC;AACpC,MAAM,MAAM,WAAW,GAAG,MAAM,CAAC,MAAM,EAAE,iBAAiB,CAAC,CAAC;AAE5D;;;GAGG;AACH,MAAM,MAAM,cAAc,GACpB;IACI,iEAAiE;IACjE,IAAI,EAAE,YAAY,GAAG,aAAa,CAAC;IACnC,sCAAsC;IACtC,KAAK,EAAE,KAAK,CAAC;IACb,0DAA0D;IAC1D,EAAE,EAAE,SAAS,CAAC;IACd,oDAAoD;IACpD,SAAS,CAAC,EAAE,SAAS,CAAC;IACtB;;;;;;OAMG;IACH,KAAK,CAAC,EAAE,aAAa,CAAC;IACtB,MAAM,CAAC,EAAE,WAAW,CAAC;IACrB,SAAS,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC;CAC9C,GACD;IACI,mCAAmC;IACnC,IAAI,EAAE,aAAa,CAAC;IACpB,oBAAoB;IACpB,KAAK,EAAE,KAAK,CAAC;IACb,mEAAmE;IACnE,EAAE,EAAE,SAAS,CAAC;IACd,oDAAoD;IACpD,SAAS,CAAC,EAAE,SAAS,CAAC;IACtB,gEAAgE;IAChE,KAAK,CAAC,EAAE,aAAa,CAAC;IACtB,MAAM,CAAC,EAAE,WAAW,CAAC;IACrB,SAAS,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC;CAC9C,GACD;IACI,gEAAgE;IAChE,IAAI,EAAE,cAAc,CAAC;IACrB,gCAAgC;IAChC,OAAO,EAAE,KAAK,CAAC;IACf,wDAAwD;IACxD,EAAE,EAAE,SAAS,CAAC;IACd,wDAAwD;IACxD,QAAQ,EAAE,SAAS,CAAC;IACpB,+DAA+D;IAC/D,KAAK,CAAC,EAAE,KAAK,CAAC;IACd,SAAS,CAAC,EAAE,SAAS,CAAC;IACtB,SAAS,CAAC,EAAE,SAAS,CAAC;IACtB;;;;;;OAMG;IACH,KAAK,CAAC,EAAE,aAAa,CAAC;IACtB,MAAM,CAAC,EAAE,WAAW,CAAC;IACrB,SAAS,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC;CAC9C,GACD;IACI,uDAAuD;IACvD,IAAI,EAAE,kBAAkB,CAAC;IACzB,yCAAyC;IACzC,KAAK,EAAE,KAAK,CAAC;IACb,4DAA4D;IAC5D,EAAE,EAAE,SAAS,CAAC;IACd;;;;;OAKG;IACH,KAAK,EAAE,MAAM,CAAC;IACd;;;;OAIG;IACH,KAAK,CAAC,EAAE,aAAa,CAAC;IACtB,MAAM,CAAC,EAAE,WAAW,CAAC;IACrB,SAAS,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC;CAC9C,CAAC;AAER,8CAA8C;AAC9C,MAAM,WAAW,YAAY;IACzB,wCAAwC;IACxC,MAAM,CAAC,EAAE,WAAW,CAAC;IACrB,iDAAiD;IACjD,SAAS,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC;IAC3C;;;;;;;;;;;OAWG;IACH,eAAe,CAAC,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC;IACtC,gDAAgD;IAChD,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB;;;;OAIG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB;;;;OAIG;IACH,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB;;;;;OAKG;IACH,eAAe,CAAC,EAAE,MAAM,CAAC;IACzB;;;;;;;;OAQG;IACH,cAAc,CAAC,EAAE,MAAM,CAAC;CAC3B;AAED,gFAAgF;AAChF,eAAO,MAAM,cAAc;;;;CAIjB,CAAC;AAEX,gDAAgD;AAChD,MAAM,MAAM,cAAc,GACtB,CAAC,OAAO,cAAc,CAAC,CAAC,MAAM,OAAO,cAAc,CAAC,CAAC;AAEzD,iDAAiD;AACjD,MAAM,WAAW,eAAe;IAC5B,kEAAkE;IAClE,CAAC,EAAE,MAAM,CAAC;IACV,kCAAkC;IAClC,IAAI,EAAE,cAAc,CAAC;CACxB;AAED,oDAAoD;AACpD,MAAM,WAAW,YAAY;IACzB,qEAAqE;IACrE,IAAI,EAAE,MAAM,EAAE,CAAC;IACf,0BAA0B;IAC1B,EAAE,EAAE,cAAc,CAAC;IACnB,8EAA8E;IAC9E,KAAK,EAAE,OAAO,CAAC;CAClB;AAED,wEAAwE;AACxE,MAAM,WAAW,UAAW,SAAQ,YAAY;IAC5C,IAAI,EAAE,MAAM,CAAC;CAChB;AAED,gFAAgF;AAChF,MAAM,WAAW,WAAW;IACxB,IAAI,EAAE,OAAO,CAAC;IACd,UAAU,EAAE,KAAK,GAAG,IAAI,CAAC;IACzB,QAAQ,EAAE,UAAU,EAAE,CAAC;CAC1B;AAED;;;;GAIG;AACH,MAAM,MAAM,UAAU,GAAG,UAAU,GAAG,WAAW,CAAC"}

package/package.json

@@ -1,6 +1,6 @@
 {
     "name": "@orthacms/utils-server",
-    "version": "0.4.3",
+    "version": "0.5.0",
     "description": "@orthacms/utils-server — part of Ortha CMS.",
     "license": "MIT",
     "homepage": "https://github.com/ortha-source/ortha-cms/tree/main/packages/utils/server",