@bitfiber/utils 1.1.1 → 1.1.2

package/CONTRIBUTING.md

@@ -2,7 +2,8 @@
 
 Thank you for considering contributing to our "@bitfiber/utils" library!
 We welcome contributions from the community to help improve and expand the functionality of our library.
-By contributing, you can help make our library more useful for developers across different projects and domains.
+By contributing, you can help make our library more useful for developers across different projects
+and domains.
 
 ## Code of Conduct
 
@@ -22,12 +23,12 @@ To contribute to our "@bitfiber/utils" library, follow these steps:
    see [guide](https://docs.github.com/en/pull-requests/collaborating-with-pull-requests/proposing-changes-to-your-work-with-pull-requests/creating-and-deleting-branches-within-your-repository).  
    Branch naming conventions:
 
-    - For features: `feature/<your-feature-branch-name>`
-    - For bug fixes: `fix/<your-bugfix-branch-name>`.
-    - For tests: `tests/<your-tests-branch-name>`.
-    - For docs: `docs/<your-docs-branch-name>`.
-    - For refactoring: `refactor/<your-refactoring-branch-name>`
-    - For performance improving: `perf/<your-performance-branch-name>`
+  - For features: `feature/<your-feature-branch-name>`
+  - For bug fixes: `fix/<your-bugfix-branch-name>`.
+  - For tests: `tests/<your-tests-branch-name>`.
+  - For docs: `docs/<your-docs-branch-name>`.
+  - For refactoring: `refactor/<your-refactoring-branch-name>`
+  - For performance improving: `perf/<your-performance-branch-name>`
 
 4. Switch to the newly created branch.
 
@@ -80,25 +81,33 @@ To contribute to our "@bitfiber/utils" library, follow these steps:
 
 ## Guidelines and Best Practices
 
-To ensure that your contributions are accepted and integrated smoothly, please adhere to the following guidelines and
-best practices:
+To ensure that your contributions are accepted and integrated smoothly, please adhere to
+the following guidelines and best practices:
 
-* **Follow the Style Guide**: Maintain consistency with the existing codebase by following our eslint coding style.
+* **Follow the Style Guide**:
+  Maintain consistency with the existing codebase by following our eslint coding style.
 
-* **Write Tests**: Ensure that your changes are covered by tests. Write unit tests for new functionality and update
+* **Write Tests**:
+  Ensure that your changes are covered by tests. Write unit tests for new functionality and update
   existing tests for changes to ensure full test coverage.
 
-* **Document Changes**: Provide clear and concise documentation for any new functionality or changes made to existing
-  functionality. This includes updating README.md, adding JSDoc comments, and any other relevant documentation.
+* **Document Changes**:
+  Provide clear and concise documentation for any new functionality or changes made to existing
+  functionality. This includes updating README.md, adding JSDoc comments, and any other relevant
+  documentation.
 
-* **Keep PRs Small and Focused**: Submit separate PRs for each logical change or set of related changes. This makes it
+* **Keep PRs Small and Focused**:
+  Submit separate PRs for each logical change or set of related changes. This makes it
   easier to review and merge your contributions.
 
-* **Be Responsive**: Be responsive to feedback and comments on your PRs. Address any review comments promptly and make
+* **Be Responsive**:
+  Be responsive to feedback and comments on your PRs. Address any review comments promptly and make
   necessary adjustments to your code.
 
-* **Respect Licensing**: Ensure that your contributions adhere to the licensing terms of the project. If you're
-  introducing dependencies with different licenses, make sure they are compatible with our project's license.
+* **Respect Licensing**:
+  Ensure that your contributions adhere to the licensing terms of the project. If you're
+  introducing dependencies with different licenses, make sure they are compatible with our project's
+  license.
 
 ## Need Help?
 

package/LICENSE.txt

@@ -186,7 +186,7 @@
     same "printed page" as the copyright notice for easier
     identification within third-party archives.
 
- Copyright © 2023-2024 Oleksandr Zmanovskyi
+ Copyright © 2023-2026 Oleksandr Zmanovskyi
 
  Licensed under the Apache License, Version 2.0 (the "License");
  you may not use this file except in compliance with the License.

package/README.md

@@ -4,36 +4,39 @@
 [![GitHub star chart](https://img.shields.io/github/stars/bitfiber/utils?style=social)](https://star-history.com/#bitfiber/utils)
 [![GitHub fork](https://img.shields.io/github/forks/bitfiber/utils?style=social)](https://github.com/bitfiber/utils/fork)
 
-The "@bitfiber/utils" library is a collection of versatile utility functions designed to streamline common tasks and
-enhance the development experience in JavaScript. With a focus on simplicity and reusability, this library provides a
-range of functions that cover various aspects of programming, making it a valuable resource for developers across
-different projects and domains.
+The "@bitfiber/utils" library is a collection of versatile utility functions designed to streamline
+common tasks and enhance the development experience in JavaScript. With a focus on simplicity and
+reusability, this library provides a range of functions that cover various aspects of programming,
+making it a valuable resource for developers across different projects and domains.
 
 ---
 
 ## Key Features
 
-1. **Strict Typing:** The library leverages TypeScript to enforce strict typing, ensuring robust
-   type checking at compile time. This reduces the likelihood of runtime errors and enhances code
-   reliability. TypeScript's type inference capabilities also aid in writing cleaner and more
-   maintainable code.
+1. **Strict Typing:**   
+   The library leverages TypeScript to enforce strict typing, ensuring robust type checking at
+   compile time. This reduces the likelihood of runtime errors and enhances code reliability.
+   TypeScript's type inference capabilities also aid in writing cleaner and more maintainable code.
 
-2. **Tree Shaking:** The library's modular design enables tree shaking, allowing developers to
-   optimize bundle sizes by selectively importing only the necessary functionalities.
-   This eliminates unused code, resulting in smaller and more efficient applications.
+2. **Tree Shaking:**   
+   The library's modular design enables tree shaking, allowing developers to optimize bundle sizes
+   by selectively importing only the necessary functionalities. This eliminates unused code,
+   resulting in smaller and more efficient applications.
 
 3. **Common Use Cases:**
 
 * Common Functions: Additional general-purpose utilities for tasks such as type checking, and more.
 * String Manipulation: Functions for capitalizing strings, converting case, and more.
-* Working with Numbers: Functions for numerical operations, such as rounding, formatting, converting, and more.
-* Array Operations: Helper functions for working with arrays, such as comparison, traversal, mapping, and more.
-* Object Operations: Utilities for working with objects, including functions for merging objects, deep cloning,
-  property access, and more.
-* DOM Manipulation: Utilities for interacting with the Document Object Model (DOM), including functions for style
-  manipulation, traversal, and more.
-* Environment Handling: Functions for utilizing User Agent information for tailored content delivery and feature
-  adaptation.
+* Working with Numbers: Functions for numerical operations, such as rounding, formatting, converting,
+  and more.
+* Array Operations: Helper functions for working with arrays, such as comparison, traversal, mapping,
+  and more.
+* Object Operations: Utilities for working with objects, including functions for merging objects,
+  deep cloning, property access, and more.
+* DOM Manipulation: Utilities for interacting with the Document Object Model (DOM), including
+  functions for style manipulation, traversal, and more.
+* Environment Handling: Functions for utilizing User Agent information for tailored content delivery
+  and feature adaptation.
 
 ---
 
@@ -86,7 +89,7 @@ By participating, you are expected to uphold this code.
 This project is released under the Apache 2.0 License.  
 You can find the full text of the license in the [LICENSE](https://github.com/bitfiber/utils/blob/main/LICENSE.txt)
 file.  
-Copyright © 2023-2024 Oleksandr Zmanovskyi. All rights reserved.
+Copyright © 2023-2026 Oleksandr Zmanovskyi. All rights reserved.
 
 ---
 
@@ -319,7 +322,9 @@ getUniqueNumId(); // 11116
 
 ### `getUniqueStrId`
 
-Returns a unique string identifier for the current session  
+Returns a unique string identifier for the current session.
+Uses Math.random for salt generation which is NOT cryptographically secure.
+Do not use for security-sensitive purposes such as tokens or passwords
 `@returns string`
 
 **Example:**
@@ -817,7 +822,7 @@ isUsualObject([]); // false
 
 ### `isEmpty`
 
-Returns true if the value is empty (null, undefined, NaN, Infinity, '', {}, [], Int32Array(), Set(), Map()),
+Returns true if the value is empty (null, undefined, '', {}, [], Int32Array(), Set(), Map()),
 otherwise false  
 `@param value: any`  
 `@returns boolean`
@@ -844,8 +849,10 @@ isEmpty(new Map([[1, 1]])); // false
 
 ### `random`
 
-Returns a random integer between 0 and number, not exceeding a certain number of digits  
-`@param numberOfDigits?: number` - number of digits (default: 7, maximum: 15)  
+Returns a random integer between 0 and 10^numberOfDigits - 1.
+Uses Math.random which is NOT cryptographically secure.
+Do not use for security-sensitive purposes such as tokens or passwords
+`@param numberOfDigits?: number` - number of digits (default: 7, maximum: 15)
 `@returns number`
 
 **Example:**
@@ -973,7 +980,8 @@ const readOnlyObj = constant({a: 1});
 
 ### `deepConstant`
 
-Makes an object and its nested objects read-only  
+Makes an object and its nested objects read-only.  
+Objects that have been visited will be ignored to prevent looping  
 `<T extends Obj>`  
 `@param obj: T` - any object  
 `@returns Readonly<T>`
@@ -1041,11 +1049,12 @@ const obj = exclude({a: 1, b: 2}, 'b'); // {a: 1}
 
 ### `extend`
 
-Copies all enumerable own properties from one or more source objects to a target object.  
-It returns the modified target object  
-`<T extends Obj, U extends Obj[]>`  
-`@param target: T` - target object  
-`@param ...sources: U` - source objects  
+Copies all enumerable own properties from one or more source objects to a target object.
+It returns the modified target object.
+Keys __proto__, constructor and prototype are skipped to prevent prototype pollution
+`<T extends Obj, U extends Obj[]>`
+`@param target: T` - target object
+`@param ...sources: U` - source objects
 `@returns T & ValueIntersection<typeof sources>`
 
 **Example:**
@@ -1061,8 +1070,9 @@ const obj = extend({a: 1}, {b: 2}); // {a: 1, b: 2}
 ### `extendAll`
 
 Copies all enumerable own properties from one or more source objects to a target object
-and copies enumerable properties from nested source objects to nested target objects  
-It returns the modified target object  
+and copies enumerable properties from nested source objects to nested target objects.
+It returns the modified target object.
+Keys __proto__, constructor and prototype are skipped to prevent prototype pollution
 `<T extends Obj, U extends Obj[]>`  
 `@param target: T` - target object  
 `@param ...sources: U` - source objects  
@@ -1303,9 +1313,9 @@ arr.filter(cnd({name: {notEqual: [/^Alex$/, /^Mary$/]}})); // [{name: 'Jack'}]
 
 ### `diffArr`
 
-Returns the difference between two arrays  
-Strict comparison of array items is applied  
-The order doesn't matter  
+Returns the difference between two arrays
+Strict comparison of array items is applied
+The order doesn't matter, duplicate values are ignored
 `<T extends NumStr>`  
 `@param arr1: T[]` - array 1  
 `@param arr2: T[]` - array 2  
@@ -2386,7 +2396,7 @@ to browser version conditions
 {
   browserName?: versionCondition(x.x...x | [~ >= > <= <]x.x...x),
   engines?: engineName | {
-    engineNane: versionCondition(x.x...x | [~ >= > <= <]x.x...x)
+    engineName: versionCondition(x.x...x | [~ >= > <= <]x.x...x)
     ...
   }
   ...

package/dist/cjs/arr/at/at.js

@@ -1,8 +1,8 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.at = void 0;
-function at(arr, index) {
-    return index < 0 ? arr[arr.length + index] : arr[index];
-}
-exports.at = at;
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.at = void 0;
+function at(arr, index) {
+    return arr.at(index);
+}
+exports.at = at;
 //# sourceMappingURL=at.js.map

package/dist/cjs/arr/at/at.js.map

@@ -1 +1 @@
-{"version":3,"file":"at.js","sourceRoot":"","sources":["../../../../src/arr/at/at.ts"],"names":[],"mappings":";;;AAMA,SAAgB,EAAE,CAAI,GAAQ,EAAE,KAAa;IAE3C,OAAO,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;AAC1D,CAAC;AAHD,gBAGC"}
+{"version":3,"file":"at.js","sourceRoot":"","sources":["../../../../src/arr/at/at.ts"],"names":[],"mappings":";;;AAMA,SAAgB,EAAE,CAAI,GAAQ,EAAE,KAAa;IAC3C,OAAO,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC;AACvB,CAAC;AAFD,gBAEC"}

package/dist/cjs/arr/cnd/cnd.js

@@ -1,95 +1,95 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.cnd = void 0;
-const common_1 = require("../../common");
-const obj_1 = require("../../obj");
-function cnd(conditions) {
-    if ((0, common_1.isFunction)(conditions)) {
-        return conditions;
-    }
-    else if ('is' in conditions) {
-        return value => (0, common_1.same)(conditions.is, value);
-    }
-    else if ('or' in conditions) {
-        return value => ((0, common_1.isArray)(conditions.or)
-            ? conditions.or.some(item => (0, common_1.same)(item, value))
-            : cndErr());
-    }
-    else if ('not' in conditions) {
-        return value => ((0, common_1.isArray)(conditions.not)
-            ? !conditions.not.some(item => (0, common_1.same)(item, value))
-            : cndErr());
-    }
-    else if ('equal' in conditions) {
-        return value => fit(conditions.equal, value);
-    }
-    else if ('orEqual' in conditions) {
-        return value => ((0, common_1.isArray)(conditions.orEqual)
-            ? conditions.orEqual.some(item => fit(item, value))
-            : cndErr());
-    }
-    else if ('notEqual' in conditions) {
-        return value => ((0, common_1.isArray)(conditions.notEqual)
-            ? !conditions.notEqual.some(item => fit(item, value))
-            : cndErr());
-    }
-    else {
-        return obj => {
-            if ((0, common_1.isObject)(obj)) {
-                for (const key in conditions) {
-                    if ((0, obj_1.hasOwn)(conditions, key)) {
-                        const value = obj[key];
-                        const condition = conditions[key];
-                        if ((0, common_1.isRegExp)(condition)) {
-                            if (!fit(condition, value)) {
-                                return false;
-                            }
-                        }
-                        else if ('is' in condition) {
-                            if (!(0, common_1.same)(condition.is, value)) {
-                                return false;
-                            }
-                        }
-                        else if ('or' in condition) {
-                            if (!condition.or.some(item => (0, common_1.same)(item, value))) {
-                                return false;
-                            }
-                        }
-                        else if ('not' in condition) {
-                            if (condition.not.some(item => (0, common_1.same)(item, value))) {
-                                return false;
-                            }
-                        }
-                        else if ('equal' in condition) {
-                            if (!fit(condition.equal, value)) {
-                                return false;
-                            }
-                        }
-                        else if ('orEqual' in condition) {
-                            if (!condition.orEqual.some(item => fit(item, value))) {
-                                return false;
-                            }
-                        }
-                        else if ('notEqual' in condition) {
-                            if (condition.notEqual.some(item => fit(item, value))) {
-                                return false;
-                            }
-                        }
-                    }
-                }
-                return true;
-            }
-            else {
-                return false;
-            }
-        };
-    }
-}
-exports.cnd = cnd;
-function fit(condition, value) {
-    return (0, common_1.isRegExp)(condition) ? (0, common_1.isString)(value) && condition.test(value) : (0, common_1.equals)(condition, value);
-}
-function cndErr() {
-    throw new common_1.BfError('"or", "not", "orEqual" and "notEqual" must be an array', { code: 'bf_utils_arr_cnd_1' });
-}
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.cnd = void 0;
+const common_1 = require("../../common");
+const obj_1 = require("../../obj");
+function cnd(conditions) {
+    if ((0, common_1.isFunction)(conditions)) {
+        return conditions;
+    }
+    else if ('is' in conditions) {
+        return value => (0, common_1.same)(conditions.is, value);
+    }
+    else if ('or' in conditions) {
+        return value => ((0, common_1.isArray)(conditions.or)
+            ? conditions.or.some(item => (0, common_1.same)(item, value))
+            : cndErr());
+    }
+    else if ('not' in conditions) {
+        return value => ((0, common_1.isArray)(conditions.not)
+            ? !conditions.not.some(item => (0, common_1.same)(item, value))
+            : cndErr());
+    }
+    else if ('equal' in conditions) {
+        return value => fit(conditions.equal, value);
+    }
+    else if ('orEqual' in conditions) {
+        return value => ((0, common_1.isArray)(conditions.orEqual)
+            ? conditions.orEqual.some(item => fit(item, value))
+            : cndErr());
+    }
+    else if ('notEqual' in conditions) {
+        return value => ((0, common_1.isArray)(conditions.notEqual)
+            ? !conditions.notEqual.some(item => fit(item, value))
+            : cndErr());
+    }
+    else {
+        return obj => {
+            if ((0, common_1.isObject)(obj)) {
+                for (const key in conditions) {
+                    if ((0, obj_1.hasOwn)(conditions, key)) {
+                        const value = obj[key];
+                        const condition = conditions[key];
+                        if ((0, common_1.isRegExp)(condition)) {
+                            if (!fit(condition, value)) {
+                                return false;
+                            }
+                        }
+                        else if ('is' in condition) {
+                            if (!(0, common_1.same)(condition.is, value)) {
+                                return false;
+                            }
+                        }
+                        else if ('or' in condition) {
+                            if (!condition.or.some(item => (0, common_1.same)(item, value))) {
+                                return false;
+                            }
+                        }
+                        else if ('not' in condition) {
+                            if (condition.not.some(item => (0, common_1.same)(item, value))) {
+                                return false;
+                            }
+                        }
+                        else if ('equal' in condition) {
+                            if (!fit(condition.equal, value)) {
+                                return false;
+                            }
+                        }
+                        else if ('orEqual' in condition) {
+                            if (!condition.orEqual.some(item => fit(item, value))) {
+                                return false;
+                            }
+                        }
+                        else if ('notEqual' in condition) {
+                            if (condition.notEqual.some(item => fit(item, value))) {
+                                return false;
+                            }
+                        }
+                    }
+                }
+                return true;
+            }
+            else {
+                return false;
+            }
+        };
+    }
+}
+exports.cnd = cnd;
+function fit(condition, value) {
+    return (0, common_1.isRegExp)(condition) ? (0, common_1.isString)(value) && condition.test(value) : (0, common_1.equals)(condition, value);
+}
+function cndErr() {
+    throw new common_1.BfError('"or", "not", "orEqual" and "notEqual" must be an array', { code: 'bf_utils_arr_cnd_1' });
+}
 //# sourceMappingURL=cnd.js.map

package/dist/cjs/arr/cnd/cnd.js.map

@@ -1 +1 @@
-{"version":3,"file":"cnd.js","sourceRoot":"","sources":["../../../../src/arr/cnd/cnd.ts"],"names":[],"mappings":";;;AAAA,yCAEsB;AACtB,mCAAiC;AAqHjC,SAAgB,GAAG,CAAC,UAA2B;IAC7C,IAAI,IAAA,mBAAU,EAAC,UAAU,CAAC,EAAE;QAC1B,OAAO,UAAU,CAAC;KACnB;SAAM,IAAI,IAAI,IAAI,UAAU,EAAE;QAC7B,OAAO,KAAK,CAAC,EAAE,CAAC,IAAA,aAAI,EAAC,UAAU,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;KAC5C;SAAM,IAAI,IAAI,IAAI,UAAU,EAAE;QAC7B,OAAO,KAAK,CAAC,EAAE,CAAC,CAAC,IAAA,gBAAO,EAAC,UAAU,CAAC,EAAE,CAAC;YACrC,CAAC,CAAC,UAAU,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,IAAA,aAAI,EAAC,IAAI,EAAE,KAAK,CAAC,CAAC;YAC/C,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC;KACf;SAAM,IAAI,KAAK,IAAI,UAAU,EAAE;QAC9B,OAAO,KAAK,CAAC,EAAE,CAAC,CAAC,IAAA,gBAAO,EAAC,UAAU,CAAC,GAAG,CAAC;YACtC,CAAC,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,IAAA,aAAI,EAAC,IAAI,EAAE,KAAK,CAAC,CAAC;YACjD,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC;KACf;SAAM,IAAI,OAAO,IAAI,UAAU,EAAE;QAChC,OAAO,KAAK,CAAC,EAAE,CAAC,GAAG,CAAC,UAAU,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;KAC9C;SAAM,IAAI,SAAS,IAAI,UAAU,EAAE;QAClC,OAAO,KAAK,CAAC,EAAE,CAAC,CAAC,IAAA,gBAAO,EAAC,UAAU,CAAC,OAAO,CAAC;YAC1C,CAAC,CAAC,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;YACnD,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC;KACf;SAAM,IAAI,UAAU,IAAI,UAAU,EAAE;QACnC,OAAO,KAAK,CAAC,EAAE,CAAC,CAAC,IAAA,gBAAO,EAAC,UAAU,CAAC,QAAQ,CAAC;YAC3C,CAAC,CAAC,CAAC,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;YACrD,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC;KACf;SAAM;QACL,OAAO,GAAG,CAAC,EAAE;YACX,IAAI,IAAA,iBAAQ,EAAC,GAAG,CAAC,EAAE;gBACjB,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE;oBAC5B,IAAI,IAAA,YAAM,EAAC,UAAU,EAAE,GAAG,CAAC,EAAE;wBAC3B,MAAM,KAAK,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;wBACvB,MAAM,SAAS,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC;wBAElC,IAAI,IAAA,iBAAQ,EAAC,SAAS,CAAC,EAAE;4BACvB,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,KAAK,CAAC,EAAE;gCAC1B,OAAO,KAAK,CAAC;6BACd;yBACF;6BAAM,IAAI,IAAI,IAAI,SAAS,EAAE;4BAC5B,IAAI,CAAC,IAAA,aAAI,EAAC,SAAS,CAAC,EAAE,EAAE,KAAK,CAAC,EAAE;gCAC9B,OAAO,KAAK,CAAC;6BACd;yBACF;6BAAM,IAAI,IAAI,IAAI,SAAS,EAAE;4BAC5B,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,IAAA,aAAI,EAAC,IAAI,EAAE,KAAK,CAAC,CAAC,EAAE;gCACjD,OAAO,KAAK,CAAC;6BACd;yBACF;6BAAM,IAAI,KAAK,IAAI,SAAS,EAAE;4BAC7B,IAAI,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,IAAA,aAAI,EAAC,IAAI,EAAE,KAAK,CAAC,CAAC,EAAE;gCACjD,OAAO,KAAK,CAAC;6BACd;yBACF;6BAAM,IAAI,OAAO,IAAI,SAAS,EAAE;4BAC/B,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE;gCAChC,OAAO,KAAK,CAAC;6BACd;yBACF;6BAAM,IAAI,SAAS,IAAI,SAAS,EAAE;4BACjC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,EAAE;gCACrD,OAAO,KAAK,CAAC;6BACd;yBACF;6BAAM,IAAI,UAAU,IAAI,SAAS,EAAE;4BAClC,IAAI,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,EAAE;gCACrD,OAAO,KAAK,CAAC;6BACd;yBACF;qBACF;iBACF;gBAED,OAAO,IAAI,CAAC;aACb;iBAAM;gBACL,OAAO,KAAK,CAAC;aACd;QACH,CAAC,CAAC;KACH;AACH,CAAC;AArED,kBAqEC;AAED,SAAS,GAAG,CAAC,SAAc,EAAE,KAAU;IACrC,OAAO,IAAA,iBAAQ,EAAC,SAAS,CAAC,CAAC,CAAC,CAAC,IAAA,iBAAQ,EAAC,KAAK,CAAC,IAAI,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAA,eAAM,EAAC,SAAS,EAAE,KAAK,CAAC,CAAC;AACnG,CAAC;AAED,SAAS,MAAM;IACb,MAAM,IAAI,gBAAO,CACf,wDAAwD,EACxD,EAAC,IAAI,EAAE,oBAAoB,EAAC,CAC7B,CAAC;AACJ,CAAC"}
+{"version":3,"file":"cnd.js","sourceRoot":"","sources":["../../../../src/arr/cnd/cnd.ts"],"names":[],"mappings":";;;AAAA,yCAEsB;AACtB,mCAAiC;AAqHjC,SAAgB,GAAG,CAAC,UAA2B;IAC7C,IAAI,IAAA,mBAAU,EAAC,UAAU,CAAC,EAAE,CAAC;QAC3B,OAAO,UAAU,CAAC;IACpB,CAAC;SAAM,IAAI,IAAI,IAAI,UAAU,EAAE,CAAC;QAC9B,OAAO,KAAK,CAAC,EAAE,CAAC,IAAA,aAAI,EAAC,UAAU,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;IAC7C,CAAC;SAAM,IAAI,IAAI,IAAI,UAAU,EAAE,CAAC;QAC9B,OAAO,KAAK,CAAC,EAAE,CAAC,CAAC,IAAA,gBAAO,EAAC,UAAU,CAAC,EAAE,CAAC;YACrC,CAAC,CAAC,UAAU,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,IAAA,aAAI,EAAC,IAAI,EAAE,KAAK,CAAC,CAAC;YAC/C,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC;IAChB,CAAC;SAAM,IAAI,KAAK,IAAI,UAAU,EAAE,CAAC;QAC/B,OAAO,KAAK,CAAC,EAAE,CAAC,CAAC,IAAA,gBAAO,EAAC,UAAU,CAAC,GAAG,CAAC;YACtC,CAAC,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,IAAA,aAAI,EAAC,IAAI,EAAE,KAAK,CAAC,CAAC;YACjD,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC;IAChB,CAAC;SAAM,IAAI,OAAO,IAAI,UAAU,EAAE,CAAC;QACjC,OAAO,KAAK,CAAC,EAAE,CAAC,GAAG,CAAC,UAAU,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IAC/C,CAAC;SAAM,IAAI,SAAS,IAAI,UAAU,EAAE,CAAC;QACnC,OAAO,KAAK,CAAC,EAAE,CAAC,CAAC,IAAA,gBAAO,EAAC,UAAU,CAAC,OAAO,CAAC;YAC1C,CAAC,CAAC,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;YACnD,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC;IAChB,CAAC;SAAM,IAAI,UAAU,IAAI,UAAU,EAAE,CAAC;QACpC,OAAO,KAAK,CAAC,EAAE,CAAC,CAAC,IAAA,gBAAO,EAAC,UAAU,CAAC,QAAQ,CAAC;YAC3C,CAAC,CAAC,CAAC,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;YACrD,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC;IAChB,CAAC;SAAM,CAAC;QACN,OAAO,GAAG,CAAC,EAAE;YACX,IAAI,IAAA,iBAAQ,EAAC,GAAG,CAAC,EAAE,CAAC;gBAClB,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;oBAC7B,IAAI,IAAA,YAAM,EAAC,UAAU,EAAE,GAAG,CAAC,EAAE,CAAC;wBAC5B,MAAM,KAAK,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;wBACvB,MAAM,SAAS,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC;wBAElC,IAAI,IAAA,iBAAQ,EAAC,SAAS,CAAC,EAAE,CAAC;4BACxB,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,KAAK,CAAC,EAAE,CAAC;gCAC3B,OAAO,KAAK,CAAC;4BACf,CAAC;wBACH,CAAC;6BAAM,IAAI,IAAI,IAAI,SAAS,EAAE,CAAC;4BAC7B,IAAI,CAAC,IAAA,aAAI,EAAC,SAAS,CAAC,EAAE,EAAE,KAAK,CAAC,EAAE,CAAC;gCAC/B,OAAO,KAAK,CAAC;4BACf,CAAC;wBACH,CAAC;6BAAM,IAAI,IAAI,IAAI,SAAS,EAAE,CAAC;4BAC7B,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,IAAA,aAAI,EAAC,IAAI,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC;gCAClD,OAAO,KAAK,CAAC;4BACf,CAAC;wBACH,CAAC;6BAAM,IAAI,KAAK,IAAI,SAAS,EAAE,CAAC;4BAC9B,IAAI,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,IAAA,aAAI,EAAC,IAAI,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC;gCAClD,OAAO,KAAK,CAAC;4BACf,CAAC;wBACH,CAAC;6BAAM,IAAI,OAAO,IAAI,SAAS,EAAE,CAAC;4BAChC,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE,CAAC;gCACjC,OAAO,KAAK,CAAC;4BACf,CAAC;wBACH,CAAC;6BAAM,IAAI,SAAS,IAAI,SAAS,EAAE,CAAC;4BAClC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC;gCACtD,OAAO,KAAK,CAAC;4BACf,CAAC;wBACH,CAAC;6BAAM,IAAI,UAAU,IAAI,SAAS,EAAE,CAAC;4BACnC,IAAI,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC;gCACtD,OAAO,KAAK,CAAC;4BACf,CAAC;wBACH,CAAC;oBACH,CAAC;gBACH,CAAC;gBAED,OAAO,IAAI,CAAC;YACd,CAAC;iBAAM,CAAC;gBACN,OAAO,KAAK,CAAC;YACf,CAAC;QACH,CAAC,CAAC;IACJ,CAAC;AACH,CAAC;AArED,kBAqEC;AAED,SAAS,GAAG,CAAC,SAAc,EAAE,KAAU;IACrC,OAAO,IAAA,iBAAQ,EAAC,SAAS,CAAC,CAAC,CAAC,CAAC,IAAA,iBAAQ,EAAC,KAAK,CAAC,IAAI,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAA,eAAM,EAAC,SAAS,EAAE,KAAK,CAAC,CAAC;AACnG,CAAC;AAED,SAAS,MAAM;IACb,MAAM,IAAI,gBAAO,CACf,wDAAwD,EACxD,EAAC,IAAI,EAAE,oBAAoB,EAAC,CAC7B,CAAC;AACJ,CAAC"}

package/dist/cjs/arr/diff-arr/diff-arr.js

@@ -1,34 +1,34 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.diffArr = void 0;
-function diffArr(arr1, arr2) {
-    let isEqual = true;
-    const only1 = [];
-    const only2 = [];
-    const equal = [];
-    const map1 = new Map(arr1.map(value => [value, true]));
-    const map2 = new Map(arr2.map(value => [value, true]));
-    for (const value of map1.keys()) {
-        if (!map2.has(value)) {
-            isEqual = false;
-            only1.push(value);
-        }
-        else {
-            equal.push(value);
-        }
-    }
-    for (const value of map2.keys()) {
-        if (!map1.has(value)) {
-            isEqual = false;
-            only2.push(value);
-        }
-    }
-    return {
-        only1,
-        only2,
-        equal,
-        isEqual,
-    };
-}
-exports.diffArr = diffArr;
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.diffArr = void 0;
+function diffArr(arr1, arr2) {
+    let isEqual = true;
+    const only1 = [];
+    const only2 = [];
+    const equal = [];
+    const map1 = new Map(arr1.map(value => [value, true]));
+    const map2 = new Map(arr2.map(value => [value, true]));
+    for (const value of map1.keys()) {
+        if (!map2.has(value)) {
+            isEqual = false;
+            only1.push(value);
+        }
+        else {
+            equal.push(value);
+        }
+    }
+    for (const value of map2.keys()) {
+        if (!map1.has(value)) {
+            isEqual = false;
+            only2.push(value);
+        }
+    }
+    return {
+        only1,
+        only2,
+        equal,
+        isEqual,
+    };
+}
+exports.diffArr = diffArr;
 //# sourceMappingURL=diff-arr.js.map

package/dist/cjs/arr/diff-arr/diff-arr.js.map

@@ -1 +1 @@
-{"version":3,"file":"diff-arr.js","sourceRoot":"","sources":["../../../../src/arr/diff-arr/diff-arr.ts"],"names":[],"mappings":";;;AAmCA,SAAgB,OAAO,CAAmB,IAAS,EAAE,IAAS;IAC5D,IAAI,OAAO,GAAG,IAAI,CAAC;IACnB,MAAM,KAAK,GAAQ,EAAE,CAAC;IACtB,MAAM,KAAK,GAAQ,EAAE,CAAC;IACtB,MAAM,KAAK,GAAQ,EAAE,CAAC;IACtB,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;IACvD,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;IAEvD,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,IAAI,EAAE,EAAE;QAC/B,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE;YACpB,OAAO,GAAG,KAAK,CAAC;YAChB,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;SACnB;aAAM;YACL,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;SACnB;KACF;IAED,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,IAAI,EAAE,EAAE;QAC/B,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE;YACpB,OAAO,GAAG,KAAK,CAAC;YAChB,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;SACnB;KACF;IAED,OAAO;QACL,KAAK;QACL,KAAK;QACL,KAAK;QACL,OAAO;KACR,CAAC;AACJ,CAAC;AA9BD,0BA8BC"}
+{"version":3,"file":"diff-arr.js","sourceRoot":"","sources":["../../../../src/arr/diff-arr/diff-arr.ts"],"names":[],"mappings":";;;AAmCA,SAAgB,OAAO,CAAmB,IAAS,EAAE,IAAS;IAC5D,IAAI,OAAO,GAAG,IAAI,CAAC;IACnB,MAAM,KAAK,GAAQ,EAAE,CAAC;IACtB,MAAM,KAAK,GAAQ,EAAE,CAAC;IACtB,MAAM,KAAK,GAAQ,EAAE,CAAC;IACtB,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;IACvD,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;IAEvD,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;QAChC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;YACrB,OAAO,GAAG,KAAK,CAAC;YAChB,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACpB,CAAC;aAAM,CAAC;YACN,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACpB,CAAC;IACH,CAAC;IAED,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;QAChC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;YACrB,OAAO,GAAG,KAAK,CAAC;YAChB,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACpB,CAAC;IACH,CAAC;IAED,OAAO;QACL,KAAK;QACL,KAAK;QACL,KAAK;QACL,OAAO;KACR,CAAC;AACJ,CAAC;AA9BD,0BA8BC"}

package/dist/cjs/arr/fill/fill.js

@@ -1,8 +1,8 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.fill = void 0;
-function fill(quantity, handler, offset = 1) {
-    return Array(quantity).fill(null).map((item, index) => handler(index + offset, index));
-}
-exports.fill = fill;
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.fill = void 0;
+function fill(quantity, handler, offset = 1) {
+    return Array(quantity).fill(null).map((item, index) => handler(index + offset, index));
+}
+exports.fill = fill;
 //# sourceMappingURL=fill.js.map

package/dist/cjs/arr/for-each-arr/for-each-arr.js

@@ -1,22 +1,22 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.forEachArr = void 0;
-const common_1 = require("../../common");
-function forEachArr(arr, handler, reverse) {
-    if (reverse) {
-        for (let i = arr.length - 1; i >= 0; i--) {
-            if (handler(arr[i], i, arr) === common_1.INTERRUPT) {
-                return;
-            }
-        }
-    }
-    else {
-        for (let i = 0; i < arr.length; i++) {
-            if (handler(arr[i], i, arr) === common_1.INTERRUPT) {
-                return;
-            }
-        }
-    }
-}
-exports.forEachArr = forEachArr;
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.forEachArr = void 0;
+const common_1 = require("../../common");
+function forEachArr(arr, handler, reverse) {
+    if (reverse) {
+        for (let i = arr.length - 1; i >= 0; i--) {
+            if (handler(arr[i], i, arr) === common_1.INTERRUPT) {
+                return;
+            }
+        }
+    }
+    else {
+        for (let i = 0; i < arr.length; i++) {
+            if (handler(arr[i], i, arr) === common_1.INTERRUPT) {
+                return;
+            }
+        }
+    }
+}
+exports.forEachArr = forEachArr;
 //# sourceMappingURL=for-each-arr.js.map

package/dist/cjs/arr/for-each-arr/for-each-arr.js.map

@@ -1 +1 @@
-{"version":3,"file":"for-each-arr.js","sourceRoot":"","sources":["../../../../src/arr/for-each-arr/for-each-arr.ts"],"names":[],"mappings":";;;AAAA,yCAAwD;AASxD,SAAgB,UAAU,CAAyC,GAAM,EACvE,OAAiD,EAAE,OAAiB;IACpE,IAAI,OAAO,EAAE;QACX,KAAK,IAAI,CAAC,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;YACxC,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,KAAK,kBAAS,EAAE;gBACzC,OAAO;aACR;SACF;KACF;SAAM;QACL,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACnC,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,KAAK,kBAAS,EAAE;gBACzC,OAAO;aACR;SACF;KACF;AACH,CAAC;AAfD,gCAeC"}
+{"version":3,"file":"for-each-arr.js","sourceRoot":"","sources":["../../../../src/arr/for-each-arr/for-each-arr.ts"],"names":[],"mappings":";;;AAAA,yCAAwD;AASxD,SAAgB,UAAU,CAAyC,GAAM,EACvE,OAAiD,EAAE,OAAiB;IACpE,IAAI,OAAO,EAAE,CAAC;QACZ,KAAK,IAAI,CAAC,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,KAAK,kBAAS,EAAE,CAAC;gBAC1C,OAAO;YACT,CAAC;QACH,CAAC;IACH,CAAC;SAAM,CAAC;QACN,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,KAAK,kBAAS,EAAE,CAAC;gBAC1C,OAAO;YACT,CAAC;QACH,CAAC;IACH,CAAC;AACH,CAAC;AAfD,gCAeC"}