data-structure-typed 0.8.18 → 1.3.0

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

@@ -1,9 +1,15 @@
-export * from './hash';
-export * from './linked-list';
-export * from './stack';
-export * from './queue';
-export * from './graph';
 export * from './binary-tree';
-export * from './heap';
+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 './matrix';
+export * from './heap';
+export * from './singly-linked-list';
+export * from './doubly-linked-list';
+export * from './navigator';

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

@@ -0,0 +1,31 @@
+"use strict";
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __exportStar = (this && this.__exportStar) || function(m, exports) {
+    for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+__exportStar(require("./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("./map-graph"), exports);
+__exportStar(require("./abstract-binary-tree"), exports);
+__exportStar(require("./rb-tree"), exports);
+__exportStar(require("./directed-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("./navigator"), exports);

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

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

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

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

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

@@ -0,0 +1,14 @@
+export type Direction = 'up' | 'right' | 'down' | 'left';
+export type Turning = {
+    [key in Direction]: Direction;
+};
+export type NavigatorParams<T> = {
+    matrix: T[][];
+    turning: Turning;
+    onMove: (cur: [number, number]) => void;
+    init: {
+        cur: [number, number];
+        charDir: Direction;
+        VISITED: T;
+    };
+};

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

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

package/dist/types/data-structures/priority-queue.d.ts

@@ -0,0 +1,7 @@
+export type PriorityQueueComparator<T> = (a: T, b: T) => number;
+export type PriorityQueueOptions<T> = {
+    nodes?: T[];
+    isFix?: boolean;
+    comparator: PriorityQueueComparator<T>;
+};
+export type PriorityQueueDFSOrderPattern = 'pre' | 'in' | 'post';

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

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

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

@@ -0,0 +1,8 @@
+import { BinaryTreeOptions } from './binary-tree';
+import { RBTreeNode } from '../../data-structures/binary-tree';
+export declare enum RBColor {
+    RED = "RED",
+    BLACK = "BLACK"
+}
+export type RBTreeNodeNested<T> = RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, any>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>;
+export type RBTreeOptions = BinaryTreeOptions & {};

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

@@ -0,0 +1,8 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.RBColor = void 0;
+var RBColor;
+(function (RBColor) {
+    RBColor["RED"] = "RED";
+    RBColor["BLACK"] = "BLACK";
+})(RBColor = exports.RBColor || (exports.RBColor = {}));

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

@@ -0,0 +1 @@
+export type SegmentTreeNodeVal = number;

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

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

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

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

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

@@ -0,0 +1,4 @@
+import { TreeMultisetNode } from '../../data-structures/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'> & {};

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

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

package/dist/types/helpers.d.ts

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

package/dist/types/helpers.js

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

package/dist/types/index.d.ts

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

package/dist/types/index.js

@@ -14,4 +14,6 @@ var __exportStar = (this && this.__exportStar) || function(m, exports) {
     for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
 };
 Object.defineProperty(exports, "__esModule", { value: true });
+__exportStar(require("./data-structures"), exports);
+__exportStar(require("./helpers"), exports);
 __exportStar(require("./utils"), exports);

package/dist/types/utils/index.d.ts

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

package/dist/types/utils/index.js

@@ -0,0 +1,18 @@
+"use strict";
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __exportStar = (this && this.__exportStar) || function(m, exports) {
+    for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+__exportStar(require("./utils"), exports);
+__exportStar(require("./validate-type"), exports);

package/dist/types/utils/utils.d.ts

@@ -0,0 +1,7 @@
+export type ToThunkFn = () => ReturnType<TrlFn>;
+export type Thunk = () => ReturnType<ToThunkFn> & {
+    __THUNK__: Symbol;
+};
+export type TrlFn = (...args: any[]) => any;
+export type TrlAsyncFn = (...args: any[]) => any;
+export type SpecifyOptional<T, K extends keyof T> = Omit<T, K> & Partial<Pick<T, K>>;

package/dist/types/utils/utils.js

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

package/dist/types/utils/validate-type.d.ts

@@ -0,0 +1,19 @@
+export type KeyValueObject = {
+    [key: string]: any;
+};
+export type KeyValueObjectWithId = {
+    [key: string]: any;
+    id: string | number | symbol;
+};
+export type NonNumberNonObjectButDefined = string | boolean | symbol | null;
+export type ObjectWithoutId = Omit<KeyValueObject, 'id'>;
+export type ObjectWithNonNumberId = {
+    [key: string]: any;
+    id: string | boolean | symbol | null | object | undefined;
+};
+export type ObjectWithNumberId = {
+    [key: string]: any;
+    id: number;
+};
+export type RestrictValById = NonNumberNonObjectButDefined | ObjectWithoutId | ObjectWithNonNumberId | ObjectWithNumberId;
+export type DummyAny = string | number | boolean | null | undefined | object | symbol | void | Function | never;

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

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

package/dist/utils/index.js

@@ -0,0 +1,17 @@
+"use strict";
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __exportStar = (this && this.__exportStar) || function(m, exports) {
+    for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+__exportStar(require("./utils"), exports);

package/dist/utils/utils.d.ts

@@ -0,0 +1,19 @@
+/**
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
+ */
+import type { Thunk, ToThunkFn, TrlAsyncFn, TrlFn } from '../types';
+export declare const uuidV4: () => string;
+export declare const arrayRemove: <T>(array: T[], predicate: (item: T, index: number, array: T[]) => boolean) => T[];
+export declare const THUNK_SYMBOL: unique symbol;
+export declare const isThunk: (fnOrValue: any) => boolean;
+export declare const toThunk: (fn: ToThunkFn) => Thunk;
+export declare const trampoline: (fn: TrlFn) => ((...args: [...Parameters<TrlFn>]) => any) & {
+    cont: (...args: [...Parameters<TrlFn>]) => Thunk;
+};
+export declare const trampolineAsync: (fn: TrlAsyncFn) => ((...args: [...Parameters<TrlAsyncFn>]) => Promise<any>) & {
+    cont: (...args: [...Parameters<TrlAsyncFn>]) => Thunk;
+};

package/dist/{data-structures/trampoline.js → utils/utils.js}

@@ -9,10 +9,31 @@ var __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, ge
     });
 };
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.trampolineAsync = exports.trampoline = exports.toThunk = exports.isThunk = exports.THUNK_SYMBOL = void 0;
+exports.trampolineAsync = exports.trampoline = exports.toThunk = exports.isThunk = exports.THUNK_SYMBOL = exports.arrayRemove = exports.uuidV4 = void 0;
+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);
+    });
+};
+exports.uuidV4 = uuidV4;
+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;
+};
+exports.arrayRemove = arrayRemove;
 exports.THUNK_SYMBOL = Symbol('thunk');
