1function t(e){return e??crypto.randomUUID()}const o=e=>t(e),c=e=>t(e),i=e=>t(e),d=e=>t(e),I=e=>t(e),u=e=>t(e),m=e=>t(e),l=e=>t(e),p=e=>t(e),y=e=>t(e),f=e=>t(e),b=e=>t(e),R=e=>t(e),E=e=>t(e),g=e=>t(e),w=e=>t(e),h=e=>t(e),S=e=>t(e),x=e=>t(e),C=e=>t(e);const r=e=>e,M=e=>e,s=e=>{if(!Number.isSafeInteger(e)||e<0)throw new TypeError(`Unix milliseconds must be a non-negative safe integer: ${e}`);return e},N=e=>{if(!Number.isFinite(e)||e<0)throw new TypeError(`Monotonic milliseconds must be a non-negative finite number: ${e}`);return e};function a(e,n){if(!Number.isSafeInteger(e)||e<0)throw new TypeError(`${n} must be a non-negative safe integer`);return e}const O=e=>a(e,"Replay generation"),U=e=>a(e,"Replay sequence identity"),P=e=>a(e,"Replay request ordinal"),T=r(0),q=s(0),_=(e,n)=>s(Math.max(e,n));export{C as A,x as B,T as E,q as U,c as a,s as b,l as c,r as d,i as e,u as f,d as g,o as h,M as i,O as j,U as k,P as l,y as m,g as n,E as o,w as p,p as q,b as r,R as s,f as t,m as u,N as v,h as w,S as x,I as y,_ as z};
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.