@naturalcycles/js-lib 14.250.0 → 14.251.0

package/dist/object/object.util.d.ts

@@ -4,11 +4,21 @@ import { AnyObject, KeyValueTuple, ObjectMapper, ObjectPredicate, Reviver, SKIP,
  * Opposite of Omit.
  */
 export declare function _pick<T extends AnyObject, K extends keyof T>(obj: T, props: readonly K[], mutate?: boolean): T;
+/**
+ * Sets all properties of an object except passed ones to `undefined`.
+ * This is a more performant alternative to `_pick` that does picking/deleting.
+ */
+export declare function _pickWithUndefined<T extends AnyObject, K extends keyof T>(obj: T, props: readonly K[], mutate?: boolean): T;
 /**
  * Returns clone of `obj` with `props` omitted.
  * Opposite of Pick.
  */
 export declare function _omit<T extends AnyObject, K extends keyof T>(obj: T, props: readonly K[], mutate?: boolean): T;
+/**
+ * Sets all passed properties of an object to `undefined`.
+ * This is a more performant alternative to `_omit` that does picking/deleting.
+ */
+export declare function _omitWithUndefined<T extends AnyObject, K extends keyof T>(obj: T, props: readonly K[], mutate?: boolean): T;
 /**
  * Returns object with filtered keys from `props` array.
  * E.g:

package/dist/object/object.util.js

@@ -1,7 +1,9 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
 exports._pick = _pick;
+exports._pickWithUndefined = _pickWithUndefined;
 exports._omit = _omit;
+exports._omitWithUndefined = _omitWithUndefined;
 exports._mask = _mask;
 exports._filterFalsyValues = _filterFalsyValues;
 exports._filterNullishValues = _filterNullishValues;
@@ -35,17 +37,30 @@ const types_1 = require("../types");
 function _pick(obj, props, mutate = false) {
     if (mutate) {
         // Start as original object (mutable), DELETE properties that are not whitelisted
-        for (const prop of Object.keys(obj)) {
-            if (!props.includes(prop))
-                delete obj[prop];
+        for (const k of Object.keys(obj)) {
+            if (!props.includes(k))
+                delete obj[k];
         }
         return obj;
     }
     // Start as empty object, pick/add needed properties
     const r = {};
-    for (const prop of props) {
-        if (prop in obj)
-            r[prop] = obj[prop];
+    for (const k of props) {
+        if (k in obj)
+            r[k] = obj[k];
+    }
+    return r;
+}
+/**
+ * Sets all properties of an object except passed ones to `undefined`.
+ * This is a more performant alternative to `_pick` that does picking/deleting.
+ */
+function _pickWithUndefined(obj, props, mutate = false) {
+    const r = mutate ? obj : { ...obj };
+    for (const k of Object.keys(r)) {
+        if (!props.includes(k)) {
+            r[k] = undefined;
+        }
     }
     return r;
 }
@@ -55,15 +70,26 @@ function _pick(obj, props, mutate = false) {
  */
 function _omit(obj, props, mutate = false) {
     if (mutate) {
-        for (const prop of props) {
-            delete obj[prop];
+        for (const k of props) {
+            delete obj[k];
         }
         return obj;
     }
     const r = {};
-    for (const prop of Object.keys(obj)) {
-        if (!props.includes(prop))
-            r[prop] = obj[prop];
+    for (const k of Object.keys(obj)) {
+        if (!props.includes(k))
+            r[k] = obj[k];
+    }
+    return r;
+}
+/**
+ * Sets all passed properties of an object to `undefined`.
+ * This is a more performant alternative to `_omit` that does picking/deleting.
+ */
+function _omitWithUndefined(obj, props, mutate = false) {
+    const r = mutate ? obj : { ...obj };
+    for (const k of props) {
+        r[k] = undefined;
     }
     return r;
 }
@@ -77,8 +103,8 @@ function _omit(obj, props, mutate = false) {
  */
 function _mask(obj, props, mutate = false) {
     const r = mutate ? obj : _deepCopy(obj);
-    for (const prop of props) {
-        _unset(r, prop);
+    for (const k of props) {
+        _unset(r, k);
     }
     return r;
 }

package/dist/object/sortObject.js

@@ -1,7 +1,6 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
 exports._sortObject = _sortObject;
-const index_1 = require("../index");
 /**
  * Returns new object with keys sorder in the given order.
  * All keys that are not listed in `keyOrder` go last.
@@ -9,13 +8,17 @@ const index_1 = require("../index");
  */
 function _sortObject(obj, keyOrder) {
     const r = {};
-    keyOrder.forEach(key => {
-        if (key in obj) {
-            r[key] = obj[key];
+    // First, go over ordered keys
+    for (const k of keyOrder) {
+        if (k in obj) {
+            r[k] = obj[k];
         }
-    });
-    Object.entries((0, index_1._omit)(obj, keyOrder)).forEach(([k, v]) => {
+    }
+    // Second, go over all other keys
+    for (const [k, v] of Object.entries(obj)) {
+        if (keyOrder.includes(k))
+            continue;
         r[k] = v;
-    });
+    }
     return r;
 }

package/dist/object/sortObjectDeep.js

@@ -1,7 +1,6 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
 exports._sortObjectDeep = _sortObjectDeep;
-const __1 = require("..");
 /**
  * based on: https://github.com/IndigoUnited/js-deep-sort-object
  */
@@ -10,14 +9,12 @@ function _sortObjectDeep(o) {
     if (Array.isArray(o)) {
         return o.map(_sortObjectDeep);
     }
-    if ((0, __1._isObject)(o)) {
-        const out = {};
-        Object.keys(o)
-            .sort((a, b) => a.localeCompare(b))
-            .forEach(k => {
-            out[k] = _sortObjectDeep(o[k]);
-        });
-        return out;
+    if (o && typeof o === 'object') {
+        const r = {};
+        for (const k of Object.keys(o).sort((a, b) => a.localeCompare(b))) {
+            r[k] = _sortObjectDeep(o[k]);
+        }
+        return r;
     }
     return o;
 }

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

@@ -7,17 +7,30 @@ import { _objectEntries, SKIP, } from '../types';
 export function _pick(obj, props, mutate = false) {
     if (mutate) {
         // Start as original object (mutable), DELETE properties that are not whitelisted
-        for (const prop of Object.keys(obj)) {
-            if (!props.includes(prop))
-                delete obj[prop];
+        for (const k of Object.keys(obj)) {
+            if (!props.includes(k))
+                delete obj[k];
         }
         return obj;
     }
     // Start as empty object, pick/add needed properties
     const r = {};
-    for (const prop of props) {
-        if (prop in obj)
-            r[prop] = obj[prop];
+    for (const k of props) {
+        if (k in obj)
+            r[k] = obj[k];
+    }
+    return r;
+}
+/**
+ * Sets all properties of an object except passed ones to `undefined`.
+ * This is a more performant alternative to `_pick` that does picking/deleting.
+ */
+export function _pickWithUndefined(obj, props, mutate = false) {
+    const r = mutate ? obj : { ...obj };
+    for (const k of Object.keys(r)) {
+        if (!props.includes(k)) {
+            r[k] = undefined;
+        }
     }
     return r;
 }
@@ -27,15 +40,26 @@ export function _pick(obj, props, mutate = false) {
  */
 export function _omit(obj, props, mutate = false) {
     if (mutate) {
-        for (const prop of props) {
-            delete obj[prop];
+        for (const k of props) {
+            delete obj[k];
         }
         return obj;
     }
     const r = {};
-    for (const prop of Object.keys(obj)) {
-        if (!props.includes(prop))
-            r[prop] = obj[prop];
+    for (const k of Object.keys(obj)) {
+        if (!props.includes(k))
+            r[k] = obj[k];
+    }
+    return r;
+}
+/**
+ * Sets all passed properties of an object to `undefined`.
+ * This is a more performant alternative to `_omit` that does picking/deleting.
+ */
+export function _omitWithUndefined(obj, props, mutate = false) {
+    const r = mutate ? obj : { ...obj };
+    for (const k of props) {
+        r[k] = undefined;
     }
     return r;
 }
@@ -49,8 +73,8 @@ export function _omit(obj, props, mutate = false) {
  */
 export function _mask(obj, props, mutate = false) {
     const r = mutate ? obj : _deepCopy(obj);
-    for (const prop of props) {
-        _unset(r, prop);
+    for (const k of props) {
+        _unset(r, k);
     }
     return r;
 }

package/dist-esm/object/sortObject.js

@@ -1,4 +1,3 @@
-import { _omit } from '../index';
 /**
  * Returns new object with keys sorder in the given order.
  * All keys that are not listed in `keyOrder` go last.
@@ -6,13 +5,17 @@ import { _omit } from '../index';
  */
 export function _sortObject(obj, keyOrder) {
     const r = {};
-    keyOrder.forEach(key => {
-        if (key in obj) {
-            r[key] = obj[key];
+    // First, go over ordered keys
+    for (const k of keyOrder) {
+        if (k in obj) {
+            r[k] = obj[k];
         }
-    });
-    Object.entries(_omit(obj, keyOrder)).forEach(([k, v]) => {
+    }
+    // Second, go over all other keys
+    for (const [k, v] of Object.entries(obj)) {
+        if (keyOrder.includes(k))
+            continue;
         r[k] = v;
-    });
+    }
     return r;
 }

package/dist-esm/object/sortObjectDeep.js

@@ -1,4 +1,3 @@
-import { _isObject } from '..';
 /**
  * based on: https://github.com/IndigoUnited/js-deep-sort-object
  */
@@ -7,14 +6,12 @@ export function _sortObjectDeep(o) {
     if (Array.isArray(o)) {
         return o.map(_sortObjectDeep);
     }
-    if (_isObject(o)) {
-        const out = {};
-        Object.keys(o)
-            .sort((a, b) => a.localeCompare(b))
-            .forEach(k => {
-            out[k] = _sortObjectDeep(o[k]);
-        });
-        return out;
+    if (o && typeof o === 'object') {
+        const r = {};
+        for (const k of Object.keys(o).sort((a, b) => a.localeCompare(b))) {
+            r[k] = _sortObjectDeep(o[k]);
+        }
+        return r;
     }
     return o;
 }

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@naturalcycles/js-lib",
-  "version": "14.250.0",
+  "version": "14.251.0",
   "scripts": {
     "prepare": "husky",
     "build": "dev-lib build-esm-cjs",

package/src/object/object.util.ts

@@ -21,15 +21,33 @@ export function _pick<T extends AnyObject, K extends keyof T>(
 ): T {
   if (mutate) {
     // Start as original object (mutable), DELETE properties that are not whitelisted
-    for (const prop of Object.keys(obj)) {
-      if (!props.includes(prop as K)) delete obj[prop]
+    for (const k of Object.keys(obj)) {
+      if (!props.includes(k as K)) delete obj[k]
     }
     return obj
   }
   // Start as empty object, pick/add needed properties
   const r = {} as T
-  for (const prop of props) {
-    if (prop in obj) r[prop] = obj[prop]
+  for (const k of props) {
+    if (k in obj) r[k] = obj[k]
+  }
+  return r
+}
+
+/**
+ * Sets all properties of an object except passed ones to `undefined`.
+ * This is a more performant alternative to `_pick` that does picking/deleting.
+ */
+export function _pickWithUndefined<T extends AnyObject, K extends keyof T>(
+  obj: T,
+  props: readonly K[],
+  mutate = false,
+): T {
+  const r: T = mutate ? obj : { ...obj }
+  for (const k of Object.keys(r)) {
+    if (!props.includes(k as K)) {
+      r[k as K] = undefined as any
+    }
   }
   return r
 }
@@ -44,15 +62,31 @@ export function _omit<T extends AnyObject, K extends keyof T>(
   mutate = false,
 ): T {
   if (mutate) {
-    for (const prop of props) {
-      delete obj[prop]
+    for (const k of props) {
+      delete obj[k]
     }
     return obj
   }
 
   const r = {} as T
-  for (const prop of Object.keys(obj)) {
-    if (!props.includes(prop as K)) r[prop as K] = obj[prop]
+  for (const k of Object.keys(obj)) {
+    if (!props.includes(k as K)) r[k as K] = obj[k]
+  }
+  return r
+}
+
+/**
+ * Sets all passed properties of an object to `undefined`.
+ * This is a more performant alternative to `_omit` that does picking/deleting.
+ */
+export function _omitWithUndefined<T extends AnyObject, K extends keyof T>(
+  obj: T,
+  props: readonly K[],
+  mutate = false,
+): T {
+  const r: T = mutate ? obj : { ...obj }
+  for (const k of props) {
+    r[k] = undefined as any
   }
   return r
 }
@@ -67,8 +101,8 @@ export function _omit<T extends AnyObject, K extends keyof T>(
  */
 export function _mask<T extends AnyObject>(obj: T, props: string[], mutate = false): T {
   const r = mutate ? obj : _deepCopy(obj)
-  for (const prop of props) {
-    _unset(r, prop)
+  for (const k of props) {
+    _unset(r, k)
   }
   return r
 }

package/src/object/sortObject.ts

@@ -1,5 +1,4 @@
 import type { AnyObject } from '../index'
-import { _omit } from '../index'
 
 /**
  * Returns new object with keys sorder in the given order.
@@ -9,15 +8,18 @@ import { _omit } from '../index'
 export function _sortObject<T extends AnyObject>(obj: T, keyOrder: (keyof T)[]): T {
   const r = {} as T
 
-  keyOrder.forEach(key => {
-    if (key in obj) {
-      r[key] = obj[key]
+  // First, go over ordered keys
+  for (const k of keyOrder) {
+    if (k in obj) {
+      r[k] = obj[k]
     }
-  })
+  }
 
-  Object.entries(_omit(obj, keyOrder)).forEach(([k, v]) => {
+  // Second, go over all other keys
+  for (const [k, v] of Object.entries(obj)) {
+    if (keyOrder.includes(k)) continue
     r[k as keyof T] = v
-  })
+  }
 
   return r
 }

package/src/object/sortObjectDeep.ts

@@ -1,5 +1,3 @@
-import { _isObject } from '..'
-
 /**
  * based on: https://github.com/IndigoUnited/js-deep-sort-object
  */
@@ -9,16 +7,12 @@ export function _sortObjectDeep<T>(o: T): T {
     return o.map(_sortObjectDeep) as any
   }
 
-  if (_isObject(o)) {
-    const out = {} as T
-
-    Object.keys(o)
-      .sort((a, b) => a.localeCompare(b))
-      .forEach(k => {
-        out[k as keyof T] = _sortObjectDeep(o[k as keyof T])
-      })
-
-    return out
+  if (o && typeof o === 'object') {
+    const r = {} as T
+    for (const k of Object.keys(o).sort((a, b) => a.localeCompare(b)) as (keyof T)[]) {
+      r[k] = _sortObjectDeep(o[k])
+    }
+    return r
   }
 
   return o