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