data-structure-typed 1.21.3 → 1.31.0

package/lib/interfaces/index.js

@@ -0,0 +1,15 @@
+export * from './abstract-binary-tree';
+export * from './abstract-graph';
+export * from './avl-tree';
+export * from './binary-tree';
+export * from './bst';
+export * from './directed-graph';
+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/lib/interfaces/navigator.d.ts

@@ -0,0 +1 @@
+export {};

package/lib/interfaces/navigator.js

@@ -0,0 +1 @@
+export {};

package/lib/interfaces/priority-queue.d.ts

@@ -0,0 +1 @@
+export {};

package/lib/interfaces/priority-queue.js

@@ -0,0 +1 @@
+export {};

package/{dist → lib}/interfaces/rb-tree.d.ts

@@ -1,8 +1,7 @@
 import { RBTreeNode } from '../data-structures';
 import { IBST, IBSTNode } from './bst';
 import { BinaryTreeNodeId } from '../types';
-export interface IRBTreeNode<T, NEIGHBOR extends IRBTreeNode<T, NEIGHBOR>> extends IBSTNode<T, NEIGHBOR> {
-}
+export type IRBTreeNode<T, NEIGHBOR extends IRBTreeNode<T, NEIGHBOR>> = IBSTNode<T, NEIGHBOR>;
 export interface IRBTree<N extends RBTreeNode<N['val'], N>> extends IBST<N> {
     createNode(id: BinaryTreeNodeId, val?: N['val'], count?: number): N;
 }

package/lib/interfaces/rb-tree.js

@@ -0,0 +1 @@
+export {};

package/lib/interfaces/segment-tree.d.ts

@@ -0,0 +1 @@
+export {};

package/lib/interfaces/segment-tree.js

@@ -0,0 +1 @@
+export {};

package/lib/interfaces/singly-linked-list.d.ts

@@ -0,0 +1 @@
+export {};

package/lib/interfaces/singly-linked-list.js

@@ -0,0 +1 @@
+export {};

package/lib/interfaces/tree-multiset.d.ts

@@ -0,0 +1,5 @@
+import { TreeMultisetNode } from '../data-structures';
+import { IBSTNode } from './bst';
+import { IAVLTree } from './avl-tree';
+export type ITreeMultisetNode<T, NEIGHBOR extends ITreeMultisetNode<T, NEIGHBOR>> = IBSTNode<T, NEIGHBOR>;
+export type ITreeMultiset<N extends TreeMultisetNode<N['val'], N>> = IAVLTree<N>;

package/lib/interfaces/tree-multiset.js

@@ -0,0 +1 @@
+export {};

package/lib/interfaces/undirected-graph.js

@@ -0,0 +1 @@
+export {};

package/{dist → lib}/types/data-structures/abstract-binary-tree.d.ts

@@ -1,4 +1,4 @@
-import { AbstractBinaryTreeNode } from '../../data-structures/binary-tree';
+import { AbstractBinaryTreeNode } from '../../data-structures';
 /**
  * Enum representing different loop types.
  *

package/lib/types/data-structures/abstract-binary-tree.js

@@ -0,0 +1,22 @@
+/**
+ * Enum representing different loop types.
+ *
+ * - `iterative`: Indicates the iterative loop type (with loops that use iterations).
+ * - `recursive`: Indicates the recursive loop type (with loops that call themselves).
+ */
+export var LoopType;
+(function (LoopType) {
+    LoopType["ITERATIVE"] = "ITERATIVE";
+    LoopType["RECURSIVE"] = "RECURSIVE";
+})(LoopType || (LoopType = {}));
+/* This enumeration defines the position of a node within a family tree composed of three associated nodes, where 'root' represents the root node of the family tree, 'left' represents the left child node, and 'right' represents the right child node. */
+export var FamilyPosition;
+(function (FamilyPosition) {
+    FamilyPosition["ROOT"] = "ROOT";
+    FamilyPosition["LEFT"] = "LEFT";
+    FamilyPosition["RIGHT"] = "RIGHT";
+    FamilyPosition["ROOT_LEFT"] = "ROOT_LEFT";
+    FamilyPosition["ROOT_RIGHT"] = "ROOT_RIGHT";
+    FamilyPosition["ISOLATED"] = "ISOLATED";
+    FamilyPosition["MAL_NODE"] = "MAL_NODE";
+})(FamilyPosition || (FamilyPosition = {}));

