data-structure-typed 1.20.0 → 1.21.1

package/dist/data-structures/graph/map-graph.js

@@ -0,0 +1,111 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.MapGraph = exports.MapEdge = exports.MapVertex = void 0;
+const directed_graph_1 = require("./directed-graph");
+class MapVertex extends directed_graph_1.DirectedVertex {
+    /**
+     * The constructor function initializes an object with an id, latitude, longitude, and an optional value.
+     * @param {VertexId} id - The `id` parameter is of type `VertexId` and represents the identifier of the vertex.
+     * @param {number} lat - The "lat" parameter represents the latitude of a vertex. Latitude is a geographic coordinate
+     * that specifies the north-south position of a point on the Earth's surface. It is measured in degrees, with positive
+     * values representing points north of the equator and negative values representing points south of the equator.
+     * @param {number} long - The "long" parameter represents the longitude of a location. Longitude is a geographic
+     * coordinate that specifies the east-west position of a point on the Earth's surface. It is measured in degrees, with
+     * values ranging from -180 to 180.
+     * @param {T} [val] - The "val" parameter is an optional value of type T. It is not required to be provided when
+     * creating an instance of the class.
+     */
+    constructor(id, lat, long, val) {
+        super(id, val);
+        this._lat = lat;
+        this._long = long;
+    }
+    get lat() {
+        return this._lat;
+    }
+    set lat(value) {
+        this._lat = value;
+    }
+    get long() {
+        return this._long;
+    }
+    set long(value) {
+        this._long = value;
+    }
+}
+exports.MapVertex = MapVertex;
+class MapEdge extends directed_graph_1.DirectedEdge {
+    /**
+     * The constructor function initializes a new instance of a class with the given source, destination, weight, and
+     * value.
+     * @param {VertexId} src - The `src` parameter is the source vertex ID. It represents the starting point of an edge in
+     * a graph.
+     * @param {VertexId} dest - The `dest` parameter is the identifier of the destination vertex for an edge.
+     * @param {number} [weight] - The weight parameter is an optional number that represents the weight of the edge.
+     * @param {T} [val] - The "val" parameter is an optional parameter of type T. It is used to store additional
+     * information or data associated with the edge.
+     */
+    constructor(src, dest, weight, val) {
+        super(src, dest, weight, val);
+    }
+}
+exports.MapEdge = MapEdge;
+class MapGraph extends directed_graph_1.DirectedGraph {
+    /**
+     * The constructor function initializes the origin and bottomRight properties of a MapGraphCoordinate object.
+     * @param {MapGraphCoordinate} origin - The `origin` parameter is a `MapGraphCoordinate` object that represents the
+     * starting point or reference point of the map graph. It defines the coordinates of the top-left corner of the map
+     * graph.
+     * @param {MapGraphCoordinate} [bottomRight] - The `bottomRight` parameter is an optional parameter of type
+     * `MapGraphCoordinate`. It represents the bottom right coordinate of a map graph. If this parameter is not provided,
+     * it will default to `undefined`.
+     */
+    constructor(origin, bottomRight) {
+        super();
+        this._origin = [0, 0];
+        this._origin = origin;
+        this._bottomRight = bottomRight;
+    }
+    get origin() {
+        return this._origin;
+    }
+    set origin(value) {
+        this._origin = value;
+    }
+    get bottomRight() {
+        return this._bottomRight;
+    }
+    set bottomRight(value) {
+        this._bottomRight = value;
+    }
+    /**
+     * The function creates a new vertex with the given id, value, latitude, and longitude.
+     * @param {VertexId} id - The id parameter is the unique identifier for the vertex. It is of type VertexId, which could
+     * be a string or a number depending on how you define it in your code.
+     * @param [val] - The `val` parameter is an optional value that can be assigned to the `val` property of the vertex. It
+     * is of type `V['val']`, which means it should be of the same type as the `val` property of the vertex class `V`.
+     * @param {number} lat - The `lat` parameter represents the latitude of the vertex. It is a number that specifies the
+     * position of the vertex on the Earth's surface in the north-south direction.
+     * @param {number} long - The `long` parameter represents the longitude coordinate of the vertex.
+     * @returns The method is returning a new instance of the `MapVertex` class, casted as type `V`.
+     */
+    createVertex(id, val, lat = this.origin[0], long = this.origin[1]) {
+        return new MapVertex(id, lat, long, val);
+    }
+    /**
+     * The function creates a new instance of a MapEdge with the given source, destination, weight, and value.
+     * @param {VertexId} src - The source vertex ID of the edge. It represents the starting point of the edge.
+     * @param {VertexId} dest - The `dest` parameter is the identifier of the destination vertex for the edge being
+     * created.
+     * @param {number} [weight] - The `weight` parameter is an optional number that represents the weight of the edge. It
+     * is used to assign a numerical value to the edge, which can be used in algorithms such as shortest path algorithms.
+     * If the weight is not provided, it can be set to a default value or left undefined.
+     * @param [val] - The `val` parameter is an optional value that can be assigned to the edge. It can be of any type,
+     * depending on the specific implementation of the `MapEdge` class.
+     * @returns a new instance of the `MapEdge` class, casted as type `E`.
+     */
+    createEdge(src, dest, weight, val) {
+        return new MapEdge(src, dest, weight, val);
+    }
+}
+exports.MapGraph = MapGraph;

