@sapphire/iterator-utilities 3.0.0-pr-935.7da5c8bb → 3.0.0

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 (937) hide show
  1. package/CHANGELOG.md +48 -0
  2. package/README.md +65 -66
  3. package/dist/index.d.mts +80 -0
  4. package/dist/index.mjs +79 -0
  5. package/dist/lib/all.d.mts +2 -0
  6. package/dist/lib/all.mjs +3 -0
  7. package/dist/lib/any.d.mts +2 -0
  8. package/dist/lib/any.mjs +3 -0
  9. package/dist/lib/append.d.mts +19 -0
  10. package/dist/lib/append.d.mts.map +1 -0
  11. package/dist/lib/append.mjs +24 -0
  12. package/dist/lib/append.mjs.map +1 -0
  13. package/dist/lib/at.d.mts +21 -0
  14. package/dist/lib/at.d.mts.map +1 -0
  15. package/dist/lib/at.mjs +31 -0
  16. package/dist/lib/at.mjs.map +1 -0
  17. package/dist/lib/average.d.mts +21 -0
  18. package/dist/lib/average.d.mts.map +1 -0
  19. package/dist/lib/average.mjs +33 -0
  20. package/dist/lib/average.mjs.map +1 -0
  21. package/dist/lib/chain.d.mts +17 -0
  22. package/dist/lib/chain.d.mts.map +1 -0
  23. package/dist/lib/chain.mjs +23 -0
  24. package/dist/lib/chain.mjs.map +1 -0
  25. package/dist/lib/chunk.d.mts +17 -0
  26. package/dist/lib/chunk.d.mts.map +1 -0
  27. package/dist/lib/chunk.mjs +34 -0
  28. package/dist/lib/chunk.mjs.map +1 -0
  29. package/dist/lib/collect.d.mts +2 -0
  30. package/dist/lib/collect.mjs +3 -0
  31. package/dist/lib/collectInto.d.mts +26 -0
  32. package/dist/lib/collectInto.d.mts.map +1 -0
  33. package/dist/lib/collectInto.mjs +33 -0
  34. package/dist/lib/collectInto.mjs.map +1 -0
  35. package/dist/lib/compact.d.mts +16 -0
  36. package/dist/lib/compact.d.mts.map +1 -0
  37. package/dist/lib/compact.mjs +22 -0
  38. package/dist/lib/compact.mjs.map +1 -0
  39. package/dist/lib/compare.d.mts +28 -0
  40. package/dist/lib/compare.d.mts.map +1 -0
  41. package/dist/lib/compare.mjs +34 -0
  42. package/dist/lib/compare.mjs.map +1 -0
  43. package/dist/lib/compareBy.d.mts +27 -0
  44. package/dist/lib/compareBy.d.mts.map +1 -0
  45. package/dist/lib/compareBy.mjs +42 -0
  46. package/dist/lib/compareBy.mjs.map +1 -0
  47. package/dist/lib/compress.d.mts +22 -0
  48. package/dist/lib/compress.d.mts.map +1 -0
  49. package/dist/lib/compress.mjs +34 -0
  50. package/dist/lib/compress.mjs.map +1 -0
  51. package/dist/lib/contains.d.mts +21 -0
  52. package/dist/lib/contains.d.mts.map +1 -0
  53. package/dist/lib/contains.mjs +28 -0
  54. package/dist/lib/contains.mjs.map +1 -0
  55. package/dist/lib/count.d.mts +20 -0
  56. package/dist/lib/count.d.mts.map +1 -0
  57. package/dist/lib/count.mjs +29 -0
  58. package/dist/lib/count.mjs.map +1 -0
  59. package/dist/lib/cycle.d.mts +18 -0
  60. package/dist/lib/cycle.d.mts.map +1 -0
  61. package/dist/lib/cycle.mjs +29 -0
  62. package/dist/lib/cycle.mjs.map +1 -0
  63. package/dist/lib/difference.d.mts +22 -0
  64. package/dist/lib/difference.d.mts.map +1 -0
  65. package/dist/lib/difference.mjs +29 -0
  66. package/dist/lib/difference.mjs.map +1 -0
  67. package/dist/lib/drop.d.mts +18 -0
  68. package/dist/lib/drop.d.mts.map +1 -0
  69. package/dist/lib/drop.mjs +32 -0
  70. package/dist/lib/drop.mjs.map +1 -0
  71. package/dist/lib/dropLast.d.mts +21 -0
  72. package/dist/lib/dropLast.d.mts.map +1 -0
  73. package/dist/lib/dropLast.mjs +34 -0
  74. package/dist/lib/dropLast.mjs.map +1 -0
  75. package/dist/lib/dropWhile.d.mts +20 -0
  76. package/dist/lib/dropWhile.d.mts.map +1 -0
  77. package/dist/lib/dropWhile.mjs +12 -0
  78. package/dist/lib/dropWhile.mjs.map +1 -0
  79. package/dist/lib/empty.d.mts +15 -0
  80. package/dist/lib/empty.d.mts.map +1 -0
  81. package/dist/lib/empty.mjs +25 -0
  82. package/dist/lib/empty.mjs.map +1 -0
  83. package/dist/lib/enumerate.d.mts +21 -0
  84. package/dist/lib/enumerate.d.mts.map +1 -0
  85. package/dist/lib/enumerate.mjs +28 -0
  86. package/dist/lib/enumerate.mjs.map +1 -0
  87. package/dist/lib/equal.d.mts +23 -0
  88. package/dist/lib/equal.d.mts.map +1 -0
  89. package/dist/lib/equal.mjs +28 -0
  90. package/dist/lib/equal.mjs.map +1 -0
  91. package/dist/lib/equalBy.d.mts +24 -0
  92. package/dist/lib/equalBy.d.mts.map +1 -0
  93. package/dist/lib/equalBy.mjs +37 -0
  94. package/dist/lib/equalBy.mjs.map +1 -0
  95. package/dist/lib/every.d.mts +25 -0
  96. package/dist/lib/every.d.mts.map +1 -0
  97. package/dist/lib/every.mjs +13 -0
  98. package/dist/lib/every.mjs.map +1 -0
  99. package/dist/lib/filter.d.mts +19 -0
  100. package/dist/lib/filter.d.mts.map +1 -0
  101. package/dist/lib/filter.mjs +12 -0
  102. package/dist/lib/filter.mjs.map +1 -0
  103. package/dist/lib/find.d.mts +22 -0
  104. package/dist/lib/find.d.mts.map +1 -0
  105. package/dist/lib/find.mjs +10 -0
  106. package/dist/lib/find.mjs.map +1 -0
  107. package/dist/lib/findIndex.d.mts +21 -0
  108. package/dist/lib/findIndex.d.mts.map +1 -0
  109. package/dist/lib/findIndex.mjs +34 -0
  110. package/dist/lib/findIndex.mjs.map +1 -0
  111. package/dist/lib/first.d.mts +20 -0
  112. package/dist/lib/first.d.mts.map +1 -0
  113. package/dist/lib/first.mjs +26 -0
  114. package/dist/lib/first.mjs.map +1 -0
  115. package/dist/lib/flat.d.mts +17 -0
  116. package/dist/lib/flat.d.mts.map +1 -0
  117. package/dist/lib/flat.mjs +23 -0
  118. package/dist/lib/flat.mjs.map +1 -0
  119. package/dist/lib/flatMap.d.mts +18 -0
  120. package/dist/lib/flatMap.d.mts.map +1 -0
  121. package/dist/lib/flatMap.mjs +27 -0
  122. package/dist/lib/flatMap.mjs.map +1 -0
  123. package/dist/lib/forEach.d.mts +20 -0
  124. package/dist/lib/forEach.d.mts.map +1 -0
  125. package/dist/lib/forEach.mjs +29 -0
  126. package/dist/lib/forEach.mjs.map +1 -0
  127. package/dist/lib/from.d.mts +19 -0
  128. package/dist/lib/from.d.mts.map +1 -0
  129. package/dist/lib/from.mjs +12 -0
  130. package/dist/lib/from.mjs.map +1 -0
  131. package/dist/lib/fuse.d.mts +44 -0
  132. package/dist/lib/fuse.d.mts.map +1 -0
  133. package/dist/lib/fuse.mjs +61 -0
  134. package/dist/lib/fuse.mjs.map +1 -0
  135. package/dist/lib/greaterOrEqualThan.d.mts +29 -0
  136. package/dist/lib/greaterOrEqualThan.d.mts.map +1 -0
  137. package/dist/lib/greaterOrEqualThan.mjs +36 -0
  138. package/dist/lib/greaterOrEqualThan.mjs.map +1 -0
  139. package/dist/lib/greaterThan.d.mts +29 -0
  140. package/dist/lib/greaterThan.d.mts.map +1 -0
  141. package/dist/lib/greaterThan.mjs +36 -0
  142. package/dist/lib/greaterThan.mjs.map +1 -0
  143. package/dist/lib/indexOf.d.mts +21 -0
  144. package/dist/lib/indexOf.d.mts.map +1 -0
  145. package/dist/lib/indexOf.mjs +32 -0
  146. package/dist/lib/indexOf.mjs.map +1 -0
  147. package/dist/lib/inspect.d.mts +36 -0
  148. package/dist/lib/inspect.d.mts.map +1 -0
  149. package/dist/lib/inspect.mjs +51 -0
  150. package/dist/lib/inspect.mjs.map +1 -0
  151. package/dist/lib/intersect.d.mts +21 -0
  152. package/dist/lib/intersect.d.mts.map +1 -0
  153. package/dist/lib/intersect.mjs +29 -0
  154. package/dist/lib/intersect.mjs.map +1 -0
  155. package/dist/lib/intersperse.d.mts +26 -0
  156. package/dist/lib/intersperse.d.mts.map +1 -0
  157. package/dist/lib/intersperse.mjs +60 -0
  158. package/dist/lib/intersperse.mjs.map +1 -0
  159. package/dist/lib/isEmpty.d.mts +22 -0
  160. package/dist/lib/isEmpty.d.mts.map +1 -0
  161. package/dist/lib/isEmpty.mjs +28 -0
  162. package/dist/lib/isEmpty.mjs.map +1 -0
  163. package/dist/lib/isSorted.d.mts +30 -0
  164. package/dist/lib/isSorted.d.mts.map +1 -0
  165. package/dist/lib/isSorted.mjs +37 -0
  166. package/dist/lib/isSorted.mjs.map +1 -0
  167. package/dist/lib/isSortedBy.d.mts +27 -0
  168. package/dist/lib/isSortedBy.d.mts.map +1 -0
  169. package/dist/lib/isSortedBy.mjs +44 -0
  170. package/dist/lib/isSortedBy.mjs.map +1 -0
  171. package/dist/lib/isSortedByKey.d.mts +25 -0
  172. package/dist/lib/isSortedByKey.d.mts.map +1 -0
  173. package/dist/lib/isSortedByKey.mjs +45 -0
  174. package/dist/lib/isSortedByKey.mjs.map +1 -0
  175. package/dist/lib/last.d.mts +20 -0
  176. package/dist/lib/last.d.mts.map +1 -0
  177. package/dist/lib/last.mjs +28 -0
  178. package/dist/lib/last.mjs.map +1 -0
  179. package/dist/lib/lessOrEqualThan.d.mts +29 -0
  180. package/dist/lib/lessOrEqualThan.d.mts.map +1 -0
  181. package/dist/lib/lessOrEqualThan.mjs +36 -0
  182. package/dist/lib/lessOrEqualThan.mjs.map +1 -0
  183. package/dist/lib/lessThan.d.mts +29 -0
  184. package/dist/lib/lessThan.d.mts.map +1 -0
  185. package/dist/lib/lessThan.mjs +36 -0
  186. package/dist/lib/lessThan.mjs.map +1 -0
  187. package/dist/lib/map.d.mts +17 -0
  188. package/dist/lib/map.d.mts.map +1 -0
  189. package/dist/lib/map.mjs +26 -0
  190. package/dist/lib/map.mjs.map +1 -0
  191. package/dist/lib/max.d.mts +25 -0
  192. package/dist/lib/max.d.mts.map +1 -0
  193. package/dist/lib/max.mjs +32 -0
  194. package/dist/lib/max.mjs.map +1 -0
  195. package/dist/lib/maxBy.d.mts +26 -0
  196. package/dist/lib/maxBy.d.mts.map +1 -0
  197. package/dist/lib/maxBy.mjs +42 -0
  198. package/dist/lib/maxBy.mjs.map +1 -0
  199. package/dist/lib/maxByKey.d.mts +27 -0
  200. package/dist/lib/maxByKey.d.mts.map +1 -0
  201. package/dist/lib/maxByKey.mjs +50 -0
  202. package/dist/lib/maxByKey.mjs.map +1 -0
  203. package/dist/lib/min.d.mts +25 -0
  204. package/dist/lib/min.d.mts.map +1 -0
  205. package/dist/lib/min.mjs +32 -0
  206. package/dist/lib/min.mjs.map +1 -0
  207. package/dist/lib/minBy.d.mts +26 -0
  208. package/dist/lib/minBy.d.mts.map +1 -0
  209. package/dist/lib/minBy.mjs +42 -0
  210. package/dist/lib/minBy.mjs.map +1 -0
  211. package/dist/lib/minByKey.d.mts +26 -0
  212. package/dist/lib/minByKey.d.mts.map +1 -0
  213. package/dist/lib/minByKey.mjs +49 -0
  214. package/dist/lib/minByKey.mjs.map +1 -0
  215. package/dist/lib/notEqual.d.mts +23 -0
  216. package/dist/lib/notEqual.d.mts.map +1 -0
  217. package/dist/lib/notEqual.mjs +28 -0
  218. package/dist/lib/notEqual.mjs.map +1 -0
  219. package/dist/lib/nth.d.mts +2 -0
  220. package/dist/lib/nth.mjs +3 -0
  221. package/dist/lib/partition.d.mts +29 -0
  222. package/dist/lib/partition.d.mts.map +1 -0
  223. package/dist/lib/partition.mjs +16 -0
  224. package/dist/lib/partition.mjs.map +1 -0
  225. package/dist/lib/peekable.d.mts +32 -0
  226. package/dist/lib/peekable.d.mts.map +1 -0
  227. package/dist/lib/peekable.mjs +52 -0
  228. package/dist/lib/peekable.mjs.map +1 -0
  229. package/dist/lib/position.d.mts +2 -0
  230. package/dist/lib/position.mjs +3 -0
  231. package/dist/lib/prepend.d.mts +18 -0
  232. package/dist/lib/prepend.d.mts.map +1 -0
  233. package/dist/lib/prepend.mjs +25 -0
  234. package/dist/lib/prepend.mjs.map +1 -0
  235. package/dist/lib/product.d.mts +21 -0
  236. package/dist/lib/product.d.mts.map +1 -0
  237. package/dist/lib/product.mjs +30 -0
  238. package/dist/lib/product.mjs.map +1 -0
  239. package/dist/lib/range.d.mts +29 -0
  240. package/dist/lib/range.d.mts.map +1 -0
  241. package/dist/lib/range.mjs +46 -0
  242. package/dist/lib/range.mjs.map +1 -0
  243. package/dist/lib/reduce.d.mts +29 -0
  244. package/dist/lib/reduce.d.mts.map +1 -0
  245. package/dist/lib/reduce.mjs +50 -0
  246. package/dist/lib/reduce.mjs.map +1 -0
  247. package/dist/lib/repeat.d.mts +17 -0
  248. package/dist/lib/repeat.d.mts.map +1 -0
  249. package/dist/lib/repeat.mjs +34 -0
  250. package/dist/lib/repeat.mjs.map +1 -0
  251. package/dist/lib/reverse.d.mts +22 -0
  252. package/dist/lib/reverse.d.mts.map +1 -0
  253. package/dist/lib/reverse.mjs +29 -0
  254. package/dist/lib/reverse.mjs.map +1 -0
  255. package/dist/lib/shared/_assertFunction.d.mts +2 -0
  256. package/dist/lib/shared/_assertFunction.d.mts.map +1 -0
  257. package/dist/lib/shared/_assertFunction.mjs +8 -0
  258. package/dist/lib/shared/_assertFunction.mjs.map +1 -0
  259. package/dist/lib/shared/_assertNotNegative.d.mts +2 -0
  260. package/dist/lib/shared/_assertNotNegative.d.mts.map +1 -0
  261. package/dist/lib/shared/_assertNotNegative.mjs +8 -0
  262. package/dist/lib/shared/_assertNotNegative.mjs.map +1 -0
  263. package/dist/lib/shared/_assertPositive.d.mts +2 -0
  264. package/dist/lib/shared/_assertPositive.d.mts.map +1 -0
  265. package/dist/lib/shared/_assertPositive.mjs +8 -0
  266. package/dist/lib/shared/_assertPositive.mjs.map +1 -0
  267. package/dist/lib/shared/_compare.d.mts +19 -0
  268. package/dist/lib/shared/_compare.d.mts.map +1 -0
  269. package/dist/lib/shared/_compare.mjs +21 -0
  270. package/dist/lib/shared/_compare.mjs.map +1 -0
  271. package/dist/lib/shared/_makeIterableIterator.d.mts +2 -0
  272. package/dist/lib/shared/_makeIterableIterator.d.mts.map +1 -0
  273. package/dist/lib/shared/_makeIterableIterator.mjs +12 -0
  274. package/dist/lib/shared/_makeIterableIterator.mjs.map +1 -0
  275. package/dist/lib/shared/_toIntegerOrInfinityOrThrow.d.mts +2 -0
  276. package/dist/lib/shared/_toIntegerOrInfinityOrThrow.d.mts.map +1 -0
  277. package/dist/lib/shared/_toIntegerOrInfinityOrThrow.mjs +13 -0
  278. package/dist/lib/shared/_toIntegerOrInfinityOrThrow.mjs.map +1 -0
  279. package/dist/lib/shared/_toIntegerOrThrow.d.mts +2 -0
  280. package/dist/lib/shared/_toIntegerOrThrow.d.mts.map +1 -0
  281. package/dist/lib/shared/_toIntegerOrThrow.mjs +13 -0
  282. package/dist/lib/shared/_toIntegerOrThrow.mjs.map +1 -0
  283. package/dist/lib/shared/_toNumberOrThrow.d.mts +7 -0
  284. package/dist/lib/shared/_toNumberOrThrow.d.mts.map +1 -0
  285. package/dist/lib/shared/_toNumberOrThrow.mjs +18 -0
  286. package/dist/lib/shared/_toNumberOrThrow.mjs.map +1 -0
  287. package/dist/lib/shared/comparators.d.mts +30 -0
  288. package/dist/lib/shared/comparators.d.mts.map +1 -0
  289. package/dist/lib/shared/comparators.mjs +38 -0
  290. package/dist/lib/shared/comparators.mjs.map +1 -0
  291. package/dist/lib/skip.d.mts +2 -0
  292. package/dist/lib/skip.mjs +3 -0
  293. package/dist/lib/skipLast.d.mts +2 -0
  294. package/dist/lib/skipLast.mjs +3 -0
  295. package/dist/lib/skipWhile.d.mts +2 -0
  296. package/dist/lib/skipWhile.mjs +3 -0
  297. package/dist/lib/slice.d.mts +53 -0
  298. package/dist/lib/slice.d.mts.map +1 -0
  299. package/dist/lib/slice.mjs +76 -0
  300. package/dist/lib/slice.mjs.map +1 -0
  301. package/dist/lib/some.d.mts +28 -0
  302. package/dist/lib/some.d.mts.map +1 -0
  303. package/dist/lib/some.mjs +38 -0
  304. package/dist/lib/some.mjs.map +1 -0
  305. package/dist/lib/sorted.d.mts +21 -0
  306. package/dist/lib/sorted.d.mts.map +1 -0
  307. package/dist/lib/sorted.mjs +27 -0
  308. package/dist/lib/sorted.mjs.map +1 -0
  309. package/dist/lib/starMap.d.mts +24 -0
  310. package/dist/lib/starMap.d.mts.map +1 -0
  311. package/dist/lib/starMap.mjs +31 -0
  312. package/dist/lib/starMap.mjs.map +1 -0
  313. package/dist/lib/stepBy.d.mts +20 -0
  314. package/dist/lib/stepBy.d.mts.map +1 -0
  315. package/dist/lib/stepBy.mjs +42 -0
  316. package/dist/lib/stepBy.mjs.map +1 -0
  317. package/dist/lib/sum.d.mts +21 -0
  318. package/dist/lib/sum.d.mts.map +1 -0
  319. package/dist/lib/sum.mjs +29 -0
  320. package/dist/lib/sum.mjs.map +1 -0
  321. package/dist/lib/take.d.mts +18 -0
  322. package/dist/lib/take.d.mts.map +1 -0
  323. package/dist/lib/take.mjs +35 -0
  324. package/dist/lib/take.mjs.map +1 -0
  325. package/dist/lib/takeLast.d.mts +21 -0
  326. package/dist/lib/takeLast.d.mts.map +1 -0
  327. package/dist/lib/takeLast.mjs +46 -0
  328. package/dist/lib/takeLast.mjs.map +1 -0
  329. package/dist/lib/takeWhile.d.mts +2 -0
  330. package/dist/lib/takeWhile.mjs +3 -0
  331. package/dist/lib/tee.d.mts +22 -0
  332. package/dist/lib/tee.d.mts.map +1 -0
  333. package/dist/lib/tee.mjs +56 -0
  334. package/dist/lib/tee.mjs.map +1 -0
  335. package/dist/lib/toArray.d.mts +32 -0
  336. package/dist/lib/toArray.d.mts.map +1 -0
  337. package/dist/lib/toArray.mjs +38 -0
  338. package/dist/lib/toArray.mjs.map +1 -0
  339. package/dist/lib/toIterableIterator.d.mts +29 -0
  340. package/dist/lib/toIterableIterator.d.mts.map +1 -0
  341. package/dist/lib/toIterableIterator.mjs +38 -0
  342. package/dist/lib/toIterableIterator.mjs.map +1 -0
  343. package/dist/lib/union.d.mts +18 -0
  344. package/dist/lib/union.d.mts.map +1 -0
  345. package/dist/lib/union.mjs +28 -0
  346. package/dist/lib/union.mjs.map +1 -0
  347. package/dist/lib/unique.d.mts +17 -0
  348. package/dist/lib/unique.d.mts.map +1 -0
  349. package/dist/lib/unique.mjs +23 -0
  350. package/dist/lib/unique.mjs.map +1 -0
  351. package/dist/lib/unzip.d.mts +26 -0
  352. package/dist/lib/unzip.d.mts.map +1 -0
  353. package/dist/lib/unzip.mjs +43 -0
  354. package/dist/lib/unzip.mjs.map +1 -0
  355. package/dist/lib/windows.d.mts +18 -0
  356. package/dist/lib/windows.d.mts.map +1 -0
  357. package/dist/lib/windows.mjs +45 -0
  358. package/dist/lib/windows.mjs.map +1 -0
  359. package/dist/lib/zip.d.mts +25 -0
  360. package/dist/lib/zip.d.mts.map +1 -0
  361. package/dist/lib/zip.mjs +39 -0
  362. package/dist/lib/zip.mjs.map +1 -0
  363. package/package.json +199 -751
  364. package/dist/cjs/index.cjs +0 -609
  365. package/dist/cjs/index.cjs.map +0 -1
  366. package/dist/cjs/index.d.cts +0 -79
  367. package/dist/cjs/lib/all.cjs +0 -12
  368. package/dist/cjs/lib/all.cjs.map +0 -1
  369. package/dist/cjs/lib/all.d.cts +0 -2
  370. package/dist/cjs/lib/any.cjs +0 -12
  371. package/dist/cjs/lib/any.cjs.map +0 -1
  372. package/dist/cjs/lib/any.d.cts +0 -2
  373. package/dist/cjs/lib/append.cjs +0 -15
  374. package/dist/cjs/lib/append.cjs.map +0 -1
  375. package/dist/cjs/lib/append.d.cts +0 -21
  376. package/dist/cjs/lib/at.cjs +0 -18
  377. package/dist/cjs/lib/at.cjs.map +0 -1
  378. package/dist/cjs/lib/at.d.cts +0 -25
  379. package/dist/cjs/lib/average.cjs +0 -21
  380. package/dist/cjs/lib/average.cjs.map +0 -1
  381. package/dist/cjs/lib/average.d.cts +0 -25
  382. package/dist/cjs/lib/chain.cjs +0 -16
  383. package/dist/cjs/lib/chain.cjs.map +0 -1
  384. package/dist/cjs/lib/chain.d.cts +0 -20
  385. package/dist/cjs/lib/chunk.cjs +0 -27
  386. package/dist/cjs/lib/chunk.cjs.map +0 -1
  387. package/dist/cjs/lib/chunk.d.cts +0 -20
  388. package/dist/cjs/lib/collect.cjs +0 -12
  389. package/dist/cjs/lib/collect.cjs.map +0 -1
  390. package/dist/cjs/lib/collect.d.cts +0 -2
  391. package/dist/cjs/lib/collectInto.cjs +0 -17
  392. package/dist/cjs/lib/collectInto.cjs.map +0 -1
  393. package/dist/cjs/lib/collectInto.d.cts +0 -29
  394. package/dist/cjs/lib/compact.cjs +0 -14
  395. package/dist/cjs/lib/compact.cjs.map +0 -1
  396. package/dist/cjs/lib/compact.d.cts +0 -19
  397. package/dist/cjs/lib/compare.cjs +0 -15
  398. package/dist/cjs/lib/compare.cjs.map +0 -1
  399. package/dist/cjs/lib/compare.d.cts +0 -32
  400. package/dist/cjs/lib/compareBy.cjs +0 -26
  401. package/dist/cjs/lib/compareBy.cjs.map +0 -1
  402. package/dist/cjs/lib/compareBy.d.cts +0 -31
  403. package/dist/cjs/lib/compress.cjs +0 -24
  404. package/dist/cjs/lib/compress.cjs.map +0 -1
  405. package/dist/cjs/lib/compress.d.cts +0 -26
  406. package/dist/cjs/lib/contains.cjs +0 -17
  407. package/dist/cjs/lib/contains.cjs.map +0 -1
  408. package/dist/cjs/lib/contains.d.cts +0 -25
  409. package/dist/cjs/lib/count.cjs +0 -19
  410. package/dist/cjs/lib/count.cjs.map +0 -1
  411. package/dist/cjs/lib/count.d.cts +0 -24
  412. package/dist/cjs/lib/cycle.cjs +0 -23
  413. package/dist/cjs/lib/cycle.cjs.map +0 -1
  414. package/dist/cjs/lib/cycle.d.cts +0 -21
  415. package/dist/cjs/lib/difference.cjs +0 -18
  416. package/dist/cjs/lib/difference.cjs.map +0 -1
  417. package/dist/cjs/lib/difference.d.cts +0 -25
  418. package/dist/cjs/lib/drop.cjs +0 -24
  419. package/dist/cjs/lib/drop.cjs.map +0 -1
  420. package/dist/cjs/lib/drop.d.cts +0 -21
  421. package/dist/cjs/lib/dropLast.cjs +0 -21
  422. package/dist/cjs/lib/dropLast.cjs.map +0 -1
  423. package/dist/cjs/lib/dropLast.d.cts +0 -25
  424. package/dist/cjs/lib/dropWhile.cjs +0 -21
  425. package/dist/cjs/lib/dropWhile.cjs.map +0 -1
  426. package/dist/cjs/lib/dropWhile.d.cts +0 -24
  427. package/dist/cjs/lib/empty.cjs +0 -14
  428. package/dist/cjs/lib/empty.cjs.map +0 -1
  429. package/dist/cjs/lib/empty.d.cts +0 -17
  430. package/dist/cjs/lib/enumerate.cjs +0 -17
  431. package/dist/cjs/lib/enumerate.cjs.map +0 -1
  432. package/dist/cjs/lib/enumerate.d.cts +0 -24
  433. package/dist/cjs/lib/equal.cjs +0 -15
  434. package/dist/cjs/lib/equal.cjs.map +0 -1
  435. package/dist/cjs/lib/equal.d.cts +0 -26
  436. package/dist/cjs/lib/equalBy.cjs +0 -23
  437. package/dist/cjs/lib/equalBy.cjs.map +0 -1
  438. package/dist/cjs/lib/equalBy.d.cts +0 -27
  439. package/dist/cjs/lib/every.cjs +0 -20
  440. package/dist/cjs/lib/every.cjs.map +0 -1
  441. package/dist/cjs/lib/every.d.cts +0 -29
  442. package/dist/cjs/lib/filter.cjs +0 -19
  443. package/dist/cjs/lib/filter.cjs.map +0 -1
  444. package/dist/cjs/lib/filter.d.cts +0 -22
  445. package/dist/cjs/lib/find.cjs +0 -15
  446. package/dist/cjs/lib/find.cjs.map +0 -1
  447. package/dist/cjs/lib/find.d.cts +0 -26
  448. package/dist/cjs/lib/findIndex.cjs +0 -23
  449. package/dist/cjs/lib/findIndex.cjs.map +0 -1
  450. package/dist/cjs/lib/findIndex.d.cts +0 -25
  451. package/dist/cjs/lib/first.cjs +0 -14
  452. package/dist/cjs/lib/first.cjs.map +0 -1
  453. package/dist/cjs/lib/first.d.cts +0 -24
  454. package/dist/cjs/lib/flat.cjs +0 -16
  455. package/dist/cjs/lib/flat.cjs.map +0 -1
  456. package/dist/cjs/lib/flat.d.cts +0 -20
  457. package/dist/cjs/lib/flatMap.cjs +0 -19
  458. package/dist/cjs/lib/flatMap.cjs.map +0 -1
  459. package/dist/cjs/lib/flatMap.d.cts +0 -21
  460. package/dist/cjs/lib/forEach.cjs +0 -19
  461. package/dist/cjs/lib/forEach.cjs.map +0 -1
  462. package/dist/cjs/lib/forEach.d.cts +0 -24
  463. package/dist/cjs/lib/from.cjs +0 -25
  464. package/dist/cjs/lib/from.cjs.map +0 -1
  465. package/dist/cjs/lib/from.d.cts +0 -21
  466. package/dist/cjs/lib/fuse.cjs +0 -26
  467. package/dist/cjs/lib/fuse.cjs.map +0 -1
  468. package/dist/cjs/lib/fuse.d.cts +0 -47
  469. package/dist/cjs/lib/greaterOrEqualThan.cjs +0 -17
  470. package/dist/cjs/lib/greaterOrEqualThan.cjs.map +0 -1
  471. package/dist/cjs/lib/greaterOrEqualThan.d.cts +0 -32
  472. package/dist/cjs/lib/greaterThan.cjs +0 -17
  473. package/dist/cjs/lib/greaterThan.cjs.map +0 -1
  474. package/dist/cjs/lib/greaterThan.d.cts +0 -32
  475. package/dist/cjs/lib/indexOf.cjs +0 -21
  476. package/dist/cjs/lib/indexOf.cjs.map +0 -1
  477. package/dist/cjs/lib/indexOf.d.cts +0 -25
  478. package/dist/cjs/lib/inspect.cjs +0 -25
  479. package/dist/cjs/lib/inspect.cjs.map +0 -1
  480. package/dist/cjs/lib/inspect.d.cts +0 -39
  481. package/dist/cjs/lib/intersect.cjs +0 -16
  482. package/dist/cjs/lib/intersect.cjs.map +0 -1
  483. package/dist/cjs/lib/intersect.d.cts +0 -26
  484. package/dist/cjs/lib/intersperse.cjs +0 -35
  485. package/dist/cjs/lib/intersperse.cjs.map +0 -1
  486. package/dist/cjs/lib/intersperse.d.cts +0 -30
  487. package/dist/cjs/lib/isEmpty.cjs +0 -14
  488. package/dist/cjs/lib/isEmpty.cjs.map +0 -1
  489. package/dist/cjs/lib/isEmpty.d.cts +0 -26
  490. package/dist/cjs/lib/isSorted.cjs +0 -15
  491. package/dist/cjs/lib/isSorted.cjs.map +0 -1
  492. package/dist/cjs/lib/isSorted.d.cts +0 -35
  493. package/dist/cjs/lib/isSortedBy.cjs +0 -26
  494. package/dist/cjs/lib/isSortedBy.cjs.map +0 -1
  495. package/dist/cjs/lib/isSortedBy.d.cts +0 -32
  496. package/dist/cjs/lib/isSortedByKey.cjs +0 -29
  497. package/dist/cjs/lib/isSortedByKey.cjs.map +0 -1
  498. package/dist/cjs/lib/isSortedByKey.d.cts +0 -30
  499. package/dist/cjs/lib/last.cjs +0 -18
  500. package/dist/cjs/lib/last.cjs.map +0 -1
  501. package/dist/cjs/lib/last.d.cts +0 -24
  502. package/dist/cjs/lib/lessOrEqualThan.cjs +0 -17
  503. package/dist/cjs/lib/lessOrEqualThan.cjs.map +0 -1
  504. package/dist/cjs/lib/lessOrEqualThan.d.cts +0 -32
  505. package/dist/cjs/lib/lessThan.cjs +0 -17
  506. package/dist/cjs/lib/lessThan.cjs.map +0 -1
  507. package/dist/cjs/lib/lessThan.d.cts +0 -32
  508. package/dist/cjs/lib/map.cjs +0 -19
  509. package/dist/cjs/lib/map.cjs.map +0 -1
  510. package/dist/cjs/lib/map.d.cts +0 -20
  511. package/dist/cjs/lib/max.cjs +0 -15
  512. package/dist/cjs/lib/max.cjs.map +0 -1
  513. package/dist/cjs/lib/max.d.cts +0 -30
  514. package/dist/cjs/lib/maxBy.cjs +0 -27
  515. package/dist/cjs/lib/maxBy.cjs.map +0 -1
  516. package/dist/cjs/lib/maxBy.d.cts +0 -31
  517. package/dist/cjs/lib/maxByKey.cjs +0 -32
  518. package/dist/cjs/lib/maxByKey.cjs.map +0 -1
  519. package/dist/cjs/lib/maxByKey.d.cts +0 -32
  520. package/dist/cjs/lib/min.cjs +0 -15
  521. package/dist/cjs/lib/min.cjs.map +0 -1
  522. package/dist/cjs/lib/min.d.cts +0 -30
  523. package/dist/cjs/lib/minBy.cjs +0 -27
  524. package/dist/cjs/lib/minBy.cjs.map +0 -1
  525. package/dist/cjs/lib/minBy.d.cts +0 -31
  526. package/dist/cjs/lib/minByKey.cjs +0 -32
  527. package/dist/cjs/lib/minByKey.cjs.map +0 -1
  528. package/dist/cjs/lib/minByKey.d.cts +0 -31
  529. package/dist/cjs/lib/notEqual.cjs +0 -15
  530. package/dist/cjs/lib/notEqual.cjs.map +0 -1
  531. package/dist/cjs/lib/notEqual.d.cts +0 -26
  532. package/dist/cjs/lib/nth.cjs +0 -12
  533. package/dist/cjs/lib/nth.cjs.map +0 -1
  534. package/dist/cjs/lib/nth.d.cts +0 -2
  535. package/dist/cjs/lib/partition.cjs +0 -26
  536. package/dist/cjs/lib/partition.cjs.map +0 -1
  537. package/dist/cjs/lib/partition.d.cts +0 -33
  538. package/dist/cjs/lib/peekable.cjs +0 -31
  539. package/dist/cjs/lib/peekable.cjs.map +0 -1
  540. package/dist/cjs/lib/peekable.d.cts +0 -35
  541. package/dist/cjs/lib/position.cjs +0 -12
  542. package/dist/cjs/lib/position.cjs.map +0 -1
  543. package/dist/cjs/lib/position.d.cts +0 -2
  544. package/dist/cjs/lib/prepend.cjs +0 -17
  545. package/dist/cjs/lib/prepend.cjs.map +0 -1
  546. package/dist/cjs/lib/prepend.d.cts +0 -22
  547. package/dist/cjs/lib/product.cjs +0 -19
  548. package/dist/cjs/lib/product.cjs.map +0 -1
  549. package/dist/cjs/lib/product.d.cts +0 -24
  550. package/dist/cjs/lib/range.cjs +0 -37
  551. package/dist/cjs/lib/range.cjs.map +0 -1
  552. package/dist/cjs/lib/range.d.cts +0 -33
  553. package/dist/cjs/lib/reduce.cjs +0 -31
  554. package/dist/cjs/lib/reduce.cjs.map +0 -1
  555. package/dist/cjs/lib/reduce.d.cts +0 -33
  556. package/dist/cjs/lib/repeat.cjs +0 -20
  557. package/dist/cjs/lib/repeat.cjs.map +0 -1
  558. package/dist/cjs/lib/repeat.d.cts +0 -20
  559. package/dist/cjs/lib/reverse.cjs +0 -17
  560. package/dist/cjs/lib/reverse.cjs.map +0 -1
  561. package/dist/cjs/lib/reverse.d.cts +0 -26
  562. package/dist/cjs/lib/shared/_assertFunction.cjs +0 -17
  563. package/dist/cjs/lib/shared/_assertFunction.cjs.map +0 -1
  564. package/dist/cjs/lib/shared/_assertFunction.d.cts +0 -3
  565. package/dist/cjs/lib/shared/_assertNotNegative.cjs +0 -17
  566. package/dist/cjs/lib/shared/_assertNotNegative.cjs.map +0 -1
  567. package/dist/cjs/lib/shared/_assertNotNegative.d.cts +0 -3
  568. package/dist/cjs/lib/shared/_assertPositive.cjs +0 -17
  569. package/dist/cjs/lib/shared/_assertPositive.cjs.map +0 -1
  570. package/dist/cjs/lib/shared/_assertPositive.d.cts +0 -3
  571. package/dist/cjs/lib/shared/_compare.cjs +0 -36
  572. package/dist/cjs/lib/shared/_compare.cjs.map +0 -1
  573. package/dist/cjs/lib/shared/_compare.d.cts +0 -20
  574. package/dist/cjs/lib/shared/_makeIterableIterator.cjs +0 -19
  575. package/dist/cjs/lib/shared/_makeIterableIterator.cjs.map +0 -1
  576. package/dist/cjs/lib/shared/_makeIterableIterator.d.cts +0 -3
  577. package/dist/cjs/lib/shared/_toIntegerOrInfinityOrThrow.cjs +0 -18
  578. package/dist/cjs/lib/shared/_toIntegerOrInfinityOrThrow.cjs.map +0 -1
  579. package/dist/cjs/lib/shared/_toIntegerOrInfinityOrThrow.d.cts +0 -3
  580. package/dist/cjs/lib/shared/_toIntegerOrThrow.cjs +0 -18
  581. package/dist/cjs/lib/shared/_toIntegerOrThrow.cjs.map +0 -1
  582. package/dist/cjs/lib/shared/_toIntegerOrThrow.d.cts +0 -3
  583. package/dist/cjs/lib/shared/_toNumberOrThrow.cjs +0 -34
  584. package/dist/cjs/lib/shared/_toNumberOrThrow.cjs.map +0 -1
  585. package/dist/cjs/lib/shared/_toNumberOrThrow.d.cts +0 -8
  586. package/dist/cjs/lib/shared/comparators.cjs +0 -28
  587. package/dist/cjs/lib/shared/comparators.cjs.map +0 -1
  588. package/dist/cjs/lib/shared/comparators.d.cts +0 -34
  589. package/dist/cjs/lib/skip.cjs +0 -12
  590. package/dist/cjs/lib/skip.cjs.map +0 -1
  591. package/dist/cjs/lib/skip.d.cts +0 -2
  592. package/dist/cjs/lib/skipLast.cjs +0 -12
  593. package/dist/cjs/lib/skipLast.cjs.map +0 -1
  594. package/dist/cjs/lib/skipLast.d.cts +0 -2
  595. package/dist/cjs/lib/skipWhile.cjs +0 -12
  596. package/dist/cjs/lib/skipWhile.cjs.map +0 -1
  597. package/dist/cjs/lib/skipWhile.d.cts +0 -2
  598. package/dist/cjs/lib/slice.cjs +0 -43
  599. package/dist/cjs/lib/slice.cjs.map +0 -1
  600. package/dist/cjs/lib/slice.d.cts +0 -62
  601. package/dist/cjs/lib/some.cjs +0 -22
  602. package/dist/cjs/lib/some.cjs.map +0 -1
  603. package/dist/cjs/lib/some.d.cts +0 -33
  604. package/dist/cjs/lib/sorted.cjs +0 -14
  605. package/dist/cjs/lib/sorted.cjs.map +0 -1
  606. package/dist/cjs/lib/sorted.d.cts +0 -25
  607. package/dist/cjs/lib/starMap.cjs +0 -19
  608. package/dist/cjs/lib/starMap.cjs.map +0 -1
  609. package/dist/cjs/lib/starMap.d.cts +0 -28
  610. package/dist/cjs/lib/stepBy.cjs +0 -29
  611. package/dist/cjs/lib/stepBy.cjs.map +0 -1
  612. package/dist/cjs/lib/stepBy.d.cts +0 -24
  613. package/dist/cjs/lib/sum.cjs +0 -19
  614. package/dist/cjs/lib/sum.cjs.map +0 -1
  615. package/dist/cjs/lib/sum.d.cts +0 -25
  616. package/dist/cjs/lib/take.cjs +0 -24
  617. package/dist/cjs/lib/take.cjs.map +0 -1
  618. package/dist/cjs/lib/take.d.cts +0 -21
  619. package/dist/cjs/lib/takeLast.cjs +0 -29
  620. package/dist/cjs/lib/takeLast.cjs.map +0 -1
  621. package/dist/cjs/lib/takeLast.d.cts +0 -25
  622. package/dist/cjs/lib/takeWhile.cjs +0 -12
  623. package/dist/cjs/lib/takeWhile.cjs.map +0 -1
  624. package/dist/cjs/lib/takeWhile.d.cts +0 -2
  625. package/dist/cjs/lib/tee.cjs +0 -38
  626. package/dist/cjs/lib/tee.cjs.map +0 -1
  627. package/dist/cjs/lib/tee.d.cts +0 -25
  628. package/dist/cjs/lib/toArray.cjs +0 -14
  629. package/dist/cjs/lib/toArray.cjs.map +0 -1
  630. package/dist/cjs/lib/toArray.d.cts +0 -36
  631. package/dist/cjs/lib/toIterableIterator.cjs +0 -19
  632. package/dist/cjs/lib/toIterableIterator.cjs.map +0 -1
  633. package/dist/cjs/lib/toIterableIterator.d.cts +0 -32
  634. package/dist/cjs/lib/union.cjs +0 -22
  635. package/dist/cjs/lib/union.cjs.map +0 -1
  636. package/dist/cjs/lib/union.d.cts +0 -21
  637. package/dist/cjs/lib/unique.cjs +0 -14
  638. package/dist/cjs/lib/unique.cjs.map +0 -1
  639. package/dist/cjs/lib/unique.d.cts +0 -20
  640. package/dist/cjs/lib/unzip.cjs +0 -36
  641. package/dist/cjs/lib/unzip.cjs.map +0 -1
  642. package/dist/cjs/lib/unzip.d.cts +0 -32
  643. package/dist/cjs/lib/windows.cjs +0 -29
  644. package/dist/cjs/lib/windows.cjs.map +0 -1
  645. package/dist/cjs/lib/windows.d.cts +0 -21
  646. package/dist/cjs/lib/zip.cjs +0 -23
  647. package/dist/cjs/lib/zip.cjs.map +0 -1
  648. package/dist/cjs/lib/zip.d.cts +0 -30
  649. package/dist/esm/chunk-PAWJFY3S.mjs +0 -6
  650. package/dist/esm/chunk-PAWJFY3S.mjs.map +0 -1
  651. package/dist/esm/index.d.mts +0 -79
  652. package/dist/esm/index.mjs +0 -88
  653. package/dist/esm/index.mjs.map +0 -1
  654. package/dist/esm/lib/all.d.mts +0 -2
  655. package/dist/esm/lib/all.mjs +0 -4
  656. package/dist/esm/lib/all.mjs.map +0 -1
  657. package/dist/esm/lib/any.d.mts +0 -2
  658. package/dist/esm/lib/any.mjs +0 -4
  659. package/dist/esm/lib/any.mjs.map +0 -1
  660. package/dist/esm/lib/append.d.mts +0 -21
  661. package/dist/esm/lib/append.mjs +0 -11
  662. package/dist/esm/lib/append.mjs.map +0 -1
  663. package/dist/esm/lib/at.d.mts +0 -25
  664. package/dist/esm/lib/at.mjs +0 -15
  665. package/dist/esm/lib/at.mjs.map +0 -1
  666. package/dist/esm/lib/average.d.mts +0 -25
  667. package/dist/esm/lib/average.mjs +0 -18
  668. package/dist/esm/lib/average.mjs.map +0 -1
  669. package/dist/esm/lib/chain.d.mts +0 -20
  670. package/dist/esm/lib/chain.mjs +0 -13
  671. package/dist/esm/lib/chain.mjs.map +0 -1
  672. package/dist/esm/lib/chunk.d.mts +0 -20
  673. package/dist/esm/lib/chunk.mjs +0 -24
  674. package/dist/esm/lib/chunk.mjs.map +0 -1
  675. package/dist/esm/lib/collect.d.mts +0 -2
  676. package/dist/esm/lib/collect.mjs +0 -4
  677. package/dist/esm/lib/collect.mjs.map +0 -1
  678. package/dist/esm/lib/collectInto.d.mts +0 -29
  679. package/dist/esm/lib/collectInto.mjs +0 -14
  680. package/dist/esm/lib/collectInto.mjs.map +0 -1
  681. package/dist/esm/lib/compact.d.mts +0 -19
  682. package/dist/esm/lib/compact.mjs +0 -11
  683. package/dist/esm/lib/compact.mjs.map +0 -1
  684. package/dist/esm/lib/compare.d.mts +0 -32
  685. package/dist/esm/lib/compare.mjs +0 -12
  686. package/dist/esm/lib/compare.mjs.map +0 -1
  687. package/dist/esm/lib/compareBy.d.mts +0 -31
  688. package/dist/esm/lib/compareBy.mjs +0 -23
  689. package/dist/esm/lib/compareBy.mjs.map +0 -1
  690. package/dist/esm/lib/compress.d.mts +0 -26
  691. package/dist/esm/lib/compress.mjs +0 -21
  692. package/dist/esm/lib/compress.mjs.map +0 -1
  693. package/dist/esm/lib/contains.d.mts +0 -25
  694. package/dist/esm/lib/contains.mjs +0 -14
  695. package/dist/esm/lib/contains.mjs.map +0 -1
  696. package/dist/esm/lib/count.d.mts +0 -24
  697. package/dist/esm/lib/count.mjs +0 -16
  698. package/dist/esm/lib/count.mjs.map +0 -1
  699. package/dist/esm/lib/cycle.d.mts +0 -21
  700. package/dist/esm/lib/cycle.mjs +0 -20
  701. package/dist/esm/lib/cycle.mjs.map +0 -1
  702. package/dist/esm/lib/difference.d.mts +0 -25
  703. package/dist/esm/lib/difference.mjs +0 -13
  704. package/dist/esm/lib/difference.mjs.map +0 -1
  705. package/dist/esm/lib/drop.d.mts +0 -21
  706. package/dist/esm/lib/drop.mjs +0 -21
  707. package/dist/esm/lib/drop.mjs.map +0 -1
  708. package/dist/esm/lib/dropLast.d.mts +0 -25
  709. package/dist/esm/lib/dropLast.mjs +0 -18
  710. package/dist/esm/lib/dropLast.mjs.map +0 -1
  711. package/dist/esm/lib/dropWhile.d.mts +0 -24
  712. package/dist/esm/lib/dropWhile.mjs +0 -18
  713. package/dist/esm/lib/dropWhile.mjs.map +0 -1
  714. package/dist/esm/lib/empty.d.mts +0 -17
  715. package/dist/esm/lib/empty.mjs +0 -11
  716. package/dist/esm/lib/empty.mjs.map +0 -1
  717. package/dist/esm/lib/enumerate.d.mts +0 -24
  718. package/dist/esm/lib/enumerate.mjs +0 -14
  719. package/dist/esm/lib/enumerate.mjs.map +0 -1
  720. package/dist/esm/lib/equal.d.mts +0 -26
  721. package/dist/esm/lib/equal.mjs +0 -11
  722. package/dist/esm/lib/equal.mjs.map +0 -1
  723. package/dist/esm/lib/equalBy.d.mts +0 -27
  724. package/dist/esm/lib/equalBy.mjs +0 -19
  725. package/dist/esm/lib/equalBy.mjs.map +0 -1
  726. package/dist/esm/lib/every.d.mts +0 -29
  727. package/dist/esm/lib/every.mjs +0 -17
  728. package/dist/esm/lib/every.mjs.map +0 -1
  729. package/dist/esm/lib/filter.d.mts +0 -22
  730. package/dist/esm/lib/filter.mjs +0 -16
  731. package/dist/esm/lib/filter.mjs.map +0 -1
  732. package/dist/esm/lib/find.d.mts +0 -26
  733. package/dist/esm/lib/find.mjs +0 -12
  734. package/dist/esm/lib/find.mjs.map +0 -1
  735. package/dist/esm/lib/findIndex.d.mts +0 -25
  736. package/dist/esm/lib/findIndex.mjs +0 -20
  737. package/dist/esm/lib/findIndex.mjs.map +0 -1
  738. package/dist/esm/lib/first.d.mts +0 -24
  739. package/dist/esm/lib/first.mjs +0 -11
  740. package/dist/esm/lib/first.mjs.map +0 -1
  741. package/dist/esm/lib/flat.d.mts +0 -20
  742. package/dist/esm/lib/flat.mjs +0 -13
  743. package/dist/esm/lib/flat.mjs.map +0 -1
  744. package/dist/esm/lib/flatMap.d.mts +0 -21
  745. package/dist/esm/lib/flatMap.mjs +0 -16
  746. package/dist/esm/lib/flatMap.mjs.map +0 -1
  747. package/dist/esm/lib/forEach.d.mts +0 -24
  748. package/dist/esm/lib/forEach.mjs +0 -16
  749. package/dist/esm/lib/forEach.mjs.map +0 -1
  750. package/dist/esm/lib/from.d.mts +0 -21
  751. package/dist/esm/lib/from.mjs +0 -22
  752. package/dist/esm/lib/from.mjs.map +0 -1
  753. package/dist/esm/lib/fuse.d.mts +0 -47
  754. package/dist/esm/lib/fuse.mjs +0 -23
  755. package/dist/esm/lib/fuse.mjs.map +0 -1
  756. package/dist/esm/lib/greaterOrEqualThan.d.mts +0 -32
  757. package/dist/esm/lib/greaterOrEqualThan.mjs +0 -13
  758. package/dist/esm/lib/greaterOrEqualThan.mjs.map +0 -1
  759. package/dist/esm/lib/greaterThan.d.mts +0 -32
  760. package/dist/esm/lib/greaterThan.mjs +0 -13
  761. package/dist/esm/lib/greaterThan.mjs.map +0 -1
  762. package/dist/esm/lib/indexOf.d.mts +0 -25
  763. package/dist/esm/lib/indexOf.mjs +0 -18
  764. package/dist/esm/lib/indexOf.mjs.map +0 -1
  765. package/dist/esm/lib/inspect.d.mts +0 -39
  766. package/dist/esm/lib/inspect.mjs +0 -22
  767. package/dist/esm/lib/inspect.mjs.map +0 -1
  768. package/dist/esm/lib/intersect.d.mts +0 -26
  769. package/dist/esm/lib/intersect.mjs +0 -13
  770. package/dist/esm/lib/intersect.mjs.map +0 -1
  771. package/dist/esm/lib/intersperse.d.mts +0 -30
  772. package/dist/esm/lib/intersperse.mjs +0 -32
  773. package/dist/esm/lib/intersperse.mjs.map +0 -1
  774. package/dist/esm/lib/isEmpty.d.mts +0 -26
  775. package/dist/esm/lib/isEmpty.mjs +0 -11
  776. package/dist/esm/lib/isEmpty.mjs.map +0 -1
  777. package/dist/esm/lib/isSorted.d.mts +0 -35
  778. package/dist/esm/lib/isSorted.mjs +0 -12
  779. package/dist/esm/lib/isSorted.mjs.map +0 -1
  780. package/dist/esm/lib/isSortedBy.d.mts +0 -32
  781. package/dist/esm/lib/isSortedBy.mjs +0 -23
  782. package/dist/esm/lib/isSortedBy.mjs.map +0 -1
  783. package/dist/esm/lib/isSortedByKey.d.mts +0 -30
  784. package/dist/esm/lib/isSortedByKey.mjs +0 -26
  785. package/dist/esm/lib/isSortedByKey.mjs.map +0 -1
  786. package/dist/esm/lib/last.d.mts +0 -24
  787. package/dist/esm/lib/last.mjs +0 -15
  788. package/dist/esm/lib/last.mjs.map +0 -1
  789. package/dist/esm/lib/lessOrEqualThan.d.mts +0 -32
  790. package/dist/esm/lib/lessOrEqualThan.mjs +0 -13
  791. package/dist/esm/lib/lessOrEqualThan.mjs.map +0 -1
  792. package/dist/esm/lib/lessThan.d.mts +0 -32
  793. package/dist/esm/lib/lessThan.mjs +0 -13
  794. package/dist/esm/lib/lessThan.mjs.map +0 -1
  795. package/dist/esm/lib/map.d.mts +0 -20
  796. package/dist/esm/lib/map.mjs +0 -16
  797. package/dist/esm/lib/map.mjs.map +0 -1
  798. package/dist/esm/lib/max.d.mts +0 -30
  799. package/dist/esm/lib/max.mjs +0 -12
  800. package/dist/esm/lib/max.mjs.map +0 -1
  801. package/dist/esm/lib/maxBy.d.mts +0 -31
  802. package/dist/esm/lib/maxBy.mjs +0 -24
  803. package/dist/esm/lib/maxBy.mjs.map +0 -1
  804. package/dist/esm/lib/maxByKey.d.mts +0 -32
  805. package/dist/esm/lib/maxByKey.mjs +0 -29
  806. package/dist/esm/lib/maxByKey.mjs.map +0 -1
  807. package/dist/esm/lib/min.d.mts +0 -30
  808. package/dist/esm/lib/min.mjs +0 -12
  809. package/dist/esm/lib/min.mjs.map +0 -1
  810. package/dist/esm/lib/minBy.d.mts +0 -31
  811. package/dist/esm/lib/minBy.mjs +0 -24
  812. package/dist/esm/lib/minBy.mjs.map +0 -1
  813. package/dist/esm/lib/minByKey.d.mts +0 -31
  814. package/dist/esm/lib/minByKey.mjs +0 -29
  815. package/dist/esm/lib/minByKey.mjs.map +0 -1
  816. package/dist/esm/lib/notEqual.d.mts +0 -26
  817. package/dist/esm/lib/notEqual.mjs +0 -11
  818. package/dist/esm/lib/notEqual.mjs.map +0 -1
  819. package/dist/esm/lib/nth.d.mts +0 -2
  820. package/dist/esm/lib/nth.mjs +0 -4
  821. package/dist/esm/lib/nth.mjs.map +0 -1
  822. package/dist/esm/lib/partition.d.mts +0 -33
  823. package/dist/esm/lib/partition.mjs +0 -23
  824. package/dist/esm/lib/partition.mjs.map +0 -1
  825. package/dist/esm/lib/peekable.d.mts +0 -35
  826. package/dist/esm/lib/peekable.mjs +0 -28
  827. package/dist/esm/lib/peekable.mjs.map +0 -1
  828. package/dist/esm/lib/position.d.mts +0 -2
  829. package/dist/esm/lib/position.mjs +0 -4
  830. package/dist/esm/lib/position.mjs.map +0 -1
  831. package/dist/esm/lib/prepend.d.mts +0 -22
  832. package/dist/esm/lib/prepend.mjs +0 -14
  833. package/dist/esm/lib/prepend.mjs.map +0 -1
  834. package/dist/esm/lib/product.d.mts +0 -24
  835. package/dist/esm/lib/product.mjs +0 -16
  836. package/dist/esm/lib/product.mjs.map +0 -1
  837. package/dist/esm/lib/range.d.mts +0 -33
  838. package/dist/esm/lib/range.mjs +0 -34
  839. package/dist/esm/lib/range.mjs.map +0 -1
  840. package/dist/esm/lib/reduce.d.mts +0 -33
  841. package/dist/esm/lib/reduce.mjs +0 -28
  842. package/dist/esm/lib/reduce.mjs.map +0 -1
  843. package/dist/esm/lib/repeat.d.mts +0 -20
  844. package/dist/esm/lib/repeat.mjs +0 -17
  845. package/dist/esm/lib/repeat.mjs.map +0 -1
  846. package/dist/esm/lib/reverse.d.mts +0 -26
  847. package/dist/esm/lib/reverse.mjs +0 -14
  848. package/dist/esm/lib/reverse.mjs.map +0 -1
  849. package/dist/esm/lib/shared/_assertFunction.d.mts +0 -3
  850. package/dist/esm/lib/shared/_assertFunction.mjs +0 -14
  851. package/dist/esm/lib/shared/_assertFunction.mjs.map +0 -1
  852. package/dist/esm/lib/shared/_assertNotNegative.d.mts +0 -3
  853. package/dist/esm/lib/shared/_assertNotNegative.mjs +0 -14
  854. package/dist/esm/lib/shared/_assertNotNegative.mjs.map +0 -1
  855. package/dist/esm/lib/shared/_assertPositive.d.mts +0 -3
  856. package/dist/esm/lib/shared/_assertPositive.mjs +0 -14
  857. package/dist/esm/lib/shared/_assertPositive.mjs.map +0 -1
  858. package/dist/esm/lib/shared/_compare.d.mts +0 -20
  859. package/dist/esm/lib/shared/_compare.mjs +0 -30
  860. package/dist/esm/lib/shared/_compare.mjs.map +0 -1
  861. package/dist/esm/lib/shared/_makeIterableIterator.d.mts +0 -3
  862. package/dist/esm/lib/shared/_makeIterableIterator.mjs +0 -16
  863. package/dist/esm/lib/shared/_makeIterableIterator.mjs.map +0 -1
  864. package/dist/esm/lib/shared/_toIntegerOrInfinityOrThrow.d.mts +0 -3
  865. package/dist/esm/lib/shared/_toIntegerOrInfinityOrThrow.mjs +0 -15
  866. package/dist/esm/lib/shared/_toIntegerOrInfinityOrThrow.mjs.map +0 -1
  867. package/dist/esm/lib/shared/_toIntegerOrThrow.d.mts +0 -3
  868. package/dist/esm/lib/shared/_toIntegerOrThrow.mjs +0 -15
  869. package/dist/esm/lib/shared/_toIntegerOrThrow.mjs.map +0 -1
  870. package/dist/esm/lib/shared/_toNumberOrThrow.d.mts +0 -8
  871. package/dist/esm/lib/shared/_toNumberOrThrow.mjs +0 -31
  872. package/dist/esm/lib/shared/_toNumberOrThrow.mjs.map +0 -1
  873. package/dist/esm/lib/shared/comparators.d.mts +0 -34
  874. package/dist/esm/lib/shared/comparators.mjs +0 -21
  875. package/dist/esm/lib/shared/comparators.mjs.map +0 -1
  876. package/dist/esm/lib/skip.d.mts +0 -2
  877. package/dist/esm/lib/skip.mjs +0 -4
  878. package/dist/esm/lib/skip.mjs.map +0 -1
  879. package/dist/esm/lib/skipLast.d.mts +0 -2
  880. package/dist/esm/lib/skipLast.mjs +0 -4
  881. package/dist/esm/lib/skipLast.mjs.map +0 -1
  882. package/dist/esm/lib/skipWhile.d.mts +0 -2
  883. package/dist/esm/lib/skipWhile.mjs +0 -4
  884. package/dist/esm/lib/skipWhile.mjs.map +0 -1
  885. package/dist/esm/lib/slice.d.mts +0 -62
  886. package/dist/esm/lib/slice.mjs +0 -40
  887. package/dist/esm/lib/slice.mjs.map +0 -1
  888. package/dist/esm/lib/some.d.mts +0 -33
  889. package/dist/esm/lib/some.mjs +0 -19
  890. package/dist/esm/lib/some.mjs.map +0 -1
  891. package/dist/esm/lib/sorted.d.mts +0 -25
  892. package/dist/esm/lib/sorted.mjs +0 -11
  893. package/dist/esm/lib/sorted.mjs.map +0 -1
  894. package/dist/esm/lib/starMap.d.mts +0 -28
  895. package/dist/esm/lib/starMap.mjs +0 -16
  896. package/dist/esm/lib/starMap.mjs.map +0 -1
  897. package/dist/esm/lib/stepBy.d.mts +0 -24
  898. package/dist/esm/lib/stepBy.mjs +0 -26
  899. package/dist/esm/lib/stepBy.mjs.map +0 -1
  900. package/dist/esm/lib/sum.d.mts +0 -25
  901. package/dist/esm/lib/sum.mjs +0 -16
  902. package/dist/esm/lib/sum.mjs.map +0 -1
  903. package/dist/esm/lib/take.d.mts +0 -21
  904. package/dist/esm/lib/take.mjs +0 -21
  905. package/dist/esm/lib/take.mjs.map +0 -1
  906. package/dist/esm/lib/takeLast.d.mts +0 -25
  907. package/dist/esm/lib/takeLast.mjs +0 -26
  908. package/dist/esm/lib/takeLast.mjs.map +0 -1
  909. package/dist/esm/lib/takeWhile.d.mts +0 -2
  910. package/dist/esm/lib/takeWhile.mjs +0 -4
  911. package/dist/esm/lib/takeWhile.mjs.map +0 -1
  912. package/dist/esm/lib/tee.d.mts +0 -25
  913. package/dist/esm/lib/tee.mjs +0 -35
  914. package/dist/esm/lib/tee.mjs.map +0 -1
  915. package/dist/esm/lib/toArray.d.mts +0 -36
  916. package/dist/esm/lib/toArray.mjs +0 -11
  917. package/dist/esm/lib/toArray.mjs.map +0 -1
  918. package/dist/esm/lib/toIterableIterator.d.mts +0 -32
  919. package/dist/esm/lib/toIterableIterator.mjs +0 -16
  920. package/dist/esm/lib/toIterableIterator.mjs.map +0 -1
  921. package/dist/esm/lib/union.d.mts +0 -21
  922. package/dist/esm/lib/union.mjs +0 -19
  923. package/dist/esm/lib/union.mjs.map +0 -1
  924. package/dist/esm/lib/unique.d.mts +0 -20
  925. package/dist/esm/lib/unique.mjs +0 -11
  926. package/dist/esm/lib/unique.mjs.map +0 -1
  927. package/dist/esm/lib/unzip.d.mts +0 -32
  928. package/dist/esm/lib/unzip.mjs +0 -33
  929. package/dist/esm/lib/unzip.mjs.map +0 -1
  930. package/dist/esm/lib/windows.d.mts +0 -21
  931. package/dist/esm/lib/windows.mjs +0 -26
  932. package/dist/esm/lib/windows.mjs.map +0 -1
  933. package/dist/esm/lib/zip.d.mts +0 -30
  934. package/dist/esm/lib/zip.mjs +0 -20
  935. package/dist/esm/lib/zip.mjs.map +0 -1
  936. package/dist/iife/index.global.js +0 -1171
  937. package/dist/iife/index.global.js.map +0 -1
