@prisma-next/psl-parser 0.14.0-dev.6 → 0.14.0-dev.61

package/src/syntax/ast/type-annotation.ts

@@ -1,7 +1,6 @@
-import type { Token } from '../../tokenizer';
 import type { AstNode } from '../ast-helpers';
 import { findChildToken, findFirstChild } from '../ast-helpers';
-import type { SyntaxNode } from '../red';
+import type { SyntaxNode, SyntaxToken } from '../red';
 import { AttributeArgListAst } from './attributes';
 import { QualifiedNameAst } from './qualified-name';
 
@@ -26,15 +25,15 @@ export class TypeAnnotationAst implements AstNode {
     return this.argList() !== undefined;
   }
 
-  lbracket(): Token | undefined {
+  lbracket(): SyntaxToken | undefined {
     return findChildToken(this.syntax, 'LBracket');
   }
 
-  rbracket(): Token | undefined {
+  rbracket(): SyntaxToken | undefined {
     return findChildToken(this.syntax, 'RBracket');
   }
 
-  questionMark(): Token | undefined {
+  questionMark(): SyntaxToken | undefined {
     return findChildToken(this.syntax, 'Question');
   }
 

package/src/syntax/ast-helpers.ts

@@ -1,11 +1,16 @@
-import type { Token, TokenKind } from '../tokenizer';
-import { SyntaxNode } from './red';
+import type { TokenKind } from '../tokenizer';
+import { SyntaxNode, type SyntaxToken } from './red';
 
 export interface AstNode {
   readonly syntax: SyntaxNode;
 }
 
-export function findChildToken(node: SyntaxNode, kind: TokenKind): Token | undefined {
+export interface BracedBlock extends AstNode {
+  lbrace(): SyntaxToken | undefined;
+  rbrace(): SyntaxToken | undefined;
+}
+
+export function findChildToken(node: SyntaxNode, kind: TokenKind): SyntaxToken | undefined {
   for (const child of node.children()) {
     if (!(child instanceof SyntaxNode) && child.kind === kind) {
       return child;
@@ -35,6 +40,25 @@ export function* filterChildren<T>(
   }
 }
 
+type CastTarget<C> = C extends (node: SyntaxNode) => infer R ? Exclude<R, undefined> : never;
+
+export function any<Casts extends readonly ((node: SyntaxNode) => unknown)[]>(
+  ...casts: Casts
+): (node: SyntaxNode) => CastTarget<Casts[number]> | undefined;
+export function any(
+  ...casts: ReadonlyArray<(node: SyntaxNode) => unknown>
+): (node: SyntaxNode) => unknown {
+  return (node) => {
+    for (const cast of casts) {
+      const result = cast(node);
+      if (result !== undefined) {
+        return result;
+      }
+    }
+    return undefined;
+  };
+}
+
 /**
  * Raw source text of a CST node, verbatim (quotes and brackets preserved). For
  * the decoded value of a string literal, decode it instead.

package/src/syntax/navigation.ts

@@ -0,0 +1,55 @@
+import type { TokenKind } from '../tokenizer';
+import { type SyntaxElement, SyntaxToken } from './red';
+
+/** Direction of a sibling/token walk. */
+export type Direction = 'next' | 'prev';
+
+const TRIVIA_KINDS: ReadonlySet<TokenKind> = new Set<TokenKind>([
+  'Whitespace',
+  'Newline',
+  'Comment',
+]);
+
+/** Whether a token kind is trivia (whitespace, newline, or comment). */
+export function isTriviaKind(kind: TokenKind): boolean {
+  return TRIVIA_KINDS.has(kind);
+}
+
+/** Whether a token is trivia. */
+export function isTrivia(token: SyntaxToken): boolean {
+  return isTriviaKind(token.kind);
+}
+
+/**
+ * The first non-trivia token at or beyond `token` in `direction`. Returns
+ * `token` itself when it is already significant.
+ */
+export function skipTriviaToken(token: SyntaxToken, direction: Direction): SyntaxToken | undefined {
+  let current: SyntaxToken | undefined = token;
+  while (current !== undefined && isTrivia(current)) {
+    current = direction === 'next' ? current.nextToken : current.prevToken;
+  }
+  return current;
+}
+
+/**
+ * The nearest sibling of `element` (within the same parent) in `direction` that
+ * is not a trivia token. Nodes are always significant.
+ */
+export function nonTriviaSibling(
+  element: SyntaxElement,
+  direction: Direction,
+): SyntaxElement | undefined {
+  let sibling = step(element, direction);
+  while (sibling !== undefined) {
+    if (!(sibling instanceof SyntaxToken) || !isTrivia(sibling)) {
+      return sibling;
+    }
+    sibling = step(sibling, direction);
+  }
+  return undefined;
+}
+
+function step(element: SyntaxElement, direction: Direction): SyntaxElement | undefined {
+  return direction === 'next' ? element.nextSiblingOrToken : element.prevSiblingOrToken;
+}

package/src/syntax/red.ts

@@ -1,27 +1,154 @@
-import type { Token } from '../tokenizer';
-import type { GreenElement, GreenNode } from './green';
+import type { Token, TokenKind } from '../tokenizer';
+import type { GreenElement, GreenNode, GreenToken } from './green';
 import type { SyntaxKind } from './syntax-kind';
 
 /**
  * A token in the red tree. Unlike the green-layer {@link Token} (kind + text
- * only), a red token also carries its absolute `offset` within the source,
- * computed lazily as the tree is walked.
+ * only), a red token also carries its absolute `offset` within the source and a
+ * link back to its `parent` {@link SyntaxNode}, so a cursor anchored on a token
+ * can walk outward (parent, previous/next token, siblings) without re-scanning
+ * from the document root.
  */
-export interface SyntaxToken extends Token {
+export class SyntaxToken implements Token {
+  readonly green: GreenToken;
+  readonly kind: TokenKind;
+  readonly text: string;
   readonly offset: number;
+  readonly parent: SyntaxNode;
+  /** Position within the parent's children, enabling O(1) sibling navigation without rescanning the green layer. */
+  readonly index: number;
+
+  constructor(green: GreenToken, offset: number, parent: SyntaxNode, index: number) {
+    this.green = green;
+    this.kind = green.kind;
+    this.text = green.text;
+    this.offset = offset;
+    this.parent = parent;
+    this.index = index;
+  }
+
+  get textLength(): number {
+    return this.text.length;
+  }
+
+  get endOffset(): number {
+    return this.offset + this.textLength;
+  }
+
+  /** Whether `offset` falls within this token, inclusive of both ends. */
+  isInside(offset: number): boolean {
+    return offset >= this.offset && offset <= this.endOffset;
+  }
+
+  isOutside(offset: number): boolean {
+    return !this.isInside(offset);
+  }
+
+  /** The sibling element immediately after this token within its parent. */
+  get nextSiblingOrToken(): SyntaxElement | undefined {
+    return childAt(this.parent, this.index + 1);
+  }
+
+  /** The sibling element immediately before this token within its parent. */
+  get prevSiblingOrToken(): SyntaxElement | undefined {
+    return childAt(this.parent, this.index - 1);
+  }
+
+  /** The next token in document order, crossing node boundaries. */
+  get nextToken(): SyntaxToken | undefined {
+    for (let el = climbingNext(this); el !== undefined; el = climbingNext(el)) {
+      const token = firstToken(el);
+      if (token !== undefined) return token;
+    }
+    return undefined;
+  }
+
+  /** The previous token in document order, crossing node boundaries. */
+  get prevToken(): SyntaxToken | undefined {
+    for (let el = climbingPrev(this); el !== undefined; el = climbingPrev(el)) {
+      const token = lastToken(el);
+      if (token !== undefined) return token;
+    }
+    return undefined;
+  }
 }
 
 export type SyntaxElement = SyntaxNode | SyntaxToken;
 
+/**
+ * The result of {@link SyntaxNode.tokenAtOffset}: an offset can fall outside
+ * every token (`none`), strictly inside a single token (`single`), or exactly on
+ * the seam between two adjacent tokens (`between`). `leftBiased` / `rightBiased`
+ * collapse the seam case to one side; for `single` both return the same token,
+ * for `none` both return `undefined`.
+ */
+type TokenAtOffsetState =
+  | { readonly kind: 'none' }
+  | { readonly kind: 'single'; readonly token: SyntaxToken }
+  | { readonly kind: 'between'; readonly left: SyntaxToken; readonly right: SyntaxToken };
+
+export class TokenAtOffset {
+  readonly #state: TokenAtOffsetState;
+
+  private constructor(state: TokenAtOffsetState) {
+    this.#state = state;
+  }
+
+  static none(): TokenAtOffset {
+    return new TokenAtOffset({ kind: 'none' });
+  }
+
+  static single(token: SyntaxToken): TokenAtOffset {
+    return new TokenAtOffset({ kind: 'single', token });
+  }
+
+  static between(left: SyntaxToken, right: SyntaxToken): TokenAtOffset {
+    return new TokenAtOffset({ kind: 'between', left, right });
+  }
+
+  get isEmpty(): boolean {
+    return this.#state.kind === 'none';
+  }
+
+  get isBetween(): boolean {
+    return this.#state.kind === 'between';
+  }
+
+  leftBiased(): SyntaxToken | undefined {
+    switch (this.#state.kind) {
+      case 'none':
+        return undefined;
+      case 'single':
+        return this.#state.token;
+      case 'between':
+        return this.#state.left;
+    }
+  }
+
+  rightBiased(): SyntaxToken | undefined {
+    switch (this.#state.kind) {
+      case 'none':
+        return undefined;
+      case 'single':
+        return this.#state.token;
+      case 'between':
+        return this.#state.right;
+    }
+  }
+}
+
 export class SyntaxNode {
   readonly green: GreenNode;
   readonly offset: number;
   readonly parent: SyntaxNode | undefined;
+  /** Position within the parent's children, enabling O(1) sibling navigation without rescanning the green layer. */
+  readonly index: number;
 
-  constructor(green: GreenNode, offset: number, parent: SyntaxNode | undefined) {
+  constructor(green: GreenNode, offset: number, parent: SyntaxNode | undefined, index: number) {
     this.green = green;
     this.offset = offset;
     this.parent = parent;
+    this.index = index;
   }
 
   get kind(): SyntaxKind {
@@ -32,6 +159,19 @@ export class SyntaxNode {
     return this.green.textLength;
   }
 
+  get endOffset(): number {
+    return this.offset + this.textLength;
+  }
+
+  /** Whether `offset` falls within this node, inclusive of both ends. */
+  isInside(offset: number): boolean {
+    return offset >= this.offset && offset <= this.endOffset;
+  }
+
+  isOutside(offset: number): boolean {
+    return !this.isInside(offset);
+  }
+
   get firstChild(): SyntaxElement | undefined {
     return childAt(this, 0);
   }
@@ -43,44 +183,40 @@ export class SyntaxNode {
   }
 
   get nextSibling(): SyntaxElement | undefined {
-    if (!this.parent) return undefined;
-    const siblings = this.parent.green.children;
-    let offset = this.parent.offset;
-    let found = false;
-    for (const child of siblings) {
-      if (found) {
-        return wrapElement(child, offset, this.parent);
-      }
-      const childLen = elementTextLength(child);
-      if (child.type === 'node' && offset === this.offset && child === this.green) {
-        found = true;
-      }
-      offset += childLen;
-    }
-    return undefined;
+    return this.parent === undefined ? undefined : childAt(this.parent, this.index + 1);
   }
 
   get prevSibling(): SyntaxElement | undefined {
-    if (!this.parent) return undefined;
-    const siblings = this.parent.green.children;
-    let offset = this.parent.offset;
-    let prev: { green: GreenElement; offset: number } | undefined;
-    for (const child of siblings) {
-      if (child.type === 'node' && offset === this.offset && child === this.green) {
-        if (!prev) return undefined;
-        return wrapElement(prev.green, prev.offset, this.parent);
-      }
-      prev = { green: child, offset };
-      offset += elementTextLength(child);
-    }
-    return undefined;
+    return this.parent === undefined ? undefined : childAt(this.parent, this.index - 1);
+  }
+
+  /** The sibling element immediately after this node within its parent. */
+  get nextSiblingOrToken(): SyntaxElement | undefined {
+    return this.nextSibling;
+  }
+
+  /** The sibling element immediately before this node within its parent. */
+  get prevSiblingOrToken(): SyntaxElement | undefined {
+    return this.prevSibling;
+  }
+
+  /** The first token in this subtree (depth-first), or `undefined` if empty. */
+  get firstToken(): SyntaxToken | undefined {
+    return firstToken(this);
+  }
+
+  /** The last token in this subtree (depth-first), or `undefined` if empty. */
+  get lastToken(): SyntaxToken | undefined {
+    return lastToken(this);
   }
 
   *children(): Iterable<SyntaxElement> {
     let offset = this.offset;
+    let index = 0;
     for (const child of this.green.children) {
-      yield wrapElement(child, offset, this);
+      yield wrapElement(child, offset, this, index);
       offset += elementTextLength(child);
+      index++;
     }
   }
 
@@ -98,6 +234,21 @@ export class SyntaxNode {
     }
   }
 
+  /** The nearest match, testing this node itself before walking its ancestors. */
+  findAncestor<T>(cast: (node: SyntaxNode) => T | undefined): T | undefined {
+    const self = cast(this);
+    if (self !== undefined) {
+      return self;
+    }
+    for (const ancestor of this.ancestors()) {
+      const result = cast(ancestor);
+      if (result !== undefined) {
+        return result;
+      }
+    }
+    return undefined;
+  }
+
   *descendants(): Iterable<SyntaxElement> {
     const stack: SyntaxElement[] = [this];
     for (let el = stack.pop(); el !== undefined; el = stack.pop()) {
@@ -116,23 +267,147 @@ export class SyntaxNode {
 
   *tokens(): Iterable<SyntaxToken> {
     for (const el of this.descendants()) {
-      if (!(el instanceof SyntaxNode)) {
+      if (el instanceof SyntaxToken) {
         yield el;
       }
     }
   }
+
+  /**
+   * The token(s) at `offset`. The between-two-tokens case (offset exactly on a
+   * token seam) is represented explicitly so callers can left/right bias.
+   */
+  tokenAtOffset(offset: number): TokenAtOffset {
+    return tokenAtOffsetOf(this, offset);
+  }
+
+  /**
+   * The smallest element fully containing the range `[start, end]`. At a seam
+   * (and for empty ranges) the left-hand element is preferred, matching
+   * {@link containsOffset}'s inclusive span.
+   */
+  coveringElement(start: number, end: number): SyntaxElement {
+    let result: SyntaxElement = this;
+    for (;;) {
+      if (result instanceof SyntaxToken) return result;
+      let next: SyntaxElement | undefined;
+      for (const child of result.children()) {
+        if (containsRange(child, start, end)) {
+          next = child;
+          break;
+        }
+      }
+      if (next === undefined) return result;
+      result = next;
+    }
+  }
 }
 
 function elementTextLength(el: GreenElement): number {
   return el.type === 'token' ? el.text.length : el.textLength;
 }
 
-function wrapElement(green: GreenElement, offset: number, parent: SyntaxNode): SyntaxElement {
+function elementLength(el: SyntaxElement): number {
+  return el instanceof SyntaxToken ? el.text.length : el.textLength;
+}
+
+/**
+ * Whether `el` contains `offset`. The span is inclusive on both ends so a seam
+ * offset touches both neighbours.
+ */
+function containsOffset(el: SyntaxElement, offset: number): boolean {
+  const start = el.offset;
+  const len = elementLength(el);
+  return offset >= start && offset <= start + len;
+}
+
+function containsRange(el: SyntaxElement, start: number, end: number): boolean {
+  const elStart = el.offset;
+  const len = elementLength(el);
+  return elStart <= start && end <= elStart + len;
+}
+
+function tokenAtOffsetOf(el: SyntaxElement, offset: number): TokenAtOffset {
+  if (el instanceof SyntaxToken) {
+    return TokenAtOffset.single(el);
+  }
+  let left: SyntaxElement | undefined;
+  let right: SyntaxElement | undefined;
+  for (const child of el.children()) {
+    if (!containsOffset(child, offset)) continue;
+    if (left === undefined) {
+      left = child;
+    } else {
+      right = child;
+      break;
+    }
+  }
+  if (left === undefined) return TokenAtOffset.none();
+  if (right === undefined) return tokenAtOffsetOf(left, offset);
+  const leftToken = tokenAtOffsetOf(left, offset).rightBiased();
+  const rightToken = tokenAtOffsetOf(right, offset).leftBiased();
+  if (leftToken !== undefined && rightToken !== undefined) {
+    return TokenAtOffset.between(leftToken, rightToken);
+  }
+  if (leftToken !== undefined) return TokenAtOffset.single(leftToken);
+  if (rightToken !== undefined) return TokenAtOffset.single(rightToken);
+  return TokenAtOffset.none();
+}
+
+function firstToken(el: SyntaxElement): SyntaxToken | undefined {
+  if (el instanceof SyntaxToken) return el;
+  for (const child of el.children()) {
+    const token = firstToken(child);
+    if (token !== undefined) return token;
+  }
+  return undefined;
+}
+
+function lastToken(el: SyntaxElement): SyntaxToken | undefined {
+  if (el instanceof SyntaxToken) return el;
+  const children = Array.from(el.children());
+  for (let i = children.length - 1; i >= 0; i--) {
+    const child = children[i];
+    if (child !== undefined) {
+      const token = lastToken(child);
+      if (token !== undefined) return token;
+    }
+  }
+  return undefined;
+}
+
+function climbingNext(el: SyntaxElement): SyntaxElement | undefined {
+  let current: SyntaxElement = el;
+  for (;;) {
+    const parent = current.parent;
+    if (parent === undefined) return undefined;
+    const sibling = childAt(parent, current.index + 1);
+    if (sibling !== undefined) return sibling;
+    current = parent;
+  }
+}
+
+function climbingPrev(el: SyntaxElement): SyntaxElement | undefined {
+  let current: SyntaxElement = el;
+  for (;;) {
+    const parent = current.parent;
+    if (parent === undefined) return undefined;
+    const sibling = childAt(parent, current.index - 1);
+    if (sibling !== undefined) return sibling;
+    current = parent;
+  }
+}
+
+function wrapElement(
+  green: GreenElement,
+  offset: number,
+  parent: SyntaxNode,
+  index: number,
+): SyntaxElement {
   if (green.type === 'token') {
-    const token: SyntaxToken = { kind: green.kind, text: green.text, offset };
-    return token;
+    return new SyntaxToken(green, offset, parent, index);
   }
-  return new SyntaxNode(green, offset, parent);
+  return new SyntaxNode(green, offset, parent, index);
 }
 
 function childAt(node: SyntaxNode, index: number): SyntaxElement | undefined {
@@ -146,9 +421,9 @@ function childAt(node: SyntaxNode, index: number): SyntaxElement | undefined {
       offset += elementTextLength(child);
     }
   }
-  return wrapElement(target, offset, node);
+  return wrapElement(target, offset, node, index);
 }
 
 export function createSyntaxTree(green: GreenNode): SyntaxNode {
-  return new SyntaxNode(green, 0, undefined);
+  return new SyntaxNode(green, 0, undefined, 0);
 }

package/dist/declarations-D9h_ihD3.mjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"declarations-D9h_ihD3.mjs","names":["#penultimateSegment","#lastSegment","#separatorCount"],"sources":["../src/syntax/red.ts","../src/syntax/ast-helpers.ts","../src/syntax/ast/identifier.ts","../src/syntax/ast/qualified-name.ts","../src/syntax/ast/expressions.ts","../src/syntax/ast/attributes.ts","../src/syntax/ast/type-annotation.ts","../src/syntax/ast/declarations.ts"],"sourcesContent":["import type { Token } from '../tokenizer';\nimport type { GreenElement, GreenNode } from './green';\nimport type { SyntaxKind } from './syntax-kind';\n\n/**\n * A token in the red tree. Unlike the green-layer {@link Token} (kind + text\n * only), a red token also carries its absolute `offset` within the source,\n * computed lazily as the tree is walked.\n */\nexport interface SyntaxToken extends Token {\n  readonly offset: number;\n}\n\nexport type SyntaxElement = SyntaxNode | SyntaxToken;\n\nexport class SyntaxNode {\n  readonly green: GreenNode;\n  readonly offset: number;\n  readonly parent: SyntaxNode | undefined;\n\n  constructor(green: GreenNode, offset: number, parent: SyntaxNode | undefined) {\n    this.green = green;\n    this.offset = offset;\n    this.parent = parent;\n  }\n\n  get kind(): SyntaxKind {\n    return this.green.kind;\n  }\n\n  get textLength(): number {\n    return this.green.textLength;\n  }\n\n  get firstChild(): SyntaxElement | undefined {\n    return childAt(this, 0);\n  }\n\n  get lastChild(): SyntaxElement | undefined {\n    const len = this.green.children.length;\n    if (len === 0) return undefined;\n    return childAt(this, len - 1);\n  }\n\n  get nextSibling(): SyntaxElement | undefined {\n    if (!this.parent) return undefined;\n    const siblings = this.parent.green.children;\n    let offset = this.parent.offset;\n    let found = false;\n    for (const child of siblings) {\n      if (found) {\n        return wrapElement(child, offset, this.parent);\n      }\n      const childLen = elementTextLength(child);\n      if (child.type === 'node' && offset === this.offset && child === this.green) {\n        found = true;\n      }\n      offset += childLen;\n    }\n    return undefined;\n  }\n\n  get prevSibling(): SyntaxElement | undefined {\n    if (!this.parent) return undefined;\n    const siblings = this.parent.green.children;\n    let offset = this.parent.offset;\n    let prev: { green: GreenElement; offset: number } | undefined;\n    for (const child of siblings) {\n      if (child.type === 'node' && offset === this.offset && child === this.green) {\n        if (!prev) return undefined;\n        return wrapElement(prev.green, prev.offset, this.parent);\n      }\n      prev = { green: child, offset };\n      offset += elementTextLength(child);\n    }\n    return undefined;\n  }\n\n  *children(): Iterable<SyntaxElement> {\n    let offset = this.offset;\n    for (const child of this.green.children) {\n      yield wrapElement(child, offset, this);\n      offset += elementTextLength(child);\n    }\n  }\n\n  *childNodes(): Iterable<SyntaxNode> {\n    for (const child of this.children()) {\n      if (child instanceof SyntaxNode) yield child;\n    }\n  }\n\n  *ancestors(): Iterable<SyntaxNode> {\n    let current: SyntaxNode | undefined = this.parent;\n    while (current) {\n      yield current;\n      current = current.parent;\n    }\n  }\n\n  *descendants(): Iterable<SyntaxElement> {\n    const stack: SyntaxElement[] = [this];\n    for (let el = stack.pop(); el !== undefined; el = stack.pop()) {\n      yield el;\n      if (el instanceof SyntaxNode) {\n        const children = Array.from(el.children());\n        for (let i = children.length - 1; i >= 0; i--) {\n          const child = children[i];\n          if (child !== undefined) {\n            stack.push(child);\n          }\n        }\n      }\n    }\n  }\n\n  *tokens(): Iterable<SyntaxToken> {\n    for (const el of this.descendants()) {\n      if (!(el instanceof SyntaxNode)) {\n        yield el;\n      }\n    }\n  }\n}\n\nfunction elementTextLength(el: GreenElement): number {\n  return el.type === 'token' ? el.text.length : el.textLength;\n}\n\nfunction wrapElement(green: GreenElement, offset: number, parent: SyntaxNode): SyntaxElement {\n  if (green.type === 'token') {\n    const token: SyntaxToken = { kind: green.kind, text: green.text, offset };\n    return token;\n  }\n  return new SyntaxNode(green, offset, parent);\n}\n\nfunction childAt(node: SyntaxNode, index: number): SyntaxElement | undefined {\n  const children = node.green.children;\n  const target = children[index];\n  if (target === undefined) return undefined;\n  let offset = node.offset;\n  for (let i = 0; i < index; i++) {\n    const child = children[i];\n    if (child !== undefined) {\n      offset += elementTextLength(child);\n    }\n  }\n  return wrapElement(target, offset, node);\n}\n\nexport function createSyntaxTree(green: GreenNode): SyntaxNode {\n  return new SyntaxNode(green, 0, undefined);\n}\n","import type { Token, TokenKind } from '../tokenizer';\nimport { SyntaxNode } from './red';\n\nexport interface AstNode {\n  readonly syntax: SyntaxNode;\n}\n\nexport function findChildToken(node: SyntaxNode, kind: TokenKind): Token | undefined {\n  for (const child of node.children()) {\n    if (!(child instanceof SyntaxNode) && child.kind === kind) {\n      return child;\n    }\n  }\n  return undefined;\n}\n\nexport function findFirstChild<T>(\n  node: SyntaxNode,\n  cast: (node: SyntaxNode) => T | undefined,\n): T | undefined {\n  for (const child of node.childNodes()) {\n    const result = cast(child);\n    if (result !== undefined) return result;\n  }\n  return undefined;\n}\n\nexport function* filterChildren<T>(\n  node: SyntaxNode,\n  cast: (node: SyntaxNode) => T | undefined,\n): Iterable<T> {\n  for (const child of node.childNodes()) {\n    const result = cast(child);\n    if (result !== undefined) yield result;\n  }\n}\n\n/**\n * Raw source text of a CST node, verbatim (quotes and brackets preserved). For\n * the decoded value of a string literal, decode it instead.\n */\nexport function printSyntax(node: SyntaxNode): string {\n  let text = '';\n  for (const token of node.tokens()) {\n    text += token.text;\n  }\n  return text;\n}\n","import type { Token } from '../../tokenizer';\nimport type { AstNode } from '../ast-helpers';\nimport { findChildToken } from '../ast-helpers';\nimport type { SyntaxNode } from '../red';\n\nexport class IdentifierAst implements AstNode {\n  readonly syntax: SyntaxNode;\n\n  constructor(syntax: SyntaxNode) {\n    this.syntax = syntax;\n  }\n\n  token(): Token | undefined {\n    return findChildToken(this.syntax, 'Ident');\n  }\n\n  name(): string | undefined {\n    return this.token()?.text;\n  }\n\n  static cast(node: SyntaxNode): IdentifierAst | undefined {\n    return node.kind === 'Identifier' ? new IdentifierAst(node) : undefined;\n  }\n}\n","import type { Token } from '../../tokenizer';\nimport type { AstNode } from '../ast-helpers';\nimport { filterChildren, findChildToken, findFirstChild } from '../ast-helpers';\nimport { SyntaxNode } from '../red';\nimport { IdentifierAst } from './identifier';\n\n/** A namespace-qualified name, e.g. `pgvector.Vector` or `supabase:auth.User`. */\nexport class QualifiedNameAst implements AstNode {\n  readonly syntax: SyntaxNode;\n\n  constructor(syntax: SyntaxNode) {\n    this.syntax = syntax;\n  }\n\n  #lastSegment(): IdentifierAst | undefined {\n    let last: IdentifierAst | undefined;\n    for (const segment of filterChildren(this.syntax, IdentifierAst.cast)) {\n      last = segment;\n    }\n    return last;\n  }\n\n  #penultimateSegment(): IdentifierAst | undefined {\n    let last: IdentifierAst | undefined;\n    let penultimate: IdentifierAst | undefined;\n    for (const segment of filterChildren(this.syntax, IdentifierAst.cast)) {\n      penultimate = last;\n      last = segment;\n    }\n    return penultimate;\n  }\n\n  #separatorCount(kind: 'Dot' | 'Colon'): number {\n    let count = 0;\n    for (const child of this.syntax.children()) {\n      if (!(child instanceof SyntaxNode) && child.kind === kind) count++;\n    }\n    return count;\n  }\n\n  colon(): Token | undefined {\n    return findChildToken(this.syntax, 'Colon');\n  }\n\n  dot(): Token | undefined {\n    return findChildToken(this.syntax, 'Dot');\n  }\n\n  space(): IdentifierAst | undefined {\n    if (!this.colon()) return undefined;\n    return findFirstChild(this.syntax, IdentifierAst.cast);\n  }\n\n  namespace(): IdentifierAst | undefined {\n    if (!this.dot()) return undefined;\n    return this.#penultimateSegment();\n  }\n\n  identifier(): IdentifierAst | undefined {\n    return this.#lastSegment();\n  }\n\n  /**\n   * Every identifier segment, in source order. A bare `Vector` yields\n   * `['Vector']`; a qualified `pgvector.Vector` yields `['pgvector', 'Vector']`.\n   */\n  path(): readonly string[] {\n    const segments: string[] = [];\n    for (const segment of filterChildren(this.syntax, IdentifierAst.cast)) {\n      const text = segment.token()?.text;\n      if (text !== undefined) segments.push(text);\n    }\n    return segments;\n  }\n\n  /**\n   * Flags a malformed name with more qualifier segments than allowed (a second\n   * `:`-space or a second `.`-namespace).\n   */\n  isOverQualified(): boolean {\n    return this.#separatorCount('Dot') > 1 || this.#separatorCount('Colon') > 1;\n  }\n\n  static cast(node: SyntaxNode): QualifiedNameAst | undefined {\n    return node.kind === 'QualifiedName' ? new QualifiedNameAst(node) : undefined;\n  }\n}\n","import type { Token } from '../../tokenizer';\nimport type { AstNode } from '../ast-helpers';\nimport { filterChildren, findChildToken, findFirstChild } from '../ast-helpers';\nimport { SyntaxNode } from '../red';\nimport { IdentifierAst } from './identifier';\nimport { QualifiedNameAst } from './qualified-name';\n\nexport class FunctionCallAst implements AstNode {\n  readonly syntax: SyntaxNode;\n\n  constructor(syntax: SyntaxNode) {\n    this.syntax = syntax;\n  }\n\n  /** The qualified-name callee, or `undefined` when identifier segments sit directly under the node. */\n  name(): QualifiedNameAst | undefined {\n    return findFirstChild(this.syntax, QualifiedNameAst.cast);\n  }\n\n  /**\n   * The dotted call path, in source order. A bare `Vector(…)` yields\n   * `['Vector']`; a namespace-qualified `pgvector.Vector(…)` yields\n   * `['pgvector', 'Vector']`. Empty when the call carries no identifier.\n   */\n  path(): readonly string[] {\n    const qualified = this.name();\n    const segments: string[] = [];\n    for (const segment of filterChildren(qualified?.syntax ?? this.syntax, IdentifierAst.cast)) {\n      const text = segment.token()?.text;\n      if (text !== undefined) segments.push(text);\n    }\n    return segments;\n  }\n\n  lparen(): Token | undefined {\n    return findChildToken(this.syntax, 'LParen');\n  }\n\n  rparen(): Token | undefined {\n    return findChildToken(this.syntax, 'RParen');\n  }\n\n  *args(): Iterable<AttributeArgAst> {\n    yield* filterChildren(this.syntax, AttributeArgAst.cast);\n  }\n\n  static cast(node: SyntaxNode): FunctionCallAst | undefined {\n    return node.kind === 'FunctionCall' ? new FunctionCallAst(node) : undefined;\n  }\n}\n\nexport class ArrayLiteralAst implements AstNode {\n  readonly syntax: SyntaxNode;\n\n  constructor(syntax: SyntaxNode) {\n    this.syntax = syntax;\n  }\n\n  lbracket(): Token | undefined {\n    return findChildToken(this.syntax, 'LBracket');\n  }\n\n  rbracket(): Token | undefined {\n    return findChildToken(this.syntax, 'RBracket');\n  }\n\n  *elements(): Iterable<ExpressionAst> {\n    yield* filterChildren(this.syntax, castExpression);\n  }\n\n  static cast(node: SyntaxNode): ArrayLiteralAst | undefined {\n    return node.kind === 'ArrayLiteral' ? new ArrayLiteralAst(node) : undefined;\n  }\n}\n\nconst HEX = /^[0-9a-fA-F]+$/;\n\nfunction decodeFixedHex(raw: string, start: number, width: number): string | undefined {\n  if (start + width > raw.length) return undefined;\n  const hex = raw.slice(start, start + width);\n  if (!HEX.test(hex)) return undefined;\n  return String.fromCharCode(Number.parseInt(hex, 16));\n}\n\nfunction decodeStringLiteral(raw: string): string {\n  let out = '';\n  let i = 0;\n  while (i < raw.length) {\n    const ch = raw.charAt(i);\n    if (ch !== '\\\\' || i + 1 >= raw.length) {\n      out += ch;\n      i++;\n      continue;\n    }\n    const next = raw.charAt(i + 1);\n    switch (next) {\n      case 'n':\n        out += '\\n';\n        i += 2;\n        continue;\n      case 'r':\n        out += '\\r';\n        i += 2;\n        continue;\n      case 't':\n        out += '\\t';\n        i += 2;\n        continue;\n      case '\"':\n        out += '\"';\n        i += 2;\n        continue;\n      case \"'\":\n        out += \"'\";\n        i += 2;\n        continue;\n      case '\\\\':\n        out += '\\\\';\n        i += 2;\n        continue;\n      case 'x': {\n        const decoded = decodeFixedHex(raw, i + 2, 2);\n        if (decoded === undefined) {\n          out += '\\\\x';\n          i += 2;\n          continue;\n        }\n        out += decoded;\n        i += 4;\n        continue;\n      }\n      case 'u': {\n        const decoded = decodeFixedHex(raw, i + 2, 4);\n        if (decoded === undefined) {\n          out += '\\\\u';\n          i += 2;\n          continue;\n        }\n        out += decoded;\n        i += 6;\n        continue;\n      }\n      default:\n        out += `\\\\${next}`;\n        i += 2;\n        continue;\n    }\n  }\n  return out;\n}\n\nexport class StringLiteralExprAst implements AstNode {\n  readonly syntax: SyntaxNode;\n\n  constructor(syntax: SyntaxNode) {\n    this.syntax = syntax;\n  }\n\n  token(): Token | undefined {\n    return findChildToken(this.syntax, 'StringLiteral');\n  }\n\n  value(): string | undefined {\n    const tok = this.token();\n    if (!tok) return undefined;\n    return decodeStringLiteral(tok.text.slice(1, -1));\n  }\n\n  static cast(node: SyntaxNode): StringLiteralExprAst | undefined {\n    return node.kind === 'StringLiteralExpr' ? new StringLiteralExprAst(node) : undefined;\n  }\n}\n\nexport class NumberLiteralExprAst implements AstNode {\n  readonly syntax: SyntaxNode;\n\n  constructor(syntax: SyntaxNode) {\n    this.syntax = syntax;\n  }\n\n  token(): Token | undefined {\n    return findChildToken(this.syntax, 'NumberLiteral');\n  }\n\n  value(): number | undefined {\n    const tok = this.token();\n    if (!tok) return undefined;\n    return Number(tok.text);\n  }\n\n  static cast(node: SyntaxNode): NumberLiteralExprAst | undefined {\n    return node.kind === 'NumberLiteralExpr' ? new NumberLiteralExprAst(node) : undefined;\n  }\n}\n\nexport class BooleanLiteralExprAst implements AstNode {\n  readonly syntax: SyntaxNode;\n\n  constructor(syntax: SyntaxNode) {\n    this.syntax = syntax;\n  }\n\n  token(): Token | undefined {\n    return findChildToken(this.syntax, 'Ident');\n  }\n\n  value(): boolean | undefined {\n    const tok = this.token();\n    if (!tok) return undefined;\n    if (tok.text === 'true') return true;\n    if (tok.text === 'false') return false;\n    return undefined;\n  }\n\n  static cast(node: SyntaxNode): BooleanLiteralExprAst | undefined {\n    return node.kind === 'BooleanLiteralExpr' ? new BooleanLiteralExprAst(node) : undefined;\n  }\n}\n\nexport class ObjectLiteralExprAst implements AstNode {\n  readonly syntax: SyntaxNode;\n\n  constructor(syntax: SyntaxNode) {\n    this.syntax = syntax;\n  }\n\n  lbrace(): Token | undefined {\n    return findChildToken(this.syntax, 'LBrace');\n  }\n\n  rbrace(): Token | undefined {\n    return findChildToken(this.syntax, 'RBrace');\n  }\n\n  *fields(): Iterable<ObjectFieldAst> {\n    yield* filterChildren(this.syntax, ObjectFieldAst.cast);\n  }\n\n  static cast(node: SyntaxNode): ObjectLiteralExprAst | undefined {\n    return node.kind === 'ObjectLiteralExpr' ? new ObjectLiteralExprAst(node) : undefined;\n  }\n}\n\nexport class ObjectFieldAst implements AstNode {\n  readonly syntax: SyntaxNode;\n\n  constructor(syntax: SyntaxNode) {\n    this.syntax = syntax;\n  }\n\n  key(): IdentifierAst | undefined {\n    for (const child of this.syntax.children()) {\n      if (!(child instanceof SyntaxNode)) {\n        if (child.kind === 'Colon') break;\n        continue;\n      }\n      return IdentifierAst.cast(child);\n    }\n    return undefined;\n  }\n\n  /**\n   * The field's logical key name, unquoted. An identifier key (`length:`) yields\n   * its text; a string-literal key (`\"length\":`) yields the decoded string.\n   * `undefined` when the field carries no key node.\n   */\n  keyName(): string | undefined {\n    for (const child of this.syntax.children()) {\n      if (!(child instanceof SyntaxNode)) {\n        if (child.kind === 'Colon') break;\n        continue;\n      }\n      const identifier = IdentifierAst.cast(child);\n      if (identifier) return identifier.token()?.text;\n      const stringKey = StringLiteralExprAst.cast(child);\n      if (stringKey) return stringKey.value();\n      return undefined;\n    }\n    return undefined;\n  }\n\n  colon(): Token | undefined {\n    return findChildToken(this.syntax, 'Colon');\n  }\n\n  value(): ExpressionAst | undefined {\n    if (this.colon()) {\n      let pastColon = false;\n      for (const child of this.syntax.children()) {\n        if (!(child instanceof SyntaxNode)) {\n          if (child.kind === 'Colon') pastColon = true;\n          continue;\n        }\n        if (pastColon) {\n          const expr = castExpression(child);\n          if (expr) return expr;\n        }\n      }\n      return undefined;\n    }\n    return findFirstChild(this.syntax, castExpression);\n  }\n\n  static cast(node: SyntaxNode): ObjectFieldAst | undefined {\n    return node.kind === 'ObjectField' ? new ObjectFieldAst(node) : undefined;\n  }\n}\n\nexport type ExpressionAst =\n  | FunctionCallAst\n  | ArrayLiteralAst\n  | StringLiteralExprAst\n  | NumberLiteralExprAst\n  | BooleanLiteralExprAst\n  | ObjectLiteralExprAst\n  | IdentifierAst;\n\nexport function castExpression(node: SyntaxNode): ExpressionAst | undefined {\n  return (\n    FunctionCallAst.cast(node) ??\n    ArrayLiteralAst.cast(node) ??\n    StringLiteralExprAst.cast(node) ??\n    NumberLiteralExprAst.cast(node) ??\n    BooleanLiteralExprAst.cast(node) ??\n    ObjectLiteralExprAst.cast(node) ??\n    IdentifierAst.cast(node)\n  );\n}\n\nexport class AttributeArgAst implements AstNode {\n  readonly syntax: SyntaxNode;\n\n  constructor(syntax: SyntaxNode) {\n    this.syntax = syntax;\n  }\n\n  name(): IdentifierAst | undefined {\n    if (!this.colon()) return undefined;\n    return findFirstChild(this.syntax, IdentifierAst.cast);\n  }\n\n  colon(): Token | undefined {\n    return findChildToken(this.syntax, 'Colon');\n  }\n\n  value(): ExpressionAst | undefined {\n    if (this.colon()) {\n      let pastColon = false;\n      for (const child of this.syntax.children()) {\n        if (!(child instanceof SyntaxNode)) {\n          if (child.kind === 'Colon') pastColon = true;\n          continue;\n        }\n        if (pastColon) {\n          const expr = castExpression(child);\n          if (expr) return expr;\n        }\n      }\n      return undefined;\n    }\n    return findFirstChild(this.syntax, castExpression);\n  }\n\n  static cast(node: SyntaxNode): AttributeArgAst | undefined {\n    return node.kind === 'AttributeArg' ? new AttributeArgAst(node) : undefined;\n  }\n}\n","import type { Token } from '../../tokenizer';\nimport type { AstNode } from '../ast-helpers';\nimport { filterChildren, findChildToken, findFirstChild } from '../ast-helpers';\nimport type { SyntaxNode } from '../red';\nimport { AttributeArgAst } from './expressions';\nimport { QualifiedNameAst } from './qualified-name';\n\nexport class AttributeArgListAst implements AstNode {\n  readonly syntax: SyntaxNode;\n\n  constructor(syntax: SyntaxNode) {\n    this.syntax = syntax;\n  }\n\n  lparen(): Token | undefined {\n    return findChildToken(this.syntax, 'LParen');\n  }\n\n  rparen(): Token | undefined {\n    return findChildToken(this.syntax, 'RParen');\n  }\n\n  *args(): Iterable<AttributeArgAst> {\n    yield* filterChildren(this.syntax, AttributeArgAst.cast);\n  }\n\n  static cast(node: SyntaxNode): AttributeArgListAst | undefined {\n    return node.kind === 'AttributeArgList' ? new AttributeArgListAst(node) : undefined;\n  }\n}\n\nexport class FieldAttributeAst implements AstNode {\n  readonly syntax: SyntaxNode;\n\n  constructor(syntax: SyntaxNode) {\n    this.syntax = syntax;\n  }\n\n  at(): Token | undefined {\n    return findChildToken(this.syntax, 'At');\n  }\n\n  name(): QualifiedNameAst | undefined {\n    return findFirstChild(this.syntax, QualifiedNameAst.cast);\n  }\n\n  argList(): AttributeArgListAst | undefined {\n    return findFirstChild(this.syntax, AttributeArgListAst.cast);\n  }\n\n  static cast(node: SyntaxNode): FieldAttributeAst | undefined {\n    return node.kind === 'FieldAttribute' ? new FieldAttributeAst(node) : undefined;\n  }\n}\n\nexport class ModelAttributeAst implements AstNode {\n  readonly syntax: SyntaxNode;\n\n  constructor(syntax: SyntaxNode) {\n    this.syntax = syntax;\n  }\n\n  doubleAt(): Token | undefined {\n    return findChildToken(this.syntax, 'DoubleAt');\n  }\n\n  name(): QualifiedNameAst | undefined {\n    return findFirstChild(this.syntax, QualifiedNameAst.cast);\n  }\n\n  argList(): AttributeArgListAst | undefined {\n    return findFirstChild(this.syntax, AttributeArgListAst.cast);\n  }\n\n  static cast(node: SyntaxNode): ModelAttributeAst | undefined {\n    return node.kind === 'ModelAttribute' ? new ModelAttributeAst(node) : undefined;\n  }\n}\n","import type { Token } from '../../tokenizer';\nimport type { AstNode } from '../ast-helpers';\nimport { findChildToken, findFirstChild } from '../ast-helpers';\nimport type { SyntaxNode } from '../red';\nimport { AttributeArgListAst } from './attributes';\nimport { QualifiedNameAst } from './qualified-name';\n\nexport class TypeAnnotationAst implements AstNode {\n  readonly syntax: SyntaxNode;\n\n  constructor(syntax: SyntaxNode) {\n    this.syntax = syntax;\n  }\n\n  /** The annotation's reference, doubling as the constructor callee when an {@link argList} follows. */\n  name(): QualifiedNameAst | undefined {\n    return findFirstChild(this.syntax, QualifiedNameAst.cast);\n  }\n\n  /** Present when the annotation is a constructor (`Vector(1536)`) rather than a plain reference. */\n  argList(): AttributeArgListAst | undefined {\n    return findFirstChild(this.syntax, AttributeArgListAst.cast);\n  }\n\n  isConstructor(): boolean {\n    return this.argList() !== undefined;\n  }\n\n  lbracket(): Token | undefined {\n    return findChildToken(this.syntax, 'LBracket');\n  }\n\n  rbracket(): Token | undefined {\n    return findChildToken(this.syntax, 'RBracket');\n  }\n\n  questionMark(): Token | undefined {\n    return findChildToken(this.syntax, 'Question');\n  }\n\n  isList(): boolean {\n    return this.lbracket() !== undefined;\n  }\n\n  isOptional(): boolean {\n    return this.questionMark() !== undefined;\n  }\n\n  static cast(node: SyntaxNode): TypeAnnotationAst | undefined {\n    return node.kind === 'TypeAnnotation' ? new TypeAnnotationAst(node) : undefined;\n  }\n}\n","import type { Token } from '../../tokenizer';\nimport type { AstNode } from '../ast-helpers';\nimport { filterChildren, findChildToken, findFirstChild } from '../ast-helpers';\nimport { SyntaxNode } from '../red';\nimport { FieldAttributeAst, ModelAttributeAst } from './attributes';\nimport type { ExpressionAst } from './expressions';\nimport { castExpression } from './expressions';\nimport { IdentifierAst } from './identifier';\nimport { TypeAnnotationAst } from './type-annotation';\n\n/**\n * What may appear inside a `namespace` block: models, composite types, and\n * extension (block) declarations. `types {}` blocks and nested `namespace`\n * blocks are document-only, so they are not namespace members.\n */\nexport type NamespaceMemberAst =\n  | ModelDeclarationAst\n  | CompositeTypeDeclarationAst\n  | GenericBlockDeclarationAst;\n\nfunction castNamespaceMember(node: SyntaxNode): NamespaceMemberAst | undefined {\n  return (\n    ModelDeclarationAst.cast(node) ??\n    CompositeTypeDeclarationAst.cast(node) ??\n    GenericBlockDeclarationAst.cast(node)\n  );\n}\n\nexport class DocumentAst implements AstNode {\n  readonly syntax: SyntaxNode;\n\n  constructor(syntax: SyntaxNode) {\n    this.syntax = syntax;\n  }\n\n  *declarations(): Iterable<NamespaceMemberAst | TypesBlockAst | NamespaceDeclarationAst> {\n    yield* filterChildren(\n      this.syntax,\n      (node) =>\n        castNamespaceMember(node) ?? TypesBlockAst.cast(node) ?? NamespaceDeclarationAst.cast(node),\n    );\n  }\n\n  static cast(node: SyntaxNode): DocumentAst | undefined {\n    return node.kind === 'Document' ? new DocumentAst(node) : undefined;\n  }\n}\n\nexport class ModelDeclarationAst implements AstNode {\n  readonly syntax: SyntaxNode;\n\n  constructor(syntax: SyntaxNode) {\n    this.syntax = syntax;\n  }\n\n  keyword(): Token | undefined {\n    return findChildToken(this.syntax, 'Ident');\n  }\n\n  name(): IdentifierAst | undefined {\n    return findFirstChild(this.syntax, IdentifierAst.cast);\n  }\n\n  lbrace(): Token | undefined {\n    return findChildToken(this.syntax, 'LBrace');\n  }\n\n  rbrace(): Token | undefined {\n    return findChildToken(this.syntax, 'RBrace');\n  }\n\n  *fields(): Iterable<FieldDeclarationAst> {\n    yield* filterChildren(this.syntax, FieldDeclarationAst.cast);\n  }\n\n  *attributes(): Iterable<ModelAttributeAst> {\n    yield* filterChildren(this.syntax, ModelAttributeAst.cast);\n  }\n\n  static cast(node: SyntaxNode): ModelDeclarationAst | undefined {\n    return node.kind === 'ModelDeclaration' ? new ModelDeclarationAst(node) : undefined;\n  }\n}\n\nexport class CompositeTypeDeclarationAst implements AstNode {\n  readonly syntax: SyntaxNode;\n\n  constructor(syntax: SyntaxNode) {\n    this.syntax = syntax;\n  }\n\n  keyword(): Token | undefined {\n    return findChildToken(this.syntax, 'Ident');\n  }\n\n  name(): IdentifierAst | undefined {\n    return findFirstChild(this.syntax, IdentifierAst.cast);\n  }\n\n  lbrace(): Token | undefined {\n    return findChildToken(this.syntax, 'LBrace');\n  }\n\n  rbrace(): Token | undefined {\n    return findChildToken(this.syntax, 'RBrace');\n  }\n\n  *fields(): Iterable<FieldDeclarationAst> {\n    yield* filterChildren(this.syntax, FieldDeclarationAst.cast);\n  }\n\n  *attributes(): Iterable<ModelAttributeAst> {\n    yield* filterChildren(this.syntax, ModelAttributeAst.cast);\n  }\n\n  static cast(node: SyntaxNode): CompositeTypeDeclarationAst | undefined {\n    return node.kind === 'CompositeTypeDeclaration'\n      ? new CompositeTypeDeclarationAst(node)\n      : undefined;\n  }\n}\n\nexport class NamespaceDeclarationAst implements AstNode {\n  readonly syntax: SyntaxNode;\n\n  constructor(syntax: SyntaxNode) {\n    this.syntax = syntax;\n  }\n\n  keyword(): Token | undefined {\n    return findChildToken(this.syntax, 'Ident');\n  }\n\n  name(): IdentifierAst | undefined {\n    return findFirstChild(this.syntax, IdentifierAst.cast);\n  }\n\n  lbrace(): Token | undefined {\n    return findChildToken(this.syntax, 'LBrace');\n  }\n\n  rbrace(): Token | undefined {\n    return findChildToken(this.syntax, 'RBrace');\n  }\n\n  *declarations(): Iterable<NamespaceMemberAst> {\n    yield* filterChildren(this.syntax, castNamespaceMember);\n  }\n\n  static cast(node: SyntaxNode): NamespaceDeclarationAst | undefined {\n    return node.kind === 'Namespace' ? new NamespaceDeclarationAst(node) : undefined;\n  }\n}\n\nexport class TypesBlockAst implements AstNode {\n  readonly syntax: SyntaxNode;\n\n  constructor(syntax: SyntaxNode) {\n    this.syntax = syntax;\n  }\n\n  keyword(): Token | undefined {\n    return findChildToken(this.syntax, 'Ident');\n  }\n\n  lbrace(): Token | undefined {\n    return findChildToken(this.syntax, 'LBrace');\n  }\n\n  rbrace(): Token | undefined {\n    return findChildToken(this.syntax, 'RBrace');\n  }\n\n  *declarations(): Iterable<NamedTypeDeclarationAst> {\n    yield* filterChildren(this.syntax, NamedTypeDeclarationAst.cast);\n  }\n\n  static cast(node: SyntaxNode): TypesBlockAst | undefined {\n    return node.kind === 'TypesBlock' ? new TypesBlockAst(node) : undefined;\n  }\n}\n\nexport class GenericBlockDeclarationAst implements AstNode {\n  readonly syntax: SyntaxNode;\n\n  constructor(syntax: SyntaxNode) {\n    this.syntax = syntax;\n  }\n\n  keyword(): Token | undefined {\n    return findChildToken(this.syntax, 'Ident');\n  }\n\n  name(): IdentifierAst | undefined {\n    return findFirstChild(this.syntax, IdentifierAst.cast);\n  }\n\n  lbrace(): Token | undefined {\n    return findChildToken(this.syntax, 'LBrace');\n  }\n\n  rbrace(): Token | undefined {\n    return findChildToken(this.syntax, 'RBrace');\n  }\n\n  *entries(): Iterable<KeyValuePairAst> {\n    yield* filterChildren(this.syntax, KeyValuePairAst.cast);\n  }\n\n  *attributes(): Iterable<ModelAttributeAst> {\n    yield* filterChildren(this.syntax, ModelAttributeAst.cast);\n  }\n\n  static cast(node: SyntaxNode): GenericBlockDeclarationAst | undefined {\n    return node.kind === 'GenericBlockDeclaration'\n      ? new GenericBlockDeclarationAst(node)\n      : undefined;\n  }\n}\n\nexport class KeyValuePairAst implements AstNode {\n  readonly syntax: SyntaxNode;\n\n  constructor(syntax: SyntaxNode) {\n    this.syntax = syntax;\n  }\n\n  key(): IdentifierAst | undefined {\n    return findFirstChild(this.syntax, IdentifierAst.cast);\n  }\n\n  equals(): Token | undefined {\n    return findChildToken(this.syntax, 'Equals');\n  }\n\n  value(): ExpressionAst | undefined {\n    let pastEquals = false;\n    for (const child of this.syntax.children()) {\n      if (!(child instanceof SyntaxNode)) {\n        if (child.kind === 'Equals') pastEquals = true;\n        continue;\n      }\n      if (pastEquals) {\n        const expr = castExpression(child);\n        if (expr) return expr;\n      }\n    }\n    return undefined;\n  }\n\n  static cast(node: SyntaxNode): KeyValuePairAst | undefined {\n    return node.kind === 'KeyValuePair' ? new KeyValuePairAst(node) : undefined;\n  }\n}\n\nexport class FieldDeclarationAst implements AstNode {\n  readonly syntax: SyntaxNode;\n\n  constructor(syntax: SyntaxNode) {\n    this.syntax = syntax;\n  }\n\n  name(): IdentifierAst | undefined {\n    return findFirstChild(this.syntax, IdentifierAst.cast);\n  }\n\n  typeAnnotation(): TypeAnnotationAst | undefined {\n    return findFirstChild(this.syntax, TypeAnnotationAst.cast);\n  }\n\n  *attributes(): Iterable<FieldAttributeAst> {\n    yield* filterChildren(this.syntax, FieldAttributeAst.cast);\n  }\n\n  static cast(node: SyntaxNode): FieldDeclarationAst | undefined {\n    return node.kind === 'FieldDeclaration' ? new FieldDeclarationAst(node) : undefined;\n  }\n}\n\nexport class NamedTypeDeclarationAst implements AstNode {\n  readonly syntax: SyntaxNode;\n\n  constructor(syntax: SyntaxNode) {\n    this.syntax = syntax;\n  }\n\n  name(): IdentifierAst | undefined {\n    return findFirstChild(this.syntax, IdentifierAst.cast);\n  }\n\n  equals(): Token | undefined {\n    return findChildToken(this.syntax, 'Equals');\n  }\n\n  typeAnnotation(): TypeAnnotationAst | undefined {\n    return findFirstChild(this.syntax, TypeAnnotationAst.cast);\n  }\n\n  *attributes(): Iterable<FieldAttributeAst> {\n    yield* filterChildren(this.syntax, FieldAttributeAst.cast);\n  }\n\n  static cast(node: SyntaxNode): NamedTypeDeclarationAst | undefined {\n    return node.kind === 'NamedTypeDeclaration' ? new NamedTypeDeclarationAst(node) : undefined;\n  }\n}\n"],"mappings":";AAeA,IAAa,aAAb,MAAa,WAAW;CACtB;CACA;CACA;CAEA,YAAY,OAAkB,QAAgB,QAAgC;EAC5E,KAAK,QAAQ;EACb,KAAK,SAAS;EACd,KAAK,SAAS;CAChB;CAEA,IAAI,OAAmB;EACrB,OAAO,KAAK,MAAM;CACpB;CAEA,IAAI,aAAqB;EACvB,OAAO,KAAK,MAAM;CACpB;CAEA,IAAI,aAAwC;EAC1C,OAAO,QAAQ,MAAM,CAAC;CACxB;CAEA,IAAI,YAAuC;EACzC,MAAM,MAAM,KAAK,MAAM,SAAS;EAChC,IAAI,QAAQ,GAAG,OAAO,KAAA;EACtB,OAAO,QAAQ,MAAM,MAAM,CAAC;CAC9B;CAEA,IAAI,cAAyC;EAC3C,IAAI,CAAC,KAAK,QAAQ,OAAO,KAAA;EACzB,MAAM,WAAW,KAAK,OAAO,MAAM;EACnC,IAAI,SAAS,KAAK,OAAO;EACzB,IAAI,QAAQ;EACZ,KAAK,MAAM,SAAS,UAAU;GAC5B,IAAI,OACF,OAAO,YAAY,OAAO,QAAQ,KAAK,MAAM;GAE/C,MAAM,WAAW,kBAAkB,KAAK;GACxC,IAAI,MAAM,SAAS,UAAU,WAAW,KAAK,UAAU,UAAU,KAAK,OACpE,QAAQ;GAEV,UAAU;EACZ;CAEF;CAEA,IAAI,cAAyC;EAC3C,IAAI,CAAC,KAAK,QAAQ,OAAO,KAAA;EACzB,MAAM,WAAW,KAAK,OAAO,MAAM;EACnC,IAAI,SAAS,KAAK,OAAO;EACzB,IAAI;EACJ,KAAK,MAAM,SAAS,UAAU;GAC5B,IAAI,MAAM,SAAS,UAAU,WAAW,KAAK,UAAU,UAAU,KAAK,OAAO;IAC3E,IAAI,CAAC,MAAM,OAAO,KAAA;IAClB,OAAO,YAAY,KAAK,OAAO,KAAK,QAAQ,KAAK,MAAM;GACzD;GACA,OAAO;IAAE,OAAO;IAAO;GAAO;GAC9B,UAAU,kBAAkB,KAAK;EACnC;CAEF;CAEA,CAAC,WAAoC;EACnC,IAAI,SAAS,KAAK;EAClB,KAAK,MAAM,SAAS,KAAK,MAAM,UAAU;GACvC,MAAM,YAAY,OAAO,QAAQ,IAAI;GACrC,UAAU,kBAAkB,KAAK;EACnC;CACF;CAEA,CAAC,aAAmC;EAClC,KAAK,MAAM,SAAS,KAAK,SAAS,GAChC,IAAI,iBAAiB,YAAY,MAAM;CAE3C;CAEA,CAAC,YAAkC;EACjC,IAAI,UAAkC,KAAK;EAC3C,OAAO,SAAS;GACd,MAAM;GACN,UAAU,QAAQ;EACpB;CACF;CAEA,CAAC,cAAuC;EACtC,MAAM,QAAyB,CAAC,IAAI;EACpC,KAAK,IAAI,KAAK,MAAM,IAAI,GAAG,OAAO,KAAA,GAAW,KAAK,MAAM,IAAI,GAAG;GAC7D,MAAM;GACN,IAAI,cAAc,YAAY;IAC5B,MAAM,WAAW,MAAM,KAAK,GAAG,SAAS,CAAC;IACzC,KAAK,IAAI,IAAI,SAAS,SAAS,GAAG,KAAK,GAAG,KAAK;KAC7C,MAAM,QAAQ,SAAS;KACvB,IAAI,UAAU,KAAA,GACZ,MAAM,KAAK,KAAK;IAEpB;GACF;EACF;CACF;CAEA,CAAC,SAAgC;EAC/B,KAAK,MAAM,MAAM,KAAK,YAAY,GAChC,IAAI,EAAE,cAAc,aAClB,MAAM;CAGZ;AACF;AAEA,SAAS,kBAAkB,IAA0B;CACnD,OAAO,GAAG,SAAS,UAAU,GAAG,KAAK,SAAS,GAAG;AACnD;AAEA,SAAS,YAAY,OAAqB,QAAgB,QAAmC;CAC3F,IAAI,MAAM,SAAS,SAEjB,OAAO;EADsB,MAAM,MAAM;EAAM,MAAM,MAAM;EAAM;CACtD;CAEb,OAAO,IAAI,WAAW,OAAO,QAAQ,MAAM;AAC7C;AAEA,SAAS,QAAQ,MAAkB,OAA0C;CAC3E,MAAM,WAAW,KAAK,MAAM;CAC5B,MAAM,SAAS,SAAS;CACxB,IAAI,WAAW,KAAA,GAAW,OAAO,KAAA;CACjC,IAAI,SAAS,KAAK;CAClB,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK;EAC9B,MAAM,QAAQ,SAAS;EACvB,IAAI,UAAU,KAAA,GACZ,UAAU,kBAAkB,KAAK;CAErC;CACA,OAAO,YAAY,QAAQ,QAAQ,IAAI;AACzC;AAEA,SAAgB,iBAAiB,OAA8B;CAC7D,OAAO,IAAI,WAAW,OAAO,GAAG,KAAA,CAAS;AAC3C;;;AClJA,SAAgB,eAAe,MAAkB,MAAoC;CACnF,KAAK,MAAM,SAAS,KAAK,SAAS,GAChC,IAAI,EAAE,iBAAiB,eAAe,MAAM,SAAS,MACnD,OAAO;AAIb;AAEA,SAAgB,eACd,MACA,MACe;CACf,KAAK,MAAM,SAAS,KAAK,WAAW,GAAG;EACrC,MAAM,SAAS,KAAK,KAAK;EACzB,IAAI,WAAW,KAAA,GAAW,OAAO;CACnC;AAEF;AAEA,UAAiB,eACf,MACA,MACa;CACb,KAAK,MAAM,SAAS,KAAK,WAAW,GAAG;EACrC,MAAM,SAAS,KAAK,KAAK;EACzB,IAAI,WAAW,KAAA,GAAW,MAAM;CAClC;AACF;;;;;AAMA,SAAgB,YAAY,MAA0B;CACpD,IAAI,OAAO;CACX,KAAK,MAAM,SAAS,KAAK,OAAO,GAC9B,QAAQ,MAAM;CAEhB,OAAO;AACT;;;AC1CA,IAAa,gBAAb,MAAa,cAAiC;CAC5C;CAEA,YAAY,QAAoB;EAC9B,KAAK,SAAS;CAChB;CAEA,QAA2B;EACzB,OAAO,eAAe,KAAK,QAAQ,OAAO;CAC5C;CAEA,OAA2B;EACzB,OAAO,KAAK,MAAM,CAAC,EAAE;CACvB;CAEA,OAAO,KAAK,MAA6C;EACvD,OAAO,KAAK,SAAS,eAAe,IAAI,cAAc,IAAI,IAAI,KAAA;CAChE;AACF;;;;AChBA,IAAa,mBAAb,MAAa,iBAAoC;CAC/C;CAEA,YAAY,QAAoB;EAC9B,KAAK,SAAS;CAChB;CAEA,eAA0C;EACxC,IAAI;EACJ,KAAK,MAAM,WAAW,eAAe,KAAK,QAAQ,cAAc,IAAI,GAClE,OAAO;EAET,OAAO;CACT;CAEA,sBAAiD;EAC/C,IAAI;EACJ,IAAI;EACJ,KAAK,MAAM,WAAW,eAAe,KAAK,QAAQ,cAAc,IAAI,GAAG;GACrE,cAAc;GACd,OAAO;EACT;EACA,OAAO;CACT;CAEA,gBAAgB,MAA+B;EAC7C,IAAI,QAAQ;EACZ,KAAK,MAAM,SAAS,KAAK,OAAO,SAAS,GACvC,IAAI,EAAE,iBAAiB,eAAe,MAAM,SAAS,MAAM;EAE7D,OAAO;CACT;CAEA,QAA2B;EACzB,OAAO,eAAe,KAAK,QAAQ,OAAO;CAC5C;CAEA,MAAyB;EACvB,OAAO,eAAe,KAAK,QAAQ,KAAK;CAC1C;CAEA,QAAmC;EACjC,IAAI,CAAC,KAAK,MAAM,GAAG,OAAO,KAAA;EAC1B,OAAO,eAAe,KAAK,QAAQ,cAAc,IAAI;CACvD;CAEA,YAAuC;EACrC,IAAI,CAAC,KAAK,IAAI,GAAG,OAAO,KAAA;EACxB,OAAO,KAAKA,oBAAoB;CAClC;CAEA,aAAwC;EACtC,OAAO,KAAKC,aAAa;CAC3B;;;;;CAMA,OAA0B;EACxB,MAAM,WAAqB,CAAC;EAC5B,KAAK,MAAM,WAAW,eAAe,KAAK,QAAQ,cAAc,IAAI,GAAG;GACrE,MAAM,OAAO,QAAQ,MAAM,CAAC,EAAE;GAC9B,IAAI,SAAS,KAAA,GAAW,SAAS,KAAK,IAAI;EAC5C;EACA,OAAO;CACT;;;;;CAMA,kBAA2B;EACzB,OAAO,KAAKC,gBAAgB,KAAK,IAAI,KAAK,KAAKA,gBAAgB,OAAO,IAAI;CAC5E;CAEA,OAAO,KAAK,MAAgD;EAC1D,OAAO,KAAK,SAAS,kBAAkB,IAAI,iBAAiB,IAAI,IAAI,KAAA;CACtE;AACF;;;AC/EA,IAAa,kBAAb,MAAa,gBAAmC;CAC9C;CAEA,YAAY,QAAoB;EAC9B,KAAK,SAAS;CAChB;;CAGA,OAAqC;EACnC,OAAO,eAAe,KAAK,QAAQ,iBAAiB,IAAI;CAC1D;;;;;;CAOA,OAA0B;EACxB,MAAM,YAAY,KAAK,KAAK;EAC5B,MAAM,WAAqB,CAAC;EAC5B,KAAK,MAAM,WAAW,eAAe,WAAW,UAAU,KAAK,QAAQ,cAAc,IAAI,GAAG;GAC1F,MAAM,OAAO,QAAQ,MAAM,CAAC,EAAE;GAC9B,IAAI,SAAS,KAAA,GAAW,SAAS,KAAK,IAAI;EAC5C;EACA,OAAO;CACT;CAEA,SAA4B;EAC1B,OAAO,eAAe,KAAK,QAAQ,QAAQ;CAC7C;CAEA,SAA4B;EAC1B,OAAO,eAAe,KAAK,QAAQ,QAAQ;CAC7C;CAEA,CAAC,OAAkC;EACjC,OAAO,eAAe,KAAK,QAAQ,gBAAgB,IAAI;CACzD;CAEA,OAAO,KAAK,MAA+C;EACzD,OAAO,KAAK,SAAS,iBAAiB,IAAI,gBAAgB,IAAI,IAAI,KAAA;CACpE;AACF;AAEA,IAAa,kBAAb,MAAa,gBAAmC;CAC9C;CAEA,YAAY,QAAoB;EAC9B,KAAK,SAAS;CAChB;CAEA,WAA8B;EAC5B,OAAO,eAAe,KAAK,QAAQ,UAAU;CAC/C;CAEA,WAA8B;EAC5B,OAAO,eAAe,KAAK,QAAQ,UAAU;CAC/C;CAEA,CAAC,WAAoC;EACnC,OAAO,eAAe,KAAK,QAAQ,cAAc;CACnD;CAEA,OAAO,KAAK,MAA+C;EACzD,OAAO,KAAK,SAAS,iBAAiB,IAAI,gBAAgB,IAAI,IAAI,KAAA;CACpE;AACF;AAEA,MAAM,MAAM;AAEZ,SAAS,eAAe,KAAa,OAAe,OAAmC;CACrF,IAAI,QAAQ,QAAQ,IAAI,QAAQ,OAAO,KAAA;CACvC,MAAM,MAAM,IAAI,MAAM,OAAO,QAAQ,KAAK;CAC1C,IAAI,CAAC,IAAI,KAAK,GAAG,GAAG,OAAO,KAAA;CAC3B,OAAO,OAAO,aAAa,OAAO,SAAS,KAAK,EAAE,CAAC;AACrD;AAEA,SAAS,oBAAoB,KAAqB;CAChD,IAAI,MAAM;CACV,IAAI,IAAI;CACR,OAAO,IAAI,IAAI,QAAQ;EACrB,MAAM,KAAK,IAAI,OAAO,CAAC;EACvB,IAAI,OAAO,QAAQ,IAAI,KAAK,IAAI,QAAQ;GACtC,OAAO;GACP;GACA;EACF;EACA,MAAM,OAAO,IAAI,OAAO,IAAI,CAAC;EAC7B,QAAQ,MAAR;GACE,KAAK;IACH,OAAO;IACP,KAAK;IACL;GACF,KAAK;IACH,OAAO;IACP,KAAK;IACL;GACF,KAAK;IACH,OAAO;IACP,KAAK;IACL;GACF,KAAK;IACH,OAAO;IACP,KAAK;IACL;GACF,KAAK;IACH,OAAO;IACP,KAAK;IACL;GACF,KAAK;IACH,OAAO;IACP,KAAK;IACL;GACF,KAAK,KAAK;IACR,MAAM,UAAU,eAAe,KAAK,IAAI,GAAG,CAAC;IAC5C,IAAI,YAAY,KAAA,GAAW;KACzB,OAAO;KACP,KAAK;KACL;IACF;IACA,OAAO;IACP,KAAK;IACL;GACF;GACA,KAAK,KAAK;IACR,MAAM,UAAU,eAAe,KAAK,IAAI,GAAG,CAAC;IAC5C,IAAI,YAAY,KAAA,GAAW;KACzB,OAAO;KACP,KAAK;KACL;IACF;IACA,OAAO;IACP,KAAK;IACL;GACF;GACA;IACE,OAAO,KAAK;IACZ,KAAK;IACL;EACJ;CACF;CACA,OAAO;AACT;AAEA,IAAa,uBAAb,MAAa,qBAAwC;CACnD;CAEA,YAAY,QAAoB;EAC9B,KAAK,SAAS;CAChB;CAEA,QAA2B;EACzB,OAAO,eAAe,KAAK,QAAQ,eAAe;CACpD;CAEA,QAA4B;EAC1B,MAAM,MAAM,KAAK,MAAM;EACvB,IAAI,CAAC,KAAK,OAAO,KAAA;EACjB,OAAO,oBAAoB,IAAI,KAAK,MAAM,GAAG,EAAE,CAAC;CAClD;CAEA,OAAO,KAAK,MAAoD;EAC9D,OAAO,KAAK,SAAS,sBAAsB,IAAI,qBAAqB,IAAI,IAAI,KAAA;CAC9E;AACF;AAEA,IAAa,uBAAb,MAAa,qBAAwC;CACnD;CAEA,YAAY,QAAoB;EAC9B,KAAK,SAAS;CAChB;CAEA,QAA2B;EACzB,OAAO,eAAe,KAAK,QAAQ,eAAe;CACpD;CAEA,QAA4B;EAC1B,MAAM,MAAM,KAAK,MAAM;EACvB,IAAI,CAAC,KAAK,OAAO,KAAA;EACjB,OAAO,OAAO,IAAI,IAAI;CACxB;CAEA,OAAO,KAAK,MAAoD;EAC9D,OAAO,KAAK,SAAS,sBAAsB,IAAI,qBAAqB,IAAI,IAAI,KAAA;CAC9E;AACF;AAEA,IAAa,wBAAb,MAAa,sBAAyC;CACpD;CAEA,YAAY,QAAoB;EAC9B,KAAK,SAAS;CAChB;CAEA,QAA2B;EACzB,OAAO,eAAe,KAAK,QAAQ,OAAO;CAC5C;CAEA,QAA6B;EAC3B,MAAM,MAAM,KAAK,MAAM;EACvB,IAAI,CAAC,KAAK,OAAO,KAAA;EACjB,IAAI,IAAI,SAAS,QAAQ,OAAO;EAChC,IAAI,IAAI,SAAS,SAAS,OAAO;CAEnC;CAEA,OAAO,KAAK,MAAqD;EAC/D,OAAO,KAAK,SAAS,uBAAuB,IAAI,sBAAsB,IAAI,IAAI,KAAA;CAChF;AACF;AAEA,IAAa,uBAAb,MAAa,qBAAwC;CACnD;CAEA,YAAY,QAAoB;EAC9B,KAAK,SAAS;CAChB;CAEA,SAA4B;EAC1B,OAAO,eAAe,KAAK,QAAQ,QAAQ;CAC7C;CAEA,SAA4B;EAC1B,OAAO,eAAe,KAAK,QAAQ,QAAQ;CAC7C;CAEA,CAAC,SAAmC;EAClC,OAAO,eAAe,KAAK,QAAQ,eAAe,IAAI;CACxD;CAEA,OAAO,KAAK,MAAoD;EAC9D,OAAO,KAAK,SAAS,sBAAsB,IAAI,qBAAqB,IAAI,IAAI,KAAA;CAC9E;AACF;AAEA,IAAa,iBAAb,MAAa,eAAkC;CAC7C;CAEA,YAAY,QAAoB;EAC9B,KAAK,SAAS;CAChB;CAEA,MAAiC;EAC/B,KAAK,MAAM,SAAS,KAAK,OAAO,SAAS,GAAG;GAC1C,IAAI,EAAE,iBAAiB,aAAa;IAClC,IAAI,MAAM,SAAS,SAAS;IAC5B;GACF;GACA,OAAO,cAAc,KAAK,KAAK;EACjC;CAEF;;;;;;CAOA,UAA8B;EAC5B,KAAK,MAAM,SAAS,KAAK,OAAO,SAAS,GAAG;GAC1C,IAAI,EAAE,iBAAiB,aAAa;IAClC,IAAI,MAAM,SAAS,SAAS;IAC5B;GACF;GACA,MAAM,aAAa,cAAc,KAAK,KAAK;GAC3C,IAAI,YAAY,OAAO,WAAW,MAAM,CAAC,EAAE;GAC3C,MAAM,YAAY,qBAAqB,KAAK,KAAK;GACjD,IAAI,WAAW,OAAO,UAAU,MAAM;GACtC;EACF;CAEF;CAEA,QAA2B;EACzB,OAAO,eAAe,KAAK,QAAQ,OAAO;CAC5C;CAEA,QAAmC;EACjC,IAAI,KAAK,MAAM,GAAG;GAChB,IAAI,YAAY;GAChB,KAAK,MAAM,SAAS,KAAK,OAAO,SAAS,GAAG;IAC1C,IAAI,EAAE,iBAAiB,aAAa;KAClC,IAAI,MAAM,SAAS,SAAS,YAAY;KACxC;IACF;IACA,IAAI,WAAW;KACb,MAAM,OAAO,eAAe,KAAK;KACjC,IAAI,MAAM,OAAO;IACnB;GACF;GACA;EACF;EACA,OAAO,eAAe,KAAK,QAAQ,cAAc;CACnD;CAEA,OAAO,KAAK,MAA8C;EACxD,OAAO,KAAK,SAAS,gBAAgB,IAAI,eAAe,IAAI,IAAI,KAAA;CAClE;AACF;AAWA,SAAgB,eAAe,MAA6C;CAC1E,OACE,gBAAgB,KAAK,IAAI,KACzB,gBAAgB,KAAK,IAAI,KACzB,qBAAqB,KAAK,IAAI,KAC9B,qBAAqB,KAAK,IAAI,KAC9B,sBAAsB,KAAK,IAAI,KAC/B,qBAAqB,KAAK,IAAI,KAC9B,cAAc,KAAK,IAAI;AAE3B;AAEA,IAAa,kBAAb,MAAa,gBAAmC;CAC9C;CAEA,YAAY,QAAoB;EAC9B,KAAK,SAAS;CAChB;CAEA,OAAkC;EAChC,IAAI,CAAC,KAAK,MAAM,GAAG,OAAO,KAAA;EAC1B,OAAO,eAAe,KAAK,QAAQ,cAAc,IAAI;CACvD;CAEA,QAA2B;EACzB,OAAO,eAAe,KAAK,QAAQ,OAAO;CAC5C;CAEA,QAAmC;EACjC,IAAI,KAAK,MAAM,GAAG;GAChB,IAAI,YAAY;GAChB,KAAK,MAAM,SAAS,KAAK,OAAO,SAAS,GAAG;IAC1C,IAAI,EAAE,iBAAiB,aAAa;KAClC,IAAI,MAAM,SAAS,SAAS,YAAY;KACxC;IACF;IACA,IAAI,WAAW;KACb,MAAM,OAAO,eAAe,KAAK;KACjC,IAAI,MAAM,OAAO;IACnB;GACF;GACA;EACF;EACA,OAAO,eAAe,KAAK,QAAQ,cAAc;CACnD;CAEA,OAAO,KAAK,MAA+C;EACzD,OAAO,KAAK,SAAS,iBAAiB,IAAI,gBAAgB,IAAI,IAAI,KAAA;CACpE;AACF;;;ACvWA,IAAa,sBAAb,MAAa,oBAAuC;CAClD;CAEA,YAAY,QAAoB;EAC9B,KAAK,SAAS;CAChB;CAEA,SAA4B;EAC1B,OAAO,eAAe,KAAK,QAAQ,QAAQ;CAC7C;CAEA,SAA4B;EAC1B,OAAO,eAAe,KAAK,QAAQ,QAAQ;CAC7C;CAEA,CAAC,OAAkC;EACjC,OAAO,eAAe,KAAK,QAAQ,gBAAgB,IAAI;CACzD;CAEA,OAAO,KAAK,MAAmD;EAC7D,OAAO,KAAK,SAAS,qBAAqB,IAAI,oBAAoB,IAAI,IAAI,KAAA;CAC5E;AACF;AAEA,IAAa,oBAAb,MAAa,kBAAqC;CAChD;CAEA,YAAY,QAAoB;EAC9B,KAAK,SAAS;CAChB;CAEA,KAAwB;EACtB,OAAO,eAAe,KAAK,QAAQ,IAAI;CACzC;CAEA,OAAqC;EACnC,OAAO,eAAe,KAAK,QAAQ,iBAAiB,IAAI;CAC1D;CAEA,UAA2C;EACzC,OAAO,eAAe,KAAK,QAAQ,oBAAoB,IAAI;CAC7D;CAEA,OAAO,KAAK,MAAiD;EAC3D,OAAO,KAAK,SAAS,mBAAmB,IAAI,kBAAkB,IAAI,IAAI,KAAA;CACxE;AACF;AAEA,IAAa,oBAAb,MAAa,kBAAqC;CAChD;CAEA,YAAY,QAAoB;EAC9B,KAAK,SAAS;CAChB;CAEA,WAA8B;EAC5B,OAAO,eAAe,KAAK,QAAQ,UAAU;CAC/C;CAEA,OAAqC;EACnC,OAAO,eAAe,KAAK,QAAQ,iBAAiB,IAAI;CAC1D;CAEA,UAA2C;EACzC,OAAO,eAAe,KAAK,QAAQ,oBAAoB,IAAI;CAC7D;CAEA,OAAO,KAAK,MAAiD;EAC3D,OAAO,KAAK,SAAS,mBAAmB,IAAI,kBAAkB,IAAI,IAAI,KAAA;CACxE;AACF;;;ACtEA,IAAa,oBAAb,MAAa,kBAAqC;CAChD;CAEA,YAAY,QAAoB;EAC9B,KAAK,SAAS;CAChB;;CAGA,OAAqC;EACnC,OAAO,eAAe,KAAK,QAAQ,iBAAiB,IAAI;CAC1D;;CAGA,UAA2C;EACzC,OAAO,eAAe,KAAK,QAAQ,oBAAoB,IAAI;CAC7D;CAEA,gBAAyB;EACvB,OAAO,KAAK,QAAQ,MAAM,KAAA;CAC5B;CAEA,WAA8B;EAC5B,OAAO,eAAe,KAAK,QAAQ,UAAU;CAC/C;CAEA,WAA8B;EAC5B,OAAO,eAAe,KAAK,QAAQ,UAAU;CAC/C;CAEA,eAAkC;EAChC,OAAO,eAAe,KAAK,QAAQ,UAAU;CAC/C;CAEA,SAAkB;EAChB,OAAO,KAAK,SAAS,MAAM,KAAA;CAC7B;CAEA,aAAsB;EACpB,OAAO,KAAK,aAAa,MAAM,KAAA;CACjC;CAEA,OAAO,KAAK,MAAiD;EAC3D,OAAO,KAAK,SAAS,mBAAmB,IAAI,kBAAkB,IAAI,IAAI,KAAA;CACxE;AACF;;;AC/BA,SAAS,oBAAoB,MAAkD;CAC7E,OACE,oBAAoB,KAAK,IAAI,KAC7B,4BAA4B,KAAK,IAAI,KACrC,2BAA2B,KAAK,IAAI;AAExC;AAEA,IAAa,cAAb,MAAa,YAA+B;CAC1C;CAEA,YAAY,QAAoB;EAC9B,KAAK,SAAS;CAChB;CAEA,CAAC,eAAuF;EACtF,OAAO,eACL,KAAK,SACJ,SACC,oBAAoB,IAAI,KAAK,cAAc,KAAK,IAAI,KAAK,wBAAwB,KAAK,IAAI,CAC9F;CACF;CAEA,OAAO,KAAK,MAA2C;EACrD,OAAO,KAAK,SAAS,aAAa,IAAI,YAAY,IAAI,IAAI,KAAA;CAC5D;AACF;AAEA,IAAa,sBAAb,MAAa,oBAAuC;CAClD;CAEA,YAAY,QAAoB;EAC9B,KAAK,SAAS;CAChB;CAEA,UAA6B;EAC3B,OAAO,eAAe,KAAK,QAAQ,OAAO;CAC5C;CAEA,OAAkC;EAChC,OAAO,eAAe,KAAK,QAAQ,cAAc,IAAI;CACvD;CAEA,SAA4B;EAC1B,OAAO,eAAe,KAAK,QAAQ,QAAQ;CAC7C;CAEA,SAA4B;EAC1B,OAAO,eAAe,KAAK,QAAQ,QAAQ;CAC7C;CAEA,CAAC,SAAwC;EACvC,OAAO,eAAe,KAAK,QAAQ,oBAAoB,IAAI;CAC7D;CAEA,CAAC,aAA0C;EACzC,OAAO,eAAe,KAAK,QAAQ,kBAAkB,IAAI;CAC3D;CAEA,OAAO,KAAK,MAAmD;EAC7D,OAAO,KAAK,SAAS,qBAAqB,IAAI,oBAAoB,IAAI,IAAI,KAAA;CAC5E;AACF;AAEA,IAAa,8BAAb,MAAa,4BAA+C;CAC1D;CAEA,YAAY,QAAoB;EAC9B,KAAK,SAAS;CAChB;CAEA,UAA6B;EAC3B,OAAO,eAAe,KAAK,QAAQ,OAAO;CAC5C;CAEA,OAAkC;EAChC,OAAO,eAAe,KAAK,QAAQ,cAAc,IAAI;CACvD;CAEA,SAA4B;EAC1B,OAAO,eAAe,KAAK,QAAQ,QAAQ;CAC7C;CAEA,SAA4B;EAC1B,OAAO,eAAe,KAAK,QAAQ,QAAQ;CAC7C;CAEA,CAAC,SAAwC;EACvC,OAAO,eAAe,KAAK,QAAQ,oBAAoB,IAAI;CAC7D;CAEA,CAAC,aAA0C;EACzC,OAAO,eAAe,KAAK,QAAQ,kBAAkB,IAAI;CAC3D;CAEA,OAAO,KAAK,MAA2D;EACrE,OAAO,KAAK,SAAS,6BACjB,IAAI,4BAA4B,IAAI,IACpC,KAAA;CACN;AACF;AAEA,IAAa,0BAAb,MAAa,wBAA2C;CACtD;CAEA,YAAY,QAAoB;EAC9B,KAAK,SAAS;CAChB;CAEA,UAA6B;EAC3B,OAAO,eAAe,KAAK,QAAQ,OAAO;CAC5C;CAEA,OAAkC;EAChC,OAAO,eAAe,KAAK,QAAQ,cAAc,IAAI;CACvD;CAEA,SAA4B;EAC1B,OAAO,eAAe,KAAK,QAAQ,QAAQ;CAC7C;CAEA,SAA4B;EAC1B,OAAO,eAAe,KAAK,QAAQ,QAAQ;CAC7C;CAEA,CAAC,eAA6C;EAC5C,OAAO,eAAe,KAAK,QAAQ,mBAAmB;CACxD;CAEA,OAAO,KAAK,MAAuD;EACjE,OAAO,KAAK,SAAS,cAAc,IAAI,wBAAwB,IAAI,IAAI,KAAA;CACzE;AACF;AAEA,IAAa,gBAAb,MAAa,cAAiC;CAC5C;CAEA,YAAY,QAAoB;EAC9B,KAAK,SAAS;CAChB;CAEA,UAA6B;EAC3B,OAAO,eAAe,KAAK,QAAQ,OAAO;CAC5C;CAEA,SAA4B;EAC1B,OAAO,eAAe,KAAK,QAAQ,QAAQ;CAC7C;CAEA,SAA4B;EAC1B,OAAO,eAAe,KAAK,QAAQ,QAAQ;CAC7C;CAEA,CAAC,eAAkD;EACjD,OAAO,eAAe,KAAK,QAAQ,wBAAwB,IAAI;CACjE;CAEA,OAAO,KAAK,MAA6C;EACvD,OAAO,KAAK,SAAS,eAAe,IAAI,cAAc,IAAI,IAAI,KAAA;CAChE;AACF;AAEA,IAAa,6BAAb,MAAa,2BAA8C;CACzD;CAEA,YAAY,QAAoB;EAC9B,KAAK,SAAS;CAChB;CAEA,UAA6B;EAC3B,OAAO,eAAe,KAAK,QAAQ,OAAO;CAC5C;CAEA,OAAkC;EAChC,OAAO,eAAe,KAAK,QAAQ,cAAc,IAAI;CACvD;CAEA,SAA4B;EAC1B,OAAO,eAAe,KAAK,QAAQ,QAAQ;CAC7C;CAEA,SAA4B;EAC1B,OAAO,eAAe,KAAK,QAAQ,QAAQ;CAC7C;CAEA,CAAC,UAAqC;EACpC,OAAO,eAAe,KAAK,QAAQ,gBAAgB,IAAI;CACzD;CAEA,CAAC,aAA0C;EACzC,OAAO,eAAe,KAAK,QAAQ,kBAAkB,IAAI;CAC3D;CAEA,OAAO,KAAK,MAA0D;EACpE,OAAO,KAAK,SAAS,4BACjB,IAAI,2BAA2B,IAAI,IACnC,KAAA;CACN;AACF;AAEA,IAAa,kBAAb,MAAa,gBAAmC;CAC9C;CAEA,YAAY,QAAoB;EAC9B,KAAK,SAAS;CAChB;CAEA,MAAiC;EAC/B,OAAO,eAAe,KAAK,QAAQ,cAAc,IAAI;CACvD;CAEA,SAA4B;EAC1B,OAAO,eAAe,KAAK,QAAQ,QAAQ;CAC7C;CAEA,QAAmC;EACjC,IAAI,aAAa;EACjB,KAAK,MAAM,SAAS,KAAK,OAAO,SAAS,GAAG;GAC1C,IAAI,EAAE,iBAAiB,aAAa;IAClC,IAAI,MAAM,SAAS,UAAU,aAAa;IAC1C;GACF;GACA,IAAI,YAAY;IACd,MAAM,OAAO,eAAe,KAAK;IACjC,IAAI,MAAM,OAAO;GACnB;EACF;CAEF;CAEA,OAAO,KAAK,MAA+C;EACzD,OAAO,KAAK,SAAS,iBAAiB,IAAI,gBAAgB,IAAI,IAAI,KAAA;CACpE;AACF;AAEA,IAAa,sBAAb,MAAa,oBAAuC;CAClD;CAEA,YAAY,QAAoB;EAC9B,KAAK,SAAS;CAChB;CAEA,OAAkC;EAChC,OAAO,eAAe,KAAK,QAAQ,cAAc,IAAI;CACvD;CAEA,iBAAgD;EAC9C,OAAO,eAAe,KAAK,QAAQ,kBAAkB,IAAI;CAC3D;CAEA,CAAC,aAA0C;EACzC,OAAO,eAAe,KAAK,QAAQ,kBAAkB,IAAI;CAC3D;CAEA,OAAO,KAAK,MAAmD;EAC7D,OAAO,KAAK,SAAS,qBAAqB,IAAI,oBAAoB,IAAI,IAAI,KAAA;CAC5E;AACF;AAEA,IAAa,0BAAb,MAAa,wBAA2C;CACtD;CAEA,YAAY,QAAoB;EAC9B,KAAK,SAAS;CAChB;CAEA,OAAkC;EAChC,OAAO,eAAe,KAAK,QAAQ,cAAc,IAAI;CACvD;CAEA,SAA4B;EAC1B,OAAO,eAAe,KAAK,QAAQ,QAAQ;CAC7C;CAEA,iBAAgD;EAC9C,OAAO,eAAe,KAAK,QAAQ,kBAAkB,IAAI;CAC3D;CAEA,CAAC,aAA0C;EACzC,OAAO,eAAe,KAAK,QAAQ,kBAAkB,IAAI;CAC3D;CAEA,OAAO,KAAK,MAAuD;EACjE,OAAO,KAAK,SAAS,yBAAyB,IAAI,wBAAwB,IAAI,IAAI,KAAA;CACpF;AACF"}