@ahoo-wang/wow-client 9.7.0 → 9.9.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (143) hide show
  1. package/dist/_virtual/{_@oxc-project_runtime@0.151.0 → _@oxc-project_runtime@0.153.0}/helpers/esm/decorate.es.js +1 -1
  2. package/dist/_virtual/{_@oxc-project_runtime@0.151.0 → _@oxc-project_runtime@0.153.0}/helpers/esm/decorateMetadata.es.js +1 -1
  3. package/dist/_virtual/{_@oxc-project_runtime@0.151.0 → _@oxc-project_runtime@0.153.0}/helpers/esm/decorateParam.es.js +1 -1
  4. package/dist/client/command/commandClient.cjs +1 -1
  5. package/dist/client/command/commandClient.es.js +3 -3
  6. package/dist/client/metadata/wowMetadataClient.cjs +1 -1
  7. package/dist/client/metadata/wowMetadataClient.es.js +3 -3
  8. package/dist/client/query/dataset/datasetDescriptorEndpoint.cjs +2 -0
  9. package/dist/client/query/dataset/datasetDescriptorEndpoint.cjs.map +1 -0
  10. package/dist/client/query/dataset/datasetDescriptorEndpoint.d.cts +8 -0
  11. package/dist/client/query/dataset/datasetDescriptorEndpoint.d.ts +8 -0
  12. package/dist/client/query/dataset/datasetDescriptorEndpoint.es.js +34 -0
  13. package/dist/client/query/dataset/datasetDescriptorEndpoint.es.js.map +1 -0
  14. package/dist/client/query/dataset/datasetDirectoryClient.cjs +2 -0
  15. package/dist/client/query/dataset/datasetDirectoryClient.cjs.map +1 -0
  16. package/dist/client/query/dataset/datasetDirectoryClient.d.cts +29 -0
  17. package/dist/client/query/dataset/datasetDirectoryClient.d.ts +29 -0
  18. package/dist/client/query/dataset/datasetDirectoryClient.es.js +25 -0
  19. package/dist/client/query/dataset/datasetDirectoryClient.es.js.map +1 -0
  20. package/dist/client/query/dataset/datasetQueryApi.d.cts +40 -0
  21. package/dist/client/query/dataset/datasetQueryApi.d.ts +40 -0
  22. package/dist/client/query/dataset/datasetQueryClient.cjs +2 -0
  23. package/dist/client/query/dataset/datasetQueryClient.cjs.map +1 -0
  24. package/dist/client/query/dataset/datasetQueryClient.d.cts +57 -0
  25. package/dist/client/query/dataset/datasetQueryClient.d.ts +57 -0
  26. package/dist/client/query/dataset/datasetQueryClient.es.js +154 -0
  27. package/dist/client/query/dataset/datasetQueryClient.es.js.map +1 -0
  28. package/dist/client/query/dataset/endpointPaths.cjs +2 -0
  29. package/dist/client/query/dataset/endpointPaths.cjs.map +1 -0
  30. package/dist/client/query/dataset/endpointPaths.d.cts +9 -0
  31. package/dist/client/query/dataset/endpointPaths.d.ts +9 -0
  32. package/dist/client/query/dataset/endpointPaths.es.js +14 -0
  33. package/dist/client/query/dataset/endpointPaths.es.js.map +1 -0
  34. package/dist/client/query/dataset/index.d.cts +3 -0
  35. package/dist/client/query/dataset/index.d.ts +3 -0
  36. package/dist/client/query/descriptor/descriptorEndpoints.cjs +1 -1
  37. package/dist/client/query/descriptor/descriptorEndpoints.es.js +3 -3
  38. package/dist/client/query/event/eventStreamQueryApi.d.cts +1 -1
  39. package/dist/client/query/event/eventStreamQueryApi.d.ts +1 -1
  40. package/dist/client/query/event/eventStreamQueryClient.cjs +1 -1
  41. package/dist/client/query/event/eventStreamQueryClient.cjs.map +1 -1
  42. package/dist/client/query/event/eventStreamQueryClient.d.cts +4 -1
  43. package/dist/client/query/event/eventStreamQueryClient.d.ts +4 -1
  44. package/dist/client/query/event/eventStreamQueryClient.es.js +3 -3
  45. package/dist/client/query/event/eventStreamQueryClient.es.js.map +1 -1
  46. package/dist/client/query/event/index.d.cts +0 -1
  47. package/dist/client/query/event/index.d.ts +0 -1
  48. package/dist/client/query/index.d.cts +1 -0
  49. package/dist/client/query/index.d.ts +1 -0
  50. package/dist/client/query/snapshot/index.d.cts +0 -1
  51. package/dist/client/query/snapshot/index.d.ts +0 -1
  52. package/dist/client/query/snapshot/snapshotQueryApi.d.cts +1 -1
  53. package/dist/client/query/snapshot/snapshotQueryApi.d.ts +1 -1
  54. package/dist/client/query/snapshot/snapshotQueryClient.cjs +1 -1
  55. package/dist/client/query/snapshot/snapshotQueryClient.cjs.map +1 -1
  56. package/dist/client/query/snapshot/snapshotQueryClient.d.cts +4 -1
  57. package/dist/client/query/snapshot/snapshotQueryClient.d.ts +4 -1
  58. package/dist/client/query/snapshot/snapshotQueryClient.es.js +3 -3
  59. package/dist/client/query/snapshot/snapshotQueryClient.es.js.map +1 -1
  60. package/dist/client/query/state/loadOwnerStateAggregateClient.cjs +1 -1
  61. package/dist/client/query/state/loadOwnerStateAggregateClient.es.js +3 -3
  62. package/dist/client/query/state/loadStateAggregateClient.cjs +1 -1
  63. package/dist/client/query/state/loadStateAggregateClient.es.js +3 -3
  64. package/dist/client/routing.cjs.map +1 -1
  65. package/dist/client/routing.d.cts +2 -2
  66. package/dist/client/routing.d.ts +2 -2
  67. package/dist/client/routing.es.js.map +1 -1
  68. package/dist/dsl/aggregation/admit.cjs +1 -1
  69. package/dist/dsl/aggregation/admit.cjs.map +1 -1
  70. package/dist/dsl/aggregation/admit.es.js +84 -65
  71. package/dist/dsl/aggregation/admit.es.js.map +1 -1
  72. package/dist/dsl/aggregation/builders.cjs +1 -1
  73. package/dist/dsl/aggregation/builders.cjs.map +1 -1
  74. package/dist/dsl/aggregation/builders.d.cts +16 -4
  75. package/dist/dsl/aggregation/builders.d.ts +16 -4
  76. package/dist/dsl/aggregation/builders.es.js +89 -78
  77. package/dist/dsl/aggregation/builders.es.js.map +1 -1
  78. package/dist/dsl/aggregation/derived.cjs +1 -1
  79. package/dist/dsl/aggregation/derived.cjs.map +1 -1
  80. package/dist/dsl/aggregation/derived.d.cts +32 -1
  81. package/dist/dsl/aggregation/derived.d.ts +32 -1
  82. package/dist/dsl/aggregation/derived.es.js +23 -1
  83. package/dist/dsl/aggregation/derived.es.js.map +1 -1
  84. package/dist/dsl/aggregation/types.cjs +1 -1
  85. package/dist/dsl/aggregation/types.cjs.map +1 -1
  86. package/dist/dsl/aggregation/types.d.cts +112 -7
  87. package/dist/dsl/aggregation/types.d.ts +112 -7
  88. package/dist/dsl/aggregation/types.es.js +19 -12
  89. package/dist/dsl/aggregation/types.es.js.map +1 -1
  90. package/dist/dsl/descriptor.cjs +1 -1
  91. package/dist/dsl/descriptor.cjs.map +1 -1
  92. package/dist/dsl/descriptor.d.cts +16 -1
  93. package/dist/dsl/descriptor.d.ts +16 -1
  94. package/dist/dsl/descriptor.es.js +2 -1
  95. package/dist/dsl/descriptor.es.js.map +1 -1
  96. package/dist/dsl/filter/datePattern.cjs +1 -1
  97. package/dist/dsl/filter/datePattern.cjs.map +1 -1
  98. package/dist/dsl/filter/datePattern.es.js +2 -5
  99. package/dist/dsl/filter/datePattern.es.js.map +1 -1
  100. package/dist/dsl.cjs +1 -1
  101. package/dist/dsl.d.cts +2 -2
  102. package/dist/dsl.d.ts +2 -2
  103. package/dist/dsl.es.js +13 -13
  104. package/dist/error/headers.cjs.map +1 -1
  105. package/dist/error/headers.d.cts +3 -2
  106. package/dist/error/headers.d.ts +3 -2
  107. package/dist/error/headers.es.js.map +1 -1
  108. package/dist/error/queryErrorCodes.cjs +1 -1
  109. package/dist/error/queryErrorCodes.cjs.map +1 -1
  110. package/dist/error/queryErrorCodes.d.cts +7 -0
  111. package/dist/error/queryErrorCodes.d.ts +7 -0
  112. package/dist/error/queryErrorCodes.es.js +2 -1
  113. package/dist/error/queryErrorCodes.es.js.map +1 -1
  114. package/dist/index.cjs +1 -1
  115. package/dist/index.es.js +35 -33
  116. package/dist/model/domainEventStream.cjs.map +1 -0
  117. package/dist/{client/query/event → model}/domainEventStream.d.cts +5 -1
  118. package/dist/{client/query/event → model}/domainEventStream.d.ts +5 -1
  119. package/dist/{client/query/event → model}/domainEventStream.es.js +1 -1
  120. package/dist/model/domainEventStream.es.js.map +1 -0
  121. package/dist/model/index.d.cts +2 -0
  122. package/dist/model/index.d.ts +2 -0
  123. package/dist/model/snapshot.cjs.map +1 -0
  124. package/dist/{client/query/snapshot → model}/snapshot.d.cts +3 -1
  125. package/dist/{client/query/snapshot → model}/snapshot.d.ts +3 -1
  126. package/dist/{client/query/snapshot → model}/snapshot.es.js +1 -1
  127. package/dist/model/snapshot.es.js.map +1 -0
  128. package/dist/transport/eventStreams.cjs +1 -1
  129. package/dist/transport/eventStreams.cjs.map +1 -1
  130. package/dist/transport/eventStreams.d.cts +3 -1
  131. package/dist/transport/eventStreams.d.ts +3 -1
  132. package/dist/transport/eventStreams.es.js +7 -8
  133. package/dist/transport/eventStreams.es.js.map +1 -1
  134. package/package.json +3 -3
  135. package/dist/client/query/event/domainEventStream.cjs.map +0 -1
  136. package/dist/client/query/event/domainEventStream.es.js.map +0 -1
  137. package/dist/client/query/snapshot/snapshot.cjs.map +0 -1
  138. package/dist/client/query/snapshot/snapshot.es.js.map +0 -1
  139. /package/dist/_virtual/{_@oxc-project_runtime@0.151.0 → _@oxc-project_runtime@0.153.0}/helpers/esm/decorate.cjs +0 -0
  140. /package/dist/_virtual/{_@oxc-project_runtime@0.151.0 → _@oxc-project_runtime@0.153.0}/helpers/esm/decorateMetadata.cjs +0 -0
  141. /package/dist/_virtual/{_@oxc-project_runtime@0.151.0 → _@oxc-project_runtime@0.153.0}/helpers/esm/decorateParam.cjs +0 -0
  142. /package/dist/{client/query/event → model}/domainEventStream.cjs +0 -0
  143. /package/dist/{client/query/snapshot → model}/snapshot.cjs +0 -0