-const isThunk = (value) => {
-    return typeof value === 'function' && value.__THUNK__ === exports.THUNK_SYMBOL;
+const isThunk = (fnOrValue) => {
+    return typeof fnOrValue === 'function' && fnOrValue.__THUNK__ === exports.THUNK_SYMBOL;
 };
 exports.isThunk = isThunk;
 const toThunk = (fn) => {
@@ -25,7 +46,7 @@ const trampoline = (fn) => {
     const cont = (...args) => (0, exports.toThunk)(() => fn(...args));
     return Object.assign((...args) => {
         let result = fn(...args);
-        while ((0, exports.isThunk)(result)) {
+        while ((0, exports.isThunk)(result) && typeof result === 'function') {
             result = result();
         }
         return result;
@@ -36,17 +57,10 @@ const trampolineAsync = (fn) => {
     const cont = (...args) => (0, exports.toThunk)(() => fn(...args));
     return Object.assign((...args) => __awaiter(void 0, void 0, void 0, function* () {
         let result = yield fn(...args);
-        while ((0, exports.isThunk)(result)) {
+        while ((0, exports.isThunk)(result) && typeof result === 'function') {
             result = yield result();
         }
         return result;
     }), { cont });
 };
 exports.trampolineAsync = trampolineAsync;
-const factorial = (0, exports.trampoline)((n, acc = 1) => {
-    return n
-        // Note: calling factorial.cont instead of factorial directly
-        ? factorial.cont(n - 1, acc * n)
-        : acc;
-});
-// factorial(32768)

package/package.json

@@ -1,76 +1,127 @@
 {
   "name": "data-structure-typed",
-  "version": "0.8.18",
-  "description": "Hash (CoordinateSet, CoordinateMap) Heap (MaxHeap, MinHeap) Binary Tree (AVL Tree, Binary Indexed Tree, Binary Search Tree, Segment Tree, Tree Multiset) Graph (Directed Graph, Undirected Graph) Linked List (Singly Linked List, Doubly Linked List) Matrix Priority Queue (Max Priority Queue, Min Priority Queue) Queue (Queue, Dequeue) Stack Trie",
+  "version": "1.3.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",
   "scripts": {
-    "test": "echo \"Error: no test specified\" && exit 1"
+    "build": "rm -rf dist && npx tsc && npm run build:browser",
+    "build:browser": "webpack",
+    "build:docs": "typedoc --out docs ./src",
+    "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"
   },
   "repository": {
     "type": "git",
     "url": "git+https://github.com/zrwusa/data-structure-typed.git"
   },
   "keywords": [
-    "Hash",
-    "CoordinateSet",
-    "CoordinateMap",
-    "Heap",
-    "MaxHeap",
-    "MinHeap",
-    "Binary",
-    "Tree",
-    "AVL",
-    "Tree",
-    "Binary",
-    "Indexed",
-    "Tree",
-    "Binary",
-    "Search",
-    "Tree",
-    "Segment",
-    "Tree",
-    "Tree",
-    "Multiset",
-    "Graph",
-    "Directed",
+    "Data Structure",
+    "data-structure",
+    "Data Structures",
+    "data-structures",
+    "algorithm",
+    "Binary Search Tree",
+    "binary-search-tree",
+    "Binary Tree",
+    "binary-tree",
+    "BST",
+    "AVL Tree",
+    "avl-tree",
+    "avl",
+    "Tree Multiset",
+    "tree-multiset",
+    "Tree Multiset",
+    "dfs",
+    "DFS",
+    "dfs iterative",
+    "DFS Iterative",
+    "bfs",
+    "BFS",
+    "graph",
     "Graph",
-    "Undirected",
-    "Graph",
-    "Linked",
-    "List",
-    "Singly",
-    "Linked",
-    "List",
-    "Doubly",
-    "Linked",
-    "List",
-    "Matrix",
-    "Priority",
-    "Queue",
-    "Max",
-    "Priority",
-    "Queue",
-    "Min",
-    "Priority",
-    "Queue",
-    "Queue",
+    "Directed Graph",
+    "directed-graph",
+    "Undirected Graph",
+    "undirected-graph",
+    "Heap",
+    "Priority Queue",
+    "priority-queue",
+    "Max Priority Queue",
+    "max-priority-queue",
+    "Min Priority Queue",
+    "min-priority-queue",
+    "Deque",
+    "Linked List",
+    "linked-list",
+    "Trie",
+    "Prefix Tree",
+    "prefix-tree",
+    "binary",
+    "DataStructure",
+    "DataStructures",
+    "data",
+    "structure",
+    "sort",
+    "Segment Tree",
+    "segment-tree",
+    "Binary Indexed Tree",
+    "binary-indexed-tree",
+    "Linked List",
+    "linked-list",
+    "Singly Linked List",
+    "singly-linked-list",
+    "Doubly Linked List",
+    "doubly-linked-list",
     "Queue",
-    "Dequeue",
+    "Object Deque",
+    "Array Deque",
     "Stack",
-    "Trie"
+    "Hash",
+    "morris",
+    "Bellman-Ford ",
+    "Dijkstra's Algorithm",
+    "Floyd-Warshall Algorithm",
+    "Tarjan's Algorithm"
   ],
-  "author": "Tyler Zeng",
-  "license": "ISC",
+  "author": "Tyler Zeng zrwusa@gmail.com",
+  "license": "MIT",
   "bugs": {
     "url": "https://github.com/zrwusa/data-structure-typed/issues"
   },
   "homepage": "https://github.com/zrwusa/data-structure-typed#readme",
-  "types": "dist/index.d.ts",
   "devDependencies": {
-    "@types/lodash": "^4.14.178",
-    "typescript": "^4.6.2"
-  },
-  "dependencies": {
-    "lodash": "^4.17.21"
+    "@types/jest": "^29.5.3",
+    "@types/node": "^20.4.9",
+    "avl-tree-typed": "^1.21.3",
+    "binary-tree-typed": "^1.21.3",
+    "bst-typed": "^1.21.3",
+    "dependency-cruiser": "^13.1.2",
+    "deque-typed": "^1.21.3",
+    "directed-graph-typed": "^1.21.3",
+    "doubly-linked-list-typed": "^1.21.3",
+    "graph-typed": "^1.21.3",
+    "heap-typed": "^1.21.3",
+    "jest": "^29.6.2",
+    "linked-list-typed": "^1.21.3",
+    "max-heap-typed": "^1.21.3",
+    "max-priority-queue-typed": "^1.21.3",
+    "min-heap-typed": "^1.21.3",
+    "min-priority-queue-typed": "^1.21.3",
+    "priority-queue-typed": "^1.21.3",
+    "singly-linked-list-typed": "^1.21.3",
+    "stack-typed": "^1.21.3",
+    "tree-multiset-typed": "^1.21.3",
+    "trie-typed": "^1.21.3",
+    "ts-jest": "^29.1.1",
+    "ts-loader": "^9.4.4",
+    "typedoc": "^0.24.8",
+    "typescript": "^4.9.5",
+    "undirected-graph-typed": "^1.21.3",
+    "webpack": "^5.88.2",
+    "webpack-cli": "^5.1.4"
   }
 }

package/.idea/data-structure-typed.iml

@@ -1,12 +0,0 @@
-<?xml version="1.0" encoding="UTF-8"?>
-<module type="WEB_MODULE" version="4">
-  <component name="NewModuleRootManager">
-    <content url="file://$MODULE_DIR$">
-      <excludeFolder url="file://$MODULE_DIR$/temp" />
-      <excludeFolder url="file://$MODULE_DIR$/.tmp" />
-      <excludeFolder url="file://$MODULE_DIR$/tmp" />
-    </content>
-    <orderEntry type="inheritedJdk" />
-    <orderEntry type="sourceFolder" forTests="false" />
-  </component>
-</module>

package/.idea/modules.xml

@@ -1,8 +0,0 @@
-<?xml version="1.0" encoding="UTF-8"?>
-<project version="4">
-  <component name="ProjectModuleManager">
-    <modules>
-      <module fileurl="file://$PROJECT_DIR$/.idea/data-structure-ts.iml" filepath="$PROJECT_DIR$/.idea/data-structure-ts.iml" />
-    </modules>
-  </component>
-</project>

package/.idea/vcs.xml

@@ -1,6 +0,0 @@
-<?xml version="1.0" encoding="UTF-8"?>
-<project version="4">
-  <component name="VcsDirectoryMappings">
-    <mapping directory="$PROJECT_DIR$" vcs="Git" />
-  </component>
-</project>

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

@@ -1,25 +0,0 @@
-export type ArgumentTypes<T extends (...args: any[]) => any> = T extends (...args: infer A) => any ? A : never;
-export declare const THUNK_SYMBOL: unique symbol;
-export interface Thunk<T> extends Function {
-    __THUNK__: typeof THUNK_SYMBOL;
-    (): T;
-}
-export type ThunkOrValue<T> = T | Thunk<T>;
-export type UnwrapThunkDeep<T> = {
-    0: T extends Thunk<infer U> ? UnwrapThunkDeep<U> : T;
-}[T extends ThunkOrValue<T> ? 0 : never];
-export declare const isThunk: <T>(value: any) => value is Thunk<T>;
-export declare const toThunk: <R>(fn: () => R) => Thunk<R>;
-export type UnwrapPromise<T> = T extends Promise<infer U> ? Exclude<U, Promise<T>> : T;
-export type Unbox<T> = UnwrapThunkDeep<UnwrapPromise<T>>;
-export type Cont<A extends any[], R> = (...args: A) => Thunk<Unbox<R>>;
-export interface Trampoline<F extends ((...args: any[]) => any)> {
-    (...args: ArgumentTypes<F>): Unbox<ReturnType<F>>;
-    cont: Cont<ArgumentTypes<F>, ReturnType<F>>;
-}
-export interface TrampolineAsync<F extends ((...args: any[]) => any)> {
-    (...args: ArgumentTypes<F>): Promise<Unbox<ReturnType<F>>>;
-    cont: Cont<ArgumentTypes<F>, ReturnType<F>>;
-}
-export declare const trampoline: <F extends (...args: any[]) => any>(fn: F) => Trampoline<F>;
-export declare const trampolineAsync: <F extends (...args: any[]) => any>(fn: F) => TrampolineAsync<F>;

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

@@ -1,2 +0,0 @@
-export declare class AaTree {
-}

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

@@ -1,21 +0,0 @@
-import { BST, BSTNode } from './bst';
-import { BinaryTreeNodeId } from './binary-tree';
-export interface AVLTreeDeleted<T> {
-    deleted: AVLTreeNode<T> | null;
-    needBalanced: AVLTreeNode<T> | null;
-}
-export declare class AVLTreeNode<T> extends BSTNode<T> {
-    clone(): AVLTreeNode<T>;
-}
-export declare class AVLTree<T> extends BST<T> {
-    createNode(id: BinaryTreeNodeId, val: T, count?: number): AVLTreeNode<T>;
-    put(id: BinaryTreeNodeId, val: T | null, count?: number): AVLTreeNode<T> | null;
-    remove(id: BinaryTreeNodeId, isUpdateAllLeftSum?: boolean): AVLTreeDeleted<T>[];
-    balanceFactor(node: AVLTreeNode<T>): number;
-    updateHeight(node: AVLTreeNode<T>): void;
-    balancePath(node: AVLTreeNode<T>): void;
-    balanceLL(A: AVLTreeNode<T>): void;
-    balanceLR(A: AVLTreeNode<T>): void;
-    balanceRR(A: AVLTreeNode<T>): void;
-    balanceRL(A: AVLTreeNode<T>): void;
-}

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

@@ -1,2 +0,0 @@
-export declare class BTree {
-}

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

@@ -1,8 +0,0 @@
-export declare class BinaryIndexedTree {
-    private readonly _sumTree;
-    constructor(n: number);
-    update(i: number, delta: number): void;
-    getPrefixSum(i: number): number;
-    getRangeSum(start: number, end: number): number;
-    static lowBit(x: number): number;
-}