heap-typed 1.38.0 → 1.38.1

package/src/data-structures/linked-list/doubly-linked-list.ts

@@ -84,6 +84,10 @@ export class DoublyLinkedList<E = any> {
     return this._length;
   }
 
+  get size(): number {
+    return this.length;
+  }
+
   /**
    * The `fromArray` function creates a new instance of a DoublyLinkedList and populates it with the elements from the
    * given array.
@@ -222,10 +226,6 @@ export class DoublyLinkedList<E = any> {
     return this.tail?.val;
   }
 
-  get size(): number {
-    return this.length;
-  }
-
   /**
    * The `getAt` function returns the value at a specified index in a linked list, or null if the index is out of bounds.
    * @param {number} index - The index parameter is a number that represents the position of the element we want to

package/src/data-structures/linked-list/skip-linked-list.ts

@@ -19,20 +19,32 @@ export class SkipListNode<K, V> {
 }
 
 export class SkipList<K, V> {
-  get probability(): number {
-    return this._probability;
+  /**
+   * The constructor initializes a SkipList with a specified maximum level and probability.
+   * @param [maxLevel=16] - The `maxLevel` parameter represents the maximum level that a skip list can have. It determines
+   * the maximum number of levels that can be created in the skip list.
+   * @param [probability=0.5] - The probability parameter represents the probability of a node being promoted to a higher
+   * level in the skip list. It is used to determine the height of each node in the skip list.
+   */
+  constructor(maxLevel = 16, probability = 0.5) {
+    this._head = new SkipListNode<K, V>(null as any, null as any, maxLevel);
+    this._level = 0;
+    this._maxLevel = maxLevel;
+    this._probability = probability;
   }
 
