path-treeify 1.3.0-beta.d47c4d9 → 1.4.0

package/README.md

@@ -51,10 +51,12 @@
 - 🔗 Each node carries a `parent` circular reference for upward traversal
 - 📍 Each node exposes a `getPath()` method to retrieve its own paths directly
 - 🏷️ Each node has a `type` field — `PathTreeNodeKind.Dir` or `PathTreeNodeKind.File`
+- 📏 Each node has a `depth` field indicating its distance from the root
 - 👁️ `fileVisible` option includes files as leaf nodes alongside directories
 - 🔍 Optional `filter` callback applied at **every depth**, including top-level entries
 - ⚡ `build()` scans the entire `base` directory with zero configuration
 - 🎛️ `buildBy()` accepts either a path segment array or a top-level filter function
+- 🗃️ `usePathCache` option caches `getPath()` results per node for repeated access
 - 📦 Ships as both ESM (`index.mjs`) and CJS (`index.cjs`) with full TypeScript types
 - 🚫 Zero runtime dependencies
 
@@ -94,12 +96,12 @@ const treeifyWithFiles = new PathTreeify({
 });
 const fullTree = treeifyWithFiles.build();
 
-// Check node type
+// Check node type and depth
 for (const child of tree.children) {
   if (child.type === PathTreeNodeKind.Dir) {
-    console.log('dir:', child.value);
+    console.log(`dir (depth ${child.depth}):`, child.value);
   } else if (child.type === PathTreeNodeKind.File) {
-    console.log('file:', child.value);
+    console.log(`file (depth ${child.depth}):`, child.value);
   }
 }
 ```
@@ -112,11 +114,12 @@ for (const child of tree.children) {
 
 Creates a new instance.
 
-| Option        | Type                         | Required | Description                                                              |
-|---------------|------------------------------|----------|--------------------------------------------------------------------------|
-| `base`        | `string`                     | ✅        | Absolute path to the root directory to scan from                        |
-| `filter`      | `FilterFunction` (see below) | ❌        | Applied at **every depth** — top-level entries included                 |
-| `fileVisible` | `boolean`                    | ❌        | When `true`, files are included as leaf nodes. Defaults to `false`      |
+| Option         | Type                         | Required | Description                                                                         |
+|----------------|------------------------------|----------|-------------------------------------------------------------------------------------|
+| `base`         | `string`                     | ✅        | Absolute path to the root directory to scan from                                   |
+| `filter`       | `FilterFunction` (see below) | ❌        | Applied at **every depth** — top-level entries included                            |
+| `fileVisible`  | `boolean`                    | ❌        | When `true`, files are included as leaf nodes. Defaults to `false`                 |
+| `usePathCache` | `boolean`                    | ❌        | When `true`, `getPath()` results are cached on each node after the first call      |
 
 `base` must exist and be a directory, otherwise the constructor throws.
 
@@ -190,6 +193,7 @@ const tree = treeify.buildBy(name => name !== 'node_modules' && !name.startsWith
 
 ```ts
 interface PathTreeNode {
+  depth:    number;               // distance from root; root is 0, its children are 1, etc.
   parent:   PathTreeNode | null;  // null only on the synthetic root
   value:    string;               // entry name for this node
   children: PathTreeNode[];       // empty for file nodes
@@ -199,6 +203,8 @@ interface PathTreeNode {
 }
 ```
 
+When `usePathCache: true` is set on the `PathTreeify` instance, the result of `getPath()` is cached on the node after the first call — subsequent calls return the same object reference without recomputing the parent chain.
+
 > ⚠️ **Circular references** — `parent` points back up the tree. Use `JSON.stringify` replacers or a library like `flatted` if you need to serialize the result.
 
 ---
@@ -266,7 +272,7 @@ const tree = treeify.buildBy(name => name !== 'node_modules' && !name.startsWith
 function printPaths(node) {
   for (const child of node.children) {
     const { absolute } = child.getPath();
-    console.log(`[${child.type}] ${absolute}`);
+    console.log(`[${child.type}] depth=${child.depth} ${absolute}`);
     printPaths(child);
   }
 }
@@ -274,6 +280,22 @@ function printPaths(node) {
 printPaths(tree);
 ```
 
+### Cache `getPath()` results for repeated traversal
+
+```ts
+const treeify = new PathTreeify({
+  base: '/your/project',
+  usePathCache: true,
+});
+const tree = treeify.build();
+
+// First call walks the parent chain and caches the result
+const pathA = tree.children[0].getPath();
+// Subsequent calls return the cached object directly
+const pathB = tree.children[0].getPath();
+console.log(pathA === pathB); // true
+```
+
 ### CommonJS usage
 
 ```js

package/dist/index.cjs

@@ -1 +1 @@
-"use strict";var e,t=require("fs"),i=require("path");class r{static isValid(e){try{return t.accessSync(e,t.constants.F_OK),!0}catch{return!1}}static isDirectory(e){try{return t.statSync(e).isDirectory()}catch{return!1}}static isFile(e){try{return t.statSync(e).isFile()}catch{return!1}}}exports.PathTreeNodeKind=void 0,(e=exports.PathTreeNodeKind||(exports.PathTreeNodeKind={})).Dir="dir",e.File="file",e.Unknown="unknown";class s{constructor(e){this.parent=null,this.value="",this.children=[],this.type=exports.PathTreeNodeKind.Unknown,this.base=e}getPath(){let e="",t=this;for(;t.parent;)e=e?`${t.value}${i.sep}${e}`:t.value,t=t.parent;return{relative:e,absolute:i.resolve(this.base,e)}}}exports.PathTreeify=class{applyFilter(e,t){return!(!this.fileVisible&&!r.isDirectory(e))&&(!this.userFilter||this.userFilter({name:t,dirPath:i.dirname(e)}))}constructor({filter:e,base:t,fileVisible:i}){if(this.fileVisible=!1,"boolean"==typeof i&&i&&(this.fileVisible=i),void 0!==e&&(this.validateFilter(e),this.userFilter=e),!t||!r.isValid(t))throw new Error(`${t} is not a valid path!`);if(!r.isDirectory(t))throw new Error(`${t} is not a dirPath!`);this.base=t}validateFilter(e){if("function"!=typeof e)throw new TypeError("filter must be a function")}initNode(){return new s(this.base)}buildChildren(e,s){const n=[],o=t.readdirSync(e);for(const t of o){const o=i.join(e,t);if(!this.applyFilter(o,t))continue;const l=this.initNode();l.value=t,l.parent=s,n.push(l),this.fileVisible&&r.isFile(o)?l.type=exports.PathTreeNodeKind.File:(l.type=exports.PathTreeNodeKind.Dir,l.children=this.buildChildren(o,l))}return n}checkRelativePaths(e){if(!Array.isArray(e))throw new Error("Expected array, got "+typeof e);for(let t=0;t<e.length;t++){const s=e[t];if("string"!=typeof s)throw new Error(`Item at index ${t} is not a string, got ${typeof s}`);const n=i.resolve(this.base,s);if(!r.isValid(n))throw new Error(`Path does not exist or is not accessible: ${n} (from relative path: ${s})`);if(!(r.isDirectory(n)||this.fileVisible&&r.isFile(n)))throw new Error(`Path is not a directory: ${n} (from relative path: ${s})`)}}formatSegments(e){return e.map(e=>e.split(/[/\\]/).filter(Boolean).join(i.sep)).filter(Boolean)}getAllEntriesUnderBase(){return t.readdirSync(this.base).filter(e=>{const t=i.resolve(this.base,e);return this.applyFilter(t,e)})}buildBySegments(e){const t=this.initNode(),s=this.formatSegments(e);this.checkRelativePaths(s);for(const e of s){const s=i.resolve(this.base,e),n=this.initNode();n.value=e,n.parent=t,t.children.push(n),this.fileVisible&&r.isFile(s)?n.type=exports.PathTreeNodeKind.File:(n.type=exports.PathTreeNodeKind.Dir,n.children=this.buildChildren(s,n))}return t}buildByFilter(e){const t=this.getAllEntriesUnderBase();return this.buildBySegments(t.filter(e))}buildBy(e){if(Array.isArray(e))return this.buildBySegments(e);if("function"==typeof e)return this.buildByFilter(e);throw new TypeError("buildBy: expected an array of strings or a filter function, but received "+typeof e)}build(){const e=this.getAllEntriesUnderBase();return this.buildBySegments(e)}};
+"use strict";var e,t=require("fs"),i=require("path");class r{static isValid(e){try{return t.accessSync(e,t.constants.F_OK),!0}catch{return!1}}static isDirectory(e){try{return t.statSync(e).isDirectory()}catch{return!1}}static isFile(e){try{return t.statSync(e).isFile()}catch{return!1}}}exports.PathTreeNodeKind=void 0,(e=exports.PathTreeNodeKind||(exports.PathTreeNodeKind={})).Dir="dir",e.File="file",e.Unknown="unknown";class s{constructor(e){this.usePathCache=!1,this.base=e.base,"boolean"==typeof e.usePathCache&&(this.usePathCache=e.usePathCache)}getPath(){let e=this;const t=()=>{let t="",r=this;for(;r.parent;)t=t?`${r.value}${i.sep}${t}`:r.value,r=r.parent;return{relative:t,absolute:i.resolve(e.base,t)}};return e.usePathCache?(e._pathCache||(e._pathCache=t()),e._pathCache):t()}}exports.PathTreeify=class{constructor(e){this.fileVisible=!1;const{filter:t,base:i,fileVisible:n,usePathCache:a}=e;if("boolean"==typeof n&&n&&(this.fileVisible=n),void 0!==t&&(this.validateFilter(t),this.userFilter=t),!i||!r.isValid(i))throw new Error(`${i} is not a valid path!`);if(!r.isDirectory(i))throw new Error(`${i} is not a dirPath!`);this.base=i,this.pathTreeNodeShared=new s({base:i,usePathCache:a})}applyFilter(e,t){return!(!this.fileVisible&&!r.isDirectory(e))&&(!this.userFilter||this.userFilter({name:t,dirPath:i.dirname(e)}))}validateFilter(e){if("function"!=typeof e)throw new TypeError("filter must be a function")}initNode(){const e=Object.create(this.pathTreeNodeShared),t=Object.create(e);return t.parent=null,t.value="",t.children=[],t.type=exports.PathTreeNodeKind.Unknown,t.depth=-1,t}buildChildren(e,s,n){const a=[],o=n||t.readdirSync(e),h=s.depth+1;for(const t of o){const n=i.join(e,t);if(!this.applyFilter(n,t))continue;const o=this.initNode();o.depth=h,o.value=t,o.parent=s,a.push(o),this.fileVisible&&r.isFile(n)?o.type=exports.PathTreeNodeKind.File:(o.type=exports.PathTreeNodeKind.Dir,o.children=this.buildChildren(n,o))}return a}checkRelativePaths(e){for(let t=0;t<e.length;t++){const s=e[t];if("string"!=typeof s)throw new Error(`Item at index ${t} is not a string, got ${typeof s}`);const n=i.resolve(this.base,s);if(!r.isValid(n))throw new Error(`Path does not exist or is not accessible: ${n} (from relative path: ${s})`);if(!(r.isDirectory(n)||this.fileVisible&&r.isFile(n)))throw new Error(`Path is not a directory: ${n} (from relative path: ${s})`)}}formatSegments(e){return e.map(e=>e.split(/[/\\]/).filter(Boolean).join(i.sep)).filter(Boolean)}getAllEntriesUnderBase(){return t.readdirSync(this.base).filter(e=>{const t=i.resolve(this.base,e);return this.applyFilter(t,e)})}buildBySegments(e){const t=this.initNode();return t.depth=0,t.children=this.buildChildren(this.base,t,e),t}buildByFilter(e){const t=this.getAllEntriesUnderBase();return this.buildBySegments(t.filter(e))}buildBy(e){if(Array.isArray(e)){const t=this.formatSegments(e);return this.checkRelativePaths(t),this.buildBySegments(t)}if("function"==typeof e)return this.buildByFilter(e);throw new TypeError("buildBy: expected an array of strings or a filter function, but received "+typeof e)}build(){const e=this.getAllEntriesUnderBase();return this.buildBySegments(e)}};

package/dist/index.mjs

@@ -1 +1 @@
-import{readdirSync as t,accessSync as i,constants as e,statSync as r}from"fs";import{dirname as s,join as n,resolve as l,sep as o}from"path";class a{static isValid(t){try{return i(t,e.F_OK),!0}catch{return!1}}static isDirectory(t){try{return r(t).isDirectory()}catch{return!1}}static isFile(t){try{return r(t).isFile()}catch{return!1}}}var h;!function(t){t.Dir="dir",t.File="file",t.Unknown="unknown"}(h||(h={}));class c{constructor(t){this.parent=null,this.value="",this.children=[],this.type=h.Unknown,this.base=t}getPath(){let t="",i=this;for(;i.parent;)t=t?`${i.value}${o}${t}`:i.value,i=i.parent;return{relative:t,absolute:l(this.base,t)}}}class u{applyFilter(t,i){return!(!this.fileVisible&&!a.isDirectory(t))&&(!this.userFilter||this.userFilter({name:i,dirPath:s(t)}))}constructor({filter:t,base:i,fileVisible:e}){if(this.fileVisible=!1,"boolean"==typeof e&&e&&(this.fileVisible=e),void 0!==t&&(this.validateFilter(t),this.userFilter=t),!i||!a.isValid(i))throw new Error(`${i} is not a valid path!`);if(!a.isDirectory(i))throw new Error(`${i} is not a dirPath!`);this.base=i}validateFilter(t){if("function"!=typeof t)throw new TypeError("filter must be a function")}initNode(){return new c(this.base)}buildChildren(i,e){const r=[],s=t(i);for(const t of s){const s=n(i,t);if(!this.applyFilter(s,t))continue;const l=this.initNode();l.value=t,l.parent=e,r.push(l),this.fileVisible&&a.isFile(s)?l.type=h.File:(l.type=h.Dir,l.children=this.buildChildren(s,l))}return r}checkRelativePaths(t){if(!Array.isArray(t))throw new Error("Expected array, got "+typeof t);for(let i=0;i<t.length;i++){const e=t[i];if("string"!=typeof e)throw new Error(`Item at index ${i} is not a string, got ${typeof e}`);const r=l(this.base,e);if(!a.isValid(r))throw new Error(`Path does not exist or is not accessible: ${r} (from relative path: ${e})`);if(!(a.isDirectory(r)||this.fileVisible&&a.isFile(r)))throw new Error(`Path is not a directory: ${r} (from relative path: ${e})`)}}formatSegments(t){return t.map(t=>t.split(/[/\\]/).filter(Boolean).join(o)).filter(Boolean)}getAllEntriesUnderBase(){return t(this.base).filter(t=>{const i=l(this.base,t);return this.applyFilter(i,t)})}buildBySegments(t){const i=this.initNode(),e=this.formatSegments(t);this.checkRelativePaths(e);for(const t of e){const e=l(this.base,t),r=this.initNode();r.value=t,r.parent=i,i.children.push(r),this.fileVisible&&a.isFile(e)?r.type=h.File:(r.type=h.Dir,r.children=this.buildChildren(e,r))}return i}buildByFilter(t){const i=this.getAllEntriesUnderBase();return this.buildBySegments(i.filter(t))}buildBy(t){if(Array.isArray(t))return this.buildBySegments(t);if("function"==typeof t)return this.buildByFilter(t);throw new TypeError("buildBy: expected an array of strings or a filter function, but received "+typeof t)}build(){const t=this.getAllEntriesUnderBase();return this.buildBySegments(t)}}export{h as PathTreeNodeKind,u as PathTreeify};
+import{readdirSync as t,accessSync as e,constants as i,statSync as r}from"fs";import{dirname as s,join as n,resolve as a,sep as h}from"path";class l{static isValid(t){try{return e(t,i.F_OK),!0}catch{return!1}}static isDirectory(t){try{return r(t).isDirectory()}catch{return!1}}static isFile(t){try{return r(t).isFile()}catch{return!1}}}var o;!function(t){t.Dir="dir",t.File="file",t.Unknown="unknown"}(o||(o={}));class c{constructor(t){this.usePathCache=!1,this.base=t.base,"boolean"==typeof t.usePathCache&&(this.usePathCache=t.usePathCache)}getPath(){let t=this;const e=()=>{let e="",i=this;for(;i.parent;)e=e?`${i.value}${h}${e}`:i.value,i=i.parent;return{relative:e,absolute:a(t.base,e)}};return t.usePathCache?(t._pathCache||(t._pathCache=e()),t._pathCache):e()}}class u{constructor(t){this.fileVisible=!1;const{filter:e,base:i,fileVisible:r,usePathCache:s}=t;if("boolean"==typeof r&&r&&(this.fileVisible=r),void 0!==e&&(this.validateFilter(e),this.userFilter=e),!i||!l.isValid(i))throw new Error(`${i} is not a valid path!`);if(!l.isDirectory(i))throw new Error(`${i} is not a dirPath!`);this.base=i,this.pathTreeNodeShared=new c({base:i,usePathCache:s})}applyFilter(t,e){return!(!this.fileVisible&&!l.isDirectory(t))&&(!this.userFilter||this.userFilter({name:e,dirPath:s(t)}))}validateFilter(t){if("function"!=typeof t)throw new TypeError("filter must be a function")}initNode(){const t=Object.create(this.pathTreeNodeShared),e=Object.create(t);return e.parent=null,e.value="",e.children=[],e.type=o.Unknown,e.depth=-1,e}buildChildren(e,i,r){const s=[],a=r||t(e),h=i.depth+1;for(const t of a){const r=n(e,t);if(!this.applyFilter(r,t))continue;const a=this.initNode();a.depth=h,a.value=t,a.parent=i,s.push(a),this.fileVisible&&l.isFile(r)?a.type=o.File:(a.type=o.Dir,a.children=this.buildChildren(r,a))}return s}checkRelativePaths(t){for(let e=0;e<t.length;e++){const i=t[e];if("string"!=typeof i)throw new Error(`Item at index ${e} is not a string, got ${typeof i}`);const r=a(this.base,i);if(!l.isValid(r))throw new Error(`Path does not exist or is not accessible: ${r} (from relative path: ${i})`);if(!(l.isDirectory(r)||this.fileVisible&&l.isFile(r)))throw new Error(`Path is not a directory: ${r} (from relative path: ${i})`)}}formatSegments(t){return t.map(t=>t.split(/[/\\]/).filter(Boolean).join(h)).filter(Boolean)}getAllEntriesUnderBase(){return t(this.base).filter(t=>{const e=a(this.base,t);return this.applyFilter(e,t)})}buildBySegments(t){const e=this.initNode();return e.depth=0,e.children=this.buildChildren(this.base,e,t),e}buildByFilter(t){const e=this.getAllEntriesUnderBase();return this.buildBySegments(e.filter(t))}buildBy(t){if(Array.isArray(t)){const e=this.formatSegments(t);return this.checkRelativePaths(e),this.buildBySegments(e)}if("function"==typeof t)return this.buildByFilter(t);throw new TypeError("buildBy: expected an array of strings or a filter function, but received "+typeof t)}build(){const t=this.getAllEntriesUnderBase();return this.buildBySegments(t)}}export{o as PathTreeNodeKind,u as PathTreeify};

package/dist/types/dev/index.d.ts

@@ -0,0 +1 @@
+export {};

package/dist/types/index.d.ts

@@ -11,6 +11,13 @@ interface PathTreeifyProps {
     filter?: FilterFunction;
     /** When true, files are included as leaf nodes alongside directories. Defaults to false */
     fileVisible?: boolean;
+    /**
+     * When true, the result of {@link PathTreeNode.getPath} is memoised on each node
+     * after the first call. Subsequent calls return the same object reference without
+     * re-walking the parent chain. Useful when nodes are accessed repeatedly.
+     * Defaults to false.
+     */
+    usePathCache?: boolean;
 }
 /** Classification of a node in the path tree */
 export declare enum PathTreeNodeKind {
@@ -19,11 +26,28 @@ export declare enum PathTreeNodeKind {
     /** Assigned before the node's type has been resolved */
     Unknown = "unknown"
 }
+/**
+ * Public interface for a node in the path tree.
+ * Consumers receive this type; the internal implementation class is not exported.
+ */
 export interface PathTreeNode {
+    /** Distance from the root node; root itself is 0, its direct children are 1, and so on */
+    depth: number;
+    /** Reference to the parent node; null for the root node */
     parent: PathTreeNode | null;
+    /** The entry name of this node (not a full path) */
     value: string;
+    /** Child nodes; non-empty only for directory nodes */
     children: PathTreeNode[];
+    /** Whether this node is a directory, a file, or not yet resolved */
     type: PathTreeNodeKind;
+    /**
+     * Walks up the parent chain to compute this node's relative and absolute paths.
+     * When the owning {@link PathTreeify} instance was created with `usePathCache: true`,
+     * the result is memoised after the first call and the same object is returned on
+     * every subsequent call.
+     * @returns `relative` — path from the tree root; `absolute` — fully resolved path on disk
+     */
     getPath(): {
         relative: string;
         absolute: string;
@@ -33,6 +57,12 @@ export interface PathTreeNode {
 export declare class PathTreeify {
     /** The root directory to scan */
     private base;
+    /**
+     * Shared prototype instance for nodes produced by this builder.
+     * All nodes created via {@link initNode} inherit `base` and `getPath` from this object,
+     * avoiding per-node storage of the base path string.
+     */
+    private pathTreeNodeShared;
     /**
      * Optional user-supplied filter. When set, every entry must pass this predicate
      * in addition to the built-in visibility check.
@@ -40,6 +70,7 @@ export declare class PathTreeify {
     private userFilter?;
     /** When true, files are included as leaf nodes during traversal. Defaults to false */
     private fileVisible;
+    constructor(props: Partial<PathTreeifyProps>);
     /**
      * Determines whether a given entry should be included in the tree.
      * - If {@link fileVisible} is false, non-directory entries are always excluded.
@@ -48,27 +79,39 @@ export declare class PathTreeify {
      * @param name - Entry name (filename or directory name)
      */
     private applyFilter;
-    constructor({ filter, base, fileVisible }: Partial<PathTreeifyProps>);
     /**
      * Asserts that the provided value is a callable {@link FilterFunction}.
      * Throws a TypeError if the check fails.
      */
     private validateFilter;
-    /** Creates a new unattached {@link PathTreeNode} */
+    /**
+     * Creates a new unattached {@link PathTreeNode}.
+     * The node is created with a two-layer prototype chain:
+     * `node → cache → pathTreeNodeShared`. The intermediate `cache` layer is a
+     * per-node object that holds `_pathCache` when `usePathCache` is enabled,
+     * keeping the cached value isolated to each node while still inheriting `base`
+     * and `getPath` from `pathTreeNodeShared`.
+     * `depth` is initialised to `-1` and must be set by the caller.
+     */
     private initNode;
     /**
      * Recursively reads {@link dirPath} and builds child nodes for each entry that
      * passes {@link applyFilter}. Directories are traversed depth-first;
      * files (when {@link fileVisible} is true) become leaf nodes.
-     * @param dirPath - Absolute path of the directory to read
-     * @param parent - The parent node to attach child nodes to
+     *
+     * @param dirPath  - Absolute path of the directory to read
+     * @param parent   - The parent node to attach child nodes to
+     * @param segments - Optional explicit list of entry names to use instead of reading the
+     *                   directory from disk; used by {@link buildBySegments} to skip a
+     *                   redundant `readdirSync` when the segment list is already known
      */
     private buildChildren;
     /**
      * Validates that every entry in {@link relativeSegments} refers to an accessible
      * path under {@link base}. When {@link fileVisible} is false, each path must be
      * a directory; when true, regular files are also accepted.
-     * @param relativeSegments - Relative path strings to validate
+     * @param relativeSegments - Relative path strings to validate; assumed to be a string
+     *                           array (callers are responsible for type safety at the boundary)
      */
     private checkRelativePaths;
     /**
@@ -84,21 +127,23 @@ export declare class PathTreeify {
      */
     private getAllEntriesUnderBase;
     /**
-     * Builds a subtree containing only the entries identified by {@link segments}.
-     * Paths are normalised via {@link formatSegments} and validated before use.
-     * @param segments - Relative paths to include as top-level nodes
+     * Builds a subtree whose top-depth children correspond to {@link segments}.
+     * The root node is created at depth 0; children are built by delegating to
+     * {@link buildChildren}, passing {@link segments} directly to avoid a redundant
+     * `readdirSync` of the base directory.
+     * @param segments - Normalised and validated relative path segments
      */
     private buildBySegments;
     /**
-     * Builds a subtree from top-level entries whose names satisfy {@link filter}.
-     * Note: this predicate only affects top-level selection, not recursive traversal.
+     * Builds a subtree from top-depth entries whose names satisfy {@link filter}.
+     * Note: this predicate only affects top-depth selection, not recursive traversal.
      * For recursive filtering use the `filter` constructor option.
-     * @param filter - Predicate applied to each top-level entry name
+     * @param filter - Predicate applied to each top-depth entry name
      */
     private buildByFilter;
     /** Overload: build the tree from an explicit list of relative path segments */
     buildBy(segments: string[]): PathTreeNode;
-    /** Overload: build the tree from a predicate applied to top-level entry names */
+    /** Overload: build the tree from a predicate applied to top-depth entry names */
     buildBy(filter: (segment: string) => boolean): PathTreeNode;
     /** Builds a full tree from all immediate entries under the base path */
     build(): PathTreeNode;

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "path-treeify",
-  "version": "1.3.0-beta.d47c4d9",
+  "version": "1.4.0",
   "description": "Convert a path or an array of paths into a tree-structured JavaScript object, where each node has a `parent` property that holds a circular reference to its parent node.",
   "main": "./dist/index.cjs",
   "module": "./dist/index.mjs",