1function f(e){e.directive("intersect",e.skipDuringClone((t,{value:l,expression:u,modifiers:n},{evaluateLater:r,cleanup:o})=>{let i=r(u),s={rootMargin:v(n),threshold:d(n)},c=new IntersectionObserver(a=>{a.forEach(h=>{h.isIntersecting!==(l==="leave")&&(i(),n.includes("once")&&c.disconnect())})},s);c.observe(t),o(()=>{c.disconnect()})}))}function d(e){if(e.includes("full"))return .99;if(e.includes("half"))return .5;if(!e.includes("threshold"))return 0;let t=e[e.indexOf("threshold")+1];return t==="100"?1:t==="0"?0:+`.${t}`}function g(e){let t=e.match(/^(-?[0-9]+)(px|%)?$/);return t?t[1]+(t[2]||"px"):void 0}function v(e){const t="margin",l="0px 0px 0px 0px",u=e.indexOf(t);if(u===-1)return l;let n=[];for(let r=1;r<5;r++)n.push(g(e[u+r]||""));return n=n.filter(r=>r!==void 0),n.length?n.join(" ").trim():l}var x=f;export{x as default,f as intersect};
Line numbers count LF bytes from the start of the resource, as the search results do. Vendor segments are library code the classifier recognised; they are stored but not indexed. Bytes are shown as Latin1 characters, one per byte.