@bemoje/array 0.2.9 → 0.2.12

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 (133) hide show
  1. package/README.md +2 -2
  2. package/{src → cjs}/index.d.ts +1 -1
  3. package/cjs/index.d.ts.map +1 -0
  4. package/{src → cjs}/index.js +0 -1
  5. package/{src → cjs}/index.js.map +1 -1
  6. package/{src → cjs}/lib/arrAverage.d.ts +1 -0
  7. package/cjs/lib/arrAverage.d.ts.map +1 -0
  8. package/{src → cjs}/lib/arrEachToString.d.ts +1 -0
  9. package/cjs/lib/arrEachToString.d.ts.map +1 -0
  10. package/{src → cjs}/lib/arrEvery.d.ts +1 -0
  11. package/cjs/lib/arrEvery.d.ts.map +1 -0
  12. package/{src → cjs}/lib/arrFindIndicesOf.d.ts +1 -0
  13. package/cjs/lib/arrFindIndicesOf.d.ts.map +1 -0
  14. package/{src → cjs}/lib/arrFindLast.d.ts +1 -0
  15. package/cjs/lib/arrFindLast.d.ts.map +1 -0
  16. package/{src → cjs}/lib/arrFindLast.js +1 -0
  17. package/{src → cjs}/lib/arrFindLast.js.map +1 -1
  18. package/{src → cjs}/lib/arrFindLastIndexOf.d.ts +1 -0
  19. package/cjs/lib/arrFindLastIndexOf.d.ts.map +1 -0
  20. package/{src → cjs}/lib/arrFlatten.d.ts +1 -0
  21. package/cjs/lib/arrFlatten.d.ts.map +1 -0
  22. package/{src → cjs}/lib/arrHasDuplicates.d.ts +1 -0
  23. package/cjs/lib/arrHasDuplicates.d.ts.map +1 -0
  24. package/{src → cjs}/lib/arrIndicesOf.d.ts +1 -0
  25. package/cjs/lib/arrIndicesOf.d.ts.map +1 -0
  26. package/{src → cjs}/lib/arrLast.d.ts +1 -0
  27. package/cjs/lib/arrLast.d.ts.map +1 -0
  28. package/{src → cjs}/lib/arrMapMutable.d.ts +1 -0
  29. package/cjs/lib/arrMapMutable.d.ts.map +1 -0
  30. package/{src → cjs}/lib/arrObjectsToTable.d.ts +1 -0
  31. package/cjs/lib/arrObjectsToTable.d.ts.map +1 -0
  32. package/{src → cjs}/lib/arrObjectsToTable.js +1 -2
  33. package/cjs/lib/arrObjectsToTable.js.map +1 -0
  34. package/{src → cjs}/lib/arrObjectsUniqueKeys.d.ts +1 -0
  35. package/cjs/lib/arrObjectsUniqueKeys.d.ts.map +1 -0
  36. package/{src → cjs}/lib/arrRemoveDuplicates.d.ts +1 -0
  37. package/cjs/lib/arrRemoveDuplicates.d.ts.map +1 -0
  38. package/{src → cjs}/lib/arrShallowEquals.d.ts +1 -0
  39. package/cjs/lib/arrShallowEquals.d.ts.map +1 -0
  40. package/{src → cjs}/lib/arrShuffle.d.ts +1 -0
  41. package/cjs/lib/arrShuffle.d.ts.map +1 -0
  42. package/{src → cjs}/lib/arrShuffle.js +1 -2
  43. package/cjs/lib/arrShuffle.js.map +1 -0
  44. package/{src → cjs}/lib/arrSome.d.ts +1 -0
  45. package/cjs/lib/arrSome.d.ts.map +1 -0
  46. package/{src → cjs}/lib/arrSortNumeric.d.ts +1 -0
  47. package/cjs/lib/arrSortNumeric.d.ts.map +1 -0
  48. package/{src → cjs}/lib/arrSortNumeric.js +7 -2
  49. package/cjs/lib/arrSortNumeric.js.map +1 -0
  50. package/{src → cjs}/lib/arrSortedInsertionIndex.d.ts +1 -0
  51. package/cjs/lib/arrSortedInsertionIndex.d.ts.map +1 -0
  52. package/{src → cjs}/lib/arrSum.d.ts +1 -0
  53. package/cjs/lib/arrSum.d.ts.map +1 -0
  54. package/{src → cjs}/lib/arrSwap.d.ts +1 -0
  55. package/cjs/lib/arrSwap.d.ts.map +1 -0
  56. package/{src → cjs}/lib/arrTableAssertRowsSameLength.d.ts +1 -0
  57. package/cjs/lib/arrTableAssertRowsSameLength.d.ts.map +1 -0
  58. package/{src → cjs}/lib/arrTableEachToString.d.ts +1 -0
  59. package/cjs/lib/arrTableEachToString.d.ts.map +1 -0
  60. package/{src → cjs}/lib/arrTableRemoveColumns.d.ts +1 -0
  61. package/cjs/lib/arrTableRemoveColumns.d.ts.map +1 -0
  62. package/{src → cjs}/lib/arrTableToCsv.d.ts +1 -0
  63. package/cjs/lib/arrTableToCsv.d.ts.map +1 -0
  64. package/{src → cjs}/lib/arrTableToCsv.js +1 -2
  65. package/cjs/lib/arrTableToCsv.js.map +1 -0
  66. package/{src → cjs}/lib/arrTableToObjects.d.ts +1 -0
  67. package/cjs/lib/arrTableToObjects.d.ts.map +1 -0
  68. package/{src → cjs}/lib/types/ArrayPredicate.d.ts +1 -0
  69. package/cjs/lib/types/ArrayPredicate.d.ts.map +1 -0
  70. package/{src → cjs}/lib/types/ArrayValueCallback.d.ts +1 -0
  71. package/cjs/lib/types/ArrayValueCallback.d.ts.map +1 -0
  72. package/{src → cjs}/lib/types/ArrayVoidCallback.d.ts +1 -0
  73. package/cjs/lib/types/ArrayVoidCallback.d.ts.map +1 -0
  74. package/{src → cjs}/lib/types/NestedArray.d.ts +1 -0
  75. package/cjs/lib/types/NestedArray.d.ts.map +1 -0
  76. package/package.json +10 -17
  77. package/src/lib/arrObjectsToTable.js.map +0 -1
  78. package/src/lib/arrShuffle.js.map +0 -1
  79. package/src/lib/arrSortNumeric.js.map +0 -1
  80. package/src/lib/arrSplit.d.ts +0 -1
  81. package/src/lib/arrSplit.js +0 -19
  82. package/src/lib/arrSplit.js.map +0 -1
  83. package/src/lib/arrTableToCsv.js.map +0 -1
  84. /package/{src → cjs}/lib/arrAverage.js +0 -0
  85. /package/{src → cjs}/lib/arrAverage.js.map +0 -0
  86. /package/{src → cjs}/lib/arrEachToString.js +0 -0
  87. /package/{src → cjs}/lib/arrEachToString.js.map +0 -0
  88. /package/{src → cjs}/lib/arrEvery.js +0 -0
  89. /package/{src → cjs}/lib/arrEvery.js.map +0 -0
  90. /package/{src → cjs}/lib/arrFindIndicesOf.js +0 -0
  91. /package/{src → cjs}/lib/arrFindIndicesOf.js.map +0 -0
  92. /package/{src → cjs}/lib/arrFindLastIndexOf.js +0 -0
  93. /package/{src → cjs}/lib/arrFindLastIndexOf.js.map +0 -0
  94. /package/{src → cjs}/lib/arrFlatten.js +0 -0
  95. /package/{src → cjs}/lib/arrFlatten.js.map +0 -0
  96. /package/{src → cjs}/lib/arrHasDuplicates.js +0 -0
  97. /package/{src → cjs}/lib/arrHasDuplicates.js.map +0 -0
  98. /package/{src → cjs}/lib/arrIndicesOf.js +0 -0
  99. /package/{src → cjs}/lib/arrIndicesOf.js.map +0 -0
  100. /package/{src → cjs}/lib/arrLast.js +0 -0
  101. /package/{src → cjs}/lib/arrLast.js.map +0 -0
  102. /package/{src → cjs}/lib/arrMapMutable.js +0 -0
  103. /package/{src → cjs}/lib/arrMapMutable.js.map +0 -0
  104. /package/{src → cjs}/lib/arrObjectsUniqueKeys.js +0 -0
  105. /package/{src → cjs}/lib/arrObjectsUniqueKeys.js.map +0 -0
  106. /package/{src → cjs}/lib/arrRemoveDuplicates.js +0 -0
  107. /package/{src → cjs}/lib/arrRemoveDuplicates.js.map +0 -0
  108. /package/{src → cjs}/lib/arrShallowEquals.js +0 -0
  109. /package/{src → cjs}/lib/arrShallowEquals.js.map +0 -0
  110. /package/{src → cjs}/lib/arrSome.js +0 -0
  111. /package/{src → cjs}/lib/arrSome.js.map +0 -0
  112. /package/{src → cjs}/lib/arrSortedInsertionIndex.js +0 -0
  113. /package/{src → cjs}/lib/arrSortedInsertionIndex.js.map +0 -0
  114. /package/{src → cjs}/lib/arrSum.js +0 -0
  115. /package/{src → cjs}/lib/arrSum.js.map +0 -0
  116. /package/{src → cjs}/lib/arrSwap.js +0 -0
  117. /package/{src → cjs}/lib/arrSwap.js.map +0 -0
  118. /package/{src → cjs}/lib/arrTableAssertRowsSameLength.js +0 -0
  119. /package/{src → cjs}/lib/arrTableAssertRowsSameLength.js.map +0 -0
  120. /package/{src → cjs}/lib/arrTableEachToString.js +0 -0
  121. /package/{src → cjs}/lib/arrTableEachToString.js.map +0 -0
  122. /package/{src → cjs}/lib/arrTableRemoveColumns.js +0 -0
  123. /package/{src → cjs}/lib/arrTableRemoveColumns.js.map +0 -0
  124. /package/{src → cjs}/lib/arrTableToObjects.js +0 -0
  125. /package/{src → cjs}/lib/arrTableToObjects.js.map +0 -0
  126. /package/{src → cjs}/lib/types/ArrayPredicate.js +0 -0
  127. /package/{src → cjs}/lib/types/ArrayPredicate.js.map +0 -0
  128. /package/{src → cjs}/lib/types/ArrayValueCallback.js +0 -0
  129. /package/{src → cjs}/lib/types/ArrayValueCallback.js.map +0 -0
  130. /package/{src → cjs}/lib/types/ArrayVoidCallback.js +0 -0
  131. /package/{src → cjs}/lib/types/ArrayVoidCallback.js.map +0 -0
  132. /package/{src → cjs}/lib/types/NestedArray.js +0 -0
  133. /package/{src → cjs}/lib/types/NestedArray.js.map +0 -0
