@fluixi/utils 1.0.0-alpha.82 → 1.0.0-alpha.84

package/dist/lib/array/advanced.mjs

@@ -1 +1,2204 @@
-var A=e=>e==null||Array.isArray(e)||typeof e=="function"||e instanceof Date||e instanceof RegExp||e instanceof Map||e instanceof Set||e instanceof Error?!1:typeof e=="object";var h=(e,t,n,r)=>{if(n>r)return;if(t.length===0)return e;let i=t[0],s=t.slice(1);if(i.type==="descendant"){let u=h(e,s,n+1,r);if(u!==void 0)return u;if(e&&typeof e=="object")if(Array.isArray(e)){let o=[];for(let a=0;a<e.length;a++){let f=h(e[a],t,n+1,r);f!==void 0&&(o[a]=f)}return o.length>0?o:void 0}else{let o={};for(let a in e)if(e.hasOwnProperty(a)){let f=h(e[a],t,n+1,r);f!==void 0&&(o[a]=f)}return Object.keys(o).length>0?o:void 0}return}switch(i.type){case"property":if(A(e)&&i.value&&String(i.value)in e){let u=e[String(i.value)],o=h(u,s,n+1,r);if(o!==void 0)return{[String(i.value)]:o}}break;case"index":if(Array.isArray(e)){let u=i.value;if(u>=0&&u<e.length){let o=h(e[u],s,n+1,r);if(o!==void 0){let a=new Array(e.length).filter(f=>f!==void 0);return a[u]=o,a}}}else if(e&&typeof e=="object"){let u=String(i.value);if(u in e){let o=h(e[u],s,n+1,r);if(o!==void 0)return{[u]:o}}}break;case"wildcard":if(e&&typeof e=="object")if(Array.isArray(e)){let u=[],o=!1;for(let a=0;a<e.length;a++){let f=h(e[a],s,n+1,r);f!==void 0&&(u[a]=f,o=!0)}return o?u:void 0}else{let u={},o=!1;for(let a in e)if(e.hasOwnProperty(a)){let f=h(e[a],s,n+1,r);f!==void 0&&(u[a]=f,o=!0)}return o?u:void 0}break;case"slice":if(Array.isArray(e)){let[u,o]=i.value,a=Math.max(0,u),f=Math.min(e.length,o===1/0?e.length:o),y=[],g=!1;for(let p=a;p<f;p++){let b=h(e[p],s,n+1,r);b!==void 0&&(y[p]=b,g=!0)}return g?y:void 0}break;case"union":if(Array.isArray(e)){let u=i.value,o=[],a=!1;for(let f of u)if(f>=0&&f<e.length){let y=h(e[f],s,n+1,r);y!==void 0&&(o[f]=y,a=!0)}return a?o:void 0}break;case"filter":if(Array.isArray(e)){let u=i.value,o=[],a=!1;for(let f=0;f<e.length;f++)if(u(e[f])){let y=h(e[f],s,n+1,r);y!==void 0&&(o[f]=y,a=!0)}return a?o:void 0}break}};var S=(e,t)=>{if(e==null||typeof e!="object")return e;if(e instanceof Date)return new Date(e.getTime());if(e instanceof RegExp)return new RegExp(e.source,e.flags);if(e instanceof Map){let n=new Map;return e.forEach((r,i)=>{(!t||!t.some(s=>s.toString()===i.toString()))&&n.set(i,S(r))}),n}if(e instanceof Set){let n=new Set;return e.forEach(r=>{n.add(S(r))}),n}if(Array.isArray(e))return Array.from(e).map(n=>S(n));if(A(e)){let n={};for(let i in e)Object.prototype.hasOwnProperty.call(e,i)&&(!t||!t.some(s=>s.toString()===i.toString()))&&(n[i]=S(e[i]));let r=Object.getOwnPropertySymbols(e);for(let i of r)(!t||!t.some(s=>s.toString()===i.toString()))&&(n[i]=S(e[i]));return n}return e};var K=(e,t={})=>{let{type:n="auto",throwOnError:r=!1}=t;if(!e||typeof e!="string")return[];let i=[],s="",u=!1,o=!1,a="",f="",y=0,p=n==="auto"?(c=>c.includes("..")?"descendant":c.includes("[?(")?"filter":c.includes("[:")||c.includes("[0:")?"slice":c.includes("[,")||c.includes("[0,1]")?"union":c.includes("[*]")||c.includes(".*.")?"wildcard":c.includes("[]")?"array-wildcard":c.includes("[")&&c.includes("]")?"bracket":"dot")(e):n,b=c=>{let l=c.trim();if(l==="*"||l==="")return{type:"wildcard",value:l===""?"[]":"*",raw:l===""?"[]":c};if(l==="[]")return{type:"wildcard",value:"[]",raw:c};if(/^-?\d+$/.test(l))return{type:"index",value:parseInt(l,10),raw:c};if(l.includes(":")){let T=l.split(":").map(k=>k.trim()),m=T[0]===""?0:parseInt(T[0],10),x=T[1]===""?1/0:parseInt(T[1],10);if(isNaN(m)||isNaN(x)){if(r)throw new Error(`Invalid slice notation: ${c}`);return{type:"wildcard",value:"*",raw:c}}return{type:"slice",value:[m,x],raw:c}}if(l.includes(",")){let T=l.split(",").map(m=>{let x=parseInt(m.trim(),10);return isNaN(x)?-1:x}).filter(m=>m>=0);if(T.length===0){if(r)throw new Error(`Invalid union notation: ${c}`);return{type:"wildcard",value:"*",raw:c}}return{type:"union",value:T,raw:c}}if(l.startsWith("?(")&&l.endsWith(")")){let T=l.slice(2,-1);try{return{type:"filter",value:V(T),raw:c}}catch(m){if(r)throw m;return{type:"wildcard",value:"*",raw:c}}}return l.startsWith('"')&&l.endsWith('"')||l.startsWith("'")&&l.endsWith("'")?{type:"property",value:l.slice(1,-1),raw:c}:{type:"property",value:l,raw:c}};for(let c=0;c<e.length;c++){let l=e[c],T=e[c+1];if((l==='"'||l==="'")&&!o){o=!0,a=l;continue}else if(l===a&&o){o=!1,a="",l==='"'||l==="'"||(u?f+=l:s+=l);continue}if(o){u?f+=l:s+=l;continue}if(l==="["&&!u){s&&(i.push({type:"property",value:s,raw:s}),s=""),u=!0,f="";continue}if(l==="]"&&u&&!o){u=!1;let x=b(f);i.push(x);continue}let m=i.length>0?i[i.length-1]:null;if(l==="."&&!u&&!o){if(T==="."){let x=e.split("..")[0];i.push({type:"property",value:x,raw:x}),i.push({type:"descendant",value:"..",raw:".."}),c++}else s&&(s==="*"?i.push({type:"wildcard",value:s,raw:s}):i.push({type:"property",value:s,raw:s}),s="");continue}if(u)f+=l;else if(m&&m.type!=="descendant")s+=l;else{let x=e.split(m?.raw)[1];x!==void 0?s=x:s+=l}}return s&&i.push({type:"property",value:s,raw:s}),i.map(c=>{if(c.type==="property"&&typeof c.value=="string"&&/^-?\d+$/.test(c.value)){let l=parseInt(c.value,10);if(!isNaN(l))return{...c,type:"index",value:l}}return c})},V=e=>{let t=e.replace(/@\.([a-zA-Z_$][\w$]*)/g,(n,r)=>`item.${r}`).replace(/@/g,"item");try{return new Function("item",`return ${t}`)}catch{throw new Error(`Invalid filter expression: ${e}`)}};var I=(e,t,n)=>{let r=K(t),i=e;for(let s=0;s<r.length;s++){let u=r[s],o=s===r.length-1;switch(u.type){case"property":if(o)i[String(u.value)]=n;else{if(!i[String(u.value)]){let f=r[s+1];i[String(u.value)]=f.type==="index"||f.type==="slice"||f.type==="union"||f.type==="wildcard"?[]:{}}i=i[String(u.value)]}break;case"index":Array.isArray(i)||(i=[]);let a=u.value;if(o){if(a>=i.length)for(let f=i.length;f<=a;f++)i.push(void 0);i[a]=n}else{if(!i[a]){let f=r[s+1];i[a]=f.type==="index"||f.type==="slice"||f.type==="union"||f.type==="wildcard"?[]:{}}i=i[a]}break;case"wildcard":if(Array.isArray(i))if(o)for(let f=0;f<i.length;f++)i[f]=n;else{let f=r[s+1];for(let y=0;y<i.length;y++)i[y]||(i[y]=f.type==="index"||f.type==="slice"||f.type==="union"||f.type==="wildcard"?[]:{});i.length>0&&(i=i[0])}break}}};function d(e,t,n={}){let{preserveStructure:r,multiple:i,throwOnError:s=!1,defaultValue:u,maxDepth:o=20}=n;if(!e||typeof e!="object")return u;if(!t)return e;if(Array.isArray(t))if(r){let y={};for(let g of t){let p=d(e,g,{...n,preserveStructure:!1});p!==void 0&&I(y,g,p)}return y}else return t.map(y=>d(e,y,{...n,preserveStructure:!1}));let a=K(t,{...n,throwOnError:s});if(a.length===0)return e;if(typeof r>"u"||r===!1){let y=R(e,t);return i===!1&&Array.isArray(y)?y[0]:y===void 0&&u!==void 0?u:y}let f=h(e,a,0,o);return f===void 0&&u!==void 0?u:f}function R(e,t,n={}){let{createMissing:r=!1,add:i=!1,debug:s=!1}=n,u=K(t),o=e,a=!1,f="",y=t;if(typeof o=="object"&&!Array.isArray(o)&&y.length>0&&o[y])return o=o[y],o;for(let g=0;g<u.length;g++){let p=u[g],b=u.length>1?g===u.length-1:!1;if(o===null&&!r)return;let c=u[g+1];switch(p.type){case"property":if(o&&typeof o=="object")if(Array.isArray(o)){if(typeof p.value=="number"){let l=p.value;if(r&&l>=o.length)for(let T=o.length;T<=l;T++)o.push(void 0);if(r&&(o[l]===null||o[l]===void 0)&&(!b||a)&&(c?o[l]=c.type==="index"||c.type==="slice"||c.type==="union"||c.type==="wildcard"?[]:{}:o[l]=null,a=!1),o=o[l],c){a=!0;continue}}else i?o.push({[String(p.value)]:null}):o=o.map(l=>l[String(p.value)]);if(c)continue;return F(o)}else{if(o[f]&&f.split(".").length>=2){o=o[f];continue}if(r&&(o[String(p.value)]===null||o[String(p.value)]===void 0)&&(!b||a)&&(c?o[String(p.value)]=c.type==="index"||c.type==="slice"||c.type==="union"||c.type==="wildcard"?[]:{}:o[String(p.value)]=null,a=!1,o=o[String(p.value)],c)){a=!0;continue}if(o?(!o[String(p.value)]&&r&&(o[String(p.value)]=null),o=o[String(p.value)]):o={[String(p.value)]:null},c)continue}else if(r)o={},o[String(p.value)]=c.type==="index"||c.type==="slice"||c.type==="union"||c.type==="wildcard"||n.type==="array"?[]:{},o=o[String(p.value)];else return;break;case"index":case"wildcard":if(Array.isArray(o)){if(p.type==="index"){let l=p.value;if(l<0){o=o[o.length-Math.abs(l)];continue}if(r&&(l>=o.length||o[l]==null||o[l]==null)&&!b){for(let T=o.length;T<=l;T++)o.push(void 0);c&&(o[l]=c.type==="index"||c.type==="slice"||c.type==="union"||c.type==="wildcard"?[]:{})}o=o[l]}else if(!b)continue}else if(r){let l=u[g+1];o=[];let T=p.value;for(let m=0;m<=T;m++)o.push(void 0);o[T]=l.type==="index"||l.type==="slice"||l.type==="union"||l.type==="wildcard"||n.type==="array"?[]:{},o=o[T]}else{if(p.type==="index"&&typeof o=="object"&&o&&o[String(p.value)]!==void 0){o=o[String(p.value)];continue}if(typeof o=="object"){o=Object.values(o);continue}return}break;default:return}}return F(o)}function F(e){return Array.isArray(e)?e.filter(t=>typeof t<"u"):e}function v(e,t){if(!Array.isArray(e)||t<1)return[];let n=[];for(let r=0;r<e.length;r+=t)n.push(e.slice(r,r+t));return n}function se(e){return e.reduce((t,n)=>t.concat(n),[])}function $(e,t=1/0){return t<1?e.slice():e.reduce((n,r)=>(Array.isArray(r)?n.push(...$(r,t-1)):n.push(r),n),[])}function O(e,t){if(!Array.isArray(e))return[];if(!t)return[...new Set(e)];let n=new Set;return e.filter(r=>{let i=typeof t=="function"?t(r):A(r)?d(r,t):r;return n.has(i)?!1:(n.add(i),!0)})}function oe(e,t){return Array.isArray(e)?e.reduce((n,r)=>{let i;return typeof t=="function"?i=String(t(r)):i=String(A(r)?d(r,t):r),n[i]||(n[i]=[]),n[i].push(r),n},{}):{}}function ue(e,t){return Array.isArray(e)?e.reduce((n,r)=>{let i;return typeof t=="function"?i=String(t(r)):t?i=String(A(r)?d(r,t):r):i=String(r),n[i]=(n[i]||0)+1,n},{}):{}}function ae(e,t,n){return Array.isArray(e)?e.reduce((r,i)=>{let s;typeof t=="function"?s=String(t(i)):s=String(A(i)?d(i,t):i);let u;return n?typeof n=="function"?u=n(i):u=d(i,n):u=i,r[s]=u,r},{}):{}}function fe(e,t){if(!Array.isArray(e)||e.length===0)return[];let n=[...e],i=(Array.isArray(t)?t:[t]).map(s=>typeof s=="object"&&"key"in s?{key:s.key,dir:s.dir||"asc"}:{key:s,dir:"asc"});return n.sort((s,u)=>{for(let{key:o,dir:a}of i){let f=A(s)?d(s,o):s,y=A(u)?d(u,o):u;if(f===y)continue;let g=f<y?-1:1;return a==="asc"?g:-g}return 0}),n}function le(e,t,n){if(!Array.isArray(e))return[];if(!Array.isArray(t))return e;if(!n){let i=new Set(t);return e.filter(s=>!i.has(s))}let r=new Set(t.map(i=>A(i)?d(i,n):i));return e.filter(i=>{let s=A(i)?d(i,n):i;return!r.has(s)})}function ce(e,t,n){if(!Array.isArray(e)||!Array.isArray(t))return[];if(!n){let i=new Set(t);return e.filter(s=>i.has(s))}let r=new Set(t.map(i=>A(i)?d(i,n):i));return e.filter(i=>{let s=A(i)?d(i,n):i;return r.has(s)})}function ye(e,t,n){return!Array.isArray(e)&&!Array.isArray(t)?[]:Array.isArray(e)?Array.isArray(t)?O([...e,...t],n):O(e,n):O(t,n)}function pe(e,t){return Array.isArray(e)?e.reduce((n,r,i)=>(n[t(r,i)?0:1].push(r),n),[[],[]]):[[],[]]}function de(e,t){return!Array.isArray(e)||t<=0?[]:e.slice(0,t)}function Te(e,t){return!Array.isArray(e)||t<=0?[]:e.slice(-t)}function Ae(e,t){if(!Array.isArray(e))return[];let n=[];for(let r=0;r<e.length&&t(e[r],r);r++)n.push(e[r]);return n}function ge(e,t){return!Array.isArray(e)||t<=0?e?[...e]:[]:e.slice(t)}function me(e,t){if(!Array.isArray(e))return[];let n=0;for(;n<e.length&&t(e[n],n);)n++;return e.slice(n)}function xe(e){return Array.isArray(e)?e.filter(Boolean):[]}function he(...e){if(e.length===0)return[];let t=Math.max(...e.map(r=>Array.isArray(r)?r.length:0)),n=[];for(let r=0;r<t;r++){let i=[];for(let s of e)i.push(Array.isArray(s)?s[r]:void 0);n.push(i)}return n}function be(e){if(!Array.isArray(e)||e.length===0)return[];let t=Math.max(...e.map(r=>Array.isArray(r)?r.length:0)),n=[];for(let r=0;r<t;r++){let i=[];for(let s of e)Array.isArray(s)&&i.push(s[r]);n.push(i)}return n}function C(e){if(!Array.isArray(e))return[];let t=[...e];for(let n=t.length-1;n>0;n--){let r=Math.floor(Math.random()*(n+1));[t[n],t[r]]=[t[r],t[n]]}return t}function Se(e){if(!(!Array.isArray(e)||e.length===0))return e[Math.floor(Math.random()*e.length)]}function Ke(e,t){return!Array.isArray(e)||t<=0?[]:C(e).slice(0,Math.min(t,e.length))}function we(e,t,n=0){if(!Array.isArray(e))return-1;for(let r=n;r<e.length;r++)if(t(e[r],r))return r;return-1}function ve(e,t,n){if(!Array.isArray(e))return-1;let r=n!==void 0?n:e.length-1;for(let i=r;i>=0;i--)if(t(e[i],i))return i;return-1}function Oe(e,t){return Array.isArray(e)?e.map(n=>d(n,t)):[]}function Pe(e,t){return!Array.isArray(e)||!Array.isArray(t)?[]:e.map(n=>{let r={};for(let i of t)i in n&&(r[i]=n[i]);return r})}function Ie(e,t){return!Array.isArray(e)||!Array.isArray(t)?[]:e.map(n=>{let r={...n};for(let i of t)delete r[i];return r})}function Fe(e,t){return Array.isArray(e)?e.reduce((n,r,i)=>{let s=t(r,i);return n.concat(s)},[]):[]}function je(e,t,n){if(!Array.isArray(e))return n;let r=n;for(let i=e.length-1;i>=0;i--)r=t(r,e[i],i);return r}function ke(e,t,n=1){if(n===0)return[];let r=[];if(n>0)for(let i=e;i<t;i+=n)r.push(i);else for(let i=e;i>t;i+=n)r.push(i);return r}function Ve(e,t,n=0,r){if(!Array.isArray(e))return[];let i=[...e],s=r===void 0?i.length:r;for(let u=n;u<s&&u<i.length;u++)i[u]=t;return i}function Re(e){return Array.isArray(e)?S(e):[]}function $e(e,t,...n){let r,i;if(typeof t=="string")r=t,i=[e];else{let u=n[n.length-1];typeof u=="string"?(r=u,i=[e,t,...n.slice(0,-1).filter(Array.isArray)]):(r="id",i=[e,t,...n.filter(Array.isArray)])}if(i.length===0)return[];let s=new Map;for(let u of i)if(Array.isArray(u))for(let o of u){let a=A(o)?d(o,r):void 0;if(a!==void 0){let f=s.get(a);s.set(a,f?{...f,...o}:o)}}return Array.from(s.values())}function Ce(e,t,n){if(!Array.isArray(e)||t===n)return e?[...e]:[];let r=[...e],[i]=r.splice(t,1);return r.splice(n,0,i),r}function Me(e,t){if(!Array.isArray(e)||e.length===0||t===0)return e?[...e]:[];let n=e.length,r=(t%n+n)%n;return[...e.slice(-r),...e.slice(0,-r)]}function Ue(e,t,...n){if(!Array.isArray(e))return n;let r=[...e];return r.splice(t,0,...n),r}function Ee(e,t,n=1){if(!Array.isArray(e))return[];let r=[...e];return r.splice(t,n),r}function We(e,t,n){if(!Array.isArray(e))return[];let r=[...e];return r[t]=n,r}function qe(e,t){if(!Array.isArray(e))return[];let n=e.filter(r=>r!=null);return t?n.filter(t):n}function Be(...e){return e.length===0?[[]]:e.length===1?e[0].map(t=>[t]):e.reduce((t,n)=>t.flatMap(r=>n.map(i=>[...r,i])),[[]])}function Ne(e,t){if(!Array.isArray(e))return[];let n=[];for(let r=0;r<e.length;r++)t(e[r],r)&&n.push(r);return n}function Le(e,t,n=!0){if(!Array.isArray(e)||!Array.isArray(t)||e.length!==t.length)return!1;for(let r=0;r<e.length;r++)if(n&&A(e[r])&&A(t[r])){if(JSON.stringify(e[r])!==JSON.stringify(t[r]))return!1}else if(e[r]!==t[r])return!1;return!0}function _e(e,t){if(!Array.isArray(e)||e.length===0)return[];let n=[],r=[e[0]],i=t(e[0],0);for(let s=1;s<e.length;s++){let u=t(e[s],s);u===i?r.push(e[s]):(n.push(r),r=[e[s]],i=u)}return n.push(r),n}function ze(e,t,n,r){if(!Array.isArray(e))return[];let i=typeof t=="function",s=i?n:r;return e.map(u=>{let o=!1;return i?o=t(u):o=(A(u)?d(u,t):u)===n,o?{...u,...s}:u})}function Je(e,t){if(!Array.isArray(e))return{unique:[],duplicates:[]};let n=new Set,r=[],i=[];for(let s of e){let u=t&&A(s)?d(s,t):s;n.has(u)?i.push(s):(n.add(u),r.push(s))}return{unique:r,duplicates:i}}function M(e){return Array.isArray(e)?e:e==null?[]:[e]}function De(e){return M(e)}function Qe(e,t,n=1){if(!Array.isArray(e)||t<1||n<1)return[];let r=[];for(let i=0;i<=e.length-t;i+=n)r.push(e.slice(i,i+t));return r}function Ze(e,t){if(!Array.isArray(e)||e.length===0)return;let n=e[0],r=typeof t=="function"?t(n):d(n,t);for(let i=1;i<e.length;i++){let s=e[i],u=typeof t=="function"?t(s):d(s,t);u<r&&(r=u,n=s)}return n}function Ge(e,t){if(!Array.isArray(e)||e.length===0)return;let n=e[0],r=typeof t=="function"?t(n):d(n,t);for(let i=1;i<e.length;i++){let s=e[i],u=typeof t=="function"?t(s):d(s,t);u>r&&(r=u,n=s)}return n}function U(e,t){if(!Array.isArray(e)||e.length===0)return 0;let n=0;for(let r of e){let i=typeof t=="function"?t(r):d(r,t);typeof i=="number"&&!isNaN(i)&&(n+=i)}return n}function He(e,t){return!Array.isArray(e)||e.length===0?0:U(e,t)/e.length}function w(e){let t=new Map;if(!Array.isArray(e))return t;for(let n of e)t.set(n,(t.get(n)||0)+1);return t}function E(e,t=1){if(!Array.isArray(e)||e.length===0||t<1)return[];let n=w(e);return Array.from(n.entries()).sort((i,s)=>s[1]-i[1]).slice(0,t).map(([i])=>i)}function Xe(e,t=1){if(!Array.isArray(e)||e.length===0||t<1)return[];let n=w(e);return Array.from(n.entries()).sort((i,s)=>i[1]-s[1]).slice(0,t).map(([i])=>i)}async function Ye(e,t,n){if(!Array.isArray(e)||t<1)return;let r=v(e,t);for(let i=0;i<r.length;i++)await n(r[i],i)}async function en(e,t,n,r){if(!Array.isArray(e)||t<1||n<1)return;let i=v(e,t),s=v(i.map((u,o)=>({batch:u,index:o})),n);for(let u of s)await Promise.all(u.map(({batch:o,index:a})=>r(o,a)))}function nn(e){if(!Array.isArray(e)||e.length===0)return[];let t=Math.max(...e.map(r=>r.length)),n=[];for(let r=0;r<t;r++){let i=[];for(let s=0;s<e.length;s++)r<e[s].length&&i.push(e[s][r]);n.push(i)}return n}function tn(e,t){if(!Array.isArray(e)||!Array.isArray(t)||e.length!==t.length)return!1;for(let n=0;n<e.length;n++)if(e[n]!==t[n])return!1;return!0}function rn(e,t){if(!Array.isArray(e)||!Array.isArray(t)||e.length!==t.length)return!1;let n=w(e),r=w(t);if(n.size!==r.size)return!1;for(let[i,s]of n)if(r.get(i)!==s)return!1;return!0}function W(e,t){if(!Array.isArray(e)||!Array.isArray(t))return!1;let n=new Set(t);return e.every(r=>n.has(r))}function sn(e,t){return W(t,e)}function on(...e){if(e.length===0)return[];let t=Math.max(...e.map(r=>r.length)),n=[];for(let r=0;r<t;r++)for(let i of e)r<i.length&&n.push(i[r]);return n}function un(e,t){let n=[],r=[];if(!Array.isArray(e))return{pass:n,fail:r};for(let i=0;i<e.length;i++)t(e[i],i)?n.push(e[i]):r.push(e[i]);return{pass:n,fail:r}}function an(e,t){if(e<0)return[];let n=[];for(let r=0;r<e;r++)n.push(t(r));return n}function fn(e,t){if(!Array.isArray(e)||t<0)return[];let n=[];for(let r=0;r<t;r++)n.push(...e);return n}function ln(e){if(!Array.isArray(e)||e.length===0)return;let t=[...e].sort((r,i)=>r-i),n=Math.floor(t.length/2);return t.length%2===0?(t[n-1]+t[n])/2:t[n]}function cn(e){let t=E(e,1);return t.length>0?t[0]:void 0}function yn(e,...t){if(!Array.isArray(e))return[];let n=new Set(t);return e.filter(r=>!n.has(r))}function pn(e,...t){if(!Array.isArray(e))return[];let n=new Set(t.flat());return e.filter(r=>!n.has(r))}function dn(e){if(!Array.isArray(e)||e.length===0)return[];let t=[],n=[e[0]];for(let r=1;r<e.length;r++)e[r]===e[r-1]?n.push(e[r]):(t.push(n),n=[e[r]]);return t.push(n),t}function Tn(e){if(!Array.isArray(e)||e.length===0)return[];let t=[e[0]];for(let n=1;n<e.length;n++)e[n]!==e[n-1]&&t.push(e[n]);return t}function An(e,t="standard"){if(!Array.isArray(e)||e.length===0)return[];let n=e.map((i,s)=>({value:i,index:s}));n.sort((i,s)=>i.value-s.value);let r=new Array(e.length);if(t==="ordinal")for(let i=0;i<n.length;i++)r[n[i].index]=i+1;else if(t==="dense"){let i=1;r[n[0].index]=i;for(let s=1;s<n.length;s++)n[s].value!==n[s-1].value&&i++,r[n[s].index]=i}else{let i=0;for(;i<n.length;){let s=i;for(;s<n.length&&n[s].value===n[i].value;)s++;let u=i+1;for(let o=i;o<s;o++)r[n[o].index]=u;i=s}}return r}function P(e,t){if(!Array.isArray(e)||e.length===0||t<0||t>100)return;let n=[...e].sort((o,a)=>o-a),r=t/100*(n.length-1),i=Math.floor(r),s=Math.ceil(r),u=r-i;return i===s?n[i]:n[i]*(1-u)+n[s]*u}function gn(e){if(!Array.isArray(e)||e.length===0)return;let t=P(e,25),n=P(e,50),r=P(e,75);return{q1:t,q2:n,q3:r,iqr:r-t}}function j(e,t=!1){if(!Array.isArray(e)||e.length===0||t&&e.length===1)return;let n=e.reduce((s,u)=>s+u,0)/e.length,i=e.map(s=>Math.pow(s-n,2)).reduce((s,u)=>s+u,0)/(t?e.length-1:e.length);return Math.sqrt(i)}function mn(e,t=!1){let n=j(e,t);return n!==void 0?Math.pow(n,2):void 0}function xn(e){if(!Array.isArray(e)||e.length===0)return[];let t=Math.min(...e),r=Math.max(...e)-t;return r===0?e.map(()=>0):e.map(i=>(i-t)/r)}function hn(e){if(!Array.isArray(e)||e.length===0)return[];let t=e.reduce((r,i)=>r+i,0)/e.length,n=j(e);return n===void 0||n===0?e.map(()=>0):e.map(r=>(r-t)/n)}function q(e,t,n){if(!Array.isArray(e))return[];let r=[],i=n;for(let s=0;s<e.length;s++)i=t(i,e[s],s),r.push(i);return r}function bn(e){return q(e,(t,n)=>t+n,0)}function Sn(e){if(!Array.isArray(e)||e.length<2)return[];let t=[];for(let n=1;n<e.length;n++)t.push(e[n]-e[n-1]);return t}function Kn(e,t,n,r="end"){if(!Array.isArray(e)||t<=e.length)return[...e];let i=new Array(t-e.length).fill(n);return r==="start"?[...i,...e]:[...e,...i]}function wn(e,t){if(!Array.isArray(e)||e.length===0)return[];let n=0,r=e.length-1;for(;n<=r&&t(e[n]);)n++;for(;r>=n&&t(e[r]);)r--;return e.slice(n,r+1)}function vn(e){if(!Array.isArray(e)||e.length<2)return[];let t=[];for(let n=0;n<e.length-1;n++)t.push([e[n],e[n+1]]);return t}function On(e){return Array.isArray(e)?e.map((t,n)=>[n,t]):[]}function Pn(e,t){return Array.isArray(e)?e.map((n,r)=>{let i=t[r%t.length];return i(n)}):[]}function B(e,t=1){if(!Array.isArray(e)||e.length===0)return[];let n=e.length,r=(t%n+n)%n;return[...e.slice(r),...e.slice(0,r)]}function In(e,t=1){return B(e,-t)}function Fn(e,t,n){if(!Array.isArray(e)||t<0||n<0||t>=e.length||n>=e.length)return[...e];let r=[...e];return[r[t],r[n]]=[r[n],r[t]],r}function jn(e,t,n){if(!Array.isArray(e)||t<0||n>=e.length||t>=n)return[...e];let r=[...e],i=r.slice(t,n+1).reverse();return r.splice(t,n-t+1,...i),r}function kn(e,t){if(!Array.isArray(e)||e.length<=1)return!0;let n=t||((r,i)=>r<i?-1:r>i?1:0);for(let r=1;r<e.length;r++)if(n(e[r-1],e[r])>0)return!1;return!0}function Vn(e){return Array.isArray(e)?new Set(e).size!==e.length:!1}function Rn(e,t){return Array.isArray(e)?e.map(n=>{let r={};for(let i of t)i in n&&(r[i]=n[i]);return r}):[]}function N(e,t,n){if(!Array.isArray(e))return{};let r={};for(let i=0;i<e.length;i++){let s=t(e[i],i),u=n?n(e[i],i):e[i];r[s]=u}return r}async function $n(e,t){if(!Array.isArray(e))return[];let n=[];for(let r=0;r<e.length;r++)n.push(await t(e[r],r));return n}async function Cn(e,t){return Array.isArray(e)?Promise.all(e.map((n,r)=>t(n,r))):[]}async function Mn(e,t){if(!Array.isArray(e))return[];let n=[];for(let r=0;r<e.length;r++)await t(e[r],r)&&n.push(e[r]);return n}async function Un(e,t,n){if(!Array.isArray(e))return n;let r=n;for(let i=0;i<e.length;i++)r=await t(r,e[i],i);return r}async function En(e,t){if(Array.isArray(e)){for(let n=0;n<e.length;n++)if(await t(e[n],n))return e[n]}}async function Wn(e,t){if(!Array.isArray(e))return!1;for(let n=0;n<e.length;n++)if(await t(e[n],n))return!0;return!1}async function qn(e,t){if(!Array.isArray(e))return!0;for(let n=0;n<e.length;n++)if(!await t(e[n],n))return!1;return!0}function Bn(e,t,n){if(!Array.isArray(e)||e.length===0)return 0;let r=0,i=0;for(let s of e){let u=typeof t=="function"?t(s):d(s,t),o=typeof n=="function"?n(s):d(s,n);typeof u=="number"&&typeof o=="number"&&(i+=u*o,r+=o)}return r===0?0:i/r}function Nn(e,t,n=1){if(!Array.isArray(e)||e.length===0||n<1)return[];let r=[],i=0;for(let u of e){let o=typeof t=="function"?t(u):d(u,t);i+=typeof o=="number"&&o>0?o:0,r.push(i)}if(i===0)return[];let s=[];for(let u=0;u<n;u++){let o=Math.random()*i,a=r.findIndex(f=>o<f);a!==-1&&s.push(e[a])}return s}function Ln(e,t){if(!Array.isArray(e)||!Array.isArray(t))return[];let n=[],r=0;for(let i of t){if(r>=e.length)break;n.push(e.slice(r,r+i)),r+=i}return n}function _n(e,t){if(!Array.isArray(e)||t<1)return[];let n=w(e),r=[];for(let i of e)n.get(i)===t&&r.push(i);return r}function zn(e,t,n){if(!Array.isArray(e)||t<1)return[];let r=[],i=0,s=[];for(let u of e)n(u)?(i++,s.push(u),i>=t&&r.push(...s.splice(0,s.length-t+1))):(i=0,s.length=0);return i>=t&&r.push(...s),r}function Jn(e,t,n){if(!Array.isArray(e))return[];let r=[],i=n;for(let s=0;s<e.length;s++){let{value:u,newContext:o}=t(e[s],i,s);r.push(u),i=o}return r}function Dn(e,t){return v(e,t)}function Qn(e,t,n){if(!Array.isArray(e)||!Array.isArray(t))return[];let r=Math.min(e.length,t.length),i=[];for(let s=0;s<r;s++)i.push(n(e[s],t[s]));return i}function Zn(e,t,n="last"){if(!Array.isArray(e)||e.length===0)return[];let r=new Map;for(let s of e)if(Array.isArray(s))for(let u of s){let o=d(u,t);if(n==="first")r.has(o)||r.set(o,u);else if(n==="last")r.set(o,u);else if(n==="concat"){let a=r.get(o);Array.isArray(a)?a.push(u):a?r.set(o,[a,u]):r.set(o,u)}else if(typeof n=="function"){let a=r.get(o);a&&!Array.isArray(a)?r.set(o,n(a,u)):r.set(o,u)}}let i=[];for(let s of r.values())Array.isArray(s)&&n==="concat"?i.push(...s):Array.isArray(s)||i.push(s);return i}function Gn(e,t){return N(e,n=>String(d(n,t)))}function Hn(e,t,n){if(!Array.isArray(e)||e.length===0)return-1;let r=n||((u,o)=>u<o?-1:u>o?1:0),i=0,s=e.length-1;for(;i<=s;){let u=Math.floor((i+s)/2),o=r(e[u],t);if(o===0)return u;o<0?i=u+1:s=u-1}return-1}function Xn(e,t,n){if(!Array.isArray(e))return[t];let r=n||((u,o)=>u<o?-1:u>o?1:0),i=[...e],s=0;for(;s<i.length&&r(i[s],t)<0;)s++;return i.splice(s,0,t),i}export{Pn as applyByIndex,He as avgBy,Dn as batch,Ye as batchProcess,en as batchProcessParallel,un as bifurcate,Hn as binarySearch,Be as cartesian,v as chunk,_e as chunkBy,xe as compact,ue as countBy,bn as cumulativeSum,Tn as dedupeConsecutive,Re as deepCloneArray,Sn as diff,le as difference,pn as differenceWith,ge as drop,me as dropWhile,M as ensureArray,On as enumerate,qn as everyAsync,Ve as fill,Mn as filterAsync,qe as filterCompact,zn as filterConsecutive,Ne as findAllIndices,En as findAsync,we as findIndex,ve as findLastIndex,Fe as flatMap,se as flatten,$ as flattenDeep,w as frequencies,an as generate,oe as groupBy,dn as groupConsecutive,Vn as hasDuplicates,rn as hasSameElements,Gn as indexBy,Ue as insert,Xn as insertSorted,on as interleave,ce as intersection,tn as isArrayEqual,Le as isEqual,kn as isSorted,W as isSubset,sn as isSuperset,ae as keyBy,Xe as leastCommon,$n as mapAsync,Cn as mapAsyncParallel,Jn as mapWithContext,Ge as maxBy,ln as median,Zn as mergeArraysByKey,$e as mergeByKey,Ze as minBy,cn as mode,E as mostCommon,Ce as move,xn as normalize,Ie as omit,Kn as pad,vn as pairwise,pe as partition,P as percentile,Pe as pick,Rn as pickMany,Oe as pluck,gn as quartiles,ke as range,An as rank,Un as reduceAsync,je as reduceRight,Ee as remove,fn as repeat,We as replace,jn as reverseSegment,Me as rotate,B as rotateLeft,In as rotateRight,Se as sample,Ke as sampleSize,q as scan,Ln as segment,_n as selectByCount,C as shuffle,Qe as slidingWindow,Wn as someAsync,fe as sortBy,Je as splitDuplicates,j as standardDeviation,hn as standardize,U as sumBy,Fn as swap,de as take,Te as takeLast,Ae as takeWhile,N as toObject,nn as transpose,wn as trim,ye as union,O as unique,be as unzip,ze as updateBy,mn as variance,Bn as weightedAverage,Nn as weightedSample,yn as without,De as wrap,he as zip,Qn as zipWith};
+// src/lib/object/utils.ts
+var isObject = (value) => {
+  if (value == null) return false;
+  if (Array.isArray(value)) return false;
+  if (typeof value === "function") return false;
+  if (value instanceof Date) return false;
+  if (value instanceof RegExp) return false;
+  if (value instanceof Map) return false;
+  if (value instanceof Set) return false;
+  if (value instanceof Error) return false;
+  return typeof value === "object";
+};
+var traverseStructure = (current, segments, depth, maxDepth) => {
+  if (depth > maxDepth) return void 0;
+  if (segments.length === 0) return current;
+  const segment2 = segments[0];
+  const remaining = segments.slice(1);
+  if (segment2.type === "descendant") {
+    const result = traverseStructure(current, remaining, depth + 1, maxDepth);
+    if (result !== void 0) {
+      return result;
+    }
+    if (current && typeof current === "object") {
+      if (Array.isArray(current)) {
+        const arrResult = [];
+        for (let i = 0; i < current.length; i++) {
+          const itemResult = traverseStructure(
+            current[i],
+            segments,
+            depth + 1,
+            maxDepth
+          );
+          if (itemResult !== void 0) {
+            arrResult[i] = itemResult;
+          }
+        }
+        return arrResult.length > 0 ? arrResult : void 0;
+      } else {
+        const objResult = {};
+        for (const key in current) {
+          if (current.hasOwnProperty(key)) {
+            const itemResult = traverseStructure(
+              current[key],
+              segments,
+              depth + 1,
+              maxDepth
+            );
+            if (itemResult !== void 0) {
+              objResult[key] = itemResult;
+            }
+          }
+        }
+        return Object.keys(objResult).length > 0 ? objResult : void 0;
+      }
+    }
+    return void 0;
+  }
+  switch (segment2.type) {
+    case "property":
+      if (isObject(current) && segment2.value && String(segment2.value) in current) {
+        const next = current[String(segment2.value)];
+        const result = traverseStructure(next, remaining, depth + 1, maxDepth);
+        if (result !== void 0) {
+          return { [String(segment2.value)]: result };
+        }
+      }
+      break;
+    case "index":
+      if (Array.isArray(current)) {
+        const index = segment2.value;
+        if (index >= 0 && index < current.length) {
+          const result = traverseStructure(
+            current[index],
+            remaining,
+            depth + 1,
+            maxDepth
+          );
+          if (result !== void 0) {
+            const arr = new Array(current.length).filter(
+              (a) => a !== void 0
+            );
+            arr[index] = result;
+            return arr;
+          }
+        }
+      } else if (current && typeof current === "object") {
+        const key = String(segment2.value);
+        if (key in current) {
+          const result = traverseStructure(
+            current[key],
+            remaining,
+            depth + 1,
+            maxDepth
+          );
+          if (result !== void 0) {
+            return { [key]: result };
+          }
+        }
+      }
+      break;
+    case "wildcard":
+      if (current && typeof current === "object") {
+        if (Array.isArray(current)) {
+          const arrResult = [];
+          let hasResults = false;
+          for (let i = 0; i < current.length; i++) {
+            const result = traverseStructure(
+              current[i],
+              remaining,
+              depth + 1,
+              maxDepth
+            );
+            if (result !== void 0) {
+              arrResult[i] = result;
+              hasResults = true;
+            }
+          }
+          return hasResults ? arrResult : void 0;
+        } else {
+          const objResult = {};
+          let hasResults = false;
+          for (const key in current) {
+            if (current.hasOwnProperty(key)) {
+              const result = traverseStructure(
+                current[key],
+                remaining,
+                depth + 1,
+                maxDepth
+              );
+              if (result !== void 0) {
+                objResult[key] = result;
+                hasResults = true;
+              }
+            }
+          }
+          return hasResults ? objResult : void 0;
+        }
+      }
+      break;
+    case "slice":
+      if (Array.isArray(current)) {
+        const [start, end] = segment2.value;
+        const actualStart = Math.max(0, start);
+        const actualEnd = Math.min(
+          current.length,
+          end === Infinity ? current.length : end
+        );
+        const arrResult = [];
+        let hasResults = false;
+        for (let i = actualStart; i < actualEnd; i++) {
+          const result = traverseStructure(
+            current[i],
+            remaining,
+            depth + 1,
+            maxDepth
+          );
+          if (result !== void 0) {
+            arrResult[i] = result;
+            hasResults = true;
+          }
+        }
+        return hasResults ? arrResult : void 0;
+      }
+      break;
+    case "union":
+      if (Array.isArray(current)) {
+        const indices = segment2.value;
+        const arrResult = [];
+        let hasResults = false;
+        for (const index of indices) {
+          if (index >= 0 && index < current.length) {
+            const result = traverseStructure(
+              current[index],
+              remaining,
+              depth + 1,
+              maxDepth
+            );
+            if (result !== void 0) {
+              arrResult[index] = result;
+              hasResults = true;
+            }
+          }
+        }
+        return hasResults ? arrResult : void 0;
+      }
+      break;
+    case "filter":
+      if (Array.isArray(current)) {
+        const filterFn = segment2.value;
+        const arrResult = [];
+        let hasResults = false;
+        for (let i = 0; i < current.length; i++) {
+          if (filterFn(current[i])) {
+            const result = traverseStructure(
+              current[i],
+              remaining,
+              depth + 1,
+              maxDepth
+            );
+            if (result !== void 0) {
+              arrResult[i] = result;
+              hasResults = true;
+            }
+          }
+        }
+        return hasResults ? arrResult : void 0;
+      }
+      break;
+  }
+  return void 0;
+};
+
+// src/lib/object/clone.ts
+var deepClone = (obj, skipKeys) => {
+  if (obj == null || typeof obj !== "object") {
+    return obj;
+  }
+  if (obj instanceof Date) {
+    return new Date(obj.getTime());
+  }
+  if (obj instanceof RegExp) {
+    return new RegExp(obj.source, obj.flags);
+  }
+  if (obj instanceof Map) {
+    const clone = /* @__PURE__ */ new Map();
+    obj.forEach((value, key) => {
+      if (!skipKeys || !skipKeys.some((k) => k.toString() === key.toString())) {
+        clone.set(key, deepClone(value));
+      }
+    });
+    return clone;
+  }
+  if (obj instanceof Set) {
+    const clone = /* @__PURE__ */ new Set();
+    obj.forEach((value) => {
+      clone.add(deepClone(value));
+    });
+    return clone;
+  }
+  if (Array.isArray(obj)) {
+    return Array.from(obj).map((item) => deepClone(item));
+  }
+  if (isObject(obj)) {
+    const clone = {};
+    for (const key in obj) {
+      if (Object.prototype.hasOwnProperty.call(obj, key)) {
+        if (!skipKeys || !skipKeys.some((k) => k.toString() === key.toString())) {
+          clone[key] = deepClone(obj[key]);
+        }
+      }
+    }
+    const symbols = Object.getOwnPropertySymbols(obj);
+    for (const symbol of symbols) {
+      if (!skipKeys || !skipKeys.some((s) => s.toString() === symbol.toString())) {
+        clone[symbol] = deepClone(obj[symbol]);
+      }
+    }
+    return clone;
+  }
+  return obj;
+};
+
+// src/lib/object/selector.ts
+var parseSelector = (selector, options = {}) => {
+  const { type = "auto", throwOnError = false } = options;
+  if (!selector || typeof selector !== "string") {
+    return [];
+  }
+  const segments = [];
+  let current = "";
+  let inBrackets = false;
+  let inQuotes = false;
+  let quoteChar = "";
+  let bracketContent = "";
+  let bracketDepth = 0;
+  const detectType = (str) => {
+    if (str.includes("..")) return "descendant";
+    if (str.includes("[?(")) return "filter";
+    if (str.includes("[:") || str.includes("[0:")) return "slice";
+    if (str.includes("[,") || str.includes("[0,1]")) return "union";
+    if (str.includes("[*]") || str.includes(".*.")) return "wildcard";
+    if (str.includes("[]")) return "array-wildcard";
+    if (str.includes("[") && str.includes("]")) return "bracket";
+    return "dot";
+  };
+  const actualType = type === "auto" ? detectType(selector) : type;
+  const parseBracketContent = (content) => {
+    const trimmed = content.trim();
+    if (trimmed === "*" || trimmed === "") {
+      return {
+        type: "wildcard",
+        value: trimmed === "" ? "[]" : "*",
+        raw: trimmed === "" ? "[]" : content
+      };
+    }
+    if (trimmed === "[]") {
+      return { type: "wildcard", value: "[]", raw: content };
+    }
+    if (/^-?\d+$/.test(trimmed)) {
+      return { type: "index", value: parseInt(trimmed, 10), raw: content };
+    }
+    if (trimmed.includes(":")) {
+      const parts = trimmed.split(":").map((p) => p.trim());
+      const start = parts[0] === "" ? 0 : parseInt(parts[0], 10);
+      const end = parts[1] === "" ? Infinity : parseInt(parts[1], 10);
+      if (isNaN(start) || isNaN(end)) {
+        if (throwOnError) throw new Error(`Invalid slice notation: ${content}`);
+        return { type: "wildcard", value: "*", raw: content };
+      }
+      return { type: "slice", value: [start, end], raw: content };
+    }
+    if (trimmed.includes(",")) {
+      const indices = trimmed.split(",").map((p) => {
+        const num = parseInt(p.trim(), 10);
+        return isNaN(num) ? -1 : num;
+      }).filter((n) => n >= 0);
+      if (indices.length === 0) {
+        if (throwOnError) throw new Error(`Invalid union notation: ${content}`);
+        return { type: "wildcard", value: "*", raw: content };
+      }
+      return { type: "union", value: indices, raw: content };
+    }
+    if (trimmed.startsWith("?(") && trimmed.endsWith(")")) {
+      const expr = trimmed.slice(2, -1);
+      try {
+        const filterFn = createFilterFunction(expr);
+        return { type: "filter", value: filterFn, raw: content };
+      } catch (error) {
+        if (throwOnError) throw error;
+        return { type: "wildcard", value: "*", raw: content };
+      }
+    }
+    if (trimmed.startsWith('"') && trimmed.endsWith('"') || trimmed.startsWith("'") && trimmed.endsWith("'")) {
+      return { type: "property", value: trimmed.slice(1, -1), raw: content };
+    }
+    return { type: "property", value: trimmed, raw: content };
+  };
+  for (let i = 0; i < selector.length; i++) {
+    const char = selector[i];
+    const nextChar = selector[i + 1];
+    if ((char === '"' || char === "'") && !inQuotes) {
+      inQuotes = true;
+      quoteChar = char;
+      continue;
+    } else if (char === quoteChar && inQuotes) {
+      inQuotes = false;
+      quoteChar = "";
+      if (!(char === '"' || char === "'")) {
+        if (inBrackets) {
+          bracketContent += char;
+        } else {
+          current += char;
+        }
+      }
+      continue;
+    }
+    if (inQuotes) {
+      if (inBrackets) {
+        bracketContent += char;
+      } else {
+        current += char;
+      }
+      continue;
+    }
+    if (char === "[" && !inBrackets) {
+      if (current) {
+        segments.push({ type: "property", value: current, raw: current });
+        current = "";
+      }
+      inBrackets = true;
+      bracketContent = "";
+      continue;
+    }
+    if (char === "]" && inBrackets && !inQuotes) {
+      inBrackets = false;
+      const segment2 = parseBracketContent(bracketContent);
+      segments.push(segment2);
+      continue;
+    }
+    let lastDot = segments.length > 0 ? segments[segments.length - 1] : null;
+    if (char === "." && !inBrackets && !inQuotes) {
+      if (nextChar === ".") {
+        const l = selector.split("..")[0];
+        segments.push({ type: "property", value: l, raw: l });
+        segments.push({ type: "descendant", value: "..", raw: ".." });
+        i++;
+      } else if (current) {
+        if (current === "*") {
+          segments.push({ type: "wildcard", value: current, raw: current });
+        } else {
+          segments.push({ type: "property", value: current, raw: current });
+        }
+        current = "";
+      }
+      continue;
+    }
+    if (inBrackets) {
+      bracketContent += char;
+    } else {
+      if (lastDot && lastDot.type !== "descendant") {
+        current += char;
+      } else {
+        const l = selector.split(lastDot?.raw)[1];
+        if (l !== void 0) {
+          current = l;
+        } else {
+          current += char;
+        }
+      }
+    }
+  }
+  if (current) {
+    segments.push({ type: "property", value: current, raw: current });
+  }
+  return segments.map((segment2) => {
+    if (segment2.type === "property" && typeof segment2.value === "string") {
+      if (/^-?\d+$/.test(segment2.value)) {
+        const num = parseInt(segment2.value, 10);
+        if (!isNaN(num)) {
+          return { ...segment2, type: "index", value: num };
+        }
+      }
+    }
+    return segment2;
+  });
+};
+var createFilterFunction = (expr) => {
+  const safeExpr = expr.replace(/@\.([a-zA-Z_$][\w$]*)/g, (_, prop) => `item.${prop}`).replace(/@/g, "item");
+  try {
+    return new Function("item", `return ${safeExpr}`);
+  } catch (error) {
+    throw new Error(`Invalid filter expression: ${expr}`);
+  }
+};
+
+// src/lib/object/merge.ts
+var mergeIntoStructure = (target, selector, value) => {
+  const segments = parseSelector(selector);
+  let current = target;
+  for (let i = 0; i < segments.length; i++) {
+    const segment2 = segments[i];
+    const isLast = i === segments.length - 1;
+    switch (segment2.type) {
+      case "property":
+        if (isLast) {
+          current[String(segment2.value)] = value;
+        } else {
+          if (!current[String(segment2.value)]) {
+            const nextSegment = segments[i + 1];
+            current[String(segment2.value)] = nextSegment.type === "index" || nextSegment.type === "slice" || nextSegment.type === "union" || nextSegment.type === "wildcard" ? [] : {};
+          }
+          current = current[String(segment2.value)];
+        }
+        break;
+      case "index":
+        if (!Array.isArray(current)) {
+          current = [];
+        }
+        const index = segment2.value;
+        if (isLast) {
+          if (index >= current.length) {
+            for (let j = current.length; j <= index; j++) {
+              current.push(void 0);
+            }
+          }
+          current[index] = value;
+        } else {
+          if (!current[index]) {
+            const nextSegment = segments[i + 1];
+            current[index] = nextSegment.type === "index" || nextSegment.type === "slice" || nextSegment.type === "union" || nextSegment.type === "wildcard" ? [] : {};
+          }
+          current = current[index];
+        }
+        break;
+      case "wildcard":
+        if (Array.isArray(current)) {
+          if (isLast) {
+            for (let j = 0; j < current.length; j++) {
+              current[j] = value;
+            }
+          } else {
+            const nextSegment = segments[i + 1];
+            for (let j = 0; j < current.length; j++) {
+              if (!current[j]) {
+                current[j] = nextSegment.type === "index" || nextSegment.type === "slice" || nextSegment.type === "union" || nextSegment.type === "wildcard" ? [] : {};
+              }
+            }
+            if (current.length > 0) {
+              current = current[0];
+            }
+          }
+        }
+        break;
+    }
+  }
+};
+
+// src/lib/object/getter-setter.ts
+function get(obj, selector, options = {}) {
+  const {
+    preserveStructure,
+    multiple,
+    throwOnError = false,
+    defaultValue,
+    maxDepth = 20
+  } = options;
+  if (!obj || typeof obj !== "object") {
+    return defaultValue;
+  }
+  if (!selector) {
+    return obj;
+  }
+  if (Array.isArray(selector)) {
+    if (preserveStructure) {
+      const result2 = {};
+      for (const sel of selector) {
+        const value = get(obj, sel, { ...options, preserveStructure: false });
+        if (value !== void 0) {
+          mergeIntoStructure(result2, sel, value);
+        }
+      }
+      return result2;
+    } else {
+      return selector.map(
+        (sel) => get(obj, sel, { ...options, preserveStructure: false })
+      );
+    }
+  }
+  const segments = parseSelector(selector, { ...options, throwOnError });
+  if (segments.length === 0) {
+    return obj;
+  }
+  if (typeof preserveStructure === "undefined" || preserveStructure === false) {
+    const v = ValueOfKey(obj, selector);
+    if (multiple === false && Array.isArray(v)) {
+      return v[0];
+    }
+    if (v === void 0 && defaultValue !== void 0) {
+      return defaultValue;
+    }
+    return v;
+  }
+  const result = traverseStructure(obj, segments, 0, maxDepth);
+  if (result === void 0 && defaultValue !== void 0) {
+    return defaultValue;
+  }
+  return result;
+}
+function ValueOfKey(obj, selector, options = {}) {
+  const { createMissing = false, add = false, debug = false } = options;
+  const segments = parseSelector(selector);
+  let current = obj;
+  let updateEvenIfNotlast = false;
+  let chained_property = "";
+  const stringify = selector;
+  if (typeof current === "object" && !Array.isArray(current) && stringify.length > 0) {
+    if (current[stringify]) {
+      current = current[stringify];
+      return current;
+    }
+  }
+  for (let i = 0; i < segments.length; i++) {
+    const segment2 = segments[i];
+    const isLast = segments.length > 1 ? i === segments.length - 1 : false;
+    if (current === null && !createMissing) {
+      return void 0;
+    }
+    const nextSegment = segments[i + 1];
+    switch (segment2.type) {
+      case "property":
+        if (current && typeof current === "object") {
+          if (Array.isArray(current)) {
+            if (typeof segment2.value === "number") {
+              const index = segment2.value;
+              if (createMissing && index >= current.length) {
+                for (let j = current.length; j <= index; j++) {
+                  current.push(void 0);
+                }
+              }
+              if (createMissing && (current[index] === null || current[index] === void 0) && (!isLast || updateEvenIfNotlast)) {
+                if (nextSegment) {
+                  current[index] = nextSegment.type === "index" || nextSegment.type === "slice" || nextSegment.type === "union" || nextSegment.type === "wildcard" ? [] : {};
+                } else {
+                  current[index] = null;
+                }
+                updateEvenIfNotlast = false;
+              }
+              current = current[index];
+              if (nextSegment) {
+                updateEvenIfNotlast = true;
+                continue;
+              }
+            } else if (add) {
+              current.push({
+                [String(segment2.value)]: null
+              });
+            } else {
+              current = current.map((item) => item[String(segment2.value)]);
+            }
+            if (nextSegment) {
+              continue;
+            }
+            return filterDefined(current);
+          } else {
+            if (current[chained_property] && chained_property.split(".").length >= 2) {
+              current = current[chained_property];
+              continue;
+            }
+            if (createMissing && (current[String(segment2.value)] === null || current[String(segment2.value)] === void 0) && (!isLast || updateEvenIfNotlast)) {
+              if (nextSegment) {
+                current[String(segment2.value)] = nextSegment.type === "index" || nextSegment.type === "slice" || nextSegment.type === "union" || nextSegment.type === "wildcard" ? [] : {};
+              } else {
+                current[String(segment2.value)] = null;
+              }
+              updateEvenIfNotlast = false;
+              current = current[String(segment2.value)];
+              if (nextSegment) {
+                updateEvenIfNotlast = true;
+                continue;
+              }
+            }
+            if (!current) {
+              current = { [String(segment2.value)]: null };
+            } else {
+              if (!current[String(segment2.value)] && createMissing) {
+                current[String(segment2.value)] = null;
+              }
+              current = current[String(segment2.value)];
+            }
+            if (nextSegment) {
+              continue;
+            }
+          }
+        } else if (createMissing) {
+          current = {};
+          current[String(segment2.value)] = nextSegment.type === "index" || nextSegment.type === "slice" || nextSegment.type === "union" || nextSegment.type === "wildcard" || options.type === "array" ? [] : {};
+          current = current[String(segment2.value)];
+        } else {
+          return void 0;
+        }
+        break;
+      case "index":
+      case "wildcard":
+        if (Array.isArray(current)) {
+          if (segment2.type === "index") {
+            const index = segment2.value;
+            if (index < 0) {
+              current = current[current.length - Math.abs(index)];
+              continue;
+            }
+            if (createMissing && (index >= current.length || current[index] == null || current[index] == void 0) && !isLast) {
+              for (let j = current.length; j <= index; j++) {
+                current.push(void 0);
+              }
+              if (nextSegment) {
+                current[index] = nextSegment.type === "index" || nextSegment.type === "slice" || nextSegment.type === "union" || nextSegment.type === "wildcard" ? [] : {};
+              }
+            }
+            current = current[index];
+          } else {
+            if (!isLast) {
+              continue;
+            }
+          }
+        } else if (createMissing) {
+          const nextSegment2 = segments[i + 1];
+          current = [];
+          const index = segment2.value;
+          for (let j = 0; j <= index; j++) {
+            current.push(void 0);
+          }
+          current[index] = nextSegment2.type === "index" || nextSegment2.type === "slice" || nextSegment2.type === "union" || nextSegment2.type === "wildcard" || options.type === "array" ? [] : {};
+          current = current[index];
+        } else {
+          if (segment2.type === "index" && typeof current === "object") {
+            if (current && current[String(segment2.value)] !== void 0) {
+              current = current[String(segment2.value)];
+              continue;
+            }
+          }
+          if (typeof current === "object") {
+            const values = Object.values(current);
+            current = values;
+            continue;
+          }
+          return void 0;
+        }
+        break;
+      default:
+        return void 0;
+    }
+  }
+  return filterDefined(current);
+}
+function filterDefined(obj) {
+  if (Array.isArray(obj)) {
+    return obj.filter((item) => typeof item !== "undefined");
+  }
+  return obj;
+}
+
+// src/lib/array/advanced.ts
+function chunk(array, size) {
+  if (!Array.isArray(array) || size < 1) {
+    return [];
+  }
+  const chunks = [];
+  for (let i = 0; i < array.length; i += size) {
+    chunks.push(array.slice(i, i + size));
+  }
+  return chunks;
+}
+function flatten(array) {
+  return array.reduce((acc, val) => {
+    return acc.concat(val);
+  }, []);
+}
+function flattenDeep(array, depth = Infinity) {
+  if (depth < 1) {
+    return array.slice();
+  }
+  return array.reduce((acc, val) => {
+    if (Array.isArray(val)) {
+      acc.push(...flattenDeep(val, depth - 1));
+    } else {
+      acc.push(val);
+    }
+    return acc;
+  }, []);
+}
+function unique(array, selector) {
+  if (!Array.isArray(array)) {
+    return [];
+  }
+  if (!selector) {
+    return [...new Set(array)];
+  }
+  const seen = /* @__PURE__ */ new Set();
+  return array.filter((item) => {
+    const value = typeof selector === "function" ? selector(item) : isObject(item) ? get(item, selector) : item;
+    if (seen.has(value)) {
+      return false;
+    }
+    seen.add(value);
+    return true;
+  });
+}
+function groupBy(array, keyOrFn) {
+  if (!Array.isArray(array)) {
+    return {};
+  }
+  return array.reduce((acc, item) => {
+    let key;
+    if (typeof keyOrFn === "function") {
+      key = String(keyOrFn(item));
+    } else {
+      key = String(isObject(item) ? get(item, keyOrFn) : item);
+    }
+    if (!acc[key]) {
+      acc[key] = [];
+    }
+    acc[key].push(item);
+    return acc;
+  }, {});
+}
+function countBy(array, key) {
+  if (!Array.isArray(array)) {
+    return {};
+  }
+  return array.reduce((acc, item) => {
+    let countKey;
+    if (typeof key === "function") {
+      countKey = String(key(item));
+    } else if (key) {
+      countKey = String(
+        isObject(item) ? get(item, key) : item
+      );
+    } else {
+      countKey = String(item);
+    }
+    acc[countKey] = (acc[countKey] || 0) + 1;
+    return acc;
+  }, {});
+}
+function keyBy(array, keyFn, valueFn) {
+  if (!Array.isArray(array)) {
+    return {};
+  }
+  return array.reduce((acc, item) => {
+    let key;
+    if (typeof keyFn === "function") {
+      key = String(keyFn(item));
+    } else {
+      key = String(isObject(item) ? get(item, keyFn) : item);
+    }
+    let value;
+    if (valueFn) {
+      if (typeof valueFn === "function") {
+        value = valueFn(item);
+      } else {
+        value = get(item, valueFn);
+      }
+    } else {
+      value = item;
+    }
+    acc[key] = value;
+    return acc;
+  }, {});
+}
+function sortBy(array, keys) {
+  if (!Array.isArray(array) || array.length === 0) {
+    return [];
+  }
+  const sorted = [...array];
+  const keysArray = Array.isArray(keys) ? keys : [keys];
+  const normalizedKeys = keysArray.map((k) => {
+    if (typeof k === "object" && "key" in k) {
+      return { key: k.key, dir: k.dir || "asc" };
+    }
+    return { key: k, dir: "asc" };
+  });
+  sorted.sort((a, b) => {
+    for (const { key, dir } of normalizedKeys) {
+      const aVal = isObject(a) ? get(a, key) : a;
+      const bVal = isObject(b) ? get(b, key) : b;
+      if (aVal === bVal) continue;
+      const comparison = aVal < bVal ? -1 : 1;
+      return dir === "asc" ? comparison : -comparison;
+    }
+    return 0;
+  });
+  return sorted;
+}
+function difference(array1, array2, key) {
+  if (!Array.isArray(array1)) return [];
+  if (!Array.isArray(array2)) return array1;
+  if (!key) {
+    const set2 = new Set(array2);
+    return array1.filter((item) => !set2.has(item));
+  }
+  const values2 = new Set(
+    array2.map(
+      (item) => isObject(item) ? get(item, key) : item
+    )
+  );
+  return array1.filter((item) => {
+    const value = isObject(item) ? get(item, key) : item;
+    return !values2.has(value);
+  });
+}
+function intersection(array1, array2, key) {
+  if (!Array.isArray(array1) || !Array.isArray(array2)) {
+    return [];
+  }
+  if (!key) {
+    const set2 = new Set(array2);
+    return array1.filter((item) => set2.has(item));
+  }
+  const values2 = new Set(
+    array2.map(
+      (item) => isObject(item) ? get(item, key) : item
+    )
+  );
+  return array1.filter((item) => {
+    const value = isObject(item) ? get(item, key) : item;
+    return values2.has(value);
+  });
+}
+function union(array1, array2, key) {
+  if (!Array.isArray(array1) && !Array.isArray(array2)) {
+    return [];
+  }
+  if (!Array.isArray(array1)) return unique(array2, key);
+  if (!Array.isArray(array2)) return unique(array1, key);
+  return unique([...array1, ...array2], key);
+}
+function partition(array, predicate) {
+  if (!Array.isArray(array)) {
+    return [[], []];
+  }
+  return array.reduce(
+    (acc, item, index) => {
+      acc[predicate(item, index) ? 0 : 1].push(item);
+      return acc;
+    },
+    [[], []]
+  );
+}
+function take(array, n) {
+  if (!Array.isArray(array) || n <= 0) {
+    return [];
+  }
+  return array.slice(0, n);
+}
+function takeLast(array, n) {
+  if (!Array.isArray(array) || n <= 0) {
+    return [];
+  }
+  return array.slice(-n);
+}
+function takeWhile(array, predicate) {
+  if (!Array.isArray(array)) {
+    return [];
+  }
+  const result = [];
+  for (let i = 0; i < array.length; i++) {
+    if (!predicate(array[i], i)) break;
+    result.push(array[i]);
+  }
+  return result;
+}
+function drop(array, n) {
+  if (!Array.isArray(array) || n <= 0) {
+    return array ? [...array] : [];
+  }
+  return array.slice(n);
+}
+function dropWhile(array, predicate) {
+  if (!Array.isArray(array)) {
+    return [];
+  }
+  let index = 0;
+  while (index < array.length && predicate(array[index], index)) {
+    index++;
+  }
+  return array.slice(index);
+}
+function compact(array) {
+  if (!Array.isArray(array)) {
+    return [];
+  }
+  return array.filter(Boolean);
+}
+function zip(...arrays) {
+  if (arrays.length === 0) return [];
+  const maxLength = Math.max(
+    ...arrays.map((arr) => Array.isArray(arr) ? arr.length : 0)
+  );
+  const result = [];
+  for (let i = 0; i < maxLength; i++) {
+    const tuple = [];
+    for (const array of arrays) {
+      tuple.push(Array.isArray(array) ? array[i] : void 0);
+    }
+    result.push(tuple);
+  }
+  return result;
+}
+function unzip(array) {
+  if (!Array.isArray(array) || array.length === 0) {
+    return [];
+  }
+  const maxLength = Math.max(
+    ...array.map((arr) => Array.isArray(arr) ? arr.length : 0)
+  );
+  const result = [];
+  for (let i = 0; i < maxLength; i++) {
+    const tuple = [];
+    for (const arr of array) {
+      if (Array.isArray(arr)) {
+        tuple.push(arr[i]);
+      }
+    }
+    result.push(tuple);
+  }
+  return result;
+}
+function shuffle(array) {
+  if (!Array.isArray(array)) {
+    return [];
+  }
+  const result = [...array];
+  for (let i = result.length - 1; i > 0; i--) {
+    const j = Math.floor(Math.random() * (i + 1));
+    [result[i], result[j]] = [result[j], result[i]];
+  }
+  return result;
+}
+function sample(array) {
+  if (!Array.isArray(array) || array.length === 0) {
+    return void 0;
+  }
+  return array[Math.floor(Math.random() * array.length)];
+}
+function sampleSize(array, n) {
+  if (!Array.isArray(array) || n <= 0) {
+    return [];
+  }
+  const shuffled = shuffle(array);
+  return shuffled.slice(0, Math.min(n, array.length));
+}
+function findIndex(array, predicate, fromIndex = 0) {
+  if (!Array.isArray(array)) {
+    return -1;
+  }
+  for (let i = fromIndex; i < array.length; i++) {
+    if (predicate(array[i], i)) {
+      return i;
+    }
+  }
+  return -1;
+}
+function findLastIndex(array, predicate, fromIndex) {
+  if (!Array.isArray(array)) {
+    return -1;
+  }
+  const startIndex = fromIndex !== void 0 ? fromIndex : array.length - 1;
+  for (let i = startIndex; i >= 0; i--) {
+    if (predicate(array[i], i)) {
+      return i;
+    }
+  }
+  return -1;
+}
+function pluck(array, path) {
+  if (!Array.isArray(array)) {
+    return [];
+  }
+  return array.map((item) => get(item, path));
+}
+function pick(array, keys) {
+  if (!Array.isArray(array) || !Array.isArray(keys)) {
+    return [];
+  }
+  return array.map((item) => {
+    const result = {};
+    for (const key of keys) {
+      if (key in item) {
+        result[key] = item[key];
+      }
+    }
+    return result;
+  });
+}
+function omit(array, keys) {
+  if (!Array.isArray(array) || !Array.isArray(keys)) {
+    return [];
+  }
+  return array.map((item) => {
+    const result = { ...item };
+    for (const key of keys) {
+      delete result[key];
+    }
+    return result;
+  });
+}
+function flatMap(array, callback) {
+  if (!Array.isArray(array)) {
+    return [];
+  }
+  return array.reduce((acc, item, index) => {
+    const result = callback(item, index);
+    return acc.concat(result);
+  }, []);
+}
+function reduceRight(array, callback, initialValue) {
+  if (!Array.isArray(array)) {
+    return initialValue;
+  }
+  let accumulator = initialValue;
+  for (let i = array.length - 1; i >= 0; i--) {
+    accumulator = callback(accumulator, array[i], i);
+  }
+  return accumulator;
+}
+function range(start, end, step = 1) {
+  if (step === 0) {
+    return [];
+  }
+  const result = [];
+  if (step > 0) {
+    for (let i = start; i < end; i += step) {
+      result.push(i);
+    }
+  } else {
+    for (let i = start; i > end; i += step) {
+      result.push(i);
+    }
+  }
+  return result;
+}
+function fill(array, value, start = 0, end) {
+  if (!Array.isArray(array)) {
+    return [];
+  }
+  const result = [...array];
+  const actualEnd = end === void 0 ? result.length : end;
+  for (let i = start; i < actualEnd && i < result.length; i++) {
+    result[i] = value;
+  }
+  return result;
+}
+function deepCloneArray(array) {
+  if (!Array.isArray(array)) {
+    return [];
+  }
+  return deepClone(array);
+}
+function mergeByKey(arr1, arr2, ...keyOrMore) {
+  let key;
+  let arrays;
+  if (typeof arr2 === "string") {
+    key = arr2;
+    arrays = [arr1];
+  } else {
+    const lastArg = keyOrMore[keyOrMore.length - 1];
+    if (typeof lastArg === "string") {
+      key = lastArg;
+      arrays = [
+        arr1,
+        arr2,
+        ...keyOrMore.slice(0, -1).filter(Array.isArray)
+      ];
+    } else {
+      key = "id";
+      arrays = [arr1, arr2, ...keyOrMore.filter(Array.isArray)];
+    }
+  }
+  if (arrays.length === 0) {
+    return [];
+  }
+  const map = /* @__PURE__ */ new Map();
+  for (const array of arrays) {
+    if (Array.isArray(array)) {
+      for (const item of array) {
+        const keyValue = isObject(item) ? get(item, key) : void 0;
+        if (keyValue !== void 0) {
+          const existing = map.get(keyValue);
+          map.set(keyValue, existing ? { ...existing, ...item } : item);
+        }
+      }
+    }
+  }
+  return Array.from(map.values());
+}
+function move(array, fromIndex, toIndex) {
+  if (!Array.isArray(array) || fromIndex === toIndex) {
+    return array ? [...array] : [];
+  }
+  const result = [...array];
+  const [removed] = result.splice(fromIndex, 1);
+  result.splice(toIndex, 0, removed);
+  return result;
+}
+function rotate(array, n) {
+  if (!Array.isArray(array) || array.length === 0 || n === 0) {
+    return array ? [...array] : [];
+  }
+  const len = array.length;
+  const rotations = (n % len + len) % len;
+  return [...array.slice(-rotations), ...array.slice(0, -rotations)];
+}
+function insert(array, index, ...items) {
+  if (!Array.isArray(array)) {
+    return items;
+  }
+  const result = [...array];
+  result.splice(index, 0, ...items);
+  return result;
+}
+function remove(array, index, count = 1) {
+  if (!Array.isArray(array)) {
+    return [];
+  }
+  const result = [...array];
+  result.splice(index, count);
+  return result;
+}
+function replace(array, index, item) {
+  if (!Array.isArray(array)) {
+    return [];
+  }
+  const result = [...array];
+  result[index] = item;
+  return result;
+}
+function filterCompact(array, predicate) {
+  if (!Array.isArray(array)) {
+    return [];
+  }
+  const filtered = array.filter((item) => item != null);
+  return predicate ? filtered.filter(predicate) : filtered;
+}
+function cartesian(...arrays) {
+  if (arrays.length === 0) return [[]];
+  if (arrays.length === 1) return arrays[0].map((item) => [item]);
+  return arrays.reduce(
+    (acc, array) => {
+      return acc.flatMap((x) => array.map((y) => [...x, y]));
+    },
+    [[]]
+  );
+}
+function findAllIndices(array, predicate) {
+  if (!Array.isArray(array)) {
+    return [];
+  }
+  const indices = [];
+  for (let i = 0; i < array.length; i++) {
+    if (predicate(array[i], i)) {
+      indices.push(i);
+    }
+  }
+  return indices;
+}
+function isEqual(array1, array2, deep = true) {
+  if (!Array.isArray(array1) || !Array.isArray(array2)) {
+    return false;
+  }
+  if (array1.length !== array2.length) {
+    return false;
+  }
+  for (let i = 0; i < array1.length; i++) {
+    if (deep && isObject(array1[i]) && isObject(array2[i])) {
+      if (JSON.stringify(array1[i]) !== JSON.stringify(array2[i])) {
+        return false;
+      }
+    } else if (array1[i] !== array2[i]) {
+      return false;
+    }
+  }
+  return true;
+}
+function chunkBy(array, predicate) {
+  if (!Array.isArray(array) || array.length === 0) {
+    return [];
+  }
+  const result = [];
+  let currentChunk = [array[0]];
+  let currentKey = predicate(array[0], 0);
+  for (let i = 1; i < array.length; i++) {
+    const key = predicate(array[i], i);
+    if (key === currentKey) {
+      currentChunk.push(array[i]);
+    } else {
+      result.push(currentChunk);
+      currentChunk = [array[i]];
+      currentKey = key;
+    }
+  }
+  result.push(currentChunk);
+  return result;
+}
+function updateBy(array, predicate, updates, updatesOrUndefined) {
+  if (!Array.isArray(array)) {
+    return [];
+  }
+  const isPredicate = typeof predicate === "function";
+  const actualUpdates = isPredicate ? updates : updatesOrUndefined;
+  return array.map((item) => {
+    let shouldUpdate = false;
+    if (isPredicate) {
+      shouldUpdate = predicate(item);
+    } else {
+      const itemValue = isObject(item) ? get(item, predicate) : item;
+      shouldUpdate = itemValue === updates;
+    }
+    if (shouldUpdate) {
+      return { ...item, ...actualUpdates };
+    }
+    return item;
+  });
+}
+function splitDuplicates(array, key) {
+  if (!Array.isArray(array)) {
+    return { unique: [], duplicates: [] };
+  }
+  const seen = /* @__PURE__ */ new Set();
+  const unique2 = [];
+  const duplicates = [];
+  for (const item of array) {
+    const value = key && isObject(item) ? get(item, key) : item;
+    if (seen.has(value)) {
+      duplicates.push(item);
+    } else {
+      seen.add(value);
+      unique2.push(item);
+    }
+  }
+  return { unique: unique2, duplicates };
+}
+function ensureArray(value) {
+  if (Array.isArray(value)) {
+    return value;
+  }
+  return value === void 0 || value === null ? [] : [value];
+}
+function wrap(value) {
+  return ensureArray(value);
+}
+function slidingWindow(array, size, step = 1) {
+  if (!Array.isArray(array) || size < 1 || step < 1) {
+    return [];
+  }
+  const windows = [];
+  for (let i = 0; i <= array.length - size; i += step) {
+    windows.push(array.slice(i, i + size));
+  }
+  return windows;
+}
+function minBy(array, selector) {
+  if (!Array.isArray(array) || array.length === 0) {
+    return void 0;
+  }
+  let minItem = array[0];
+  let minValue = typeof selector === "function" ? selector(minItem) : get(minItem, selector);
+  for (let i = 1; i < array.length; i++) {
+    const item = array[i];
+    const value = typeof selector === "function" ? selector(item) : get(item, selector);
+    if (value < minValue) {
+      minValue = value;
+      minItem = item;
+    }
+  }
+  return minItem;
+}
+function maxBy(array, selector) {
+  if (!Array.isArray(array) || array.length === 0) {
+    return void 0;
+  }
+  let maxItem = array[0];
+  let maxValue = typeof selector === "function" ? selector(maxItem) : get(maxItem, selector);
+  for (let i = 1; i < array.length; i++) {
+    const item = array[i];
+    const value = typeof selector === "function" ? selector(item) : get(item, selector);
+    if (value > maxValue) {
+      maxValue = value;
+      maxItem = item;
+    }
+  }
+  return maxItem;
+}
+function sumBy(array, selector) {
+  if (!Array.isArray(array) || array.length === 0) {
+    return 0;
+  }
+  let sum = 0;
+  for (const item of array) {
+    const value = typeof selector === "function" ? selector(item) : get(item, selector);
+    if (typeof value === "number" && !isNaN(value)) {
+      sum += value;
+    }
+  }
+  return sum;
+}
+function avgBy(array, selector) {
+  if (!Array.isArray(array) || array.length === 0) {
+    return 0;
+  }
+  const sum = sumBy(array, selector);
+  return sum / array.length;
+}
+function frequencies(array) {
+  const freqMap = /* @__PURE__ */ new Map();
+  if (!Array.isArray(array)) {
+    return freqMap;
+  }
+  for (const item of array) {
+    freqMap.set(item, (freqMap.get(item) || 0) + 1);
+  }
+  return freqMap;
+}
+function mostCommon(array, limit = 1) {
+  if (!Array.isArray(array) || array.length === 0 || limit < 1) {
+    return [];
+  }
+  const freqMap = frequencies(array);
+  const sorted = Array.from(freqMap.entries()).sort((a, b) => b[1] - a[1]);
+  return sorted.slice(0, limit).map(([value]) => value);
+}
+function leastCommon(array, limit = 1) {
+  if (!Array.isArray(array) || array.length === 0 || limit < 1) {
+    return [];
+  }
+  const freqMap = frequencies(array);
+  const sorted = Array.from(freqMap.entries()).sort((a, b) => a[1] - b[1]);
+  return sorted.slice(0, limit).map(([value]) => value);
+}
+async function batchProcess(array, batchSize, callback) {
+  if (!Array.isArray(array) || batchSize < 1) {
+    return;
+  }
+  const batches = chunk(array, batchSize);
+  for (let i = 0; i < batches.length; i++) {
+    await callback(batches[i], i);
+  }
+}
+async function batchProcessParallel(array, batchSize, concurrency, callback) {
+  if (!Array.isArray(array) || batchSize < 1 || concurrency < 1) {
+    return;
+  }
+  const batches = chunk(array, batchSize);
+  const batchChunks = chunk(
+    batches.map((batch2, index) => ({ batch: batch2, index })),
+    concurrency
+  );
+  for (const batchChunk of batchChunks) {
+    await Promise.all(
+      batchChunk.map(({ batch: batch2, index }) => callback(batch2, index))
+    );
+  }
+}
+function transpose(matrix) {
+  if (!Array.isArray(matrix) || matrix.length === 0) {
+    return [];
+  }
+  const maxLength = Math.max(...matrix.map((row) => row.length));
+  const result = [];
+  for (let col = 0; col < maxLength; col++) {
+    const column = [];
+    for (let row = 0; row < matrix.length; row++) {
+      if (col < matrix[row].length) {
+        column.push(matrix[row][col]);
+      }
+    }
+    result.push(column);
+  }
+  return result;
+}
+function isArrayEqual(array1, array2) {
+  if (!Array.isArray(array1) || !Array.isArray(array2)) {
+    return false;
+  }
+  if (array1.length !== array2.length) {
+    return false;
+  }
+  for (let i = 0; i < array1.length; i++) {
+    if (array1[i] !== array2[i]) {
+      return false;
+    }
+  }
+  return true;
+}
+function hasSameElements(array1, array2) {
+  if (!Array.isArray(array1) || !Array.isArray(array2)) {
+    return false;
+  }
+  if (array1.length !== array2.length) {
+    return false;
+  }
+  const freq1 = frequencies(array1);
+  const freq2 = frequencies(array2);
+  if (freq1.size !== freq2.size) {
+    return false;
+  }
+  for (const [key, count] of freq1) {
+    if (freq2.get(key) !== count) {
+      return false;
+    }
+  }
+  return true;
+}
+function isSubset(array1, array2) {
+  if (!Array.isArray(array1) || !Array.isArray(array2)) {
+    return false;
+  }
+  const set2 = new Set(array2);
+  return array1.every((item) => set2.has(item));
+}
+function isSuperset(array1, array2) {
+  return isSubset(array2, array1);
+}
+function interleave(...arrays) {
+  if (arrays.length === 0) {
+    return [];
+  }
+  const maxLength = Math.max(...arrays.map((arr) => arr.length));
+  const result = [];
+  for (let i = 0; i < maxLength; i++) {
+    for (const arr of arrays) {
+      if (i < arr.length) {
+        result.push(arr[i]);
+      }
+    }
+  }
+  return result;
+}
+function bifurcate(array, predicate) {
+  const pass = [];
+  const fail = [];
+  if (!Array.isArray(array)) {
+    return { pass, fail };
+  }
+  for (let i = 0; i < array.length; i++) {
+    if (predicate(array[i], i)) {
+      pass.push(array[i]);
+    } else {
+      fail.push(array[i]);
+    }
+  }
+  return { pass, fail };
+}
+function generate(length, generator) {
+  if (length < 0) {
+    return [];
+  }
+  const result = [];
+  for (let i = 0; i < length; i++) {
+    result.push(generator(i));
+  }
+  return result;
+}
+function repeat(array, times) {
+  if (!Array.isArray(array) || times < 0) {
+    return [];
+  }
+  const result = [];
+  for (let i = 0; i < times; i++) {
+    result.push(...array);
+  }
+  return result;
+}
+function median(array) {
+  if (!Array.isArray(array) || array.length === 0) {
+    return void 0;
+  }
+  const sorted = [...array].sort((a, b) => a - b);
+  const mid = Math.floor(sorted.length / 2);
+  if (sorted.length % 2 === 0) {
+    return (sorted[mid - 1] + sorted[mid]) / 2;
+  }
+  return sorted[mid];
+}
+function mode(array) {
+  const common = mostCommon(array, 1);
+  return common.length > 0 ? common[0] : void 0;
+}
+function without(array, ...values) {
+  if (!Array.isArray(array)) {
+    return [];
+  }
+  const excludeSet = new Set(values);
+  return array.filter((item) => !excludeSet.has(item));
+}
+function differenceWith(array, ...others) {
+  if (!Array.isArray(array)) {
+    return [];
+  }
+  const excludeSet = new Set(others.flat());
+  return array.filter((item) => !excludeSet.has(item));
+}
+function groupConsecutive(array) {
+  if (!Array.isArray(array) || array.length === 0) {
+    return [];
+  }
+  const result = [];
+  let currentGroup = [array[0]];
+  for (let i = 1; i < array.length; i++) {
+    if (array[i] === array[i - 1]) {
+      currentGroup.push(array[i]);
+    } else {
+      result.push(currentGroup);
+      currentGroup = [array[i]];
+    }
+  }
+  result.push(currentGroup);
+  return result;
+}
+function dedupeConsecutive(array) {
+  if (!Array.isArray(array) || array.length === 0) {
+    return [];
+  }
+  const result = [array[0]];
+  for (let i = 1; i < array.length; i++) {
+    if (array[i] !== array[i - 1]) {
+      result.push(array[i]);
+    }
+  }
+  return result;
+}
+function rank(array, method = "standard") {
+  if (!Array.isArray(array) || array.length === 0) {
+    return [];
+  }
+  const indexed = array.map((value, index) => ({ value, index }));
+  indexed.sort((a, b) => a.value - b.value);
+  const ranks = new Array(array.length);
+  if (method === "ordinal") {
+    for (let i = 0; i < indexed.length; i++) {
+      ranks[indexed[i].index] = i + 1;
+    }
+  } else if (method === "dense") {
+    let denseRank = 1;
+    ranks[indexed[0].index] = denseRank;
+    for (let i = 1; i < indexed.length; i++) {
+      if (indexed[i].value !== indexed[i - 1].value) {
+        denseRank++;
+      }
+      ranks[indexed[i].index] = denseRank;
+    }
+  } else {
+    let i = 0;
+    while (i < indexed.length) {
+      let j = i;
+      while (j < indexed.length && indexed[j].value === indexed[i].value) {
+        j++;
+      }
+      const rankValue = i + 1;
+      for (let k = i; k < j; k++) {
+        ranks[indexed[k].index] = rankValue;
+      }
+      i = j;
+    }
+  }
+  return ranks;
+}
+function percentile(array, percentile2) {
+  if (!Array.isArray(array) || array.length === 0) {
+    return void 0;
+  }
+  if (percentile2 < 0 || percentile2 > 100) {
+    return void 0;
+  }
+  const sorted = [...array].sort((a, b) => a - b);
+  const index = percentile2 / 100 * (sorted.length - 1);
+  const lower = Math.floor(index);
+  const upper = Math.ceil(index);
+  const weight = index - lower;
+  if (lower === upper) {
+    return sorted[lower];
+  }
+  return sorted[lower] * (1 - weight) + sorted[upper] * weight;
+}
+function quartiles(array) {
+  if (!Array.isArray(array) || array.length === 0) {
+    return void 0;
+  }
+  const q1 = percentile(array, 25);
+  const q2 = percentile(array, 50);
+  const q3 = percentile(array, 75);
+  return {
+    q1,
+    q2,
+    q3,
+    iqr: q3 - q1
+  };
+}
+function standardDeviation(array, sample2 = false) {
+  if (!Array.isArray(array) || array.length === 0) {
+    return void 0;
+  }
+  if (sample2 && array.length === 1) {
+    return void 0;
+  }
+  const avg = array.reduce((sum, val) => sum + val, 0) / array.length;
+  const squareDiffs = array.map((value) => Math.pow(value - avg, 2));
+  const avgSquareDiff = squareDiffs.reduce((sum, val) => sum + val, 0) / (sample2 ? array.length - 1 : array.length);
+  return Math.sqrt(avgSquareDiff);
+}
+function variance(array, sample2 = false) {
+  const std = standardDeviation(array, sample2);
+  return std !== void 0 ? Math.pow(std, 2) : void 0;
+}
+function normalize(array) {
+  if (!Array.isArray(array) || array.length === 0) {
+    return [];
+  }
+  const min = Math.min(...array);
+  const max = Math.max(...array);
+  const range2 = max - min;
+  if (range2 === 0) {
+    return array.map(() => 0);
+  }
+  return array.map((value) => (value - min) / range2);
+}
+function standardize(array) {
+  if (!Array.isArray(array) || array.length === 0) {
+    return [];
+  }
+  const avg = array.reduce((sum, val) => sum + val, 0) / array.length;
+  const std = standardDeviation(array);
+  if (std === void 0 || std === 0) {
+    return array.map(() => 0);
+  }
+  return array.map((value) => (value - avg) / std);
+}
+function scan(array, fn, initial) {
+  if (!Array.isArray(array)) {
+    return [];
+  }
+  const result = [];
+  let accumulator = initial;
+  for (let i = 0; i < array.length; i++) {
+    accumulator = fn(accumulator, array[i], i);
+    result.push(accumulator);
+  }
+  return result;
+}
+function cumulativeSum(array) {
+  return scan(array, (acc, x) => acc + x, 0);
+}
+function diff(array) {
+  if (!Array.isArray(array) || array.length < 2) {
+    return [];
+  }
+  const result = [];
+  for (let i = 1; i < array.length; i++) {
+    result.push(array[i] - array[i - 1]);
+  }
+  return result;
+}
+function pad(array, length, value, position = "end") {
+  if (!Array.isArray(array) || length <= array.length) {
+    return [...array];
+  }
+  const padding = new Array(length - array.length).fill(value);
+  return position === "start" ? [...padding, ...array] : [...array, ...padding];
+}
+function trim(array, predicate) {
+  if (!Array.isArray(array) || array.length === 0) {
+    return [];
+  }
+  let start = 0;
+  let end = array.length - 1;
+  while (start <= end && predicate(array[start])) {
+    start++;
+  }
+  while (end >= start && predicate(array[end])) {
+    end--;
+  }
+  return array.slice(start, end + 1);
+}
+function pairwise(array) {
+  if (!Array.isArray(array) || array.length < 2) {
+    return [];
+  }
+  const result = [];
+  for (let i = 0; i < array.length - 1; i++) {
+    result.push([array[i], array[i + 1]]);
+  }
+  return result;
+}
+function enumerate(array) {
+  if (!Array.isArray(array)) {
+    return [];
+  }
+  return array.map((value, index) => [index, value]);
+}
+function applyByIndex(array, functions) {
+  if (!Array.isArray(array)) {
+    return [];
+  }
+  return array.map((item, index) => {
+    const fn = functions[index % functions.length];
+    return fn(item);
+  });
+}
+function rotateLeft(array, n = 1) {
+  if (!Array.isArray(array) || array.length === 0) {
+    return [];
+  }
+  const len = array.length;
+  const rotations = (n % len + len) % len;
+  return [...array.slice(rotations), ...array.slice(0, rotations)];
+}
+function rotateRight(array, n = 1) {
+  return rotateLeft(array, -n);
+}
+function swap(array, i, j) {
+  if (!Array.isArray(array) || i < 0 || j < 0 || i >= array.length || j >= array.length) {
+    return [...array];
+  }
+  const result = [...array];
+  [result[i], result[j]] = [result[j], result[i]];
+  return result;
+}
+function reverseSegment(array, start, end) {
+  if (!Array.isArray(array) || start < 0 || end >= array.length || start >= end) {
+    return [...array];
+  }
+  const result = [...array];
+  const segment2 = result.slice(start, end + 1).reverse();
+  result.splice(start, end - start + 1, ...segment2);
+  return result;
+}
+function isSorted(array, compareFn) {
+  if (!Array.isArray(array) || array.length <= 1) {
+    return true;
+  }
+  const compare = compareFn || ((a, b) => a < b ? -1 : a > b ? 1 : 0);
+  for (let i = 1; i < array.length; i++) {
+    if (compare(array[i - 1], array[i]) > 0) {
+      return false;
+    }
+  }
+  return true;
+}
+function hasDuplicates(array) {
+  if (!Array.isArray(array)) {
+    return false;
+  }
+  return new Set(array).size !== array.length;
+}
+function pickMany(array, keys) {
+  if (!Array.isArray(array)) {
+    return [];
+  }
+  return array.map((obj) => {
+    const result = {};
+    for (const key of keys) {
+      if (key in obj) {
+        result[key] = obj[key];
+      }
+    }
+    return result;
+  });
+}
+function toObject(array, keySelector, valueSelector) {
+  if (!Array.isArray(array)) {
+    return {};
+  }
+  const result = {};
+  for (let i = 0; i < array.length; i++) {
+    const key = keySelector(array[i], i);
+    const value = valueSelector ? valueSelector(array[i], i) : array[i];
+    result[key] = value;
+  }
+  return result;
+}
+async function mapAsync(array, fn) {
+  if (!Array.isArray(array)) {
+    return [];
+  }
+  const result = [];
+  for (let i = 0; i < array.length; i++) {
+    result.push(await fn(array[i], i));
+  }
+  return result;
+}
+async function mapAsyncParallel(array, fn) {
+  if (!Array.isArray(array)) {
+    return [];
+  }
+  return Promise.all(array.map((item, index) => fn(item, index)));
+}
+async function filterAsync(array, predicate) {
+  if (!Array.isArray(array)) {
+    return [];
+  }
+  const result = [];
+  for (let i = 0; i < array.length; i++) {
+    if (await predicate(array[i], i)) {
+      result.push(array[i]);
+    }
+  }
+  return result;
+}
+async function reduceAsync(array, fn, initial) {
+  if (!Array.isArray(array)) {
+    return initial;
+  }
+  let accumulator = initial;
+  for (let i = 0; i < array.length; i++) {
+    accumulator = await fn(accumulator, array[i], i);
+  }
+  return accumulator;
+}
+async function findAsync(array, predicate) {
+  if (!Array.isArray(array)) {
+    return void 0;
+  }
+  for (let i = 0; i < array.length; i++) {
+    if (await predicate(array[i], i)) {
+      return array[i];
+    }
+  }
+  return void 0;
+}
+async function someAsync(array, predicate) {
+  if (!Array.isArray(array)) {
+    return false;
+  }
+  for (let i = 0; i < array.length; i++) {
+    if (await predicate(array[i], i)) {
+      return true;
+    }
+  }
+  return false;
+}
+async function everyAsync(array, predicate) {
+  if (!Array.isArray(array)) {
+    return true;
+  }
+  for (let i = 0; i < array.length; i++) {
+    if (!await predicate(array[i], i)) {
+      return false;
+    }
+  }
+  return true;
+}
+function weightedAverage(array, valueSelector, weightSelector) {
+  if (!Array.isArray(array) || array.length === 0) {
+    return 0;
+  }
+  let totalWeight = 0;
+  let weightedSum = 0;
+  for (const item of array) {
+    const value = typeof valueSelector === "function" ? valueSelector(item) : get(item, valueSelector);
+    const weight = typeof weightSelector === "function" ? weightSelector(item) : get(item, weightSelector);
+    if (typeof value === "number" && typeof weight === "number") {
+      weightedSum += value * weight;
+      totalWeight += weight;
+    }
+  }
+  return totalWeight === 0 ? 0 : weightedSum / totalWeight;
+}
+function weightedSample(array, weightSelector, count = 1) {
+  if (!Array.isArray(array) || array.length === 0 || count < 1) {
+    return [];
+  }
+  const weights = [];
+  let totalWeight = 0;
+  for (const item of array) {
+    const weight = typeof weightSelector === "function" ? weightSelector(item) : get(item, weightSelector);
+    totalWeight += typeof weight === "number" && weight > 0 ? weight : 0;
+    weights.push(totalWeight);
+  }
+  if (totalWeight === 0) {
+    return [];
+  }
+  const result = [];
+  for (let i = 0; i < count; i++) {
+    const random = Math.random() * totalWeight;
+    const index = weights.findIndex((w) => random < w);
+    if (index !== -1) {
+      result.push(array[index]);
+    }
+  }
+  return result;
+}
+function segment(array, sizes) {
+  if (!Array.isArray(array) || !Array.isArray(sizes)) {
+    return [];
+  }
+  const result = [];
+  let offset = 0;
+  for (const size of sizes) {
+    if (offset >= array.length) break;
+    result.push(array.slice(offset, offset + size));
+    offset += size;
+  }
+  return result;
+}
+function selectByCount(array, count) {
+  if (!Array.isArray(array) || count < 1) {
+    return [];
+  }
+  const freq = frequencies(array);
+  const result = [];
+  for (const item of array) {
+    if (freq.get(item) === count) {
+      result.push(item);
+    }
+  }
+  return result;
+}
+function filterConsecutive(array, n, predicate) {
+  if (!Array.isArray(array) || n < 1) {
+    return [];
+  }
+  const result = [];
+  let consecutiveCount = 0;
+  const buffer = [];
+  for (const item of array) {
+    if (predicate(item)) {
+      consecutiveCount++;
+      buffer.push(item);
+      if (consecutiveCount >= n) {
+        result.push(...buffer.splice(0, buffer.length - n + 1));
+      }
+    } else {
+      consecutiveCount = 0;
+      buffer.length = 0;
+    }
+  }
+  if (consecutiveCount >= n) {
+    result.push(...buffer);
+  }
+  return result;
+}
+function mapWithContext(array, fn, initialContext) {
+  if (!Array.isArray(array)) {
+    return [];
+  }
+  const result = [];
+  let context = initialContext;
+  for (let i = 0; i < array.length; i++) {
+    const { value, newContext } = fn(array[i], context, i);
+    result.push(value);
+    context = newContext;
+  }
+  return result;
+}
+function batch(array, batchSize) {
+  return chunk(array, batchSize);
+}
+function zipWith(array1, array2, fn) {
+  if (!Array.isArray(array1) || !Array.isArray(array2)) {
+    return [];
+  }
+  const length = Math.min(array1.length, array2.length);
+  const result = [];
+  for (let i = 0; i < length; i++) {
+    result.push(fn(array1[i], array2[i]));
+  }
+  return result;
+}
+function mergeArraysByKey(arrays, key, mergeStrategy = "last") {
+  if (!Array.isArray(arrays) || arrays.length === 0) {
+    return [];
+  }
+  const map = /* @__PURE__ */ new Map();
+  for (const array of arrays) {
+    if (!Array.isArray(array)) continue;
+    for (const item of array) {
+      const keyValue = get(item, key);
+      if (mergeStrategy === "first") {
+        if (!map.has(keyValue)) {
+          map.set(keyValue, item);
+        }
+      } else if (mergeStrategy === "last") {
+        map.set(keyValue, item);
+      } else if (mergeStrategy === "concat") {
+        const existing = map.get(keyValue);
+        if (Array.isArray(existing)) {
+          existing.push(item);
+        } else if (existing) {
+          map.set(keyValue, [existing, item]);
+        } else {
+          map.set(keyValue, item);
+        }
+      } else if (typeof mergeStrategy === "function") {
+        const existing = map.get(keyValue);
+        if (existing && !Array.isArray(existing)) {
+          map.set(keyValue, mergeStrategy(existing, item));
+        } else {
+          map.set(keyValue, item);
+        }
+      }
+    }
+  }
+  const result = [];
+  for (const value of map.values()) {
+    if (Array.isArray(value) && mergeStrategy === "concat") {
+      result.push(...value);
+    } else if (!Array.isArray(value)) {
+      result.push(value);
+    }
+  }
+  return result;
+}
+function indexBy(array, key) {
+  return toObject(array, (item) => String(get(item, key)));
+}
+function binarySearch(array, target, compareFn) {
+  if (!Array.isArray(array) || array.length === 0) {
+    return -1;
+  }
+  const compare = compareFn || ((a, b) => a < b ? -1 : a > b ? 1 : 0);
+  let left = 0;
+  let right = array.length - 1;
+  while (left <= right) {
+    const mid = Math.floor((left + right) / 2);
+    const comparison = compare(array[mid], target);
+    if (comparison === 0) {
+      return mid;
+    } else if (comparison < 0) {
+      left = mid + 1;
+    } else {
+      right = mid - 1;
+    }
+  }
+  return -1;
+}
+function insertSorted(array, value, compareFn) {
+  if (!Array.isArray(array)) {
+    return [value];
+  }
+  const compare = compareFn || ((a, b) => a < b ? -1 : a > b ? 1 : 0);
+  const result = [...array];
+  let insertIndex = 0;
+  while (insertIndex < result.length && compare(result[insertIndex], value) < 0) {
+    insertIndex++;
+  }
+  result.splice(insertIndex, 0, value);
+  return result;
+}
+export {
+  applyByIndex,
+  avgBy,
+  batch,
+  batchProcess,
+  batchProcessParallel,
+  bifurcate,
+  binarySearch,
+  cartesian,
+  chunk,
+  chunkBy,
+  compact,
+  countBy,
+  cumulativeSum,
+  dedupeConsecutive,
+  deepCloneArray,
+  diff,
+  difference,
+  differenceWith,
+  drop,
+  dropWhile,
+  ensureArray,
+  enumerate,
+  everyAsync,
+  fill,
+  filterAsync,
+  filterCompact,
+  filterConsecutive,
+  findAllIndices,
+  findAsync,
+  findIndex,
+  findLastIndex,
+  flatMap,
+  flatten,
+  flattenDeep,
+  frequencies,
+  generate,
+  groupBy,
+  groupConsecutive,
+  hasDuplicates,
+  hasSameElements,
+  indexBy,
+  insert,
+  insertSorted,
+  interleave,
+  intersection,
+  isArrayEqual,
+  isEqual,
+  isSorted,
+  isSubset,
+  isSuperset,
+  keyBy,
+  leastCommon,
+  mapAsync,
+  mapAsyncParallel,
+  mapWithContext,
+  maxBy,
+  median,
+  mergeArraysByKey,
+  mergeByKey,
+  minBy,
+  mode,
+  mostCommon,
+  move,
+  normalize,
+  omit,
+  pad,
+  pairwise,
+  partition,
+  percentile,
+  pick,
+  pickMany,
+  pluck,
+  quartiles,
+  range,
+  rank,
+  reduceAsync,
+  reduceRight,
+  remove,
+  repeat,
+  replace,
+  reverseSegment,
+  rotate,
+  rotateLeft,
+  rotateRight,
+  sample,
+  sampleSize,
+  scan,
+  segment,
+  selectByCount,
+  shuffle,
+  slidingWindow,
+  someAsync,
+  sortBy,
+  splitDuplicates,
+  standardDeviation,
+  standardize,
+  sumBy,
+  swap,
+  take,
+  takeLast,
+  takeWhile,
+  toObject,
+  transpose,
+  trim,
+  union,
+  unique,
+  unzip,
+  updateBy,
+  variance,
+  weightedAverage,
+  weightedSample,
+  without,
+  wrap,
+  zip,
+  zipWith
+};