package/lib/types/data-structures/abstract-graph.js

@@ -0,0 +1 @@
+export {};

package/{dist → lib}/types/data-structures/avl-tree.d.ts

@@ -1,4 +1,4 @@
-import { AVLTreeNode } from '../../data-structures/binary-tree';
+import { AVLTreeNode } from '../../data-structures';
 import { BSTOptions } from './bst';
 export type AVLTreeNodeNested<T> = AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, any>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>;
 export type AVLTreeOptions = BSTOptions & {};

package/lib/types/data-structures/avl-tree.js

@@ -0,0 +1 @@
+export {};

package/lib/types/data-structures/binary-tree.js

@@ -0,0 +1 @@
+export {};

package/lib/types/data-structures/bst.js

@@ -0,0 +1,6 @@
+export var CP;
+(function (CP) {
+    CP["lt"] = "lt";
+    CP["eq"] = "eq";
+    CP["gt"] = "gt";
+})(CP || (CP = {}));

package/lib/types/data-structures/directed-graph.js

@@ -0,0 +1,6 @@
+export var TopologicalProperty;
+(function (TopologicalProperty) {
+    TopologicalProperty["VAL"] = "VAL";
+    TopologicalProperty["NODE"] = "NODE";
+    TopologicalProperty["ID"] = "ID";
+})(TopologicalProperty || (TopologicalProperty = {}));

package/lib/types/data-structures/doubly-linked-list.d.ts

@@ -0,0 +1 @@
+export {};

package/lib/types/data-structures/doubly-linked-list.js

@@ -0,0 +1 @@
+export {};

package/lib/types/data-structures/heap.js

@@ -0,0 +1 @@
+export {};

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

@@ -0,0 +1,15 @@
+export * from './binary-tree';
+export * from './bst';
+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';
+export * from './priority-queue';
+export * from './heap';
+export * from './singly-linked-list';
+export * from './doubly-linked-list';
+export * from './navigator';

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

@@ -0,0 +1 @@
+export {};

package/lib/types/data-structures/navigator.js

@@ -0,0 +1 @@
+export {};

package/lib/types/data-structures/priority-queue.js

@@ -0,0 +1 @@
+export {};

package/lib/types/data-structures/rb-tree.js

@@ -0,0 +1,5 @@
+export var RBColor;
+(function (RBColor) {
+    RBColor["RED"] = "RED";
+    RBColor["BLACK"] = "BLACK";
+})(RBColor || (RBColor = {}));

package/lib/types/data-structures/segment-tree.js

@@ -0,0 +1 @@
+export {};

package/lib/types/data-structures/singly-linked-list.d.ts

@@ -0,0 +1 @@
+export {};

package/lib/types/data-structures/singly-linked-list.js

@@ -0,0 +1 @@
+export {};

package/lib/types/data-structures/tree-multiset.js

@@ -0,0 +1 @@
+export {};

package/lib/types/helpers.d.ts

@@ -0,0 +1 @@
+export {};

package/lib/types/helpers.js

@@ -0,0 +1 @@
+export {};

package/lib/types/index.js

@@ -0,0 +1,3 @@
+export * from './data-structures';
+export * from './helpers';
+export * from './utils';

package/lib/types/utils/index.js

@@ -0,0 +1,2 @@
+export * from './utils';
+export * from './validate-type';

package/{dist → lib}/types/utils/utils.d.ts

@@ -1,6 +1,6 @@
 export type ToThunkFn = () => ReturnType<TrlFn>;
 export type Thunk = () => ReturnType<ToThunkFn> & {
-    __THUNK__: Symbol;
+    __THUNK__: symbol;
 };
 export type TrlFn = (...args: any[]) => any;
 export type TrlAsyncFn = (...args: any[]) => any;

package/lib/types/utils/utils.js

@@ -0,0 +1 @@
+export {};

package/{dist → lib}/types/utils/validate-type.d.ts

@@ -16,4 +16,4 @@ export type ObjectWithNumberId = {
     id: number;
 };
 export type RestrictValById = NonNumberNonObjectButDefined | ObjectWithoutId | ObjectWithNonNumberId | ObjectWithNumberId;
