@etsoo/shared 1.2.69 → 1.2.70

package/README.md

@@ -112,16 +112,17 @@ ETSOO Extended abstract history class
 
 Array related utilities
 
-|        Name | Description                                            |
-| ----------: | ------------------------------------------------------ |
-| differences | Array 1 items do not exist in Array 2 or reverse match |
-|         max | Get max number item or number item property            |
-|     maxItem | Get max field value item                               |
-|         min | Get min number item or number item property            |
-|     minItem | Get min field value item                               |
-|      remove | Remove items by value or condition                     |
-|         sum | Sum number items or number item properties             |
-|    toUnique | Make all items are unique                              |
+|        Name | Description                                                  |
+| ----------: | ------------------------------------------------------------ |
+| differences | Array 1 items do not exist in Array 2 or reverse match       |
+|         max | Get max number item or number item property                  |
+|     maxItem | Get max field value item                                     |
+| mergeArrays | Merge arrays, remove duplicates, and sort by the first array |
+|         min | Get min number item or number item property                  |
+|     minItem | Get min field value item                                     |
+|      remove | Remove items by value or condition                           |
+|         sum | Sum number items or number item properties                   |
+|    toUnique | Make all items are unique                                    |
 
 ## DataTypes
 

package/__tests__/ArrayUtils.ts

@@ -63,6 +63,15 @@ test("Tests for maxItem / minItem", () => {
   expect(emptyItems.maxItem("amount")).toBeUndefined();
 });
 
+test("Tests for mergeArrays", () => {
+  const a1 = ["e", "a", "c"];
+  const a2 = ["a", "c", "d"];
+  const a3 = ["b", "c", "f"];
+  const result = ArrayUtils.mergeArrays(a1, a2, a3);
+  expect(result).toEqual(["e", "a", "c", "d", "b", "f"]);
+  expect(result.length).toBe(6);
+});
+
 test("Tests for remove simple", () => {
   const items = [1, 2, 3, 4, 5];
   const result = items.remove(1, 5, (item) => item % 2 === 0);

package/lib/cjs/ArrayUtils.d.ts

@@ -61,4 +61,11 @@ export declare namespace ArrayUtils {
      * @param round A round for both matches
      */
     function differences<T>(a1: T[], a2: T[], round?: boolean): T[];
+    /**
+     * Merge arrays, remove duplicates, and sort by the first array
+     * @param sort Array to sort
+     * @param param All arrays to merge
+     * @returns Result
+     */
+    function mergeArrays<T>(sort: T[], ...param: T[][]): T[];
 }

package/lib/cjs/ArrayUtils.js

@@ -99,4 +99,24 @@ var ArrayUtils;
         return diff;
     }
     ArrayUtils.differences = differences;
+    /**
+     * Merge arrays, remove duplicates, and sort by the first array
+     * @param sort Array to sort
+     * @param param All arrays to merge
+     * @returns Result
+     */
+    function mergeArrays(sort, ...param) {
+        const result = [...sort];
+        for (let i = 0; i < param.length; i++) {
+            const arr = param[i];
+            for (let j = 0; j < arr.length; j++) {
+                const item = arr[j];
+                if (!result.includes(item)) {
+                    result.push(item);
+                }
+            }
+        }
+        return result;
+    }
+    ArrayUtils.mergeArrays = mergeArrays;
 })(ArrayUtils || (exports.ArrayUtils = ArrayUtils = {}));

package/lib/mjs/ArrayUtils.d.ts

@@ -61,4 +61,11 @@ export declare namespace ArrayUtils {
      * @param round A round for both matches
      */
     function differences<T>(a1: T[], a2: T[], round?: boolean): T[];
+    /**
+     * Merge arrays, remove duplicates, and sort by the first array
+     * @param sort Array to sort
+     * @param param All arrays to merge
+     * @returns Result
+     */
+    function mergeArrays<T>(sort: T[], ...param: T[][]): T[];
 }

package/lib/mjs/ArrayUtils.js

@@ -93,4 +93,24 @@ export var ArrayUtils;
         return diff;
     }
     ArrayUtils.differences = differences;
+    /**
+     * Merge arrays, remove duplicates, and sort by the first array
+     * @param sort Array to sort
+     * @param param All arrays to merge
+     * @returns Result
+     */
+    function mergeArrays(sort, ...param) {
+        const result = [...sort];
+        for (let i = 0; i < param.length; i++) {
+            const arr = param[i];
+            for (let j = 0; j < arr.length; j++) {
+                const item = arr[j];
+                if (!result.includes(item)) {
+                    result.push(item);
+                }
+            }
+        }
+        return result;
+    }
+    ArrayUtils.mergeArrays = mergeArrays;
 })(ArrayUtils || (ArrayUtils = {}));

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@etsoo/shared",
-  "version": "1.2.69",
+  "version": "1.2.70",
   "description": "TypeScript shared utilities and functions",
   "main": "lib/cjs/index.js",
   "module": "lib/mjs/index.js",
@@ -37,10 +37,10 @@
   "homepage": "https://github.com/ETSOO/Shared#readme",
   "devDependencies": {
     "@types/lodash.isequal": "^4.5.8",
-    "@vitejs/plugin-react": "^4.4.0",
+    "@vitejs/plugin-react": "^4.4.1",
     "jsdom": "^26.1.0",
     "typescript": "^5.8.3",
-    "vitest": "^3.1.1"
+    "vitest": "^3.1.2"
   },
   "dependencies": {
     "lodash.isequal": "^4.5.0"

package/src/ArrayUtils.ts

@@ -212,4 +212,26 @@ export namespace ArrayUtils {
     if (round) return [...diff, ...a2.filter((x) => !a1.includes(x))];
     return diff;
   }
+
+  /**
+   * Merge arrays, remove duplicates, and sort by the first array
+   * @param sort Array to sort
+   * @param param All arrays to merge
+   * @returns Result
+   */
+  export function mergeArrays<T>(sort: T[], ...param: T[][]): T[] {
+    const result = [...sort];
+
+    for (let i = 0; i < param.length; i++) {
+      const arr = param[i];
+      for (let j = 0; j < arr.length; j++) {
+        const item = arr[j];
+        if (!result.includes(item)) {
+          result.push(item);
+        }
+      }
+    }
+
+    return result;
+  }
 }