@thyn/core 0.0.308 → 0.0.311

package/dist/element.js

@@ -399,161 +399,6 @@ export function list(props, terminal = false) {
     });
     return outlet;
 }
-// export function isolatedTerminalList(props) {
-//   let parent;
-//   let outlet = document.createDocumentFragment();
-//   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;
-//     if (!parent) {
-//       prevItems = props.items();
-//       outlet.append(startBookend, ...prevItems.map(render), endBookend);
-//       return;
-//     }
-//     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;
-//     }
-//     let start = nextItems.findIndex((item, index) => prevItems[index] !== item);
-//     if (start === oldLength) {
-//       endBookend.before(...nextItems.slice(start).map(render));
-//       prevItems = nextItems;
-//       nextItems = null;
-//       return;
-//     }
-//     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;
-//       }
-//     }
-//     if (removalQueue.length === prevItems.length) {
-//       parent.textContent = "";
-//       parent.append(startBookend, ...nextItems.map(render), endBookend);
-//       prevItems = nextItems;
-//       nextItems = null;
-//       childNodes = null;
-//       return;
-//     }
-//     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],
-//         });
-//       }
-//     }
-//     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++;
-//     }
-//     for (const { el } of keyMap.values()) {
-//       shallowTeardown(el);
-//       el.remove();
-//     }
-//     keyMap = null;
-//     prevItems = nextItems;
-//     nextItems = null;
-//     childNodes = null;
-//   });
-//   return outlet;
-// }
 export function isolatedTerminalList(props) {
     let parent;
     let outlet = document.createDocumentFragment();
@@ -573,7 +418,6 @@ export function isolatedTerminalList(props) {
         let nextItems = props.items();
         let newLength = nextItems.length;
         let oldLength = prevItems.length;
-        // Fast path: Empty to something
         if (!oldLength && newLength) {
             endBookend.before(...nextItems.map(render));
             prevItems = nextItems;
@@ -581,7 +425,6 @@ export function isolatedTerminalList(props) {
             return;
         }
         const childNodeList = parent.childNodes;
-        // Fast path: Something to empty
         if (!newLength) {
             let node = startBookend.nextSibling;
             while (node !== endBookend) {
@@ -594,96 +437,118 @@ export function isolatedTerminalList(props) {
             nextItems = null;
             return;
         }
-        // 1. Prefix Optimization
-        let start = 0;
-        // Compare items until they mismatch or we reach the end
-        while (start < newLength && start < oldLength && 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;
         }
-        // 2. Suffix Optimization
-        // Scan backwards from the end
-        while (newLength > start && oldLength > start && nextItems[newLength - 1] === prevItems[oldLength - 1]) {
-            oldLength--;
-            newLength--;
-        }
-        // Fast path: Simple Deletion (Prefix/Suffix matched, just remove middle)
-        if (start === newLength) {
-            // We need to remove from start to oldLength
-            // We can get the node at 'start' and walk forward
-            let node = childNodeList[start + 1];
-            for (let i = start; i < oldLength; i++) {
-                let next = node.nextSibling;
-                shallowTeardown(node);
-                node.remove();
-                node = next;
+        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;
         }
-        const keyMap = new Map();
-        let node = childNodeList[start + 1];
-        let cursor = node;
-        for (let i = start; i < oldLength; i++) {
-            keyMap.set(prevItems[i], node);
-            node = node.nextSibling;
-        }
-        // Replace all fast path
-        if (start === 0 && !keyMap.has(nextItems[0])) {
-            for (const oldNode of keyMap.values()) {
-                shallowTeardown(oldNode);
+        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;
             }
+        }
+        if (removalQueue.length === prevItems.length) {
             parent.textContent = "";
             parent.append(startBookend, ...nextItems.map(render), endBookend);
             prevItems = nextItems;
             nextItems = null;
+            childNodes = null;
             return;
         }
-        // Iterate through the NEW list
-        for (let i = start; i < newLength; i++) {
-            const newItem = nextItems[i];
-            const oldNode = keyMap.get(newItem);
-            if (oldNode) {
-                // MATCH: We found the item in the old list.
-                // Remove it from the map so we know it has been "claimed".
-                keyMap.delete(newItem);
-                if (oldNode === cursor) {
-                    // It's already in the right spot. Just advance the cursor.
-                    cursor = cursor.nextSibling;
+        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],
+                });
+            }
+        }
+        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 {
-                    const swapTarget = oldNode.nextSibling;
-                    // 2. Move old node to current spot (Standard)
-                    parent.insertBefore(oldNode, cursor);
-                    // 3. Move the cursor node to the empty spot (Swap)
-                    parent.insertBefore(cursor, swapTarget);
-                    // 4. Update the loop cursor
-                    // Since we swapped, the node sitting at the NEXT index is likely 
-                    // the one that was originally after 'cursor'.
-                    cursor = oldNode.nextSibling;
+                else if (item !== newChd) {
+                    replaceWith(newChd, el, render);
                 }
+                keyMap.delete(newChd);
             }
-            else {
-                // MISS: This is a brand new item.
-                const newNode = render(newItem);
-                parent.insertBefore(newNode, cursor);
-                // Similarly, do not advance cursor (it gets pushed to the right).
+            else if (oldChd !== newChd) {
+                parent.insertBefore(render(newChd), childNodeList[start + 1]);
             }
+            start++;
         }
-        // 4. Cleanup
-        // Any nodes remaining in the map were not present in the new list.
-        for (const unusedNode of keyMap.values()) {
-            shallowTeardown(unusedNode);
-            unusedNode.remove();
+        for (const { el } of keyMap.values()) {
+            shallowTeardown(el);
+            el.remove();
         }
+        keyMap = null;
         prevItems = nextItems;
         nextItems = null;
+        childNodes = null;
     });
     return outlet;
 }

package/package.json

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

package/src/element.ts

@@ -424,168 +424,6 @@ export function list(props, terminal = false) {
   return outlet;
 }
 
-// export function isolatedTerminalList(props) {
-//   let parent;
-//   let outlet = document.createDocumentFragment();
-//   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;
-//     if (!parent) {
-//       prevItems = props.items();
-//       outlet.append(startBookend, ...prevItems.map(render), endBookend);
-//       return;
-//     }
-//     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;
-//     }
-
-//     let start = nextItems.findIndex((item, index) => prevItems[index] !== item);
-//     if (start === oldLength) {
-//       endBookend.before(...nextItems.slice(start).map(render));
-//       prevItems = nextItems;
-//       nextItems = null;
-//       return;
-//     }
-
-//     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;
-//       }
-//     }
-//     if (removalQueue.length === prevItems.length) {
-//       parent.textContent = "";
-//       parent.append(startBookend, ...nextItems.map(render), endBookend);
-//       prevItems = nextItems;
-//       nextItems = null;
-//       childNodes = null;
-//       return;
-//     }
-//     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],
-//         });
-//       }
-//     }
-//     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++;
-//     }
-//     for (const { el } of keyMap.values()) {
-//       shallowTeardown(el);
-//       el.remove();
-//     }
-//     keyMap = null;
-//     prevItems = nextItems;
-//     nextItems = null;
-//     childNodes = null;
-//   });
-//   return outlet;
-// }
-
 export function isolatedTerminalList(props) {
   let parent;
   let outlet = document.createDocumentFragment();
@@ -603,24 +441,18 @@ export function isolatedTerminalList(props) {
       outlet.append(startBookend, ...prevItems.map(render), endBookend);
       return;
     }
-
     let nextItems = props.items();
     let newLength = nextItems.length;
     let oldLength = prevItems.length;
-
-    // Fast path: Empty to something
     if (!oldLength && newLength) {
-      endBookend.before(...nextItems.map(render));
+      endBookend.before(...nextItems.map(render))
       prevItems = nextItems;
       nextItems = null;
       return;
     }
-
-    const childNodeList = parent.childNodes;
-
-    // Fast path: Something to empty
+    const childNodeList = parent.childNodes as NodeListOf<ChildNode>;
     if (!newLength) {
-      let node = startBookend.nextSibling;
+      let node = startBookend.nextSibling
       while (node !== endBookend) {
         shallowTeardown(node);
         node = node.nextSibling;
@@ -632,13 +464,7 @@ export function isolatedTerminalList(props) {
       return;
     }
 
-    // 1. Prefix Optimization
-    let start = 0;
-    // Compare items until they mismatch or we reach the end
-    while (start < newLength && start < oldLength && 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;
@@ -646,94 +472,117 @@ export function isolatedTerminalList(props) {
       return;
     }
 
-    // 2. Suffix Optimization
-    // Scan backwards from the end
-    while (newLength > start && oldLength > start && nextItems[newLength - 1] === prevItems[oldLength - 1]) {
-      oldLength--;
-      newLength--;
+    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;
     }
 
-    // Fast path: Simple Deletion (Prefix/Suffix matched, just remove middle)
-    if (start === newLength) {
-      // We need to remove from start to oldLength
-      // We can get the node at 'start' and walk forward
-      let node = childNodeList[start + 1];
-      for (let i = start; i < oldLength; i++) {
-        let next = node.nextSibling;
-        shallowTeardown(node);
-        node.remove();
-        node = next;
+    if (start >= newLength) {
+      while (start < oldLength) {
+        const e = childNodes[1 + --oldLength];
+        shallowTeardown(e);
+        e.remove();
       }
       prevItems = nextItems;
       nextItems = null;
+      childNodes = null;
       return;
     }
 
-    const keyMap = new Map();
-    let node = childNodeList[start + 1];
-    let cursor = node;
-    for (let i = start; i < oldLength; i++) {
-      keyMap.set(prevItems[i], node);
-      node = node.nextSibling;
-    }
+    // suffix
+    for (
+      oldLength--, newLength--;
+      newLength > start &&
+      oldLength >= start &&
+      nextItems[newLength] === prevItems[oldLength];
+      oldLength--, newLength--
+    );
 
-    // Replace all fast path
-    if (start === 0 && !keyMap.has(nextItems[0])) {
-      for (const oldNode of keyMap.values()) {
-        shallowTeardown(oldNode);
+    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;
       }
+    }
+    if (removalQueue.length === prevItems.length) {
       parent.textContent = "";
       parent.append(startBookend, ...nextItems.map(render), endBookend);
       prevItems = nextItems;
       nextItems = null;
+      childNodes = null;
       return;
     }
-
-    // Iterate through the NEW list
-    for (let i = start; i < newLength; i++) {
-      const newItem = nextItems[i];
-      const oldNode = keyMap.get(newItem);
-
-      if (oldNode) {
-        // MATCH: We found the item in the old list.
-        // Remove it from the map so we know it has been "claimed".
-        keyMap.delete(newItem);
-
-        if (oldNode === cursor) {
-          // It's already in the right spot. Just advance the cursor.
-          cursor = cursor.nextSibling;
-        } else {
-          const swapTarget = oldNode.nextSibling;
-
-          // 2. Move old node to current spot (Standard)
-          parent.insertBefore(oldNode, cursor);
-
-          // 3. Move the cursor node to the empty spot (Swap)
-          parent.insertBefore(cursor, swapTarget);
-
-          // 4. Update the loop cursor
-          // Since we swapped, the node sitting at the NEXT index is likely 
-          // the one that was originally after 'cursor'.
-          cursor = oldNode.nextSibling;
+    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],
+        });
+      }
+    }
+    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);
         }
-      } else {
-        // MISS: This is a brand new item.
-        const newNode = render(newItem);
-        parent.insertBefore(newNode, cursor);
-        // Similarly, do not advance cursor (it gets pushed to the right).
+        keyMap.delete(newChd);
+      } else if (oldChd !== newChd) {
+        parent.insertBefore(render(newChd), childNodeList[start + 1]);
       }
+      start++;
     }
-
-    // 4. Cleanup
-    // Any nodes remaining in the map were not present in the new list.
-    for (const unusedNode of keyMap.values()) {
-      shallowTeardown(unusedNode);
-      unusedNode.remove();
+    for (const { el } of keyMap.values()) {
+      shallowTeardown(el);
+      el.remove();
     }
-
+    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":"dc532534392e056678750d71483fbdf98e1f46687d3aa818505e3eb743dbbe15","signature":"c084f39693d652cdebc33667d280f50dece748c2ed4b408e06615834e51a5097"},{"version":"f247391aa07ef6522cfcb4551bfb98f7e5d86af51860b3258fe61c7216579fe4","signature":"f3ddd3670c33381859688f604378a0028cafa5b52cc936da9a225933eb464387"},{"version":"0e3be4d02e120fbbfd12edcc9ad69ff668f5f4303e2b9c80521a8a722428e97d","signature":"12fd8be483df752ac04ae85347f9c397954ac2390e0de50612bf8b9899d7767d"},{"version":"23e3a2d8ef7695586b582f6366a28b1404801ada9a0c82d895f19344f8100ea5","signature":"a32c52a25b47067dac589266e7667623ea1ef2b0c1f9c4fd41adbc7b67a59eee"},{"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/router.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":"dc532534392e056678750d71483fbdf98e1f46687d3aa818505e3eb743dbbe15","signature":"c084f39693d652cdebc33667d280f50dece748c2ed4b408e06615834e51a5097"},{"version":"9d501c790355584f293b5f7a0149fec0c4093389d697f98b04ffc1fc4b335680","signature":"f3ddd3670c33381859688f604378a0028cafa5b52cc936da9a225933eb464387"},{"version":"0e3be4d02e120fbbfd12edcc9ad69ff668f5f4303e2b9c80521a8a722428e97d","signature":"12fd8be483df752ac04ae85347f9c397954ac2390e0de50612bf8b9899d7767d"},{"version":"23e3a2d8ef7695586b582f6366a28b1404801ada9a0c82d895f19344f8100ea5","signature":"a32c52a25b47067dac589266e7667623ea1ef2b0c1f9c4fd41adbc7b67a59eee"},{"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/router.d.ts","version":"5.9.3"}