@js-utils-kit/array 0.1.0 → 0.2.0

package/dist/index.cjs

@@ -1 +1 @@
-function e(e,t=1){if(t<=0)throw RangeError(`chunk size must be greater than 0`);return Array.from({length:Math.ceil(e.length/t)},(n,r)=>e.slice(r*t,r*t+t))}function t(e){return e.filter(e=>!!e&&!Number.isNaN(e))}function n(e){return e.at(-1)}function r(e,{sort:t=!1,compareFn:n}={}){let r=[...new Set(e)];return t?n?r.sort(n):r.sort():r}exports.chunk=e,exports.compact=t,exports.lastElement=n,exports.unique=r;var i=require(`@js-utils-kit/types`);Object.keys(i).forEach(function(e){e!==`default`&&!Object.prototype.hasOwnProperty.call(exports,e)&&Object.defineProperty(exports,e,{enumerable:!0,get:function(){return i[e]}})});
+function e(e,t=1){if(t<=0)throw RangeError(`chunk size must be greater than 0`);return Array.from({length:Math.ceil(e.length/t)},(n,r)=>e.slice(r*t,r*t+t))}function t(e){return e.filter(e=>!!e&&!Number.isNaN(e))}function n(e){return e.at(-1)}function r(e,{sort:t=!1,compareFn:n}={}){let r=[...new Set(e)];return t?n?r.sort(n):r.sort():r}exports.chunk=e,exports.compact=t,exports.lastElement=n,exports.unique=r;

package/dist/index.d.cts

@@ -1,8 +1,6 @@
 import { Falsy } from "@js-utils-kit/types";
-export * from "@js-utils-kit/types";
 
 //#region src/chunk.d.ts
-
 /**
  * Splits an array into chunks of a specified size.
  *
@@ -48,6 +46,7 @@ declare function compact<T>(
 /**
  * A list of elements to compact
  */
+
 array: readonly T[]): Exclude<T, Falsy>[];
 //#endregion
 //#region src/lastElement.d.ts
@@ -67,6 +66,7 @@ declare function lastElement<T>(
 /**
  * A list of elements.
  */
+
 array: readonly T[]): T | undefined;
 //#endregion
 //#region src/unique.d.ts
@@ -104,6 +104,7 @@ declare function unique<T>(
 /**
  * The source array.
  */
+
 array: readonly T[], {
   sort,
   compareFn

package/dist/index.d.mts

@@ -1,8 +1,6 @@
 import { Falsy } from "@js-utils-kit/types";
-export * from "@js-utils-kit/types";
 
 //#region src/chunk.d.ts
-
 /**
  * Splits an array into chunks of a specified size.
  *
@@ -48,6 +46,7 @@ declare function compact<T>(
 /**
  * A list of elements to compact
  */
+
 array: readonly T[]): Exclude<T, Falsy>[];
 //#endregion
 //#region src/lastElement.d.ts
@@ -67,6 +66,7 @@ declare function lastElement<T>(
 /**
  * A list of elements.
  */
+
 array: readonly T[]): T | undefined;
 //#endregion
 //#region src/unique.d.ts
@@ -104,6 +104,7 @@ declare function unique<T>(
 /**
  * The source array.
  */
+
 array: readonly T[], {
   sort,
   compareFn

package/dist/index.mjs

@@ -1 +1 @@
-export*from"@js-utils-kit/types";function e(e,t=1){if(t<=0)throw RangeError(`chunk size must be greater than 0`);return Array.from({length:Math.ceil(e.length/t)},(n,r)=>e.slice(r*t,r*t+t))}function t(e){return e.filter(e=>!!e&&!Number.isNaN(e))}function n(e){return e.at(-1)}function r(e,{sort:t=!1,compareFn:n}={}){let r=[...new Set(e)];return t?n?r.sort(n):r.sort():r}export{e as chunk,t as compact,n as lastElement,r as unique};
+function e(e,t=1){if(t<=0)throw RangeError(`chunk size must be greater than 0`);return Array.from({length:Math.ceil(e.length/t)},(n,r)=>e.slice(r*t,r*t+t))}function t(e){return e.filter(e=>!!e&&!Number.isNaN(e))}function n(e){return e.at(-1)}function r(e,{sort:t=!1,compareFn:n}={}){let r=[...new Set(e)];return t?n?r.sort(n):r.sort():r}export{e as chunk,t as compact,n as lastElement,r as unique};

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@js-utils-kit/array",
-  "version": "0.1.0",
+  "version": "0.2.0",
   "description": "Array utilities",
   "private": false,
   "license": "MIT",
@@ -35,7 +35,7 @@
     }
   },
   "dependencies": {
-    "@js-utils-kit/types": "1.1.0"
+    "@js-utils-kit/types": "1.2.0"
   },
   "scripts": {
     "build": "tsdown",