1import{k as n,l as x,m as B,n as H,o as g,p as E,H as C,s as D,q as S,t as c,v as q,w as v,B as L,x as R,y as U,z,A as I,U as G,C as N,E as M}from"./CU12suJz.js";import{B as O}from"./B3mSI_OH.js";const T=0,k=1,P=2;function j(_,A,m,r,l){n&&x();var y=B(),t=G,i=y?I(t):N(t,!1,!1),o=y?I(t):N(t,!1,!1),a=new O(_);H(()=>{var h=g;h.deactivate();var u=A();h.activate();var d=!1;let p=n&&E(u)===(_.data===C);if(p&&(D(S()),c(!1)),E(u)){var w=M(),b=!1;const s=e=>{if(!d){b=!0,w(!1),L.ensure(),n&&c(!1);try{e()}finally{R(!1),U||z()}}};u.then(e=>{s(()=>{v(i,e),a.ensure(k,r&&(f=>r(f,i)))})},e=>{s(()=>{if(v(o,e),a.ensure(P,l&&(f=>l(f,o))),!l)throw o.v})}),n?a.ensure(T,m):q(()=>{b||s(()=>{a.ensure(T,m)})})}else v(i,u),a.ensure(k,r&&(s=>r(s,i)));return p&&c(!0),()=>{d=!0}})}export{j as a};
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.