package/README.md CHANGED
@@ -1,6 +1,6 @@
1
1
  # @bemoje/array
2
2
 
3
- array related tools/util.
3
+
4
4
 
5
5
  ![npm (scoped)](https://img.shields.io/npm/v/%40bemoje/trie-map)
6
6
  ![npm bundle size (scoped)](https://img.shields.io/bundlephobia/minzip/%40bemoje/array)
@@ -31,4 +31,4 @@ Please let me know of any bugs or [issues](https://github.com/bemoje/tsmono/issu
31
31
  Contributors are welcome to open a [pull request](https://github.com/bemoje/tsmono/pulls).
32
32
 
33
33
  ## License
34
- Released under the [MIT License](./LICENSE).
34
+ Released under the [undefined License](./LICENSE).
@@ -17,7 +17,6 @@ export * from './lib/arrShuffle';
17
17
  export * from './lib/arrSome';
18
18
  export * from './lib/arrSortedInsertionIndex';
19
19
  export * from './lib/arrSortNumeric';
20
- export * from './lib/arrSplit';
21
20
  export * from './lib/arrSum';
22
21
  export * from './lib/arrSwap';
23
22
  export * from './lib/arrTableAssertRowsSameLength';
@@ -29,3 +28,4 @@ export * from './lib/types/ArrayPredicate';
29
28
  export * from './lib/types/ArrayValueCallback';
30
29
  export * from './lib/types/ArrayVoidCallback';
31
30
  export * from './lib/types/NestedArray';
31
+ //# sourceMappingURL=index.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../packages/array/src/index.ts"],"names":[],"mappings":"AAAA,cAAc,kBAAkB,CAAA;AAChC,cAAc,uBAAuB,CAAA;AACrC,cAAc,gBAAgB,CAAA;AAC9B,cAAc,wBAAwB,CAAA;AACtC,cAAc,mBAAmB,CAAA;AACjC,cAAc,0BAA0B,CAAA;AACxC,cAAc,kBAAkB,CAAA;AAChC,cAAc,wBAAwB,CAAA;AACtC,cAAc,oBAAoB,CAAA;AAClC,cAAc,eAAe,CAAA;AAC7B,cAAc,qBAAqB,CAAA;AACnC,cAAc,yBAAyB,CAAA;AACvC,cAAc,4BAA4B,CAAA;AAC1C,cAAc,2BAA2B,CAAA;AACzC,cAAc,wBAAwB,CAAA;AACtC,cAAc,kBAAkB,CAAA;AAChC,cAAc,eAAe,CAAA;AAC7B,cAAc,+BAA+B,CAAA;AAC7C,cAAc,sBAAsB,CAAA;AACpC,cAAc,cAAc,CAAA;AAC5B,cAAc,eAAe,CAAA;AAC7B,cAAc,oCAAoC,CAAA;AAClD,cAAc,4BAA4B,CAAA;AAC1C,cAAc,6BAA6B,CAAA;AAC3C,cAAc,qBAAqB,CAAA;AACnC,cAAc,yBAAyB,CAAA;AACvC,cAAc,4BAA4B,CAAA;AAC1C,cAAc,gCAAgC,CAAA;AAC9C,cAAc,+BAA+B,CAAA;AAC7C,cAAc,yBAAyB,CAAA"}
@@ -20,7 +20,6 @@ tslib_1.__exportStar(require("./lib/arrShuffle"), exports);
20
20
  tslib_1.__exportStar(require("./lib/arrSome"), exports);
21
21
  tslib_1.__exportStar(require("./lib/arrSortedInsertionIndex"), exports);
22
22
  tslib_1.__exportStar(require("./lib/arrSortNumeric"), exports);
23
- tslib_1.__exportStar(require("./lib/arrSplit"), exports);
24
23
  tslib_1.__exportStar(require("./lib/arrSum"), exports);
25
24
  tslib_1.__exportStar(require("./lib/arrSwap"), exports);
26
25
  tslib_1.__exportStar(require("./lib/arrTableAssertRowsSameLength"), exports);
@@ -1 +1 @@
1
- {"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../packages/array/src/index.ts"],"names":[],"mappings":";;;AAAA,2DAAgC;AAChC,gEAAqC;AACrC,yDAA8B;AAC9B,iEAAsC;AACtC,4DAAiC;AACjC,mEAAwC;AACxC,2DAAgC;AAChC,iEAAsC;AACtC,6DAAkC;AAClC,wDAA6B;AAC7B,8DAAmC;AACnC,kEAAuC;AACvC,qEAA0C;AAC1C,oEAAyC;AACzC,iEAAsC;AACtC,2DAAgC;AAChC,wDAA6B;AAC7B,wEAA6C;AAC7C,+DAAoC;AACpC,yDAA8B;AAC9B,uDAA4B;AAC5B,wDAA6B;AAC7B,6EAAkD;AAClD,qEAA0C;AAC1C,sEAA2C;AAC3C,8DAAmC;AACnC,kEAAuC;AACvC,qEAA0C;AAC1C,yEAA8C;AAC9C,wEAA6C;AAC7C,kEAAuC"}
1
+ {"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../packages/array/src/index.ts"],"names":[],"mappings":";;;AAAA,2DAAgC;AAChC,gEAAqC;AACrC,yDAA8B;AAC9B,iEAAsC;AACtC,4DAAiC;AACjC,mEAAwC;AACxC,2DAAgC;AAChC,iEAAsC;AACtC,6DAAkC;AAClC,wDAA6B;AAC7B,8DAAmC;AACnC,kEAAuC;AACvC,qEAA0C;AAC1C,oEAAyC;AACzC,iEAAsC;AACtC,2DAAgC;AAChC,wDAA6B;AAC7B,wEAA6C;AAC7C,+DAAoC;AACpC,uDAA4B;AAC5B,wDAA6B;AAC7B,6EAAkD;AAClD,qEAA0C;AAC1C,sEAA2C;AAC3C,8DAAmC;AACnC,kEAAuC;AACvC,qEAA0C;AAC1C,yEAA8C;AAC9C,wEAA6C;AAC7C,kEAAuC"}
@@ -10,3 +10,4 @@
10
10
  * ```
11
11
  */
12
12
  export declare function arrAverage(array: number[]): number;
13
+ //# sourceMappingURL=arrAverage.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"arrAverage.d.ts","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrAverage.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;GAUG;AACH,wBAAgB,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,MAAM,CAGlD"}
@@ -10,3 +10,4 @@
10
10
  * ```
11
11
  */
12
12
  export declare function arrEachToString<T>(array: T[]): string[];
13
+ //# sourceMappingURL=arrEachToString.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"arrEachToString.d.ts","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrEachToString.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AACH,wBAAgB,eAAe,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,MAAM,EAAE,CAEvD"}
@@ -15,3 +15,4 @@ import type { ArrayPredicate } from './types/ArrayPredicate';
15
15
  * ```
16
16
  */
17
17
  export declare function arrEvery<T>(input: Array<T>, predicate: ArrayPredicate<T>): boolean;
18
+ //# sourceMappingURL=arrEvery.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"arrEvery.d.ts","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrEvery.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,wBAAwB,CAAA;AAE5D;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,cAAc,CAAC,CAAC,CAAC,GAAG,OAAO,CAOlF"}
@@ -5,3 +5,4 @@
5
5
  * @returns An array of indices where the predicate function returns true.
6
6
  */
7
7
  export declare function arrFindIndicesOf<T>(input: Array<T>, predicate: (value: T) => boolean): number[];
8
+ //# sourceMappingURL=arrFindIndicesOf.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"arrFindIndicesOf.d.ts","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrFindIndicesOf.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,OAAO,GAAG,MAAM,EAAE,CAQ/F"}
@@ -9,3 +9,4 @@
9
9
  * //=> 6
10
10
  */
11
11
  export declare function arrFindLast<T>(input: Array<T>, predicate: (value: T) => boolean): T | undefined;
12
+ //# sourceMappingURL=arrFindLast.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"arrFindLast.d.ts","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrFindLast.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,OAAO,GAAG,CAAC,GAAG,SAAS,CAO/F"}
@@ -17,6 +17,7 @@ function arrFindLast(input, predicate) {
17
17
  return input[i];
18
18
  }
19
19
  }
20
+ return;
20
21
  }
21
22
  exports.arrFindLast = arrFindLast;
22
23
  //# sourceMappingURL=arrFindLast.js.map
@@ -1 +1 @@
1
- {"version":3,"file":"arrFindLast.js","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrFindLast.ts"],"names":[],"mappings":";;;AAAA;;;;;;;;;GASG;AACH,SAAgB,WAAW,CAAI,KAAe,EAAE,SAAgC;IAC9E,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;QAC1C,IAAI,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,EAAE;YAChC,OAAO,KAAK,CAAC,CAAC,CAAC,CAAA;SAChB;KACF;AACH,CAAC;AAND,kCAMC"}
1
+ {"version":3,"file":"arrFindLast.js","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrFindLast.ts"],"names":[],"mappings":";;;AAAA;;;;;;;;;GASG;AACH,SAAgB,WAAW,CAAI,KAAe,EAAE,SAAgC;IAC9E,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;QAC1C,IAAI,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,EAAE;YAChC,OAAO,KAAK,CAAC,CAAC,CAAC,CAAA;SAChB;KACF;IACD,OAAM;AACR,CAAC;AAPD,kCAOC"}
@@ -11,3 +11,4 @@
11
11
  * ```
12
12
  */
13
13
  export declare function arrFindLastIndexOf<T>(input: Array<T>, predicate: (value: T) => boolean): number;
14
+ //# sourceMappingURL=arrFindLastIndexOf.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"arrFindLastIndexOf.d.ts","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrFindLastIndexOf.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AACH,wBAAgB,kBAAkB,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,OAAO,GAAG,MAAM,CAO/F"}
@@ -14,3 +14,4 @@ import type { NestedArray } from './types/NestedArray';
14
14
  * ```
15
15
  */
16
16
  export declare function arrFlatten<T>(input: NestedArray<T>, maxDepth?: number): Array<T>;
17
+ //# sourceMappingURL=arrFlatten.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"arrFlatten.d.ts","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrFlatten.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,qBAAqB,CAAA;AAEtD;;;;;;;;;;;;;GAaG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,KAAK,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,QAAQ,SAA0B,GAAG,KAAK,CAAC,CAAC,CAAC,CAajG"}
@@ -5,3 +5,4 @@
5
5
  * @typeParam T - The type of elements in the array.
6
6
  */
7
7
  export declare function arrHasDuplicates<T>(arr: T[]): boolean;
8
+ //# sourceMappingURL=arrHasDuplicates.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"arrHasDuplicates.d.ts","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrHasDuplicates.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,OAAO,CAOrD"}
@@ -12,3 +12,4 @@
12
12
  * ```
13
13
  */
14
14
  export declare function arrIndicesOf<T>(input: Array<T>, element: T): number[];
15
+ //# sourceMappingURL=arrIndicesOf.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"arrIndicesOf.d.ts","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrIndicesOf.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,GAAG,MAAM,EAAE,CAQrE"}
@@ -10,3 +10,4 @@
10
10
  * //=> 5
11
11
  */
12
12
  export declare function arrLast<T>(array: T[]): T;
13
+ //# sourceMappingURL=arrLast.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"arrLast.d.ts","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrLast.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AACH,wBAAgB,OAAO,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,CAAC,CAGxC"}
@@ -11,3 +11,4 @@ import type { ArrayValueCallback } from './types/ArrayValueCallback';
11
11
  * ```
12
12
  */
13
13
  export declare function arrMapMutable<T>(input: Array<T>, f: ArrayValueCallback<T>): Array<T>;
14
+ //# sourceMappingURL=arrMapMutable.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"arrMapMutable.d.ts","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrMapMutable.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,4BAA4B,CAAA;AAEpE;;;;;;;;;;GAUG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,kBAAkB,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAKpF"}
@@ -20,3 +20,4 @@ export declare function arrObjectsToTable<T, E>(objects: Record<string, T | unde
20
20
  headers?: string[];
21
21
  emptyCell?: E;
22
22
  }): Array<Array<string | T | E>>;
23
+ //# sourceMappingURL=arrObjectsToTable.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"arrObjectsToTable.d.ts","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrObjectsToTable.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;;;;;;;;GAiBG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,CAAC,EACpC,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC,GAAG,SAAS,CAAC,EAAE,EACxC,OAAO,GAAE;IACP,OAAO,CAAC,EAAE,MAAM,EAAE,CAAA;IAClB,SAAS,CAAC,EAAE,CAAC,CAAA;CACT,GACL,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAW9B"}
@@ -21,8 +21,7 @@ const arrObjectsUniqueKeys_1 = require("./arrObjectsUniqueKeys");
21
21
  * ```
22
22
  */
23
23
  function arrObjectsToTable(objects, options = {}) {
24
- var _a;
25
- const headers = ((_a = options === null || options === void 0 ? void 0 : options.headers) === null || _a === void 0 ? void 0 : _a.slice()) || (0, arrObjectsUniqueKeys_1.arrObjectsUniqueKeys)(objects);
24
+ const headers = options?.headers?.slice() || (0, arrObjectsUniqueKeys_1.arrObjectsUniqueKeys)(objects);
26
25
  const table = [headers];
27
26
  for (const o of objects) {
28
27
  const row = headers.map((header) => {
@@ -0,0 +1 @@
1
+ {"version":3,"file":"arrObjectsToTable.js","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrObjectsToTable.ts"],"names":[],"mappings":";;;AAAA,iEAA6D;AAE7D;;;;;;;;;;;;;;;;;GAiBG;AACH,SAAgB,iBAAiB,CAC/B,OAAwC,EACxC,UAGI,EAAE;IAEN,MAAM,OAAO,GAAG,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,IAAA,2CAAoB,EAAC,OAAO,CAAC,CAAA;IAC1E,MAAM,KAAK,GAAiC,CAAC,OAAO,CAAC,CAAA;IACrD,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE;QACvB,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE;YACjC,MAAM,KAAK,GAAG,CAAC,CAAC,MAAM,CAAC,CAAA;YACvB,OAAO,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAE,OAAO,CAAC,SAAe,CAAA;QAC/D,CAAC,CAAC,CAAA;QACF,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;KAChB;IACD,OAAO,KAAK,CAAA;AACd,CAAC;AAjBD,8CAiBC"}
@@ -14,3 +14,4 @@
14
14
  * ```
15
15
  */
16
16
  export declare function arrObjectsUniqueKeys<T>(objects: Record<string, T>[]): string[];
17
+ //# sourceMappingURL=arrObjectsUniqueKeys.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"arrObjectsUniqueKeys.d.ts","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrObjectsUniqueKeys.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,oBAAoB,CAAC,CAAC,EAAE,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,GAAG,MAAM,EAAE,CAQ9E"}
@@ -11,3 +11,4 @@
11
11
  * ```
12
12
  */
13
13
  export declare function arrRemoveDuplicates<T>(array: T[]): T[];
14
+ //# sourceMappingURL=arrRemoveDuplicates.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"arrRemoveDuplicates.d.ts","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrRemoveDuplicates.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AACH,wBAAgB,mBAAmB,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE,CAEtD"}
@@ -13,3 +13,4 @@
13
13
  * ```
14
14
  */
15
15
  export declare function arrShallowEquals<T>(input1: T[], input2: T[]): boolean;
16
+ //# sourceMappingURL=arrShallowEquals.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"arrShallowEquals.d.ts","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrShallowEquals.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;;;;GAaG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,GAAG,OAAO,CAGrE"}
@@ -11,3 +11,4 @@
11
11
  * ```
12
12
  */
13
13
  export declare function arrShuffle<T>(input: Array<T>): Array<T>;
14
+ //# sourceMappingURL=arrShuffle.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"arrShuffle.d.ts","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrShuffle.ts"],"names":[],"mappings":"AAGA;;;;;;;;;;;GAWG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAYvD"}
@@ -1,7 +1,6 @@
1
1
  "use strict";
2
2
  Object.defineProperty(exports, "__esModule", { value: true });
3
3
  exports.arrShuffle = void 0;
4
- const number_1 = require("@bemoje/number");
5
4
  const arrShallowEquals_1 = require("./arrShallowEquals");
6
5
  const arrSwap_1 = require("./arrSwap");
7
6
  /**
@@ -23,7 +22,7 @@ function arrShuffle(input) {
23
22
  let equal = true;
24
23
  while (equal) {
25
24
  for (let i = 0; i < input.length; i++) {
26
- const newIndex = (0, number_1.randomIntBetween)(0, input.length - 1);
25
+ const newIndex = Math.floor(Math.random() * input.length);
27
26
  (0, arrSwap_1.arrSwap)(input, i, newIndex);
28
27
  }
29
28
  equal = (0, arrShallowEquals_1.arrShallowEquals)(input, original);
@@ -0,0 +1 @@
1
+ {"version":3,"file":"arrShuffle.js","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrShuffle.ts"],"names":[],"mappings":";;;AAAA,yDAAqD;AACrD,uCAAmC;AAEnC;;;;;;;;;;;GAWG;AACH,SAAgB,UAAU,CAAI,KAAe;IAC3C,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC;QAAE,OAAO,KAAK,CAAA;IACnC,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,EAAE,CAAA;IAC9B,IAAI,KAAK,GAAG,IAAI,CAAA;IAChB,OAAO,KAAK,EAAE;QACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACrC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,KAAK,CAAC,MAAM,CAAC,CAAA;YACzD,IAAA,iBAAO,EAAC,KAAK,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAA;SAC5B;QACD,KAAK,GAAG,IAAA,mCAAgB,EAAC,KAAK,EAAE,QAAQ,CAAC,CAAA;KAC1C;IACD,OAAO,KAAK,CAAA;AACd,CAAC;AAZD,gCAYC"}
@@ -13,3 +13,4 @@ import type { ArrayPredicate } from './types/ArrayPredicate';
13
13
  * ```
14
14
  */
15
15
  export declare function arrSome<T>(input: Array<T>, predicate: ArrayPredicate<T>): boolean;
16
+ //# sourceMappingURL=arrSome.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"arrSome.d.ts","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrSome.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,wBAAwB,CAAA;AAE5D;;;;;;;;;;;;GAYG;AACH,wBAAgB,OAAO,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,cAAc,CAAC,CAAC,CAAC,GAAG,OAAO,CAOjF"}
@@ -12,3 +12,4 @@
12
12
  * ```
13
13
  */
14
14
  export declare function arrSortNumeric(input: Array<number | bigint | boolean>): Array<number | bigint | boolean>;
15
+ //# sourceMappingURL=arrSortNumeric.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"arrSortNumeric.d.ts","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrSortNumeric.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,KAAK,CAAC,MAAM,GAAG,MAAM,GAAG,OAAO,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,MAAM,GAAG,OAAO,CAAC,CAMxG"}
@@ -1,7 +1,6 @@
1
1
  "use strict";
2
2
  Object.defineProperty(exports, "__esModule", { value: true });
3
3
  exports.arrSortNumeric = void 0;
4
- const sort_1 = require("@bemoje/sort");
5
4
  /**
6
5
  * Sorts an array of numbers, bigints, or booleans in ascending order.
7
6
  * @returns The sorted array.
@@ -16,7 +15,13 @@ const sort_1 = require("@bemoje/sort");
16
15
  * ```
17
16
  */
18
17
  function arrSortNumeric(input) {
19
- return input.sort(sort_1.compareNumeric);
18
+ return input.sort((a, b) => {
19
+ if (a < b)
20
+ return -1;
21
+ if (a > b)
22
+ return 1;
23
+ return 0;
24
+ });
20
25
  }
21
26
  exports.arrSortNumeric = arrSortNumeric;
22
27
  //# sourceMappingURL=arrSortNumeric.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"arrSortNumeric.js","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrSortNumeric.ts"],"names":[],"mappings":";;;AAAA;;;;;;;;;;;;GAYG;AACH,SAAgB,cAAc,CAAC,KAAuC;IACpE,OAAO,KAAK,CAAC,IAAI,CAAC,CAAC,CAA4B,EAAE,CAA4B,EAAE,EAAE;QAC/E,IAAI,CAAC,GAAG,CAAC;YAAE,OAAO,CAAC,CAAC,CAAA;QACpB,IAAI,CAAC,GAAG,CAAC;YAAE,OAAO,CAAC,CAAA;QACnB,OAAO,CAAC,CAAA;IACV,CAAC,CAAC,CAAA;AACJ,CAAC;AAND,wCAMC"}
@@ -14,3 +14,4 @@
14
14
  * ```
15
15
  */
16
16
  export declare function arrSortedInsertionIndex<T>(array: readonly T[], value: T, comparator: (a: T, b: T) => number): number;
17
+ //# sourceMappingURL=arrSortedInsertionIndex.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"arrSortedInsertionIndex.d.ts","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrSortedInsertionIndex.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,uBAAuB,CAAC,CAAC,EAAE,KAAK,EAAE,SAAS,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,MAAM,GAAG,MAAM,CAcpH"}
@@ -9,3 +9,4 @@
9
9
  * ```
10
10
  */
11
11
  export declare function arrSum(array: number[]): number;
12
+ //# sourceMappingURL=arrSum.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"arrSum.d.ts","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrSum.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AACH,wBAAgB,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,MAAM,CAE9C"}
@@ -12,3 +12,4 @@
12
12
  * ```
13
13
  */
14
14
  export declare function arrSwap<T>(input: Array<T>, from: number, to: number): Array<T>;
15
+ //# sourceMappingURL=arrSwap.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"arrSwap.d.ts","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrSwap.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AACH,wBAAgB,OAAO,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,CAI9E"}
@@ -23,3 +23,4 @@
23
23
  * ```
24
24
  */
25
25
  export declare function arrTableAssertRowsSameLength<T>(rows: T[][], headers?: string[]): void;
26
+ //# sourceMappingURL=arrTableAssertRowsSameLength.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"arrTableAssertRowsSameLength.d.ts","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrTableAssertRowsSameLength.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,wBAAgB,4BAA4B,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,OAAO,CAAC,EAAE,MAAM,EAAE,GAAG,IAAI,CAOrF"}
@@ -10,3 +10,4 @@
10
10
  * ```
11
11
  */
12
12
  export declare function arrTableEachToString<T>(table: T[][]): string[][];
13
+ //# sourceMappingURL=arrTableEachToString.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"arrTableEachToString.d.ts","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrTableEachToString.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;GAUG;AACH,wBAAgB,oBAAoB,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,GAAG,MAAM,EAAE,EAAE,CAEhE"}
@@ -5,3 +5,4 @@
5
5
  * @returns A new 2D array (table) with the specified columns removed.
6
6
  */
7
7
  export declare function arrTableRemoveColumns(table: string[][], ...removeColumnNames: string[]): string[][];
8
+ //# sourceMappingURL=arrTableRemoveColumns.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"arrTableRemoveColumns.d.ts","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrTableRemoveColumns.ts"],"names":[],"mappings":"AAEA;;;;;GAKG;AACH,wBAAgB,qBAAqB,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,EAAE,GAAG,iBAAiB,EAAE,MAAM,EAAE,GAAG,MAAM,EAAE,EAAE,CAInG"}
@@ -18,3 +18,4 @@
18
18
  * ```
19
19
  */
20
20
  export declare function arrTableToCsv<T>(input: T[][], delimiter?: string, replaceLinebreakWith?: string): string;
21
+ //# sourceMappingURL=arrTableToCsv.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"arrTableToCsv.d.ts","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrTableToCsv.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,EAAE,SAAS,SAAM,EAAE,oBAAoB,SAAM,GAAG,MAAM,CAQlG"}
@@ -1,7 +1,6 @@
1
1
  "use strict";
2
2
  Object.defineProperty(exports, "__esModule", { value: true });
3
3
  exports.arrTableToCsv = void 0;
4
- const string_1 = require("@bemoje/string");
5
4
  /**
6
5
  * Converts a 2D array to a CSV string.
7
6
  * @param input The input 2D array.
@@ -25,7 +24,7 @@ function arrTableToCsv(input, delimiter = ';', replaceLinebreakWith = '|') {
25
24
  return input
26
25
  .map((row) => {
27
26
  return row
28
- .map((item) => (0, string_1.strReplaceAll)(item + '', delimiter, '').replace(/\r*\n/g, replaceLinebreakWith))
27
+ .map((item) => String(item).replace(new RegExp(';', 'g'), '').replace(/\r*\n/g, replaceLinebreakWith))
29
28
  .join(delimiter);
30
29
  })
31
30
  .join('\n');
@@ -0,0 +1 @@
1
+ {"version":3,"file":"arrTableToCsv.js","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrTableToCsv.ts"],"names":[],"mappings":";;;AAAA;;;;;;;;;;;;;;;;;;GAkBG;AACH,SAAgB,aAAa,CAAI,KAAY,EAAE,SAAS,GAAG,GAAG,EAAE,oBAAoB,GAAG,GAAG;IACxF,OAAO,KAAK;SACT,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE;QACX,OAAO,GAAG;aACP,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,IAAI,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,QAAQ,EAAE,oBAAoB,CAAC,CAAC;aACrG,IAAI,CAAC,SAAS,CAAC,CAAA;IACpB,CAAC,CAAC;SACD,IAAI,CAAC,IAAI,CAAC,CAAA;AACf,CAAC;AARD,sCAQC"}
@@ -20,3 +20,4 @@
20
20
  * ```
21
21
  */
22
22
  export declare function arrTableToObjects<T>(rows: T[][], headers?: string[], ignoreKeys?: Set<string>): Record<string, T>[];
23
+ //# sourceMappingURL=arrTableToObjects.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"arrTableToObjects.d.ts","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrTableToObjects.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,OAAO,CAAC,EAAE,MAAM,EAAE,EAAE,UAAU,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,CAoBnH"}
@@ -8,3 +8,4 @@
8
8
  * @returns A boolean indicating whether the current element passes the test.
9
9
  */
10
10
  export type ArrayPredicate<T> = (value: T, index: number, array: T[]) => boolean;
11
+ //# sourceMappingURL=ArrayPredicate.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"ArrayPredicate.d.ts","sourceRoot":"","sources":["../../../../../../packages/array/src/lib/types/ArrayPredicate.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AACH,MAAM,MAAM,cAAc,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,OAAO,CAAA"}
@@ -1 +1,2 @@
1
1
  export type ArrayValueCallback<T> = (value: T, index: number, array: T[]) => T;
2
+ //# sourceMappingURL=ArrayValueCallback.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"ArrayValueCallback.d.ts","sourceRoot":"","sources":["../../../../../../packages/array/src/lib/types/ArrayValueCallback.ts"],"names":[],"mappings":"AAAA,MAAM,MAAM,kBAAkB,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,CAAC,CAAA"}
@@ -1 +1,2 @@
1
1
  export type ArrayVoidCallback<T> = (value: T, index: number, array: T[]) => void;
2
+ //# sourceMappingURL=ArrayVoidCallback.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"ArrayVoidCallback.d.ts","sourceRoot":"","sources":["../../../../../../packages/array/src/lib/types/ArrayVoidCallback.ts"],"names":[],"mappings":"AAAA,MAAM,MAAM,iBAAiB,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,IAAI,CAAA"}
@@ -1 +1,2 @@
1
1
  export type NestedArray<T> = Array<NestedArray<T> | T>;
2
+ //# sourceMappingURL=NestedArray.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"NestedArray.d.ts","sourceRoot":"","sources":["../../../../../../packages/array/src/lib/types/NestedArray.ts"],"names":[],"mappings":"AAAA,MAAM,MAAM,WAAW,CAAC,CAAC,IAAI,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA"}
package/package.json CHANGED
@@ -1,23 +1,19 @@
1
1
  {
2
2
  "name": "@bemoje/array",
3
- "version": "0.2.9",
4
- "description": "array related tools/util.",
5
- "main": "./src/index.js",
6
- "scripts": {},
3
+ "version": "0.2.12",
4
+ "type": "commonjs",
5
+ "main": "cjs/index.js",
6
+ "types": "cjs/index.d.ts",
7
+ "dependencies": {
8
+ "tslib": "^2.6.2"
9
+ },
10
+ "license": "MIT",
11
+ "keywords": [],
7
12
  "author": {
8
13
  "name": "Benjamin Møller Jensen",
9
14
  "email": "bemoje@bemoje.net",
10
15
  "url": "https://github.com/bemoje/"
11
16
  },
12
- "license": "MIT",
13
- "keywords": [],
14
- "dependencies": {
15
- "@bemoje/number": "latest",
16
- "@bemoje/sort": "latest",
17
- "@bemoje/string": "latest",
18
- "@bemoje/validation": "latest",
19
- "tslib": "^2.3.0"
20
- },
21
17
  "repository": {
22
18
  "type": "git",
23
19
  "url": "git+https://github.com/bemoje/tsmono.git"
@@ -29,8 +25,5 @@
29
25
  "bugs": {
30
26
  "url": "https://github.com/bemoje/tsmono/issues"
31
27
  },
32
- "homepage": "https://github.com/bemoje/tsmono",
33
- "type": "commonjs",
34
- "typings": "./src/index.d.ts",
35
- "devDependencies": {}
28
+ "homepage": "https://github.com/bemoje/tsmono"
36
29
  }
@@ -1 +0,0 @@
1
- {"version":3,"file":"arrObjectsToTable.js","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrObjectsToTable.ts"],"names":[],"mappings":";;;AAAA,iEAA6D;AAE7D;;;;;;;;;;;;;;;;;GAiBG;AACH,SAAgB,iBAAiB,CAC/B,OAAwC,EACxC,UAGI,EAAE;;IAEN,MAAM,OAAO,GAAG,CAAA,MAAA,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,OAAO,0CAAE,KAAK,EAAE,KAAI,IAAA,2CAAoB,EAAC,OAAO,CAAC,CAAA;IAC1E,MAAM,KAAK,GAAiC,CAAC,OAAO,CAAC,CAAA;IACrD,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE;QACvB,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE;YACjC,MAAM,KAAK,GAAG,CAAC,CAAC,MAAM,CAAC,CAAA;YACvB,OAAO,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAE,OAAO,CAAC,SAAe,CAAA;QAC/D,CAAC,CAAC,CAAA;QACF,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;KAChB;IACD,OAAO,KAAK,CAAA;AACd,CAAC;AAjBD,8CAiBC"}
@@ -1 +0,0 @@
1
- {"version":3,"file":"arrShuffle.js","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrShuffle.ts"],"names":[],"mappings":";;;AAAA,2CAAiD;AACjD,yDAAqD;AACrD,uCAAmC;AAEnC;;;;;;;;;;;GAWG;AACH,SAAgB,UAAU,CAAI,KAAe;IAC3C,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC;QAAE,OAAO,KAAK,CAAA;IACnC,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,EAAE,CAAA;IAC9B,IAAI,KAAK,GAAG,IAAI,CAAA;IAChB,OAAO,KAAK,EAAE;QACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACrC,MAAM,QAAQ,GAAG,IAAA,yBAAgB,EAAC,CAAC,EAAE,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;YACtD,IAAA,iBAAO,EAAC,KAAK,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAA;SAC5B;QACD,KAAK,GAAG,IAAA,mCAAgB,EAAC,KAAK,EAAE,QAAQ,CAAC,CAAA;KAC1C;IACD,OAAO,KAAK,CAAA;AACd,CAAC;AAZD,gCAYC"}
@@ -1 +0,0 @@
1
- {"version":3,"file":"arrSortNumeric.js","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrSortNumeric.ts"],"names":[],"mappings":";;;AAAA,uCAA6C;AAE7C;;;;;;;;;;;;GAYG;AACH,SAAgB,cAAc,CAAC,KAAuC;IACpE,OAAO,KAAK,CAAC,IAAI,CAAC,qBAAc,CAAC,CAAA;AACnC,CAAC;AAFD,wCAEC"}
@@ -1 +0,0 @@
1
- export declare function arrSplit<T>(array: T[], n: number): T[][];
@@ -1,19 +0,0 @@
1
- "use strict";
2
- Object.defineProperty(exports, "__esModule", { value: true });
3
- exports.arrSplit = void 0;
4
- const validation_1 = require("@bemoje/validation");
5
- function arrSplit(array, n) {
6
- (0, validation_1.assertion)(n, validation_1.isPositiveInteger);
7
- const result = [];
8
- if (array.length === 0)
9
- return result;
10
- if (n === 1)
11
- return [array];
12
- const chunkSize = Math.ceil(array.length / n);
13
- for (let i = 0; i < array.length; i += chunkSize) {
14
- result.push(array.slice(i, i + chunkSize));
15
- }
16
- return result;
17
- }
18
- exports.arrSplit = arrSplit;
19
- //# sourceMappingURL=arrSplit.js.map
@@ -1 +0,0 @@
1
- {"version":3,"file":"arrSplit.js","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrSplit.ts"],"names":[],"mappings":";;;AAAA,mDAAiE;AAEjE,SAAgB,QAAQ,CAAI,KAAU,EAAE,CAAS;IAC/C,IAAA,sBAAS,EAAC,CAAC,EAAE,8BAAiB,CAAC,CAAA;IAC/B,MAAM,MAAM,GAAU,EAAE,CAAA;IACxB,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,MAAM,CAAA;IACrC,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,KAAK,CAAC,CAAA;IAC3B,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;IAC7C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,SAAS,EAAE;QAChD,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,CAAC,CAAA;KAC3C;IACD,OAAO,MAAM,CAAA;AACf,CAAC;AAVD,4BAUC"}
@@ -1 +0,0 @@
1
- {"version":3,"file":"arrTableToCsv.js","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrTableToCsv.ts"],"names":[],"mappings":";;;AAAA,2CAA8C;AAE9C;;;;;;;;;;;;;;;;;;GAkBG;AACH,SAAgB,aAAa,CAAI,KAAY,EAAE,SAAS,GAAG,GAAG,EAAE,oBAAoB,GAAG,GAAG;IACxF,OAAO,KAAK;SACT,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE;QACX,OAAO,GAAG;aACP,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAA,sBAAa,EAAC,IAAI,GAAG,EAAE,EAAE,SAAS,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,QAAQ,EAAE,oBAAoB,CAAC,CAAC;aAC9F,IAAI,CAAC,SAAS,CAAC,CAAA;IACpB,CAAC,CAAC;SACD,IAAI,CAAC,IAAI,CAAC,CAAA;AACf,CAAC;AARD,sCAQC"}
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes
File without changes