vendor: 3,859 bytes, lines 1-5
1import{e as M,r as $,m as V,d as q,a as T,h as tt,i as R,f as L,j as et,k as st,l as nt,n as ot,p as ct,q as B,s as rt,u as ut}from"./@vue-C6IflAHu.js";/*! 2 * pinia v3.0.4 3 * (c) 2025 Eduardo San Martin Morote 4 * @license MIT 5 */let J;const E=t=>J=t,K=Symbol();function I(t){return t&&typeof t=="object"&&Object.prototype.toString.call(t)==="[object Object]"&&typeof t.toJSON!="function"}var p;(function(t){t.direct="direct",t.patchObject="patch object",t.patchFunction="patch function"})(p||(p={}));function yt(){const t=M(!0),o=t.run(()=>$({}));let s=[],e=[];const r=V({install(u){E(r),r._a=u,u.provide(K,r),u.config.globalProperties.$pinia=r,e.forEach(a=>s.push(a)),e=[]},use(u){return this._a?s.push(u):e.push(u),this},_p:s,_a:null,_e:t,_s:new Map,state:o});return r}const z=()=>{};function A(t,o,s,e=z){t.add(o);const r=()=>{t.delete(o)&&e()};return!s&&et()&&st(r),r}function w(t,...o){t.forEach(s=>{s(...o)})}const at=t=>t(),H=Symbol(),x=Symbol();function W(t,o){t instanceof Map&&o instanceof Map?o.forEach((s,e)=>t.set(e,s)):t instanceof Set&&o instanceof Set&&o.forEach(t.add,t);for(const s in o){if(!o.hasOwnProperty(s))continue;const e=o[s],r=t[s];I(r)&&I(e)&&t.hasOwnProperty(s)&&!R(e)&&!L(e)?t[s]=W(r,e):t[s]=e}return t}const ft=Symbol();function lt(t){return!I(t)||!Object.prototype.hasOwnProperty.call(t,ft)}const{assign:h}=Object;function it(t){return!!(R(t)&&t.effect)}function ht(t,o,s,e){const{state:r,actions:u,getters:a}=o,P=s.state.value[t];let S;function b(){P||(s.state.value[t]=r?r():{});const y=ct(s.state.value[t]);return h(y,u,Object.keys(a||{}).reduce((v,d)=>(v[d]=V(B(()=>{E(s);const m=s._s.get(t);return a[d].call(m,m)})),v),{}))}return S=Q(t,b,o,s,e,!0),S}function Q(t,o,s={},e,r,u){let a;const P=h({actions:{}},s),S={deep:!0};let b,y,v=new Set,d=new Set,m;const _=e.state.value[t];!u&&!_&&(e.state.value[t]={});let N;function D(c){let n;b=y=!1,typeof c=="function"?(c(e.state.value[t]),n={type:p.patchFunction,storeId:t,events:m}):(W(e.state.value[t],c),n={type:p.patchObject,payload:c,storeId:t,events:m});const f=N=Symbol();ot().then(()=>{N===f&&(b=!0)}),y=!0,w(v,n,e.state.value[t])}const U=u?function(){const{state:n}=s,f=n?n():{};this.$patch(j=>{h(j,f)})}:z;function X(){a.stop(),v.clear(),d.clear(),e._s.delete(t)}const F=(c,n="")=>{if(H in c)return c[x]=n,c;const f=function(){E(e);const j=Array.from(arguments),O=new Set,k=new Set;function Z(l){O.add(l)}function G(l){k.add(l)}w(d,{args:j,name:f[x],store:i,after:Z,onError:G});let g;try{g=c.apply(this&&this.$id===t?this:i,j)}catch(l){throw w(k,l),l}return g instanceof Promise?g.then(l=>(w(O,l),l)).catch(l=>(w(k,l),Promise.reject(l))):(w(O,g),g)};return f[H]=!0,f[x]=n,f},Y={_p:e,$id:t,$onAction:A.bind(null,d),$patch:D,$reset:U,$subscribe(c,n={}){const f=A(v,c,n.detached,()=>j()),j=a.run(()=>rt(()=>e.state.value[t],O=>{(n.flush==="sync"?y:b)&&c({storeId:t,type:p.direct,events:m},O)},h({},S,n)));return f},$dispose:X},i=nt(Y);e._s.set(t,i);const C=(e._a&&e._a.runWithContext||at)(()=>e._e.run(()=>(a=M()).run(()=>o({action:F}))));for(const c in C){const n=C[c];if(R(n)&&!it(n)||L(n))u||(_&<(n)&&(R(n)?n.value=_[c]:W(n,_[c])),e.state.value[t][c]=n);else if(typeof n=="function"){const f=F(n,c);C[c]=f,P.actions[c]=n}}return h(i,C),h(q(i),C),Object.defineProperty(i,"$state",{get:()=>e.state.value[t],set:c=>{D(n=>{h(n,c)})}}),e._p.forEach(c=>{h(i,a.run(()=>c({store:i,app:e._a,pinia:e,options:P})))}),_&&u&&s.hydrate&&s.hydrate(i.$state,_),b=!0,y=!0,i}/*! #__NO_SIDE_EFFECTS__ */function vt(t,o,s){let e;const r=typeof o=="function";e=r?s:o;function u(a,P){const S=tt();return a=a||(S?T(K,null):null),a&&E(a),a=J,a._s.has(t)||(r?Q(t,o,e,a):ht(t,e,a)),a._s.get(t)}return u.$id=t,u}function dt(t){const o=q(t),s={};for(const e in o){const r=o[e];r.effect?s[e]=B({get:()=>t[e],set(u){t[e]=u}}):(R(r)||L(r))&&(s[e]=ut(t,e))}return s}export{yt as c,vt as d,dt as s};
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.