data-structure-typed 2.5.3 → 2.6.1

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

@@ -116,7 +116,6 @@ export class Navigator<T = number> {
         this._cur[1]--;
         break;
     }
-
     const [i, j] = this._cur;
     this._matrix[i][j] = this._VISITED;
     if (this.onMove) this.onMove(this._cur);

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

@@ -67,12 +67,7 @@ import { ERR, raise } from '../../common';
  *     while (cpuQueue.size > 0) {
  *       order.push(cpuQueue.poll()![1]);
  *     }
- *     console.log(order); // [
- *  //      'User interaction',
- *  //      'System process',
- *  //      'Network sync',
- *  //      'Background task'
- *  //    ];
+ *     console.log(order); // ['User interaction', 'System process', 'Network sync', 'Background task'];
  */
 export class MaxPriorityQueue<E = any, R = any> extends PriorityQueue<E, R> {
   /**

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

@@ -18,10 +18,10 @@ import { PriorityQueue } from './priority-queue';
  * // Shortest job first scheduling
  *  const jobs = new MinPriorityQueue<number>();
  *
- *     jobs.add(8);  // 8 seconds
- *     jobs.add(2);  // 2 seconds
- *     jobs.add(5);  // 5 seconds
- *     jobs.add(1);  // 1 second
+ *     jobs.add(8); // 8 seconds
+ *     jobs.add(2); // 2 seconds
+ *     jobs.add(5); // 5 seconds
+ *     jobs.add(1); // 1 second
  *
  *     // Shortest job first
  *     console.log(jobs.poll()); // 1;
@@ -48,12 +48,7 @@ import { PriorityQueue } from './priority-queue';
  *     while (timeline.size > 0) {
  *       order.push(timeline.poll()!.action);
  *     }
- *     console.log(order); // [
- *  //      'Request received',
- *  //      'Cache hit',
- *  //      'Processing done',
- *  //      'Timeout'
- *  //    ];
+ *     console.log(order); // ['Request received', 'Cache hit', 'Processing done', 'Timeout'];
  * @example
  * // Huffman coding frequency selection
  *  // Character frequencies for Huffman tree building
@@ -69,7 +64,7 @@ import { PriorityQueue } from './priority-queue';
  *     // Always pick two lowest frequencies
  *     const first = freq.poll()!;
  *     const second = freq.poll()!;
- *     console.log(first[1]); // 'd';  // freq 2
+ *     console.log(first[1]); // 'd'; // freq 2
  *     console.log(second[1]); // 'a'; // freq 5
  *
  *     // Combined node goes back

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

@@ -5,7 +5,6 @@
  * @copyright Copyright (c) 2022 Kirk Qi <qilinaus@gmail.com>
  * @license MIT License
  */
-
 import type { PriorityQueueOptions } from '../../types';
 import { Heap } from '../heap';
 
@@ -62,7 +61,7 @@ import { Heap } from '../heap';
  *       comparator: (a, b) => a[0] - b[0]
  *     });
  *
- *     bandwidth.add([1, 'Video call']);     // highest priority
+ *     bandwidth.add([1, 'Video call']); // highest priority
  *     bandwidth.add([3, 'File download']);
  *     bandwidth.add([2, 'Web browsing']);
  *     bandwidth.add([1, 'Voice call']);