@dbml/parse 3.7.2 → 3.7.4

package/dist/dbml-parse.mjs

@@ -1,6 +1,6 @@
-import I, { partition as jt, findLastIndex as Yt, last as it } from "lodash";
+import I, { partition as Yt, findLastIndex as zt, last as rt } from "lodash";
 var u = /* @__PURE__ */ ((t) => (t.SPACE = "<space>", t.TAB = "<tab>", t.NEWLINE = "<newline>", t.COMMA = "<comma>", t.LPAREN = "<lparen>", t.RPAREN = "<rparen>", t.LBRACE = "<lbrace>", t.RBRACE = "<rbrace>", t.LBRACKET = "<lbracket>", t.RBRACKET = "<rbracket>", t.LANGLE = "<langle>", t.RANGLE = "<rangle>", t.OP = "<op>", t.EOF = "<eof>", t.NUMERIC_LITERAL = "<number>", t.STRING_LITERAL = "<string>", t.COLOR_LITERAL = "<color>", t.FUNCTION_EXPRESSION = "<function-expression>", t.QUOTED_STRING = "<variable>", t.IDENTIFIER = "<identifier>", t.SEMICOLON = "<semicolon>", t.COLON = "<colon>", t.SINGLE_LINE_COMMENT = "<single-line-comment>", t.MULTILINE_COMMENT = "<multiline-comment>", t))(u || {});
