data-structure-typed 1.19.1 → 1.19.3

package/dist/data-structures/heap/heap.d.ts

@@ -8,6 +8,13 @@
 import { PriorityQueue } from '../priority-queue';
 import type { HeapOptions } from '../types';
 export declare class HeapItem<T = number> {
+    /**
+     * The constructor function initializes an instance of a class with a priority and a value.
+     * @param {number} priority - The `priority` parameter is a number that represents the priority of the value. It is
+     * optional and has a default value of `NaN`.
+     * @param {T | null} [val=null] - The `val` parameter is of type `T | null`, which means it can accept a value of type
+     * `T` or `null`.
+     */
     constructor(priority?: number, val?: T | null);
     private _priority;
     get priority(): number;
@@ -25,8 +32,8 @@ export declare abstract class Heap<T = number> {
     protected constructor(options?: HeapOptions<T>);
     protected abstract _pq: PriorityQueue<HeapItem<T>>;
     get pq(): PriorityQueue<HeapItem<T>>;
-    protected _priorityCb: (val: T) => number;
-    get priorityCb(): (val: T) => number;
+    protected _priorityExtractor: (val: T) => number;
+    get priorityExtractor(): (val: T) => number;
     /**
      * The function returns the size of a priority queue.
      * @returns The size of the priority queue.

package/dist/data-structures/heap/heap.js

@@ -2,6 +2,13 @@
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.Heap = exports.HeapItem = void 0;
 var HeapItem = /** @class */ (function () {
+    /**
+     * The constructor function initializes an instance of a class with a priority and a value.
+     * @param {number} priority - The `priority` parameter is a number that represents the priority of the value. It is
+     * optional and has a default value of `NaN`.
+     * @param {T | null} [val=null] - The `val` parameter is of type `T | null`, which means it can accept a value of type
+     * `T` or `null`.
+     */
     function HeapItem(priority, val) {
         if (priority === void 0) { priority = NaN; }
         if (val === void 0) { val = null; }
@@ -39,14 +46,14 @@ var Heap = /** @class */ (function () {
      */
     function Heap(options) {
         if (options) {
-            var priority = options.priority;
-            if (priority !== undefined && typeof priority !== 'function') {
+            var priorityExtractor = options.priorityExtractor;
+            if (priorityExtractor !== undefined && typeof priorityExtractor !== 'function') {
                 throw new Error('.constructor expects a valid priority function');
             }
-            this._priorityCb = priority || (function (el) { return +el; });
+            this._priorityExtractor = priorityExtractor || (function (el) { return +el; });
         }
         else {
-            this._priorityCb = function (el) { return +el; };
+            this._priorityExtractor = function (el) { return +el; };
         }
     }
     Object.defineProperty(Heap.prototype, "pq", {
@@ -56,9 +63,9 @@ var Heap = /** @class */ (function () {
         enumerable: false,
         configurable: true
     });
-    Object.defineProperty(Heap.prototype, "priorityCb", {
+    Object.defineProperty(Heap.prototype, "priorityExtractor", {
         get: function () {
-            return this._priorityCb;
+            return this._priorityExtractor;
         },
         enumerable: false,
         configurable: true
@@ -117,11 +124,11 @@ var Heap = /** @class */ (function () {
         if (priority && Number.isNaN(+priority)) {
             throw new Error('.add expects a numeric priority');
         }
-        if (Number.isNaN(+priority) && Number.isNaN(this._priorityCb(val))) {
+        if (Number.isNaN(+priority) && Number.isNaN(this._priorityExtractor(val))) {
             throw new Error('.add expects a numeric priority '
                 + 'or a constructor callback that returns a number');
         }
-        var _priority = !Number.isNaN(+priority) ? priority : this._priorityCb(val);
+        var _priority = !Number.isNaN(+priority) ? priority : this._priorityExtractor(val);
         this._pq.add(new HeapItem(_priority, val));
         return this;
     };

package/dist/data-structures/interfaces/index.d.ts

@@ -1,13 +1,15 @@
 export * from './abstract-binary-tree';
-export * from './bst';
-export * from './avl-tree';
-export * from './segment-tree';
-export * from './tree-multiset';
 export * from './abstract-graph';
+export * from './avl-tree';
+export * from './binary-tree';
+export * from './bst';
 export * from './directed-graph';
-export * from './undirected-graph';
-export * from './priority-queue';
-export * from './heap';
-export * from './singly-linked-list';
 export * from './doubly-linked-list';
+export * from './heap';
 export * from './navigator';
+export * from './priority-queue';
+export * from './rb-tree';
+export * from './segment-tree';
+export * from './singly-linked-list';
+export * from './tree-multiset';
+export * from './undirected-graph';

package/dist/data-structures/interfaces/index.js

@@ -15,15 +15,17 @@ var __exportStar = (this && this.__exportStar) || function(m, exports) {
 };
 Object.defineProperty(exports, "__esModule", { value: true });
 __exportStar(require("./abstract-binary-tree"), exports);
-__exportStar(require("./bst"), exports);
-__exportStar(require("./avl-tree"), exports);
-__exportStar(require("./segment-tree"), exports);
-__exportStar(require("./tree-multiset"), exports);
 __exportStar(require("./abstract-graph"), exports);
+__exportStar(require("./avl-tree"), exports);
+__exportStar(require("./binary-tree"), exports);
+__exportStar(require("./bst"), exports);
 __exportStar(require("./directed-graph"), exports);
-__exportStar(require("./undirected-graph"), exports);
-__exportStar(require("./priority-queue"), exports);
-__exportStar(require("./heap"), exports);
-__exportStar(require("./singly-linked-list"), exports);
 __exportStar(require("./doubly-linked-list"), exports);
+__exportStar(require("./heap"), exports);
 __exportStar(require("./navigator"), exports);
+__exportStar(require("./priority-queue"), exports);
+__exportStar(require("./rb-tree"), exports);
+__exportStar(require("./segment-tree"), exports);
+__exportStar(require("./singly-linked-list"), exports);
+__exportStar(require("./tree-multiset"), exports);
+__exportStar(require("./undirected-graph"), exports);

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

@@ -1,3 +1,3 @@
 export type HeapOptions<T> = {
-    priority?: (element: T) => number;
+    priorityExtractor?: (element: T) => number;
 };

package/dist/index.d.ts

@@ -1 +1,2 @@
 export * from './data-structures';
+export * from './utils';

package/dist/index.js

@@ -15,3 +15,4 @@ var __exportStar = (this && this.__exportStar) || function(m, exports) {
 };
 Object.defineProperty(exports, "__esModule", { value: true });
 __exportStar(require("./data-structures"), exports);
+__exportStar(require("./utils"), exports);

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "data-structure-typed",
-  "version": "1.19.1",
+  "version": "1.19.3",
   "description": "Javascript & TypeScript Data Structure Library, meticulously crafted to empower developers with a versatile set of essential data structures. Our library includes a wide range of data structures, such as Binary Tree, AVL Tree, Binary Search Tree (BST), Tree Multiset, Segment Tree, Binary Indexed Tree, Graph, Directed Graph, Undirected Graph, Singly Linked List, Hash, CoordinateSet, CoordinateMap, Heap, Doubly Linked List, Priority Queue, Max Priority Queue, Min Priority Queue, Queue, ObjectDeque, ArrayDeque, Stack, and Trie. Each data structure is thoughtfully designed and implemented using TypeScript to provide efficient, reliable, and easy-to-use solutions for your programming needs. Whether you're optimizing algorithms, managing data, or enhancing performance, our TypeScript Data Structure Library is your go-to resource. Elevate your coding experience with these fundamental building blocks for software development.",
   "main": "dist/index.js",
   "scripts": {