1"use strict";(self.webpackChunk_N_E=self.webpackChunk_N_E||[]).push([[9686],{17123:(e,r,l)=>{function t(e,r){let l=new URLSearchParams({group:e.service_group,service:e.service_name,index:e.index});return r&&l.append("endpoint",r),l}function n(e,r,l){let n=t(e,r);return l&&n.append("query",JSON.stringify(l)),"/api/services/proxy?".concat(n.toString())}l.d(r,{$C:()=>n,_V:()=>t})},39686:(e,r,l)=>{l.r(r),l.d(r,{default:()=>o});var t=l(23798),n=l(94392),a=l(29534),i=l(32916),s=l(89886);function o(e){let{service:r}=e,{t:l}=(0,i.Bd)(),{widget:o}=r,{data:u,error:m}=(0,s.A)(o,"system"),{data:c,error:v}=(0,s.A)(o,"leases");if(m||v)return(0,t.jsx)(a.A,{service:r,error:null!=m?m:v});if(!u||!c)return(0,t.jsxs)(a.A,{service:r,children:[(0,t.jsx)(n.A,{label:"mikrotik.uptime"}),(0,t.jsx)(n.A,{label:"mikrotik.cpuLoad"}),(0,t.jsx)(n.A,{label:"mikrotik.memoryUsed"}),(0,t.jsx)(n.A,{label:"mikrotik.numberOfLeases"})]});let d=100-u["free-memory"]/u["total-memory"]*100,k=c.length;return(0,t.jsxs)(a.A,{service:r,children:[(0,t.jsx)(n.A,{label:"mikrotik.uptime",value:u.uptime}),(0,t.jsx)(n.A,{label:"mikrotik.cpuLoad",value:l("common.percent",{value:u["cpu-load"]})}),(0,t.jsx)(n.A,{label:"mikrotik.memoryUsed",value:l("common.percent",{value:d})}),(0,t.jsx)(n.A,{label:"mikrotik.numberOfLeases",value:l("common.number",{value:k})})]})}},89886:(e,r,l)=>{l.d(r,{A:()=>a});var t=l(96638),n=l(17123);function a(e){for(var r,l,a=arguments.length,i=Array(a>1?a-1:0),s=1;s<a;s++)i[s-1]=arguments[s];let o={};i&&(null==(r=i[1])?void 0:r.refreshInterval)&&(o.refreshInterval=i[1].refreshInterval);let u=(0,n.$C)(e,...i);""===i[0]&&(u=null);let{data:m,error:c,mutate:v}=(0,t.Ay)(u,o);return{data:m,error:null!=(l=null==m?void 0:m.error)?l:c,mutate: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.