package/dist/data-structures/interfaces/abstract-binary-tree.d.ts

@@ -22,14 +22,12 @@ export interface IAbstractBinaryTree<N extends AbstractBinaryTreeNode<N['val'],
     get visitedVal(): Array<N['val']>;
     get visitedNode(): N[];
     get visitedLeftSum(): number[];
-    get isMergeDuplicatedNodeById(): boolean;
     get root(): N | null;
     get size(): number;
     swapLocation(srcNode: N, destNode: N): N;
     clear(): void;
     isEmpty(): boolean;
     add(id: BinaryTreeNodeId | N, val?: N['val']): N | null | undefined;
-    addTo(newNode: N | null, parent: N): N | null | undefined;
     addMany(idsOrNodes: (BinaryTreeNodeId | N | null)[], data?: N['val'][]): (N | null | undefined)[];
     fill(idsOrNodes: (BinaryTreeNodeId | N | null)[], data?: N[] | Array<N['val']>): boolean;
     remove(id: BinaryTreeNodeId, ignoreCount?: boolean): BinaryTreeDeletedResult<N>[];

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

@@ -1,4 +1,4 @@
-export declare class TreeNode<T = number> {
+export declare class TreeNode<T = any> {
     constructor(id: string, value?: T, children?: TreeNode<T>[]);
     private _id;
     get id(): string;

package/dist/data-structures/types/abstract-binary-tree.d.ts

@@ -31,5 +31,4 @@ export type AbstractBinaryTreeNodeProperties<N extends AbstractBinaryTreeNode<N[
 export type AbstractBinaryTreeNodeNested<T> = AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, any>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>;
 export type AbstractBinaryTreeOptions = {
     loopType?: LoopType;
-    isMergeDuplicatedNodeById?: boolean;
 };

package/dist/data-structures/types/abstract-graph.d.ts

@@ -2,6 +2,7 @@ export type VertexId = string | number;
 export type EdgeId = string;
 export type DijkstraResult<V> = {
     distMap: Map<V, number>;
+    distPaths?: Map<V, V[]>;
     preMap: Map<V, V | null>;
     seen: Set<V>;
     paths: V[][];

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

@@ -4,6 +4,7 @@ export * from './avl-tree';
 export * from './segment-tree';
 export * from './tree-multiset';
 export * from './abstract-graph';
+export * from './map-graph';
 export * from './abstract-binary-tree';
 export * from './rb-tree';
 export * from './directed-graph';

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

@@ -20,6 +20,7 @@ __exportStar(require("./avl-tree"), exports);
 __exportStar(require("./segment-tree"), exports);
 __exportStar(require("./tree-multiset"), exports);
 __exportStar(require("./abstract-graph"), exports);
+__exportStar(require("./map-graph"), exports);
 __exportStar(require("./abstract-binary-tree"), exports);
 __exportStar(require("./rb-tree"), exports);
 __exportStar(require("./directed-graph"), exports);

package/dist/data-structures/types/map-graph.d.ts

@@ -0,0 +1 @@
+export type MapGraphCoordinate = [number, number];

package/dist/data-structures/types/map-graph.js

@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });

package/dist/data-structures/types/tree-multiset.d.ts

@@ -1,6 +1,4 @@
 import { TreeMultisetNode } from '../binary-tree';
 import { AVLTreeOptions } from './avl-tree';
 export type TreeMultisetNodeNested<T> = TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, any>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>;
-export type TreeMultisetOptions = Omit<AVLTreeOptions, 'isMergeDuplicatedNodeById'> & {
-    isMergeDuplicatedNodeById: true;
-};
+export type TreeMultisetOptions = Omit<AVLTreeOptions, 'isMergeDuplicatedNodeById'> & {};

package/package.json

@@ -1,8 +1,9 @@
 {
   "name": "data-structure-typed",
-  "version": "1.20.0",
+  "version": "1.21.1",
   "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",
+  "module": "dist/my-library.js",
   "scripts": {
     "build": "rm -rf dist && npx tsc",
     "test": "jest",
@@ -59,30 +60,30 @@
   "devDependencies": {
     "@types/jest": "^29.5.3",
     "@types/node": "^20.4.9",
-    "avl-tree-typed": "^1.19.7",
-    "binary-tree-typed": "^1.19.7",
-    "bst-typed": "^1.19.7",
+    "avl-tree-typed": "^1.21.0",
+    "binary-tree-typed": "^1.21.0",
+    "bst-typed": "^1.21.0",
     "dependency-cruiser": "^13.1.2",
-    "deque-typed": "^1.19.7",
-    "directed-graph-typed": "^1.19.7",
-    "doubly-linked-list-typed": "^1.19.7",
-    "graph-typed": "^1.19.7",
-    "heap-typed": "^1.19.7",
+    "deque-typed": "^1.21.0",
+    "directed-graph-typed": "^1.21.0",
+    "doubly-linked-list-typed": "^1.21.0",
+    "graph-typed": "^1.21.0",
+    "heap-typed": "^1.21.0",
     "jest": "^29.6.2",
-    "linked-list-typed": "^1.19.7",
-    "max-heap-typed": "^1.19.7",
-    "max-priority-queue-typed": "^1.19.7",
-    "min-heap-typed": "^1.19.7",
-    "min-priority-queue-typed": "^1.19.7",
-    "priority-queue-typed": "^1.19.7",
-    "singly-linked-list-typed": "^1.19.7",
-    "stack-typed": "^1.19.7",
-    "tree-multiset-typed": "^1.19.7",
-    "trie-typed": "^1.19.7",
+    "linked-list-typed": "^1.21.0",
+    "max-heap-typed": "^1.21.0",
+    "max-priority-queue-typed": "^1.21.0",
+    "min-heap-typed": "^1.21.0",
+    "min-priority-queue-typed": "^1.21.0",
+    "priority-queue-typed": "^1.21.0",
+    "singly-linked-list-typed": "^1.21.0",
+    "stack-typed": "^1.21.0",
+    "tree-multiset-typed": "^1.21.0",
+    "trie-typed": "^1.21.0",
     "ts-jest": "^29.1.1",
     "typedoc": "^0.24.8",
     "typescript": "^4.9.5",
-    "undirected-graph-typed": "^1.19.7"
+    "undirected-graph-typed": "^1.21.0"
   },
   "dependencies": {
     "zod": "^3.22.2"

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

@@ -1,3 +0,0 @@
-export class AaTree {
-
-}