Run results for: stage1 collect varients v3

Test name	Executions per second
✓ collect2	4,641,848 Ops/sec
collect	1,866,832 Ops/sec
Script Preparation code:
var Z=()=>{},_=()=>document.createDocumentFragment(),$=(j)=>document.createTextNode(j),Q=(j)=>document.createElement(j),z=(j)=>j.cloneNode(!0),F=(j,q)=>q.appendChild(j),R=(j,q)=>q.insertBefore(j,q.firstChild),U=(j,q)=>q.parentNode.insertBefore(j,q.nextSibling),W=(j,q)=>(q.parentNode.replaceChild(j,q),j),C=(j,q)=>{new MutationObserver((A,B)=>{for(let I of A)for(let G of I.removedNodes)if(G.contains(j)){q(),B.disconnect();return}}).observe(document,{childList:!0,subtree:!0})};var P=Q("template"),Y=document.createTreeWalker(P),M=(j)=>{return P.innerHTML=j,P.content.firstChild},T=(j,q,A)=>{let B=Y,I={},G=q.length,J=0,H;B.currentNode=j;for(;J<G;J++){H=A[J];while(H--)B.nextNode();I[q[J]]=B.currentNode}return I},N=(j,q,A)=>{let B={},I=q.length,G=0,J,H=j,L;for(;G<I;G++){J=A[G];while(J--){L=H,H=H.firstChild||H.nextSibling;while(!H)L=L.parentNode,H=L.nextSibling}B[q[G]]=H}return B};var V={},X=(j)=>{let q="__"+j.type,A=j.target;while(A){if(A[q])return A[q](j);A=A.parentNode}},E=(j)=>{V[j]??=(document.addEventListener(j,X),!0)},S=(j)=>{V[j]=null,document.removeEventListener(j,X)};var w=(j)=>{let q={};return new Proxy({...j,on(A,B){return(q[A]??=[]).push(B),()=>{q[A]?.splice(q[A].indexOf(B)>>>0,1)}}},{set(A,B,I){return q[B]?.forEach((G)=>G(I,A[B])),A[B]=I,!0}})};
var h = M;
var collect = T; // original
var collect2 = N; // custom
var view=h('<div class=d1><span></span><div class=d2><span></span><div class=d3><span></span><div class=d4><span></span><div class=d5><span></span><div class=d6><span></span><div class=d7><span></span><div class=d8><span></span><div class=d9><span></span><div class=d10><span></span><div class=d11><!--></div></div></div></div></div></div></div></div></div></div></div></div>');