data-structure-typed 1.39.3 → 1.39.5

package/src/data-structures/graph/undirected-graph.ts

@@ -23,7 +23,7 @@ export class UndirectedVertex<V = any> extends AbstractVertex<V> {
   }
 }
 
-export class UndirectedEdge<V = number> extends AbstractEdge<V> {
+export class UndirectedEdge<E = number> extends AbstractEdge<E> {
   /**
    * The constructor function creates an instance of a class with two vertex IDs, an optional weight, and an optional
    * value.
@@ -31,10 +31,10 @@ export class UndirectedEdge<V = number> extends AbstractEdge<V> {
    * @param {VertexKey} v2 - The parameter `v2` is a `VertexKey`, which represents the identifier of the second vertex in a
    * graph edge.
    * @param {number} [weight] - The weight parameter is an optional number that represents the weight of the edge.
-   * @param {V} [val] - The "val" parameter is an optional parameter of type V. It is used to store a value associated
+   * @param {E} [val] - The "val" parameter is an optional parameter of type E. It is used to store a value associated
    * with the edge.
    */
-  constructor(v1: VertexKey, v2: VertexKey, weight?: number, val?: V) {
+  constructor(v1: VertexKey, v2: VertexKey, weight?: number, val?: E) {
     super(weight, val);
     this._vertices = [v1, v2];
   }
@@ -51,23 +51,25 @@ export class UndirectedEdge<V = number> extends AbstractEdge<V> {
 }
 
 export class UndirectedGraph<
-    V extends UndirectedVertex<any> = UndirectedVertex,
-    E extends UndirectedEdge<any> = UndirectedEdge
+    V = any,
+    E = any,
+    VO extends UndirectedVertex<V> = UndirectedVertex<V>,
+    EO extends UndirectedEdge<E> = UndirectedEdge<E>
   >
-  extends AbstractGraph<V, E>
-  implements IGraph<V, E>
+  extends AbstractGraph<V, E, VO, EO>
+  implements IGraph<V, E, VO, EO>
 {
   /**
    * The constructor initializes a new Map object to store edges.
    */
   constructor() {
     super();
-    this._edges = new Map<V, E[]>();
+    this._edges = new Map<VO, EO[]>();
   }
 
-  protected _edges: Map<V, E[]>;
+  protected _edges: Map<VO, EO[]>;
 
-  get edges(): Map<V, E[]> {
+  get edges(): Map<VO, EO[]> {
     return this._edges;
   }
 
@@ -78,10 +80,10 @@ export class UndirectedGraph<
    * @param [val] - The `val` parameter is an optional value that can be assigned to the vertex. If a value is provided,
    * it will be used as the value of the vertex. If no value is provided, the `key` parameter will be used as the value of
    * the vertex.
-   * @returns The method is returning a new instance of the `UndirectedVertex` class, casted as type `V`.
+   * @returns The method is returning a new instance of the `UndirectedVertex` class, casted as type `VO`.
    */
-  override createVertex(key: VertexKey, val?: V['val']): V {
-    return new UndirectedVertex(key, val ?? key) as V;
+  override createVertex(key: VertexKey, val?: VO['val']): VO {
+    return new UndirectedVertex(key, val ?? key) as VO;
   }
 
   /**
@@ -92,26 +94,26 @@ export class UndirectedGraph<
    * no weight is provided, it defaults to 1.
    * @param [val] - The `val` parameter is an optional value that can be assigned to the edge. It can be of any type and
    * is used to store additional information or data associated with the edge.
-   * @returns a new instance of the `UndirectedEdge` class, which is casted as type `E`.
+   * @returns a new instance of the `UndirectedEdge` class, which is casted as type `EO`.
    */
-  override createEdge(v1: VertexKey, v2: VertexKey, weight?: number, val?: E['val']): E {
-    return new UndirectedEdge(v1, v2, weight ?? 1, val) as E;
+  override createEdge(v1: VertexKey, v2: VertexKey, weight?: number, val?: EO['val']): EO {
+    return new UndirectedEdge(v1, v2, weight ?? 1, val) as EO;
   }
 
   /**
    * The function `getEdge` returns the first edge that connects two vertices, or null if no such edge exists.
-   * @param {V | null | VertexKey} v1 - The parameter `v1` represents a vertex or vertex ID. It can be of type `V` (vertex
+   * @param {VO | null | VertexKey} v1 - The parameter `v1` represents a vertex or vertex ID. It can be of type `VO` (vertex
    * object), `null`, or `VertexKey` (a string or number representing the ID of a vertex).
-   * @param {V | null | VertexKey} v2 - The parameter `v2` represents a vertex or vertex ID. It can be of type `V` (vertex
+   * @param {VO | null | VertexKey} v2 - The parameter `v2` represents a vertex or vertex ID. It can be of type `VO` (vertex
    * object), `null`, or `VertexKey` (vertex ID).
-   * @returns an edge (E) or null.
+   * @returns an edge (EO) or null.
    */
-  getEdge(v1: V | null | VertexKey, v2: V | null | VertexKey): E | null {
-    let edges: E[] | undefined = [];
+  getEdge(v1: VO | null | VertexKey, v2: VO | null | VertexKey): EO | null {
+    let edges: EO[] | undefined = [];
 
     if (v1 !== null && v2 !== null) {
-      const vertex1: V | null = this._getVertex(v1);
-      const vertex2: V | null = this._getVertex(v2);
+      const vertex1: VO | null = this._getVertex(v1);
+      const vertex2: VO | null = this._getVertex(v2);
 
       if (vertex1 && vertex2) {
         edges = this._edges.get(vertex1)?.filter(e => e.vertices.includes(vertex2.key));
@@ -123,48 +125,48 @@ export class UndirectedGraph<
 
   /**
    * The function removes an edge between two vertices in a graph and returns the removed edge.
-   * @param {V | VertexKey} v1 - The parameter `v1` represents either a vertex object (`V`) or a vertex ID (`VertexKey`).
-   * @param {V | VertexKey} v2 - V | VertexKey - This parameter can be either a vertex object (V) or a vertex ID
+   * @param {VO | VertexKey} v1 - The parameter `v1` represents either a vertex object (`VO`) or a vertex ID (`VertexKey`).
+   * @param {VO | VertexKey} v2 - VO | VertexKey - This parameter can be either a vertex object (VO) or a vertex ID
    * (VertexKey). It represents the second vertex of the edge that needs to be removed.
-   * @returns the removed edge (E) if it exists, or null if either of the vertices (V) does not exist.
+   * @returns the removed edge (EO) if it exists, or null if either of the vertices (VO) does not exist.
    */
-  deleteEdgeBetween(v1: V | VertexKey, v2: V | VertexKey): E | null {
-    const vertex1: V | null = this._getVertex(v1);
-    const vertex2: V | null = this._getVertex(v2);
+  deleteEdgeBetween(v1: VO | VertexKey, v2: VO | VertexKey): EO | null {
+    const vertex1: VO | null = this._getVertex(v1);
+    const vertex2: VO | null = this._getVertex(v2);
 
     if (!vertex1 || !vertex2) {
       return null;
     }
 
     const v1Edges = this._edges.get(vertex1);
-    let removed: E | null = null;
+    let removed: EO | null = null;
     if (v1Edges) {
-      removed = arrayRemove<E>(v1Edges, (e: E) => e.vertices.includes(vertex2.key))[0] || null;
+      removed = arrayRemove<EO>(v1Edges, (e: EO) => e.vertices.includes(vertex2.key))[0] || null;
     }
     const v2Edges = this._edges.get(vertex2);
     if (v2Edges) {
-      arrayRemove<E>(v2Edges, (e: E) => e.vertices.includes(vertex1.key));
+      arrayRemove<EO>(v2Edges, (e: EO) => e.vertices.includes(vertex1.key));
     }
     return removed;
   }
 
   /**
    * The deleteEdge function removes an edge between two vertices in a graph.
-   * @param {E} edge - The parameter "edge" is of type E, which represents an edge in a graph.
-   * @returns The method is returning either the removed edge (of type E) or null if the edge was not found.
+   * @param {EO} edge - The parameter "edge" is of type EO, which represents an edge in a graph.
+   * @returns The method is returning either the removed edge (of type EO) or null if the edge was not found.
    */
-  deleteEdge(edge: E): E | null {
+  deleteEdge(edge: EO): EO | null {
     return this.deleteEdgeBetween(edge.vertices[0], edge.vertices[1]);
   }
 
   /**
    * The function `degreeOf` returns the degree of a vertex in a graph, which is the number of edges connected to that
    * vertex.
-   * @param {VertexKey | V} vertexOrKey - The parameter `vertexOrKey` can be either a `VertexKey` or a `V`.
+   * @param {VertexKey | VO} vertexOrKey - The parameter `vertexOrKey` can be either a `VertexKey` or a `VO`.
    * @returns The function `degreeOf` returns the degree of a vertex in a graph. The degree of a vertex is the number of
    * edges connected to that vertex.
    */
-  degreeOf(vertexOrKey: VertexKey | V): number {
+  degreeOf(vertexOrKey: VertexKey | VO): number {
     const vertex = this._getVertex(vertexOrKey);
     if (vertex) {
       return this._edges.get(vertex)?.length || 0;
@@ -175,11 +177,11 @@ export class UndirectedGraph<
 
   /**
    * The function returns the edges of a given vertex or vertex ID.
-   * @param {VertexKey | V} vertexOrKey - The parameter `vertexOrKey` can be either a `VertexKey` or a `V`. A `VertexKey` is a
-   * unique identifier for a vertex in a graph, while `V` represents the type of the vertex.
+   * @param {VertexKey | VO} vertexOrKey - The parameter `vertexOrKey` can be either a `VertexKey` or a `VO`. A `VertexKey` is a
+   * unique identifier for a vertex in a graph, while `VO` represents the type of the vertex.
    * @returns an array of edges.
    */
-  edgesOf(vertexOrKey: VertexKey | V): E[] {
+  edgesOf(vertexOrKey: VertexKey | VO): EO[] {
     const vertex = this._getVertex(vertexOrKey);
     if (vertex) {
       return this._edges.get(vertex) || [];
@@ -190,10 +192,10 @@ export class UndirectedGraph<
 
   /**
    * The function "edgeSet" returns an array of unique edges from a set of edges.
-   * @returns The method `edgeSet()` returns an array of type `E[]`.
+   * @returns The method `edgeSet()` returns an array of type `EO[]`.
    */
-  edgeSet(): E[] {
-    const edgeSet: Set<E> = new Set();
+  edgeSet(): EO[] {
+    const edgeSet: Set<EO> = new Set();
     this._edges.forEach(edges => {
       edges.forEach(edge => {
         edgeSet.add(edge);
@@ -204,12 +206,12 @@ export class UndirectedGraph<
 
   /**
    * The function "getNeighbors" returns an array of neighboring vertices for a given vertex or vertex ID.
-   * @param {V | VertexKey} vertexOrKey - The parameter `vertexOrKey` can be either a vertex object (`V`) or a vertex ID
+   * @param {VO | VertexKey} vertexOrKey - The parameter `vertexOrKey` can be either a vertex object (`VO`) or a vertex ID
    * (`VertexKey`).
-   * @returns an array of vertices (V[]).
+   * @returns an array of vertices (VO[]).
    */
-  getNeighbors(vertexOrKey: V | VertexKey): V[] {
-    const neighbors: V[] = [];
+  getNeighbors(vertexOrKey: VO | VertexKey): VO[] {
+    const neighbors: VO[] = [];
     const vertex = this._getVertex(vertexOrKey);
     if (vertex) {
       const neighborEdges = this.edgesOf(vertex);
@@ -226,11 +228,11 @@ export class UndirectedGraph<
   /**
    * The function "getEndsOfEdge" returns the vertices at the ends of an edge if the edge exists in the graph, otherwise
    * it returns null.
-   * @param {E} edge - The parameter "edge" is of type E, which represents an edge in a graph.
-   * @returns The function `getEndsOfEdge` returns an array containing two vertices `[V, V]` if the edge exists in the
+   * @param {EO} edge - The parameter "edge" is of type EO, which represents an edge in a graph.
+   * @returns The function `getEndsOfEdge` returns an array containing two vertices `[VO, VO]` if the edge exists in the
    * graph. If the edge does not exist, it returns `null`.
    */
-  getEndsOfEdge(edge: E): [V, V] | null {
+  getEndsOfEdge(edge: EO): [VO, VO] | null {
     if (!this.hasEdge(edge.vertices[0], edge.vertices[1])) {
       return null;
     }
@@ -245,10 +247,10 @@ export class UndirectedGraph<
 
   /**
    * The function adds an edge to the graph by updating the adjacency list with the vertices of the edge.
-   * @param {E} edge - The parameter "edge" is of type E, which represents an edge in a graph.
+   * @param {EO} edge - The parameter "edge" is of type EO, which represents an edge in a graph.
    * @returns a boolean value.
    */
-  protected _addEdgeOnly(edge: E): boolean {
+  protected _addEdgeOnly(edge: EO): boolean {
     for (const end of edge.vertices) {
       const endVertex = this._getVertex(end);
       if (endVertex === null) return false;
@@ -266,9 +268,9 @@ export class UndirectedGraph<
 
   /**
    * The function sets the edges of a graph.
-   * @param v - A map where the keys are of type V and the values are arrays of type E.
+   * @param v - A map where the keys are of type VO and the values are arrays of type EO.
    */
-  protected _setEdges(v: Map<V, E[]>) {
+  protected _setEdges(v: Map<VO, EO[]>) {
     this._edges = v;
   }
 }

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

@@ -5,7 +5,7 @@
  */
 import {SinglyLinkedList} from '../linked-list';
 
-export class LinkedListQueue<E = any> extends SinglyLinkedList<E> {
+export class SkipQueue<E = any> extends SinglyLinkedList<E> {
   /**
    * The enqueue function adds a value to the end of an array.
    * @param {E} value - The value parameter represents the value that you want to add to the queue.

package/src/interfaces/graph.ts

@@ -1,7 +1,7 @@
 import {VertexKey} from '../types';
 
-export interface IGraph<V, E> {
-  createVertex(key: VertexKey, val?: V): V;
+export interface IGraph<V, E, VO, EO> {
+  createVertex(key: VertexKey, val?: V): VO;
 
-  createEdge(srcOrV1: VertexKey | string, destOrV2: VertexKey | string, weight?: number, val?: E): E;
+  createEdge(srcOrV1: VertexKey | string, destOrV2: VertexKey | string, weight?: number, val?: E): EO;
 }

package/test/unit/data-structures/binary-tree/binary-tree.test.ts

@@ -480,7 +480,6 @@ describe('BinaryTree', () => {
     tree.delete(5);
     tree.delete(7);
     tree.delete(3);
-
     expect(tree.root).toBe(null);
     expect(tree.getHeight()).toBe(-1);
   });

package/test/unit/data-structures/graph/directed-graph.test.ts

@@ -92,52 +92,57 @@ describe('DirectedGraph Operation Test', () => {
   });
 });
 
-class MyVertex<V extends string> extends DirectedVertex<V> {
+class MyVertex<V = any> extends DirectedVertex<V> {
   constructor(key: VertexKey, val?: V) {
     super(key, val);
     this._data = val;
   }
 
-  private _data: string | undefined;
+  private _data: V | undefined;
 
-  get data(): string | undefined {
+  get data(): V | undefined {
     return this._data;
   }
 
-  set data(value: string | undefined) {
+  set data(value: V | undefined) {
     this._data = value;
   }
 }
 
-class MyEdge<E extends string> extends DirectedEdge<E> {
+class MyEdge<E = any> extends DirectedEdge<E> {
   constructor(v1: VertexKey, v2: VertexKey, weight?: number, val?: E) {
     super(v1, v2, weight, val);
     this._data = val;
   }
 
-  private _data: string | undefined;
+  private _data: E | undefined;
 
-  get data(): string | undefined {
+  get data(): E | undefined {
     return this._data;
   }
 
-  set data(value: string | undefined) {
+  set data(value: E | undefined) {
     this._data = value;
   }
 }
 
-class MyDirectedGraph<V extends MyVertex<string>, E extends MyEdge<string>> extends DirectedGraph<V, E> {
-  createVertex(key: VertexKey, val: V['val']): V {
-    return new MyVertex(key, val) as V;
+class MyDirectedGraph<
+  V = any,
+  E = any,
+  VO extends MyVertex<V> = MyVertex<V>,
+  EO extends MyEdge<E> = MyEdge<E>
+> extends DirectedGraph<V, E, VO, EO> {
+  createVertex(key: VertexKey, val: V): VO {
+    return new MyVertex(key, val) as VO;
   }
 
-  createEdge(src: VertexKey, dest: VertexKey, weight?: number, val?: E['val']): E {
-    return new MyEdge(src, dest, weight ?? 1, val) as E;
+  createEdge(src: VertexKey, dest: VertexKey, weight?: number, val?: E): EO {
+    return new MyEdge(src, dest, weight ?? 1, val) as EO;
   }
 }
 
 describe('Inherit from DirectedGraph and perform operations', () => {
-  let myGraph = new MyDirectedGraph<MyVertex<string>, MyEdge<string>>();
+  let myGraph = new MyDirectedGraph<string, string>();
   beforeEach(() => {
     myGraph = new MyDirectedGraph();
   });
@@ -234,7 +239,7 @@ describe('Inherit from DirectedGraph and perform operations', () => {
 });
 
 describe('Inherit from DirectedGraph and perform operations test2.', () => {
-  const myGraph = new MyDirectedGraph<MyVertex<string>, MyEdge<string>>();
+  const myGraph = new MyDirectedGraph<string, string>();
 
   it('should test graph operations', () => {
     const vertex1 = new MyVertex(1, 'data1');

package/test/unit/data-structures/graph/map-graph.test.ts

@@ -4,17 +4,17 @@ describe('MapGraph Operation Test', () => {
   it('dijkstra shortest path', () => {
     const mapGraph = new MapGraph([5.500338, 100.173665]);
 
-    mapGraph.addVertex(new MapVertex('Surin', 5.466724, 100.274805));
-    mapGraph.addVertex(new MapVertex('Batu Feringgi Beach', 5.475141, 100.27667));
-    mapGraph.addVertex(new MapVertex('Lotus', 5.459044, 100.308767));
-    mapGraph.addVertex(new MapVertex('The Breeza', 5.454197, 100.307859));
-    mapGraph.addVertex(new MapVertex('Hard Rock Hotel', 5.46785, 100.241876));
-    mapGraph.addVertex(new MapVertex('Mira', 5.456749, 100.28665));
-    mapGraph.addVertex(new MapVertex('Penang Bible Church', 5.428683, 100.314825));
-    mapGraph.addVertex(new MapVertex('Queensbay', 5.33276, 100.306651));
-    mapGraph.addVertex(new MapVertex('Saanen Goat Farm', 5.405738, 100.207699));
-    mapGraph.addVertex(new MapVertex('Trinity Auto', 5.401126, 100.303739));
-    mapGraph.addVertex(new MapVertex('Penang Airport', 5.293185, 100.265772));
+    mapGraph.addVertex(new MapVertex('Surin', '', 5.466724, 100.274805));
+    mapGraph.addVertex(new MapVertex('Batu Feringgi Beach', '', 5.475141, 100.27667));
+    mapGraph.addVertex(new MapVertex('Lotus', '', 5.459044, 100.308767));
+    mapGraph.addVertex(new MapVertex('The Breeza', '', 5.454197, 100.307859));
+    mapGraph.addVertex(new MapVertex('Hard Rock Hotel', '', 5.46785, 100.241876));
+    mapGraph.addVertex(new MapVertex('Mira', '', 5.456749, 100.28665));
+    mapGraph.addVertex(new MapVertex('Penang Bible Church', '', 5.428683, 100.314825));
+    mapGraph.addVertex(new MapVertex('Queensbay', '', 5.33276, 100.306651));
+    mapGraph.addVertex(new MapVertex('Saanen Goat Farm', '', 5.405738, 100.207699));
+    mapGraph.addVertex(new MapVertex('Trinity Auto', '', 5.401126, 100.303739));
+    mapGraph.addVertex(new MapVertex('Penang Airport', '', 5.293185, 100.265772));
     mapGraph.addEdge('Surin', 'Lotus', 4.7);
     mapGraph.addEdge('Lotus', 'The Breeza', 1);
     mapGraph.addEdge('Batu Feringgi Beach', 'Hard Rock Hotel', 5.2);
@@ -45,17 +45,17 @@ describe('MapGraph Operation Test', () => {
 });
 
 describe('MapGraph', () => {
-  let mapGraph: MapGraph;
+  let mapGraph: MapGraph<string, string>;
 
   beforeEach(() => {
     // Create a new MapGraph instance before each test
-    mapGraph = new MapGraph([0, 0], [100, 100]);
+    mapGraph = new MapGraph<string, string>([0, 0], [100, 100]);
   });
 
   // Test adding vertices to the graph
   it('should add vertices to the graph', () => {
-    const locationA = new MapVertex('A', 10, 20, 'Location A');
-    const locationB = new MapVertex('B', 30, 40, 'Location B');
+    const locationA = new MapVertex('A', 'Location A', 10, 20);
+    const locationB = new MapVertex('B', 'Location B', 30, 40);
 
     mapGraph.addVertex(locationA);
     mapGraph.addVertex(locationB);
@@ -66,8 +66,8 @@ describe('MapGraph', () => {
 
   // Test adding edges to the graph
   it('should add edges to the graph', () => {
-    const locationA = new MapVertex('A', 10, 20, 'Location A');
-    const locationB = new MapVertex('B', 30, 40, 'Location B');
+    const locationA = new MapVertex('A', 'Location A', 10, 20);
+    const locationB = new MapVertex('B', 'Location B', 30, 40);
     const edgeAB = new MapEdge('A', 'B', 50, 'Edge from A to B');
 
     mapGraph.addVertex(locationA);
@@ -79,12 +79,12 @@ describe('MapGraph', () => {
 
   // Test getting neighbors of a vertex
   it('should return the neighbors of a vertex', () => {
-    const locationA = new MapVertex('A', 10, 20, 'Location A');
+    const locationA = new MapVertex('A', 'Location A', 10, 20);
     locationA.lat = locationA.lat;
     locationA.long = locationA.long;
-    const locationB = mapGraph.createVertex('B', 30, 40, 'Location B');
+    const locationB = mapGraph.createVertex('B', 'Location B', 30, 40);
 
-    const locationC = new MapVertex('C', 50, 60, 'Location C');
+    const locationC = new MapVertex('C', 'Location C', 50, 60);
     const edgeAB = new MapEdge('A', 'B', 50, 'Edge from A to B');
     const edgeBC = new MapEdge('B', 'C', 60, 'Edge from B to C');
 
@@ -106,9 +106,9 @@ describe('MapGraph', () => {
 
   // Test finding the shortest path between locations
   it('should find the shortest path between two locations', () => {
-    const locationA = new MapVertex('A', 10, 20, 'Location A');
-    const locationB = new MapVertex('B', 30, 40, 'Location B');
-    const locationC = new MapVertex('C', 50, 60, 'Location C');
+    const locationA = new MapVertex('A', 'Location A', 10, 20);
+    const locationB = new MapVertex('B', 'Location B', 30, 40);
+    const locationC = new MapVertex('C', 'Location C', 50, 60);
     const edgeAB = new MapEdge('A', 'B', 50, 'Edge from A to B');
     const edgeBC = new MapEdge('B', 'C', 60, 'Edge from B to C');
 

package/test/unit/data-structures/graph/undirected-graph.test.ts

@@ -59,11 +59,11 @@ describe('UndirectedGraph Operation Test', () => {
 });
 
 describe('UndirectedGraph', () => {
-  let undirectedGraph: UndirectedGraph<UndirectedVertex<string>, UndirectedEdge<string>>;
+  let undirectedGraph: UndirectedGraph<string, string>;
 
   beforeEach(() => {
     // Create a new UndirectedGraph instance before each test
-    undirectedGraph = new UndirectedGraph<UndirectedVertex<string>, UndirectedEdge<string>>();
+    undirectedGraph = new UndirectedGraph<string, string>();
   });
 
   // Test adding vertices to the graph

package/test/unit/data-structures/queue/queue.test.ts

@@ -1,4 +1,4 @@
-import {LinkedListQueue, Queue} from '../../../../src';
+import {SkipQueue, Queue} from '../../../../src';
 import {bigO, magnitude} from '../../../utils';
 import {isDebugTest} from '../../../config';
 
@@ -168,11 +168,11 @@ describe('Queue', () => {
     expect(values).toEqual([1, 2, 3]);
   });
 });
-describe('LinkedListQueue', () => {
-  let queue: LinkedListQueue<string>;
+describe('SkipQueue', () => {
+  let queue: SkipQueue<string>;
 
   beforeEach(() => {
-    queue = new LinkedListQueue<string>();
+    queue = new SkipQueue<string>();
   });
 
   it('should enqueue elements to the end of the queue', () => {
@@ -197,7 +197,7 @@ describe('LinkedListQueue', () => {
     expect(queue.peek()).toBe('A');
   });
 
-  // Add more test cases for other methods of LinkedListQueue.
+  // Add more test cases for other methods of SkipQueue.
 });
 
 describe('Queue Performance Test', () => {
@@ -228,16 +228,16 @@ describe('Queue Performance Test', () => {
     expect(performance.now() - startTime2).toBeLessThan(bigO.CUBED * 100);
   });
 
-  it('should numeric LinkedListQueue be efficient', function () {
+  it('should numeric SkipQueue be efficient', function () {
     const startTime = performance.now();
-    const queue = new LinkedListQueue<number>();
+    const queue = new SkipQueue<number>();
     for (let i = 0; i < dataSize; i++) {
       queue.enqueue(i);
     }
     for (let i = 0; i < dataSize; i++) {
       queue.dequeue();
     }
-    console.log(`LinkedListQueue Performance Test: ${performance.now() - startTime} ms`);
+    console.log(`SkipQueue Performance Test: ${performance.now() - startTime} ms`);
     expect(performance.now() - startTime).toBeLessThan(bigO.LINEAR * 100);
   });
 });