@visulima/object 1.0.12 → 2.0.1

package/dist/packem_shared/pick-BX11mP2m.cjs

@@ -1,52 +0,0 @@
-'use strict';
-
-const isPlainObject = require('./isPlainObject-D2hOGcuW.cjs');
-const pathsAreEqual = require('./paths-are-equal-BvHTDEDJ.cjs');
-
-var __defProp$1 = Object.defineProperty;
-var __name$1 = (target, value) => __defProp$1(target, "name", { value, configurable: true });
-const recursivePick = /* @__PURE__ */ __name$1((object, pickedKeys, pathUntilNow = "") => {
-  if (!isPlainObject(object)) {
-    return object;
-  }
-  return Object.entries(object).reduce((carry, [key, value]) => {
-    let path = pathUntilNow;
-    if (path) {
-      path += ".";
-    }
-    path += key;
-    if (pickedKeys.length > 0) {
-      let passed = false;
-      pickedKeys.forEach((pickedKey) => {
-        const pathDepth = path.split(".").length;
-        const pickedKeyDepth = pickedKey.split(".").length;
-        const pickedKeyUpToNow = pickedKey.split(".").slice(0, pathDepth).join(".");
-        const pathUpToPickedKeyDepth = path.split(".").slice(0, pickedKeyDepth).join(".");
-        if (pathsAreEqual.pathsAreEqual(pathUpToPickedKeyDepth, pickedKeyUpToNow)) {
-          passed = true;
-        }
-      });
-      if (!passed) {
-        return carry;
-      }
-    }
-    if (!isPlainObject(value)) {
-      carry[key] = value;
-      return carry;
-    }
-    carry[key] = recursivePick(object[key], pickedKeys, path);
-    return carry;
-  }, {});
-}, "recursivePick");
-
-var __defProp = Object.defineProperty;
-var __name = (target, value) => __defProp(target, "name", { value, configurable: true });
-const isFullArray = /* @__PURE__ */ __name((input) => Array.isArray(input) && input.length > 0, "isFullArray");
-const pick = /* @__PURE__ */ __name((object, keys) => {
-  if (!isFullArray(keys)) {
-    return {};
-  }
-  return recursivePick(object, keys);
-}, "pick");
-
-module.exports = pick;

package/dist/packem_shared/pick-C9-E3eDJ.mjs

@@ -1,50 +0,0 @@
-import isPlainObject from './isPlainObject-BEp1xndO.mjs';
-import { p as pathsAreEqual } from './paths-are-equal-DY1QWTwZ.mjs';
-
-var __defProp$1 = Object.defineProperty;
-var __name$1 = (target, value) => __defProp$1(target, "name", { value, configurable: true });
-const recursivePick = /* @__PURE__ */ __name$1((object, pickedKeys, pathUntilNow = "") => {
-  if (!isPlainObject(object)) {
-    return object;
-  }
-  return Object.entries(object).reduce((carry, [key, value]) => {
-    let path = pathUntilNow;
-    if (path) {
-      path += ".";
-    }
-    path += key;
-    if (pickedKeys.length > 0) {
-      let passed = false;
-      pickedKeys.forEach((pickedKey) => {
-        const pathDepth = path.split(".").length;
-        const pickedKeyDepth = pickedKey.split(".").length;
-        const pickedKeyUpToNow = pickedKey.split(".").slice(0, pathDepth).join(".");
-        const pathUpToPickedKeyDepth = path.split(".").slice(0, pickedKeyDepth).join(".");
-        if (pathsAreEqual(pathUpToPickedKeyDepth, pickedKeyUpToNow)) {
-          passed = true;
-        }
-      });
-      if (!passed) {
-        return carry;
-      }
-    }
-    if (!isPlainObject(value)) {
-      carry[key] = value;
-      return carry;
-    }
-    carry[key] = recursivePick(object[key], pickedKeys, path);
-    return carry;
-  }, {});
-}, "recursivePick");
-
-var __defProp = Object.defineProperty;
-var __name = (target, value) => __defProp(target, "name", { value, configurable: true });
-const isFullArray = /* @__PURE__ */ __name((input) => Array.isArray(input) && input.length > 0, "isFullArray");
-const pick = /* @__PURE__ */ __name((object, keys) => {
-  if (!isFullArray(keys)) {
-    return {};
-  }
-  return recursivePick(object, keys);
-}, "pick");
-
-export { pick as default };

package/dist/pick.d.cts

@@ -1,20 +0,0 @@
-/**
- * Modified copy of https://github.com/mesqueeb/filter-anything/blob/main/src/index.ts
- *
- * MIT License
- *
- * Copyright (c) 2018 Luca Ban - Mesqueeb
- */
-import type { Paths, PickDeep } from ".//index.d.d.cts";
-/**
- * pick returns a new object with only the props you pick
- *
- * @export
- * @template T
- * @template K
- * @param {T} object the target object to pick props from
- * @param {K[]} keys an array of prop names you want to keep - allows dot-notation for nested props, eg. `nested.prop` will keep just `{ nested: { prop: 1 } }`
- * @returns {PickDeep<T, K>} a new object with just the picked props
- */
-declare const pick: <T extends { [key in string]: unknown; }, K extends Paths<T>>(object: T, keys: Paths<T>[]) => PickDeep<T, K>;
-export = pick;

package/dist/pick.d.mts

