xjs-common 13.0.3 → 13.2.0

package/build/cjs/func/u-array.js

@@ -39,6 +39,27 @@ var UArray;
         return result;
     }
     UArray.distinct = distinct;
+    function duplicate(array, op) {
+        if (!array || array.length === 0)
+            return [];
+        if (op?.k)
+            return Array.from((0, u_1.array2map)(array, e => e[op.k]).values()).filter(a => a.length > 1).flatMap(a => a);
+        const a = [...array], result = [];
+        const p = op?.predicate ?? ((v1, v2) => v1 == v2);
+        while (a.length > 0) {
+            const e = a.pop();
+            let dup = [];
+            for (let i = a.length - 1, e2 = a[i]; i >= 0; i--, e2 = a[i])
+                if (p(e, e2)) {
+                    a.splice(i, 1);
+                    dup.push(e2);
+                }
+            if (dup.length > 0)
+                result.push(...dup, e);
+        }
+        return result;
+    }
+    UArray.duplicate = duplicate;
     function chop(array, len) {
         return [...Array(Math.ceil(array.length / len)).keys()]
             .map(i => {

package/build/cjs/func/u-obj.js

@@ -72,7 +72,7 @@ var UObj;
     }
     UObj.manipulateProperties = manipulateProperties;
     /**
-     * generate a record object which contains spedified keys with values generated from value generator.
+     * generate a record object which contains specified keys with values generated from value generator.
      * @param keys keys contained in the object.
      * @param vgen value generator.
      */

package/build/cjs/func/u.js

@@ -4,7 +4,6 @@ exports.getJSTDate = getJSTDate;
 exports.delay = delay;
 exports.int2array = int2array;
 exports.array2map = array2map;
-exports.bitor = bitor;
 exports.retry = retry;
 const xjs_err_1 = require("../obj/xjs-err");
 const s_errCode = 10;
@@ -20,20 +19,18 @@ function int2array(size) {
         throw new xjs_err_1.XjsErr(s_errCode, "size of the argument is not number.");
     return Array.from(Array(s).keys());
 }
-function array2map(array, keyGen) {
+function array2map(array, keyGen, op) {
+    const _acm = op?.accumulate ?? true;
     const map = new Map();
     for (const e of array) {
         const k = keyGen(e);
         if (map.has(k))
-            map.get(k).push(e);
+            _acm && map.get(k).push(e);
         else
-            map.set(k, [e]);
+            map.set(k, _acm ? [e] : e);
     }
     return map;
 }
-function bitor(...bit) {
-    return bit.reduce((a, b) => a | b);
-}
 ;
 ;
 ;
@@ -46,9 +43,11 @@ function retry(cb, op) {
         l.warn(e);
         return true;
     };
-    const prcs = (c) => {
-        if (c < 0)
-            throw new xjs_err_1.XjsErr(s_errCode, "failure exceeds retryable count.");
+    const prcs = (c, e) => {
+        if (c < 0) {
+            l.error("failure exceeds retryable count.");
+            throw e ?? new xjs_err_1.XjsErr(s_errCode, "failure exceeds retryable count.");
+        }
         let ret = null;
         const innerPrcs = () => {
             try {
@@ -56,7 +55,7 @@ function retry(cb, op) {
             }
             catch (e) {
                 if (handleError(e))
-                    ret = prcs(c - 1);
+                    ret = prcs(c - 1, e);
                 else
                     throw e;
             }
@@ -64,7 +63,7 @@ function retry(cb, op) {
                 return new Promise((resolve, reject) => ret.then(resolve).catch((e) => {
                     if (handleError(e))
                         try {
-                            ret = resolve(prcs(c - 1));
+                            ret = resolve(prcs(c - 1, e));
                         }
                         catch (e2) {
                             reject(e2);

package/build/esm/func/u-array.d.ts

@@ -14,7 +14,7 @@ export declare namespace UArray {
         useStrictEqual?: boolean;
     }): boolean;
     /**
-     * returns array which is removed duplicate of elements.
+     * returns an array which is removed duplicate of elements.
      * this doesn't mutate the param.
      */
     function distinct<T>(array: T[]): T[];
@@ -27,7 +27,18 @@ export declare namespace UArray {
         takeLast?: boolean;
     }): T[];
     /**
-     * chop array to partial arrays which have specified length. the remainder is added to end of a result.
+     * returns an array which contains duplicate values of the original array.
+     * this doesn't mutate the param.
+     */
+    function duplicate<T>(array: T[]): T[];
+    function duplicate<T>(array: T[], op?: {
+        k?: keyof T;
+    }): T[];
+    function duplicate<T>(array: T[], op?: {
+        predicate?: (v1: T, v2: T) => boolean;
+    }): T[];
+    /**
+     * chop an array to partial arrays which have specified length. the remainder is added to end of a result.
      * this function has compatibility to {@link AlmostArray} like {@link Uint8Array} etc.
      */
     function chop<E>(array: E[], len: number): E[][];

package/build/esm/func/u-array.js

@@ -36,6 +36,27 @@ export var UArray;
         return result;
     }
     UArray.distinct = distinct;
+    function duplicate(array, op) {
+        if (!array || array.length === 0)
+            return [];
+        if (op?.k)
+            return Array.from(array2map(array, e => e[op.k]).values()).filter(a => a.length > 1).flatMap(a => a);
+        const a = [...array], result = [];
+        const p = op?.predicate ?? ((v1, v2) => v1 == v2);
+        while (a.length > 0) {
+            const e = a.pop();
+            let dup = [];
+            for (let i = a.length - 1, e2 = a[i]; i >= 0; i--, e2 = a[i])
+                if (p(e, e2)) {
+                    a.splice(i, 1);
+                    dup.push(e2);
+                }
+            if (dup.length > 0)
+                result.push(...dup, e);
+        }
+        return result;
+    }
+    UArray.duplicate = duplicate;
     function chop(array, len) {
         return [...Array(Math.ceil(array.length / len)).keys()]
             .map(i => {

package/build/esm/func/u-obj.d.ts

@@ -37,7 +37,7 @@ export declare namespace UObj {
         targetType?: MaybeArray<Exclude<Type, "object" | "null" | "undefined">>;
     }): T;
     /**
-     * generate a record object which contains spedified keys with values generated from value generator.
+     * generate a record object which contains specified keys with values generated from value generator.
      * @param keys keys contained in the object.
      * @param vgen value generator.
      */

package/build/esm/func/u-obj.js

@@ -69,7 +69,7 @@ export var UObj;
     }
     UObj.manipulateProperties = manipulateProperties;
     /**
-     * generate a record object which contains spedified keys with values generated from value generator.
+     * generate a record object which contains specified keys with values generated from value generator.
      * @param keys keys contained in the object.
      * @param vgen value generator.
      */

package/build/esm/func/u.d.ts

@@ -2,8 +2,19 @@ import { Loggable, MaybePromise } from "../const/types";
 export declare function getJSTDate(d?: Date): Date;
 export declare function delay(sec: number): Promise<void>;
 export declare function int2array(size: number): number[];
+/**
+ * generate `Map` object from an array.
+ * @param array source array.
+ * @param keyGen predicate which generates map keys from a value of the array.
+ * @param op.accumulate flag whether values of the map are accumulated or not if key/value from the array conflict. default is true.
+ */
 export declare function array2map<K, T>(array: T[], keyGen: (e: T) => K): Map<K, T[]>;
-export declare function bitor(...bit: number[]): number;
+export declare function array2map<K, T>(array: T[], keyGen: (e: T) => K, op: {
+    accumulate: false;
+}): Map<K, T>;
+export declare function array2map<K, T>(array: T[], keyGen: (e: T) => K, op?: {
+    accumulate?: boolean;
+}): Map<K, T[]>;
 export interface RetryOption<T = MaybePromise> {
     /**
      * number of retries. default is 1.

package/build/esm/func/u.js

@@ -12,20 +12,18 @@ export function int2array(size) {
         throw new XjsErr(s_errCode, "size of the argument is not number.");
     return Array.from(Array(s).keys());
 }
-export function array2map(array, keyGen) {
+export function array2map(array, keyGen, op) {
+    const _acm = op?.accumulate ?? true;
     const map = new Map();
     for (const e of array) {
         const k = keyGen(e);
         if (map.has(k))
-            map.get(k).push(e);
+            _acm && map.get(k).push(e);
         else
-            map.set(k, [e]);
+            map.set(k, _acm ? [e] : e);
     }
     return map;
 }
-export function bitor(...bit) {
-    return bit.reduce((a, b) => a | b);
-}
 ;
 ;
 ;
@@ -38,9 +36,11 @@ export function retry(cb, op) {
         l.warn(e);
         return true;
     };
-    const prcs = (c) => {
-        if (c < 0)
-            throw new XjsErr(s_errCode, "failure exceeds retryable count.");
+    const prcs = (c, e) => {
+        if (c < 0) {
+            l.error("failure exceeds retryable count.");
+            throw e ?? new XjsErr(s_errCode, "failure exceeds retryable count.");
+        }
         let ret = null;
         const innerPrcs = () => {
             try {
@@ -48,7 +48,7 @@ export function retry(cb, op) {
             }
             catch (e) {
                 if (handleError(e))
-                    ret = prcs(c - 1);
+                    ret = prcs(c - 1, e);
                 else
                     throw e;
             }
@@ -56,7 +56,7 @@ export function retry(cb, op) {
                 return new Promise((resolve, reject) => ret.then(resolve).catch((e) => {
                     if (handleError(e))
                         try {
-                            ret = resolve(prcs(c - 1));
+                            ret = resolve(prcs(c - 1, e));
                         }
                         catch (e2) {
                             reject(e2);

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "xjs-common",
-  "version": "13.0.3",
+  "version": "13.2.0",
   "description": "library modules for typescript that bundled general-purpose implementations.",
   "repository": {
     "type": "git",