@sapphire/iterator-utilities 1.1.0-next.63f6019b.0 → 2.0.0-next.0dce7d63

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 (468) hide show
  1. package/CHANGELOG.md +32 -0
  2. package/README.md +81 -15
  3. package/dist/cjs/index.cjs +218 -1
  4. package/dist/cjs/index.cjs.map +1 -1
  5. package/dist/cjs/index.d.cts +33 -10
  6. package/dist/cjs/lib/all.cjs +12 -0
  7. package/dist/cjs/lib/all.cjs.map +1 -0
  8. package/dist/cjs/lib/all.d.cts +2 -0
  9. package/dist/cjs/lib/any.cjs +12 -0
  10. package/dist/cjs/lib/any.cjs.map +1 -0
  11. package/dist/cjs/lib/any.d.cts +2 -0
  12. package/dist/cjs/lib/append.cjs +1 -1
  13. package/dist/cjs/lib/append.cjs.map +1 -1
  14. package/dist/cjs/lib/at.cjs +1 -1
  15. package/dist/cjs/lib/at.cjs.map +1 -1
  16. package/dist/cjs/lib/average.cjs +1 -1
  17. package/dist/cjs/lib/average.cjs.map +1 -1
  18. package/dist/cjs/lib/chain.cjs +1 -1
  19. package/dist/cjs/lib/chain.cjs.map +1 -1
  20. package/dist/cjs/lib/chunk.cjs +1 -1
  21. package/dist/cjs/lib/chunk.cjs.map +1 -1
  22. package/dist/cjs/lib/collect.cjs +12 -0
  23. package/dist/cjs/lib/collect.cjs.map +1 -0
  24. package/dist/cjs/lib/collect.d.cts +2 -0
  25. package/dist/cjs/lib/collectInto.cjs +17 -0
  26. package/dist/cjs/lib/collectInto.cjs.map +1 -0
  27. package/dist/cjs/lib/collectInto.d.cts +29 -0
  28. package/dist/cjs/lib/compact.cjs +1 -1
  29. package/dist/cjs/lib/compact.cjs.map +1 -1
  30. package/dist/cjs/lib/compare.cjs +15 -0
  31. package/dist/cjs/lib/compare.cjs.map +1 -0
  32. package/dist/cjs/lib/compare.d.cts +32 -0
  33. package/dist/cjs/lib/compareBy.cjs +26 -0
  34. package/dist/cjs/lib/compareBy.cjs.map +1 -0
  35. package/dist/cjs/lib/compareBy.d.cts +31 -0
  36. package/dist/cjs/lib/compress.cjs +1 -1
  37. package/dist/cjs/lib/compress.cjs.map +1 -1
  38. package/dist/cjs/lib/contains.cjs +2 -3
  39. package/dist/cjs/lib/contains.cjs.map +1 -1
  40. package/dist/cjs/lib/count.cjs +1 -1
  41. package/dist/cjs/lib/count.cjs.map +1 -1
  42. package/dist/cjs/lib/cycle.cjs +1 -1
  43. package/dist/cjs/lib/cycle.cjs.map +1 -1
  44. package/dist/cjs/lib/difference.cjs +1 -1
  45. package/dist/cjs/lib/difference.cjs.map +1 -1
  46. package/dist/cjs/lib/drop.cjs +4 -8
  47. package/dist/cjs/lib/drop.cjs.map +1 -1
  48. package/dist/cjs/lib/drop.d.cts +1 -1
  49. package/dist/cjs/lib/dropLast.cjs +2 -4
  50. package/dist/cjs/lib/dropLast.cjs.map +1 -1
  51. package/dist/cjs/lib/dropLast.d.cts +1 -1
  52. package/dist/cjs/lib/dropWhile.cjs +1 -2
  53. package/dist/cjs/lib/dropWhile.cjs.map +1 -1
  54. package/dist/cjs/lib/dropWhile.d.cts +1 -1
  55. package/dist/cjs/lib/empty.cjs +1 -1
  56. package/dist/cjs/lib/empty.cjs.map +1 -1
  57. package/dist/cjs/lib/enumerate.cjs +1 -1
  58. package/dist/cjs/lib/enumerate.cjs.map +1 -1
  59. package/dist/cjs/lib/equal.cjs +15 -0
  60. package/dist/cjs/lib/equal.cjs.map +1 -0
  61. package/dist/cjs/lib/equal.d.cts +26 -0
  62. package/dist/cjs/lib/equalBy.cjs +23 -0
  63. package/dist/cjs/lib/equalBy.cjs.map +1 -0
  64. package/dist/cjs/lib/equalBy.d.cts +27 -0
  65. package/dist/cjs/lib/every.cjs +2 -3
  66. package/dist/cjs/lib/every.cjs.map +1 -1
  67. package/dist/cjs/lib/filter.cjs +2 -4
  68. package/dist/cjs/lib/filter.cjs.map +1 -1
  69. package/dist/cjs/lib/filter.d.cts +1 -1
  70. package/dist/cjs/lib/find.cjs +1 -1
  71. package/dist/cjs/lib/find.cjs.map +1 -1
  72. package/dist/cjs/lib/findIndex.cjs +1 -1
  73. package/dist/cjs/lib/findIndex.cjs.map +1 -1
  74. package/dist/cjs/lib/first.cjs +1 -1
  75. package/dist/cjs/lib/first.cjs.map +1 -1
  76. package/dist/cjs/lib/flat.cjs +1 -1
  77. package/dist/cjs/lib/flat.cjs.map +1 -1
  78. package/dist/cjs/lib/flatMap.cjs +1 -1
  79. package/dist/cjs/lib/flatMap.cjs.map +1 -1
  80. package/dist/cjs/lib/forEach.cjs +1 -1
  81. package/dist/cjs/lib/forEach.cjs.map +1 -1
  82. package/dist/cjs/lib/from.cjs +1 -1
  83. package/dist/cjs/lib/from.cjs.map +1 -1
  84. package/dist/cjs/lib/fuse.cjs +26 -0
  85. package/dist/cjs/lib/fuse.cjs.map +1 -0
  86. package/dist/cjs/lib/fuse.d.cts +47 -0
  87. package/dist/cjs/lib/greaterOrEqualThan.cjs +17 -0
  88. package/dist/cjs/lib/greaterOrEqualThan.cjs.map +1 -0
  89. package/dist/cjs/lib/greaterOrEqualThan.d.cts +32 -0
  90. package/dist/cjs/lib/greaterThan.cjs +17 -0
  91. package/dist/cjs/lib/greaterThan.cjs.map +1 -0
  92. package/dist/cjs/lib/greaterThan.d.cts +32 -0
  93. package/dist/cjs/lib/indexOf.cjs +1 -2
  94. package/dist/cjs/lib/indexOf.cjs.map +1 -1
  95. package/dist/cjs/lib/indexOf.d.cts +1 -1
  96. package/dist/cjs/lib/inspect.cjs +25 -0
  97. package/dist/cjs/lib/inspect.cjs.map +1 -0
  98. package/dist/cjs/lib/inspect.d.cts +39 -0
  99. package/dist/cjs/lib/intersect.cjs +1 -1
  100. package/dist/cjs/lib/intersect.cjs.map +1 -1
  101. package/dist/cjs/lib/intersperse.cjs +35 -0
  102. package/dist/cjs/lib/intersperse.cjs.map +1 -0
  103. package/dist/cjs/lib/intersperse.d.cts +30 -0
  104. package/dist/cjs/lib/isEmpty.cjs +1 -1
  105. package/dist/cjs/lib/isEmpty.cjs.map +1 -1
  106. package/dist/cjs/lib/isSorted.cjs +15 -0
  107. package/dist/cjs/lib/isSorted.cjs.map +1 -0
  108. package/dist/cjs/lib/isSorted.d.cts +35 -0
  109. package/dist/cjs/lib/isSortedBy.cjs +26 -0
  110. package/dist/cjs/lib/isSortedBy.cjs.map +1 -0
  111. package/dist/cjs/lib/isSortedBy.d.cts +32 -0
  112. package/dist/cjs/lib/isSortedByKey.cjs +29 -0
  113. package/dist/cjs/lib/isSortedByKey.cjs.map +1 -0
  114. package/dist/cjs/lib/isSortedByKey.d.cts +30 -0
  115. package/dist/cjs/lib/last.cjs +1 -1
  116. package/dist/cjs/lib/last.cjs.map +1 -1
  117. package/dist/cjs/lib/lessOrEqualThan.cjs +17 -0
  118. package/dist/cjs/lib/lessOrEqualThan.cjs.map +1 -0
  119. package/dist/cjs/lib/lessOrEqualThan.d.cts +32 -0
  120. package/dist/cjs/lib/lessThan.cjs +17 -0
  121. package/dist/cjs/lib/lessThan.cjs.map +1 -0
  122. package/dist/cjs/lib/lessThan.d.cts +32 -0
  123. package/dist/cjs/lib/map.cjs +1 -1
  124. package/dist/cjs/lib/map.cjs.map +1 -1
  125. package/dist/cjs/lib/max.cjs +4 -9
  126. package/dist/cjs/lib/max.cjs.map +1 -1
  127. package/dist/cjs/lib/max.d.cts +8 -3
  128. package/dist/cjs/lib/maxBy.cjs +27 -0
  129. package/dist/cjs/lib/maxBy.cjs.map +1 -0
  130. package/dist/cjs/lib/maxBy.d.cts +31 -0
  131. package/dist/cjs/lib/maxByKey.cjs +32 -0
  132. package/dist/cjs/lib/maxByKey.cjs.map +1 -0
  133. package/dist/cjs/lib/maxByKey.d.cts +32 -0
  134. package/dist/cjs/lib/min.cjs +4 -9
  135. package/dist/cjs/lib/min.cjs.map +1 -1
  136. package/dist/cjs/lib/min.d.cts +8 -3
  137. package/dist/cjs/lib/minBy.cjs +27 -0
  138. package/dist/cjs/lib/minBy.cjs.map +1 -0
  139. package/dist/cjs/lib/minBy.d.cts +31 -0
  140. package/dist/cjs/lib/minByKey.cjs +32 -0
  141. package/dist/cjs/lib/minByKey.cjs.map +1 -0
  142. package/dist/cjs/lib/minByKey.d.cts +31 -0
  143. package/dist/cjs/lib/notEqual.cjs +15 -0
  144. package/dist/cjs/lib/notEqual.cjs.map +1 -0
  145. package/dist/cjs/lib/notEqual.d.cts +26 -0
  146. package/dist/cjs/lib/nth.cjs +12 -0
  147. package/dist/cjs/lib/nth.cjs.map +1 -0
  148. package/dist/cjs/lib/nth.d.cts +2 -0
  149. package/dist/cjs/lib/partition.cjs +1 -1
  150. package/dist/cjs/lib/partition.cjs.map +1 -1
  151. package/dist/cjs/lib/peekable.cjs +2 -3
  152. package/dist/cjs/lib/peekable.cjs.map +1 -1
  153. package/dist/cjs/lib/peekable.d.cts +1 -1
  154. package/dist/cjs/lib/position.cjs +12 -0
  155. package/dist/cjs/lib/position.cjs.map +1 -0
  156. package/dist/cjs/lib/position.d.cts +2 -0
  157. package/dist/cjs/lib/prepend.cjs +1 -1
  158. package/dist/cjs/lib/prepend.cjs.map +1 -1
  159. package/dist/cjs/lib/product.cjs +1 -1
  160. package/dist/cjs/lib/product.cjs.map +1 -1
  161. package/dist/cjs/lib/range.cjs +1 -1
  162. package/dist/cjs/lib/range.cjs.map +1 -1
  163. package/dist/cjs/lib/reduce.cjs +2 -3
  164. package/dist/cjs/lib/reduce.cjs.map +1 -1
  165. package/dist/cjs/lib/repeat.cjs +1 -1
  166. package/dist/cjs/lib/repeat.cjs.map +1 -1
  167. package/dist/cjs/lib/reverse.cjs +3 -6
  168. package/dist/cjs/lib/reverse.cjs.map +1 -1
  169. package/dist/cjs/lib/shared/_assertFunction.cjs +1 -1
  170. package/dist/cjs/lib/shared/_assertFunction.cjs.map +1 -1
  171. package/dist/cjs/lib/shared/_assertNotNegative.cjs +1 -1
  172. package/dist/cjs/lib/shared/_assertNotNegative.cjs.map +1 -1
  173. package/dist/cjs/lib/shared/_assertPositive.cjs +1 -1
  174. package/dist/cjs/lib/shared/_assertPositive.cjs.map +1 -1
  175. package/dist/cjs/lib/shared/_compare.cjs +36 -0
  176. package/dist/cjs/lib/shared/_compare.cjs.map +1 -0
  177. package/dist/cjs/lib/shared/_compare.d.cts +20 -0
  178. package/dist/cjs/lib/shared/_makeIterableIterator.cjs +1 -1
  179. package/dist/cjs/lib/shared/_makeIterableIterator.cjs.map +1 -1
  180. package/dist/cjs/lib/shared/_toIntegerOrInfinityOrThrow.cjs +4 -7
  181. package/dist/cjs/lib/shared/_toIntegerOrInfinityOrThrow.cjs.map +1 -1
  182. package/dist/cjs/lib/shared/_toIntegerOrThrow.cjs +4 -7
  183. package/dist/cjs/lib/shared/_toIntegerOrThrow.cjs.map +1 -1
  184. package/dist/cjs/lib/shared/_toNumberOrThrow.cjs +1 -1
  185. package/dist/cjs/lib/shared/_toNumberOrThrow.cjs.map +1 -1
  186. package/dist/cjs/lib/shared/comparators.cjs +28 -0
  187. package/dist/cjs/lib/shared/comparators.cjs.map +1 -0
  188. package/dist/cjs/lib/shared/comparators.d.cts +34 -0
  189. package/dist/cjs/lib/skip.cjs +12 -0
  190. package/dist/cjs/lib/skip.cjs.map +1 -0
  191. package/dist/cjs/lib/skip.d.cts +2 -0
  192. package/dist/cjs/lib/skipLast.cjs +12 -0
  193. package/dist/cjs/lib/skipLast.cjs.map +1 -0
  194. package/dist/cjs/lib/skipLast.d.cts +2 -0
  195. package/dist/cjs/lib/skipWhile.cjs +12 -0
  196. package/dist/cjs/lib/skipWhile.cjs.map +1 -0
  197. package/dist/cjs/lib/skipWhile.d.cts +2 -0
  198. package/dist/cjs/lib/slice.cjs +2 -3
  199. package/dist/cjs/lib/slice.cjs.map +1 -1
  200. package/dist/cjs/lib/some.cjs +1 -1
  201. package/dist/cjs/lib/some.cjs.map +1 -1
  202. package/dist/cjs/lib/sorted.cjs +1 -1
  203. package/dist/cjs/lib/sorted.cjs.map +1 -1
  204. package/dist/cjs/lib/starMap.cjs +1 -1
  205. package/dist/cjs/lib/starMap.cjs.map +1 -1
  206. package/dist/cjs/lib/stepBy.cjs +29 -0
  207. package/dist/cjs/lib/stepBy.cjs.map +1 -0
  208. package/dist/cjs/lib/stepBy.d.cts +24 -0
  209. package/dist/cjs/lib/sum.cjs +1 -1
  210. package/dist/cjs/lib/sum.cjs.map +1 -1
  211. package/dist/cjs/lib/take.cjs +2 -3
  212. package/dist/cjs/lib/take.cjs.map +1 -1
  213. package/dist/cjs/lib/takeLast.cjs +3 -5
  214. package/dist/cjs/lib/takeLast.cjs.map +1 -1
  215. package/dist/cjs/lib/takeWhile.cjs +12 -0
  216. package/dist/cjs/lib/takeWhile.cjs.map +1 -0
  217. package/dist/cjs/lib/takeWhile.d.cts +2 -0
  218. package/dist/cjs/lib/tee.cjs +2 -3
  219. package/dist/cjs/lib/tee.cjs.map +1 -1
  220. package/dist/cjs/lib/toArray.cjs +1 -1
  221. package/dist/cjs/lib/toArray.cjs.map +1 -1
  222. package/dist/cjs/lib/toIterableIterator.cjs +1 -1
  223. package/dist/cjs/lib/toIterableIterator.cjs.map +1 -1
  224. package/dist/cjs/lib/union.cjs +1 -1
  225. package/dist/cjs/lib/union.cjs.map +1 -1
  226. package/dist/cjs/lib/union.d.cts +1 -0
  227. package/dist/cjs/lib/unique.cjs +1 -1
  228. package/dist/cjs/lib/unique.cjs.map +1 -1
  229. package/dist/cjs/lib/unzip.cjs +2 -3
  230. package/dist/cjs/lib/unzip.cjs.map +1 -1
  231. package/dist/cjs/lib/zip.cjs +2 -3
  232. package/dist/cjs/lib/zip.cjs.map +1 -1
  233. package/dist/esm/{chunk-G5GHKT7C.mjs → chunk-PAWJFY3S.mjs} +2 -2
  234. package/dist/esm/chunk-PAWJFY3S.mjs.map +1 -0
  235. package/dist/esm/index.d.mts +33 -10
  236. package/dist/esm/index.mjs +32 -1
  237. package/dist/esm/index.mjs.map +1 -1
  238. package/dist/esm/lib/all.d.mts +2 -0
  239. package/dist/esm/lib/all.mjs +4 -0
  240. package/dist/esm/lib/all.mjs.map +1 -0
  241. package/dist/esm/lib/any.d.mts +2 -0
  242. package/dist/esm/lib/any.mjs +4 -0
  243. package/dist/esm/lib/any.mjs.map +1 -0
  244. package/dist/esm/lib/append.mjs +2 -2
  245. package/dist/esm/lib/append.mjs.map +1 -1
  246. package/dist/esm/lib/at.mjs +2 -2
  247. package/dist/esm/lib/at.mjs.map +1 -1
  248. package/dist/esm/lib/average.mjs +2 -2
  249. package/dist/esm/lib/average.mjs.map +1 -1
  250. package/dist/esm/lib/chain.mjs +2 -2
  251. package/dist/esm/lib/chain.mjs.map +1 -1
  252. package/dist/esm/lib/chunk.mjs +2 -2
  253. package/dist/esm/lib/chunk.mjs.map +1 -1
  254. package/dist/esm/lib/collect.d.mts +2 -0
  255. package/dist/esm/lib/collect.mjs +4 -0
  256. package/dist/esm/lib/collect.mjs.map +1 -0
  257. package/dist/esm/lib/collectInto.d.mts +29 -0
  258. package/dist/esm/lib/collectInto.mjs +14 -0
  259. package/dist/esm/lib/collectInto.mjs.map +1 -0
  260. package/dist/esm/lib/compact.mjs +2 -2
  261. package/dist/esm/lib/compact.mjs.map +1 -1
  262. package/dist/esm/lib/compare.d.mts +32 -0
  263. package/dist/esm/lib/compare.mjs +12 -0
  264. package/dist/esm/lib/compare.mjs.map +1 -0
  265. package/dist/esm/lib/compareBy.d.mts +31 -0
  266. package/dist/esm/lib/compareBy.mjs +23 -0
  267. package/dist/esm/lib/compareBy.mjs.map +1 -0
  268. package/dist/esm/lib/compress.mjs +2 -2
  269. package/dist/esm/lib/compress.mjs.map +1 -1
  270. package/dist/esm/lib/contains.mjs +3 -4
  271. package/dist/esm/lib/contains.mjs.map +1 -1
  272. package/dist/esm/lib/count.mjs +2 -2
  273. package/dist/esm/lib/count.mjs.map +1 -1
  274. package/dist/esm/lib/cycle.mjs +2 -2
  275. package/dist/esm/lib/cycle.mjs.map +1 -1
  276. package/dist/esm/lib/difference.mjs +2 -2
  277. package/dist/esm/lib/difference.mjs.map +1 -1
  278. package/dist/esm/lib/drop.d.mts +1 -1
  279. package/dist/esm/lib/drop.mjs +6 -9
  280. package/dist/esm/lib/drop.mjs.map +1 -1
  281. package/dist/esm/lib/dropLast.d.mts +1 -1
  282. package/dist/esm/lib/dropLast.mjs +4 -5
  283. package/dist/esm/lib/dropLast.mjs.map +1 -1
  284. package/dist/esm/lib/dropWhile.d.mts +1 -1
  285. package/dist/esm/lib/dropWhile.mjs +3 -3
  286. package/dist/esm/lib/dropWhile.mjs.map +1 -1
  287. package/dist/esm/lib/empty.mjs +2 -2
  288. package/dist/esm/lib/empty.mjs.map +1 -1
  289. package/dist/esm/lib/enumerate.mjs +2 -2
  290. package/dist/esm/lib/enumerate.mjs.map +1 -1
  291. package/dist/esm/lib/equal.d.mts +26 -0
  292. package/dist/esm/lib/equal.mjs +11 -0
  293. package/dist/esm/lib/equal.mjs.map +1 -0
  294. package/dist/esm/lib/equalBy.d.mts +27 -0
  295. package/dist/esm/lib/equalBy.mjs +19 -0
  296. package/dist/esm/lib/equalBy.mjs.map +1 -0
  297. package/dist/esm/lib/every.mjs +3 -4
  298. package/dist/esm/lib/every.mjs.map +1 -1
  299. package/dist/esm/lib/filter.d.mts +1 -1
  300. package/dist/esm/lib/filter.mjs +4 -5
  301. package/dist/esm/lib/filter.mjs.map +1 -1
  302. package/dist/esm/lib/find.mjs +2 -2
  303. package/dist/esm/lib/find.mjs.map +1 -1
  304. package/dist/esm/lib/findIndex.mjs +2 -2
  305. package/dist/esm/lib/findIndex.mjs.map +1 -1
  306. package/dist/esm/lib/first.mjs +2 -2
  307. package/dist/esm/lib/first.mjs.map +1 -1
  308. package/dist/esm/lib/flat.mjs +2 -2
  309. package/dist/esm/lib/flat.mjs.map +1 -1
  310. package/dist/esm/lib/flatMap.mjs +2 -2
  311. package/dist/esm/lib/flatMap.mjs.map +1 -1
  312. package/dist/esm/lib/forEach.mjs +2 -2
  313. package/dist/esm/lib/forEach.mjs.map +1 -1
  314. package/dist/esm/lib/from.mjs +2 -2
  315. package/dist/esm/lib/from.mjs.map +1 -1
  316. package/dist/esm/lib/fuse.d.mts +47 -0
  317. package/dist/esm/lib/fuse.mjs +23 -0
  318. package/dist/esm/lib/fuse.mjs.map +1 -0
  319. package/dist/esm/lib/greaterOrEqualThan.d.mts +32 -0
  320. package/dist/esm/lib/greaterOrEqualThan.mjs +13 -0
  321. package/dist/esm/lib/greaterOrEqualThan.mjs.map +1 -0
  322. package/dist/esm/lib/greaterThan.d.mts +32 -0
  323. package/dist/esm/lib/greaterThan.mjs +13 -0
  324. package/dist/esm/lib/greaterThan.mjs.map +1 -0
  325. package/dist/esm/lib/indexOf.d.mts +1 -1
  326. package/dist/esm/lib/indexOf.mjs +3 -3
  327. package/dist/esm/lib/indexOf.mjs.map +1 -1
  328. package/dist/esm/lib/inspect.d.mts +39 -0
  329. package/dist/esm/lib/inspect.mjs +22 -0
  330. package/dist/esm/lib/inspect.mjs.map +1 -0
  331. package/dist/esm/lib/intersect.mjs +2 -2
  332. package/dist/esm/lib/intersect.mjs.map +1 -1
  333. package/dist/esm/lib/intersperse.d.mts +30 -0
  334. package/dist/esm/lib/intersperse.mjs +32 -0
  335. package/dist/esm/lib/intersperse.mjs.map +1 -0
  336. package/dist/esm/lib/isEmpty.mjs +2 -2
  337. package/dist/esm/lib/isEmpty.mjs.map +1 -1
  338. package/dist/esm/lib/isSorted.d.mts +35 -0
  339. package/dist/esm/lib/isSorted.mjs +12 -0
  340. package/dist/esm/lib/isSorted.mjs.map +1 -0
  341. package/dist/esm/lib/isSortedBy.d.mts +32 -0
  342. package/dist/esm/lib/isSortedBy.mjs +23 -0
  343. package/dist/esm/lib/isSortedBy.mjs.map +1 -0
  344. package/dist/esm/lib/isSortedByKey.d.mts +30 -0
  345. package/dist/esm/lib/isSortedByKey.mjs +26 -0
  346. package/dist/esm/lib/isSortedByKey.mjs.map +1 -0
  347. package/dist/esm/lib/last.mjs +2 -2
  348. package/dist/esm/lib/last.mjs.map +1 -1
  349. package/dist/esm/lib/lessOrEqualThan.d.mts +32 -0
  350. package/dist/esm/lib/lessOrEqualThan.mjs +13 -0
  351. package/dist/esm/lib/lessOrEqualThan.mjs.map +1 -0
  352. package/dist/esm/lib/lessThan.d.mts +32 -0
  353. package/dist/esm/lib/lessThan.mjs +13 -0
  354. package/dist/esm/lib/lessThan.mjs.map +1 -0
  355. package/dist/esm/lib/map.mjs +2 -2
  356. package/dist/esm/lib/map.mjs.map +1 -1
  357. package/dist/esm/lib/max.d.mts +8 -3
  358. package/dist/esm/lib/max.mjs +5 -10
  359. package/dist/esm/lib/max.mjs.map +1 -1
  360. package/dist/esm/lib/maxBy.d.mts +31 -0
  361. package/dist/esm/lib/maxBy.mjs +24 -0
  362. package/dist/esm/lib/maxBy.mjs.map +1 -0
  363. package/dist/esm/lib/maxByKey.d.mts +32 -0
  364. package/dist/esm/lib/maxByKey.mjs +29 -0
  365. package/dist/esm/lib/maxByKey.mjs.map +1 -0
  366. package/dist/esm/lib/min.d.mts +8 -3
  367. package/dist/esm/lib/min.mjs +5 -10
  368. package/dist/esm/lib/min.mjs.map +1 -1
  369. package/dist/esm/lib/minBy.d.mts +31 -0
  370. package/dist/esm/lib/minBy.mjs +24 -0
  371. package/dist/esm/lib/minBy.mjs.map +1 -0
  372. package/dist/esm/lib/minByKey.d.mts +31 -0
  373. package/dist/esm/lib/minByKey.mjs +29 -0
  374. package/dist/esm/lib/minByKey.mjs.map +1 -0
  375. package/dist/esm/lib/notEqual.d.mts +26 -0
  376. package/dist/esm/lib/notEqual.mjs +11 -0
  377. package/dist/esm/lib/notEqual.mjs.map +1 -0
  378. package/dist/esm/lib/nth.d.mts +2 -0
  379. package/dist/esm/lib/nth.mjs +4 -0
  380. package/dist/esm/lib/nth.mjs.map +1 -0
  381. package/dist/esm/lib/partition.mjs +2 -2
  382. package/dist/esm/lib/partition.mjs.map +1 -1
  383. package/dist/esm/lib/peekable.d.mts +1 -1
  384. package/dist/esm/lib/peekable.mjs +3 -4
  385. package/dist/esm/lib/peekable.mjs.map +1 -1
  386. package/dist/esm/lib/position.d.mts +2 -0
  387. package/dist/esm/lib/position.mjs +4 -0
  388. package/dist/esm/lib/position.mjs.map +1 -0
  389. package/dist/esm/lib/prepend.mjs +2 -2
  390. package/dist/esm/lib/prepend.mjs.map +1 -1
  391. package/dist/esm/lib/product.mjs +2 -2
  392. package/dist/esm/lib/product.mjs.map +1 -1
  393. package/dist/esm/lib/range.mjs +2 -2
  394. package/dist/esm/lib/range.mjs.map +1 -1
  395. package/dist/esm/lib/reduce.mjs +3 -4
  396. package/dist/esm/lib/reduce.mjs.map +1 -1
  397. package/dist/esm/lib/repeat.mjs +2 -2
  398. package/dist/esm/lib/repeat.mjs.map +1 -1
  399. package/dist/esm/lib/reverse.mjs +4 -7
  400. package/dist/esm/lib/reverse.mjs.map +1 -1
  401. package/dist/esm/lib/shared/_assertFunction.mjs +2 -2
  402. package/dist/esm/lib/shared/_assertFunction.mjs.map +1 -1
  403. package/dist/esm/lib/shared/_assertNotNegative.mjs +2 -2
  404. package/dist/esm/lib/shared/_assertNotNegative.mjs.map +1 -1
  405. package/dist/esm/lib/shared/_assertPositive.mjs +2 -2
  406. package/dist/esm/lib/shared/_assertPositive.mjs.map +1 -1
  407. package/dist/esm/lib/shared/_compare.d.mts +20 -0
  408. package/dist/esm/lib/shared/_compare.mjs +30 -0
  409. package/dist/esm/lib/shared/_compare.mjs.map +1 -0
  410. package/dist/esm/lib/shared/_makeIterableIterator.mjs +2 -2
  411. package/dist/esm/lib/shared/_makeIterableIterator.mjs.map +1 -1
  412. package/dist/esm/lib/shared/_toIntegerOrInfinityOrThrow.mjs +5 -8
  413. package/dist/esm/lib/shared/_toIntegerOrInfinityOrThrow.mjs.map +1 -1
  414. package/dist/esm/lib/shared/_toIntegerOrThrow.mjs +5 -8
  415. package/dist/esm/lib/shared/_toIntegerOrThrow.mjs.map +1 -1
  416. package/dist/esm/lib/shared/_toNumberOrThrow.mjs +2 -2
  417. package/dist/esm/lib/shared/_toNumberOrThrow.mjs.map +1 -1
  418. package/dist/esm/lib/shared/comparators.d.mts +34 -0
  419. package/dist/esm/lib/shared/comparators.mjs +21 -0
  420. package/dist/esm/lib/shared/comparators.mjs.map +1 -0
  421. package/dist/esm/lib/skip.d.mts +2 -0
  422. package/dist/esm/lib/skip.mjs +4 -0
  423. package/dist/esm/lib/skip.mjs.map +1 -0
  424. package/dist/esm/lib/skipLast.d.mts +2 -0
  425. package/dist/esm/lib/skipLast.mjs +4 -0
  426. package/dist/esm/lib/skipLast.mjs.map +1 -0
  427. package/dist/esm/lib/skipWhile.d.mts +2 -0
  428. package/dist/esm/lib/skipWhile.mjs +4 -0
  429. package/dist/esm/lib/skipWhile.mjs.map +1 -0
  430. package/dist/esm/lib/slice.mjs +3 -4
  431. package/dist/esm/lib/slice.mjs.map +1 -1
  432. package/dist/esm/lib/some.mjs +2 -2
  433. package/dist/esm/lib/some.mjs.map +1 -1
  434. package/dist/esm/lib/sorted.mjs +2 -2
  435. package/dist/esm/lib/sorted.mjs.map +1 -1
  436. package/dist/esm/lib/starMap.mjs +2 -2
  437. package/dist/esm/lib/starMap.mjs.map +1 -1
  438. package/dist/esm/lib/stepBy.d.mts +24 -0
  439. package/dist/esm/lib/stepBy.mjs +26 -0
  440. package/dist/esm/lib/stepBy.mjs.map +1 -0
  441. package/dist/esm/lib/sum.mjs +2 -2
  442. package/dist/esm/lib/sum.mjs.map +1 -1
  443. package/dist/esm/lib/take.mjs +3 -4
  444. package/dist/esm/lib/take.mjs.map +1 -1
  445. package/dist/esm/lib/takeLast.mjs +4 -6
  446. package/dist/esm/lib/takeLast.mjs.map +1 -1
  447. package/dist/esm/lib/takeWhile.d.mts +2 -0
  448. package/dist/esm/lib/takeWhile.mjs +4 -0
  449. package/dist/esm/lib/takeWhile.mjs.map +1 -0
  450. package/dist/esm/lib/tee.mjs +3 -4
  451. package/dist/esm/lib/tee.mjs.map +1 -1
  452. package/dist/esm/lib/toArray.mjs +2 -2
  453. package/dist/esm/lib/toArray.mjs.map +1 -1
  454. package/dist/esm/lib/toIterableIterator.mjs +2 -2
  455. package/dist/esm/lib/toIterableIterator.mjs.map +1 -1
  456. package/dist/esm/lib/union.d.mts +1 -0
  457. package/dist/esm/lib/union.mjs +2 -2
  458. package/dist/esm/lib/union.mjs.map +1 -1
  459. package/dist/esm/lib/unique.mjs +2 -2
  460. package/dist/esm/lib/unique.mjs.map +1 -1
  461. package/dist/esm/lib/unzip.mjs +3 -4
  462. package/dist/esm/lib/unzip.mjs.map +1 -1
  463. package/dist/esm/lib/zip.mjs +3 -4
  464. package/dist/esm/lib/zip.mjs.map +1 -1
  465. package/dist/iife/index.global.js +413 -95
  466. package/dist/iife/index.global.js.map +1 -1
  467. package/package.json +299 -28
  468. package/dist/esm/chunk-G5GHKT7C.mjs.map +0 -1