@@ -1 +1 @@
1
- {"version":3,"file":"admit.cjs","names":["FilterOperator","AggregationMetricType","AggregationGroupType","AGGREGATION_LIMITS","DerivedExpressionType","HavingExpressionType","effectiveSort","require_operator","require_types","require_expressionTrees","require_sort","requireAtMost","items","max","name","noun","validateMetricFilter","filter","validateExpressions","metrics","metric","groupBy","group","NON_NUMERIC","validateDerivedMetrics","declared","nodes","validateDerivedExpression","pending","visitedNodes","depth","expression","reference","nonNumeric","requireValidHavingMetric","metricAliases","anyAliases","edgeAliases","validateHaving","having","operand","validateSort","sort","fields","entry","aliases","field","admitAggregationQuery","elements","query"],"sources":["../../../src/dsl/aggregation/admit.ts"],"sourcesContent":["/*\n * Copyright [2021-present] [ahoo wang <ahoowang@qq.com> (https://github.com/Ahoo-Wang)].\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n * http://www.apache.org/licenses/LICENSE-2.0\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { FilterOperator, type FilterExpression } from '../filter/index.js';\nimport type { FieldSort } from '../sort.js';\nimport { requireValidExpressionTrees } from './expressionTrees.js';\nimport { effectiveSort } from './sort.js';\nimport {\n AGGREGATION_LIMITS,\n AggregationGroupType,\n AggregationMetricType,\n DerivedExpressionType,\n HavingExpressionType,\n type AggregationGroup,\n type AggregationMetric,\n type AggregationQuery,\n type DerivedAggregationMetric,\n type DerivedExpression,\n type HavingExpression,\n} from './types.js';\n\n// Internal: the rules `aggregation.query()` checks across the parts of a\n// query. index.ts does not re-export this file.\n\nfunction requireAtMost(\n name: string,\n noun: string,\n items: readonly unknown[],\n max: number,\n): void {\n if (items.length > max) {\n throw new TypeError(`${name} must contain at most ${max} ${noun}.`);\n }\n}\n\n/**\n * Refuses the filters a metric cannot carry, whatever the aggregate holds.\n *\n * A metric filter is a whole-value predicate on one record — MongoDB turns it\n * into a `$cond` guard and Elasticsearch into a filter aggregation — and\n * element matching and full text have no whole-value reading. Both backends\n * refuse them before touching a schema, so the shape alone settles it. What a\n * schema would add, refusing an array-valued field, stays on the server.\n */\nfunction validateMetricFilter(filter: FilterExpression): void {\n switch (filter.op) {\n case FilterOperator.SEARCH:\n throw new TypeError(\n 'Aggregation metric filters do not support search filters.',\n );\n case FilterOperator.ELEMENT_MATCH:\n throw new TypeError(\n 'Aggregation metric filters do not support [ELEMENT_MATCH].',\n );\n case FilterOperator.AND:\n case FilterOperator.OR:\n case FilterOperator.NOR:\n filter.operands.forEach(validateMetricFilter);\n break;\n }\n}\n\n/**\n * Walks the arithmetic of every metric that carries an expression, as one\n * budget, and of each expression group on its own, as Wow does.\n */\nfunction validateExpressions(\n metrics: readonly AggregationMetric[],\n groupBy: readonly AggregationGroup[],\n): void {\n requireValidExpressionTrees(\n metrics.flatMap(metric =>\n metric.type === AggregationMetricType.NUMERIC ||\n metric.type === AggregationMetricType.DISTINCT_COUNT ||\n metric.type === AggregationMetricType.PERCENTILE\n ? [metric.expression]\n : [],\n ),\n );\n groupBy.forEach(group => {\n if (\n group.type !== AggregationGroupType.TERMS &&\n group.type !== AggregationGroupType.HISTOGRAM\n )\n return;\n if ((group.field === undefined) === (group.expression === undefined)) {\n throw new TypeError(\n `${group.type} group requires exactly one of field and expression.`,\n );\n }\n if (group.expression) requireValidExpressionTrees([group.expression]);\n if (\n group.type === AggregationGroupType.TERMS &&\n group.missingKey !== undefined &&\n group.expression\n ) {\n throw new TypeError('terms missingKey requires a field input.');\n }\n });\n}\n\n/** The metric types whose value is not a number: derived and having refuse them. */\nconst NON_NUMERIC: ReadonlySet<string> = new Set([\n AggregationMetricType.ANY,\n AggregationMetricType.FIRST,\n AggregationMetricType.LAST,\n]);\n\n/**\n * Admits the derived metrics against what was declared before each of them.\n *\n * Derived arithmetic runs after the aggregation, over values the query has\n * already produced, so a reference may only name a metric declared earlier —\n * that is what makes the list evaluable in one pass — and never an `ANY`,\n * `FIRST` or `LAST` metric, whose value is a field's value rather than a\n * number.\n */\nfunction validateDerivedMetrics(metrics: readonly AggregationMetric[]): void {\n // Each earlier alias, with its type when that is not a number.\n const declared = new Map<string, string | undefined>();\n let nodes = 0;\n metrics.forEach(metric => {\n if (metric.type === AggregationMetricType.DERIVED) {\n nodes = validateDerivedExpression(metric, declared, nodes);\n }\n declared.set(\n metric.alias,\n NON_NUMERIC.has(metric.type) ? metric.type : undefined,\n );\n });\n}\n\nfunction validateDerivedExpression(\n metric: DerivedAggregationMetric,\n declared: ReadonlyMap<string, string | undefined>,\n visitedNodes: number,\n): number {\n const pending: { expression: DerivedExpression; depth: number }[] = [\n { expression: metric.expression, depth: 1 },\n ];\n let nodes = visitedNodes;\n while (pending.length > 0) {\n const { expression, depth } = pending.pop()!;\n if (depth > AGGREGATION_LIMITS.MAX_EXPRESSION_DEPTH) {\n throw new TypeError(\n `derived expression depth must be at most ${AGGREGATION_LIMITS.MAX_EXPRESSION_DEPTH}.`,\n );\n }\n nodes++;\n if (nodes > AGGREGATION_LIMITS.MAX_EXPRESSION_NODES) {\n throw new TypeError(\n `derived expressions must contain at most ${AGGREGATION_LIMITS.MAX_EXPRESSION_NODES} nodes.`,\n );\n }\n switch (expression.type) {\n case DerivedExpressionType.METRIC_REF: {\n const reference = expression.metric;\n if (!declared.has(reference)) {\n throw new TypeError(\n `derived metric [${metric.alias}] must reference a metric declared before it, but was [${reference}].`,\n );\n }\n const nonNumeric = declared.get(reference);\n if (nonNumeric !== undefined) {\n throw new TypeError(\n `derived metric [${metric.alias}] cannot reference ${nonNumeric} metric [${reference}].`,\n );\n }\n break;\n }\n case DerivedExpressionType.CONSTANT:\n if (!Number.isFinite(expression.value)) {\n throw new TypeError('derived constant must be finite.');\n }\n break;\n case DerivedExpressionType.BINARY:\n pending.push({ expression: expression.left, depth: depth + 1 });\n pending.push({ expression: expression.right, depth: depth + 1 });\n break;\n default:\n throw new TypeError(\n `Unsupported derived expression: ${String((expression as { type: unknown }).type)}.`,\n );\n }\n }\n return nodes;\n}\n\nfunction requireValidHavingMetric(\n metric: string,\n metricAliases: ReadonlySet<string>,\n anyAliases: ReadonlySet<string>,\n edgeAliases: ReadonlySet<string>,\n): void {\n if (!metricAliases.has(metric)) {\n throw new TypeError(\n `having condition [${metric}] must reference a declared metric alias.`,\n );\n }\n if (anyAliases.has(metric)) {\n throw new TypeError(\n `having condition [${metric}] cannot reference ANY metric.`,\n );\n }\n if (edgeAliases.has(metric)) {\n throw new TypeError(\n `having condition [${metric}] cannot reference FIRST or LAST metric.`,\n );\n }\n}\n\n/**\n * `having` filters the grouped rows, so it needs rows to filter: a query with\n * no `groupBy` produces one row and has nothing to select from.\n */\nfunction validateHaving(\n having: HavingExpression | undefined,\n groupBy: readonly AggregationGroup[],\n metrics: readonly AggregationMetric[],\n): void {\n if (having === undefined) return;\n if (groupBy.length === 0) {\n throw new TypeError('having requires at least one groupBy.');\n }\n const metricAliases = new Set(metrics.map(metric => metric.alias));\n const anyAliases = new Set(\n metrics\n .filter(metric => metric.type === AggregationMetricType.ANY)\n .map(metric => metric.alias),\n );\n const edgeAliases = new Set(\n metrics\n .filter(\n metric =>\n metric.type === AggregationMetricType.FIRST ||\n metric.type === AggregationMetricType.LAST,\n )\n .map(metric => metric.alias),\n );\n\n const pending: { expression: HavingExpression; depth: number }[] = [\n { expression: having, depth: 1 },\n ];\n while (pending.length > 0) {\n const { expression, depth } = pending.pop()!;\n if (depth > AGGREGATION_LIMITS.MAX_EXPRESSION_DEPTH) {\n throw new TypeError(\n `having expression depth must be at most ${AGGREGATION_LIMITS.MAX_EXPRESSION_DEPTH}.`,\n );\n }\n switch (expression.type) {\n case HavingExpressionType.CONDITION:\n requireValidHavingMetric(\n expression.metric,\n metricAliases,\n anyAliases,\n edgeAliases,\n );\n if (!Number.isFinite(expression.value)) {\n throw new TypeError(\n `having condition [${expression.metric}] value must be finite.`,\n );\n }\n break;\n case HavingExpressionType.BETWEEN:\n requireValidHavingMetric(\n expression.metric,\n metricAliases,\n anyAliases,\n edgeAliases,\n );\n if (\n !Number.isFinite(expression.lower) ||\n !Number.isFinite(expression.upper)\n ) {\n throw new TypeError(\n `having between [${expression.metric}] bounds must be finite.`,\n );\n }\n if (expression.lower > expression.upper) {\n throw new TypeError(\n `having between [${expression.metric}] lower bound must not exceed upper bound.`,\n );\n }\n break;\n case HavingExpressionType.IN:\n requireValidHavingMetric(\n expression.metric,\n metricAliases,\n anyAliases,\n edgeAliases,\n );\n if (expression.values.length === 0) {\n throw new TypeError(\n `having in [${expression.metric}] values must not be empty.`,\n );\n }\n if (!expression.values.every(Number.isFinite)) {\n throw new TypeError(\n `having in [${expression.metric}] values must be finite.`,\n );\n }\n break;\n case HavingExpressionType.IS_NULL:\n requireValidHavingMetric(\n expression.metric,\n metricAliases,\n anyAliases,\n edgeAliases,\n );\n break;\n case HavingExpressionType.AND:\n case HavingExpressionType.OR:\n if (expression.operands.length === 0) {\n throw new TypeError(\n `having ${expression.type} operands must not be empty.`,\n );\n }\n expression.operands.forEach(operand =>\n pending.push({ expression: operand, depth: depth + 1 }),\n );\n break;\n default:\n throw new TypeError(\n `Unsupported having expression: ${String((expression as { type: unknown }).type)}.`,\n );\n }\n }\n}\n\nfunction validateSort(\n sort: readonly FieldSort[],\n groupBy: readonly AggregationGroup[],\n aliases: readonly string[],\n): void {\n requireAtMost('sort', 'fields', sort, AGGREGATION_LIMITS.MAX_SORT_FIELDS);\n if (groupBy.length === 0 && sort.length > 0) {\n throw new TypeError('sort requires at least one groupBy.');\n }\n const fields = sort.map(entry => entry.field);\n if (new Set(fields).size !== fields.length) {\n throw new TypeError('sort fields must be unique.');\n }\n if (!fields.every(field => aliases.includes(field))) {\n throw new TypeError('sort fields must reference aggregation aliases.');\n }\n requireAtMost(\n 'effective sort',\n 'fields',\n effectiveSort({ groupBy: [...groupBy], sort: [...sort] }),\n AGGREGATION_LIMITS.MAX_SORT_FIELDS,\n );\n}\n\n/**\n * Admits a whole aggregation query against the rules Wow enforces on arrival;\n * {@link aggregation.query} is its public face.\n */\nexport function admitAggregationQuery<\n ROOT_FIELDS extends string = string,\n AGGREGATION_FIELDS extends string = ROOT_FIELDS,\n>(\n query: AggregationQuery<ROOT_FIELDS, AGGREGATION_FIELDS>,\n): AggregationQuery<ROOT_FIELDS, AGGREGATION_FIELDS> {\n const elements = query.elements ?? [];\n const groupBy = query.groupBy ?? [];\n const metrics = query.metrics;\n const sort = query.sort ?? [];\n\n requireAtMost('elements', 'paths', elements, AGGREGATION_LIMITS.MAX_ELEMENTS);\n requireAtMost(\n 'groupBy',\n 'dimensions',\n groupBy,\n AGGREGATION_LIMITS.MAX_GROUPS,\n );\n if (!Array.isArray(metrics) || metrics.length === 0) {\n throw new TypeError('metrics must not be empty.');\n }\n requireAtMost('metrics', 'entries', metrics, AGGREGATION_LIMITS.MAX_METRICS);\n if (query.limit !== undefined) {\n if (\n !Number.isInteger(query.limit) ||\n query.limit < 1 ||\n query.limit > AGGREGATION_LIMITS.MAX_LIMIT\n ) {\n throw new TypeError(\n `limit must be between 1 and ${AGGREGATION_LIMITS.MAX_LIMIT}.`,\n );\n }\n }\n\n validateExpressions(metrics, groupBy);\n validateDerivedMetrics(metrics);\n validateHaving(query.having, groupBy, metrics);\n metrics.forEach(metric => {\n if ('filter' in metric && metric.filter)\n validateMetricFilter(metric.filter);\n });\n\n // A dense DATE_HISTOGRAM fills in the buckets its range implies, and a\n // dense DATE_PART every key of its part's domain, rather than only the ones\n // with rows; a second dimension would multiply that filling out across\n // every one of its own keys.\n groupBy.forEach(group => {\n if (\n (group.type === AggregationGroupType.DATE_HISTOGRAM ||\n group.type === AggregationGroupType.DATE_PART) &&\n group.dense === true &&\n groupBy.length !== 1\n ) {\n throw new TypeError(\n `dense requires ${group.type} to be the only groupBy.`,\n );\n }\n });\n\n const aliases = [\n ...groupBy.map(group => group.alias),\n ...metrics.map(metric => metric.alias),\n ];\n if (new Set(aliases).size !== aliases.length) {\n throw new TypeError('aggregation aliases must be unique.');\n }\n validateSort(sort, groupBy, aliases);\n\n return {\n ...query,\n metrics: [...metrics] as typeof query.metrics,\n };\n}\n"],"mappings":"8HAkCA,SAASW,EACP,EACA,EACA,EACA,EACM,CACN,GAAIC,EAAM,OAASC,EACjB,MAAU,UAAU,GAAGC,EAAK,wBAAwBD,EAAI,GAAGE,EAAK,EAAE,CAEtE,CAWA,SAASC,EAAqB,EAAgC,CAC5D,OAAQC,EAAO,GAAf,CACE,KAAKjB,EAAAA,eAAe,OAClB,MAAU,UACR,2DACF,EACF,KAAKA,EAAAA,eAAe,cAClB,MAAU,UACR,4DACF,EACF,KAAKA,EAAAA,eAAe,IACpB,KAAKA,EAAAA,eAAe,GACpB,KAAKA,EAAAA,eAAe,IAClBiB,EAAO,SAAS,QAAQD,CAAoB,CAEhD,CACF,CAMA,SAASE,EACP,EACA,EACM,CACNT,EAAA,4BACEU,EAAQ,QAAQ,GACdC,EAAO,OAASnB,EAAAA,sBAAsB,SACtCmB,EAAO,OAASnB,EAAAA,sBAAsB,gBACtCmB,EAAO,OAASnB,EAAAA,sBAAsB,WAClC,CAACmB,EAAO,UAAU,EAClB,CAAC,CACP,CACF,EACAC,EAAQ,QAAQ,GAAS,CACvB,GACEC,EAAM,OAASpB,EAAAA,qBAAqB,OACpCoB,EAAM,OAASpB,EAAAA,qBAAqB,UAGtC,IAAKoB,EAAM,QAAU,IAAA,KAAgBA,EAAM,aAAe,IAAA,IACxD,MAAU,UACR,GAAGA,EAAM,KAAK,qDAChB,EAGF,GADIA,EAAM,YAAYb,EAAA,4BAA4B,CAACa,EAAM,UAAU,CAAC,EAElEA,EAAM,OAASpB,EAAAA,qBAAqB,OACpCoB,EAAM,aAAe,IAAA,IACrBA,EAAM,WAEN,MAAU,UAAU,0CAA0C,CAR9D,CAUJ,CAAC,CACH,CAGA,IAAMC,EAAmC,IAAI,IAAI,CAC/CtB,EAAAA,sBAAsB,IACtBA,EAAAA,sBAAsB,MACtBA,EAAAA,sBAAsB,IACxB,CAAC,EAWD,SAASuB,EAAuB,EAA6C,CAE3E,IAAMC,EAAW,IAAI,IACjBC,EAAQ,EACZP,EAAQ,QAAQ,GAAU,CACpBC,EAAO,OAASnB,EAAAA,sBAAsB,UACxC,EAAQ0B,EAA0BP,EAAQK,EAAUC,CAAK,GAE3DD,EAAS,IACPL,EAAO,MACPG,EAAY,IAAIH,EAAO,IAAI,EAAIA,EAAO,KAAO,IAAA,EAC/C,CACF,CAAC,CACH,CAEA,SAASO,EACP,EACA,EACA,EACQ,CACR,IAAMC,EAA8D,CAClE,CAAE,WAAYR,EAAO,WAAY,MAAO,CAAE,CAC5C,EACIM,EAAQG,EACZ,KAAOD,EAAQ,OAAS,GAAG,CACzB,GAAM,CAAE,aAAY,SAAUA,EAAQ,IAAI,EAC1C,GAAIE,EAAQ3B,EAAAA,mBAAmB,qBAC7B,MAAU,UACR,4CAA4CA,EAAAA,mBAAmB,qBAAqB,EACtF,EAGF,GADA,IACIuB,EAAQvB,EAAAA,mBAAmB,qBAC7B,MAAU,UACR,4CAA4CA,EAAAA,mBAAmB,qBAAqB,QACtF,EAEF,OAAQ4B,EAAW,KAAnB,CACE,KAAK3B,EAAAA,sBAAsB,WAAY,CACrC,IAAM4B,EAAYD,EAAW,OAC7B,GAAI,CAACN,EAAS,IAAIO,CAAS,EACzB,MAAU,UACR,mBAAmBZ,EAAO,MAAM,yDAAyDY,EAAU,GACrG,EAEF,IAAMC,EAAaR,EAAS,IAAIO,CAAS,EACzC,GAAIC,IAAe,IAAA,GACjB,MAAU,UACR,mBAAmBb,EAAO,MAAM,qBAAqBa,EAAW,WAAWD,EAAU,GACvF,EAEF,KACF,CACA,KAAK5B,EAAAA,sBAAsB,SACzB,GAAI,CAAC,OAAO,SAAS2B,EAAW,KAAK,EACnC,MAAU,UAAU,kCAAkC,EAExD,MACF,KAAK3B,EAAAA,sBAAsB,OACzBwB,EAAQ,KAAK,CAAE,WAAYG,EAAW,KAAM,MAAOD,EAAQ,CAAE,CAAC,EAC9DF,EAAQ,KAAK,CAAE,WAAYG,EAAW,MAAO,MAAOD,EAAQ,CAAE,CAAC,EAC/D,MACF,QACE,MAAU,UACR,mCAAmC,OAAQC,EAAiC,IAAI,EAAE,EACpF,CACJ,CACF,CACA,OAAOL,CACT,CAEA,SAASQ,EACP,EACA,EACA,EACA,EACM,CACN,GAAI,CAACC,EAAc,IAAIf,CAAM,EAC3B,MAAU,UACR,qBAAqBA,EAAO,0CAC9B,EAEF,GAAIgB,EAAW,IAAIhB,CAAM,EACvB,MAAU,UACR,qBAAqBA,EAAO,+BAC9B,EAEF,GAAIiB,EAAY,IAAIjB,CAAM,EACxB,MAAU,UACR,qBAAqBA,EAAO,yCAC9B,CAEJ,CAMA,SAASkB,EACP,EACA,EACA,EACM,CACN,GAAIC,IAAW,IAAA,GAAW,OAC1B,GAAIlB,EAAQ,SAAW,EACrB,MAAU,UAAU,uCAAuC,EAE7D,IAAMc,EAAgB,IAAI,IAAIhB,EAAQ,IAAI,GAAUC,EAAO,KAAK,CAAC,EAC3DgB,EAAa,IAAI,IACrBjB,EACG,OAAO,GAAUC,EAAO,OAASnB,EAAAA,sBAAsB,GAAG,CAAC,CAC3D,IAAI,GAAUmB,EAAO,KAAK,CAC/B,EACMiB,EAAc,IAAI,IACtBlB,EACG,OACC,GACEC,EAAO,OAASnB,EAAAA,sBAAsB,OACtCmB,EAAO,OAASnB,EAAAA,sBAAsB,IAC1C,CAAC,CACA,IAAI,GAAUmB,EAAO,KAAK,CAC/B,EAEMQ,EAA6D,CACjE,CAAE,WAAYW,EAAQ,MAAO,CAAE,CACjC,EACA,KAAOX,EAAQ,OAAS,GAAG,CACzB,GAAM,CAAE,aAAY,SAAUA,EAAQ,IAAI,EAC1C,GAAIE,EAAQ3B,EAAAA,mBAAmB,qBAC7B,MAAU,UACR,2CAA2CA,EAAAA,mBAAmB,qBAAqB,EACrF,EAEF,OAAQ4B,EAAW,KAAnB,CACE,KAAK1B,EAAAA,qBAAqB,UAOxB,GANA6B,EACEH,EAAW,OACXI,EACAC,EACAC,CACF,EACI,CAAC,OAAO,SAASN,EAAW,KAAK,EACnC,MAAU,UACR,qBAAqBA,EAAW,OAAO,wBACzC,EAEF,MACF,KAAK1B,EAAAA,qBAAqB,QAOxB,GANA6B,EACEH,EAAW,OACXI,EACAC,EACAC,CACF,EAEE,CAAC,OAAO,SAASN,EAAW,KAAK,GACjC,CAAC,OAAO,SAASA,EAAW,KAAK,EAEjC,MAAU,UACR,mBAAmBA,EAAW,OAAO,yBACvC,EAEF,GAAIA,EAAW,MAAQA,EAAW,MAChC,MAAU,UACR,mBAAmBA,EAAW,OAAO,2CACvC,EAEF,MACF,KAAK1B,EAAAA,qBAAqB,GAOxB,GANA6B,EACEH,EAAW,OACXI,EACAC,EACAC,CACF,EACIN,EAAW,OAAO,SAAW,EAC/B,MAAU,UACR,cAAcA,EAAW,OAAO,4BAClC,EAEF,GAAI,CAACA,EAAW,OAAO,MAAM,OAAO,QAAQ,EAC1C,MAAU,UACR,cAAcA,EAAW,OAAO,yBAClC,EAEF,MACF,KAAK1B,EAAAA,qBAAqB,QACxB6B,EACEH,EAAW,OACXI,EACAC,EACAC,CACF,EACA,MACF,KAAKhC,EAAAA,qBAAqB,IAC1B,KAAKA,EAAAA,qBAAqB,GACxB,GAAI0B,EAAW,SAAS,SAAW,EACjC,MAAU,UACR,UAAUA,EAAW,KAAK,6BAC5B,EAEFA,EAAW,SAAS,QAAQ,GAC1BH,EAAQ,KAAK,CAAE,WAAYY,EAAS,MAAOV,EAAQ,CAAE,CAAC,CACxD,EACA,MACF,QACE,MAAU,UACR,kCAAkC,OAAQC,EAAiC,IAAI,EAAE,EACnF,CACJ,CACF,CACF,CAEA,SAASU,EACP,EACA,EACA,EACM,CAEN,GADA9B,EAAc,OAAQ,SAAU+B,EAAMvC,EAAAA,mBAAmB,eAAe,EACpEkB,EAAQ,SAAW,GAAKqB,EAAK,OAAS,EACxC,MAAU,UAAU,qCAAqC,EAE3D,IAAMC,EAASD,EAAK,IAAI,GAASE,EAAM,KAAK,EAC5C,GAAI,IAAI,IAAID,CAAM,CAAC,CAAC,OAASA,EAAO,OAClC,MAAU,UAAU,6BAA6B,EAEnD,GAAI,CAACA,EAAO,MAAM,GAASE,EAAQ,SAASC,CAAK,CAAC,EAChD,MAAU,UAAU,iDAAiD,EAEvEnC,EACE,iBACA,SACAL,EAAAA,cAAc,CAAE,QAAS,CAAC,GAAGe,CAAO,EAAG,KAAM,CAAC,GAAGqB,CAAI,CAAE,CAAC,EACxDvC,EAAAA,mBAAmB,eACrB,CACF,CAMA,SAAgB4C,EAId,EACmD,CACnD,IAAMC,EAAWC,EAAM,UAAY,CAAC,EAC9B5B,EAAU4B,EAAM,SAAW,CAAC,EAC5B9B,EAAU8B,EAAM,QAChBP,EAAOO,EAAM,MAAQ,CAAC,EAS5B,GAPAtC,EAAc,WAAY,QAASqC,EAAU7C,EAAAA,mBAAmB,YAAY,EAC5EQ,EACE,UACA,aACAU,EACAlB,EAAAA,mBAAmB,UACrB,EACI,CAAC,MAAM,QAAQgB,CAAO,GAAKA,EAAQ,SAAW,EAChD,MAAU,UAAU,4BAA4B,EAGlD,GADAR,EAAc,UAAW,UAAWQ,EAAShB,EAAAA,mBAAmB,WAAW,EACvE8C,EAAM,QAAU,IAAA,KAEhB,CAAC,OAAO,UAAUA,EAAM,KAAK,GAC7BA,EAAM,MAAQ,GACdA,EAAM,MAAQ9C,EAAAA,mBAAmB,WAEjC,MAAU,UACR,+BAA+BA,EAAAA,mBAAmB,UAAU,EAC9D,EAIJe,EAAoBC,EAASE,CAAO,EACpCG,EAAuBL,CAAO,EAC9BmB,EAAeW,EAAM,OAAQ5B,EAASF,CAAO,EAC7CA,EAAQ,QAAQ,GAAU,CACpB,WAAYC,GAAUA,EAAO,QAC/BJ,EAAqBI,EAAO,MAAM,CACtC,CAAC,EAMDC,EAAQ,QAAQ,GAAS,CACvB,IACGC,EAAM,OAASpB,EAAAA,qBAAqB,gBACnCoB,EAAM,OAASpB,EAAAA,qBAAqB,YACtCoB,EAAM,QAAU,IAChBD,EAAQ,SAAW,EAEnB,MAAU,UACR,kBAAkBC,EAAM,KAAK,yBAC/B,CAEJ,CAAC,EAED,IAAMuB,EAAU,CACd,GAAGxB,EAAQ,IAAI,GAASC,EAAM,KAAK,EACnC,GAAGH,EAAQ,IAAI,GAAUC,EAAO,KAAK,CACvC,EACA,GAAI,IAAI,IAAIyB,CAAO,CAAC,CAAC,OAASA,EAAQ,OACpC,MAAU,UAAU,qCAAqC,EAI3D,OAFAJ,EAAaC,EAAMrB,EAASwB,CAAO,EAE5B,CACL,GAAGI,EACH,QAAS,CAAC,GAAG9B,CAAO,CACtB,CACF"}
1
+ {"version":3,"file":"admit.cjs","names":["FilterOperator","AggregationMetricType","AggregationGroupType","AggregationGroupScope","AGGREGATION_LIMITS","DerivedExpressionType","HavingExpressionType","effectiveSort","require_operator","require_types","require_expressionTrees","require_sort","requireAtMost","items","max","name","noun","validateMetricFilter","filter","validateExpressions","metrics","metric","groupBy","group","NON_NUMERIC","validateDerivedMetrics","declared","derived","counter","validateDerivedExpression","pending","depth","expression","reference","nonNumeric","requireWindowMetric","target","window","alias","requireValidHavingMetric","metricAliases","anyAliases","edgeAliases","validateHaving","having","operand","validateSort","sort","fields","entry","aliases","field","requireRootGroupsFirst","root","query","order","firstElement","admitAggregationQuery","elements"],"sources":["../../../src/dsl/aggregation/admit.ts"],"sourcesContent":["/*\n * Copyright [2021-present] [ahoo wang <ahoowang@qq.com> (https://github.com/Ahoo-Wang)].\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n * http://www.apache.org/licenses/LICENSE-2.0\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { FilterOperator, type FilterExpression } from '../filter/index.js';\nimport type { FieldSort } from '../sort.js';\nimport { requireValidExpressionTrees } from './expressionTrees.js';\nimport { effectiveSort } from './sort.js';\nimport {\n AGGREGATION_LIMITS,\n AggregationGroupScope,\n AggregationGroupType,\n AggregationMetricType,\n DerivedExpressionType,\n HavingExpressionType,\n type AggregationGroup,\n type AggregationMetric,\n type AggregationQuery,\n type DerivedAggregationMetric,\n type DerivedExpression,\n type DerivedWindow,\n type HavingExpression,\n} from './types.js';\n\n// Internal: the rules `aggregation.query()` checks across the parts of a\n// query. index.ts does not re-export this file.\n\nfunction requireAtMost(\n name: string,\n noun: string,\n items: readonly unknown[],\n max: number,\n): void {\n if (items.length > max) {\n throw new TypeError(`${name} must contain at most ${max} ${noun}.`);\n }\n}\n\n/**\n * Refuses the filters a metric cannot carry, whatever the aggregate holds.\n *\n * A metric filter is a whole-value predicate on one record — MongoDB turns it\n * into a `$cond` guard and Elasticsearch into a filter aggregation — and\n * element matching and full text have no whole-value reading. Both backends\n * refuse them before touching a schema, so the shape alone settles it. What a\n * schema would add, refusing an array-valued field, stays on the server.\n */\nfunction validateMetricFilter(filter: FilterExpression): void {\n switch (filter.op) {\n case FilterOperator.SEARCH:\n throw new TypeError(\n 'Aggregation metric filters do not support search filters.',\n );\n case FilterOperator.ELEMENT_MATCH:\n throw new TypeError(\n 'Aggregation metric filters do not support [ELEMENT_MATCH].',\n );\n case FilterOperator.AND:\n case FilterOperator.OR:\n case FilterOperator.NOR:\n filter.operands.forEach(validateMetricFilter);\n break;\n }\n}\n\n/**\n * Walks the arithmetic of every metric that carries an expression, as one\n * budget, and of each expression group on its own, as Wow does.\n */\nfunction validateExpressions(\n metrics: readonly AggregationMetric[],\n groupBy: readonly AggregationGroup[],\n): void {\n requireValidExpressionTrees(\n metrics.flatMap(metric =>\n metric.type === AggregationMetricType.NUMERIC ||\n metric.type === AggregationMetricType.DISTINCT_COUNT ||\n metric.type === AggregationMetricType.PERCENTILE\n ? [metric.expression]\n : [],\n ),\n );\n groupBy.forEach(group => {\n if (\n group.type !== AggregationGroupType.TERMS &&\n group.type !== AggregationGroupType.HISTOGRAM\n )\n return;\n if ((group.field === undefined) === (group.expression === undefined)) {\n throw new TypeError(\n `${group.type} group requires exactly one of field and expression.`,\n );\n }\n if (group.expression) requireValidExpressionTrees([group.expression]);\n if (\n group.type === AggregationGroupType.TERMS &&\n group.missingKey !== undefined &&\n group.expression\n ) {\n throw new TypeError('terms missingKey requires a field input.');\n }\n if (group.scope === AggregationGroupScope.ROOT && group.expression) {\n throw new TypeError(\n `${group.type} with a ROOT scope requires a field input.`,\n );\n }\n });\n}\n\n/** The metric types whose value is not a number: derived and having refuse them. */\nconst NON_NUMERIC: ReadonlySet<string> = new Set([\n AggregationMetricType.ANY,\n AggregationMetricType.FIRST,\n AggregationMetricType.LAST,\n]);\n\n/**\n * Admits the derived metrics against what was declared before each of them.\n *\n * Derived arithmetic runs after the aggregation, over values the query has\n * already produced, so a reference may only name a metric declared earlier —\n * that is what makes the list evaluable in one pass — and never an `ANY`,\n * `FIRST` or `LAST` metric, whose value is a field's value rather than a\n * number.\n */\nfunction validateDerivedMetrics(metrics: readonly AggregationMetric[]): void {\n // Each earlier alias, with its type when that is not a number.\n const declared = new Map<string, string | undefined>();\n const derived = new Set<string>();\n const counter = { nodes: 0, windows: 0 };\n metrics.forEach(metric => {\n if (metric.type === AggregationMetricType.DERIVED) {\n validateDerivedExpression(metric, declared, derived, counter);\n derived.add(metric.alias);\n }\n declared.set(\n metric.alias,\n NON_NUMERIC.has(metric.type) ? metric.type : undefined,\n );\n });\n}\n\nfunction validateDerivedExpression(\n metric: DerivedAggregationMetric,\n declared: ReadonlyMap<string, string | undefined>,\n derived: ReadonlySet<string>,\n counter: { nodes: number; windows: number },\n): void {\n const pending: { expression: DerivedExpression; depth: number }[] = [\n { expression: metric.expression, depth: 1 },\n ];\n while (pending.length > 0) {\n const { expression, depth } = pending.pop()!;\n if (depth > AGGREGATION_LIMITS.MAX_EXPRESSION_DEPTH) {\n throw new TypeError(\n `derived expression depth must be at most ${AGGREGATION_LIMITS.MAX_EXPRESSION_DEPTH}.`,\n );\n }\n counter.nodes++;\n if (counter.nodes > AGGREGATION_LIMITS.MAX_EXPRESSION_NODES) {\n throw new TypeError(\n `derived expressions must contain at most ${AGGREGATION_LIMITS.MAX_EXPRESSION_NODES} nodes.`,\n );\n }\n switch (expression.type) {\n case DerivedExpressionType.METRIC_REF: {\n const reference = expression.metric;\n if (!declared.has(reference)) {\n throw new TypeError(\n `derived metric [${metric.alias}] must reference a metric declared before it, but was [${reference}].`,\n );\n }\n const nonNumeric = declared.get(reference);\n if (nonNumeric !== undefined) {\n throw new TypeError(\n `derived metric [${metric.alias}] cannot reference ${nonNumeric} metric [${reference}].`,\n );\n }\n break;\n }\n case DerivedExpressionType.CONSTANT:\n if (!Number.isFinite(expression.value)) {\n throw new TypeError('derived constant must be finite.');\n }\n break;\n case DerivedExpressionType.BINARY:\n pending.push({ expression: expression.left, depth: depth + 1 });\n pending.push({ expression: expression.right, depth: depth + 1 });\n break;\n case DerivedExpressionType.TOTAL:\n case DerivedExpressionType.RUNNING:\n case DerivedExpressionType.PREVIOUS:\n case DerivedExpressionType.RANK:\n counter.windows++;\n if (counter.windows > AGGREGATION_LIMITS.MAX_WINDOWS) {\n throw new TypeError(\n `an aggregation must compute at most ${AGGREGATION_LIMITS.MAX_WINDOWS} windows.`,\n );\n }\n requireWindowMetric(metric.alias, expression, declared, derived);\n break;\n default:\n throw new TypeError(\n `Unsupported derived expression: ${String((expression as { type: unknown }).type)}.`,\n );\n }\n }\n}\n\n/**\n * A window reads a non-derived numeric metric declared before the derived\n * one; the rest of its rules (which metrics add up, which groups it names)\n * the server checks against the whole query.\n */\nfunction requireWindowMetric(\n alias: string,\n window: DerivedWindow,\n declared: ReadonlyMap<string, string | undefined>,\n derived: ReadonlySet<string>,\n): void {\n const target = window.metric;\n if (!declared.has(target)) {\n throw new TypeError(\n `${window.type} window of derived metric [${alias}] must read a metric declared before it, but was [${target}].`,\n );\n }\n if (declared.get(target) !== undefined || derived.has(target)) {\n throw new TypeError(\n `${window.type} window of derived metric [${alias}] must read a non-derived numeric metric, but was [${target}].`,\n );\n }\n}\n\nfunction requireValidHavingMetric(\n metric: string,\n metricAliases: ReadonlySet<string>,\n anyAliases: ReadonlySet<string>,\n edgeAliases: ReadonlySet<string>,\n): void {\n if (!metricAliases.has(metric)) {\n throw new TypeError(\n `having condition [${metric}] must reference a declared metric alias.`,\n );\n }\n if (anyAliases.has(metric)) {\n throw new TypeError(\n `having condition [${metric}] cannot reference ANY metric.`,\n );\n }\n if (edgeAliases.has(metric)) {\n throw new TypeError(\n `having condition [${metric}] cannot reference FIRST or LAST metric.`,\n );\n }\n}\n\n/**\n * `having` filters the grouped rows, so it needs rows to filter: a query with\n * no `groupBy` produces one row and has nothing to select from.\n */\nfunction validateHaving(\n having: HavingExpression | undefined,\n groupBy: readonly AggregationGroup[],\n metrics: readonly AggregationMetric[],\n): void {\n if (having === undefined) return;\n if (groupBy.length === 0) {\n throw new TypeError('having requires at least one groupBy.');\n }\n const metricAliases = new Set(metrics.map(metric => metric.alias));\n const anyAliases = new Set(\n metrics\n .filter(metric => metric.type === AggregationMetricType.ANY)\n .map(metric => metric.alias),\n );\n const edgeAliases = new Set(\n metrics\n .filter(\n metric =>\n metric.type === AggregationMetricType.FIRST ||\n metric.type === AggregationMetricType.LAST,\n )\n .map(metric => metric.alias),\n );\n\n const pending: { expression: HavingExpression; depth: number }[] = [\n { expression: having, depth: 1 },\n ];\n while (pending.length > 0) {\n const { expression, depth } = pending.pop()!;\n if (depth > AGGREGATION_LIMITS.MAX_EXPRESSION_DEPTH) {\n throw new TypeError(\n `having expression depth must be at most ${AGGREGATION_LIMITS.MAX_EXPRESSION_DEPTH}.`,\n );\n }\n switch (expression.type) {\n case HavingExpressionType.CONDITION:\n requireValidHavingMetric(\n expression.metric,\n metricAliases,\n anyAliases,\n edgeAliases,\n );\n if (!Number.isFinite(expression.value)) {\n throw new TypeError(\n `having condition [${expression.metric}] value must be finite.`,\n );\n }\n break;\n case HavingExpressionType.BETWEEN:\n requireValidHavingMetric(\n expression.metric,\n metricAliases,\n anyAliases,\n edgeAliases,\n );\n if (\n !Number.isFinite(expression.lower) ||\n !Number.isFinite(expression.upper)\n ) {\n throw new TypeError(\n `having between [${expression.metric}] bounds must be finite.`,\n );\n }\n if (expression.lower > expression.upper) {\n throw new TypeError(\n `having between [${expression.metric}] lower bound must not exceed upper bound.`,\n );\n }\n break;\n case HavingExpressionType.IN:\n requireValidHavingMetric(\n expression.metric,\n metricAliases,\n anyAliases,\n edgeAliases,\n );\n if (expression.values.length === 0) {\n throw new TypeError(\n `having in [${expression.metric}] values must not be empty.`,\n );\n }\n if (!expression.values.every(Number.isFinite)) {\n throw new TypeError(\n `having in [${expression.metric}] values must be finite.`,\n );\n }\n break;\n case HavingExpressionType.IS_NULL:\n requireValidHavingMetric(\n expression.metric,\n metricAliases,\n anyAliases,\n edgeAliases,\n );\n break;\n case HavingExpressionType.AND:\n case HavingExpressionType.OR:\n if (expression.operands.length === 0) {\n throw new TypeError(\n `having ${expression.type} operands must not be empty.`,\n );\n }\n expression.operands.forEach(operand =>\n pending.push({ expression: operand, depth: depth + 1 }),\n );\n break;\n default:\n throw new TypeError(\n `Unsupported having expression: ${String((expression as { type: unknown }).type)}.`,\n );\n }\n }\n}\n\nfunction validateSort(\n sort: readonly FieldSort[],\n groupBy: readonly AggregationGroup[],\n aliases: readonly string[],\n): void {\n requireAtMost('sort', 'fields', sort, AGGREGATION_LIMITS.MAX_SORT_FIELDS);\n if (groupBy.length === 0 && sort.length > 0) {\n throw new TypeError('sort requires at least one groupBy.');\n }\n const fields = sort.map(entry => entry.field);\n if (new Set(fields).size !== fields.length) {\n throw new TypeError('sort fields must be unique.');\n }\n if (!fields.every(field => aliases.includes(field))) {\n throw new TypeError('sort fields must reference aggregation aliases.');\n }\n requireAtMost(\n 'effective sort',\n 'fields',\n effectiveSort({ groupBy: [...groupBy], sort: [...sort] }),\n AGGREGATION_LIMITS.MAX_SORT_FIELDS,\n );\n}\n\n/**\n * With elements, the groups of a ROOT scope lead the effective sort: a storage\n * reads the root records' keys before the keys of their elements.\n */\nfunction requireRootGroupsFirst(\n query: Pick<AggregationQuery<string, string>, 'groupBy' | 'sort'>,\n): void {\n const root = new Map(\n (query.groupBy ?? []).map(group => [\n group.alias,\n group.scope === AggregationGroupScope.ROOT,\n ]),\n );\n const order = effectiveSort(query).flatMap(entry =>\n root.has(entry.field) ? [root.get(entry.field)] : [],\n );\n const firstElement = order.indexOf(false);\n if (firstElement >= 0 && order.slice(firstElement).includes(true)) {\n throw new TypeError(\n 'groups with a ROOT scope must sort before the element groups.',\n );\n }\n}\n\n/**\n * Admits a whole aggregation query against the rules Wow enforces on arrival;\n * {@link aggregation.query} is its public face.\n */\nexport function admitAggregationQuery<\n ROOT_FIELDS extends string = string,\n AGGREGATION_FIELDS extends string = ROOT_FIELDS,\n>(\n query: AggregationQuery<ROOT_FIELDS, AGGREGATION_FIELDS>,\n): AggregationQuery<ROOT_FIELDS, AGGREGATION_FIELDS> {\n const elements = query.elements ?? [];\n const groupBy = query.groupBy ?? [];\n const metrics = query.metrics;\n const sort = query.sort ?? [];\n\n requireAtMost('elements', 'paths', elements, AGGREGATION_LIMITS.MAX_ELEMENTS);\n requireAtMost(\n 'groupBy',\n 'dimensions',\n groupBy,\n AGGREGATION_LIMITS.MAX_GROUPS,\n );\n if (!Array.isArray(metrics) || metrics.length === 0) {\n throw new TypeError('metrics must not be empty.');\n }\n requireAtMost('metrics', 'entries', metrics, AGGREGATION_LIMITS.MAX_METRICS);\n if (query.limit !== undefined) {\n if (\n !Number.isInteger(query.limit) ||\n query.limit < 1 ||\n query.limit > AGGREGATION_LIMITS.MAX_LIMIT\n ) {\n throw new TypeError(\n `limit must be between 1 and ${AGGREGATION_LIMITS.MAX_LIMIT}.`,\n );\n }\n }\n\n validateExpressions(metrics, groupBy);\n validateDerivedMetrics(metrics);\n validateHaving(query.having, groupBy, metrics);\n metrics.forEach(metric => {\n if ('filter' in metric && metric.filter)\n validateMetricFilter(metric.filter);\n });\n\n // A dense DATE_HISTOGRAM fills in the buckets its range implies, and a\n // dense DATE_PART every key of its part's domain, rather than only the ones\n // with rows; a second dimension would multiply that filling out across\n // every one of its own keys.\n groupBy.forEach(group => {\n if (\n (group.type === AggregationGroupType.DATE_HISTOGRAM ||\n group.type === AggregationGroupType.DATE_PART) &&\n group.dense === true &&\n groupBy.length !== 1\n ) {\n throw new TypeError(\n `dense requires ${group.type} to be the only groupBy.`,\n );\n }\n });\n\n const aliases = [\n ...groupBy.map(group => group.alias),\n ...metrics.map(metric => metric.alias),\n ];\n if (new Set(aliases).size !== aliases.length) {\n throw new TypeError('aggregation aliases must be unique.');\n }\n validateSort(sort, groupBy, aliases);\n if (elements.length > 0) requireRootGroupsFirst(query);\n\n return {\n ...query,\n metrics: [...metrics] as typeof query.metrics,\n };\n}\n"],"mappings":"8HAoCA,SAASY,EACP,EACA,EACA,EACA,EACM,CACN,GAAIC,EAAM,OAASC,EACjB,MAAU,UAAU,GAAGC,EAAK,wBAAwBD,EAAI,GAAGE,EAAK,EAAE,CAEtE,CAWA,SAASC,EAAqB,EAAgC,CAC5D,OAAQC,EAAO,GAAf,CACE,KAAKlB,EAAAA,eAAe,OAClB,MAAU,UACR,2DACF,EACF,KAAKA,EAAAA,eAAe,cAClB,MAAU,UACR,4DACF,EACF,KAAKA,EAAAA,eAAe,IACpB,KAAKA,EAAAA,eAAe,GACpB,KAAKA,EAAAA,eAAe,IAClBkB,EAAO,SAAS,QAAQD,CAAoB,CAEhD,CACF,CAMA,SAASE,EACP,EACA,EACM,CACNT,EAAA,4BACEU,EAAQ,QAAQ,GACdC,EAAO,OAASpB,EAAAA,sBAAsB,SACtCoB,EAAO,OAASpB,EAAAA,sBAAsB,gBACtCoB,EAAO,OAASpB,EAAAA,sBAAsB,WAClC,CAACoB,EAAO,UAAU,EAClB,CAAC,CACP,CACF,EACAC,EAAQ,QAAQ,GAAS,CACvB,GACEC,EAAM,OAASrB,EAAAA,qBAAqB,OACpCqB,EAAM,OAASrB,EAAAA,qBAAqB,UAGtC,IAAKqB,EAAM,QAAU,IAAA,KAAgBA,EAAM,aAAe,IAAA,IACxD,MAAU,UACR,GAAGA,EAAM,KAAK,qDAChB,EAGF,GADIA,EAAM,YAAYb,EAAA,4BAA4B,CAACa,EAAM,UAAU,CAAC,EAElEA,EAAM,OAASrB,EAAAA,qBAAqB,OACpCqB,EAAM,aAAe,IAAA,IACrBA,EAAM,WAEN,MAAU,UAAU,0CAA0C,EAEhE,GAAIA,EAAM,QAAUpB,EAAAA,sBAAsB,MAAQoB,EAAM,WACtD,MAAU,UACR,GAAGA,EAAM,KAAK,2CAChB,CAbA,CAeJ,CAAC,CACH,CAGA,IAAMC,EAAmC,IAAI,IAAI,CAC/CvB,EAAAA,sBAAsB,IACtBA,EAAAA,sBAAsB,MACtBA,EAAAA,sBAAsB,IACxB,CAAC,EAWD,SAASwB,EAAuB,EAA6C,CAE3E,IAAMC,EAAW,IAAI,IACfC,EAAU,IAAI,IACdC,EAAU,CAAE,MAAO,EAAG,QAAS,CAAE,EACvCR,EAAQ,QAAQ,GAAU,CACpBC,EAAO,OAASpB,EAAAA,sBAAsB,UACxC4B,EAA0BR,EAAQK,EAAUC,EAASC,CAAO,EAC5DD,EAAQ,IAAIN,EAAO,KAAK,GAE1BK,EAAS,IACPL,EAAO,MACPG,EAAY,IAAIH,EAAO,IAAI,EAAIA,EAAO,KAAO,IAAA,EAC/C,CACF,CAAC,CACH,CAEA,SAASQ,EACP,EACA,EACA,EACA,EACM,CACN,IAAMC,EAA8D,CAClE,CAAE,WAAYT,EAAO,WAAY,MAAO,CAAE,CAC5C,EACA,KAAOS,EAAQ,OAAS,GAAG,CACzB,GAAM,CAAE,aAAY,SAAUA,EAAQ,IAAI,EAC1C,GAAIC,EAAQ3B,EAAAA,mBAAmB,qBAC7B,MAAU,UACR,4CAA4CA,EAAAA,mBAAmB,qBAAqB,EACtF,EAGF,GADA,EAAQ,QACJwB,EAAQ,MAAQxB,EAAAA,mBAAmB,qBACrC,MAAU,UACR,4CAA4CA,EAAAA,mBAAmB,qBAAqB,QACtF,EAEF,OAAQ4B,EAAW,KAAnB,CACE,KAAK3B,EAAAA,sBAAsB,WAAY,CACrC,IAAM4B,EAAYD,EAAW,OAC7B,GAAI,CAACN,EAAS,IAAIO,CAAS,EACzB,MAAU,UACR,mBAAmBZ,EAAO,MAAM,yDAAyDY,EAAU,GACrG,EAEF,IAAMC,EAAaR,EAAS,IAAIO,CAAS,EACzC,GAAIC,IAAe,IAAA,GACjB,MAAU,UACR,mBAAmBb,EAAO,MAAM,qBAAqBa,EAAW,WAAWD,EAAU,GACvF,EAEF,KACF,CACA,KAAK5B,EAAAA,sBAAsB,SACzB,GAAI,CAAC,OAAO,SAAS2B,EAAW,KAAK,EACnC,MAAU,UAAU,kCAAkC,EAExD,MACF,KAAK3B,EAAAA,sBAAsB,OACzByB,EAAQ,KAAK,CAAE,WAAYE,EAAW,KAAM,MAAOD,EAAQ,CAAE,CAAC,EAC9DD,EAAQ,KAAK,CAAE,WAAYE,EAAW,MAAO,MAAOD,EAAQ,CAAE,CAAC,EAC/D,MACF,KAAK1B,EAAAA,sBAAsB,MAC3B,KAAKA,EAAAA,sBAAsB,QAC3B,KAAKA,EAAAA,sBAAsB,SAC3B,KAAKA,EAAAA,sBAAsB,KAEzB,GADA,EAAQ,UACJuB,EAAQ,QAAUxB,EAAAA,mBAAmB,YACvC,MAAU,UACR,uCAAuCA,EAAAA,mBAAmB,YAAY,UACxE,EAEF+B,EAAoBd,EAAO,MAAOW,EAAYN,EAAUC,CAAO,EAC/D,MACF,QACE,MAAU,UACR,mCAAmC,OAAQK,EAAiC,IAAI,EAAE,EACpF,CACJ,CACF,CACF,CAOA,SAASG,EACP,EACA,EACA,EACA,EACM,CACN,IAAMC,EAASC,EAAO,OACtB,GAAI,CAACX,EAAS,IAAIU,CAAM,EACtB,MAAU,UACR,GAAGC,EAAO,KAAK,6BAA6BC,EAAM,oDAAoDF,EAAO,GAC/G,EAEF,GAAIV,EAAS,IAAIU,CAAM,IAAM,IAAA,IAAaT,EAAQ,IAAIS,CAAM,EAC1D,MAAU,UACR,GAAGC,EAAO,KAAK,6BAA6BC,EAAM,qDAAqDF,EAAO,GAChH,CAEJ,CAEA,SAASG,EACP,EACA,EACA,EACA,EACM,CACN,GAAI,CAACC,EAAc,IAAInB,CAAM,EAC3B,MAAU,UACR,qBAAqBA,EAAO,0CAC9B,EAEF,GAAIoB,EAAW,IAAIpB,CAAM,EACvB,MAAU,UACR,qBAAqBA,EAAO,+BAC9B,EAEF,GAAIqB,EAAY,IAAIrB,CAAM,EACxB,MAAU,UACR,qBAAqBA,EAAO,yCAC9B,CAEJ,CAMA,SAASsB,EACP,EACA,EACA,EACM,CACN,GAAIC,IAAW,IAAA,GAAW,OAC1B,GAAItB,EAAQ,SAAW,EACrB,MAAU,UAAU,uCAAuC,EAE7D,IAAMkB,EAAgB,IAAI,IAAIpB,EAAQ,IAAI,GAAUC,EAAO,KAAK,CAAC,EAC3DoB,EAAa,IAAI,IACrBrB,EACG,OAAO,GAAUC,EAAO,OAASpB,EAAAA,sBAAsB,GAAG,CAAC,CAC3D,IAAI,GAAUoB,EAAO,KAAK,CAC/B,EACMqB,EAAc,IAAI,IACtBtB,EACG,OACC,GACEC,EAAO,OAASpB,EAAAA,sBAAsB,OACtCoB,EAAO,OAASpB,EAAAA,sBAAsB,IAC1C,CAAC,CACA,IAAI,GAAUoB,EAAO,KAAK,CAC/B,EAEMS,EAA6D,CACjE,CAAE,WAAYc,EAAQ,MAAO,CAAE,CACjC,EACA,KAAOd,EAAQ,OAAS,GAAG,CACzB,GAAM,CAAE,aAAY,SAAUA,EAAQ,IAAI,EAC1C,GAAIC,EAAQ3B,EAAAA,mBAAmB,qBAC7B,MAAU,UACR,2CAA2CA,EAAAA,mBAAmB,qBAAqB,EACrF,EAEF,OAAQ4B,EAAW,KAAnB,CACE,KAAK1B,EAAAA,qBAAqB,UAOxB,GANAiC,EACEP,EAAW,OACXQ,EACAC,EACAC,CACF,EACI,CAAC,OAAO,SAASV,EAAW,KAAK,EACnC,MAAU,UACR,qBAAqBA,EAAW,OAAO,wBACzC,EAEF,MACF,KAAK1B,EAAAA,qBAAqB,QAOxB,GANAiC,EACEP,EAAW,OACXQ,EACAC,EACAC,CACF,EAEE,CAAC,OAAO,SAASV,EAAW,KAAK,GACjC,CAAC,OAAO,SAASA,EAAW,KAAK,EAEjC,MAAU,UACR,mBAAmBA,EAAW,OAAO,yBACvC,EAEF,GAAIA,EAAW,MAAQA,EAAW,MAChC,MAAU,UACR,mBAAmBA,EAAW,OAAO,2CACvC,EAEF,MACF,KAAK1B,EAAAA,qBAAqB,GAOxB,GANAiC,EACEP,EAAW,OACXQ,EACAC,EACAC,CACF,EACIV,EAAW,OAAO,SAAW,EAC/B,MAAU,UACR,cAAcA,EAAW,OAAO,4BAClC,EAEF,GAAI,CAACA,EAAW,OAAO,MAAM,OAAO,QAAQ,EAC1C,MAAU,UACR,cAAcA,EAAW,OAAO,yBAClC,EAEF,MACF,KAAK1B,EAAAA,qBAAqB,QACxBiC,EACEP,EAAW,OACXQ,EACAC,EACAC,CACF,EACA,MACF,KAAKpC,EAAAA,qBAAqB,IAC1B,KAAKA,EAAAA,qBAAqB,GACxB,GAAI0B,EAAW,SAAS,SAAW,EACjC,MAAU,UACR,UAAUA,EAAW,KAAK,6BAC5B,EAEFA,EAAW,SAAS,QAAQ,GAC1BF,EAAQ,KAAK,CAAE,WAAYe,EAAS,MAAOd,EAAQ,CAAE,CAAC,CACxD,EACA,MACF,QACE,MAAU,UACR,kCAAkC,OAAQC,EAAiC,IAAI,EAAE,EACnF,CACJ,CACF,CACF,CAEA,SAASc,EACP,EACA,EACA,EACM,CAEN,GADAlC,EAAc,OAAQ,SAAUmC,EAAM3C,EAAAA,mBAAmB,eAAe,EACpEkB,EAAQ,SAAW,GAAKyB,EAAK,OAAS,EACxC,MAAU,UAAU,qCAAqC,EAE3D,IAAMC,EAASD,EAAK,IAAI,GAASE,EAAM,KAAK,EAC5C,GAAI,IAAI,IAAID,CAAM,CAAC,CAAC,OAASA,EAAO,OAClC,MAAU,UAAU,6BAA6B,EAEnD,GAAI,CAACA,EAAO,MAAM,GAASE,EAAQ,SAASC,CAAK,CAAC,EAChD,MAAU,UAAU,iDAAiD,EAEvEvC,EACE,iBACA,SACAL,EAAAA,cAAc,CAAE,QAAS,CAAC,GAAGe,CAAO,EAAG,KAAM,CAAC,GAAGyB,CAAI,CAAE,CAAC,EACxD3C,EAAAA,mBAAmB,eACrB,CACF,CAMA,SAASgD,EACP,EACM,CACN,IAAMC,EAAO,IAAI,KACdC,EAAM,SAAW,CAAC,EAAA,CAAG,IAAI,GAAS,CACjC/B,EAAM,MACNA,EAAM,QAAUpB,EAAAA,sBAAsB,IACxC,CAAC,CACH,EACMoD,EAAQhD,EAAAA,cAAc+C,CAAK,CAAC,CAAC,QAAQ,GACzCD,EAAK,IAAIJ,EAAM,KAAK,EAAI,CAACI,EAAK,IAAIJ,EAAM,KAAK,CAAC,EAAI,CAAC,CACrD,EACMO,EAAeD,EAAM,QAAQ,EAAK,EACxC,GAAIC,GAAgB,GAAKD,EAAM,MAAMC,CAAY,CAAC,CAAC,SAAS,EAAI,EAC9D,MAAU,UACR,+DACF,CAEJ,CAMA,SAAgBC,EAId,EACmD,CACnD,IAAMC,EAAWJ,EAAM,UAAY,CAAC,EAC9BhC,EAAUgC,EAAM,SAAW,CAAC,EAC5BlC,EAAUkC,EAAM,QAChBP,EAAOO,EAAM,MAAQ,CAAC,EAS5B,GAPA1C,EAAc,WAAY,QAAS8C,EAAUtD,EAAAA,mBAAmB,YAAY,EAC5EQ,EACE,UACA,aACAU,EACAlB,EAAAA,mBAAmB,UACrB,EACI,CAAC,MAAM,QAAQgB,CAAO,GAAKA,EAAQ,SAAW,EAChD,MAAU,UAAU,4BAA4B,EAGlD,GADAR,EAAc,UAAW,UAAWQ,EAAShB,EAAAA,mBAAmB,WAAW,EACvEkD,EAAM,QAAU,IAAA,KAEhB,CAAC,OAAO,UAAUA,EAAM,KAAK,GAC7BA,EAAM,MAAQ,GACdA,EAAM,MAAQlD,EAAAA,mBAAmB,WAEjC,MAAU,UACR,+BAA+BA,EAAAA,mBAAmB,UAAU,EAC9D,EAIJe,EAAoBC,EAASE,CAAO,EACpCG,EAAuBL,CAAO,EAC9BuB,EAAeW,EAAM,OAAQhC,EAASF,CAAO,EAC7CA,EAAQ,QAAQ,GAAU,CACpB,WAAYC,GAAUA,EAAO,QAC/BJ,EAAqBI,EAAO,MAAM,CACtC,CAAC,EAMDC,EAAQ,QAAQ,GAAS,CACvB,IACGC,EAAM,OAASrB,EAAAA,qBAAqB,gBACnCqB,EAAM,OAASrB,EAAAA,qBAAqB,YACtCqB,EAAM,QAAU,IAChBD,EAAQ,SAAW,EAEnB,MAAU,UACR,kBAAkBC,EAAM,KAAK,yBAC/B,CAEJ,CAAC,EAED,IAAM2B,EAAU,CACd,GAAG5B,EAAQ,IAAI,GAASC,EAAM,KAAK,EACnC,GAAGH,EAAQ,IAAI,GAAUC,EAAO,KAAK,CACvC,EACA,GAAI,IAAI,IAAI6B,CAAO,CAAC,CAAC,OAASA,EAAQ,OACpC,MAAU,UAAU,qCAAqC,EAK3D,OAHAJ,EAAaC,EAAMzB,EAAS4B,CAAO,EAC/BQ,EAAS,OAAS,GAAGN,EAAuBE,CAAK,EAE9C,CACL,GAAGA,EACH,QAAS,CAAC,GAAGlC,CAAO,CACtB,CACF"}
@@ -1,82 +1,97 @@
1
1
  import { FilterOperator as e } from "../filter/operator.es.js";
