marko 6.0.152 → 6.0.154

package/dist/dom.mjs

@@ -167,10 +167,11 @@ function destroyBranch(branch) {
   ), destroyNestedBranches(branch);
 }
 function destroyNestedBranches(branch) {
-  branch.I = 1, branch.D?.forEach(destroyNestedBranches), branch.B?.forEach((scope) => {
-    for (let id in scope.A)
-      $signalReset(scope, id);
-  });
+  branch.I = 1, branch.D?.forEach(destroyNestedBranches), branch.B?.forEach(resetControllers);
+}
+function resetControllers(scope) {
+  for (let id in scope.A)
+    $signalReset(scope, id);
 }
 function removeAndDestroyBranch(branch) {
   destroyBranch(branch), removeChildNodes(
@@ -335,7 +336,7 @@ function walk(startNode, walkCodes, branch) {
   walker.currentNode = startNode, walkInternal(0, walkCodes, branch);
 }
 function walkInternal(currentWalkIndex, walkCodes, scope) {
-  let value, storedMultiplier = 0, currentMultiplier = 0, currentScopeIndex = 0;
+  let value, currentMultiplier, storedMultiplier = 0, currentScopeIndex = 0;
   for (; currentWalkIndex < walkCodes.length; )
     if (value = walkCodes.charCodeAt(currentWalkIndex++), currentMultiplier = storedMultiplier, storedMultiplier = 0, value === 32 /* Get */) {
       let node = walker.currentNode;
@@ -960,81 +961,6 @@ function toInsertNode(startNode, endNode) {
   return parent;
 }
 
-// src/dom/reconcile.ts
-var WRONG_POS = 2147483647;
-function reconcile(parent, oldBranches, newBranches, afterReference) {
-  let oldStart = 0, newStart = 0, oldEnd = oldBranches.length - 1, newEnd = newBranches.length - 1, oldStartBranch = oldBranches[oldStart], newStartBranch = newBranches[newStart], oldEndBranch = oldBranches[oldEnd], newEndBranch = newBranches[newEnd], i, j, k, nextSibling, oldBranch, newBranch;
-  outer: {
-    for (; oldStartBranch === newStartBranch; ) {
-      if (++oldStart, ++newStart, oldStart > oldEnd || newStart > newEnd)
-        break outer;
-      oldStartBranch = oldBranches[oldStart], newStartBranch = newBranches[newStart];
-    }
-    for (; oldEndBranch === newEndBranch; ) {
-      if (--oldEnd, --newEnd, oldStart > oldEnd || newStart > newEnd)
-        break outer;
-      oldEndBranch = oldBranches[oldEnd], newEndBranch = newBranches[newEnd];
-    }
-  }
-  if (oldStart > oldEnd) {
-    if (newStart <= newEnd) {
-      k = newEnd + 1, nextSibling = k < newBranches.length ? newBranches[k].S : afterReference;
-      do
-        insertBranchBefore(newBranches[newStart++], parent, nextSibling);
-      while (newStart <= newEnd);
-    }
-  } else if (newStart > newEnd)
-    do
-      removeAndDestroyBranch(oldBranches[oldStart++]);
-    while (oldStart <= oldEnd);
-  else {
-    let oldLength = oldEnd - oldStart + 1, newLength = newEnd - newStart + 1, aNullable = oldBranches, sources = new Array(newLength);
-    for (i = 0; i < newLength; ++i)
-      sources[i] = -1;
-    let pos = 0, synced = 0, keyIndex = /* @__PURE__ */ new Map();
-    for (j = newStart; j <= newEnd; ++j)
-      keyIndex.set(newBranches[j], j);
-    for (i = oldStart; i <= oldEnd && synced < newLength; ++i)
-      oldBranch = oldBranches[i], j = keyIndex.get(oldBranch), j !== void 0 && (pos = pos > j ? WRONG_POS : j, ++synced, newBranch = newBranches[j], sources[j - newStart] = i, aNullable[i] = null);
-    if (oldLength === oldBranches.length && synced === 0) {
-      for (; newStart < newLength; ++newStart)
-        insertBranchBefore(newBranches[newStart], parent, afterReference);
-      for (; oldStart < oldLength; ++oldStart)
-        removeAndDestroyBranch(oldBranches[oldStart]);
-    } else {
-      for (i = oldLength - synced; i > 0; )
-        oldBranch = aNullable[oldStart++], oldBranch !== null && (removeAndDestroyBranch(oldBranch), i--);
-      if (pos === WRONG_POS) {
-        let seq = longestIncreasingSubsequence(sources);
-        for (j = seq.length - 1, k = newBranches.length, i = newLength - 1; i >= 0; --i)
-          sources[i] === -1 ? (pos = i + newStart, newBranch = newBranches[pos++], nextSibling = pos < k ? newBranches[pos].S : afterReference, insertBranchBefore(newBranch, parent, nextSibling)) : j < 0 || i !== seq[j] ? (pos = i + newStart, newBranch = newBranches[pos++], nextSibling = pos < k ? newBranches[pos].S : afterReference, insertBranchBefore(newBranch, parent, nextSibling)) : --j;
-      } else if (synced !== newLength)
-        for (k = newBranches.length, i = newLength - 1; i >= 0; --i)
-          sources[i] === -1 && (pos = i + newStart, newBranch = newBranches[pos++], nextSibling = pos < k ? newBranches[pos].S : afterReference, insertBranchBefore(newBranch, parent, nextSibling));
-    }
-  }
-}
-function longestIncreasingSubsequence(a) {
-  let p = a.slice(), result = [0], u, v;
-  for (let i = 0, il = a.length; i < il; ++i) {
-    if (a[i] === -1)
-      continue;
-    let j = result[result.length - 1];
-    if (a[j] < a[i]) {
-      p[i] = j, result.push(i);
-      continue;
-    }
-    for (u = 0, v = result.length - 1; u < v; ) {
-      let c = (u + v) / 2 | 0;
-      a[result[c]] < a[i] ? u = c + 1 : v = c;
-    }
-    a[i] < a[result[u]] && (u > 0 && (p[i] = result[u - 1]), result[u] = i);
-  }
-  for (u = result.length, v = result[u - 1]; u-- > 0; )
-    result[u] = v, v = p[v];
-  return result;
-}
-
 // src/dom/control-flow.ts
 function _await_promise(nodeAccessor, params) {
   nodeAccessor = decodeAccessor(nodeAccessor);
@@ -1288,23 +1214,63 @@ var _for_of = loop(([all, by = bySecondArg], cb) => {
 function loop(forEach) {
   return (nodeAccessor, template, walks, setup, params) => {
     nodeAccessor = decodeAccessor(nodeAccessor);
-    let scopesAccessor = "A" /* BranchScopes */ + nodeAccessor, scopesByKeyAccessor = "A" /* BranchScopes */ + scopesAccessor, renderer = _content("", template, walks, setup)();
+    let scopesAccessor = "A" /* BranchScopes */ + nodeAccessor, renderer = _content("", template, walks, setup)();
     return enableBranches(), (scope, value) => {
-      let referenceNode = scope[nodeAccessor], oldScopes = toArray(scope[scopesAccessor]), oldScopesByKey = scope[scopesByKeyAccessor] || oldScopes.reduce(
-        (map, scope2, i) => map.set(scope2.M ?? i, scope2),
-        /* @__PURE__ */ new Map()
-      ), newScopes = scope[scopesAccessor] = [], newScopesByKey = scope[scopesByKeyAccessor] = /* @__PURE__ */ new Map(), parentNode = referenceNode.nodeType > 1 /* Element */ ? referenceNode.parentNode || oldScopes[0]?.S.parentNode : referenceNode;
+      let referenceNode = scope[nodeAccessor], oldScopes = toArray(scope[scopesAccessor]), newScopes = scope[scopesAccessor] = [], oldLen = oldScopes.length, parentNode = referenceNode.nodeType > 1 /* Element */ ? referenceNode.parentNode || oldScopes[0]?.S.parentNode : referenceNode, oldScopesByKey, hasPotentialMoves;
+      if (0)
+        var seenKeys;
       forEach(value, (key, args) => {
-        let branch = oldScopesByKey.get(key) || createAndSetupBranch(
+        let branch = oldLen && (oldScopesByKey ||= oldScopes.reduce(
+          (map, scope2, i) => map.set(scope2.M ?? i, scope2),
+          /* @__PURE__ */ new Map()
+        )).get(key);
+        branch ? hasPotentialMoves = oldScopesByKey.delete(key) : branch = createAndSetupBranch(
           scope.$,
           renderer,
           scope,
           parentNode
-        );
-        branch.M = key, params?.(branch, args), newScopesByKey.set(key, branch), newScopes.push(branch);
+        ), branch.M = key, newScopes.push(branch), params?.(branch, args);
       });
-      let afterReference = null;
-      referenceNode !== parentNode && (oldScopes.length ? (afterReference = oldScopes[oldScopes.length - 1].K.nextSibling, newScopes.length || parentNode.insertBefore(referenceNode, afterReference)) : newScopes.length && (afterReference = referenceNode.nextSibling, referenceNode.remove())), reconcile(parentNode, oldScopes, newScopes, afterReference);
+      let newLen = newScopes.length, hasSiblings = referenceNode !== parentNode, afterReference = null, oldEnd = oldLen - 1, newEnd = newLen - 1, start = 0;
+      if (hasSiblings && (oldLen ? (afterReference = oldScopes[oldEnd].K.nextSibling, newLen || parentNode.insertBefore(referenceNode, afterReference)) : newLen && (afterReference = referenceNode.nextSibling, referenceNode.remove())), !hasPotentialMoves) {
+        oldLen && (oldScopes.forEach(
+          hasSiblings ? removeAndDestroyBranch : destroyBranch
+        ), hasSiblings || (parentNode.textContent = ""));
+        for (let newScope of newScopes)
+          insertBranchBefore(newScope, parentNode, afterReference);
+        return;
+      }
+      for (let branch of oldScopesByKey.values())
+        removeAndDestroyBranch(branch);
+      for (; start < oldLen && start < newLen && oldScopes[start] === newScopes[start]; )
+        start++;
+      for (; oldEnd >= start && newEnd >= start && oldScopes[oldEnd] === newScopes[newEnd]; )
+        oldEnd--, newEnd--;
+      if (oldEnd + 1 < oldLen && (afterReference = oldScopes[oldEnd + 1].S), start > oldEnd) {
+        if (start <= newEnd)
+          for (let i = start; i <= newEnd; i++)
+            insertBranchBefore(newScopes[i], parentNode, afterReference);
+        return;
+      } else if (start > newEnd)
+        return;
+      let diffLen = newEnd - start + 1, oldPos = /* @__PURE__ */ new Map(), sources = new Array(diffLen), pred = new Array(diffLen), tails = [], tail = -1, lo, hi, mid;
+      for (let i = start; i <= oldEnd; i++)
+        oldPos.set(oldScopes[i], i);
+      for (let i = diffLen; i--; )
+        sources[i] = oldPos.get(newScopes[start + i]) ?? -1;
+      for (let i = 0; i < diffLen; i++)
+        if (~sources[i])
+          if (tail < 0 || sources[tails[tail]] < sources[i])
+            ~tail && (pred[i] = tails[tail]), tails[++tail] = i;
+          else {
+            for (lo = 0, hi = tail; lo < hi; )
+              mid = (lo + hi) / 2 | 0, sources[tails[mid]] < sources[i] ? lo = mid + 1 : hi = mid;
+            sources[i] < sources[tails[lo]] && (lo > 0 && (pred[i] = tails[lo - 1]), tails[lo] = i);
+          }
+      for (hi = tails[tail], lo = tail + 1; lo-- > 0; )
+        tails[lo] = hi, hi = pred[hi];
+      for (let i = diffLen; i--; )
+        ~tail && i === tails[tail] ? tail-- : insertBranchBefore(newScopes[start + i], parentNode, afterReference), afterReference = newScopes[start + i].S;
     };
   };
 }

package/dist/html.js

@@ -542,7 +542,7 @@ function getRegistered(val) {
     return { id: registered.id, scope: registered.scope };
 }
 function writeRoot(state, root) {
-  let { buf } = state, hadBuf = buf.length !== 0, result = "";
+  let { buf } = state, hadBuf = buf.length !== 0, result;
   if (hadBuf && buf.push(","), writeProp(state, root, null, "")) {
     let rootRef = state.refs.get(root);
     if (rootRef) {
@@ -836,7 +836,7 @@ function writeSet(state, val, ref) {
   ), writeArray(state, items, arrayRef), state.buf.push(")"), !0;
 }
 function writeArrayBuffer(state, val) {
-  let result = "";
+  let result;
   if (val.byteLength) {
     let view = new Int8Array(val);
     result = hasOnlyZeros(view) ? "new ArrayBuffer(" + val.byteLength + ")" : "new Int8Array(" + typedArrayToInitString(view) + ").buffer";
@@ -887,7 +887,7 @@ function writeRequest(state, val, ref) {
   let options = "";
   val.cache !== "default" && (options += sep + "cache:" + quote(val.cache, 0), sep = ","), val.credentials !== "same-origin" && (options += sep + "credentials:" + quote(val.credentials, 0), sep = ",");
   let headers = stringEntriesToProps(val.headers);
-  return state.refs.set(val.headers, new Reference(ref, "headers", state.flush, null)), headers && (options += sep + "headers:{" + headers + "}", sep = ","), val.integrity && (options += sep + "integrity:" + quote(val.integrity, 0), sep = ","), val.keepalive && (options += sep + "keepalive:true", sep = ","), val.method !== "GET" && (options += sep + "method:" + quote(val.method, 0), sep = ","), val.mode !== "cors" && (options += sep + "mode:" + quote(val.mode, 0), sep = ","), val.redirect !== "follow" && (options += sep + "redirect:" + quote(val.redirect, 0), sep = ","), val.referrer !== "about:client" && (options += sep + "referrer:" + quote(val.referrer, 0), sep = ","), val.referrerPolicy && (options += sep + "referrerPolicy:" + quote(val.referrerPolicy, 0), sep = ","), state.buf.push(
+  return state.refs.set(val.headers, new Reference(ref, "headers", state.flush, null)), headers && (options += sep + "headers:{" + headers + "}", sep = ","), val.integrity && (options += sep + "integrity:" + quote(val.integrity, 0), sep = ","), val.keepalive && (options += sep + "keepalive:true", sep = ","), val.method !== "GET" && (options += sep + "method:" + quote(val.method, 0), sep = ","), val.mode !== "cors" && (options += sep + "mode:" + quote(val.mode, 0), sep = ","), val.redirect !== "follow" && (options += sep + "redirect:" + quote(val.redirect, 0), sep = ","), val.referrer !== "about:client" && (options += sep + "referrer:" + quote(val.referrer, 0), sep = ","), val.referrerPolicy && (options += sep + "referrerPolicy:" + quote(val.referrerPolicy, 0)), state.buf.push(
     hasBody ? options + "})" : options ? ",{" + options + "})" : ")"
   ), !0;
 }
@@ -895,7 +895,7 @@ function writeResponse(state, val, ref) {
   let sep = "", options = "";
   val.status !== 200 && (options += "status:" + val.status, sep = ","), val.statusText && (options += sep + "statusText:" + quote(val.statusText, 0), sep = ",");
   let headers = stringEntriesToProps(val.headers);
-  return state.refs.set(val.headers, new Reference(ref, "headers", state.flush, null)), headers && (options += sep + "headers:{" + headers + "}", sep = ","), !val.body || val.bodyUsed ? state.buf.push(
+  return state.refs.set(val.headers, new Reference(ref, "headers", state.flush, null)), headers && (options += sep + "headers:{" + headers + "}"), !val.body || val.bodyUsed ? state.buf.push(
     "new Response" + (options ? "(null,{" + options + "})" : "")
   ) : (state.buf.push("new Response("), state.buf.push(
     (writeProp(state, val.body, ref, "body") ? "" : "null") + (options ? ",{" + options + "})" : ")")
@@ -2008,7 +2008,7 @@ var RENDERER_REGISTER_ID = "$C_r", SET_SCOPE_REGISTER_ID = "$C_s", RENDER_BODY_I
 
 // src/html/dynamic-tag.ts
 var voidElementsReg = /^(?:area|b(?:ase|r)|col|embed|hr|i(?:mg|nput)|link|meta|param|source|track|wbr)$/, _dynamic_tag = (scopeId, accessor, tag, inputOrArgs, content, inputIsArgs, serializeReason) => {
-  let shouldResume = serializeReason !== 0, renderer = normalizeDynamicRenderer(tag), state = getState(), branchId = _peek_scope_id(), rendered = !1, result;
+  let shouldResume = serializeReason !== 0, renderer = normalizeDynamicRenderer(tag), state = getState(), branchId = _peek_scope_id(), rendered, result;
   if (typeof renderer == "string") {
     let input = (inputIsArgs ? inputOrArgs[0] : inputOrArgs) || {};
     if (rendered = !0, _scope_id(), _html(

package/dist/html.mjs

@@ -452,7 +452,7 @@ function getRegistered(val) {
     return { id: registered.id, scope: registered.scope };
 }
 function writeRoot(state, root) {
-  let { buf } = state, hadBuf = buf.length !== 0, result = "";
+  let { buf } = state, hadBuf = buf.length !== 0, result;
   if (hadBuf && buf.push(","), writeProp(state, root, null, "")) {
     let rootRef = state.refs.get(root);
     if (rootRef) {
@@ -746,7 +746,7 @@ function writeSet(state, val, ref) {
   ), writeArray(state, items, arrayRef), state.buf.push(")"), !0;
 }
 function writeArrayBuffer(state, val) {
-  let result = "";
+  let result;
   if (val.byteLength) {
     let view = new Int8Array(val);
     result = hasOnlyZeros(view) ? "new ArrayBuffer(" + val.byteLength + ")" : "new Int8Array(" + typedArrayToInitString(view) + ").buffer";
@@ -797,7 +797,7 @@ function writeRequest(state, val, ref) {
   let options = "";
   val.cache !== "default" && (options += sep + "cache:" + quote(val.cache, 0), sep = ","), val.credentials !== "same-origin" && (options += sep + "credentials:" + quote(val.credentials, 0), sep = ",");
   let headers = stringEntriesToProps(val.headers);
-  return state.refs.set(val.headers, new Reference(ref, "headers", state.flush, null)), headers && (options += sep + "headers:{" + headers + "}", sep = ","), val.integrity && (options += sep + "integrity:" + quote(val.integrity, 0), sep = ","), val.keepalive && (options += sep + "keepalive:true", sep = ","), val.method !== "GET" && (options += sep + "method:" + quote(val.method, 0), sep = ","), val.mode !== "cors" && (options += sep + "mode:" + quote(val.mode, 0), sep = ","), val.redirect !== "follow" && (options += sep + "redirect:" + quote(val.redirect, 0), sep = ","), val.referrer !== "about:client" && (options += sep + "referrer:" + quote(val.referrer, 0), sep = ","), val.referrerPolicy && (options += sep + "referrerPolicy:" + quote(val.referrerPolicy, 0), sep = ","), state.buf.push(
+  return state.refs.set(val.headers, new Reference(ref, "headers", state.flush, null)), headers && (options += sep + "headers:{" + headers + "}", sep = ","), val.integrity && (options += sep + "integrity:" + quote(val.integrity, 0), sep = ","), val.keepalive && (options += sep + "keepalive:true", sep = ","), val.method !== "GET" && (options += sep + "method:" + quote(val.method, 0), sep = ","), val.mode !== "cors" && (options += sep + "mode:" + quote(val.mode, 0), sep = ","), val.redirect !== "follow" && (options += sep + "redirect:" + quote(val.redirect, 0), sep = ","), val.referrer !== "about:client" && (options += sep + "referrer:" + quote(val.referrer, 0), sep = ","), val.referrerPolicy && (options += sep + "referrerPolicy:" + quote(val.referrerPolicy, 0)), state.buf.push(
     hasBody ? options + "})" : options ? ",{" + options + "})" : ")"
   ), !0;
 }
@@ -805,7 +805,7 @@ function writeResponse(state, val, ref) {
   let sep = "", options = "";
   val.status !== 200 && (options += "status:" + val.status, sep = ","), val.statusText && (options += sep + "statusText:" + quote(val.statusText, 0), sep = ",");
   let headers = stringEntriesToProps(val.headers);
-  return state.refs.set(val.headers, new Reference(ref, "headers", state.flush, null)), headers && (options += sep + "headers:{" + headers + "}", sep = ","), !val.body || val.bodyUsed ? state.buf.push(
+  return state.refs.set(val.headers, new Reference(ref, "headers", state.flush, null)), headers && (options += sep + "headers:{" + headers + "}"), !val.body || val.bodyUsed ? state.buf.push(
     "new Response" + (options ? "(null,{" + options + "})" : "")
   ) : (state.buf.push("new Response("), state.buf.push(
     (writeProp(state, val.body, ref, "body") ? "" : "null") + (options ? ",{" + options + "})" : ")")
@@ -1918,7 +1918,7 @@ var RENDERER_REGISTER_ID = "$C_r", SET_SCOPE_REGISTER_ID = "$C_s", RENDER_BODY_I
 
 // src/html/dynamic-tag.ts
 var voidElementsReg = /^(?:area|b(?:ase|r)|col|embed|hr|i(?:mg|nput)|link|meta|param|source|track|wbr)$/, _dynamic_tag = (scopeId, accessor, tag, inputOrArgs, content, inputIsArgs, serializeReason) => {
-  let shouldResume = serializeReason !== 0, renderer = normalizeDynamicRenderer(tag), state = getState(), branchId = _peek_scope_id(), rendered = !1, result;
+  let shouldResume = serializeReason !== 0, renderer = normalizeDynamicRenderer(tag), state = getState(), branchId = _peek_scope_id(), rendered, result;
   if (typeof renderer == "string") {
     let input = (inputIsArgs ? inputOrArgs[0] : inputOrArgs) || {};
     if (rendered = !0, _scope_id(), _html(

package/dist/translator/index.js

@@ -9388,7 +9388,7 @@ function createSources(state, param) {
   return { state, param };
 }
 function compareSources(a, b) {
-  let delta = 0;
+  let delta;
   if (a.param) {
     if (!b.param) return 1;
     if (delta = compareReferences(a.param, b.param)) return delta;
@@ -9775,21 +9775,21 @@ function findClosestReference(from, refs) {
       return from;
     }
     for (const ref of refs) {
-      const closest = findClosestUpstream(from, ref);
-      if (closest) return closest;
+      const closest2 = findClosestUpstream(from, ref);
+      if (closest2) return closest2;
     }
   } else {
-    const closest = findClosestUpstream(from, refs);
-    if (closest) return closest;
+    const closest2 = findClosestUpstream(from, refs);
+    if (closest2) return closest2;
   }
 }
 function findClosestUpstream(from, to) {
-  let closest = from;
+  let closest2 = from;
   do {
-    if (closest === to) {
-      return closest;
+    if (closest2 === to) {
+      return closest2;
     }
-  } while (closest = closest.upstreamAlias);
+  } while (closest2 = closest2.upstreamAlias);
 }
 function getRootBindings(reads) {
   let rootRefs;
@@ -12396,22 +12396,13 @@ var attribute_tag_default = {
 // src/translator/visitors/tag/custom-tag.ts
 var import_compiler61 = require("@marko/compiler");
 var import_babel_utils49 = require("@marko/compiler/babel-utils");
+var import_fastest_levenshtein = require("fastest-levenshtein");
 var import_path4 = __toESM(require("path"));
 var custom_tag_default = {
   analyze: {
     enter(tag) {
       const templateFile = (0, import_babel_utils49.getTagTemplate)(tag);
-      if (!templateFile) {
-        const tagName = getTagName(tag);
-        if (tagName && tag.scope.hasBinding(tagName)) {
-          throw tag.get("name").buildCodeFrameError(
-            `Local variables must be in a [dynamic tag](https://markojs.com/docs/reference/language#dynamic-tags) unless they are PascalCase. Use \`<\${${tagName}}/>\` or rename to \`${tagName.charAt(0).toUpperCase() + tagName.slice(1)}\`.`
-          );
-        }
-        throw tag.get("name").buildCodeFrameError(
-          `Unable to find entry point for [custom tag](https://markojs.com/docs/reference/custom-tag#relative-custom-tags) \`<${tagName}>\`.`
-        );
-      }
+      if (!templateFile) throw tagNotFoundError(tag);
       (0, import_babel_utils49.assertAttributesOrSingleArg)(tag);
       const childFile = (0, import_babel_utils49.loadFileForTag)(tag);
       if (!childFile) {
@@ -12542,18 +12533,29 @@ function getTagRelativePath(tag) {
   } else if (node.extra?.tagNameImported) {
     relativePath = node.extra.tagNameImported;
   }
-  if (!relativePath) {
-    const tagName = getTagName(tag);
-    if (tagName && tag.scope.hasBinding(tagName)) {
-      throw tag.get("name").buildCodeFrameError(
-        `Local variables must be in a [dynamic tag](https://markojs.com/docs/reference/language#dynamic-tags) unless they are PascalCase. Use \`<\${${tagName}}/>\` or rename to \`${tagName.charAt(0).toUpperCase() + tagName.slice(1)}\`.`
-      );
-    }
-    throw tag.get("name").buildCodeFrameError(
-      `Unable to find entry point for [custom tag](https://markojs.com/docs/reference/custom-tag#relative-custom-tags) \`<${tagName}>\`.`
+  if (!relativePath) throw tagNotFoundError(tag);
+  return relativePath;
+}
+function tagNotFoundError(tag) {
+  const tagName = getTagName(tag);
+  if (tagName && tag.scope.hasBinding(tagName)) {
+    return tag.get("name").buildCodeFrameError(
+      `Local variables must be in a [dynamic tag](https://markojs.com/docs/reference/language#dynamic-tags) unless they are PascalCase. Use \`<\${${tagName}}/>\` or rename to \`${tagName.charAt(0).toUpperCase() + tagName.slice(1)}\`.`
     );
   }
-  return relativePath;
+  let didYouMean = "";
+  if (tagName) {
+    const closestTag = (0, import_fastest_levenshtein.closest)(
+      tagName,
+      Object.keys(tag.state.file.___taglibLookup.merged.tags)
+    );
+    if ((0, import_fastest_levenshtein.distance)(tagName, closestTag) < 4) {
+      didYouMean = ` Did you mean \`<${closestTag}>\`?`;
+    }
+  }
+  return tag.get("name").buildCodeFrameError(
+    `Unable to find entry point for [custom tag](https://markojs.com/docs/reference/custom-tag#relative-custom-tags) \`<${tagName}>\`.${didYouMean}`
+  );
 }
 function importOrSelfReferenceName(file, request, name2, nameHint) {
   if (isCircularRequest(file, request)) {

package/dist/translator/util/known-tag.d.ts

@@ -21,6 +21,5 @@ declare module "@marko/compiler/dist/types" {
 export declare function knownTagAnalyze(tag: t.NodePath<t.MarkoTag>, contentSection: Section, propTree: BindingPropTree | undefined): void;
 export declare function knownTagTranslateHTML(tag: t.NodePath<t.MarkoTag>, tagIdentifier: t.Expression, contentSection: Section, propTree: BindingPropTree | undefined): void;
 export declare function knownTagTranslateDOM(tag: t.NodePath<t.MarkoTag>, propTree: BindingPropTree | undefined, getBindingIdentifier: (binding: Binding, preferedName?: string) => t.Identifier, callSetup: (section: Section, childBinding: Binding) => void): void;
-export declare function getTagRelativePath(tag: t.NodePath<t.MarkoTag>): string;
 export declare function finalizeKnownTags(section: Section): void;
 export {};

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "marko",
-  "version": "6.0.152",
+  "version": "6.0.154",
   "description": "Optimized runtime for Marko templates.",
   "keywords": [
     "api",
@@ -48,8 +48,9 @@
     "build": "node -r ~ts ./scripts/bundle.ts"
   },
   "dependencies": {
-    "@marko/compiler": "^5.39.58",
+    "@marko/compiler": "^5.39.59",
     "csstype": "^3.2.3",
+    "fastest-levenshtein": "^1.0.16",
     "magic-string": "^0.30.21"
   },
   "engines": {

package/dist/dom/reconcile.d.ts

@@ -1,2 +0,0 @@
-import { type BranchScope } from "../common/types";
-export declare function reconcile(parent: ParentNode, oldBranches: BranchScope[], newBranches: BranchScope[], afterReference: Node | null): void;