@appartmint/tsm-mint 0.1.9 → 0.1.10

package/dist/util/object.cjs.js

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function i(e,t){let r=Object.keys(e);if(r.length!==Object.keys(t).length)return!1;let n=!0;return r.forEach(u=>{e[u]!==t[u]&&(n=!1)}),n}function l(e,t){let r=!0;if(e===t)return r;try{if(Object.keys(t).length===0)return!r}catch{return!r}return Object.keys(t).forEach(n=>{r=r&&l(e[n],t[n])}),r}function o(e,t){return Object.keys(e).reduce((r,n)=>(t.includes(n)||(r[n]=e[n]),r),{})}function y(e,t){return Object.keys(e).reduce((r,n)=>(t.includes(e[n])||(r[n]=e[n]),r),{})}function h(e,t){return Object.keys(e).sort(t).reduce((r,n)=>(r[n]=e[n],r),{})}function a(e,t){return Object.keys(e).sort((r,n)=>t(e[r],e[n])).reduce((r,n)=>(r[n]=e[n],r),{})}function K(e,t){return t.reduce((r,n)=>(r[n]=e[n],r),{})}function S(e,t){return Object.keys(e).reduce((r,n)=>(t.includes(e[n])&&(r[n]=e[n]),r),{})}function m(e,t,r="id"){if(!(t!=null&&t.length))t==null||t.forEach(u=>e.push(u));else{const u=t.reduce((s,c)=>({...s,[(c==null?void 0:c[r])??""]:c}),{}),f=e.filter(s=>!u[(s==null?void 0:s[r])??""]);f==null||f.forEach(s=>{const c=e.indexOf(s);typeof c=="number"&&c!==-1&&e.splice(c,1)}),e.forEach(s=>{u[(s==null?void 0:s[r])??""]&&Object.assign(s,u[(s==null?void 0:s[r])??""])})}const n=t==null?void 0:t.filter(u=>!e.some(f=>(f==null?void 0:f[r])===(u==null?void 0:u[r])));n==null||n.forEach(u=>e.push(u))}function O(e,t){return Object.keys(e).find(r=>e[r]===t)}function A(e){if(typeof e!="object"||e===null)return e;const t=new WeakMap,r=[[e,Array.isArray(e)?[]:{}]];for(;r.length;){const[n,u,f]=r.pop();if(f!==void 0){const s=n[f];if(typeof s=="function"){u[f]=s.bind(u);continue}if(typeof s!="object"||s===null){u[f]=s;continue}if(t.has(s)){u[f]=t.get(s);continue}u[f]=Array.isArray(s)?[]:{},t.set(s,u[f]),r.push([s,u[f]])}else{if(t.set(n,u),Array.isArray(n)){n.forEach((s,c)=>{r.push([n,u,c])});continue}Object.keys(n).forEach(s=>{r.push([n,u,s])})}}return t.get(e)}exports.objectDeepClone=A;exports.objectFilterKeys=K;exports.objectFilterValues=S;exports.objectGetKeyByValue=O;exports.objectIsSuperset=l;exports.objectRemoveValues=y;exports.objectSameKeys=i;exports.objectSortKeys=h;exports.objectSortValues=a;exports.objectUpdateArray=m;exports.removeKeys=o;

package/dist/util/object.d.ts

@@ -0,0 +1,59 @@
+/**
+ * Returns true if the provided objects have the same keys
+ */
+export declare function objectSameKeys(obj1: any, obj2: any): boolean;
+/**
+ * Returns true if the first object has at least the same
+ * entries as the second object
+ * @param superset - the object to check
+ * @param subset - the object whose entries are required
+ * @returns - true if the first object is a superset of the second
+ */
+export declare function objectIsSuperset(superset: any, subset: any): boolean;
+/**
+ * Removes object entries by key
+ * @param object - the object to remove entries from
+ * @param keys - the keys to remove
+ */
+export declare function removeKeys(object: any, keys: string[]): any;
+/**
+ * Removes object entries by value
+ */
+export declare function objectRemoveValues(object: any, values: any[]): any;
+/**
+ * Sorts an object's entries alphabetically by key
+ */
+export declare function objectSortKeys(object: any, compareFn?: (a: string, b: string) => number): any;
+/**
+ * Sorts an object's entries alphabetically by value
+ */
+export declare function objectSortValues(object: any, compareFn: (a: any, b: any) => number): any;
+/**
+ * Filters an object by its keys
+ * @param object - the object to filter
+ * @param keys - the keys to keep
+ * @returns - the filtered object
+ */
+export declare function objectFilterKeys(object: any, keys: string[]): Object;
+/**
+ * Filters an object by its values
+ * @param object - the object to filter
+ * @param values - the values to keep
+ * @returns - the filtered object
+ */
+export declare function objectFilterValues(object: any, values: any[]): Object;
+/**
+ * Update two sets of objects
+ * @param original - the original object
+ * @param update - the object to update the original with
+ * @returns - the original objects with updated data from the update
+ */
+export declare function objectUpdateArray(original: any[], update?: any[], key?: string): any;
+/**
+ * Get an object's key by value
+ */
+export declare function objectGetKeyByValue(object: any, value: any): string | undefined;
+/**
+ * Create a deep copy of an object
+ */
+export declare function objectDeepClone<T>(object: T): T;

