heap-typed 1.51.9 → 1.52.0

package/dist/types/data-structures/queue/queue.d.ts

@@ -1 +1,2 @@
-export {};
+import { IterableElementBaseOptions } from '../base';
+export type QueueOptions<E, R> = IterableElementBaseOptions<E, R> & {};

package/dist/types/data-structures/stack/stack.d.ts

@@ -1 +1,2 @@
-export {};
+import { IterableElementBaseOptions } from '../base';
+export type StackOptions<E, R> = IterableElementBaseOptions<E, R> & {};

package/dist/types/data-structures/trie/trie.d.ts

@@ -1,3 +1,4 @@
-export type TrieOptions = {
+import { IterableElementBaseOptions } from '../base';
+export type TrieOptions<R> = {
     caseSensitive?: boolean;
-};
+} & IterableElementBaseOptions<string, R>;

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "heap-typed",
-  "version": "1.51.9",
+  "version": "1.52.0",
   "description": "Heap. Javascript & Typescript Data Structure.",
   "main": "dist/index.js",
   "scripts": {
@@ -131,6 +131,6 @@
     "typescript": "^4.9.5"
   },
   "dependencies": {
-    "data-structure-typed": "^1.51.9"
+    "data-structure-typed": "^1.52.0"
   }
 }

package/src/data-structures/base/index.ts

@@ -1 +1,2 @@
-export * from './iterable-base';
+export * from './iterable-entry-base';
+export * from './iterable-element-base';

package/src/data-structures/base/iterable-element-base.ts

