v1.9.0

Author: philipstanislaus

Diff for: build/arrayToTree.d.ts

@@ -17,6 +17,7 @@ export interface Config {
     rootParentIds: {
         [rootParentId: string]: true;
     };
+    nestedIds: boolean;
 }
 /**
  * Unflattens an array to a tree with runtime O(n)

Diff for: build/arrayToTree.js

@@ -1,6 +1,6 @@
 {
   "name": "performant-array-to-tree",
-  "version": "1.8.2",
+  "version": "1.9.0",
   "description": "Converts an array of items with ids and parent ids to a nested tree in a performant `O(n)` way. Runs in browsers and node.",
   "keywords": [
     "array to tree",

Diff for: build/arrayToTree.js.map

@@ -85,24 +85,37 @@ describe("arrayToTree", () => {
     expect(
       arrayToTree(
         [
-          { '.key': "4", 'my.parent': null, custom: "abc" },
-          { '.key': "31", 'my.parent': "4", custom: "12" },
-          { '.key': "1941", 'my.parent': "418", custom: "de" },
-          { '.key': "1", 'my.parent': "418", custom: "ZZZz" },
-          { '.key': "418", 'my.parent': null, custom: "ü" },
+          { ".key": "4", "my.parent": null, custom: "abc" },
+          { ".key": "31", "my.parent": "4", custom: "12" },
+          { ".key": "1941", "my.parent": "418", custom: "de" },
+          { ".key": "1", "my.parent": "418", custom: "ZZZz" },
+          { ".key": "418", "my.parent": null, custom: "ü" },
         ],
-        { id: '.key', parentId: 'my.parent', childrenField: "nodes", nestedIds: false }
+        {
+          id: ".key",
+          parentId: "my.parent",
+          childrenField: "nodes",
+          nestedIds: false,
+        }
       )
     ).to.deep.equal([
       {
-        data: { '.key': "4", 'my.parent': null, custom: "abc" },
-        nodes: [{ data: { '.key': "31", 'my.parent': "4", custom: "12" }, nodes: [] }],
+        data: { ".key": "4", "my.parent": null, custom: "abc" },
+        nodes: [
+          { data: { ".key": "31", "my.parent": "4", custom: "12" }, nodes: [] },
+        ],
       },
       {
-        data: { '.key': "418", 'my.parent': null, custom: "ü" },
+        data: { ".key": "418", "my.parent": null, custom: "ü" },
         nodes: [
-          { data: { '.key': "1941", 'my.parent': "418", custom: "de" }, nodes: [] },
-          { data: { '.key': "1", 'my.parent': "418", custom: "ZZZz" }, nodes: [] },
+          {
+            data: { ".key": "1941", "my.parent": "418", custom: "de" },
+            nodes: [],
+          },
+          {
+            data: { ".key": "1", "my.parent": "418", custom: "ZZZz" },
+            nodes: [],
+          },
         ],
       },
     ]);

Diff for: build/arrayToTree.min.js

@@ -56,8 +56,12 @@ export function arrayToTree(
   // in the lookup object and fill it with the data of the parent later
   // if an item has no parentId, add it as a root element to rootItems
   for (const item of items) {
-    const itemId = conf.nestedIds ? getNestedProperty(item, conf.id) : item[conf.id];
-    const parentId = conf.nestedIds ? getNestedProperty(item, conf.parentId) : item[conf.parentId];
+    const itemId = conf.nestedIds
+      ? getNestedProperty(item, conf.id)
+      : item[conf.id];
+    const parentId = conf.nestedIds
+      ? getNestedProperty(item, conf.parentId)
+      : item[conf.parentId];
 
     if (conf.rootParentIds[itemId]) {
       throw new Error(