@camunda/ccma-shared-types 0.4.0 → 0.5.0

package/dist/search/parser.js

@@ -0,0 +1,324 @@
+import {
+  LuceneQueryError
+} from "./ast.js";
+const MAX_INPUT_LENGTH = 512;
+const MAX_NODES = 80;
+const MAX_DEPTH = 25;
+const WORD_BOUNDARY = /* @__PURE__ */ new Set(["(", ")"]);
+class Parser {
+  input;
+  pos = 0;
+  nodes = 0;
+  constructor(input) {
+    this.input = input;
+  }
+  parse() {
+    this.skipWs();
+    if (this.atEnd()) {
+      return void 0;
+    }
+    const node = this.parseOr(0);
+    this.skipWs();
+    if (!this.atEnd()) {
+      throw new LuceneQueryError(
+        `Unexpected "${this.rest(12)}" at position ${this.pos}.`,
+        "syntax"
+      );
+    }
+    return node;
+  }
+  // --- expression levels ----------------------------------------------------
+  parseOr(depth) {
+    this.guardDepth(depth);
+    let node = this.parseAnd(depth);
+    for (; ; ) {
+      this.skipWs();
+      if (!this.matchKeyword("OR") && !this.matchKeyword("||")) {
+        break;
+      }
+      this.consumeKeyword();
+      const right = this.parseAnd(depth);
+      node = this.track({ kind: "or", left: node, right });
+    }
+    return node;
+  }
+  parseAnd(depth) {
+    this.guardDepth(depth);
+    let node = this.parseNot(depth);
+    for (; ; ) {
+      this.skipWs();
+      if (this.atEnd() || this.peek() === ")" || this.matchKeyword("OR") || this.matchKeyword("||")) {
+        break;
+      }
+      if (this.matchKeyword("AND") || this.matchKeyword("&&")) {
+        this.consumeKeyword();
+      }
+      const right = this.parseNot(depth);
+      node = this.track({ kind: "and", left: node, right });
+    }
+    return node;
+  }
+  parseNot(depth) {
+    this.guardDepth(depth);
+    this.skipWs();
+    if (this.matchKeyword("NOT")) {
+      this.consumeKeyword();
+      return this.track({ kind: "not", child: this.parseNot(depth + 1) });
+    }
+    if (this.peek() === "-") {
+      this.pos += 1;
+      return this.track({ kind: "not", child: this.parseNot(depth + 1) });
+    }
+    return this.parsePrimary(depth);
+  }
+  parsePrimary(depth) {
+    this.skipWs();
+    if (this.peek() === "(") {
+      this.pos += 1;
+      const node = this.parseOr(depth + 1);
+      this.skipWs();
+      if (this.peek() !== ")") {
+        throw new LuceneQueryError(
+          `Missing ")" at position ${this.pos}.`,
+          "syntax"
+        );
+      }
+      this.pos += 1;
+      return node;
+    }
+    return this.parseClause();
+  }
+  // --- clauses --------------------------------------------------------------
+  parseClause() {
+    this.skipWs();
+    if (this.atEnd() || this.peek() === ")") {
+      throw new LuceneQueryError(
+        `Expected a search term at position ${this.pos}.`,
+        "syntax"
+      );
+    }
+    if (this.peek() === '"') {
+      return this.track({
+        kind: "term",
+        operator: ":",
+        value: this.readQuoted()
+      });
+    }
+    const word = this.readFieldWord();
+    if (this.peek() === ":") {
+      this.pos += 1;
+      return this.parseFieldValue(word);
+    }
+    if (word === "") {
+      throw new LuceneQueryError(
+        `Expected a search term at position ${this.pos}.`,
+        "syntax"
+      );
+    }
+    return this.track({ kind: "term", operator: ":", value: word });
+  }
+  parseFieldValue(field) {
+    if (field === "") {
+      throw new LuceneQueryError(
+        `Missing field name before ":" at position ${this.pos}.`,
+        "syntax"
+      );
+    }
+    this.skipWs();
+    const opener = this.peek();
+    if (opener === "[" || opener === "{") {
+      return this.parseRange(field, opener);
+    }
+    const operator = this.readComparisonOperator();
+    this.skipWs();
+    const value = this.peek() === '"' ? this.readQuoted() : this.readValueWord();
+    if (value === "") {
+      throw new LuceneQueryError(
+        `Missing value for "${field}" at position ${this.pos}.`,
+        "syntax"
+      );
+    }
+    return this.track({ kind: "term", field, operator, value });
+  }
+  parseRange(field, opener) {
+    this.pos += 1;
+    const lowerInclusive = opener === "[";
+    this.skipWs();
+    const lower = this.peek() === '"' ? this.readQuoted() : this.readRangeAtom();
+    this.skipWs();
+    if (!this.matchKeyword("TO")) {
+      throw new LuceneQueryError(
+        `Expected "TO" in range for "${field}" at position ${this.pos}.`,
+        "syntax"
+      );
+    }
+    this.consumeKeyword();
+    this.skipWs();
+    const upper = this.peek() === '"' ? this.readQuoted() : this.readRangeAtom();
+    this.skipWs();
+    const closer = this.peek();
+    if (closer !== "]" && closer !== "}") {
+      throw new LuceneQueryError(
+        `Missing "]" or "}" to close range for "${field}" at position ${this.pos}.`,
+        "syntax"
+      );
+    }
+    this.pos += 1;
+    if (lower === "" || upper === "") {
+      throw new LuceneQueryError(
+        `Range for "${field}" needs both bounds.`,
+        "syntax"
+      );
+    }
+    return this.track({
+      kind: "range",
+      field,
+      lower,
+      upper,
+      lowerInclusive,
+      upperInclusive: closer === "]"
+    });
+  }
+  // --- token readers --------------------------------------------------------
+  /** A field name / bareword: stops at whitespace, `:`, or a boundary char. */
+  readFieldWord() {
+    const start = this.pos;
+    while (!this.atEnd()) {
+      const char = this.peek();
+      if (char === ":" || this.isWs(char) || WORD_BOUNDARY.has(char)) {
+        break;
+      }
+      this.pos += 1;
+    }
+    return this.input.slice(start, this.pos);
+  }
+  /** A value word: keeps `:` (e.g. times) but stops at whitespace/parens. */
+  readValueWord() {
+    const start = this.pos;
+    while (!this.atEnd()) {
+      const char = this.peek();
+      if (this.isWs(char) || WORD_BOUNDARY.has(char)) {
+        break;
+      }
+      this.pos += 1;
+    }
+    return this.input.slice(start, this.pos);
+  }
+  /** A range bound: like a value word but also stops at `]`/`}`. */
+  readRangeAtom() {
+    const start = this.pos;
+    while (!this.atEnd()) {
+      const char = this.peek();
+      if (this.isWs(char) || WORD_BOUNDARY.has(char) || char === "]" || char === "}") {
+        break;
+      }
+      this.pos += 1;
+    }
+    return this.input.slice(start, this.pos);
+  }
+  readQuoted() {
+    this.pos += 1;
+    let value = "";
+    while (!this.atEnd()) {
+      const char = this.peek();
+      if (char === "\\" && this.pos + 1 < this.input.length) {
+        value += this.input[this.pos + 1];
+        this.pos += 2;
+        continue;
+      }
+      if (char === '"') {
+        this.pos += 1;
+        return value;
+      }
+      value += char;
+      this.pos += 1;
+    }
+    throw new LuceneQueryError("Unterminated quoted string.", "syntax");
+  }
+  readComparisonOperator() {
+    const char = this.peek();
+    if (char === ">" || char === "<") {
+      this.pos += 1;
+      if (this.peek() === "=") {
+        this.pos += 1;
+        return char === ">" ? ">=" : "<=";
+      }
+      return char;
+    }
+    return ":";
+  }
+  // --- keyword helpers ------------------------------------------------------
+  /**
+   * Does the input at the cursor start with `keyword` as a standalone token?
+   * Case-insensitive; the char after must be whitespace, a paren, or the end so
+   * `ORganization` is not read as `OR`.
+   */
+  matchKeyword(keyword) {
+    const end = this.pos + keyword.length;
+    if (end > this.input.length) {
+      return false;
+    }
+    const slice = this.input.slice(this.pos, end);
+    if (slice.toUpperCase() !== keyword.toUpperCase()) {
+      return false;
+    }
+    if (end === this.input.length) {
+      return true;
+    }
+    const next = this.input[end];
+    return this.isWs(next) || next === "(" || next === ")";
+  }
+  /** Consume the standalone keyword the cursor is on (length via next boundary). */
+  consumeKeyword() {
+    while (!this.atEnd()) {
+      const char = this.peek();
+      if (this.isWs(char) || char === "(" || char === ")") {
+        break;
+      }
+      this.pos += 1;
+    }
+  }
+  // --- primitives -----------------------------------------------------------
+  track(node) {
+    this.nodes += 1;
+    if (this.nodes > MAX_NODES) {
+      throw new LuceneQueryError("Query is too complex.", "syntax");
+    }
+    return node;
+  }
+  guardDepth(depth) {
+    if (depth > MAX_DEPTH) {
+      throw new LuceneQueryError("Query is nested too deeply.", "syntax");
+    }
+  }
+  skipWs() {
+    while (!this.atEnd() && this.isWs(this.peek())) {
+      this.pos += 1;
+    }
+  }
+  isWs(char) {
+    return char === " " || char === "	" || char === "\n" || char === "\r";
+  }
+  peek() {
+    return this.input[this.pos] ?? "";
+  }
+  atEnd() {
+    return this.pos >= this.input.length;
+  }
+  rest(max) {
+    return this.input.slice(this.pos, this.pos + max);
+  }
+}
+const parseLuceneQuery = (input) => {
+  if (input.length > MAX_INPUT_LENGTH) {
+    throw new LuceneQueryError(
+      `Query is too long (max ${MAX_INPUT_LENGTH} characters).`,
+      "syntax"
+    );
+  }
+  return new Parser(input).parse();
+};
+export {
+  parseLuceneQuery
+};
+//# sourceMappingURL=parser.js.map