@@ -1,20 +0,0 @@
-/**
- * Modified copy of https://github.com/mesqueeb/filter-anything/blob/main/src/index.ts
- *
- * MIT License
- *
- * Copyright (c) 2018 Luca Ban - Mesqueeb
- */
-import type { Paths, PickDeep } from ".//index.d.d.mts";
-/**
- * pick returns a new object with only the props you pick
- *
- * @export
- * @template T
- * @template K
- * @param {T} object the target object to pick props from
- * @param {K[]} keys an array of prop names you want to keep - allows dot-notation for nested props, eg. `nested.prop` will keep just `{ nested: { prop: 1 } }`
- * @returns {PickDeep<T, K>} a new object with just the picked props
- */
-declare const pick: <T extends { [key in string]: unknown; }, K extends Paths<T>>(object: T, keys: Paths<T>[]) => PickDeep<T, K>;
-export default pick;

package/dist/pick.d.ts

@@ -1,20 +0,0 @@
-/**
- * Modified copy of https://github.com/mesqueeb/filter-anything/blob/main/src/index.ts
- *
- * MIT License
- *
- * Copyright (c) 2018 Luca Ban - Mesqueeb
- */
-import type { Paths, PickDeep } from ".//index.d.d.ts";
-/**
- * pick returns a new object with only the props you pick
- *
- * @export
- * @template T
- * @template K
- * @param {T} object the target object to pick props from
- * @param {K[]} keys an array of prop names you want to keep - allows dot-notation for nested props, eg. `nested.prop` will keep just `{ nested: { prop: 1 } }`
- * @returns {PickDeep<T, K>} a new object with just the picked props
- */
-declare const pick: <T extends { [key in string]: unknown; }, K extends Paths<T>>(object: T, keys: Paths<T>[]) => PickDeep<T, K>;
-export = pick;

package/dist/utils/paths-are-equal.d.cts

@@ -1,9 +0,0 @@
-/**
- * Modified copy of https://github.com/mesqueeb/filter-anything/blob/main/src/pathsAreEqual.ts
- *
- * MIT License
- *
- * Copyright (c) 2018 Luca Ban - Mesqueeb
- */
-declare const pathsAreEqual: (path: string, wildcardPath: string) => boolean;
-export = pathsAreEqual;

package/dist/utils/paths-are-equal.d.mts

@@ -1,9 +0,0 @@
-/**
- * Modified copy of https://github.com/mesqueeb/filter-anything/blob/main/src/pathsAreEqual.ts
- *
- * MIT License
- *
- * Copyright (c) 2018 Luca Ban - Mesqueeb
- */
-declare const pathsAreEqual: (path: string, wildcardPath: string) => boolean;
-export default pathsAreEqual;

package/dist/utils/paths-are-equal.d.ts

@@ -1,9 +0,0 @@
-/**
- * Modified copy of https://github.com/mesqueeb/filter-anything/blob/main/src/pathsAreEqual.ts
- *
- * MIT License
- *
- * Copyright (c) 2018 Luca Ban - Mesqueeb
- */
-declare const pathsAreEqual: (path: string, wildcardPath: string) => boolean;
-export = pathsAreEqual;

package/dist/utils/recursive-omit.d.cts

@@ -1,3 +0,0 @@
-import type { Paths } from ".//index.d.d.cts";
-declare const recursiveOmit: <T extends { [key in string]: unknown; }, OmittedKeys extends Paths<T>[]>(object: T, omittedKeys: OmittedKeys, pathUntilNow?: string) => T;
-export = recursiveOmit;

package/dist/utils/recursive-omit.d.mts

@@ -1,3 +0,0 @@
-import type { Paths } from ".//index.d.d.mts";
-declare const recursiveOmit: <T extends { [key in string]: unknown; }, OmittedKeys extends Paths<T>[]>(object: T, omittedKeys: OmittedKeys, pathUntilNow?: string) => T;
-export default recursiveOmit;

package/dist/utils/recursive-omit.d.ts

@@ -1,3 +0,0 @@
-import type { Paths } from ".//index.d.d.ts";
-declare const recursiveOmit: <T extends { [key in string]: unknown; }, OmittedKeys extends Paths<T>[]>(object: T, omittedKeys: OmittedKeys, pathUntilNow?: string) => T;
-export = recursiveOmit;

package/dist/utils/recursive-pick.d.cts

@@ -1,3 +0,0 @@
-import type { Paths } from ".//index.d.d.cts";
-declare const recursivePick: <T extends { [key in string]: unknown; }, PickedKeys extends Paths<T>[]>(object: T, pickedKeys: PickedKeys, pathUntilNow?: string) => T;
-export = recursivePick;

package/dist/utils/recursive-pick.d.mts

@@ -1,3 +0,0 @@
-import type { Paths } from ".//index.d.d.mts";
-declare const recursivePick: <T extends { [key in string]: unknown; }, PickedKeys extends Paths<T>[]>(object: T, pickedKeys: PickedKeys, pathUntilNow?: string) => T;
-export default recursivePick;

package/dist/utils/recursive-pick.d.ts

@@ -1,3 +0,0 @@
-import type { Paths } from ".//index.d.d.ts";
-declare const recursivePick: <T extends { [key in string]: unknown; }, PickedKeys extends Paths<T>[]>(object: T, pickedKeys: PickedKeys, pathUntilNow?: string) => T;
-export = recursivePick;