es-toolkit 1.13.1-dev.320 → 1.13.1-dev.322

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (251) hide show
  1. package/dist/array/chunk.mjs +1 -1
  2. package/dist/array/compact.d.mts +1 -1
  3. package/dist/array/compact.d.ts +1 -1
  4. package/dist/array/compact.js.map +1 -1
  5. package/dist/array/compact.mjs +2 -2
  6. package/dist/array/countBy.js +1 -2
  7. package/dist/array/countBy.js.map +1 -1
  8. package/dist/array/countBy.mjs +2 -2
  9. package/dist/array/difference.mjs +1 -1
  10. package/dist/array/differenceBy.mjs +1 -1
  11. package/dist/array/differenceWith.mjs +1 -1
  12. package/dist/array/drop.mjs +1 -1
  13. package/dist/array/dropRight.mjs +1 -1
  14. package/dist/array/dropRightWhile.mjs +1 -1
  15. package/dist/array/dropWhile.mjs +1 -1
  16. package/dist/array/fill.d.mts +1 -0
  17. package/dist/array/fill.d.ts +1 -0
  18. package/dist/array/fill.js.map +1 -1
  19. package/dist/array/fill.mjs +2 -2
  20. package/dist/array/flatMap.mjs +1 -1
  21. package/dist/array/flatten.mjs +1 -1
  22. package/dist/array/flattenDeep.mjs +1 -1
  23. package/dist/array/forEachRight.mjs +1 -1
  24. package/dist/array/groupBy.mjs +1 -1
  25. package/dist/array/head.d.mts +1 -0
  26. package/dist/array/head.d.ts +1 -0
  27. package/dist/array/head.js.map +1 -1
  28. package/dist/array/head.mjs +2 -2
  29. package/dist/array/index.js +1 -2
  30. package/dist/array/index.js.map +1 -1
  31. package/dist/array/index.mjs +56 -56
  32. package/dist/array/initial.mjs +1 -1
  33. package/dist/array/intersection.mjs +1 -1
  34. package/dist/array/intersectionBy.mjs +1 -1
  35. package/dist/array/intersectionWith.mjs +1 -1
  36. package/dist/array/keyBy.mjs +1 -1
  37. package/dist/array/last.d.mts +1 -0
  38. package/dist/array/last.d.ts +1 -0
  39. package/dist/array/last.js.map +1 -1
  40. package/dist/array/last.mjs +2 -2
  41. package/dist/array/maxBy.mjs +1 -1
  42. package/dist/array/minBy.mjs +1 -1
  43. package/dist/array/orderBy.mjs +1 -1
  44. package/dist/array/partition.mjs +1 -1
  45. package/dist/array/sample.mjs +1 -1
  46. package/dist/array/sampleSize.mjs +1 -1
  47. package/dist/array/shuffle.mjs +1 -1
  48. package/dist/array/tail.d.mts +9 -4
  49. package/dist/array/tail.d.ts +9 -4
  50. package/dist/array/tail.js.map +1 -1
  51. package/dist/array/tail.mjs +2 -2
  52. package/dist/array/take.mjs +1 -1
  53. package/dist/array/takeRight.mjs +1 -1
  54. package/dist/array/takeRightWhile.mjs +1 -1
  55. package/dist/array/takeWhile.mjs +1 -1
  56. package/dist/array/toFilled.d.mts +2 -0
  57. package/dist/array/toFilled.d.ts +2 -0
  58. package/dist/array/toFilled.js.map +1 -1
  59. package/dist/array/toFilled.mjs +2 -2
  60. package/dist/array/union.mjs +1 -1
  61. package/dist/array/unionBy.mjs +1 -1
  62. package/dist/array/unionWith.mjs +1 -1
  63. package/dist/array/uniq.mjs +1 -1
  64. package/dist/array/uniqBy.mjs +1 -1
  65. package/dist/array/uniqWith.mjs +1 -1
  66. package/dist/array/unzip.d.mts +3 -2
  67. package/dist/array/unzip.d.ts +3 -2
  68. package/dist/array/unzip.js.map +1 -1
  69. package/dist/array/unzip.mjs +2 -2
  70. package/dist/array/unzipWith.mjs +1 -1
  71. package/dist/array/without.mjs +1 -1
  72. package/dist/array/xor.mjs +1 -1
  73. package/dist/array/xorBy.mjs +1 -1
  74. package/dist/array/xorWith.mjs +1 -1
  75. package/dist/array/zip.mjs +1 -1
  76. package/dist/array/zipObject.mjs +1 -1
  77. package/dist/array/zipWith.d.mts +5 -0
  78. package/dist/array/zipWith.d.ts +5 -0
  79. package/dist/array/zipWith.js.map +1 -1
  80. package/dist/array/zipWith.mjs +2 -2
  81. package/dist/browser.js +22 -58
  82. package/dist/browser.js.map +1 -1
  83. package/dist/browser.mjs +54 -53
  84. package/dist/browser.mjs.map +1 -1
  85. package/dist/{chunk-QXTNZR7B.mjs → chunk-3SBT6WDU.mjs} +2 -2
  86. package/dist/{chunk-O64NE2P4.mjs → chunk-4DFAGGIM.mjs} +3 -3
  87. package/dist/{chunk-O64NE2P4.mjs.map → chunk-4DFAGGIM.mjs.map} +1 -1
  88. package/dist/{chunk-Y5V7UAZZ.mjs → chunk-4ZES5T6V.mjs} +4 -4
  89. package/dist/{chunk-TJ4Z5I7M.mjs → chunk-DLS7UJKJ.mjs} +1 -1
  90. package/dist/chunk-DLS7UJKJ.mjs.map +1 -0
  91. package/dist/{chunk-KPBQ7OUY.mjs → chunk-DTTKJ3VC.mjs} +1 -1
  92. package/dist/chunk-DTTKJ3VC.mjs.map +1 -0
  93. package/dist/{chunk-YNJH6GEG.mjs → chunk-EEHJ656S.mjs} +95 -92
  94. package/dist/chunk-EEHJ656S.mjs.map +1 -0
  95. package/dist/{chunk-EYYZQFOP.mjs → chunk-ET33L3MQ.mjs} +2 -2
  96. package/dist/chunk-EZYYB34V.mjs +17 -0
  97. package/dist/{chunk-CVVZHOJX.mjs.map → chunk-EZYYB34V.mjs.map} +1 -1
  98. package/dist/{chunk-HM2JT2RX.mjs → chunk-FZZNWXDM.mjs} +1 -1
  99. package/dist/chunk-FZZNWXDM.mjs.map +1 -0
  100. package/dist/{chunk-YFN6KOC4.mjs → chunk-GTFDDKZ2.mjs} +1 -1
  101. package/dist/chunk-GTFDDKZ2.mjs.map +1 -0
  102. package/dist/{chunk-F3WCQQET.mjs → chunk-IWXZI3QT.mjs} +2 -2
  103. package/dist/chunk-J5LGTIGS.mjs +10 -0
  104. package/dist/{chunk-UYZKMBDO.mjs → chunk-JCRY7ZYS.mjs} +1 -1
  105. package/dist/chunk-JCRY7ZYS.mjs.map +1 -0
  106. package/dist/{chunk-5CPXZFCB.mjs → chunk-K5WL54BY.mjs} +2 -2
  107. package/dist/{chunk-5CPXZFCB.mjs.map → chunk-K5WL54BY.mjs.map} +1 -1
  108. package/dist/{chunk-4KYXHZ4R.mjs → chunk-MJ7LNBI6.mjs} +1 -1
  109. package/dist/chunk-MJ7LNBI6.mjs.map +1 -0
  110. package/dist/{chunk-3IP4JVLL.mjs → chunk-MSHSKENG.mjs} +3 -3
  111. package/dist/{chunk-3IP4JVLL.mjs.map → chunk-MSHSKENG.mjs.map} +1 -1
  112. package/dist/{chunk-WVQ7YVRK.mjs → chunk-OG2RLT5U.mjs} +2 -3
  113. package/dist/{chunk-WVQ7YVRK.mjs.map → chunk-OG2RLT5U.mjs.map} +1 -1
  114. package/dist/{chunk-DTJJIMKJ.mjs → chunk-PJPGJ2O6.mjs} +1 -1
  115. package/dist/chunk-PJPGJ2O6.mjs.map +1 -0
  116. package/dist/chunk-R6GLTTAB.mjs +9 -0
  117. package/dist/chunk-R6GLTTAB.mjs.map +1 -0
  118. package/dist/{chunk-5IKVJGHO.mjs → chunk-RTFTLCF3.mjs} +2 -2
  119. package/dist/{chunk-OP4OAKQJ.mjs → chunk-XHSIT5DL.mjs} +1 -1
  120. package/dist/chunk-XHSIT5DL.mjs.map +1 -0
  121. package/dist/{chunk-WFZXCGEG.mjs → chunk-YOPFSFTD.mjs} +2 -6
  122. package/dist/{chunk-WFZXCGEG.mjs.map → chunk-YOPFSFTD.mjs.map} +1 -1
  123. package/dist/chunk-YXD3AQAK.mjs +1 -0
  124. package/dist/{chunk-CRSKT4WW.mjs → chunk-Z7HWEOQX.mjs} +2 -3
  125. package/dist/{chunk-CRSKT4WW.mjs.map → chunk-Z7HWEOQX.mjs.map} +1 -1
  126. package/dist/chunk-ZPNX2QDE.mjs +13 -0
  127. package/dist/{chunk-IIDZ3KAJ.mjs.map → chunk-ZPNX2QDE.mjs.map} +1 -1
  128. package/dist/compat/index.d.mts +3 -1
  129. package/dist/compat/index.d.ts +3 -1
  130. package/dist/compat/index.js +23 -57
  131. package/dist/compat/index.js.map +1 -1
  132. package/dist/compat/index.mjs +98 -94
  133. package/dist/error/AbortError.mjs +1 -1
  134. package/dist/error/TimeoutError.mjs +1 -1
  135. package/dist/error/index.mjs +4 -4
  136. package/dist/function/after.mjs +1 -1
  137. package/dist/function/debounce.js +2 -2
  138. package/dist/function/debounce.js.map +1 -1
  139. package/dist/function/debounce.mjs +2 -2
  140. package/dist/function/index.js +2 -2
  141. package/dist/function/index.js.map +1 -1
  142. package/dist/function/index.mjs +10 -10
  143. package/dist/function/negate.mjs +1 -1
  144. package/dist/function/noop.mjs +1 -1
  145. package/dist/function/once.mjs +1 -1
  146. package/dist/function/throttle.mjs +1 -1
  147. package/dist/index.d.mts +1 -0
  148. package/dist/index.d.ts +1 -0
  149. package/dist/index.js +20 -53
  150. package/dist/index.js.map +1 -1
  151. package/dist/index.mjs +97 -93
  152. package/dist/math/clamp.mjs +1 -1
  153. package/dist/math/inRange.mjs +1 -1
  154. package/dist/math/index.mjs +1 -1
  155. package/dist/math/mean.mjs +1 -1
  156. package/dist/math/meanBy.mjs +1 -1
  157. package/dist/math/random.mjs +1 -1
  158. package/dist/math/randomInt.mjs +1 -1
  159. package/dist/math/range.mjs +1 -1
  160. package/dist/math/round.mjs +1 -1
  161. package/dist/math/sum.mjs +1 -1
  162. package/dist/math/sumBy.mjs +1 -1
  163. package/dist/object/clone.mjs +1 -1
  164. package/dist/object/cloneDeep.js +1 -1
  165. package/dist/object/cloneDeep.js.map +1 -1
  166. package/dist/object/cloneDeep.mjs +2 -2
  167. package/dist/object/flattenObject.mjs +1 -1
  168. package/dist/object/index.js +2 -16
  169. package/dist/object/index.js.map +1 -1
  170. package/dist/object/index.mjs +3 -3
  171. package/dist/object/invert.mjs +1 -1
  172. package/dist/object/omit.js +1 -15
  173. package/dist/object/omit.js.map +1 -1
  174. package/dist/object/omit.mjs +2 -2
  175. package/dist/object/omitBy.mjs +1 -1
  176. package/dist/object/pick.mjs +1 -1
  177. package/dist/object/pickBy.mjs +1 -1
  178. package/dist/predicate/index.d.mts +1 -0
  179. package/dist/predicate/index.d.ts +1 -0
  180. package/dist/predicate/index.js +7 -0
  181. package/dist/predicate/index.js.map +1 -1
  182. package/dist/predicate/index.mjs +9 -5
  183. package/dist/predicate/isArrayLike.mjs +1 -1
  184. package/dist/predicate/isEqual.mjs +1 -1
  185. package/dist/predicate/isFunction.mjs +1 -1
  186. package/dist/predicate/isLength.mjs +1 -1
  187. package/dist/predicate/isNil.mjs +1 -1
  188. package/dist/predicate/isNotNil.mjs +1 -1
  189. package/dist/predicate/isNull.mjs +1 -1
  190. package/dist/predicate/isPlainObject.mjs +1 -1
  191. package/dist/predicate/isPrimitive.d.mts +17 -0
  192. package/dist/predicate/isPrimitive.d.ts +17 -0
  193. package/dist/predicate/isPrimitive.js +33 -0
  194. package/dist/predicate/isPrimitive.js.map +1 -0
  195. package/dist/predicate/isPrimitive.mjs +8 -0
  196. package/dist/predicate/isPrimitive.mjs.map +1 -0
  197. package/dist/predicate/isTypedArray.mjs +1 -1
  198. package/dist/predicate/isUndefined.mjs +1 -1
  199. package/dist/promise/delay.js +2 -2
  200. package/dist/promise/delay.js.map +1 -1
  201. package/dist/promise/delay.mjs +2 -2
  202. package/dist/promise/index.js +7 -31
  203. package/dist/promise/index.js.map +1 -1
  204. package/dist/promise/index.mjs +5 -5
  205. package/dist/promise/timeout.js +5 -27
  206. package/dist/promise/timeout.js.map +1 -1
  207. package/dist/promise/timeout.mjs +4 -4
  208. package/dist/promise/withTimeout.js +7 -31
  209. package/dist/promise/withTimeout.js.map +1 -1
  210. package/dist/promise/withTimeout.mjs +5 -5
  211. package/dist/string/camelCase.js +1 -2
  212. package/dist/string/camelCase.js.map +1 -1
  213. package/dist/string/camelCase.mjs +3 -3
  214. package/dist/string/capitalize.mjs +1 -1
  215. package/dist/string/index.js +1 -2
  216. package/dist/string/index.js.map +1 -1
  217. package/dist/string/index.mjs +9 -9
  218. package/dist/string/kebabCase.js +1 -2
  219. package/dist/string/kebabCase.js.map +1 -1
  220. package/dist/string/kebabCase.mjs +3 -3
  221. package/dist/string/lowerCase.js +1 -2
  222. package/dist/string/lowerCase.js.map +1 -1
  223. package/dist/string/lowerCase.mjs +3 -3
  224. package/dist/string/snakeCase.js +1 -2
  225. package/dist/string/snakeCase.js.map +1 -1
  226. package/dist/string/snakeCase.mjs +3 -3
  227. package/dist/string/startCase.js +1 -2
  228. package/dist/string/startCase.js.map +1 -1
  229. package/dist/string/startCase.mjs +3 -3
  230. package/package.json +1 -1
  231. package/umd/browser.global.js +1 -1
  232. package/dist/chunk-24FKGR6U.mjs +0 -47
  233. package/dist/chunk-4KYXHZ4R.mjs.map +0 -1
  234. package/dist/chunk-CVVZHOJX.mjs +0 -22
  235. package/dist/chunk-DTJJIMKJ.mjs.map +0 -1
  236. package/dist/chunk-HM2JT2RX.mjs.map +0 -1
  237. package/dist/chunk-IIDZ3KAJ.mjs +0 -18
  238. package/dist/chunk-KPBQ7OUY.mjs.map +0 -1
  239. package/dist/chunk-OP4OAKQJ.mjs.map +0 -1
  240. package/dist/chunk-STL6TD3L.mjs +0 -1
  241. package/dist/chunk-TJ4Z5I7M.mjs.map +0 -1
  242. package/dist/chunk-UYZKMBDO.mjs.map +0 -1
  243. package/dist/chunk-YFN6KOC4.mjs.map +0 -1
  244. package/dist/chunk-YNJH6GEG.mjs.map +0 -1
  245. /package/dist/{chunk-QXTNZR7B.mjs.map → chunk-3SBT6WDU.mjs.map} +0 -0
  246. /package/dist/{chunk-Y5V7UAZZ.mjs.map → chunk-4ZES5T6V.mjs.map} +0 -0
  247. /package/dist/{chunk-EYYZQFOP.mjs.map → chunk-ET33L3MQ.mjs.map} +0 -0
  248. /package/dist/{chunk-F3WCQQET.mjs.map → chunk-IWXZI3QT.mjs.map} +0 -0
  249. /package/dist/{chunk-24FKGR6U.mjs.map → chunk-J5LGTIGS.mjs.map} +0 -0
  250. /package/dist/{chunk-5IKVJGHO.mjs.map → chunk-RTFTLCF3.mjs.map} +0 -0
  251. /package/dist/{chunk-STL6TD3L.mjs.map → chunk-YXD3AQAK.mjs.map} +0 -0
