@osmos/arraytotree 1.0.0

package/dist/index.d.mts

@@ -0,0 +1,11 @@
+type result = any[] & {
+    findNodeById?: (id: any, nodes: any[]) => any;
+};
+declare function arrayToTree(array: any[], option: {
+    idKey: string;
+    parentKey: string;
+    childrenKey: string;
+    sortKey?: string;
+}): result;
+
+export { arrayToTree };

package/dist/index.d.ts

@@ -0,0 +1,11 @@
+type result = any[] & {
+    findNodeById?: (id: any, nodes: any[]) => any;
+};
+declare function arrayToTree(array: any[], option: {
+    idKey: string;
+    parentKey: string;
+    childrenKey: string;
+    sortKey?: string;
+}): result;
+
+export { arrayToTree };

package/dist/index.js

@@ -0,0 +1,76 @@
+"use strict";
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+
+// src/index.ts
+var src_exports = {};
+__export(src_exports, {
+  arrayToTree: () => arrayToTree
+});
+module.exports = __toCommonJS(src_exports);
+function arrayToTree(array, option) {
+  const idMap = {};
+  const roots = [];
+  for (const obj of array) {
+    const id = obj[option.idKey];
+    let parentId = obj;
+    for (const key of option.parentKey.split(".")) {
+      parentId = parentId[key];
+    }
+    if (parentId && typeof parentId === "object") {
+      parentId = parentId[option.idKey];
+    }
+    obj[option.childrenKey] = [];
+    idMap[id] = obj;
+    if (!parentId) {
+      roots.push(obj);
+    } else {
+      const parent = idMap[parentId];
+      if (parent) {
+        parent[option.childrenKey].push(obj);
+      } else {
+        roots.push(obj);
+      }
+    }
+  }
+  if (option.sortKey) {
+    for (const obj of array) {
+      obj[option.childrenKey].sort((a, b) => a[option.sortKey] - b[option.sortKey]);
+    }
+  }
+  function findNodeById(id, nodes) {
+    for (const node of nodes) {
+      if (node[option.idKey] === id) {
+        return node;
+      }
+      const foundNode = findNodeById(id, node[option.childrenKey]);
+      if (foundNode) {
+        return foundNode;
+      }
+    }
+    return null;
+  }
+  roots.findNodeById = (id) => findNodeById(id, roots);
+  return roots;
+}
+console.log(11);
+// Annotate the CommonJS export names for ESM import in node:
+0 && (module.exports = {
+  arrayToTree
+});
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/index.ts"],"sourcesContent":["type result = any[] & { findNodeById?: (id: any, nodes: any[]) => any }\n\nexport function arrayToTree(\n    array: any[],\n    option: {\n        idKey: string\n        parentKey: string\n        childrenKey: string\n        sortKey?: string\n    },\n): result {\n    const idMap: { [key: string]: any } = {}\n    const roots: result = []\n\n    for (const obj of array) {\n        const id = obj[option.idKey]\n\n        let parentId = obj\n        for (const key of option.parentKey.split('.')) {\n            parentId = parentId[key]\n        }\n\n        if (parentId && typeof parentId === 'object') {\n            parentId = parentId[option.idKey]\n        }\n\n        obj[option.childrenKey] = []\n\n        idMap[id] = obj\n\n        if (!parentId) {\n            roots.push(obj)\n        } else {\n            const parent = idMap[parentId]\n            if (parent) {\n                parent[option.childrenKey].push(obj)\n            } else {\n                roots.push(obj)\n            }\n        }\n    }\n\n    // Sort children based on the sortKey\n    if (option.sortKey) {\n        for (const obj of array) {\n            obj[option.childrenKey].sort((a: any, b: any) => a[option.sortKey!] - b[option.sortKey!])\n        }\n    }\n\n    // Method to find a node in the tree with the idKey\n    function findNodeById(id: any, nodes: any[]): any {\n        for (const node of nodes) {\n            if (node[option.idKey] === id) {\n                return node\n            }\n            const foundNode = findNodeById(id, node[option.childrenKey])\n            if (foundNode) {\n                return foundNode\n            }\n        }\n        return null\n    }\n\n    // Add the findNodeById method to the result\n    roots.findNodeById = (id: any) => findNodeById(id, roots)\n\n    return roots\n}\n\n\nconsole.log(11)\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAEO,SAAS,YACZ,OACA,QAMM;AACN,QAAM,QAAgC,CAAC;AACvC,QAAM,QAAgB,CAAC;AAEvB,aAAW,OAAO,OAAO;AACrB,UAAM,KAAK,IAAI,OAAO,KAAK;AAE3B,QAAI,WAAW;AACf,eAAW,OAAO,OAAO,UAAU,MAAM,GAAG,GAAG;AAC3C,iBAAW,SAAS,GAAG;AAAA,IAC3B;AAEA,QAAI,YAAY,OAAO,aAAa,UAAU;AAC1C,iBAAW,SAAS,OAAO,KAAK;AAAA,IACpC;AAEA,QAAI,OAAO,WAAW,IAAI,CAAC;AAE3B,UAAM,EAAE,IAAI;AAEZ,QAAI,CAAC,UAAU;AACX,YAAM,KAAK,GAAG;AAAA,IAClB,OAAO;AACH,YAAM,SAAS,MAAM,QAAQ;AAC7B,UAAI,QAAQ;AACR,eAAO,OAAO,WAAW,EAAE,KAAK,GAAG;AAAA,MACvC,OAAO;AACH,cAAM,KAAK,GAAG;AAAA,MAClB;AAAA,IACJ;AAAA,EACJ;AAGA,MAAI,OAAO,SAAS;AAChB,eAAW,OAAO,OAAO;AACrB,UAAI,OAAO,WAAW,EAAE,KAAK,CAAC,GAAQ,MAAW,EAAE,OAAO,OAAQ,IAAI,EAAE,OAAO,OAAQ,CAAC;AAAA,IAC5F;AAAA,EACJ;AAGA,WAAS,aAAa,IAAS,OAAmB;AAC9C,eAAW,QAAQ,OAAO;AACtB,UAAI,KAAK,OAAO,KAAK,MAAM,IAAI;AAC3B,eAAO;AAAA,MACX;AACA,YAAM,YAAY,aAAa,IAAI,KAAK,OAAO,WAAW,CAAC;AAC3D,UAAI,WAAW;AACX,eAAO;AAAA,MACX;AAAA,IACJ;AACA,WAAO;AAAA,EACX;AAGA,QAAM,eAAe,CAAC,OAAY,aAAa,IAAI,KAAK;AAExD,SAAO;AACX;AAGA,QAAQ,IAAI,EAAE;","names":[]}

package/dist/index.mjs

@@ -0,0 +1,51 @@
+// src/index.ts
+function arrayToTree(array, option) {
+  const idMap = {};
+  const roots = [];
+  for (const obj of array) {
+    const id = obj[option.idKey];
+    let parentId = obj;
+    for (const key of option.parentKey.split(".")) {
+      parentId = parentId[key];
+    }
+    if (parentId && typeof parentId === "object") {
+      parentId = parentId[option.idKey];
+    }
+    obj[option.childrenKey] = [];
+    idMap[id] = obj;
+    if (!parentId) {
+      roots.push(obj);
+    } else {
+      const parent = idMap[parentId];
+      if (parent) {
+        parent[option.childrenKey].push(obj);
+      } else {
+        roots.push(obj);
+      }
+    }
+  }
+  if (option.sortKey) {
+    for (const obj of array) {
+      obj[option.childrenKey].sort((a, b) => a[option.sortKey] - b[option.sortKey]);
+    }
+  }
+  function findNodeById(id, nodes) {
+    for (const node of nodes) {
+      if (node[option.idKey] === id) {
+        return node;
+      }
+      const foundNode = findNodeById(id, node[option.childrenKey]);
+      if (foundNode) {
+        return foundNode;
+      }
+    }
+    return null;
+  }
+  roots.findNodeById = (id) => findNodeById(id, roots);
+  return roots;
+}
+console.log(11);
+export {
+  arrayToTree
+};
+//# sourceMappingURL=index.mjs.map

package/dist/index.mjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/index.ts"],"sourcesContent":["type result = any[] & { findNodeById?: (id: any, nodes: any[]) => any }\n\nexport function arrayToTree(\n    array: any[],\n    option: {\n        idKey: string\n        parentKey: string\n        childrenKey: string\n        sortKey?: string\n    },\n): result {\n    const idMap: { [key: string]: any } = {}\n    const roots: result = []\n\n    for (const obj of array) {\n        const id = obj[option.idKey]\n\n        let parentId = obj\n        for (const key of option.parentKey.split('.')) {\n            parentId = parentId[key]\n        }\n\n        if (parentId && typeof parentId === 'object') {\n            parentId = parentId[option.idKey]\n        }\n\n        obj[option.childrenKey] = []\n\n        idMap[id] = obj\n\n        if (!parentId) {\n            roots.push(obj)\n        } else {\n            const parent = idMap[parentId]\n            if (parent) {\n                parent[option.childrenKey].push(obj)\n            } else {\n                roots.push(obj)\n            }\n        }\n    }\n\n    // Sort children based on the sortKey\n    if (option.sortKey) {\n        for (const obj of array) {\n            obj[option.childrenKey].sort((a: any, b: any) => a[option.sortKey!] - b[option.sortKey!])\n        }\n    }\n\n    // Method to find a node in the tree with the idKey\n    function findNodeById(id: any, nodes: any[]): any {\n        for (const node of nodes) {\n            if (node[option.idKey] === id) {\n                return node\n            }\n            const foundNode = findNodeById(id, node[option.childrenKey])\n            if (foundNode) {\n                return foundNode\n            }\n        }\n        return null\n    }\n\n    // Add the findNodeById method to the result\n    roots.findNodeById = (id: any) => findNodeById(id, roots)\n\n    return roots\n}\n\n\nconsole.log(11)\n"],"mappings":";AAEO,SAAS,YACZ,OACA,QAMM;AACN,QAAM,QAAgC,CAAC;AACvC,QAAM,QAAgB,CAAC;AAEvB,aAAW,OAAO,OAAO;AACrB,UAAM,KAAK,IAAI,OAAO,KAAK;AAE3B,QAAI,WAAW;AACf,eAAW,OAAO,OAAO,UAAU,MAAM,GAAG,GAAG;AAC3C,iBAAW,SAAS,GAAG;AAAA,IAC3B;AAEA,QAAI,YAAY,OAAO,aAAa,UAAU;AAC1C,iBAAW,SAAS,OAAO,KAAK;AAAA,IACpC;AAEA,QAAI,OAAO,WAAW,IAAI,CAAC;AAE3B,UAAM,EAAE,IAAI;AAEZ,QAAI,CAAC,UAAU;AACX,YAAM,KAAK,GAAG;AAAA,IAClB,OAAO;AACH,YAAM,SAAS,MAAM,QAAQ;AAC7B,UAAI,QAAQ;AACR,eAAO,OAAO,WAAW,EAAE,KAAK,GAAG;AAAA,MACvC,OAAO;AACH,cAAM,KAAK,GAAG;AAAA,MAClB;AAAA,IACJ;AAAA,EACJ;AAGA,MAAI,OAAO,SAAS;AAChB,eAAW,OAAO,OAAO;AACrB,UAAI,OAAO,WAAW,EAAE,KAAK,CAAC,GAAQ,MAAW,EAAE,OAAO,OAAQ,IAAI,EAAE,OAAO,OAAQ,CAAC;AAAA,IAC5F;AAAA,EACJ;AAGA,WAAS,aAAa,IAAS,OAAmB;AAC9C,eAAW,QAAQ,OAAO;AACtB,UAAI,KAAK,OAAO,KAAK,MAAM,IAAI;AAC3B,eAAO;AAAA,MACX;AACA,YAAM,YAAY,aAAa,IAAI,KAAK,OAAO,WAAW,CAAC;AAC3D,UAAI,WAAW;AACX,eAAO;AAAA,MACX;AAAA,IACJ;AACA,WAAO;AAAA,EACX;AAGA,QAAM,eAAe,CAAC,OAAY,aAAa,IAAI,KAAK;AAExD,SAAO;AACX;AAGA,QAAQ,IAAI,EAAE;","names":[]}

package/package.json

@@ -0,0 +1,29 @@
+{
+  "name": "@osmos/arraytotree",
+  "version": "1.0.0",
+  "description": "transform flat array to tree structure",
+  "main": "./dist/index.js",
+  "module": "./dist/index.mjs",
+  "types": "./dist/index.d.ts",
+  "files": [
+    "dist"
+  ],
+  "scripts": {
+    "build": "tsup",
+    "test": "jest"
+  },
+  "keywords": [
+    "array",
+    "tree"
+  ],
+  "author": "osmos",
+  "license": "ISC",
+  "devDependencies": {
+    "@types/jest": "^29.5.12",
+    "jest": "^29.7.0",
+    "ts-jest": "^29.1.2",
+    "ts-node": "^10.9.2",
+    "tsup": "^8.0.2",
+    "typescript": "^5.4.5"
+  }
+}