@thyn/core 0.0.232 → 0.0.233

package/dist/element.js

@@ -9,17 +9,6 @@ export function collectEffect(effectFn) {
     }
     collectingHead = effectFn;
 }
-// export function createReactiveTextNode(v) {
-//   let n;
-//   staticEffect(() => {
-//     if (n) {
-//       n.nodeValue = v();
-//     } else {
-//       n = document.createTextNode(v());
-//     }
-//   });
-//   return n;
-// }
 export function createReactiveTextNode(v) {
     const n = document.createTextNode(v());
     staticEffect(() => {
@@ -252,9 +241,7 @@ export function list(props, terminal = false) {
     const teardownNode = terminal ? shallowTeardown : teardown;
     let parent;
     let outlet = document.createDocumentFragment();
-    // State
-    let prevItems = [];
-    let rowNodes = []; // The "Shadow Array" - avoids reading DOM
+    let prevItems;
     const startBookend = document.createComment("");
     const endBookend = document.createComment("");
     startBookend.$frag = outlet;
@@ -262,151 +249,156 @@ export function list(props, terminal = false) {
     const render = props.render;
     staticEffect(() => {
         parent = startBookend.parentNode;
-        // 1. Initialization / First Render
         if (!parent) {
-            const items = props.items();
-            // Render all items
-            const newNodes = items.map(render);
-            outlet.append(startBookend, ...newNodes, endBookend);
-            // Save state
-            prevItems = items;
-            rowNodes = newNodes;
+            prevItems = props.items();
+            outlet.append(startBookend, ...prevItems.map(render), endBookend);
             return;
         }
-        const nextItems = props.items();
-        const newLength = nextItems.length;
+        let nextItems = props.items();
+        let newLength = nextItems.length;
         let oldLength = prevItems.length;
-        // 2. Fast Path: Clear All
-        if (newLength === 0) {
-            if (oldLength !== 0) {
-                for (let i = 0; i < oldLength; i++) {
-                    teardownNode(rowNodes[i]);
-                    remove(rowNodes[i]);
-                }
-                rowNodes = [];
-                prevItems = [];
+        if (!oldLength && newLength) {
+            endBookend.before(...nextItems.map(render));
+            prevItems = nextItems;
+            nextItems = null;
+            return;
+        }
+        const childNodeList = parent.childNodes;
+        const childNodes = Array.from(childNodeList);
+        const offset = childNodes.indexOf(startBookend) + 1;
+        if (!newLength) {
+            const removalQueue = [];
+            const end = prevItems.length + offset;
+            for (let i = offset; i < end; i++) {
+                const ch = childNodeList[i];
+                teardownNode(ch);
+                removalQueue.push(ch);
             }
+            for (const ch of removalQueue) {
+                remove(ch);
+            }
+            prevItems = nextItems;
+            nextItems = null;
             return;
         }
-        // 3. Fast Path: Create All (from empty)
-        if (oldLength === 0) {
-            const newNodes = nextItems.map(render);
-            endBookend.before(...newNodes);
-            rowNodes = newNodes;
+        let start = nextItems.findIndex((item, index) => prevItems[index] !== item);
+        if (start === oldLength) {
+            endBookend.before(...nextItems.slice(start).map(render));
             prevItems = nextItems;
+            nextItems = null;
             return;
         }
-        // 4. Reconciliation
-        let start = 0;
-        let minLen = Math.min(oldLength, newLength);
-        // Prefix Scan (Cheaper JS Array read vs DOM read)
-        while (start < minLen && prevItems[start] === nextItems[start]) {
-            start++;
+        if (start < 0) {
+            for (let i = nextItems.length; i < oldLength; i++) {
+                const e = childNodes[offset + --oldLength];
+                teardownNode(e);
+                remove(e);
+            }
+            prevItems = nextItems;
+            nextItems = null;
+            return;
         }
-        // Optimization: Append only
-        if (start === oldLength && newLength > oldLength) {
-            const newPart = nextItems.slice(start);
-            const newNodes = newPart.map(render);
-            endBookend.before(...newNodes);
-            rowNodes = rowNodes.concat(newNodes);
+        if (start >= newLength) {
+            while (start < oldLength) {
+                const e = childNodes[offset + --oldLength];
+                teardownNode(e);
+                remove(e);
+            }
             prevItems = nextItems;
+            nextItems = null;
             return;
         }
-        // Optimization: Truncate only
-        if (start === newLength && oldLength > newLength) {
-            for (let i = start; i < oldLength; i++) {
-                teardownNode(rowNodes[i]);
-                remove(rowNodes[i]);
+        // suffix
+        for (oldLength--, newLength--; newLength > start &&
+            oldLength >= start &&
+            nextItems[newLength] === prevItems[oldLength]; oldLength--, newLength--)
+            ;
+        const nextKeys = new Set(nextItems);
+        const removalQueue = [];
+        for (let i = start; i <= oldLength; i++) {
+            if (!nextKeys.has(prevItems[i])) {
+                const ch = childNodes[i + offset];
+                teardownNode(ch);
+                removalQueue.push(ch);
+                childNodes[i + offset] = null;
             }
-            rowNodes.length = newLength; // JS Array Truncate
+        }
+        for (const e of removalQueue) {
+            remove(e);
+        }
+        if (oldLength - start === removalQueue.length) {
             prevItems = nextItems;
+            nextItems = null;
             return;
         }
-        // Suffix Scan
-        let end = 0;
-        // We stop if the suffix hits the prefix
-        while (newLength - 1 - end >= start &&
-            oldLength - 1 - end >= start &&
-            nextItems[newLength - 1 - end] === prevItems[oldLength - 1 - end]) {
-            end++;
-        }
-        // 5. Complex Diff (The Middle)
-        const oldStart = start;
-        const oldEnd = oldLength - end;
-        const newEnd = newLength - end;
-        // A. Build Map of existing items in the "changed" region
-        // key -> { node, index }
-        const keyMap = new Map();
-        for (let i = oldStart; i < oldEnd; i++) {
-            const item = prevItems[i];
-            // If duplicate items exist, first one wins or logic needs to be more robust.
-            // Assuming unique keys for simplicity or using last-write-wins:
-            // if (!keyMap.has(item)) {
-            keyMap.set(item, rowNodes[i]);
-            // } else {
-            // Handle duplicates by removing the extra immediately? 
-            // Or handle collision. For now, assume distinct items or standard behavior.
-            // }
+        let keyMap = new Map();
+        for (let i = start; i <= oldLength; i++) {
+            if (childNodes[i + offset] &&
+                (!nextItems[i] ||
+                    prevItems[i] !== nextItems[i])) {
+                keyMap.set(prevItems[i], {
+                    el: childNodes[i + offset],
+                    item: prevItems[i],
+                });
+            }
         }
-        // B. Setup for new node list construction
-        const nextRowNodes = new Array(newLength);
-        // Copy Prefix
-        for (let i = 0; i < start; i++) {
-            nextRowNodes[i] = rowNodes[i];
-        }
-        // Copy Suffix
-        for (let i = 0; i < end; i++) {
-            nextRowNodes[newLength - 1 - i] = rowNodes[oldLength - 1 - i];
-        }
-        // C. Find anchor for insertions
-        // We insert before the first node of the suffix, or the endBookend.
-        const anchor = (end > 0) ? rowNodes[oldLength - end] : endBookend;
-        // D. Iterate new middle
-        for (let i = oldStart; i < newEnd; i++) {
-            const newItem = nextItems[i];
-            let node;
-            if (keyMap.has(newItem)) {
-                // Reuse existing
-                node = keyMap.get(newItem);
-                keyMap.delete(newItem);
-                // DOM Move: 
-                // We always insertBefore the anchor. 
-                // Since we are iterating forward, "anchor" isn't static.
-                // Actually, simply inserting before the *current* anchor works if we 
-                // process carefully, but standard "place and move cursor" is safer.
-                parent.insertBefore(node, anchor);
+        if (newLength === oldLength && keyMap.size > (newLength - start + 1) / 2) {
+            const lastOrdered = childNodes[start + offset - 1];
+            const set = [];
+            for (let i = start; i <= newLength; i++) {
+                set.push(keyMap.get(nextItems[i])?.el ?? childNodes[i + offset]);
             }
-            else {
-                // Create new
-                node = render(newItem);
-                parent.insertBefore(node, anchor);
+            lastOrdered.after(...set);
+            prevItems = nextItems;
+            keyMap = null;
+            nextItems = null;
+            return;
+        }
+        while (start <= newLength) {
+            const newChd = nextItems[start];
+            const oldChd = prevItems[start];
+            if (newChd === oldChd) {
+                start++;
+                continue;
+            }
+            if (oldChd === undefined) {
+                parent.insertBefore(render(newChd), endBookend);
+                start++;
+                continue;
+            }
+            const mappedOld = keyMap.get(newChd);
+            if (mappedOld) {
+                const oldDom = childNodeList[start + offset];
+                const { el, item } = mappedOld;
+                if (oldDom !== el) {
+                    const tmp = el.nextSibling;
+                    parent.insertBefore(el, oldDom);
+                    parent.insertBefore(oldDom, tmp);
+                }
+                else if (item !== newChd) {
+                    replaceWith(newChd, el, render);
+                }
+                keyMap.delete(newChd);
             }
-            nextRowNodes[i] = node;
-        }
-        // E. Cleanup
-        // Anything remaining in keyMap is gone
-        for (const node of keyMap.values()) {
-            teardownNode(node);
-            remove(node);
-        }
-        // Handle "middle" items that weren't in keyMap (duplicates logic) 
-        // or implicit removals handled by the map logic.
-        // Specifically: We iterated [oldStart...oldEnd] to build the map.
-        // If an item was in that range but NOT in the new range, it's in the map.
-        // If it WAS in the new range, we removed it from the map.
-        // So map.values() is exactly what needs to die. 
-        // Update State
-        rowNodes = nextRowNodes;
+            else if (oldChd !== newChd) {
+                parent.insertBefore(render(newChd), childNodeList[start + offset]);
+            }
+            start++;
+        }
+        for (const { el } of keyMap.values()) {
+            teardownNode(el);
+            remove(el);
+        }
+        keyMap = null;
         prevItems = nextItems;
+        nextItems = null;
     });
     return outlet;
 }
 export function isolatedTerminalList(props) {
     let parent;
     let outlet = document.createDocumentFragment();
-    // State
-    let prevItems = [];
-    let rowNodes = []; // The "Shadow Array"
+    let prevItems;
     const startBookend = document.createComment("");
     const endBookend = document.createComment("");
     startBookend.$frag = outlet;
@@ -414,121 +406,160 @@ export function isolatedTerminalList(props) {
     const render = props.render;
     staticEffect(() => {
         parent = startBookend.parentNode;
-        // 1. Initialization
         if (!parent) {
-            const items = props.items();
-            const newNodes = items.map(render);
-            outlet.append(startBookend, ...newNodes, endBookend);
-            prevItems = items;
-            rowNodes = newNodes;
+            prevItems = props.items();
+            outlet.append(startBookend, ...prevItems.map(render), endBookend);
             return;
         }
-        const nextItems = props.items();
-        const newLength = nextItems.length;
-        const oldLength = prevItems.length;
-        // 2. Fast Path: Clear All
-        if (newLength === 0) {
-            if (oldLength !== 0) {
-                // Optimization: If the parent only contains our list (between bookends),
-                // we might want to use textContent = "". However, to be safe with 
-                // bookends logic, we remove specifically known nodes.
-                for (let i = 0; i < oldLength; i++) {
-                    const node = rowNodes[i];
-                    shallowTeardown(node);
-                    // node.remove();
-                }
-                parent.textContent = "";
-                parent.append(startBookend, endBookend);
-                rowNodes = [];
-                prevItems = [];
+        let nextItems = props.items();
+        let newLength = nextItems.length;
+        let oldLength = prevItems.length;
+        if (!oldLength && newLength) {
+            endBookend.before(...nextItems.map(render));
+            prevItems = nextItems;
+            nextItems = null;
+            return;
+        }
+        const childNodeList = parent.childNodes;
+        if (!newLength) {
+            const end = childNodeList.length - 1;
+            for (let i = 1; i < end; i++) {
+                shallowTeardown(childNodeList[i]);
             }
+            parent.textContent = "";
+            parent.append(startBookend, endBookend);
+            prevItems = nextItems;
+            nextItems = null;
             return;
         }
-        // 3. Fast Path: Create All
-        if (oldLength === 0) {
-            const newNodes = nextItems.map(render);
-            endBookend.before(...newNodes);
-            rowNodes = newNodes;
+        let start = nextItems.findIndex((item, index) => prevItems[index] !== item);
+        if (start === oldLength) {
+            endBookend.before(...nextItems.slice(start).map(render));
             prevItems = nextItems;
+            nextItems = null;
             return;
         }
-        // 4. Reconciliation
-        let start = 0;
-        const minLen = Math.min(oldLength, newLength);
-        // Prefix Scan
-        while (start < minLen && prevItems[start] === nextItems[start]) {
-            start++;
+        let childNodes = Array.from(childNodeList);
+        if (start < 0) {
+            for (let i = nextItems.length; i < oldLength; i++) {
+                const e = childNodes[1 + --oldLength];
+                shallowTeardown(e);
+                e.remove();
+            }
+            prevItems = nextItems;
+            nextItems = null;
+            childNodes = null;
+            return;
+        }
+        if (start >= newLength) {
+            while (start < oldLength) {
+                const e = childNodes[1 + --oldLength];
+                shallowTeardown(e);
+                e.remove();
+            }
+            prevItems = nextItems;
+            nextItems = null;
+            childNodes = null;
+            return;
+        }
+        // suffix
+        for (oldLength--, newLength--; newLength > start &&
+            oldLength >= start &&
+            nextItems[newLength] === prevItems[oldLength]; oldLength--, newLength--)
+            ;
+        const nextKeys = new Set(nextItems);
+        const removalQueue = [];
+        for (let i = start; i <= oldLength; i++) {
+            if (!nextKeys.has(prevItems[i])) {
+                const ch = childNodes[i + 1];
+                shallowTeardown(ch);
+                removalQueue.push(ch);
+                childNodes[i + 1] = null;
+            }
         }
-        // Optimization: Append Suffix
-        if (start === oldLength && newLength > oldLength) {
-            const newPart = nextItems.slice(start);
-            const newNodes = newPart.map(render);
-            endBookend.before(...newNodes);
-            rowNodes = rowNodes.concat(newNodes);
+        if (removalQueue.length === prevItems.length) {
+            parent.textContent = "";
+            parent.append(startBookend, ...nextItems.map(render), endBookend);
             prevItems = nextItems;
+            nextItems = null;
+            childNodes = null;
             return;
         }
-        // Optimization: Truncate Suffix
-        if (start === newLength && oldLength > newLength) {
-            for (let i = start; i < oldLength; i++) {
-                const node = rowNodes[i];
-                shallowTeardown(node);
-                node.remove();
+        for (const e of removalQueue) {
+            e.remove();
+        }
+        if (oldLength - start === removalQueue.length) {
+            prevItems = nextItems;
+            nextItems = null;
+            childNodes = null;
+            return;
+        }
+        let keyMap = new Map();
+        for (let i = start; i <= oldLength; i++) {
+            if (childNodes[i + 1] &&
+                (!nextItems[i] ||
+                    prevItems[i] !== nextItems[i])) {
+                keyMap.set(prevItems[i], {
+                    el: childNodes[i + 1],
+                    item: prevItems[i],
+                });
+            }
+        }
+        if (newLength === oldLength && keyMap.size > (newLength - start + 1) / 2) {
+            const lastOrdered = childNodes[start];
+            // const set = [];
+            // for (let i = start; i <= newLength; i++) {
+            //   set.push(keyMap.get(nextItems[i])?.el ?? childNodes[i + 1]);
+            // }
+            // lastOrdered.after(...set);
+            for (let i = newLength; i >= start; i--) {
+                lastOrdered.after(keyMap.get(nextItems[i])?.el ?? childNodes[i + 1]);
             }
-            rowNodes.length = newLength;
             prevItems = nextItems;
+            keyMap = null;
+            nextItems = null;
+            childNodes = null;
             return;
         }
-        // Suffix Scan
-        let end = 0;
-        while (newLength - 1 - end >= start &&
-            oldLength - 1 - end >= start &&
-            nextItems[newLength - 1 - end] === prevItems[oldLength - 1 - end]) {
-            end++;
-        }
-        // 5. Complex Diff (The Middle)
-        const oldStart = start;
-        const oldEnd = oldLength - end;
-        const newEnd = newLength - end;
-        // A. Build Map
-        const keyMap = new Map();
-        for (let i = oldStart; i < oldEnd; i++) {
-            const item = prevItems[i];
-            keyMap.set(item, rowNodes[i]);
-        }
-        const nextRowNodes = new Array(newLength);
-        // Copy Prefix
-        for (let i = 0; i < start; i++) {
-            nextRowNodes[i] = rowNodes[i];
-        }
-        // Copy Suffix
-        for (let i = 0; i < end; i++) {
-            nextRowNodes[newLength - 1 - i] = rowNodes[oldLength - 1 - i];
-        }
-        // Determine Anchor (The first node of the suffix, or the end bookend)
-        const anchor = (end > 0) ? rowNodes[oldLength - end] : endBookend;
-        // B. Process Middle
-        for (let i = oldStart; i < newEnd; i++) {
-            const newItem = nextItems[i];
-            if (keyMap.has(newItem)) {
-                const node = keyMap.get(newItem);
-                keyMap.delete(newItem);
-                parent.insertBefore(node, anchor);
-                nextRowNodes[i] = node;
+        while (start <= newLength) {
+            const newChd = nextItems[start];
+            const oldChd = prevItems[start];
+            if (newChd === oldChd) {
+                start++;
+                continue;
             }
-            else {
-                const node = render(newItem);
-                parent.insertBefore(node, anchor);
-                nextRowNodes[i] = node;
+            if (oldChd === undefined) {
+                parent.insertBefore(render(newChd), endBookend);
+                start++;
+                continue;
             }
+            const mappedOld = keyMap.get(newChd);
+            if (mappedOld) {
+                const oldDom = childNodeList[start + 1];
+                const { el, item } = mappedOld;
+                if (oldDom !== el) {
+                    const tmp = el.nextSibling;
+                    parent.insertBefore(el, oldDom);
+                    parent.insertBefore(oldDom, tmp);
+                }
+                else if (item !== newChd) {
+                    replaceWith(newChd, el, render);
+                }
+                keyMap.delete(newChd);
+            }
+            else if (oldChd !== newChd) {
+                parent.insertBefore(render(newChd), childNodeList[start + 1]);
+            }
+            start++;
         }
-        // C. Cleanup Unused
-        for (const node of keyMap.values()) {
-            shallowTeardown(node);
-            node.remove();
+        for (const { el } of keyMap.values()) {
+            shallowTeardown(el);
+            el.remove();
         }
-        rowNodes = nextRowNodes;
+        keyMap = null;
         prevItems = nextItems;
+        nextItems = null;
+        childNodes = null;
     });
     return outlet;
 }

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@thyn/core",
-  "version": "0.0.232",
+  "version": "0.0.233",
   "scripts": {
     "build": "tsc",
     "pub": "tsc && npm version patch -f && npm -f publish --access=public",

package/src/element.ts

@@ -13,18 +13,6 @@ export function collectEffect(effectFn) {
   collectingHead = effectFn;
 }
 
-// export function createReactiveTextNode(v) {
-//   let n;
-//   staticEffect(() => {
-//     if (n) {
-//       n.nodeValue = v();
-//     } else {
-//       n = document.createTextNode(v());
-//     }
-//   });
-//   return n;
-// }
-
 export function createReactiveTextNode(v) {
   const n = document.createTextNode(v());
   staticEffect(() => {
@@ -270,342 +258,347 @@ export function list(props, terminal = false) {
   const teardownNode = terminal ? shallowTeardown : teardown;
   let parent;
   let outlet = document.createDocumentFragment();
-
-  // State
-  let prevItems = [];
-  let rowNodes = []; // The "Shadow Array" - avoids reading DOM
-
+  let prevItems;
   const startBookend = document.createComment("") as any;
   const endBookend = document.createComment("") as any;
-
   startBookend.$frag = outlet;
   startBookend.$end = endBookend;
-
   const render = props.render;
 
   staticEffect(() => {
     parent = startBookend.parentNode;
-
-    // 1. Initialization / First Render
     if (!parent) {
-      const items = props.items();
-      // Render all items
-      const newNodes = items.map(render);
-
-      outlet.append(startBookend, ...newNodes, endBookend);
-
-      // Save state
-      prevItems = items;
-      rowNodes = newNodes;
+      prevItems = props.items();
+      outlet.append(startBookend, ...prevItems.map(render), endBookend);
       return;
     }
-
-    const nextItems = props.items();
-    const newLength = nextItems.length;
+    let nextItems = props.items();
+    let newLength = nextItems.length;
     let oldLength = prevItems.length;
-
-    // 2. Fast Path: Clear All
-    if (newLength === 0) {
-      if (oldLength !== 0) {
-        for (let i = 0; i < oldLength; i++) {
-          teardownNode(rowNodes[i]);
-          remove(rowNodes[i]);
-        }
-        rowNodes = [];
-        prevItems = [];
-      }
+    if (!oldLength && newLength) {
+      endBookend.before(...nextItems.map(render))
+      prevItems = nextItems;
+      nextItems = null;
       return;
     }
-
-    // 3. Fast Path: Create All (from empty)
-    if (oldLength === 0) {
-      const newNodes = nextItems.map(render);
-      endBookend.before(...newNodes);
-      rowNodes = newNodes;
+    const childNodeList = parent.childNodes as NodeListOf<ChildNode>;
+    const childNodes = Array.from(childNodeList);
+    const offset = childNodes.indexOf(startBookend) + 1;
+    if (!newLength) {
+      const removalQueue = [];
+      const end = prevItems.length + offset;
+      for (let i = offset; i < end; i++) {
+        const ch = childNodeList[i];
+        teardownNode(ch);
+        removalQueue.push(ch);
+      }
+      for (const ch of removalQueue) {
+        remove(ch);
+      }
       prevItems = nextItems;
+      nextItems = null;
       return;
     }
 
-    // 4. Reconciliation
-    let start = 0;
-    let minLen = Math.min(oldLength, newLength);
-
-    // Prefix Scan (Cheaper JS Array read vs DOM read)
-    while (start < minLen && prevItems[start] === nextItems[start]) {
-      start++;
+    let start = nextItems.findIndex((item, index) => prevItems[index] !== item);
+    if (start === oldLength) {
+      endBookend.before(...nextItems.slice(start).map(render));
+      prevItems = nextItems;
+      nextItems = null;
+      return;
     }
 
-    // Optimization: Append only
-    if (start === oldLength && newLength > oldLength) {
-      const newPart = nextItems.slice(start);
-      const newNodes = newPart.map(render);
-      endBookend.before(...newNodes);
-
-      rowNodes = rowNodes.concat(newNodes);
+    if (start < 0) {
+      for (let i = nextItems.length; i < oldLength; i++) {
+        const e = childNodes[offset + --oldLength];
+        teardownNode(e);
+        remove(e);
+      }
       prevItems = nextItems;
+      nextItems = null;
       return;
     }
 
-    // Optimization: Truncate only
-    if (start === newLength && oldLength > newLength) {
-      for (let i = start; i < oldLength; i++) {
-        teardownNode(rowNodes[i]);
-        remove(rowNodes[i]);
+    if (start >= newLength) {
+      while (start < oldLength) {
+        const e = childNodes[offset + --oldLength];
+        teardownNode(e);
+        remove(e);
       }
-      rowNodes.length = newLength; // JS Array Truncate
       prevItems = nextItems;
+      nextItems = null;
       return;
     }
 
-    // Suffix Scan
-    let end = 0;
-    // We stop if the suffix hits the prefix
-    while (
-      newLength - 1 - end >= start &&
-      oldLength - 1 - end >= start &&
-      nextItems[newLength - 1 - end] === prevItems[oldLength - 1 - end]
-    ) {
-      end++;
-    }
-
-    // 5. Complex Diff (The Middle)
-    const oldStart = start;
-    const oldEnd = oldLength - end;
-    const newEnd = newLength - end;
-
-    // A. Build Map of existing items in the "changed" region
-    // key -> { node, index }
-    const keyMap = new Map();
-    for (let i = oldStart; i < oldEnd; i++) {
-      const item = prevItems[i];
-      // If duplicate items exist, first one wins or logic needs to be more robust.
-      // Assuming unique keys for simplicity or using last-write-wins:
-      // if (!keyMap.has(item)) {
-      keyMap.set(item, rowNodes[i]);
-      // } else {
-      // Handle duplicates by removing the extra immediately? 
-      // Or handle collision. For now, assume distinct items or standard behavior.
-      // }
+    // suffix
+    for (
+      oldLength--, newLength--;
+      newLength > start &&
+      oldLength >= start &&
+      nextItems[newLength] === prevItems[oldLength];
+      oldLength--, newLength--
+    );
+
+    const nextKeys = new Set(nextItems);
+    const removalQueue = [];
+    for (let i = start; i <= oldLength; i++) {
+      if (!nextKeys.has(prevItems[i])) {
+        const ch = childNodes[i + offset];
+        teardownNode(ch);
+        removalQueue.push(ch);
+        childNodes[i + offset] = null;
+      }
     }
-
-    // B. Setup for new node list construction
-    const nextRowNodes = new Array(newLength);
-
-    // Copy Prefix
-    for (let i = 0; i < start; i++) {
-      nextRowNodes[i] = rowNodes[i];
+    for (const e of removalQueue) {
+      remove(e);
     }
-    // Copy Suffix
-    for (let i = 0; i < end; i++) {
-      nextRowNodes[newLength - 1 - i] = rowNodes[oldLength - 1 - i];
+    if (oldLength - start === removalQueue.length) {
+      prevItems = nextItems;
+      nextItems = null;
+      return;
     }
-
-    // C. Find anchor for insertions
-    // We insert before the first node of the suffix, or the endBookend.
-    const anchor = (end > 0) ? rowNodes[oldLength - end] : endBookend;
-
-    // D. Iterate new middle
-    for (let i = oldStart; i < newEnd; i++) {
-      const newItem = nextItems[i];
-      let node;
-
-      if (keyMap.has(newItem)) {
-        // Reuse existing
-        node = keyMap.get(newItem);
-        keyMap.delete(newItem);
-
-        // DOM Move: 
-        // We always insertBefore the anchor. 
-        // Since we are iterating forward, "anchor" isn't static.
-        // Actually, simply inserting before the *current* anchor works if we 
-        // process carefully, but standard "place and move cursor" is safer.
-        parent.insertBefore(node, anchor);
-      } else {
-        // Create new
-        node = render(newItem);
-        parent.insertBefore(node, anchor);
+    let keyMap = new Map();
+    for (let i = start; i <= oldLength; i++) {
+      if (
+        childNodes[i + offset] &&
+        (!nextItems[i] ||
+          prevItems[i] !== nextItems[i])
+      ) {
+        keyMap.set(prevItems[i], {
+          el: childNodes[i + offset],
+          item: prevItems[i],
+        });
       }
-      nextRowNodes[i] = node;
     }
-
-    // E. Cleanup
-    // Anything remaining in keyMap is gone
-    for (const node of keyMap.values()) {
-      teardownNode(node);
-      remove(node);
+    if (newLength === oldLength && keyMap.size > (newLength - start + 1) / 2) {
+      const lastOrdered = childNodes[start + offset - 1];
+      const set = [];
+      for (let i = start; i <= newLength; i++) {
+        set.push(keyMap.get(nextItems[i])?.el ?? childNodes[i + offset]);
+      }
+      lastOrdered.after(...set);
+      prevItems = nextItems;
+      keyMap = null;
+      nextItems = null;
+      return;
     }
 
-    // Handle "middle" items that weren't in keyMap (duplicates logic) 
-    // or implicit removals handled by the map logic.
-    // Specifically: We iterated [oldStart...oldEnd] to build the map.
-    // If an item was in that range but NOT in the new range, it's in the map.
-    // If it WAS in the new range, we removed it from the map.
-    // So map.values() is exactly what needs to die. 
-
-    // Update State
-    rowNodes = nextRowNodes;
+    while (start <= newLength) {
+      const newChd = nextItems[start];
+      const oldChd = prevItems[start];
+      if (newChd === oldChd) {
+        start++;
+        continue;
+      }
+      if (oldChd === undefined) {
+        parent.insertBefore(render(newChd), endBookend);
+        start++;
+        continue;
+      }
+      const mappedOld = keyMap.get(newChd);
+      if (mappedOld) {
+        const oldDom = childNodeList[start + offset];
+        const { el, item } = mappedOld;
+        if (oldDom !== el) {
+          const tmp = el.nextSibling;
+          parent.insertBefore(el, oldDom);
+          parent.insertBefore(oldDom, tmp);
+        } else if (item !== newChd) {
+          replaceWith(newChd, el, render);
+        }
+        keyMap.delete(newChd);
+      } else if (oldChd !== newChd) {
+        parent.insertBefore(render(newChd), childNodeList[start + offset]);
+      }
+      start++;
+    }
+    for (const { el } of keyMap.values()) {
+      teardownNode(el);
+      remove(el);
+    }
+    keyMap = null;
     prevItems = nextItems;
+    nextItems = null;
   });
-
   return outlet;
 }
+
 export function isolatedTerminalList(props) {
   let parent;
   let outlet = document.createDocumentFragment();
-
-  // State
-  let prevItems = [];
-  let rowNodes = []; // The "Shadow Array"
-
+  let prevItems;
   const startBookend = document.createComment("") as any;
   const endBookend = document.createComment("") as any;
-
   startBookend.$frag = outlet;
   startBookend.$end = endBookend;
-
   const render = props.render;
 
   staticEffect(() => {
     parent = startBookend.parentNode;
-
-    // 1. Initialization
     if (!parent) {
-      const items = props.items();
-      const newNodes = items.map(render);
-
-      outlet.append(startBookend, ...newNodes, endBookend);
-
-      prevItems = items;
-      rowNodes = newNodes;
+      prevItems = props.items();
+      outlet.append(startBookend, ...prevItems.map(render), endBookend);
       return;
     }
-
-    const nextItems = props.items();
-    const newLength = nextItems.length;
-    const oldLength = prevItems.length;
-
-    // 2. Fast Path: Clear All
-    if (newLength === 0) {
-      if (oldLength !== 0) {
-        // Optimization: If the parent only contains our list (between bookends),
-        // we might want to use textContent = "". However, to be safe with 
-        // bookends logic, we remove specifically known nodes.
-        for (let i = 0; i < oldLength; i++) {
-          const node = rowNodes[i];
-          shallowTeardown(node);
-          // node.remove();
-        }
-        parent.textContent = "";
-        parent.append(startBookend, endBookend);
-        rowNodes = [];
-        prevItems = [];
+    let nextItems = props.items();
+    let newLength = nextItems.length;
+    let oldLength = prevItems.length;
+    if (!oldLength && newLength) {
+      endBookend.before(...nextItems.map(render))
+      prevItems = nextItems;
+      nextItems = null;
+      return;
+    }
+    const childNodeList = parent.childNodes as NodeListOf<ChildNode>;
+    if (!newLength) {
+      const end = childNodeList.length - 1;
+      for (let i = 1; i < end; i++) {
+        shallowTeardown(childNodeList[i]);
       }
+      parent.textContent = "";
+      parent.append(startBookend, endBookend);
+      prevItems = nextItems;
+      nextItems = null;
       return;
     }
 
-    // 3. Fast Path: Create All
-    if (oldLength === 0) {
-      const newNodes = nextItems.map(render);
-      endBookend.before(...newNodes);
-
-      rowNodes = newNodes;
+    let start = nextItems.findIndex((item, index) => prevItems[index] !== item);
+    if (start === oldLength) {
+      endBookend.before(...nextItems.slice(start).map(render));
       prevItems = nextItems;
+      nextItems = null;
       return;
     }
 
-    // 4. Reconciliation
-    let start = 0;
-    const minLen = Math.min(oldLength, newLength);
-
-    // Prefix Scan
-    while (start < minLen && prevItems[start] === nextItems[start]) {
-      start++;
+    let childNodes = Array.from(childNodeList);
+    if (start < 0) {
+      for (let i = nextItems.length; i < oldLength; i++) {
+        const e = childNodes[1 + --oldLength];
+        shallowTeardown(e);
+        e.remove();
+      }
+      prevItems = nextItems;
+      nextItems = null;
+      childNodes = null;
+      return;
     }
 
-    // Optimization: Append Suffix
-    if (start === oldLength && newLength > oldLength) {
-      const newPart = nextItems.slice(start);
-      const newNodes = newPart.map(render);
-      endBookend.before(...newNodes);
-
-      rowNodes = rowNodes.concat(newNodes);
+    if (start >= newLength) {
+      while (start < oldLength) {
+        const e = childNodes[1 + --oldLength];
+        shallowTeardown(e);
+        e.remove();
+      }
       prevItems = nextItems;
+      nextItems = null;
+      childNodes = null;
       return;
     }
 
-    // Optimization: Truncate Suffix
-    if (start === newLength && oldLength > newLength) {
-      for (let i = start; i < oldLength; i++) {
-        const node = rowNodes[i];
-        shallowTeardown(node);
-        node.remove();
+    // suffix
+    for (
+      oldLength--, newLength--;
+      newLength > start &&
+      oldLength >= start &&
+      nextItems[newLength] === prevItems[oldLength];
+      oldLength--, newLength--
+    );
+
+    const nextKeys = new Set(nextItems);
+    const removalQueue = [];
+    for (let i = start; i <= oldLength; i++) {
+      if (!nextKeys.has(prevItems[i])) {
+        const ch = childNodes[i + 1];
+        shallowTeardown(ch);
+        removalQueue.push(ch);
+        childNodes[i + 1] = null;
       }
-      rowNodes.length = newLength;
+    }
+    if (removalQueue.length === prevItems.length) {
+      parent.textContent = "";
+      parent.append(startBookend, ...nextItems.map(render), endBookend);
       prevItems = nextItems;
+      nextItems = null;
+      childNodes = null;
       return;
     }
-
-    // Suffix Scan
-    let end = 0;
-    while (
-      newLength - 1 - end >= start &&
-      oldLength - 1 - end >= start &&
-      nextItems[newLength - 1 - end] === prevItems[oldLength - 1 - end]
-    ) {
-      end++;
+    for (const e of removalQueue) {
+      e.remove();
     }
-
-    // 5. Complex Diff (The Middle)
-    const oldStart = start;
-    const oldEnd = oldLength - end;
-    const newEnd = newLength - end;
-
-    // A. Build Map
-    const keyMap = new Map();
-    for (let i = oldStart; i < oldEnd; i++) {
-      const item = prevItems[i];
-      keyMap.set(item, rowNodes[i]);
+    if (oldLength - start === removalQueue.length) {
+      prevItems = nextItems;
+      nextItems = null;
+      childNodes = null;
+      return;
     }
-
-    const nextRowNodes = new Array(newLength);
-
-    // Copy Prefix
-    for (let i = 0; i < start; i++) {
-      nextRowNodes[i] = rowNodes[i];
+    let keyMap = new Map();
+    for (let i = start; i <= oldLength; i++) {
+      if (
+        childNodes[i + 1] &&
+        (!nextItems[i] ||
+          prevItems[i] !== nextItems[i])
+      ) {
+        keyMap.set(prevItems[i], {
+          el: childNodes[i + 1],
+          item: prevItems[i],
+        });
+      }
     }
-    // Copy Suffix
-    for (let i = 0; i < end; i++) {
-      nextRowNodes[newLength - 1 - i] = rowNodes[oldLength - 1 - i];
+    if (newLength === oldLength && keyMap.size > (newLength - start + 1) / 2) {
+      const lastOrdered = childNodes[start];
+      // const set = [];
+      // for (let i = start; i <= newLength; i++) {
+      //   set.push(keyMap.get(nextItems[i])?.el ?? childNodes[i + 1]);
+      // }
+      // lastOrdered.after(...set);
+      for (let i = newLength; i >= start; i--) {
+        lastOrdered.after(keyMap.get(nextItems[i])?.el ?? childNodes[i + 1]);
+      }
+      prevItems = nextItems;
+      keyMap = null;
+      nextItems = null;
+      childNodes = null;
+      return;
     }
 
-    // Determine Anchor (The first node of the suffix, or the end bookend)
-    const anchor = (end > 0) ? rowNodes[oldLength - end] : endBookend;
-
-    // B. Process Middle
-    for (let i = oldStart; i < newEnd; i++) {
-      const newItem = nextItems[i];
-
-      if (keyMap.has(newItem)) {
-        const node = keyMap.get(newItem);
-        keyMap.delete(newItem);
-        parent.insertBefore(node, anchor);
-        nextRowNodes[i] = node;
-      } else {
-        const node = render(newItem);
-        parent.insertBefore(node, anchor);
-        nextRowNodes[i] = node;
+    while (start <= newLength) {
+      const newChd = nextItems[start];
+      const oldChd = prevItems[start];
+      if (newChd === oldChd) {
+        start++;
+        continue;
+      }
+      if (oldChd === undefined) {
+        parent.insertBefore(render(newChd), endBookend);
+        start++;
+        continue;
       }
+      const mappedOld = keyMap.get(newChd);
+      if (mappedOld) {
+        const oldDom = childNodeList[start + 1];
+        const { el, item } = mappedOld;
+        if (oldDom !== el) {
+          const tmp = el.nextSibling;
+          parent.insertBefore(el, oldDom);
+          parent.insertBefore(oldDom, tmp);
+        } else if (item !== newChd) {
+          replaceWith(newChd, el, render);
+        }
+        keyMap.delete(newChd);
+      } else if (oldChd !== newChd) {
+        parent.insertBefore(render(newChd), childNodeList[start + 1]);
+      }
+      start++;
     }
-
-    // C. Cleanup Unused
-    for (const node of keyMap.values()) {
-      shallowTeardown(node);
-      node.remove();
+    for (const { el } of keyMap.values()) {
+      shallowTeardown(el);
+      el.remove();
     }
-
-    rowNodes = nextRowNodes;
+    keyMap = null;
     prevItems = nextItems;
+    nextItems = null;
+    childNodes = null;
   });
-
   return outlet;
-}
+}
+

package/tsconfig.tsbuildinfo

@@ -1 +1 @@
-{"fileNames":["./node_modules/typescript/lib/lib.es5.d.ts","./node_modules/typescript/lib/lib.es2015.d.ts","./node_modules/typescript/lib/lib.es2016.d.ts","./node_modules/typescript/lib/lib.es2017.d.ts","./node_modules/typescript/lib/lib.es2018.d.ts","./node_modules/typescript/lib/lib.es2019.d.ts","./node_modules/typescript/lib/lib.es2020.d.ts","./node_modules/typescript/lib/lib.dom.d.ts","./node_modules/typescript/lib/lib.dom.iterable.d.ts","./node_modules/typescript/lib/lib.dom.asynciterable.d.ts","./node_modules/typescript/lib/lib.webworker.importscripts.d.ts","./node_modules/typescript/lib/lib.scripthost.d.ts","./node_modules/typescript/lib/lib.es2015.core.d.ts","./node_modules/typescript/lib/lib.es2015.collection.d.ts","./node_modules/typescript/lib/lib.es2015.generator.d.ts","./node_modules/typescript/lib/lib.es2015.iterable.d.ts","./node_modules/typescript/lib/lib.es2015.promise.d.ts","./node_modules/typescript/lib/lib.es2015.proxy.d.ts","./node_modules/typescript/lib/lib.es2015.reflect.d.ts","./node_modules/typescript/lib/lib.es2015.symbol.d.ts","./node_modules/typescript/lib/lib.es2015.symbol.wellknown.d.ts","./node_modules/typescript/lib/lib.es2016.array.include.d.ts","./node_modules/typescript/lib/lib.es2016.intl.d.ts","./node_modules/typescript/lib/lib.es2017.arraybuffer.d.ts","./node_modules/typescript/lib/lib.es2017.date.d.ts","./node_modules/typescript/lib/lib.es2017.object.d.ts","./node_modules/typescript/lib/lib.es2017.sharedmemory.d.ts","./node_modules/typescript/lib/lib.es2017.string.d.ts","./node_modules/typescript/lib/lib.es2017.intl.d.ts","./node_modules/typescript/lib/lib.es2017.typedarrays.d.ts","./node_modules/typescript/lib/lib.es2018.asyncgenerator.d.ts","./node_modules/typescript/lib/lib.es2018.asynciterable.d.ts","./node_modules/typescript/lib/lib.es2018.intl.d.ts","./node_modules/typescript/lib/lib.es2018.promise.d.ts","./node_modules/typescript/lib/lib.es2018.regexp.d.ts","./node_modules/typescript/lib/lib.es2019.array.d.ts","./node_modules/typescript/lib/lib.es2019.object.d.ts","./node_modules/typescript/lib/lib.es2019.string.d.ts","./node_modules/typescript/lib/lib.es2019.symbol.d.ts","./node_modules/typescript/lib/lib.es2019.intl.d.ts","./node_modules/typescript/lib/lib.es2020.bigint.d.ts","./node_modules/typescript/lib/lib.es2020.date.d.ts","./node_modules/typescript/lib/lib.es2020.promise.d.ts","./node_modules/typescript/lib/lib.es2020.sharedmemory.d.ts","./node_modules/typescript/lib/lib.es2020.string.d.ts","./node_modules/typescript/lib/lib.es2020.symbol.wellknown.d.ts","./node_modules/typescript/lib/lib.es2020.intl.d.ts","./node_modules/typescript/lib/lib.es2020.number.d.ts","./node_modules/typescript/lib/lib.decorators.d.ts","./node_modules/typescript/lib/lib.decorators.legacy.d.ts","./node_modules/typescript/lib/lib.es2020.full.d.ts","./src/signals.ts","./src/element.ts","./src/index.ts","./src/router.ts","./node_modules/@types/deep-eql/index.d.ts","./node_modules/assertion-error/index.d.ts","./node_modules/@types/chai/index.d.ts","./node_modules/@types/estree/index.d.ts"],"fileIdsList":[[56,57],[52],[52,53],[53]],"fileInfos":[{"version":"c430d44666289dae81f30fa7b2edebf186ecc91a2d4c71266ea6ae76388792e1","affectsGlobalScope":true,"impliedFormat":1},{"version":"45b7ab580deca34ae9729e97c13cfd999df04416a79116c3bfb483804f85ded4","impliedFormat":1},{"version":"3facaf05f0c5fc569c5649dd359892c98a85557e3e0c847964caeb67076f4d75","impliedFormat":1},{"version":"e44bb8bbac7f10ecc786703fe0a6a4b952189f908707980ba8f3c8975a760962","impliedFormat":1},{"version":"5e1c4c362065a6b95ff952c0eab010f04dcd2c3494e813b493ecfd4fcb9fc0d8","impliedFormat":1},{"version":"68d73b4a11549f9c0b7d352d10e91e5dca8faa3322bfb77b661839c42b1ddec7","impliedFormat":1},{"version":"5efce4fc3c29ea84e8928f97adec086e3dc876365e0982cc8479a07954a3efd4","impliedFormat":1},{"version":"080941d9f9ff9307f7e27a83bcd888b7c8270716c39af943532438932ec1d0b9","affectsGlobalScope":true,"impliedFormat":1},{"version":"2e80ee7a49e8ac312cc11b77f1475804bee36b3b2bc896bead8b6e1266befb43","affectsGlobalScope":true,"impliedFormat":1},{"version":"d7a3c8b952931daebdfc7a2897c53c0a1c73624593fa070e46bd537e64dcd20a","affectsGlobalScope":true,"impliedFormat":1},{"version":"80e18897e5884b6723488d4f5652167e7bb5024f946743134ecc4aa4ee731f89","affectsGlobalScope":true,"impliedFormat":1},{"version":"cd034f499c6cdca722b60c04b5b1b78e058487a7085a8e0d6fb50809947ee573","affectsGlobalScope":true,"impliedFormat":1},{"version":"c57796738e7f83dbc4b8e65132f11a377649c00dd3eee333f672b8f0a6bea671","affectsGlobalScope":true,"impliedFormat":1},{"version":"dc2df20b1bcdc8c2d34af4926e2c3ab15ffe1160a63e58b7e09833f616efff44","affectsGlobalScope":true,"impliedFormat":1},{"version":"515d0b7b9bea2e31ea4ec968e9edd2c39d3eebf4a2d5cbd04e88639819ae3b71","affectsGlobalScope":true,"impliedFormat":1},{"version":"0559b1f683ac7505ae451f9a96ce4c3c92bdc71411651ca6ddb0e88baaaad6a3","affectsGlobalScope":true,"impliedFormat":1},{"version":"0dc1e7ceda9b8b9b455c3a2d67b0412feab00bd2f66656cd8850e8831b08b537","affectsGlobalScope":true,"impliedFormat":1},{"version":"ce691fb9e5c64efb9547083e4a34091bcbe5bdb41027e310ebba8f7d96a98671","affectsGlobalScope":true,"impliedFormat":1},{"version":"8d697a2a929a5fcb38b7a65594020fcef05ec1630804a33748829c5ff53640d0","affectsGlobalScope":true,"impliedFormat":1},{"version":"4ff2a353abf8a80ee399af572debb8faab2d33ad38c4b4474cff7f26e7653b8d","affectsGlobalScope":true,"impliedFormat":1},{"version":"fb0f136d372979348d59b3f5020b4cdb81b5504192b1cacff5d1fbba29378aa1","affectsGlobalScope":true,"impliedFormat":1},{"version":"d15bea3d62cbbdb9797079416b8ac375ae99162a7fba5de2c6c505446486ac0a","affectsGlobalScope":true,"impliedFormat":1},{"version":"68d18b664c9d32a7336a70235958b8997ebc1c3b8505f4f1ae2b7e7753b87618","affectsGlobalScope":true,"impliedFormat":1},{"version":"eb3d66c8327153d8fa7dd03f9c58d351107fe824c79e9b56b462935176cdf12a","affectsGlobalScope":true,"impliedFormat":1},{"version":"38f0219c9e23c915ef9790ab1d680440d95419ad264816fa15009a8851e79119","affectsGlobalScope":true,"impliedFormat":1},{"version":"69ab18c3b76cd9b1be3d188eaf8bba06112ebbe2f47f6c322b5105a6fbc45a2e","affectsGlobalScope":true,"impliedFormat":1},{"version":"a680117f487a4d2f30ea46f1b4b7f58bef1480456e18ba53ee85c2746eeca012","affectsGlobalScope":true,"impliedFormat":1},{"version":"2f11ff796926e0832f9ae148008138ad583bd181899ab7dd768a2666700b1893","affectsGlobalScope":true,"impliedFormat":1},{"version":"4de680d5bb41c17f7f68e0419412ca23c98d5749dcaaea1896172f06435891fc","affectsGlobalScope":true,"impliedFormat":1},{"version":"954296b30da6d508a104a3a0b5d96b76495c709785c1d11610908e63481ee667","affectsGlobalScope":true,"impliedFormat":1},{"version":"ac9538681b19688c8eae65811b329d3744af679e0bdfa5d842d0e32524c73e1c","affectsGlobalScope":true,"impliedFormat":1},{"version":"0a969edff4bd52585473d24995c5ef223f6652d6ef46193309b3921d65dd4376","affectsGlobalScope":true,"impliedFormat":1},{"version":"9e9fbd7030c440b33d021da145d3232984c8bb7916f277e8ffd3dc2e3eae2bdb","affectsGlobalScope":true,"impliedFormat":1},{"version":"811ec78f7fefcabbda4bfa93b3eb67d9ae166ef95f9bff989d964061cbf81a0c","affectsGlobalScope":true,"impliedFormat":1},{"version":"717937616a17072082152a2ef351cb51f98802fb4b2fdabd32399843875974ca","affectsGlobalScope":true,"impliedFormat":1},{"version":"d7e7d9b7b50e5f22c915b525acc5a49a7a6584cf8f62d0569e557c5cfc4b2ac2","affectsGlobalScope":true,"impliedFormat":1},{"version":"71c37f4c9543f31dfced6c7840e068c5a5aacb7b89111a4364b1d5276b852557","affectsGlobalScope":true,"impliedFormat":1},{"version":"576711e016cf4f1804676043e6a0a5414252560eb57de9faceee34d79798c850","affectsGlobalScope":true,"impliedFormat":1},{"version":"89c1b1281ba7b8a96efc676b11b264de7a8374c5ea1e6617f11880a13fc56dc6","affectsGlobalScope":true,"impliedFormat":1},{"version":"74f7fa2d027d5b33eb0471c8e82a6c87216223181ec31247c357a3e8e2fddc5b","affectsGlobalScope":true,"impliedFormat":1},{"version":"d6d7ae4d1f1f3772e2a3cde568ed08991a8ae34a080ff1151af28b7f798e22ca","affectsGlobalScope":true,"impliedFormat":1},{"version":"063600664504610fe3e99b717a1223f8b1900087fab0b4cad1496a114744f8df","affectsGlobalScope":true,"impliedFormat":1},{"version":"934019d7e3c81950f9a8426d093458b65d5aff2c7c1511233c0fd5b941e608ab","affectsGlobalScope":true,"impliedFormat":1},{"version":"52ada8e0b6e0482b728070b7639ee42e83a9b1c22d205992756fe020fd9f4a47","affectsGlobalScope":true,"impliedFormat":1},{"version":"3bdefe1bfd4d6dee0e26f928f93ccc128f1b64d5d501ff4a8cf3c6371200e5e6","affectsGlobalScope":true,"impliedFormat":1},{"version":"59fb2c069260b4ba00b5643b907ef5d5341b167e7d1dbf58dfd895658bda2867","affectsGlobalScope":true,"impliedFormat":1},{"version":"639e512c0dfc3fad96a84caad71b8834d66329a1f28dc95e3946c9b58176c73a","affectsGlobalScope":true,"impliedFormat":1},{"version":"368af93f74c9c932edd84c58883e736c9e3d53cec1fe24c0b0ff451f529ceab1","affectsGlobalScope":true,"impliedFormat":1},{"version":"8e7f8264d0fb4c5339605a15daadb037bf238c10b654bb3eee14208f860a32ea","affectsGlobalScope":true,"impliedFormat":1},{"version":"782dec38049b92d4e85c1585fbea5474a219c6984a35b004963b00beb1aab538","affectsGlobalScope":true,"impliedFormat":1},{"version":"1305d1e76ca44e30fb8b2b8075fa522b83f60c0bcf5d4326a9d2cf79b53724f8","impliedFormat":1},{"version":"2834d3d5f4c0526c760679f15c35791e91f4e51d54d24d00610e35b7ce7a9e01","signature":"a53dff95094f1f7fee261ff1879f5909cd440f02aa68ff6893d017b2343181d1"},{"version":"b33d036c5c7a309dcef7c008214bd6dc62bb9379987f5b3f7f3d407e38739836","signature":"4e15936f04a7ab7370e9a897f6d9befa980662283d92660ba0b5cacfab78e5d1"},{"version":"ac16f8022e1d86594d058f84a530164af4b03dcc8bb45ac4a00736fe8aab62e7","signature":"1e325d171d22aa3144736ace94df4b5bf779c6083bc0f9ce684855844f8abcbc"},{"version":"a155e9ebe821846c43103394346639a6a19a7f844be4892bbe4352aa20ee6707","signature":"166554555b2dc6392155b045bb33ce964f7d5f092f50fada34eb4d5828d7740e"},{"version":"427fe2004642504828c1476d0af4270e6ad4db6de78c0b5da3e4c5ca95052a99","impliedFormat":1},{"version":"2eeffcee5c1661ddca53353929558037b8cf305ffb86a803512982f99bcab50d","impliedFormat":99},{"version":"9afb4cb864d297e4092a79ee2871b5d3143ea14153f62ef0bb04ede25f432030","affectsGlobalScope":true,"impliedFormat":99},{"version":"151ff381ef9ff8da2da9b9663ebf657eac35c4c9a19183420c05728f31a6761d","impliedFormat":1}],"root":[[52,55]],"options":{"allowJs":true,"checkJs":false,"composite":true,"esModuleInterop":true,"module":99,"outDir":"./dist","rootDir":"./src","skipLibCheck":true,"target":7},"referencedMap":[[58,1],[53,2],[54,3],[55,3],[52,4]],"latestChangedDtsFile":"./dist/element.d.ts","version":"5.9.3"}
+{"fileNames":["./node_modules/typescript/lib/lib.es5.d.ts","./node_modules/typescript/lib/lib.es2015.d.ts","./node_modules/typescript/lib/lib.es2016.d.ts","./node_modules/typescript/lib/lib.es2017.d.ts","./node_modules/typescript/lib/lib.es2018.d.ts","./node_modules/typescript/lib/lib.es2019.d.ts","./node_modules/typescript/lib/lib.es2020.d.ts","./node_modules/typescript/lib/lib.dom.d.ts","./node_modules/typescript/lib/lib.dom.iterable.d.ts","./node_modules/typescript/lib/lib.dom.asynciterable.d.ts","./node_modules/typescript/lib/lib.webworker.importscripts.d.ts","./node_modules/typescript/lib/lib.scripthost.d.ts","./node_modules/typescript/lib/lib.es2015.core.d.ts","./node_modules/typescript/lib/lib.es2015.collection.d.ts","./node_modules/typescript/lib/lib.es2015.generator.d.ts","./node_modules/typescript/lib/lib.es2015.iterable.d.ts","./node_modules/typescript/lib/lib.es2015.promise.d.ts","./node_modules/typescript/lib/lib.es2015.proxy.d.ts","./node_modules/typescript/lib/lib.es2015.reflect.d.ts","./node_modules/typescript/lib/lib.es2015.symbol.d.ts","./node_modules/typescript/lib/lib.es2015.symbol.wellknown.d.ts","./node_modules/typescript/lib/lib.es2016.array.include.d.ts","./node_modules/typescript/lib/lib.es2016.intl.d.ts","./node_modules/typescript/lib/lib.es2017.arraybuffer.d.ts","./node_modules/typescript/lib/lib.es2017.date.d.ts","./node_modules/typescript/lib/lib.es2017.object.d.ts","./node_modules/typescript/lib/lib.es2017.sharedmemory.d.ts","./node_modules/typescript/lib/lib.es2017.string.d.ts","./node_modules/typescript/lib/lib.es2017.intl.d.ts","./node_modules/typescript/lib/lib.es2017.typedarrays.d.ts","./node_modules/typescript/lib/lib.es2018.asyncgenerator.d.ts","./node_modules/typescript/lib/lib.es2018.asynciterable.d.ts","./node_modules/typescript/lib/lib.es2018.intl.d.ts","./node_modules/typescript/lib/lib.es2018.promise.d.ts","./node_modules/typescript/lib/lib.es2018.regexp.d.ts","./node_modules/typescript/lib/lib.es2019.array.d.ts","./node_modules/typescript/lib/lib.es2019.object.d.ts","./node_modules/typescript/lib/lib.es2019.string.d.ts","./node_modules/typescript/lib/lib.es2019.symbol.d.ts","./node_modules/typescript/lib/lib.es2019.intl.d.ts","./node_modules/typescript/lib/lib.es2020.bigint.d.ts","./node_modules/typescript/lib/lib.es2020.date.d.ts","./node_modules/typescript/lib/lib.es2020.promise.d.ts","./node_modules/typescript/lib/lib.es2020.sharedmemory.d.ts","./node_modules/typescript/lib/lib.es2020.string.d.ts","./node_modules/typescript/lib/lib.es2020.symbol.wellknown.d.ts","./node_modules/typescript/lib/lib.es2020.intl.d.ts","./node_modules/typescript/lib/lib.es2020.number.d.ts","./node_modules/typescript/lib/lib.decorators.d.ts","./node_modules/typescript/lib/lib.decorators.legacy.d.ts","./node_modules/typescript/lib/lib.es2020.full.d.ts","./src/signals.ts","./src/element.ts","./src/index.ts","./src/router.ts","./node_modules/@types/deep-eql/index.d.ts","./node_modules/assertion-error/index.d.ts","./node_modules/@types/chai/index.d.ts","./node_modules/@types/estree/index.d.ts"],"fileIdsList":[[56,57],[52],[52,53],[53]],"fileInfos":[{"version":"c430d44666289dae81f30fa7b2edebf186ecc91a2d4c71266ea6ae76388792e1","affectsGlobalScope":true,"impliedFormat":1},{"version":"45b7ab580deca34ae9729e97c13cfd999df04416a79116c3bfb483804f85ded4","impliedFormat":1},{"version":"3facaf05f0c5fc569c5649dd359892c98a85557e3e0c847964caeb67076f4d75","impliedFormat":1},{"version":"e44bb8bbac7f10ecc786703fe0a6a4b952189f908707980ba8f3c8975a760962","impliedFormat":1},{"version":"5e1c4c362065a6b95ff952c0eab010f04dcd2c3494e813b493ecfd4fcb9fc0d8","impliedFormat":1},{"version":"68d73b4a11549f9c0b7d352d10e91e5dca8faa3322bfb77b661839c42b1ddec7","impliedFormat":1},{"version":"5efce4fc3c29ea84e8928f97adec086e3dc876365e0982cc8479a07954a3efd4","impliedFormat":1},{"version":"080941d9f9ff9307f7e27a83bcd888b7c8270716c39af943532438932ec1d0b9","affectsGlobalScope":true,"impliedFormat":1},{"version":"2e80ee7a49e8ac312cc11b77f1475804bee36b3b2bc896bead8b6e1266befb43","affectsGlobalScope":true,"impliedFormat":1},{"version":"d7a3c8b952931daebdfc7a2897c53c0a1c73624593fa070e46bd537e64dcd20a","affectsGlobalScope":true,"impliedFormat":1},{"version":"80e18897e5884b6723488d4f5652167e7bb5024f946743134ecc4aa4ee731f89","affectsGlobalScope":true,"impliedFormat":1},{"version":"cd034f499c6cdca722b60c04b5b1b78e058487a7085a8e0d6fb50809947ee573","affectsGlobalScope":true,"impliedFormat":1},{"version":"c57796738e7f83dbc4b8e65132f11a377649c00dd3eee333f672b8f0a6bea671","affectsGlobalScope":true,"impliedFormat":1},{"version":"dc2df20b1bcdc8c2d34af4926e2c3ab15ffe1160a63e58b7e09833f616efff44","affectsGlobalScope":true,"impliedFormat":1},{"version":"515d0b7b9bea2e31ea4ec968e9edd2c39d3eebf4a2d5cbd04e88639819ae3b71","affectsGlobalScope":true,"impliedFormat":1},{"version":"0559b1f683ac7505ae451f9a96ce4c3c92bdc71411651ca6ddb0e88baaaad6a3","affectsGlobalScope":true,"impliedFormat":1},{"version":"0dc1e7ceda9b8b9b455c3a2d67b0412feab00bd2f66656cd8850e8831b08b537","affectsGlobalScope":true,"impliedFormat":1},{"version":"ce691fb9e5c64efb9547083e4a34091bcbe5bdb41027e310ebba8f7d96a98671","affectsGlobalScope":true,"impliedFormat":1},{"version":"8d697a2a929a5fcb38b7a65594020fcef05ec1630804a33748829c5ff53640d0","affectsGlobalScope":true,"impliedFormat":1},{"version":"4ff2a353abf8a80ee399af572debb8faab2d33ad38c4b4474cff7f26e7653b8d","affectsGlobalScope":true,"impliedFormat":1},{"version":"fb0f136d372979348d59b3f5020b4cdb81b5504192b1cacff5d1fbba29378aa1","affectsGlobalScope":true,"impliedFormat":1},{"version":"d15bea3d62cbbdb9797079416b8ac375ae99162a7fba5de2c6c505446486ac0a","affectsGlobalScope":true,"impliedFormat":1},{"version":"68d18b664c9d32a7336a70235958b8997ebc1c3b8505f4f1ae2b7e7753b87618","affectsGlobalScope":true,"impliedFormat":1},{"version":"eb3d66c8327153d8fa7dd03f9c58d351107fe824c79e9b56b462935176cdf12a","affectsGlobalScope":true,"impliedFormat":1},{"version":"38f0219c9e23c915ef9790ab1d680440d95419ad264816fa15009a8851e79119","affectsGlobalScope":true,"impliedFormat":1},{"version":"69ab18c3b76cd9b1be3d188eaf8bba06112ebbe2f47f6c322b5105a6fbc45a2e","affectsGlobalScope":true,"impliedFormat":1},{"version":"a680117f487a4d2f30ea46f1b4b7f58bef1480456e18ba53ee85c2746eeca012","affectsGlobalScope":true,"impliedFormat":1},{"version":"2f11ff796926e0832f9ae148008138ad583bd181899ab7dd768a2666700b1893","affectsGlobalScope":true,"impliedFormat":1},{"version":"4de680d5bb41c17f7f68e0419412ca23c98d5749dcaaea1896172f06435891fc","affectsGlobalScope":true,"impliedFormat":1},{"version":"954296b30da6d508a104a3a0b5d96b76495c709785c1d11610908e63481ee667","affectsGlobalScope":true,"impliedFormat":1},{"version":"ac9538681b19688c8eae65811b329d3744af679e0bdfa5d842d0e32524c73e1c","affectsGlobalScope":true,"impliedFormat":1},{"version":"0a969edff4bd52585473d24995c5ef223f6652d6ef46193309b3921d65dd4376","affectsGlobalScope":true,"impliedFormat":1},{"version":"9e9fbd7030c440b33d021da145d3232984c8bb7916f277e8ffd3dc2e3eae2bdb","affectsGlobalScope":true,"impliedFormat":1},{"version":"811ec78f7fefcabbda4bfa93b3eb67d9ae166ef95f9bff989d964061cbf81a0c","affectsGlobalScope":true,"impliedFormat":1},{"version":"717937616a17072082152a2ef351cb51f98802fb4b2fdabd32399843875974ca","affectsGlobalScope":true,"impliedFormat":1},{"version":"d7e7d9b7b50e5f22c915b525acc5a49a7a6584cf8f62d0569e557c5cfc4b2ac2","affectsGlobalScope":true,"impliedFormat":1},{"version":"71c37f4c9543f31dfced6c7840e068c5a5aacb7b89111a4364b1d5276b852557","affectsGlobalScope":true,"impliedFormat":1},{"version":"576711e016cf4f1804676043e6a0a5414252560eb57de9faceee34d79798c850","affectsGlobalScope":true,"impliedFormat":1},{"version":"89c1b1281ba7b8a96efc676b11b264de7a8374c5ea1e6617f11880a13fc56dc6","affectsGlobalScope":true,"impliedFormat":1},{"version":"74f7fa2d027d5b33eb0471c8e82a6c87216223181ec31247c357a3e8e2fddc5b","affectsGlobalScope":true,"impliedFormat":1},{"version":"d6d7ae4d1f1f3772e2a3cde568ed08991a8ae34a080ff1151af28b7f798e22ca","affectsGlobalScope":true,"impliedFormat":1},{"version":"063600664504610fe3e99b717a1223f8b1900087fab0b4cad1496a114744f8df","affectsGlobalScope":true,"impliedFormat":1},{"version":"934019d7e3c81950f9a8426d093458b65d5aff2c7c1511233c0fd5b941e608ab","affectsGlobalScope":true,"impliedFormat":1},{"version":"52ada8e0b6e0482b728070b7639ee42e83a9b1c22d205992756fe020fd9f4a47","affectsGlobalScope":true,"impliedFormat":1},{"version":"3bdefe1bfd4d6dee0e26f928f93ccc128f1b64d5d501ff4a8cf3c6371200e5e6","affectsGlobalScope":true,"impliedFormat":1},{"version":"59fb2c069260b4ba00b5643b907ef5d5341b167e7d1dbf58dfd895658bda2867","affectsGlobalScope":true,"impliedFormat":1},{"version":"639e512c0dfc3fad96a84caad71b8834d66329a1f28dc95e3946c9b58176c73a","affectsGlobalScope":true,"impliedFormat":1},{"version":"368af93f74c9c932edd84c58883e736c9e3d53cec1fe24c0b0ff451f529ceab1","affectsGlobalScope":true,"impliedFormat":1},{"version":"8e7f8264d0fb4c5339605a15daadb037bf238c10b654bb3eee14208f860a32ea","affectsGlobalScope":true,"impliedFormat":1},{"version":"782dec38049b92d4e85c1585fbea5474a219c6984a35b004963b00beb1aab538","affectsGlobalScope":true,"impliedFormat":1},{"version":"1305d1e76ca44e30fb8b2b8075fa522b83f60c0bcf5d4326a9d2cf79b53724f8","impliedFormat":1},{"version":"2834d3d5f4c0526c760679f15c35791e91f4e51d54d24d00610e35b7ce7a9e01","signature":"a53dff95094f1f7fee261ff1879f5909cd440f02aa68ff6893d017b2343181d1"},{"version":"8b93b0656412692139068362a59281bf5ee64e327a6ba8a9f0ef21cd1f5e7c49","signature":"4e15936f04a7ab7370e9a897f6d9befa980662283d92660ba0b5cacfab78e5d1"},{"version":"ac16f8022e1d86594d058f84a530164af4b03dcc8bb45ac4a00736fe8aab62e7","signature":"1e325d171d22aa3144736ace94df4b5bf779c6083bc0f9ce684855844f8abcbc"},{"version":"a155e9ebe821846c43103394346639a6a19a7f844be4892bbe4352aa20ee6707","signature":"166554555b2dc6392155b045bb33ce964f7d5f092f50fada34eb4d5828d7740e"},{"version":"427fe2004642504828c1476d0af4270e6ad4db6de78c0b5da3e4c5ca95052a99","impliedFormat":1},{"version":"2eeffcee5c1661ddca53353929558037b8cf305ffb86a803512982f99bcab50d","impliedFormat":99},{"version":"9afb4cb864d297e4092a79ee2871b5d3143ea14153f62ef0bb04ede25f432030","affectsGlobalScope":true,"impliedFormat":99},{"version":"151ff381ef9ff8da2da9b9663ebf657eac35c4c9a19183420c05728f31a6761d","impliedFormat":1}],"root":[[52,55]],"options":{"allowJs":true,"checkJs":false,"composite":true,"esModuleInterop":true,"module":99,"outDir":"./dist","rootDir":"./src","skipLibCheck":true,"target":7},"referencedMap":[[58,1],[53,2],[54,3],[55,3],[52,4]],"latestChangedDtsFile":"./dist/element.d.ts","version":"5.9.3"}