1const u=["active","probation","onLeave","notice"],o=new Set(u),d=["active","probation"],s=new Set(d);function c(n){const t=String(n??"").toLowerCase().replace(/[^a-z]/g,"");return t?t.includes("notice")?"notice":t.includes("resign")||t.includes("exited")||t.includes("relieved")?"resigned":t.includes("onleave")||t==="leave"?"onLeave":t.includes("probation")?"probation":t.includes("inactive")||t.includes("unactive")||t.includes("terminated")||t.includes("suspended")?"inactive":t.includes("active")?"active":null:null}function l(n){const t=[n?.employmentType,n?.employmentStatus,n?.raw?.["Employment Status"],n?.rawData?.["Employment Status"]];for(const a of t){const e=String(a??"").toLowerCase().replace(/[^a-z]/g,"");if(e)return e.includes("probation")}return!1}function S(n){const t=[n?.status,n?.employeeStatus,n?.raw?.Status,n?.raw?.["Employee Status"],n?.rawData?.Status,n?.rawData?.["Employee Status"]];for(const e of t){const r=c(e);if(r)return r}const a=String(n?.resignationStatus??n?.raw?.["Resignation Status"]??"").toLowerCase().trim();return a==="yes"||a==="true"?"resigned":"active"}function i(n){const t=S(n);return t==="active"&&l(n)?"probation":t}function f(n){return o.has(i(n))}function v(n=[]){const t={active:0,probation:0,onLeave:0,notice:0,resigned:0,inactive:0,total:0,employed:0,notEmployed:0,activeIncludingProbation:0};for(const a of n){const e=i(a);t[e]+=1,t.total+=1,o.has(e)?t.employed+=1:t.notEmployed+=1,s.has(e)&&(t.activeIncludingProbation+=1)}return t}function E(n,t){if(!t||t==="all")return!0;const a=c(t==="resignation"?"resigned":t);if(!a)return!0;const e=i(n);return a==="active"?s.has(e):e===a}export{d as A,v as c,f as i,E as m,i as r};
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.