-export type DummyAny = string | number | boolean | null | undefined | object | symbol | void | Function | never;
+export type DummyAny = string | number | boolean | null | undefined | object | symbol | void | ((...args: []) => any) | never;

package/lib/types/utils/validate-type.js

@@ -0,0 +1 @@
+export {};

package/lib/utils/index.js

@@ -0,0 +1 @@
+export * from './utils';

package/lib/utils/utils.js

@@ -0,0 +1,57 @@
+var __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {
+    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }
+    return new (P || (P = Promise))(function (resolve, reject) {
+        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
+        function rejected(value) { try { step(generator["throw"](value)); } catch (e) { reject(e); } }
+        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }
+        step((generator = generator.apply(thisArg, _arguments || [])).next());
+    });
+};
+export const uuidV4 = function () {
+    return 'xxxxxxxx-xxxx-xxxx-xxxx-xxxxxxxxxxxx'.replace(/[x]/g, function (c) {
+        const r = (Math.random() * 16) | 0, v = c == 'x' ? r : (r & 0x3) | 0x8;
+        return v.toString(16);
+    });
+};
+export const arrayRemove = function (array, predicate) {
+    let i = -1, len = array ? array.length : 0;
+    const result = [];
+    while (++i < len) {
+        const value = array[i];
+        if (predicate(value, i, array)) {
+            result.push(value);
+            Array.prototype.splice.call(array, i--, 1);
+            len--;
+        }
+    }
+    return result;
+};
+export const THUNK_SYMBOL = Symbol('thunk');
+export const isThunk = (fnOrValue) => {
+    return typeof fnOrValue === 'function' && fnOrValue.__THUNK__ === THUNK_SYMBOL;
+};
+export const toThunk = (fn) => {
+    const thunk = () => fn();
+    thunk.__THUNK__ = THUNK_SYMBOL;
+    return thunk;
+};
+export const trampoline = (fn) => {
+    const cont = (...args) => toThunk(() => fn(...args));
+    return Object.assign((...args) => {
+        let result = fn(...args);
+        while (isThunk(result) && typeof result === 'function') {
+            result = result();
+        }
+        return result;
+    }, { cont });
+};
+export const trampolineAsync = (fn) => {
+    const cont = (...args) => toThunk(() => fn(...args));
+    return Object.assign((...args) => __awaiter(void 0, void 0, void 0, function* () {
+        let result = yield fn(...args);
+        while (isThunk(result) && typeof result === 'function') {
+            result = yield result();
+        }
+        return result;
+    }), { cont });
+};

package/package.json