-function zt(t) {
+function Qt(t) {
   switch (t.kind) {
     case "<newline>":
     case "<space>":
@@ -12,7 +12,7 @@ function zt(t) {
       return !1;
   }
 }
-function rt(t) {
+function at(t) {
   if (!t)
     return !1;
   switch (t) {
@@ -33,7 +33,7 @@ function rt(t) {
       return !1;
   }
 }
-function at(t) {
+function ot(t) {
   return t !== void 0 && t.kind === "<op>";
 }
 class F {
@@ -44,27 +44,27 @@ class F {
     return new F(e, n, s, i, r);
   }
 }
-function bt(t) {
+function It(t) {
   return t.trailingTrivia.find(({ kind: e }) => e === u.NEWLINE) !== void 0;
 }
-function ot(t, e) {
-  return e.leadingTrivia.find(({ kind: s }) => s === u.NEWLINE) !== void 0 || bt(t);
+function lt(t, e) {
+  return e.leadingTrivia.find(({ kind: s }) => s === u.NEWLINE) !== void 0 || It(t);
 }
 function Ce(t) {
   return t.trailingTrivia.find(({ kind: e }) => e === u.SPACE) !== void 0;
 }
-function It(t) {
-  return t.trailingTrivia.length === 0 ? t.end : It(I.last(t.trailingTrivia));
-}
 function Lt(t) {
-  return t.leadingTrivia.length === 0 ? t.start : Lt(t.leadingTrivia[0]);
+  return t.trailingTrivia.length === 0 ? t.end : Lt(I.last(t.trailingTrivia));
 }
-function Qt(t) {
+function gt(t) {
+  return t.leadingTrivia.length === 0 ? t.start : gt(t.leadingTrivia[0]);
+}
+function qt(t) {
   return [u.SINGLE_LINE_COMMENT, u.MULTILINE_COMMENT].includes(
     t.kind
   );
 }
-class qt {
+class Ht {
   constructor() {
     this.id = 0;
   }
@@ -81,13 +81,13 @@ class x {
   constructor(e, n, s) {
     this.id = e, this.kind = n;
     const i = s.find((a) => a !== void 0 && !Number.isNaN(a.start));
-    i ? (this.startPos = i.startPos, this.fullStart = i instanceof F ? Lt(i) : i.fullStart) : (this.startPos = {
+    i ? (this.startPos = i.startPos, this.fullStart = i instanceof F ? gt(i) : i.fullStart) : (this.startPos = {
       offset: NaN,
       column: NaN,
       line: NaN
     }, this.fullStart = NaN);
     const r = [...s].reverse().find((a) => a !== void 0 && !Number.isNaN(a.end));
-    r ? (this.endPos = r.endPos, this.fullEnd = r instanceof F ? It(r) : r.fullEnd) : (this.endPos = {
+    r ? (this.endPos = r.endPos, this.fullEnd = r instanceof F ? Lt(r) : r.fullEnd) : (this.endPos = {
       offset: NaN,
       column: NaN,
       line: NaN
@@ -184,7 +184,7 @@ class R extends x {
   }, r) {
     super(r, "<list-expression>", [
       e,
-      ...gt(n, s),
+      ..._t(n, s),
       i
     ]), this.listOpenBracket = e, this.elementList = n, this.commaList = s, this.listCloseBracket = i;
   }
@@ -198,7 +198,7 @@ class Z extends x {
   }, r) {
     super(r, "<tuple-expression>", [
       e,
-      ...gt(n, s),
+      ..._t(n, s),
       i
     ]), this.tupleOpenParen = e, this.elementList = n, this.commaList = s, this.tupleCloseParen = i;
   }
@@ -254,7 +254,7 @@ class he extends x {
     super(s, "<array>", [e, n]), this.array = e, this.indexer = n;
   }
 }
-function gt(t, e) {
+function _t(t, e) {
   if (!t || t.length === 0)
     return e || [];
   if (!e || e.length === 0)
@@ -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() {
@@ -356,7 +356,7 @@ function qe(t) {
 function He(t) {
   return `TableGroup field:${t}`;
 }
-function Ht(t) {
+function Jt(t) {
   return `Note:${t}`;
 }
 function Ve(t, e) {
@@ -384,16 +384,16 @@ function ie(t) {
   return Object.values(T).includes(e) ? new S({
     name: n,
     kind: e
-  }) : new y();
+  }) : new k();
 }
-function Jt(t) {
+function Zt(t) {
   const e = ie(t).unwrap_or(void 0);
   if (!e)
     return !1;
   const { kind: n, name: s } = e;
   return n === "Schema" && s === "public";
 }
-function Zt(t) {
+function Kt(t) {
   return [
     je,
     Oe,
@@ -411,7 +411,7 @@ function De(t) {
   const [e] = t;
   return e >= "0" && e <= "9";
 }
-function Kt(t) {
+function en(t) {
   const [e] = t;
   return De(e) || Me(e) && e.toLowerCase() >= "a" && e.toLowerCase() <= "f";
 }
@@ -427,7 +427,7 @@ function ct(t, e) {
 function ge(t, e) {
   return t >= e.start && t < e.end;
 }
-class en {
+class tn {
   constructor() {
     this.id = 0;
   }
@@ -438,37 +438,37 @@ class en {
     return this.id++;
   }
 }
-class _t {
+class At {
   constructor({ symbolTable: e }, n) {
     this.references = [], this.id = n, this.symbolTable = e;
   }
 }
-class tn {
+class nn {
   constructor({ symbolTable: e, declaration: n }, s) {
     this.references = [], this.id = s, this.symbolTable = e, this.declaration = n;
   }
 }
-class nn {
+class sn {
   constructor({ declaration: e }, n) {
     this.references = [], this.id = n, this.declaration = e;
   }
 }
-class At {
+class vt {
   constructor({ symbolTable: e, declaration: n }, s) {
     this.references = [], this.id = s, this.symbolTable = e, this.declaration = n;
   }
 }
-class sn {
+class rn {
   constructor({ declaration: e }, n) {
     this.references = [], this.id = n, this.declaration = e;
   }
 }
-class rn {
+class an {
   constructor({ symbolTable: e, declaration: n }, s) {
     this.references = [], this.id = s, this.symbolTable = e, this.declaration = n;
   }
 }
-class an {
+class on {
   constructor({ declaration: e }, n) {
     this.references = [], this.id = n, this.declaration = e;
   }
@@ -497,12 +497,12 @@ class V {
     return new V(e(this.value), this.errors);
   }
 }
-function on(t, e, n) {
+function ln(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();
+    return new k();
   const a = I.last(s) instanceof R ? s.pop() : void 0;
   return s.length === 3 && Ge(s[1]).unwrap().value === "as" ? new S(
     n.create(v, {
@@ -526,18 +526,18 @@ function on(t, e, n) {
       attributeList: a,
       body: r
     })
-  ) : new y();
+  ) : new k();
 }
-function lt(t) {
+function ut(t) {
   return t.kind === u.IDENTIFIER && t.value === "as";
 }
 function N(t) {
-  t && (t instanceof F ? cn(t) : ln(t));
+  t && (t instanceof F ? cn(t) : un(t));
 }
 function cn(t) {
   t.kind !== u.EOF && (t.isInvalid = !0);
 }
-function ln(t) {
+function un(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)
@@ -571,13 +571,13 @@ function ln(t) {
   else
     throw t instanceof We ? new Error("This case is handled by the TupleExpressionNode case") : new Error("Unreachable case in markInvalidNode");
 }
-function vt(t) {
+function wt(t) {
   return !!(t != null && t.isInvalid);
 }
 function P(...t) {
   return t.filter((e) => e !== void 0);
 }
-function un(t) {
+function hn(t) {
   if (t instanceof X)
     return P(...t.body, t.eof);
   if (t instanceof v)
@@ -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,11 +653,11 @@ 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 {
+class fn {
   // list of errors during lexing
   constructor(e) {
     this.start = {
@@ -767,7 +767,7 @@ class hn {
           this.match("/") ? this.singleLineComment() : this.match("*") ? this.multilineComment() : this.operator();
           break;
         default:
-          if (rt(e)) {
+          if (at(e)) {
             this.operator();
             break;
           }
@@ -795,13 +795,13 @@ class hn {
     let e = !0, n = [], s;
     const i = [];
     for (const r of this.tokens)
-      zt(r) ? (n.push(r), r.kind === u.NEWLINE && s && (s.trailingTrivia = n, e = !0, s = void 0, n = [])) : (e ? r.leadingTrivia = n : s.trailingTrivia = n, i.push(r), n = [], s = r, e = !1);
+      Qt(r) ? (n.push(r), r.kind === u.NEWLINE && s && (s.trailingTrivia = n, e = !0, s = void 0, n = [])) : (e ? r.leadingTrivia = n : s.trailingTrivia = n, i.push(r), n = [], s = r, e = !1);
     this.tokens = i;
   }
   gatherInvalid() {
     let e;
     const n = [], s = [];
-    for (e = 0; e < this.tokens.length && vt(this.tokens[e]); e += 1)
+    for (e = 0; e < this.tokens.length && wt(this.tokens[e]); e += 1)
       s.push(this.tokens[e]);
     let i = this.tokens[e];
     for (i.leadingInvalid = [...s, ...i.leadingInvalid]; e < this.tokens.length; e += 1) {
@@ -895,7 +895,7 @@ class hn {
     this.addToken(u.IDENTIFIER);
   }
   operator() {
-    for (; rt(this.peek()); )
+    for (; at(this.peek()); )
       this.advance();
     this.addToken(u.OP);
   }
@@ -982,7 +982,7 @@ class hn {
   }
 }
 var Se = /* @__PURE__ */ ((t) => (t[t.ListExpression = 0] = "ListExpression", t[t.GroupExpression = 1] = "GroupExpression", t[t.BlockExpression = 2] = "BlockExpression", t))(Se || {});
-class fn {
+class pn {
   constructor() {
     this.stack = [], this.numberOfNestedLParens = 0, this.numberOfNestedLBrackets = 0, this.numberOfNestedLBraces = 0;
   }
@@ -1048,7 +1048,7 @@ class fn {
         }
   }
 }
-class pn {
+class dn {
   constructor(e) {
     this.generator = e;
   }
@@ -1061,15 +1061,15 @@ class d {
     this.token = e, this.partialNode = n, this.handlerContext = s;
   }
 }
-class dn {
+class En {
   constructor(e, n) {
-    this.current = 0, this.errors = [], this.contextStack = new fn(), this.synchronizeProgram = () => {
+    this.current = 0, this.errors = [], this.contextStack = new pn(), this.synchronizeProgram = () => {
       const s = this.peek();
       s.kind !== u.EOF ? N(this.advance()) : (N(this.peek()), this.logError(s, o.UNEXPECTED_EOF, "Unexpected EOF"));
     }, this.synchronizeElementDeclarationName = () => {
       for (; !this.isAtEnd(); ) {
         const s = this.peek();
-        if (lt(s) || this.check(u.COLON, u.LBRACE, u.LBRACKET))
+        if (ut(s) || this.check(u.COLON, u.LBRACE, u.LBRACKET))
           break;
         N(s), this.advance();
       }
@@ -1115,7 +1115,7 @@ class dn {
       if (!this.check(u.RBRACE))
         for (N(this.advance()); !this.isAtEnd(); ) {
           const s = this.peek();
-          if (this.check(u.RBRACE) || ot(this.previous(), s))
+          if (this.check(u.RBRACE) || lt(this.previous(), s))
             break;
           N(s), this.advance();
         }
@@ -1233,7 +1233,7 @@ class dn {
           break;
         N(s), this.advance();
       }
-    }, this.tokens = e, this.nodeFactory = new pn(n);
+    }, this.tokens = e, this.nodeFactory = new dn(n);
   }
   isAtEnd() {
     return this.current >= this.tokens.length || this.tokens[this.current].kind === u.EOF;
@@ -1324,7 +1324,7 @@ class dn {
           throw new d(s.token, n(), s.handlerContext);
         this.synchronizeElementDeclarationName();
       }
-    if (lt(this.peek()))
+    if (ut(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
@@ -1388,7 +1388,7 @@ class dn {
   }
   /* Parsing any ExpressionNode, including non-NormalExpression */
   expression() {
-    const e = { args: [] }, n = () => on(e.callee, e.args, this.nodeFactory).unwrap_or(
+    const e = { args: [] }, n = () => ln(e.callee, e.args, this.nodeFactory).unwrap_or(
       this.nodeFactory.create(w, e)
     );
     try {
@@ -1410,7 +1410,7 @@ class dn {
     return n();
   }
   shouldStopExpression() {
-    if (this.isAtEnd() || bt(this.previous()))
+    if (this.isAtEnd() || It(this.previous()))
       return !0;
     const e = this.peek().kind;
     return e === u.RBRACE || e === u.RBRACKET || e === u.RPAREN || e === u.COMMA || e === u.COLON;
@@ -1424,12 +1424,12 @@ class dn {
     for (; !this.isAtEnd(); ) {
       const s = this.peek();
       if (s.kind === u.LPAREN) {
-        const { left: i } = ut(s);
+        const { left: i } = ht(s);
         if (i < e || // When '(' is encountered,
         // consider it part of another expression if
         // it's at the start of a new line
         // and we're currently not having unmatched '(' or '['
-        ot(this.previous(), s) && !this.contextStack.isWithinGroupExpressionContext() && !this.contextStack.isWithinListExpressionContext())
+        lt(this.previous(), s) && !this.contextStack.isWithinGroupExpressionContext() && !this.contextStack.isWithinListExpressionContext())
           break;
         try {
           n = this.nodeFactory.create(H, {
@@ -1456,8 +1456,8 @@ class dn {
             indexer: i.partialNode
           }), new d(i.token, n, i.handlerContext)) : i;
         }
-      } else if (at(s)) {
-        const i = s, r = ut(i);
+      } else if (ot(s)) {
+        const i = s, r = ht(i);
         if (r.left !== null) {
           if (r.left <= e)
             break;
@@ -1466,7 +1466,7 @@ class dn {
             op: i
           });
         } else {
-          const a = Nn(i);
+          const a = mn(i);
           if (a.left === null || a.left <= e)
             break;
           this.advance();
@@ -1491,10 +1491,10 @@ class dn {
   }
   leftExpression_bp() {
     let e;
-    if (at(this.peek())) {
+    if (ot(this.peek())) {
       const n = {};
       n.op = this.peek();
-      const s = Tn(n.op);
+      const s = bn(n.op);
       if (s.right === null)
         throw this.logError(
           n.op,
@@ -1638,7 +1638,7 @@ class dn {
     this.errors.push(new c(n, s, e));
   }
 }
-const En = {
+const Nn = {
   "+": { left: 9, right: 10 },
   "*": { left: 11, right: 12 },
   "-": { left: 9, right: 10 },
@@ -1654,10 +1654,10 @@ const En = {
   "!=": { left: 4, right: 5 },
   ".": { left: 16, right: 17 }
 };
-function Nn(t) {
-  return En[t.value] || { left: null, right: null };
+function mn(t) {
+  return Nn[t.value] || { left: null, right: null };
 }
-const mn = {
+const Tn = {
   "+": { left: null, right: 15 },
   "-": { left: null, right: 15 },
   "<": { left: null, right: 15 },
@@ -1665,14 +1665,14 @@ const mn = {
   "<>": { left: null, right: 15 },
   "!": { left: null, right: 15 }
 };
-function Tn(t) {
-  return mn[t.value] || { left: null, right: null };
+function bn(t) {
+  return Tn[t.value] || { left: null, right: null };
 }
-const bn = {
+const In = {
   "(": { left: 14, right: null }
 };
-function ut(t) {
-  return bn[t.value] || { left: null, right: null };
+function ht(t) {
+  return In[t.value] || { left: null, right: null };
 }
 var b = /* @__PURE__ */ ((t) => (t.Table = "table", t.Enum = "enum", t.Ref = "ref", t.Note = "note", t.Project = "project", t.Indexes = "indexes", t.TableGroup = "tablegroup", t))(b || {});
 function ve(t) {
@@ -1688,51 +1688,51 @@ 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))) {
     const i = e.pop();
-    if (xt(i))
+    if (Ot(i))
       s = i.elementList.map(
         (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,45 +1741,45 @@ 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))
+  if (ft(t))
     return t instanceof ne ? new S({ functional: [t], nonFunctional: [] }) : new S({ functional: [], nonFunctional: [t] });
-  if (t instanceof Z && t.elementList.every(ht)) {
+  if (t instanceof Z && t.elementList.every(ft)) {
     const e = t.elementList.filter(
       (s) => s instanceof ne
     ), 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) {
+function Ln(t) {
   var e;
-  return !(t instanceof q) || !kt((e = t.op) == null ? void 0 : e.value) ? !1 : _e(t.leftExpression).and_then(() => _e(t.rightExpression)).unwrap_or(void 0) !== void 0;
+  return !(t instanceof q) || !xt((e = t.op) == null ? void 0 : e.value) ? !1 : _e(t.leftExpression).and_then(() => _e(t.rightExpression)).unwrap_or(void 0) !== void 0;
 }
-function Ln(t) {
+function gn(t) {
   const e = _e(t.leftExpression), n = _e(t.rightExpression);
   if (!e.isOk() || !n.isOk())
     return !1;
   const { tupleElements: s } = e.unwrap(), { tupleElements: i } = n.unwrap();
   return (s == null ? void 0 : s.length) === (i == null ? void 0 : i.length);
 }
-function ht(t) {
+function ft(t) {
   return t instanceof U && t.expression instanceof K || t instanceof ne;
 }
-function gn(t, e) {
+function _n(t, e) {
   var i, r, a, l;
   let n = e;
-  const s = Jt(t);
+  const s = Zt(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);
@@ -1790,7 +1790,7 @@ function gn(t, e) {
     n = n.parent;
   }
 }
-class _n {
+class An {
   constructor(e, n, s) {
     this.declarationNode = e, this.publicSymbolTable = n, this.symbolFactory = s;
   }
@@ -1835,7 +1835,7 @@ class we {
     return this.table.entries();
   }
 }
-class An {
+class vn {
   constructor(e, n, s) {
     this.declarationNode = e, this.publicSymbolTable = n, this.symbolFactory = s;
   }
@@ -1846,14 +1846,14 @@ class An {
     return this.declarationNode.parent instanceof v ? [new c(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 ? kt(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)];
   }
   validateAlias(e) {
     return e ? [new c(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() });
+    this.declarationNode.symbol = this.symbolFactory.create(nn, { 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);
@@ -1906,7 +1906,7 @@ class An {
   }
   registerField(e) {
     if (e.callee && M(e.callee)) {
-      const n = C(e.callee).unwrap(), s = Qe(n), i = this.symbolFactory.create(nn, { declaration: e });
+      const n = C(e.callee).unwrap(), s = Qe(n), i = this.symbolFactory.create(sn, { declaration: e });
       e.symbol = i;
       const r = this.declarationNode.symbol.symbolTable;
       if (r.has(s)) {
@@ -1921,7 +1921,7 @@ class An {
     return [];
   }
 }
-class vn {
+class wn {
   constructor(e, n, s) {
     this.declarationNode = e, this.publicSymbolTable = n, this.symbolFactory = s;
   }
@@ -1997,7 +1997,7 @@ class vn {
     });
   }
 }
-class wn {
+class yn {
   constructor(e, n, s) {
     this.declarationNode = e, this.publicSymbolTable = n, this.symbolFactory = s;
   }
@@ -2029,7 +2029,7 @@ class wn {
     const n = W(e);
     if (!n.isOk())
       return [new c(o.INVALID_NAME, "Invalid name for sticky note ", this.declarationNode)];
-    const i = n.unwrap().join("."), r = Ht(i);
+    const i = n.unwrap().join("."), r = Jt(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), []);
   }
   validateAlias(e) {
@@ -2059,7 +2059,7 @@ class wn {
     });
   }
 }
-class yn {
+class kn {
   constructor(e, n, s) {
     this.declarationNode = e, this.publicSymbolTable = n, this.symbolFactory = s;
   }
@@ -2098,7 +2098,7 @@ class yn {
     });
   }
 }
-class kn {
+class xn {
   constructor(e, n, s) {
     this.declarationNode = e, this.publicSymbolTable = n, this.symbolFactory = s;
   }
@@ -2130,7 +2130,7 @@ class kn {
       return [new c(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));
+      s.callee && !Ln(s.callee) && n.push(new c(o.INVALID_REF_FIELD, "A Ref field must be a binary relationship", s.callee)), s.callee && !gn(s.callee) && n.push(new c(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)));
     }), n;
@@ -2143,7 +2143,7 @@ class kn {
         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));
+            Sn(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));
           });
           break;
         default:
@@ -2161,7 +2161,7 @@ class kn {
     });
   }
 }
-function xn(t) {
+function Sn(t) {
   if (!(M(t) && t.expression.variable.kind !== u.QUOTED_STRING) && !(t instanceof Y))
     return !1;
   let e;
@@ -2178,7 +2178,7 @@ function xn(t) {
     }
   return !1;
 }
-class Sn {
+class On {
   constructor(e, n, s) {
     this.declarationNode = e, this.symbolFactory = s, this.publicSymbolTable = n;
   }
@@ -2189,10 +2189,10 @@ class Sn {
     return this.declarationNode.parent instanceof v ? [new c(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 c(o.INVALID_NAME, "Invalid array as Table name, maybe you forget to add a space between the name and the setting list?", e)] : kt(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)];
   }
   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 ? Un(e) ? [] : [new c(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();
@@ -2201,7 +2201,7 @@ class Sn {
       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));
+            St(l.value) || s.push(new c(o.INVALID_TABLE_SETTING, "'headercolor' must be a color literal", l.value || l.name));
           });
           break;
         case "note":
@@ -2217,13 +2217,13 @@ class Sn {
   }
   registerElement() {
     const e = [];
-    this.declarationNode.symbol = this.symbolFactory.create(At, { declaration: this.declarationNode, symbolTable: new we() });
+    this.declarationNode.symbol = this.symbolFactory.create(vt, { 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);
     }
-    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);
     }
@@ -2242,14 +2242,14 @@ class Sn {
       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 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] && !Dn(n.args[0]) && s.push(new c(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;
     });
   }
   registerField(e) {
     if (e.callee && M(e.callee)) {
-      const n = C(e.callee).unwrap(), s = Ye(n), i = this.symbolFactory.create(sn, { declaration: e });
+      const n = C(e.callee).unwrap(), s = Ye(n), i = this.symbolFactory.create(rn, { declaration: e });
       e.symbol = i;
       const r = this.declarationNode.symbol.symbolTable;
       if (r.has(s)) {
@@ -2351,7 +2351,7 @@ class Sn {
     return s.length > 1 && n.push(...s.map((i) => new c(o.NOTE_REDEFINED, "Duplicate notes are defined", i))), n;
   }
 }
-function On(t) {
+function Dn(t) {
   if (!(t instanceof H || Je(t) || t instanceof U || t instanceof he))
     return !1;
   if (t instanceof H) {
@@ -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 Pn {
   constructor(e, n, s) {
     this.declarationNode = e, this.publicSymbolTable = n, this.symbolFactory = s;
   }
@@ -2411,7 +2411,7 @@ class Rn {
   }
   registerElement() {
     const { name: e } = this.declarationNode;
-    this.declarationNode.symbol = this.symbolFactory.create(rn, { declaration: this.declarationNode, symbolTable: new we() });
+    this.declarationNode.symbol = this.symbolFactory.create(an, { declaration: this.declarationNode, symbolTable: new we() });
     const n = W(e);
     if (n.isOk()) {
       const s = n.unwrap(), i = s.pop(), r = Ze(s, this.publicSymbolTable, this.symbolFactory), a = qe(i);
@@ -2425,12 +2425,18 @@ class Rn {
     const n = B(e), s = n.getErrors(), i = n.getValue();
     return I.forIn(i, (r, a) => {
       switch (a) {
-        case "headercolor":
-          s.push(...r.map((l) => new c(
-            o.INVALID_TABLE_SETTING,
-            "'headercolor' is not supported",
+        case "color":
+          r.length > 1 && s.push(...r.map((l) => new c(
+            o.DUPLICATE_TABLE_SETTING,
+            "'color' can only appear once",
             l
-          )));
+          ))), r.forEach((l) => {
+            St(l.value) || s.push(new c(
+              o.INVALID_TABLE_SETTING,
+              "'color' must be a color literal",
+              l.value || l.name
+            ));
+          });
           break;
         case "note":
           r.length > 1 && s.push(...r.map((l) => new c(
@@ -2490,7 +2496,7 @@ class Rn {
   }
   registerField(e) {
     if (e.callee && M(e.callee)) {
-      const n = C(e.callee).unwrap(), s = He(n), i = this.symbolFactory.create(an, { declaration: e });
+      const n = C(e.callee).unwrap(), s = He(n), i = this.symbolFactory.create(on, { declaration: e });
       e.symbol = i;
       const r = this.declarationNode.symbol.symbolTable;
       if (r.has(s)) {
@@ -2505,31 +2511,31 @@ class Rn {
     return [];
   }
 }
-const wt = ["-", "+"];
+const yt = ["-", "+"];
 function ae(t) {
   switch (t.type.value.toLowerCase()) {
     case b.Enum:
-      return An;
+      return vn;
     case b.Table:
-      return Sn;
+      return On;
     case b.TableGroup:
-      return Rn;
+      return Pn;
     case b.Project:
-      return yn;
-    case b.Ref:
       return kn;
+    case b.Ref:
+      return xn;
     case b.Note:
-      return wn;
+      return yn;
     case b.Indexes:
-      return vn;
+      return wn;
     default:
-      return _n;
+      return An;
   }
 }
-function yt(t) {
+function kt(t) {
   return !!W(t).unwrap_or(!1);
 }
-function Pn(t) {
+function Un(t) {
   return ye(t);
 }
 function ye(t) {
@@ -2547,17 +2553,17 @@ function Ze(t, e, n) {
         throw new Error("Expect a symbol table in a schema symbol");
     } else {
       a = new we();
-      const p = n.create(_t, { symbolTable: a });
+      const p = n.create(At, { symbolTable: a });
       s.set(l, p);
     }
     s = a;
   }
   return s;
 }
-function kt(t) {
+function xt(t) {
   return t === "-" || t === "<>" || t === ">" || t === "<";
 }
-function Un(t) {
+function St(t) {
   var n;
   if (!(t instanceof U) || !(t.expression instanceof be) || ((n = t.expression.literal) == null ? void 0 : n.kind) !== u.COLOR_LITERAL)
     return !1;
@@ -2565,7 +2571,7 @@ function Un(t) {
   if (e.length !== 4 && e.length !== 7 || e[0] !== "#")
     return !1;
   for (let s = 1; s < e.length; s += 1)
-    if (!Kt(e[s]))
+    if (!en(e[s]))
       return !1;
   return !0;
 }
@@ -2574,7 +2580,7 @@ function ue(t) {
 }
 function Mn(t) {
   var e;
-  return !!($(t) || fe(t) || me(t) && ["true", "false", "null"].includes(t.expression.variable.value.toLowerCase()) || t instanceof Q && wt.includes((e = t.op) == null ? void 0 : e.value) && fe(t.expression) || t instanceof ne);
+  return !!($(t) || fe(t) || me(t) && ["true", "false", "null"].includes(t.expression.variable.value.toLowerCase()) || t instanceof Q && yt.includes((e = t.op) == null ? void 0 : e.value) && fe(t.expression) || t instanceof ne);
 }
 function fe(t) {
   var e;
@@ -2582,12 +2588,12 @@ function fe(t) {
 }
 function Fn(t) {
   var n;
-  if (!(t instanceof Q) || !kt((n = t.op) == null ? void 0 : n.value))
+  if (!(t instanceof Q) || !xt((n = t.op) == null ? void 0 : n.value))
     return !1;
   const e = W(t.expression).unwrap_or(void 0);
   return e !== void 0 && e.length > 0;
 }
-function xt(t) {
+function Ot(t) {
   return t instanceof Z && t.elementList.every(M);
 }
 function B(t) {
@@ -2607,9 +2613,9 @@ function B(t) {
   }
   return new V(e, n);
 }
-class ft {
+class pt {
   constructor(e, n) {
-    this.ast = e, this.symbolFactory = n, this.publicSchemaSymbol = this.symbolFactory.create(_t, {
+    this.ast = e, this.symbolFactory = n, this.publicSchemaSymbol = this.symbolFactory.create(At, {
       symbolTable: new we()
     }), this.ast.symbol = this.publicSchemaSymbol, this.ast.symbol.declaration = this.ast;
   }
@@ -2658,7 +2664,7 @@ class oe {
         if (s instanceof v) {
           if (!s.type)
             continue;
-          const i = St(s);
+          const i = Dt(s);
           new i(s, this.errors).bind();
         } else
           this.bindSubfield(s);
@@ -2689,7 +2695,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)), l = r !== -1 && Ot(e[r]) ? e[r] : void 0, p = r >= 0 ? s.pop() : void 0, f = e.slice(
       0,
       r === -1 ? void 0 : r
     );
@@ -2731,7 +2737,7 @@ class oe {
   resolveIndexStack(e, n) {
     if (e.length === 0)
       throw new Error("Unreachable - An unresolved name must have at least one name component");
-    const [s, ...i] = e, r = gn(s.index, this.declarationNode);
+    const [s, ...i] = e, r = _n(s.index, this.declarationNode);
     if (r === void 0) {
       const { kind: f, name: E } = ie(s.index).unwrap();
       this.logError(s.referrer, `Can not find ${f} '${E}'`, n);
@@ -2895,7 +2901,7 @@ class jn extends oe {
     }, this.settingList = {};
   }
 }
-function St(t) {
+function Dt(t) {
   switch (t.type.value.toLowerCase()) {
     case b.Enum:
       return Vn;
@@ -2922,7 +2928,7 @@ class Yn {
   resolve() {
     for (const e of this.ast.body)
       if (e.type) {
-        const n = St(e);
+        const n = Dt(e);
         new n(e, this.errors).bind();
       }
     return new V(this.ast, this.errors);
@@ -2942,14 +2948,14 @@ class Qn {
   }
   // Analyzing: Invoking both the validator and binder
   analyze() {
-    return new ft(this.ast, this.symbolFactory).validate().chain((n) => new Yn(n).resolve());
+    return new pt(this.ast, this.symbolFactory).validate().chain((n) => new Yn(n).resolve());
   }
   // For invoking the validator only
   validate() {
-    return new ft(this.ast, this.symbolFactory).validate().chain((n) => new V(n, []));
+    return new pt(this.ast, this.symbolFactory).validate().chain((n) => new V(n, []));
   }
 }
-function pt(t, e) {
+function dt(t, e) {
   const { variables: n, tupleElements: s } = _e(t).unwrap();
   return s ? n.length === 0 ? {
     schemaName: e.schemaName,
@@ -2969,7 +2975,7 @@ function pt(t, e) {
     schemaName: n.pop() || null
   };
 }
-function Ot(t) {
+function Rt(t) {
   switch (t) {
     case "<":
       return ["1", "*"];
@@ -3004,10 +3010,10 @@ function Ie(t) {
     schemaName: e
   };
 }
-function Dt(t) {
+function Ke(t) {
   return t.expression.literal.value;
 }
-function Rt(t, e) {
+function Pt(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}`;
@@ -3015,7 +3021,7 @@ function Rt(t, e) {
   const n = t.id.toString(), s = e.id.toString();
   return n < s ? `${n}-${s}` : `${s}-${n}`;
 }
-function Pt(t, e) {
+function Ut(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);
@@ -3029,7 +3035,7 @@ function re(t) {
   return n.map((r) => r.slice(i)).join(`
 `);
 }
-class Ut {
+class Mt {
   constructor(e, n) {
     this.declarationNode = e, this.env = n, this.table = { name: void 0, schemaName: void 0, alias: null, fields: [], token: void 0, indexes: [] }, this.pkColumns = [];
   }
@@ -3072,7 +3078,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 ? Ke((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(),
@@ -3116,53 +3122,53 @@ class Ut {
         value: G(ee.value).map(re).unwrap(),
         token: A(ee)
       };
-      const ce = _.ref || [];
-      s.inline_refs = ce.flatMap((z) => {
-        const [tt] = $e(z.value.expression);
-        if (Pt(tt, e.symbol))
+      const le = _.ref || [];
+      s.inline_refs = le.flatMap((z) => {
+        const [nt] = $e(z.value.expression);
+        if (Ut(nt, e.symbol))
           return n.push(new c(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, it] = te;
           de = {
-            schemaName: le,
+            schemaName: ce,
             tableName: Le,
-            fieldNames: [st],
+            fieldNames: [it],
             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();
+          const ce = te.pop(), Le = te.pop();
           de = {
             schemaName: te.join("."),
             tableName: Le,
-            fieldNames: [le],
+            fieldNames: [ce],
             relation: ke.value,
             token: A(z)
           };
         }
-        const nt = this.registerInlineRefToEnv(e, tt, de, z);
-        return n.push(...nt), nt.length === 0 ? de : [];
+        const st = this.registerInlineRefToEnv(e, nt, de, z);
+        return n.push(...st), st.length === 0 ? de : [];
       });
     }
     return s.pk || (s.pk = r.some((_) => j(_).unwrap().toLowerCase() === "pk")), s.unique || (s.unique = r.some((_) => j(_).unwrap().toLowerCase() === "unique")), this.table.fields.push(s), s.pk && this.pkColumns.push(s), n;
@@ -3171,7 +3177,7 @@ class Ut {
     return this.table.indexes.push(...e.body.body.map((n) => {
       var a, l, 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) {
         const g = B(r.pop()).getValue();
@@ -3192,28 +3198,28 @@ 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 = Pt(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])
       ];
-    const a = Ot(s.relation);
+    const a = Rt(s.relation);
     return this.env.refIds[r] = i, this.env.ref.set(i, {
       name: null,
       schemaName: null,
@@ -3272,7 +3278,7 @@ function Hn(t) {
         value: t.expression.variable.value.toLowerCase(),
         type: "boolean"
       };
-    if (t instanceof Q && wt.includes((e = t.op) == null ? void 0 : e.value) && fe(t.expression)) {
+    if (t instanceof Q && yt.includes((e = t.op) == null ? void 0 : e.value) && fe(t.expression)) {
       const i = Number.parseFloat(t.expression.expression.literal.value);
       return {
         value: ((n = t.op) == null ? void 0 : n.value) === "-" ? 0 - i : i,
@@ -3305,7 +3311,7 @@ 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 ? Ke((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);
@@ -3318,7 +3324,7 @@ class Jn {
     return this.note.content = re(n), [];
   }
 }
-class Mt {
+class Ft {
   constructor(e, n) {
     this.declarationNode = e, this.env = n, this.container = this.declarationNode.parent instanceof v ? this.env.tables.get(this.declarationNode.parent) : void 0, this.ref = {};
   }
@@ -3335,9 +3341,9 @@ class Mt {
   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))
+    if (Ut(r, a))
       return [new c(o.SAME_ENDPOINT, "Two endpoints are the same", e)];
-    const l = Rt(r, a);
+    const l = Pt(r, a);
     if (this.env.refIds[l])
       return [
         new c(o.CIRCULAR_REF, "References with same endpoints exist", this.declarationNode),
@@ -3349,22 +3355,22 @@ class Mt {
       const ee = (m = (h = g.update) == null ? void 0 : h.at(0)) == null ? void 0 : m.value;
       this.ref.onUpdate = ee instanceof Y ? Te(ee).unwrap_or(void 0) : j(ee).unwrap_or(void 0);
     }
-    const p = Ot(n);
+    const p = Rt(n);
     return this.ref.endpoints = [
       {
-        ...pt(s, this.container),
+        ...dt(s, this.container),
         relation: p[0],
         token: A(s)
       },
       {
-        ...pt(i, this.container),
+        ...dt(i, this.container),
         relation: p[1],
         token: A(i)
       }
     ], this.env.refIds[l] = this.declarationNode, [];
   }
 }
-class Ft {
+class Bt {
   constructor(e, n) {
     this.declarationNode = e, this.env = n, this.tableGroup = { tables: [] };
   }
@@ -3381,7 +3387,7 @@ class Ft {
     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;
   }
   interpretBody(e) {
-    const [n, s] = jt(e.body, (i) => i instanceof w);
+    const [n, s] = Yt(e.body, (i) => i instanceof w);
     return [
       ...this.interpretFields(n),
       ...this.interpretSubElements(s)
@@ -3421,14 +3427,17 @@ class Ft {
     }), n;
   }
   interpretSettingList(e) {
-    const n = B(e).getValue(), [s] = n.note || [];
+    var i, r, a;
+    const n = B(e).getValue();
+    this.tableGroup.color = (i = n.color) != null && i.length ? Ke((a = (r = n.color) == null ? void 0 : r.at(0)) == null ? void 0 : a.value) : void 0;
+    const [s] = n.note || [];
     return this.tableGroup.note = s && {
       value: G(s == null ? void 0 : s.value).map(re).unwrap(),
       token: A(s)
     }, [];
   }
 }
-class Bt {
+class Vt {
   constructor(e, n) {
     this.declarationNode = e, this.env = n, this.enum = { values: [] };
   }
@@ -3471,19 +3480,19 @@ class Zn {
       const s = n;
       switch ((i = s.type) == null ? void 0 : i.value.toLowerCase()) {
         case "table": {
-          const r = new Ut(s, this.env).interpret();
+          const r = new Mt(s, this.env).interpret();
           return this.project.tables.push(this.env.tables.get(s)), r;
         }
         case "ref": {
-          const r = new Mt(s, this.env).interpret();
+          const r = new Ft(s, this.env).interpret();
           return this.project.refs.push(this.env.ref.get(s)), r;
         }
         case "tablegroup": {
-          const r = new Ft(s, this.env).interpret();
+          const r = new Bt(s, this.env).interpret();
           return this.project.tableGroups.push(this.env.tableGroups.get(s)), r;
         }
         case "enum": {
-          const r = new Bt(s, this.env).interpret();
+          const r = new Vt(s, this.env).interpret();
           return this.project.enums.push(this.env.enums.get(s)), r;
         }
         case "note":
@@ -3516,15 +3525,15 @@ class Kn {
     const e = this.ast.body.flatMap((n) => {
       switch (ve(n).unwrap_or(void 0)) {
         case b.Table:
-          return new Ut(n, this.env).interpret();
+          return new Mt(n, this.env).interpret();
         case b.Note:
           return new Jn(n, this.env).interpret();
         case b.Ref:
-          return new Mt(n, this.env).interpret();
-        case b.TableGroup:
           return new Ft(n, this.env).interpret();
-        case b.Enum:
+        case b.TableGroup:
           return new Bt(n, this.env).interpret();
+        case b.Enum:
+          return new Vt(n, this.env).interpret();
         case b.Project:
           return new Zn(n, this.env).interpret();
         default:
@@ -3546,7 +3555,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 || {}), y = /* @__PURE__ */ ((t) => (t[t.None = 0] = "None", t[t.KeepWhitespace = 1] = "KeepWhitespace", t[t.InsertAsSnippet = 4] = "InsertAsSnippet", t))(y || {});
 function Ae(t) {
   switch (t) {
     case T.Schema:
@@ -3578,7 +3587,7 @@ function Re(t, e) {
   }
   return !0;
 }
-function O() {
+function D() {
   return {
     suggestions: []
   };
@@ -3601,29 +3610,29 @@ function Fe(t) {
     }))
   };
 }
-function Ke(t, e) {
+function et(t, e) {
   return t.getOffsetAt(e);
 }
-class Vt {
+class Gt {
   constructor(e, n = []) {
     this.compiler = e, this.triggerCharacters = n;
   }
   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 = et(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];
     if ([
       ...(r == null ? void 0 : r.trailingTrivia) || [],
       ...(r == null ? void 0 : r.leadingTrivia) || [],
       ...(l == null ? void 0 : l.leadingTrivia) || []
-    ].find((m) => Qt(m) && ge(s, m)))
-      return O();
+    ].find((m) => qt(m) && ge(s, m)))
+      return D();
     if (a === void 0)
-      return Tt();
+      return bt();
     if ([u.STRING_LITERAL, u.QUOTED_STRING].includes(r.kind) && ge(s, r))
-      return O();
+      return D();
     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)
-      return Tt();
+    if (this.compiler.container.scopeKind(s) === O.TOPLEVEL || p instanceof v && p.type && p.type.start <= s && p.type.end >= s)
+      return bt();
     const f = [...this.compiler.container.stack(s)].reverse();
     for (const m of f)
       if (m instanceof Q)
@@ -3632,7 +3641,7 @@ class Vt {
           case "<":
           case "<>":
           case "-":
-            return dt(
+            return Et(
               this.compiler,
               s,
               m
@@ -3644,13 +3653,13 @@ class Vt {
           case "<":
           case "<>":
           case "-":
-            return dt(
+            return Et(
               this.compiler,
               s,
               m
             );
           case ".":
-            return Gt(
+            return Ct(
               this.compiler,
               s,
               m
@@ -3658,22 +3667,22 @@ class Vt {
         }
       else {
         if (m instanceof se)
-          return Et(this.compiler, s, m);
+          return Nt(this.compiler, s, m);
         if (m instanceof R)
-          return Et(this.compiler, s, m);
+          return Nt(this.compiler, s, m);
         if (m instanceof Z)
           return ts(this.compiler, s);
         if (m instanceof w)
-          return mt(this.compiler, s, m);
+          return Tt(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 Tt(this.compiler, s, void 0);
       }
-    return O();
+    return D();
   }
 }
-function dt(t, e, n) {
+function Et(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,
@@ -3681,12 +3690,12 @@ function dt(t, e, n) {
     ]);
     return Re(n.op, e) ? Pe(i) : i;
   }
-  return O();
+  return D();
 }
 function Be(t, e, n, s) {
   var a;
   if (n === void 0)
-    return O();
+    return D();
   let i = n;
   const r = { suggestions: [] };
   for (; i; ) {
@@ -3696,7 +3705,7 @@ function Be(t, e, n, s) {
         ...t.symbol.members(l).filter(({ kind: p }) => s.includes(p)).map(({ name: p, kind: f }) => ({
           label: p,
           insertText: p,
-          insertTextRules: k.KeepWhitespace,
+          insertTextRules: y.KeepWhitespace,
           kind: Ae(f),
           sortText: Ae(f).toString().padStart(2, "0"),
           range: void 0
@@ -3710,33 +3719,33 @@ function Be(t, e, n, s) {
 function ts(t, e) {
   var s;
   switch (t.container.scopeKind(e)) {
-    case D.INDEXES:
-      return Xt(t, e);
-    case D.REF:
+    case O.INDEXES:
+      return $t(t, e);
+    case O.REF:
       {
         const i = [...t.container.stack(e)];
         for (; i.length > 0; ) {
           const r = i.pop();
           if (r instanceof q && ((s = r.op) == null ? void 0 : s.value) === ".")
-            return Gt(
+            return Ct(
               t,
               e,
               r
             );
         }
       }
-      return Ct(t, e);
+      return Xt(t, e);
   }
-  return O();
+  return D();
 }
-function Et(t, e, n) {
+function Nt(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);
+    const i = mt(t, e);
     return (s == null ? void 0 : s.kind) === u.COMMA && Re(s, e) ? Pe(i) : i;
   }
   if (n.name && n.name.start <= e && n.name.end >= e)
-    return Nt(t, e);
+    return mt(t, e);
   if (n.name instanceof Y) {
     const i = ns(
       t,
@@ -3745,82 +3754,83 @@ function Et(t, e, n) {
     );
     return (s == null ? void 0 : s.kind) === u.COLON && Re(s, e) ? Pe(i) : i;
   }
-  return O();
+  return D();
 }
-function Nt(t, e) {
+function mt(t, e) {
   const n = t.container.element(e), s = t.container.scopeKind(e);
   if (n instanceof X)
-    return O();
+    return D();
   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,
-              range: void 0
-            },
-            {
-              label: "note",
-              insertText: "note: ",
-              kind: L.Field,
-              insertTextRules: k.KeepWhitespace,
-              range: void 0
-            }
-          ]
+          suggestions: ["headercolor", "note"].map((i) => ({
+            label: i,
+            insertText: `${i}: `,
+            kind: L.Field,
+            insertTextRules: y.KeepWhitespace,
+            range: void 0
+          }))
+        };
+      case O.TABLEGROUP:
+        return {
+          suggestions: ["color", "note"].map((i) => ({
+            label: i,
+            insertText: `${i}: `,
+            kind: L.Field,
+            insertTextRules: y.KeepWhitespace,
+            range: void 0
+          }))
         };
       default:
-        return O();
+        return D();
     }
   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: y.KeepWhitespace,
             range: void 0
           })),
           ...["ref", "default"].map((i) => ({
             label: i,
             insertText: `${i}: `,
             kind: L.Property,
-            insertTextRules: k.KeepWhitespace,
+            insertTextRules: y.KeepWhitespace,
             range: void 0
           })),
           {
             label: "note",
             insertText: "note: ",
             kind: L.Property,
-            insertTextRules: k.KeepWhitespace,
+            insertTextRules: y.KeepWhitespace,
             range: void 0
           }
         ]
       };
-    case D.ENUM:
+    case O.ENUM:
       return {
         suggestions: [
           {
             label: "note",
             insertText: "note: ",
             kind: L.Property,
-            insertTextRules: k.KeepWhitespace,
+            insertTextRules: y.KeepWhitespace,
             range: void 0
           }
         ]
       };
-    case D.INDEXES:
+    case O.INDEXES:
       return {
         suggestions: [
           ...["unique", "pk"].map((i) => ({
             label: i,
             insertText: i,
-            insertTextRules: k.KeepWhitespace,
+            insertTextRules: y.KeepWhitespace,
             kind: L.Property,
             range: void 0
           })),
@@ -3828,23 +3838,23 @@ function Nt(t, e) {
             label: i,
             insertText: `${i}: `,
             kind: L.Property,
-            insertTextRules: k.KeepWhitespace,
+            insertTextRules: y.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: y.KeepWhitespace,
           range: void 0
         }))
       };
   }
-  return O();
+  return D();
 }
 function ns(t, e, n) {
   switch (n == null ? void 0 : n.toLowerCase()) {
@@ -3855,7 +3865,7 @@ function ns(t, e, n) {
           label: s,
           insertText: s,
           kind: L.Value,
-          insertTextRules: k.KeepWhitespace,
+          insertTextRules: y.KeepWhitespace,
           range: void 0
         }))
       };
@@ -3865,17 +3875,17 @@ function ns(t, e, n) {
           label: s,
           insertText: `${s}`,
           kind: L.Value,
-          insertTextRules: k.KeepWhitespace,
+          insertTextRules: y.KeepWhitespace,
           range: void 0
         }))
       };
   }
-  return O();
+  return D();
 }
-function Gt(t, e, n) {
+function Ct(t, e, n) {
   const s = pe(n).unwrap_or([]);
   if (s.pop(), s.some((r) => !M(r)))
-    return O();
+    return D();
   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 }) => ({
@@ -3886,44 +3896,44 @@ function Gt(t, e, n) {
     }))
   });
 }
-function mt(t, e, n) {
+function Tt(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: {
-      const r = Ct(t, e);
+    case O.REF: {
+      const r = Xt(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;
     }
-    case D.TABLEGROUP:
+    case O.TABLEGROUP:
       return as(t);
     default:
-      return O();
+      return D();
   }
 }
-function Tt() {
+function bt() {
   return {
     suggestions: ["Table", "TableGroup", "Enum", "Project", "Ref"].map((t) => ({
       label: t,
       insertText: t,
-      insertTextRules: k.KeepWhitespace,
+      insertTextRules: y.KeepWhitespace,
       kind: L.Keyword,
       range: void 0
     }))
   };
 }
 function ss(t, e, n) {
-  return n != null && n.callee && et(e, n) === 1 ? Be(t, e, t.container.element(e), [
+  return n != null && n.callee && tt(e, n) === 1 ? Be(t, e, t.container.element(e), [
     T.Schema,
     T.Table,
     T.Column
-  ]) : O();
+  ]) : D();
 }
 function is(t, e, n) {
   if (!(n != null && n.callee))
@@ -3931,42 +3941,42 @@ function is(t, e, n) {
       suggestions: ["Note", "indexes"].map((i) => ({
         label: i,
         insertText: i,
-        insertTextRules: k.KeepWhitespace,
+        insertTextRules: y.KeepWhitespace,
         kind: L.Keyword,
         range: void 0
       }))
     };
-  const s = et(e, n);
+  const s = tt(e, n);
   return s === 0 ? {
     suggestions: ["Note", "indexes"].map((i) => ({
       label: i,
       insertText: i,
-      insertTextRules: k.KeepWhitespace,
+      insertTextRules: y.KeepWhitespace,
       kind: L.Keyword,
       range: void 0
     }))
-  } : s === 1 ? cs(t, e) : O();
+  } : s === 1 ? ls(t, e) : D();
 }
 function rs(t, e, n) {
-  return n != null && n.callee ? et(e, n) === 0 ? {
+  return n != null && n.callee ? tt(e, n) === 0 ? {
     suggestions: ["Table", "TableGroup", "Enum", "Note", "Ref"].map((i) => ({
       label: i,
       insertText: i,
-      insertTextRules: k.KeepWhitespace,
+      insertTextRules: y.KeepWhitespace,
       kind: L.Keyword,
       range: void 0
     }))
-  } : O() : {
+  } : D() : {
     suggestions: ["Table", "TableGroup", "Enum", "Note", "Ref"].map((i) => ({
       label: i,
       insertText: i,
-      insertTextRules: k.KeepWhitespace,
+      insertTextRules: y.KeepWhitespace,
       kind: L.Keyword,
       range: void 0
     }))
   };
 }
-function Ct(t, e) {
+function Xt(t, e) {
   return Be(t, e, t.container.element(e), [
     T.Schema,
     T.Table,
@@ -3974,26 +3984,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: y.KeepWhitespace,
+            kind: Ae(s),
+            range: void 0
+          };
+        })
+      }).suggestions,
+      ...["Note"].map((e) => ({
+        label: e,
+        insertText: e,
+        insertTextRules: y.KeepWhitespace,
+        kind: L.Keyword,
         range: void 0
-      };
-    })
-  });
+      }))
+    ]
+  };
 }
 function os(t, e) {
-  return Xt(t, e);
+  return $t(t, e);
 }
-function cs(t, e) {
+function ls(t, e) {
   return {
     suggestions: [
       ...[
@@ -4056,7 +4077,7 @@ function cs(t, e) {
       ].map((n) => ({
         label: n,
         insertText: n,
-        insertTextRules: k.KeepWhitespace,
+        insertTextRules: y.KeepWhitespace,
         kind: L.TypeParameter,
         sortText: L.TypeParameter.toString().padStart(2, "0"),
         range: void 0
@@ -4068,10 +4089,10 @@ function cs(t, e) {
     ]
   };
 }
-function Xt(t, e) {
+function $t(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();
+  if (!((s == null ? void 0 : s.symbol) instanceof vt))
+    return D();
   const { symbolTable: i } = s.symbol;
   return Fe({
     suggestions: [...i.entries()].flatMap(([r]) => {
@@ -4082,26 +4103,26 @@ function Xt(t, e) {
       return {
         label: l,
         insertText: l,
-        insertTextRules: k.KeepWhitespace,
+        insertTextRules: y.KeepWhitespace,
         kind: Ae(T.Column),
         range: void 0
       };
     })
   });
 }
-function et(t, e) {
+function tt(t, e) {
   if (!e.callee)
     return -1;
   const n = [e.callee, ...e.args], s = n.findIndex((i) => t <= i.end);
   return s === -1 ? n.length : s;
 }
-class $t {
+class Wt {
   constructor(e) {
     this.compiler = e;
   }
   provideDefinition(e, n) {
     var a;
-    const { uri: s } = e, i = Ke(e, n), r = [...this.compiler.container.stack(i)];
+    const { uri: s } = e, i = et(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)) {
@@ -4122,12 +4143,12 @@ class $t {
     return [];
   }
 }
-class Wt {
+class jt {
   constructor(e) {
     this.compiler = e;
   }
   provideReferences(e, n) {
-    const { uri: s } = e, i = Ke(e, n), r = [...this.compiler.container.stack(i)];
+    const { uri: s } = e, i = et(e, n), r = [...this.compiler.container.stack(i)];
     for (; r.length !== 0; ) {
       const a = r.pop();
       if (a && [
@@ -4153,22 +4174,22 @@ class Wt {
 }
 const hs = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  CompletionItemInsertTextRule: k,
+  CompletionItemInsertTextRule: y,
   CompletionItemKind: L,
-  DBMLCompletionItemProvider: Vt,
-  DBMLDefinitionProvider: $t,
-  DBMLReferencesProvider: Wt
+  DBMLCompletionItemProvider: Gt,
+  DBMLDefinitionProvider: Wt,
+  DBMLReferencesProvider: jt
 }, 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(
       16
       /* TOTAL_QUERY_COUNT */
-    ).fill(null), this.nodeIdGenerator = new qt(), this.symbolIdGenerator = new en(), this.token = {
+    ).fill(null), this.nodeIdGenerator = new Ht(), this.symbolIdGenerator = new tn(), this.token = {
       invalidStream: this.createQuery(
         6,
-        () => this.parse.tokens().filter(vt)
+        () => this.parse.tokens().filter(wt)
       ),
       // Valid + Invalid tokens (which are guarenteed to be non-trivials) are included in the stream
       flatStream: this.createQuery(
@@ -4180,7 +4201,7 @@ class fs {
       _: this.createQuery(
         0,
         () => {
-          const e = new hn(this.source).lex().chain((n) => new dn(n, this.nodeIdGenerator).parse()).chain(({ ast: n, tokens: s }) => new Qn(n, this.symbolIdGenerator).analyze().map(() => ({ ast: n, tokens: s })));
+          const e = new fn(this.source).lex().chain((n) => new En(n, this.nodeIdGenerator).parse()).chain(({ ast: n, tokens: s }) => new Qn(n, this.symbolIdGenerator).analyze().map(() => ({ ast: n, tokens: s })));
           return e.getErrors().length > 0 ? e : e.chain(({ ast: n, tokens: s }) => new Kn(n).interpret().map((r) => ({ ast: n, tokens: s, rawDb: r })));
         }
       ),
@@ -4205,14 +4226,14 @@ class fs {
       stack: this.createQuery(
         10,
         (e) => {
-          const n = this.token.flatStream(), { index: s, token: i } = this.container.token(e), r = s === void 0 ? -1 : Yt(n, (f) => !f.isInvalid, s);
+          const n = this.token.flatStream(), { index: s, token: i } = this.container.token(e), r = s === void 0 ? -1 : zt(n, (f) => !f.isInvalid, s);
           if (r === -1)
             return [this.parse.ast()];
           const a = n[r].start;
           let l = this.parse.ast();
           const p = [l];
           for (; ; ) {
-            const E = un(l).find((h) => ge(a, h));
+            const E = hn(l).find((h) => ge(a, h));
             if (E === void 0 || E instanceof F)
               break;
             p.push(E), l = E;
@@ -4221,7 +4242,7 @@ class fs {
             return p;
           for (; p.length > 0; ) {
             let f = !1;
-            const E = it(p);
+            const E = rt(p);
             if (E instanceof w) {
               const h = this.parse.source();
               for (let m = E.end; m < e; m += 1)
@@ -4230,7 +4251,7 @@ class fs {
             } 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);
             if (f) {
-              const h = it(p);
+              const h = rt(p);
               h instanceof v && h.end <= e && p.pop();
             }
             if (!f)
@@ -4311,7 +4332,7 @@ class fs {
             let l = [a], p = [];
             for (const f of e)
               p = l.flatMap(
-                (E) => Zt(f).flatMap((h) => {
+                (E) => Kt(f).flatMap((h) => {
                   const m = E.get(h), g = ie(h).unwrap_or(void 0);
                   return !m || !g ? [] : { ...g, symbol: m };
                 })
@@ -4354,9 +4375,9 @@ class fs {
   }
   initMonacoServices() {
     return {
-      definitionProvider: new $t(this),
-      referenceProvider: new Wt(this),
-      autocompletionProvider: new Vt(this)
+      definitionProvider: new Wt(this),
+      referenceProvider: new jt(this),
+      autocompletionProvider: new Gt(this)
     };
   }
 }