@@ -0,0 +1,250 @@
+import { ElementCallback, IterableElementBaseOptions, ReduceElementCallback } from '../../types';
+
+export abstract class IterableElementBase<E, R, C> {
+  /**
+   * The protected constructor initializes the options for the IterableElementBase class, including the
+   * toElementFn function.
+   * @param [options] - An optional object that contains the following properties:
+   */
+  protected constructor(options?: IterableElementBaseOptions<E, R>) {
+    if (options) {
+      const { toElementFn } = options;
+      if (typeof toElementFn === 'function') this._toElementFn = toElementFn;
+      else if (toElementFn) throw new TypeError('toElementFn must be a function type');
+    }
+  }
+
+  abstract get size(): number;
+
+  protected _toElementFn?: (rawElement: R) => E;
+
+  /**
+   * The function returns the _toElementFn property, which is a function that converts a raw element to
+   * a specific type.
+   * @returns The function `get toElementFn()` is returning either a function that takes a raw element
+   * `rawElement` of type `R` and returns an element `E`, or `undefined` if no function is assigned to
+   * `_toElementFn`.
+   */
+  get toElementFn(): ((rawElement: R) => E) | undefined {
+    return this._toElementFn;
+  }
+
+  /**
+   * Time Complexity: O(n)
+   * Space Complexity: O(1)
+   */
+  /**
+   * Time Complexity: O(n)
+   * Space Complexity: O(1)
+   *
+   * The function is an implementation of the Symbol.iterator method that returns an IterableIterator.
+   * @param {any[]} args - The `args` parameter in the code snippet represents a rest parameter. It
+   * allows the function to accept any number of arguments as an array. In this case, the `args`
+   * parameter is used to pass any number of arguments to the `_getIterator` method.
+   */
+  * [Symbol.iterator](...args: any[]): IterableIterator<E> {
+    yield* this._getIterator(...args);
+  }
+
+  /**
+   * Time Complexity: O(n)
+   * Space Complexity: O(n)
+   */
+  /**
+   * Time Complexity: O(n)
+   * Space Complexity: O(n)
+   *
+   * The function returns an iterator that yields all the values in the object.
+   */
+  * values(): IterableIterator<E> {
+    for (const item of this) {
+      yield item;
+    }
+  }
+
+  /**
+   * Time Complexity: O(n)
+   * Space Complexity: O(1)
+   */
+  /**
+   * Time Complexity: O(n)
+   * Space Complexity: O(1)
+   *
+   * The `every` function checks if every element in the array satisfies a given predicate.
+   * @param predicate - The `predicate` parameter is a callback function that takes three arguments:
+   * the current element being processed, its index, and the array it belongs to. It should return a
+   * boolean value indicating whether the element satisfies a certain condition or not.
+   * @param {any} [thisArg] - The `thisArg` parameter is an optional argument that specifies the value
+   * to be used as `this` when executing the `predicate` function. If `thisArg` is provided, it will be
+   * passed as the `this` value to the `predicate` function. If `thisArg` is
+   * @returns The `every` method is returning a boolean value. It returns `true` if every element in
+   * the array satisfies the provided predicate function, and `false` otherwise.
+   */
+  every(predicate: ElementCallback<E, R, boolean, C>, thisArg?: any): boolean {
+    let index = 0;
+    for (const item of this) {
+      if (!predicate.call(thisArg, item, index++, this)) {
+        return false;
+      }
+    }
+    return true;
+  }
+
+  /**
+   * Time Complexity: O(n)
+   * Space Complexity: O(1)
+   */
+
+  /**
+   * Time Complexity: O(n)
+   * Space Complexity: O(1)
+   */
+  /**
+   * Time Complexity: O(n)
+   * Space Complexity: O(1)
+   *
+   * The "some" function checks if at least one element in a collection satisfies a given predicate.
+   * @param predicate - The `predicate` parameter is a callback function that takes three arguments:
+   * `value`, `index`, and `array`. It should return a boolean value indicating whether the current
+   * element satisfies the condition.
+   * @param {any} [thisArg] - The `thisArg` parameter is an optional argument that specifies the value
+   * to be used as the `this` value when executing the `predicate` function. If `thisArg` is provided,
+   * it will be passed as the `this` value to the `predicate` function. If `thisArg
+   * @returns a boolean value. It returns true if the predicate function returns true for any element
+   * in the collection, and false otherwise.
+   */
+  some(predicate: ElementCallback<E, R, boolean, C>, thisArg?: any): boolean {
+    let index = 0;
+    for (const item of this) {
+      if (predicate.call(thisArg, item, index++, this)) {
+        return true;
+      }
+    }
+    return false;
+  }
+
+  /**
+   * Time Complexity: O(n)
+   * Space Complexity: O(1)
+   */
+
+  /**
+   * Time Complexity: O(n)
+   * Space Complexity: O(1)
+   *
+   * The `forEach` function iterates over each element in an array-like object and calls a callback
+   * function for each element.
+   * @param callbackfn - The callbackfn parameter is a function that will be called for each element in
+   * the array. It takes three arguments: the current element being processed, the index of the current
+   * element, and the array that forEach was called upon.
+   * @param {any} [thisArg] - The `thisArg` parameter is an optional argument that specifies the value
+   * to be used as `this` when executing the `callbackfn` function. If `thisArg` is provided, it will
+   * be passed as the `this` value to the `callbackfn` function. If `thisArg
+   */
+  forEach(callbackfn: ElementCallback<E, R, void, C>, thisArg?: any): void {
+    let index = 0;
+    for (const item of this) {
+      callbackfn.call(thisArg, item, index++, this);
+    }
+  }
+
+  /**
+   * Time Complexity: O(n)
+   * Space Complexity: O(1)
+   */
+
+  /**
+   * Time Complexity: O(n)
+   * Space Complexity: O(1)
+   *
+   * The `find` function iterates over the elements of an array-like object and returns the first
+   * element that satisfies the provided callback function.
+   * @param callbackfn - The callbackfn parameter is a function that will be called for each element in
+   * the array. It takes three arguments: the current element being processed, the index of the current
+   * element, and the array itself. The function should return a boolean value indicating whether the
+   * current element matches the desired condition.
+   * @param {any} [thisArg] - The `thisArg` parameter is an optional argument that specifies the value
+   * to be used as `this` when executing the `callbackfn` function. If `thisArg` is provided, it will
+   * be passed as the `this` value to the `callbackfn` function. If `thisArg
+   * @returns The `find` method returns the first element in the array that satisfies the provided
+   * callback function. If no element satisfies the callback function, `undefined` is returned.
+   */
+  find(callbackfn: ElementCallback<E, R, boolean, C>, thisArg?: any): E | undefined {
+    let index = 0;
+    for (const item of this) {
+      if (callbackfn.call(thisArg, item, index++, this)) return item;
+    }
+
+    return;
+  }
+
+  /**
+   * Time Complexity: O(n)
+   * Space Complexity: O(1)
+   *
+   * The function checks if a given element exists in a collection.
+   * @param {E} element - The parameter "element" is of type E, which means it can be any type. It
+   * represents the element that we want to check for existence in the collection.
+   * @returns a boolean value. It returns true if the element is found in the collection, and false
+   * otherwise.
+   */
+  has(element: E): boolean {
+    for (const ele of this) {
+      if (ele === element) return true;
+    }
+    return false;
+  }
+
+  /**
+   * Time Complexity: O(n)
+   * Space Complexity: O(1)
+   */
+  /**
+   * Time Complexity: O(n)
+   * Space Complexity: O(1)
+   *
+   * The `reduce` function iterates over the elements of an array-like object and applies a callback
+   * function to reduce them into a single value.
+   * @param callbackfn - The callbackfn parameter is a function that will be called for each element in
+   * the array. It takes four arguments:
+   * @param {U} initialValue - The initialValue parameter is the initial value of the accumulator. It
+   * is the value that the accumulator starts with before the reduction operation begins.
+   * @returns The `reduce` method is returning the final value of the accumulator after iterating over
+   * all the elements in the array and applying the callback function to each element.
+   */
+  reduce<U>(callbackfn: ReduceElementCallback<E, R, U, C>, initialValue: U): U {
+    let accumulator = initialValue;
+    let index = 0;
+    for (const item of this) {
+      accumulator = callbackfn(accumulator, item as E, index++, this);
+    }
+    return accumulator;
+  }
+
+  /**
+   * Time Complexity: O(n)
+   * Space Complexity: O(n)
+   */
+
+  /**
+   * Time Complexity: O(n)
+   * Space Complexity: O(n)
+   *
+   * The print function logs the elements of an array to the console.
+   */
+  print(): void {
+    console.log([...this]);
+  }
+
+  abstract isEmpty(): boolean;
+
+  abstract clear(): void;
+
+  abstract clone(): C;
+
+  abstract map(...args: any[]): any;
+
+  abstract filter(...args: any[]): any;
+
+  protected abstract _getIterator(...args: any[]): IterableIterator<E>;
+}