package/dist/search/parser.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../src/search/parser.ts"],
+  "sourcesContent": ["/*\n * Copyright Camunda Services GmbH and/or licensed to Camunda Services GmbH\n * under one or more contributor license agreements. Licensed under a commercial license.\n * You may not use this file except in compliance with the commercial license.\n */\n\nimport {\n  LuceneQueryError,\n  type QueryNode,\n  type SearchTermOperator,\n} from './ast.js'\n\n// ============================================================================\n// Hand-rolled recursive-descent parser for the Lucene subset (see ast.ts).\n//\n// Grammar (operator precedence low \u2192 high):\n//   orExpr   := andExpr ( OR andExpr )*\n//   andExpr  := notExpr ( AND? notExpr )*      // adjacency = implicit AND\n//   notExpr  := (NOT | '-') notExpr | primary\n//   primary  := '(' orExpr ')' | clause\n//   clause   := WORD ':' value | value        // bare value = default-field term\n//   value    := range | comparison | atom\n//   range    := ('[' | '{') atom TO atom (']' | '}')\n//   atom     := '\"' \u2026 '\"' | word\n// ============================================================================\n\n/** Hard caps so a pathological query can't blow up the parser (spec: safety). */\nconst MAX_INPUT_LENGTH = 512\nconst MAX_NODES = 80\nconst MAX_DEPTH = 25\n\n/** Characters that terminate an unquoted word (besides whitespace). */\nconst WORD_BOUNDARY = new Set(['(', ')'])\n\nclass Parser {\n  private readonly input: string\n  private pos = 0\n  private nodes = 0\n\n  constructor(input: string) {\n    this.input = input\n  }\n\n  parse(): QueryNode | undefined {\n    this.skipWs()\n    if (this.atEnd()) {\n      return undefined\n    }\n    const node = this.parseOr(0)\n    this.skipWs()\n    if (!this.atEnd()) {\n      throw new LuceneQueryError(\n        `Unexpected \"${this.rest(12)}\" at position ${this.pos}.`,\n        'syntax',\n      )\n    }\n    return node\n  }\n\n  // --- expression levels ----------------------------------------------------\n\n  private parseOr(depth: number): QueryNode {\n    this.guardDepth(depth)\n    let node = this.parseAnd(depth)\n    for (;;) {\n      this.skipWs()\n      if (!this.matchKeyword('OR') && !this.matchKeyword('||')) {\n        break\n      }\n      this.consumeKeyword()\n      const right = this.parseAnd(depth)\n      node = this.track({ kind: 'or', left: node, right })\n    }\n    return node\n  }\n\n  private parseAnd(depth: number): QueryNode {\n    this.guardDepth(depth)\n    let node = this.parseNot(depth)\n    for (;;) {\n      this.skipWs()\n      // Stop the implicit-AND run at the end, a closing paren, or an OR.\n      if (\n        this.atEnd() ||\n        this.peek() === ')' ||\n        this.matchKeyword('OR') ||\n        this.matchKeyword('||')\n      ) {\n        break\n      }\n      // An explicit AND is optional \u2014 adjacency already means AND.\n      if (this.matchKeyword('AND') || this.matchKeyword('&&')) {\n        this.consumeKeyword()\n      }\n      const right = this.parseNot(depth)\n      node = this.track({ kind: 'and', left: node, right })\n    }\n    return node\n  }\n\n  private parseNot(depth: number): QueryNode {\n    this.guardDepth(depth)\n    this.skipWs()\n    if (this.matchKeyword('NOT')) {\n      this.consumeKeyword()\n      return this.track({ kind: 'not', child: this.parseNot(depth + 1) })\n    }\n    // A leading '-' at a term boundary is negation (mid-value dashes are kept\n    // by the word reader, so `region:aws-1` is unaffected).\n    if (this.peek() === '-') {\n      this.pos += 1\n      return this.track({ kind: 'not', child: this.parseNot(depth + 1) })\n    }\n    return this.parsePrimary(depth)\n  }\n\n  private parsePrimary(depth: number): QueryNode {\n    this.skipWs()\n    if (this.peek() === '(') {\n      this.pos += 1\n      const node = this.parseOr(depth + 1)\n      this.skipWs()\n      if (this.peek() !== ')') {\n        throw new LuceneQueryError(\n          `Missing \")\" at position ${this.pos}.`,\n          'syntax',\n        )\n      }\n      this.pos += 1\n      return node\n    }\n    return this.parseClause()\n  }\n\n  // --- clauses --------------------------------------------------------------\n\n  private parseClause(): QueryNode {\n    this.skipWs()\n    if (this.atEnd() || this.peek() === ')') {\n      throw new LuceneQueryError(\n        `Expected a search term at position ${this.pos}.`,\n        'syntax',\n      )\n    }\n\n    // A quoted value at clause start is always a bare term.\n    if (this.peek() === '\"') {\n      return this.track({\n        kind: 'term',\n        operator: ':',\n        value: this.readQuoted(),\n      })\n    }\n\n    const word = this.readFieldWord()\n    if (this.peek() === ':') {\n      this.pos += 1\n      return this.parseFieldValue(word)\n    }\n    // No colon \u2192 the word is a bare (default-field) term.\n    if (word === '') {\n      throw new LuceneQueryError(\n        `Expected a search term at position ${this.pos}.`,\n        'syntax',\n      )\n    }\n    return this.track({ kind: 'term', operator: ':', value: word })\n  }\n\n  private parseFieldValue(field: string): QueryNode {\n    if (field === '') {\n      throw new LuceneQueryError(\n        `Missing field name before \":\" at position ${this.pos}.`,\n        'syntax',\n      )\n    }\n    // Be forgiving of a space after the colon (`name: acme`).\n    this.skipWs()\n    const opener = this.peek()\n    if (opener === '[' || opener === '{') {\n      return this.parseRange(field, opener)\n    }\n    const operator = this.readComparisonOperator()\n    // \u2026and after a comparison operator (`created: >= 2024-01-01`).\n    this.skipWs()\n    const value = this.peek() === '\"' ? this.readQuoted() : this.readValueWord()\n    if (value === '') {\n      throw new LuceneQueryError(\n        `Missing value for \"${field}\" at position ${this.pos}.`,\n        'syntax',\n      )\n    }\n    return this.track({ kind: 'term', field, operator, value })\n  }\n\n  private parseRange(field: string, opener: '[' | '{'): QueryNode {\n    this.pos += 1 // consume opener\n    const lowerInclusive = opener === '['\n    this.skipWs()\n    const lower = this.peek() === '\"' ? this.readQuoted() : this.readRangeAtom()\n    this.skipWs()\n    if (!this.matchKeyword('TO')) {\n      throw new LuceneQueryError(\n        `Expected \"TO\" in range for \"${field}\" at position ${this.pos}.`,\n        'syntax',\n      )\n    }\n    this.consumeKeyword()\n    this.skipWs()\n    const upper = this.peek() === '\"' ? this.readQuoted() : this.readRangeAtom()\n    this.skipWs()\n    const closer = this.peek()\n    if (closer !== ']' && closer !== '}') {\n      throw new LuceneQueryError(\n        `Missing \"]\" or \"}\" to close range for \"${field}\" at position ${this.pos}.`,\n        'syntax',\n      )\n    }\n    this.pos += 1\n    if (lower === '' || upper === '') {\n      throw new LuceneQueryError(\n        `Range for \"${field}\" needs both bounds.`,\n        'syntax',\n      )\n    }\n    return this.track({\n      kind: 'range',\n      field,\n      lower,\n      upper,\n      lowerInclusive,\n      upperInclusive: closer === ']',\n    })\n  }\n\n  // --- token readers --------------------------------------------------------\n\n  /** A field name / bareword: stops at whitespace, `:`, or a boundary char. */\n  private readFieldWord(): string {\n    const start = this.pos\n    while (!this.atEnd()) {\n      const char = this.peek()\n      if (char === ':' || this.isWs(char) || WORD_BOUNDARY.has(char)) {\n        break\n      }\n      this.pos += 1\n    }\n    return this.input.slice(start, this.pos)\n  }\n\n  /** A value word: keeps `:` (e.g. times) but stops at whitespace/parens. */\n  private readValueWord(): string {\n    const start = this.pos\n    while (!this.atEnd()) {\n      const char = this.peek()\n      if (this.isWs(char) || WORD_BOUNDARY.has(char)) {\n        break\n      }\n      this.pos += 1\n    }\n    return this.input.slice(start, this.pos)\n  }\n\n  /** A range bound: like a value word but also stops at `]`/`}`. */\n  private readRangeAtom(): string {\n    const start = this.pos\n    while (!this.atEnd()) {\n      const char = this.peek()\n      if (\n        this.isWs(char) ||\n        WORD_BOUNDARY.has(char) ||\n        char === ']' ||\n        char === '}'\n      ) {\n        break\n      }\n      this.pos += 1\n    }\n    return this.input.slice(start, this.pos)\n  }\n\n  private readQuoted(): string {\n    this.pos += 1 // opening quote\n    let value = ''\n    while (!this.atEnd()) {\n      const char = this.peek()\n      if (char === '\\\\' && this.pos + 1 < this.input.length) {\n        value += this.input[this.pos + 1]\n        this.pos += 2\n        continue\n      }\n      if (char === '\"') {\n        this.pos += 1\n        return value\n      }\n      value += char\n      this.pos += 1\n    }\n    throw new LuceneQueryError('Unterminated quoted string.', 'syntax')\n  }\n\n  private readComparisonOperator(): SearchTermOperator {\n    const char = this.peek()\n    if (char === '>' || char === '<') {\n      this.pos += 1\n      if (this.peek() === '=') {\n        this.pos += 1\n        return char === '>' ? '>=' : '<='\n      }\n      return char\n    }\n    return ':'\n  }\n\n  // --- keyword helpers ------------------------------------------------------\n\n  /**\n   * Does the input at the cursor start with `keyword` as a standalone token?\n   * Case-insensitive; the char after must be whitespace, a paren, or the end so\n   * `ORganization` is not read as `OR`.\n   */\n  private matchKeyword(keyword: string): boolean {\n    const end = this.pos + keyword.length\n    if (end > this.input.length) {\n      return false\n    }\n    const slice = this.input.slice(this.pos, end)\n    if (slice.toUpperCase() !== keyword.toUpperCase()) {\n      return false\n    }\n    if (end === this.input.length) {\n      return true\n    }\n    const next = this.input[end]\n    return this.isWs(next) || next === '(' || next === ')'\n  }\n\n  /** Consume the standalone keyword the cursor is on (length via next boundary). */\n  private consumeKeyword(): void {\n    while (!this.atEnd()) {\n      const char = this.peek()\n      if (this.isWs(char) || char === '(' || char === ')') {\n        break\n      }\n      this.pos += 1\n    }\n  }\n\n  // --- primitives -----------------------------------------------------------\n\n  private track<T extends QueryNode>(node: T): T {\n    this.nodes += 1\n    if (this.nodes > MAX_NODES) {\n      throw new LuceneQueryError('Query is too complex.', 'syntax')\n    }\n    return node\n  }\n\n  private guardDepth(depth: number): void {\n    if (depth > MAX_DEPTH) {\n      throw new LuceneQueryError('Query is nested too deeply.', 'syntax')\n    }\n  }\n\n  private skipWs(): void {\n    while (!this.atEnd() && this.isWs(this.peek())) {\n      this.pos += 1\n    }\n  }\n\n  private isWs(char: string): boolean {\n    return char === ' ' || char === '\\t' || char === '\\n' || char === '\\r'\n  }\n\n  private peek(): string {\n    return this.input[this.pos] ?? ''\n  }\n\n  private atEnd(): boolean {\n    return this.pos >= this.input.length\n  }\n\n  private rest(max: number): string {\n    return this.input.slice(this.pos, this.pos + max)\n  }\n}\n\n/**\n * Parse a Lucene-subset query into an AST. Returns `undefined` for an empty or\n * whitespace-only query (a no-op filter). Throws {@link LuceneQueryError} on any\n * syntax problem.\n */\nexport const parseLuceneQuery = (input: string): QueryNode | undefined => {\n  if (input.length > MAX_INPUT_LENGTH) {\n    throw new LuceneQueryError(\n      `Query is too long (max ${MAX_INPUT_LENGTH} characters).`,\n      'syntax',\n    )\n  }\n  return new Parser(input).parse()\n}\n"],
+  "mappings": "AAMA;AAAA,EACE;AAAA,OAGK;AAiBP,MAAM,mBAAmB;AACzB,MAAM,YAAY;AAClB,MAAM,YAAY;AAGlB,MAAM,gBAAgB,oBAAI,IAAI,CAAC,KAAK,GAAG,CAAC;AAExC,MAAM,OAAO;AAAA,EACM;AAAA,EACT,MAAM;AAAA,EACN,QAAQ;AAAA,EAEhB,YAAY,OAAe;AACzB,SAAK,QAAQ;AAAA,EACf;AAAA,EAEA,QAA+B;AAC7B,SAAK,OAAO;AACZ,QAAI,KAAK,MAAM,GAAG;AAChB,aAAO;AAAA,IACT;AACA,UAAM,OAAO,KAAK,QAAQ,CAAC;AAC3B,SAAK,OAAO;AACZ,QAAI,CAAC,KAAK,MAAM,GAAG;AACjB,YAAM,IAAI;AAAA,QACR,eAAe,KAAK,KAAK,EAAE,CAAC,iBAAiB,KAAK,GAAG;AAAA,QACrD;AAAA,MACF;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAAA;AAAA,EAIQ,QAAQ,OAA0B;AACxC,SAAK,WAAW,KAAK;AACrB,QAAI,OAAO,KAAK,SAAS,KAAK;AAC9B,eAAS;AACP,WAAK,OAAO;AACZ,UAAI,CAAC,KAAK,aAAa,IAAI,KAAK,CAAC,KAAK,aAAa,IAAI,GAAG;AACxD;AAAA,MACF;AACA,WAAK,eAAe;AACpB,YAAM,QAAQ,KAAK,SAAS,KAAK;AACjC,aAAO,KAAK,MAAM,EAAE,MAAM,MAAM,MAAM,MAAM,MAAM,CAAC;AAAA,IACrD;AACA,WAAO;AAAA,EACT;AAAA,EAEQ,SAAS,OAA0B;AACzC,SAAK,WAAW,KAAK;AACrB,QAAI,OAAO,KAAK,SAAS,KAAK;AAC9B,eAAS;AACP,WAAK,OAAO;AAEZ,UACE,KAAK,MAAM,KACX,KAAK,KAAK,MAAM,OAChB,KAAK,aAAa,IAAI,KACtB,KAAK,aAAa,IAAI,GACtB;AACA;AAAA,MACF;AAEA,UAAI,KAAK,aAAa,KAAK,KAAK,KAAK,aAAa,IAAI,GAAG;AACvD,aAAK,eAAe;AAAA,MACtB;AACA,YAAM,QAAQ,KAAK,SAAS,KAAK;AACjC,aAAO,KAAK,MAAM,EAAE,MAAM,OAAO,MAAM,MAAM,MAAM,CAAC;AAAA,IACtD;AACA,WAAO;AAAA,EACT;AAAA,EAEQ,SAAS,OAA0B;AACzC,SAAK,WAAW,KAAK;AACrB,SAAK,OAAO;AACZ,QAAI,KAAK,aAAa,KAAK,GAAG;AAC5B,WAAK,eAAe;AACpB,aAAO,KAAK,MAAM,EAAE,MAAM,OAAO,OAAO,KAAK,SAAS,QAAQ,CAAC,EAAE,CAAC;AAAA,IACpE;AAGA,QAAI,KAAK,KAAK,MAAM,KAAK;AACvB,WAAK,OAAO;AACZ,aAAO,KAAK,MAAM,EAAE,MAAM,OAAO,OAAO,KAAK,SAAS,QAAQ,CAAC,EAAE,CAAC;AAAA,IACpE;AACA,WAAO,KAAK,aAAa,KAAK;AAAA,EAChC;AAAA,EAEQ,aAAa,OAA0B;AAC7C,SAAK,OAAO;AACZ,QAAI,KAAK,KAAK,MAAM,KAAK;AACvB,WAAK,OAAO;AACZ,YAAM,OAAO,KAAK,QAAQ,QAAQ,CAAC;AACnC,WAAK,OAAO;AACZ,UAAI,KAAK,KAAK,MAAM,KAAK;AACvB,cAAM,IAAI;AAAA,UACR,2BAA2B,KAAK,GAAG;AAAA,UACnC;AAAA,QACF;AAAA,MACF;AACA,WAAK,OAAO;AACZ,aAAO;AAAA,IACT;AACA,WAAO,KAAK,YAAY;AAAA,EAC1B;AAAA;AAAA,EAIQ,cAAyB;AAC/B,SAAK,OAAO;AACZ,QAAI,KAAK,MAAM,KAAK,KAAK,KAAK,MAAM,KAAK;AACvC,YAAM,IAAI;AAAA,QACR,sCAAsC,KAAK,GAAG;AAAA,QAC9C;AAAA,MACF;AAAA,IACF;AAGA,QAAI,KAAK,KAAK,MAAM,KAAK;AACvB,aAAO,KAAK,MAAM;AAAA,QAChB,MAAM;AAAA,QACN,UAAU;AAAA,QACV,OAAO,KAAK,WAAW;AAAA,MACzB,CAAC;AAAA,IACH;AAEA,UAAM,OAAO,KAAK,cAAc;AAChC,QAAI,KAAK,KAAK,MAAM,KAAK;AACvB,WAAK,OAAO;AACZ,aAAO,KAAK,gBAAgB,IAAI;AAAA,IAClC;AAEA,QAAI,SAAS,IAAI;AACf,YAAM,IAAI;AAAA,QACR,sCAAsC,KAAK,GAAG;AAAA,QAC9C;AAAA,MACF;AAAA,IACF;AACA,WAAO,KAAK,MAAM,EAAE,MAAM,QAAQ,UAAU,KAAK,OAAO,KAAK,CAAC;AAAA,EAChE;AAAA,EAEQ,gBAAgB,OAA0B;AAChD,QAAI,UAAU,IAAI;AAChB,YAAM,IAAI;AAAA,QACR,6CAA6C,KAAK,GAAG;AAAA,QACrD;AAAA,MACF;AAAA,IACF;AAEA,SAAK,OAAO;AACZ,UAAM,SAAS,KAAK,KAAK;AACzB,QAAI,WAAW,OAAO,WAAW,KAAK;AACpC,aAAO,KAAK,WAAW,OAAO,MAAM;AAAA,IACtC;AACA,UAAM,WAAW,KAAK,uBAAuB;AAE7C,SAAK,OAAO;AACZ,UAAM,QAAQ,KAAK,KAAK,MAAM,MAAM,KAAK,WAAW,IAAI,KAAK,cAAc;AAC3E,QAAI,UAAU,IAAI;AAChB,YAAM,IAAI;AAAA,QACR,sBAAsB,KAAK,iBAAiB,KAAK,GAAG;AAAA,QACpD;AAAA,MACF;AAAA,IACF;AACA,WAAO,KAAK,MAAM,EAAE,MAAM,QAAQ,OAAO,UAAU,MAAM,CAAC;AAAA,EAC5D;AAAA,EAEQ,WAAW,OAAe,QAA8B;AAC9D,SAAK,OAAO;AACZ,UAAM,iBAAiB,WAAW;AAClC,SAAK,OAAO;AACZ,UAAM,QAAQ,KAAK,KAAK,MAAM,MAAM,KAAK,WAAW,IAAI,KAAK,cAAc;AAC3E,SAAK,OAAO;AACZ,QAAI,CAAC,KAAK,aAAa,IAAI,GAAG;AAC5B,YAAM,IAAI;AAAA,QACR,+BAA+B,KAAK,iBAAiB,KAAK,GAAG;AAAA,QAC7D;AAAA,MACF;AAAA,IACF;AACA,SAAK,eAAe;AACpB,SAAK,OAAO;AACZ,UAAM,QAAQ,KAAK,KAAK,MAAM,MAAM,KAAK,WAAW,IAAI,KAAK,cAAc;AAC3E,SAAK,OAAO;AACZ,UAAM,SAAS,KAAK,KAAK;AACzB,QAAI,WAAW,OAAO,WAAW,KAAK;AACpC,YAAM,IAAI;AAAA,QACR,0CAA0C,KAAK,iBAAiB,KAAK,GAAG;AAAA,QACxE;AAAA,MACF;AAAA,IACF;AACA,SAAK,OAAO;AACZ,QAAI,UAAU,MAAM,UAAU,IAAI;AAChC,YAAM,IAAI;AAAA,QACR,cAAc,KAAK;AAAA,QACnB;AAAA,MACF;AAAA,IACF;AACA,WAAO,KAAK,MAAM;AAAA,MAChB,MAAM;AAAA,MACN;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,gBAAgB,WAAW;AAAA,IAC7B,CAAC;AAAA,EACH;AAAA;AAAA;AAAA,EAKQ,gBAAwB;AAC9B,UAAM,QAAQ,KAAK;AACnB,WAAO,CAAC,KAAK,MAAM,GAAG;AACpB,YAAM,OAAO,KAAK,KAAK;AACvB,UAAI,SAAS,OAAO,KAAK,KAAK,IAAI,KAAK,cAAc,IAAI,IAAI,GAAG;AAC9D;AAAA,MACF;AACA,WAAK,OAAO;AAAA,IACd;AACA,WAAO,KAAK,MAAM,MAAM,OAAO,KAAK,GAAG;AAAA,EACzC;AAAA;AAAA,EAGQ,gBAAwB;AAC9B,UAAM,QAAQ,KAAK;AACnB,WAAO,CAAC,KAAK,MAAM,GAAG;AACpB,YAAM,OAAO,KAAK,KAAK;AACvB,UAAI,KAAK,KAAK,IAAI,KAAK,cAAc,IAAI,IAAI,GAAG;AAC9C;AAAA,MACF;AACA,WAAK,OAAO;AAAA,IACd;AACA,WAAO,KAAK,MAAM,MAAM,OAAO,KAAK,GAAG;AAAA,EACzC;AAAA;AAAA,EAGQ,gBAAwB;AAC9B,UAAM,QAAQ,KAAK;AACnB,WAAO,CAAC,KAAK,MAAM,GAAG;AACpB,YAAM,OAAO,KAAK,KAAK;AACvB,UACE,KAAK,KAAK,IAAI,KACd,cAAc,IAAI,IAAI,KACtB,SAAS,OACT,SAAS,KACT;AACA;AAAA,MACF;AACA,WAAK,OAAO;AAAA,IACd;AACA,WAAO,KAAK,MAAM,MAAM,OAAO,KAAK,GAAG;AAAA,EACzC;AAAA,EAEQ,aAAqB;AAC3B,SAAK,OAAO;AACZ,QAAI,QAAQ;AACZ,WAAO,CAAC,KAAK,MAAM,GAAG;AACpB,YAAM,OAAO,KAAK,KAAK;AACvB,UAAI,SAAS,QAAQ,KAAK,MAAM,IAAI,KAAK,MAAM,QAAQ;AACrD,iBAAS,KAAK,MAAM,KAAK,MAAM,CAAC;AAChC,aAAK,OAAO;AACZ;AAAA,MACF;AACA,UAAI,SAAS,KAAK;AAChB,aAAK,OAAO;AACZ,eAAO;AAAA,MACT;AACA,eAAS;AACT,WAAK,OAAO;AAAA,IACd;AACA,UAAM,IAAI,iBAAiB,+BAA+B,QAAQ;AAAA,EACpE;AAAA,EAEQ,yBAA6C;AACnD,UAAM,OAAO,KAAK,KAAK;AACvB,QAAI,SAAS,OAAO,SAAS,KAAK;AAChC,WAAK,OAAO;AACZ,UAAI,KAAK,KAAK,MAAM,KAAK;AACvB,aAAK,OAAO;AACZ,eAAO,SAAS,MAAM,OAAO;AAAA,MAC/B;AACA,aAAO;AAAA,IACT;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASQ,aAAa,SAA0B;AAC7C,UAAM,MAAM,KAAK,MAAM,QAAQ;AAC/B,QAAI,MAAM,KAAK,MAAM,QAAQ;AAC3B,aAAO;AAAA,IACT;AACA,UAAM,QAAQ,KAAK,MAAM,MAAM,KAAK,KAAK,GAAG;AAC5C,QAAI,MAAM,YAAY,MAAM,QAAQ,YAAY,GAAG;AACjD,aAAO;AAAA,IACT;AACA,QAAI,QAAQ,KAAK,MAAM,QAAQ;AAC7B,aAAO;AAAA,IACT;AACA,UAAM,OAAO,KAAK,MAAM,GAAG;AAC3B,WAAO,KAAK,KAAK,IAAI,KAAK,SAAS,OAAO,SAAS;AAAA,EACrD;AAAA;AAAA,EAGQ,iBAAuB;AAC7B,WAAO,CAAC,KAAK,MAAM,GAAG;AACpB,YAAM,OAAO,KAAK,KAAK;AACvB,UAAI,KAAK,KAAK,IAAI,KAAK,SAAS,OAAO,SAAS,KAAK;AACnD;AAAA,MACF;AACA,WAAK,OAAO;AAAA,IACd;AAAA,EACF;AAAA;AAAA,EAIQ,MAA2B,MAAY;AAC7C,SAAK,SAAS;AACd,QAAI,KAAK,QAAQ,WAAW;AAC1B,YAAM,IAAI,iBAAiB,yBAAyB,QAAQ;AAAA,IAC9D;AACA,WAAO;AAAA,EACT;AAAA,EAEQ,WAAW,OAAqB;AACtC,QAAI,QAAQ,WAAW;AACrB,YAAM,IAAI,iBAAiB,+BAA+B,QAAQ;AAAA,IACpE;AAAA,EACF;AAAA,EAEQ,SAAe;AACrB,WAAO,CAAC,KAAK,MAAM,KAAK,KAAK,KAAK,KAAK,KAAK,CAAC,GAAG;AAC9C,WAAK,OAAO;AAAA,IACd;AAAA,EACF;AAAA,EAEQ,KAAK,MAAuB;AAClC,WAAO,SAAS,OAAO,SAAS,OAAQ,SAAS,QAAQ,SAAS;AAAA,EACpE;AAAA,EAEQ,OAAe;AACrB,WAAO,KAAK,MAAM,KAAK,GAAG,KAAK;AAAA,EACjC;AAAA,EAEQ,QAAiB;AACvB,WAAO,KAAK,OAAO,KAAK,MAAM;AAAA,EAChC;AAAA,EAEQ,KAAK,KAAqB;AAChC,WAAO,KAAK,MAAM,MAAM,KAAK,KAAK,KAAK,MAAM,GAAG;AAAA,EAClD;AACF;AAOO,MAAM,mBAAmB,CAAC,UAAyC;AACxE,MAAI,MAAM,SAAS,kBAAkB;AACnC,UAAM,IAAI;AAAA,MACR,0BAA0B,gBAAgB;AAAA,MAC1C;AAAA,IACF;AAAA,EACF;AACA,SAAO,IAAI,OAAO,KAAK,EAAE,MAAM;AACjC;",
+  "names": []
+}

