@naturalcycles/js-lib 14.207.0 → 14.209.0

package/dist/array/array.util.d.ts

@@ -116,11 +116,26 @@ export declare function _dropRightWhile<T>(items: T[], predicate: Predicate<T>):
 export declare function _count<T>(items: T[], predicate: AbortablePredicate<T>): number;
 export declare function _countBy<T>(items: T[], mapper: Mapper<T, any>): StringMap<number>;
 /**
+ * Returns an intersection between 2 arrays.
+ *
+ * Intersecion means an array of items that are present in both of the arrays.
+ *
+ * It's more performant to pass a Set as a second argument.
+ *
  * @example
  * _intersection([2, 1], [2, 3])
  * // [2]
  */
-export declare function _intersection<T>(...arrays: T[][]): T[];
+export declare function _intersection<T>(a1: T[], a2: T[] | Set<T>): T[];
+/**
+ * Returns true if there is at least 1 item common between 2 arrays.
+ * Otherwise returns false.
+ *
+ * It's more performant to use that versus `_intersection(a1, a2).length > 0`.
+ *
+ * Passing second array as Set is more performant (it'll skip turning the array into Set in-place).
+ */
+export declare function _intersectsWith<T>(a1: T[], a2: T[] | Set<T>): boolean;
 /**
  * @example
  * _difference([2, 1], [2, 3])

package/dist/array/array.util.js

@@ -1,6 +1,6 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
-exports._zip = exports._minByOrUndefined = exports._maxByOrUndefined = exports._minBy = exports._maxBy = exports._max = exports._maxOrUndefined = exports._min = exports._minOrUndefined = exports._lastOrUndefined = exports._last = exports._shuffle = exports._mapToObject = exports._sumBy = exports._sum = exports._difference = exports._intersection = exports._countBy = exports._count = exports._dropRightWhile = exports._dropWhile = exports._takeRightWhile = exports._takeWhile = exports._findLast = exports._sortDescBy = exports._sortBy = exports._groupBy = exports._mapBy = exports._by = exports._uniqBy = exports._pushUniqBy = exports._pushUniq = exports._uniq = exports._chunk = void 0;
+exports._zip = exports._minByOrUndefined = exports._maxByOrUndefined = exports._minBy = exports._maxBy = exports._max = exports._maxOrUndefined = exports._min = exports._minOrUndefined = exports._lastOrUndefined = exports._last = exports._shuffle = exports._mapToObject = exports._sumBy = exports._sum = exports._difference = exports._intersectsWith = exports._intersection = exports._countBy = exports._count = exports._dropRightWhile = exports._dropWhile = exports._takeRightWhile = exports._takeWhile = exports._findLast = exports._sortDescBy = exports._sortBy = exports._groupBy = exports._mapBy = exports._by = exports._uniqBy = exports._pushUniqBy = exports._pushUniq = exports._uniq = exports._chunk = void 0;
 const is_util_1 = require("../is.util");
 const types_1 = require("../types");
 /**
@@ -227,16 +227,34 @@ function _countBy(items, mapper) {
 exports._countBy = _countBy;
 // investigate: _groupBy
 /**
+ * Returns an intersection between 2 arrays.
+ *
+ * Intersecion means an array of items that are present in both of the arrays.
+ *
+ * It's more performant to pass a Set as a second argument.
+ *
  * @example
  * _intersection([2, 1], [2, 3])
  * // [2]
  */