@@ -1,4 +1,4 @@
1
- import { __name } from '../chunk-G5GHKT7C.mjs';
1
+ import { __name } from '../chunk-PAWJFY3S.mjs';
2
2
  import { filter } from './filter.mjs';
3
3
  import { toIterableIterator } from './toIterableIterator.mjs';
4
4
 
@@ -9,5 +9,5 @@ function intersect(first, second) {
9
9
  __name(intersect, "intersect");
10
10
 
11
11
  export { intersect };
12
- //# sourceMappingURL=out.js.map
12
+ //# sourceMappingURL=intersect.mjs.map
13
13
  //# sourceMappingURL=intersect.mjs.map
@@ -1 +1 @@
1
- {"version":3,"sources":["../../../src/lib/intersect.ts"],"names":[],"mappings":";;;;;AAAA,SAAS,cAAc;AAEvB,SAAS,0BAA0B;AAuB5B,SAAS,UACf,OACA,QACgC;AAChC,QAAM,MAAM,IAAI,IAAI,mBAAmB,MAAM,CAAC;AAC9C,SAAO,OAAO,OAAO,CAAC,UAAU,IAAI,IAAI,KAAK,CAAC;AAC/C;AANgB","sourcesContent":["import { filter } from './filter';\nimport type { IterableResolvable } from './from';\nimport { toIterableIterator } from './toIterableIterator';\n\n/**\n * Creates an iterable with the elements that are in both input iterables.\n *\n * @param first An iterator to return elements from.\n * @param second An iterator that contains elements to include in the result.\n *\n * @example\n * ```typescript\n * import { intersect } from '@sapphire/iterator-utilities';\n *\n * const iterable = intersect([1, 2, 3, 4, 5], [3, 4, 5, 6, 7]);\n * console.log([...iterable]);\n * // Output: [3, 4, 5]\n * ```\n *\n * @remarks\n *\n * This function consumes the entire `second` iterator to build the set of elements to intersect with `first`.\n *\n * @seealso {@link difference} for the opposite behavior.\n */\nexport function intersect<const ElementType>(\n\tfirst: IterableResolvable<ElementType>,\n\tsecond: IterableResolvable<ElementType>\n): IterableIterator<ElementType> {\n\tconst set = new Set(toIterableIterator(second));\n\treturn filter(first, (value) => set.has(value));\n}\n"]}
1
+ {"version":3,"sources":["../../../src/lib/intersect.ts"],"names":[],"mappings":";;;;AAyBO,SAAS,SAAA,CACf,OACA,MACgC,EAAA;AAChC,EAAA,MAAM,GAAM,GAAA,IAAI,GAAI,CAAA,kBAAA,CAAmB,MAAM,CAAC,CAAA,CAAA;AAC9C,EAAA,OAAO,OAAO,KAAO,EAAA,CAAC,UAAU,GAAI,CAAA,GAAA,CAAI,KAAK,CAAC,CAAA,CAAA;AAC/C,CAAA;AANgB,MAAA,CAAA,SAAA,EAAA,WAAA,CAAA","file":"intersect.mjs","sourcesContent":["import { filter } from './filter';\nimport type { IterableResolvable } from './from';\nimport { toIterableIterator } from './toIterableIterator';\n\n/**\n * Creates an iterable with the elements that are in both input iterables.\n *\n * @param first An iterator to return elements from.\n * @param second An iterator that contains elements to include in the result.\n *\n * @example\n * ```typescript\n * import { intersect } from '@sapphire/iterator-utilities';\n *\n * const iterable = intersect([1, 2, 3, 4, 5], [3, 4, 5, 6, 7]);\n * console.log([...iterable]);\n * // Output: [3, 4, 5]\n * ```\n *\n * @remarks\n *\n * This function consumes the entire `second` iterator to build the set of elements to intersect with `first`.\n *\n * @seealso {@link difference} for the opposite behavior.\n */\nexport function intersect<const ElementType>(\n\tfirst: IterableResolvable<ElementType>,\n\tsecond: IterableResolvable<ElementType>\n): IterableIterator<ElementType> {\n\tconst set = new Set(toIterableIterator(second));\n\treturn filter(first, (value) => set.has(value));\n}\n"]}
@@ -0,0 +1,30 @@
1
+ import { IterableResolvable } from './from.mjs';
2
+
3
+ /**
4
+ * Creates a new iterator which places `separator` between adjacent items of the original iterator.
5
+ *
6
+ * @param iterable An iterator to map over.
7
+ * @param separator The separator to place between adjacent items.
8
+ *
9
+ * @example
10
+ * ```typescript
11
+ * import { intersperse } from '@sapphire/iterator-utilities';
12
+ *
13
+ * const iterable = [0, 1, 2];
14
+ * console.log([...intersperse(iterable, 100)]);
15
+ * // Output: [0, 100, 1, 100, 2]
16
+ * ```
17
+ *
18
+ * @example
19
+ * `intersperse` can be very useful to join an iterator's items using a common element:
20
+ * ```typescript
21
+ * import { intersperse } from '@sapphire/iterator-utilities';
22
+ *
23
+ * const iterable = ['Hello', 'World', '!'];
24
+ * console.log([...intersperse(iterable, ', ')].join(''));
25
+ * // Output: 'Hello, World, !'
26
+ * ```
27
+ */
28
+ declare function intersperse<const ElementType>(iterable: IterableResolvable<ElementType>, separator: ElementType): IterableIterator<ElementType>;
29
+
30
+ export { intersperse };
@@ -0,0 +1,32 @@
1
+ import { __name } from '../chunk-PAWJFY3S.mjs';
2
+ import { from } from './from.mjs';
3
+ import { makeIterableIterator } from './shared/_makeIterableIterator.mjs';
4
+
5
+ function intersperse(iterable, separator) {
6
+ let started = false;
7
+ let nextItem;
8
+ let nextItemTaken = false;
9
+ const iterator = from(iterable);
10
+ return makeIterableIterator(() => {
11
+ if (started) {
12
+ if (nextItemTaken) {
13
+ nextItemTaken = false;
14
+ return { done: false, value: nextItem };
15
+ }
16
+ const result = iterator.next();
17
+ if (result.done) {
18
+ return { done: true, value: void 0 };
19
+ }
20
+ nextItem = result.value;
21
+ nextItemTaken = true;
22
+ return { done: false, value: separator };
23
+ }
24
+ started = true;
25
+ return iterator.next();
26
+ });
27
+ }
28
+ __name(intersperse, "intersperse");
29
+
30
+ export { intersperse };
31
+ //# sourceMappingURL=intersperse.mjs.map
32
+ //# sourceMappingURL=intersperse.mjs.map
@@ -0,0 +1 @@
1
+ {"version":3,"sources":["../../../src/lib/intersperse.ts"],"names":[],"mappings":";;;;AA4BO,SAAS,WAAA,CAA+B,UAA2C,SAAuD,EAAA;AAChJ,EAAA,IAAI,OAAU,GAAA,KAAA,CAAA;AACd,EAAI,IAAA,QAAA,CAAA;AACJ,EAAA,IAAI,aAAgB,GAAA,KAAA,CAAA;AAEpB,EAAM,MAAA,QAAA,GAAW,KAAK,QAAQ,CAAA,CAAA;AAC9B,EAAA,OAAO,qBAAkC,MAAM;AAC9C,IAAA,IAAI,OAAS,EAAA;AACZ,MAAA,IAAI,aAAe,EAAA;AAClB,QAAgB,aAAA,GAAA,KAAA,CAAA;AAChB,QAAA,OAAO,EAAE,IAAA,EAAM,KAAO,EAAA,KAAA,EAAO,QAAS,EAAA,CAAA;AAAA,OACvC;AAEA,MAAM,MAAA,MAAA,GAAS,SAAS,IAAK,EAAA,CAAA;AAC7B,MAAA,IAAI,OAAO,IAAM,EAAA;AAChB,QAAA,OAAO,EAAE,IAAA,EAAM,IAAM,EAAA,KAAA,EAAO,KAAU,CAAA,EAAA,CAAA;AAAA,OACvC;AAEA,MAAA,QAAA,GAAW,MAAO,CAAA,KAAA,CAAA;AAClB,MAAgB,aAAA,GAAA,IAAA,CAAA;AAChB,MAAA,OAAO,EAAE,IAAA,EAAM,KAAO,EAAA,KAAA,EAAO,SAAU,EAAA,CAAA;AAAA,KACxC;AAEA,IAAU,OAAA,GAAA,IAAA,CAAA;AACV,IAAA,OAAO,SAAS,IAAK,EAAA,CAAA;AAAA,GACrB,CAAA,CAAA;AACF,CAAA;AA1BgB,MAAA,CAAA,WAAA,EAAA,aAAA,CAAA","file":"intersperse.mjs","sourcesContent":["import { from, type IterableResolvable } from './from';\nimport { makeIterableIterator } from './shared/_makeIterableIterator';\n\n/**\n * Creates a new iterator which places `separator` between adjacent items of the original iterator.\n *\n * @param iterable An iterator to map over.\n * @param separator The separator to place between adjacent items.\n *\n * @example\n * ```typescript\n * import { intersperse } from '@sapphire/iterator-utilities';\n *\n * const iterable = [0, 1, 2];\n * console.log([...intersperse(iterable, 100)]);\n * // Output: [0, 100, 1, 100, 2]\n * ```\n *\n * @example\n * `intersperse` can be very useful to join an iterator's items using a common element:\n * ```typescript\n * import { intersperse } from '@sapphire/iterator-utilities';\n *\n * const iterable = ['Hello', 'World', '!'];\n * console.log([...intersperse(iterable, ', ')].join(''));\n * // Output: 'Hello, World, !'\n * ```\n */\nexport function intersperse<const ElementType>(iterable: IterableResolvable<ElementType>, separator: ElementType): IterableIterator<ElementType> {\n\tlet started = false;\n\tlet nextItem: ElementType;\n\tlet nextItemTaken = false;\n\n\tconst iterator = from(iterable);\n\treturn makeIterableIterator<ElementType>(() => {\n\t\tif (started) {\n\t\t\tif (nextItemTaken) {\n\t\t\t\tnextItemTaken = false;\n\t\t\t\treturn { done: false, value: nextItem };\n\t\t\t}\n\n\t\t\tconst result = iterator.next();\n\t\t\tif (result.done) {\n\t\t\t\treturn { done: true, value: undefined };\n\t\t\t}\n\n\t\t\tnextItem = result.value;\n\t\t\tnextItemTaken = true;\n\t\t\treturn { done: false, value: separator };\n\t\t}\n\n\t\tstarted = true;\n\t\treturn iterator.next();\n\t});\n}\n"]}
@@ -1,4 +1,4 @@
1
- import { __name } from '../chunk-G5GHKT7C.mjs';
1
+ import { __name } from '../chunk-PAWJFY3S.mjs';
2
2
  import { from } from './from.mjs';
3
3
 
4
4
  function isEmpty(iterable) {
@@ -7,5 +7,5 @@ function isEmpty(iterable) {
7
7
  __name(isEmpty, "isEmpty");
8
8
 
9
9
  export { isEmpty };
10
- //# sourceMappingURL=out.js.map
10
+ //# sourceMappingURL=isEmpty.mjs.map
11
11
  //# sourceMappingURL=isEmpty.mjs.map
@@ -1 +1 @@
1
- {"version":3,"sources":["../../../src/lib/isEmpty.ts"],"names":[],"mappings":";;;;;AAAA,SAAS,YAAqC;AAuBvC,SAAS,QAA2B,UAAoD;AAC9F,SAAO,KAAK,QAAQ,EAAE,KAAK,EAAE,QAAQ;AACtC;AAFgB","sourcesContent":["import { from, type IterableResolvable } from './from';\n\n/**\n * Advances the iterable once, returning `true` if it's exhausted and `false` otherwise.\n *\n * @param iterable The iterator to check for emptiness.\n * @returns `true` if the iterator is empty; otherwise, `false`.\n *\n * @example\n * ```typescript\n * import { isEmpty } from '@sapphire/iterator-utilities';\n *\n * console.log(isEmpty([]));\n * // Output: true\n *\n * console.log(isEmpty([1, 2, 3, 4, 5]));\n * // Output: false\n * ```\n *\n * @remarks\n *\n * This function consumes the first value of the iterator.\n */\nexport function isEmpty<const ElementType>(iterable: IterableResolvable<ElementType>): boolean {\n\treturn from(iterable).next().done ?? false;\n}\n"]}
1
+ {"version":3,"sources":["../../../src/lib/isEmpty.ts"],"names":[],"mappings":";;;AAuBO,SAAS,QAA2B,QAAoD,EAAA;AAC9F,EAAA,OAAO,IAAK,CAAA,QAAQ,CAAE,CAAA,IAAA,GAAO,IAAQ,IAAA,KAAA,CAAA;AACtC,CAAA;AAFgB,MAAA,CAAA,OAAA,EAAA,SAAA,CAAA","file":"isEmpty.mjs","sourcesContent":["import { from, type IterableResolvable } from './from';\n\n/**\n * Advances the iterable once, returning `true` if it's exhausted and `false` otherwise.\n *\n * @param iterable The iterator to check for emptiness.\n * @returns `true` if the iterator is empty; otherwise, `false`.\n *\n * @example\n * ```typescript\n * import { isEmpty } from '@sapphire/iterator-utilities';\n *\n * console.log(isEmpty([]));\n * // Output: true\n *\n * console.log(isEmpty([1, 2, 3, 4, 5]));\n * // Output: false\n * ```\n *\n * @remarks\n *\n * This function consumes the first value of the iterator.\n */\nexport function isEmpty<const ElementType>(iterable: IterableResolvable<ElementType>): boolean {\n\treturn from(iterable).next().done ?? false;\n}\n"]}
@@ -0,0 +1,35 @@
1
+ import { IterableResolvable } from './from.mjs';
2
+
3
+ /**
4
+ * Checks if the elements of this iterator are sorted in ascending order.
5
+ *
6
+ * That is, for each element `a` and its following element `b`, `a <= b` must hold. If the iterator yields exactly zero
7
+ * or one element, `true` is returned.
8
+ *
9
+ * This function uses the default comparator (lexicographically), which means it will compare the elements as strings.
10
+ * If this is undesirable, use {@link isSortedBy} instead.
11
+ *
12
+ * @seealso {@link isSortedBy} for a version that allows custom comparators.
13
+ * @seealso {@link isSortedByKey} for a version that allows custom key extractors.
14
+ *
15
+ * @param iterable The iterator to compare.
16
+ *
17
+ * @example
18
+ * ```typescript
19
+ * import { isSorted } from '@sapphire/iterator-utilities';
20
+ *
21
+ * assert(isSorted([1, 2, 2, 9]);
22
+ * assert(!isSorted([1, 3, 2, 4]);
23
+ *
24
+ * assert(isSorted([0]);
25
+ * assert(isSorted([]);
26
+ * assert(isSorted([0, 1, NaN]);
27
+ * ```
28
+ *
29
+ * @remarks
30
+ *
31
+ * This function consumes the entire iterator.
32
+ */
33
+ declare function isSorted<const ElementType>(iterable: IterableResolvable<ElementType>): boolean;
34
+
35
+ export { isSorted };
@@ -0,0 +1,12 @@
1
+ import { __name } from '../chunk-PAWJFY3S.mjs';
2
+ import { isSortedBy } from './isSortedBy.mjs';
3
+ import { defaultCompare } from './shared/comparators.mjs';
4
+
5
+ function isSorted(iterable) {
6
+ return isSortedBy(iterable, defaultCompare);
7
+ }
8
+ __name(isSorted, "isSorted");
9
+
10
+ export { isSorted };
11
+ //# sourceMappingURL=isSorted.mjs.map
12
+ //# sourceMappingURL=isSorted.mjs.map
@@ -0,0 +1 @@
1
+ {"version":3,"sources":["../../../src/lib/isSorted.ts"],"names":[],"mappings":";;;;AAmCO,SAAS,SAA4B,QAAoD,EAAA;AAC/F,EAAO,OAAA,UAAA,CAAW,UAAU,cAAc,CAAA,CAAA;AAC3C,CAAA;AAFgB,MAAA,CAAA,QAAA,EAAA,UAAA,CAAA","file":"isSorted.mjs","sourcesContent":["import type { IterableResolvable } from './from';\nimport { isSortedBy } from './isSortedBy';\nimport type { isSortedByKey } from './isSortedByKey';\nimport { defaultCompare } from './shared/comparators';\n\n/**\n * Checks if the elements of this iterator are sorted in ascending order.\n *\n * That is, for each element `a` and its following element `b`, `a <= b` must hold. If the iterator yields exactly zero\n * or one element, `true` is returned.\n *\n * This function uses the default comparator (lexicographically), which means it will compare the elements as strings.\n * If this is undesirable, use {@link isSortedBy} instead.\n *\n * @seealso {@link isSortedBy} for a version that allows custom comparators.\n * @seealso {@link isSortedByKey} for a version that allows custom key extractors.\n *\n * @param iterable The iterator to compare.\n *\n * @example\n * ```typescript\n * import { isSorted } from '@sapphire/iterator-utilities';\n *\n * assert(isSorted([1, 2, 2, 9]);\n * assert(!isSorted([1, 3, 2, 4]);\n *\n * assert(isSorted([0]);\n * assert(isSorted([]);\n * assert(isSorted([0, 1, NaN]);\n * ```\n *\n * @remarks\n *\n * This function consumes the entire iterator.\n */\nexport function isSorted<const ElementType>(iterable: IterableResolvable<ElementType>): boolean {\n\treturn isSortedBy(iterable, defaultCompare);\n}\n"]}
@@ -0,0 +1,32 @@
1
+ import { IterableResolvable } from './from.mjs';
2
+ import { CompareByComparator } from './shared/_compare.mjs';
3
+
4
+ /**
5
+ * Checks if the elements of this iterator are sorted using the given comparator function.
6
+ *
7
+ * @seealso {@link isSorted} for a version that uses the default comparator.
8
+ * @seealso {@link isSortedByKey} for a version that allows custom key extractors.
9
+ *
10
+ * @param iterable The iterator to compare.
11
+ *
12
+ * @example
13
+ * ```typescript
14
+ * import { ascNumber, isSortedBy } from '@sapphire/iterator-utilities';
15
+ *
16
+ * assert(isSortedBy([1, 2, 2, 9], ascNumber));
17
+ * assert(!isSortedBy([1, 2, 2, 9], ascNumber));
18
+ *
19
+ * assert(isSortedBy([0], () => true));
20
+ * assert(isSortedBy([0], () => false));
21
+ *
22
+ * assert(isSortedBy([], () => true));
23
+ * assert(isSortedBy([], () => false));
24
+ * ```
25
+ *
26
+ * @remarks
27
+ *
28
+ * This function consumes the entire iterator.
29
+ */
30
+ declare function isSortedBy<const ElementType>(iterable: IterableResolvable<ElementType>, comparator: CompareByComparator<ElementType>): boolean;
31
+
32
+ export { isSortedBy };
@@ -0,0 +1,23 @@
1
+ import { __name } from '../chunk-PAWJFY3S.mjs';
2
+ import { assertFunction } from './shared/_assertFunction.mjs';
3
+ import { compareIteratorElements, orderingIsGreater } from './shared/_compare.mjs';
4
+ import { toIterableIterator } from './toIterableIterator.mjs';
5
+
6
+ function isSortedBy(iterable, comparator) {
7
+ comparator = assertFunction(comparator);
8
+ const iterator = toIterableIterator(iterable);
9
+ const result = iterator.next();
10
+ if (result.done) return true;
11
+ let previous = result.value;
12
+ for (const current of iterator) {
13
+ const comparison = compareIteratorElements(previous, current, comparator);
14
+ if (orderingIsGreater(comparison)) return false;
15
+ previous = current;
16
+ }
17
+ return true;
18
+ }
19
+ __name(isSortedBy, "isSortedBy");
20
+
21
+ export { isSortedBy };
22
+ //# sourceMappingURL=isSortedBy.mjs.map
23
+ //# sourceMappingURL=isSortedBy.mjs.map
@@ -0,0 +1 @@
1
+ {"version":3,"sources":["../../../src/lib/isSortedBy.ts"],"names":[],"mappings":";;;;;AAiCO,SAAS,UAAA,CAA8B,UAA2C,UAAuD,EAAA;AAC/I,EAAA,UAAA,GAAa,eAAe,UAAU,CAAA,CAAA;AAEtC,EAAM,MAAA,QAAA,GAAW,mBAAmB,QAAQ,CAAA,CAAA;AAC5C,EAAM,MAAA,MAAA,GAAS,SAAS,IAAK,EAAA,CAAA;AAC7B,EAAI,IAAA,MAAA,CAAO,MAAa,OAAA,IAAA,CAAA;AAExB,EAAA,IAAI,WAAW,MAAO,CAAA,KAAA,CAAA;AACtB,EAAA,KAAA,MAAW,WAAW,QAAU,EAAA;AAC/B,IAAA,MAAM,UAAa,GAAA,uBAAA,CAAqC,QAAU,EAAA,OAAA,EAAS,UAAU,CAAA,CAAA;AACrF,IAAI,IAAA,iBAAA,CAAkB,UAAU,CAAA,EAAU,OAAA,KAAA,CAAA;AAE1C,IAAW,QAAA,GAAA,OAAA,CAAA;AAAA,GACZ;AAEA,EAAO,OAAA,IAAA,CAAA;AACR,CAAA;AAhBgB,MAAA,CAAA,UAAA,EAAA,YAAA,CAAA","file":"isSortedBy.mjs","sourcesContent":["import type { IterableResolvable } from './from';\nimport type { isSorted } from './isSorted';\nimport type { isSortedByKey } from './isSortedByKey';\nimport { assertFunction } from './shared/_assertFunction';\nimport { compareIteratorElements, orderingIsGreater, type CompareByComparator } from './shared/_compare';\nimport { toIterableIterator } from './toIterableIterator';\n\n/**\n * Checks if the elements of this iterator are sorted using the given comparator function.\n *\n * @seealso {@link isSorted} for a version that uses the default comparator.\n * @seealso {@link isSortedByKey} for a version that allows custom key extractors.\n *\n * @param iterable The iterator to compare.\n *\n * @example\n * ```typescript\n * import { ascNumber, isSortedBy } from '@sapphire/iterator-utilities';\n *\n * assert(isSortedBy([1, 2, 2, 9], ascNumber));\n * assert(!isSortedBy([1, 2, 2, 9], ascNumber));\n *\n * assert(isSortedBy([0], () => true));\n * assert(isSortedBy([0], () => false));\n *\n * assert(isSortedBy([], () => true));\n * assert(isSortedBy([], () => false));\n * ```\n *\n * @remarks\n *\n * This function consumes the entire iterator.\n */\nexport function isSortedBy<const ElementType>(iterable: IterableResolvable<ElementType>, comparator: CompareByComparator<ElementType>): boolean {\n\tcomparator = assertFunction(comparator);\n\n\tconst iterator = toIterableIterator(iterable);\n\tconst result = iterator.next();\n\tif (result.done) return true;\n\n\tlet previous = result.value;\n\tfor (const current of iterator) {\n\t\tconst comparison = compareIteratorElements<ElementType>(previous, current, comparator);\n\t\tif (orderingIsGreater(comparison)) return false;\n\n\t\tprevious = current;\n\t}\n\n\treturn true;\n}\n"]}
@@ -0,0 +1,30 @@
1
+ import { IterableResolvable } from './from.mjs';
2
+ import { CompareByComparator } from './shared/_compare.mjs';
3
+
4
+ /**
5
+ * Checks if the elements of this iterator are sorted using the given key extraction function.
6
+ *
7
+ * Instead of comparing the iterator's elements directly, this function compares the keys of the elements, as determined
8
+ * by `callbackFn`. Apart from that, it's equivalent to {@link isSorted}; see its documentation for more information.
9
+ *
10
+ * @seealso {@link isSorted} for a version that uses the default comparator.
11
+ * @seealso {@link isSortedBy} for a version that allows custom comparators.
12
+ *
13
+ * @param iterable The iterator to compare.
14
+ * @param callbackFn The function to extract the key from an element.
15
+ *
16
+ * @example
17
+ * ```typescript
18
+ * import { isSortedByKey } from '@sapphire/iterator-utilities';
19
+ *
20
+ * assert(isSortedByKey(['c', 'bb', 'aaa'], (s) => s.length));
21
+ * assert(!isSortedBy([-2, -1, 0, 3], (n) => Math.abs(n)));
22
+ * ```
23
+ *
24
+ * @remarks
25
+ *
26
+ * This function consumes the entire iterator.
27
+ */
28
+ declare function isSortedByKey<const ElementType, const MappedType>(iterable: IterableResolvable<ElementType>, callbackFn: (a: ElementType, index: number) => MappedType, comparator?: CompareByComparator<MappedType>): boolean;
29
+
30
+ export { isSortedByKey };
@@ -0,0 +1,26 @@
1
+ import { __name } from '../chunk-PAWJFY3S.mjs';
2
+ import { assertFunction } from './shared/_assertFunction.mjs';
3
+ import { compareIteratorElements, orderingIsGreater } from './shared/_compare.mjs';
4
+ import { defaultCompare } from './shared/comparators.mjs';
5
+ import { toIterableIterator } from './toIterableIterator.mjs';
6
+
7
+ function isSortedByKey(iterable, callbackFn, comparator = defaultCompare) {
8
+ callbackFn = assertFunction(callbackFn);
9
+ const iterator = toIterableIterator(iterable);
10
+ const result = iterator.next();
11
+ if (result.done) return true;
12
+ let previousKey = callbackFn(result.value, 0);
13
+ let index = 1;
14
+ for (const current of iterator) {
15
+ const currentKey = callbackFn(current, index++);
16
+ const comparison = compareIteratorElements(previousKey, currentKey, comparator);
17
+ if (orderingIsGreater(comparison)) return false;
18
+ previousKey = currentKey;
19
+ }
20
+ return true;
21
+ }
22
+ __name(isSortedByKey, "isSortedByKey");
23
+
24
+ export { isSortedByKey };
25
+ //# sourceMappingURL=isSortedByKey.mjs.map
26
+ //# sourceMappingURL=isSortedByKey.mjs.map
@@ -0,0 +1 @@
1
+ {"version":3,"sources":["../../../src/lib/isSortedByKey.ts"],"names":[],"mappings":";;;;;;AAgCO,SAAS,aACf,CAAA,QAAA,EACA,UACA,EAAA,UAAA,GAA8C,cACpC,EAAA;AACV,EAAA,UAAA,GAAa,eAAe,UAAU,CAAA,CAAA;AAEtC,EAAM,MAAA,QAAA,GAAW,mBAAmB,QAAQ,CAAA,CAAA;AAC5C,EAAM,MAAA,MAAA,GAAS,SAAS,IAAK,EAAA,CAAA;AAC7B,EAAI,IAAA,MAAA,CAAO,MAAa,OAAA,IAAA,CAAA;AAExB,EAAA,IAAI,WAAc,GAAA,UAAA,CAAW,MAAO,CAAA,KAAA,EAAO,CAAC,CAAA,CAAA;AAC5C,EAAA,IAAI,KAAQ,GAAA,CAAA,CAAA;AACZ,EAAA,KAAA,MAAW,WAAW,QAAU,EAAA;AAC/B,IAAM,MAAA,UAAA,GAAa,UAAW,CAAA,OAAA,EAAS,KAAO,EAAA,CAAA,CAAA;AAC9C,IAAA,MAAM,UAAa,GAAA,uBAAA,CAAoC,WAAa,EAAA,UAAA,EAAY,UAAU,CAAA,CAAA;AAC1F,IAAI,IAAA,iBAAA,CAAkB,UAAU,CAAA,EAAU,OAAA,KAAA,CAAA;AAE1C,IAAc,WAAA,GAAA,UAAA,CAAA;AAAA,GACf;AAEA,EAAO,OAAA,IAAA,CAAA;AACR,CAAA;AAtBgB,MAAA,CAAA,aAAA,EAAA,eAAA,CAAA","file":"isSortedByKey.mjs","sourcesContent":["import type { IterableResolvable } from './from';\nimport type { isSorted } from './isSorted';\nimport type { isSortedBy } from './isSortedBy';\nimport { assertFunction } from './shared/_assertFunction';\nimport { compareIteratorElements, orderingIsGreater, type CompareByComparator } from './shared/_compare';\nimport { defaultCompare } from './shared/comparators';\nimport { toIterableIterator } from './toIterableIterator';\n\n/**\n * Checks if the elements of this iterator are sorted using the given key extraction function.\n *\n * Instead of comparing the iterator's elements directly, this function compares the keys of the elements, as determined\n * by `callbackFn`. Apart from that, it's equivalent to {@link isSorted}; see its documentation for more information.\n *\n * @seealso {@link isSorted} for a version that uses the default comparator.\n * @seealso {@link isSortedBy} for a version that allows custom comparators.\n *\n * @param iterable The iterator to compare.\n * @param callbackFn The function to extract the key from an element.\n *\n * @example\n * ```typescript\n * import { isSortedByKey } from '@sapphire/iterator-utilities';\n *\n * assert(isSortedByKey(['c', 'bb', 'aaa'], (s) => s.length));\n * assert(!isSortedBy([-2, -1, 0, 3], (n) => Math.abs(n)));\n * ```\n *\n * @remarks\n *\n * This function consumes the entire iterator.\n */\nexport function isSortedByKey<const ElementType, const MappedType>(\n\titerable: IterableResolvable<ElementType>,\n\tcallbackFn: (a: ElementType, index: number) => MappedType,\n\tcomparator: CompareByComparator<MappedType> = defaultCompare\n): boolean {\n\tcallbackFn = assertFunction(callbackFn);\n\n\tconst iterator = toIterableIterator(iterable);\n\tconst result = iterator.next();\n\tif (result.done) return true;\n\n\tlet previousKey = callbackFn(result.value, 0);\n\tlet index = 1;\n\tfor (const current of iterator) {\n\t\tconst currentKey = callbackFn(current, index++);\n\t\tconst comparison = compareIteratorElements<MappedType>(previousKey, currentKey, comparator);\n\t\tif (orderingIsGreater(comparison)) return false;\n\n\t\tpreviousKey = currentKey;\n\t}\n\n\treturn true;\n}\n"]}
@@ -1,4 +1,4 @@
1
- import { __name } from '../chunk-G5GHKT7C.mjs';
1
+ import { __name } from '../chunk-PAWJFY3S.mjs';
2
2
  import { toIterableIterator } from './toIterableIterator.mjs';
3
3
 
4
4
  function last(iterable) {
@@ -11,5 +11,5 @@ function last(iterable) {
11
11
  __name(last, "last");
12
12
 
13
13
  export { last };
14
- //# sourceMappingURL=out.js.map
14
+ //# sourceMappingURL=last.mjs.map
15
15
  //# sourceMappingURL=last.mjs.map
@@ -1 +1 @@
1
- {"version":3,"sources":["../../../src/lib/last.ts"],"names":["last"],"mappings":";;;;;AACA,SAAS,0BAA0B;AAqB5B,SAAS,KAAwB,UAAoE;AAC3G,MAAIA;AACJ,aAAW,SAAS,mBAAmB,QAAQ,GAAG;AACjD,IAAAA,QAAO;AAAA,EACR;AAEA,SAAOA;AACR;AAPgB","sourcesContent":["import type { IterableResolvable } from './from';\nimport { toIterableIterator } from './toIterableIterator';\n\n/**\n * Consumes the iterable until it's exhausted, returning the last element.\n *\n * @param iterable An iterator to return the last value of.\n * @returns The value at the last position in the source iterator, or `undefined` if the iterator is empty.\n *\n * @example\n * ```typescript\n * import { last } from '@sapphire/iterator-utilities';\n *\n * const iterable = [1, 2, 3, 4, 5];\n * console.log(last(iterable));\n * // Output: 5\n * ```\n *\n * @remarks\n *\n * This function consumes the entire iterator to find the last value.\n */\nexport function last<const ElementType>(iterable: IterableResolvable<ElementType>): ElementType | undefined {\n\tlet last: ElementType | undefined;\n\tfor (const value of toIterableIterator(iterable)) {\n\t\tlast = value;\n\t}\n\n\treturn last;\n}\n"]}
1
+ {"version":3,"sources":["../../../src/lib/last.ts"],"names":["last"],"mappings":";;;AAsBO,SAAS,KAAwB,QAAoE,EAAA;AAC3G,EAAIA,IAAAA,KAAAA,CAAAA;AACJ,EAAW,KAAA,MAAA,KAAA,IAAS,kBAAmB,CAAA,QAAQ,CAAG,EAAA;AACjD,IAAAA,KAAO,GAAA,KAAA,CAAA;AAAA,GACR;AAEA,EAAOA,OAAAA,KAAAA,CAAAA;AACR,CAAA;AAPgB,MAAA,CAAA,IAAA,EAAA,MAAA,CAAA","file":"last.mjs","sourcesContent":["import type { IterableResolvable } from './from';\nimport { toIterableIterator } from './toIterableIterator';\n\n/**\n * Consumes the iterable until it's exhausted, returning the last element.\n *\n * @param iterable An iterator to return the last value of.\n * @returns The value at the last position in the source iterator, or `undefined` if the iterator is empty.\n *\n * @example\n * ```typescript\n * import { last } from '@sapphire/iterator-utilities';\n *\n * const iterable = [1, 2, 3, 4, 5];\n * console.log(last(iterable));\n * // Output: 5\n * ```\n *\n * @remarks\n *\n * This function consumes the entire iterator to find the last value.\n */\nexport function last<const ElementType>(iterable: IterableResolvable<ElementType>): ElementType | undefined {\n\tlet last: ElementType | undefined;\n\tfor (const value of toIterableIterator(iterable)) {\n\t\tlast = value;\n\t}\n\n\treturn last;\n}\n"]}
@@ -0,0 +1,32 @@
1
+ import { IterableResolvable } from './from.mjs';
2
+
3
+ /**
4
+ * Determines if the elements of `iterable` are {@link LexicographicComparison lexicographically} less or equal than
5
+ * those of another.
6
+ *
7
+ * @param iterable The iterator to compare.
8
+ * @param other The iterator to compare against.
9
+ *
10
+ * @example
11
+ * ```typescript
12
+ * import { lessOrEqualThan } from '@sapphire/iterator-utilities';
13
+ *
14
+ * const x = [1, 2, 3, 4];
15
+ * const y = [1, 4, 9, 16];
16
+ * console.log(lessOrEqualThan([1], [1]));
17
+ * // Output: false
18
+ * console.log(lessOrEqualThan([1], [1, 2]));
19
+ * // Output: true
20
+ * console.log(lessOrEqualThan([1, 2], [1]));
21
+ * // Output: false
22
+ * console.log(lessOrEqualThan([1, 2], [1, 2]));
23
+ * // Output: true
24
+ * ```
25
+ *
26
+ * @remarks
27
+ *
28
+ * This function consumes the entire iterator.
29
+ */
30
+ declare function lessOrEqualThan<const ElementType>(iterable: IterableResolvable<ElementType>, other: IterableResolvable<ElementType>): boolean;
31
+
32
+ export { lessOrEqualThan as le, lessOrEqualThan };
@@ -0,0 +1,13 @@
1
+ import { __name } from '../chunk-PAWJFY3S.mjs';
2
+ import { compare } from './compare.mjs';
3
+ import { orderingIsGreater } from './shared/_compare.mjs';
4
+
5
+ function lessOrEqualThan(iterable, other) {
6
+ const result = compare(iterable, other);
7
+ return !orderingIsGreater(result);
8
+ }
9
+ __name(lessOrEqualThan, "lessOrEqualThan");
10
+
11
+ export { lessOrEqualThan as le, lessOrEqualThan };
12
+ //# sourceMappingURL=lessOrEqualThan.mjs.map
13
+ //# sourceMappingURL=lessOrEqualThan.mjs.map
@@ -0,0 +1 @@
1
+ {"version":3,"sources":["../../../src/lib/lessOrEqualThan.ts"],"names":[],"mappings":";;;;AA+BO,SAAS,eAAA,CAAmC,UAA2C,KAAiD,EAAA;AAC9I,EAAM,MAAA,MAAA,GAAS,OAAQ,CAAA,QAAA,EAAU,KAAK,CAAA,CAAA;AACtC,EAAO,OAAA,CAAC,kBAAkB,MAAM,CAAA,CAAA;AACjC,CAAA;AAHgB,MAAA,CAAA,eAAA,EAAA,iBAAA,CAAA","file":"lessOrEqualThan.mjs","sourcesContent":["import { compare } from './compare';\nimport type { IterableResolvable } from './from';\nimport { orderingIsGreater, type LexicographicComparison } from './shared/_compare';\n\n/**\n * Determines if the elements of `iterable` are {@link LexicographicComparison lexicographically} less or equal than\n * those of another.\n *\n * @param iterable The iterator to compare.\n * @param other The iterator to compare against.\n *\n * @example\n * ```typescript\n * import { lessOrEqualThan } from '@sapphire/iterator-utilities';\n *\n * const x = [1, 2, 3, 4];\n * const y = [1, 4, 9, 16];\n * console.log(lessOrEqualThan([1], [1]));\n * // Output: false\n * console.log(lessOrEqualThan([1], [1, 2]));\n * // Output: true\n * console.log(lessOrEqualThan([1, 2], [1]));\n * // Output: false\n * console.log(lessOrEqualThan([1, 2], [1, 2]));\n * // Output: true\n * ```\n *\n * @remarks\n *\n * This function consumes the entire iterator.\n */\nexport function lessOrEqualThan<const ElementType>(iterable: IterableResolvable<ElementType>, other: IterableResolvable<ElementType>): boolean {\n\tconst result = compare(iterable, other);\n\treturn !orderingIsGreater(result);\n}\n\nexport { lessOrEqualThan as le };\n"]}
@@ -0,0 +1,32 @@
1
+ import { IterableResolvable } from './from.mjs';
2
+
3
+ /**
4
+ * Determines if the elements of `iterable` are {@link LexicographicComparison lexicographically} less than those of
5
+ * another.
6
+ *
7
+ * @param iterable The iterator to compare.
8
+ * @param other The iterator to compare against.
9
+ *
10
+ * @example
11
+ * ```typescript
12
+ * import { lessThan } from '@sapphire/iterator-utilities';
13
+ *
14
+ * const x = [1, 2, 3, 4];
15
+ * const y = [1, 4, 9, 16];
16
+ * console.log(lessThan([1], [1]));
17
+ * // Output: false
18
+ * console.log(lessThan([1], [1, 2]));
19
+ * // Output: true
20
+ * console.log(lessThan([1, 2], [1]));
21
+ * // Output: false
22
+ * console.log(lessThan([1, 2], [1, 2]));
23
+ * // Output: false
24
+ * ```
25
+ *
26
+ * @remarks
27
+ *
28
+ * This function consumes the entire iterator.
29
+ */
30
+ declare function lessThan<const ElementType>(iterable: IterableResolvable<ElementType>, other: IterableResolvable<ElementType>): boolean;
31
+
32
+ export { lessThan, lessThan as lt };
@@ -0,0 +1,13 @@
1
+ import { __name } from '../chunk-PAWJFY3S.mjs';
2
+ import { compare } from './compare.mjs';
3
+ import { orderingIsLess } from './shared/_compare.mjs';
4
+
5
+ function lessThan(iterable, other) {
6
+ const result = compare(iterable, other);
7
+ return orderingIsLess(result);
8
+ }
9
+ __name(lessThan, "lessThan");
10
+
11
+ export { lessThan, lessThan as lt };
12
+ //# sourceMappingURL=lessThan.mjs.map
13
+ //# sourceMappingURL=lessThan.mjs.map
@@ -0,0 +1 @@
1
+ {"version":3,"sources":["../../../src/lib/lessThan.ts"],"names":[],"mappings":";;;;AA+BO,SAAS,QAAA,CAA4B,UAA2C,KAAiD,EAAA;AACvI,EAAM,MAAA,MAAA,GAAS,OAAQ,CAAA,QAAA,EAAU,KAAK,CAAA,CAAA;AACtC,EAAA,OAAO,eAAe,MAAM,CAAA,CAAA;AAC7B,CAAA;AAHgB,MAAA,CAAA,QAAA,EAAA,UAAA,CAAA","file":"lessThan.mjs","sourcesContent":["import { compare } from './compare';\nimport type { IterableResolvable } from './from';\nimport { orderingIsLess, type LexicographicComparison } from './shared/_compare';\n\n/**\n * Determines if the elements of `iterable` are {@link LexicographicComparison lexicographically} less than those of\n * another.\n *\n * @param iterable The iterator to compare.\n * @param other The iterator to compare against.\n *\n * @example\n * ```typescript\n * import { lessThan } from '@sapphire/iterator-utilities';\n *\n * const x = [1, 2, 3, 4];\n * const y = [1, 4, 9, 16];\n * console.log(lessThan([1], [1]));\n * // Output: false\n * console.log(lessThan([1], [1, 2]));\n * // Output: true\n * console.log(lessThan([1, 2], [1]));\n * // Output: false\n * console.log(lessThan([1, 2], [1, 2]));\n * // Output: false\n * ```\n *\n * @remarks\n *\n * This function consumes the entire iterator.\n */\nexport function lessThan<const ElementType>(iterable: IterableResolvable<ElementType>, other: IterableResolvable<ElementType>): boolean {\n\tconst result = compare(iterable, other);\n\treturn orderingIsLess(result);\n}\n\nexport { lessThan as lt };\n"]}
@@ -1,4 +1,4 @@
1
- import { __name } from '../chunk-G5GHKT7C.mjs';
1
+ import { __name } from '../chunk-PAWJFY3S.mjs';
2
2
  import { assertFunction } from './shared/_assertFunction.mjs';
3
3
  import { toIterableIterator } from './toIterableIterator.mjs';
4
4
 
@@ -12,5 +12,5 @@ function* map(iterable, callbackFn) {
12
12
  __name(map, "map");
13
13
 
14
14
  export { map };
15
- //# sourceMappingURL=out.js.map
15
+ //# sourceMappingURL=map.mjs.map
16
16
  //# sourceMappingURL=map.mjs.map
@@ -1 +1 @@
1
- {"version":3,"sources":["../../../src/lib/map.ts"],"names":[],"mappings":";;;;;AACA,SAAS,sBAAsB;AAC/B,SAAS,0BAA0B;AAiB5B,UAAU,IAChB,UACA,YAC+B;AAC/B,eAAa,eAAe,UAAU;AAEtC,MAAI,QAAQ;AACZ,aAAW,WAAW,mBAAmB,QAAQ,GAAG;AACnD,UAAM,WAAW,SAAS,OAAO;AAAA,EAClC;AACD;AAViB","sourcesContent":["import type { IterableResolvable } from './from';\nimport { assertFunction } from './shared/_assertFunction';\nimport { toIterableIterator } from './toIterableIterator';\n\n/**\n * Creates an iterable with the results of calling a provided function on each element.\n *\n * @param iterable An iterator to map over.\n * @param callbackFn A function to execute for each element produced by the iterator. Its return value is yielded by the iterator helper.\n *\n * @example\n * ```typescript\n * import { map } from '@sapphire/iterator-utilities';\n *\n * const iterable = [1, 2, 3, 4, 5];\n * console.log([...map(iterable, (value) => value * 2)]);\n * // Output: [2, 4, 6, 8, 10]\n * ```\n */\nexport function* map<const ElementType, const MappedType>(\n\titerable: IterableResolvable<ElementType>,\n\tcallbackFn: (element: ElementType, index: number) => MappedType\n): IterableIterator<MappedType> {\n\tcallbackFn = assertFunction(callbackFn);\n\n\tlet index = 0;\n\tfor (const element of toIterableIterator(iterable)) {\n\t\tyield callbackFn(element, index++);\n\t}\n}\n"]}
1
+ {"version":3,"sources":["../../../src/lib/map.ts"],"names":[],"mappings":";;;;AAmBO,UAAU,GAAA,CAChB,UACA,UAC+B,EAAA;AAC/B,EAAA,UAAA,GAAa,eAAe,UAAU,CAAA,CAAA;AAEtC,EAAA,IAAI,KAAQ,GAAA,CAAA,CAAA;AACZ,EAAW,KAAA,MAAA,OAAA,IAAW,kBAAmB,CAAA,QAAQ,CAAG,EAAA;AACnD,IAAM,MAAA,UAAA,CAAW,SAAS,KAAO,EAAA,CAAA,CAAA;AAAA,GAClC;AACD,CAAA;AAViB,MAAA,CAAA,GAAA,EAAA,KAAA,CAAA","file":"map.mjs","sourcesContent":["import type { IterableResolvable } from './from';\nimport { assertFunction } from './shared/_assertFunction';\nimport { toIterableIterator } from './toIterableIterator';\n\n/**\n * Creates an iterable with the results of calling a provided function on each element.\n *\n * @param iterable An iterator to map over.\n * @param callbackFn A function to execute for each element produced by the iterator. Its return value is yielded by the iterator helper.\n *\n * @example\n * ```typescript\n * import { map } from '@sapphire/iterator-utilities';\n *\n * const iterable = [1, 2, 3, 4, 5];\n * console.log([...map(iterable, (value) => value * 2)]);\n * // Output: [2, 4, 6, 8, 10]\n * ```\n */\nexport function* map<const ElementType, const MappedType>(\n\titerable: IterableResolvable<ElementType>,\n\tcallbackFn: (element: ElementType, index: number) => MappedType\n): IterableIterator<MappedType> {\n\tcallbackFn = assertFunction(callbackFn);\n\n\tlet index = 0;\n\tfor (const element of toIterableIterator(iterable)) {\n\t\tyield callbackFn(element, index++);\n\t}\n}\n"]}
@@ -1,8 +1,13 @@
1
1
  import { IterableResolvable } from './from.mjs';
2
- import { NumberResolvable } from './shared/_toNumberOrThrow.mjs';
3
2
 
4
3
  /**
5
- * Consumes the iterable and returns the highest number element. If the iterable is empty, or contains only non-number values, it returns `null`.
4
+ * Consumes the iterable and returns the highest number element. If the iterable is empty, it returns `null`.
5
+ *
6
+ * This function uses the default comparator (lexicographically), which means it will compare the elements as strings.
7
+ * If this is undesirable, use {@link maxBy} instead.
8
+ *
9
+ * @seealso {@link maxBy} for a version that allows custom comparators.
10
+ * @seealso {@link maxByKey} for a version that allows custom key extractors.
6
11
  *
7
12
  * @param iterable An iterator of number values to determine the maximum value of.
8
13
  * @returns The maximum value in the input iterator, or `null` if the iterator is empty or contains only non-number values.
@@ -20,6 +25,6 @@ import { NumberResolvable } from './shared/_toNumberOrThrow.mjs';
20
25
  *
21
26
  * This function consumes the entire iterator.
22
27
  */
23
- declare function max(iterable: IterableResolvable<NumberResolvable>): number | null;
28
+ declare function max<const ElementType>(iterable: IterableResolvable<ElementType>): ElementType | null;
24
29
 
25
30
  export { max };
@@ -1,17 +1,12 @@
1
- import { __name } from '../chunk-G5GHKT7C.mjs';
2
- import { map } from './map.mjs';
3
- import { toNumberOrThrow } from './shared/_toNumberOrThrow.mjs';
1
+ import { __name } from '../chunk-PAWJFY3S.mjs';
2
+ import { maxBy } from './maxBy.mjs';
3
+ import { defaultCompare } from './shared/comparators.mjs';
4
4
 
5
5
  function max(iterable) {
6
- let max2 = null;
7
- for (const value of map(iterable, toNumberOrThrow)) {
8
- if (max2 === null || value > max2)
9
- max2 = value;
10
- }
11
- return max2;
6
+ return maxBy(iterable, defaultCompare);
12
7
  }
13
8
  __name(max, "max");
14
9
 
15
10
  export { max };
16
- //# sourceMappingURL=out.js.map
11
+ //# sourceMappingURL=max.mjs.map
17
12
  //# sourceMappingURL=max.mjs.map
@@ -1 +1 @@
1
- {"version":3,"sources":["../../../src/lib/max.ts"],"names":["max"],"mappings":";;;;;AACA,SAAS,WAAW;AACpB,SAAS,uBAA8C;AAqBhD,SAAS,IAAI,UAA+D;AAClF,MAAIA,OAAqB;AACzB,aAAW,SAAS,IAAI,UAAU,eAAe,GAAG;AACnD,QAAIA,SAAQ,QAAQ,QAAQA;AAAK,MAAAA,OAAM;AAAA,EACxC;AAEA,SAAOA;AACR;AAPgB","sourcesContent":["import type { IterableResolvable } from './from';\nimport { map } from './map';\nimport { toNumberOrThrow, type NumberResolvable } from './shared/_toNumberOrThrow';\n\n/**\n * Consumes the iterable and returns the highest number element. If the iterable is empty, or contains only non-number values, it returns `null`.\n *\n * @param iterable An iterator of number values to determine the maximum value of.\n * @returns The maximum value in the input iterator, or `null` if the iterator is empty or contains only non-number values.\n *\n * @example\n * ```typescript\n * import { max } from '@sapphire/iterator-utilities';\n *\n * const iterable = [1, 2, 3, 4, 5];\n * console.log(max(iterable));\n * // Output: 5\n * ```\n *\n * @remarks\n *\n * This function consumes the entire iterator.\n */\nexport function max(iterable: IterableResolvable<NumberResolvable>): number | null {\n\tlet max: number | null = null;\n\tfor (const value of map(iterable, toNumberOrThrow)) {\n\t\tif (max === null || value > max) max = value;\n\t}\n\n\treturn max;\n}\n"]}
1
+ {"version":3,"sources":["../../../src/lib/max.ts"],"names":[],"mappings":";;;;AA8BO,SAAS,IAAuB,QAA+D,EAAA;AACrG,EAAO,OAAA,KAAA,CAAM,UAAU,cAAc,CAAA,CAAA;AACtC,CAAA;AAFgB,MAAA,CAAA,GAAA,EAAA,KAAA,CAAA","file":"max.mjs","sourcesContent":["import type { IterableResolvable } from './from';\nimport { maxBy } from './maxBy';\nimport type { maxByKey } from './maxByKey';\nimport { defaultCompare } from './shared/comparators';\n\n/**\n * Consumes the iterable and returns the highest number element. If the iterable is empty, it returns `null`.\n *\n * This function uses the default comparator (lexicographically), which means it will compare the elements as strings.\n * If this is undesirable, use {@link maxBy} instead.\n *\n * @seealso {@link maxBy} for a version that allows custom comparators.\n * @seealso {@link maxByKey} for a version that allows custom key extractors.\n *\n * @param iterable An iterator of number values to determine the maximum value of.\n * @returns The maximum value in the input iterator, or `null` if the iterator is empty or contains only non-number values.\n *\n * @example\n * ```typescript\n * import { max } from '@sapphire/iterator-utilities';\n *\n * const iterable = [1, 2, 3, 4, 5];\n * console.log(max(iterable));\n * // Output: 5\n * ```\n *\n * @remarks\n *\n * This function consumes the entire iterator.\n */\nexport function max<const ElementType>(iterable: IterableResolvable<ElementType>): ElementType | null {\n\treturn maxBy(iterable, defaultCompare);\n}\n"]}
@@ -0,0 +1,31 @@
1
+ import { IterableResolvable } from './from.mjs';
2
+ import { CompareByComparator } from './shared/_compare.mjs';
3
+
4
+ /**
5
+ * Returns the element that gives the maximum value with respect to the specified comparison function.
6
+ *
7
+ * If several elements are equally maximum, the last element is returned. If the iterator is empty, `null` is returned.
8
+ *
9
+ * @seealso {@link max} for a version that uses the default comparator.
10
+ * @seealso {@link maxByKey} for a version that allows custom key extractors.
11
+ *
12
+ * @param iterable An iterator of number values to determine the maximum value of.
13
+ * @param comparator A function to execute for each element produced by the iterator. It should return a number value.
14
+ * @returns The element that gives the maximum value from the specified function, or `null` if the iterator is empty.
15
+ *
16
+ * @example
17
+ * ```typescript
18
+ * import { ascNumber, maxBy } from '@sapphire/iterator-utilities';
19
+ *
20
+ * const iterable = [-3, 0, 1, 5, -10];
21
+ * console.log(maxBy(iterable, ascNumber));
22
+ * // Output: 5
23
+ * ```
24
+ *
25
+ * @remarks
26
+ *
27
+ * This function consumes the entire iterator.
28
+ */
29
+ declare function maxBy<const ElementType>(iterable: IterableResolvable<ElementType>, comparator: CompareByComparator<ElementType>): ElementType | null;
30
+
31
+ export { maxBy };
@@ -0,0 +1,24 @@
1
+ import { __name } from '../chunk-PAWJFY3S.mjs';
2
+ import { assertFunction } from './shared/_assertFunction.mjs';
3
+ import { compareIteratorElements, orderingIsLess } from './shared/_compare.mjs';
4
+ import { toIterableIterator } from './toIterableIterator.mjs';
5
+
6
+ function maxBy(iterable, comparator) {
7
+ comparator = assertFunction(comparator);
8
+ const iterator = toIterableIterator(iterable);
9
+ const first = iterator.next();
10
+ if (first.done) return null;
11
+ let maximum = first.value;
12
+ for (const value of iterator) {
13
+ const comparison = compareIteratorElements(value, maximum, comparator);
14
+ if (!orderingIsLess(comparison)) {
15
+ maximum = value;
16
+ }
17
+ }
18
+ return maximum;
19
+ }
20
+ __name(maxBy, "maxBy");
21
+
22
+ export { maxBy };
23
+ //# sourceMappingURL=maxBy.mjs.map
24
+ //# sourceMappingURL=maxBy.mjs.map
@@ -0,0 +1 @@
1
+ {"version":3,"sources":["../../../src/lib/maxBy.ts"],"names":[],"mappings":";;;;;AAgCO,SAAS,KAAA,CACf,UACA,UACqB,EAAA;AACrB,EAAA,UAAA,GAAa,eAAe,UAAU,CAAA,CAAA;AAEtC,EAAM,MAAA,QAAA,GAAW,mBAAmB,QAAQ,CAAA,CAAA;AAC5C,EAAM,MAAA,KAAA,GAAQ,SAAS,IAAK,EAAA,CAAA;AAC5B,EAAI,IAAA,KAAA,CAAM,MAAa,OAAA,IAAA,CAAA;AAEvB,EAAA,IAAI,UAAU,KAAM,CAAA,KAAA,CAAA;AACpB,EAAA,KAAA,MAAW,SAAS,QAAU,EAAA;AAC7B,IAAA,MAAM,UAAa,GAAA,uBAAA,CAAqC,KAAO,EAAA,OAAA,EAAS,UAAU,CAAA,CAAA;AAClF,IAAI,IAAA,CAAC,cAAe,CAAA,UAAU,CAAG,EAAA;AAChC,MAAU,OAAA,GAAA,KAAA,CAAA;AAAA,KACX;AAAA,GACD;AAEA,EAAO,OAAA,OAAA,CAAA;AACR,CAAA;AAnBgB,MAAA,CAAA,KAAA,EAAA,OAAA,CAAA","file":"maxBy.mjs","sourcesContent":["import type { IterableResolvable } from './from';\nimport type { max } from './max';\nimport type { maxByKey } from './maxByKey';\nimport { assertFunction } from './shared/_assertFunction';\nimport { compareIteratorElements, orderingIsLess, type CompareByComparator } from './shared/_compare';\nimport { toIterableIterator } from './toIterableIterator';\n\n/**\n * Returns the element that gives the maximum value with respect to the specified comparison function.\n *\n * If several elements are equally maximum, the last element is returned. If the iterator is empty, `null` is returned.\n *\n * @seealso {@link max} for a version that uses the default comparator.\n * @seealso {@link maxByKey} for a version that allows custom key extractors.\n *\n * @param iterable An iterator of number values to determine the maximum value of.\n * @param comparator A function to execute for each element produced by the iterator. It should return a number value.\n * @returns The element that gives the maximum value from the specified function, or `null` if the iterator is empty.\n *\n * @example\n * ```typescript\n * import { ascNumber, maxBy } from '@sapphire/iterator-utilities';\n *\n * const iterable = [-3, 0, 1, 5, -10];\n * console.log(maxBy(iterable, ascNumber));\n * // Output: 5\n * ```\n *\n * @remarks\n *\n * This function consumes the entire iterator.\n */\nexport function maxBy<const ElementType>(\n\titerable: IterableResolvable<ElementType>,\n\tcomparator: CompareByComparator<ElementType>\n): ElementType | null {\n\tcomparator = assertFunction(comparator);\n\n\tconst iterator = toIterableIterator(iterable);\n\tconst first = iterator.next();\n\tif (first.done) return null;\n\n\tlet maximum = first.value;\n\tfor (const value of iterator) {\n\t\tconst comparison = compareIteratorElements<ElementType>(value, maximum, comparator);\n\t\tif (!orderingIsLess(comparison)) {\n\t\t\tmaximum = value;\n\t\t}\n\t}\n\n\treturn maximum;\n}\n"]}
@@ -0,0 +1,32 @@
1
+ import { IterableResolvable } from './from.mjs';
2
+ import { CompareByComparator } from './shared/_compare.mjs';
3
+
4
+ /**
5
+ * Returns the element that gives the maximum value from the specified function.
6
+ *
7
+ * If several elements are equally maximum, the last element is returned. If the iterator is empty, `null` is returned.
8
+ *
9
+ * @seealso {@link max} for a version that uses the default comparator.
10
+ * @seealso {@link maxBy} for a version that allows custom comparators.
11
+ *
12
+ * @param iterable An iterator of number values to determine the maximum value of.
13
+ * @param callbackFn A function to execute for each element produced by the iterator, producing a key to compare with.
14
+ * @param comparator A function to execute for each element produced by the iterator. It should return a number value.
15
+ * @returns The element that gives the maximum value from the specified function, or `null` if the iterator is empty.
16
+ *
17
+ * @example
18
+ * ```typescript
19
+ * import { maxByKey } from '@sapphire/iterator-utilities';
20
+ *
21
+ * const iterable = [-3, 0, 1, 5, -10];
22
+ * console.log(maxByKey(iterable, (value) => Math.abs(value)));
23
+ * // Output: -10
24
+ * ```
25
+ *
26
+ * @remarks
27
+ *
28
+ * This function consumes the entire iterator.
29
+ */
30
+ declare function maxByKey<const ElementType, const MappedType>(iterable: IterableResolvable<ElementType>, callbackFn: (element: ElementType, index: number) => MappedType, comparator?: CompareByComparator<MappedType>): ElementType | null;
31
+
32
+ export { maxByKey };