package/dist/types/ClusterModification.type.d.ts

@@ -17,6 +17,7 @@ export interface ClusterModificationConfigDto {
     activatedAt?: Date;
     deactivatedAt?: Date;
     deactivatedBy?: string | null;
+    skipK8sUpdate?: boolean;
     expiresAt?: Date | null;
     expiredNotifiedAt?: Date | null;
     replacedBy?: string;

package/dist/types/ClusterPlanFields.type.d.ts

@@ -0,0 +1,24 @@
+/**
+ * Field specification for a cluster plan config: one entry per configurable
+ * leaf, mirroring the shape of the `plan` object stored on a cluster plan.
+ *
+ * It drives the per-field create/edit forms in the admin frontends (accounts
+ * `Create Cluster Plan`, control `Create cluster plan`) so a plan can be filled
+ * in field by field instead of hand-writing JSON — the descriptions, input
+ * types and validators live here rather than in either app.
+ */
+export interface ClusterPlanFieldSpec {
+    type: 'text' | 'number' | 'textarea' | 'checkbox';
+    description: string;
+    placeholder?: string;
+    validator: (value: any) => boolean;
+    /** Only settable on a cluster (modification), not on a cluster plan. */
+    notOnClusterPlan?: boolean;
+}
+/** A nested group of field specs, keyed like the config object itself. */
+export interface ClusterPlanFieldTree {
+    [key: string]: ClusterPlanFieldSpec | ClusterPlanFieldTree;
+}
+/** Narrow a node of the tree to a leaf field spec. */
+export declare const isClusterPlanFieldSpec: (node: ClusterPlanFieldSpec | ClusterPlanFieldTree) => node is ClusterPlanFieldSpec;
+export declare const CLUSTER_PLAN_FIELDS: ClusterPlanFieldTree;