-function _intersection(...arrays) {
-    if (arrays.length === 0)
-        return []; // edge case
-    return arrays.reduce((a, b) => a.filter(v => b.includes(v)));
+function _intersection(a1, a2) {
+    const a2set = a2 instanceof Set ? a2 : new Set(a2);
+    return a1.filter(v => a2set.has(v));
 }
 exports._intersection = _intersection;
+/**
+ * Returns true if there is at least 1 item common between 2 arrays.
+ * Otherwise returns false.
+ *
+ * It's more performant to use that versus `_intersection(a1, a2).length > 0`.
+ *
+ * Passing second array as Set is more performant (it'll skip turning the array into Set in-place).
+ */
+function _intersectsWith(a1, a2) {
+    const a2set = a2 instanceof Set ? a2 : new Set(a2);
+    return a1.some(v => a2set.has(v));
+}
+exports._intersectsWith = _intersectsWith;
 /**
  * @example
  * _difference([2, 1], [2, 3])

package/dist/index.d.ts

@@ -83,6 +83,7 @@ export * from './semver';
 export * from './web';
 export * from './abort';
 export * from './polyfill';
+export * from './string/regex';
 export * from './zod/zod.util';
 export * from './zod/zod.shared.schemas';
 import { z, ZodSchema, ZodError, ZodIssue } from 'zod';

package/dist/index.js

@@ -87,6 +87,7 @@ tslib_1.__exportStar(require("./semver"), exports);
 tslib_1.__exportStar(require("./web"), exports);
 tslib_1.__exportStar(require("./abort"), exports);
 tslib_1.__exportStar(require("./polyfill"), exports);
+tslib_1.__exportStar(require("./string/regex"), exports);
 tslib_1.__exportStar(require("./zod/zod.util"), exports);
 tslib_1.__exportStar(require("./zod/zod.shared.schemas"), exports);
 const zod_1 = require("zod");

package/dist/string/regex.d.ts

@@ -0,0 +1,6 @@
+/**
+ * Simple, intentionally not exhaustive regex to match an email address.
+ *
+ * Source: https://regexr.com/3e48o
+ */
+export declare const SIMPLE_EMAIL_REGEX: RegExp;

package/dist/string/regex.js

@@ -0,0 +1,9 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.SIMPLE_EMAIL_REGEX = void 0;
+/**
+ * Simple, intentionally not exhaustive regex to match an email address.
+ *
+ * Source: https://regexr.com/3e48o
+ */
+exports.SIMPLE_EMAIL_REGEX = /^[\w-.]+@([\w-]+\.)+[\w-]{2,4}$/;

package/dist-esm/array/array.util.js

@@ -207,14 +207,31 @@ export function _countBy(items, mapper) {
 }
 // investigate: _groupBy
 /**
+ * Returns an intersection between 2 arrays.
+ *
+ * Intersecion means an array of items that are present in both of the arrays.
+ *
+ * It's more performant to pass a Set as a second argument.
+ *
  * @example
  * _intersection([2, 1], [2, 3])
  * // [2]
  */
-export function _intersection(...arrays) {
-    if (arrays.length === 0)
-        return []; // edge case
-    return arrays.reduce((a, b) => a.filter(v => b.includes(v)));
+export function _intersection(a1, a2) {
+    const a2set = a2 instanceof Set ? a2 : new Set(a2);
+    return a1.filter(v => a2set.has(v));
+}
+/**
+ * Returns true if there is at least 1 item common between 2 arrays.
+ * Otherwise returns false.
+ *
+ * It's more performant to use that versus `_intersection(a1, a2).length > 0`.
+ *
+ * Passing second array as Set is more performant (it'll skip turning the array into Set in-place).
+ */
+export function _intersectsWith(a1, a2) {
+    const a2set = a2 instanceof Set ? a2 : new Set(a2);
+    return a1.some(v => a2set.has(v));
 }
 /**
  * @example

package/dist-esm/index.js

@@ -83,6 +83,7 @@ export * from './semver';
 export * from './web';
 export * from './abort';
 export * from './polyfill';
+export * from './string/regex';
 export * from './zod/zod.util';
 export * from './zod/zod.shared.schemas';
 import { z, ZodSchema, ZodError } from 'zod';

package/dist-esm/string/regex.js

@@ -0,0 +1,6 @@
+/**
+ * Simple, intentionally not exhaustive regex to match an email address.
+ *
+ * Source: https://regexr.com/3e48o
+ */
+export const SIMPLE_EMAIL_REGEX = /^[\w-.]+@([\w-]+\.)+[\w-]{2,4}$/;

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@naturalcycles/js-lib",
-  "version": "14.207.0",
+  "version": "14.209.0",
   "scripts": {
     "prepare": "husky",
     "build-prod": "build-prod-esm-cjs",

package/src/array/array.util.ts

@@ -253,13 +253,32 @@ export function _countBy<T>(items: T[], mapper: Mapper<T, any>): StringMap<numbe
 // investigate: _groupBy
 
 /**
+ * Returns an intersection between 2 arrays.
+ *
+ * Intersecion means an array of items that are present in both of the arrays.
+ *
+ * It's more performant to pass a Set as a second argument.
+ *
  * @example
  * _intersection([2, 1], [2, 3])
  * // [2]
  */
-export function _intersection<T>(...arrays: T[][]): T[] {
-  if (arrays.length === 0) return [] // edge case
-  return arrays.reduce((a, b) => a.filter(v => b.includes(v)))
+export function _intersection<T>(a1: T[], a2: T[] | Set<T>): T[] {
+  const a2set = a2 instanceof Set ? a2 : new Set(a2)
+  return a1.filter(v => a2set.has(v))
+}
+
+/**
+ * Returns true if there is at least 1 item common between 2 arrays.
+ * Otherwise returns false.
+ *
+ * It's more performant to use that versus `_intersection(a1, a2).length > 0`.
+ *
+ * Passing second array as Set is more performant (it'll skip turning the array into Set in-place).
+ */
+export function _intersectsWith<T>(a1: T[], a2: T[] | Set<T>): boolean {
+  const a2set = a2 instanceof Set ? a2 : new Set(a2)
+  return a1.some(v => a2set.has(v))
 }
 
 /**

package/src/index.ts

@@ -83,6 +83,7 @@ export * from './semver'
 export * from './web'
 export * from './abort'
 export * from './polyfill'
+export * from './string/regex'
 export * from './zod/zod.util'
 export * from './zod/zod.shared.schemas'
 import { z, ZodSchema, ZodError, ZodIssue } from 'zod'

package/src/string/regex.ts

@@ -0,0 +1,6 @@
+/**
+ * Simple, intentionally not exhaustive regex to match an email address.
+ *
+ * Source: https://regexr.com/3e48o
+ */
+export const SIMPLE_EMAIL_REGEX = /^[\w-.]+@([\w-]+\.)+[\w-]{2,4}$/