xjs-common 11.0.2 → 12.0.0-alpha.2

package/LICENSE

@@ -1,202 +1,202 @@
-
-                                 Apache License
-                           Version 2.0, January 2004
-                        http://www.apache.org/licenses/
-
-   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
-
-   1. Definitions.
-
-      "License" shall mean the terms and conditions for use, reproduction,
-      and distribution as defined by Sections 1 through 9 of this document.
-
-      "Licensor" shall mean the copyright owner or entity authorized by
-      the copyright owner that is granting the License.
-
-      "Legal Entity" shall mean the union of the acting entity and all
-      other entities that control, are controlled by, or are under common
-      control with that entity. For the purposes of this definition,
-      "control" means (i) the power, direct or indirect, to cause the
-      direction or management of such entity, whether by contract or
-      otherwise, or (ii) ownership of fifty percent (50%) or more of the
-      outstanding shares, or (iii) beneficial ownership of such entity.
-
-      "You" (or "Your") shall mean an individual or Legal Entity
-      exercising permissions granted by this License.
-
-      "Source" form shall mean the preferred form for making modifications,
-      including but not limited to software source code, documentation
-      source, and configuration files.
-
-      "Object" form shall mean any form resulting from mechanical
-      transformation or translation of a Source form, including but
-      not limited to compiled object code, generated documentation,
-      and conversions to other media types.
-
-      "Work" shall mean the work of authorship, whether in Source or
-      Object form, made available under the License, as indicated by a
-      copyright notice that is included in or attached to the work
-      (an example is provided in the Appendix below).
-
-      "Derivative Works" shall mean any work, whether in Source or Object
-      form, that is based on (or derived from) the Work and for which the
-      editorial revisions, annotations, elaborations, or other modifications
-      represent, as a whole, an original work of authorship. For the purposes
-      of this License, Derivative Works shall not include works that remain
-      separable from, or merely link (or bind by name) to the interfaces of,
-      the Work and Derivative Works thereof.
-
-      "Contribution" shall mean any work of authorship, including
-      the original version of the Work and any modifications or additions
-      to that Work or Derivative Works thereof, that is intentionally
-      submitted to Licensor for inclusion in the Work by the copyright owner
-      or by an individual or Legal Entity authorized to submit on behalf of
-      the copyright owner. For the purposes of this definition, "submitted"
-      means any form of electronic, verbal, or written communication sent
-      to the Licensor or its representatives, including but not limited to
-      communication on electronic mailing lists, source code control systems,
-      and issue tracking systems that are managed by, or on behalf of, the
-      Licensor for the purpose of discussing and improving the Work, but
-      excluding communication that is conspicuously marked or otherwise
-      designated in writing by the copyright owner as "Not a Contribution."
-
-      "Contributor" shall mean Licensor and any individual or Legal Entity
-      on behalf of whom a Contribution has been received by Licensor and
-      subsequently incorporated within the Work.
-
-   2. Grant of Copyright License. Subject to the terms and conditions of
-      this License, each Contributor hereby grants to You a perpetual,
-      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-      copyright license to reproduce, prepare Derivative Works of,
-      publicly display, publicly perform, sublicense, and distribute the
-      Work and such Derivative Works in Source or Object form.
-
-   3. Grant of Patent License. Subject to the terms and conditions of
-      this License, each Contributor hereby grants to You a perpetual,
-      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-      (except as stated in this section) patent license to make, have made,
-      use, offer to sell, sell, import, and otherwise transfer the Work,
-      where such license applies only to those patent claims licensable
-      by such Contributor that are necessarily infringed by their
-      Contribution(s) alone or by combination of their Contribution(s)
-      with the Work to which such Contribution(s) was submitted. If You
-      institute patent litigation against any entity (including a
-      cross-claim or counterclaim in a lawsuit) alleging that the Work
-      or a Contribution incorporated within the Work constitutes direct
-      or contributory patent infringement, then any patent licenses
-      granted to You under this License for that Work shall terminate
-      as of the date such litigation is filed.
-
-   4. Redistribution. You may reproduce and distribute copies of the
-      Work or Derivative Works thereof in any medium, with or without
-      modifications, and in Source or Object form, provided that You
-      meet the following conditions:
-
-      (a) You must give any other recipients of the Work or
-          Derivative Works a copy of this License; and
-
-      (b) You must cause any modified files to carry prominent notices
-          stating that You changed the files; and
-
-      (c) You must retain, in the Source form of any Derivative Works
-          that You distribute, all copyright, patent, trademark, and
-          attribution notices from the Source form of the Work,
-          excluding those notices that do not pertain to any part of
-          the Derivative Works; and
-
-      (d) If the Work includes a "NOTICE" text file as part of its
-          distribution, then any Derivative Works that You distribute must
-          include a readable copy of the attribution notices contained
-          within such NOTICE file, excluding those notices that do not
-          pertain to any part of the Derivative Works, in at least one
-          of the following places: within a NOTICE text file distributed
-          as part of the Derivative Works; within the Source form or
-          documentation, if provided along with the Derivative Works; or,
-          within a display generated by the Derivative Works, if and
-          wherever such third-party notices normally appear. The contents
-          of the NOTICE file are for informational purposes only and
-          do not modify the License. You may add Your own attribution
-          notices within Derivative Works that You distribute, alongside
-          or as an addendum to the NOTICE text from the Work, provided
-          that such additional attribution notices cannot be construed
-          as modifying the License.
-
-      You may add Your own copyright statement to Your modifications and
-      may provide additional or different license terms and conditions
-      for use, reproduction, or distribution of Your modifications, or
-      for any such Derivative Works as a whole, provided Your use,
-      reproduction, and distribution of the Work otherwise complies with
-      the conditions stated in this License.
-
-   5. Submission of Contributions. Unless You explicitly state otherwise,
-      any Contribution intentionally submitted for inclusion in the Work
-      by You to the Licensor shall be under the terms and conditions of
-      this License, without any additional terms or conditions.
-      Notwithstanding the above, nothing herein shall supersede or modify
-      the terms of any separate license agreement you may have executed
-      with Licensor regarding such Contributions.
-
-   6. Trademarks. This License does not grant permission to use the trade
-      names, trademarks, service marks, or product names of the Licensor,
-      except as required for reasonable and customary use in describing the
-      origin of the Work and reproducing the content of the NOTICE file.
-
-   7. Disclaimer of Warranty. Unless required by applicable law or
-      agreed to in writing, Licensor provides the Work (and each
-      Contributor provides its Contributions) on an "AS IS" BASIS,
-      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
-      implied, including, without limitation, any warranties or conditions
-      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
-      PARTICULAR PURPOSE. You are solely responsible for determining the
-      appropriateness of using or redistributing the Work and assume any
-      risks associated with Your exercise of permissions under this License.
-
-   8. Limitation of Liability. In no event and under no legal theory,
-      whether in tort (including negligence), contract, or otherwise,
-      unless required by applicable law (such as deliberate and grossly
-      negligent acts) or agreed to in writing, shall any Contributor be
-      liable to You for damages, including any direct, indirect, special,
-      incidental, or consequential damages of any character arising as a
-      result of this License or out of the use or inability to use the
-      Work (including but not limited to damages for loss of goodwill,
-      work stoppage, computer failure or malfunction, or any and all
-      other commercial damages or losses), even if such Contributor
-      has been advised of the possibility of such damages.
-
-   9. Accepting Warranty or Additional Liability. While redistributing
-      the Work or Derivative Works thereof, You may choose to offer,
-      and charge a fee for, acceptance of support, warranty, indemnity,
-      or other liability obligations and/or rights consistent with this
-      License. However, in accepting such obligations, You may act only
-      on Your own behalf and on Your sole responsibility, not on behalf
-      of any other Contributor, and only if You agree to indemnify,
-      defend, and hold each Contributor harmless for any liability
-      incurred by, or claims asserted against, such Contributor by reason
-      of your accepting any such warranty or additional liability.
-
-   END OF TERMS AND CONDITIONS
-
-   APPENDIX: How to apply the Apache License to your work.
-
-      To apply the Apache License to your work, attach the following
-      boilerplate notice, with the fields enclosed by brackets "[]"
-      replaced with your own identifying information. (Don't include
-      the brackets!)  The text should be enclosed in the appropriate
-      comment syntax for the file format. We also recommend that a
-      file or class name and description of purpose be included on the
-      same "printed page" as the copyright notice for easier
-      identification within third-party archives.
-
-   Copyright 2025 begyyal
-
-   Licensed under the Apache License, Version 2.0 (the "License");
-   you may not use this file except in compliance with the License.
-   You may obtain a copy of the License at
-
-       http://www.apache.org/licenses/LICENSE-2.0
-
-   Unless required by applicable law or agreed to in writing, software
-   distributed under the License is distributed on an "AS IS" BASIS,
-   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-   See the License for the specific language governing permissions and
+
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright 2025 begyyal
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
    limitations under the License.

