1const O=()=>{const h=(s={})=>s===null||s===void 0||s===""?!0:!Object.keys(s).length;function y(...s){const t={};return s.forEach(l=>{typeof l=="string"?t[l]=!0:Array.isArray(l)?l.forEach(n=>{t[n]=!0}):typeof l=="object"&&l!==null&&Object.entries(l).forEach(([n,o])=>{typeof o=="boolean"&&(t[n]=o)})}),t}return{checkObjectEmpty:h,mergeClassObject:y,generateFormSettings:s=>{if(!s||Object.keys(s).length<=0)return{labels:{},schemas:{},initialValues:{}};const t={},l={},n={};return s&&Object.keys(s).length>0&&Object.keys(s).forEach(o=>{const f=o,e=s[o];if(e.hasOwnProperty("label")){const a=[];e.hasOwnProperty("prefixLabel")&&(Array.isArray(e.prefixLabel)?a.push(...e.prefixLabel):a.push(e.prefixLabel)),Array.isArray(e.label)?a.push(...e.label):a.push(e.label),e.hasOwnProperty("suffixLabel")&&(Array.isArray(e.suffixLabel)?a.push(...e.suffixLabel):a.push(e.suffixLabel)),t[f]=a}if(e.hasOwnProperty("schema")&&(l[f]=e.schema),e.hasOwnProperty("initialValue")&&(n[f]=e.initialValue),e.hasOwnProperty("nests")){const a=e.nests;a&&Object.keys(a).length>0&&Object.keys(a).forEach((u,c)=>{const r=a[u];if(e.hasOwnProperty("label")||r.hasOwnProperty("label")){const b=`${f}.${u}`,i=[];r.hasOwnProperty("isRowNumber")&&i.push(`No.${String(c+1)}:`),r.hasOwnProperty("prefixLabel")&&(Array.isArray(r.prefixLabel)?i.push(...r.prefixLabel):i.push(r.prefixLabel)),Array.isArray(r.label)?i.push(...r.label):i.push(r.label),r.hasOwnProperty("suffixLabel")&&(Array.isArray(r.suffixLabel)?i.push(...r.suffixLabel):i.push(r.suffixLabel)),f in t&&t[f]?t[b]=`${t[f]}`:t[b]=Array.isArray(i)?i.join(""):i}})}}),{labels:t,schemas:l,initialValues:n}}}};export{O 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.