2
- import { AGGREGATION_LIMITS as t, AggregationGroupType as n, AggregationMetricType as r, DerivedExpressionType as i, HavingExpressionType as a } from "./types.es.js";
3
- import { requireValidExpressionTrees as o } from "./expressionTrees.es.js";
4
- import { effectiveSort as s } from "./sort.es.js";
2
+ import { AGGREGATION_LIMITS as t, AggregationGroupScope as n, AggregationGroupType as r, AggregationMetricType as i, DerivedExpressionType as a, HavingExpressionType as o } from "./types.es.js";
3
+ import { requireValidExpressionTrees as s } from "./expressionTrees.es.js";
4
+ import { effectiveSort as c } from "./sort.es.js";
5
5
  //#region src/dsl/aggregation/admit.ts
6
- function c(e, t, n, r) {
6
+ function l(e, t, n, r) {
7
7
  if (n.length > r) throw TypeError(`${e} must contain at most ${r} ${t}.`);
8
8
  }
9
- function l(t) {
9
+ function u(t) {
10
10
  switch (t.op) {
11
11
  case e.SEARCH: throw TypeError("Aggregation metric filters do not support search filters.");
12
12
  case e.ELEMENT_MATCH: throw TypeError("Aggregation metric filters do not support [ELEMENT_MATCH].");
13
13
  case e.AND:
14
14
  case e.OR:
15
- case e.NOR: t.operands.forEach(l);
15
+ case e.NOR: t.operands.forEach(u);
16
16
  }
17
17
  }
18
- function u(e, t) {
19
- o(e.flatMap((e) => e.type === r.NUMERIC || e.type === r.DISTINCT_COUNT || e.type === r.PERCENTILE ? [e.expression] : [])), t.forEach((e) => {
20
- if (e.type === n.TERMS || e.type === n.HISTOGRAM) {
18
+ function d(e, t) {
19
+ s(e.flatMap((e) => e.type === i.NUMERIC || e.type === i.DISTINCT_COUNT || e.type === i.PERCENTILE ? [e.expression] : [])), t.forEach((e) => {
20
+ if (e.type === r.TERMS || e.type === r.HISTOGRAM) {
21
21
  if (e.field === void 0 == (e.expression === void 0)) throw TypeError(`${e.type} group requires exactly one of field and expression.`);
22
- if (e.expression && o([e.expression]), e.type === n.TERMS && e.missingKey !== void 0 && e.expression) throw TypeError("terms missingKey requires a field input.");
22
+ if (e.expression && s([e.expression]), e.type === r.TERMS && e.missingKey !== void 0 && e.expression) throw TypeError("terms missingKey requires a field input.");
23
+ if (e.scope === n.ROOT && e.expression) throw TypeError(`${e.type} with a ROOT scope requires a field input.`);
23
24
  }
24
25
  });
25
26
  }
26
- var d = /* @__PURE__ */ new Set([
27
- r.ANY,
28
- r.FIRST,
29
- r.LAST
27
+ var f = /* @__PURE__ */ new Set([
28
+ i.ANY,
29
+ i.FIRST,
30
+ i.LAST
30
31
  ]);
31
- function f(e) {
32
- let t = /* @__PURE__ */ new Map(), n = 0;
32
+ function p(e) {
33
+ let t = /* @__PURE__ */ new Map(), n = /* @__PURE__ */ new Set(), r = {
34
+ nodes: 0,
35
+ windows: 0
36
+ };
33
37
  e.forEach((e) => {
34
- e.type === r.DERIVED && (n = p(e, t, n)), t.set(e.alias, d.has(e.type) ? e.type : void 0);
38
+ e.type === i.DERIVED && (m(e, t, n, r), n.add(e.alias)), t.set(e.alias, f.has(e.type) ? e.type : void 0);
35
39
  });
36
40
  }
37
- function p(e, n, r) {
38
- let a = [{
41
+ function m(e, n, r, i) {
42
+ let o = [{
39
43
  expression: e.expression,
40
44
  depth: 1
41
- }], o = r;
42
- for (; a.length > 0;) {
43
- let { expression: r, depth: s } = a.pop();
44
- if (s > t.MAX_EXPRESSION_DEPTH) throw TypeError(`derived expression depth must be at most ${t.MAX_EXPRESSION_DEPTH}.`);
45
- if (o++, o > t.MAX_EXPRESSION_NODES) throw TypeError(`derived expressions must contain at most ${t.MAX_EXPRESSION_NODES} nodes.`);
46
- switch (r.type) {
47
- case i.METRIC_REF: {
48
- let t = r.metric;
45
+ }];
46
+ for (; o.length > 0;) {
47
+ let { expression: s, depth: c } = o.pop();
48
+ if (c > t.MAX_EXPRESSION_DEPTH) throw TypeError(`derived expression depth must be at most ${t.MAX_EXPRESSION_DEPTH}.`);
49
+ if (i.nodes++, i.nodes > t.MAX_EXPRESSION_NODES) throw TypeError(`derived expressions must contain at most ${t.MAX_EXPRESSION_NODES} nodes.`);
50
+ switch (s.type) {
51
+ case a.METRIC_REF: {
52
+ let t = s.metric;
49
53
  if (!n.has(t)) throw TypeError(`derived metric [${e.alias}] must reference a metric declared before it, but was [${t}].`);
50
- let i = n.get(t);
51
- if (i !== void 0) throw TypeError(`derived metric [${e.alias}] cannot reference ${i} metric [${t}].`);
54
+ let r = n.get(t);
55
+ if (r !== void 0) throw TypeError(`derived metric [${e.alias}] cannot reference ${r} metric [${t}].`);
52
56
  break;
53
57
  }
54
- case i.CONSTANT:
55
- if (!Number.isFinite(r.value)) throw TypeError("derived constant must be finite.");
58
+ case a.CONSTANT:
59
+ if (!Number.isFinite(s.value)) throw TypeError("derived constant must be finite.");
56
60
  break;
57
- case i.BINARY:
58
- a.push({
59
- expression: r.left,
60
- depth: s + 1
61
- }), a.push({
62
- expression: r.right,
63
- depth: s + 1
61
+ case a.BINARY:
62
+ o.push({
63
+ expression: s.left,
64
+ depth: c + 1
65
+ }), o.push({
66
+ expression: s.right,
67
+ depth: c + 1
64
68
  });
65
69
  break;
66
- default: throw TypeError(`Unsupported derived expression: ${String(r.type)}.`);
70
+ case a.TOTAL:
71
+ case a.RUNNING:
72
+ case a.PREVIOUS:
73
+ case a.RANK:
74
+ if (i.windows++, i.windows > t.MAX_WINDOWS) throw TypeError(`an aggregation must compute at most ${t.MAX_WINDOWS} windows.`);
75
+ h(e.alias, s, n, r);
76
+ break;
77
+ default: throw TypeError(`Unsupported derived expression: ${String(s.type)}.`);
67
78
  }
68
79
  }
69
- return o;
70
80
  }
71
- function m(e, t, n, r) {
81
+ function h(e, t, n, r) {
82
+ let i = t.metric;
83
+ if (!n.has(i)) throw TypeError(`${t.type} window of derived metric [${e}] must read a metric declared before it, but was [${i}].`);
84
+ if (n.get(i) !== void 0 || r.has(i)) throw TypeError(`${t.type} window of derived metric [${e}] must read a non-derived numeric metric, but was [${i}].`);
85
+ }
86
+ function g(e, t, n, r) {
72
87
  if (!t.has(e)) throw TypeError(`having condition [${e}] must reference a declared metric alias.`);
73
88
  if (n.has(e)) throw TypeError(`having condition [${e}] cannot reference ANY metric.`);
74
89
  if (r.has(e)) throw TypeError(`having condition [${e}] cannot reference FIRST or LAST metric.`);
75
90
  }
76
- function h(e, n, i) {
91
+ function _(e, n, r) {
77
92
  if (e === void 0) return;
78
93
  if (n.length === 0) throw TypeError("having requires at least one groupBy.");
79
- let o = new Set(i.map((e) => e.alias)), s = new Set(i.filter((e) => e.type === r.ANY).map((e) => e.alias)), c = new Set(i.filter((e) => e.type === r.FIRST || e.type === r.LAST).map((e) => e.alias)), l = [{
94
+ let a = new Set(r.map((e) => e.alias)), s = new Set(r.filter((e) => e.type === i.ANY).map((e) => e.alias)), c = new Set(r.filter((e) => e.type === i.FIRST || e.type === i.LAST).map((e) => e.alias)), l = [{
80
95
  expression: e,
81
96
  depth: 1
82
97
  }];
@@ -84,22 +99,22 @@ function h(e, n, i) {
84
99
  let { expression: e, depth: n } = l.pop();
85
100
  if (n > t.MAX_EXPRESSION_DEPTH) throw TypeError(`having expression depth must be at most ${t.MAX_EXPRESSION_DEPTH}.`);
86
101
  switch (e.type) {
87
- case a.CONDITION:
88
- if (m(e.metric, o, s, c), !Number.isFinite(e.value)) throw TypeError(`having condition [${e.metric}] value must be finite.`);
102
+ case o.CONDITION:
103
+ if (g(e.metric, a, s, c), !Number.isFinite(e.value)) throw TypeError(`having condition [${e.metric}] value must be finite.`);
89
104
  break;
90
- case a.BETWEEN:
91
- if (m(e.metric, o, s, c), !Number.isFinite(e.lower) || !Number.isFinite(e.upper)) throw TypeError(`having between [${e.metric}] bounds must be finite.`);
105
+ case o.BETWEEN:
106
+ if (g(e.metric, a, s, c), !Number.isFinite(e.lower) || !Number.isFinite(e.upper)) throw TypeError(`having between [${e.metric}] bounds must be finite.`);
92
107
  if (e.lower > e.upper) throw TypeError(`having between [${e.metric}] lower bound must not exceed upper bound.`);
93
108
  break;
94
- case a.IN:
95
- if (m(e.metric, o, s, c), e.values.length === 0) throw TypeError(`having in [${e.metric}] values must not be empty.`);
109
+ case o.IN:
110
+ if (g(e.metric, a, s, c), e.values.length === 0) throw TypeError(`having in [${e.metric}] values must not be empty.`);
96
111
  if (!e.values.every(Number.isFinite)) throw TypeError(`having in [${e.metric}] values must be finite.`);
97
112
  break;
98
- case a.IS_NULL:
99
- m(e.metric, o, s, c);
113
+ case o.IS_NULL:
114
+ g(e.metric, a, s, c);
100
115
  break;
101
- case a.AND:
102
- case a.OR:
116
+ case o.AND:
117
+ case o.OR:
103
118
  if (e.operands.length === 0) throw TypeError(`having ${e.type} operands must not be empty.`);
104
119
  e.operands.forEach((e) => l.push({
105
120
  expression: e,
@@ -110,33 +125,37 @@ function h(e, n, i) {
110
125
  }
111
126
  }
112
127
  }
113
- function g(e, n, r) {
114
- if (c("sort", "fields", e, t.MAX_SORT_FIELDS), n.length === 0 && e.length > 0) throw TypeError("sort requires at least one groupBy.");
128
+ function v(e, n, r) {
129
+ if (l("sort", "fields", e, t.MAX_SORT_FIELDS), n.length === 0 && e.length > 0) throw TypeError("sort requires at least one groupBy.");
115
130
  let i = e.map((e) => e.field);
116
131
  if (new Set(i).size !== i.length) throw TypeError("sort fields must be unique.");
117
132
  if (!i.every((e) => r.includes(e))) throw TypeError("sort fields must reference aggregation aliases.");
118
- c("effective sort", "fields", s({
133
+ l("effective sort", "fields", c({
119
134
  groupBy: [...n],
120
135
  sort: [...e]
121
136
  }), t.MAX_SORT_FIELDS);
122
137
  }
123
- function _(e) {
124
- let r = e.elements ?? [], i = e.groupBy ?? [], a = e.metrics, o = e.sort ?? [];
125
- if (c("elements", "paths", r, t.MAX_ELEMENTS), c("groupBy", "dimensions", i, t.MAX_GROUPS), !Array.isArray(a) || a.length === 0) throw TypeError("metrics must not be empty.");
126
- if (c("metrics", "entries", a, t.MAX_METRICS), e.limit !== void 0 && (!Number.isInteger(e.limit) || e.limit < 1 || e.limit > t.MAX_LIMIT)) throw TypeError(`limit must be between 1 and ${t.MAX_LIMIT}.`);
127
- u(a, i), f(a), h(e.having, i, a), a.forEach((e) => {
128
- "filter" in e && e.filter && l(e.filter);
138
+ function y(e) {
139
+ let t = new Map((e.groupBy ?? []).map((e) => [e.alias, e.scope === n.ROOT])), r = c(e).flatMap((e) => t.has(e.field) ? [t.get(e.field)] : []), i = r.indexOf(!1);
140
+ if (i >= 0 && r.slice(i).includes(!0)) throw TypeError("groups with a ROOT scope must sort before the element groups.");
141
+ }
142
+ function b(e) {
143
+ let n = e.elements ?? [], i = e.groupBy ?? [], a = e.metrics, o = e.sort ?? [];
144
+ if (l("elements", "paths", n, t.MAX_ELEMENTS), l("groupBy", "dimensions", i, t.MAX_GROUPS), !Array.isArray(a) || a.length === 0) throw TypeError("metrics must not be empty.");
145
+ if (l("metrics", "entries", a, t.MAX_METRICS), e.limit !== void 0 && (!Number.isInteger(e.limit) || e.limit < 1 || e.limit > t.MAX_LIMIT)) throw TypeError(`limit must be between 1 and ${t.MAX_LIMIT}.`);
146
+ d(a, i), p(a), _(e.having, i, a), a.forEach((e) => {
147
+ "filter" in e && e.filter && u(e.filter);
129
148
  }), i.forEach((e) => {
130
- if ((e.type === n.DATE_HISTOGRAM || e.type === n.DATE_PART) && e.dense === !0 && i.length !== 1) throw TypeError(`dense requires ${e.type} to be the only groupBy.`);
149
+ if ((e.type === r.DATE_HISTOGRAM || e.type === r.DATE_PART) && e.dense === !0 && i.length !== 1) throw TypeError(`dense requires ${e.type} to be the only groupBy.`);
131
150
  });
132
151
  let s = [...i.map((e) => e.alias), ...a.map((e) => e.alias)];
133
152
  if (new Set(s).size !== s.length) throw TypeError("aggregation aliases must be unique.");
134
- return g(o, i, s), {
153
+ return v(o, i, s), n.length > 0 && y(e), {
135
154
  ...e,
136
155
  metrics: [...a]
137
156
  };
138
157
  }
139
158
  //#endregion
140
- export { _ as admitAggregationQuery };
159
+ export { b as admitAggregationQuery };
141
160
 
142
161
  //# sourceMappingURL=admit.es.js.map
@@ -1 +1 @@
1
- {"version":3,"file":"admit.es.js","names":["requireAtMost","items","max","name","noun","validateMetricFilter","filter","FilterOperator","validateExpressions","requireValidExpressionTrees","metrics","metric","AggregationMetricType","groupBy","group","AggregationGroupType","NON_NUMERIC","validateDerivedMetrics","declared","nodes","validateDerivedExpression","pending","visitedNodes","depth","AGGREGATION_LIMITS","expression","DerivedExpressionType","reference","nonNumeric","requireValidHavingMetric","metricAliases","anyAliases","edgeAliases","validateHaving","having","HavingExpressionType","operand","validateSort","sort","fields","entry","aliases","field","effectiveSort","admitAggregationQuery","elements","query"],"sources":["../../../src/dsl/aggregation/admit.ts"],"sourcesContent":["/*\n * Copyright [2021-present] [ahoo wang <ahoowang@qq.com> (https://github.com/Ahoo-Wang)].\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n * http://www.apache.org/licenses/LICENSE-2.0\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { FilterOperator, type FilterExpression } from '../filter/index.js';\nimport type { FieldSort } from '../sort.js';\nimport { requireValidExpressionTrees } from './expressionTrees.js';\nimport { effectiveSort } from './sort.js';\nimport {\n AGGREGATION_LIMITS,\n AggregationGroupType,\n AggregationMetricType,\n DerivedExpressionType,\n HavingExpressionType,\n type AggregationGroup,\n type AggregationMetric,\n type AggregationQuery,\n type DerivedAggregationMetric,\n type DerivedExpression,\n type HavingExpression,\n} from './types.js';\n\n// Internal: the rules `aggregation.query()` checks across the parts of a\n// query. index.ts does not re-export this file.\n\nfunction requireAtMost(\n name: string,\n noun: string,\n items: readonly unknown[],\n max: number,\n): void {\n if (items.length > max) {\n throw new TypeError(`${name} must contain at most ${max} ${noun}.`);\n }\n}\n\n/**\n * Refuses the filters a metric cannot carry, whatever the aggregate holds.\n *\n * A metric filter is a whole-value predicate on one record — MongoDB turns it\n * into a `$cond` guard and Elasticsearch into a filter aggregation — and\n * element matching and full text have no whole-value reading. Both backends\n * refuse them before touching a schema, so the shape alone settles it. What a\n * schema would add, refusing an array-valued field, stays on the server.\n */\nfunction validateMetricFilter(filter: FilterExpression): void {\n switch (filter.op) {\n case FilterOperator.SEARCH:\n throw new TypeError(\n 'Aggregation metric filters do not support search filters.',\n );\n case FilterOperator.ELEMENT_MATCH:\n throw new TypeError(\n 'Aggregation metric filters do not support [ELEMENT_MATCH].',\n );\n case FilterOperator.AND:\n case FilterOperator.OR:\n case FilterOperator.NOR:\n filter.operands.forEach(validateMetricFilter);\n break;\n }\n}\n\n/**\n * Walks the arithmetic of every metric that carries an expression, as one\n * budget, and of each expression group on its own, as Wow does.\n */\nfunction validateExpressions(\n metrics: readonly AggregationMetric[],\n groupBy: readonly AggregationGroup[],\n): void {\n requireValidExpressionTrees(\n metrics.flatMap(metric =>\n metric.type === AggregationMetricType.NUMERIC ||\n metric.type === AggregationMetricType.DISTINCT_COUNT ||\n metric.type === AggregationMetricType.PERCENTILE\n ? [metric.expression]\n : [],\n ),\n );\n groupBy.forEach(group => {\n if (\n group.type !== AggregationGroupType.TERMS &&\n group.type !== AggregationGroupType.HISTOGRAM\n )\n return;\n if ((group.field === undefined) === (group.expression === undefined)) {\n throw new TypeError(\n `${group.type} group requires exactly one of field and expression.`,\n );\n }\n if (group.expression) requireValidExpressionTrees([group.expression]);\n if (\n group.type === AggregationGroupType.TERMS &&\n group.missingKey !== undefined &&\n group.expression\n ) {\n throw new TypeError('terms missingKey requires a field input.');\n }\n });\n}\n\n/** The metric types whose value is not a number: derived and having refuse them. */\nconst NON_NUMERIC: ReadonlySet<string> = new Set([\n AggregationMetricType.ANY,\n AggregationMetricType.FIRST,\n AggregationMetricType.LAST,\n]);\n\n/**\n * Admits the derived metrics against what was declared before each of them.\n *\n * Derived arithmetic runs after the aggregation, over values the query has\n * already produced, so a reference may only name a metric declared earlier —\n * that is what makes the list evaluable in one pass — and never an `ANY`,\n * `FIRST` or `LAST` metric, whose value is a field's value rather than a\n * number.\n */\nfunction validateDerivedMetrics(metrics: readonly AggregationMetric[]): void {\n // Each earlier alias, with its type when that is not a number.\n const declared = new Map<string, string | undefined>();\n let nodes = 0;\n metrics.forEach(metric => {\n if (metric.type === AggregationMetricType.DERIVED) {\n nodes = validateDerivedExpression(metric, declared, nodes);\n }\n declared.set(\n metric.alias,\n NON_NUMERIC.has(metric.type) ? metric.type : undefined,\n );\n });\n}\n\nfunction validateDerivedExpression(\n metric: DerivedAggregationMetric,\n declared: ReadonlyMap<string, string | undefined>,\n visitedNodes: number,\n): number {\n const pending: { expression: DerivedExpression; depth: number }[] = [\n { expression: metric.expression, depth: 1 },\n ];\n let nodes = visitedNodes;\n while (pending.length > 0) {\n const { expression, depth } = pending.pop()!;\n if (depth > AGGREGATION_LIMITS.MAX_EXPRESSION_DEPTH) {\n throw new TypeError(\n `derived expression depth must be at most ${AGGREGATION_LIMITS.MAX_EXPRESSION_DEPTH}.`,\n );\n }\n nodes++;\n if (nodes > AGGREGATION_LIMITS.MAX_EXPRESSION_NODES) {\n throw new TypeError(\n `derived expressions must contain at most ${AGGREGATION_LIMITS.MAX_EXPRESSION_NODES} nodes.`,\n );\n }\n switch (expression.type) {\n case DerivedExpressionType.METRIC_REF: {\n const reference = expression.metric;\n if (!declared.has(reference)) {\n throw new TypeError(\n `derived metric [${metric.alias}] must reference a metric declared before it, but was [${reference}].`,\n );\n }\n const nonNumeric = declared.get(reference);\n if (nonNumeric !== undefined) {\n throw new TypeError(\n `derived metric [${metric.alias}] cannot reference ${nonNumeric} metric [${reference}].`,\n );\n }\n break;\n }\n case DerivedExpressionType.CONSTANT:\n if (!Number.isFinite(expression.value)) {\n throw new TypeError('derived constant must be finite.');\n }\n break;\n case DerivedExpressionType.BINARY:\n pending.push({ expression: expression.left, depth: depth + 1 });\n pending.push({ expression: expression.right, depth: depth + 1 });\n break;\n default:\n throw new TypeError(\n `Unsupported derived expression: ${String((expression as { type: unknown }).type)}.`,\n );\n }\n }\n return nodes;\n}\n\nfunction requireValidHavingMetric(\n metric: string,\n metricAliases: ReadonlySet<string>,\n anyAliases: ReadonlySet<string>,\n edgeAliases: ReadonlySet<string>,\n): void {\n if (!metricAliases.has(metric)) {\n throw new TypeError(\n `having condition [${metric}] must reference a declared metric alias.`,\n );\n }\n if (anyAliases.has(metric)) {\n throw new TypeError(\n `having condition [${metric}] cannot reference ANY metric.`,\n );\n }\n if (edgeAliases.has(metric)) {\n throw new TypeError(\n `having condition [${metric}] cannot reference FIRST or LAST metric.`,\n );\n }\n}\n\n/**\n * `having` filters the grouped rows, so it needs rows to filter: a query with\n * no `groupBy` produces one row and has nothing to select from.\n */\nfunction validateHaving(\n having: HavingExpression | undefined,\n groupBy: readonly AggregationGroup[],\n metrics: readonly AggregationMetric[],\n): void {\n if (having === undefined) return;\n if (groupBy.length === 0) {\n throw new TypeError('having requires at least one groupBy.');\n }\n const metricAliases = new Set(metrics.map(metric => metric.alias));\n const anyAliases = new Set(\n metrics\n .filter(metric => metric.type === AggregationMetricType.ANY)\n .map(metric => metric.alias),\n );\n const edgeAliases = new Set(\n metrics\n .filter(\n metric =>\n metric.type === AggregationMetricType.FIRST ||\n metric.type === AggregationMetricType.LAST,\n )\n .map(metric => metric.alias),\n );\n\n const pending: { expression: HavingExpression; depth: number }[] = [\n { expression: having, depth: 1 },\n ];\n while (pending.length > 0) {\n const { expression, depth } = pending.pop()!;\n if (depth > AGGREGATION_LIMITS.MAX_EXPRESSION_DEPTH) {\n throw new TypeError(\n `having expression depth must be at most ${AGGREGATION_LIMITS.MAX_EXPRESSION_DEPTH}.`,\n );\n }\n switch (expression.type) {\n case HavingExpressionType.CONDITION:\n requireValidHavingMetric(\n expression.metric,\n metricAliases,\n anyAliases,\n edgeAliases,\n );\n if (!Number.isFinite(expression.value)) {\n throw new TypeError(\n `having condition [${expression.metric}] value must be finite.`,\n );\n }\n break;\n case HavingExpressionType.BETWEEN:\n requireValidHavingMetric(\n expression.metric,\n metricAliases,\n anyAliases,\n edgeAliases,\n );\n if (\n !Number.isFinite(expression.lower) ||\n !Number.isFinite(expression.upper)\n ) {\n throw new TypeError(\n `having between [${expression.metric}] bounds must be finite.`,\n );\n }\n if (expression.lower > expression.upper) {\n throw new TypeError(\n `having between [${expression.metric}] lower bound must not exceed upper bound.`,\n );\n }\n break;\n case HavingExpressionType.IN:\n requireValidHavingMetric(\n expression.metric,\n metricAliases,\n anyAliases,\n edgeAliases,\n );\n if (expression.values.length === 0) {\n throw new TypeError(\n `having in [${expression.metric}] values must not be empty.`,\n );\n }\n if (!expression.values.every(Number.isFinite)) {\n throw new TypeError(\n `having in [${expression.metric}] values must be finite.`,\n );\n }\n break;\n case HavingExpressionType.IS_NULL:\n requireValidHavingMetric(\n expression.metric,\n metricAliases,\n anyAliases,\n edgeAliases,\n );\n break;\n case HavingExpressionType.AND:\n case HavingExpressionType.OR:\n if (expression.operands.length === 0) {\n throw new TypeError(\n `having ${expression.type} operands must not be empty.`,\n );\n }\n expression.operands.forEach(operand =>\n pending.push({ expression: operand, depth: depth + 1 }),\n );\n break;\n default:\n throw new TypeError(\n `Unsupported having expression: ${String((expression as { type: unknown }).type)}.`,\n );\n }\n }\n}\n\nfunction validateSort(\n sort: readonly FieldSort[],\n groupBy: readonly AggregationGroup[],\n aliases: readonly string[],\n): void {\n requireAtMost('sort', 'fields', sort, AGGREGATION_LIMITS.MAX_SORT_FIELDS);\n if (groupBy.length === 0 && sort.length > 0) {\n throw new TypeError('sort requires at least one groupBy.');\n }\n const fields = sort.map(entry => entry.field);\n if (new Set(fields).size !== fields.length) {\n throw new TypeError('sort fields must be unique.');\n }\n if (!fields.every(field => aliases.includes(field))) {\n throw new TypeError('sort fields must reference aggregation aliases.');\n }\n requireAtMost(\n 'effective sort',\n 'fields',\n effectiveSort({ groupBy: [...groupBy], sort: [...sort] }),\n AGGREGATION_LIMITS.MAX_SORT_FIELDS,\n );\n}\n\n/**\n * Admits a whole aggregation query against the rules Wow enforces on arrival;\n * {@link aggregation.query} is its public face.\n */\nexport function admitAggregationQuery<\n ROOT_FIELDS extends string = string,\n AGGREGATION_FIELDS extends string = ROOT_FIELDS,\n>(\n query: AggregationQuery<ROOT_FIELDS, AGGREGATION_FIELDS>,\n): AggregationQuery<ROOT_FIELDS, AGGREGATION_FIELDS> {\n const elements = query.elements ?? [];\n const groupBy = query.groupBy ?? [];\n const metrics = query.metrics;\n const sort = query.sort ?? [];\n\n requireAtMost('elements', 'paths', elements, AGGREGATION_LIMITS.MAX_ELEMENTS);\n requireAtMost(\n 'groupBy',\n 'dimensions',\n groupBy,\n AGGREGATION_LIMITS.MAX_GROUPS,\n );\n if (!Array.isArray(metrics) || metrics.length === 0) {\n throw new TypeError('metrics must not be empty.');\n }\n requireAtMost('metrics', 'entries', metrics, AGGREGATION_LIMITS.MAX_METRICS);\n if (query.limit !== undefined) {\n if (\n !Number.isInteger(query.limit) ||\n query.limit < 1 ||\n query.limit > AGGREGATION_LIMITS.MAX_LIMIT\n ) {\n throw new TypeError(\n `limit must be between 1 and ${AGGREGATION_LIMITS.MAX_LIMIT}.`,\n );\n }\n }\n\n validateExpressions(metrics, groupBy);\n validateDerivedMetrics(metrics);\n validateHaving(query.having, groupBy, metrics);\n metrics.forEach(metric => {\n if ('filter' in metric && metric.filter)\n validateMetricFilter(metric.filter);\n });\n\n // A dense DATE_HISTOGRAM fills in the buckets its range implies, and a\n // dense DATE_PART every key of its part's domain, rather than only the ones\n // with rows; a second dimension would multiply that filling out across\n // every one of its own keys.\n groupBy.forEach(group => {\n if (\n (group.type === AggregationGroupType.DATE_HISTOGRAM ||\n group.type === AggregationGroupType.DATE_PART) &&\n group.dense === true &&\n groupBy.length !== 1\n ) {\n throw new TypeError(\n `dense requires ${group.type} to be the only groupBy.`,\n );\n }\n });\n\n const aliases = [\n ...groupBy.map(group => group.alias),\n ...metrics.map(metric => metric.alias),\n ];\n if (new Set(aliases).size !== aliases.length) {\n throw new TypeError('aggregation aliases must be unique.');\n }\n validateSort(sort, groupBy, aliases);\n\n return {\n ...query,\n metrics: [...metrics] as typeof query.metrics,\n };\n}\n"],"mappings":";;;;;AAkCA,SAASA,EACP,GACA,GACA,GACA,GACM;CACN,IAAIC,EAAM,SAASC,GACjB,MAAU,UAAU,GAAGC,EAAK,wBAAwBD,EAAI,GAAGE,EAAK,EAAE;AAEtE;AAWA,SAASC,EAAqB,GAAgC;CAC5D,QAAQC,EAAO,IAAf;EACE,KAAKC,EAAe,QAClB,MAAU,UACR,2DACF;EACF,KAAKA,EAAe,eAClB,MAAU,UACR,4DACF;EACF,KAAKA,EAAe;EACpB,KAAKA,EAAe;EACpB,KAAKA,EAAe,KAClB,EAAO,SAAS,QAAQF,CAAoB;CAEhD;AACF;AAMA,SAASG,EACP,GACA,GACM;CAUN,AATAC,EACEC,EAAQ,SAAQ,MACdC,EAAO,SAASC,EAAsB,WACtCD,EAAO,SAASC,EAAsB,kBACtCD,EAAO,SAASC,EAAsB,aAClC,CAACD,EAAO,UAAU,IAClB,CAAC,CACP,CACF,GACAE,EAAQ,SAAQ,MAAS;EACvB,IACEC,EAAM,SAASC,EAAqB,SACpCD,EAAM,SAASC,EAAqB,WAGtC;OAAKD,EAAM,UAAU,KAAA,MAAgBA,EAAM,eAAe,KAAA,IACxD,MAAU,UACR,GAAGA,EAAM,KAAK,qDAChB;GAGF,IADIA,EAAM,cAAYL,EAA4B,CAACK,EAAM,UAAU,CAAC,GAElEA,EAAM,SAASC,EAAqB,SACpCD,EAAM,eAAe,KAAA,KACrBA,EAAM,YAEN,MAAU,UAAU,0CAA0C;EAR9D;CAUJ,CAAC;AACH;AAGA,IAAME,oBAAmC,IAAI,IAAI;CAC/CJ,EAAsB;CACtBA,EAAsB;CACtBA,EAAsB;AACxB,CAAC;AAWD,SAASK,EAAuB,GAA6C;CAE3E,IAAMC,oBAAW,IAAI,IAAgC,GACjDC,IAAQ;CACZ,EAAQ,SAAQ,MAAU;EAIxB,AAHIR,EAAO,SAASC,EAAsB,YACxC,IAAQQ,EAA0BT,GAAQO,GAAUC,CAAK,IAE3DD,EAAS,IACPP,EAAO,OACPK,EAAY,IAAIL,EAAO,IAAI,IAAIA,EAAO,OAAO,KAAA,CAC/C;CACF,CAAC;AACH;AAEA,SAASS,EACP,GACA,GACA,GACQ;CACR,IAAMC,IAA8D,CAClE;EAAE,YAAYV,EAAO;EAAY,OAAO;CAAE,CAC5C,GACIQ,IAAQG;CACZ,OAAOD,EAAQ,SAAS,IAAG;EACzB,IAAM,EAAE,eAAY,aAAUA,EAAQ,IAAI;EAC1C,IAAIE,IAAQC,EAAmB,sBAC7B,MAAU,UACR,4CAA4CA,EAAmB,qBAAqB,EACtF;EAGF,IADA,KACIL,IAAQK,EAAmB,sBAC7B,MAAU,UACR,4CAA4CA,EAAmB,qBAAqB,QACtF;EAEF,QAAQC,EAAW,MAAnB;GACE,KAAKC,EAAsB,YAAY;IACrC,IAAMC,IAAYF,EAAW;IAC7B,IAAI,CAACP,EAAS,IAAIS,CAAS,GACzB,MAAU,UACR,mBAAmBhB,EAAO,MAAM,yDAAyDgB,EAAU,GACrG;IAEF,IAAMC,IAAaV,EAAS,IAAIS,CAAS;IACzC,IAAIC,MAAe,KAAA,GACjB,MAAU,UACR,mBAAmBjB,EAAO,MAAM,qBAAqBiB,EAAW,WAAWD,EAAU,GACvF;IAEF;GACF;GACA,KAAKD,EAAsB;IACzB,IAAI,CAAC,OAAO,SAASD,EAAW,KAAK,GACnC,MAAU,UAAU,kCAAkC;IAExD;GACF,KAAKC,EAAsB;IAEzB,AADAL,EAAQ,KAAK;KAAE,YAAYI,EAAW;KAAM,OAAOF,IAAQ;IAAE,CAAC,GAC9DF,EAAQ,KAAK;KAAE,YAAYI,EAAW;KAAO,OAAOF,IAAQ;IAAE,CAAC;IAC/D;GACF,SACE,MAAU,UACR,mCAAmC,OAAQE,EAAiC,IAAI,EAAE,EACpF;EACJ;CACF;CACA,OAAON;AACT;AAEA,SAASU,EACP,GACA,GACA,GACA,GACM;CACN,IAAI,CAACC,EAAc,IAAInB,CAAM,GAC3B,MAAU,UACR,qBAAqBA,EAAO,0CAC9B;CAEF,IAAIoB,EAAW,IAAIpB,CAAM,GACvB,MAAU,UACR,qBAAqBA,EAAO,+BAC9B;CAEF,IAAIqB,EAAY,IAAIrB,CAAM,GACxB,MAAU,UACR,qBAAqBA,EAAO,yCAC9B;AAEJ;AAMA,SAASsB,EACP,GACA,GACA,GACM;CACN,IAAIC,MAAW,KAAA,GAAW;CAC1B,IAAIrB,EAAQ,WAAW,GACrB,MAAU,UAAU,uCAAuC;CAE7D,IAAMiB,IAAgB,IAAI,IAAIpB,EAAQ,KAAI,MAAUC,EAAO,KAAK,CAAC,GAC3DoB,IAAa,IAAI,IACrBrB,EACG,QAAO,MAAUC,EAAO,SAASC,EAAsB,GAAG,CAAC,CAC3D,KAAI,MAAUD,EAAO,KAAK,CAC/B,GACMqB,IAAc,IAAI,IACtBtB,EACG,QACC,MACEC,EAAO,SAASC,EAAsB,SACtCD,EAAO,SAASC,EAAsB,IAC1C,CAAC,CACA,KAAI,MAAUD,EAAO,KAAK,CAC/B,GAEMU,IAA6D,CACjE;EAAE,YAAYa;EAAQ,OAAO;CAAE,CACjC;CACA,OAAOb,EAAQ,SAAS,IAAG;EACzB,IAAM,EAAE,eAAY,aAAUA,EAAQ,IAAI;EAC1C,IAAIE,IAAQC,EAAmB,sBAC7B,MAAU,UACR,2CAA2CA,EAAmB,qBAAqB,EACrF;EAEF,QAAQC,EAAW,MAAnB;GACE,KAAKU,EAAqB;IAOxB,IANAN,EACEJ,EAAW,QACXK,GACAC,GACAC,CACF,GACI,CAAC,OAAO,SAASP,EAAW,KAAK,GACnC,MAAU,UACR,qBAAqBA,EAAW,OAAO,wBACzC;IAEF;GACF,KAAKU,EAAqB;IAOxB,IANAN,EACEJ,EAAW,QACXK,GACAC,GACAC,CACF,GAEE,CAAC,OAAO,SAASP,EAAW,KAAK,KACjC,CAAC,OAAO,SAASA,EAAW,KAAK,GAEjC,MAAU,UACR,mBAAmBA,EAAW,OAAO,yBACvC;IAEF,IAAIA,EAAW,QAAQA,EAAW,OAChC,MAAU,UACR,mBAAmBA,EAAW,OAAO,2CACvC;IAEF;GACF,KAAKU,EAAqB;IAOxB,IANAN,EACEJ,EAAW,QACXK,GACAC,GACAC,CACF,GACIP,EAAW,OAAO,WAAW,GAC/B,MAAU,UACR,cAAcA,EAAW,OAAO,4BAClC;IAEF,IAAI,CAACA,EAAW,OAAO,MAAM,OAAO,QAAQ,GAC1C,MAAU,UACR,cAAcA,EAAW,OAAO,yBAClC;IAEF;GACF,KAAKU,EAAqB;IACxB,EACEV,EAAW,QACXK,GACAC,GACAC,CACF;IACA;GACF,KAAKG,EAAqB;GAC1B,KAAKA,EAAqB;IACxB,IAAIV,EAAW,SAAS,WAAW,GACjC,MAAU,UACR,UAAUA,EAAW,KAAK,6BAC5B;IAEF,EAAW,SAAS,SAAQ,MAC1BJ,EAAQ,KAAK;KAAE,YAAYe;KAAS,OAAOb,IAAQ;IAAE,CAAC,CACxD;IACA;GACF,SACE,MAAU,UACR,kCAAkC,OAAQE,EAAiC,IAAI,EAAE,EACnF;EACJ;CACF;AACF;AAEA,SAASY,EACP,GACA,GACA,GACM;CAEN,IADArC,EAAc,QAAQ,UAAUsC,GAAMd,EAAmB,eAAe,GACpEX,EAAQ,WAAW,KAAKyB,EAAK,SAAS,GACxC,MAAU,UAAU,qCAAqC;CAE3D,IAAMC,IAASD,EAAK,KAAI,MAASE,EAAM,KAAK;CAC5C,IAAI,IAAI,IAAID,CAAM,CAAC,CAAC,SAASA,EAAO,QAClC,MAAU,UAAU,6BAA6B;CAEnD,IAAI,CAACA,EAAO,OAAM,MAASE,EAAQ,SAASC,CAAK,CAAC,GAChD,MAAU,UAAU,iDAAiD;CAEvE,EACE,kBACA,UACAC,EAAc;EAAE,SAAS,CAAC,GAAG9B,CAAO;EAAG,MAAM,CAAC,GAAGyB,CAAI;CAAE,CAAC,GACxDd,EAAmB,eACrB;AACF;AAMA,SAAgBoB,EAId,GACmD;CACnD,IAAMC,IAAWC,EAAM,YAAY,CAAC,GAC9BjC,IAAUiC,EAAM,WAAW,CAAC,GAC5BpC,IAAUoC,EAAM,SAChBR,IAAOQ,EAAM,QAAQ,CAAC;CAS5B,IAPA9C,EAAc,YAAY,SAAS6C,GAAUrB,EAAmB,YAAY,GAC5ExB,EACE,WACA,cACAa,GACAW,EAAmB,UACrB,GACI,CAAC,MAAM,QAAQd,CAAO,KAAKA,EAAQ,WAAW,GAChD,MAAU,UAAU,4BAA4B;CAGlD,IADAV,EAAc,WAAW,WAAWU,GAASc,EAAmB,WAAW,GACvEsB,EAAM,UAAU,KAAA,MAEhB,CAAC,OAAO,UAAUA,EAAM,KAAK,KAC7BA,EAAM,QAAQ,KACdA,EAAM,QAAQtB,EAAmB,YAEjC,MAAU,UACR,+BAA+BA,EAAmB,UAAU,EAC9D;CAgBJ,AAZAhB,EAAoBE,GAASG,CAAO,GACpCI,EAAuBP,CAAO,GAC9BuB,EAAea,EAAM,QAAQjC,GAASH,CAAO,GAC7CA,EAAQ,SAAQ,MAAU;EACxB,AAAI,YAAYC,KAAUA,EAAO,UAC/BN,EAAqBM,EAAO,MAAM;CACtC,CAAC,GAMDE,EAAQ,SAAQ,MAAS;EACvB,KACGC,EAAM,SAASC,EAAqB,kBACnCD,EAAM,SAASC,EAAqB,cACtCD,EAAM,UAAU,MAChBD,EAAQ,WAAW,GAEnB,MAAU,UACR,kBAAkBC,EAAM,KAAK,yBAC/B;CAEJ,CAAC;CAED,IAAM2B,IAAU,CACd,GAAG5B,EAAQ,KAAI,MAASC,EAAM,KAAK,GACnC,GAAGJ,EAAQ,KAAI,MAAUC,EAAO,KAAK,CACvC;CACA,IAAI,IAAI,IAAI8B,CAAO,CAAC,CAAC,SAASA,EAAQ,QACpC,MAAU,UAAU,qCAAqC;CAI3D,OAFAJ,EAAaC,GAAMzB,GAAS4B,CAAO,GAE5B;EACL,GAAGK;EACH,SAAS,CAAC,GAAGpC,CAAO;CACtB;AACF"}
1
+ {"version":3,"file":"admit.es.js","names":["requireAtMost","items","max","name","noun","validateMetricFilter","filter","FilterOperator","validateExpressions","requireValidExpressionTrees","metrics","metric","AggregationMetricType","groupBy","group","AggregationGroupType","AggregationGroupScope","NON_NUMERIC","validateDerivedMetrics","declared","derived","counter","validateDerivedExpression","pending","depth","AGGREGATION_LIMITS","expression","DerivedExpressionType","reference","nonNumeric","requireWindowMetric","target","window","alias","requireValidHavingMetric","metricAliases","anyAliases","edgeAliases","validateHaving","having","HavingExpressionType","operand","validateSort","sort","fields","entry","aliases","field","effectiveSort","requireRootGroupsFirst","root","query","order","firstElement","admitAggregationQuery","elements"],"sources":["../../../src/dsl/aggregation/admit.ts"],"sourcesContent":["/*\n * Copyright [2021-present] [ahoo wang <ahoowang@qq.com> (https://github.com/Ahoo-Wang)].\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n * http://www.apache.org/licenses/LICENSE-2.0\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { FilterOperator, type FilterExpression } from '../filter/index.js';\nimport type { FieldSort } from '../sort.js';\nimport { requireValidExpressionTrees } from './expressionTrees.js';\nimport { effectiveSort } from './sort.js';\nimport {\n AGGREGATION_LIMITS,\n AggregationGroupScope,\n AggregationGroupType,\n AggregationMetricType,\n DerivedExpressionType,\n HavingExpressionType,\n type AggregationGroup,\n type AggregationMetric,\n type AggregationQuery,\n type DerivedAggregationMetric,\n type DerivedExpression,\n type DerivedWindow,\n type HavingExpression,\n} from './types.js';\n\n// Internal: the rules `aggregation.query()` checks across the parts of a\n// query. index.ts does not re-export this file.\n\nfunction requireAtMost(\n name: string,\n noun: string,\n items: readonly unknown[],\n max: number,\n): void {\n if (items.length > max) {\n throw new TypeError(`${name} must contain at most ${max} ${noun}.`);\n }\n}\n\n/**\n * Refuses the filters a metric cannot carry, whatever the aggregate holds.\n *\n * A metric filter is a whole-value predicate on one record — MongoDB turns it\n * into a `$cond` guard and Elasticsearch into a filter aggregation — and\n * element matching and full text have no whole-value reading. Both backends\n * refuse them before touching a schema, so the shape alone settles it. What a\n * schema would add, refusing an array-valued field, stays on the server.\n */\nfunction validateMetricFilter(filter: FilterExpression): void {\n switch (filter.op) {\n case FilterOperator.SEARCH:\n throw new TypeError(\n 'Aggregation metric filters do not support search filters.',\n );\n case FilterOperator.ELEMENT_MATCH:\n throw new TypeError(\n 'Aggregation metric filters do not support [ELEMENT_MATCH].',\n );\n case FilterOperator.AND:\n case FilterOperator.OR:\n case FilterOperator.NOR:\n filter.operands.forEach(validateMetricFilter);\n break;\n }\n}\n\n/**\n * Walks the arithmetic of every metric that carries an expression, as one\n * budget, and of each expression group on its own, as Wow does.\n */\nfunction validateExpressions(\n metrics: readonly AggregationMetric[],\n groupBy: readonly AggregationGroup[],\n): void {\n requireValidExpressionTrees(\n metrics.flatMap(metric =>\n metric.type === AggregationMetricType.NUMERIC ||\n metric.type === AggregationMetricType.DISTINCT_COUNT ||\n metric.type === AggregationMetricType.PERCENTILE\n ? [metric.expression]\n : [],\n ),\n );\n groupBy.forEach(group => {\n if (\n group.type !== AggregationGroupType.TERMS &&\n group.type !== AggregationGroupType.HISTOGRAM\n )\n return;\n if ((group.field === undefined) === (group.expression === undefined)) {\n throw new TypeError(\n `${group.type} group requires exactly one of field and expression.`,\n );\n }\n if (group.expression) requireValidExpressionTrees([group.expression]);\n if (\n group.type === AggregationGroupType.TERMS &&\n group.missingKey !== undefined &&\n group.expression\n ) {\n throw new TypeError('terms missingKey requires a field input.');\n }\n if (group.scope === AggregationGroupScope.ROOT && group.expression) {\n throw new TypeError(\n `${group.type} with a ROOT scope requires a field input.`,\n );\n }\n });\n}\n\n/** The metric types whose value is not a number: derived and having refuse them. */\nconst NON_NUMERIC: ReadonlySet<string> = new Set([\n AggregationMetricType.ANY,\n AggregationMetricType.FIRST,\n AggregationMetricType.LAST,\n]);\n\n/**\n * Admits the derived metrics against what was declared before each of them.\n *\n * Derived arithmetic runs after the aggregation, over values the query has\n * already produced, so a reference may only name a metric declared earlier —\n * that is what makes the list evaluable in one pass — and never an `ANY`,\n * `FIRST` or `LAST` metric, whose value is a field's value rather than a\n * number.\n */\nfunction validateDerivedMetrics(metrics: readonly AggregationMetric[]): void {\n // Each earlier alias, with its type when that is not a number.\n const declared = new Map<string, string | undefined>();\n const derived = new Set<string>();\n const counter = { nodes: 0, windows: 0 };\n metrics.forEach(metric => {\n if (metric.type === AggregationMetricType.DERIVED) {\n validateDerivedExpression(metric, declared, derived, counter);\n derived.add(metric.alias);\n }\n declared.set(\n metric.alias,\n NON_NUMERIC.has(metric.type) ? metric.type : undefined,\n );\n });\n}\n\nfunction validateDerivedExpression(\n metric: DerivedAggregationMetric,\n declared: ReadonlyMap<string, string | undefined>,\n derived: ReadonlySet<string>,\n counter: { nodes: number; windows: number },\n): void {\n const pending: { expression: DerivedExpression; depth: number }[] = [\n { expression: metric.expression, depth: 1 },\n ];\n while (pending.length > 0) {\n const { expression, depth } = pending.pop()!;\n if (depth > AGGREGATION_LIMITS.MAX_EXPRESSION_DEPTH) {\n throw new TypeError(\n `derived expression depth must be at most ${AGGREGATION_LIMITS.MAX_EXPRESSION_DEPTH}.`,\n );\n }\n counter.nodes++;\n if (counter.nodes > AGGREGATION_LIMITS.MAX_EXPRESSION_NODES) {\n throw new TypeError(\n `derived expressions must contain at most ${AGGREGATION_LIMITS.MAX_EXPRESSION_NODES} nodes.`,\n );\n }\n switch (expression.type) {\n case DerivedExpressionType.METRIC_REF: {\n const reference = expression.metric;\n if (!declared.has(reference)) {\n throw new TypeError(\n `derived metric [${metric.alias}] must reference a metric declared before it, but was [${reference}].`,\n );\n }\n const nonNumeric = declared.get(reference);\n if (nonNumeric !== undefined) {\n throw new TypeError(\n `derived metric [${metric.alias}] cannot reference ${nonNumeric} metric [${reference}].`,\n );\n }\n break;\n }\n case DerivedExpressionType.CONSTANT:\n if (!Number.isFinite(expression.value)) {\n throw new TypeError('derived constant must be finite.');\n }\n break;\n case DerivedExpressionType.BINARY:\n pending.push({ expression: expression.left, depth: depth + 1 });\n pending.push({ expression: expression.right, depth: depth + 1 });\n break;\n case DerivedExpressionType.TOTAL:\n case DerivedExpressionType.RUNNING:\n case DerivedExpressionType.PREVIOUS:\n case DerivedExpressionType.RANK:\n counter.windows++;\n if (counter.windows > AGGREGATION_LIMITS.MAX_WINDOWS) {\n throw new TypeError(\n `an aggregation must compute at most ${AGGREGATION_LIMITS.MAX_WINDOWS} windows.`,\n );\n }\n requireWindowMetric(metric.alias, expression, declared, derived);\n break;\n default:\n throw new TypeError(\n `Unsupported derived expression: ${String((expression as { type: unknown }).type)}.`,\n );\n }\n }\n}\n\n/**\n * A window reads a non-derived numeric metric declared before the derived\n * one; the rest of its rules (which metrics add up, which groups it names)\n * the server checks against the whole query.\n */\nfunction requireWindowMetric(\n alias: string,\n window: DerivedWindow,\n declared: ReadonlyMap<string, string | undefined>,\n derived: ReadonlySet<string>,\n): void {\n const target = window.metric;\n if (!declared.has(target)) {\n throw new TypeError(\n `${window.type} window of derived metric [${alias}] must read a metric declared before it, but was [${target}].`,\n );\n }\n if (declared.get(target) !== undefined || derived.has(target)) {\n throw new TypeError(\n `${window.type} window of derived metric [${alias}] must read a non-derived numeric metric, but was [${target}].`,\n );\n }\n}\n\nfunction requireValidHavingMetric(\n metric: string,\n metricAliases: ReadonlySet<string>,\n anyAliases: ReadonlySet<string>,\n edgeAliases: ReadonlySet<string>,\n): void {\n if (!metricAliases.has(metric)) {\n throw new TypeError(\n `having condition [${metric}] must reference a declared metric alias.`,\n );\n }\n if (anyAliases.has(metric)) {\n throw new TypeError(\n `having condition [${metric}] cannot reference ANY metric.`,\n );\n }\n if (edgeAliases.has(metric)) {\n throw new TypeError(\n `having condition [${metric}] cannot reference FIRST or LAST metric.`,\n );\n }\n}\n\n/**\n * `having` filters the grouped rows, so it needs rows to filter: a query with\n * no `groupBy` produces one row and has nothing to select from.\n */\nfunction validateHaving(\n having: HavingExpression | undefined,\n groupBy: readonly AggregationGroup[],\n metrics: readonly AggregationMetric[],\n): void {\n if (having === undefined) return;\n if (groupBy.length === 0) {\n throw new TypeError('having requires at least one groupBy.');\n }\n const metricAliases = new Set(metrics.map(metric => metric.alias));\n const anyAliases = new Set(\n metrics\n .filter(metric => metric.type === AggregationMetricType.ANY)\n .map(metric => metric.alias),\n );\n const edgeAliases = new Set(\n metrics\n .filter(\n metric =>\n metric.type === AggregationMetricType.FIRST ||\n metric.type === AggregationMetricType.LAST,\n )\n .map(metric => metric.alias),\n );\n\n const pending: { expression: HavingExpression; depth: number }[] = [\n { expression: having, depth: 1 },\n ];\n while (pending.length > 0) {\n const { expression, depth } = pending.pop()!;\n if (depth > AGGREGATION_LIMITS.MAX_EXPRESSION_DEPTH) {\n throw new TypeError(\n `having expression depth must be at most ${AGGREGATION_LIMITS.MAX_EXPRESSION_DEPTH}.`,\n );\n }\n switch (expression.type) {\n case HavingExpressionType.CONDITION:\n requireValidHavingMetric(\n expression.metric,\n metricAliases,\n anyAliases,\n edgeAliases,\n );\n if (!Number.isFinite(expression.value)) {\n throw new TypeError(\n `having condition [${expression.metric}] value must be finite.`,\n );\n }\n break;\n case HavingExpressionType.BETWEEN:\n requireValidHavingMetric(\n expression.metric,\n metricAliases,\n anyAliases,\n edgeAliases,\n );\n if (\n !Number.isFinite(expression.lower) ||\n !Number.isFinite(expression.upper)\n ) {\n throw new TypeError(\n `having between [${expression.metric}] bounds must be finite.`,\n );\n }\n if (expression.lower > expression.upper) {\n throw new TypeError(\n `having between [${expression.metric}] lower bound must not exceed upper bound.`,\n );\n }\n break;\n case HavingExpressionType.IN:\n requireValidHavingMetric(\n expression.metric,\n metricAliases,\n anyAliases,\n edgeAliases,\n );\n if (expression.values.length === 0) {\n throw new TypeError(\n `having in [${expression.metric}] values must not be empty.`,\n );\n }\n if (!expression.values.every(Number.isFinite)) {\n throw new TypeError(\n `having in [${expression.metric}] values must be finite.`,\n );\n }\n break;\n case HavingExpressionType.IS_NULL:\n requireValidHavingMetric(\n expression.metric,\n metricAliases,\n anyAliases,\n edgeAliases,\n );\n break;\n case HavingExpressionType.AND:\n case HavingExpressionType.OR:\n if (expression.operands.length === 0) {\n throw new TypeError(\n `having ${expression.type} operands must not be empty.`,\n );\n }\n expression.operands.forEach(operand =>\n pending.push({ expression: operand, depth: depth + 1 }),\n );\n break;\n default:\n throw new TypeError(\n `Unsupported having expression: ${String((expression as { type: unknown }).type)}.`,\n );\n }\n }\n}\n\nfunction validateSort(\n sort: readonly FieldSort[],\n groupBy: readonly AggregationGroup[],\n aliases: readonly string[],\n): void {\n requireAtMost('sort', 'fields', sort, AGGREGATION_LIMITS.MAX_SORT_FIELDS);\n if (groupBy.length === 0 && sort.length > 0) {\n throw new TypeError('sort requires at least one groupBy.');\n }\n const fields = sort.map(entry => entry.field);\n if (new Set(fields).size !== fields.length) {\n throw new TypeError('sort fields must be unique.');\n }\n if (!fields.every(field => aliases.includes(field))) {\n throw new TypeError('sort fields must reference aggregation aliases.');\n }\n requireAtMost(\n 'effective sort',\n 'fields',\n effectiveSort({ groupBy: [...groupBy], sort: [...sort] }),\n AGGREGATION_LIMITS.MAX_SORT_FIELDS,\n );\n}\n\n/**\n * With elements, the groups of a ROOT scope lead the effective sort: a storage\n * reads the root records' keys before the keys of their elements.\n */\nfunction requireRootGroupsFirst(\n query: Pick<AggregationQuery<string, string>, 'groupBy' | 'sort'>,\n): void {\n const root = new Map(\n (query.groupBy ?? []).map(group => [\n group.alias,\n group.scope === AggregationGroupScope.ROOT,\n ]),\n );\n const order = effectiveSort(query).flatMap(entry =>\n root.has(entry.field) ? [root.get(entry.field)] : [],\n );\n const firstElement = order.indexOf(false);\n if (firstElement >= 0 && order.slice(firstElement).includes(true)) {\n throw new TypeError(\n 'groups with a ROOT scope must sort before the element groups.',\n );\n }\n}\n\n/**\n * Admits a whole aggregation query against the rules Wow enforces on arrival;\n * {@link aggregation.query} is its public face.\n */\nexport function admitAggregationQuery<\n ROOT_FIELDS extends string = string,\n AGGREGATION_FIELDS extends string = ROOT_FIELDS,\n>(\n query: AggregationQuery<ROOT_FIELDS, AGGREGATION_FIELDS>,\n): AggregationQuery<ROOT_FIELDS, AGGREGATION_FIELDS> {\n const elements = query.elements ?? [];\n const groupBy = query.groupBy ?? [];\n const metrics = query.metrics;\n const sort = query.sort ?? [];\n\n requireAtMost('elements', 'paths', elements, AGGREGATION_LIMITS.MAX_ELEMENTS);\n requireAtMost(\n 'groupBy',\n 'dimensions',\n groupBy,\n AGGREGATION_LIMITS.MAX_GROUPS,\n );\n if (!Array.isArray(metrics) || metrics.length === 0) {\n throw new TypeError('metrics must not be empty.');\n }\n requireAtMost('metrics', 'entries', metrics, AGGREGATION_LIMITS.MAX_METRICS);\n if (query.limit !== undefined) {\n if (\n !Number.isInteger(query.limit) ||\n query.limit < 1 ||\n query.limit > AGGREGATION_LIMITS.MAX_LIMIT\n ) {\n throw new TypeError(\n `limit must be between 1 and ${AGGREGATION_LIMITS.MAX_LIMIT}.`,\n );\n }\n }\n\n validateExpressions(metrics, groupBy);\n validateDerivedMetrics(metrics);\n validateHaving(query.having, groupBy, metrics);\n metrics.forEach(metric => {\n if ('filter' in metric && metric.filter)\n validateMetricFilter(metric.filter);\n });\n\n // A dense DATE_HISTOGRAM fills in the buckets its range implies, and a\n // dense DATE_PART every key of its part's domain, rather than only the ones\n // with rows; a second dimension would multiply that filling out across\n // every one of its own keys.\n groupBy.forEach(group => {\n if (\n (group.type === AggregationGroupType.DATE_HISTOGRAM ||\n group.type === AggregationGroupType.DATE_PART) &&\n group.dense === true &&\n groupBy.length !== 1\n ) {\n throw new TypeError(\n `dense requires ${group.type} to be the only groupBy.`,\n );\n }\n });\n\n const aliases = [\n ...groupBy.map(group => group.alias),\n ...metrics.map(metric => metric.alias),\n ];\n if (new Set(aliases).size !== aliases.length) {\n throw new TypeError('aggregation aliases must be unique.');\n }\n validateSort(sort, groupBy, aliases);\n if (elements.length > 0) requireRootGroupsFirst(query);\n\n return {\n ...query,\n metrics: [...metrics] as typeof query.metrics,\n };\n}\n"],"mappings":";;;;;AAoCA,SAASA,EACP,GACA,GACA,GACA,GACM;CACN,IAAIC,EAAM,SAASC,GACjB,MAAU,UAAU,GAAGC,EAAK,wBAAwBD,EAAI,GAAGE,EAAK,EAAE;AAEtE;AAWA,SAASC,EAAqB,GAAgC;CAC5D,QAAQC,EAAO,IAAf;EACE,KAAKC,EAAe,QAClB,MAAU,UACR,2DACF;EACF,KAAKA,EAAe,eAClB,MAAU,UACR,4DACF;EACF,KAAKA,EAAe;EACpB,KAAKA,EAAe;EACpB,KAAKA,EAAe,KAClB,EAAO,SAAS,QAAQF,CAAoB;CAEhD;AACF;AAMA,SAASG,EACP,GACA,GACM;CAUN,AATAC,EACEC,EAAQ,SAAQ,MACdC,EAAO,SAASC,EAAsB,WACtCD,EAAO,SAASC,EAAsB,kBACtCD,EAAO,SAASC,EAAsB,aAClC,CAACD,EAAO,UAAU,IAClB,CAAC,CACP,CACF,GACAE,EAAQ,SAAQ,MAAS;EACvB,IACEC,EAAM,SAASC,EAAqB,SACpCD,EAAM,SAASC,EAAqB,WAGtC;OAAKD,EAAM,UAAU,KAAA,MAAgBA,EAAM,eAAe,KAAA,IACxD,MAAU,UACR,GAAGA,EAAM,KAAK,qDAChB;GAGF,IADIA,EAAM,cAAYL,EAA4B,CAACK,EAAM,UAAU,CAAC,GAElEA,EAAM,SAASC,EAAqB,SACpCD,EAAM,eAAe,KAAA,KACrBA,EAAM,YAEN,MAAU,UAAU,0CAA0C;GAEhE,IAAIA,EAAM,UAAUE,EAAsB,QAAQF,EAAM,YACtD,MAAU,UACR,GAAGA,EAAM,KAAK,2CAChB;EAbA;CAeJ,CAAC;AACH;AAGA,IAAMG,oBAAmC,IAAI,IAAI;CAC/CL,EAAsB;CACtBA,EAAsB;CACtBA,EAAsB;AACxB,CAAC;AAWD,SAASM,EAAuB,GAA6C;CAE3E,IAAMC,oBAAW,IAAI,IAAgC,GAC/CC,oBAAU,IAAI,IAAY,GAC1BC,IAAU;EAAE,OAAO;EAAG,SAAS;CAAE;CACvC,EAAQ,SAAQ,MAAU;EAKxB,AAJIV,EAAO,SAASC,EAAsB,YACxCU,EAA0BX,GAAQQ,GAAUC,GAASC,CAAO,GAC5DD,EAAQ,IAAIT,EAAO,KAAK,IAE1BQ,EAAS,IACPR,EAAO,OACPM,EAAY,IAAIN,EAAO,IAAI,IAAIA,EAAO,OAAO,KAAA,CAC/C;CACF,CAAC;AACH;AAEA,SAASW,EACP,GACA,GACA,GACA,GACM;CACN,IAAMC,IAA8D,CAClE;EAAE,YAAYZ,EAAO;EAAY,OAAO;CAAE,CAC5C;CACA,OAAOY,EAAQ,SAAS,IAAG;EACzB,IAAM,EAAE,eAAY,aAAUA,EAAQ,IAAI;EAC1C,IAAIC,IAAQC,EAAmB,sBAC7B,MAAU,UACR,4CAA4CA,EAAmB,qBAAqB,EACtF;EAGF,IADA,EAAQ,SACJJ,EAAQ,QAAQI,EAAmB,sBACrC,MAAU,UACR,4CAA4CA,EAAmB,qBAAqB,QACtF;EAEF,QAAQC,EAAW,MAAnB;GACE,KAAKC,EAAsB,YAAY;IACrC,IAAMC,IAAYF,EAAW;IAC7B,IAAI,CAACP,EAAS,IAAIS,CAAS,GACzB,MAAU,UACR,mBAAmBjB,EAAO,MAAM,yDAAyDiB,EAAU,GACrG;IAEF,IAAMC,IAAaV,EAAS,IAAIS,CAAS;IACzC,IAAIC,MAAe,KAAA,GACjB,MAAU,UACR,mBAAmBlB,EAAO,MAAM,qBAAqBkB,EAAW,WAAWD,EAAU,GACvF;IAEF;GACF;GACA,KAAKD,EAAsB;IACzB,IAAI,CAAC,OAAO,SAASD,EAAW,KAAK,GACnC,MAAU,UAAU,kCAAkC;IAExD;GACF,KAAKC,EAAsB;IAEzB,AADAJ,EAAQ,KAAK;KAAE,YAAYG,EAAW;KAAM,OAAOF,IAAQ;IAAE,CAAC,GAC9DD,EAAQ,KAAK;KAAE,YAAYG,EAAW;KAAO,OAAOF,IAAQ;IAAE,CAAC;IAC/D;GACF,KAAKG,EAAsB;GAC3B,KAAKA,EAAsB;GAC3B,KAAKA,EAAsB;GAC3B,KAAKA,EAAsB;IAEzB,IADA,EAAQ,WACJN,EAAQ,UAAUI,EAAmB,aACvC,MAAU,UACR,uCAAuCA,EAAmB,YAAY,UACxE;IAEF,EAAoBd,EAAO,OAAOe,GAAYP,GAAUC,CAAO;IAC/D;GACF,SACE,MAAU,UACR,mCAAmC,OAAQM,EAAiC,IAAI,EAAE,EACpF;EACJ;CACF;AACF;AAOA,SAASI,EACP,GACA,GACA,GACA,GACM;CACN,IAAMC,IAASC,EAAO;CACtB,IAAI,CAACb,EAAS,IAAIY,CAAM,GACtB,MAAU,UACR,GAAGC,EAAO,KAAK,6BAA6BC,EAAM,oDAAoDF,EAAO,GAC/G;CAEF,IAAIZ,EAAS,IAAIY,CAAM,MAAM,KAAA,KAAaX,EAAQ,IAAIW,CAAM,GAC1D,MAAU,UACR,GAAGC,EAAO,KAAK,6BAA6BC,EAAM,qDAAqDF,EAAO,GAChH;AAEJ;AAEA,SAASG,EACP,GACA,GACA,GACA,GACM;CACN,IAAI,CAACC,EAAc,IAAIxB,CAAM,GAC3B,MAAU,UACR,qBAAqBA,EAAO,0CAC9B;CAEF,IAAIyB,EAAW,IAAIzB,CAAM,GACvB,MAAU,UACR,qBAAqBA,EAAO,+BAC9B;CAEF,IAAI0B,EAAY,IAAI1B,CAAM,GACxB,MAAU,UACR,qBAAqBA,EAAO,yCAC9B;AAEJ;AAMA,SAAS2B,EACP,GACA,GACA,GACM;CACN,IAAIC,MAAW,KAAA,GAAW;CAC1B,IAAI1B,EAAQ,WAAW,GACrB,MAAU,UAAU,uCAAuC;CAE7D,IAAMsB,IAAgB,IAAI,IAAIzB,EAAQ,KAAI,MAAUC,EAAO,KAAK,CAAC,GAC3DyB,IAAa,IAAI,IACrB1B,EACG,QAAO,MAAUC,EAAO,SAASC,EAAsB,GAAG,CAAC,CAC3D,KAAI,MAAUD,EAAO,KAAK,CAC/B,GACM0B,IAAc,IAAI,IACtB3B,EACG,QACC,MACEC,EAAO,SAASC,EAAsB,SACtCD,EAAO,SAASC,EAAsB,IAC1C,CAAC,CACA,KAAI,MAAUD,EAAO,KAAK,CAC/B,GAEMY,IAA6D,CACjE;EAAE,YAAYgB;EAAQ,OAAO;CAAE,CACjC;CACA,OAAOhB,EAAQ,SAAS,IAAG;EACzB,IAAM,EAAE,eAAY,aAAUA,EAAQ,IAAI;EAC1C,IAAIC,IAAQC,EAAmB,sBAC7B,MAAU,UACR,2CAA2CA,EAAmB,qBAAqB,EACrF;EAEF,QAAQC,EAAW,MAAnB;GACE,KAAKc,EAAqB;IAOxB,IANAN,EACER,EAAW,QACXS,GACAC,GACAC,CACF,GACI,CAAC,OAAO,SAASX,EAAW,KAAK,GACnC,MAAU,UACR,qBAAqBA,EAAW,OAAO,wBACzC;IAEF;GACF,KAAKc,EAAqB;IAOxB,IANAN,EACER,EAAW,QACXS,GACAC,GACAC,CACF,GAEE,CAAC,OAAO,SAASX,EAAW,KAAK,KACjC,CAAC,OAAO,SAASA,EAAW,KAAK,GAEjC,MAAU,UACR,mBAAmBA,EAAW,OAAO,yBACvC;IAEF,IAAIA,EAAW,QAAQA,EAAW,OAChC,MAAU,UACR,mBAAmBA,EAAW,OAAO,2CACvC;IAEF;GACF,KAAKc,EAAqB;IAOxB,IANAN,EACER,EAAW,QACXS,GACAC,GACAC,CACF,GACIX,EAAW,OAAO,WAAW,GAC/B,MAAU,UACR,cAAcA,EAAW,OAAO,4BAClC;IAEF,IAAI,CAACA,EAAW,OAAO,MAAM,OAAO,QAAQ,GAC1C,MAAU,UACR,cAAcA,EAAW,OAAO,yBAClC;IAEF;GACF,KAAKc,EAAqB;IACxB,EACEd,EAAW,QACXS,GACAC,GACAC,CACF;IACA;GACF,KAAKG,EAAqB;GAC1B,KAAKA,EAAqB;IACxB,IAAId,EAAW,SAAS,WAAW,GACjC,MAAU,UACR,UAAUA,EAAW,KAAK,6BAC5B;IAEF,EAAW,SAAS,SAAQ,MAC1BH,EAAQ,KAAK;KAAE,YAAYkB;KAAS,OAAOjB,IAAQ;IAAE,CAAC,CACxD;IACA;GACF,SACE,MAAU,UACR,kCAAkC,OAAQE,EAAiC,IAAI,EAAE,EACnF;EACJ;CACF;AACF;AAEA,SAASgB,EACP,GACA,GACA,GACM;CAEN,IADA1C,EAAc,QAAQ,UAAU2C,GAAMlB,EAAmB,eAAe,GACpEZ,EAAQ,WAAW,KAAK8B,EAAK,SAAS,GACxC,MAAU,UAAU,qCAAqC;CAE3D,IAAMC,IAASD,EAAK,KAAI,MAASE,EAAM,KAAK;CAC5C,IAAI,IAAI,IAAID,CAAM,CAAC,CAAC,SAASA,EAAO,QAClC,MAAU,UAAU,6BAA6B;CAEnD,IAAI,CAACA,EAAO,OAAM,MAASE,EAAQ,SAASC,CAAK,CAAC,GAChD,MAAU,UAAU,iDAAiD;CAEvE,EACE,kBACA,UACAC,EAAc;EAAE,SAAS,CAAC,GAAGnC,CAAO;EAAG,MAAM,CAAC,GAAG8B,CAAI;CAAE,CAAC,GACxDlB,EAAmB,eACrB;AACF;AAMA,SAASwB,EACP,GACM;CACN,IAAMC,IAAO,IAAI,KACdC,EAAM,WAAW,CAAC,EAAA,CAAG,KAAI,MAAS,CACjCrC,EAAM,OACNA,EAAM,UAAUE,EAAsB,IACxC,CAAC,CACH,GACMoC,IAAQJ,EAAcG,CAAK,CAAC,CAAC,SAAQ,MACzCD,EAAK,IAAIL,EAAM,KAAK,IAAI,CAACK,EAAK,IAAIL,EAAM,KAAK,CAAC,IAAI,CAAC,CACrD,GACMQ,IAAeD,EAAM,QAAQ,EAAK;CACxC,IAAIC,KAAgB,KAAKD,EAAM,MAAMC,CAAY,CAAC,CAAC,SAAS,EAAI,GAC9D,MAAU,UACR,+DACF;AAEJ;AAMA,SAAgBC,EAId,GACmD;CACnD,IAAMC,IAAWJ,EAAM,YAAY,CAAC,GAC9BtC,IAAUsC,EAAM,WAAW,CAAC,GAC5BzC,IAAUyC,EAAM,SAChBR,IAAOQ,EAAM,QAAQ,CAAC;CAS5B,IAPAnD,EAAc,YAAY,SAASuD,GAAU9B,EAAmB,YAAY,GAC5EzB,EACE,WACA,cACAa,GACAY,EAAmB,UACrB,GACI,CAAC,MAAM,QAAQf,CAAO,KAAKA,EAAQ,WAAW,GAChD,MAAU,UAAU,4BAA4B;CAGlD,IADAV,EAAc,WAAW,WAAWU,GAASe,EAAmB,WAAW,GACvE0B,EAAM,UAAU,KAAA,MAEhB,CAAC,OAAO,UAAUA,EAAM,KAAK,KAC7BA,EAAM,QAAQ,KACdA,EAAM,QAAQ1B,EAAmB,YAEjC,MAAU,UACR,+BAA+BA,EAAmB,UAAU,EAC9D;CAgBJ,AAZAjB,EAAoBE,GAASG,CAAO,GACpCK,EAAuBR,CAAO,GAC9B4B,EAAea,EAAM,QAAQtC,GAASH,CAAO,GAC7CA,EAAQ,SAAQ,MAAU;EACxB,AAAI,YAAYC,KAAUA,EAAO,UAC/BN,EAAqBM,EAAO,MAAM;CACtC,CAAC,GAMDE,EAAQ,SAAQ,MAAS;EACvB,KACGC,EAAM,SAASC,EAAqB,kBACnCD,EAAM,SAASC,EAAqB,cACtCD,EAAM,UAAU,MAChBD,EAAQ,WAAW,GAEnB,MAAU,UACR,kBAAkBC,EAAM,KAAK,yBAC/B;CAEJ,CAAC;CAED,IAAMgC,IAAU,CACd,GAAGjC,EAAQ,KAAI,MAASC,EAAM,KAAK,GACnC,GAAGJ,EAAQ,KAAI,MAAUC,EAAO,KAAK,CACvC;CACA,IAAI,IAAI,IAAImC,CAAO,CAAC,CAAC,SAASA,EAAQ,QACpC,MAAU,UAAU,qCAAqC;CAK3D,OAHAJ,EAAaC,GAAM9B,GAASiC,CAAO,GAC/BS,EAAS,SAAS,KAAGN,EAAuBE,CAAK,GAE9C;EACL,GAAGA;EACH,SAAS,CAAC,GAAGzC,CAAO;CACtB;AACF"}
@@ -1,2 +1,2 @@
1
- const e=require("./types.cjs"),t=require("./expressionTrees.cjs"),n=require("../field.cjs"),r=require("../filter/scope.cjs"),i=require("./admit.cjs"),a=require("./derived.cjs"),o=require("./having.cjs");function s(e){return n.queryField(e)}function c(e){if(s(e),e.includes(`.`))throw TypeError(`aggregation alias must contain one segment.`);if(e.startsWith(`__wow`))throw TypeError(`aggregation alias must not use the reserved __wow prefix.`);return e}function l(t,n,r){return{type:e.AggregationExpressionType.BINARY,operator:t,left:n,right:r}}function u(t,n,r,{filter:i}={}){return{type:e.AggregationMetricType.NUMERIC,...i===void 0?{}:{filter:i},function:t,expression:n,alias:c(r)}}function d(e,t,n,{orderBy:r,filter:i}){return{type:e,field:s(t),alias:c(n),...r===void 0?{}:{orderBy:s(r)},...i===void 0?{}:{filter:i}}}function f(e,n){if(typeof e==`string`)return{field:s(e)};if(typeof e!=`object`||!e)throw TypeError(`${n} group requires exactly one of field and expression.`);return t.requireValidExpressionTrees([e]),{expression:e}}var p={element(e,t){let n=s(e);return t===void 0?{path:n}:(r.requireElementScopedFilter(t,`Aggregation element filter`,!1),{path:n,filter:t})},field(t){return{type:e.AggregationExpressionType.FIELD,field:s(t)}},constant(t){if(!Number.isFinite(t))throw TypeError(`aggregation constant must be finite.`);return{type:e.AggregationExpressionType.CONSTANT,value:t}},dateDiff(t,n,r){if(!Object.values(e.DateDiffUnit).includes(r))throw TypeError(`date diff unit is invalid.`);return{type:e.AggregationExpressionType.DATE_DIFF,from:s(t),to:s(n),unit:r}},add:(t,n)=>l(e.AggregationExpressionOperator.ADD,t,n),subtract:(t,n)=>l(e.AggregationExpressionOperator.SUBTRACT,t,n),multiply:(t,n)=>l(e.AggregationExpressionOperator.MULTIPLY,t,n),divide:(t,n)=>l(e.AggregationExpressionOperator.DIVIDE,t,n),terms(t,n,{missingKey:r}={}){if(r!==void 0&&(typeof r!=`string`||!r.trim()))throw TypeError(`terms missingKey must not be blank.`);let i=f(t,`TERMS`);if(r!==void 0&&i.expression)throw TypeError(`terms missingKey requires a field input.`);return{type:e.AggregationGroupType.TERMS,...r===void 0?{}:{missingKey:r},...i,alias:c(n)}},histogram(t,n,{interval:r}){if(!Number.isFinite(r)||r<=0)throw TypeError(`histogram interval must be finite and greater than 0.`);return{type:e.AggregationGroupType.HISTOGRAM,...f(t,`HISTOGRAM`),interval:r,alias:c(n)}},dateHistogram(t,n,{unit:r,timeZone:i=`UTC`,dense:a}){if(a!==void 0&&typeof a!=`boolean`)throw TypeError(`date histogram dense must be boolean.`);if(!Object.values(e.AggregationDateUnit).includes(r))throw TypeError(`date histogram unit is invalid.`);if(typeof i!=`string`||!i.trim())throw TypeError(`date histogram timeZone cannot be blank.`);return{type:e.AggregationGroupType.DATE_HISTOGRAM,...a===void 0?{}:{dense:a},field:s(t),unit:r,alias:c(n),timeZone:i}},datePart(t,n,{part:r,timeZone:i=`UTC`,dense:a}){if(a!==void 0&&typeof a!=`boolean`)throw TypeError(`date part dense must be boolean.`);if(!Object.values(e.AggregationDatePart).includes(r))throw TypeError(`date part is invalid.`);if(typeof i!=`string`||!i.trim())throw TypeError(`date part timeZone cannot be blank.`);return{type:e.AggregationGroupType.DATE_PART,...a===void 0?{}:{dense:a},field:s(t),part:r,alias:c(n),timeZone:i}},any(t,n,{filter:r}={}){return{type:e.AggregationMetricType.ANY,...r===void 0?{}:{filter:r},field:s(t),alias:c(n)}},first(t,n,r={}){return d(e.AggregationMetricType.FIRST,t,n,r)},last(t,n,r={}){return d(e.AggregationMetricType.LAST,t,n,r)},count(t,{filter:n}={}){return{type:e.AggregationMetricType.COUNT,...n===void 0?{}:{filter:n},alias:c(t)}},sum:(t,n,r)=>u(e.AggregationFunction.SUM,t,n,r),avg:(t,n,r)=>u(e.AggregationFunction.AVG,t,n,r),min:(t,n,r)=>u(e.AggregationFunction.MIN,t,n,r),max:(t,n,r)=>u(e.AggregationFunction.MAX,t,n,r),stddev:(t,n,r)=>u(e.AggregationFunction.STDDEV,t,n,r),variance:(t,n,r)=>u(e.AggregationFunction.VARIANCE,t,n,r),distinctCount(t,n,{filter:r}={}){return{type:e.AggregationMetricType.DISTINCT_COUNT,expression:t,alias:c(n),...r===void 0?{}:{filter:r}}},percentile(t,n,{percentile:r,filter:i}){if(!Number.isFinite(r)||r<=0||r>=100)throw TypeError(`percentile must be finite and within (0, 100).`);return{type:e.AggregationMetricType.PERCENTILE,expression:t,percentile:r,alias:c(n),...i===void 0?{}:{filter:i}}},derived(t,n){return{type:e.AggregationMetricType.DERIVED,expression:typeof t==`function`?t(a.derivedExpressionDsl):t,alias:c(n)}},having:o.havingDsl,query(e){return i.admitAggregationQuery(e)}};exports.aggregation=p;
1
+ const e=require("./types.cjs"),t=require("./expressionTrees.cjs"),n=require("../field.cjs"),r=require("../filter/scope.cjs"),i=require("./admit.cjs"),a=require("./derived.cjs"),o=require("./having.cjs");function s(e){return n.queryField(e)}function c(e){if(s(e),e.includes(`.`))throw TypeError(`aggregation alias must contain one segment.`);if(e.startsWith(`__wow`))throw TypeError(`aggregation alias must not use the reserved __wow prefix.`);return e}function l(t,n,r){return{type:e.AggregationExpressionType.BINARY,operator:t,left:n,right:r}}function u(t,n,r,{filter:i}={}){return{type:e.AggregationMetricType.NUMERIC,...i===void 0?{}:{filter:i},function:t,expression:n,alias:c(r)}}function d(e,t,n,{orderBy:r,filter:i}){return{type:e,field:s(t),alias:c(n),...r===void 0?{}:{orderBy:s(r)},...i===void 0?{}:{filter:i}}}function f(e,n){if(typeof e==`string`)return{field:s(e)};if(typeof e!=`object`||!e)throw TypeError(`${n} group requires exactly one of field and expression.`);return t.requireValidExpressionTrees([e]),{expression:e}}function p(t,n,r){if(t===void 0)return{};if(!Object.values(e.AggregationGroupScope).includes(t))throw TypeError(`${n} group scope is invalid.`);if(t===e.AggregationGroupScope.ROOT&&r.expression)throw TypeError(`${n} with a ROOT scope requires a field input.`);return{scope:t}}var m={element(e,t){let n=s(e);return t===void 0?{path:n}:(r.requireElementScopedFilter(t,`Aggregation element filter`,!1),{path:n,filter:t})},field(t){return{type:e.AggregationExpressionType.FIELD,field:s(t)}},constant(t){if(!Number.isFinite(t))throw TypeError(`aggregation constant must be finite.`);return{type:e.AggregationExpressionType.CONSTANT,value:t}},dateDiff(t,n,r){if(!Object.values(e.DateDiffUnit).includes(r))throw TypeError(`date diff unit is invalid.`);return{type:e.AggregationExpressionType.DATE_DIFF,from:s(t),to:s(n),unit:r}},add:(t,n)=>l(e.AggregationExpressionOperator.ADD,t,n),subtract:(t,n)=>l(e.AggregationExpressionOperator.SUBTRACT,t,n),multiply:(t,n)=>l(e.AggregationExpressionOperator.MULTIPLY,t,n),divide:(t,n)=>l(e.AggregationExpressionOperator.DIVIDE,t,n),terms(t,n,{missingKey:r,scope:i}={}){if(r!==void 0&&(typeof r!=`string`||!r.trim()))throw TypeError(`terms missingKey must not be blank.`);let a=f(t,`TERMS`);if(r!==void 0&&a.expression)throw TypeError(`terms missingKey requires a field input.`);return{type:e.AggregationGroupType.TERMS,...r===void 0?{}:{missingKey:r},...a,...p(i,`TERMS`,a),alias:c(n)}},histogram(t,n,{interval:r,scope:i}){if(!Number.isFinite(r)||r<=0)throw TypeError(`histogram interval must be finite and greater than 0.`);let a=f(t,`HISTOGRAM`);return{type:e.AggregationGroupType.HISTOGRAM,...a,...p(i,`HISTOGRAM`,a),interval:r,alias:c(n)}},dateHistogram(t,n,{unit:r,timeZone:i=`UTC`,dense:a,scope:o}){if(a!==void 0&&typeof a!=`boolean`)throw TypeError(`date histogram dense must be boolean.`);if(!Object.values(e.AggregationDateUnit).includes(r))throw TypeError(`date histogram unit is invalid.`);if(typeof i!=`string`||!i.trim())throw TypeError(`date histogram timeZone cannot be blank.`);return{type:e.AggregationGroupType.DATE_HISTOGRAM,...a===void 0?{}:{dense:a},field:s(t),...p(o,`DATE_HISTOGRAM`,{}),unit:r,alias:c(n),timeZone:i}},datePart(t,n,{part:r,timeZone:i=`UTC`,dense:a,scope:o}){if(a!==void 0&&typeof a!=`boolean`)throw TypeError(`date part dense must be boolean.`);if(!Object.values(e.AggregationDatePart).includes(r))throw TypeError(`date part is invalid.`);if(typeof i!=`string`||!i.trim())throw TypeError(`date part timeZone cannot be blank.`);return{type:e.AggregationGroupType.DATE_PART,...a===void 0?{}:{dense:a},field:s(t),...p(o,`DATE_PART`,{}),part:r,alias:c(n),timeZone:i}},any(t,n,{filter:r}={}){return{type:e.AggregationMetricType.ANY,...r===void 0?{}:{filter:r},field:s(t),alias:c(n)}},first(t,n,r={}){return d(e.AggregationMetricType.FIRST,t,n,r)},last(t,n,r={}){return d(e.AggregationMetricType.LAST,t,n,r)},count(t,{filter:n}={}){return{type:e.AggregationMetricType.COUNT,...n===void 0?{}:{filter:n},alias:c(t)}},sum:(t,n,r)=>u(e.AggregationFunction.SUM,t,n,r),avg:(t,n,r)=>u(e.AggregationFunction.AVG,t,n,r),min:(t,n,r)=>u(e.AggregationFunction.MIN,t,n,r),max:(t,n,r)=>u(e.AggregationFunction.MAX,t,n,r),stddev:(t,n,r)=>u(e.AggregationFunction.STDDEV,t,n,r),variance:(t,n,r)=>u(e.AggregationFunction.VARIANCE,t,n,r),distinctCount(t,n,{filter:r}={}){return{type:e.AggregationMetricType.DISTINCT_COUNT,expression:t,alias:c(n),...r===void 0?{}:{filter:r}}},percentile(t,n,{percentile:r,filter:i}){if(!Number.isFinite(r)||r<=0||r>=100)throw TypeError(`percentile must be finite and within (0, 100).`);return{type:e.AggregationMetricType.PERCENTILE,expression:t,percentile:r,alias:c(n),...i===void 0?{}:{filter:i}}},derived(t,n){return{type:e.AggregationMetricType.DERIVED,expression:typeof t==`function`?t(a.derivedExpressionDsl):t,alias:c(n)}},having:o.havingDsl,query(e){return i.admitAggregationQuery(e)}};exports.aggregation=m;
2
2
  //# sourceMappingURL=builders.cjs.map