@dbml/parse 3.7.2 → 3.7.3

package/dist/dbml-parse.mjs

@@ -108,7 +108,7 @@ class v extends x {
     alias: i,
     attributeList: r,
     bodyColon: a,
-    body: l
+    body: c
   }, p) {
     if (super(p, "<element-declaration>", [
       e,
@@ -117,10 +117,10 @@ class v extends x {
       i,
       r,
       a,
-      l
-    ]), l && a && !(l instanceof w || l instanceof v))
+      c
+    ]), c && a && !(c instanceof y || c instanceof v))
       throw new Error("If an element has a simple body, it must be a function application node");
-    this.type = e, this.name = n, this.as = s, this.alias = i, this.attributeList = r, this.bodyColon = a, this.body = l;
+    this.type = e, this.name = n, this.as = s, this.alias = i, this.attributeList = r, this.bodyColon = a, this.body = c;
   }
 }
 class Y extends x {
@@ -161,7 +161,7 @@ class ne extends x {
     super(n, "<function-expression>", [e]), this.value = e;
   }
 }
-class w extends x {
+class y extends x {
   constructor({ callee: e, args: n = [] }, s) {
     super(s, "<function-application>", [e, ...n]), this.callee = e, this.args = n;
   }
@@ -175,7 +175,7 @@ class J extends x {
     super(i, "<block-expression>", [e, ...n, s]), this.blockOpenBrace = e, this.body = n, this.blockCloseBrace = s;
   }
 }
-class R extends x {
+class D extends x {
   constructor({
     listOpenBracket: e,
     elementList: n = [],
@@ -312,7 +312,7 @@ class S {
     return !0;
   }
 }
-class y {
+class k {
   // eslint-disable-next-line class-methods-use-this
   unwrap() {
     throw new Error("Trying to unwrap a None value");
@@ -323,11 +323,11 @@ class y {
   }
   // eslint-disable-next-line @typescript-eslint/no-unused-vars, class-methods-use-this
   and_then(e) {
-    return new y();
+    return new k();
   }
   // eslint-disable-next-line @typescript-eslint/no-unused-vars, class-methods-use-this
   map(e) {
-    return new y();
+    return new k();
   }
   // eslint-disable-next-line class-methods-use-this
   isOk() {
@@ -384,7 +384,7 @@ function ie(t) {
   return Object.values(T).includes(e) ? new S({
     name: n,
     kind: e
-  }) : new y();
+  }) : new k();
 }
 function Jt(t) {
   const e = ie(t).unwrap_or(void 0);
@@ -407,18 +407,18 @@ function Zt(t) {
 function Me(t) {
   return !!t.match(/(\p{L}|_|\p{M})/gu);
 }
-function De(t) {
+function Re(t) {
   const [e] = t;
   return e >= "0" && e <= "9";
 }
 function Kt(t) {
   const [e] = t;
-  return De(e) || Me(e) && e.toLowerCase() >= "a" && e.toLowerCase() <= "f";
+  return Re(e) || Me(e) && e.toLowerCase() >= "a" && e.toLowerCase() <= "f";
 }
 function Ee(t) {
-  return Me(t) || De(t);
+  return Me(t) || Re(t);
 }
-function ct(t, e) {
+function lt(t, e) {
   const n = [], s = Math.min(t.length, e.length);
   for (let i = 0; i < s; i += 1)
     n.push(t[i], e[i]);
@@ -474,9 +474,9 @@ class an {
   }
 }
 var o = /* @__PURE__ */ ((t) => (t[t.UNKNOWN_SYMBOL = 1e3] = "UNKNOWN_SYMBOL", t[t.UNEXPECTED_SYMBOL = 1001] = "UNEXPECTED_SYMBOL", t[t.UNEXPECTED_EOF = 1002] = "UNEXPECTED_EOF", t[t.UNEXPECTED_NEWLINE = 1003] = "UNEXPECTED_NEWLINE", t[t.UNKNOWN_TOKEN = 1004] = "UNKNOWN_TOKEN", t[t.UNEXPECTED_TOKEN = 1005] = "UNEXPECTED_TOKEN", t[t.UNEXPECTED_ELEMENT_DECLARATION = 1006] = "UNEXPECTED_ELEMENT_DECLARATION", t[t.MISSING_SPACES = 1007] = "MISSING_SPACES", t[t.UNKNOWN_PREFIX_OP = 1008] = "UNKNOWN_PREFIX_OP", t[t.INVALID_OPERAND = 1009] = "INVALID_OPERAND", t[t.EMPTY_ATTRIBUTE_NAME = 1010] = "EMPTY_ATTRIBUTE_NAME", t[t.INVALID_ESCAPE_SEQUENCE = 1011] = "INVALID_ESCAPE_SEQUENCE", t[t.INVALID_NAME = 3e3] = "INVALID_NAME", t[t.UNEXPECTED_NAME = 3001] = "UNEXPECTED_NAME", t[t.NAME_NOT_FOUND = 3002] = "NAME_NOT_FOUND", t[t.DUPLICATE_NAME = 3003] = "DUPLICATE_NAME", t[t.INVALID_ALIAS = 3004] = "INVALID_ALIAS", t[t.UNEXPECTED_ALIAS = 3005] = "UNEXPECTED_ALIAS", t[t.UNEXPECTED_SETTINGS = 3006] = "UNEXPECTED_SETTINGS", t[t.INVALID_SETTINGS = 3007] = "INVALID_SETTINGS", t[t.UNEXPECTED_SIMPLE_BODY = 3008] = "UNEXPECTED_SIMPLE_BODY", t[t.UNEXPECTED_COMPLEX_BODY = 3009] = "UNEXPECTED_COMPLEX_BODY", t[t.INVALID_TABLE_CONTEXT = 3010] = "INVALID_TABLE_CONTEXT", t[t.INVALID_TABLE_SETTING = 3011] = "INVALID_TABLE_SETTING", t[t.DUPLICATE_TABLE_SETTING = 3012] = "DUPLICATE_TABLE_SETTING", t[t.INVALID_TABLEGROUP_CONTEXT = 3013] = "INVALID_TABLEGROUP_CONTEXT", t[t.INVALID_TABLEGROUP_ELEMENT_NAME = 3014] = "INVALID_TABLEGROUP_ELEMENT_NAME", t[t.DUPLICATE_TABLEGROUP_ELEMENT_NAME = 3015] = "DUPLICATE_TABLEGROUP_ELEMENT_NAME", t[t.DUPLICATE_TABLEGROUP_FIELD_NAME = 3016] = "DUPLICATE_TABLEGROUP_FIELD_NAME", t[t.INVALID_TABLEGROUP_FIELD = 3017] = "INVALID_TABLEGROUP_FIELD", t[t.EMPTY_TABLE = 3018] = "EMPTY_TABLE", t[t.INVALID_COLUMN = 3019] = "INVALID_COLUMN", t[t.INVALID_COLUMN_NAME = 3020] = "INVALID_COLUMN_NAME", t[t.UNKNOWN_COLUMN_SETTING = 3021] = "UNKNOWN_COLUMN_SETTING", t[t.INVALID_COLUMN_TYPE = 3022] = "INVALID_COLUMN_TYPE", t[t.DUPLICATE_COLUMN_NAME = 3023] = "DUPLICATE_COLUMN_NAME", t[t.DUPLICATE_COLUMN_SETTING = 3024] = "DUPLICATE_COLUMN_SETTING", t[t.INVALID_COLUMN_SETTING_VALUE = 3025] = "INVALID_COLUMN_SETTING_VALUE", t[t.INVALID_ENUM_CONTEXT = 3026] = "INVALID_ENUM_CONTEXT", t[t.INVALID_ENUM_ELEMENT_NAME = 3027] = "INVALID_ENUM_ELEMENT_NAME", t[t.INVALID_ENUM_ELEMENT = 3028] = "INVALID_ENUM_ELEMENT", t[t.DUPLICATE_ENUM_ELEMENT_NAME = 3029] = "DUPLICATE_ENUM_ELEMENT_NAME", t[t.UNKNOWN_ENUM_ELEMENT_SETTING = 3030] = "UNKNOWN_ENUM_ELEMENT_SETTING", t[t.DUPLICATE_ENUM_ELEMENT_SETTING = 3031] = "DUPLICATE_ENUM_ELEMENT_SETTING", t[t.INVALID_ENUM_ELEMENT_SETTING = 3032] = "INVALID_ENUM_ELEMENT_SETTING", t[t.EMPTY_ENUM = 3033] = "EMPTY_ENUM", t[t.INVALID_REF_CONTEXT = 3034] = "INVALID_REF_CONTEXT", t[t.UNKNOWN_REF_SETTING = 3035] = "UNKNOWN_REF_SETTING", t[t.DUPLICATE_REF_SETTING = 3036] = "DUPLICATE_REF_SETTING", t[t.INVALID_REF_SETTING_VALUE = 3037] = "INVALID_REF_SETTING_VALUE", t[t.INVALID_REF_RELATIONSHIP = 3038] = "INVALID_REF_RELATIONSHIP", t[t.INVALID_REF_FIELD = 3039] = "INVALID_REF_FIELD", t[t.EMPTY_REF = 3040] = "EMPTY_REF", t[t.REF_REDEFINED = 3041] = "REF_REDEFINED", t[t.INVALID_NOTE_CONTEXT = 3042] = "INVALID_NOTE_CONTEXT", t[t.INVALID_NOTE = 3043] = "INVALID_NOTE", t[t.NOTE_REDEFINED = 3044] = "NOTE_REDEFINED", t[t.NOTE_CONTENT_REDEFINED = 3045] = "NOTE_CONTENT_REDEFINED", t[t.EMPTY_NOTE = 3046] = "EMPTY_NOTE", t[t.INVALID_INDEXES_CONTEXT = 3047] = "INVALID_INDEXES_CONTEXT", t[t.INVALID_INDEXES_FIELD = 3048] = "INVALID_INDEXES_FIELD", t[t.INVALID_INDEX = 3049] = "INVALID_INDEX", t[t.UNKNOWN_INDEX_SETTING = 3050] = "UNKNOWN_INDEX_SETTING", t[t.DUPLICATE_INDEX_SETTING = 3051] = "DUPLICATE_INDEX_SETTING", t[t.UNEXPECTED_INDEX_SETTING_VALUE = 3052] = "UNEXPECTED_INDEX_SETTING_VALUE", t[t.INVALID_INDEX_SETTING_VALUE = 3053] = "INVALID_INDEX_SETTING_VALUE", t[t.INVALID_PROJECT_CONTEXT = 3054] = "INVALID_PROJECT_CONTEXT", t[t.PROJECT_REDEFINED = 3055] = "PROJECT_REDEFINED", t[t.INVALID_PROJECT_FIELD = 3056] = "INVALID_PROJECT_FIELD", t[t.INVALID_CUSTOM_CONTEXT = 3057] = "INVALID_CUSTOM_CONTEXT", t[t.INVALID_CUSTOM_ELEMENT_VALUE = 3058] = "INVALID_CUSTOM_ELEMENT_VALUE", t[t.INVALID_ELEMENT_IN_SIMPLE_BODY = 3059] = "INVALID_ELEMENT_IN_SIMPLE_BODY", t[t.BINDING_ERROR = 4e3] = "BINDING_ERROR", t[t.UNSUPPORTED = 5e3] = "UNSUPPORTED", t[t.CIRCULAR_REF = 5001] = "CIRCULAR_REF", t[t.SAME_ENDPOINT = 5002] = "SAME_ENDPOINT", t[t.UNEQUAL_FIELDS_BINARY_REF = 5003] = "UNEQUAL_FIELDS_BINARY_REF", t[t.CONFLICTING_SETTING = 5004] = "CONFLICTING_SETTING", t[t.TABLE_REAPPEAR_IN_TABLEGROUP = 5005] = "TABLE_REAPPEAR_IN_TABLEGROUP", t))(o || {});
-class c extends Error {
+class l extends Error {
   constructor(e, n, s) {
-    super(n), this.code = e, this.diagnostic = n, this.nodeOrToken = s, this.start = s.start, this.end = s.end, this.name = this.constructor.name, Object.setPrototypeOf(this, c.prototype);
+    super(n), this.code = e, this.diagnostic = n, this.nodeOrToken = s, this.start = s.start, this.end = s.end, this.name = this.constructor.name, Object.setPrototypeOf(this, l.prototype);
   }
 }
 class V {
@@ -499,11 +499,11 @@ class V {
 }
 function on(t, e, n) {
   if (!t || !me(t) || e.length === 0)
-    return new y();
+    return new k();
   const s = [...e], i = Ge(t).unwrap(), r = s.pop();
   if (!(r instanceof J))
-    return new y();
-  const a = I.last(s) instanceof R ? s.pop() : void 0;
+    return new k();
+  const a = I.last(s) instanceof D ? s.pop() : void 0;
   return s.length === 3 && Ge(s[1]).unwrap().value === "as" ? new S(
     n.create(v, {
       type: i,
@@ -526,18 +526,18 @@ function on(t, e, n) {
       attributeList: a,
       body: r
     })
-  ) : new y();
+  ) : new k();
 }
-function lt(t) {
+function ct(t) {
   return t.kind === u.IDENTIFIER && t.value === "as";
 }
 function N(t) {
-  t && (t instanceof F ? cn(t) : ln(t));
+  t && (t instanceof F ? ln(t) : cn(t));
 }
-function cn(t) {
+function ln(t) {
   t.kind !== u.EOF && (t.isInvalid = !0);
 }
-function ln(t) {
+function cn(t) {
   if (t instanceof v)
     N(t.type), N(t.name), N(t.as), N(t.alias), N(t.bodyColon), N(t.attributeList), N(t.body);
   else if (t instanceof Y)
@@ -552,13 +552,13 @@ function ln(t) {
     N(t.op), N(t.expression);
   else if (t instanceof J)
     N(t.blockOpenBrace), t.body.forEach(N), N(t.blockCloseBrace);
-  else if (t instanceof R)
+  else if (t instanceof D)
     N(t.listOpenBracket), t.commaList.forEach(N), t.elementList.forEach(N), N(t.listCloseBracket);
   else if (t instanceof Z)
     N(t.tupleOpenParen), t.commaList.forEach(N), t.elementList.forEach(N), N(t.tupleCloseParen);
   else if (t instanceof H)
     N(t.callee), N(t.argumentList);
-  else if (t instanceof w)
+  else if (t instanceof y)
     N(t.callee), t.args.forEach(N);
   else if (t instanceof U)
     N(t.expression);
@@ -606,20 +606,20 @@ function un(t) {
     return P(t.expression, t.op);
   if (t instanceof ne)
     return P(t.value);
-  if (t instanceof w)
+  if (t instanceof y)
     return P(t.callee, ...t.args);
   if (t instanceof J)
     return P(t.blockOpenBrace, ...t.body, t.blockCloseBrace);
-  if (t instanceof R)
+  if (t instanceof D)
     return P(
       t.listOpenBracket,
-      ...ct(t.elementList, t.commaList),
+      ...lt(t.elementList, t.commaList),
       t.listCloseBracket
     );
   if (t instanceof Z)
     return P(
       t.tupleOpenParen,
-      ...ct(t.elementList, t.commaList),
+      ...lt(t.elementList, t.commaList),
       t.tupleCloseParen
     );
   if (t instanceof H)
@@ -634,7 +634,7 @@ function un(t) {
   throw t instanceof We ? new Error("This case is already handled by TupleExpressionNode") : new Error("Unreachable - no other possible cases");
 }
 function Ge(t) {
-  return M(t) ? new S(t.expression.variable) : new y();
+  return M(t) ? new S(t.expression.variable) : new k();
 }
 function $(t) {
   var e;
@@ -653,9 +653,9 @@ function Je(t) {
 }
 function Te(t) {
   if (t === void 0)
-    return new y();
+    return new k();
   const e = t.identifiers.map((n) => n.value).join(" ");
-  return e === "" ? new y() : new S(e);
+  return e === "" ? new k() : new S(e);
 }
 class hn {
   // list of errors during lexing
@@ -775,12 +775,12 @@ class hn {
             this.identifier();
             break;
           }
-          if (De(e)) {
+          if (Re(e)) {
             this.numericLiteralOrIdentifier();
             break;
           }
           this.addToken(u.OP, !0), this.errors.push(
-            new c(
+            new l(
               o.UNKNOWN_SYMBOL,
               `Unexpected token '${e}'`,
               this.createToken(u.OP, !0)
@@ -820,14 +820,14 @@ class hn {
     // Whether to interpret '\' as a backlash
     consumeStopSequence: a = !0
   }) {
-    let l = "";
+    let c = "";
     for (; !this.isAtEnd() && (s || !this.check(`
 `)) && !this.check(n); )
-      this.peek() === "\\" && !r ? (this.advance(), l += this.escapedString()) : l += this.advance();
+      this.peek() === "\\" && !r ? (this.advance(), c += this.escapedString()) : c += this.advance();
     if (this.isAtEnd() && !i) {
       const p = this.createToken(e, !0);
       this.tokens.push(p), this.errors.push(
-        new c(o.UNEXPECTED_EOF, "EOF reached while parsing", p)
+        new l(o.UNEXPECTED_EOF, "EOF reached while parsing", p)
       );
       return;
     }
@@ -835,7 +835,7 @@ class hn {
 `) && !s) {
       const p = this.createToken(e, !0);
       this.tokens.push(p), this.errors.push(
-        new c(
+        new l(
           o.UNEXPECTED_NEWLINE,
           "Invalid newline encountered while parsing",
           p
@@ -843,7 +843,7 @@ class hn {
       );
       return;
     }
-    a && this.match(n), this.tokens.push(F.create(e, this.start, this.current, l, !1));
+    a && this.match(n), this.tokens.push(F.create(e, this.start, this.current, c, !1));
   }
   singleLineStringLiteral() {
     this.consumeUntil(u.STRING_LITERAL, "'", {
@@ -912,7 +912,7 @@ class hn {
         return this.advance(), this.addToken(u.NUMERIC_LITERAL);
       if (!n && !Ee(this.peek()))
         return this.addToken(u.NUMERIC_LITERAL);
-      if (!n && !De(this.peek()))
+      if (!n && !Re(this.peek()))
         break;
       this.advance();
     }
@@ -920,7 +920,7 @@ class hn {
       for (; !this.isAtEnd() && (this.check(".") || Ee(this.peek())); )
         this.advance();
       const n = this.createToken(u.NUMERIC_LITERAL, !0);
-      this.tokens.push(n), this.errors.push(new c(o.UNKNOWN_TOKEN, "Invalid number", n));
+      this.tokens.push(n), this.errors.push(new l(o.UNKNOWN_TOKEN, "Invalid number", n));
     } else {
       for (; !this.isAtEnd() && Ee(this.peek()); )
         this.advance();
@@ -971,7 +971,7 @@ class hn {
         let n = "";
         for (let s = 0; s <= 3; s += 1) {
           if (this.isAtEnd() || !Ee(this.peek()))
-            return this.errors.push(new c(o.INVALID_ESCAPE_SEQUENCE, `Invalid unicode escape sequence '\\u${n}', only unicode escape sequences of the form '\\uHHHH' where H is a hexadecimal number are allowed`, F.create(u.STRING_LITERAL, e, this.current, `\\u${n}`, !0))), `\\u${n}`;
+            return this.errors.push(new l(o.INVALID_ESCAPE_SEQUENCE, `Invalid unicode escape sequence '\\u${n}', only unicode escape sequences of the form '\\uHHHH' where H is a hexadecimal number are allowed`, F.create(u.STRING_LITERAL, e, this.current, `\\u${n}`, !0))), `\\u${n}`;
           n += this.advance();
         }
         return String.fromCharCode(parseInt(n, 16));
@@ -1069,7 +1069,7 @@ class dn {
     }, this.synchronizeElementDeclarationName = () => {
       for (; !this.isAtEnd(); ) {
         const s = this.peek();
-        if (lt(s) || this.check(u.COLON, u.LBRACE, u.LBRACKET))
+        if (ct(s) || this.check(u.COLON, u.LBRACE, u.LBRACKET))
           break;
         N(s), this.advance();
       }
@@ -1172,7 +1172,7 @@ class dn {
         N(s), this.advance();
       }
     }, this.listExpression = this.contextStack.withContextDo(Se.ListExpression, () => {
-      const s = { elementList: [], commaList: [] }, i = () => this.nodeFactory.create(R, s);
+      const s = { elementList: [], commaList: [] }, i = () => this.nodeFactory.create(D, s);
       try {
         this.consume("Expect an opening bracket '['", u.LBRACKET), s.listOpenBracket = this.previous();
       } catch (r) {
@@ -1324,7 +1324,7 @@ class dn {
           throw new d(s.token, n(), s.handlerContext);
         this.synchronizeElementDeclarationName();
       }
-    if (lt(this.peek()))
+    if (ct(this.peek()))
       if (e.as = this.advance(), this.check(u.COLON, u.LBRACE, u.LBRACKET))
         this.logError(this.peek(), o.UNEXPECTED_TOKEN, "Expect an alias");
       else
@@ -1380,7 +1380,7 @@ class dn {
     }
     try {
       const s = this.expression();
-      s instanceof v ? this.errors.push(new c(o.INVALID_ELEMENT_IN_SIMPLE_BODY, "Simple body cannot be an element declaration", s)) : e.body = s;
+      s instanceof v ? this.errors.push(new l(o.INVALID_ELEMENT_IN_SIMPLE_BODY, "Simple body cannot be an element declaration", s)) : e.body = s;
     } catch (s) {
       throw s instanceof d ? (e.body = s.partialNode, new d(s.token, n(), s.handlerContext)) : s;
     }
@@ -1389,7 +1389,7 @@ class dn {
   /* Parsing any ExpressionNode, including non-NormalExpression */
   expression() {
     const e = { args: [] }, n = () => on(e.callee, e.args, this.nodeFactory).unwrap_or(
-      this.nodeFactory.create(w, e)
+      this.nodeFactory.create(y, e)
     );
     try {
       e.callee = this.normalExpression();
@@ -1476,12 +1476,12 @@ class dn {
               op: i,
               rightExpression: i.value === "." ? this.extractOperand() : this.expression_bp(a.right)
             });
-          } catch (l) {
-            throw l instanceof d ? (n = this.nodeFactory.create(q, {
+          } catch (c) {
+            throw c instanceof d ? (n = this.nodeFactory.create(q, {
               leftExpression: n,
               op: i,
-              rightExpression: l.partialNode
-            }), new d(l.token, n, l.handlerContext)) : l;
+              rightExpression: c.partialNode
+            }), new d(c.token, n, c.handlerContext)) : c;
           }
         }
       } else
@@ -1635,7 +1635,7 @@ class dn {
     return this.nodeFactory.create(Y, { identifiers: e });
   }
   logError(e, n, s) {
-    this.errors.push(new c(n, s, e));
+    this.errors.push(new l(n, s, e));
   }
 }
 const En = {
@@ -1688,36 +1688,36 @@ function ve(t) {
     case b.TableGroup:
       return new S(e);
     default:
-      return new y();
+      return new k();
   }
 }
 function pe(t) {
   if (!Je(t))
     return new S([t]);
   const e = pe(t.leftExpression).unwrap_or(void 0);
-  return e ? (e.push(t.rightExpression), new S(e)) : new y();
+  return e ? (e.push(t.rightExpression), new S(e)) : new k();
 }
 function W(t) {
   if (t === void 0)
-    return new y();
+    return new k();
   const e = pe(t).unwrap_or(void 0);
   if (!e)
-    return new y();
+    return new k();
   const n = [];
   for (const s of e) {
     const i = j(s).unwrap_or(void 0);
     if (!i)
-      return new y();
+      return new k();
     n.push(i);
   }
   return new S(n);
 }
 function _e(t) {
   if (t === void 0)
-    return new y();
+    return new k();
   const e = pe(t).unwrap_or(void 0);
   if (!e || e.length === 0)
-    return new y();
+    return new k();
   const n = [];
   let s;
   if (!M(I.last(e))) {
@@ -1727,12 +1727,12 @@ function _e(t) {
         (r) => C(r).unwrap()
       );
     else
-      return new y();
+      return new k();
   }
   for (const i of e) {
     const r = j(i).unwrap_or(void 0);
     if (!r)
-      return new y();
+      return new k();
     n.push(r);
   }
   return new S({
@@ -1741,7 +1741,7 @@ function _e(t) {
   });
 }
 function j(t) {
-  return M(t) ? new S(t.expression.variable.value) : new y();
+  return M(t) ? new S(t.expression.variable.value) : new k();
 }
 function Xe(t) {
   if (ht(t))
@@ -1752,15 +1752,15 @@ function Xe(t) {
     ), n = t.elementList.filter(M);
     return new S({ functional: e, nonFunctional: n });
   }
-  return new y();
+  return new k();
 }
 function C(t) {
   var n;
   const e = (n = t == null ? void 0 : t.expression.variable) == null ? void 0 : n.value;
-  return e === void 0 ? new y() : new S(e);
+  return e === void 0 ? new k() : new S(e);
 }
 function G(t) {
-  return $(t) ? t.expression instanceof K ? new S(t.expression.variable.value) : new S(t.expression.literal.value) : new y();
+  return $(t) ? t.expression instanceof K ? new S(t.expression.variable.value) : new S(t.expression.literal.value) : new k();
 }
 function In(t) {
   var e;
@@ -1777,13 +1777,13 @@ function ht(t) {
   return t instanceof U && t.expression instanceof K || t instanceof ne;
 }
 function gn(t, e) {
-  var i, r, a, l;
+  var i, r, a, c;
   let n = e;
   const s = Jt(t);
   for (; n; ) {
     if ((r = (i = n.symbol) == null ? void 0 : i.symbolTable) != null && r.has(t))
       return (a = n.symbol.symbolTable) == null ? void 0 : a.get(t);
-    if (((l = n.symbol) == null ? void 0 : l.declaration) instanceof X && s)
+    if (((c = n.symbol) == null ? void 0 : c.declaration) instanceof X && s)
       return n.symbol;
     if (n instanceof X)
       return;
@@ -1798,24 +1798,24 @@ class _n {
     return [...this.validateContext(), ...this.validateName(this.declarationNode.name), ...this.validateAlias(this.declarationNode.alias), ...this.validateSettingList(this.declarationNode.attributeList), ...this.validateBody(this.declarationNode.body)];
   }
   validateContext() {
-    return this.declarationNode.parent instanceof X || ve(this.declarationNode.parent).unwrap_or(void 0) !== b.Project ? [new c(o.INVALID_CUSTOM_CONTEXT, "A custom element can only appear in a Project", this.declarationNode)] : [];
+    return this.declarationNode.parent instanceof X || ve(this.declarationNode.parent).unwrap_or(void 0) !== b.Project ? [new l(o.INVALID_CUSTOM_CONTEXT, "A custom element can only appear in a Project", this.declarationNode)] : [];
   }
   validateName(e) {
-    return e ? [new c(o.UNEXPECTED_NAME, "A Custom element shouldn't have a name", e)] : [];
+    return e ? [new l(o.UNEXPECTED_NAME, "A Custom element shouldn't have a name", e)] : [];
   }
   validateAlias(e) {
-    return e ? [new c(o.UNEXPECTED_NAME, "A Custom element shouldn't have an alias", e)] : [];
+    return e ? [new l(o.UNEXPECTED_NAME, "A Custom element shouldn't have an alias", e)] : [];
   }
   validateSettingList(e) {
-    return e ? [new c(o.UNEXPECTED_SETTINGS, "A Custom element shouldn't have a setting list", e)] : [];
+    return e ? [new l(o.UNEXPECTED_SETTINGS, "A Custom element shouldn't have a setting list", e)] : [];
   }
   validateBody(e) {
     if (!e)
       return [];
     if (e instanceof J)
-      return [new c(o.UNEXPECTED_COMPLEX_BODY, "A Custom element can only have an inline field", e)];
+      return [new l(o.UNEXPECTED_COMPLEX_BODY, "A Custom element can only have an inline field", e)];
     const n = [];
-    return $(e.callee) || n.push(new c(o.INVALID_CUSTOM_ELEMENT_VALUE, "A Custom element value can only be a string", e)), e.args.length > 0 && n.push(...e.args.map((s) => new c(o.INVALID_CUSTOM_ELEMENT_VALUE, "A Custom element value can only be a string", s))), n;
+    return $(e.callee) || n.push(new l(o.INVALID_CUSTOM_ELEMENT_VALUE, "A Custom element value can only be a string", e)), e.args.length > 0 && n.push(...e.args.map((s) => new l(o.INVALID_CUSTOM_ELEMENT_VALUE, "A Custom element value can only be a string", s))), n;
   }
 }
 class we {
@@ -1843,41 +1843,41 @@ class An {
     return [...this.validateContext(), ...this.validateName(this.declarationNode.name), ...this.validateAlias(this.declarationNode.alias), ...this.validateSettingList(this.declarationNode.attributeList), ...this.registerElement(), ...this.validateBody(this.declarationNode.body)];
   }
   validateContext() {
-    return this.declarationNode.parent instanceof v ? [new c(o.INVALID_PROJECT_CONTEXT, "An Enum can only appear top-level", this.declarationNode)] : [];
+    return this.declarationNode.parent instanceof v ? [new l(o.INVALID_PROJECT_CONTEXT, "An Enum can only appear top-level", this.declarationNode)] : [];
   }
   validateName(e) {
-    return e ? yt(e) ? [] : [new c(o.INVALID_NAME, "An Enum name must be of the form <enum> or <schema>.<enum>", e)] : [new c(o.NAME_NOT_FOUND, "An Enum must have a name", this.declarationNode)];
+    return e ? yt(e) ? [] : [new l(o.INVALID_NAME, "An Enum name must be of the form <enum> or <schema>.<enum>", e)] : [new l(o.NAME_NOT_FOUND, "An Enum must have a name", this.declarationNode)];
   }
   validateAlias(e) {
-    return e ? [new c(o.UNEXPECTED_ALIAS, "A Ref shouldn't have an alias", e)] : [];
+    return e ? [new l(o.UNEXPECTED_ALIAS, "A Ref shouldn't have an alias", e)] : [];
   }
   registerElement() {
     const e = [];
     this.declarationNode.symbol = this.symbolFactory.create(tn, { declaration: this.declarationNode, symbolTable: new we() });
     const { name: n } = this.declarationNode, s = W(n);
     if (s.isOk()) {
-      const i = s.unwrap(), r = i.pop(), a = Ze(i, this.publicSymbolTable, this.symbolFactory), l = ze(r);
-      a.has(l) && e.push(new c(o.DUPLICATE_NAME, `Enum name ${r} already exists in schema '${i.join(".") || "public"}'`, n)), a.set(l, this.declarationNode.symbol);
+      const i = s.unwrap(), r = i.pop(), a = Ze(i, this.publicSymbolTable, this.symbolFactory), c = ze(r);
+      a.has(c) && e.push(new l(o.DUPLICATE_NAME, `Enum name ${r} already exists in schema '${i.join(".") || "public"}'`, n)), a.set(c, this.declarationNode.symbol);
     }
     return e;
   }
   validateSettingList(e) {
-    return e ? [new c(o.UNEXPECTED_SETTINGS, "An Enum shouldn't have a setting list", e)] : [];
+    return e ? [new l(o.UNEXPECTED_SETTINGS, "An Enum shouldn't have a setting list", e)] : [];
   }
   validateBody(e) {
     if (!e)
       return [];
-    if (e instanceof w)
+    if (e instanceof y)
       return this.validateFields([e]);
-    const [n, s] = I.partition(e.body, (i) => i instanceof w);
+    const [n, s] = I.partition(e.body, (i) => i instanceof y);
     return [...this.validateFields(n), ...this.validateSubElements(s)];
   }
   validateFields(e) {
-    return e.length === 0 ? [new c(o.EMPTY_ENUM, "An Enum must have at least one element", this.declarationNode)] : e.flatMap((n) => {
+    return e.length === 0 ? [new l(o.EMPTY_ENUM, "An Enum must have at least one element", this.declarationNode)] : e.flatMap((n) => {
       const s = [];
-      n.callee && !M(n.callee) && s.push(new c(o.INVALID_ENUM_ELEMENT_NAME, "An enum field must be an identifier or a quoted identifier", n.callee));
+      n.callee && !M(n.callee) && s.push(new l(o.INVALID_ENUM_ELEMENT_NAME, "An enum field must be an identifier or a quoted identifier", n.callee));
       const i = [...n.args];
-      return I.last(i) instanceof R ? (s.push(...this.validateFieldSettings(I.last(i))), i.pop()) : i[0] instanceof R && (s.push(...this.validateFieldSettings(i[0])), i.shift()), i.length > 0 && s.push(...i.map((r) => new c(o.INVALID_ENUM_ELEMENT, "An Enum must have only a field and optionally a setting list", r))), s.push(...this.registerField(n)), s;
+      return I.last(i) instanceof D ? (s.push(...this.validateFieldSettings(I.last(i))), i.pop()) : i[0] instanceof D && (s.push(...this.validateFieldSettings(i[0])), i.shift()), i.length > 0 && s.push(...i.map((r) => new l(o.INVALID_ENUM_ELEMENT, "An Enum must have only a field and optionally a setting list", r))), s.push(...this.registerField(n)), s;
     });
   }
   validateFieldSettings(e) {
@@ -1886,12 +1886,12 @@ class An {
       const a = i[r];
       switch (r) {
         case "note":
-          a.length > 1 && a.forEach((l) => s.push(new c(o.DUPLICATE_ENUM_ELEMENT_SETTING, "'note' can only appear once", l))), a.forEach((l) => {
-            $(l.value) || s.push(new c(o.INVALID_ENUM_ELEMENT_SETTING, "'note' must be a string", l));
+          a.length > 1 && a.forEach((c) => s.push(new l(o.DUPLICATE_ENUM_ELEMENT_SETTING, "'note' can only appear once", c))), a.forEach((c) => {
+            $(c.value) || s.push(new l(o.INVALID_ENUM_ELEMENT_SETTING, "'note' must be a string", c));
           });
           break;
         default:
-          a.forEach((l) => s.push(new c(o.UNKNOWN_ENUM_ELEMENT_SETTING, `Unknown enum field setting '${r}'`, l)));
+          a.forEach((c) => s.push(new l(o.UNKNOWN_ENUM_ELEMENT_SETTING, `Unknown enum field setting '${r}'`, c)));
       }
     }
     return s;
@@ -1912,8 +1912,8 @@ class An {
       if (r.has(s)) {
         const a = r.get(s);
         return [
-          new c(o.DUPLICATE_COLUMN_NAME, `Duplicate enum field ${n}`, e),
-          new c(o.DUPLICATE_COLUMN_NAME, `Duplicate enum field ${n}`, a.declaration)
+          new l(o.DUPLICATE_COLUMN_NAME, `Duplicate enum field ${n}`, e),
+          new l(o.DUPLICATE_COLUMN_NAME, `Duplicate enum field ${n}`, a.declaration)
         ];
       }
       r.set(s, i);
@@ -1929,23 +1929,23 @@ class vn {
     return [...this.validateContext(), ...this.validateName(this.declarationNode.name), ...this.validateAlias(this.declarationNode.alias), ...this.validateSettingList(this.declarationNode.attributeList), ...this.validateBody(this.declarationNode.body)];
   }
   validateContext() {
-    return this.declarationNode.parent instanceof X || ve(this.declarationNode.parent).unwrap_or(void 0) !== b.Table ? [new c(o.INVALID_NOTE_CONTEXT, "An Indexes can only appear inside a Table", this.declarationNode)] : [];
+    return this.declarationNode.parent instanceof X || ve(this.declarationNode.parent).unwrap_or(void 0) !== b.Table ? [new l(o.INVALID_NOTE_CONTEXT, "An Indexes can only appear inside a Table", this.declarationNode)] : [];
   }
   validateName(e) {
-    return e ? [new c(o.UNEXPECTED_NAME, "An Indexes shouldn't have a name", e)] : [];
+    return e ? [new l(o.UNEXPECTED_NAME, "An Indexes shouldn't have a name", e)] : [];
   }
   validateAlias(e) {
-    return e ? [new c(o.UNEXPECTED_ALIAS, "An Indexes shouldn't have an alias", e)] : [];
+    return e ? [new l(o.UNEXPECTED_ALIAS, "An Indexes shouldn't have an alias", e)] : [];
   }
   validateSettingList(e) {
-    return e ? [new c(o.UNEXPECTED_SETTINGS, "An Indexes shouldn't have a setting list", e)] : [];
+    return e ? [new l(o.UNEXPECTED_SETTINGS, "An Indexes shouldn't have a setting list", e)] : [];
   }
   validateBody(e) {
     if (!e)
       return [];
-    if (e instanceof w)
-      return [new c(o.UNEXPECTED_SIMPLE_BODY, "An Indexes must have a complex body", e)];
-    const [n, s] = I.partition(e.body, (i) => i instanceof w);
+    if (e instanceof y)
+      return [new l(o.UNEXPECTED_SIMPLE_BODY, "An Indexes must have a complex body", e)];
+    const [n, s] = I.partition(e.body, (i) => i instanceof y);
     return [...this.validateFields(n), ...this.validateSubElements(s)];
   }
   validateFields(e) {
@@ -1953,10 +1953,10 @@ class vn {
       if (!n.callee)
         return [];
       const s = [], i = [n.callee, ...n.args];
-      return I.last(i) instanceof R && s.push(...this.validateFieldSetting(i.pop())), i.forEach((r) => {
+      return I.last(i) instanceof D && s.push(...this.validateFieldSetting(i.pop())), i.forEach((r) => {
         for (; r instanceof H; )
-          r.argumentList && !Xe(r.argumentList).isOk() && s.push(new c(o.INVALID_INDEXES_FIELD, "An index field must be an identifier, a quoted identifier, a functional expression or a tuple of such", r.argumentList)), r = r.callee;
-        Xe(r).isOk() || s.push(new c(o.INVALID_INDEXES_FIELD, "An index field must be an identifier, a quoted identifier, a functional expression or a tuple of such", r));
+          r.argumentList && !Xe(r.argumentList).isOk() && s.push(new l(o.INVALID_INDEXES_FIELD, "An index field must be an identifier, a quoted identifier, a functional expression or a tuple of such", r.argumentList)), r = r.callee;
+        Xe(r).isOk() || s.push(new l(o.INVALID_INDEXES_FIELD, "An index field must be an identifier, a quoted identifier, a functional expression or a tuple of such", r));
       }), s;
     });
   }
@@ -1967,23 +1967,23 @@ class vn {
       switch (r) {
         case "note":
         case "name":
-          a.length > 1 && a.forEach((l) => s.push(new c(o.DUPLICATE_INDEX_SETTING, `'${r}' can only appear once`, l))), a.forEach((l) => {
-            $(l.value) || s.push(new c(o.INVALID_INDEX_SETTING_VALUE, `'${r}' must be a string`, l));
+          a.length > 1 && a.forEach((c) => s.push(new l(o.DUPLICATE_INDEX_SETTING, `'${r}' can only appear once`, c))), a.forEach((c) => {
+            $(c.value) || s.push(new l(o.INVALID_INDEX_SETTING_VALUE, `'${r}' must be a string`, c));
           });
           break;
         case "unique":
         case "pk":
-          a.length > 1 && a.forEach((l) => s.push(new c(o.DUPLICATE_INDEX_SETTING, `'${r}' can only appear once`, l))), a.forEach((l) => {
-            ue(l.value) || s.push(new c(o.INVALID_INDEX_SETTING_VALUE, `'${r}' must not have a value`, l));
+          a.length > 1 && a.forEach((c) => s.push(new l(o.DUPLICATE_INDEX_SETTING, `'${r}' can only appear once`, c))), a.forEach((c) => {
+            ue(c.value) || s.push(new l(o.INVALID_INDEX_SETTING_VALUE, `'${r}' must not have a value`, c));
           });
           break;
         case "type":
-          a.length > 1 && a.forEach((l) => s.push(new c(o.DUPLICATE_INDEX_SETTING, "'type' can only appear once", l))), a.forEach((l) => {
-            M(l.value) || s.push(new c(o.INVALID_INDEX_SETTING_VALUE, `'type' must be "btree" or "hash"`, l));
+          a.length > 1 && a.forEach((c) => s.push(new l(o.DUPLICATE_INDEX_SETTING, "'type' can only appear once", c))), a.forEach((c) => {
+            M(c.value) || s.push(new l(o.INVALID_INDEX_SETTING_VALUE, `'type' must be "btree" or "hash"`, c));
           });
           break;
         default:
-          a.forEach((l) => s.push(new c(o.UNKNOWN_INDEX_SETTING, `Unknown index setting '${r}'`, l)));
+          a.forEach((c) => s.push(new l(o.UNKNOWN_INDEX_SETTING, `Unknown index setting '${r}'`, c)));
       }
     }
     return s;
@@ -2015,7 +2015,7 @@ class wn {
       b.Table,
       b.TableGroup,
       b.Project
-    ].includes(ve(this.declarationNode.parent).unwrap_or(void 0)) ? [new c(
+    ].includes(ve(this.declarationNode.parent).unwrap_or(void 0)) ? [new l(
       o.INVALID_NOTE_CONTEXT,
       "A Note can only appear inside a Table, a Table Group or a Project. Sticky note can only appear at the global scope.",
       this.declarationNode
@@ -2023,32 +2023,32 @@ class wn {
   }
   validateName(e) {
     if (!(this.declarationNode.parent instanceof X))
-      return e ? [new c(o.UNEXPECTED_NAME, "A Note shouldn't have a name", e)] : [];
+      return e ? [new l(o.UNEXPECTED_NAME, "A Note shouldn't have a name", e)] : [];
     if (!e)
-      return [new c(o.INVALID_NAME, "Sticky note must have a name", this.declarationNode)];
+      return [new l(o.INVALID_NAME, "Sticky note must have a name", this.declarationNode)];
     const n = W(e);
     if (!n.isOk())
-      return [new c(o.INVALID_NAME, "Invalid name for sticky note ", this.declarationNode)];
+      return [new l(o.INVALID_NAME, "Invalid name for sticky note ", this.declarationNode)];
     const i = n.unwrap().join("."), r = Ht(i);
-    return this.publicSymbolTable.has(r) ? [new c(o.DUPLICATE_NAME, `Sticky note "${i}" has already been defined`, e)] : (this.publicSymbolTable.set(r, this.declarationNode.symbol), []);
+    return this.publicSymbolTable.has(r) ? [new l(o.DUPLICATE_NAME, `Sticky note "${i}" has already been defined`, e)] : (this.publicSymbolTable.set(r, this.declarationNode.symbol), []);
   }
   validateAlias(e) {
-    return e ? [new c(o.UNEXPECTED_ALIAS, "A Ref shouldn't have an alias", e)] : [];
+    return e ? [new l(o.UNEXPECTED_ALIAS, "A Ref shouldn't have an alias", e)] : [];
   }
   validateSettingList(e) {
-    return e ? [new c(o.UNEXPECTED_SETTINGS, "A Note shouldn't have a setting list", e)] : [];
+    return e ? [new l(o.UNEXPECTED_SETTINGS, "A Note shouldn't have a setting list", e)] : [];
   }
   validateBody(e) {
     if (!e)
       return [];
-    if (e instanceof w)
+    if (e instanceof y)
       return this.validateFields([e]);
-    const [n, s] = I.partition(e.body, (i) => i instanceof w);
+    const [n, s] = I.partition(e.body, (i) => i instanceof y);
     return [...this.validateFields(n), ...this.validateSubElements(s)];
   }
   validateFields(e) {
     const n = [];
-    return e.length === 0 ? [new c(o.EMPTY_NOTE, "A Note must have a content", this.declarationNode)] : (e.length > 1 && e.slice(1).forEach((s) => n.push(new c(o.NOTE_CONTENT_REDEFINED, "A Note can only contain one string", s))), $(e[0].callee) || n.push(new c(o.INVALID_NOTE, "A Note content must be a quoted string", e[0])), e[0].args.length > 0 && n.push(...e[0].args.map((s) => new c(o.INVALID_NOTE, "A Note can only contain one quoted string", s))), n);
+    return e.length === 0 ? [new l(o.EMPTY_NOTE, "A Note must have a content", this.declarationNode)] : (e.length > 1 && e.slice(1).forEach((s) => n.push(new l(o.NOTE_CONTENT_REDEFINED, "A Note can only contain one string", s))), $(e[0].callee) || n.push(new l(o.INVALID_NOTE, "A Note content must be a quoted string", e[0])), e[0].args.length > 0 && n.push(...e[0].args.map((s) => new l(o.INVALID_NOTE, "A Note can only contain one quoted string", s))), n);
   }
   validateSubElements(e) {
     return e.flatMap((n) => {
@@ -2067,25 +2067,25 @@ class yn {
     return [...this.validateContext(), ...this.validateName(this.declarationNode.name), ...this.validateAlias(this.declarationNode.alias), ...this.validateSettingList(this.declarationNode.attributeList), ...this.validateBody(this.declarationNode.body)];
   }
   validateContext() {
-    return this.declarationNode.parent instanceof v ? [new c(o.INVALID_PROJECT_CONTEXT, "A Project can only appear top-level", this.declarationNode)] : [];
+    return this.declarationNode.parent instanceof v ? [new l(o.INVALID_PROJECT_CONTEXT, "A Project can only appear top-level", this.declarationNode)] : [];
   }
   validateName(e) {
-    return e ? ye(e) ? [] : [new c(o.INVALID_NAME, "A Project's name is optional or must be an identifier or a quoted identifer", e)] : [];
+    return e ? ye(e) ? [] : [new l(o.INVALID_NAME, "A Project's name is optional or must be an identifier or a quoted identifer", e)] : [];
   }
   validateAlias(e) {
-    return e ? [new c(o.UNEXPECTED_ALIAS, "A Project shouldn't have an alias", e)] : [];
+    return e ? [new l(o.UNEXPECTED_ALIAS, "A Project shouldn't have an alias", e)] : [];
   }
   validateSettingList(e) {
-    return e ? [new c(o.UNEXPECTED_SETTINGS, "A Project shouldn't have a setting list", e)] : [];
+    return e ? [new l(o.UNEXPECTED_SETTINGS, "A Project shouldn't have a setting list", e)] : [];
   }
   validateBody(e) {
     if (!e)
       return [];
-    if (e instanceof w)
-      return [new c(o.UNEXPECTED_SIMPLE_BODY, "A Project's body must be a block", e)];
-    const [n, s] = I.partition(e.body, (i) => i instanceof w);
+    if (e instanceof y)
+      return [new l(o.UNEXPECTED_SIMPLE_BODY, "A Project's body must be a block", e)];
+    const [n, s] = I.partition(e.body, (i) => i instanceof y);
     return [
-      ...n.map((i) => new c(o.INVALID_PROJECT_FIELD, "A Project can not have inline fields", i)),
+      ...n.map((i) => new l(o.INVALID_PROJECT_FIELD, "A Project can not have inline fields", i)),
       ...this.validateSubElements(s)
     ];
   }
@@ -2106,33 +2106,33 @@ class kn {
     return [...this.validateContext(), ...this.validateName(this.declarationNode.name), ...this.validateAlias(this.declarationNode.alias), ...this.validateSettingList(this.declarationNode.attributeList), ...this.validateBody(this.declarationNode.body)];
   }
   validateContext() {
-    return this.declarationNode.parent instanceof X ? [] : [new c(o.INVALID_REF_CONTEXT, "A Ref must appear top-level", this.declarationNode)];
+    return this.declarationNode.parent instanceof X ? [] : [new l(o.INVALID_REF_CONTEXT, "A Ref must appear top-level", this.declarationNode)];
   }
   validateName(e) {
-    return e ? ye(e) ? [] : [new c(o.INVALID_NAME, "A Ref's name is optional or must be an identifier or a quoted identifer", e)] : [];
+    return e ? ye(e) ? [] : [new l(o.INVALID_NAME, "A Ref's name is optional or must be an identifier or a quoted identifer", e)] : [];
   }
   validateAlias(e) {
-    return e ? [new c(o.UNEXPECTED_ALIAS, "A Ref shouldn't have an alias", e)] : [];
+    return e ? [new l(o.UNEXPECTED_ALIAS, "A Ref shouldn't have an alias", e)] : [];
   }
   validateSettingList(e) {
-    return e ? [new c(o.UNEXPECTED_SETTINGS, "A Ref shouldn't have a setting list", e)] : [];
+    return e ? [new l(o.UNEXPECTED_SETTINGS, "A Ref shouldn't have a setting list", e)] : [];
   }
   validateBody(e) {
     if (!e)
       return [];
-    if (e instanceof w)
+    if (e instanceof y)
       return this.validateFields([e]);
-    const [n, s] = I.partition(e.body, (i) => i instanceof w);
+    const [n, s] = I.partition(e.body, (i) => i instanceof y);
     return [...this.validateFields(n), ...this.validateSubElements(s)];
   }
   validateFields(e) {
     if (e.length === 0)
-      return [new c(o.EMPTY_REF, "A Ref must have at least one field", this.declarationNode)];
+      return [new l(o.EMPTY_REF, "A Ref must have at least one field", this.declarationNode)];
     const n = [];
-    return e.length > 1 && n.push(...e.slice(1).map((s) => new c(o.REF_REDEFINED, "A Ref can only contain one binary relationship", s))), e.forEach((s) => {
-      s.callee && !In(s.callee) && n.push(new c(o.INVALID_REF_FIELD, "A Ref field must be a binary relationship", s.callee)), s.callee && !Ln(s.callee) && n.push(new c(o.UNEQUAL_FIELDS_BINARY_REF, "Unequal fields in ref endpoints", s.callee));
+    return e.length > 1 && n.push(...e.slice(1).map((s) => new l(o.REF_REDEFINED, "A Ref can only contain one binary relationship", s))), e.forEach((s) => {
+      s.callee && !In(s.callee) && n.push(new l(o.INVALID_REF_FIELD, "A Ref field must be a binary relationship", s.callee)), s.callee && !Ln(s.callee) && n.push(new l(o.UNEQUAL_FIELDS_BINARY_REF, "Unequal fields in ref endpoints", s.callee));
       const i = [...s.args];
-      I.last(i) instanceof R ? (this.validateFieldSettings(I.last(i)), i.pop()) : i[0] instanceof R && (n.push(...this.validateFieldSettings(i[0])), i.shift()), i.length > 0 && n.push(...i.map((r) => new c(o.INVALID_REF_FIELD, "A Ref field should only have a single binary relationship", r)));
+      I.last(i) instanceof D ? (this.validateFieldSettings(I.last(i)), i.pop()) : i[0] instanceof D && (n.push(...this.validateFieldSettings(i[0])), i.shift()), i.length > 0 && n.push(...i.map((r) => new l(o.INVALID_REF_FIELD, "A Ref field should only have a single binary relationship", r)));
     }), n;
   }
   validateFieldSettings(e) {
@@ -2142,12 +2142,12 @@ class kn {
       switch (r) {
         case "delete":
         case "update":
-          a.length > 1 && a.forEach((l) => s.push(new c(o.DUPLICATE_REF_SETTING, `'${r}' can only appear once`, l))), a.forEach((l) => {
-            xn(l.value) || s.push(new c(o.INVALID_REF_SETTING_VALUE, `'${r}' can only have values "cascade", "no action", "set null", "set default" or "restrict"`, l));
+          a.length > 1 && a.forEach((c) => s.push(new l(o.DUPLICATE_REF_SETTING, `'${r}' can only appear once`, c))), a.forEach((c) => {
+            xn(c.value) || s.push(new l(o.INVALID_REF_SETTING_VALUE, `'${r}' can only have values "cascade", "no action", "set null", "set default" or "restrict"`, c));
           });
           break;
         default:
-          a.forEach((l) => s.push(new c(o.UNKNOWN_REF_SETTING, `Unknown ref setting '${r}'`, l)));
+          a.forEach((c) => s.push(new l(o.UNKNOWN_REF_SETTING, `Unknown ref setting '${r}'`, c)));
       }
     }
     return s;
@@ -2186,13 +2186,13 @@ class Sn {
     return [...this.validateContext(), ...this.validateName(this.declarationNode.name), ...this.validateAlias(this.declarationNode.alias), ...this.validateSettingList(this.declarationNode.attributeList), ...this.registerElement(), ...this.validateBody(this.declarationNode.body)];
   }
   validateContext() {
-    return this.declarationNode.parent instanceof v ? [new c(o.INVALID_TABLE_CONTEXT, "Table must appear top-level", this.declarationNode)] : [];
+    return this.declarationNode.parent instanceof v ? [new l(o.INVALID_TABLE_CONTEXT, "Table must appear top-level", this.declarationNode)] : [];
   }
   validateName(e) {
-    return e ? e instanceof he ? [new c(o.INVALID_NAME, "Invalid array as Table name, maybe you forget to add a space between the name and the setting list?", e)] : yt(e) ? [] : [new c(o.INVALID_NAME, "A Table name must be of the form <table> or <schema>.<table>", e)] : [new c(o.NAME_NOT_FOUND, "A Table must have a name", this.declarationNode)];
+    return e ? e instanceof he ? [new l(o.INVALID_NAME, "Invalid array as Table name, maybe you forget to add a space between the name and the setting list?", e)] : yt(e) ? [] : [new l(o.INVALID_NAME, "A Table name must be of the form <table> or <schema>.<table>", e)] : [new l(o.NAME_NOT_FOUND, "A Table must have a name", this.declarationNode)];
   }
   validateAlias(e) {
-    return e ? Pn(e) ? [] : [new c(o.INVALID_ALIAS, "Table aliases can only contains alphanumeric and underscore unless surrounded by double quotes", e)] : [];
+    return e ? Pn(e) ? [] : [new l(o.INVALID_ALIAS, "Table aliases can only contains alphanumeric and underscore unless surrounded by double quotes", e)] : [];
   }
   validateSettingList(e) {
     const n = B(e), s = n.getErrors(), i = n.getValue();
@@ -2200,17 +2200,17 @@ class Sn {
       const a = i[r];
       switch (r) {
         case "headercolor":
-          a.length > 1 && s.push(...a.map((l) => new c(o.DUPLICATE_TABLE_SETTING, "'headercolor' can only appear once", l))), a.forEach((l) => {
-            Un(l.value) || s.push(new c(o.INVALID_TABLE_SETTING, "'headercolor' must be a color literal", l.value || l.name));
+          a.length > 1 && s.push(...a.map((c) => new l(o.DUPLICATE_TABLE_SETTING, "'headercolor' can only appear once", c))), a.forEach((c) => {
+            Un(c.value) || s.push(new l(o.INVALID_TABLE_SETTING, "'headercolor' must be a color literal", c.value || c.name));
           });
           break;
         case "note":
-          a.length > 1 && s.push(...a.map((l) => new c(o.DUPLICATE_TABLE_SETTING, "'note' can only appear once", l))), a.forEach((l) => {
-            $(l.value) || s.push(new c(o.INVALID_TABLE_SETTING, "'note' must be a string literal", l.value || l.name));
+          a.length > 1 && s.push(...a.map((c) => new l(o.DUPLICATE_TABLE_SETTING, "'note' can only appear once", c))), a.forEach((c) => {
+            $(c.value) || s.push(new l(o.INVALID_TABLE_SETTING, "'note' must be a string literal", c.value || c.name));
           });
           break;
         default:
-          s.push(...a.map((l) => new c(o.INVALID_TABLE_SETTING, `Unknown '${r}' setting`, l)));
+          s.push(...a.map((c) => new l(o.INVALID_TABLE_SETTING, `Unknown '${r}' setting`, c)));
       }
     }
     return s;
@@ -2220,29 +2220,29 @@ class Sn {
     this.declarationNode.symbol = this.symbolFactory.create(At, { declaration: this.declarationNode, symbolTable: new we() });
     const { name: n, alias: s } = this.declarationNode, i = W(n);
     if (i.isOk()) {
-      const r = [...i.unwrap()], a = r.pop(), l = Ze(r, this.publicSymbolTable, this.symbolFactory), p = Oe(a);
-      l.has(p) && e.push(new c(o.DUPLICATE_NAME, `Table name '${a}' already exists in schema '${r.join(".") || "public"}'`, n)), l.set(p, this.declarationNode.symbol);
+      const r = [...i.unwrap()], a = r.pop(), c = Ze(r, this.publicSymbolTable, this.symbolFactory), p = Oe(a);
+      c.has(p) && e.push(new l(o.DUPLICATE_NAME, `Table name '${a}' already exists in schema '${r.join(".") || "public"}'`, n)), c.set(p, this.declarationNode.symbol);
     }
-    if (s && ye(s) && !Dn(s.expression.variable.value, i.unwrap_or([]))) {
+    if (s && ye(s) && !Rn(s.expression.variable.value, i.unwrap_or([]))) {
       const r = C(s).unwrap(), a = Oe(r);
-      this.publicSymbolTable.has(a) && e.push(new c(o.DUPLICATE_NAME, `Table name '${r}' already exists`, n)), this.publicSymbolTable.set(a, this.declarationNode.symbol);
+      this.publicSymbolTable.has(a) && e.push(new l(o.DUPLICATE_NAME, `Table name '${r}' already exists`, n)), this.publicSymbolTable.set(a, this.declarationNode.symbol);
     }
     return e;
   }
   validateBody(e) {
     if (!e)
       return [];
-    if (e instanceof w)
-      return [new c(o.UNEXPECTED_SIMPLE_BODY, "A Table's body must be a block", e)];
-    const [n, s] = I.partition(e.body, (i) => i instanceof w);
+    if (e instanceof y)
+      return [new l(o.UNEXPECTED_SIMPLE_BODY, "A Table's body must be a block", e)];
+    const [n, s] = I.partition(e.body, (i) => i instanceof y);
     return [...this.validateFields(n), ...this.validateSubElements(s)];
   }
   validateFields(e) {
-    return e.length === 0 ? [new c(o.EMPTY_TABLE, "A Table must have at least one column", this.declarationNode)] : e.flatMap((n) => {
+    return e.length === 0 ? [new l(o.EMPTY_TABLE, "A Table must have at least one column", this.declarationNode)] : e.flatMap((n) => {
       if (!n.callee)
         return [];
       const s = [];
-      n.args.length === 0 && s.push(new c(o.INVALID_COLUMN, "A column must have a type", n.callee)), M(n.callee) || s.push(new c(o.INVALID_COLUMN_NAME, "A column name must be an identifier or a quoted identifier", n.callee)), n.args[0] && !On(n.args[0]) && s.push(new c(o.INVALID_COLUMN_TYPE, "Invalid column type", n.args[0]));
+      n.args.length === 0 && s.push(new l(o.INVALID_COLUMN, "A column must have a type", n.callee)), M(n.callee) || s.push(new l(o.INVALID_COLUMN_NAME, "A column name must be an identifier or a quoted identifier", n.callee)), n.args[0] && !On(n.args[0]) && s.push(new l(o.INVALID_COLUMN_TYPE, "Invalid column type", n.args[0]));
       const i = n.args.slice(1);
       return s.push(...this.validateFieldSetting(i)), s.push(...this.registerField(n)), s;
     });
@@ -2255,8 +2255,8 @@ class Sn {
       if (r.has(s)) {
         const a = r.get(s);
         return [
-          new c(o.DUPLICATE_COLUMN_NAME, `Duplicate column ${n}`, e),
-          new c(o.DUPLICATE_COLUMN_NAME, `Duplicate column ${n}`, a.declaration)
+          new l(o.DUPLICATE_COLUMN_NAME, `Duplicate column ${n}`, e),
+          new l(o.DUPLICATE_COLUMN_NAME, `Duplicate column ${n}`, a.declaration)
         ];
       }
       r.set(s, i);
@@ -2265,75 +2265,75 @@ class Sn {
   }
   // This is needed to support legacy inline settings
   validateFieldSetting(e) {
-    if (!e.slice(0, -1).every(me) || !e.slice(-1).every((p) => me(p) || p instanceof R))
-      return [...e.map((p) => new c(o.INVALID_COLUMN, "These fields must be some inline settings optionally ended with a setting list", p))];
+    if (!e.slice(0, -1).every(me) || !e.slice(-1).every((p) => me(p) || p instanceof D))
+      return [...e.map((p) => new l(o.INVALID_COLUMN, "These fields must be some inline settings optionally ended with a setting list", p))];
     if (e.length === 0)
       return [];
     let n;
-    I.last(e) instanceof R && (n = e.pop());
+    I.last(e) instanceof D && (n = e.pop());
     const s = B(n), i = s.getErrors(), r = s.getValue();
     for (const p of e) {
       const f = C(p).unwrap_or("").toLowerCase();
       if (f !== "pk" && f !== "unique") {
-        i.push(new c(o.INVALID_SETTINGS, "Inline column settings can only be `pk` or `unique`", p));
+        i.push(new l(o.INVALID_SETTINGS, "Inline column settings can only be `pk` or `unique`", p));
         continue;
       }
       r[f] === void 0 ? r[f] = [p] : r[f].push(p);
     }
-    const a = r.pk || [], l = r["primary key"] || [];
-    a.length >= 1 && l.length >= 1 && i.push(...[...a, ...l].map((p) => new c(o.DUPLICATE_COLUMN_SETTING, "Either one of 'primary key' and 'pk' can appear", p)));
+    const a = r.pk || [], c = r["primary key"] || [];
+    a.length >= 1 && c.length >= 1 && i.push(...[...a, ...c].map((p) => new l(o.DUPLICATE_COLUMN_SETTING, "Either one of 'primary key' and 'pk' can appear", p)));
     for (const p in r) {
       const f = r[p];
       switch (p) {
         case "note":
-          f.length > 1 && i.push(...f.map((h) => new c(o.DUPLICATE_COLUMN_SETTING, "note can only appear once", h))), f.forEach((h) => {
-            $(h.value) || i.push(new c(o.INVALID_COLUMN_SETTING_VALUE, "'note' must be a quoted string", h.value || h.name));
+          f.length > 1 && i.push(...f.map((h) => new l(o.DUPLICATE_COLUMN_SETTING, "note can only appear once", h))), f.forEach((h) => {
+            $(h.value) || i.push(new l(o.INVALID_COLUMN_SETTING_VALUE, "'note' must be a quoted string", h.value || h.name));
           });
           break;
         case "ref":
           f.forEach((h) => {
-            Fn(h.value) || i.push(new c(o.INVALID_COLUMN_SETTING_VALUE, "'ref' must be a valid unary relationship", h.value || h.name));
+            Fn(h.value) || i.push(new l(o.INVALID_COLUMN_SETTING_VALUE, "'ref' must be a valid unary relationship", h.value || h.name));
           });
           break;
         case "primary key":
-          f.length > 1 && i.push(...f.map((h) => new c(o.DUPLICATE_COLUMN_SETTING, "primary key can only appear once", h))), f.forEach((h) => {
-            ue(h.value) || i.push(new c(o.INVALID_COLUMN_SETTING_VALUE, "'primary key' must not have a value", h.value || h.name));
+          f.length > 1 && i.push(...f.map((h) => new l(o.DUPLICATE_COLUMN_SETTING, "primary key can only appear once", h))), f.forEach((h) => {
+            ue(h.value) || i.push(new l(o.INVALID_COLUMN_SETTING_VALUE, "'primary key' must not have a value", h.value || h.name));
           });
           break;
         case "pk":
-          f.length > 1 && i.push(...f.map((h) => new c(o.DUPLICATE_COLUMN_SETTING, "'pk' can only appear once", h))), f.forEach((h) => {
-            h instanceof se && !ue(h.value) && i.push(new c(o.INVALID_COLUMN_SETTING_VALUE, "'pk' must not have a value", h.value || h.name));
+          f.length > 1 && i.push(...f.map((h) => new l(o.DUPLICATE_COLUMN_SETTING, "'pk' can only appear once", h))), f.forEach((h) => {
+            h instanceof se && !ue(h.value) && i.push(new l(o.INVALID_COLUMN_SETTING_VALUE, "'pk' must not have a value", h.value || h.name));
           });
           break;
         case "not null":
-          f.length > 1 && i.push(...f.map((h) => new c(o.DUPLICATE_COLUMN_SETTING, "'not null' can only appear once", h)));
+          f.length > 1 && i.push(...f.map((h) => new l(o.DUPLICATE_COLUMN_SETTING, "'not null' can only appear once", h)));
           const E = r.null || [];
-          f.length >= 1 && E.length >= 1 && i.push(...[...f, ...E].map((h) => new c(o.CONFLICTING_SETTING, "'not null' and 'null' can not be set at the same time", h))), f.forEach((h) => {
-            ue(h.value) || i.push(new c(o.INVALID_COLUMN_SETTING_VALUE, "'not null' must not have a value", h.value || h.name));
+          f.length >= 1 && E.length >= 1 && i.push(...[...f, ...E].map((h) => new l(o.CONFLICTING_SETTING, "'not null' and 'null' can not be set at the same time", h))), f.forEach((h) => {
+            ue(h.value) || i.push(new l(o.INVALID_COLUMN_SETTING_VALUE, "'not null' must not have a value", h.value || h.name));
           });
           break;
         case "null":
-          f.length > 1 && i.push(...f.map((h) => new c(o.DUPLICATE_COLUMN_SETTING, "'null' can only appear once", h))), f.forEach((h) => {
-            ue(h.value) || i.push(new c(o.INVALID_COLUMN_SETTING_VALUE, "'null' must not have a value", h.value || h.name));
+          f.length > 1 && i.push(...f.map((h) => new l(o.DUPLICATE_COLUMN_SETTING, "'null' can only appear once", h))), f.forEach((h) => {
+            ue(h.value) || i.push(new l(o.INVALID_COLUMN_SETTING_VALUE, "'null' must not have a value", h.value || h.name));
           });
           break;
         case "unique":
-          f.length > 1 && i.push(...f.map((h) => new c(o.DUPLICATE_COLUMN_SETTING, "'unique' can only appear once", h))), f.forEach((h) => {
-            h instanceof se && !ue(h.value) && i.push(new c(o.INVALID_COLUMN_SETTING_VALUE, "'unique' must not have a value", h.value || h.name));
+          f.length > 1 && i.push(...f.map((h) => new l(o.DUPLICATE_COLUMN_SETTING, "'unique' can only appear once", h))), f.forEach((h) => {
+            h instanceof se && !ue(h.value) && i.push(new l(o.INVALID_COLUMN_SETTING_VALUE, "'unique' must not have a value", h.value || h.name));
           });
           break;
         case "increment":
-          f.length > 1 && i.push(...f.map((h) => new c(o.DUPLICATE_COLUMN_SETTING, "'increment' can only appear once", h))), f.forEach((h) => {
-            h instanceof se && !ue(h.value) && i.push(new c(o.INVALID_COLUMN_SETTING_VALUE, "'increment' must not have a value", h.value || h.name));
+          f.length > 1 && i.push(...f.map((h) => new l(o.DUPLICATE_COLUMN_SETTING, "'increment' can only appear once", h))), f.forEach((h) => {
+            h instanceof se && !ue(h.value) && i.push(new l(o.INVALID_COLUMN_SETTING_VALUE, "'increment' must not have a value", h.value || h.name));
           });
           break;
         case "default":
-          f.length > 1 && i.push(...f.map((h) => new c(o.DUPLICATE_TABLE_SETTING, "'default' can only appear once", h))), f.forEach((h) => {
-            Mn(h.value) || i.push(new c(o.INVALID_TABLE_SETTING, "'default' must be a string literal, number literal, function expression, true, false or null", h.value || h.name));
+          f.length > 1 && i.push(...f.map((h) => new l(o.DUPLICATE_TABLE_SETTING, "'default' can only appear once", h))), f.forEach((h) => {
+            Mn(h.value) || i.push(new l(o.INVALID_TABLE_SETTING, "'default' must be a string literal, number literal, function expression, true, false or null", h.value || h.name));
           });
           break;
         default:
-          f.forEach((h) => i.push(new c(o.UNKNOWN_COLUMN_SETTING, `Unknown column setting '${p}'`, h)));
+          f.forEach((h) => i.push(new l(o.UNKNOWN_COLUMN_SETTING, `Unknown column setting '${p}'`, h)));
       }
     }
     return i;
@@ -2348,7 +2348,7 @@ class Sn {
       var r;
       return ((r = i.type) == null ? void 0 : r.value.toLowerCase()) === "note";
     });
-    return s.length > 1 && n.push(...s.map((i) => new c(o.NOTE_REDEFINED, "Duplicate notes are defined", i))), n;
+    return s.length > 1 && n.push(...s.map((i) => new l(o.NOTE_REDEFINED, "Duplicate notes are defined", i))), n;
   }
 }
 function On(t) {
@@ -2367,10 +2367,10 @@ function On(t) {
   const e = W(t).unwrap_or(void 0);
   return e !== void 0 && e.length > 0;
 }
-function Dn(t, e) {
+function Rn(t, e) {
   return e.length === 1 && t === e[0];
 }
-class Rn {
+class Dn {
   constructor(e, n, s) {
     this.declarationNode = e, this.publicSymbolTable = n, this.symbolFactory = s;
   }
@@ -2385,25 +2385,25 @@ class Rn {
     ];
   }
   validateContext() {
-    return this.declarationNode.parent instanceof v ? [new c(
+    return this.declarationNode.parent instanceof v ? [new l(
       o.INVALID_TABLEGROUP_CONTEXT,
       "TableGroup must appear top-level",
       this.declarationNode
     )] : [];
   }
   validateName(e) {
-    return e ? ye(e) ? [] : [new c(
+    return e ? ye(e) ? [] : [new l(
       o.INVALID_NAME,
       "A TableGroup name must be a single identifier",
       e
-    )] : [new c(
+    )] : [new l(
       o.NAME_NOT_FOUND,
       "A TableGroup must have a name",
       this.declarationNode
     )];
   }
   validateAlias(e) {
-    return e ? [new c(
+    return e ? [new l(
       o.UNEXPECTED_ALIAS,
       "A TableGroup shouldn't have an alias",
       e
@@ -2416,7 +2416,7 @@ class Rn {
     if (n.isOk()) {
       const s = n.unwrap(), i = s.pop(), r = Ze(s, this.publicSymbolTable, this.symbolFactory), a = qe(i);
       if (r.has(a))
-        return [new c(o.DUPLICATE_NAME, `TableGroup name '${i}' already exists`, e)];
+        return [new l(o.DUPLICATE_NAME, `TableGroup name '${i}' already exists`, e)];
       r.set(a, this.declarationNode.symbol);
     }
     return [];
@@ -2426,30 +2426,30 @@ class Rn {
     return I.forIn(i, (r, a) => {
       switch (a) {
         case "headercolor":
-          s.push(...r.map((l) => new c(
+          s.push(...r.map((c) => new l(
             o.INVALID_TABLE_SETTING,
             "'headercolor' is not supported",
-            l
+            c
           )));
           break;
         case "note":
-          r.length > 1 && s.push(...r.map((l) => new c(
+          r.length > 1 && s.push(...r.map((c) => new l(
             o.DUPLICATE_TABLE_SETTING,
             "'note' can only appear once",
-            l
-          ))), r.filter((l) => !$(l.value)).forEach((l) => {
-            s.push(new c(
+            c
+          ))), r.filter((c) => !$(c.value)).forEach((c) => {
+            s.push(new l(
               o.INVALID_TABLE_SETTING,
               "'note' must be a string literal",
-              l.value || l.name
+              c.value || c.name
             ));
           });
           break;
         default:
-          s.push(...r.map((l) => new c(
+          s.push(...r.map((c) => new l(
             o.INVALID_TABLE_SETTING,
             `Unknown '${a}' setting`,
-            l
+            c
           )));
           break;
       }
@@ -2458,13 +2458,13 @@ class Rn {
   validateBody(e) {
     if (!e)
       return [];
-    if (e instanceof w)
-      return [new c(
+    if (e instanceof y)
+      return [new l(
         o.UNEXPECTED_SIMPLE_BODY,
         "A TableGroup's body must be a block",
         e
       )];
-    const [n, s] = I.partition(e.body, (i) => i instanceof w);
+    const [n, s] = I.partition(e.body, (i) => i instanceof y);
     return [
       ...this.validateFields(n),
       ...this.validateSubElements(s)
@@ -2473,7 +2473,7 @@ class Rn {
   validateFields(e) {
     return e.flatMap((n) => {
       const s = [];
-      return n.callee && !W(n.callee).isOk() && s.push(new c(o.INVALID_TABLEGROUP_FIELD, "A TableGroup field must be of the form <table> or <schema>.<table>", n.callee)), this.registerField(n), n.args.length > 0 && s.push(...n.args.map((i) => new c(o.INVALID_TABLEGROUP_FIELD, "A TableGroup field should only have a single Table name", i))), s;
+      return n.callee && !W(n.callee).isOk() && s.push(new l(o.INVALID_TABLEGROUP_FIELD, "A TableGroup field must be of the form <table> or <schema>.<table>", n.callee)), this.registerField(n), n.args.length > 0 && s.push(...n.args.map((i) => new l(o.INVALID_TABLEGROUP_FIELD, "A TableGroup field should only have a single Table name", i))), s;
     });
   }
   validateSubElements(e) {
@@ -2486,7 +2486,7 @@ class Rn {
       var r;
       return ((r = i.type) == null ? void 0 : r.value.toLowerCase()) === "note";
     });
-    return s.length > 1 && n.push(...s.map((i) => new c(o.NOTE_REDEFINED, "Duplicate notes are defined", i))), n;
+    return s.length > 1 && n.push(...s.map((i) => new l(o.NOTE_REDEFINED, "Duplicate notes are defined", i))), n;
   }
   registerField(e) {
     if (e.callee && M(e.callee)) {
@@ -2496,8 +2496,8 @@ class Rn {
       if (r.has(s)) {
         const a = r.get(s);
         return [
-          new c(o.DUPLICATE_TABLEGROUP_FIELD_NAME, `${n} already exists in the group`, e),
-          new c(o.DUPLICATE_TABLEGROUP_FIELD_NAME, `${n} already exists in the group`, a.declaration)
+          new l(o.DUPLICATE_TABLEGROUP_FIELD_NAME, `${n} already exists in the group`, e),
+          new l(o.DUPLICATE_TABLEGROUP_FIELD_NAME, `${n} already exists in the group`, a.declaration)
         ];
       }
       r.set(s, i);
@@ -2513,7 +2513,7 @@ function ae(t) {
     case b.Table:
       return Sn;
     case b.TableGroup:
-      return Rn;
+      return Dn;
     case b.Project:
       return yn;
     case b.Ref:
@@ -2541,14 +2541,14 @@ function Ze(t, e, n) {
   let s = e;
   for (const r of t) {
     let a;
-    const l = je(r);
-    if (s.has(l)) {
-      if (a = (i = s.get(l)) == null ? void 0 : i.symbolTable, !a)
+    const c = je(r);
+    if (s.has(c)) {
+      if (a = (i = s.get(c)) == null ? void 0 : i.symbolTable, !a)
         throw new Error("Expect a symbol table in a schema symbol");
     } else {
       a = new we();
       const p = n.create(_t, { symbolTable: a });
-      s.set(l, p);
+      s.set(c, p);
     }
     s = a;
   }
@@ -2599,7 +2599,7 @@ function B(t) {
     if (!i.name)
       continue;
     if (i.name instanceof U) {
-      n.push(new c(o.INVALID_SETTINGS, "A setting name must be a stream of identifiers", i.name));
+      n.push(new l(o.INVALID_SETTINGS, "A setting name must be a stream of identifiers", i.name));
       continue;
     }
     const r = (s = Te(i.name).unwrap_or(void 0)) == null ? void 0 : s.toLowerCase();
@@ -2626,7 +2626,7 @@ class ft {
       e.push(...r.validate());
     });
     const n = this.ast.body.filter((s) => ve(s).unwrap_or(void 0) === b.Project);
-    return n.length > 1 && n.forEach((s) => e.push(new c(o.PROJECT_REDEFINED, "Only one project can exist", s))), new V(this.ast, e);
+    return n.length > 1 && n.forEach((s) => e.push(new l(o.PROJECT_REDEFINED, "Only one project can exist", s))), new V(this.ast, e);
   }
 }
 class oe {
@@ -2667,7 +2667,7 @@ class oe {
   }
   bindSubfield(e) {
     const n = [e.callee, ...e.args], s = I.last(n);
-    s instanceof R && (n.pop(), this.bindSettingList(s, this.subfield.settingList));
+    s instanceof D && (n.pop(), this.bindSettingList(s, this.subfield.settingList));
     const { argBinderRules: i } = this.subfield.arg;
     for (let r = 0; r < Math.min(n.length, i.length); r += 1)
       i[r].shouldBind && this.scanAndBind(n[r], i[r]);
@@ -2689,7 +2689,7 @@ class oe {
   bindFragments(e, n) {
     if (e.length === 0)
       return;
-    const s = [...n.topSubnamesSymbolKind], { remainingSubnamesSymbolKind: i } = n, r = e.findIndex((h) => !M(h)), l = r !== -1 && xt(e[r]) ? e[r] : void 0, p = r >= 0 ? s.pop() : void 0, f = e.slice(
+    const s = [...n.topSubnamesSymbolKind], { remainingSubnamesSymbolKind: i } = n, r = e.findIndex((h) => !M(h)), c = r !== -1 && xt(e[r]) ? e[r] : void 0, p = r >= 0 ? s.pop() : void 0, f = e.slice(
       0,
       r === -1 ? void 0 : r
     );
@@ -2710,7 +2710,7 @@ class oe {
         referrer: h
       });
     }
-    return l ? l.elementList.forEach(
+    return c ? c.elementList.forEach(
       (h) => this.resolveIndexStack(
         [
           ...E,
@@ -2738,24 +2738,24 @@ class oe {
       return;
     }
     r.references.push(s.referrer), s.referrer.referee = r;
-    let a = r.symbolTable, { kind: l, name: p } = ie(s.index).unwrap();
+    let a = r.symbolTable, { kind: c, name: p } = ie(s.index).unwrap();
     for (const f of i) {
       const { kind: E, name: h } = ie(f.index).unwrap(), m = a.get(f.index);
       if (!m) {
         this.logError(
           f.referrer,
-          `${l} '${p}' does not have ${E} '${h}'`,
+          `${c} '${p}' does not have ${E} '${h}'`,
           n
         );
         return;
       }
-      if (l = E, p = h, f.referrer.referee = m, m.references.push(f.referrer), !m.symbolTable)
+      if (c = E, p = h, f.referrer.referee = m, m.references.push(f.referrer), !m.symbolTable)
         break;
       a = m.symbolTable;
     }
   }
   logError(e, n, s) {
-    s || this.errors.push(new c(o.BINDING_ERROR, n, e));
+    s || this.errors.push(new l(o.BINDING_ERROR, n, e));
   }
 }
 class Bn extends oe {
@@ -3004,10 +3004,10 @@ function Ie(t) {
     schemaName: e
   };
 }
-function Dt(t) {
+function Rt(t) {
   return t.expression.literal.value;
 }
-function Rt(t, e) {
+function Dt(t, e) {
   if (Array.isArray(t)) {
     const i = t.map(({ id: a }) => a).sort().join(","), r = e.map(({ id: a }) => a).sort().join(",");
     return i < r ? `${i}-${r}` : `${r}-${i}`;
@@ -3018,7 +3018,7 @@ function Rt(t, e) {
 function Pt(t, e) {
   if (Array.isArray(t)) {
     const i = t.map(({ id: a }) => a).sort(), r = e.map(({ id: a }) => a).sort();
-    return I.zip(i, r).every(([a, l]) => a === l);
+    return I.zip(i, r).every(([a, c]) => a === c);
   }
   const n = t.id, s = e.id;
   return n === s;
@@ -3054,7 +3054,7 @@ class Ut {
   }
   interpretName(e) {
     const { name: n, schemaName: s } = Ie(e);
-    return s.length > 1 ? (this.table.name = n, this.table.schemaName = s.join("."), [new c(o.UNSUPPORTED, "Nested schema is not supported", e)]) : (this.table.name = n, this.table.schemaName = s.length ? s[0] : null, []);
+    return s.length > 1 ? (this.table.name = n, this.table.schemaName = s.join("."), [new l(o.UNSUPPORTED, "Nested schema is not supported", e)]) : (this.table.name = n, this.table.schemaName = s.length ? s[0] : null, []);
   }
   interpretAlias(e) {
     if (!e)
@@ -3072,7 +3072,7 @@ class Ut {
   interpretSettingList(e) {
     var i, r, a;
     const n = B(e).getValue();
-    this.table.headerColor = (i = n.headercolor) != null && i.length ? Dt((a = (r = n.headercolor) == null ? void 0 : r.at(0)) == null ? void 0 : a.value) : void 0;
+    this.table.headerColor = (i = n.headercolor) != null && i.length ? Rt((a = (r = n.headercolor) == null ? void 0 : r.at(0)) == null ? void 0 : a.value) : void 0;
     const [s] = n.note || [];
     return this.table.note = s && {
       value: G(s == null ? void 0 : s.value).map(re).unwrap(),
@@ -3080,7 +3080,7 @@ class Ut {
     }, [];
   }
   interpretBody(e) {
-    const [n, s] = I.partition(e.body, (i) => i instanceof w);
+    const [n, s] = I.partition(e.body, (i) => i instanceof y);
     return [...this.interpretFields(n), ...this.interpretSubElements(s)];
   }
   interpretSubElements(e) {
@@ -3102,61 +3102,61 @@ class Ut {
     return e.flatMap((n) => this.interpretColumn(n));
   }
   interpretColumn(e) {
-    var a, l, p, f, E, h, m, g;
+    var a, c, p, f, E, h, m, g;
     const n = [], s = {};
     s.name = C(e.callee).unwrap();
     const i = qn(e.args[0]);
     s.type = i.getValue(), n.push(...i.getErrors()), s.token = A(e), s.inline_refs = [];
     const r = e.args.slice(1);
-    if (I.last(r) instanceof R) {
+    if (I.last(r) instanceof D) {
       const _ = B(r.pop()).getValue();
-      s.pk = !!((a = _.pk) != null && a.length) || !!((l = _["primary key"]) != null && l.length), s.increment = !!((p = _.increment) != null && p.length), s.unique = !!((f = _.unique) != null && f.length), s.not_null = !!((E = _["not null"]) != null && E.length) && !0, s.dbdefault = Hn((m = (h = _.default) == null ? void 0 : h.at(0)) == null ? void 0 : m.value);
+      s.pk = !!((a = _.pk) != null && a.length) || !!((c = _["primary key"]) != null && c.length), s.increment = !!((p = _.increment) != null && p.length), s.unique = !!((f = _.unique) != null && f.length), s.not_null = !!((E = _["not null"]) != null && E.length) && !0, s.dbdefault = Hn((m = (h = _.default) == null ? void 0 : h.at(0)) == null ? void 0 : m.value);
       const ee = (g = _.note) == null ? void 0 : g.at(0);
       s.note = ee && {
         value: G(ee.value).map(re).unwrap(),
         token: A(ee)
       };
-      const ce = _.ref || [];
-      s.inline_refs = ce.flatMap((z) => {
+      const le = _.ref || [];
+      s.inline_refs = le.flatMap((z) => {
         const [tt] = $e(z.value.expression);
         if (Pt(tt, e.symbol))
-          return n.push(new c(o.SAME_ENDPOINT, "Two endpoints are the same", z)), [];
+          return n.push(new l(o.SAME_ENDPOINT, "Two endpoints are the same", z)), [];
         const ke = z.value.op, te = W(z.value.expression).unwrap();
         let de;
         if (te.length === 1) {
-          const [le] = te;
+          const [ce] = te;
           de = {
             schemaName: this.table.schemaName,
             tableName: this.table.name,
-            fieldNames: [le],
+            fieldNames: [ce],
             relation: ke.value,
             token: A(z)
           };
         } else if (te.length === 2) {
-          const [le, Le] = te;
+          const [ce, Le] = te;
           de = {
             schemaName: null,
-            tableName: le,
+            tableName: ce,
             fieldNames: [Le],
             relation: ke.value,
             token: A(z)
           };
         } else if (te.length === 3) {
-          const [le, Le, st] = te;
+          const [ce, Le, st] = te;
           de = {
-            schemaName: le,
+            schemaName: ce,
             tableName: Le,
             fieldNames: [st],
             relation: ke.value,
             token: A(z)
           };
         } else {
-          n.push(new c(o.UNSUPPORTED, "Nested schema is not supported", z));
-          const le = te.pop(), Le = te.pop();
+          n.push(new l(o.UNSUPPORTED, "Nested schema is not supported", z));
+          const ce = te.pop(), Le = te.pop();
           de = {
             schemaName: te.join("."),
             tableName: Le,
-            fieldNames: [le],
+            fieldNames: [ce],
             relation: ke.value,
             token: A(z)
           };
@@ -3169,13 +3169,13 @@ class Ut {
   }
   interpretIndexes(e) {
     return this.table.indexes.push(...e.body.body.map((n) => {
-      var a, l, p, f, E, h, m;
+      var a, c, p, f, E, h, m;
       const s = { columns: [] }, i = n;
-      s.token = A(e);
+      s.token = A(i);
       const r = [i.callee, ...i.args];
-      if (I.last(r) instanceof R) {
+      if (I.last(r) instanceof D) {
         const g = B(r.pop()).getValue();
-        s.pk = !!((a = g.pk) != null && a.length), s.unique = !!((l = g.unique) != null && l.length), s.name = G((f = (p = g.name) == null ? void 0 : p.at(0)) == null ? void 0 : f.value).unwrap_or(void 0);
+        s.pk = !!((a = g.pk) != null && a.length), s.unique = !!((c = g.unique) != null && c.length), s.name = G((f = (p = g.name) == null ? void 0 : p.at(0)) == null ? void 0 : f.value).unwrap_or(void 0);
         const _ = (E = g.note) == null ? void 0 : E.at(0);
         s.note = _ && {
           value: G(_.value).unwrap(),
@@ -3192,26 +3192,26 @@ class Ut {
       }).forEach((g) => {
         const { functional: _, nonFunctional: ee } = Xe(g).unwrap();
         s.columns.push(
-          ..._.map((ce) => ({
-            value: ce.value.value,
+          ..._.map((le) => ({
+            value: le.value.value,
             type: "expression",
-            token: A(ce)
+            token: A(le)
           })),
-          ...ee.map((ce) => ({
-            value: C(ce).unwrap(),
+          ...ee.map((le) => ({
+            value: C(le).unwrap(),
             type: "column",
-            token: A(ce)
+            token: A(le)
           }))
         );
       }), s;
     })), [];
   }
   registerInlineRefToEnv(e, n, s, i) {
-    const r = Rt(e.symbol, n);
+    const r = Dt(e.symbol, n);
     if (this.env.refIds[r])
       return [
-        new c(o.CIRCULAR_REF, "References with same endpoints exist", i),
-        new c(o.CIRCULAR_REF, "References with same endpoints exist", this.env.refIds[r])
+        new l(o.CIRCULAR_REF, "References with same endpoints exist", i),
+        new l(o.CIRCULAR_REF, "References with same endpoints exist", this.env.refIds[r])
       ];
     const a = Ot(s.relation);
     return this.env.refIds[r] = i, this.env.ref.set(i, {
@@ -3247,7 +3247,7 @@ function qn(t) {
       type_name: `${s}${n}${e ? `(${e})` : ""}`,
       args: e
     },
-    [new c(o.UNSUPPORTED, "Nested schema is not supported", t)]
+    [new l(o.UNSUPPORTED, "Nested schema is not supported", t)]
   ) : new V({
     schemaName: i.length === 0 ? null : i[0],
     type_name: `${s}${n}${e ? `(${e})` : ""}`,
@@ -3305,12 +3305,12 @@ class Jn {
   interpretSettingList(e) {
     var s, i, r;
     const n = B(e).getValue();
-    return this.note.headerColor = (s = n.headercolor) != null && s.length ? Dt((r = (i = n.headercolor) == null ? void 0 : i.at(0)) == null ? void 0 : r.value) : void 0, [];
+    return this.note.headerColor = (s = n.headercolor) != null && s.length ? Rt((r = (i = n.headercolor) == null ? void 0 : i.at(0)) == null ? void 0 : r.value) : void 0, [];
   }
   interpretBody(e) {
-    const [n, s] = I.partition(e.body, (i) => i instanceof w);
+    const [n, s] = I.partition(e.body, (i) => i instanceof y);
     return n.length !== 1 || s.length > 0 ? [
-      new c(o.INVALID_NOTE, "Invalid note syntax", e)
+      new l(o.INVALID_NOTE, "Invalid note syntax", e)
     ] : [...this.interpretNote(n[0])];
   }
   interpretNote(e) {
@@ -3327,21 +3327,21 @@ class Mt {
   }
   interpretName(e) {
     const n = [], s = W(this.declarationNode.name).unwrap_or([]);
-    return this.ref.name = s.pop() || null, s.length > 1 && n.push(new c(o.UNSUPPORTED, "Nested schema is not supported", this.declarationNode.name)), this.ref.schemaName = s.join(".") || null, n;
+    return this.ref.name = s.pop() || null, s.length > 1 && n.push(new l(o.UNSUPPORTED, "Nested schema is not supported", this.declarationNode.name)), this.ref.schemaName = s.join(".") || null, n;
   }
   interpretBody(e) {
-    return e instanceof w ? this.interpretField(e) : this.interpretField(e.body[0]);
+    return e instanceof y ? this.interpretField(e) : this.interpretField(e.body[0]);
   }
   interpretField(e) {
     var f, E, h, m;
     const n = e.callee.op.value, { leftExpression: s, rightExpression: i } = e.callee, r = $e(s), a = $e(i);
     if (Pt(r, a))
-      return [new c(o.SAME_ENDPOINT, "Two endpoints are the same", e)];
-    const l = Rt(r, a);
-    if (this.env.refIds[l])
+      return [new l(o.SAME_ENDPOINT, "Two endpoints are the same", e)];
+    const c = Dt(r, a);
+    if (this.env.refIds[c])
       return [
-        new c(o.CIRCULAR_REF, "References with same endpoints exist", this.declarationNode),
-        new c(o.CIRCULAR_REF, "References with same endpoints exist", this.env.refIds[l])
+        new l(o.CIRCULAR_REF, "References with same endpoints exist", this.declarationNode),
+        new l(o.CIRCULAR_REF, "References with same endpoints exist", this.env.refIds[c])
       ];
     if (e.args[0]) {
       const g = B(e.args[0]).getValue(), _ = (E = (f = g.delete) == null ? void 0 : f.at(0)) == null ? void 0 : E.value;
@@ -3361,7 +3361,7 @@ class Mt {
         relation: p[1],
         token: A(i)
       }
-    ], this.env.refIds[l] = this.declarationNode, [];
+    ], this.env.refIds[c] = this.declarationNode, [];
   }
 }
 class Ft {
@@ -3378,10 +3378,10 @@ class Ft {
   }
   interpretName(e) {
     const n = [], { name: s, schemaName: i } = Ie(e);
-    return i.length >= 2 && (this.tableGroup.name = s, this.tableGroup.schemaName = i.join("."), n.push(new c(o.UNSUPPORTED, "Nested schema is not supported", this.declarationNode.name))), this.tableGroup.name = s, this.tableGroup.schemaName = i[0] || null, n;
+    return i.length >= 2 && (this.tableGroup.name = s, this.tableGroup.schemaName = i.join("."), n.push(new l(o.UNSUPPORTED, "Nested schema is not supported", this.declarationNode.name))), this.tableGroup.name = s, this.tableGroup.schemaName = i[0] || null, n;
   }
   interpretBody(e) {
-    const [n, s] = jt(e.body, (i) => i instanceof w);
+    const [n, s] = jt(e.body, (i) => i instanceof y);
     return [
       ...this.interpretFields(n),
       ...this.interpretSubElements(s)
@@ -3407,11 +3407,11 @@ class Ft {
     const n = [];
     return this.tableGroup.tables = e.map((s) => {
       const i = W(s.callee).unwrap();
-      i.length > 2 && n.push(new c(o.UNSUPPORTED, "Nested schema is not supported", s));
+      i.length > 2 && n.push(new l(o.UNSUPPORTED, "Nested schema is not supported", s));
       const r = pe(s.callee).unwrap().pop().referee.id;
       if (this.env.groupOfTable[r]) {
-        const a = this.env.groupOfTable[r], { schemaName: l, name: p } = this.env.tableGroups.get(a), f = l ? `${l}.${p}` : p;
-        n.push(new c(o.TABLE_REAPPEAR_IN_TABLEGROUP, `Table "${i.join(".")}" already appears in group "${f}"`, s));
+        const a = this.env.groupOfTable[r], { schemaName: c, name: p } = this.env.tableGroups.get(a), f = c ? `${c}.${p}` : p;
+        n.push(new l(o.TABLE_REAPPEAR_IN_TABLEGROUP, `Table "${i.join(".")}" already appears in group "${f}"`, s));
       } else
         this.env.groupOfTable[r] = this.declarationNode;
       return {
@@ -3437,14 +3437,14 @@ class Bt {
   }
   interpretName(e) {
     const { name: n, schemaName: s } = Ie(e);
-    return s.length > 1 ? (this.enum.name = n, this.enum.schemaName = s.join("."), [new c(o.UNSUPPORTED, "Nested schema is not supported", e)]) : (this.enum.name = n, this.enum.schemaName = s.length ? s[0] : null, []);
+    return s.length > 1 ? (this.enum.name = n, this.enum.schemaName = s.join("."), [new l(o.UNSUPPORTED, "Nested schema is not supported", e)]) : (this.enum.name = n, this.enum.schemaName = s.length ? s[0] : null, []);
   }
   interpretBody(e) {
     return e.body.flatMap((n) => {
-      var l;
+      var c;
       const s = n, i = {};
       i.token = A(s), i.name = j(s.callee).unwrap();
-      const a = (l = B(s.args[0]).getValue().note) == null ? void 0 : l.at(0);
+      const a = (c = B(s.args[0]).getValue().note) == null ? void 0 : c.at(0);
       return i.note = a && {
         value: G(a.value).map(re).unwrap(),
         token: A(a)
@@ -3546,7 +3546,7 @@ function es(t) {
     project: Array.from(t.project.values())[0] || {}
   };
 }
-var L = /* @__PURE__ */ ((t) => (t[t.Function = 1] = "Function", t[t.Constructor = 2] = "Constructor", t[t.Field = 3] = "Field", t[t.Variable = 4] = "Variable", t[t.Class = 5] = "Class", t[t.Struct = 6] = "Struct", t[t.Interface = 7] = "Interface", t[t.Module = 8] = "Module", t[t.Property = 9] = "Property", t[t.Event = 10] = "Event", t[t.Operator = 11] = "Operator", t[t.Unit = 12] = "Unit", t[t.Value = 13] = "Value", t[t.Constant = 14] = "Constant", t[t.Enum = 15] = "Enum", t[t.EnumMember = 16] = "EnumMember", t[t.Keyword = 17] = "Keyword", t[t.Text = 18] = "Text", t[t.Color = 19] = "Color", t[t.File = 20] = "File", t[t.Reference = 21] = "Reference", t[t.Customcolor = 22] = "Customcolor", t[t.Folder = 23] = "Folder", t[t.TypeParameter = 24] = "TypeParameter", t[t.User = 25] = "User", t[t.Issue = 26] = "Issue", t[t.Snippet = 27] = "Snippet", t))(L || {}), k = /* @__PURE__ */ ((t) => (t[t.None = 0] = "None", t[t.KeepWhitespace = 1] = "KeepWhitespace", t[t.InsertAsSnippet = 4] = "InsertAsSnippet", t))(k || {});
+var L = /* @__PURE__ */ ((t) => (t[t.Function = 1] = "Function", t[t.Constructor = 2] = "Constructor", t[t.Field = 3] = "Field", t[t.Variable = 4] = "Variable", t[t.Class = 5] = "Class", t[t.Struct = 6] = "Struct", t[t.Interface = 7] = "Interface", t[t.Module = 8] = "Module", t[t.Property = 9] = "Property", t[t.Event = 10] = "Event", t[t.Operator = 11] = "Operator", t[t.Unit = 12] = "Unit", t[t.Value = 13] = "Value", t[t.Constant = 14] = "Constant", t[t.Enum = 15] = "Enum", t[t.EnumMember = 16] = "EnumMember", t[t.Keyword = 17] = "Keyword", t[t.Text = 18] = "Text", t[t.Color = 19] = "Color", t[t.File = 20] = "File", t[t.Reference = 21] = "Reference", t[t.Customcolor = 22] = "Customcolor", t[t.Folder = 23] = "Folder", t[t.TypeParameter = 24] = "TypeParameter", t[t.User = 25] = "User", t[t.Issue = 26] = "Issue", t[t.Snippet = 27] = "Snippet", t))(L || {}), w = /* @__PURE__ */ ((t) => (t[t.None = 0] = "None", t[t.KeepWhitespace = 1] = "KeepWhitespace", t[t.InsertAsSnippet = 4] = "InsertAsSnippet", t))(w || {});
 function Ae(t) {
   switch (t) {
     case T.Schema:
@@ -3567,7 +3567,7 @@ function Ae(t) {
       return L.Text;
   }
 }
-function Re(t, e) {
+function De(t, e) {
   if (!t || Ce(t))
     return !1;
   for (const n of t.trailingTrivia) {
@@ -3578,7 +3578,7 @@ function Re(t, e) {
   }
   return !0;
 }
-function O() {
+function R() {
   return {
     suggestions: []
   };
@@ -3610,19 +3610,19 @@ class Vt {
   }
   provideCompletionItems(e, n) {
     var E, h;
-    const s = Ke(e, n), i = this.compiler.token.flatStream(), { token: r, index: a } = this.compiler.container.token(s), l = a === void 0 ? i[0] : i[a + 1];
+    const s = Ke(e, n), i = this.compiler.token.flatStream(), { token: r, index: a } = this.compiler.container.token(s), c = a === void 0 ? i[0] : i[a + 1];
     if ([
       ...(r == null ? void 0 : r.trailingTrivia) || [],
       ...(r == null ? void 0 : r.leadingTrivia) || [],
-      ...(l == null ? void 0 : l.leadingTrivia) || []
+      ...(c == null ? void 0 : c.leadingTrivia) || []
     ].find((m) => Qt(m) && ge(s, m)))
-      return O();
+      return R();
     if (a === void 0)
       return Tt();
     if ([u.STRING_LITERAL, u.QUOTED_STRING].includes(r.kind) && ge(s, r))
-      return O();
+      return R();
     const p = this.compiler.container.element(s);
-    if (this.compiler.container.scopeKind(s) === D.TOPLEVEL || p instanceof v && p.type && p.type.start <= s && p.type.end >= s)
+    if (this.compiler.container.scopeKind(s) === O.TOPLEVEL || p instanceof v && p.type && p.type.start <= s && p.type.end >= s)
       return Tt();
     const f = [...this.compiler.container.stack(s)].reverse();
     for (const m of f)
@@ -3659,44 +3659,44 @@ class Vt {
       else {
         if (m instanceof se)
           return Et(this.compiler, s, m);
-        if (m instanceof R)
+        if (m instanceof D)
           return Et(this.compiler, s, m);
         if (m instanceof Z)
           return ts(this.compiler, s);
-        if (m instanceof w)
+        if (m instanceof y)
           return mt(this.compiler, s, m);
         if (m instanceof v && (m.bodyColon && s >= m.bodyColon.end || m.body && ge(s, m.body)))
           return mt(this.compiler, s, void 0);
       }
-    return O();
+    return R();
   }
 }
 function dt(t, e, n) {
   const s = t.container.scopeKind(e);
-  if ([D.REF, D.TABLE].includes(s)) {
+  if ([O.REF, O.TABLE].includes(s)) {
     const i = Be(t, e, t.container.element(e), [
       T.Table,
       T.Schema,
       T.Column
     ]);
-    return Re(n.op, e) ? Pe(i) : i;
+    return De(n.op, e) ? Pe(i) : i;
   }
-  return O();
+  return R();
 }
 function Be(t, e, n, s) {
   var a;
   if (n === void 0)
-    return O();
+    return R();
   let i = n;
   const r = { suggestions: [] };
   for (; i; ) {
     if ((a = i == null ? void 0 : i.symbol) != null && a.symbolTable) {
-      const { symbol: l } = i;
+      const { symbol: c } = i;
       r.suggestions.push(
-        ...t.symbol.members(l).filter(({ kind: p }) => s.includes(p)).map(({ name: p, kind: f }) => ({
+        ...t.symbol.members(c).filter(({ kind: p }) => s.includes(p)).map(({ name: p, kind: f }) => ({
           label: p,
           insertText: p,
-          insertTextRules: k.KeepWhitespace,
+          insertTextRules: w.KeepWhitespace,
           kind: Ae(f),
           sortText: Ae(f).toString().padStart(2, "0"),
           range: void 0
@@ -3710,9 +3710,9 @@ function Be(t, e, n, s) {
 function ts(t, e) {
   var s;
   switch (t.container.scopeKind(e)) {
-    case D.INDEXES:
+    case O.INDEXES:
       return Xt(t, e);
-    case D.REF:
+    case O.REF:
       {
         const i = [...t.container.stack(e)];
         for (; i.length > 0; ) {
@@ -3727,13 +3727,13 @@ function ts(t, e) {
       }
       return Ct(t, e);
   }
-  return O();
+  return R();
 }
 function Et(t, e, n) {
   const { token: s } = t.container.token(e);
   if ([u.COMMA, u.LBRACKET].includes(s == null ? void 0 : s.kind)) {
     const i = Nt(t, e);
-    return (s == null ? void 0 : s.kind) === u.COMMA && Re(s, e) ? Pe(i) : i;
+    return (s == null ? void 0 : s.kind) === u.COMMA && De(s, e) ? Pe(i) : i;
   }
   if (n.name && n.name.start <= e && n.name.end >= e)
     return Nt(t, e);
@@ -3743,84 +3743,96 @@ function Et(t, e, n) {
       e,
       Te(n.name).unwrap_or("")
     );
-    return (s == null ? void 0 : s.kind) === u.COLON && Re(s, e) ? Pe(i) : i;
+    return (s == null ? void 0 : s.kind) === u.COLON && De(s, e) ? Pe(i) : i;
   }
-  return O();
+  return R();
 }
 function Nt(t, e) {
   const n = t.container.element(e), s = t.container.scopeKind(e);
   if (n instanceof X)
-    return O();
+    return R();
   if (n.body && !ge(e, n.body))
     switch (s) {
-      case D.TABLE:
+      case O.TABLE:
         return {
           suggestions: [
             {
               label: "headercolor",
               insertText: "headercolor: ",
               kind: L.Field,
-              insertTextRules: k.KeepWhitespace,
+              insertTextRules: w.KeepWhitespace,
               range: void 0
             },
             {
               label: "note",
               insertText: "note: ",
               kind: L.Field,
-              insertTextRules: k.KeepWhitespace,
+              insertTextRules: w.KeepWhitespace,
+              range: void 0
+            }
+          ]
+        };
+      case O.TABLEGROUP:
+        return {
+          suggestions: [
+            {
+              label: "note",
+              insertText: "note: ",
+              kind: L.Field,
+              insertTextRules: w.KeepWhitespace,
               range: void 0
             }
           ]
         };
       default:
-        return O();
+        return R();
     }
   switch (s) {
-    case D.TABLE:
+    case O.TABLE:
       return {
         suggestions: [
           ...["primary key", "null", "not null", "increment", "pk", "unique"].map((i) => ({
             label: i,
             insertText: i,
             kind: L.Property,
-            insertTextRules: k.KeepWhitespace,
+            insertTextRules: w.KeepWhitespace,
             range: void 0
           })),
           ...["ref", "default"].map((i) => ({
             label: i,
             insertText: `${i}: `,
             kind: L.Property,
-            insertTextRules: k.KeepWhitespace,
+            insertTextRules: w.KeepWhitespace,
             range: void 0
           })),
           {
             label: "note",
             insertText: "note: ",
             kind: L.Property,
-            insertTextRules: k.KeepWhitespace,
+            insertTextRules: w.KeepWhitespace,
             range: void 0
           }
         ]
       };
-    case D.ENUM:
+    case O.ENUM:
       return {
         suggestions: [
           {
             label: "note",
             insertText: "note: ",
             kind: L.Property,
-            insertTextRules: k.KeepWhitespace,
+            insertTextRules: w.KeepWhitespace,
             range: void 0
           }
         ]
       };
-    case D.INDEXES:
+    case O.INDEXES:
       return {
         suggestions: [
           ...["unique", "pk"].map((i) => ({
             label: i,
             insertText: i,
-            insertTextRules: k.KeepWhitespace,
+            insertTextRules: w.KeepWhitespace,
             kind: L.Property,
             range: void 0
           })),
@@ -3828,23 +3840,23 @@ function Nt(t, e) {
             label: i,
             insertText: `${i}: `,
             kind: L.Property,
-            insertTextRules: k.KeepWhitespace,
+            insertTextRules: w.KeepWhitespace,
             range: void 0
           }))
         ]
       };
-    case D.REF:
+    case O.REF:
       return {
         suggestions: ["update", "delete"].map((i) => ({
           label: i,
           insertText: `${i}: `,
           kind: L.Property,
-          insertTextRules: k.KeepWhitespace,
+          insertTextRules: w.KeepWhitespace,
           range: void 0
         }))
       };
   }
-  return O();
+  return R();
 }
 function ns(t, e, n) {
   switch (n == null ? void 0 : n.toLowerCase()) {
@@ -3855,7 +3867,7 @@ function ns(t, e, n) {
           label: s,
           insertText: s,
           kind: L.Value,
-          insertTextRules: k.KeepWhitespace,
+          insertTextRules: w.KeepWhitespace,
           range: void 0
         }))
       };
@@ -3865,17 +3877,17 @@ function ns(t, e, n) {
           label: s,
           insertText: `${s}`,
           kind: L.Value,
-          insertTextRules: k.KeepWhitespace,
+          insertTextRules: w.KeepWhitespace,
           range: void 0
         }))
       };
   }
-  return O();
+  return R();
 }
 function Gt(t, e, n) {
   const s = pe(n).unwrap_or([]);
   if (s.pop(), s.some((r) => !M(r)))
-    return O();
+    return R();
   const i = s.map((r) => j(r).unwrap());
   return Fe({
     suggestions: t.symbol.ofName({ nameStack: i, owner: t.container.element(e) }).flatMap(({ symbol: r }) => t.symbol.members(r)).map(({ kind: r, name: a }) => ({
@@ -3889,22 +3901,22 @@ function Gt(t, e, n) {
 function mt(t, e, n) {
   var i;
   switch (t.container.scopeKind(e)) {
-    case D.TABLE:
+    case O.TABLE:
       return is(t, e, n);
-    case D.PROJECT:
+    case O.PROJECT:
       return rs(t, e, n);
-    case D.INDEXES:
+    case O.INDEXES:
       return os(t, e);
-    case D.ENUM:
+    case O.ENUM:
       return ss(t, e, n);
-    case D.REF: {
+    case O.REF: {
       const r = Ct(t, e);
-      return ((i = t.container.token(e).token) == null ? void 0 : i.kind) === u.COLON && Re(t.container.token(e).token, e) ? Pe(r) : r;
+      return ((i = t.container.token(e).token) == null ? void 0 : i.kind) === u.COLON && De(t.container.token(e).token, e) ? Pe(r) : r;
     }
-    case D.TABLEGROUP:
+    case O.TABLEGROUP:
       return as(t);
     default:
-      return O();
+      return R();
   }
 }
 function Tt() {
@@ -3912,7 +3924,7 @@ function Tt() {
     suggestions: ["Table", "TableGroup", "Enum", "Project", "Ref"].map((t) => ({
       label: t,
       insertText: t,
-      insertTextRules: k.KeepWhitespace,
+      insertTextRules: w.KeepWhitespace,
       kind: L.Keyword,
       range: void 0
     }))
@@ -3923,7 +3935,7 @@ function ss(t, e, n) {
     T.Schema,
     T.Table,
     T.Column
-  ]) : O();
+  ]) : R();
 }
 function is(t, e, n) {
   if (!(n != null && n.callee))
@@ -3931,7 +3943,7 @@ function is(t, e, n) {
       suggestions: ["Note", "indexes"].map((i) => ({
         label: i,
         insertText: i,
-        insertTextRules: k.KeepWhitespace,
+        insertTextRules: w.KeepWhitespace,
         kind: L.Keyword,
         range: void 0
       }))
@@ -3941,26 +3953,26 @@ function is(t, e, n) {
     suggestions: ["Note", "indexes"].map((i) => ({
       label: i,
       insertText: i,
-      insertTextRules: k.KeepWhitespace,
+      insertTextRules: w.KeepWhitespace,
       kind: L.Keyword,
       range: void 0
     }))
-  } : s === 1 ? cs(t, e) : O();
+  } : s === 1 ? ls(t, e) : R();
 }
 function rs(t, e, n) {
   return n != null && n.callee ? et(e, n) === 0 ? {
     suggestions: ["Table", "TableGroup", "Enum", "Note", "Ref"].map((i) => ({
       label: i,
       insertText: i,
-      insertTextRules: k.KeepWhitespace,
+      insertTextRules: w.KeepWhitespace,
       kind: L.Keyword,
       range: void 0
     }))
-  } : O() : {
+  } : R() : {
     suggestions: ["Table", "TableGroup", "Enum", "Note", "Ref"].map((i) => ({
       label: i,
       insertText: i,
-      insertTextRules: k.KeepWhitespace,
+      insertTextRules: w.KeepWhitespace,
       kind: L.Keyword,
       range: void 0
     }))
@@ -3974,26 +3986,37 @@ function Ct(t, e) {
   ]);
 }
 function as(t) {
-  return Fe({
-    suggestions: [...t.parse.publicSymbolTable().entries()].flatMap(([e]) => {
-      const n = ie(e).unwrap_or(void 0);
-      if (n === void 0)
-        return [];
-      const { kind: s, name: i } = n;
-      return s !== T.Table && s !== T.Schema ? [] : {
-        label: i,
-        insertText: i,
-        insertTextRules: k.KeepWhitespace,
-        kind: Ae(s),
+  return {
+    suggestions: [
+      ...Fe({
+        suggestions: [...t.parse.publicSymbolTable().entries()].flatMap(([e]) => {
+          const n = ie(e).unwrap_or(void 0);
+          if (n === void 0)
+            return [];
+          const { kind: s, name: i } = n;
+          return s !== T.Table && s !== T.Schema ? [] : {
+            label: i,
+            insertText: i,
+            insertTextRules: w.KeepWhitespace,
+            kind: Ae(s),
+            range: void 0
+          };
+        })
+      }).suggestions,
+      ...["Note"].map((e) => ({
+        label: e,
+        insertText: e,
+        insertTextRules: w.KeepWhitespace,
+        kind: L.Keyword,
         range: void 0
-      };
-    })
-  });
+      }))
+    ]
+  };
 }
 function os(t, e) {
   return Xt(t, e);
 }
-function cs(t, e) {
+function ls(t, e) {
   return {
     suggestions: [
       ...[
@@ -4056,7 +4079,7 @@ function cs(t, e) {
       ].map((n) => ({
         label: n,
         insertText: n,
-        insertTextRules: k.KeepWhitespace,
+        insertTextRules: w.KeepWhitespace,
         kind: L.TypeParameter,
         sortText: L.TypeParameter.toString().padStart(2, "0"),
         range: void 0
@@ -4071,18 +4094,18 @@ function cs(t, e) {
 function Xt(t, e) {
   const n = t.container.element(e), s = n == null ? void 0 : n.parent;
   if (!((s == null ? void 0 : s.symbol) instanceof At))
-    return O();
+    return R();
   const { symbolTable: i } = s.symbol;
   return Fe({
     suggestions: [...i.entries()].flatMap(([r]) => {
       const a = ie(r).unwrap_or(void 0);
       if (a === void 0)
         return [];
-      const { name: l } = a;
+      const { name: c } = a;
       return {
-        label: l,
-        insertText: l,
-        insertTextRules: k.KeepWhitespace,
+        label: c,
+        insertText: c,
+        insertTextRules: w.KeepWhitespace,
         kind: Ae(T.Column),
         range: void 0
       };
@@ -4103,9 +4126,9 @@ class $t {
     var a;
     const { uri: s } = e, i = Ke(e, n), r = [...this.compiler.container.stack(i)];
     for (; r.length !== 0; ) {
-      const l = r.pop();
-      if ((a = l == null ? void 0 : l.referee) != null && a.declaration && [Ne.PRIMARY_EXPRESSION, Ne.VARIABLE].includes(l == null ? void 0 : l.kind)) {
-        const { startPos: p, endPos: f } = l.referee.declaration;
+      const c = r.pop();
+      if ((a = c == null ? void 0 : c.referee) != null && a.declaration && [Ne.PRIMARY_EXPRESSION, Ne.VARIABLE].includes(c == null ? void 0 : c.kind)) {
+        const { startPos: p, endPos: f } = c.referee.declaration;
         return [
           {
             range: {
@@ -4135,9 +4158,9 @@ class Wt {
         Ne.FUNCTION_APPLICATION,
         Ne.PRIMARY_EXPRESSION
       ].includes(a == null ? void 0 : a.kind)) {
-        const { symbol: l } = a;
-        if (l != null && l.references.length)
-          return l.references.map(({ startPos: p, endPos: f }) => ({
+        const { symbol: c } = a;
+        if (c != null && c.references.length)
+          return c.references.map(({ startPos: p, endPos: f }) => ({
             range: {
               startColumn: p.column + 1,
               startLineNumber: p.line + 1,
@@ -4153,13 +4176,13 @@ class Wt {
 }
 const hs = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  CompletionItemInsertTextRule: k,
+  CompletionItemInsertTextRule: w,
   CompletionItemKind: L,
   DBMLCompletionItemProvider: Vt,
   DBMLDefinitionProvider: $t,
   DBMLReferencesProvider: Wt
 }, Symbol.toStringTag, { value: "Module" }));
-var D = /* @__PURE__ */ ((t) => (t[t.TABLE = 0] = "TABLE", t[t.ENUM = 1] = "ENUM", t[t.TABLEGROUP = 2] = "TABLEGROUP", t[t.INDEXES = 3] = "INDEXES", t[t.NOTE = 4] = "NOTE", t[t.REF = 5] = "REF", t[t.PROJECT = 6] = "PROJECT", t[t.CUSTOM = 7] = "CUSTOM", t[t.TOPLEVEL = 8] = "TOPLEVEL", t))(D || {});
+var O = /* @__PURE__ */ ((t) => (t[t.TABLE = 0] = "TABLE", t[t.ENUM = 1] = "ENUM", t[t.TABLEGROUP = 2] = "TABLEGROUP", t[t.INDEXES = 3] = "INDEXES", t[t.NOTE = 4] = "NOTE", t[t.REF = 5] = "REF", t[t.PROJECT = 6] = "PROJECT", t[t.CUSTOM = 7] = "CUSTOM", t[t.TOPLEVEL = 8] = "TOPLEVEL", t))(O || {});
 class fs {
   constructor() {
     this.source = "", this.cache = new Array(
@@ -4209,26 +4232,26 @@ class fs {
           if (r === -1)
             return [this.parse.ast()];
           const a = n[r].start;
-          let l = this.parse.ast();
-          const p = [l];
+          let c = this.parse.ast();
+          const p = [c];
           for (; ; ) {
-            const E = un(l).find((h) => ge(a, h));
+            const E = un(c).find((h) => ge(a, h));
             if (E === void 0 || E instanceof F)
               break;
-            p.push(E), l = E;
+            p.push(E), c = E;
           }
           if ((i == null ? void 0 : i.kind) === u.COLON)
             return p;
           for (; p.length > 0; ) {
             let f = !1;
             const E = it(p);
-            if (E instanceof w) {
+            if (E instanceof y) {
               const h = this.parse.source();
               for (let m = E.end; m < e; m += 1)
                 h[m] === `
 ` && (p.pop(), f = !0);
             } else
-              E instanceof Q || E instanceof q ? this.container.token(e).token !== E.op && (p.pop(), f = !0) : E instanceof R ? E.listCloseBracket && E.end <= e && (p.pop(), f = !0) : E instanceof Z ? E.tupleCloseParen && E.end <= e && (p.pop(), f = !0) : E instanceof J ? E.blockCloseBrace && E.end <= e && (p.pop(), f = !0) : E instanceof Y || E.end < e && (p.pop(), f = !0);
+              E instanceof Q || E instanceof q ? this.container.token(e).token !== E.op && (p.pop(), f = !0) : E instanceof D ? E.listCloseBracket && E.end <= e && (p.pop(), f = !0) : E instanceof Z ? E.tupleCloseParen && E.end <= e && (p.pop(), f = !0) : E instanceof J ? E.blockCloseBrace && E.end <= e && (p.pop(), f = !0) : E instanceof Y || E.end < e && (p.pop(), f = !0);
             if (f) {
               const h = it(p);
               h instanceof v && h.end <= e && p.pop();
@@ -4308,14 +4331,14 @@ class fs {
             if (!((i = r.symbol) != null && i.symbolTable))
               continue;
             const { symbolTable: a } = r.symbol;
-            let l = [a], p = [];
+            let c = [a], p = [];
             for (const f of e)
-              p = l.flatMap(
+              p = c.flatMap(
                 (E) => Zt(f).flatMap((h) => {
                   const m = E.get(h), g = ie(h).unwrap_or(void 0);
                   return !m || !g ? [] : { ...g, symbol: m };
                 })
-              ), l = p.flatMap(
+              ), c = p.flatMap(
                 (E) => E.symbol.symbolTable ? E.symbol.symbolTable : []
               );
             s.push(...p);
@@ -4342,8 +4365,8 @@ class fs {
         if (r.has(a))
           return r.get(a);
       }
-      const l = n(i);
-      return i !== void 0 ? r instanceof Map ? r.set(a, l) : (this.cache[e] = /* @__PURE__ */ new Map(), this.cache[e].set(a, l)) : this.cache[e] = l, l;
+      const c = n(i);
+      return i !== void 0 ? r instanceof Map ? r.set(a, c) : (this.cache[e] = /* @__PURE__ */ new Map(), this.cache[e].set(a, c)) : this.cache[e] = c, c;
     };
   }
   setSource(e) {