-  set probability(value: number) {
-    this._probability = value;
-  }
-  get maxLevel(): number {
-    return this._maxLevel;
+  private _head: SkipListNode<K, V>;
+
+  get head(): SkipListNode<K, V> {
+    return this._head;
   }
 
-  set maxLevel(value: number) {
-    this._maxLevel = value;
+  set head(value: SkipListNode<K, V>) {
+    this._head = value;
   }
+
+  private _level: number;
+
   get level(): number {
     return this._level;
   }
@@ -40,42 +52,25 @@ export class SkipList<K, V> {
   set level(value: number) {
     this._level = value;
   }
-  get head(): SkipListNode<K, V> {
-    return this._head;
+
+  private _maxLevel: number;
+
+  get maxLevel(): number {
+    return this._maxLevel;
   }
 
-  set head(value: SkipListNode<K, V>) {
-    this._head = value;
+  set maxLevel(value: number) {
+    this._maxLevel = value;
   }
-  private _head: SkipListNode<K, V>;
-  private _level: number;
-  private _maxLevel: number;
+
   private _probability: number;
 
-  /**
-   * The constructor initializes a SkipList with a specified maximum level and probability.
-   * @param [maxLevel=16] - The `maxLevel` parameter represents the maximum level that a skip list can have. It determines
-   * the maximum number of levels that can be created in the skip list.
-   * @param [probability=0.5] - The probability parameter represents the probability of a node being promoted to a higher
-   * level in the skip list. It is used to determine the height of each node in the skip list.
-   */
-  constructor(maxLevel = 16, probability = 0.5) {
-    this._head = new SkipListNode<K, V>(null as any, null as any, maxLevel);
-    this._level = 0;
-    this._maxLevel = maxLevel;
-    this._probability = probability;
+  get probability(): number {
+    return this._probability;
   }
 
-  /**
-   * The function "randomLevel" generates a random level based on a given probability and maximum level.
-   * @returns the level, which is a number.
-   */
-  private randomLevel(): number {
-    let level = 1;
-    while (Math.random() < this.probability && level < this.maxLevel) {
-      level++;
-    }
-    return level;
+  set probability(value: number) {
+    this._probability = value;
   }
 
   /**
@@ -163,4 +158,16 @@ export class SkipList<K, V> {
 
     return false;
   }
+
+  /**
+   * The function "randomLevel" generates a random level based on a given probability and maximum level.
+   * @returns the level, which is a number.
+   */
+  private randomLevel(): number {
+    let level = 1;
+    while (Math.random() < this.probability && level < this.maxLevel) {
+      level++;
+    }
+    return level;
+  }
 }

package/src/data-structures/matrix/matrix2d.ts

@@ -58,16 +58,6 @@ export class Matrix2D {
     return this._matrix;
   }
 
-  /**
-   * The function "toVector" returns a new Vector2D object with the values from the first and second elements of the
-   * _matrix array.
-   * @returns A new instance of the Vector2D class is being returned. The values of the returned vector are taken from
-   * the first column of the matrix.
-   */
-  toVector(): Vector2D {
-    return new Vector2D(this._matrix[0][0], this._matrix[1][0]);
-  }
-
   /**
    * The function takes two 2D matrices as input and returns their sum as a new 2D matrix.
    * @param {Matrix2D} matrix1 - Matrix2D - The first matrix to be added.
@@ -208,6 +198,16 @@ export class Matrix2D {
       [0, 0, vector.w]
     ]);
   }
+
+  /**
+   * The function "toVector" returns a new Vector2D object with the values from the first and second elements of the
+   * _matrix array.
+   * @returns A new instance of the Vector2D class is being returned. The values of the returned vector are taken from
+   * the first column of the matrix.
+   */
+  toVector(): Vector2D {
+    return new Vector2D(this._matrix[0][0], this._matrix[1][0]);
+  }
 }
 
 export default Matrix2D;

package/src/data-structures/trie/trie.ts

@@ -52,6 +52,8 @@ export class TrieNode {
  * Trie represents a Trie data structure. It provides basic Trie operations and additional methods.
  */
 export class Trie {
+  private readonly _caseSensitive: boolean;
+
   constructor(words?: string[], caseSensitive = true) {
     this._root = new TrieNode('');
     this._caseSensitive = caseSensitive;
@@ -72,8 +74,6 @@ export class Trie {
     this._root = v;
   }
 
-  private readonly _caseSensitive: boolean;
-
   /**
    * Add a word to the Trie structure.
    * @param {string} word - The word to add.
@@ -110,13 +110,6 @@ export class Trie {
     return cur.isEnd;
   }
 
-  private _caseProcess(str: string) {
-    if (!this._caseSensitive) {
-      str = str.toLowerCase(); // Convert str to lowercase if case-insensitive
-    }
-    return str;
-  }
-
   /**
    * Remove a word from the Trie structure.
    * @param{string} word - The word to delete.
@@ -282,5 +275,12 @@ export class Trie {
     return words;
   }
 
+  private _caseProcess(str: string) {
+    if (!this._caseSensitive) {
+      str = str.toLowerCase(); // Convert str to lowercase if case-insensitive
+    }
+    return str;
+  }
+
   // --- end additional methods ---
 }

package/src/index.ts

@@ -6,6 +6,6 @@
  * @license MIT License
  */
 // export { Heap, MaxHeap, MinHeap } from 'data-structure-typed';
-export * from 'data-structure-typed/src/data-structures/heap';
-export * from 'data-structure-typed/src/types/data-structures/heap';
-export * from 'data-structure-typed/src/types/helpers';
+export * from './data-structures/heap';
+export * from './types/data-structures/heap';
+export * from './types/helpers';

package/src/types/helpers.ts

@@ -6,4 +6,8 @@ export type MapCallback<N> = (node: N) => any;
 
 export type MapCallbackReturn<N> = ReturnType<MapCallback<N>>;
 
-export enum CP {lt = 'lt', eq = 'eq', gt = 'gt'}
+export enum CP {
+  lt = 'lt',
+  eq = 'eq',
+  gt = 'gt'
+}