1function g(s,t){s.indexOf(t)===-1&&s.push(t)}function y(s,t){const n=s.indexOf(t);n>-1&&s.splice(n,1)}const q=(s,t,n)=>n>t?t:n<s?s:n,F={},P=s=>/^-?(?:\d+(?:\.\d+)?|\.\d+)$/u.test(s),V=s=>typeof s=="object"&&s!==null,$=s=>/^0[^.\s]+$/u.test(s);function C(s){let t;return()=>(t===void 0&&(t=s()),t)}const l=s=>s,D=(...s)=>s.reduce((t,n)=>i=>n(t(i))),G=(s,t,n)=>{const i=t-s;return i?(n-s)/i:1};class L{constructor(){this.subscriptions=[]}add(t){return g(this.subscriptions,t),()=>y(this.subscriptions,t)}notify(t,n,i){const c=this.subscriptions.length;if(c)if(c===1)this.subscriptions[0](t,n,i);else for(let e=0;e<c;e++){const o=this.subscriptions[e];o&&o(t,n,i)}}getSize(){return this.subscriptions.length}clear(){this.subscriptions.length=0}}const N=s=>s*1e3,U=s=>s/1e3,Z=(s,t)=>t?s*(1e3/t):0,b=(s,t,n)=>(((1-3*n+3*t)*s+(3*n-6*t))*s+3*t)*s,I=1e-7,M=12;function O(s,t,n,i,c){let e,o,h=0;do o=t+(n-t)/2,e=b(o,i,c)-s,e>0?n=o:t=o;while(Math.abs(e)>I&&++h<M);return o}function r(s,t,n,i){if(s===t&&n===i)return l;const c=e=>O(e,0,1,s,n);return e=>e===0||e===1?e:b(c(e),t,i)}const f=s=>t=>t<=.5?s(2*t)/2:(2-s(2*(1-t)))/2,p=s=>t=>1-s(1-t),d=r(.33,1.53,.69,.99),u=p(d),S=f(u),x=s=>s>=1?1:(s*=2)<1?.5*u(s):.5*(2-Math.pow(2,-10*(s-1))),a=s=>1-Math.sin(Math.acos(s)),k=p(a),A=f(a),T=r(.42,0,1,1),m=r(0,0,.58,1),v=r(.42,0,.58,1),w=s=>Array.isArray(s)&&typeof s[0]!="number",z=s=>Array.isArray(s)&&typeof s[0]=="number",E={linear:l,easeIn:T,easeInOut:v,easeOut:m,circIn:a,circInOut:A,circOut:k,backIn:u,backInOut:S,backOut:d,anticipate:x},j=s=>typeof s=="string",B=s=>{if(z(s)){const[t,n,i,c]=s;return r(t,n,i,c)}else if(j(s))return E[s];return s};export{F as M,L as S,G as a,v as b,q as c,C as d,B as e,z as f,A as g,S as h,w as i,x as j,P as k,$ as l,U as m,l as n,V as o,D as p,k as q,g as r,N as s,y as t,Z as v};
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.