package/build/const/types.d.ts

@@ -1,6 +1,7 @@
 export type IndexSignature = string | number | symbol;
 export type NormalRecord<T = any> = Record<IndexSignature, T>;
-export type MaybeArray<T> = T | T[];
+export type MaybeArray<T = any> = T | T[];
+export type MaybePromise<T = any> = T | Promise<T>;
 export type Loggable = {
     log: (msg: any) => void;
     warn: (msg: any) => void;
@@ -12,6 +13,43 @@ export type Unique<T = number> = {
 export type IdName<T = number> = {
     name: string;
 } & Unique<T>;
+export type Any = string | number | bigint | boolean | symbol | object | undefined | null;
+export interface AlmostArray<E = any> extends ArrayLike<E> {
+    /** {@link Array.copyWithin()} */
+    copyWithin(target: number, start: number, end?: number): this;
+    /** {@link Array.every()} */
+    every(predicate: (value: E, index: number, array: this) => unknown, thisArg?: any): boolean;
+    /** {@link Array.fill()} */
+    fill(value: E, start?: number, end?: number): this;
+    /** {@link Array.filter()} */
+    filter(predicate: (value: E, index: number, array: this) => any, thisArg?: any): this;
+    /** {@link Array.find()} */
+    find(predicate: (value: E, index: number, obj: this) => boolean, thisArg?: any): E | undefined;
+    /** {@link Array.findIndex()} */
+    findIndex(predicate: (value: E, index: number, obj: this) => boolean, thisArg?: any): number;
+    /** {@link Array.forEach()} */
+    forEach(callbackfn: (value: E, index: number, array: this) => void, thisArg?: any): void;
+    /** {@link Array.indexOf()} */
+    indexOf(searchElement: E, fromIndex?: number): number;
+    /** {@link Array.join()} */
+    join(separator?: string): string;
+    /** {@link Array.lastIndexOf()} */
+    lastIndexOf(searchElement: E, fromIndex?: number): number;
+    /** {@link Array.map()} */
+    map(callbackfn: (value: E, index: number, array: this) => number, thisArg?: any): this;
+    /** {@link Array.reduce()} */
+    reduce<U = E>(callbackfn: (previousValue: U, currentValue: number, currentIndex: number, array: this) => U, initialValue?: U): U;
+    /** {@link Array.reduceRight()} */
+    reduceRight<U = E>(callbackfn: (previousValue: U, currentValue: number, currentIndex: number, array: this) => U, initialValue?: U): U;
+    /** {@link Array.reverse()} */
+    reverse(): this;
+    /** {@link Array.slice()} */
+    slice(start?: number, end?: number): this;
+    /** {@link Array.some()} */
+    some(predicate: (value: E, index: number, array: this) => unknown, thisArg?: any): boolean;
+    /** {@link Array.sort()} */
+    sort(compareFn?: (a: E, b: E) => number): this;
+}
 export declare enum Type {
     string = "string",
     number = "number",
@@ -22,3 +60,9 @@ export declare enum Type {
     undefined = "undefined",
     null = "null"
 }
+export type NonString = Exclude<Any, string>;
+export type NonNumber = Exclude<Any, number>;
+export type NonBigint = Exclude<Any, bigint>;
+export type NonBoolean = Exclude<Any, boolean>;
+export type NonSymbol = Exclude<Any, symbol>;
+export type NonObject = Exclude<Any, object>;

package/build/func/decorator/d-type.d.ts

@@ -1,11 +1,30 @@
 import { Type } from "../../const/types";
 export declare const smbl_tm: unique symbol;
-export interface TypeDesc {
+interface BasicTypeDesc {
     t?: Type;
     req?: boolean;
+}
+export interface TypeDesc extends BasicTypeDesc {
     ary?: TypeDesc;
     rec?: boolean;
+    rcd?: TypeDesc;
 }
+type ArrayTypeDesc = TypeDesc & {
+    t?: never;
+    rec?: never;
+    rcd?: never;
+};
+type ClassTypeDesc = TypeDesc & {
+    t?: never;
+    ary?: never;
+    rcd?: never;
+};
+type RecordTypeDesc = TypeDesc & {
+    t?: never;
+    arys?: never;
+    rec?: never;
+};
+type AnyTypeDesc = BasicTypeDesc | ArrayTypeDesc | ClassTypeDesc | RecordTypeDesc;
 export interface TypeMap {
     [k: string]: TypeDesc;
 }
@@ -18,7 +37,10 @@ export declare namespace DType {
     function number(target: Object, propKey: string): void;
     function boolean(target: Object, propKey: string): void;
     function required(target: Object, propKey: string): void;
-    function array(elmDesc?: TypeDesc): (target: Object, propKey: string) => void;
+    function array(elmDesc?: AnyTypeDesc): (target: Object, propKey: string) => void;
+    /** NOTE: this may allow array type because array is essentialy object type has properties. */
+    function record(elmDesc?: AnyTypeDesc): (target: Object, propKey: string) => void;
     function recursive(target: Object, propKey: string): void;
     function keep(target: Object, propKey: string): void;
 }
+export {};

package/build/func/decorator/d-type.js

@@ -35,6 +35,11 @@ export var DType;
         return (target, propKey) => setDesc(target, propKey, (td) => td.ary = elmDesc);
     }
     DType.array = array;
+    /** NOTE: this may allow array type because array is essentialy object type has properties. */
+    function record(elmDesc = {}) {
+        return (target, propKey) => setDesc(target, propKey, (td) => td.rcd = elmDesc);
+    }
+    DType.record = record;
     function recursive(target, propKey) {
         setDesc(target, propKey, (td) => td.rec = true);
     }
@@ -45,24 +50,23 @@ export var DType;
     DType.keep = keep;
     function setDesc(target, propKey, setter) {
         const map = target[smbl_tm] ? Object.assign({}, target[smbl_tm]) : {};
-        map[propKey] ??= { t: null, req: false, rec: false, ary: null };
+        map[propKey] ??= { t: null, req: false, rec: false, ary: null, rcd: null };
         const td = map[propKey];
         setter(td);
-        let ex1 = null, ex2 = null;
-        if (td.t && td.rec) {
-            ex1 = "type";
-            ex2 = "recursive flag";
-        }
-        if (td.t && td.ary) {
-            ex1 = "type";
-            ex2 = "array";
-        }
-        if (td.ary && td.rec) {
-            ex1 = "array";
-            ex2 = "recursive flag";
+        const structualDescs = [[td.ary, "array"], [td.rec, "recursive flag"], [td.rcd, "record"]].filter(e => e[0]);
+        if (structualDescs.length > 0) {
+            let ex1 = null, ex2 = null;
+            if (td.t) {
+                ex1 = "type";
+                ex2 = structualDescs[0][1];
+            }
+            if (structualDescs.length > 1) {
+                ex1 = structualDescs[0][1];
+                ex2 = structualDescs[1][1];
+            }
+            if (ex1 && ex2)
+                throw new XjsErr(s_errCode, `decorator to express ${ex1} and ${ex2} are exclusive.`);
         }
-        if (ex1 && ex2)
-            throw new XjsErr(s_errCode, `decorator to express ${ex1} and ${ex2} are exclusive.`);
         Object.defineProperty(target, smbl_tm, { value: map, configurable: true });
     }
 })(DType || (DType = {}));

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

@@ -1,24 +1,18 @@
+import { AlmostArray } from "../const/types";
 export declare namespace UArray {
     /**
      * compares two arrays to valuate equality.
      * if one side is null or undefined, it returns true when other side is the same.
+     * this function has compatibility to `AlmostArray` like `Uint8Array` etc.
      * @param v1 it uses equal operator for comparing elements, so applying object element is not recommended.
      * @param v2 same as v1.
-     * @param sort it uses {@link Array#sort} on v1 and v2 if true. default is true.
-     * @param useStrictEqual it uses `===` operator for compareing elements if true, otherwise using `==` operator. default is true.
+     * @param sort it uses {@link Array.sort()} on v1 and v2 if true. default is true.
+     * @param useStrictEqual check equality whether `Array` or not and it uses `===` operator for compareing elements if true, otherwise using `==` operator. default is true.
      */
-    function eq(v1: any[], v2: any[], op: {
+    function eq(v1: any[] | AlmostArray, v2: any[] | AlmostArray, op?: {
         sort?: boolean;
-        useStrictEqual: false;
+        useStrictEqual?: boolean;
     }): boolean;
-    function eq<T>(v1: T[], v2: T[], op: {
-        sort?: boolean;
-        useStrictEqual: true;
-    }): boolean;
-    function eq<T>(v1: T[], v2: T[], op: {
-        sort?: boolean;
-    }): boolean;
-    function eq<T>(v1: T[], v2: T[]): boolean;
     /**
      * returns array which is removed duplicate of elements.
      * this doesn't mutate the param.
@@ -32,7 +26,12 @@ export declare namespace UArray {
         predicate: (v1: T, v2: T) => boolean;
         takeLast?: boolean;
     }): T[];
-    function chop<T>(array: T[], len: number): T[][];
+    /**
+     * chop array to partial arrays which have specified length. the remainder is added to end of a result.
+     * this function has compatibility to `AlmostArray` like `Uint8Array` etc.
+     */
+    function chop<E>(array: E[], len: number): E[][];
+    function chop<T extends AlmostArray>(array: T, len: number): T[];
     function remove<T>(array: T[], v: T): void;
     function randomPick<T>(array: T[], takeout?: boolean): T;
     function shuffle<T>(array: T[]): T[];

package/build/func/u-array.js

@@ -1,6 +1,15 @@
 import { array2map, int2array } from "./u";
 export var UArray;
 (function (UArray) {
+    /**
+     * compares two arrays to valuate equality.
+     * if one side is null or undefined, it returns true when other side is the same.
+     * this function has compatibility to `AlmostArray` like `Uint8Array` etc.
+     * @param v1 it uses equal operator for comparing elements, so applying object element is not recommended.
+     * @param v2 same as v1.
+     * @param sort it uses {@link Array.sort()} on v1 and v2 if true. default is true.
+     * @param useStrictEqual check equality whether `Array` or not and it uses `===` operator for compareing elements if true, otherwise using `==` operator. default is true.
+     */
     function eq(v1, v2, op = {}) {
         const { sort, useStrictEqual } = Object.assign({ sort: true, useStrictEqual: true }, op);
         if (v1 && !v2 || !v1 && v2)
@@ -9,7 +18,9 @@ export var UArray;
             return true;
         if (v1.length !== v2.length)
             return false;
-        const a = sort ? [...v1].sort() : v1, b = sort ? [...v2].sort() : v2;
+        if (useStrictEqual && v1 instanceof Array !== v2 instanceof Array)
+            return false;
+        const a = sort ? v1.slice().sort() : v1, b = sort ? v2.slice().sort() : v2;
         return a.every((v, i) => useStrictEqual ? v === b[i] : v == b[i]);
     }
     UArray.eq = eq;

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

@@ -1,4 +1,4 @@
-import { NormalRecord } from "../const/types";
+import { MaybeArray, NonObject, NormalRecord, Type } from "../const/types";
 export declare namespace UObj {
     /**
      * assign properties to the object with specified property keys.
@@ -10,9 +10,23 @@ export declare namespace UObj {
     function assignProperties<T extends NormalRecord, S extends NormalRecord>(t: T, s: S, keys?: (keyof S)[], keepDtypeClass?: boolean): T & Partial<S>;
     /**
      * crop properties of the object. the properties is removed with `delete` operator.
-     * @param o object which properties is removed.
+     * @param o object whose properties is removed.
      * @param keys property names to be remained. if omit this, it removes the properties other than properties decorated {@link DType}.
      * @param exclusive if true, it removes `keys` instead of remaining it.
      */
     function crop<T extends NormalRecord>(o: T, keys?: (keyof T)[], exclusive?: boolean): Partial<T>;
+    /**
+     * manipulate properties of an object.
+     * as default if the properties contains object, it also manipulates properties of that recursively.
+     * @param o object whose properties the process applies to.
+     * @param process process to be applied to properties of the object. note that function property is not included in the properties.
+     * @param op.ignoreEmpty skip null or undefined properties to manipuldate. default is true.
+     * @param op.recursive whether it manipulate properties of an object recursively. default is true.
+     * @param op.targetType primitive types which filter the properties to be processed.
+     */
+    function manipulateProperties<T extends NormalRecord>(o: T, process: (v: NonObject) => NonObject, op?: {
+        ignoreEmpty?: boolean;
+        recursive?: boolean;
+        targetType?: MaybeArray<Exclude<Type, "object" | "null" | "undefined">>;
+    }): T;
 }

package/build/func/u-obj.js

@@ -22,7 +22,7 @@ export var UObj;
     UObj.assignProperties = assignProperties;
     /**
      * crop properties of the object. the properties is removed with `delete` operator.
-     * @param o object which properties is removed.
+     * @param o object whose properties is removed.
      * @param keys property names to be remained. if omit this, it removes the properties other than properties decorated {@link DType}.
      * @param exclusive if true, it removes `keys` instead of remaining it.
      */
@@ -38,4 +38,32 @@ export var UObj;
         return o;
     }
     UObj.crop = crop;
+    /**
+     * manipulate properties of an object.
+     * as default if the properties contains object, it also manipulates properties of that recursively.
+     * @param o object whose properties the process applies to.
+     * @param process process to be applied to properties of the object. note that function property is not included in the properties.
+     * @param op.ignoreEmpty skip null or undefined properties to manipuldate. default is true.
+     * @param op.recursive whether it manipulate properties of an object recursively. default is true.
+     * @param op.targetType primitive types which filter the properties to be processed.
+     */
+    function manipulateProperties(o, process, op) {
+        const target = op?.targetType && UType.takeAsArray(op?.targetType);
+        const _ignoreEmpty = !UType.isDefined(op?.ignoreEmpty) || op?.ignoreEmpty;
+        const _recursive = !UType.isDefined(op?.recursive) || op?.recursive;
+        const rec = (_o) => {
+            for (const k in _o) {
+                const prop = _o[k];
+                if (_ignoreEmpty && UType.isEmpty(prop))
+                    continue;
+                if (UType.isObject(prop) && _recursive)
+                    rec(prop);
+                else if (!UType.isFunction(prop) && (!target || target.some(t => typeof prop === t)))
+                    _o[k] = process(prop);
+            }
+        };
+        rec(o);
+        return o;
+    }
+    UObj.manipulateProperties = manipulateProperties;
 })(UObj || (UObj = {}));

package/build/func/u-type.d.ts

@@ -8,6 +8,7 @@ export declare namespace UType {
     function isBoolean(v: any): v is boolean;
     function isSymbol(v: any): v is symbol;
     function isObject(v: any): v is object;
+    function isFunction(v: any): v is Function;
     function isArray(v: any, t: Type.string): v is string[];
     function isArray(v: any, t: Type.number): v is number[];
     function isArray(v: any, t: Type.bigint): v is bigint[];

package/build/func/u-type.js

@@ -22,6 +22,8 @@ export var UType;
     UType.isSymbol = isSymbol;
     function isObject(v) { return typeof v === Type.object; }
     UType.isObject = isObject;
+    function isFunction(v) { return typeof v === "function"; }
+    UType.isFunction = isFunction;
     function isArray(v, t) {
         return Array.isArray(v) && (!t || v.every(e => typeof e === t));
     }
@@ -42,10 +44,15 @@ export var UType;
             return td.req ? [k] : [];
         if (td.t && typeof prop !== td.t)
             return [k];
+        const joinKey = (k2) => `${k}.${k2}`;
         if (td.ary)
-            return Array.isArray(prop) ? prop.flatMap(e => validateProp(k, e, td.ary)) : [k];
+            return Array.isArray(prop)
+                ? prop.flatMap((e, i) => validateProp(i.toString(), e, td.ary)).map(joinKey) : [k];
+        if (td.rcd)
+            return UType.isObject(prop)
+                ? Object.entries(prop).flatMap(e => validateProp(e[0], e[1], td.rcd)).map(joinKey) : [k];
         if (td.rec)
-            return validate(prop).flatMap(k2 => `${k}.${k2}`);
+            return validate(prop).flatMap(joinKey);
         return [];
     }
     function takeAsArray(v) {

package/build/func/u.d.ts

@@ -1,28 +1,43 @@
-import { Loggable } from "../const/types";
+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[];
 export declare function array2map<K, T>(array: T[], keyGen: (e: T) => K): Map<K, T[]>;
 export declare function bitor(...bit: number[]): number;
-export interface RetryOption<T = void | Promise<void>> {
+export interface RetryOption<T = MaybePromise> {
+    /**
+     * number of retries. default is 1.
+     */
     count?: number;
+    /**
+     * logger used for exceptions while retrying the process. default is `console` object.
+     */
     logger?: Loggable;
+    /**
+     * distinguish whether retry is required form exceptions. default is none. (i.e. allways required.)
+     */
     errorCriterion?: (e: any) => boolean;
+    /**
+     * predicate that runs between callbacks when retrying.
+     */
     intervalPredicate?: () => T;
 }
 export interface SyncRetryOption extends RetryOption<void> {
 }
 export interface AsyncRetryOption extends RetryOption {
+    /**
+     * secounds to wait between callbacks. this wait occurs after `intervalPredicate`.
+     */
     intervalSec?: number;
 }
 /**
  * runs callback with customizable retry.
  * @param cb callback to be retried.
- * @param op.count number of retries. default is 1.
- * @param op.logger logger used for exceptions while retrying the process. default is `console` object.
- * @param op.errorCriterion distinguish whether retry is required form exceptions. default is none. (i.e. allways required.)
- * @param op.intervalSec secounds to wait between callbacks. this wait occurs after `intervalPredicate`.
- * @param op.intervalPredicate predicate that runs between callbacks when retrying.
+ * @param op.count {@link RetryOption.count}
+ * @param op.logger {@link RetryOption.logger}
+ * @param op.errorCriterion {@link RetryOption.errorCriterion}
+ * @param op.intervalSec {@link AsyncRetryOption.intervalSec}
+ * @param op.intervalPredicate {@link RetryOption.intervalPredicate}
  */
 export declare function retry<T>(cb: () => T, op?: SyncRetryOption): T;
 export declare function retry<T>(cb: () => T, op?: AsyncRetryOption): Promise<T>;

package/build/index.d.ts

@@ -1,8 +1,6 @@
 export * from "./const/types";
 export * from "./const/time-unit";
-export * from "./const/gender";
 export * from "./const/http-method";
-export * from "./const/ccy";
 export * from "./func/u";
 export * from "./func/u-obj";
 export * from "./func/u-string";

package/build/index.js

@@ -1,8 +1,6 @@
 export * from "./const/types";
 export * from "./const/time-unit";
-export * from "./const/gender";
 export * from "./const/http-method";
-export * from "./const/ccy";
 export * from "./func/u";
 export * from "./func/u-obj";
 export * from "./func/u-string";

package/package.json

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

package/build/const/ccy.d.ts

@@ -1,18 +0,0 @@
-export interface Ccy {
-    symbol: t_ccySymbol;
-    crossUsd: string;
-}
-export type t_ccySymbol = keyof (typeof currencies);
-declare const currencies: {
-    jpy: Ccy;
-    usd: Ccy;
-    gbp: Ccy;
-    eur: Ccy;
-    cad: Ccy;
-    aud: Ccy;
-};
-export declare const s_ccy: {
-    [k in t_ccySymbol]: Readonly<Ccy>;
-};
-export declare function resolveCcy(str: string): Ccy;
-export {};

package/build/const/ccy.js

@@ -1,16 +0,0 @@
-const currencies = {
-    jpy: { crossUsd: "usd/jpy" },
-    usd: { crossUsd: null },
-    gbp: { crossUsd: "gbp/usd" },
-    eur: { crossUsd: "eur/usd" },
-    cad: { crossUsd: "cad/usd" },
-    aud: { crossUsd: "aud/usd" }
-};
-export const s_ccy = (() => {
-    Object.entries(currencies).forEach(kv => { kv[1].symbol = kv[0]; currencies[kv[0]] = Object.freeze(kv[1]); });
-    return Object.freeze(currencies);
-})();
-export function resolveCcy(str) {
-    const ccyKey = Object.keys(s_ccy).find(k => str?.toLowerCase() == k);
-    return ccyKey && s_ccy[ccyKey];
-}

package/build/const/gender.d.ts

@@ -1,4 +0,0 @@
-export declare enum Gender {
-    Male = 0,
-    Female = 1
-}

package/build/const/gender.js

@@ -1,5 +0,0 @@
-export var Gender;
-(function (Gender) {
-    Gender[Gender["Male"] = 0] = "Male";
-    Gender[Gender["Female"] = 1] = "Female";
-})(Gender || (Gender = {}));