@daiso-tech/core 0.33.0 → 0.35.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 (365) hide show
  1. package/README.md +66 -45
  2. package/dist/async/_module-exports.d.ts +1 -1
  3. package/dist/async/_module-exports.js +1 -1
  4. package/dist/async/_module-exports.js.map +1 -1
  5. package/dist/async/async.errors.d.ts +27 -19
  6. package/dist/async/async.errors.js +33 -20
  7. package/dist/async/async.errors.js.map +1 -1
  8. package/dist/async/backof-policies/_shared.d.ts +6 -2
  9. package/dist/async/backof-policies/_shared.js +1 -0
  10. package/dist/async/backof-policies/_shared.js.map +1 -1
  11. package/dist/async/backof-policies/constant-backoff-policy/constant-backoff-policy.d.ts +2 -2
  12. package/dist/async/backof-policies/constant-backoff-policy/constant-backoff-policy.js +1 -1
  13. package/dist/async/backof-policies/exponential-backoff-policy/exponential-backoff-policy.d.ts +2 -2
  14. package/dist/async/backof-policies/exponential-backoff-policy/exponential-backoff-policy.js +1 -1
  15. package/dist/async/backof-policies/linear-backoff-policy/linear-backoff-policy.d.ts +2 -2
  16. package/dist/async/backof-policies/linear-backoff-policy/linear-backoff-policy.js +1 -1
  17. package/dist/async/backof-policies/polynomial-backoff-policy/polynomial-backoff-policy.d.ts +2 -2
  18. package/dist/async/backof-policies/polynomial-backoff-policy/polynomial-backoff-policy.js +1 -1
  19. package/dist/async/middlewares/_module.d.ts +8 -0
  20. package/dist/async/middlewares/_module.js +9 -0
  21. package/dist/async/middlewares/_module.js.map +1 -0
  22. package/dist/async/middlewares/_shared.d.ts +10 -0
  23. package/dist/async/middlewares/_shared.js +5 -0
  24. package/dist/async/middlewares/_shared.js.map +1 -0
  25. package/dist/async/middlewares/bulkhead/_module.d.ts +1 -0
  26. package/dist/async/middlewares/bulkhead/_module.js +2 -0
  27. package/dist/async/middlewares/bulkhead/_module.js.map +1 -0
  28. package/dist/async/middlewares/bulkhead/bulkhead.middleware.d.ts +80 -0
  29. package/dist/async/middlewares/bulkhead/bulkhead.middleware.js +46 -0
  30. package/dist/async/middlewares/bulkhead/bulkhead.middleware.js.map +1 -0
  31. package/dist/async/middlewares/dynamic/_module.d.ts +1 -0
  32. package/dist/async/middlewares/dynamic/_module.js +2 -0
  33. package/dist/async/middlewares/dynamic/_module.js.map +1 -0
  34. package/dist/async/middlewares/dynamic/dynamic.middleware.d.ts +34 -0
  35. package/dist/async/middlewares/dynamic/dynamic.middleware.js +36 -0
  36. package/dist/async/middlewares/dynamic/dynamic.middleware.js.map +1 -0
  37. package/dist/async/middlewares/fallback/_module.d.ts +1 -0
  38. package/dist/async/middlewares/fallback/_module.js +2 -0
  39. package/dist/async/middlewares/fallback/_module.js.map +1 -0
  40. package/dist/async/middlewares/fallback/fallback.middleware.d.ts +78 -0
  41. package/dist/async/middlewares/fallback/fallback.middleware.js +52 -0
  42. package/dist/async/middlewares/fallback/fallback.middleware.js.map +1 -0
  43. package/dist/async/middlewares/hedging/_module.d.ts +2 -0
  44. package/dist/async/middlewares/hedging/_module.js +3 -0
  45. package/dist/async/middlewares/hedging/_module.js.map +1 -0
  46. package/dist/async/middlewares/hedging/_shared.d.ts +93 -0
  47. package/dist/async/middlewares/hedging/_shared.js +5 -0
  48. package/dist/async/middlewares/hedging/_shared.js.map +1 -0
  49. package/dist/async/middlewares/hedging/concurrent-hedging/_module.d.ts +1 -0
  50. package/dist/async/middlewares/hedging/concurrent-hedging/_module.js +2 -0
  51. package/dist/async/middlewares/hedging/concurrent-hedging/_module.js.map +1 -0
  52. package/dist/async/middlewares/hedging/concurrent-hedging/concurrent-hedging.middleware.d.ts +51 -0
  53. package/dist/async/middlewares/hedging/concurrent-hedging/concurrent-hedging.middleware.js +138 -0
  54. package/dist/async/middlewares/hedging/concurrent-hedging/concurrent-hedging.middleware.js.map +1 -0
  55. package/dist/async/middlewares/hedging/sequential-hedging/_module.d.ts +1 -0
  56. package/dist/async/middlewares/hedging/sequential-hedging/_module.js +2 -0
  57. package/dist/async/middlewares/hedging/sequential-hedging/_module.js.map +1 -0
  58. package/dist/async/middlewares/hedging/sequential-hedging/sequential-hedging.middleware.d.ts +51 -0
  59. package/dist/async/middlewares/hedging/sequential-hedging/sequential-hedging.middleware.js +104 -0
  60. package/dist/async/middlewares/hedging/sequential-hedging/sequential-hedging.middleware.js.map +1 -0
  61. package/dist/async/middlewares/observe/_module.d.ts +1 -0
  62. package/dist/async/middlewares/observe/_module.js +2 -0
  63. package/dist/async/middlewares/observe/_module.js.map +1 -0
  64. package/dist/async/middlewares/observe/observe.middleware.d.ts +130 -0
  65. package/dist/async/middlewares/observe/observe.middleware.js +80 -0
  66. package/dist/async/middlewares/observe/observe.middleware.js.map +1 -0
  67. package/dist/async/middlewares/retry/_module.d.ts +1 -0
  68. package/dist/async/middlewares/retry/_module.js +2 -0
  69. package/dist/async/middlewares/retry/_module.js.map +1 -0
  70. package/dist/async/middlewares/retry/retry.middleware.d.ts +117 -0
  71. package/dist/async/middlewares/retry/retry.middleware.js +82 -0
  72. package/dist/async/middlewares/retry/retry.middleware.js.map +1 -0
  73. package/dist/async/middlewares/timeout/_module.d.ts +1 -0
  74. package/dist/async/middlewares/timeout/_module.js +2 -0
  75. package/dist/async/middlewares/timeout/_module.js.map +1 -0
  76. package/dist/async/middlewares/timeout/timeout.middleware.d.ts +83 -0
  77. package/dist/async/middlewares/timeout/timeout.middleware.js +60 -0
  78. package/dist/async/middlewares/timeout/timeout.middleware.js.map +1 -0
  79. package/dist/async/utilities/_module.d.ts +3 -4
  80. package/dist/async/utilities/_module.js +3 -4
  81. package/dist/async/utilities/_module.js.map +1 -1
  82. package/dist/async/utilities/abort-and-fail/_module.d.ts +1 -0
  83. package/dist/async/utilities/abort-and-fail/_module.js +2 -0
  84. package/dist/async/utilities/abort-and-fail/_module.js.map +1 -0
  85. package/dist/async/utilities/abort-and-fail/abort-and-fail.d.ts +7 -0
  86. package/dist/async/utilities/{abort → abort-and-fail}/abort-and-fail.js +6 -6
  87. package/dist/async/utilities/abort-and-fail/abort-and-fail.js.map +1 -0
  88. package/dist/async/utilities/lazy-promise/lazy-promise.d.ts +37 -194
  89. package/dist/async/utilities/lazy-promise/lazy-promise.js +62 -359
  90. package/dist/async/utilities/lazy-promise/lazy-promise.js.map +1 -1
  91. package/dist/async/utilities/promise-queue/_module.d.ts +1 -0
  92. package/dist/async/utilities/promise-queue/_module.js +2 -0
  93. package/dist/async/utilities/promise-queue/_module.js.map +1 -0
  94. package/dist/async/utilities/promise-queue/promise-queue.d.ts +32 -0
  95. package/dist/async/utilities/promise-queue/promise-queue.js +107 -0
  96. package/dist/async/utilities/promise-queue/promise-queue.js.map +1 -0
  97. package/dist/async/utilities/timeout-and-fail/_module.d.ts +1 -0
  98. package/dist/async/utilities/timeout-and-fail/_module.js +2 -0
  99. package/dist/async/utilities/timeout-and-fail/_module.js.map +1 -0
  100. package/dist/async/utilities/timeout-and-fail/timeout-and-fail.d.ts +7 -0
  101. package/dist/async/utilities/timeout-and-fail/timeout-and-fail.js +19 -0
  102. package/dist/async/utilities/timeout-and-fail/timeout-and-fail.js.map +1 -0
  103. package/dist/cache/contracts/cache-adapter.contract.d.ts +14 -14
  104. package/dist/cache/contracts/cache-factory.contract.d.ts +3 -3
  105. package/dist/cache/contracts/cache.contract.d.ts +73 -73
  106. package/dist/cache/contracts/cache.errors.d.ts +7 -7
  107. package/dist/cache/contracts/cache.errors.js +7 -7
  108. package/dist/cache/contracts/cache.events.d.ts +54 -58
  109. package/dist/cache/contracts/cache.events.js +6 -104
  110. package/dist/cache/contracts/cache.events.js.map +1 -1
  111. package/dist/cache/contracts/database-cache-adapter.contract.d.ts +16 -16
  112. package/dist/cache/implementations/adapters/libsql-cache-adapter/libsql-cache-adapter.d.ts +3 -3
  113. package/dist/cache/implementations/adapters/libsql-cache-adapter/libsql-cache-adapter.js +2 -2
  114. package/dist/cache/implementations/adapters/memory-cache-adapter/memory-cache-adapter.d.ts +3 -9
  115. package/dist/cache/implementations/adapters/memory-cache-adapter/memory-cache-adapter.js +3 -9
  116. package/dist/cache/implementations/adapters/memory-cache-adapter/memory-cache-adapter.js.map +1 -1
  117. package/dist/cache/implementations/adapters/mongodb-cache-adapter/mongodb-cache-adapter.d.ts +4 -4
  118. package/dist/cache/implementations/adapters/mongodb-cache-adapter/mongodb-cache-adapter.js +3 -3
  119. package/dist/cache/implementations/adapters/no-op-cache-adapter/no-op-cache-adapter.d.ts +2 -2
  120. package/dist/cache/implementations/adapters/no-op-cache-adapter/no-op-cache-adapter.js +2 -2
  121. package/dist/cache/implementations/adapters/redis-cache-adapter/redis-cache-adapter.d.ts +3 -3
  122. package/dist/cache/implementations/adapters/redis-cache-adapter/redis-cache-adapter.js +2 -2
  123. package/dist/cache/implementations/adapters/sqlite-cache-adapter/sqlite-cache-adapter.d.ts +3 -3
  124. package/dist/cache/implementations/adapters/sqlite-cache-adapter/sqlite-cache-adapter.js +2 -2
  125. package/dist/cache/implementations/derivables/cache/cache.d.ts +26 -27
  126. package/dist/cache/implementations/derivables/cache/cache.js +102 -91
  127. package/dist/cache/implementations/derivables/cache/cache.js.map +1 -1
  128. package/dist/cache/implementations/derivables/cache-factory/cache-factory.d.ts +5 -4
  129. package/dist/cache/implementations/derivables/cache-factory/cache-factory.js +2 -1
  130. package/dist/cache/implementations/derivables/cache-factory/cache-factory.js.map +1 -1
  131. package/dist/cache/implementations/test-utilities/cache-adapter.test-suite.d.ts +3 -3
  132. package/dist/cache/implementations/test-utilities/cache-adapter.test-suite.js +2 -2
  133. package/dist/cache/implementations/test-utilities/cache.test-suite.d.ts +3 -3
  134. package/dist/cache/implementations/test-utilities/cache.test-suite.js +140 -149
  135. package/dist/cache/implementations/test-utilities/cache.test-suite.js.map +1 -1
  136. package/dist/cache/implementations/test-utilities/database-cache-dapter.test-suite.d.ts +3 -3
  137. package/dist/cache/implementations/test-utilities/database-cache-dapter.test-suite.js +2 -2
  138. package/dist/collection/contracts/_shared/compartor.type.d.ts +1 -1
  139. package/dist/collection/contracts/_shared/cross-join-result.type.d.ts +1 -1
  140. package/dist/collection/contracts/_shared/ensure-map.type.d.ts +1 -1
  141. package/dist/collection/contracts/_shared/ensure-record.type.d.ts +1 -1
  142. package/dist/collection/contracts/_shared/foreach.type.d.ts +2 -2
  143. package/dist/collection/contracts/_shared/map.type.d.ts +2 -2
  144. package/dist/collection/contracts/_shared/modifier.type.d.ts +2 -2
  145. package/dist/collection/contracts/_shared/predicate.type.d.ts +7 -7
  146. package/dist/collection/contracts/_shared/reduce.type.d.ts +2 -2
  147. package/dist/collection/contracts/_shared/tap.type.d.ts +2 -2
  148. package/dist/collection/contracts/_shared/transform.type.d.ts +2 -2
  149. package/dist/collection/contracts/async-collection.contract.d.ts +109 -198
  150. package/dist/collection/contracts/collection.contract.d.ts +103 -103
  151. package/dist/collection/contracts/collection.errors.d.ts +11 -11
  152. package/dist/collection/contracts/collection.errors.js +11 -11
  153. package/dist/collection/implementations/_shared.d.ts +8 -8
  154. package/dist/collection/implementations/_shared.js +8 -8
  155. package/dist/collection/implementations/async-iterable-collection/_shared/_module.d.ts +0 -4
  156. package/dist/collection/implementations/async-iterable-collection/_shared/_module.js +0 -4
  157. package/dist/collection/implementations/async-iterable-collection/_shared/_module.js.map +1 -1
  158. package/dist/collection/implementations/async-iterable-collection/_shared/async-cross-join-iterable.js +21 -19
  159. package/dist/collection/implementations/async-iterable-collection/_shared/async-cross-join-iterable.js.map +1 -1
  160. package/dist/collection/implementations/async-iterable-collection/async-iterable-collection.d.ts +15 -19
  161. package/dist/collection/implementations/async-iterable-collection/async-iterable-collection.js +15 -30
  162. package/dist/collection/implementations/async-iterable-collection/async-iterable-collection.js.map +1 -1
  163. package/dist/collection/implementations/iterable-collection/_shared/cross-join-iterable.d.ts +3 -3
  164. package/dist/collection/implementations/iterable-collection/_shared/cross-join-iterable.js +18 -20
  165. package/dist/collection/implementations/iterable-collection/_shared/cross-join-iterable.js.map +1 -1
  166. package/dist/collection/implementations/iterable-collection/iterable-collection.d.ts +11 -12
  167. package/dist/collection/implementations/iterable-collection/iterable-collection.js +11 -12
  168. package/dist/collection/implementations/iterable-collection/iterable-collection.js.map +1 -1
  169. package/dist/collection/implementations/list-collection/list-collection.d.ts +11 -11
  170. package/dist/collection/implementations/list-collection/list-collection.js +24 -30
  171. package/dist/collection/implementations/list-collection/list-collection.js.map +1 -1
  172. package/dist/event-bus/contracts/_module-exports.d.ts +0 -1
  173. package/dist/event-bus/contracts/_module-exports.js +0 -1
  174. package/dist/event-bus/contracts/_module-exports.js.map +1 -1
  175. package/dist/event-bus/contracts/event-bus-adapter.contract.d.ts +13 -8
  176. package/dist/event-bus/contracts/event-bus-factory.contract.d.ts +6 -7
  177. package/dist/event-bus/contracts/event-bus-factory.contract.js.map +1 -1
  178. package/dist/event-bus/contracts/event-bus.contract.d.ts +30 -41
  179. package/dist/event-bus/contracts/event-bus.errors.d.ts +8 -8
  180. package/dist/event-bus/contracts/event-bus.errors.js +8 -8
  181. package/dist/event-bus/implementations/adapters/memory-event-bus-adapter/memory-event-bus-adapter.d.ts +3 -3
  182. package/dist/event-bus/implementations/adapters/memory-event-bus-adapter/memory-event-bus-adapter.js +3 -3
  183. package/dist/event-bus/implementations/adapters/no-op-event-bus-adapter/no-op-event-bus-adapter.d.ts +2 -2
  184. package/dist/event-bus/implementations/adapters/no-op-event-bus-adapter/no-op-event-bus-adapter.js +2 -2
  185. package/dist/event-bus/implementations/adapters/redis-pub-sub-event-bus-adapter/redis-pub-sub-event-bus-adapter.d.ts +3 -3
  186. package/dist/event-bus/implementations/adapters/redis-pub-sub-event-bus-adapter/redis-pub-sub-event-bus-adapter.js +2 -2
  187. package/dist/event-bus/implementations/derivables/event-bus/event-bus.d.ts +15 -15
  188. package/dist/event-bus/implementations/derivables/event-bus/event-bus.js +32 -32
  189. package/dist/event-bus/implementations/derivables/event-bus/event-bus.js.map +1 -1
  190. package/dist/event-bus/implementations/derivables/event-bus-factory/event-bus-factory.d.ts +17 -10
  191. package/dist/event-bus/implementations/derivables/event-bus-factory/event-bus-factory.js +13 -6
  192. package/dist/event-bus/implementations/derivables/event-bus-factory/event-bus-factory.js.map +1 -1
  193. package/dist/event-bus/implementations/test-utilities/event-bus-adapter.test-suite.d.ts +3 -5
  194. package/dist/event-bus/implementations/test-utilities/event-bus-adapter.test-suite.js +15 -22
  195. package/dist/event-bus/implementations/test-utilities/event-bus-adapter.test-suite.js.map +1 -1
  196. package/dist/event-bus/implementations/test-utilities/event-bus.test-suite.d.ts +3 -5
  197. package/dist/event-bus/implementations/test-utilities/event-bus.test-suite.js +189 -209
  198. package/dist/event-bus/implementations/test-utilities/event-bus.test-suite.js.map +1 -1
  199. package/dist/lock/contracts/database-lock-adapter.contract.d.ts +9 -9
  200. package/dist/lock/contracts/lock-adapter.contract.d.ts +7 -7
  201. package/dist/lock/contracts/lock-provider-factory.contract.d.ts +4 -4
  202. package/dist/lock/contracts/lock-provider.contract.d.ts +14 -14
  203. package/dist/lock/contracts/lock.contract.d.ts +22 -22
  204. package/dist/lock/contracts/lock.errors.d.ts +10 -10
  205. package/dist/lock/contracts/lock.errors.js +10 -10
  206. package/dist/lock/contracts/lock.events.d.ts +45 -54
  207. package/dist/lock/contracts/lock.events.js +9 -91
  208. package/dist/lock/contracts/lock.events.js.map +1 -1
  209. package/dist/lock/implementations/adapters/libsql-lock-adapter/libsql-lock-adapter.d.ts +5 -5
  210. package/dist/lock/implementations/adapters/libsql-lock-adapter/libsql-lock-adapter.js +4 -4
  211. package/dist/lock/implementations/adapters/memory-lock-adapter/memory-lock-adapter.d.ts +3 -3
  212. package/dist/lock/implementations/adapters/memory-lock-adapter/memory-lock-adapter.js +3 -3
  213. package/dist/lock/implementations/adapters/mongodb-lock-adapter/mongodb-lock-adapter.d.ts +5 -5
  214. package/dist/lock/implementations/adapters/mongodb-lock-adapter/mongodb-lock-adapter.js +4 -4
  215. package/dist/lock/implementations/adapters/no-op-lock-adapter/no-op-lock-adapter.d.ts +2 -2
  216. package/dist/lock/implementations/adapters/no-op-lock-adapter/no-op-lock-adapter.js +2 -2
  217. package/dist/lock/implementations/adapters/redis-lock-adapter/redis-lock-adapter.d.ts +3 -3
  218. package/dist/lock/implementations/adapters/redis-lock-adapter/redis-lock-adapter.js +3 -3
  219. package/dist/lock/implementations/adapters/sqlite-lock-adapter/sqlite-lock-adapter.d.ts +5 -5
  220. package/dist/lock/implementations/adapters/sqlite-lock-adapter/sqlite-lock-adapter.js +4 -4
  221. package/dist/lock/implementations/derivables/lock-provider/lock-provider.d.ts +33 -33
  222. package/dist/lock/implementations/derivables/lock-provider/lock-provider.js +30 -30
  223. package/dist/lock/implementations/derivables/lock-provider/lock-provider.js.map +1 -1
  224. package/dist/lock/implementations/derivables/lock-provider/lock-serde-transformer.d.ts +2 -2
  225. package/dist/lock/implementations/derivables/lock-provider/lock-serde-transformer.js.map +1 -1
  226. package/dist/lock/implementations/derivables/lock-provider/lock.d.ts +3 -3
  227. package/dist/lock/implementations/derivables/lock-provider/lock.js +77 -58
  228. package/dist/lock/implementations/derivables/lock-provider/lock.js.map +1 -1
  229. package/dist/lock/implementations/derivables/lock-provider-factory/lock-provider-factory.d.ts +5 -4
  230. package/dist/lock/implementations/derivables/lock-provider-factory/lock-provider-factory.js +2 -1
  231. package/dist/lock/implementations/derivables/lock-provider-factory/lock-provider-factory.js.map +1 -1
  232. package/dist/lock/implementations/test-utilities/database-lock-adapter.test-suite.d.ts +3 -3
  233. package/dist/lock/implementations/test-utilities/database-lock-adapter.test-suite.js +2 -2
  234. package/dist/lock/implementations/test-utilities/lock-adapter.test-suite.d.ts +3 -3
  235. package/dist/lock/implementations/test-utilities/lock-adapter.test-suite.js +2 -2
  236. package/dist/lock/implementations/test-utilities/lock-provider.test-suite.d.ts +3 -3
  237. package/dist/lock/implementations/test-utilities/lock-provider.test-suite.js +214 -214
  238. package/dist/lock/implementations/test-utilities/lock-provider.test-suite.js.map +1 -1
  239. package/dist/serde/contracts/deserializer.contract.d.ts +2 -2
  240. package/dist/serde/contracts/flexible-serde-adapter.contract.d.ts +4 -4
  241. package/dist/serde/contracts/flexible-serde.contract.d.ts +8 -19
  242. package/dist/serde/contracts/serde.contract.d.ts +2 -2
  243. package/dist/serde/contracts/serde.errors.d.ts +4 -4
  244. package/dist/serde/contracts/serde.errors.js +4 -4
  245. package/dist/serde/contracts/serializable.contract.d.ts +2 -2
  246. package/dist/serde/contracts/serializer.contract.d.ts +2 -2
  247. package/dist/serde/implementations/adapters/no-op-serde-adapter/no-op-serde-adapter.d.ts +2 -2
  248. package/dist/serde/implementations/adapters/no-op-serde-adapter/no-op-serde-adapter.js +2 -2
  249. package/dist/serde/implementations/adapters/super-json-serde-adapter/super-json-serde-adapter.d.ts +1 -1
  250. package/dist/serde/implementations/adapters/super-json-serde-adapter/super-json-serde-adapter.js +1 -1
  251. package/dist/serde/implementations/derivables/serde.d.ts +4 -35
  252. package/dist/serde/implementations/derivables/serde.js +2 -47
  253. package/dist/serde/implementations/derivables/serde.js.map +1 -1
  254. package/dist/serde/implementations/test-utilities/flexible-serde-adapter.test-suite.d.ts +3 -3
  255. package/dist/serde/implementations/test-utilities/flexible-serde-adapter.test-suite.js +2 -2
  256. package/dist/serde/implementations/test-utilities/flexible-serde.test-suite.d.ts +3 -3
  257. package/dist/serde/implementations/test-utilities/flexible-serde.test-suite.js +2 -2
  258. package/dist/utilities/classes/_module.d.ts +1 -1
  259. package/dist/utilities/classes/_module.js +1 -1
  260. package/dist/utilities/classes/_module.js.map +1 -1
  261. package/dist/utilities/classes/hooks/_module.d.ts +3 -0
  262. package/dist/utilities/classes/hooks/_module.js +4 -0
  263. package/dist/utilities/classes/hooks/_module.js.map +1 -0
  264. package/dist/utilities/classes/hooks/async-hooks.d.ts +209 -0
  265. package/dist/utilities/classes/hooks/async-hooks.js +145 -0
  266. package/dist/utilities/classes/hooks/async-hooks.js.map +1 -0
  267. package/dist/utilities/classes/hooks/hooks.d.ts +139 -0
  268. package/dist/utilities/classes/hooks/hooks.js +116 -0
  269. package/dist/utilities/classes/hooks/hooks.js.map +1 -0
  270. package/dist/utilities/classes/hooks/types.d.ts +9 -0
  271. package/dist/utilities/classes/hooks/types.js +5 -0
  272. package/dist/utilities/classes/hooks/types.js.map +1 -0
  273. package/dist/utilities/classes/key-prefixer/key-prefixer.d.ts +3 -3
  274. package/dist/utilities/classes/key-prefixer/key-prefixer.js +4 -4
  275. package/dist/utilities/classes/key-prefixer/key-prefixer.js.map +1 -1
  276. package/dist/utilities/classes/time-span/time-span.d.ts +5 -5
  277. package/dist/utilities/classes/time-span/time-span.js +5 -5
  278. package/dist/utilities/contracts/_module.d.ts +0 -1
  279. package/dist/utilities/contracts/_module.js +0 -1
  280. package/dist/utilities/contracts/_module.js.map +1 -1
  281. package/dist/utilities/contracts/deinitizable.contract.d.ts +1 -1
  282. package/dist/utilities/contracts/initizable.contract.d.ts +1 -1
  283. package/dist/utilities/contracts/prunable.contract.d.ts +1 -1
  284. package/dist/utilities/contracts/serialized-error.contract.d.ts +1 -1
  285. package/dist/utilities/contracts/sqlite-database.contract.d.ts +2 -2
  286. package/dist/utilities/errors.d.ts +5 -5
  287. package/dist/utilities/errors.js +5 -5
  288. package/dist/utilities/functions/factory.js +3 -3
  289. package/dist/utilities/functions/factory.js.map +1 -1
  290. package/dist/utilities/functions/invokable.d.ts +9 -5
  291. package/dist/utilities/functions/invokable.js +12 -2
  292. package/dist/utilities/functions/invokable.js.map +1 -1
  293. package/dist/utilities/functions/lazy.d.ts +5 -0
  294. package/dist/utilities/functions/lazy.js +12 -3
  295. package/dist/utilities/functions/lazy.js.map +1 -1
  296. package/dist/utilities/types/async-iterable-value.type.d.ts +1 -1
  297. package/dist/utilities/types/at-least-one.type.d.ts +1 -1
  298. package/dist/utilities/types/factory.type.d.ts +8 -8
  299. package/dist/utilities/types/invokable.type.d.ts +3 -3
  300. package/dist/utilities/types/items.type.d.ts +1 -1
  301. package/dist/utilities/types/lazy.type.d.ts +5 -5
  302. package/dist/utilities/types/none-func.type.d.ts +1 -1
  303. package/dist/utilities/types/one-or-more.type.d.ts +1 -1
  304. package/dist/utilities/types/promiseable.type.d.ts +1 -1
  305. package/dist/utilities/types/result.type.d.ts +1 -1
  306. package/package.json +22 -2
  307. package/dist/async/async.events.d.ts +0 -105
  308. package/dist/async/async.events.js +0 -82
  309. package/dist/async/async.events.js.map +0 -1
  310. package/dist/async/utilities/abort/_module.d.ts +0 -2
  311. package/dist/async/utilities/abort/_module.js +0 -3
  312. package/dist/async/utilities/abort/_module.js.map +0 -1
  313. package/dist/async/utilities/abort/abort-and-fail.d.ts +0 -4
  314. package/dist/async/utilities/abort/abort-and-fail.js.map +0 -1
  315. package/dist/async/utilities/abort/abort.d.ts +0 -9
  316. package/dist/async/utilities/abort/abort.js +0 -18
  317. package/dist/async/utilities/abort/abort.js.map +0 -1
  318. package/dist/async/utilities/delay/_module.d.ts +0 -1
  319. package/dist/async/utilities/delay/_module.js +0 -2
  320. package/dist/async/utilities/delay/_module.js.map +0 -1
  321. package/dist/async/utilities/delay/delay.d.ts +0 -10
  322. package/dist/async/utilities/delay/delay.js +0 -34
  323. package/dist/async/utilities/delay/delay.js.map +0 -1
  324. package/dist/async/utilities/retry/_module.d.ts +0 -2
  325. package/dist/async/utilities/retry/_module.js +0 -3
  326. package/dist/async/utilities/retry/_module.js.map +0 -1
  327. package/dist/async/utilities/retry/retry-or-fail.d.ts +0 -29
  328. package/dist/async/utilities/retry/retry-or-fail.js +0 -39
  329. package/dist/async/utilities/retry/retry-or-fail.js.map +0 -1
  330. package/dist/async/utilities/retry/retry.d.ts +0 -10
  331. package/dist/async/utilities/retry/retry.js +0 -21
  332. package/dist/async/utilities/retry/retry.js.map +0 -1
  333. package/dist/async/utilities/timeout/_module.d.ts +0 -2
  334. package/dist/async/utilities/timeout/_module.js +0 -3
  335. package/dist/async/utilities/timeout/_module.js.map +0 -1
  336. package/dist/async/utilities/timeout/timeout-and-fail.d.ts +0 -5
  337. package/dist/async/utilities/timeout/timeout-and-fail.js +0 -28
  338. package/dist/async/utilities/timeout/timeout-and-fail.js.map +0 -1
  339. package/dist/async/utilities/timeout/timeout.d.ts +0 -10
  340. package/dist/async/utilities/timeout/timeout.js +0 -21
  341. package/dist/async/utilities/timeout/timeout.js.map +0 -1
  342. package/dist/collection/implementations/async-iterable-collection/_shared/async-delay-iterable.d.ts +0 -13
  343. package/dist/collection/implementations/async-iterable-collection/_shared/async-delay-iterable.js +0 -30
  344. package/dist/collection/implementations/async-iterable-collection/_shared/async-delay-iterable.js.map +0 -1
  345. package/dist/collection/implementations/async-iterable-collection/_shared/async-retry-iterable.d.ts +0 -13
  346. package/dist/collection/implementations/async-iterable-collection/_shared/async-retry-iterable.js +0 -36
  347. package/dist/collection/implementations/async-iterable-collection/_shared/async-retry-iterable.js.map +0 -1
  348. package/dist/collection/implementations/async-iterable-collection/_shared/async-take-until-abort-iterable.d.ts +0 -9
  349. package/dist/collection/implementations/async-iterable-collection/_shared/async-take-until-abort-iterable.js +0 -39
  350. package/dist/collection/implementations/async-iterable-collection/_shared/async-take-until-abort-iterable.js.map +0 -1
  351. package/dist/collection/implementations/async-iterable-collection/_shared/async-take-until-timeout-iterable.d.ts +0 -13
  352. package/dist/collection/implementations/async-iterable-collection/_shared/async-take-until-timeout-iterable.js +0 -52
  353. package/dist/collection/implementations/async-iterable-collection/_shared/async-take-until-timeout-iterable.js.map +0 -1
  354. package/dist/event-bus/contracts/_shared.d.ts +0 -12
  355. package/dist/event-bus/contracts/_shared.js +0 -15
  356. package/dist/event-bus/contracts/_shared.js.map +0 -1
  357. package/dist/utilities/classes/sync-event-bus/_module.d.ts +0 -1
  358. package/dist/utilities/classes/sync-event-bus/_module.js +0 -2
  359. package/dist/utilities/classes/sync-event-bus/_module.js.map +0 -1
  360. package/dist/utilities/classes/sync-event-bus/sync-event-bus.d.ts +0 -16
  361. package/dist/utilities/classes/sync-event-bus/sync-event-bus.js +0 -53
  362. package/dist/utilities/classes/sync-event-bus/sync-event-bus.js.map +0 -1
  363. package/dist/utilities/contracts/sync-event-bus-listenable.d.ts +0 -13
  364. package/dist/utilities/contracts/sync-event-bus-listenable.js +0 -5
  365. package/dist/utilities/contracts/sync-event-bus-listenable.js.map +0 -1
