n8n-editor-ui 1.62.2 → 1.63.1

package/dist/assets/@n8n/{codemirror-lang-sql-Bygy_eOg.js → codemirror-lang-sql-C9sfSTUi.js}

@@ -1,5 +1,5 @@
-import { N as NodeProp, T as Tree, I as IterMode, c as TreeFragment, P as Parser, b as NodeType, a as NodeSet } from "../@lezer/common-CnY9etib.js";
-import { T as Text, R as RangeValue, a as RangeSet, M as MapMode, f as findClusterBreak, E as EditorSelection, F as Facet, S as StateEffect, C as ChangeSet, b as findColumn, c as CharCategory, d as EditorState, A as Annotation, e as StyleModule, g as Transaction, P as Prec, k as keyName, h as codePointAt, i as codePointSize, j as base, s as shift, l as combineConfig, m as StateField, n as RangeSetBuilder, o as countColumn, t as tagHighlighter, p as highlightTree, q as tags, r as styleTags, u as fromCodePoint, v as ExternalTokenizer, L as LRParser } from "./codemirror-lang-CIGGB1t0.js";
+import { N as NodeProp, T as Tree, I as IterMode, c as TreeFragment, P as Parser, b as NodeType, a as NodeSet } from "../@lezer/common-Bs5t-XhT.js";
+import { T as Text, R as RangeValue, a as RangeSet, M as MapMode, f as findClusterBreak, E as EditorSelection, F as Facet, S as StateEffect, C as ChangeSet, b as findColumn, c as CharCategory, d as EditorState, A as Annotation, e as StyleModule, g as Transaction, P as Prec, k as keyName, h as codePointAt, i as codePointSize, j as base, s as shift, l as combineConfig, m as StateField, n as RangeSetBuilder, o as countColumn, t as tagHighlighter, p as highlightTree, q as tags, r as styleTags, u as fromCodePoint, v as ExternalTokenizer, L as LRParser } from "./codemirror-lang-Bizw8G99.js";
 function getSelection(root) {
   let target;
   if (root.nodeType == 11) {
@@ -2005,40 +2005,39 @@ function emitSpans(line, from, to, level, baseLevel, isolates, order) {
       let recurse = !sameDir && ourType == 1 ? [] : null;
       let localLevel = sameDir ? level : level + 1;
       let iScan = iCh;
-      run:
-        for (; ; ) {
-          if (iI < isolates.length && iScan == isolates[iI].from) {
-            if (isNum)
-              break run;
-            let iso = isolates[iI];
-            if (!sameDir)
-              for (let upto = iso.to, jI = iI + 1; ; ) {
-                if (upto == to)
-                  break run;
-                if (jI < isolates.length && isolates[jI].from == upto)
-                  upto = isolates[jI++].to;
-                else if (types[upto] == ourType)
-                  break run;
-                else
-                  break;
-              }
-            iI++;
-            if (recurse) {
-              recurse.push(iso);
-            } else {
-              if (iso.from > iCh)
-                order.push(new BidiSpan(iCh, iso.from, localLevel));
-              let dirSwap = iso.direction == LTR != !(localLevel % 2);
-              computeSectionOrder(line, dirSwap ? level + 1 : level, baseLevel, iso.inner, iso.from, iso.to, order);
-              iCh = iso.to;
+      run: for (; ; ) {
+        if (iI < isolates.length && iScan == isolates[iI].from) {
+          if (isNum)
+            break run;
+          let iso = isolates[iI];
+          if (!sameDir)
+            for (let upto = iso.to, jI = iI + 1; ; ) {
+              if (upto == to)
+                break run;
+              if (jI < isolates.length && isolates[jI].from == upto)
+                upto = isolates[jI++].to;
+              else if (types[upto] == ourType)
+                break run;
+              else
+                break;
             }
-            iScan = iso.to;
-          } else if (iScan == to || (sameDir ? types[iScan] != ourType : types[iScan] == ourType)) {
-            break;
+          iI++;
+          if (recurse) {
+            recurse.push(iso);
           } else {
-            iScan++;
+            if (iso.from > iCh)
+              order.push(new BidiSpan(iCh, iso.from, localLevel));
+            let dirSwap = iso.direction == LTR != !(localLevel % 2);
+            computeSectionOrder(line, dirSwap ? level + 1 : level, baseLevel, iso.inner, iso.from, iso.to, order);
+            iCh = iso.to;
           }
+          iScan = iso.to;
+        } else if (iScan == to || (sameDir ? types[iScan] != ourType : types[iScan] == ourType)) {
+          break;
+        } else {
+          iScan++;
         }
+      }
       if (recurse)
         emitSpans(line, iCh, iScan, level + 1, baseLevel, recurse, order);
       else if (iCh < iScan)
@@ -2058,39 +2057,38 @@ function emitSpans(line, from, to, level, baseLevel, isolates, order) {
       let recurse = !sameDir && ourType == 1 ? [] : null;
       let localLevel = sameDir ? level : level + 1;
       let iScan = iCh;
-      run:
-        for (; ; ) {
-          if (iI && iScan == isolates[iI - 1].to) {
-            if (isNum)
-              break run;
-            let iso = isolates[--iI];
-            if (!sameDir)
-              for (let upto = iso.from, jI = iI; ; ) {
-                if (upto == from)
-                  break run;
-                if (jI && isolates[jI - 1].to == upto)
-                  upto = isolates[--jI].from;
-                else if (types[upto - 1] == ourType)
-                  break run;
-                else
-                  break;
-              }
-            if (recurse) {
-              recurse.push(iso);
-            } else {
-              if (iso.to < iCh)
-                order.push(new BidiSpan(iso.to, iCh, localLevel));
-              let dirSwap = iso.direction == LTR != !(localLevel % 2);
-              computeSectionOrder(line, dirSwap ? level + 1 : level, baseLevel, iso.inner, iso.from, iso.to, order);
-              iCh = iso.from;
+      run: for (; ; ) {
+        if (iI && iScan == isolates[iI - 1].to) {
+          if (isNum)
+            break run;
+          let iso = isolates[--iI];
+          if (!sameDir)
+            for (let upto = iso.from, jI = iI; ; ) {
+              if (upto == from)
+                break run;
+              if (jI && isolates[jI - 1].to == upto)
+                upto = isolates[--jI].from;
+              else if (types[upto - 1] == ourType)
+                break run;
+              else
+                break;
             }
-            iScan = iso.from;
-          } else if (iScan == from || (sameDir ? types[iScan - 1] != ourType : types[iScan - 1] == ourType)) {
-            break;
+          if (recurse) {
+            recurse.push(iso);
           } else {
-            iScan--;
+            if (iso.to < iCh)
+              order.push(new BidiSpan(iso.to, iCh, localLevel));
+            let dirSwap = iso.direction == LTR != !(localLevel % 2);
+            computeSectionOrder(line, dirSwap ? level + 1 : level, baseLevel, iso.inner, iso.from, iso.to, order);
+            iCh = iso.from;
           }
+          iScan = iso.from;
+        } else if (iScan == from || (sameDir ? types[iScan - 1] != ourType : types[iScan - 1] == ourType)) {
+          break;
+        } else {
+          iScan--;
         }
+      }
       if (recurse)
         emitSpans(line, iScan, iCh, level + 1, baseLevel, recurse, order);
       else if (iScan < iCh)
@@ -2639,8 +2637,7 @@ class DocView extends ContentView {
           this.dom.focus({ preventScroll: true });
         }
         let rawSel = getSelection(this.view.root);
-        if (!rawSel)
-          ;
+        if (!rawSel) ;
         else if (main.empty) {
           if (browser.gecko) {
             let nextTo = nextToUneditable(anchor.node, anchor.offset);
@@ -12103,8 +12100,7 @@ class FuzzyMatcher {
     if (chars.length == 1) {
       let first = codePointAt(word, 0), firstSize = codePointSize(first);
       let score2 = firstSize == word.length ? 0 : -100;
-      if (first == chars[0])
-        ;
+      if (first == chars[0]) ;
       else if (first == folded[0])
         score2 += -200;
       else