fast-tree-builder 2.0.0-beta.3 → 2.0.0-beta.4

package/README.md

@@ -19,7 +19,7 @@
 ## Features
 
 - **Supports `parentId` and `childIds` Models** – Choose your relation style via options.
-- **Fully Typed** – TypeScript support with correct types for the built tree.
+- **Fully Typed** – Carefully written TypeScript types for the built tree.
 - **Highly Customizable** – Design the node structure as you like.
 - **Any Iterable Accepted** – Works on arrays, sets, or any iterable type.
 - **Flexible ID Types** – Anything can be an identifier; relations matched with `childId === parentId`.
@@ -59,18 +59,18 @@ Builds a tree structure from an iterable list of items.
 
 - `id`: A key or function used to extract the unique identifier from each item.
 
-##### One of:
+##### One of
 
 - `parentId`: A key or function that access the parent ID of the item.
 - `childIds`: A key or function that access an iterable of child IDs for the item.
 
 ##### Optional
 
-- `nodeValueMapper`: Function to map an item to a custom value stored in the node.
-- `nodeValueKey`: Key where the item is stored in the output node. Set to `false` to inline the item directly into the node. Defaults to `'value'`.
-- `nodeParentKey`: Key where the node's parent reference is stored. Set to `false` to omit parent links. Defaults to `'parent'`.
-- `nodeChildrenKey`: Key where the node's children are stored. Defaults to `'children'`.
-- `nodeDepthKey`: Object key used to store the node's depth in the tree (root = 0). Set to `false` to omit depth values. Turns on `validateTree` when a string value is set here. Defaults to `false`.
+- `valueResolver`: Function to transform an item to a custom value stored in the node. Defaults to use the input item as is.
+- `valueKey`: Key where the item is stored in the output node. Set to `false` to inline the item directly into the node. Defaults to `'value'`.
+- `parentKey`: Key where the node's parent reference is stored in the output node. Set to `false` to omit parent links. Defaults to `'parent'`.
+- `childrenKey`: Key where the node's children are stored in the output node. Defaults to `'children'`.
+- `depthKey`: Key where the node's depth (with root = 0) is stored in the output node. Set to `false` to omit depth values. Automatically enables `validateTree` when a string value is set here. Defaults to `false`.
 - `validateReferences`: When `true`, verifies all `parentId` or `childIds` resolve to real items. Errors are thrown on invalid references. Defaults to `false`.
 - `validateTree`: When `true`, verifies that the final structure is a valid tree (no cycles or nodes reachable via multipla paths). Errors are thrown if the check fails. Defaults to `false`.
 
@@ -88,7 +88,7 @@ Builds a tree structure from an iterable list of items.
 - Missing required `id`, `parentId`/`childIds`, or `options` parameter
 - Duplicate item identifiers in input
 - Invalid reference (if `validateReferences` is enabled)
-- Cycle or structural error (if `validateTree` is enabled or `nodeDepthKey` is string)
+- Cycle or structural error (if `validateTree` is enabled or `depthKey` is string)
 
 
 ## Usage
@@ -115,9 +115,9 @@ const { roots, nodes } = buildTree(items, {
   id: 'id',
   parentId: 'parent',
   // the built node:
-  nodeValueKey: 'value',
-  nodeParentKey: 'parent',
-  nodeChildrenKey: 'children',
+  valueKey: 'value',
+  parentKey: 'parent',
+  childrenKey: 'children',
 });
 
 console.log(roots[0].value.name);
