@dbml/parse 3.9.6 → 3.9.7-alpha.0

package/dist/dbml-parse.mjs

@@ -1,4 +1,4 @@
-import I, { last as Ce, partition as zt, findLastIndex as Qt } from "lodash";
+import I, { last as Xe, partition as zt, findLastIndex as Qt } 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 qt(t) {
   switch (t.kind) {
@@ -12,7 +12,7 @@ function qt(t) {
       return !1;
   }
 }
-function at(t) {
+function ot(t) {
   if (!t)
     return !1;
   switch (t) {
@@ -33,31 +33,31 @@ function at(t) {
       return !1;
   }
 }
-function ot(t) {
+function lt(t) {
   return t !== void 0 && t.kind === "<op>";
 }
-class B {
+class V {
   constructor(e, n, s, i, r) {
     this.kind = e, this.startPos = n, this.endPos = s, this.value = i, this.leadingTrivia = [], this.trailingTrivia = [], this.leadingInvalid = [], this.trailingInvalid = [], this.isInvalid = r, this.start = n.offset, this.end = s.offset;
   }
   static create(e, n, s, i, r) {
-    return new B(e, n, s, i, r);
+    return new V(e, n, s, i, r);
   }
 }
-function It(t) {
+function Lt(t) {
   return t.trailingTrivia.find(({ kind: e }) => e === u.NEWLINE) !== void 0;
 }
-function lt(t, e) {
-  return e.leadingTrivia.find(({ kind: s }) => s === u.NEWLINE) !== void 0 || It(t);
+function ct(t, e) {
+  return e.leadingTrivia.find(({ kind: s }) => s === u.NEWLINE) !== void 0 || Lt(t);
 }
-function Xe(t) {
+function $e(t) {
   return t.trailingTrivia.find(({ kind: e }) => [u.SPACE, u.TAB].includes(e)) !== void 0;
 }
-function Lt(t) {
-  return t.trailingTrivia.length === 0 ? t.end : Lt(Ce(t.trailingTrivia));
-}
 function gt(t) {
-  return t.leadingTrivia.length === 0 ? t.start : gt(t.leadingTrivia[0]);
+  return t.trailingTrivia.length === 0 ? t.end : gt(Xe(t.trailingTrivia));
+}
+function _t(t) {
+  return t.leadingTrivia.length === 0 ? t.start : _t(t.leadingTrivia[0]);
 }
 function Ht(t) {
   return [u.SINGLE_LINE_COMMENT, u.MULTILINE_COMMENT].includes(
@@ -81,13 +81,13 @@ class k {
   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 B ? gt(i) : i.fullStart) : (this.startPos = {
+    i ? (this.startPos = i.startPos, this.fullStart = i instanceof V ? _t(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 B ? Lt(r) : r.fullEnd) : (this.endPos = {
+    r ? (this.endPos = r.endPos, this.fullEnd = r instanceof V ? gt(r) : r.fullEnd) : (this.endPos = {
       offset: NaN,
       column: NaN,
       line: NaN
@@ -184,7 +184,7 @@ class P extends k {
   }, r) {
     super(r, "<list-expression>", [
       e,
-      ..._t(n, s),
+      ...At(n, s),
       i
     ]), this.listOpenBracket = e, this.elementList = n, this.commaList = s, this.listCloseBracket = i;
   }
@@ -198,12 +198,12 @@ class K extends k {
   }, r) {
     super(r, "<tuple-expression>", [
       e,
-      ..._t(n, s),
+      ...At(n, s),
       i
     ]), this.tupleOpenParen = e, this.elementList = n, this.commaList = s, this.tupleCloseParen = i;
   }
 }
-class je extends K {
+class Ye extends K {
   constructor({
     groupOpenParen: e,
     expression: n,
@@ -238,14 +238,14 @@ class ee extends k {
     super(n, "<variable>", [e]), this.variable = e;
   }
 }
-class M extends k {
+class F extends k {
   constructor({ expression: e }, n) {
     super(n, "<primary-expression>", [e]), this.expression = e;
   }
 }
 class xe extends k {
   constructor({ pre: e }, n) {
-    const s = B.create(u.SPACE, e.endPos, e.endPos, " ", !1);
+    const s = V.create(u.SPACE, e.endPos, e.endPos, " ", !1);
     super(n, "<dummy>", [s]);
   }
 }
@@ -254,7 +254,7 @@ class he extends k {
     super(s, "<array>", [e, n]), this.array = e, this.indexer = n;
   }
 }
-function _t(t, e) {
+function At(t, e) {
   if (!t || t.length === 0)
     return e || [];
   if (!e || e.length === 0)
@@ -335,46 +335,46 @@ class y {
   }
 }
 var T = /* @__PURE__ */ ((t) => (t.Schema = "Schema", t.Table = "Table", t.Column = "Column", t.TableGroup = "TableGroup", t.TableGroupField = "TableGroup field", t.Enum = "Enum", t.EnumField = "Enum field", t.Note = "Note", t))(T || {});
-function Ye(t) {
+function ze(t) {
   return `Schema:${t}`;
 }
 function Oe(t) {
   return `Table:${t}`;
 }
-function ze(t) {
+function Qe(t) {
   return `Column:${t}`;
 }
-function Qe(t) {
+function qe(t) {
   return `Enum:${t}`;
 }
-function qe(t) {
+function He(t) {
   return `Enum field:${t}`;
 }
-function He(t) {
+function Je(t) {
   return `TableGroup:${t}`;
 }
-function Je(t) {
+function Ze(t) {
   return `TableGroup field:${t}`;
 }
 function Zt(t) {
   return `Note:${t}`;
 }
-function Ve(t, e) {
+function Ge(t, e) {
   switch (e) {
     case "Column":
-      return ze(t);
-    case "Enum":
       return Qe(t);
-    case "Enum field":
+    case "Enum":
       return qe(t);
+    case "Enum field":
+      return He(t);
     case "Schema":
-      return Ye(t);
+      return ze(t);
     case "Table":
       return Oe(t);
     case "TableGroup":
-      return He(t);
-    case "TableGroup field":
       return Je(t);
+    case "TableGroup field":
+      return Ze(t);
     default:
       throw new Error("Unreachable");
   }
@@ -395,13 +395,13 @@ function Kt(t) {
 }
 function en(t) {
   return [
-    Ye,
+    ze,
     Oe,
+    qe,
+    Je,
     Qe,
     He,
-    ze,
-    qe,
-    Je
+    Ze
   ].map((e) => e(t));
 }
 function Me(t) {
@@ -418,7 +418,7 @@ function tn(t) {
 function Ee(t) {
   return Me(t) || De(t);
 }
-function ct(t, e) {
+function ut(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]);
@@ -438,7 +438,7 @@ class nn {
     return this.id++;
   }
 }
-class At {
+class vt {
   constructor({ symbolTable: e }, n) {
     this.references = [], this.id = n, this.symbolTable = e;
   }
@@ -453,7 +453,7 @@ class rn {
     this.references = [], this.id = n, this.declaration = e;
   }
 }
-class vt {
+class wt {
   constructor({ symbolTable: e, declaration: n }, s) {
     this.references = [], this.id = s, this.symbolTable = e, this.declaration = n;
   }
@@ -500,15 +500,15 @@ class G {
 function cn(t, e, n) {
   if (!t || !me(t) || e.length === 0)
     return new y();
-  const s = [...e], i = Ge(t).unwrap(), r = s.pop();
+  const s = [...e], i = Ce(t).unwrap(), r = s.pop();
   if (!(r instanceof Z))
     return new y();
   const a = I.last(s) instanceof P ? s.pop() : void 0;
-  return s.length === 3 && Ge(s[1]).unwrap().value === "as" ? new x(
+  return s.length === 3 && Ce(s[1]).unwrap().value === "as" ? new x(
     n.create(A, {
       type: i,
       name: s[0],
-      as: Ge(s[1]).unwrap(),
+      as: Ce(s[1]).unwrap(),
       alias: s[2],
       attributeList: a,
       body: r
@@ -528,11 +528,11 @@ function cn(t, e, n) {
     })
   ) : new y();
 }
-function ut(t) {
+function ht(t) {
   return t.kind === u.IDENTIFIER && t.value === "as";
 }
 function N(t) {
-  t && (t instanceof B ? un(t) : hn(t));
+  t && (t instanceof V ? un(t) : hn(t));
 }
 function un(t) {
   t.kind !== u.EOF && (t.isInvalid = !0);
@@ -560,7 +560,7 @@ function hn(t) {
     N(t.callee), N(t.argumentList);
   else if (t instanceof v)
     N(t.callee), t.args.forEach(N);
-  else if (t instanceof M)
+  else if (t instanceof F)
     N(t.expression);
   else if (t instanceof se)
     N(t.value);
@@ -569,9 +569,9 @@ function hn(t) {
   else if (t instanceof be)
     N(t.literal);
   else
-    throw t instanceof je ? new Error("This case is handled by the TupleExpressionNode case") : new Error("Unreachable case in markInvalidNode");
+    throw t instanceof Ye ? new Error("This case is handled by the TupleExpressionNode case") : new Error("Unreachable case in markInvalidNode");
 }
-function wt(t) {
+function yt(t) {
   return !!(t != null && t.isInvalid);
 }
 function U(...t) {
@@ -613,41 +613,41 @@ function fn(t) {
   if (t instanceof P)
     return U(
       t.listOpenBracket,
-      ...ct(t.elementList, t.commaList),
+      ...ut(t.elementList, t.commaList),
       t.listCloseBracket
     );
   if (t instanceof K)
     return U(
       t.tupleOpenParen,
-      ...ct(t.elementList, t.commaList),
+      ...ut(t.elementList, t.commaList),
       t.tupleCloseParen
     );
   if (t instanceof J)
     return U(t.callee, t.argumentList);
-  if (t instanceof M)
+  if (t instanceof F)
     return U(t.expression);
   if (t instanceof he)
     return U(
       t.array,
       t.indexer
     );
-  throw t instanceof je ? new Error("This case is already handled by TupleExpressionNode") : new Error("Unreachable - no other possible cases");
+  throw t instanceof Ye ? new Error("This case is already handled by TupleExpressionNode") : new Error("Unreachable - no other possible cases");
 }
-function Ge(t) {
-  return F(t) ? new x(t.expression.variable) : new y();
+function Ce(t) {
+  return B(t) ? new x(t.expression.variable) : new y();
 }
 function W(t) {
   var e;
-  return t instanceof M && (t.expression instanceof ee && t.expression.variable instanceof B && t.expression.variable.kind === u.QUOTED_STRING || t.expression instanceof be && ((e = t.expression.literal) == null ? void 0 : e.kind) === u.STRING_LITERAL);
+  return t instanceof F && (t.expression instanceof ee && t.expression.variable instanceof V && t.expression.variable.kind === u.QUOTED_STRING || t.expression instanceof be && ((e = t.expression.literal) == null ? void 0 : e.kind) === u.STRING_LITERAL);
 }
-function F(t) {
-  return t instanceof M && t.expression instanceof ee && t.expression.variable instanceof B;
+function B(t) {
+  return t instanceof F && t.expression instanceof ee && t.expression.variable instanceof V;
 }
 function me(t) {
   var e;
-  return t instanceof M && t.expression instanceof ee && ((e = t.expression.variable) == null ? void 0 : e.kind) === u.IDENTIFIER;
+  return t instanceof F && t.expression instanceof ee && ((e = t.expression.variable) == null ? void 0 : e.kind) === u.IDENTIFIER;
 }
-function Ze(t) {
+function Ke(t) {
   var e;
   return t instanceof H && t.leftExpression instanceof k && t.rightExpression instanceof k && ((e = t.op) == null ? void 0 : e.value) === ".";
 }
@@ -697,7 +697,7 @@ class pn {
     this.tokens.push(this.createToken(e, n));
   }
   createToken(e, n = !1) {
-    return B.create(
+    return V.create(
       e,
       this.start,
       this.current,
@@ -706,7 +706,7 @@ class pn {
     );
   }
   lex() {
-    return this.scanTokens(), this.tokens.push(B.create(u.EOF, this.start, this.current, "", !1)), this.gatherTrivia(), this.gatherInvalid(), new G(this.tokens, this.errors);
+    return this.scanTokens(), this.tokens.push(V.create(u.EOF, this.start, this.current, "", !1)), this.gatherTrivia(), this.gatherInvalid(), new G(this.tokens, this.errors);
   }
   scanTokens() {
     for (; !this.isAtEnd(); ) {
@@ -767,7 +767,7 @@ class pn {
           this.match("/") ? this.singleLineComment() : this.match("*") ? this.multilineComment() : this.operator();
           break;
         default:
-          if (at(e)) {
+          if (ot(e)) {
             this.operator();
             break;
           }
@@ -801,7 +801,7 @@ class pn {
   gatherInvalid() {
     let e;
     const n = [], s = [];
-    for (e = 0; e < this.tokens.length && wt(this.tokens[e]); e += 1)
+    for (e = 0; e < this.tokens.length && yt(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) {
@@ -843,7 +843,7 @@ class pn {
       );
       return;
     }
-    a && this.match(n), this.tokens.push(B.create(e, this.start, this.current, l, !1));
+    a && this.match(n), this.tokens.push(V.create(e, this.start, this.current, l, !1));
   }
   singleLineStringLiteral() {
     this.consumeUntil(u.STRING_LITERAL, "'", {
@@ -895,7 +895,7 @@ class pn {
     this.addToken(u.IDENTIFIER);
   }
   operator() {
-    for (; at(this.peek()); )
+    for (; ot(this.peek()); )
       this.advance();
     this.addToken(u.OP);
   }
@@ -971,7 +971,7 @@ class pn {
         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`, B.create(u.STRING_LITERAL, e, this.current, `\\u${n}`, !0))), `\\u${n}`;
+            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`, V.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 Nn {
     }, this.synchronizeElementDeclarationName = () => {
       for (; !this.isAtEnd(); ) {
         const s = this.peek();
-        if (ut(s) || this.check(u.COLON, u.LBRACE, u.LBRACKET))
+        if (ht(s) || this.check(u.COLON, u.LBRACE, u.LBRACKET))
           break;
         N(s), this.advance();
       }
@@ -1115,12 +1115,12 @@ class Nn {
       if (!this.check(u.RBRACE))
         for (N(this.advance()); !this.isAtEnd(); ) {
           const s = this.peek();
-          if (this.check(u.RBRACE) || lt(this.previous(), s))
+          if (this.check(u.RBRACE) || ct(this.previous(), s))
             break;
           N(s), this.advance();
         }
     }, this.tupleExpression = this.contextStack.withContextDo(Se.GroupExpression, () => {
-      const s = { elementList: [], commaList: [] }, i = () => this.nodeFactory.create(je, {
+      const s = { elementList: [], commaList: [] }, i = () => this.nodeFactory.create(Ye, {
         groupOpenParen: s.tupleOpenParen,
         groupCloseParen: s.tupleCloseParen,
         expression: s.elementList[0]
@@ -1324,7 +1324,7 @@ class Nn {
           throw new d(s.token, n(), s.handlerContext);
         this.synchronizeElementDeclarationName();
       }
-    if (ut(this.peek()))
+    if (ht(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
@@ -1400,7 +1400,7 @@ class Nn {
       return n();
     let s = e.callee;
     for (; !this.shouldStopExpression(); ) {
-      Xe(this.previous()) || this.logError(s, o.MISSING_SPACES, "Expect a following space");
+      $e(this.previous()) || this.logError(s, o.MISSING_SPACES, "Expect a following space");
       try {
         s = this.normalExpression(), e.args.push(s);
       } catch (i) {
@@ -1410,7 +1410,7 @@ class Nn {
     return n();
   }
   shouldStopExpression() {
-    if (this.isAtEnd() || It(this.previous()))
+    if (this.isAtEnd() || Lt(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 Nn {
     for (; !this.isAtEnd(); ) {
       const s = this.peek();
       if (s.kind === u.LPAREN) {
-        const { left: i } = ht(s);
+        const { left: i } = ft(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 '['
-        lt(this.previous(), s) && !this.contextStack.isWithinGroupExpressionContext() && !this.contextStack.isWithinListExpressionContext())
+        ct(this.previous(), s) && !this.contextStack.isWithinGroupExpressionContext() && !this.contextStack.isWithinListExpressionContext())
           break;
         try {
           n = this.nodeFactory.create(J, {
@@ -1443,7 +1443,7 @@ class Nn {
           }), new d(r.token, n, r.handlerContext)) : r;
         }
       } else if (s.kind === u.LBRACKET) {
-        if (Xe(this.previous()))
+        if ($e(this.previous()))
           break;
         try {
           n = this.nodeFactory.create(he, {
@@ -1456,8 +1456,8 @@ class Nn {
             indexer: i.partialNode
           }), new d(i.token, n, i.handlerContext)) : i;
         }
-      } else if (ot(s)) {
-        const i = s, r = ht(i);
+      } else if (lt(s)) {
+        const i = s, r = ft(i);
         if (r.left !== null) {
           if (r.left <= e)
             break;
@@ -1491,7 +1491,7 @@ class Nn {
   }
   leftExpression_bp() {
     let e;
-    if (ot(this.peek())) {
+    if (lt(this.peek())) {
       const n = {};
       n.op = this.peek();
       const s = In(n.op);
@@ -1569,11 +1569,11 @@ class Nn {
       u.STRING_LITERAL,
       u.NUMERIC_LITERAL
     ))
-      return this.nodeFactory.create(M, {
+      return this.nodeFactory.create(F, {
         expression: this.nodeFactory.create(be, { literal: this.previous() })
       });
     if (this.match(u.QUOTED_STRING, u.IDENTIFIER))
-      return this.nodeFactory.create(M, {
+      return this.nodeFactory.create(F, {
         expression: this.nodeFactory.create(ee, { variable: this.previous() })
       });
     throw this.logError(this.peek(), o.UNEXPECTED_TOKEN, "Expect a variable or literal"), new d(
@@ -1671,7 +1671,7 @@ function In(t) {
 const Ln = {
   "(": { left: 14, right: null }
 };
-function ht(t) {
+function ft(t) {
   return Ln[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 || {});
@@ -1692,7 +1692,7 @@ function ve(t) {
   }
 }
 function pe(t) {
-  if (!Ze(t))
+  if (!Ke(t))
     return new x([t]);
   const e = pe(t.leftExpression).unwrap_or(void 0);
   return e ? (e.push(t.rightExpression), new x(e)) : new y();
@@ -1720,7 +1720,7 @@ function _e(t) {
     return new y();
   const n = [];
   let s;
-  if (!F(I.last(e))) {
+  if (!B(I.last(e))) {
     const i = e.pop();
     if (Ot(i))
       s = i.elementList.map(
@@ -1741,15 +1741,15 @@ function _e(t) {
   });
 }
 function Y(t) {
-  return F(t) ? new x(t.expression.variable.value) : new y();
+  return B(t) ? new x(t.expression.variable.value) : new y();
 }
-function $e(t) {
-  if (ft(t))
+function We(t) {
+  if (pt(t))
     return t instanceof se ? new x({ functional: [t], nonFunctional: [] }) : new x({ functional: [], nonFunctional: [t] });
-  if (t instanceof K && t.elementList.every(ft)) {
+  if (t instanceof K && t.elementList.every(pt)) {
     const e = t.elementList.filter(
       (s) => s instanceof se
-    ), n = t.elementList.filter(F);
+    ), n = t.elementList.filter(B);
     return new x({ functional: e, nonFunctional: n });
   }
   return new y();
@@ -1764,7 +1764,7 @@ function C(t) {
 }
 function gn(t) {
   var e;
-  return !(t instanceof H) || !xt((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 H) || !St((e = t.op) == null ? void 0 : e.value) ? !1 : _e(t.leftExpression).and_then(() => _e(t.rightExpression)).unwrap_or(void 0) !== void 0;
 }
 function _n(t) {
   const e = _e(t.leftExpression), n = _e(t.rightExpression);
@@ -1773,8 +1773,8 @@ function _n(t) {
   const { tupleElements: s } = e.unwrap(), { tupleElements: i } = n.unwrap();
   return (s == null ? void 0 : s.length) === (i == null ? void 0 : i.length);
 }
-function ft(t) {
-  return t instanceof M && t.expression instanceof ee || t instanceof se;
+function pt(t) {
+  return t instanceof F && t.expression instanceof ee || t instanceof se;
 }
 function An(t, e) {
   var i, r, a, l;
@@ -1846,7 +1846,7 @@ class wn {
     return this.declarationNode.parent instanceof A ? [new c(o.INVALID_PROJECT_CONTEXT, "An Enum can only appear top-level", this.declarationNode)] : [];
   }
   validateName(e) {
-    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)];
+    return e ? xt(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)] : [];
@@ -1856,7 +1856,7 @@ class wn {
     this.declarationNode.symbol = this.symbolFactory.create(sn, { declaration: this.declarationNode, symbolTable: new we() });
     const { name: n } = this.declarationNode, s = j(n);
     if (s.isOk()) {
-      const i = s.unwrap(), r = i.pop(), a = Ke(i, this.publicSymbolTable, this.symbolFactory), l = Qe(r);
+      const i = s.unwrap(), r = i.pop(), a = et(i, this.publicSymbolTable, this.symbolFactory), l = qe(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);
     }
     return e;
@@ -1875,13 +1875,13 @@ class wn {
   validateFields(e) {
     return e.length === 0 ? [new c(o.EMPTY_ENUM, "An Enum must have at least one element", this.declarationNode)] : e.flatMap((n) => {
       const s = [];
-      n.callee && !F(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 && !B(n.callee) && s.push(new c(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 P ? (s.push(...this.validateFieldSettings(I.last(i))), i.pop()) : i[0] instanceof P && (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;
     });
   }
   validateFieldSettings(e) {
-    const n = V(e), s = n.getErrors(), i = n.getValue();
+    const n = M(e), s = n.getErrors(), i = n.getValue();
     for (const r in i) {
       const a = i[r];
       switch (r) {
@@ -1905,8 +1905,8 @@ class wn {
     });
   }
   registerField(e) {
-    if (e.callee && F(e.callee)) {
-      const n = X(e.callee).unwrap(), s = qe(n), i = this.symbolFactory.create(rn, { declaration: e });
+    if (e.callee && B(e.callee)) {
+      const n = X(e.callee).unwrap(), s = He(n), i = this.symbolFactory.create(rn, { declaration: e });
       e.symbol = i;
       const r = this.declarationNode.symbol.symbolTable;
       if (r.has(s)) {
@@ -1955,13 +1955,13 @@ class yn {
       const s = [], i = [n.callee, ...n.args];
       return I.last(i) instanceof P && s.push(...this.validateFieldSetting(i.pop())), i.forEach((r) => {
         for (; r instanceof J; )
-          r.argumentList && !$e(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;
-        $e(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 && !We(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;
+        We(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));
       }), s;
     });
   }
   validateFieldSetting(e) {
-    const n = V(e), s = n.getErrors(), i = n.getValue();
+    const n = M(e), s = n.getErrors(), i = n.getValue();
     for (const r in i) {
       const a = i[r];
       switch (r) {
@@ -1979,7 +1979,7 @@ class yn {
           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) => {
-            F(l.value) || s.push(new c(o.INVALID_INDEX_SETTING_VALUE, `'type' must be "btree" or "hash"`, l));
+            B(l.value) || s.push(new c(o.INVALID_INDEX_SETTING_VALUE, `'type' must be "btree" or "hash"`, l));
           });
           break;
         default:
@@ -2115,7 +2115,22 @@ class Sn {
     return e ? [new c(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)] : [];
+    if (!e)
+      return [];
+    const n = M(e), s = n.getErrors(), i = n.getValue();
+    for (const r in i) {
+      const a = i[r];
+      switch (r) {
+        case "color":
+          a.length > 1 && s.push(...a.map((l) => new c(o.DUPLICATE_REF_SETTING, "'color' can only appear once", l))), a.forEach((l) => {
+            tt(l.value) || s.push(new c(o.INVALID_TABLE_SETTING, "'color' must be a color literal", l.value || l.name));
+          });
+          break;
+        default:
+          s.push(...a.map((l) => new c(o.INVALID_TABLE_SETTING, `Unknown '${r}' setting`, l)));
+      }
+    }
+    return s;
   }
   validateBody(e) {
     if (!e)
@@ -2136,7 +2151,7 @@ class Sn {
     }), n;
   }
   validateFieldSettings(e) {
-    const n = V(e), s = n.getErrors(), i = n.getValue();
+    const n = M(e), s = n.getErrors(), i = n.getValue();
     for (const r in i) {
       const a = i[r];
       switch (r) {
@@ -2162,7 +2177,7 @@ class Sn {
   }
 }
 function On(t) {
-  if (!(F(t) && t.expression.variable.kind !== u.QUOTED_STRING) && !(t instanceof z))
+  if (!(B(t) && t.expression.variable.kind !== u.QUOTED_STRING) && !(t instanceof z))
     return !1;
   let e;
   if (t instanceof z ? e = Te(t).unwrap_or("") : e = t.expression.variable.value, e)
@@ -2189,19 +2204,19 @@ class Dn {
     return this.declarationNode.parent instanceof A ? [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)] : 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)];
+    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)] : xt(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 ? Mn(e) ? [] : [new c(o.INVALID_ALIAS, "Table aliases can only contains alphanumeric and underscore unless surrounded by double quotes", e)] : [];
   }
   validateSettingList(e) {
-    const n = V(e), s = n.getErrors(), i = n.getValue();
+    const n = M(e), s = n.getErrors(), i = n.getValue();
     for (const r in i) {
       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) => {
-            St(l.value) || s.push(new c(o.INVALID_TABLE_SETTING, "'headercolor' must be a color literal", l.value || l.name));
+            tt(l.value) || s.push(new c(o.INVALID_TABLE_SETTING, "'headercolor' must be a color literal", l.value || l.name));
           });
           break;
         case "note":
@@ -2217,10 +2232,10 @@ class Dn {
   }
   registerElement() {
     const e = [];
-    this.declarationNode.symbol = this.symbolFactory.create(vt, { declaration: this.declarationNode, symbolTable: new we() });
+    this.declarationNode.symbol = this.symbolFactory.create(wt, { declaration: this.declarationNode, symbolTable: new we() });
     const { name: n, alias: s } = this.declarationNode, i = j(n);
     if (i.isOk()) {
-      const r = [...i.unwrap()], a = r.pop(), l = Ke(r, this.publicSymbolTable, this.symbolFactory), p = Oe(a);
+      const r = [...i.unwrap()], a = r.pop(), l = et(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) && !Pn(s.expression.variable.value, i.unwrap_or([]))) {
@@ -2242,14 +2257,14 @@ class Dn {
       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)), F(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] && !Rn(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)), B(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] && !Rn(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 && F(e.callee)) {
-      const n = X(e.callee).unwrap(), s = ze(n), i = this.symbolFactory.create(an, { declaration: e });
+    if (e.callee && B(e.callee)) {
+      const n = X(e.callee).unwrap(), s = Qe(n), i = this.symbolFactory.create(an, { declaration: e });
       e.symbol = i;
       const r = this.declarationNode.symbol.symbolTable;
       if (r.has(s)) {
@@ -2271,7 +2286,7 @@ class Dn {
       return [];
     let n;
     I.last(e) instanceof P && (n = e.pop());
-    const s = V(n), i = s.getErrors(), r = s.getValue();
+    const s = M(n), i = s.getErrors(), r = s.getValue();
     for (const p of e) {
       const f = X(p).unwrap_or("").toLowerCase();
       if (f !== "pk" && f !== "unique") {
@@ -2352,7 +2367,7 @@ class Dn {
   }
 }
 function Rn(t) {
-  if (!(t instanceof J || Ze(t) || t instanceof M || t instanceof he))
+  if (!(t instanceof J || Ke(t) || t instanceof F || t instanceof he))
     return !1;
   if (t instanceof J) {
     if (t.callee === void 0 || t.argumentList === void 0 || !t.argumentList.elementList.every((n) => fe(n) || W(n) || me(n)))
@@ -2414,7 +2429,7 @@ class Un {
     this.declarationNode.symbol = this.symbolFactory.create(on, { declaration: this.declarationNode, symbolTable: new we() });
     const n = j(e);
     if (n.isOk()) {
-      const s = n.unwrap(), i = s.pop(), r = Ke(s, this.publicSymbolTable, this.symbolFactory), a = He(i);
+      const s = n.unwrap(), i = s.pop(), r = et(s, this.publicSymbolTable, this.symbolFactory), a = Je(i);
       if (r.has(a))
         return [new c(o.DUPLICATE_NAME, `TableGroup name '${i}' already exists`, e)];
       r.set(a, this.declarationNode.symbol);
@@ -2422,7 +2437,7 @@ class Un {
     return [];
   }
   validateSettingList(e) {
-    const n = V(e), s = n.getErrors(), i = n.getValue();
+    const n = M(e), s = n.getErrors(), i = n.getValue();
     return I.forIn(i, (r, a) => {
       switch (a) {
         case "color":
@@ -2431,7 +2446,7 @@ class Un {
             "'color' can only appear once",
             l
           ))), r.forEach((l) => {
-            St(l.value) || s.push(new c(
+            tt(l.value) || s.push(new c(
               o.INVALID_TABLE_SETTING,
               "'color' must be a color literal",
               l.value || l.name
@@ -2495,8 +2510,8 @@ class Un {
     return s.length > 1 && n.push(...s.map((i) => new c(o.NOTE_REDEFINED, "Duplicate notes are defined", i))), n;
   }
   registerField(e) {
-    if (e.callee && F(e.callee)) {
-      const n = X(e.callee).unwrap(), s = Je(n), i = this.symbolFactory.create(ln, { declaration: e });
+    if (e.callee && B(e.callee)) {
+      const n = X(e.callee).unwrap(), s = Ze(n), i = this.symbolFactory.create(ln, { declaration: e });
       e.symbol = i;
       const r = this.declarationNode.symbol.symbolTable;
       if (r.has(s)) {
@@ -2511,7 +2526,7 @@ class Un {
     return [];
   }
 }
-const yt = ["-", "+"];
+const kt = ["-", "+"];
 function oe(t) {
   switch (t.type.value.toLowerCase()) {
     case b.Enum:
@@ -2532,40 +2547,40 @@ function oe(t) {
       return vn;
   }
 }
-function kt(t) {
+function xt(t) {
   return !!j(t).unwrap_or(!1);
 }
 function Mn(t) {
   return ye(t);
 }
 function ye(t) {
-  return t instanceof M && t.expression instanceof ee;
+  return t instanceof F && t.expression instanceof ee;
 }
-function Ke(t, e, n) {
+function et(t, e, n) {
   var i;
   t[0] === "public" && (t = t.slice(1));
   let s = e;
   for (const r of t) {
     let a;
-    const l = Ye(r);
+    const l = ze(r);
     if (s.has(l)) {
       if (a = (i = s.get(l)) == 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(At, { symbolTable: a });
+      const p = n.create(vt, { symbolTable: a });
       s.set(l, p);
     }
     s = a;
   }
   return s;
 }
-function xt(t) {
+function St(t) {
   return t === "-" || t === "<>" || t === ">" || t === "<";
 }
-function St(t) {
+function tt(t) {
   var n;
-  if (!(t instanceof M) || !(t.expression instanceof be) || ((n = t.expression.literal) == null ? void 0 : n.kind) !== u.COLOR_LITERAL)
+  if (!(t instanceof F) || !(t.expression instanceof be) || ((n = t.expression.literal) == null ? void 0 : n.kind) !== u.COLOR_LITERAL)
     return !1;
   const e = t.expression.literal.value;
   if (e.length !== 4 && e.length !== 7 || e[0] !== "#")
@@ -2580,23 +2595,23 @@ function ue(t) {
 }
 function Fn(t) {
   var e;
-  return !!(W(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 se);
+  return !!(W(t) || fe(t) || me(t) && ["true", "false", "null"].includes(t.expression.variable.value.toLowerCase()) || t instanceof q && kt.includes((e = t.op) == null ? void 0 : e.value) && fe(t.expression) || t instanceof se);
 }
 function fe(t) {
   var e;
-  return t instanceof M && t.expression instanceof be && ((e = t.expression.literal) == null ? void 0 : e.kind) === u.NUMERIC_LITERAL;
+  return t instanceof F && t.expression instanceof be && ((e = t.expression.literal) == null ? void 0 : e.kind) === u.NUMERIC_LITERAL;
 }
 function Bn(t) {
   var n;
-  if (!(t instanceof q) || !xt((n = t.op) == null ? void 0 : n.value))
+  if (!(t instanceof q) || !St((n = t.op) == null ? void 0 : n.value))
     return !1;
   const e = j(t.expression).unwrap_or(void 0);
   return e !== void 0 && e.length > 0;
 }
 function Ot(t) {
-  return t instanceof K && t.elementList.every(F);
+  return t instanceof K && t.elementList.every(B);
 }
-function V(t) {
+function M(t) {
   var s;
   const e = {}, n = [];
   if (!t)
@@ -2604,7 +2619,7 @@ function V(t) {
   for (const i of t.elementList) {
     if (!i.name)
       continue;
-    if (i.name instanceof M) {
+    if (i.name instanceof F) {
       n.push(new c(o.INVALID_SETTINGS, "A setting name must be a stream of identifiers", i.name));
       continue;
     }
@@ -2613,9 +2628,9 @@ function V(t) {
   }
   return new G(e, n);
 }
-class pt {
+class dt {
   constructor(e, n) {
-    this.ast = e, this.symbolFactory = n, this.publicSchemaSymbol = this.symbolFactory.create(At, {
+    this.ast = e, this.symbolFactory = n, this.publicSchemaSymbol = this.symbolFactory.create(vt, {
       symbolTable: new we()
     }), this.ast.symbol = this.publicSchemaSymbol, this.ast.symbol.declaration = this.ast;
   }
@@ -2645,7 +2660,7 @@ class le {
   bindSettingList(e, n) {
     if (e)
       for (const s of e.elementList) {
-        if (s.name instanceof M)
+        if (s.name instanceof F)
           continue;
         const i = Te(s.name).unwrap_or(void 0);
         if (!i)
@@ -2682,12 +2697,12 @@ class le {
   scanAndBind(e, n) {
     var s, i;
     if (e)
-      if (e instanceof M) {
+      if (e instanceof F) {
         if (e.expression instanceof ee && ((i = n.keywords) != null && i.includes((s = e.expression.variable) == null ? void 0 : s.value.toLowerCase())))
           return;
         this.bindFragments([e], n);
       } else
-        e instanceof H ? Ze(e) ? this.bindFragments(pe(e).unwrap_or([]), n) : (this.scanAndBind(e.leftExpression, n), this.scanAndBind(e.rightExpression, n)) : e instanceof q ? this.scanAndBind(e.expression, n) : e instanceof Ue ? this.scanAndBind(e.expression, n) : e instanceof K && e.elementList.forEach((r) => this.scanAndBind(r, n));
+        e instanceof H ? Ke(e) ? this.bindFragments(pe(e).unwrap_or([]), n) : (this.scanAndBind(e.leftExpression, n), this.scanAndBind(e.rightExpression, n)) : e instanceof q ? this.scanAndBind(e.expression, n) : e instanceof Ue ? this.scanAndBind(e.expression, n) : e instanceof K && e.elementList.forEach((r) => this.scanAndBind(r, n));
   }
   // Bind the fragments of a member access expression
   // which can be a simple expression like v1.User,
@@ -2695,7 +2710,7 @@ class le {
   bindFragments(e, n) {
     if (e.length === 0)
       return;
-    const s = [...n.topSubnamesSymbolKind], { remainingSubnamesSymbolKind: i } = n, r = e.findIndex((h) => !F(h)), l = r !== -1 && Ot(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) => !B(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
     );
@@ -2705,14 +2720,14 @@ class le {
     for (; s.length && f.length; ) {
       const h = s.pop(), m = f.pop(), g = X(m).unwrap();
       E.unshift({
-        index: Ve(g, h),
+        index: Ge(g, h),
         referrer: m
       });
     }
     for (; f.length; ) {
       const h = f.pop(), m = X(h).unwrap();
       E.unshift({
-        index: Ve(m, i),
+        index: Ge(m, i),
         referrer: h
       });
     }
@@ -2721,7 +2736,7 @@ class le {
         [
           ...E,
           {
-            index: Ve(
+            index: Ge(
               X(h).unwrap(),
               p
             ),
@@ -2948,14 +2963,14 @@ class qn {
   }
   // Analyzing: Invoking both the validator and binder
   analyze() {
-    return new pt(this.ast, this.symbolFactory).validate().chain((n) => new zn(n).resolve());
+    return new dt(this.ast, this.symbolFactory).validate().chain((n) => new zn(n).resolve());
   }
   // For invoking the validator only
   validate() {
-    return new pt(this.ast, this.symbolFactory).validate().chain((n) => new G(n, []));
+    return new dt(this.ast, this.symbolFactory).validate().chain((n) => new G(n, []));
   }
 }
-function dt(t, e) {
+function Et(t, e) {
   const { variables: n, tupleElements: s } = _e(t).unwrap();
   return s ? n.length === 0 ? {
     schemaName: e.schemaName,
@@ -2998,7 +3013,7 @@ function _(t) {
     end: { offset: t.endPos.offset, line: t.endPos.line + 1, column: t.endPos.column + 1 }
   };
 }
-function We(t) {
+function je(t) {
   var n;
   const e = (n = pe(t).unwrap_or(void 0)) == null ? void 0 : n.pop();
   return e instanceof K ? e.elementList.map((s) => s.referee) : [e.referee];
@@ -3010,7 +3025,7 @@ function Ie(t) {
     schemaName: e
   };
 }
-function et(t) {
+function Fe(t) {
   return t.expression.literal.value;
 }
 function Pt(t, e) {
@@ -3077,8 +3092,8 @@ class Mt {
   }
   interpretSettingList(e) {
     var i, r, a;
-    const n = V(e).getValue();
-    this.table.headerColor = (i = n.headercolor) != null && i.length ? et((a = (r = n.headercolor) == null ? void 0 : r.at(0)) == null ? void 0 : a.value) : void 0;
+    const n = M(e).getValue();
+    this.table.headerColor = (i = n.headercolor) != null && i.length ? Fe((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: C(s == null ? void 0 : s.value).map(ae).unwrap(),
@@ -3115,7 +3130,7 @@ class Mt {
     s.type = i.getValue(), n.push(...i.getErrors()), s.token = _(e), s.inline_refs = [];
     const r = e.args.slice(1);
     if (I.last(r) instanceof P) {
-      const S = V(r.pop()).getValue();
+      const S = M(r.pop()).getValue();
       s.pk = !!((a = S.pk) != null && a.length) || !!((l = S["primary key"]) != null && l.length), s.increment = !!((p = S.increment) != null && p.length), s.unique = !!((f = S.unique) != null && f.length), s.not_null = (E = S["not null"]) != null && E.length ? !0 : (h = S.null) != null && h.length ? !1 : void 0, s.dbdefault = Jn((g = (m = S.default) == null ? void 0 : m.at(0)) == null ? void 0 : g.value);
       const te = (R = S.note) == null ? void 0 : R.at(0);
       s.note = te && {
@@ -3124,8 +3139,8 @@ class Mt {
       };
       const Yt = S.ref || [];
       s.inline_refs = Yt.flatMap((Q) => {
-        const [st] = We(Q.value.expression);
-        if (Ut(st, e.symbol))
+        const [it] = je(Q.value.expression);
+        if (Ut(it, e.symbol))
           return n.push(new c(o.SAME_ENDPOINT, "Two endpoints are the same", Q)), [];
         const ke = Q.value.op, ne = j(Q.value.expression).unwrap();
         let de;
@@ -3148,11 +3163,11 @@ class Mt {
             token: _(Q)
           };
         } else if (ne.length === 3) {
-          const [ce, Le, rt] = ne;
+          const [ce, Le, at] = ne;
           de = {
             schemaName: ce,
             tableName: Le,
-            fieldNames: [rt],
+            fieldNames: [at],
             relation: ke.value,
             token: _(Q)
           };
@@ -3167,8 +3182,8 @@ class Mt {
             token: _(Q)
           };
         }
-        const it = this.registerInlineRefToEnv(e, st, de, Q);
-        return n.push(...it), it.length === 0 ? de : [];
+        const rt = this.registerInlineRefToEnv(e, it, de, Q);
+        return n.push(...rt), rt.length === 0 ? de : [];
       });
     }
     return s.pk || (s.pk = r.some((S) => Y(S).unwrap().toLowerCase() === "pk")), s.unique || (s.unique = r.some((S) => Y(S).unwrap().toLowerCase() === "unique")), this.table.fields.push(s), s.pk && this.pkColumns.push(s), n;
@@ -3180,7 +3195,7 @@ class Mt {
       s.token = _(i);
       const r = [i.callee, ...i.args];
       if (I.last(r) instanceof P) {
-        const g = V(r.pop()).getValue();
+        const g = M(r.pop()).getValue();
         s.pk = !!((a = g.pk) != null && a.length), s.unique = !!((l = g.unique) != null && l.length), s.name = C((f = (p = g.name) == null ? void 0 : p.at(0)) == null ? void 0 : f.value).unwrap_or(void 0);
         const R = (E = g.note) == null ? void 0 : E.at(0);
         s.note = R && {
@@ -3196,7 +3211,7 @@ class Mt {
           R.push(g.argumentList), g = g.callee;
         return R.push(g), R;
       }).forEach((g) => {
-        const { functional: R, nonFunctional: S } = $e(g).unwrap();
+        const { functional: R, nonFunctional: S } = We(g).unwrap();
         s.columns.push(
           ...R.map((te) => ({
             value: te.value.value,
@@ -3278,7 +3293,7 @@ function Jn(t) {
         value: t.expression.variable.value.toLowerCase(),
         type: "boolean"
       };
-    if (t instanceof q && yt.includes((e = t.op) == null ? void 0 : e.value) && fe(t.expression)) {
+    if (t instanceof q && kt.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,
@@ -3310,8 +3325,8 @@ class Zn {
   }
   interpretSettingList(e) {
     var s, i, r;
-    const n = V(e).getValue();
-    return this.note.headerColor = (s = n.headercolor) != null && s.length ? et((r = (i = n.headercolor) == null ? void 0 : i.at(0)) == null ? void 0 : r.value) : void 0, [];
+    const n = M(e).getValue();
+    return this.note.headerColor = (s = n.headercolor) != null && s.length ? Fe((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 v);
@@ -3329,18 +3344,27 @@ class Ft {
     this.declarationNode = e, this.env = n, this.container = this.declarationNode.parent instanceof A ? this.env.tables.get(this.declarationNode.parent) : void 0, this.ref = {};
   }
   interpret() {
-    return this.ref.token = _(this.declarationNode), this.env.ref.set(this.declarationNode, this.ref), [...this.interpretName(this.declarationNode.name), ...this.interpretBody(this.declarationNode.body)];
+    return this.ref.token = _(this.declarationNode), this.env.ref.set(this.declarationNode, this.ref), [
+      ...this.interpretName(this.declarationNode.name),
+      ...this.interpretSettingList(this.declarationNode.attributeList),
+      ...this.interpretBody(this.declarationNode.body)
+    ];
   }
   interpretName(e) {
     const n = [], s = j(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;
   }
+  interpretSettingList(e) {
+    var s, i, r;
+    const n = M(e).getValue();
+    return this.ref.color = (s = n.color) != null && s.length ? Fe((r = (i = n.color) == null ? void 0 : i.at(0)) == null ? void 0 : r.value) : void 0, [];
+  }
   interpretBody(e) {
     return e instanceof v ? 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 = We(s), a = We(i);
+    const n = e.callee.op.value, { leftExpression: s, rightExpression: i } = e.callee, r = je(s), a = je(i);
     if (Ut(r, a))
       return [new c(o.SAME_ENDPOINT, "Two endpoints are the same", e)];
     const l = Pt(r, a);
@@ -3350,7 +3374,7 @@ class Ft {
         new c(o.CIRCULAR_REF, "References with same endpoints exist", this.env.refIds[l])
       ];
     if (e.args[0]) {
-      const g = V(e.args[0]).getValue(), R = (E = (f = g.delete) == null ? void 0 : f.at(0)) == null ? void 0 : E.value;
+      const g = M(e.args[0]).getValue(), R = (E = (f = g.delete) == null ? void 0 : f.at(0)) == null ? void 0 : E.value;
       this.ref.onDelete = R instanceof z ? Te(R).unwrap_or(void 0) : Y(R).unwrap_or(void 0);
       const S = (m = (h = g.update) == null ? void 0 : h.at(0)) == null ? void 0 : m.value;
       this.ref.onUpdate = S instanceof z ? Te(S).unwrap_or(void 0) : Y(S).unwrap_or(void 0);
@@ -3358,12 +3382,12 @@ class Ft {
     const p = Rt(n);
     return this.ref.endpoints = [
       {
-        ...dt(s, this.container),
+        ...Et(s, this.container),
         relation: p[0],
         token: _(s)
       },
       {
-        ...dt(i, this.container),
+        ...Et(i, this.container),
         relation: p[1],
         token: _(i)
       }
@@ -3428,8 +3452,8 @@ class Bt {
   }
   interpretSettingList(e) {
     var i, r, a;
-    const n = V(e).getValue();
-    this.tableGroup.color = (i = n.color) != null && i.length ? et((a = (r = n.color) == null ? void 0 : r.at(0)) == null ? void 0 : a.value) : void 0;
+    const n = M(e).getValue();
+    this.tableGroup.color = (i = n.color) != null && i.length ? Fe((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: C(s == null ? void 0 : s.value).map(ae).unwrap(),
@@ -3453,7 +3477,7 @@ class Vt {
       var l;
       const s = n, i = {};
       i.token = _(s), i.name = Y(s.callee).unwrap();
-      const a = (l = V(s.args[0]).getValue().note) == null ? void 0 : l.at(0);
+      const a = (l = M(s.args[0]).getValue().note) == null ? void 0 : l.at(0);
       return i.note = a && {
         value: C(a.value).map(ae).unwrap(),
         token: _(a)
@@ -3577,7 +3601,7 @@ function Ae(t) {
   }
 }
 function Re(t, e) {
-  if (!t || Xe(t))
+  if (!t || $e(t))
     return !1;
   for (const n of t.trailingTrivia) {
     if (n.start > e)
@@ -3601,7 +3625,7 @@ function Pe(t) {
     }))
   };
 }
-function Fe(t) {
+function Be(t) {
   return {
     ...t,
     suggestions: t.suggestions.map((e) => ({
@@ -3610,7 +3634,7 @@ function Fe(t) {
     }))
   };
 }
-function tt(t, e) {
+function nt(t, e) {
   return t.getOffsetAt(e);
 }
 class Gt {
@@ -3619,7 +3643,7 @@ class Gt {
   }
   provideCompletionItems(e, n) {
     var E, h;
-    const s = tt(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 = nt(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) || [],
@@ -3627,12 +3651,12 @@ class Gt {
     ].find((m) => Ht(m) && ge(s, m)))
       return D();
     if (a === void 0)
-      return bt();
+      return It();
     if ([u.STRING_LITERAL, u.QUOTED_STRING].includes(r.kind) && ge(s, r))
       return D();
     const p = this.compiler.container.element(s);
     if (this.compiler.container.scopeKind(s) === O.TOPLEVEL || p instanceof A && p.type && p.type.start <= s && p.type.end >= s)
-      return bt();
+      return It();
     const f = [...this.compiler.container.stack(s)].reverse();
     for (const m of f)
       if (m instanceof q)
@@ -3641,7 +3665,7 @@ class Gt {
           case "<":
           case "<>":
           case "-":
-            return Et(
+            return Nt(
               this.compiler,
               s,
               m
@@ -3653,7 +3677,7 @@ class Gt {
           case "<":
           case "<>":
           case "-":
-            return Et(
+            return Nt(
               this.compiler,
               s,
               m
@@ -3667,23 +3691,23 @@ class Gt {
         }
       else {
         if (m instanceof ie)
-          return Nt(this.compiler, s, m);
+          return mt(this.compiler, s, m);
         if (m instanceof P)
-          return Nt(this.compiler, s, m);
+          return mt(this.compiler, s, m);
         if (m instanceof K)
           return ns(this.compiler, s);
         if (m instanceof v)
-          return Tt(this.compiler, s, m);
+          return bt(this.compiler, s, m);
         if (m instanceof A && (m.bodyColon && s >= m.bodyColon.end || m.body && ge(s, m.body)))
-          return Tt(this.compiler, s, void 0);
+          return bt(this.compiler, s, void 0);
       }
     return D();
   }
 }
-function Et(t, e, n) {
+function Nt(t, e, n) {
   const s = t.container.scopeKind(e);
   if ([O.REF, O.TABLE].includes(s)) {
-    const i = Be(t, e, t.container.element(e), [
+    const i = Ve(t, e, t.container.element(e), [
       T.Table,
       T.Schema,
       T.Column
@@ -3692,7 +3716,7 @@ function Et(t, e, n) {
   }
   return D();
 }
-function Be(t, e, n, s) {
+function Ve(t, e, n, s) {
   var a;
   if (n === void 0)
     return D();
@@ -3714,7 +3738,7 @@ function Be(t, e, n, s) {
     }
     i = i instanceof A ? i.parent : void 0;
   }
-  return Fe(r);
+  return Be(r);
 }
 function ns(t, e) {
   var s;
@@ -3738,14 +3762,14 @@ function ns(t, e) {
   }
   return D();
 }
-function Nt(t, e, n) {
+function mt(t, e, n) {
   const { token: s } = t.container.token(e);
   if ([u.COMMA, u.LBRACKET].includes(s == null ? void 0 : s.kind)) {
-    const i = mt(t, e);
+    const i = Tt(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 mt(t, e);
+    return Tt(t, e);
   if (n.name instanceof z) {
     const i = ss(
       t,
@@ -3756,7 +3780,7 @@ function Nt(t, e, n) {
   }
   return D();
 }
-function mt(t, e) {
+function Tt(t, e) {
   const n = t.container.element(e), s = t.container.scopeKind(e);
   if (n instanceof $)
     return D();
@@ -3884,10 +3908,10 @@ function ss(t, e, n) {
 }
 function Ct(t, e, n) {
   const s = pe(n).unwrap_or([]);
-  if (s.pop(), s.some((r) => !F(r)))
+  if (s.pop(), s.some((r) => !B(r)))
     return D();
   const i = s.map((r) => Y(r).unwrap());
-  return Fe({
+  return Be({
     suggestions: t.symbol.ofName({ nameStack: i, owner: t.container.element(e) }).flatMap(({ symbol: r }) => t.symbol.members(r)).map(({ kind: r, name: a }) => ({
       label: a,
       insertText: a,
@@ -3896,7 +3920,7 @@ function Ct(t, e, n) {
     }))
   });
 }
-function Tt(t, e, n) {
+function bt(t, e, n) {
   var i;
   switch (t.container.scopeKind(e)) {
     case O.TABLE:
@@ -3917,7 +3941,7 @@ function Tt(t, e, n) {
       return D();
   }
 }
-function bt() {
+function It() {
   return {
     suggestions: ["Table", "TableGroup", "Enum", "Project", "Ref"].map((t) => ({
       label: t,
@@ -3929,7 +3953,7 @@ function bt() {
   };
 }
 function is(t, e, n) {
-  return n != null && n.callee && nt(e, n) === 1 ? Be(t, e, t.container.element(e), [
+  return n != null && n.callee && st(e, n) === 1 ? Ve(t, e, t.container.element(e), [
     T.Schema,
     T.Table,
     T.Column
@@ -3946,7 +3970,7 @@ function rs(t, e, n) {
         range: void 0
       }))
     };
-  const s = nt(e, n);
+  const s = st(e, n);
   return s === 0 ? {
     suggestions: ["Note", "indexes"].map((i) => ({
       label: i,
@@ -3958,7 +3982,7 @@ function rs(t, e, n) {
   } : s === 1 ? cs(t, e) : D();
 }
 function as(t, e, n) {
-  return n != null && n.callee ? nt(e, n) === 0 ? {
+  return n != null && n.callee ? st(e, n) === 0 ? {
     suggestions: ["Table", "TableGroup", "Enum", "Note", "Ref"].map((i) => ({
       label: i,
       insertText: i,
@@ -3977,7 +4001,7 @@ function as(t, e, n) {
   };
 }
 function Xt(t, e) {
-  return Be(t, e, t.container.element(e), [
+  return Ve(t, e, t.container.element(e), [
     T.Schema,
     T.Table,
     T.Column
@@ -3986,7 +4010,7 @@ function Xt(t, e) {
 function os(t) {
   return {
     suggestions: [
-      ...Fe({
+      ...Be({
         suggestions: [...t.parse.publicSymbolTable().entries()].flatMap(([e]) => {
           const n = re(e).unwrap_or(void 0);
           if (n === void 0)
@@ -4082,7 +4106,7 @@ function cs(t, e) {
         sortText: L.TypeParameter.toString().padStart(2, "0"),
         range: void 0
       })),
-      ...Be(t, e, t.container.element(e), [
+      ...Ve(t, e, t.container.element(e), [
         T.Enum,
         T.Schema
       ]).suggestions
@@ -4091,10 +4115,10 @@ function cs(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 vt))
+  if (!((s == null ? void 0 : s.symbol) instanceof wt))
     return D();
   const { symbolTable: i } = s.symbol;
-  return Fe({
+  return Be({
     suggestions: [...i.entries()].flatMap(([r]) => {
       const a = re(r).unwrap_or(void 0);
       if (a === void 0)
@@ -4110,7 +4134,7 @@ function $t(t, e) {
     })
   });
 }
-function nt(t, e) {
+function st(t, e) {
   if (!e.callee)
     return -1;
   const n = [e.callee, ...e.args], s = n.findIndex((i) => t <= i.end);
@@ -4122,7 +4146,7 @@ class Wt {
   }
   provideDefinition(e, n) {
     var a;
-    const { uri: s } = e, i = tt(e, n), r = [...this.compiler.container.stack(i)];
+    const { uri: s } = e, i = nt(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)) {
@@ -4148,7 +4172,7 @@ class jt {
     this.compiler = e;
   }
   provideReferences(e, n) {
-    const { uri: s } = e, i = tt(e, n), r = [...this.compiler.container.stack(i)];
+    const { uri: s } = e, i = nt(e, n), r = [...this.compiler.container.stack(i)];
     for (; r.length !== 0; ) {
       const a = r.pop();
       if (a && [
@@ -4189,7 +4213,7 @@ class ps {
     ).fill(null), this.nodeIdGenerator = new Jt(), this.symbolIdGenerator = new nn(), this.token = {
       invalidStream: this.createQuery(
         6,
-        () => this.parse.tokens().filter(wt)
+        () => this.parse.tokens().filter(yt)
       ),
       // Valid + Invalid tokens (which are guarenteed to be non-trivials) are included in the stream
       flatStream: this.createQuery(
@@ -4234,7 +4258,7 @@ class ps {
           const p = [l];
           for (; ; ) {
             const E = fn(l).find((h) => ge(a, h));
-            if (E === void 0 || E instanceof B)
+            if (E === void 0 || E instanceof V)
               break;
             p.push(E), l = E;
           }
@@ -4242,7 +4266,7 @@ class ps {
             return p;
           for (; p.length > 0; ) {
             let f = !1;
-            const E = Ce(p);
+            const E = Xe(p);
             if (E instanceof v) {
               const h = this.parse.source();
               for (let m = E.end; m < e; m += 1)
@@ -4251,7 +4275,7 @@ class ps {
             } else
               E instanceof q || E instanceof H ? this.container.token(e).token !== E.op && (p.pop(), f = !0) : E instanceof P ? E.listCloseBracket && E.end <= e && (p.pop(), f = !0) : E instanceof K ? E.tupleCloseParen && E.end <= e && (p.pop(), f = !0) : E instanceof Z ? E.blockCloseBrace && E.end <= e && (p.pop(), f = !0) : E instanceof z || E.end < e && (p.pop(), f = !0);
             if (f) {
-              const h = Ce(p);
+              const h = Xe(p);
               h instanceof A && h.end <= e && p.pop();
             }
             if (!f)