@@ -0,0 +1,34 @@
1
+ import { assertNotNegative } from "./shared/_assertNotNegative.mjs";
2
+ import { makeIterableIterator } from "./shared/_makeIterableIterator.mjs";
3
+ import { toNumberOrThrow } from "./shared/_toNumberOrThrow.mjs";
4
+
5
+ // src/lib/repeat.ts
6
+ /**
7
+ * Creates an iterable that repeats the input iterable `count` times.
8
+ *
9
+ * @param value - The value to be repeated.
10
+ * @param count - The number of times to repeat the value.
11
+ * @example
12
+ * ```typescript
13
+ * import { repeat } from '@sapphire/iterator-utilities';
14
+ *
15
+ * const iterator = repeat('Hello, world!', 3);
16
+ * console.log([...iterator]);
17
+ * // Output: ['Hello, world!', 'Hello, world!', 'Hello, world!']
18
+ * ```
19
+ * @remarks This function does not clone `value`, it will be repeated as a reference.
20
+ */
21
+ function repeat(value, count) {
22
+ count = assertNotNegative(toNumberOrThrow(count), count);
23
+ let idx = 0;
24
+ return makeIterableIterator(() => idx >= count ? {
25
+ done: true,
26
+ value: void 0
27
+ } : (idx++, {
28
+ done: false,
29
+ value
30
+ }));
31
+ }
32
+
33
+ export { repeat };
34
+ //# sourceMappingURL=repeat.mjs.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"repeat.mjs","names":[],"sources":["../../src/lib/repeat.ts"],"sourcesContent":["import { assertNotNegative } from './shared/_assertNotNegative';\nimport { makeIterableIterator } from './shared/_makeIterableIterator';\nimport { toNumberOrThrow } from './shared/_toNumberOrThrow';\n\n/**\n * Creates an iterable that repeats the input iterable `count` times.\n *\n * @param value - The value to be repeated.\n * @param count - The number of times to repeat the value.\n * @example\n * ```typescript\n * import { repeat } from '@sapphire/iterator-utilities';\n *\n * const iterator = repeat('Hello, world!', 3);\n * console.log([...iterator]);\n * // Output: ['Hello, world!', 'Hello, world!', 'Hello, world!']\n * ```\n * @remarks This function does not clone `value`, it will be repeated as a reference.\n */\nexport function repeat<const ElementType>(value: ElementType, count: number): IterableIterator<ElementType> {\n\t// eslint-disable-next-line no-param-reassign\n\tcount = assertNotNegative(toNumberOrThrow(count), count);\n\n\tlet idx = 0;\n\treturn makeIterableIterator<ElementType>(() =>\n\t\tidx >= count //\n\t\t\t? { done: true, value: undefined }\n\t\t\t: (idx++, { done: false, value })\n\t);\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAmBA,SAAgB,OAA0B,OAAoB,OAA8C;CAE3G,QAAQ,kBAAkB,gBAAgB,KAAK,GAAG,KAAK;CAEvD,IAAI,MAAM;CACV,OAAO,2BACN,OAAO,QACJ;EAAE,MAAM;EAAM,OAAO;CAAU,KAC9B,OAAO;EAAE,MAAM;EAAO;CAAM,EACjC;AACD"}
@@ -0,0 +1,22 @@
1
+ import { IterableResolvable } from "./from.mjs";
2
+ /**
3
+ * Consumes the iterable and returns a new iterable with the elements in reverse order.
4
+ *
5
+ * @param iterable - The iterator to reverse.
6
+ * @returns An iterator whose element correspond to the elements of the provided iterator in reverse order.
7
+ * @example
8
+ * ```typescript
9
+ * import { reverse } from '@sapphire/iterator-utilities';
10
+ *
11
+ * console.log([...reverse([1, 2, 3, 4, 5])]);
12
+ * // Output: [5, 4, 3, 2, 1]
13
+ *
14
+ * console.log([...reverse('hello')]);
15
+ * // Output: ['o', 'l', 'l', 'e', 'h']
16
+ * ```
17
+ * @remarks
18
+ *
19
+ * This function collects all elements of the provided iterator into an array before yielding them in reverse order.
20
+ */
21
+ export declare function reverse<const ElementType>(iterable: IterableResolvable<ElementType>): IterableIterator<ElementType>;
22
+ //# sourceMappingURL=reverse.d.mts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"reverse.d.mts","names":[],"sources":["../../src/lib/reverse.ts"],"mappings":";;;;;;;;;;;;;;;;;;;;wBAsBiB,cAAc,aAAa,UAAU,mBAAmB,eAAe,iBAAiB"}
@@ -0,0 +1,29 @@
1
+ import { toArray } from "./toArray.mjs";
2
+
3
+ // src/lib/reverse.ts
4
+ /**
5
+ * Consumes the iterable and returns a new iterable with the elements in reverse order.
6
+ *
7
+ * @param iterable - The iterator to reverse.
8
+ * @returns An iterator whose element correspond to the elements of the provided iterator in reverse order.
9
+ * @example
10
+ * ```typescript
11
+ * import { reverse } from '@sapphire/iterator-utilities';
12
+ *
13
+ * console.log([...reverse([1, 2, 3, 4, 5])]);
14
+ * // Output: [5, 4, 3, 2, 1]
15
+ *
16
+ * console.log([...reverse('hello')]);
17
+ * // Output: ['o', 'l', 'l', 'e', 'h']
18
+ * ```
19
+ * @remarks
20
+ *
21
+ * This function collects all elements of the provided iterator into an array before yielding them in reverse order.
22
+ */
23
+ function* reverse(iterable) {
24
+ const items = toArray(iterable);
25
+ for (let idx = items.length - 1; idx >= 0; idx--) yield items[idx];
26
+ }
27
+
28
+ export { reverse };
29
+ //# sourceMappingURL=reverse.mjs.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"reverse.mjs","names":["collect"],"sources":["../../src/lib/reverse.ts"],"sourcesContent":["import { collect } from './collect';\nimport type { IterableResolvable } from './from';\n\n/**\n * Consumes the iterable and returns a new iterable with the elements in reverse order.\n *\n * @param iterable - The iterator to reverse.\n * @returns An iterator whose element correspond to the elements of the provided iterator in reverse order.\n * @example\n * ```typescript\n * import { reverse } from '@sapphire/iterator-utilities';\n *\n * console.log([...reverse([1, 2, 3, 4, 5])]);\n * // Output: [5, 4, 3, 2, 1]\n *\n * console.log([...reverse('hello')]);\n * // Output: ['o', 'l', 'l', 'e', 'h']\n * ```\n * @remarks\n *\n * This function collects all elements of the provided iterator into an array before yielding them in reverse order.\n */\nexport function* reverse<const ElementType>(iterable: IterableResolvable<ElementType>): IterableIterator<ElementType> {\n\tconst items = collect(iterable);\n\tfor (let idx = items.length - 1; idx >= 0; idx--) {\n\t\tyield items[idx];\n\t}\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;AAsBA,UAAiB,QAA2B,UAA0E;CACrH,MAAM,QAAQA,QAAQ,QAAQ;CAC9B,KAAK,IAAI,MAAM,MAAM,SAAS,GAAG,OAAO,GAAG,OAC1C,MAAM,MAAM;AAEd"}
@@ -0,0 +1,2 @@
1
+ export declare function assertFunction<Fn extends (...args: any[]) => any>(value: Fn): Fn;
2
+ //# sourceMappingURL=_assertFunction.d.mts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"_assertFunction.d.mts","names":[],"sources":["../../../src/lib/shared/_assertFunction.ts"],"mappings":"A,wBAAgB,eAAe,eAAe,qBAAqB,OAAO,KAAK"}
@@ -0,0 +1,8 @@
1
+ // src/lib/shared/_assertFunction.ts
2
+ function assertFunction(value) {
3
+ if (typeof value !== "function") throw new TypeError(`${value} must be a function`);
4
+ return value;
5
+ }
6
+
7
+ export { assertFunction };
8
+ //# sourceMappingURL=_assertFunction.mjs.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"_assertFunction.mjs","names":[],"sources":["../../../src/lib/shared/_assertFunction.ts"],"sourcesContent":["export function assertFunction<Fn extends (...args: any[]) => any>(value: Fn): Fn {\n\tif (typeof value !== 'function') {\n\t\tthrow new TypeError(`${value} must be a function`);\n\t}\n\n\treturn value;\n}\n"],"mappings":";AAAA,SAAgB,eAAmD,OAAe;CACjF,IAAI,OAAO,UAAU,YACpB,MAAM,IAAI,UAAU,GAAG,MAAM,oBAAoB;CAGlD,OAAO;AACR"}
@@ -0,0 +1,2 @@
1
+ export declare function assertNotNegative(value: number, original: unknown): number;
2
+ //# sourceMappingURL=_assertNotNegative.d.mts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"_assertNotNegative.d.mts","names":[],"sources":["../../../src/lib/shared/_assertNotNegative.ts"],"mappings":"A,wBAAgB,kBAAkB,eAAe"}
@@ -0,0 +1,8 @@
1
+ // src/lib/shared/_assertNotNegative.ts
2
+ function assertNotNegative(value, original) {
3
+ if (value < 0) throw new RangeError(`${original} must be a non-negative number`);
4
+ return value;
5
+ }
6
+
7
+ export { assertNotNegative };
8
+ //# sourceMappingURL=_assertNotNegative.mjs.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"_assertNotNegative.mjs","names":[],"sources":["../../../src/lib/shared/_assertNotNegative.ts"],"sourcesContent":["export function assertNotNegative(value: number, original: unknown): number {\n\tif (value < 0) {\n\t\tthrow new RangeError(`${original} must be a non-negative number`);\n\t}\n\n\treturn value;\n}\n"],"mappings":";AAAA,SAAgB,kBAAkB,OAAe,UAA2B;CAC3E,IAAI,QAAQ,GACX,MAAM,IAAI,WAAW,GAAG,SAAS,+BAA+B;CAGjE,OAAO;AACR"}
@@ -0,0 +1,2 @@
1
+ export declare function assertPositive(value: number, original: unknown): number;
2
+ //# sourceMappingURL=_assertPositive.d.mts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"_assertPositive.d.mts","names":[],"sources":["../../../src/lib/shared/_assertPositive.ts"],"mappings":"A,wBAAgB,eAAe,eAAe"}
@@ -0,0 +1,8 @@
1
+ // src/lib/shared/_assertPositive.ts
2
+ function assertPositive(value, original) {
3
+ if (value <= 0) throw new RangeError(`${original} must be a positive number`);
4
+ return value;
5
+ }
6
+
7
+ export { assertPositive };
8
+ //# sourceMappingURL=_assertPositive.mjs.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"_assertPositive.mjs","names":[],"sources":["../../../src/lib/shared/_assertPositive.ts"],"sourcesContent":["export function assertPositive(value: number, original: unknown): number {\n\tif (value <= 0) {\n\t\tthrow new RangeError(`${original} must be a positive number`);\n\t}\n\n\treturn value;\n}\n"],"mappings":";AAAA,SAAgB,eAAe,OAAe,UAA2B;CACxE,IAAI,SAAS,GACZ,MAAM,IAAI,WAAW,GAAG,SAAS,2BAA2B;CAG7D,OAAO;AACR"}
@@ -0,0 +1,19 @@
1
+ /**
2
+ * Represents the result of a lexicographic comparison.
3
+ *
4
+ * The operations are as follows:
5
+ *
6
+ * - Two iterators are compared element by element.
7
+ * - The first pair of unequal elements determines the result.
8
+ * - If one sequence is a prefix of the other, the shorter sequence is lexicographically less than the other.
9
+ * - If two sequences have the same elements in the same order, they are lexicographically equal.
10
+ * - An empty sequence is lexicographically less than any non-empty sequence.
11
+ * - Two empty sequences are lexicographically equal.
12
+ */
13
+ export type LexicographicComparison = -1 | 0 | 1;
14
+ export type CompareByComparator<ElementType> = (x: Exclude<ElementType, undefined>, y: Exclude<ElementType, undefined>) => number;
15
+ export declare function compareIteratorElements<const ElementType>(x: ElementType | undefined, y: ElementType | undefined, comparator: CompareByComparator<ElementType>): number;
16
+ export declare function orderingIsLess(ordering: number): boolean;
17
+ export declare function orderingIsEqual(ordering: number): ordering is 0;
18
+ export declare function orderingIsGreater(ordering: number): boolean;
19
+ //# sourceMappingURL=_compare.d.mts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"_compare.d.mts","names":[],"sources":["../../../src/lib/shared/_compare.ts"],"mappings":";;;;;;;;;;;;YAYY;YAEA,oBAAoB,gBAAgB,GAAG,QAAQ,yBAAyB,GAAG,QAAQ;wBAE/E,8BAA8B,aAC7C,GAAG,yBACH,GAAG,yBACH,YAAY,oBAAoB;wBAkBjB,eAAe;wBAIf,gBAAgB,mBAAgB;wBAIhC,kBAAkB"}
@@ -0,0 +1,21 @@
1
+ // src/lib/shared/_compare.ts
2
+ function compareIteratorElements(x, y, comparator) {
3
+ if (typeof x === "undefined") {
4
+ if (typeof y === "undefined") return 0;
5
+ return 1;
6
+ }
7
+ if (typeof y === "undefined") return -1;
8
+ return comparator(x, y);
9
+ }
10
+ function orderingIsLess(ordering) {
11
+ return ordering < 0;
12
+ }
13
+ function orderingIsEqual(ordering) {
14
+ return ordering === 0;
15
+ }
16
+ function orderingIsGreater(ordering) {
17
+ return ordering > 0;
18
+ }
19
+
20
+ export { compareIteratorElements, orderingIsEqual, orderingIsGreater, orderingIsLess };
21
+ //# sourceMappingURL=_compare.mjs.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"_compare.mjs","names":[],"sources":["../../../src/lib/shared/_compare.ts"],"sourcesContent":["/**\n * Represents the result of a lexicographic comparison.\n *\n * The operations are as follows:\n *\n * - Two iterators are compared element by element.\n * - The first pair of unequal elements determines the result.\n * - If one sequence is a prefix of the other, the shorter sequence is lexicographically less than the other.\n * - If two sequences have the same elements in the same order, they are lexicographically equal.\n * - An empty sequence is lexicographically less than any non-empty sequence.\n * - Two empty sequences are lexicographically equal.\n */\nexport type LexicographicComparison = -1 | 0 | 1;\n\nexport type CompareByComparator<ElementType> = (x: Exclude<ElementType, undefined>, y: Exclude<ElementType, undefined>) => number;\n\nexport function compareIteratorElements<const ElementType>(\n\tx: ElementType | undefined,\n\ty: ElementType | undefined,\n\tcomparator: CompareByComparator<ElementType>\n): number {\n\t// 23.1.3.30.2 CompareArrayElements (https://tc39.es/ecma262/#sec-comparearrayelements)\n\tif (typeof x === 'undefined') {\n\t\t// 1. If x and y are both `undefined`, return +0.\n\t\tif (typeof y === 'undefined') return 0;\n\t\t// 2. If x is `undefined`, return +1.\n\t\treturn 1;\n\t}\n\n\tif (typeof y === 'undefined') {\n\t\t// 3. If y is `undefined`, return -1.\n\t\treturn -1;\n\t}\n\n\treturn comparator(x as Exclude<ElementType, undefined>, y as Exclude<ElementType, undefined>);\n}\n\nexport function orderingIsLess(ordering: number) {\n\treturn ordering < 0;\n}\n\nexport function orderingIsEqual(ordering: number) {\n\treturn ordering === 0;\n}\n\nexport function orderingIsGreater(ordering: number) {\n\treturn ordering > 0;\n}\n"],"mappings":";AAgBA,SAAgB,wBACf,GACA,GACA,YACS;CAET,IAAI,OAAO,MAAM,aAAa;EAE7B,IAAI,OAAO,MAAM,aAAa,OAAO;EAErC,OAAO;CACR;CAEA,IAAI,OAAO,MAAM,aAEhB,OAAO;CAGR,OAAO,WAAW,GAAsC,CAAoC;AAC7F;AAEA,SAAgB,eAAe,UAAkB;CAChD,OAAO,WAAW;AACnB;AAEA,SAAgB,gBAAgB,UAAkB;CACjD,OAAO,aAAa;AACrB;AAEA,SAAgB,kBAAkB,UAAkB;CACnD,OAAO,WAAW;AACnB"}
@@ -0,0 +1,2 @@
1
+ export declare function makeIterableIterator<const ElementType>(next: Iterator<ElementType>['next']): IterableIterator<ElementType>;
2
+ //# sourceMappingURL=_makeIterableIterator.d.mts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"_makeIterableIterator.d.mts","names":[],"sources":["../../../src/lib/shared/_makeIterableIterator.ts"],"mappings":"A,wBAAgB,2BAA2B,aAAa,MAAM,SAAS,uBAAuB,iBAAiB"}
@@ -0,0 +1,12 @@
1
+ // src/lib/shared/_makeIterableIterator.ts
2
+ function makeIterableIterator(next) {
3
+ return {
4
+ next,
5
+ [Symbol.iterator]() {
6
+ return this;
7
+ }
8
+ };
9
+ }
10
+
11
+ export { makeIterableIterator };
12
+ //# sourceMappingURL=_makeIterableIterator.mjs.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"_makeIterableIterator.mjs","names":[],"sources":["../../../src/lib/shared/_makeIterableIterator.ts"],"sourcesContent":["export function makeIterableIterator<const ElementType>(next: Iterator<ElementType>['next']): IterableIterator<ElementType> {\n\treturn {\n\t\tnext,\n\t\t[Symbol.iterator]() {\n\t\t\treturn this;\n\t\t}\n\t};\n}\n"],"mappings":";AAAA,SAAgB,qBAAwC,MAAoE;CAC3H,OAAO;EACN;EACA,CAAC,OAAO,YAAY;GACnB,OAAO;EACR;CACD;AACD"}
@@ -0,0 +1,2 @@
1
+ export declare function toIntegerOrInfinityOrThrow(value: number): number;
2
+ //# sourceMappingURL=_toIntegerOrInfinityOrThrow.d.mts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"_toIntegerOrInfinityOrThrow.d.mts","names":[],"sources":["../../../src/lib/shared/_toIntegerOrInfinityOrThrow.ts"],"mappings":"A,wBAEgB,2BAA2B"}
@@ -0,0 +1,13 @@
1
+ import { toNumberOrThrow } from "./_toNumberOrThrow.mjs";
2
+
3
+ // src/lib/shared/_toIntegerOrInfinityOrThrow.ts
4
+ function toIntegerOrInfinityOrThrow(value) {
5
+ const number = toNumberOrThrow(value);
6
+ if (Number.isNaN(number) || number === 0) return 0;
7
+ if (number === Number.POSITIVE_INFINITY) return Number.POSITIVE_INFINITY;
8
+ if (number === Number.NEGATIVE_INFINITY) return Number.NEGATIVE_INFINITY;
9
+ return Math.trunc(number);
10
+ }
11
+
12
+ export { toIntegerOrInfinityOrThrow };
13
+ //# sourceMappingURL=_toIntegerOrInfinityOrThrow.mjs.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"_toIntegerOrInfinityOrThrow.mjs","names":[],"sources":["../../../src/lib/shared/_toIntegerOrInfinityOrThrow.ts"],"sourcesContent":["import { toNumberOrThrow } from './_toNumberOrThrow';\n\nexport function toIntegerOrInfinityOrThrow(value: number): number {\n\tconst number = toNumberOrThrow(value);\n\tif (Number.isNaN(number) || number === 0) return 0;\n\tif (number === Number.POSITIVE_INFINITY) return Number.POSITIVE_INFINITY;\n\tif (number === Number.NEGATIVE_INFINITY) return Number.NEGATIVE_INFINITY;\n\n\treturn Math.trunc(number);\n}\n"],"mappings":";;;AAEA,SAAgB,2BAA2B,OAAuB;CACjE,MAAM,SAAS,gBAAgB,KAAK;CACpC,IAAI,OAAO,MAAM,MAAM,KAAK,WAAW,GAAG,OAAO;CACjD,IAAI,WAAW,OAAO,mBAAmB,OAAO,OAAO;CACvD,IAAI,WAAW,OAAO,mBAAmB,OAAO,OAAO;CAEvD,OAAO,KAAK,MAAM,MAAM;AACzB"}
@@ -0,0 +1,2 @@
1
+ export declare function toIntegerOrThrow(value: number): number;
2
+ //# sourceMappingURL=_toIntegerOrThrow.d.mts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"_toIntegerOrThrow.d.mts","names":[],"sources":["../../../src/lib/shared/_toIntegerOrThrow.ts"],"mappings":"A,wBAEgB,iBAAiB"}
@@ -0,0 +1,13 @@
1
+ import { toNumberOrThrow } from "./_toNumberOrThrow.mjs";
2
+
3
+ // src/lib/shared/_toIntegerOrThrow.ts
4
+ function toIntegerOrThrow(value) {
5
+ const number = toNumberOrThrow(value);
6
+ if (Number.isNaN(number) || number === 0) return 0;
7
+ if (number === Number.POSITIVE_INFINITY) throw new RangeError("+Infinity cannot be represented as an integer");
8
+ if (number === Number.NEGATIVE_INFINITY) throw new RangeError("-Infinity cannot be represented as an integer");
9
+ return Math.trunc(number);
10
+ }
11
+
12
+ export { toIntegerOrThrow };
13
+ //# sourceMappingURL=_toIntegerOrThrow.mjs.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"_toIntegerOrThrow.mjs","names":[],"sources":["../../../src/lib/shared/_toIntegerOrThrow.ts"],"sourcesContent":["import { toNumberOrThrow } from './_toNumberOrThrow';\n\nexport function toIntegerOrThrow(value: number): number {\n\tconst number = toNumberOrThrow(value);\n\tif (Number.isNaN(number) || number === 0) return 0;\n\tif (number === Number.POSITIVE_INFINITY) throw new RangeError('+Infinity cannot be represented as an integer');\n\tif (number === Number.NEGATIVE_INFINITY) throw new RangeError('-Infinity cannot be represented as an integer');\n\n\treturn Math.trunc(number);\n}\n"],"mappings":";;;AAEA,SAAgB,iBAAiB,OAAuB;CACvD,MAAM,SAAS,gBAAgB,KAAK;CACpC,IAAI,OAAO,MAAM,MAAM,KAAK,WAAW,GAAG,OAAO;CACjD,IAAI,WAAW,OAAO,mBAAmB,MAAM,IAAI,WAAW,+CAA+C;CAC7G,IAAI,WAAW,OAAO,mBAAmB,MAAM,IAAI,WAAW,+CAA+C;CAE7G,OAAO,KAAK,MAAM,MAAM;AACzB"}
@@ -0,0 +1,7 @@
1
+ export declare function toNumberOrThrow(value: NumberResolvable): number;
2
+ export type NumberResolvable = boolean | number | {
3
+ [Symbol.toPrimitive](): boolean | number | null;
4
+ } | {
5
+ valueOf(): boolean | number | null;
6
+ } | null;
7
+ //# sourceMappingURL=_toNumberOrThrow.d.mts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"_toNumberOrThrow.d.mts","names":[],"sources":["../../../src/lib/shared/_toNumberOrThrow.ts"],"mappings":"A,wBAAgB,gBAAgB,OAAO;YAkB3B;GAAyC,OAAO;;EAA8C"}
@@ -0,0 +1,18 @@
1
+ // src/lib/shared/_toNumberOrThrow.ts
2
+ function toNumberOrThrow(value) {
3
+ switch (typeof value) {
4
+ case "bigint": throw new TypeError("Cannot convert a BigInt value to a number");
5
+ case "symbol": throw new TypeError("Cannot convert a Symbol value to a number");
6
+ case "boolean": return value ? 1 : 0;
7
+ case "number": return assertNumber(value, value);
8
+ case "undefined": throw new TypeError("Cannot convert an undefined value to a number");
9
+ default: return assertNumber(Number(value), value);
10
+ }
11
+ }
12
+ function assertNumber(value, original) {
13
+ if (Number.isNaN(value)) throw new RangeError(`${original} must be a non-NaN number`);
14
+ return value;
15
+ }
16
+
17
+ export { toNumberOrThrow };
18
+ //# sourceMappingURL=_toNumberOrThrow.mjs.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"_toNumberOrThrow.mjs","names":[],"sources":["../../../src/lib/shared/_toNumberOrThrow.ts"],"sourcesContent":["export function toNumberOrThrow(value: NumberResolvable): number {\n\t// eslint-disable-next-line @typescript-eslint/switch-exhaustiveness-check\n\tswitch (typeof value) {\n\t\tcase 'bigint':\n\t\t\tthrow new TypeError('Cannot convert a BigInt value to a number');\n\t\tcase 'symbol':\n\t\t\tthrow new TypeError('Cannot convert a Symbol value to a number');\n\t\tcase 'boolean':\n\t\t\treturn value ? 1 : 0;\n\t\tcase 'number':\n\t\t\treturn assertNumber(value, value);\n\t\tcase 'undefined':\n\t\t\tthrow new TypeError('Cannot convert an undefined value to a number');\n\t\tdefault:\n\t\t\treturn assertNumber(Number(value), value);\n\t}\n}\n\nexport type NumberResolvable = boolean | number | { [Symbol.toPrimitive](): boolean | number | null } | { valueOf(): boolean | number | null } | null;\n\nfunction assertNumber(value: number, original: unknown): number {\n\tif (Number.isNaN(value)) {\n\t\tthrow new RangeError(`${original} must be a non-NaN number`);\n\t}\n\n\treturn value;\n}\n"],"mappings":";AAAA,SAAgB,gBAAgB,OAAiC;CAEhE,QAAQ,OAAO,OAAf;EACC,KAAK,UACJ,MAAM,IAAI,UAAU,2CAA2C;EAChE,KAAK,UACJ,MAAM,IAAI,UAAU,2CAA2C;EAChE,KAAK,WACJ,OAAO,QAAQ,IAAI;EACpB,KAAK,UACJ,OAAO,aAAa,OAAO,KAAK;EACjC,KAAK,aACJ,MAAM,IAAI,UAAU,+CAA+C;EACpE,SACC,OAAO,aAAa,OAAO,KAAK,GAAG,KAAK;CAC1C;AACD;AAIA,SAAS,aAAa,OAAe,UAA2B;CAC/D,IAAI,OAAO,MAAM,KAAK,GACrB,MAAM,IAAI,WAAW,GAAG,SAAS,0BAA0B;CAG5D,OAAO;AACR"}
@@ -0,0 +1,30 @@
1
+ import { CompareByComparator, LexicographicComparison } from "./_compare.mjs";
2
+ /**
3
+ * Compares two elements lexicographically using the default comparison algorithm.
4
+ *
5
+ * @see 23.1.3.30.2 CompareArrayElements ({@link https://tc39.es/ecma262/#sec-comparearrayelements})
6
+ * @param x - The first element to compare.
7
+ * @param y - The second element to compare.
8
+ * @returns The lexicographic comparison of the two elements.
9
+ * @remarks
10
+ *
11
+ * This function is used as the comparison algorithm for {@link compareBy}.
12
+ */
13
+ export declare function defaultCompare<const ElementType>(x: ElementType, y: ElementType): LexicographicComparison;
14
+ export declare const descString: <const ElementType>(x: Exclude<ElementType, undefined>, y: Exclude<ElementType, undefined>) => number;
15
+ /**
16
+ * Compares two elements using the default comparison algorithm.
17
+ *
18
+ * @param x - The first element to compare.
19
+ * @param y - The second element to compare.
20
+ * @returns The numeric comparison of the two elements.
21
+ * @privateRemarks
22
+ *
23
+ * The implementation of this function is based on the optimized version of the
24
+ * starship operator in Rust. The subtraction is intentional and is used to
25
+ * determine the ordering of the two elements.
26
+ */
27
+ export declare function ascNumber(x: bigint | number | string, y: bigint | number | string): LexicographicComparison;
28
+ export declare const descNumber: CompareByComparator<string | number | bigint>;
29
+ export { defaultCompare as ascString };
30
+ //# sourceMappingURL=comparators.d.mts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"comparators.d.mts","names":[],"sources":["../../../src/lib/shared/comparators.ts"],"mappings":";;;;;;;;;;;;wBAoBgB,qBAAqB,aAAa,GAAG,aAAa,GAAG,cAAc;qBAQtE,mBARwB,aAAW,GAAA,QAAA,yBAAA,GAAA,QAAA;;;;;;;;;;;;;wBAsBhC,UAAU,6BAA6B,8BAA8B;qBAKxE,YAAU"}
@@ -0,0 +1,38 @@
1
+ // src/lib/shared/comparators.ts
2
+ function swap(cb) {
3
+ return (x, y) => 0 - cb(x, y);
4
+ }
5
+ /**
6
+ * Compares two elements lexicographically using the default comparison algorithm.
7
+ *
8
+ * @see 23.1.3.30.2 CompareArrayElements ({@link https://tc39.es/ecma262/#sec-comparearrayelements})
9
+ * @param x - The first element to compare.
10
+ * @param y - The second element to compare.
11
+ * @returns The lexicographic comparison of the two elements.
12
+ * @remarks
13
+ *
14
+ * This function is used as the comparison algorithm for {@link compareBy}.
15
+ */
16
+ function defaultCompare(x, y) {
17
+ return ascNumber(String(x), String(y));
18
+ }
19
+ const descString = swap(defaultCompare);
20
+ /**
21
+ * Compares two elements using the default comparison algorithm.
22
+ *
23
+ * @param x - The first element to compare.
24
+ * @param y - The second element to compare.
25
+ * @returns The numeric comparison of the two elements.
26
+ * @privateRemarks
27
+ *
28
+ * The implementation of this function is based on the optimized version of the
29
+ * starship operator in Rust. The subtraction is intentional and is used to
30
+ * determine the ordering of the two elements.
31
+ */
32
+ function ascNumber(x, y) {
33
+ return (x > y) - (x < y);
34
+ }
35
+ const descNumber = swap(ascNumber);
36
+
37
+ export { ascNumber, defaultCompare as ascString, defaultCompare, descNumber, descString };
38
+ //# sourceMappingURL=comparators.mjs.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"comparators.mjs","names":[],"sources":["../../../src/lib/shared/comparators.ts"],"sourcesContent":["import type { CompareByComparator, LexicographicComparison } from './_compare';\nimport type { compareBy } from '../compareBy';\n\n// eslint-disable-next-line promise/prefer-await-to-callbacks\nfunction swap<const ElementType>(cb: CompareByComparator<ElementType>): CompareByComparator<ElementType> {\n\t// eslint-disable-next-line promise/prefer-await-to-callbacks\n\treturn (x, y) => (0 - cb(x, y)) as LexicographicComparison;\n}\n\n/**\n * Compares two elements lexicographically using the default comparison algorithm.\n *\n * @see 23.1.3.30.2 CompareArrayElements ({@link https://tc39.es/ecma262/#sec-comparearrayelements})\n * @param x - The first element to compare.\n * @param y - The second element to compare.\n * @returns The lexicographic comparison of the two elements.\n * @remarks\n *\n * This function is used as the comparison algorithm for {@link compareBy}.\n */\nexport function defaultCompare<const ElementType>(x: ElementType, y: ElementType): LexicographicComparison {\n\t// 5. Let xString be ? ToString(x).\n\t// 6. Let yString be ? ToString(y).\n\t// Steps 7-11 are optimized away by the usage of `ascNumber`.\n\treturn ascNumber(String(x), String(y));\n}\n\nexport { defaultCompare as ascString };\nexport const descString = swap(defaultCompare);\n\n/**\n * Compares two elements using the default comparison algorithm.\n *\n * @param x - The first element to compare.\n * @param y - The second element to compare.\n * @returns The numeric comparison of the two elements.\n * @privateRemarks\n *\n * The implementation of this function is based on the optimized version of the\n * starship operator in Rust. The subtraction is intentional and is used to\n * determine the ordering of the two elements.\n */\nexport function ascNumber(x: bigint | number | string, y: bigint | number | string): LexicographicComparison {\n\t// @ts-expect-error: The subtraction is intentional\n\treturn ((x > y) - (x < y)) as LexicographicComparison;\n}\n\nexport const descNumber = swap(ascNumber);\n"],"mappings":";AAIA,SAAS,KAAwB,IAAwE;CAExG,QAAQ,GAAG,MAAO,IAAI,GAAG,GAAG,CAAC;AAC9B;;;;;;;;;;;;AAaA,SAAgB,eAAkC,GAAgB,GAAyC;CAI1G,OAAO,UAAU,OAAO,CAAC,GAAG,OAAO,CAAC,CAAC;AACtC;AAGA,MAAa,aAAa,KAAK,cAAc;;;;;;;;;;;;;AAc7C,SAAgB,UAAU,GAA6B,GAAsD;CAE5G,QAAS,IAAI,MAAM,IAAI;AACxB;AAEA,MAAa,aAAa,KAAK,SAAS"}
@@ -0,0 +1,2 @@
1
+ import { drop } from "./drop.mjs";
2
+ export { drop as skip };
@@ -0,0 +1,3 @@
1
+ import { drop } from "./drop.mjs";
2
+
3
+ export { drop as skip };
@@ -0,0 +1,2 @@
1
+ import { dropLast } from "./dropLast.mjs";
2
+ export { dropLast as skipLast };
@@ -0,0 +1,3 @@
1
+ import { dropLast } from "./dropLast.mjs";
2
+
3
+ export { dropLast as skipLast };
@@ -0,0 +1,2 @@
1
+ import { dropWhile } from "./dropWhile.mjs";
2
+ export { dropWhile as skipWhile };
@@ -0,0 +1,3 @@
1
+ import { dropWhile } from "./dropWhile.mjs";
2
+
3
+ export { dropWhile as skipWhile };
@@ -0,0 +1,53 @@
1
+ import { IterableResolvable } from "./from.mjs";
2
+ /**
3
+ * Produces an iterable with the elements from the `start` index to the `end` index (exclusive).
4
+ *
5
+ * @param iterable - The iterator to slice.
6
+ * @param start - The index at which to begin extraction.
7
+ * @param end - The index at which to end extraction.
8
+ * @returns An iterator that contains the elements of the provided iterator from `start` to `end`.
9
+ * @example
10
+ * ```typescript
11
+ * import { slice } from '@sapphire/iterator-utilities';
12
+ *
13
+ * const iterable = [1, 2, 3, 4, 5];
14
+ * console.log([...slice(, 1, 3)]);
15
+ * // Output: [2, 3]
16
+ * ```
17
+ * @example
18
+ * ```typescript
19
+ * const iterable = [1, 2, 3, 4, 5];
20
+ * console.log([...slice(iterable, -2)]);
21
+ * // Output: [4, 5]
22
+ * ```
23
+ * @example
24
+ * ```typescript
25
+ * const iterable = [1, 2, 3, 4, 5];
26
+ * console.log([...slice(iterable, 2)]);
27
+ * // Output: [3, 4, 5]
28
+ * ```
29
+ * @example
30
+ * ```typescript
31
+ * const iterable = [1, 2, 3, 4, 5];
32
+ * console.log([...slice(iterable, 2, -1)]);
33
+ * // Output: [3, 4]
34
+ * ```
35
+ * @example
36
+ * ```typescript
37
+ * const iterable = [1, 2, 3, 4, 5];
38
+ * console.log([...slice(iterable, -2, -1)]);
39
+ * // Output: [4]
40
+ * ```
41
+ * @example
42
+ * ```typescript
43
+ * const iterable = [1, 2, 3, 4, 5];
44
+ * console.log([...slice(iterable, 2, 1)]);
45
+ * // Output: []
46
+ * ```
47
+ * @remarks
48
+ *
49
+ * This function consumes the input iterator based on the `start` and `end` values, therefore, you should not use the
50
+ * original iterator after calling this function.
51
+ */
52
+ export declare function slice<const ElementType>(iterable: IterableResolvable<ElementType>, start?: number, end?: number): IterableIterator<ElementType>;
53
+ //# sourceMappingURL=slice.d.mts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"slice.d.mts","names":[],"sources":["../../src/lib/slice.ts"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;wBA0DgB,YAAY,aAAa,UAAU,mBAAmB,cAAc,gBAAgB,eAAe,iBAAiB"}
@@ -0,0 +1,76 @@
1
+ import { drop } from "./drop.mjs";
2
+ import { dropLast } from "./dropLast.mjs";
3
+ import { empty } from "./empty.mjs";
4
+ import { toIntegerOrInfinityOrThrow } from "./shared/_toIntegerOrInfinityOrThrow.mjs";
5
+ import { take } from "./take.mjs";
6
+ import { takeLast } from "./takeLast.mjs";
7
+
8
+ // src/lib/slice.ts
9
+ /**
10
+ * Produces an iterable with the elements from the `start` index to the `end` index (exclusive).
11
+ *
12
+ * @param iterable - The iterator to slice.
13
+ * @param start - The index at which to begin extraction.
14
+ * @param end - The index at which to end extraction.
15
+ * @returns An iterator that contains the elements of the provided iterator from `start` to `end`.
16
+ * @example
17
+ * ```typescript
18
+ * import { slice } from '@sapphire/iterator-utilities';
19
+ *
20
+ * const iterable = [1, 2, 3, 4, 5];
21
+ * console.log([...slice(, 1, 3)]);
22
+ * // Output: [2, 3]
23
+ * ```
24
+ * @example
25
+ * ```typescript
26
+ * const iterable = [1, 2, 3, 4, 5];
27
+ * console.log([...slice(iterable, -2)]);
28
+ * // Output: [4, 5]
29
+ * ```
30
+ * @example
31
+ * ```typescript
32
+ * const iterable = [1, 2, 3, 4, 5];
33
+ * console.log([...slice(iterable, 2)]);
34
+ * // Output: [3, 4, 5]
35
+ * ```
36
+ * @example
37
+ * ```typescript
38
+ * const iterable = [1, 2, 3, 4, 5];
39
+ * console.log([...slice(iterable, 2, -1)]);
40
+ * // Output: [3, 4]
41
+ * ```
42
+ * @example
43
+ * ```typescript
44
+ * const iterable = [1, 2, 3, 4, 5];
45
+ * console.log([...slice(iterable, -2, -1)]);
46
+ * // Output: [4]
47
+ * ```
48
+ * @example
49
+ * ```typescript
50
+ * const iterable = [1, 2, 3, 4, 5];
51
+ * console.log([...slice(iterable, 2, 1)]);
52
+ * // Output: []
53
+ * ```
54
+ * @remarks
55
+ *
56
+ * This function consumes the input iterator based on the `start` and `end` values, therefore, you should not use the
57
+ * original iterator after calling this function.
58
+ */
59
+ function slice(iterable, start, end) {
60
+ start = toIntegerOrInfinityOrThrow(start ?? 0);
61
+ if (start === Number.NEGATIVE_INFINITY) start = 0;
62
+ if (end === void 0) return start >= 0 ? drop(iterable, start) : takeLast(iterable, -start);
63
+ end = toIntegerOrInfinityOrThrow(end);
64
+ if (end < 0) {
65
+ if (end === Number.NEGATIVE_INFINITY) return empty();
66
+ if (start === 0) return dropLast(iterable, -end);
67
+ if (start >= 0) return dropLast(drop(iterable, start), -end);
68
+ if (start >= end) return empty();
69
+ return take(takeLast(iterable, -start), end - start);
70
+ }
71
+ if (start >= end) return empty();
72
+ return end === Number.POSITIVE_INFINITY ? drop(iterable, start) : take(drop(iterable, start), end - start);
73
+ }
74
+
75
+ export { slice };
76
+ //# sourceMappingURL=slice.mjs.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"slice.mjs","names":[],"sources":["../../src/lib/slice.ts"],"sourcesContent":["import { drop } from './drop';\nimport { dropLast } from './dropLast';\nimport { empty } from './empty';\nimport type { IterableResolvable } from './from';\nimport { toIntegerOrInfinityOrThrow } from './shared/_toIntegerOrInfinityOrThrow';\nimport { take } from './take';\nimport { takeLast } from './takeLast';\n\n/**\n * Produces an iterable with the elements from the `start` index to the `end` index (exclusive).\n *\n * @param iterable - The iterator to slice.\n * @param start - The index at which to begin extraction.\n * @param end - The index at which to end extraction.\n * @returns An iterator that contains the elements of the provided iterator from `start` to `end`.\n * @example\n * ```typescript\n * import { slice } from '@sapphire/iterator-utilities';\n *\n * const iterable = [1, 2, 3, 4, 5];\n * console.log([...slice(, 1, 3)]);\n * // Output: [2, 3]\n * ```\n * @example\n * ```typescript\n * const iterable = [1, 2, 3, 4, 5];\n * console.log([...slice(iterable, -2)]);\n * // Output: [4, 5]\n * ```\n * @example\n * ```typescript\n * const iterable = [1, 2, 3, 4, 5];\n * console.log([...slice(iterable, 2)]);\n * // Output: [3, 4, 5]\n * ```\n * @example\n * ```typescript\n * const iterable = [1, 2, 3, 4, 5];\n * console.log([...slice(iterable, 2, -1)]);\n * // Output: [3, 4]\n * ```\n * @example\n * ```typescript\n * const iterable = [1, 2, 3, 4, 5];\n * console.log([...slice(iterable, -2, -1)]);\n * // Output: [4]\n * ```\n * @example\n * ```typescript\n * const iterable = [1, 2, 3, 4, 5];\n * console.log([...slice(iterable, 2, 1)]);\n * // Output: []\n * ```\n * @remarks\n *\n * This function consumes the input iterator based on the `start` and `end` values, therefore, you should not use the\n * original iterator after calling this function.\n */\nexport function slice<const ElementType>(iterable: IterableResolvable<ElementType>, start?: number, end?: number): IterableIterator<ElementType> {\n\t// https://tc39.es/ecma262/#sec-array.prototype.slice\n\t// eslint-disable-next-line no-param-reassign\n\tstart = toIntegerOrInfinityOrThrow(start ?? 0);\n\tif (start === Number.NEGATIVE_INFINITY) {\n\t\t// eslint-disable-next-line no-param-reassign\n\t\tstart = 0;\n\t}\n\n\t// 1. If end is not provided, `slice` behaves like `drop` or `takeLast`,\n\t// depending on the sign of `start`:\n\tif (end === undefined) {\n\t\treturn start >= 0 //\n\t\t\t? drop(iterable, start)\n\t\t\t: takeLast(iterable, -start);\n\t}\n\n\t// eslint-disable-next-line no-param-reassign\n\tend = toIntegerOrInfinityOrThrow(end);\n\t// 2. If end is negative:\n\tif (end < 0) {\n\t\t// 2.1. If `end` is `-Infinity`, end would be `0`, which will always\n\t\t// result on an empty iterator:\n\t\tif (end === Number.NEGATIVE_INFINITY) {\n\t\t\treturn empty();\n\t\t}\n\n\t\t// 2.2. If start is positive, drop the last n elements:\n\t\tif (start === 0) {\n\t\t\treturn dropLast(iterable, -end);\n\t\t}\n\n\t\t// 2.3. If the start is positive, drop the first n elements and take the\n\t\t// last m elements:\n\t\tif (start >= 0) {\n\t\t\treturn dropLast(drop(iterable, start), -end);\n\t\t}\n\n\t\t// 2.4. If the start is the same or greater than the end, return an\n\t\t// empty iterator:\n\t\tif (start >= end) {\n\t\t\treturn empty();\n\t\t}\n\n\t\t// 2.5. `start` and `end` are negative, take the elements between the\n\t\t// start and end:\n\t\treturn take(takeLast(iterable, -start), end - start);\n\t}\n\n\t// 3.0. If `start` is greater than or equal to `end`, return an empty iterator:\n\tif (start >= end) return empty();\n\n\t// 4.0. Otherwise, take the elements between `start` and `end`:\n\treturn end === Number.POSITIVE_INFINITY //\n\t\t? drop(iterable, start)\n\t\t: take(drop(iterable, start), end - start);\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA0DA,SAAgB,MAAyB,UAA2C,OAAgB,KAA6C;CAGhJ,QAAQ,2BAA2B,SAAS,CAAC;CAC7C,IAAI,UAAU,OAAO,mBAEpB,QAAQ;CAKT,IAAI,QAAQ,QACX,OAAO,SAAS,IACb,KAAK,UAAU,KAAK,IACpB,SAAS,UAAU,CAAC,KAAK;CAI7B,MAAM,2BAA2B,GAAG;CAEpC,IAAI,MAAM,GAAG;EAGZ,IAAI,QAAQ,OAAO,mBAClB,OAAO,MAAM;EAId,IAAI,UAAU,GACb,OAAO,SAAS,UAAU,CAAC,GAAG;EAK/B,IAAI,SAAS,GACZ,OAAO,SAAS,KAAK,UAAU,KAAK,GAAG,CAAC,GAAG;EAK5C,IAAI,SAAS,KACZ,OAAO,MAAM;EAKd,OAAO,KAAK,SAAS,UAAU,CAAC,KAAK,GAAG,MAAM,KAAK;CACpD;CAGA,IAAI,SAAS,KAAK,OAAO,MAAM;CAG/B,OAAO,QAAQ,OAAO,oBACnB,KAAK,UAAU,KAAK,IACpB,KAAK,KAAK,UAAU,KAAK,GAAG,MAAM,KAAK;AAC3C"}
@@ -0,0 +1,28 @@
1
+ import { IterableResolvable } from "./from.mjs";
2
+ /**
3
+ * Advances the iterable until it finds a matching element, returning `true` if it's found and `false` otherwise.
4
+ *
5
+ * @param iterable - An iterator to search for a value in.
6
+ * @param callbackFn - A function to execute for each element produced by the iterator. It should return a truthy value to
7
+ * indicate the element passes the test, and a falsy value otherwise.
8
+ * @returns `true` if the callback function returns a truthy value for at least one element. Otherwise, `false`.
9
+ * @example
10
+ * ```typescript
11
+ * import { some } from '@sapphire/iterator-utilities';
12
+ *
13
+ * const iterable = [1, 2, 3, 4, 5];
14
+ * console.log(some(iterable, (value) => value % 2 === 0));
15
+ * // Output: true
16
+ * ```
17
+ * @example
18
+ * ```typescript
19
+ * const iterable = [1, 2, 3, 4, 5];
20
+ * console.log(some(iterable, (value) => value % 6 === 0));
21
+ * // Output: false
22
+ * ```
23
+ * @remarks
24
+ *
25
+ * This function consumes the iterator until the value is found or the iterator is exhausted.
26
+ */
27
+ export declare function some<const ElementType>(iterable: IterableResolvable<ElementType>, callbackFn: (element: ElementType, index: number) => boolean): boolean;
28
+ //# sourceMappingURL=some.d.mts.map