Buckets:
| import{ac as I,ak as P,ad as M,X as R,a0 as y,$ as x,h as E,m as D,aj as L,a2 as F,g as N,e as C,E as Y,i as G,j as U,k as $,l as T,ax as j,ay as z,az as q,G as b,aA as H,B as W,aB as X,x as Z,ab as J,aC as K,w as Q,aD as V,aE as ee,aF as te,av as B,W as ae,aG as se,S as re,aH as ie}from"./AFMXG_zE.js";let m=!1;function ne(f){var e=m;try{return m=!1,[f(),m]}finally{m=e}}class fe{anchor;#t=new Map;#a=new Map;#e=new Map;#s=new Set;#r=!0;constructor(e,s=!0){this.anchor=e,this.#r=s}#i=e=>{if(this.#t.has(e)){var s=this.#t.get(e),t=this.#a.get(s);if(t)I(t),this.#s.delete(s);else{var r=this.#e.get(s);r&&(I(r.effect),this.#a.set(s,r.effect),this.#e.delete(s),r.fragment.lastChild.remove(),this.anchor.before(r.fragment),t=r.effect)}for(const[i,n]of this.#t){if(this.#t.delete(i),i===e)break;const a=this.#e.get(n);a&&(P(a.effect),this.#e.delete(n))}for(const[i,n]of this.#a){if(i===s||this.#s.has(i))continue;const a=()=>{if(Array.from(this.#t.values()).includes(i)){var u=document.createDocumentFragment();L(n,u),u.append(R()),this.#e.set(i,{effect:n,fragment:u})}else P(n);this.#s.delete(i),this.#a.delete(i)};this.#r||!t?(this.#s.add(i),M(n,a,!1)):a()}}};#n=e=>{this.#t.delete(e);const s=Array.from(this.#t.values());for(const[t,r]of this.#e)s.includes(t)||(P(r.effect),this.#e.delete(t))};ensure(e,s){var t=x,r=F();if(s&&!this.#a.has(e)&&!this.#e.has(e))if(r){var i=document.createDocumentFragment(),n=R();i.append(n),this.#e.set(e,{effect:y(()=>s(n)),fragment:i})}else this.#a.set(e,y(()=>s(this.anchor)));if(this.#t.set(t,e),r){for(const[a,c]of this.#a)a===e?t.unskip_effect(c):t.skip_effect(c);for(const[a,c]of this.#e)a===e?t.unskip_effect(c.effect):t.skip_effect(c.effect);t.oncommit(this.#i),t.ondiscard(this.#n)}else E&&(this.anchor=D),this.#i(t)}}function de(f,e,s=!1){var t;E&&(t=D,C());var r=new fe(f),i=s?Y:0;function n(a,c){if(E){var u=G(t);if(a!==parseInt(u.substring(1))){var o=U();$(o),r.anchor=o,T(!1),r.ensure(a,c),T(!0);return}}r.ensure(a,c)}N(()=>{var a=!1;e((c,u=0)=>{a=!0,n(u,c)}),a||n(-1,null)},i)}function ue(f,e,s,t){var r=!V||(s&ee)!==0,i=(s&K)!==0,n=(s&se)!==0,a=t,c=!0,u=void 0,o=()=>n&&r?(u??=B(t),b(u)):(c&&(c=!1,a=n?Q(t):t),a);let _;if(i){var O=re in f||ie in f;_=j(f,e)?.set??(O&&e in f?d=>f[e]=d:void 0)}var l,A=!1;i?[l,A]=ne(()=>f[e]):l=f[e],l===void 0&&t!==void 0&&(l=o(),_&&(r&&z(),_(l)));var h;if(r?h=()=>{var d=f[e];return d===void 0?o():(c=!0,d)}:h=()=>{var d=f[e];return d!==void 0&&(a=void 0),d===void 0?a:d},r&&(s&q)===0)return h;if(_){var k=f.$$legacy;return(function(d,g){return arguments.length>0?((!r||!g||k||A)&&_(g?h():d),d):h()})}var S=!1,v=((s&te)!==0?B:ae)(()=>(S=!1,h()));i&&b(v);var w=Z;return(function(d,g){if(arguments.length>0){const p=g?b(v):r&&i?H(d):d;return W(v,p),S=!0,a!==void 0&&(a=p),d}return X&&S||(w.f&J)!==0?v.v:b(v)})}export{fe as B,de as i,ue as p}; | |
Xet Storage Details
- Size:
- 2.82 kB
- Xet hash:
- a039941d6681b64a37f89bf0c051c38e4884d9098baa47dc21363d2f3c9c5a94
·
Xet efficiently stores files, intelligently splitting them into unique chunks and accelerating uploads and downloads. More info.