package/package.json CHANGED
@@ -1,7 +1,7 @@
1
1
  {
2
2
  "name": "es-toolkit",
3
3
  "description": "A state-of-the-art, high-performance JavaScript utility library with a small bundle size and strong type annotations.",
4
- "version": "1.13.1-dev.320+2df30f70",
4
+ "version": "1.13.1-dev.322+93beef37",
5
5
  "homepage": "https://es-toolkit.slash.page",
6
6
  "bugs": "https://github.com/toss/es-toolkit/issues",
7
7
  "repository": {
@@ -1,2 +1,2 @@
1
- "use strict";(()=>{var q=Object.defineProperty;var L=Object.getOwnPropertySymbols;var Ut=Object.prototype.hasOwnProperty,Rt=Object.prototype.propertyIsEnumerable;var _=(e,t,n)=>t in e?q(e,t,{enumerable:!0,configurable:!0,writable:!0,value:n}):e[t]=n,$=(e,t)=>{for(var n in t||(t={}))Ut.call(t,n)&&_(e,n,t[n]);if(L)for(var n of L(t))Rt.call(t,n)&&_(e,n,t[n]);return e};var vt=(e,t)=>{for(var n in t)q(e,n,{get:t[n],enumerable:!0})};var h=(e,t,n)=>new Promise((r,o)=>{var i=f=>{try{u(n.next(f))}catch(c){o(c)}},a=f=>{try{u(n.throw(f))}catch(c){o(c)}},u=f=>f.done?r(f.value):Promise.resolve(f.value).then(i,a);u((n=n.apply(e,t)).next())});var C={};vt(C,{AbortError:()=>m,TimeoutError:()=>y,after:()=>Ie,camelCase:()=>it,capitalize:()=>B,chunk:()=>lt,clamp:()=>Be,clone:()=>Ge,cloneDeep:()=>T,compact:()=>X,concat:()=>ct,countBy:()=>j,debounce:()=>Oe,delay:()=>M,difference:()=>Tt,differenceBy:()=>b,differenceWith:()=>K,drop:()=>Y,dropRight:()=>H,dropRightWhile:()=>Z,dropWhile:()=>J,endsWith:()=>At,fill:()=>pt,first:()=>V,flatMap:()=>ee,flatten:()=>s,flattenDeep:()=>te,flattenObject:()=>je,forEachRight:()=>ne,get:()=>xt,groupBy:()=>re,head:()=>V,inRange:()=>We,initial:()=>Pe,intersection:()=>A,intersectionBy:()=>k,intersectionWith:()=>w,invert:()=>$e,isArray:()=>gt,isArrayLike:()=>tt,isEqual:()=>N,isFunction:()=>et,isLength:()=>D,isNil:()=>He,isNotNil:()=>Ze,isNull:()=>Je,isPlainObject:()=>ht,isTypedArray:()=>bt,isUndefined:()=>Qe,kebabCase:()=>ut,keyBy:()=>oe,last:()=>ve,lowerCase:()=>ft,max:()=>kt,maxBy:()=>ie,mean:()=>F,meanBy:()=>Se,min:()=>wt,minBy:()=>ae,negate:()=>Me,noop:()=>Ee,omit:()=>ze,omitBy:()=>Le,once:()=>Fe,orderBy:()=>ue,partition:()=>fe,pick:()=>_e,pickBy:()=>qe,random:()=>U,randomInt:()=>R,range:()=>Ce,round:()=>Ve,sample:()=>se,sampleSize:()=>le,set:()=>S,shuffle:()=>ce,snakeCase:()=>at,startCase:()=>st,startsWith:()=>Kt,sum:()=>d,sumBy:()=>Ne,tail:()=>Ue,take:()=>Te,takeRight:()=>pe,takeRightWhile:()=>me,takeWhile:()=>ye,throttle:()=>De,toFilled:()=>Re,union:()=>p,unionBy:()=>P,unionWith:()=>O,uniq:()=>v,uniqBy:()=>de,uniqWith:()=>I,unzip:()=>xe,unzipWith:()=>he,withTimeout:()=>ot,without:()=>we,xor:()=>ge,xorBy:()=>be,xorWith:()=>Ke,zip:()=>E,zipObject:()=>Ae,zipObjectDeep:()=>yt,zipWith:()=>ke});function G(e,t){if(!Number.isInteger(t)||t<=0)throw new Error("Size must be an integer greater than zero.");let n=Math.ceil(e.length/t),r=Array(n);for(let o=0;o<n;o++){let i=o*t,a=i+t;r[o]=e.slice(i,a)}return r}function X(e){let t=[];for(let n of e)n&&t.push(n);return t}function j(e,t){var r;let n={};for(let o of e){let i=t(o);n[i]=((r=n[i])!=null?r:0)+1}return n}function g(e,t){let n=new Set(t);return e.filter(r=>!n.has(r))}function b(e,t,n){let r=new Set(t.map(o=>n(o)));return e.filter(o=>!r.has(n(o)))}function K(e,t,n){return e.filter(r=>t.every(o=>!n(r,o)))}function Y(e,t){return t=Math.max(t,0),e.slice(t)}function H(e,t){return t=Math.min(-t,0),t===0?e.slice():e.slice(0,t)}function Z(e,t){for(let n=e.length-1;n>=0;n--)if(!t(e[n]))return e.slice(0,n+1);return[]}function J(e,t){let n=e.findIndex(r=>!t(r));return n===-1?[]:e.slice(n)}function Q(e,t,n=0,r=e.length){let o=e.length,i=Math.max(n>=0?n:o+n,0),a=Math.min(r>=0?r:o+r,o);for(let u=i;u<a;u++)e[u]=t;return e}function s(e,t=1){let n=[],r=Math.floor(t),o=(i,a)=>{for(let u of i)Array.isArray(u)&&a<r?o(u,a+1):n.push(u)};return o(e,0),n}function ee(e,t,n=1){return s(e.map(r=>t(r)),n)}function te(e){return s(e,1/0)}function ne(e,t){for(let n=e.length-1;n>=0;n--){let r=e[n];t(r,n,e)}}function re(e,t){let n={};for(let r of e){let o=t(r);n[o]==null&&(n[o]=[]),n[o].push(r)}return n}function A(e,t){let n=new Set(t);return e.filter(r=>n.has(r))}function k(e,t,n){let r=new Set(t.map(n));return e.filter(o=>r.has(n(o)))}function w(e,t,n){return e.filter(r=>t.some(o=>n(r,o)))}function oe(e,t){let n={};for(let r of e){let o=t(r);n[o]=r}return n}function ie(e,t){let n=e[0],r=-1/0;for(let o of e){let i=t(o);i>r&&(r=i,n=o)}return n}function ae(e,t){let n=e[0],r=1/0;for(let o of e){let i=t(o);i<r&&(r=i,n=o)}return n}function ue(e,t,n){let r=(i,a,u)=>i<a?u==="asc"?-1:1:i>a?u==="asc"?1:-1:0,o=t.map((i,a)=>n[a]||n[n.length-1]);return e.slice().sort((i,a)=>{for(let u=0;u<t.length;u++){let f=t[u],c=o[u],z=r(i[f],a[f],c);if(z!==0)return z}return 0})}function fe(e,t){let n=[],r=[];for(let o of e)t(o)?n.push(o):r.push(o);return[n,r]}function se(e){let t=Math.floor(Math.random()*e.length);return e[t]}function U(e,t){if(t==null&&(t=e,e=0),e>=t)throw new Error("Invalid input: The maximum value must be greater than the minimum value.");return Math.random()*(t-e)+e}function R(e,t){return Math.floor(U(e,t))}function le(e,t){if(t>e.length)throw new Error("Size must be less than or equal to the length of array.");let n=new Array(t),r=new Set;for(let o=e.length-t,i=0;o<e.length;o++,i++){let a=R(0,o+1);r.has(a)&&(a=o),r.add(a),n[i]=e[a]}return n}function ce(e){let t=e.slice();for(let n=t.length-1;n>=1;n--){let r=Math.floor(Math.random()*(n+1));[t[n],t[r]]=[t[r],t[n]]}return t}function Te(e,t){return e.slice(0,t)}function pe(e,t=1){return t<=0?[]:e.slice(-t)}function me(e,t){for(let n=e.length-1;n>=0;n--)if(!t(e[n]))return e.slice(n+1);return e.slice()}function ye(e,t){let n=[];for(let r of e){if(!t(r))break;n.push(r)}return n}function v(e){return Array.from(new Set(e))}function p(e,t){return v(e.concat(t))}function P(e,t,n){let r=new Map;for(let o of[...e,...t]){let i=n(o);r.has(i)||r.set(i,o)}return Array.from(r.values())}function I(e,t){let n=[];for(let r of e)n.every(i=>!t(i,r))&&n.push(r);return n}function O(e,t,n){return I(e.concat(t),n)}function de(e,t){let n=new Map;for(let r of e){let o=t(r);n.has(o)||n.set(o,r)}return Array.from(n.values())}function xe(e){let t=0;for(let r=0;r<e.length;r++)e[r].length>t&&(t=e[r].length);let n=new Array(t);for(let r=0;r<t;r++){n[r]=new Array(e.length);for(let o=0;o<e.length;o++)n[r][o]=e[o][r]}return n}function he(e,t){let n=Math.max(...e.map(o=>o.length)),r=new Array(n);for(let o=0;o<n;o++){let i=new Array(e.length);for(let a=0;a<e.length;a++)i[a]=e[a][o];r[o]=t(...i)}return r}function ge(e,t){return g(p(e,t),A(e,t))}function be(e,t,n){let r=P(e,t,n),o=k(e,t,n);return b(r,o,n)}function Ke(e,t,n){let r=O(e,t,n),o=w(e,t,n);return K(r,o,n)}function E(...e){let t=[],n=Math.max(...e.map(r=>r.length));for(let r=0;r<n;r++){let o=[];for(let i of e)o.push(i[r]);t.push(o)}return t}function Ae(e,t){let n={};for(let r=0;r<e.length;r++)n[e[r]]=t[r];return n}function ke(e,...t){let n=[e,...t.slice(0,-1)],r=t[t.length-1],o=[],i=Math.max(...n.map(a=>a.length));for(let a=0;a<i;a++){let u=n.map(f=>f[a]);o.push(r(...u))}return o}function we(e,...t){let n=new Set(t);return e.filter(r=>!n.has(r))}function V(e){return e[0]}function Ue(e){let t=e.length;if(t<=1)return[];let n=new Array(t-1);for(let r=1;r<t;r++)n[r-1]=e[r];return n}function Re(e,t,n=0,r=e.length){let o=e.length,i=Math.max(n>=0?n:o+n,0),a=Math.min(r>=0?r:o+r,o),u=e.slice();for(let f=i;f<a;f++)u[f]=t;return u}function ve(e){return e[e.length-1]}function Pe(e){return e.length<=1?[]:e.slice(0,-1)}var m=class extends Error{constructor(t="The operation was aborted"){super(t),this.name="AbortError"}};var y=class extends Error{constructor(t="The operation was timed out"){super(t),this.name="TimeoutError"}};var Ie=(e,t)=>{if(!Number.isInteger(e)||e<0)throw new Error("n must be a non-negative integer.");let n=0;return(...r)=>{if(++n>=e)return t(...r)}};function Oe(e,t,{signal:n}={}){let r=null,o=function(...a){r!==null&&clearTimeout(r),!(n!=null&&n.aborted)&&(r=setTimeout(()=>{e(...a),r=null},t))},i=function(){o.cancel()};return o.cancel=function(){r!==null&&(clearTimeout(r),r=null)},n==null||n.addEventListener("abort",i,{once:!0}),o}function Ee(){}function Fe(e){let t=!1,n;return function(){if(t)return n;let r=e();return t=!0,n=r,r}}function De(e,t){let n;return function(...o){let i=Date.now();(n==null||i-n>=t)&&(n=i,e(...o))}}function Me(e){return(...t)=>!e(...t)}function Be(e,t,n){return n==null?Math.min(e,t):Math.min(Math.max(e,t),n)}function We(e,t,n){if(n==null&&(n=t,t=0),t>=n)throw new Error("The maximum value must be greater than the minimum value.");return t<=e&&e<n}function d(e){let t=0;for(let n=0;n<e.length;n++)t+=e[n];return t}function F(e){return d(e)/e.length}function Se(e,t){let n=e.map(r=>t(r));return F(n)}function Ve(e,t=0){if(!Number.isInteger(t))throw new Error("Precision must be an integer.");let n=Math.pow(10,t);return Math.round(e*n)/n}function Ne(e,t){let n=e.map(r=>t(r));return d(n)}function Ce(e,t,n){if(t==null&&(t=e,e=0),n==null&&(n=1),!Number.isInteger(n)||n===0)throw new Error("The step value must be a non-zero integer.");let r=Math.max(Math.ceil((t-e)/n),0),o=new Array(r);for(let i=0;i<r;i++)o[i]=e+i*n;return o}function ze(e,t){let n=$({},e);for(let r of t)delete n[r];return n}function Le(e,t){let n={};for(let[r,o]of Object.entries(e))t(o,r)||(n[r]=o);return n}function _e(e,t){let n={};for(let r of t)n[r]=e[r];return n}function qe(e,t){let n={};for(let[r,o]of Object.entries(e))t(o,r)&&(n[r]=o);return n}function $e(e){let t={},n=Object.keys(e);for(let r=0;r<n.length;r++){let o=n[r],i=e[o];t[i]=o}return t}function Ge(e){if(Pt(e))return e;if(Array.isArray(e))return e.slice();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 t=new Map;for(let[n,r]of e)t.set(n,r);return t}if(e instanceof Set){let t=new Set;for(let n of e)t.add(n);return t}if(typeof e=="object"){let t=Object.getPrototypeOf(e),n=Object.create(t);return Object.assign(n,e)}return e}function Pt(e){return e==null||typeof e!="object"&&typeof e!="function"}function T(e){if(It(e))return e;if(Array.isArray(e))return e.map(t=>T(t));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 t=new Map;for(let[n,r]of e.entries())t.set(n,T(r));return t}if(e instanceof Set){let t=new Set;for(let n of e.values())t.add(T(n));return t}if(Ot(e)){let t=new(Object.getPrototypeOf(e)).constructor(e.length);for(let n=0;n<e.length;n++)t[n]=T(e[n]);return t}if(e instanceof ArrayBuffer||e instanceof SharedArrayBuffer)return e.slice(0);if(e instanceof DataView){let t=new DataView(e.buffer.slice(0));return x(e,t),t}if(typeof File!="undefined"&&e instanceof File){let t=new File([e],e.name,{type:e.type});return x(e,t),t}if(e instanceof Blob){let t=new Blob([e],{type:e.type});return x(e,t),t}if(e instanceof Error){let t=new e.constructor;return t.message=e.message,t.name=e.name,t.stack=e.stack,t.cause=e.cause,x(e,t),t}if(typeof e=="object"&&e!==null){let t={};return x(e,t),t}if(typeof e!="function")return e}function It(e){return e==null||typeof e!="object"&&typeof e!="function"}function x(e,t){for(let n in e)if(Object.prototype.hasOwnProperty.call(e,n)){let r=Object.getOwnPropertyDescriptor(e,n);(r!=null&&r.writable||r!=null&&r.set)&&typeof(r==null?void 0:r.value)!="function"&&(t[n]=T(e[n]))}}function Ot(e){return e instanceof Uint8Array||e instanceof Uint8ClampedArray||e instanceof Uint16Array||e instanceof Uint32Array||e instanceof BigUint64Array||e instanceof Int8Array||e instanceof Int16Array||e instanceof Int32Array||e instanceof BigInt64Array||e instanceof Float32Array||e instanceof Float64Array}function Xe(e){if(typeof e!="object"||e==null)return!1;if(Object.getPrototypeOf(e)===null)return!0;if(e.toString()!=="[object Object]")return!1;let t=e;for(;Object.getPrototypeOf(t)!==null;)t=Object.getPrototypeOf(t);return Object.getPrototypeOf(e)===t}function je(e){return Ye(e)}function Ye(e,t=""){let n={},r=Object.keys(e);for(let o=0;o<r.length;o++){let i=r[o],a=e[i],u=t?`${t}.${i}`:i;if(Xe(a)&&Object.keys(a).length>0){Object.assign(n,Ye(a,u));continue}if(Array.isArray(a)){for(let f=0;f<a.length;f++)n[`${u}.${f}`]=a[f];continue}n[u]=a}return n}function N(e,t){if(Object.is(e,t))return!0;if(e instanceof Date&&t instanceof Date)return e.getTime()===t.getTime();if(e instanceof RegExp&&t instanceof RegExp)return e.source===t.source&&e.flags===t.flags;if(typeof e!="object"||typeof t!="object"||e===null||t===null)return!1;let n=Object.keys(e),r=Object.keys(t);if(n.length!==r.length||p(n,r).length!==n.length)return!1;for(let o=0;o<n.length;o++){let i=n[o],a=e[i],u=t[i];if(!N(a,u))return!1}return!0}function He(e){return e==null}function Ze(e){return e!=null}function Je(e){return e===null}function Qe(e){return e===void 0}function D(e){return typeof e=="number"&&e>-1&&e%1===0&&e<=Number.MAX_SAFE_INTEGER}function et(e){return typeof e=="function"}function tt(e){return e!=null&&typeof e!="function"&&D(e.length)}function nt(e){return e instanceof Uint8Array||e instanceof Uint8ClampedArray||e instanceof Uint16Array||e instanceof Uint32Array||e instanceof BigUint64Array||e instanceof Int8Array||e instanceof Int16Array||e instanceof Int32Array||e instanceof BigInt64Array||e instanceof Float32Array||e instanceof Float64Array}function M(e,{signal:t}={}){return new Promise((n,r)=>{let o=()=>{r(new m)},i=()=>{clearTimeout(a),o()};if(t!=null&&t.aborted)return o();let a=setTimeout(n,e);t==null||t.addEventListener("abort",i,{once:!0})})}function rt(e){return h(this,null,function*(){throw yield M(e),new y})}function ot(e,t){return h(this,null,function*(){return Promise.race([e(),rt(t)])})}var B=e=>e.charAt(0).toUpperCase()+e.slice(1).toLowerCase();var Et=/[A-Z]?[a-z]+|[0-9]+|[A-Z]+(?![a-z])/g;function l(e){var t;return Array.from((t=e.match(Et))!=null?t:[])}function it(e){let t=l(e);if(t.length===0)return"";let[n,...r]=t;return`${n.toLowerCase()}${r.map(o=>B(o)).join("")}`}var at=e=>l(e).map(n=>n.toLowerCase()).join("_");var ut=e=>l(e).map(n=>n.toLowerCase()).join("-");var ft=e=>l(e).map(n=>n.toLowerCase()).join(" ");function st(e){let t=l(e.trim()),n="";for(let r of t)n&&(n+=" "),r===r.toUpperCase()?n+=r:n+=r[0].toUpperCase()+r.slice(1).toLowerCase();return n}function lt(e,t=1){return t=Math.max(Math.floor(t),0),t===0?[]:G(e,t)}function ct(...e){return s(e)}function Tt(e,...t){let n=e,r=s(t);return g(n,r)}function pt(e,t,n=0,r=e.length){return n=Math.floor(n),r=Math.floor(r),n||(n=0),r||(r=0),Q(e,t,n,r)}var Ft=/^(?:0|[1-9]\d*)$/;function mt(e){switch(typeof e){case"number":return Number.isInteger(e)&&e>=0&&e<Number.MAX_SAFE_INTEGER;case"symbol":return!1;case"string":return Ft.test(e)}}function W(e){let t=/\\(\\)?/g,n=RegExp(`[^.[\\]]+|\\[(?:([^"'][^[]*)|(["'])((?:(?!\\2)[^\\\\]|\\\\.)*?)\\2)\\]|(?=(?:\\.|\\[\\])(?:\\.|\\[\\]|$))`,"g"),r=[];e[0]==="."&&r.push("");let o,i=0;for(;(o=n.exec(e))!==null;){let a=o[0],u=o[1],f=o[2],c=o[3];f?a=c.replace(t,"$1"):u&&(a=u),r.push(a),n.lastIndex===i?n.lastIndex++:i=n.lastIndex}return r}function S(e,t,n){let r=Array.isArray(t)?t:typeof t=="string"?W(t):[t],o=e;for(let a=0;a<r.length-1;a++){let u=r[a],f=r[a+1];o[u]==null&&(o[u]=mt(f)?[]:{}),o=o[u]}let i=r[r.length-1];return o[i]=n,e}function yt(e,t){let n={},r=E(e,t);for(let o=0;o<r.length;o++){let[i,a]=r[o];i!=null&&S(n,i,a)}return n}var Dt=/^\w*$/,Mt=/\.|\[(?:[^[\]]*|(["'])(?:(?!\1)[^\\]|\\.)*?\1)\]/;function dt(e){switch(typeof e){case"number":case"symbol":return!1;case"string":return!Dt.test(e)&&Mt.test(e)}}function xt(e,t,n){let r;if(Array.isArray(t)?r=t:typeof t=="string"&&dt(t)&&(e==null?void 0:e[t])==null?r=W(t):r=[t],r.length===0)return n;let o=e,i;for(i=0;i<r.length&&o!=null;i++){let a=r[i];Object.is(a.valueOf(),-0)&&(a="-0"),o=o[a]}return o===null&&i===r.length||o!=null?o:n}function ht(e){var n;if(typeof e!="object"||e==null)return!1;if(Object.getPrototypeOf(e)===null)return!0;if(e.toString()!=="[object Object]"){let r=e[Symbol.toStringTag];return r==null||!((n=Object.getOwnPropertyDescriptor(e,Symbol.toStringTag))!=null&&n.writable)?!1:e.toString()===`[object ${r}]`}let t=e;for(;Object.getPrototypeOf(t)!==null;)t=Object.getPrototypeOf(t);return Object.getPrototypeOf(e)===t}function gt(e){return Array.isArray(e)}function bt(e){return nt(e)}var Kt=(e,t,n=0)=>e.startsWith(t,n);var At=(e,t,n=e.length)=>e.endsWith(t,n);function kt(e=[]){let t=e[0],n;for(let r of e)(n==null||r>n)&&(n=r,t=r);return t}function wt(e=[]){let t=e[0],n;for(let r of e)(n==null||r<n)&&(n=r,t=r);return t}window._=C;})();
1
+ "use strict";(()=>{var Kt=Object.defineProperty;var At=(e,t)=>{for(var n in t)Kt(e,n,{get:t[n],enumerable:!0})};var N={};At(N,{AbortError:()=>T,TimeoutError:()=>m,after:()=>we,camelCase:()=>tt,capitalize:()=>D,chunk:()=>at,clamp:()=>Oe,clone:()=>ze,cloneDeep:()=>c,compact:()=>L,concat:()=>ut,countBy:()=>_,debounce:()=>Ue,delay:()=>F,difference:()=>st,differenceBy:()=>g,differenceWith:()=>h,drop:()=>q,dropRight:()=>j,dropRightWhile:()=>$,dropWhile:()=>G,endsWith:()=>gt,fill:()=>ft,first:()=>S,flatMap:()=>Y,flatten:()=>f,flattenDeep:()=>H,flattenObject:()=>_e,forEachRight:()=>Z,get:()=>Tt,groupBy:()=>J,head:()=>S,inRange:()=>Ee,initial:()=>ke,intersection:()=>b,intersectionBy:()=>K,intersectionWith:()=>A,invert:()=>Ce,isArray:()=>yt,isArrayLike:()=>He,isEqual:()=>V,isFunction:()=>Ye,isLength:()=>E,isNil:()=>je,isNotNil:()=>$e,isNull:()=>Ge,isPlainObject:()=>mt,isPrimitive:()=>Je,isTypedArray:()=>dt,isUndefined:()=>Xe,kebabCase:()=>rt,keyBy:()=>Q,last:()=>Ae,lowerCase:()=>ot,max:()=>ht,maxBy:()=>ee,mean:()=>O,meanBy:()=>Fe,min:()=>bt,minBy:()=>te,negate:()=>Ie,noop:()=>Re,omit:()=>We,omitBy:()=>Se,once:()=>ve,orderBy:()=>ne,partition:()=>re,pick:()=>Ve,pickBy:()=>Ne,random:()=>k,randomInt:()=>w,range:()=>Be,round:()=>De,sample:()=>oe,sampleSize:()=>ie,set:()=>B,shuffle:()=>ae,snakeCase:()=>nt,startCase:()=>it,startsWith:()=>xt,sum:()=>y,sumBy:()=>Me,tail:()=>be,take:()=>ue,takeRight:()=>se,takeRightWhile:()=>fe,takeWhile:()=>le,throttle:()=>Pe,toFilled:()=>Ke,union:()=>p,unionBy:()=>R,unionWith:()=>P,uniq:()=>U,uniqBy:()=>ce,uniqWith:()=>v,unzip:()=>pe,unzipWith:()=>Te,withTimeout:()=>et,without:()=>he,xor:()=>me,xorBy:()=>ye,xorWith:()=>de,zip:()=>I,zipObject:()=>xe,zipObjectDeep:()=>ct,zipWith:()=>ge});function z(e,t){if(!Number.isInteger(t)||t<=0)throw new Error("Size must be an integer greater than zero.");let n=Math.ceil(e.length/t),r=Array(n);for(let o=0;o<n;o++){let i=o*t,a=i+t;r[o]=e.slice(i,a)}return r}function L(e){let t=[];for(let n of e)n&&t.push(n);return t}function _(e,t){let n={};for(let r of e){let o=t(r);n[o]=(n[o]??0)+1}return n}function x(e,t){let n=new Set(t);return e.filter(r=>!n.has(r))}function g(e,t,n){let r=new Set(t.map(o=>n(o)));return e.filter(o=>!r.has(n(o)))}function h(e,t,n){return e.filter(r=>t.every(o=>!n(r,o)))}function q(e,t){return t=Math.max(t,0),e.slice(t)}function j(e,t){return t=Math.min(-t,0),t===0?e.slice():e.slice(0,t)}function $(e,t){for(let n=e.length-1;n>=0;n--)if(!t(e[n]))return e.slice(0,n+1);return[]}function G(e,t){let n=e.findIndex(r=>!t(r));return n===-1?[]:e.slice(n)}function X(e,t,n=0,r=e.length){let o=e.length,i=Math.max(n>=0?n:o+n,0),a=Math.min(r>=0?r:o+r,o);for(let u=i;u<a;u++)e[u]=t;return e}function f(e,t=1){let n=[],r=Math.floor(t),o=(i,a)=>{for(let u of i)Array.isArray(u)&&a<r?o(u,a+1):n.push(u)};return o(e,0),n}function Y(e,t,n=1){return f(e.map(r=>t(r)),n)}function H(e){return f(e,1/0)}function Z(e,t){for(let n=e.length-1;n>=0;n--){let r=e[n];t(r,n,e)}}function J(e,t){let n={};for(let r of e){let o=t(r);n[o]==null&&(n[o]=[]),n[o].push(r)}return n}function b(e,t){let n=new Set(t);return e.filter(r=>n.has(r))}function K(e,t,n){let r=new Set(t.map(n));return e.filter(o=>r.has(n(o)))}function A(e,t,n){return e.filter(r=>t.some(o=>n(r,o)))}function Q(e,t){let n={};for(let r of e){let o=t(r);n[o]=r}return n}function ee(e,t){let n=e[0],r=-1/0;for(let o of e){let i=t(o);i>r&&(r=i,n=o)}return n}function te(e,t){let n=e[0],r=1/0;for(let o of e){let i=t(o);i<r&&(r=i,n=o)}return n}function ne(e,t,n){let r=(i,a,u)=>i<a?u==="asc"?-1:1:i>a?u==="asc"?1:-1:0,o=t.map((i,a)=>n[a]||n[n.length-1]);return e.slice().sort((i,a)=>{for(let u=0;u<t.length;u++){let s=t[u],W=o[u],C=r(i[s],a[s],W);if(C!==0)return C}return 0})}function re(e,t){let n=[],r=[];for(let o of e)t(o)?n.push(o):r.push(o);return[n,r]}function oe(e){let t=Math.floor(Math.random()*e.length);return e[t]}function k(e,t){if(t==null&&(t=e,e=0),e>=t)throw new Error("Invalid input: The maximum value must be greater than the minimum value.");return Math.random()*(t-e)+e}function w(e,t){return Math.floor(k(e,t))}function ie(e,t){if(t>e.length)throw new Error("Size must be less than or equal to the length of array.");let n=new Array(t),r=new Set;for(let o=e.length-t,i=0;o<e.length;o++,i++){let a=w(0,o+1);r.has(a)&&(a=o),r.add(a),n[i]=e[a]}return n}function ae(e){let t=e.slice();for(let n=t.length-1;n>=1;n--){let r=Math.floor(Math.random()*(n+1));[t[n],t[r]]=[t[r],t[n]]}return t}function ue(e,t){return e.slice(0,t)}function se(e,t=1){return t<=0?[]:e.slice(-t)}function fe(e,t){for(let n=e.length-1;n>=0;n--)if(!t(e[n]))return e.slice(n+1);return e.slice()}function le(e,t){let n=[];for(let r of e){if(!t(r))break;n.push(r)}return n}function U(e){return Array.from(new Set(e))}function p(e,t){return U(e.concat(t))}function R(e,t,n){let r=new Map;for(let o of[...e,...t]){let i=n(o);r.has(i)||r.set(i,o)}return Array.from(r.values())}function v(e,t){let n=[];for(let r of e)n.every(i=>!t(i,r))&&n.push(r);return n}function P(e,t,n){return v(e.concat(t),n)}function ce(e,t){let n=new Map;for(let r of e){let o=t(r);n.has(o)||n.set(o,r)}return Array.from(n.values())}function pe(e){let t=0;for(let r=0;r<e.length;r++)e[r].length>t&&(t=e[r].length);let n=new Array(t);for(let r=0;r<t;r++){n[r]=new Array(e.length);for(let o=0;o<e.length;o++)n[r][o]=e[o][r]}return n}function Te(e,t){let n=Math.max(...e.map(o=>o.length)),r=new Array(n);for(let o=0;o<n;o++){let i=new Array(e.length);for(let a=0;a<e.length;a++)i[a]=e[a][o];r[o]=t(...i)}return r}function me(e,t){return x(p(e,t),b(e,t))}function ye(e,t,n){let r=R(e,t,n),o=K(e,t,n);return g(r,o,n)}function de(e,t,n){let r=P(e,t,n),o=A(e,t,n);return h(r,o,n)}function I(...e){let t=[],n=Math.max(...e.map(r=>r.length));for(let r=0;r<n;r++){let o=[];for(let i of e)o.push(i[r]);t.push(o)}return t}function xe(e,t){let n={};for(let r=0;r<e.length;r++)n[e[r]]=t[r];return n}function ge(e,...t){let n=[e,...t.slice(0,-1)],r=t[t.length-1],o=[],i=Math.max(...n.map(a=>a.length));for(let a=0;a<i;a++){let u=n.map(s=>s[a]);o.push(r(...u))}return o}function he(e,...t){let n=new Set(t);return e.filter(r=>!n.has(r))}function S(e){return e[0]}function be(e){let t=e.length;if(t<=1)return[];let n=new Array(t-1);for(let r=1;r<t;r++)n[r-1]=e[r];return n}function Ke(e,t,n=0,r=e.length){let o=e.length,i=Math.max(n>=0?n:o+n,0),a=Math.min(r>=0?r:o+r,o),u=e.slice();for(let s=i;s<a;s++)u[s]=t;return u}function Ae(e){return e[e.length-1]}function ke(e){return e.length<=1?[]:e.slice(0,-1)}var T=class extends Error{constructor(t="The operation was aborted"){super(t),this.name="AbortError"}};var m=class extends Error{constructor(t="The operation was timed out"){super(t),this.name="TimeoutError"}};var we=(e,t)=>{if(!Number.isInteger(e)||e<0)throw new Error("n must be a non-negative integer.");let n=0;return(...r)=>{if(++n>=e)return t(...r)}};function Ue(e,t,{signal:n}={}){let r=null,o=function(...a){r!==null&&clearTimeout(r),!n?.aborted&&(r=setTimeout(()=>{e(...a),r=null},t))},i=function(){o.cancel()};return o.cancel=function(){r!==null&&(clearTimeout(r),r=null)},n?.addEventListener("abort",i,{once:!0}),o}function Re(){}function ve(e){let t=!1,n;return function(){if(t)return n;let r=e();return t=!0,n=r,r}}function Pe(e,t){let n;return function(...o){let i=Date.now();(n==null||i-n>=t)&&(n=i,e(...o))}}function Ie(e){return(...t)=>!e(...t)}function Oe(e,t,n){return n==null?Math.min(e,t):Math.min(Math.max(e,t),n)}function Ee(e,t,n){if(n==null&&(n=t,t=0),t>=n)throw new Error("The maximum value must be greater than the minimum value.");return t<=e&&e<n}function y(e){let t=0;for(let n=0;n<e.length;n++)t+=e[n];return t}function O(e){return y(e)/e.length}function Fe(e,t){let n=e.map(r=>t(r));return O(n)}function De(e,t=0){if(!Number.isInteger(t))throw new Error("Precision must be an integer.");let n=Math.pow(10,t);return Math.round(e*n)/n}function Me(e,t){let n=e.map(r=>t(r));return y(n)}function Be(e,t,n){if(t==null&&(t=e,e=0),n==null&&(n=1),!Number.isInteger(n)||n===0)throw new Error("The step value must be a non-zero integer.");let r=Math.max(Math.ceil((t-e)/n),0),o=new Array(r);for(let i=0;i<r;i++)o[i]=e+i*n;return o}function We(e,t){let n={...e};for(let r of t)delete n[r];return n}function Se(e,t){let n={};for(let[r,o]of Object.entries(e))t(o,r)||(n[r]=o);return n}function Ve(e,t){let n={};for(let r of t)n[r]=e[r];return n}function Ne(e,t){let n={};for(let[r,o]of Object.entries(e))t(o,r)&&(n[r]=o);return n}function Ce(e){let t={},n=Object.keys(e);for(let r=0;r<n.length;r++){let o=n[r],i=e[o];t[i]=o}return t}function ze(e){if(kt(e))return e;if(Array.isArray(e))return e.slice();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 t=new Map;for(let[n,r]of e)t.set(n,r);return t}if(e instanceof Set){let t=new Set;for(let n of e)t.add(n);return t}if(typeof e=="object"){let t=Object.getPrototypeOf(e),n=Object.create(t);return Object.assign(n,e)}return e}function kt(e){return e==null||typeof e!="object"&&typeof e!="function"}function c(e){if(wt(e))return e;if(Array.isArray(e))return e.map(t=>c(t));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 t=new Map;for(let[n,r]of e.entries())t.set(n,c(r));return t}if(e instanceof Set){let t=new Set;for(let n of e.values())t.add(c(n));return t}if(Ut(e)){let t=new(Object.getPrototypeOf(e)).constructor(e.length);for(let n=0;n<e.length;n++)t[n]=c(e[n]);return t}if(e instanceof ArrayBuffer||e instanceof SharedArrayBuffer)return e.slice(0);if(e instanceof DataView){let t=new DataView(e.buffer.slice(0));return d(e,t),t}if(typeof File<"u"&&e instanceof File){let t=new File([e],e.name,{type:e.type});return d(e,t),t}if(e instanceof Blob){let t=new Blob([e],{type:e.type});return d(e,t),t}if(e instanceof Error){let t=new e.constructor;return t.message=e.message,t.name=e.name,t.stack=e.stack,t.cause=e.cause,d(e,t),t}if(typeof e=="object"&&e!==null){let t={};return d(e,t),t}if(typeof e!="function")return e}function wt(e){return e==null||typeof e!="object"&&typeof e!="function"}function d(e,t){for(let n in e)if(Object.prototype.hasOwnProperty.call(e,n)){let r=Object.getOwnPropertyDescriptor(e,n);(r?.writable||r?.set)&&typeof r?.value!="function"&&(t[n]=c(e[n]))}}function Ut(e){return e instanceof Uint8Array||e instanceof Uint8ClampedArray||e instanceof Uint16Array||e instanceof Uint32Array||e instanceof BigUint64Array||e instanceof Int8Array||e instanceof Int16Array||e instanceof Int32Array||e instanceof BigInt64Array||e instanceof Float32Array||e instanceof Float64Array}function Le(e){if(typeof e!="object"||e==null)return!1;if(Object.getPrototypeOf(e)===null)return!0;if(e.toString()!=="[object Object]")return!1;let t=e;for(;Object.getPrototypeOf(t)!==null;)t=Object.getPrototypeOf(t);return Object.getPrototypeOf(e)===t}function _e(e){return qe(e)}function qe(e,t=""){let n={},r=Object.keys(e);for(let o=0;o<r.length;o++){let i=r[o],a=e[i],u=t?`${t}.${i}`:i;if(Le(a)&&Object.keys(a).length>0){Object.assign(n,qe(a,u));continue}if(Array.isArray(a)){for(let s=0;s<a.length;s++)n[`${u}.${s}`]=a[s];continue}n[u]=a}return n}function V(e,t){if(Object.is(e,t))return!0;if(e instanceof Date&&t instanceof Date)return e.getTime()===t.getTime();if(e instanceof RegExp&&t instanceof RegExp)return e.source===t.source&&e.flags===t.flags;if(typeof e!="object"||typeof t!="object"||e===null||t===null)return!1;let n=Object.keys(e),r=Object.keys(t);if(n.length!==r.length||p(n,r).length!==n.length)return!1;for(let o=0;o<n.length;o++){let i=n[o],a=e[i],u=t[i];if(!V(a,u))return!1}return!0}function je(e){return e==null}function $e(e){return e!=null}function Ge(e){return e===null}function Xe(e){return e===void 0}function E(e){return typeof e=="number"&&e>-1&&e%1===0&&e<=Number.MAX_SAFE_INTEGER}function Ye(e){return typeof e=="function"}function He(e){return e!=null&&typeof e!="function"&&E(e.length)}function Ze(e){return e instanceof Uint8Array||e instanceof Uint8ClampedArray||e instanceof Uint16Array||e instanceof Uint32Array||e instanceof BigUint64Array||e instanceof Int8Array||e instanceof Int16Array||e instanceof Int32Array||e instanceof BigInt64Array||e instanceof Float32Array||e instanceof Float64Array}function Je(e){return e==null||typeof e!="object"&&typeof e!="function"}function F(e,{signal:t}={}){return new Promise((n,r)=>{let o=()=>{r(new T)},i=()=>{clearTimeout(a),o()};if(t?.aborted)return o();let a=setTimeout(n,e);t?.addEventListener("abort",i,{once:!0})})}async function Qe(e){throw await F(e),new m}async function et(e,t){return Promise.race([e(),Qe(t)])}var D=e=>e.charAt(0).toUpperCase()+e.slice(1).toLowerCase();var Rt=/[A-Z]?[a-z]+|[0-9]+|[A-Z]+(?![a-z])/g;function l(e){return Array.from(e.match(Rt)??[])}function tt(e){let t=l(e);if(t.length===0)return"";let[n,...r]=t;return`${n.toLowerCase()}${r.map(o=>D(o)).join("")}`}var nt=e=>l(e).map(n=>n.toLowerCase()).join("_");var rt=e=>l(e).map(n=>n.toLowerCase()).join("-");var ot=e=>l(e).map(n=>n.toLowerCase()).join(" ");function it(e){let t=l(e.trim()),n="";for(let r of t)n&&(n+=" "),r===r.toUpperCase()?n+=r:n+=r[0].toUpperCase()+r.slice(1).toLowerCase();return n}function at(e,t=1){return t=Math.max(Math.floor(t),0),t===0?[]:z(e,t)}function ut(...e){return f(e)}function st(e,...t){let n=e,r=f(t);return x(n,r)}function ft(e,t,n=0,r=e.length){return n=Math.floor(n),r=Math.floor(r),n||(n=0),r||(r=0),X(e,t,n,r)}var vt=/^(?:0|[1-9]\d*)$/;function lt(e){switch(typeof e){case"number":return Number.isInteger(e)&&e>=0&&e<Number.MAX_SAFE_INTEGER;case"symbol":return!1;case"string":return vt.test(e)}}function M(e){let t=/\\(\\)?/g,n=RegExp(`[^.[\\]]+|\\[(?:([^"'][^[]*)|(["'])((?:(?!\\2)[^\\\\]|\\\\.)*?)\\2)\\]|(?=(?:\\.|\\[\\])(?:\\.|\\[\\]|$))`,"g"),r=[];e[0]==="."&&r.push("");let o,i=0;for(;(o=n.exec(e))!==null;){let a=o[0],u=o[1],s=o[2],W=o[3];s?a=W.replace(t,"$1"):u&&(a=u),r.push(a),n.lastIndex===i?n.lastIndex++:i=n.lastIndex}return r}function B(e,t,n){let r=Array.isArray(t)?t:typeof t=="string"?M(t):[t],o=e;for(let a=0;a<r.length-1;a++){let u=r[a],s=r[a+1];o[u]==null&&(o[u]=lt(s)?[]:{}),o=o[u]}let i=r[r.length-1];return o[i]=n,e}function ct(e,t){let n={},r=I(e,t);for(let o=0;o<r.length;o++){let[i,a]=r[o];i!=null&&B(n,i,a)}return n}var Pt=/^\w*$/,It=/\.|\[(?:[^[\]]*|(["'])(?:(?!\1)[^\\]|\\.)*?\1)\]/;function pt(e){switch(typeof e){case"number":case"symbol":return!1;case"string":return!Pt.test(e)&&It.test(e)}}function Tt(e,t,n){let r;if(Array.isArray(t)?r=t:typeof t=="string"&&pt(t)&&e?.[t]==null?r=M(t):r=[t],r.length===0)return n;let o=e,i;for(i=0;i<r.length&&o!=null;i++){let a=r[i];Object.is(a.valueOf(),-0)&&(a="-0"),o=o[a]}return o===null&&i===r.length?o:o??n}function mt(e){if(typeof e!="object"||e==null)return!1;if(Object.getPrototypeOf(e)===null)return!0;if(e.toString()!=="[object Object]"){let n=e[Symbol.toStringTag];return n==null||!Object.getOwnPropertyDescriptor(e,Symbol.toStringTag)?.writable?!1:e.toString()===`[object ${n}]`}let t=e;for(;Object.getPrototypeOf(t)!==null;)t=Object.getPrototypeOf(t);return Object.getPrototypeOf(e)===t}function yt(e){return Array.isArray(e)}function dt(e){return Ze(e)}var xt=(e,t,n=0)=>e.startsWith(t,n);var gt=(e,t,n=e.length)=>e.endsWith(t,n);function ht(e=[]){let t=e[0],n;for(let r of e)(n==null||r>n)&&(n=r,t=r);return t}function bt(e=[]){let t=e[0],n;for(let r of e)(n==null||r<n)&&(n=r,t=r);return t}window._=N;})();
2
2
  //# sourceMappingURL=browser.global.js.map
@@ -1,47 +0,0 @@
1
- var __defProp = Object.defineProperty;
2
- var __getOwnPropSymbols = Object.getOwnPropertySymbols;
3
- var __hasOwnProp = Object.prototype.hasOwnProperty;
4
- var __propIsEnum = Object.prototype.propertyIsEnumerable;
5
- var __defNormalProp = (obj, key, value) => key in obj ? __defProp(obj, key, { enumerable: true, configurable: true, writable: true, value }) : obj[key] = value;
6
- var __spreadValues = (a, b) => {
7
- for (var prop in b || (b = {}))
8
- if (__hasOwnProp.call(b, prop))
9
- __defNormalProp(a, prop, b[prop]);
10
- if (__getOwnPropSymbols)
11
- for (var prop of __getOwnPropSymbols(b)) {
12
- if (__propIsEnum.call(b, prop))
13
- __defNormalProp(a, prop, b[prop]);
14
- }
15
- return a;
16
- };
17
- var __export = (target, all) => {
18
- for (var name in all)
19
- __defProp(target, name, { get: all[name], enumerable: true });
20
- };
21
- var __async = (__this, __arguments, generator) => {
22
- return new Promise((resolve, reject) => {
23
- var fulfilled = (value) => {
24
- try {
25
- step(generator.next(value));
26
- } catch (e) {
27
- reject(e);
28
- }
29
- };
30
- var rejected = (value) => {
31
- try {
32
- step(generator.throw(value));
33
- } catch (e) {
34
- reject(e);
35
- }
36
- };
37
- var step = (x) => x.done ? resolve(x.value) : Promise.resolve(x.value).then(fulfilled, rejected);
38
- step((generator = generator.apply(__this, __arguments)).next());
39
- });
40
- };
41
-
42
- export {
43
- __spreadValues,
44
- __export,
45
- __async
46
- };
47
- //# sourceMappingURL=chunk-24FKGR6U.mjs.map
@@ -1 +0,0 @@
1
- {"version":3,"sources":["../src/array/zipWith.ts"],"sourcesContent":["/**\n * Combines multiple arrays into a single array using a custom combiner function.\n *\n * This function takes multiple arrays and a combiner function, and returns a new array where each element\n * is the result of applying the combiner function to the corresponding elements of the input arrays.\n *\n * @param {T[]} arr1 - The first array to zip.\n * @param {U[]} [arr2] - The second array to zip (optional).\n * @param {V[]} [arr3] - The third array to zip (optional).\n * @param {W[]} [arr4] - The fourth array to zip (optional).\n * @param {(...items: T[]) => R} combine - The combiner function that takes corresponding elements from each array and returns a single value.\n * @returns {R[]} A new array where each element is the result of applying the combiner function to the corresponding elements of the input arrays.\n *\n * @example\n * // Example usage with two arrays:\n * const arr1 = [1, 2, 3];\n * const arr2 = [4, 5, 6];\n * const result = zipWith(arr1, arr2, (a, b) => a + b);\n * // result will be [5, 7, 9]\n *\n * @example\n * // Example usage with three arrays:\n * const arr1 = [1, 2];\n * const arr2 = [3, 4];\n * const arr3 = [5, 6];\n * const result = zipWith(arr1, arr2, arr3, (a, b, c) => `${a}${b}${c}`);\n * // result will be [`135`, `246`]\n */\nexport function zipWith<T, R>(arr1: readonly T[], combine: (item: T) => R): R[];\nexport function zipWith<T, U, R>(arr1: readonly T[], arr2: readonly U[], combine: (item1: T, item2: U) => R): R[];\nexport function zipWith<T, U, V, R>(\n arr1: readonly T[],\n arr2: readonly U[],\n arr3: readonly V[],\n combine: (item1: T, item2: U, item3: V) => R\n): R[];\nexport function zipWith<T, U, V, W, R>(\n arr1: readonly T[],\n arr2: readonly U[],\n arr3: readonly V[],\n arr4: readonly W[],\n combine: (item1: T, item2: U, item3: V, item4: W) => R\n): R[];\nexport function zipWith<T, R>(arr1: readonly T[], ...rest: any[]): R[] {\n const arrs = [arr1, ...rest.slice(0, -1)];\n const combine = rest[rest.length - 1] as (...items: T[]) => R;\n\n const result: R[] = [];\n const maxIndex = Math.max(...arrs.map(arr => arr.length));\n\n for (let i = 0; i < maxIndex; i++) {\n const elements: T[] = arrs.map(arr => arr[i]);\n result.push(combine(...elements));\n }\n\n return result;\n}\n"],"mappings":";AA2CO,SAAS,QAAc,SAAuB,MAAkB;AACrE,QAAM,OAAO,CAAC,MAAM,GAAG,KAAK,MAAM,GAAG,EAAE,CAAC;AACxC,QAAM,UAAU,KAAK,KAAK,SAAS,CAAC;AAEpC,QAAM,SAAc,CAAC;AACrB,QAAM,WAAW,KAAK,IAAI,GAAG,KAAK,IAAI,SAAO,IAAI,MAAM,CAAC;AAExD,WAAS,IAAI,GAAG,IAAI,UAAU,KAAK;AACjC,UAAM,WAAgB,KAAK,IAAI,SAAO,IAAI,CAAC,CAAC;AAC5C,WAAO,KAAK,QAAQ,GAAG,QAAQ,CAAC;AAAA,EAClC;AAEA,SAAO;AACT;","names":[]}
@@ -1,22 +0,0 @@
1
- import {
2
- delay
3
- } from "./chunk-O64NE2P4.mjs";
4
- import {
5
- TimeoutError
6
- } from "./chunk-KIOYQRMQ.mjs";
7
- import {
8
- __async
9
- } from "./chunk-24FKGR6U.mjs";
10
-
11
- // src/promise/timeout.ts
12
- function timeout(ms) {
13
- return __async(this, null, function* () {
14
- yield delay(ms);
15
- throw new TimeoutError();
16
- });
17
- }
18
-
19
- export {
20
- timeout
21
- };
22
- //# sourceMappingURL=chunk-CVVZHOJX.mjs.map
@@ -1 +0,0 @@
1
- {"version":3,"sources":["../src/array/compact.ts"],"sourcesContent":["type NotFalsey<T> = Exclude<T, false | null | 0 | '' | undefined>;\n\n/**\n * Removes falsey values (false, null, 0, '', undefined, NaN) from an array.\n *\n * @template T - The type of elements in the array.\n * @param {readonly T[]} arr - The input array to remove falsey values.\n * @returns {Array<Exclude<T, false | null | 0 | '' | undefined>>} - A new array with all falsey values removed.\n *\n * @example\n * compact([0, 1, false, 2, '', 3, null, undefined, 4, NaN, 5]);\n * Returns: [1, 2, 3, 4, 5]\n */\nexport function compact<T>(arr: readonly T[]): Array<NotFalsey<T>> {\n const result: Array<NotFalsey<T>> = [];\n\n for (const item of arr) {\n if (item) {\n result.push(item as NotFalsey<T>);\n }\n }\n\n return result;\n}\n"],"mappings":";AAaO,SAAS,QAAW,KAAwC;AACjE,QAAM,SAA8B,CAAC;AAErC,aAAW,QAAQ,KAAK;AACtB,QAAI,MAAM;AACR,aAAO,KAAK,IAAoB;AAAA,IAClC;AAAA,EACF;AAEA,SAAO;AACT;","names":[]}
@@ -1 +0,0 @@
1
- {"version":3,"sources":["../src/array/head.ts"],"sourcesContent":["/**\n * Returns the first element of an array.\n *\n * This function takes an array and returns the first element of the array.\n * If the array is empty, the function returns `undefined`.\n *\n * @param {T[]} arr - The array from which to get the first element.\n * @returns {T | undefined} The first element of the array, or `undefined` if the array is empty.\n *\n * @example\n * const arr = [1, 2, 3];\n * const firstElement = head(arr);\n * // firstElement will be 1\n *\n * const emptyArr: number[] = [];\n * const noElement = head(emptyArr);\n * // noElement will be undefined\n */\nexport function head<T>(arr: readonly [T, ...T[]]): T;\nexport function head<T>(arr: readonly T[]): T | undefined;\nexport function head<T>(arr: readonly T[]): T | undefined {\n return arr[0];\n}\n"],"mappings":";AAoBO,SAAS,KAAQ,KAAkC;AACxD,SAAO,IAAI,CAAC;AACd;","names":[]}
@@ -1,18 +0,0 @@
1
- import {
2
- timeout
3
- } from "./chunk-CVVZHOJX.mjs";
4
- import {
5
- __async
6
- } from "./chunk-24FKGR6U.mjs";
7
-
8
- // src/promise/withTimeout.ts
9
- function withTimeout(run, ms) {
10
- return __async(this, null, function* () {
11
- return Promise.race([run(), timeout(ms)]);
12
- });
13
- }
14
-
15
- export {
16
- withTimeout
17
- };
18
- //# sourceMappingURL=chunk-IIDZ3KAJ.mjs.map
@@ -1 +0,0 @@
1
- {"version":3,"sources":["../src/array/last.ts"],"sourcesContent":["/**\n * Returns the last element of an array.\n *\n * This function takes an array and returns the last element of the array.\n * If the array is empty, the function returns `undefined`.\n *\n * Unlike some implementations, this function is optimized for performance\n * by directly accessing the last index of the array.\n *\n * @param {T[]} arr - The array from which to get the last element.\n * @returns {T | undefined} The last element of the array, or `undefined` if the array is empty.\n *\n * @example\n * const arr = [1, 2, 3];\n * const lastElement = last(arr);\n * // lastElement will be 3\n *\n * const emptyArr: number[] = [];\n * const noElement = last(emptyArr);\n * // noElement will be undefined\n */\n\nexport function last<T>(arr: readonly [...T[], T]): T;\nexport function last<T>(arr: readonly T[]): T | undefined;\nexport function last<T>(arr: readonly T[]): T | undefined {\n return arr[arr.length - 1];\n}\n"],"mappings":";AAwBO,SAAS,KAAQ,KAAkC;AACxD,SAAO,IAAI,IAAI,SAAS,CAAC;AAC3B;","names":[]}
@@ -1 +0,0 @@
1
- {"version":3,"sources":["../src/array/toFilled.ts"],"sourcesContent":["/**\n * Creates a new array filled with the specified value from the start position up to, but not including, the end position.\n * This function does not mutate the original array.\n *\n * @param {Array<T>} arr - The array to base the new array on.\n * @param {U} value - The value to fill the new array with.\n * @param {number} [start=0] - The start position. Defaults to 0.\n * @param {number} [end=arr.length] - The end position. Defaults to the array's length.\n * @returns {Array<T | U>} The new array with the filled values.\n *\n * @example\n * const array = [1, 2, 3, 4, 5];\n * let result = toFilled(array, '*', 2);\n * console.log(result); // [1, 2, '*', '*', '*']\n * console.log(array); // [1, 2, 3, 4, 5]\n *\n * result = toFilled(array, '*', 1, 4);\n * console.log(result); // [1, '*', '*', '*', 5]\n * console.log(array); // [1, 2, 3, 4, 5]\n *\n * result = toFilled(array, '*');\n * console.log(result); // ['*', '*', '*', '*', '*']\n * console.log(array); // [1, 2, 3, 4, 5]\n *\n * result = toFilled(array, '*', -4, -1);\n * console.log(result); // [1, '*', '*', '*', 5]\n * console.log(array); // [1, 2, 3, 4, 5]\n */\n\nexport function toFilled<T, U>(arr: T[], value: U): Array<T | U>;\nexport function toFilled<T, U>(arr: T[], value: U, start: number): Array<T | U>;\nexport function toFilled<T, U>(arr: T[], value: U, start: number, end: number): Array<T | U>;\nexport function toFilled<T, U>(arr: T[], value: U, start = 0, end = arr.length): Array<T | U> {\n const length = arr.length;\n const finalStart = Math.max(start >= 0 ? start : length + start, 0);\n const finalEnd = Math.min(end >= 0 ? end : length + end, length);\n\n const newArr: Array<T | U> = arr.slice();\n\n for (let i = finalStart; i < finalEnd; i++) {\n newArr[i] = value;\n }\n\n return newArr;\n}\n"],"mappings":";AAgCO,SAAS,SAAe,KAAU,OAAU,QAAQ,GAAG,MAAM,IAAI,QAAsB;AAC5F,QAAM,SAAS,IAAI;AACnB,QAAM,aAAa,KAAK,IAAI,SAAS,IAAI,QAAQ,SAAS,OAAO,CAAC;AAClE,QAAM,WAAW,KAAK,IAAI,OAAO,IAAI,MAAM,SAAS,KAAK,MAAM;AAE/D,QAAM,SAAuB,IAAI,MAAM;AAEvC,WAAS,IAAI,YAAY,IAAI,UAAU,KAAK;AAC1C,WAAO,CAAC,IAAI;AAAA,EACd;AAEA,SAAO;AACT;","names":[]}
@@ -1 +0,0 @@
1
- //# sourceMappingURL=chunk-STL6TD3L.mjs.map
@@ -1 +0,0 @@
1
- {"version":3,"sources":["../src/array/tail.ts"],"sourcesContent":["/**\n * Returns an empty array when the input is a single-element array.\n *\n * @param {readonly [T]} arr - The single-element array to process.\n * @returns {[]} An empty array.\n *\n * @example\n * const arr = [1];\n * const result = tail(arr);\n * // result will be []\n */\nexport function tail<T>(arr: readonly [T]): [];\n\n/**\n * Returns an empty array when the input is an empty array.\n *\n * @param {readonly []} arr - The empty array to process.\n * @returns {[]} An empty array.\n *\n * @example\n * const arr = [];\n * const result = tail(arr);\n * // result will be []\n */\nexport function tail(arr: readonly []): [];\n\n/**\n * Returns a new array with all elements except for the first when the input is a tuple array.\n *\n * @param {readonly [T, ...U[]]} arr - The tuple array to process.\n * @returns {U[]} A new array containing all elements of the input array except for the first one.\n *\n * @example\n * const arr = [1, 2, 3];\n * const result = tail(arr);\n * // result will be [2, 3]\n */\nexport function tail<T, U>(arr: readonly [T, ...U[]]): U[];\n\n/**\n * Returns a new array with all elements except for the first.\n *\n * This function takes an array and returns a new array containing all the elements\n * except for the first one. If the input array is empty or has only one element,\n * an empty array is returned.\n *\n * @param {readonly T[]} arr - The array to get the tail of.\n * @returns {T[]} A new array containing all elements of the input array except for the first one.\n *\n * @example\n * const arr1 = [1, 2, 3];\n * const result = tail(arr1);\n * // result will be [2, 3]\n *\n * const arr2 = [1];\n * const result2 = tail(arr2);\n * // result2 will be []\n *\n * const arr3 = [];\n * const result3 = tail(arr3);\n * // result3 will be []\n */\nexport function tail<T>(arr: readonly T[]): T[];\n\nexport function tail<T>(arr: readonly T[]): T[] {\n const len = arr.length;\n if (len <= 1) {\n return [];\n }\n const result = new Array(len - 1);\n for (let i = 1; i < len; i++) {\n result[i - 1] = arr[i];\n }\n return result;\n}\n"],"mappings":";AAgEO,SAAS,KAAQ,KAAwB;AAC9C,QAAM,MAAM,IAAI;AAChB,MAAI,OAAO,GAAG;AACZ,WAAO,CAAC;AAAA,EACV;AACA,QAAM,SAAS,IAAI,MAAM,MAAM,CAAC;AAChC,WAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAC5B,WAAO,IAAI,CAAC,IAAI,IAAI,CAAC;AAAA,EACvB;AACA,SAAO;AACT;","names":[]}
@@ -1 +0,0 @@
1
- {"version":3,"sources":["../src/array/unzip.ts"],"sourcesContent":["/**\n * Gathers elements in the same position in an internal array \n * from a grouped array of elements and returns them as a new array.\n *\n * @param zipped - The nested array to unzip.\n * @returns A new array of unzipped elements.\n *\n * @example\n * const zipped = [['a', true, 1],['b', false, 2]];\n * const result = unzip(zipped);\n * // result will be [['a', 'b'], [true, false], [1, 2]]\n */\nexport function unzip<T extends unknown[]>(zipped: Array<[...T]>): Unzip<T> {\n // For performance reasons, use this implementation instead of\n // const maxLen = Math.max(...zipped.map(arr => arr.length));\n let maxLen = 0;\n\n for (let i = 0; i < zipped.length; i++) {\n if (zipped[i].length > maxLen) {\n maxLen = zipped[i].length;\n }\n }\n\n const result = new Array(maxLen) as Unzip<T>;\n\n for (let i = 0; i < maxLen; i++) {\n result[i] = new Array(zipped.length);\n for (let j = 0; j < zipped.length; j++) {\n result[i][j] = zipped[j][i];\n }\n }\n\n return result;\n}\n\ntype Unzip<K extends unknown[]> = { [I in keyof K]: Array<K[I]> };\n"],"mappings":";AAYO,SAAS,MAA2B,QAAiC;AAG1E,MAAI,SAAS;AAEb,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,QAAI,OAAO,CAAC,EAAE,SAAS,QAAQ;AAC7B,eAAS,OAAO,CAAC,EAAE;AAAA,IACrB;AAAA,EACF;AAEA,QAAM,SAAS,IAAI,MAAM,MAAM;AAE/B,WAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,WAAO,CAAC,IAAI,IAAI,MAAM,OAAO,MAAM;AACnC,aAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,aAAO,CAAC,EAAE,CAAC,IAAI,OAAO,CAAC,EAAE,CAAC;AAAA,IAC5B;AAAA,EACF;AAEA,SAAO;AACT;","names":[]}
@@ -1 +0,0 @@
1
- {"version":3,"sources":["../src/array/fill.ts"],"sourcesContent":["/**\n * Fills elements of an array with a specified value from the start position up to, but not including, the end position.\n *\n * This function mutates the original array and replaces its elements with the provided value, starting from the specified\n * start index up to the end index (non-inclusive). If the start or end indices are not provided, it defaults to filling the\n * entire array.\n *\n * @param {Array<T | U>} array - The array to fill.\n * @param {U} value - The value to fill the array with.\n * @param {number} [start=0] - The start position. Defaults to 0.\n * @param {number} [end=arr.length] - The end position. Defaults to the array's length.\n * @returns {Array<T | U>} The array with the filled values.\n *\n * @example\n * const array = [1, 2, 3];\n * const result = fill(array, 'a');\n * // => ['a', 'a', 'a']\n *\n * const result = fill(Array(3), 2);\n * // => [2, 2, 2]\n *\n * const result = fill([4, 6, 8, 10], '*', 1, 3);\n * // => [4, '*', '*', 10]\n *\n * const result = fill(array, '*', -2, -1);\n * // => [1, '*', 3]\n */\nexport function fill<T>(array: unknown[], value: T): T[];\nexport function fill<T, U>(array: Array<T | U>, value: U, start: number): Array<T | U>;\nexport function fill<T, U>(array: Array<T | U>, value: U, start: number, end: number): Array<T | U>;\nexport function fill<T, U>(array: Array<T | U>, value: U, start = 0, end = array.length): Array<T | U> {\n const length = array.length;\n const finalStart = Math.max(start >= 0 ? start : length + start, 0);\n const finalEnd = Math.min(end >= 0 ? end : length + end, length);\n\n for (let i = finalStart; i < finalEnd; i++) {\n array[i] = value;\n }\n\n return array;\n}\n"],"mappings":";AA8BO,SAAS,KAAW,OAAqB,OAAU,QAAQ,GAAG,MAAM,MAAM,QAAsB;AACrG,QAAM,SAAS,MAAM;AACrB,QAAM,aAAa,KAAK,IAAI,SAAS,IAAI,QAAQ,SAAS,OAAO,CAAC;AAClE,QAAM,WAAW,KAAK,IAAI,OAAO,IAAI,MAAM,SAAS,KAAK,MAAM;AAE/D,WAAS,IAAI,YAAY,IAAI,UAAU,KAAK;AAC1C,UAAM,CAAC,IAAI;AAAA,EACb;AAEA,SAAO;AACT;","names":[]}
@@ -1 +0,0 @@
1
- {"version":3,"sources":["../src/compat/index.ts","../src/compat/array/chunk.ts","../src/compat/array/concat.ts","../src/compat/array/difference.ts","../src/compat/array/fill.ts","../src/compat/_internal/isIndex.ts","../src/compat/_internal/toPath.ts","../src/compat/object/set.ts","../src/compat/array/zipObjectDeep.ts","../src/compat/_internal/isDeepKey.ts","../src/compat/object/get.ts","../src/compat/predicate/isPlainObject.ts","../src/compat/predicate/isArray.ts","../src/compat/predicate/isTypedArray.ts","../src/compat/string/startsWith.ts","../src/compat/string/endsWith.ts","../src/compat/math/max.ts","../src/compat/math/min.ts"],"sourcesContent":["/**\n * es-toolkit compatibility layer with lodash (WIP)\n * ====================================\n * ```tsx\n * // es-toolkit/compat aims to provide 100% feature parity with lodash\n * import { chunk } from 'es-toolkit/compat';\n *\n * chunk([1, 2, 3, 4], 0);\n * // Returns [], which is identical to lodash\n * ```\n *\n * `es-toolkit/compat` will offer complete compatibility with lodash, ensuring a seamless transition.\n *\n * To guarantee identical behavior, `es-toolkit/compat` will be thoroughly tested using actual lodash test cases.\n *\n * The primary goal of `es-toolkit/compat` is to serve as a drop-in replacement for lodash.\n *\n * It's important to note that while `es-toolkit/compat` will mirror the behavior of lodash functions with 100% accuracy,\n * it will deliberately omit unsafe features, such as:\n *\n * - Implicit type casting from an empty string `''` to 0 or false, and similar cases.\n *\n * @module\n */\nexport * from '../index.ts';\n\nexport { chunk } from './array/chunk.ts';\nexport { concat } from './array/concat.ts';\nexport { difference } from './array/difference.ts';\nexport { fill } from './array/fill.ts';\nexport { zipObjectDeep } from './array/zipObjectDeep.ts';\nexport { head as first } from '../index.ts';\n\nexport { get } from './object/get.ts';\nexport { set } from './object/set.ts';\n\nexport { isPlainObject } from './predicate/isPlainObject.ts';\nexport { isArray } from './predicate/isArray.ts';\nexport { isTypedArray } from './predicate/isTypedArray.ts';\n\nexport { startsWith } from './string/startsWith.ts';\nexport { endsWith } from './string/endsWith.ts';\n\nexport { max } from './math/max.ts';\nexport { min } from './math/min.ts';\n","import { chunk as chunkToolkit } from '../../array/chunk.ts';\n\n/**\n * Splits an array into smaller arrays of a specified length.\n *\n * This function takes an input array and divides it into multiple smaller arrays,\n * each of a specified length. If the input array cannot be evenly divided,\n * the final sub-array will contain the remaining elements.\n *\n * @template T The type of elements in the array.\n * @param {T[]} arr - The array to be chunked into smaller arrays.\n * @param {number} size - The size of each smaller array. Must be a positive integer.\n * @returns {T[][]} A two-dimensional array where each sub-array has a maximum length of `size`.\n * @throws {Error} Throws an error if `size` is not a positive integer.\n *\n * @example\n * // Splits an array of numbers into sub-arrays of length 2\n * chunk([1, 2, 3, 4, 5], 2);\n * // Returns: [[1, 2], [3, 4], [5]]\n *\n * @example\n * // Splits an array of strings into sub-arrays of length 3\n * chunk(['a', 'b', 'c', 'd', 'e', 'f', 'g'], 3);\n * // Returns: [['a', 'b', 'c'], ['d', 'e', 'f'], ['g']]\n */\nexport function chunk<T>(arr: readonly T[], size = 1): T[][] {\n size = Math.max(Math.floor(size), 0);\n\n if (size === 0) {\n return [];\n }\n\n return chunkToolkit(arr, size);\n}\n","import { flatten } from \"../../array/flatten.ts\";\n\n/**\n * Concatenates multiple arrays and values into a single array.\n *\n * @template T The type of elements in the array.\n * @param {...(T | readonly T[])} values - The values and/or arrays to concatenate.\n * @returns {T[]} A new array containing all the input values.\n * \n * @example\n * // Concatenate individual values\n * concat(1, 2, 3); \n * // returns [1, 2, 3]\n *\n * @example\n * // Concatenate arrays of values\n * concat([1, 2], [3, 4]);\n * // returns [1, 2, 3, 4]\n *\n * @example\n * // Concatenate a mix of individual values and arrays\n * concat(1, [2, 3], 4);\n * // returns [1, 2, 3, 4]\n *\n * @example\n * // Concatenate nested arrays\n * concat([1, [2, 3]], 4);\n * // returns [1, [2, 3], 4]\n */\nexport function concat<T>(...values: Array<T | readonly T[]>): T[] {\n return flatten(values) as T[];\n}\n","import { difference as differenceToolkit } from '../../array/difference.ts';\nimport { flatten } from '../../array/flatten.ts';\n\nexport function difference<T>(arr: readonly T[], ...values: Array<readonly T[]>): T[] {\n const arr1 = arr;\n const arr2 = flatten(values);\n\n return differenceToolkit(arr1, arr2);\n}","import { fill as fillToolkit } from '../../array/fill.ts';\n\n/**\n * Fills elements of an array with a specified value from the start position up to, but not including, the end position.\n *\n * This function mutates the original array and replaces its elements with the provided value, starting from the specified\n * start index up to the end index (non-inclusive). If the start or end indices are not provided, it defaults to filling the\n * entire array.\n *\n * @param {Array<T | U>} array - The array to fill.\n * @param {U} value - The value to fill the array with.\n * @param {S} [start=0] - The start position. Defaults to 0.\n * @param {V} [end=arr.length] - The end position. Defaults to the array's length.\n * @returns {Array<T | U>} The array with the filled values.\n *\n * @example\n * const array = [1, 2, 3];\n * const result = fill(array, 'a');\n * // => ['a', 'a', 'a']\n *\n * const result = fill(Array(3), 2);\n * // => [2, 2, 2]\n *\n * const result = fill([4, 6, 8, 10], '*', 1, 3);\n * // => [4, '*', '*', 10]\n *\n * const result = fill(array, '*', -2, -1);\n * // => [1, '*', 3]\n */\nexport function fill<T>(array: unknown[], value?: T): T[];\nexport function fill<T, U, S>(array: Array<T | U>, value: U, start: S): Array<T | U>;\nexport function fill<T, U, S, V>(array: Array<T | U>, value: U, start: S, end: V): Array<T | U>;\nexport function fill<T, U>(array: Array<T | U>, value: U, start = 0, end = array.length): Array<T | U> {\n start = Math.floor(start);\n end = Math.floor(end);\n\n if (!start) {\n start = 0;\n }\n if (!end) {\n end = 0;\n }\n\n return fillToolkit(array, value, start, end);\n}\n","const IS_UNSIGNED_INTEGER = /^(?:0|[1-9]\\d*)$/\n\nexport function isIndex(value: PropertyKey) {\n switch (typeof value) {\n case 'number': {\n return Number.isInteger(value) && value >= 0 && value < Number.MAX_SAFE_INTEGER;\n }\n case 'symbol': {\n return false;\n }\n case 'string': {\n return IS_UNSIGNED_INTEGER.test(value);\n }\n }\n}","/**\n * Converts a deep key string into an array of path segments.\n *\n * This function takes a string representing a deep key (e.g., 'a.b.c' or 'a[b][c]') and breaks it down into an array of strings, each representing a segment of the path.\n *\n * @param deepKey - The deep key string to convert.\n * @returns An array of strings, each representing a segment of the path.\n *\n * Examples:\n *\n * toPath('a.b.c') // Returns ['a', 'b', 'c']\n * toPath('a[b][c]') // Returns ['a', 'b', 'c']\n * toPath('.a.b.c') // Returns ['', 'a', 'b', 'c']\n * toPath('a[\"b.c\"].d') // Returns ['a', 'b.c', 'd']\n * toPath('') // Returns []\n * toPath('.a[b].c.d[e][\"f.g\"].h') // Returns ['', 'a', 'b', 'c', 'd', 'e', 'f.g', 'h']\n */\nexport function toPath(deepKey: string): string[] {\n const ESCAPE_REGEXP = /\\\\(\\\\)?/g;\n const PROPERTY_REGEXP = RegExp(\n // Match anything that isn't a dot or bracket.\n '[^.[\\\\]]+' +\n '|' +\n // Or match property names within brackets.\n '\\\\[(?:' +\n // Match a non-string expression.\n '([^\"\\'][^[]*)' +\n '|' +\n // Or match strings (supports escaping characters).\n '([\"\\'])((?:(?!\\\\2)[^\\\\\\\\]|\\\\\\\\.)*?)\\\\2' +\n ')\\\\]' +\n '|' +\n // Or match \"\" as the space between consecutive dots or empty brackets.\n '(?=(?:\\\\.|\\\\[\\\\])(?:\\\\.|\\\\[\\\\]|$))',\n 'g'\n );\n\n const result: string[] = [];\n\n if (deepKey[0] === '.') {\n result.push('');\n }\n\n let match: RegExpExecArray | null;\n let lastIndex = 0;\n\n while ((match = PROPERTY_REGEXP.exec(deepKey)) !== null) {\n let key = match[0];\n const expr = match[1];\n const quote = match[2];\n const substr = match[3];\n\n if (quote) {\n key = substr.replace(ESCAPE_REGEXP, '$1');\n } else if (expr) {\n key = expr;\n }\n\n result.push(key);\n\n if (PROPERTY_REGEXP.lastIndex === lastIndex) {\n PROPERTY_REGEXP.lastIndex++;\n } else {\n lastIndex = PROPERTY_REGEXP.lastIndex;\n }\n }\n\n return result;\n}\n","import { isIndex } from \"../_internal/isIndex.ts\";\nimport { toPath } from \"../_internal/toPath.ts\";\n\n/**\n * Sets the value at the specified path of the given object. If any part of the path does not exist, it will be created.\n *\n * @template T - The type of the object.\n * @param {Settable} obj - The object to modify.\n * @param {Path} path - The path of the property to set.\n * @param {any} value - The value to set.\n * @returns {T} - The modified object.\n *\n * @example\n * // Set a value in a nested object\n * const obj = { a: { b: { c: 3 } } };\n * set(obj, 'a.b.c', 4);\n * console.log(obj.a.b.c); // 4\n *\n * @example\n * // Set a value in an array\n * const arr = [1, 2, 3];\n * set(arr, 1, 4);\n * console.log(arr[1]); // 4\n *\n * @example\n * // Create non-existent path and set value\n * const obj = {};\n * set(obj, 'a.b.c', 4);\n * console.log(obj); // { a: { b: { c: 4 } } }\n */\nexport function set<T>(obj: object, path: PropertyKey | readonly PropertyKey[], value: unknown): T;\nexport function set<T extends object>(obj: T, path: PropertyKey | readonly PropertyKey[], value: unknown): T {\n const resolvedPath = Array.isArray(path)\n ? path\n : typeof path === 'string'\n ? toPath(path)\n : [path];\n\n let current: any = obj;\n\n for (let i = 0; i < resolvedPath.length - 1; i++) {\n const key = resolvedPath[i];\n const nextKey = resolvedPath[i + 1];\n\n if (current[key] == null) {\n current[key] = isIndex(nextKey) ? [] : {};\n }\n\n current = current[key];\n }\n\n const lastKey = resolvedPath[resolvedPath.length - 1];\n current[lastKey] = value;\n\n return obj;\n}\n","import { zip } from \"../../array/zip.ts\";\nimport { set } from \"../object/set.ts\";\n\n/**\n * Creates a deeply nested object given arrays of paths and values.\n *\n * This function takes two arrays: one containing arrays of property paths, and the other containing corresponding values.\n * It returns a new object where paths from the first array are used as key paths to set values, with corresponding elements from the second array as values.\n * Paths can be dot-separated strings or arrays of property names.\n * \n * If the `keys` array is longer than the `values` array, the remaining keys will have `undefined` as their values.\n *\n * @template V - The type of elements in the array.\n * @param {string[] | string[][]} keys - An array of property paths, each path can be a dot-separated string or an array of property names.\n * @param {V[]} values - An array of values corresponding to the property paths.\n * @returns {object} A new object composed of the given property paths and values.\n *\n * @example\n * const paths = ['a.b.c', 'd.e.f'];\n * const values = [1, 2];\n * const result = zipObjectDeep(paths, values);\n * // result will be { a: { b: { c: 1 } }, d: { e: { f: 2 } } }\n *\n * @example\n * const paths = [['a', 'b', 'c'], ['d', 'e', 'f']];\n * const values = [1, 2];\n * const result = zipObjectDeep(paths, values);\n * // result will be { a: { b: { c: 1 } }, d: { e: { f: 2 } } }\n * \n * @example\n * const paths = ['a.b[0].c', 'a.b[1].d'];\n * const values = [1, 2];\n * const result = zipObjectDeep(paths, values);\n * // result will be { 'a': { 'b': [{ 'c': 1 }, { 'd': 2 }] } }\n */\nexport function zipObjectDeep<P extends string | number | symbol, V>(keys: P[], values: V[]): { [K in P]: V } {\n const result = {} as { [K in P]: V };\n const zipped = zip(keys, values);\n\n for (let i = 0; i < zipped.length; i++) {\n const [key, value] = zipped[i];\n\n if (key != null) {\n set(result, key, value);\n }\n }\n\n return result;\n}\n","const IS_PLAIN = /^\\w*$/;\nconst IS_DEEP = /\\.|\\[(?:[^[\\]]*|([\"'])(?:(?!\\1)[^\\\\]|\\\\.)*?\\1)\\]/;\n\n/**\n * Checks if a given key is a deep key.\n *\n * A deep key is a string that contains a dot (.) or square brackets with a property accessor.\n *\n * @param key - The key to check.\n * @returns {boolean} - Returns true if the key is a deep key, otherwise false.\n *\n * Examples:\n *\n * isDeepKey('a.b') // true\n * isDeepKey('a[b]') // true\n * isDeepKey('a') // false\n * isDeepKey(123) // false\n * isDeepKey('a.b.c') // true\n * isDeepKey('a[b][c]') // true\n */\nexport function isDeepKey(key: PropertyKey): boolean {\n switch (typeof key) {\n case \"number\":\n case \"symbol\": {\n return false;\n }\n case \"string\": {\n return !IS_PLAIN.test(key) && IS_DEEP.test(key);\n }\n }\n}\n","import { isDeepKey } from \"../_internal/isDeepKey.ts\";\nimport { toPath } from \"../_internal/toPath.ts\";\nimport type { Get } from \"./get.types.ts\";\n\n/**\n * Retrieves the value at a given path from an object. If the resolved value is undefined, the defaultValue is returned instead.\n * \n * @template T - The type of the object.\n * @template K - The type of the key in the object.\n * @template D - The type of the default value.\n * \n * @param {T} object - The object to query.\n * @param {K | [K]} path - The path of the property to get.\n * @returns {T[K]} - Returns the resolved value.\n */\nexport function get<T extends object, K extends keyof T>(object: T, path: K | [K]): T[K];\n/**\n * Retrieves the value at a given path from an object. If the resolved value is undefined, the defaultValue is returned instead.\n * \n * @template T - The type of the object.\n * @template K - The type of the key in the object.\n * \n * @param {T | null | undefined} object - The object to query.\n * @param {K | [K]} path - The path of the property to get.\n * @returns {T[K] | undefined} - Returns the resolved value.\n */\nexport function get<T extends object, K extends keyof T>(object: T | null | undefined, path: K | [K]): T[K] | undefined;\n/**\n * Retrieves the value at a given path from an object. If the resolved value is undefined, the defaultValue is returned instead.\n * \n * @template T - The type of the object.\n * @template K - The type of the key in the object.\n * @template D - The type of the default value.\n * \n * @param {T | null | undefined} object - The object to query.\n * @param {K | [K]} path - The path of the property to get.\n * @param {D} defaultValue - The value returned if the resolved value is undefined.\n * @returns {Exclude<T[K], undefined> | D} - Returns the resolved value.\n */\nexport function get<T extends object, K extends keyof T, D>(object: T | null | undefined, path: K | [K], defaultValue: D): Exclude<T[K], undefined> | D;\n/**\n * Retrieves the value at a given path from an object. If the resolved value is undefined, the defaultValue is returned instead.\n * \n * @template T - The type of the object.\n * @template K1 - The type of the first key in the object.\n * @template K2 - The type of the second key in the object.\n * \n * @param {T} object - The object to query.\n * @param {[K1, K2]} path - The path of the property to get.\n * @returns {T[K1][K2]} - Returns the resolved value.\n */\nexport function get<T extends object, K1 extends keyof T, K2 extends keyof T[K1]>(object: T, path: [K1, K2]): T[K1][K2];\n/**\n * Retrieves the value at a given path from an object. If the resolved value is undefined, the defaultValue is returned instead.\n * \n * @template T - The type of the object.\n * @template K1 - The type of the first key in the object.\n * @template K2 - The type of the second key in the object.\n * \n * @param {T | null | undefined} object - The object to query.\n * @param {[K1, K2]} path - The path of the property to get.\n * @returns {T[K1][K2] | undefined} - Returns the resolved value.\n */\nexport function get<T extends object, K1 extends keyof T, K2 extends keyof T[K1]>(object: T | null | undefined, path: [K1, K2]): T[K1][K2] | undefined;\n/**\n * Retrieves the value at a given path from an object. If the resolved value is undefined, the defaultValue is returned instead.\n * \n * @template T - The type of the object.\n * @template K1 - The type of the first key in the object.\n * @template K2 - The type of the second key in the object.\n * @template D - The type of the default value.\n * \n * @param {T | null | undefined} object - The object to query.\n * @param {[K1, K2]} path - The path of the property to get.\n * @param {D} defaultValue - The value returned if the resolved value is undefined.\n * @returns {Exclude<T[K1][K2], undefined> | D} - Returns the resolved value.\n */\nexport function get<T extends object, K1 extends keyof T, K2 extends keyof T[K1], D>(object: T | null | undefined, path: [K1, K2], defaultValue: D): Exclude<T[K1][K2], undefined> | D;\n/**\n * Retrieves the value at a given path from an object. If the resolved value is undefined, the defaultValue is returned instead.\n * \n * @template T - The type of the object.\n * @template K1 - The type of the first key in the object.\n * @template K2 - The type of the second key in the object.\n * @template K3 - The type of the third key in the object.\n * \n * @param {T} object - The object to query.\n * @param {[K1, K2, K3]} path - The path of the property to get.\n * @returns {T[K1][K2][K3]} - Returns the resolved value.\n */\nexport function get<T extends object, K1 extends keyof T, K2 extends keyof T[K1], K3 extends keyof T[K1][K2]>(object: T, path: [K1, K2, K3]): T[K1][K2][K3];\n/**\n * Retrieves the value at a given path from an object. If the resolved value is undefined, the defaultValue is returned instead.\n * \n * @template T - The type of the object.\n * @template K1 - The type of the first key in the object.\n * @template K2 - The type of the second key in the object.\n * @template K3 - The type of the third key in the object.\n * \n * @param {T | null | undefined} object - The object to query.\n * @param {[K1, K2, K3]} path - The path of the property to get.\n * @returns {T[K1][K2][K3] | undefined} - Returns the resolved value.\n */\nexport function get<T extends object, K1 extends keyof T, K2 extends keyof T[K1], K3 extends keyof T[K1][K2]>(object: T | null | undefined, path: [K1, K2, K3]): T[K1][K2][K3] | undefined;\n/**\n * Retrieves the value at a given path from an object. If the resolved value is undefined, the defaultValue is returned instead.\n * \n * @template T - The type of the object.\n * @template K1 - The type of the first key in the object.\n * @template K2 - The type of the second key in the object.\n * @template K3 - The type of the third key in the object.\n * @template D - The type of the default value.\n * \n * @param {T | null | undefined} object - The object to query.\n * @param {[K1, K2, K3]} path - The path of the property to get.\n * @param {D} defaultValue - The value returned if the resolved value is undefined.\n * @returns {Exclude<T[K1][K2][K3], undefined> | D} - Returns the resolved value.\n */\nexport function get<T extends object, K1 extends keyof T, K2 extends keyof T[K1], K3 extends keyof T[K1][K2], D>(object: T | null | undefined, path: [K1, K2, K3], defaultValue: D): Exclude<T[K1][K2][K3], undefined> | D;\n/**\n * Retrieves the value at a given path from an object. If the resolved value is undefined, the defaultValue is returned instead.\n * \n * @template T - The type of the object.\n * @template K1 - The type of the first key in the object.\n * @template K2 - The type of the second key in the object.\n * @template K3 - The type of the third key in the object.\n * @template K4 - The type of the fourth key in the object.\n * \n * @param {T} object - The object to query.\n * @param {[K1, K2, K3, K4]} path - The path of the property to get.\n * @returns {T[K1][K2][K3][K4]} - Returns the resolved value.\n */\nexport function get<T extends object, K1 extends keyof T, K2 extends keyof T[K1], K3 extends keyof T[K1][K2], K4 extends keyof T[K1][K2][K3]>(object: T, path: [K1, K2, K3, K4]): T[K1][K2][K3][K4];\n/**\n * Retrieves the value at a given path from an object. If the resolved value is undefined, the defaultValue is returned instead.\n * \n * @template T - The type of the object.\n * @template K1 - The type of the first key in the object.\n * @template K2 - The type of the second key in the object.\n * @template K3 - The type of the third key in the object.\n * @template K4 - The type of the fourth key in the object.\n * \n * @param {T | null | undefined} object - The object to query.\n * @param {[K1, K2, K3, K4]} path - The path of the property to get.\n * @returns {T[K1][K2][K3][K4] | undefined} - Returns the resolved value.\n */\nexport function get<T extends object, K1 extends keyof T, K2 extends keyof T[K1], K3 extends keyof T[K1][K2], K4 extends keyof T[K1][K2][K3]>(object: T | null | undefined, path: [K1, K2, K3, K4]): T[K1][K2][K3][K4] | undefined;\n/**\n * Retrieves the value at a given path from an object. If the resolved value is undefined, the defaultValue is returned instead.\n * \n * @template T - The type of the object.\n * @template K1 - The type of the first key in the object.\n * @template K2 - The type of the second key in the object.\n * @template K3 - The type of the third key in the object.\n * @template K4 - The type of the fourth key in the object.\n * @template D - The type of the default value.\n * \n * @param {T | null | undefined} object - The object to query.\n * @param {[K1, K2, K3, K4]} path - The path of the property to get.\n * @param {D} defaultValue - The value returned if the resolved value is undefined.\n * @returns {Exclude<T[K1][K2][K3][K4], undefined> | D} - Returns the resolved value.\n */\nexport function get<T extends object, K1 extends keyof T, K2 extends keyof T[K1], K3 extends keyof T[K1][K2], K4 extends keyof T[K1][K2][K3], D>(object: T | null | undefined, path: [K1, K2, K3, K4], defaultValue: D): Exclude<T[K1][K2][K3][K4], undefined> | D;\n/**\n * Retrieves the value at a given path from an object with numeric keys. If the resolved value is undefined, the defaultValue is returned instead.\n * \n * @template T - The type of the value.\n * \n * @param {Record<number, T>} object - The object to query.\n * @param {number} path - The path of the property to get.\n * @returns {T} - Returns the resolved value.\n */\nexport function get<T>(object: Record<number, T>, path: number): T;\n/**\n * Retrieves the value at a given path from an object with numeric keys. If the resolved value is undefined, the defaultValue is returned instead.\n * \n * @template T - The type of the value.\n * \n * @param {Record<number, T> | null | undefined} object - The object to query.\n * @param {number} path - The path of the property to get.\n * @returns {T | undefined} - Returns the resolved value.\n */\nexport function get<T>(object: Record<number, T> | null | undefined, path: number): T | undefined;\n/**\n * Retrieves the value at a given path from an object with numeric keys. If the resolved value is undefined, the defaultValue is returned instead.\n * \n * @template T - The type of the value.\n * @template D - The type of the default value.\n * \n * @param {Record<number, T> | null | undefined} object - The object to query.\n * @param {number} path - The path of the property to get.\n * @param {D} defaultValue - The value returned if the resolved value is undefined.\n * @returns {T | D} - Returns the resolved value.\n */\nexport function get<T, D>(object: Record<number, T> | null | undefined, path: number, defaultValue: D): T | D;\n/**\n * Retrieves the value at a given path from a null or undefined object, returning the default value.\n * \n * @template D - The type of the default value.\n * \n * @param {null | undefined} object - The object to query.\n * @param {PropertyKey} path - The path of the property to get.\n * @param {D} defaultValue - The value returned if the resolved value is undefined.\n * @returns {D} - Returns the default value.\n */\nexport function get<D>(object: null | undefined, path: PropertyKey, defaultValue: D): D;\n/**\n * Retrieves the value at a given path from a null or undefined object, returning undefined.\n * \n * @param {null | undefined} object - The object to query.\n * @param {PropertyKey} path - The path of the property to get.\n * @returns {undefined} - Returns undefined.\n */\nexport function get(object: null | undefined, path: PropertyKey): undefined;\n/**\n * Retrieves the value at a given path from a string-keyed object. If the resolved value is undefined, the defaultValue is returned instead.\n * \n * @template T - The type of the object.\n * @template P - The type of the path.\n * \n * @param {T} data - The object to query.\n * @param {P} path - The path of the property to get.\n * @returns {string extends P ? any : Get<T, P>} - Returns the resolved value.\n */\nexport function get<T, P extends string>(data: T, path: P): string extends P ? any : Get<T, P>;\n/**\n * Retrieves the value at a given path from a string-keyed object. If the resolved value is undefined, the defaultValue is returned instead.\n * \n * @template T - The type of the object.\n * @template P - The type of the path.\n * @template D - The type of the default value.\n * \n * @param {T} data - The object to query.\n * @param {P} path - The path of the property to get.\n * @param {D} defaultValue - The value returned if the resolved value is undefined.\n * @returns {Exclude<Get<T, P>, null | undefined> | D} - Returns the resolved value.\n */\nexport function get<T, P extends string, D = Get<T, P>>(data: T, path: P, defaultValue: D): Exclude<Get<T, P>, null | undefined> | D;\n/**\n * Retrieves the value at a given path from an object. If the resolved value is undefined, the defaultValue is returned instead.\n * \n * @param {unknown} object - The object to query.\n * @param {PropertyKey | readonly PropertyKey[]} path - The path of the property to get.\n * @param {unknown} [defaultValue] - The value returned if the resolved value is undefined.\n * @returns {any} - Returns the resolved value.\n */\nexport function get(object: unknown, path: PropertyKey | readonly PropertyKey[], defaultValue?: unknown): any;\nexport function get(object: any, path: PropertyKey | readonly PropertyKey[], defaultValue?: any): any {\n let resolvedPath;\n\n if (Array.isArray(path)) {\n resolvedPath = path;\n } else if (typeof path === 'string' && isDeepKey(path) && object?.[path] == null) {\n resolvedPath = toPath(path);\n } else {\n resolvedPath = [path];\n }\n\n if (resolvedPath.length === 0) {\n return defaultValue;\n }\n\n let current = object;\n let index;\n\n for (index = 0; index < resolvedPath.length && current != null; index++) {\n let key = resolvedPath[index];\n\n if (Object.is(key.valueOf(), -0)) {\n key = '-0';\n }\n\n current = current[key];\n }\n\n if (current === null && index === resolvedPath.length) {\n return current;\n }\n\n return current ?? defaultValue;\n}","/**\n * Checks if a given value is a plain object.\n *\n * A plain object is an object created by the `{}` literal, `new Object()`, or\n * `Object.create(null)`.\n *\n * This function also handles objects with custom\n * `Symbol.toStringTag` properties.\n *\n * `Symbol.toStringTag` is a built-in symbol that a constructor can use to customize the\n * default string description of objects.\n *\n * @param {unknown} [object] - The value to check.\n * @returns {boolean} - True if the value is a plain object, otherwise false.\n *\n * @example\n * console.log(isPlainObject({})); // true\n * console.log(isPlainObject([])); // false\n * console.log(isPlainObject(null)); // false\n * console.log(isPlainObject(Object.create(null))); // true\n * console.log(isPlainObject(new Map())); // false\n */\nexport function isPlainObject(object?: unknown): boolean {\n if (typeof object !== 'object') {\n return false;\n }\n\n if (object == null) {\n return false;\n }\n\n if (Object.getPrototypeOf(object) === null) {\n return true;\n }\n\n if (object.toString() !== '[object Object]') {\n // eslint-disable-next-line @typescript-eslint/ban-ts-comment\n // @ts-ignore\n const tag = object[Symbol.toStringTag];\n\n if (tag == null) {\n return false;\n }\n\n const isTagReadonly = !Object.getOwnPropertyDescriptor(object, Symbol.toStringTag)?.writable;\n\n if (isTagReadonly) {\n return false;\n }\n\n return object.toString() === `[object ${tag}]`;\n }\n\n let proto = object;\n\n while (Object.getPrototypeOf(proto) !== null) {\n proto = Object.getPrototypeOf(proto);\n }\n\n return Object.getPrototypeOf(object) === proto;\n}\n","/**\n * Checks if the given value is an array.\n *\n * This function tests whether the provided value is an array or not.\n * It returns `true` if the value is an array, and `false` otherwise.\n *\n * This function can also serve as a type predicate in TypeScript, narrowing the type of the argument to an array.\n *\n * @template T - The type of value.\n * @param {T} value - The value to test if it is an array.\n * @returns {value is Extract<T, unknown[]>} `true` if the value is an array, `false` otherwise.\n *\n * @example\n * const value1 = [1, 2, 3];\n * const value2 = 'abc';\n * const value3 = () => {};\n *\n * console.log(isArray(value1)); // true\n * console.log(isArray(value2)); // false\n * console.log(isArray(value3)); // false\n */\nexport function isArray<T>(value?: T): value is Extract<T, readonly unknown[]> {\n return Array.isArray(value);\n}\n","import { isTypedArray as isTypedArrayToolkit } from '../../predicate/isTypedArray.ts';\n\n/**\n * Checks if a value is a TypedArray.\n * @param {unknown} x The value to check.\n * @returns {x is\n * | Uint8Array\n * | Uint8ClampedArray\n * | Uint16Array\n * | Uint32Array\n * | BigUint64Array\n * | Int8Array\n * | Int16Array\n * | Int32Array\n * | BigInt64Array\n * | Float32Array\n * | Float64Array} Returns true if `x` is a TypedArray, false otherwise.\n */\nexport function isTypedArray(\n x?: unknown\n): x is\n | Uint8Array\n | Uint8ClampedArray\n | Uint16Array\n | Uint32Array\n | BigUint64Array\n | Int8Array\n | Int16Array\n | Int32Array\n | BigInt64Array\n | Float32Array\n | Float64Array {\n return isTypedArrayToolkit(x);\n}\n","/**\n * Checks if a string contains another string at the beginning of the string.\n *\n * Checks if one string startsWith another string. Optional position parameter to start searching from a certain index.\n *\n * @param {string} str - The string that might contain the target string.\n * @param {string} target - The string to search for.\n * @param {number} position - An optional offset to start searching in the str string\n * @returns {boolean} - True if the str string starts with the target string.\n *\n * @example\n * const isPrefix = startsWith('fooBar', 'foo') // returns true\n * const isPrefix = startsWith('fooBar', 'bar') // returns false\n * const isPrefix = startsWith('fooBar', 'abc') // returns false\n * const isPrefix = startsWith('fooBar', 'Bar', 2) // returns true\n * const isPrefix = startsWith('fooBar', 'Bar', 5) // returns false\n */\nexport const startsWith = (str: string, target: string, position = 0): boolean => {\n return str.startsWith(target, position);\n};\n","/**\n * Checks if a string contains another string at the end of the string.\n *\n * Checks if one string endsWith another string. Optional position parameter to offset searching before a certain index.\n *\n * @param {string} str - The string that might contain the target string.\n * @param {string} target - The string to search for.\n * @param {number} position - An optional position from the start to search up to this index\n * @returns {boolean} - True if the str string ends with the target string.\n *\n * @example\n * const isPrefix = endsWith('fooBar', 'foo') // returns true\n * const isPrefix = endsWith('fooBar', 'bar') // returns false\n * const isPrefix = endsWith('fooBar', 'abc') // returns false\n * const isPrefix = endsWith('fooBar', 'foo', 3) // returns true\n * const isPrefix = endsWith('fooBar', 'abc', 5) // returns false\n */\nexport const endsWith = (str: string, target: string, position: number = str.length): boolean => {\n return str.endsWith(target, position);\n};\n","/**\n * Finds the element in an array that has the maximum value.\n *\n * @template T - The type of elements in the array.\n * @param {T[]} items The array of elements to search.\n * @returns {T | undefined} The element with the maximum value.\n * @example\n * // Returns 9\n * max([3, 1, 4, 1, 5, 9])\n *\n * @example\n * // Returns 8\n * max([0, -3, 2, 8, 7])\n */\nexport function max<T>(items: readonly [T, ...T[]]): T;\nexport function max(): undefined;\nexport function max<T>(items?: readonly T[]): T | undefined;\nexport function max<T>(items: readonly T[] = []): T | undefined {\n let maxElement = items[0];\n let max = undefined;\n\n for (const element of items) {\n if (max == null || element > max) {\n max = element;\n maxElement = element;\n }\n }\n\n return maxElement;\n}\n","/**\n * Finds the element in an array that has the minimum value.\n *\n * @template T - The type of elements in the array.\n * @param {T[]} items The array of elements to search.\n * @returns {T | undefined} The element with the minimum value.\n * @example\n * // Returns 1\n * min([3, 1, 4, 1, 5, 9])\n *\n * @example\n * // Returns -3\n * min([0, -3, 2, 8, 7])\n */\nexport function min<T>(items: readonly [T, ...T[]]): T;\nexport function min(): undefined;\nexport function min<T>(items?: readonly T[]): T | undefined;\nexport function min<T>(items: readonly T[] = []): T {\n let minElement = items[0];\n let min = undefined;\n\n for (const element of items) {\n if (min == null || element < min) {\n min = element;\n minElement = element;\n }\n }\n\n return minElement;\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,eAAAA;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,oBAAAC;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,cAAAC;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,sBAAAC;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;;ACyBO,SAASC,OAAS,KAAmB,OAAO,GAAU;AAC3D,SAAO,KAAK,IAAI,KAAK,MAAM,IAAI,GAAG,CAAC;AAEnC,MAAI,SAAS,GAAG;AACd,WAAO,CAAC;AAAA,EACV;AAEA,SAAO,MAAa,KAAK,IAAI;AAC/B;;;ACJO,SAAS,UAAa,QAAsC;AACjE,SAAO,QAAQ,MAAM;AACvB;;;AC5BO,SAASC,YAAc,QAAsB,QAAkC;AACpF,QAAM,OAAO;AACb,QAAM,OAAO,QAAQ,MAAM;AAE3B,SAAO,WAAkB,MAAM,IAAI;AACrC;;;ACwBO,SAASC,MAAW,OAAqB,OAAU,QAAQ,GAAG,MAAM,MAAM,QAAsB;AACrG,UAAQ,KAAK,MAAM,KAAK;AACxB,QAAM,KAAK,MAAM,GAAG;AAEpB,MAAI,CAAC,OAAO;AACV,YAAQ;AAAA,EACV;AACA,MAAI,CAAC,KAAK;AACR,UAAM;AAAA,EACR;AAEA,SAAO,KAAY,OAAO,OAAO,OAAO,GAAG;AAC7C;;;AC5CA,IAAM,sBAAsB;AAErB,SAAS,QAAQ,OAAoB;AAC1C,UAAQ,OAAO,OAAO;AAAA,IACpB,KAAK,UAAU;AACb,aAAO,OAAO,UAAU,KAAK,KAAK,SAAS,KAAK,QAAQ,OAAO;AAAA,IACjE;AAAA,IACA,KAAK,UAAU;AACb,aAAO;AAAA,IACT;AAAA,IACA,KAAK,UAAU;AACb,aAAO,oBAAoB,KAAK,KAAK;AAAA,IACvC;AAAA,EACF;AACF;;;ACGO,SAAS,OAAO,SAA2B;AAChD,QAAM,gBAAgB;AACtB,QAAM,kBAAkB;AAAA;AAAA,IAEtB;AAAA,IAaA;AAAA,EACF;AAEA,QAAM,SAAmB,CAAC;AAE1B,MAAI,QAAQ,CAAC,MAAM,KAAK;AACtB,WAAO,KAAK,EAAE;AAAA,EAChB;AAEA,MAAI;AACJ,MAAI,YAAY;AAEhB,UAAQ,QAAQ,gBAAgB,KAAK,OAAO,OAAO,MAAM;AACvD,QAAI,MAAM,MAAM,CAAC;AACjB,UAAM,OAAO,MAAM,CAAC;AACpB,UAAM,QAAQ,MAAM,CAAC;AACrB,UAAM,SAAS,MAAM,CAAC;AAEtB,QAAI,OAAO;AACT,YAAM,OAAO,QAAQ,eAAe,IAAI;AAAA,IAC1C,WAAW,MAAM;AACf,YAAM;AAAA,IACR;AAEA,WAAO,KAAK,GAAG;AAEf,QAAI,gBAAgB,cAAc,WAAW;AAC3C,sBAAgB;AAAA,IAClB,OAAO;AACL,kBAAY,gBAAgB;AAAA,IAC9B;AAAA,EACF;AAEA,SAAO;AACT;;;ACrCO,SAAS,IAAsB,KAAQ,MAA4C,OAAmB;AAC3G,QAAM,eAAe,MAAM,QAAQ,IAAI,IACnC,OACA,OAAO,SAAS,WACd,OAAO,IAAI,IACX,CAAC,IAAI;AAEX,MAAI,UAAe;AAEnB,WAAS,IAAI,GAAG,IAAI,aAAa,SAAS,GAAG,KAAK;AAChD,UAAM,MAAM,aAAa,CAAC;AAC1B,UAAM,UAAU,aAAa,IAAI,CAAC;AAElC,QAAI,QAAQ,GAAG,KAAK,MAAM;AACxB,cAAQ,GAAG,IAAI,QAAQ,OAAO,IAAI,CAAC,IAAI,CAAC;AAAA,IAC1C;AAEA,cAAU,QAAQ,GAAG;AAAA,EACvB;AAEA,QAAM,UAAU,aAAa,aAAa,SAAS,CAAC;AACpD,UAAQ,OAAO,IAAI;AAEnB,SAAO;AACT;;;ACpBO,SAAS,cAAqD,MAAW,QAA8B;AAC5G,QAAM,SAAS,CAAC;AAChB,QAAM,SAAS,IAAI,MAAM,MAAM;AAE/B,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,UAAM,CAAC,KAAK,KAAK,IAAI,OAAO,CAAC;AAE7B,QAAI,OAAO,MAAM;AACf,UAAI,QAAQ,KAAK,KAAK;AAAA,IACxB;AAAA,EACF;AAEA,SAAO;AACT;;;AChDA,IAAM,WAAW;AACjB,IAAM,UAAU;AAmBT,SAAS,UAAU,KAA2B;AACnD,UAAQ,OAAO,KAAK;AAAA,IAClB,KAAK;AAAA,IACL,KAAK,UAAU;AACb,aAAO;AAAA,IACT;AAAA,IACA,KAAK,UAAU;AACb,aAAO,CAAC,SAAS,KAAK,GAAG,KAAK,QAAQ,KAAK,GAAG;AAAA,IAChD;AAAA,EACF;AACF;;;ACyNO,SAAS,IAAI,QAAa,MAA4C,cAAyB;AACpG,MAAI;AAEJ,MAAI,MAAM,QAAQ,IAAI,GAAG;AACvB,mBAAe;AAAA,EACjB,WAAW,OAAO,SAAS,YAAY,UAAU,IAAI,MAAK,iCAAS,UAAS,MAAM;AAChF,mBAAe,OAAO,IAAI;AAAA,EAC5B,OAAO;AACL,mBAAe,CAAC,IAAI;AAAA,EACtB;AAEA,MAAI,aAAa,WAAW,GAAG;AAC7B,WAAO;AAAA,EACT;AAEA,MAAI,UAAU;AACd,MAAI;AAEJ,OAAK,QAAQ,GAAG,QAAQ,aAAa,UAAU,WAAW,MAAM,SAAS;AACvE,QAAI,MAAM,aAAa,KAAK;AAE5B,QAAI,OAAO,GAAG,IAAI,QAAQ,GAAG,EAAE,GAAG;AAChC,YAAM;AAAA,IACR;AAEA,cAAU,QAAQ,GAAG;AAAA,EACvB;AAEA,MAAI,YAAY,QAAQ,UAAU,aAAa,QAAQ;AACrD,WAAO;AAAA,EACT;AAEA,SAAO,4BAAW;AACpB;;;AClQO,SAAS,cAAc,QAA2B;AAtBzD;AAuBE,MAAI,OAAO,WAAW,UAAU;AAC9B,WAAO;AAAA,EACT;AAEA,MAAI,UAAU,MAAM;AAClB,WAAO;AAAA,EACT;AAEA,MAAI,OAAO,eAAe,MAAM,MAAM,MAAM;AAC1C,WAAO;AAAA,EACT;AAEA,MAAI,OAAO,SAAS,MAAM,mBAAmB;AAG3C,UAAM,MAAM,OAAO,OAAO,WAAW;AAErC,QAAI,OAAO,MAAM;AACf,aAAO;AAAA,IACT;AAEA,UAAM,gBAAgB,GAAC,YAAO,yBAAyB,QAAQ,OAAO,WAAW,MAA1D,mBAA6D;AAEpF,QAAI,eAAe;AACjB,aAAO;AAAA,IACT;AAEA,WAAO,OAAO,SAAS,MAAM,WAAW,GAAG;AAAA,EAC7C;AAEA,MAAI,QAAQ;AAEZ,SAAO,OAAO,eAAe,KAAK,MAAM,MAAM;AAC5C,YAAQ,OAAO,eAAe,KAAK;AAAA,EACrC;AAEA,SAAO,OAAO,eAAe,MAAM,MAAM;AAC3C;;;ACvCO,SAAS,QAAW,OAAoD;AAC7E,SAAO,MAAM,QAAQ,KAAK;AAC5B;;;ACLO,SAASC,cACd,GAYe;AACf,SAAO,aAAoB,CAAC;AAC9B;;;AChBO,IAAM,aAAa,CAAC,KAAa,QAAgB,WAAW,MAAe;AAChF,SAAO,IAAI,WAAW,QAAQ,QAAQ;AACxC;;;ACFO,IAAM,WAAW,CAAC,KAAa,QAAgB,WAAmB,IAAI,WAAoB;AAC/F,SAAO,IAAI,SAAS,QAAQ,QAAQ;AACtC;;;ACFO,SAAS,IAAO,QAAsB,CAAC,GAAkB;AAC9D,MAAI,aAAa,MAAM,CAAC;AACxB,MAAIC,OAAM;AAEV,aAAW,WAAW,OAAO;AAC3B,QAAIA,QAAO,QAAQ,UAAUA,MAAK;AAChC,MAAAA,OAAM;AACN,mBAAa;AAAA,IACf;AAAA,EACF;AAEA,SAAO;AACT;;;ACZO,SAAS,IAAO,QAAsB,CAAC,GAAM;AAClD,MAAI,aAAa,MAAM,CAAC;AACxB,MAAIC,OAAM;AAEV,aAAW,WAAW,OAAO;AAC3B,QAAIA,QAAO,QAAQ,UAAUA,MAAK;AAChC,MAAAA,OAAM;AACN,mBAAa;AAAA,IACf;AAAA,EACF;AAEA,SAAO;AACT;","names":["chunk","difference","fill","isTypedArray","chunk","difference","fill","isTypedArray","max","min"]}