@@ -193,10 +193,10 @@ const items = [
 const { roots, nodes } = buildTree(items, {
   id: item => item.key?.n,
   parentId: item => item.parentKey?.n,
-  nodeValueMapper: item => ({ title: item.name }),
-  nodeValueKey: false, // merge item data into node
-  nodeParentKey: 'up',
-  nodeChildrenKey: 'down',
+  valueResolver: item => ({ title: item.name }),
+  valueKey: false, // merge item data into node
+  parentKey: 'up',
+  childrenKey: 'down',
 });
 
 console.log(roots[0].title);
@@ -251,8 +251,8 @@ const items = [
 const { roots, nodes } = buildTree(items, {
   id: item => item.substring(2, 4),
   parentKey: item => item.substring(0, 2),
-  nodeValueMapper: item => ({ name: item.substring(4) }),
-  nodeValueKey: false, // merge item data into node
+  valueResolver: item => ({ name: item.substring(4) }),
+  valueKey: false, // merge item data into node
 });
 
 console.log(roots[0].name);

package/index.cjs

@@ -29,11 +29,11 @@ function buildTree(items, options) {
     id: idAccessor,
     parentId: parentIdAccessor,
     childIds: childIdsAccessor,
-    nodeValueMapper,
-    nodeValueKey = "value",
-    nodeParentKey = "parent",
-    nodeChildrenKey = "children",
-    nodeDepthKey = false,
+    valueResolver,
+    valueKey = "value",
+    parentKey = "parent",
+    childrenKey = "children",
+    depthKey = false,
     validateTree = false,
     validateReferences = false
   } = options;
@@ -55,21 +55,21 @@ function buildTree(items, options) {
       if (nodes.has(id)) {
         throw new Error(`Duplicate identifier '${id}'.`);
       }
-      const node = nodeValueKey !== false ? { [nodeValueKey]: nodeValueMapper ? nodeValueMapper(item) : item } : { ...nodeValueMapper ? nodeValueMapper(item) : item };
-      if (nodeValueKey === false) {
-        if (nodeParentKey !== false) {
-          delete node[nodeParentKey];
+      const node = valueKey !== false ? { [valueKey]: valueResolver ? valueResolver(item) : item } : { ...valueResolver ? valueResolver(item) : item };
+      if (valueKey === false) {
+        if (parentKey !== false) {
+          delete node[parentKey];
         }
-        delete node[nodeChildrenKey];
+        delete node[childrenKey];
       }
       nodes.set(id, node);
       const parentId = typeof parentIdAccessor === "function" ? parentIdAccessor(item) : item[parentIdAccessor];
       const parentNode = nodes.get(parentId);
       if (parentNode) {
-        parentNode[nodeChildrenKey] ||= [];
-        parentNode[nodeChildrenKey].push(node);
-        if (nodeParentKey !== false) {
-          node[nodeParentKey] = parentNode;
+        parentNode[childrenKey] ||= [];
+        parentNode[childrenKey].push(node);
+        if (parentKey !== false) {
+          node[parentKey] = parentNode;
         }
       } else {
         const siblings = waitingForParent.get(parentId);
@@ -81,10 +81,10 @@ function buildTree(items, options) {
       }
       const children = waitingForParent.get(id);
       if (children) {
-        node[nodeChildrenKey] = children;
-        if (nodeParentKey !== false) {
+        node[childrenKey] = children;
+        if (parentKey !== false) {
           for (const child of children) {
-            child[nodeParentKey] = node;
+            child[parentKey] = node;
           }
         }
         waitingForParent.delete(id);
@@ -106,12 +106,12 @@ function buildTree(items, options) {
       if (nodes.has(id)) {
         throw new Error(`Duplicate identifier '${id}'.`);
       }
-      const node = nodeValueKey !== false ? { [nodeValueKey]: nodeValueMapper ? nodeValueMapper(item) : item } : { ...nodeValueMapper ? nodeValueMapper(item) : item };
-      if (nodeValueKey === false) {
-        if (nodeParentKey !== false) {
-          delete node[nodeParentKey];
+      const node = valueKey !== false ? { [valueKey]: valueResolver ? valueResolver(item) : item } : { ...valueResolver ? valueResolver(item) : item };
+      if (valueKey === false) {
+        if (parentKey !== false) {
+          delete node[parentKey];
         }
-        delete node[nodeChildrenKey];
+        delete node[childrenKey];
       }
       nodes.set(id, node);
       const childIds = typeof childIdsAccessor === "function" ? childIdsAccessor(item) : item[childIdsAccessor];
@@ -119,16 +119,16 @@ function buildTree(items, options) {
         if (typeof childIds[Symbol.iterator] !== "function") {
           throw new Error(`Item '${id}' has invalid children: expected an iterable value.`);
         }
-        node[nodeChildrenKey] = [];
+        node[childrenKey] = [];
         for (const childId of childIds) {
           const childNode = nodes.get(childId);
           if (childNode) {
-            node[nodeChildrenKey].push(childNode);
-            if (nodeParentKey !== false) {
-              if (childNode[nodeParentKey] && childNode[nodeParentKey] !== node) {
+            node[childrenKey].push(childNode);
+            if (parentKey !== false) {
+              if (childNode[parentKey] && childNode[parentKey] !== node) {
                 throw new Error(`Node '${childId}' already has a different parent, refusing to overwrite.`);
               }
-              childNode[nodeParentKey] = node;
+              childNode[parentKey] = node;
             }
             rootCandidates.delete(childId);
           } else {
@@ -137,24 +137,24 @@ function buildTree(items, options) {
             }
             waitingChildren.set(childId, {
               parentNode: node,
-              childIndex: node[nodeChildrenKey].length
+              childIndex: node[childrenKey].length
             });
-            node[nodeChildrenKey].push(null);
+            node[childrenKey].push(null);
           }
         }
-        if (node[nodeChildrenKey].length === 0) {
-          delete node[nodeChildrenKey];
+        if (node[childrenKey].length === 0) {
+          delete node[childrenKey];
         }
       }
       const parentDescriptor = waitingChildren.get(id);
       if (parentDescriptor) {
         const { parentNode, childIndex } = parentDescriptor;
-        parentNode[nodeChildrenKey][childIndex] = node;
-        if (nodeParentKey !== false) {
-          if (node[nodeParentKey] && node[nodeParentKey] !== parentNode) {
+        parentNode[childrenKey][childIndex] = node;
+        if (parentKey !== false) {
+          if (node[parentKey] && node[parentKey] !== parentNode) {
             throw new Error(`Node '${id}' already has a different parent, refusing to overwrite.`);
           }
-          node[nodeParentKey] = parentNode;
+          node[parentKey] = parentNode;
         }
         waitingChildren.delete(id);
       } else {
@@ -169,9 +169,9 @@ function buildTree(items, options) {
       const pending = Array.from(waitingChildren.values());
       for (let i = pending.length - 1; i >= 0; i--) {
         const { parentNode, childIndex } = pending[i];
-        parentNode[nodeChildrenKey].splice(childIndex, 1);
-        if (parentNode[nodeChildrenKey].length === 0) {
-          delete parentNode[nodeChildrenKey];
+        parentNode[childrenKey].splice(childIndex, 1);
+        if (parentNode[childrenKey].length === 0) {
+          delete parentNode[childrenKey];
         }
       }
     }
@@ -179,7 +179,7 @@ function buildTree(items, options) {
       roots.push(node);
     }
   }
-  const withDepth = typeof nodeDepthKey === "string" || typeof nodeDepthKey === "symbol" || typeof nodeDepthKey === "number";
+  const withDepth = typeof depthKey === "string" || typeof depthKey === "symbol" || typeof depthKey === "number";
   if (validateTree || withDepth) {
     if (roots.length === 0 && nodes.size > 0) {
       throw new Error("Tree validation failed: detected a cycle.");
@@ -195,10 +195,10 @@ function buildTree(items, options) {
       }
       visited.add(node);
       if (withDepth) {
-        node[nodeDepthKey] = depth;
+        node[depthKey] = depth;
       }
-      if (node[nodeChildrenKey]) {
-        for (const child of node[nodeChildrenKey]) {
+      if (node[childrenKey]) {
+        for (const child of node[childrenKey]) {
           stack.push({ node: child, depth: depth + 1 });
         }
       }

package/index.d.cts

@@ -11,51 +11,51 @@ type AccessorReturnType<O, P extends (keyof O) | ((item: O) => any)> = P extends
 type ObjectKeysOfIterableProperties<T> = {
     [K in keyof T]: T[K] extends (Iterable<unknown> & object) | null | undefined ? K : never;
 }[keyof T];
-declare function buildTree<TIdAccessor extends (keyof NoInfer<TInputValue>) | ((item: NoInfer<TInputValue>) => unknown), TNodeValueKey extends PropertyKey | false = 'value', TNodeParentKey extends PropertyKey | false = 'parent', TNodeChildrenKey extends PropertyKey = 'children', TNodeDepthKey extends PropertyKey | false = false, TInputValue extends (TNodeValueKey extends false ? object : TIdAccessor extends PropertyKey ? object : unknown) = any, TMappedValue extends (TNodeValueKey extends false ? object : unknown) = TInputValue>(items: Iterable<TInputValue>, options: {
+declare function buildTree<TIdAccessor extends (keyof NoInfer<TInputValue>) | ((item: NoInfer<TInputValue>) => unknown), TValueKey extends PropertyKey | false = 'value', TParentKey extends PropertyKey | false = 'parent', TChildrenKey extends PropertyKey = 'children', TDepthKey extends PropertyKey | false = false, TInputValue extends (TValueKey extends false ? object : TIdAccessor extends PropertyKey ? object : unknown) = any, TResolvedValue extends (TValueKey extends false ? object : unknown) = TInputValue>(items: Iterable<TInputValue>, options: {
     /**
      * A string key or function used to get the item's unique identifier.
      */
     id: TIdAccessor;
     /**
-     * Maps the input item to a different value stored in the resulting tree node.
+     * Function to transform an item to a custom value stored in the node.
      */
-    nodeValueMapper?: {
-        (item: NoInfer<TInputValue>): TMappedValue;
+    valueResolver?: {
+        (item: NoInfer<TInputValue>): TResolvedValue;
     };
     /**
-     * Object key used to store the input item in the output tree node.
+     * Key where the item is stored in the output node.
      *
-     * Set to `false` to merge the item into the node itself.
+     * Set to `false` to inline the item directly into the node.
      *
      * Defaults to `'value'`.
      */
-    nodeValueKey?: TNodeValueKey;
+    valueKey?: TValueKey;
     /**
-     * Object key used to store the reference to the parent node in the output tree node.
+     * Key where the node's parent reference is stored in the output node.
      *
      * Set to `false` to omit parent links.
      *
      * Defaults to `'parent'`.
      */
-    nodeParentKey?: TNodeParentKey;
+    parentKey?: TParentKey;
     /**
-     * Object key used to store the list of child nodes in the output tree node.
+     * Key where the node's children are stored in the output node.
      *
      * Defaults to `'children'`.
      */
-    nodeChildrenKey?: TNodeChildrenKey;
+    childrenKey?: TChildrenKey;
     /**
-     * Object key used to store a value indicating the node depth in the tree on each output node.
+     * Key where the node's depth is stored in the output node.
      * Root nodes have a depth of 0.
      *
      * Set to `false` to omit depth values.
      *
-     * Enables `validateTree`, as depth assignment requires a valid tree structure,
-     * and both operations also share the same traversal logic.
+     * Automatically enables `validateTree` when a string value is set here:
+     * Depth assignment requires a valid tree structure, and both operations also share the same traversal logic.
      *
      * Defaults to `false`.
      */
-    nodeDepthKey?: TNodeDepthKey;
+    depthKey?: TDepthKey;
     /**
      * Validates that the final structure forms a tree.
      *
@@ -107,8 +107,8 @@ declare function buildTree<TIdAccessor extends (keyof NoInfer<TInputValue>) | ((
      */
     childIds?: never;
 })): {
-    roots: TreeNode<TMappedValue extends undefined ? TInputValue : TMappedValue, TNodeValueKey, TNodeParentKey, TNodeChildrenKey, TNodeDepthKey>[];
-    nodes: Map<AccessorReturnType<TInputValue, TIdAccessor>, TreeNode<TMappedValue extends undefined ? TInputValue : TMappedValue, TNodeValueKey, TNodeParentKey, TNodeChildrenKey, TNodeDepthKey>>;
+    roots: TreeNode<TResolvedValue extends undefined ? TInputValue : TResolvedValue, TValueKey, TParentKey, TChildrenKey, TDepthKey>[];
+    nodes: Map<AccessorReturnType<TInputValue, TIdAccessor>, TreeNode<TResolvedValue extends undefined ? TInputValue : TResolvedValue, TValueKey, TParentKey, TChildrenKey, TDepthKey>>;
 };
 declare const _default: { default: typeof buildTree };
 export = _default;

package/index.d.mts

@@ -11,51 +11,51 @@ type AccessorReturnType<O, P extends (keyof O) | ((item: O) => any)> = P extends
 type ObjectKeysOfIterableProperties<T> = {
     [K in keyof T]: T[K] extends (Iterable<unknown> & object) | null | undefined ? K : never;
 }[keyof T];
-export default function buildTree<TIdAccessor extends (keyof NoInfer<TInputValue>) | ((item: NoInfer<TInputValue>) => unknown), TNodeValueKey extends PropertyKey | false = 'value', TNodeParentKey extends PropertyKey | false = 'parent', TNodeChildrenKey extends PropertyKey = 'children', TNodeDepthKey extends PropertyKey | false = false, TInputValue extends (TNodeValueKey extends false ? object : TIdAccessor extends PropertyKey ? object : unknown) = any, TMappedValue extends (TNodeValueKey extends false ? object : unknown) = TInputValue>(items: Iterable<TInputValue>, options: {
+export default function buildTree<TIdAccessor extends (keyof NoInfer<TInputValue>) | ((item: NoInfer<TInputValue>) => unknown), TValueKey extends PropertyKey | false = 'value', TParentKey extends PropertyKey | false = 'parent', TChildrenKey extends PropertyKey = 'children', TDepthKey extends PropertyKey | false = false, TInputValue extends (TValueKey extends false ? object : TIdAccessor extends PropertyKey ? object : unknown) = any, TResolvedValue extends (TValueKey extends false ? object : unknown) = TInputValue>(items: Iterable<TInputValue>, options: {
     /**
      * A string key or function used to get the item's unique identifier.
      */
     id: TIdAccessor;
     /**
-     * Maps the input item to a different value stored in the resulting tree node.
+     * Function to transform an item to a custom value stored in the node.
      */
-    nodeValueMapper?: {
-        (item: NoInfer<TInputValue>): TMappedValue;
+    valueResolver?: {
+        (item: NoInfer<TInputValue>): TResolvedValue;
     };
     /**
-     * Object key used to store the input item in the output tree node.
+     * Key where the item is stored in the output node.
      *
-     * Set to `false` to merge the item into the node itself.
+     * Set to `false` to inline the item directly into the node.
      *
      * Defaults to `'value'`.
      */
-    nodeValueKey?: TNodeValueKey;
+    valueKey?: TValueKey;
     /**
-     * Object key used to store the reference to the parent node in the output tree node.
+     * Key where the node's parent reference is stored in the output node.
      *
      * Set to `false` to omit parent links.
      *
      * Defaults to `'parent'`.
      */
-    nodeParentKey?: TNodeParentKey;
+    parentKey?: TParentKey;
     /**
-     * Object key used to store the list of child nodes in the output tree node.
+     * Key where the node's children are stored in the output node.
      *
      * Defaults to `'children'`.
      */
-    nodeChildrenKey?: TNodeChildrenKey;
+    childrenKey?: TChildrenKey;
     /**
-     * Object key used to store a value indicating the node depth in the tree on each output node.
+     * Key where the node's depth is stored in the output node.
      * Root nodes have a depth of 0.
      *
      * Set to `false` to omit depth values.
      *
-     * Enables `validateTree`, as depth assignment requires a valid tree structure,
-     * and both operations also share the same traversal logic.
+     * Automatically enables `validateTree` when a string value is set here:
+     * Depth assignment requires a valid tree structure, and both operations also share the same traversal logic.
      *
      * Defaults to `false`.
      */
-    nodeDepthKey?: TNodeDepthKey;
+    depthKey?: TDepthKey;
     /**
      * Validates that the final structure forms a tree.
      *
@@ -107,7 +107,7 @@ export default function buildTree<TIdAccessor extends (keyof NoInfer<TInputValue
      */
     childIds?: never;
 })): {
-    roots: TreeNode<TMappedValue extends undefined ? TInputValue : TMappedValue, TNodeValueKey, TNodeParentKey, TNodeChildrenKey, TNodeDepthKey>[];
-    nodes: Map<AccessorReturnType<TInputValue, TIdAccessor>, TreeNode<TMappedValue extends undefined ? TInputValue : TMappedValue, TNodeValueKey, TNodeParentKey, TNodeChildrenKey, TNodeDepthKey>>;
+    roots: TreeNode<TResolvedValue extends undefined ? TInputValue : TResolvedValue, TValueKey, TParentKey, TChildrenKey, TDepthKey>[];
+    nodes: Map<AccessorReturnType<TInputValue, TIdAccessor>, TreeNode<TResolvedValue extends undefined ? TInputValue : TResolvedValue, TValueKey, TParentKey, TChildrenKey, TDepthKey>>;
 };
 export {};

package/index.mjs

@@ -6,11 +6,11 @@ function buildTree(items, options) {
     id: idAccessor,
     parentId: parentIdAccessor,
     childIds: childIdsAccessor,
-    nodeValueMapper,
-    nodeValueKey = "value",
-    nodeParentKey = "parent",
-    nodeChildrenKey = "children",
-    nodeDepthKey = false,
+    valueResolver,
+    valueKey = "value",
+    parentKey = "parent",
+    childrenKey = "children",
+    depthKey = false,
     validateTree = false,
     validateReferences = false
   } = options;
@@ -32,21 +32,21 @@ function buildTree(items, options) {
       if (nodes.has(id)) {
         throw new Error(`Duplicate identifier '${id}'.`);
       }
-      const node = nodeValueKey !== false ? { [nodeValueKey]: nodeValueMapper ? nodeValueMapper(item) : item } : { ...nodeValueMapper ? nodeValueMapper(item) : item };
-      if (nodeValueKey === false) {
-        if (nodeParentKey !== false) {
-          delete node[nodeParentKey];
+      const node = valueKey !== false ? { [valueKey]: valueResolver ? valueResolver(item) : item } : { ...valueResolver ? valueResolver(item) : item };
+      if (valueKey === false) {
+        if (parentKey !== false) {
+          delete node[parentKey];
         }
-        delete node[nodeChildrenKey];
+        delete node[childrenKey];
       }
       nodes.set(id, node);
       const parentId = typeof parentIdAccessor === "function" ? parentIdAccessor(item) : item[parentIdAccessor];
       const parentNode = nodes.get(parentId);
       if (parentNode) {
-        parentNode[nodeChildrenKey] ||= [];
-        parentNode[nodeChildrenKey].push(node);
-        if (nodeParentKey !== false) {
-          node[nodeParentKey] = parentNode;
+        parentNode[childrenKey] ||= [];
+        parentNode[childrenKey].push(node);
+        if (parentKey !== false) {
+          node[parentKey] = parentNode;
         }
       } else {
         const siblings = waitingForParent.get(parentId);
@@ -58,10 +58,10 @@ function buildTree(items, options) {
       }
       const children = waitingForParent.get(id);
       if (children) {
-        node[nodeChildrenKey] = children;
-        if (nodeParentKey !== false) {
+        node[childrenKey] = children;
+        if (parentKey !== false) {
           for (const child of children) {
-            child[nodeParentKey] = node;
+            child[parentKey] = node;
           }
         }
         waitingForParent.delete(id);
@@ -83,12 +83,12 @@ function buildTree(items, options) {
       if (nodes.has(id)) {
         throw new Error(`Duplicate identifier '${id}'.`);
       }
-      const node = nodeValueKey !== false ? { [nodeValueKey]: nodeValueMapper ? nodeValueMapper(item) : item } : { ...nodeValueMapper ? nodeValueMapper(item) : item };
-      if (nodeValueKey === false) {
-        if (nodeParentKey !== false) {
-          delete node[nodeParentKey];
+      const node = valueKey !== false ? { [valueKey]: valueResolver ? valueResolver(item) : item } : { ...valueResolver ? valueResolver(item) : item };
+      if (valueKey === false) {
+        if (parentKey !== false) {
+          delete node[parentKey];
         }
-        delete node[nodeChildrenKey];
+        delete node[childrenKey];
       }
       nodes.set(id, node);
       const childIds = typeof childIdsAccessor === "function" ? childIdsAccessor(item) : item[childIdsAccessor];
@@ -96,16 +96,16 @@ function buildTree(items, options) {
         if (typeof childIds[Symbol.iterator] !== "function") {
           throw new Error(`Item '${id}' has invalid children: expected an iterable value.`);
         }
-        node[nodeChildrenKey] = [];
+        node[childrenKey] = [];
         for (const childId of childIds) {
           const childNode = nodes.get(childId);
           if (childNode) {
-            node[nodeChildrenKey].push(childNode);
-            if (nodeParentKey !== false) {
-              if (childNode[nodeParentKey] && childNode[nodeParentKey] !== node) {
+            node[childrenKey].push(childNode);
+            if (parentKey !== false) {
+              if (childNode[parentKey] && childNode[parentKey] !== node) {
                 throw new Error(`Node '${childId}' already has a different parent, refusing to overwrite.`);
               }
-              childNode[nodeParentKey] = node;
+              childNode[parentKey] = node;
             }
             rootCandidates.delete(childId);
           } else {
@@ -114,24 +114,24 @@ function buildTree(items, options) {
             }
             waitingChildren.set(childId, {
               parentNode: node,
-              childIndex: node[nodeChildrenKey].length
+              childIndex: node[childrenKey].length
             });
-            node[nodeChildrenKey].push(null);
+            node[childrenKey].push(null);
           }
         }
-        if (node[nodeChildrenKey].length === 0) {
-          delete node[nodeChildrenKey];
+        if (node[childrenKey].length === 0) {
+          delete node[childrenKey];
         }
       }
       const parentDescriptor = waitingChildren.get(id);
       if (parentDescriptor) {
         const { parentNode, childIndex } = parentDescriptor;
-        parentNode[nodeChildrenKey][childIndex] = node;
-        if (nodeParentKey !== false) {
-          if (node[nodeParentKey] && node[nodeParentKey] !== parentNode) {
+        parentNode[childrenKey][childIndex] = node;
+        if (parentKey !== false) {
+          if (node[parentKey] && node[parentKey] !== parentNode) {
             throw new Error(`Node '${id}' already has a different parent, refusing to overwrite.`);
           }
-          node[nodeParentKey] = parentNode;
+          node[parentKey] = parentNode;
         }
         waitingChildren.delete(id);
       } else {
@@ -146,9 +146,9 @@ function buildTree(items, options) {
       const pending = Array.from(waitingChildren.values());
       for (let i = pending.length - 1; i >= 0; i--) {
         const { parentNode, childIndex } = pending[i];
-        parentNode[nodeChildrenKey].splice(childIndex, 1);
-        if (parentNode[nodeChildrenKey].length === 0) {
-          delete parentNode[nodeChildrenKey];
+        parentNode[childrenKey].splice(childIndex, 1);
+        if (parentNode[childrenKey].length === 0) {
+          delete parentNode[childrenKey];
         }
       }
     }
@@ -156,7 +156,7 @@ function buildTree(items, options) {
       roots.push(node);
     }
   }
-  const withDepth = typeof nodeDepthKey === "string" || typeof nodeDepthKey === "symbol" || typeof nodeDepthKey === "number";
+  const withDepth = typeof depthKey === "string" || typeof depthKey === "symbol" || typeof depthKey === "number";
   if (validateTree || withDepth) {
     if (roots.length === 0 && nodes.size > 0) {
       throw new Error("Tree validation failed: detected a cycle.");
@@ -172,10 +172,10 @@ function buildTree(items, options) {
       }
       visited.add(node);
       if (withDepth) {
-        node[nodeDepthKey] = depth;
+        node[depthKey] = depth;
       }
-      if (node[nodeChildrenKey]) {
-        for (const child of node[nodeChildrenKey]) {
+      if (node[childrenKey]) {
+        for (const child of node[childrenKey]) {
           stack.push({ node: child, depth: depth + 1 });
         }
       }

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "fast-tree-builder",
-  "version": "2.0.0-beta.3",
+  "version": "2.0.0-beta.4",
   "description": "Easily construct highly customizable bi-directional tree structures from iterable data.",
   "types": "./index.d.mts",
   "module": "./index.mjs",