1const a={formatTime(s,l=0){const e=Math.floor(s)%60,t=Math.floor(s/60)%60,i=Math.floor(s/60/60)%24,o=l?(s%60).toFixed(l):e;let n="";return n+=i?`${i}æé`:"",n+=t?`${t}å`:"",l?n+=`${o}ç§`:n+=e?`${e}ç§`:"",n},Fraction(s,l,e="ka"){if(s===0)return'<p style="display: inline-block; text-align:center;">0</p>';if(s%l===0)return`<p style="display:inline-block; text-align:center;">${Math.round(s/l)}</p>`;if(e==="ka")return` 2 <p style="display: inline-block; vertical-align:middle; text-align:center;"> 3 <span style="display:block; border-bottom: 1px solid #333;"> 4 ${s} 5 </span> 6 <span style="display:block;"> 7 ${l} 8 </span> 9 </p> 10 `;if(e==="tai"){const t=Math.floor(s/l),i=s%l;let o=t!==0?` 11 <span> 12 ${t} 13 </span> 14 `:"";return i&&(o+=` 15 <p style="display: inline-block; vertical-align:middle; text-align:center;"> 16 <span style="display:block; border-bottom: 1px solid #333;"> 17 ${i} 18 </span> 19 <span style="display:block;"> 20 ${l} 21 </span> 22 </p> 23 `),o}},removeHTMLTag(s){return!s||typeof s!="string"?"":s.replace(/<[^>]*>/g,"")}};export{a as f};
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.