package/dist/util/object.es.js

@@ -0,0 +1,110 @@
+function l(r, u) {
+  let n = Object.keys(r);
+  if (n.length !== Object.keys(u).length)
+    return !1;
+  let e = !0;
+  return n.forEach((s) => {
+    r[s] !== u[s] && (e = !1);
+  }), e;
+}
+function c(r, u) {
+  let n = !0;
+  if (r === u)
+    return n;
+  try {
+    if (Object.keys(u).length === 0)
+      return !n;
+  } catch {
+    return !n;
+  }
+  return Object.keys(u).forEach((e) => {
+    n = n && c(r[e], u[e]);
+  }), n;
+}
+function h(r, u) {
+  return Object.keys(r).reduce((n, e) => (u.includes(e) || (n[e] = r[e]), n), {});
+}
+function y(r, u) {
+  return Object.keys(r).reduce((n, e) => (u.includes(r[e]) || (n[e] = r[e]), n), {});
+}
+function a(r, u) {
+  return Object.keys(r).sort(u).reduce((n, e) => (n[e] = r[e], n), {});
+}
+function o(r, u) {
+  return Object.keys(r).sort((n, e) => u(r[n], r[e])).reduce((n, e) => (n[e] = r[e], n), {});
+}
+function E(r, u) {
+  return u.reduce((n, e) => (n[e] = r[e], n), {});
+}
+function O(r, u) {
+  return Object.keys(r).reduce((n, e) => (u.includes(r[e]) && (n[e] = r[e]), n), {});
+}
+function A(r, u, n = "id") {
+  if (!(u != null && u.length))
+    u == null || u.forEach((s) => r.push(s));
+  else {
+    const s = u.reduce((f, i) => ({
+      ...f,
+      [(i == null ? void 0 : i[n]) ?? ""]: i
+    }), {}), t = r.filter((f) => !s[(f == null ? void 0 : f[n]) ?? ""]);
+    t == null || t.forEach((f) => {
+      const i = r.indexOf(f);
+      typeof i == "number" && i !== -1 && r.splice(i, 1);
+    }), r.forEach((f) => {
+      s[(f == null ? void 0 : f[n]) ?? ""] && Object.assign(f, s[(f == null ? void 0 : f[n]) ?? ""]);
+    });
+  }
+  const e = u == null ? void 0 : u.filter((s) => !r.some((t) => (t == null ? void 0 : t[n]) === (s == null ? void 0 : s[n])));
+  e == null || e.forEach((s) => r.push(s));
+}
+function K(r, u) {
+  return Object.keys(r).find((n) => r[n] === u);
+}
+function m(r) {
+  if (typeof r != "object" || r === null)
+    return r;
+  const u = /* @__PURE__ */ new WeakMap(), n = [[r, Array.isArray(r) ? [] : {}]];
+  for (; n.length; ) {
+    const [e, s, t] = n.pop();
+    if (t !== void 0) {
+      const f = e[t];
+      if (typeof f == "function") {
+        s[t] = f.bind(s);
+        continue;
+      }
+      if (typeof f != "object" || f === null) {
+        s[t] = f;
+        continue;
+      }
+      if (u.has(f)) {
+        s[t] = u.get(f);
+        continue;
+      }
+      s[t] = Array.isArray(f) ? [] : {}, u.set(f, s[t]), n.push([f, s[t]]);
+    } else {
+      if (u.set(e, s), Array.isArray(e)) {
+        e.forEach((f, i) => {
+          n.push([e, s, i]);
+        });
+        continue;
+      }
+      Object.keys(e).forEach((f) => {
+        n.push([e, s, f]);
+      });
+    }
+  }
+  return u.get(r);
+}
+export {
+  m as objectDeepClone,
+  E as objectFilterKeys,
+  O as objectFilterValues,
+  K as objectGetKeyByValue,
+  c as objectIsSuperset,
+  y as objectRemoveValues,
+  l as objectSameKeys,
+  a as objectSortKeys,
+  o as objectSortValues,
+  A as objectUpdateArray,
+  h as removeKeys
+};

package/package.json

@@ -1,7 +1,7 @@
 {
 	"name": "@appartmint/tsm-mint",
 	"author": "App Art Mint LLC",
-	"version": "0.1.9",
+	"version": "0.1.10",
 	"type": "module",
 	"license": "MIT",
 	"description": "TypeScript Modules from App Art Mint LLC",