1import{cQ as c,cR as l,cS as i,cw as s}from"./index-t4jkVxhS.js";function p(e,u){for(var r=0;r<u.length;r++){const o=u[r];if(typeof o!="string"&&!Array.isArray(o)){for(const t in o)if(t!=="default"&&!(t in e)){const a=Object.getOwnPropertyDescriptor(o,t);a&&Object.defineProperty(e,t,a.get?a:{enumerable:!0,get:()=>o[t]})}}}return Object.freeze(Object.defineProperty(e,Symbol.toStringTag,{value:"Module"}))}var n={},d;function R(){if(d)return n;d=1;var e=c();Object.defineProperty(n,"__esModule",{value:!0}),n.default=void 0;var u=e(l()),r=i();return n.default=(0,u.default)((0,r.jsx)("path",{d:"m12 5.83 2.46 2.46c.39.39 1.02.39 1.41 0 .39-.39.39-1.02 0-1.41L12.7 3.7a.9959.9959 0 0 0-1.41 0L8.12 6.88c-.39.39-.39 1.02 0 1.41.39.39 1.02.39 1.41 0zm0 12.34-2.46-2.46a.9959.9959 0 0 0-1.41 0c-.39.39-.39 1.02 0 1.41l3.17 3.18c.39.39 1.02.39 1.41 0l3.17-3.17c.39-.39.39-1.02 0-1.41a.9959.9959 0 0 0-1.41 0z"}),"UnfoldMoreRounded"),n}var f=R();const v=s(f),m=p({__proto__:null,default:v},[f]);export{m as U};
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.