@@ -1,56 +1,137 @@
 {
   "name": "data-structure-typed",
-  "version": "1.21.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.",
+  "version": "1.31.0",
+  "description": "Data Structures of Javascript & TypeScript. AVLTree, Binary Search Tree, Binary Tree, Tree Multiset, Graph, Heap, Priority Queue, Linked List.",
   "main": "dist/index.js",
-  "module": "dist/index.js",
-  "types": "dist/index.d.ts",
+  "module": "lib/index.js",
+  "types": "lib/index.d.ts",
+  "umd:main": "umd/bundle.min.js",
+  "source": "src/index.ts",
   "scripts": {
-    "build": "rm -rf dist && npx tsc && npm run build:browser",
-    "build:browser": "webpack",
+    "build": "npm run build:es6 && npm run build:commonjs && npm run build:umd",
+    "build:es6": "rm -rf lib && tsc",
+    "build:commonjs": "rm -rf dist && tsc --project tsconfig.build.json",
+    "build:umd": "webpack",
     "build:docs": "typedoc --out docs ./src",
+    "lint": "eslint --fix \"src/**/*.{js,jsx,ts,tsx}\"",
+    "format": "prettier --write \"src/**/*.{js,jsx,ts,tsx}\"",
+    "update:test-deps": "npm i avl-tree-typed binary-tree-typed bst-typed deque-typed directed-graph-typed doubly-linked-list-typed graph-typed heap-typed linked-list-typed max-heap-typed max-priority-queue-typed min-heap-typed min-priority-queue-typed priority-queue-typed singly-linked-list-typed stack-typed tree-multiset-typed trie-typed undirected-graph-typed queue-typed --save-dev",
     "test": "jest",
-    "update:test-deps": "npm i avl-tree-typed binary-tree-typed bst-typed deque-typed directed-graph-typed doubly-linked-list-typed graph-typed heap-typed linked-list-typed max-heap-typed max-priority-queue-typed min-heap-typed min-priority-queue-typed priority-queue-typed singly-linked-list-typed stack-typed tree-multiset-typed trie-typed undirected-graph-typed --save-dev",
     "deps:check": "dependency-cruiser src",
-    "build:publish": "npm run test && npm run build && npm run build:docs && npm publish"
+    "changelog": "auto-changelog",
+    "build:publish": "npm run test && npm run build && npm run build:docs && npm run changelog && npm publish"
   },
   "repository": {
     "type": "git",
     "url": "git+https://github.com/zrwusa/data-structure-typed.git"
   },
   "keywords": [
-    "Binary Tree",
-    "Binary Search Tree (BST)",
-    "AVL Tree",
-    "Tree Multiset",
-    "Segment Tree",
-    "Binary Indexed Tree",
-    "Graph",
-    "Directed Graph",
-    "Undirected Graph",
-    "Linked List",
-    "Singly Linked List",
-    "Doubly Linked List",
-    "Queue",
-    "Object Deque",
-    "Array Deque",
-    "Stack",
-    "Hash",
-    "Coordinate Set",
-    "Coordinate Map",
-    "Heap",
-    "Priority Queue",
-    "Max Priority Queue",
-    "Min Priority Queue",
-    "Trie",
+    "data",
+    "structure",
+    "structures",
+    "data structure",
+    "data-structure",
+    "data structures",
+    "data-structures",
+    "binary",
+    "depth",
+    "breadth",
+    "first",
+    "search",
+    "index",
+    "avl",
+    "segment",
+    "prefix",
+    "tree",
+    "multiset",
+    "directed",
+    "undirected",
+    "graph",
+    "min",
+    "max",
+    "heap",
+    "priority",
+    "queue",
+    "singly",
+    "doubly",
+    "linked",
+    "list",
+    "js",
+    "ts",
+    "javascript",
+    "typscript",
+    "sort",
+    "algorithm",
+    "binary search tree",
+    "binary-search-tree",
+    "binary tree",
+    "binary-tree",
+    "bst",
+    "BST",
+    "avl tree",
+    "avl-tree",
+    "tree multiset",
+    "tree-multiset",
+    "binary indexed tree",
+    "binary-indexed-tree",
+    "segment tree",
+    "segment-tree",
+    "trie",
+    "prefix tree",
+    "prefix-tree",
+    "dfs",
     "DFS",
-    "DFSIterative",
+    "depth first Search",
+    "depth-first-Search",
+    "bfs",
     "BFS",
+    "breadth first search",
+    "dfs iterative",
+    "DFS Iterative",
+    "recursive",
+    "iterative",
+    "directed graph",
+    "directed-graph",
+    "undirected graph",
+    "undirected-graph",
+    "min heap",
+    "min-heap",
+    "max heap",
+    "max-heap",
+    "priority queue",
+    "priority-queue",
+    "max priority queue",
+    "max-priority-queue",
+    "min priority queue",
+    "min-priority-queue",
+    "array queue",
+    "array-queue",
+    "stack",
+    "hash",
+    "deque",
+    "object deque",
+    "array deque",
+    "linked list",
+    "linked-list",
+    "singly linked list",
+    "singly-linked-list",
+    "doubly linked list",
+    "doubly-linked-list",
     "morris",
-    "Bellman-Ford ",
-    "Dijkstra's Algorithm",
-    "Floyd-Warshall Algorithm",
-    "Tarjan's Algorithm"
+    "Morris",
+    "bellman ford",
+    "Bellman Ford",
+    "bellman-ford",
+    "dijkstra",
+    "Dijkstra",
+    "floyd warshall",
+    "Floyd Warshall",
+    "floyd-warshall",
+    "tarjan",
+    "Tarjan",
+    "Tarjan's",
+    "DataStructure",
+    "DataStructures"
   ],
   "author": "Tyler Zeng zrwusa@gmail.com",
   "license": "MIT",
@@ -61,31 +142,41 @@
   "devDependencies": {
     "@types/jest": "^29.5.3",
     "@types/node": "^20.4.9",
-    "avl-tree-typed": "^1.21.2",
-    "binary-tree-typed": "^1.21.2",
-    "bst-typed": "^1.21.2",
+    "@typescript-eslint/eslint-plugin": "^5.6.0",
+    "@typescript-eslint/parser": "^5.11.0",
+    "auto-changelog": "^2.4.0",
+    "avl-tree-typed": "^1.3.3",
+    "binary-tree-typed": "^1.3.3",
+    "bst-typed": "^1.3.3",
     "dependency-cruiser": "^13.1.2",
-    "deque-typed": "^1.21.2",
-    "directed-graph-typed": "^1.21.2",
-    "doubly-linked-list-typed": "^1.21.2",
-    "graph-typed": "^1.21.2",
-    "heap-typed": "^1.21.2",
+    "deque-typed": "^1.3.3",
+    "directed-graph-typed": "^1.3.3",
+    "doubly-linked-list-typed": "^1.3.3",
+    "eslint": "^7.32.0",
+    "eslint-config-prettier": "^8.3.0",
+    "eslint-import-resolver-alias": "^1.1.2",
+    "eslint-import-resolver-typescript": "^2.5.0",
+    "eslint-plugin-import": "^2.25.4",
+    "graph-typed": "^1.3.3",
+    "heap-typed": "^1.3.3",
     "jest": "^29.6.2",
-    "linked-list-typed": "^1.21.2",
-    "max-heap-typed": "^1.21.2",
-    "max-priority-queue-typed": "^1.21.2",
-    "min-heap-typed": "^1.21.2",
-    "min-priority-queue-typed": "^1.21.2",
-    "priority-queue-typed": "^1.21.2",
-    "singly-linked-list-typed": "^1.21.2",
-    "stack-typed": "^1.21.2",
-    "tree-multiset-typed": "^1.21.2",
-    "trie-typed": "^1.21.2",
+    "linked-list-typed": "^1.3.3",
+    "max-heap-typed": "^1.3.3",
+    "max-priority-queue-typed": "^1.3.3",
+    "min-heap-typed": "^1.3.3",
+    "min-priority-queue-typed": "^1.3.3",
+    "prettier": "^3.0.3",
+    "priority-queue-typed": "^1.3.3",
+    "queue-typed": "^1.3.3",
+    "singly-linked-list-typed": "^1.3.3",
+    "stack-typed": "^1.3.3",
+    "tree-multiset-typed": "^1.3.3",
+    "trie-typed": "^1.3.3",
     "ts-jest": "^29.1.1",
     "ts-loader": "^9.4.4",
     "typedoc": "^0.24.8",
     "typescript": "^4.9.5",
-    "undirected-graph-typed": "^1.21.2",
+    "undirected-graph-typed": "^1.3.3",
     "webpack": "^5.88.2",
     "webpack-cli": "^5.1.4"
   }

package/rename_clear_files.sh

@@ -0,0 +1,29 @@
+#!/bin/bash
+
+# iterate the directory to rename and clear content of files
+rename_and_clear_files() {
+  local directory="$1"
+  local extension="$2"
+  local new_prefix="$3"
+
+  for file in "$directory"/*; do
+    if [ -d "$file" ]; then
+      rename_and_clear_files "$file" "$extension" "$new_prefix"
+    elif [ -f "$file" ] && [[ "$file" == *"$extension" ]]; then
+      filename=$(basename "$file" "$extension")
+      new_name="$directory/${filename}${new_prefix}${extension}"
+      mv "$file" "$new_name"
+      echo "Renamed $file to $new_name"
+      > "$new_name"  # clear content of file
+    fi
+  done
+}
+
+# check if directory, extension and prefix were provided
+if [ -z "$1" ] || [ -z "$2" ] || [ -z "$3" ]; then
+  echo "Usage: $0 <directory> <extension> <new_prefix>"
+  exit 1
+fi
+
+# evoke the recursive function to rename and clear files
+rename_and_clear_files "$1" "$2" "$3"