1import{E as O,m as C,g as V,s as $,cN as J,Q as E,bU as T,cO as z,cP as B,b5 as D,B as F}from"./DbfHA8MV.js";function A(e={}){const{inheritAttrs:t=!0}=e,u=T(),d=E({setup(a,{slots:c}){return()=>{u.value=c.default}}}),i=E({inheritAttrs:t,props:e.props,setup(a,{attrs:c,slots:s}){return()=>{var n;u.value;const o=(n=u.value)==null?void 0:n.call(u,{...e.props==null?M(c):a,$slots:s});return t&&(o==null?void 0:o.length)===1?o[0]:o}}});return z({define:d,reuse:i},[d,i])}function M(e){const t={};for(const u in e)t[B(u)]=e[u];return t}function R(e){return JSON.parse(JSON.stringify(e))}const v=new Map;function I(e){const t=D();function u(s){var n;const o=v.get(e)||new Set;o.add(s),v.set(e,o);const f=()=>i(s);return(n=t==null?void 0:t.cleanups)==null||n.push(f),f}function d(s){function n(...o){i(n),s(...o)}return u(n)}function i(s){const n=v.get(e);n&&(n.delete(s),n.size||a())}function a(){v.delete(e)}function c(s,n){var o;(o=v.get(e))==null||o.forEach(f=>f(s,n))}return{on:u,once:d,off:i,emit:c,reset:a}}function K(e,t,u,d={}){var i,a,c;const{clone:s=!1,passive:n=!1,eventName:o,deep:f=!1,defaultValue:N,shouldEmit:b}=d,r=O(),h=u||(r==null?void 0:r.emit)||((i=r==null?void 0:r.$emit)==null?void 0:i.bind(r))||((c=(a=r==null?void 0:r.proxy)==null?void 0:a.$emit)==null?void 0:c.bind(r==null?void 0:r.proxy));let p=o;p=p||`update:${t.toString()}`;const S=l=>s?typeof s=="function"?s(l):R(l):l,w=()=>J(e[t])?S(e[t]):N,x=l=>{b?b(l)&&h(p,l):h(p,l)};if(n){const l=w(),_=V(l);let m=!1;return C(()=>e[t],g=>{m||(m=!0,_.value=S(g),F(()=>m=!1))}),C(_,g=>{!m&&(g!==e[t]||f)&&x(g)},{deep:f}),_}else return $({get(){return w()},set(l){x(l)}})}export{I as a,A as c,K as u};
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.