@@ -6,32 +6,32 @@ import type { ISerializable } from "../../serde/contracts/_module-exports.js";
6
6
  import type { Lazyable } from "../../utilities/_module-exports.js";
7
7
  export type Collapse<TValue> = TValue extends Array<infer TItem> | Iterable<infer TItem> | ICollection<infer TItem> ? TItem : TValue;
8
8
  /**
9
- * The <i>ICollection</i> contract offers a fluent and efficient approach to working with {@link Iterable} objects.
10
- * <i>ICollection</i> is immutable.
9
+ * The `ICollection` contract offers a fluent and efficient approach to working with {@link Iterable | `Iterable`} objects.
10
+ * `ICollection` is immutable.
11
11
  *
12
- * IMPORT_PATH: ```"@daiso-tech/core/collection/contracts"```
12
+ * IMPORT_PATH: `"@daiso-tech/core/collection/contracts"`
13
13
  * @group Contracts
14
14
  * @throws {UnexpectedCollectionError} {@link UnexpectedCollectionError}
15
15
  */
16
16
  export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TInput[]> & {
17
17
  /**
18
- * The <i>toIterator</i> method converts the collection to a new iterator.
18
+ * The `toIterator` method converts the collection to a new iterator.
19
19
  */
20
20
  toIterator(): Iterator<TInput, void>;
21
21
  /**
22
- * The <i>entries</i> returns an ICollection of key, value pairs for every entry in the collection.
22
+ * The `entries` returns an ICollection of key, value pairs for every entry in the collection.
23
23
  */
24
24
  entries(): ICollection<[number, TInput]>;
25
25
  /**
26
- * The <i>keys</i> method returns an ICollection of keys in the collection.
26
+ * The `keys` method returns an ICollection of keys in the collection.
27
27
  */
28
28
  keys(): ICollection<number>;
29
29
  /**
30
- * The <i>values</i> method returns a copy of the collection.
30
+ * The `values` method returns a copy of the collection.
31
31
  */
32
32
  values(): ICollection<TInput>;
33
33
  /**
34
- * The <i>filter</i> method filters the collection using <i>predicateFn</i>, keeping only those items that pass <i>predicateFn</i>.
34
+ * The `filter` method filters the collection using `predicateFn`, keeping only those items that pass `predicateFn`.
35
35
  * @example
36
36
  * ```ts
37
37
  * import type { ICollection } from "@daiso-tech/core";
@@ -48,7 +48,7 @@ export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TIn
48
48
  */
49
49
  filter<TOutput extends TInput>(predicateFn: PredicateInvokable<TInput, ICollection<TInput>, TOutput>): ICollection<TOutput>;
50
50
  /**
51
- * The <i>reject</i> method filters the collection using <i>predicateFn</i>, keeping only those items that not pass <i>predicateFn</i>.
51
+ * The `reject` method filters the collection using `predicateFn`, keeping only those items that not pass `predicateFn`.
52
52
  * @example
53
53
  * ```ts
54
54
  * import type { ICollection } from "@daiso-tech/core";
@@ -65,8 +65,8 @@ export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TIn
65
65
  */
66
66
  reject<TOutput extends TInput>(predicateFn: PredicateInvokable<TInput, ICollection<TInput>, TOutput>): ICollection<Exclude<TInput, TOutput>>;
67
67
  /**
68
- * The <i>map</i> method iterates through the collection and passes each item to <i>mapFn</i>.
69
- * The <i>mapFn</i> is free to modify the item and return it, thus forming a new collection of modified items.
68
+ * The `map` method iterates through the collection and passes each item to `mapFn`.
69
+ * The `mapFn` is free to modify the item and return it, thus forming a new collection of modified items.
70
70
  * @example
71
71
  * ```ts
72
72
  * import type { ICollection } from "@daiso-tech/core";
@@ -83,7 +83,7 @@ export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TIn
83
83
  */
84
84
  map<TOutput>(mapFn: Map<TInput, ICollection<TInput>, TOutput>): ICollection<TOutput>;
85
85
  /**
86
- * The <i>reduce</i> method executes <i> reduceFn </i> function on each item of the array, passing in the return value from the calculation on the preceding item.
86
+ * The `reduce` method executes ` reduceFn ` function on each item of the array, passing in the return value from the calculation on the preceding item.
87
87
  * The final result of running the reducer across all items of the array is a single value.
88
88
  * @example
89
89
  * ```ts
@@ -121,7 +121,7 @@ export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TIn
121
121
  reduce(reduceFn: Reduce<TInput, ICollection<TInput>, TInput>, initialValue: TInput): TInput;
122
122
  reduce<TOutput>(reduceFn: Reduce<TInput, ICollection<TInput>, TOutput>, initialValue: TOutput): TOutput;
123
123
  /**
124
- * The <i>join</i> method joins the collection's items with <i> separator </i>. An error will be thrown when if a none string item is encounterd.
124
+ * The `join` method joins the collection's items with ` separator `. An error will be thrown when if a none string item is encounterd.
125
125
  * @throws {TypeCollectionError}
126
126
  * @example
127
127
  * ```ts
@@ -151,7 +151,7 @@ export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TIn
151
151
  */
152
152
  join(separator?: string): Extract<TInput, string>;
153
153
  /**
154
- * The <i>collapse</i> method collapses a collection of iterables into a single, flat collection.
154
+ * The `collapse` method collapses a collection of iterables into a single, flat collection.
155
155
  * @example
156
156
  * ```ts
157
157
  * import type { ICollection } from "@daiso-tech/core";
@@ -168,8 +168,8 @@ export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TIn
168
168
  */
169
169
  collapse(): ICollection<Collapse<TInput>>;
170
170
  /**
171
- * The <i>flatMap</i> method returns a new array formed by applying <i>mapFn</i> to each item of the array, and then collapses the result by one level.
172
- * It is identical to a <i>map</i> method followed by a <i>collapse</i> method.
171
+ * The `flatMap` method returns a new array formed by applying `mapFn` to each item of the array, and then collapses the result by one level.
172
+ * It is identical to a `map` method followed by a `collapse` method.
173
173
  * @example
174
174
  * ```ts
175
175
  * import type { ICollection } from "@daiso-tech/core";
@@ -186,7 +186,7 @@ export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TIn
186
186
  */
187
187
  flatMap<TOutput>(mapFn: Map<TInput, ICollection<TInput>, Iterable<TOutput>>): ICollection<TOutput>;
188
188
  /**
189
- * The <i>change</i> method changes only the items that passes <i>predicateFn</i> using <i>mapFn</i>.
189
+ * The `change` method changes only the items that passes `predicateFn` using `mapFn`.
190
190
  * @example
191
191
  * ```ts
192
192
  * import type { ICollection } from "@daiso-tech/core";
@@ -203,7 +203,7 @@ export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TIn
203
203
  */
204
204
  change<TFilterOutput extends TInput, TMapOutput>(predicateFn: PredicateInvokable<TInput, ICollection<TInput>, TFilterOutput>, mapFn: Map<TFilterOutput, ICollection<TInput>, TMapOutput>): ICollection<TInput | TFilterOutput | TMapOutput>;
205
205
  /**
206
- * The <i>set</i> method changes a item by i>index</i> using <i>value</i>.
206
+ * The `set` method changes a item by i>index` using `value`.
207
207
  * @example
208
208
  * ```ts
209
209
  * import type { ICollection } from "@daiso-tech/core";
@@ -233,7 +233,7 @@ export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TIn
233
233
  */
234
234
  set(index: number, value: TInput | Map<TInput, ICollection<TInput>, TInput>): ICollection<TInput>;
235
235
  /**
236
- * The <i>get</i> method returns the item by index. If the item is not found null will returned.
236
+ * The `get` method returns the item by index. If the item is not found null will returned.
237
237
  * @example
238
238
  * ```ts
239
239
  * import type { ICollection } from "@daiso-tech/core";
@@ -252,7 +252,7 @@ export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TIn
252
252
  */
253
253
  get(index: number): TInput | null;
254
254
  /**
255
- * The <i>getOrFail</i> method returns the item by index. If the item is not found an error will be thrown.
255
+ * The `getOrFail` method returns the item by index. If the item is not found an error will be thrown.
256
256
  * @throws {ItemNotFoundCollectionError} {@link ItemNotFoundCollectionError}
257
257
  * @example
258
258
  * ```ts
@@ -272,7 +272,7 @@ export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TIn
272
272
  */
273
273
  getOrFail(index: number): TInput;
274
274
  /**
275
- * The <i>page</i> method returns a new collection containing the items that would be present on <i> page </i> with custom <i> pageSize </i>.
275
+ * The `page` method returns a new collection containing the items that would be present on ` page ` with custom ` pageSize `.
276
276
  * @example
277
277
  * ```ts
278
278
  * import type { ICollection } from "@daiso-tech/core";
@@ -289,7 +289,7 @@ export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TIn
289
289
  */
290
290
  page(page: number, pageSize: number): ICollection<TInput>;
291
291
  /**
292
- * The <i>sum</i> method returns the sum of all items in the collection. If the collection includes other than number items an error will be thrown.
292
+ * The `sum` method returns the sum of all items in the collection. If the collection includes other than number items an error will be thrown.
293
293
  * If the collection is empty an error will also be thrown.
294
294
  * @throws {TypeCollectionError} {@link TypeCollectionError}
295
295
  * @throws {EmptyCollectionError} {@link EmptyCollectionError}
@@ -308,7 +308,7 @@ export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TIn
308
308
  */
309
309
  sum(): Extract<TInput, number>;
310
310
  /**
311
- * The <i>average</i> method returns the average of all items in the collection. If the collection includes other than number items an error will be thrown.
311
+ * The `average` method returns the average of all items in the collection. If the collection includes other than number items an error will be thrown.
312
312
  * If the collection is empty an error will also be thrown.
313
313
  * @throws {TypeCollectionError} {@link TypeCollectionError}
314
314
  * @throws {EmptyCollectionError} {@link EmptyCollectionError}
@@ -327,7 +327,7 @@ export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TIn
327
327
  */
328
328
  average(): Extract<TInput, number>;
329
329
  /**
330
- * The <i>median</i> method returns the median of all items in the collection. If the collection includes other than number items an error will be thrown.
330
+ * The `median` method returns the median of all items in the collection. If the collection includes other than number items an error will be thrown.
331
331
  * If the collection is empty an error will also be thrown.
332
332
  * @throws {TypeCollectionError} {@link TypeCollectionError}
333
333
  * @throws {EmptyCollectionError} {@link EmptyCollectionError}
@@ -346,7 +346,7 @@ export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TIn
346
346
  */
347
347
  median(): Extract<TInput, number>;
348
348
  /**
349
- * The <i>min</i> method returns the min of all items in the collection. If the collection includes other than number items an error will be thrown.
349
+ * The `min` method returns the min of all items in the collection. If the collection includes other than number items an error will be thrown.
350
350
  * If the collection is empty an error will also be thrown.
351
351
  * @throws {TypeCollectionError} {@link TypeCollectionError}
352
352
  * @throws {EmptyCollectionError} {@link EmptyCollectionError}
@@ -365,7 +365,7 @@ export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TIn
365
365
  */
366
366
  min(): Extract<TInput, number>;
367
367
  /**
368
- * The <i>max</i> method returns the max of all items in the collection. If the collection includes other than number items an error will be thrown.
368
+ * The `max` method returns the max of all items in the collection. If the collection includes other than number items an error will be thrown.
369
369
  * If the collection is empty an error will also be thrown.
370
370
  * @throws {TypeCollectionError} {@link TypeCollectionError}
371
371
  * @throws {EmptyCollectionError} {@link EmptyCollectionError}
@@ -384,7 +384,7 @@ export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TIn
384
384
  */
385
385
  max(): Extract<TInput, number>;
386
386
  /**
387
- * The <i>percentage</i> method may be used to quickly determine the percentage of items in the collection that pass <i>predicateFn</i>.
387
+ * The `percentage` method may be used to quickly determine the percentage of items in the collection that pass `predicateFn`.
388
388
  * If the collection is empty an error will also be thrown.
389
389
  * @throws {EmptyCollectionError} {@link EmptyCollectionError}
390
390
  * @example
@@ -402,7 +402,7 @@ export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TIn
402
402
  */
403
403
  percentage(predicateFn: PredicateInvokable<TInput, ICollection<TInput>>): number;
404
404
  /**
405
- * The <i>some</i> method determines whether at least one item in the collection matches <i>predicateFn</i>.
405
+ * The `some` method determines whether at least one item in the collection matches `predicateFn`.
406
406
  * @example
407
407
  * ```ts
408
408
  * import type { ICollection } from "@daiso-tech/core";
@@ -418,7 +418,7 @@ export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TIn
418
418
  */
419
419
  some<TOutput extends TInput>(predicateFn: PredicateInvokable<TInput, ICollection<TInput>, TOutput>): boolean;
420
420
  /**
421
- * The <i>every</i> method determines whether all items in the collection matches <i>predicateFn</i>.
421
+ * The `every` method determines whether all items in the collection matches `predicateFn`.
422
422
  * @example
423
423
  * ```ts
424
424
  * import type { ICollection } from "@daiso-tech/core";
@@ -434,7 +434,7 @@ export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TIn
434
434
  */
435
435
  every<TOutput extends TInput>(predicateFn: PredicateInvokable<TInput, ICollection<TInput>, TOutput>): boolean;
436
436
  /**
437
- * The <i>take</i> method takes the first <i>limit</i> items.
437
+ * The `take` method takes the first `limit` items.
438
438
  * @example
439
439
  * ```ts
440
440
  * import type { ICollection } from "@daiso-tech/core";
@@ -465,7 +465,7 @@ export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TIn
465
465
  */
466
466
  take(limit: number): ICollection<TInput>;
467
467
  /**
468
- * The <i>takeUntil</i> method takes items until <i>predicateFn</i> returns true.
468
+ * The `takeUntil` method takes items until `predicateFn` returns true.
469
469
  * @example
470
470
  * ```ts
471
471
  * import type { ICollection } from "@daiso-tech/core";
@@ -482,7 +482,7 @@ export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TIn
482
482
  */
483
483
  takeUntil(predicateFn: PredicateInvokable<TInput, ICollection<TInput>>): ICollection<TInput>;
484
484
  /**
485
- * The <i>takeWhile</i> method takes items until <i>predicateFn</i> returns false.
485
+ * The `takeWhile` method takes items until `predicateFn` returns false.
486
486
  * @example
487
487
  * ```ts
488
488
  * import type { ICollection } from "@daiso-tech/core";
@@ -499,7 +499,7 @@ export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TIn
499
499
  */
500
500
  takeWhile(predicateFn: PredicateInvokable<TInput, ICollection<TInput>>): ICollection<TInput>;
501
501
  /**
502
- * The <i>skip</i> method skips the first <i>offset</i> items.
502
+ * The `skip` method skips the first `offset` items.
503
503
  * @example
504
504
  * ```ts
505
505
  * import type { ICollection } from "@daiso-tech/core";
@@ -516,7 +516,7 @@ export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TIn
516
516
  */
517
517
  skip(offset: number): ICollection<TInput>;
518
518
  /**
519
- * The <i>skipUntil</i> method skips items until <i>predicateFn</i> returns true.
519
+ * The `skipUntil` method skips items until `predicateFn` returns true.
520
520
  * @example
521
521
  * ```ts
522
522
  * import type { ICollection } from "@daiso-tech/core";
@@ -533,7 +533,7 @@ export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TIn
533
533
  */
534
534
  skipUntil(predicateFn: PredicateInvokable<TInput, ICollection<TInput>>): ICollection<TInput>;
535
535
  /**
536
- * The <i>skipWhile</i> method skips items until <i>predicateFn</i> returns false.
536
+ * The `skipWhile` method skips items until `predicateFn` returns false.
537
537
  * @example
538
538
  * ```ts
539
539
  * import type { ICollection } from "@daiso-tech/core";
@@ -550,7 +550,7 @@ export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TIn
550
550
  */
551
551
  skipWhile(predicateFn: PredicateInvokable<TInput, ICollection<TInput>>): ICollection<TInput>;
552
552
  /**
553
- * The <i>when</i> method will execute <i>callback</i> when <i>condition</i> evaluates to true.
553
+ * The `when` method will execute `callback` when `condition` evaluates to true.
554
554
  * @example
555
555
  * ```ts
556
556
  * import type { ICollection } from "@daiso-tech/core";
@@ -568,7 +568,7 @@ export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TIn
568
568
  */
569
569
  when<TExtended = TInput>(condition: boolean, callback: Modifier<ICollection<TInput>, ICollection<TExtended>>): ICollection<TInput | TExtended>;
570
570
  /**
571
- * The <i>whenEmpty</i> method will execute <i>callback</i> when the collection is empty.
571
+ * The `whenEmpty` method will execute `callback` when the collection is empty.
572
572
  * @example
573
573
  * ```ts
574
574
  * import type { ICollection } from "@daiso-tech/core";
@@ -598,7 +598,7 @@ export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TIn
598
598
  */
599
599
  whenEmpty<TExtended = TInput>(callback: Modifier<ICollection<TInput>, ICollection<TExtended>>): ICollection<TInput | TExtended>;
600
600
  /**
601
- * The <i>whenNot</i> method will execute <i>callback</i> when <i>condition</i> evaluates to false.
601
+ * The `whenNot` method will execute `callback` when `condition` evaluates to false.
602
602
  * @example
603
603
  * ```ts
604
604
  * import type { ICollection } from "@daiso-tech/core";
@@ -615,7 +615,7 @@ export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TIn
615
615
  */
616
616
  whenNot<TExtended = TInput>(condition: boolean, callback: Modifier<ICollection<TInput>, ICollection<TExtended>>): ICollection<TInput | TExtended>;
617
617
  /**
618
- * The <i>whenNotEmpty</i> method will execute <i>callback</i> when the collection is not empty.
618
+ * The `whenNotEmpty` method will execute `callback` when the collection is not empty.
619
619
  * @example
620
620
  * ```ts
621
621
  * import type { ICollection } from "@daiso-tech/core";
@@ -644,7 +644,7 @@ export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TIn
644
644
  */
645
645
  whenNotEmpty<TExtended = TInput>(callback: Modifier<ICollection<TInput>, ICollection<TExtended>>): ICollection<TInput | TExtended>;
646
646
  /**
647
- * The <i>pipe</i> method passes the orignal collection to <i>callback</i> and returns the result from <i>callback</i>.
647
+ * The `pipe` method passes the orignal collection to `callback` and returns the result from `callback`.
648
648
  * This method is useful when you want compose multiple smaller functions.
649
649
  * @example
650
650
  * ```ts
@@ -674,7 +674,7 @@ export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TIn
674
674
  */
675
675
  pipe<TOutput = TInput>(callback: Transform<ICollection<TInput>, TOutput>): TOutput;
676
676
  /**
677
- * The <i>tap</i> method passes a copy of the original collection to <i>callback</i>, allowing you to do something with the items while not affecting the original collection.
677
+ * The `tap` method passes a copy of the original collection to `callback`, allowing you to do something with the items while not affecting the original collection.
678
678
  * @example
679
679
  * ```ts
680
680
  * import type { ICollection } from "@daiso-tech/core";
@@ -694,8 +694,8 @@ export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TIn
694
694
  */
695
695
  tap(callback: Tap<ICollection<TInput>>): ICollection<TInput>;
696
696
  /**
697
- * The <i>chunk</i> method breaks the collection into multiple, smaller collections of size <i>chunkSize</i>.
698
- * If <i>chunkSize</i> is not divisible with total number of items then the last chunk will contain the remaining items.
697
+ * The `chunk` method breaks the collection into multiple, smaller collections of size `chunkSize`.
698
+ * If `chunkSize` is not divisible with total number of items then the last chunk will contain the remaining items.
699
699
  * @example
700
700
  * ```ts
701
701
  * import type { ICollection } from "@daiso-tech/core";
@@ -711,8 +711,8 @@ export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TIn
711
711
  */
712
712
  chunk(chunkSize: number): ICollection<ICollection<TInput>>;
713
713
  /**
714
- * The <i>chunkWhile</i> method breaks the collection into multiple, smaller collections based on the evaluation of <i>predicateFn</i>.
715
- * The chunk variable passed to the <i>predicateFn</i> may be used to inspect the previous item.
714
+ * The `chunkWhile` method breaks the collection into multiple, smaller collections based on the evaluation of `predicateFn`.
715
+ * The chunk variable passed to the `predicateFn` may be used to inspect the previous item.
716
716
  * @example
717
717
  * ```ts
718
718
  * import type { ICollection } from "@daiso-tech/core";
@@ -732,7 +732,7 @@ export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TIn
732
732
  */
733
733
  chunkWhile(predicateFn: PredicateInvokable<TInput, ICollection<TInput>>): ICollection<ICollection<TInput>>;
734
734
  /**
735
- * The <i>split</i> method breaks a collection evenly into <i>chunkAmount</i> of chunks.
735
+ * The `split` method breaks a collection evenly into `chunkAmount` of chunks.
736
736
  * @example
737
737
  * ```ts
738
738
  * import type { ICollection } from "@daiso-tech/core";
@@ -778,7 +778,7 @@ export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TIn
778
778
  */
779
779
  split(chunkAmount: number): ICollection<ICollection<TInput>>;
780
780
  /**
781
- * The <i>partition</i> method is used to separate items that pass <i>predicateFn</i> from those that do not.
781
+ * The `partition` method is used to separate items that pass `predicateFn` from those that do not.
782
782
  * @example
783
783
  * ```ts
784
784
  * import type { ICollection } from "@daiso-tech/core";
@@ -796,7 +796,7 @@ export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TIn
796
796
  */
797
797
  partition(predicateFn: PredicateInvokable<TInput, ICollection<TInput>>): ICollection<ICollection<TInput>>;
798
798
  /**
799
- * The <i>sliding</i> method returns a new collection of chunks representing a "sliding window" view of the items in the collection.
799
+ * The `sliding` method returns a new collection of chunks representing a "sliding window" view of the items in the collection.
800
800
  * @example
801
801
  * ```ts
802
802
  * import type { ICollection } from "@daiso-tech/core";
@@ -814,7 +814,7 @@ export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TIn
814
814
  */
815
815
  sliding(chunkSize: number, step?: number): ICollection<ICollection<TInput>>;
816
816
  /**
817
- * The <i>groupBy</i> method groups the collection's items by <i> selectFn </i>.
817
+ * The `groupBy` method groups the collection's items by ` selectFn `.
818
818
  * By default the equality check occurs on the item.
819
819
  * @example
820
820
  * ```ts
@@ -869,7 +869,7 @@ export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TIn
869
869
  */
870
870
  groupBy<TOutput = TInput>(selectFn?: Map<TInput, ICollection<TInput>, TOutput>): ICollection<[TOutput, ICollection<TInput>]>;
871
871
  /**
872
- * The <i>countBy</i> method counts the occurrences of values in the collection by <i> selectFn </i>.
872
+ * The `countBy` method counts the occurrences of values in the collection by ` selectFn `.
873
873
  * By default the equality check occurs on the item.
874
874
  * @example
875
875
  * ```ts
@@ -908,7 +908,7 @@ export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TIn
908
908
  */
909
909
  countBy<TOutput = TInput>(selectFn?: Map<TInput, ICollection<TInput>, TOutput>): ICollection<[TOutput, number]>;
910
910
  /**
911
- * The <i>unique</i> method removes all duplicate values from the collection by <i> selectFn </i>.
911
+ * The `unique` method removes all duplicate values from the collection by ` selectFn `.
912
912
  * By default the equality check occurs on the item.
913
913
  * @example
914
914
  * ```ts
@@ -954,7 +954,7 @@ export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TIn
954
954
  */
955
955
  unique<TOutput = TInput>(selectFn?: Map<TInput, ICollection<TInput>, TOutput>): ICollection<TInput>;
956
956
  /**
957
- * The <i>difference</i> method will return the values in the original collection that are not present in <i>iterable</i>.
957
+ * The `difference` method will return the values in the original collection that are not present in `iterable`.
958
958
  * By default the equality check occurs on the item.
959
959
  * @example
960
960
  * ```ts
@@ -1006,7 +1006,7 @@ export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TIn
1006
1006
  */
1007
1007
  difference<TOutput = TInput>(iterable: Iterable<TInput>, selectFn?: Map<TInput, ICollection<TInput>, TOutput>): ICollection<TInput>;
1008
1008
  /**
1009
- * The <i>repeat</i> method will repeat the original collection <i>amount</i> times.
1009
+ * The `repeat` method will repeat the original collection `amount` times.
1010
1010
  * @example
1011
1011
  * ```ts
1012
1012
  * import type { ICollection } from "@daiso-tech/core";
@@ -1023,7 +1023,7 @@ export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TIn
1023
1023
  */
1024
1024
  repeat(amount: number): ICollection<TInput>;
1025
1025
  /**
1026
- * The <i>padStart</i> method pads this collection with <i>fillItems</i> until the resulting collection size reaches <i>maxLength</i>.
1026
+ * The `padStart` method pads this collection with `fillItems` until the resulting collection size reaches `maxLength`.
1027
1027
  * The padding is applied from the start of this collection.
1028
1028
  * @example
1029
1029
  * ```ts
@@ -1071,7 +1071,7 @@ export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TIn
1071
1071
  */
1072
1072
  padStart<TExtended = TInput>(maxLength: number, fillItems: Iterable<TExtended>): ICollection<TInput | TExtended>;
1073
1073
  /**
1074
- * The <i>padEnd</i> method pads this collection with <i>fillItems</i> until the resulting collection size reaches <i>maxLength</i>.
1074
+ * The `padEnd` method pads this collection with `fillItems` until the resulting collection size reaches `maxLength`.
1075
1075
  * The padding is applied from the end of this collection.
1076
1076
  * @example
1077
1077
  * ```ts
@@ -1129,8 +1129,8 @@ export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TIn
1129
1129
  */
1130
1130
  padEnd<TExtended = TInput>(maxLength: number, fillItems: Iterable<TExtended>): ICollection<TInput | TExtended>;
1131
1131
  /**
1132
- * The <i>slice</i> method creates porition of the original collection selected from <i>start</i> and <i>end</i>
1133
- * where <i>start</i> and <i>end</i> (end not included) represent the index of items in the collection.
1132
+ * The `slice` method creates porition of the original collection selected from `start` and `end`
1133
+ * where `start` and `end` (end not included) represent the index of items in the collection.
1134
1134
  * @example
1135
1135
  * ```ts
1136
1136
  * import type { ICollection } from "@daiso-tech/core";
@@ -1212,7 +1212,7 @@ export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TIn
1212
1212
  */
1213
1213
  slice(start?: number, end?: number): ICollection<TInput>;
1214
1214
  /**
1215
- * The <i>prepend</i> method adds <i>iterable</i> to the beginning of the collection.
1215
+ * The `prepend` method adds `iterable` to the beginning of the collection.
1216
1216
  * @example
1217
1217
  * ```ts
1218
1218
  * import type { ICollection } from "@daiso-tech/core";
@@ -1229,7 +1229,7 @@ export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TIn
1229
1229
  */
1230
1230
  prepend<TExtended = TInput>(iterable: Iterable<TInput | TExtended>): ICollection<TInput | TExtended>;
1231
1231
  /**
1232
- * The <i>append</i> method adds <i>iterable</i> to the end of the collection.
1232
+ * The `append` method adds `iterable` to the end of the collection.
1233
1233
  * @example
1234
1234
  * ```ts
1235
1235
  * import type { ICollection } from "@daiso-tech/core";
@@ -1246,7 +1246,7 @@ export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TIn
1246
1246
  */
1247
1247
  append<TExtended = TInput>(iterable: Iterable<TInput | TExtended>): ICollection<TInput | TExtended>;
1248
1248
  /**
1249
- * The <i>insertBefore</i> method adds <i>iterable</i> before the first item that matches <i>predicateFn</i>.
1249
+ * The `insertBefore` method adds `iterable` before the first item that matches `predicateFn`.
1250
1250
  * @example
1251
1251
  * ```ts
1252
1252
  * import type { ICollection } from "@daiso-tech/core";
@@ -1263,7 +1263,7 @@ export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TIn
1263
1263
  */
1264
1264
  insertBefore<TExtended = TInput>(predicateFn: PredicateInvokable<TInput, ICollection<TInput>>, iterable: Iterable<TInput | TExtended>): ICollection<TInput | TExtended>;
1265
1265
  /**
1266
- * The <i>insertAfter</i> method adds <i>iterable</i> after the first item that matches <i>predicateFn</i>.
1266
+ * The `insertAfter` method adds `iterable` after the first item that matches `predicateFn`.
1267
1267
  * @example
1268
1268
  * ```ts
1269
1269
  * import type { ICollection } from "@daiso-tech/core";
@@ -1280,7 +1280,7 @@ export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TIn
1280
1280
  */
1281
1281
  insertAfter<TExtended = TInput>(predicateFn: PredicateInvokable<TInput, ICollection<TInput>>, iterable: Iterable<TInput | TExtended>): ICollection<TInput | TExtended>;
1282
1282
  /**
1283
- * The <i>crossJoin</i> method cross joins the collection's values among <i>iterables</i>, returning a Cartesian product with all possible permutations.
1283
+ * The `crossJoin` method cross joins the collection's values among `iterables`, returning a Cartesian product with all possible permutations.
1284
1284
  * @example
1285
1285
  * ```ts
1286
1286
  * import type { ICollection } from "@daiso-tech/core";
@@ -1325,7 +1325,7 @@ export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TIn
1325
1325
  */
1326
1326
  crossJoin<TExtended>(iterable: Iterable<TExtended>): ICollection<CrossJoinResult<TInput, TExtended>>;
1327
1327
  /**
1328
- * The <i>zip</i> method merges together the values of <i>iterable</i> with the values of the collection at their corresponding index.
1328
+ * The `zip` method merges together the values of `iterable` with the values of the collection at their corresponding index.
1329
1329
  * The returned collection has size of the shortest collection.
1330
1330
  * @example
1331
1331
  * ```ts
@@ -1369,7 +1369,7 @@ export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TIn
1369
1369
  */
1370
1370
  zip<TExtended>(iterable: Iterable<TExtended>): ICollection<[TInput, TExtended]>;
1371
1371
  /**
1372
- * The <i>sort</i> method sorts the collection. You can provide a <i>comparator</i> function.
1372
+ * The `sort` method sorts the collection. You can provide a `comparator` function.
1373
1373
  * @example
1374
1374
  * ```ts
1375
1375
  * import type { ICollection } from "@daiso-tech/core";
@@ -1414,8 +1414,8 @@ export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TIn
1414
1414
  */
1415
1415
  sort(comparator?: Comparator<TInput>): ICollection<TInput>;
1416
1416
  /**
1417
- * The <i>reverse</i> method will reverse the order of the collection.
1418
- * The reversing of the collection will be applied in chunks that are the size of <i> chunkSize </i>.
1417
+ * The `reverse` method will reverse the order of the collection.
1418
+ * The reversing of the collection will be applied in chunks that are the size of ` chunkSize `.
1419
1419
  * @example
1420
1420
  * ```ts
1421
1421
  * import type { ICollection } from "@daiso-tech/core";
@@ -1432,12 +1432,12 @@ export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TIn
1432
1432
  */
1433
1433
  reverse(chunkSize?: number): ICollection<TInput>;
1434
1434
  /**
1435
- * The <i>shuffle</i> method randomly shuffles the items in the collection. You can provide a custom Math.random function by passing in <i>mathRandom</i>.
1435
+ * The `shuffle` method randomly shuffles the items in the collection. You can provide a custom Math.random function by passing in `mathRandom`.
1436
1436
  */
1437
1437
  shuffle(mathRandom?: () => number): ICollection<TInput>;
1438
1438
  /**
1439
- * The <i>first</i> method returns the first item in the collection that passes <i> predicateFn </i>.
1440
- * By default it will get the first item. If the collection is empty or no items passes <i> predicateFn </i> than null i returned.
1439
+ * The `first` method returns the first item in the collection that passes ` predicateFn `.
1440
+ * By default it will get the first item. If the collection is empty or no items passes ` predicateFn ` than null i returned.
1441
1441
  * @example
1442
1442
  * ```ts
1443
1443
  * import type { ICollection } from "@daiso-tech/core";
@@ -1478,8 +1478,8 @@ export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TIn
1478
1478
  */
1479
1479
  first<TOutput extends TInput>(predicateFn?: PredicateInvokable<TInput, ICollection<TInput>, TOutput>): TOutput | null;
1480
1480
  /**
1481
- * The <i>firstOr</i> method returns the first item in the collection that passes <i> predicateFn </i>
1482
- * By default it will get the first item. If the collection is empty or no items passes <i> predicateFn </i> than <i> defaultValue </i>.
1481
+ * The `firstOr` method returns the first item in the collection that passes ` predicateFn `
1482
+ * By default it will get the first item. If the collection is empty or no items passes ` predicateFn ` than ` defaultValue `.
1483
1483
  * @example
1484
1484
  * ```ts
1485
1485
  * import type { ICollection } from "@daiso-tech/core";
@@ -1531,8 +1531,8 @@ export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TIn
1531
1531
  */
1532
1532
  firstOr<TOutput extends TInput, TExtended = TInput>(defaultValue: Lazyable<TExtended>, predicateFn?: PredicateInvokable<TInput, ICollection<TInput>, TOutput>): TOutput | TExtended;
1533
1533
  /**
1534
- * The <i>firstOrFail</i> method returns the first item in the collection that passes <i> predicateFn </i>.
1535
- * By default it will get the first item. If the collection is empty or no items passes <i> predicateFn </i> than error is thrown.
1534
+ * The `firstOrFail` method returns the first item in the collection that passes ` predicateFn `.
1535
+ * By default it will get the first item. If the collection is empty or no items passes ` predicateFn ` than error is thrown.
1536
1536
  * @throws {ItemNotFoundCollectionError} {@link ItemNotFoundCollectionError}
1537
1537
  * @example
1538
1538
  * ```ts
@@ -1573,8 +1573,8 @@ export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TIn
1573
1573
  */
1574
1574
  firstOrFail<TOutput extends TInput>(predicateFn?: PredicateInvokable<TInput, ICollection<TInput>, TOutput>): TOutput;
1575
1575
  /**
1576
- * The <i>last</i> method returns the last item in the collection that passes <i> predicateFn </i>.
1577
- * By default it will get the last item. If the collection is empty or no items passes <i> predicateFn </i> than null i returned.
1576
+ * The `last` method returns the last item in the collection that passes ` predicateFn `.
1577
+ * By default it will get the last item. If the collection is empty or no items passes ` predicateFn ` than null i returned.
1578
1578
  * @example
1579
1579
  * ```ts
1580
1580
  * import type { ICollection } from "@daiso-tech/core";
@@ -1614,8 +1614,8 @@ export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TIn
1614
1614
  */
1615
1615
  last<TOutput extends TInput>(predicateFn?: PredicateInvokable<TInput, ICollection<TInput>, TOutput>): TOutput | null;
1616
1616
  /**
1617
- * The <i>lastOr</i> method returns the last item in the collection that passes <i> predicateFn </i>.
1618
- * By default it will get the last item. If the collection is empty or no items passes <i> predicateFn </i> than <i> defaultValue </i>.
1617
+ * The `lastOr` method returns the last item in the collection that passes ` predicateFn `.
1618
+ * By default it will get the last item. If the collection is empty or no items passes ` predicateFn ` than ` defaultValue `.
1619
1619
  * @example
1620
1620
  * ```ts
1621
1621
  * import type { ICollection } from "@daiso-tech/core";
@@ -1667,8 +1667,8 @@ export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TIn
1667
1667
  */
1668
1668
  lastOr<TOutput extends TInput, TExtended = TInput>(defaultValue: Lazyable<TExtended>, predicateFn?: PredicateInvokable<TInput, ICollection<TInput>, TOutput>): TOutput | TExtended;
1669
1669
  /**
1670
- * The <i>lastOrFail</i> method returns the last item in the collection that passes <i> predicateFn </i>.
1671
- * By default it will get the last item. If the collection is empty or no items passes <i> predicateFn </i> than error is thrown.
1670
+ * The `lastOrFail` method returns the last item in the collection that passes ` predicateFn `.
1671
+ * By default it will get the last item. If the collection is empty or no items passes ` predicateFn ` than error is thrown.
1672
1672
  * @throws {ItemNotFoundCollectionError} {@link ItemNotFoundCollectionError}
1673
1673
  * @example
1674
1674
  * ```ts
@@ -1709,8 +1709,8 @@ export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TIn
1709
1709
  */
1710
1710
  lastOrFail<TOutput extends TInput>(predicateFn?: PredicateInvokable<TInput, ICollection<TInput>, TOutput>): TOutput;
1711
1711
  /**
1712
- * The <i>before</i> method returns the item that comes before the first item that matches <i>predicateFn</i>.
1713
- * If the <i>predicateFn</i> does not match or matches the first item then null is returned.
1712
+ * The `before` method returns the item that comes before the first item that matches `predicateFn`.
1713
+ * If the `predicateFn` does not match or matches the first item then null is returned.
1714
1714
  * @example
1715
1715
  * ```ts
1716
1716
  * import type { ICollection } from "@daiso-tech/core";
@@ -1738,8 +1738,8 @@ export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TIn
1738
1738
  */
1739
1739
  before(predicateFn: PredicateInvokable<TInput, ICollection<TInput>>): TInput | null;
1740
1740
  /**
1741
- * The <i>beforeOr</i> method returns the item that comes before the first item that matches <i>predicateFn</i>.
1742
- * If the collection is empty or the <i>predicateFn</i> does not match or matches the first item then <i>defaultValue</i> is returned.
1741
+ * The `beforeOr` method returns the item that comes before the first item that matches `predicateFn`.
1742
+ * If the collection is empty or the `predicateFn` does not match or matches the first item then `defaultValue` is returned.
1743
1743
  * @example
1744
1744
  * ```ts
1745
1745
  * import type { ICollection } from "@daiso-tech/core";
@@ -1779,8 +1779,8 @@ export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TIn
1779
1779
  */
1780
1780
  beforeOr<TExtended = TInput>(defaultValue: Lazyable<TExtended>, predicateFn: PredicateInvokable<TInput, ICollection<TInput>>): TInput | TExtended;
1781
1781
  /**
1782
- * The <i>beforeOrFail</i> method returns the item that comes before the first item that matches <i>predicateFn</i>.
1783
- * If the collection is empty or the <i>predicateFn</i> does not match or matches the first item then an error is thrown.
1782
+ * The `beforeOrFail` method returns the item that comes before the first item that matches `predicateFn`.
1783
+ * If the collection is empty or the `predicateFn` does not match or matches the first item then an error is thrown.
1784
1784
  * @throws {ItemNotFoundCollectionError} {@link ItemNotFoundCollectionError}
1785
1785
  * @example
1786
1786
  * ```ts
@@ -1809,8 +1809,8 @@ export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TIn
1809
1809
  */
1810
1810
  beforeOrFail(predicateFn: PredicateInvokable<TInput, ICollection<TInput>>): TInput;
1811
1811
  /**
1812
- * The <i>after</i> method returns the item that comes after the first item that matches <i>predicateFn</i>.
1813
- * If the collection is empty or the <i>predicateFn</i> does not match or matches the last item then null is returned.
1812
+ * The `after` method returns the item that comes after the first item that matches `predicateFn`.
1813
+ * If the collection is empty or the `predicateFn` does not match or matches the last item then null is returned.
1814
1814
  * @example
1815
1815
  * ```ts
1816
1816
  * import type { ICollection } from "@daiso-tech/core";
@@ -1838,8 +1838,8 @@ export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TIn
1838
1838
  */
1839
1839
  after(predicateFn: PredicateInvokable<TInput, ICollection<TInput>>): TInput | null;
1840
1840
  /**
1841
- * The <i>afterOr</i> method returns the item that comes after the first item that matches <i>predicateFn</i>.
1842
- * If the collection is empty or the <i>predicateFn</i> does not match or matches the last item then <i>defaultValue</i> is returned.
1841
+ * The `afterOr` method returns the item that comes after the first item that matches `predicateFn`.
1842
+ * If the collection is empty or the `predicateFn` does not match or matches the last item then `defaultValue` is returned.
1843
1843
  * @example
1844
1844
  * ```ts
1845
1845
  * import type { ICollection } from "@daiso-tech/core";
@@ -1879,8 +1879,8 @@ export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TIn
1879
1879
  */
1880
1880
  afterOr<TExtended = TInput>(defaultValue: Lazyable<TExtended>, predicateFn: PredicateInvokable<TInput, ICollection<TInput>>): TInput | TExtended;
1881
1881
  /**
1882
- * The <i>afterOrFail</i> method returns the item that comes after the first item that matches <i>predicateFn</i>.
1883
- * If the collection is empty or the <i>predicateFn</i> does not match or matches the last item then an error is thrown.
1882
+ * The `afterOrFail` method returns the item that comes after the first item that matches `predicateFn`.
1883
+ * If the collection is empty or the `predicateFn` does not match or matches the last item then an error is thrown.
1884
1884
  * @throws {ItemNotFoundCollectionError} {@link ItemNotFoundCollectionError}
1885
1885
  * @example
1886
1886
  * ```ts
@@ -1909,7 +1909,7 @@ export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TIn
1909
1909
  */
1910
1910
  afterOrFail(predicateFn: PredicateInvokable<TInput, ICollection<TInput>>): TInput;
1911
1911
  /**
1912
- * The <i>sole</i> method returns the first item in the collection that passes <i>predicateFn</i>, but only if <i>predicateFn</i> matches exactly one item.
1912
+ * The `sole` method returns the first item in the collection that passes `predicateFn`, but only if `predicateFn` matches exactly one item.
1913
1913
  * If no items matches or multiple items are found an error will be thrown.
1914
1914
  * @throws {ItemNotFoundCollectionError} {@link ItemNotFoundCollectionError}
1915
1915
  * @throws {MultipleItemsFoundCollectionError} {@link MultipleItemsFoundCollectionError}
@@ -1952,7 +1952,7 @@ export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TIn
1952
1952
  */
1953
1953
  sole<TOutput extends TInput>(predicateFn: PredicateInvokable<TInput, ICollection<TInput>, TOutput>): TOutput;
1954
1954
  /**
1955
- * The <i>nth</i> method creates a new collection consisting of every n-th item.
1955
+ * The `nth` method creates a new collection consisting of every n-th item.
1956
1956
  * @example
1957
1957
  * ```ts
1958
1958
  * import type { ICollection } from "@daiso-tech/core";
@@ -1969,7 +1969,7 @@ export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TIn
1969
1969
  */
1970
1970
  nth(step: number): ICollection<TInput>;
1971
1971
  /**
1972
- * The <i>count</i> method returns the total number of items in the collection that passes <i>predicateFn</i>.
1972
+ * The `count` method returns the total number of items in the collection that passes `predicateFn`.
1973
1973
  * @example
1974
1974
  * ```ts
1975
1975
  * import type { ICollection } from "@daiso-tech/core";
@@ -1985,19 +1985,19 @@ export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TIn
1985
1985
  */
1986
1986
  count(predicateFn: PredicateInvokable<TInput, ICollection<TInput>>): number;
1987
1987
  /**
1988
- * The <i>size</i> returns the size of the collection.
1988
+ * The `size` returns the size of the collection.
1989
1989
  */
1990
1990
  size(): number;
1991
1991
  /**
1992
- * The <i>isEmpty</i> returns true if the collection is empty.
1992
+ * The `isEmpty` returns true if the collection is empty.
1993
1993
  */
1994
1994
  isEmpty(): boolean;
1995
1995
  /**
1996
- * The <i>isNotEmpty</i> returns true if the collection is not empty.
1996
+ * The `isNotEmpty` returns true if the collection is not empty.
1997
1997
  */
1998
1998
  isNotEmpty(): boolean;
1999
1999
  /**
2000
- * The <i>searchFirst</i> return the index of the first item that matches <i>predicateFn</i>.
2000
+ * The `searchFirst` return the index of the first item that matches `predicateFn`.
2001
2001
  * @example
2002
2002
  * ```ts
2003
2003
  * import type { ICollection } from "@daiso-tech/core";
@@ -2013,7 +2013,7 @@ export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TIn
2013
2013
  */
2014
2014
  searchFirst(predicateFn: PredicateInvokable<TInput, ICollection<TInput>>): number;
2015
2015
  /**
2016
- * The <i>searchLast</i> return the index of the last item that matches <i>predicateFn</i>.
2016
+ * The `searchLast` return the index of the last item that matches `predicateFn`.
2017
2017
  * @example
2018
2018
  * ```ts
2019
2019
  * import type { ICollection } from "@daiso-tech/core";
@@ -2029,21 +2029,21 @@ export type ICollection<TInput = unknown> = Iterable<TInput> & ISerializable<TIn
2029
2029
  */
2030
2030
  searchLast(predicateFn: PredicateInvokable<TInput, ICollection<TInput>>): number;
2031
2031
  /**
2032
- * The <i>forEach</i> method iterates through all items in the collection.
2032
+ * The `forEach` method iterates through all items in the collection.
2033
2033
  */
2034
2034
  forEach(callback: ForEach<TInput, ICollection<TInput>>): void;
2035
2035
  /**
2036
- * The <i>toArray</i> method converts the collection to a new <i>{@link Array}</i>.
2036
+ * The `toArray` method converts the collection to a new {@link Array | `Array`}.
2037
2037
  */
2038
2038
  toArray(): TInput[];
2039
2039
  /**
2040
- * The <i>toRecord</i> method converts the collection to a new <i>{@link Record}</i>.
2040
+ * The `toRecord` method converts the collection to a new {@link Record | `Record`}.
2041
2041
  * An error will be thrown if item is not a tuple of size 2 where the first element is a string or a number.
2042
2042
  * @throws {TypeCollectionError} {@link TypeCollectionError}
2043
2043
  */
2044
2044
  toRecord(): EnsureRecord<TInput>;
2045
2045
  /**
2046
- * The <i>toMap</i> method converts the collection to a new <i>{@link Map}</i>.
2046
+ * The `toMap` method converts the collection to a new {@link Map | `Map`}.
2047
2047
  * An error will be thrown if item is not a tuple of size 2.
2048
2048
  * @throws {TypeCollectionError} {@link TypeCollectionError}
2049
2049
  */