package/src/data-structures/base/{iterable-base.ts → iterable-entry-base.ts}

@@ -1,6 +1,14 @@
-import { ElementCallback, EntryCallback, ReduceElementCallback, ReduceEntryCallback } from '../../types';
+import { EntryCallback, ReduceEntryCallback } from '../../types';
 
 export abstract class IterableEntryBase<K = any, V = any> {
+  // protected constructor(options?: IterableEntryBaseOptions<K, V, R>) {
+  //   if (options) {
+  //     const { toEntryFn } = options;
+  //     if (typeof toEntryFn === 'function') this._toEntryFn = toEntryFn
+  //     else throw new TypeError('toEntryFn must be a function type');
+  //   }
+  // }
+
   /**
    * Time Complexity: O(n)
    * Space Complexity: O(1)
@@ -8,6 +16,16 @@ export abstract class IterableEntryBase<K = any, V = any> {
 
   abstract get size(): number;
 
+  // protected _toEntryFn?: (rawElement: R) => BTNEntry<K, V>;
+  //
+  // /**
+  //  * The function returns the value of the _toEntryFn property.
+  //  * @returns The function being returned is `this._toEntryFn`.
+  //  */
+  // get toEntryFn() {
+  //   return this._toEntryFn;
+  // }
+
   /**
    * Time Complexity: O(n)
    * Space Complexity: O(1)
@@ -285,221 +303,12 @@ export abstract class IterableEntryBase<K = any, V = any> {
    * Time Complexity: O(n)
    * Space Complexity: O(n)
    */
-  print(): void {
-    console.log([...this]);
-  }
-
-  abstract isEmpty(): boolean;
-
-  abstract clear(): void;
-
-  abstract clone(): any;
-
-  abstract map(...args: any[]): any;
-
-  abstract filter(...args: any[]): any;
-
-  protected abstract _getIterator(...args: any[]): IterableIterator<[K, V]>;
-}
-
-export abstract class IterableElementBase<E = any, C = any> {
-  abstract get size(): number;
-
-  /**
-   * Time Complexity: O(n)
-   * Space Complexity: O(1)
-   */
-  /**
-   * Time Complexity: O(n)
-   * Space Complexity: O(1)
-   *
-   * The function is an implementation of the Symbol.iterator method that returns an IterableIterator.
-   * @param {any[]} args - The `args` parameter in the code snippet represents a rest parameter. It
-   * allows the function to accept any number of arguments as an array. In this case, the `args`
-   * parameter is used to pass any number of arguments to the `_getIterator` method.
-   */
-  * [Symbol.iterator](...args: any[]): IterableIterator<E> {
-    yield* this._getIterator(...args);
-  }
 
   /**
    * Time Complexity: O(n)
    * Space Complexity: O(n)
-   */
-  /**
-   * Time Complexity: O(n)
-   * Space Complexity: O(n)
-   *
-   * The function returns an iterator that yields all the values in the object.
-   */
-  * values(): IterableIterator<E> {
-    for (const item of this) {
-      yield item;
-    }
-  }
-
-  /**
-   * Time Complexity: O(n)
-   * Space Complexity: O(1)
-   */
-  /**
-   * Time Complexity: O(n)
-   * Space Complexity: O(1)
-   *
-   * The `every` function checks if every element in the array satisfies a given predicate.
-   * @param predicate - The `predicate` parameter is a callback function that takes three arguments:
-   * the current element being processed, its index, and the array it belongs to. It should return a
-   * boolean value indicating whether the element satisfies a certain condition or not.
-   * @param {any} [thisArg] - The `thisArg` parameter is an optional argument that specifies the value
-   * to be used as `this` when executing the `predicate` function. If `thisArg` is provided, it will be
-   * passed as the `this` value to the `predicate` function. If `thisArg` is
-   * @returns The `every` method is returning a boolean value. It returns `true` if every element in
-   * the array satisfies the provided predicate function, and `false` otherwise.
-   */
-  every(predicate: ElementCallback<E, boolean>, thisArg?: any): boolean {
-    let index = 0;
-    for (const item of this) {
-      if (!predicate.call(thisArg, item, index++, this)) {
-        return false;
-      }
-    }
-    return true;
-  }
-
-  /**
-   * Time Complexity: O(n)
-   * Space Complexity: O(1)
-   */
-
-  /**
-   * Time Complexity: O(n)
-   * Space Complexity: O(1)
-   */
-  /**
-   * Time Complexity: O(n)
-   * Space Complexity: O(1)
-   *
-   * The "some" function checks if at least one element in a collection satisfies a given predicate.
-   * @param predicate - The `predicate` parameter is a callback function that takes three arguments:
-   * `value`, `index`, and `array`. It should return a boolean value indicating whether the current
-   * element satisfies the condition.
-   * @param {any} [thisArg] - The `thisArg` parameter is an optional argument that specifies the value
-   * to be used as the `this` value when executing the `predicate` function. If `thisArg` is provided,
-   * it will be passed as the `this` value to the `predicate` function. If `thisArg
-   * @returns a boolean value. It returns true if the predicate function returns true for any element
-   * in the collection, and false otherwise.
-   */
-  some(predicate: ElementCallback<E, boolean>, thisArg?: any): boolean {
-    let index = 0;
-    for (const item of this) {
-      if (predicate.call(thisArg, item, index++, this)) {
-        return true;
-      }
-    }
-    return false;
-  }
-
-  /**
-   * Time Complexity: O(n)
-   * Space Complexity: O(1)
-   */
-
-  /**
-   * Time Complexity: O(n)
-   * Space Complexity: O(1)
-   *
-   * The `forEach` function iterates over each element in an array-like object and calls a callback
-   * function for each element.
-   * @param callbackfn - The callbackfn parameter is a function that will be called for each element in
-   * the array. It takes three arguments: the current element being processed, the index of the current
-   * element, and the array that forEach was called upon.
-   * @param {any} [thisArg] - The `thisArg` parameter is an optional argument that specifies the value
-   * to be used as `this` when executing the `callbackfn` function. If `thisArg` is provided, it will
-   * be passed as the `this` value to the `callbackfn` function. If `thisArg
-   */
-  forEach(callbackfn: ElementCallback<E, void>, thisArg?: any): void {
-    let index = 0;
-    for (const item of this) {
-      callbackfn.call(thisArg, item, index++, this);
-    }
-  }
-
-  /**
-   * Time Complexity: O(n)
-   * Space Complexity: O(1)
-   */
-
-  /**
-   * Time Complexity: O(n)
-   * Space Complexity: O(1)
-   *
-   * The `find` function iterates over the elements of an array-like object and returns the first
-   * element that satisfies the provided callback function.
-   * @param callbackfn - The callbackfn parameter is a function that will be called for each element in
-   * the array. It takes three arguments: the current element being processed, the index of the current
-   * element, and the array itself. The function should return a boolean value indicating whether the
-   * current element matches the desired condition.
-   * @param {any} [thisArg] - The `thisArg` parameter is an optional argument that specifies the value
-   * to be used as `this` when executing the `callbackfn` function. If `thisArg` is provided, it will
-   * be passed as the `this` value to the `callbackfn` function. If `thisArg
-   * @returns The `find` method returns the first element in the array that satisfies the provided
-   * callback function. If no element satisfies the callback function, `undefined` is returned.
-   */
-  find(callbackfn: ElementCallback<E, boolean>, thisArg?: any): E | undefined {
-    let index = 0;
-    for (const item of this) {
-      if (callbackfn.call(thisArg, item, index++, this)) return item;
-    }
-
-    return;
-  }
-
-  /**
-   * Time Complexity: O(n)
-   * Space Complexity: O(1)
-   *
-   * The function checks if a given element exists in a collection.
-   * @param {E} element - The parameter "element" is of type E, which means it can be any type. It
-   * represents the element that we want to check for existence in the collection.
-   * @returns a boolean value. It returns true if the element is found in the collection, and false
-   * otherwise.
-   */
-  has(element: E): boolean {
-    for (const ele of this) {
-      if (ele === element) return true;
-    }
-    return false;
-  }
-
-  /**
-   * Time Complexity: O(n)
-   * Space Complexity: O(1)
-   */
-  /**
-   * Time Complexity: O(n)
-   * Space Complexity: O(1)
    *
-   * The `reduce` function iterates over the elements of an array-like object and applies a callback
-   * function to reduce them into a single value.
-   * @param callbackfn - The callbackfn parameter is a function that will be called for each element in
-   * the array. It takes four arguments:
-   * @param {U} initialValue - The initialValue parameter is the initial value of the accumulator. It
-   * is the value that the accumulator starts with before the reduction operation begins.
-   * @returns The `reduce` method is returning the final value of the accumulator after iterating over
-   * all the elements in the array and applying the callback function to each element.
-   */
-  reduce<U>(callbackfn: ReduceElementCallback<E, U>, initialValue: U): U {
-    let accumulator = initialValue;
-    let index = 0;
-    for (const item of this) {
-      accumulator = callbackfn(accumulator, item as E, index++, this);
-    }
-    return accumulator;
-  }
-
-  /**
-   * Time Complexity: O(n)
-   * Space Complexity: O(n)
+   * The print function logs the elements of an array to the console.
    */
   print(): void {
     console.log([...this]);
@@ -509,11 +318,11 @@ export abstract class IterableElementBase<E = any, C = any> {
 
   abstract clear(): void;
 
-  abstract clone(): C;
+  abstract clone(): any;
 
   abstract map(...args: any[]): any;
 
   abstract filter(...args: any[]): any;
 
-  protected abstract _getIterator(...args: any[]): IterableIterator<E>;
+  protected abstract _getIterator(...args: any[]): IterableIterator<[K, V]>;
 }

package/src/data-structures/binary-tree/avl-tree-multi-map.ts

@@ -12,7 +12,6 @@ import type {
   BinaryTreeDeleteResult,
   BSTNKeyOrNode,
   BTNCallback,
-  Comparable,
   IterationType,
   KeyOrNodeOrEntry
 } from '../../types';
@@ -21,7 +20,7 @@ import { IBinaryTree } from '../../interfaces';
 import { AVLTree, AVLTreeNode } from './avl-tree';
 
 export class AVLTreeMultiMapNode<
-  K extends Comparable,
+  K = any,
   V = any,
   NODE extends AVLTreeMultiMapNode<K, V, NODE> = AVLTreeMultiMapNodeNested<K, V>
 > extends AVLTreeNode<K, V, NODE> {
@@ -64,7 +63,7 @@ export class AVLTreeMultiMapNode<
  * The only distinction between a AVLTreeMultiMap and a AVLTree lies in the ability of the former to store duplicate nodes through the utilization of counters.
  */
 export class AVLTreeMultiMap<
-  K extends Comparable,
+  K = any,
   V = any,
   R = BTNEntry<K, V>,
   NODE extends AVLTreeMultiMapNode<K, V, NODE> = AVLTreeMultiMapNode<K, V, AVLTreeMultiMapNodeNested<K, V>>,

package/src/data-structures/binary-tree/avl-tree.ts

@@ -13,14 +13,13 @@ import type {
   BinaryTreeDeleteResult,
   BSTNKeyOrNode,
   BTNCallback,
-  Comparable,
   KeyOrNodeOrEntry
 } from '../../types';
 import { BTNEntry } from '../../types';
 import { IBinaryTree } from '../../interfaces';
 
 export class AVLTreeNode<
-  K extends Comparable,
+  K = any,
   V = any,
   NODE extends AVLTreeNode<K, V, NODE> = AVLTreeNodeNested<K, V>
 > extends BSTNode<K, V, NODE> {
@@ -67,7 +66,7 @@ export class AVLTreeNode<
  * 7. Path Length: The path length from the root to any leaf is longer compared to an unbalanced BST, but shorter than a linear chain of nodes.
  */
 export class AVLTree<
-  K extends Comparable,
+  K = any,
   V = any,
   R = BTNEntry<K, V>,
   NODE extends AVLTreeNode<K, V, NODE> = AVLTreeNode<K, V, AVLTreeNodeNested<K, V>>,

package/src/data-structures/binary-tree/binary-tree.ts

@@ -14,7 +14,6 @@ import type {
   BinaryTreePrintOptions,
   BTNCallback,
   BTNEntry,
-  Comparable,
   DFSOrderPattern,
   EntryCallback,
   FamilyPosition,
@@ -33,7 +32,7 @@ import { IterableEntryBase } from '../base';
  * @template NODE - The type of the family relationship in the binary tree.
  */
 export class BinaryTreeNode<
-  K extends Comparable,
+  K = any,
   V = any,
   NODE extends BinaryTreeNode<K, V, NODE> = BinaryTreeNode<K, V, BinaryTreeNodeNested<K, V>>
 > {
@@ -131,7 +130,7 @@ export class BinaryTreeNode<
  */
 
 export class BinaryTree<
-  K extends Comparable,
+  K = any,
   V = any,
   R = BTNEntry<K, V>,
   NODE extends BinaryTreeNode<K, V, NODE> = BinaryTreeNode<K, V, BinaryTreeNodeNested<K, V>>,
@@ -143,7 +142,7 @@ export class BinaryTree<
 
   /**
    * The constructor function initializes a binary tree object with optional keysOrNodesOrEntriesOrRawElements and options.
-   * @param [keysOrNodesOrEntriesOrRawElements] - An optional iterable of KeyOrNodeOrEntry objects. These objects represent the
+   * @param [keysOrNodesOrEntriesOrRawElements] - Optional iterable of KeyOrNodeOrEntry objects. These objects represent the
    * nodes to be added to the binary tree.
    * @param [options] - The `options` parameter is an optional object that can contain additional
    * configuration options for the binary tree. In this case, it is of type
@@ -159,6 +158,7 @@ export class BinaryTree<
       const { iterationType, toEntryFn } = options;
       if (iterationType) this.iterationType = iterationType;
       if (typeof toEntryFn === 'function') this._toEntryFn = toEntryFn;
+      else if (toEntryFn) throw TypeError('toEntryFn must be a function type');
     }
 
     if (keysOrNodesOrEntriesOrRawElements) this.addMany(keysOrNodesOrEntriesOrRawElements);
@@ -2001,7 +2001,7 @@ export class BinaryTree<
       // Display logic of normal nodes
 
       const key = node.key,
-        line = this.isNIL(node) ? 'S' : key.toString(),
+        line = this.isNIL(node) ? 'S' : String(key),
         width = line.length;
 
       return _buildNodeDisplay(
@@ -2012,7 +2012,7 @@ export class BinaryTree<
       );
     } else {
       // For cases where none of the conditions are met, null, undefined, and NaN nodes are not displayed
-      const line = node === undefined ? 'U' : 'NODE',
+      const line = node === undefined ? 'U' : 'N',
         width = line.length;
 
       return _buildNodeDisplay(line, width, [[''], 1, 0, 0], [[''], 1, 0, 0]);