data-structure-typed 1.18.6 → 1.18.8

package/backup/recursive-type/src/data-structures/trie/trie.ts

@@ -1,227 +0,0 @@
-/**
- * data-structure-typed
- *
- * @author Tyler Zeng
- * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
- * @license MIT License
- */
-export class TrieNode {
-
-    constructor(v: string) {
-        this._val = v;
-        this._isEnd = false;
-        this._children = new Map<string, TrieNode>();
-    }
-
-    private _val;
-
-    get val(): string {
-        return this._val;
-    }
-
-    set val(v: string) {
-        this._val = v;
-    }
-
-    protected _children: Map<string, TrieNode>;
-
-    get children(): Map<string, TrieNode> {
-        return this._children;
-    }
-
-    set children(v: Map<string, TrieNode>) {
-        this._children = v;
-    }
-
-    protected _isEnd: boolean;
-
-    get isEnd(): boolean {
-        return this._isEnd;
-    }
-
-    set isEnd(v: boolean) {
-        this._isEnd = v;
-    }
-
-}
-
-export class Trie {
-    constructor(words?: string[]) {
-        this._root = new TrieNode('');
-        if (words) {
-            for (const i of words) {
-                this.add(i);
-            }
-        }
-    }
-
-    protected _root: TrieNode;
-
-    get root() {
-        return this._root;
-    }
-
-    set root(v: TrieNode) {
-        this._root = v;
-    }
-
-    add(word: string): boolean {
-        let cur = this._root;
-        for (const c of word) {
-            let nodeC = cur.children.get(c);
-            if (!nodeC) {
-                nodeC = new TrieNode(c);
-                cur.children.set(c, nodeC);
-            }
-            cur = nodeC;
-        }
-        cur.isEnd = true;
-        return true;
-    }
-
-    has(input: string): boolean {
-        let cur = this._root;
-        for (const c of input) {
-            const nodeC = cur.children.get(c);
-            if (!nodeC) return false;
-            cur = nodeC;
-        }
-        return cur.isEnd;
-    }
-
-    remove(word: string) {
-        let isDeleted = false;
-        const dfs = (cur: TrieNode, i: number): boolean => {
-            const char = word[i];
-            const child = cur.children.get(char);
-            if (child) {
-                if (i === word.length - 1) {
-                    if (child.isEnd) {
-                        if (child.children.size > 0) {
-                            child.isEnd = false;
-                        } else {
-                            cur.children.delete(char);
-                        }
-                        isDeleted = true;
-                        return true;
-                    }
-                    return false;
-                }
-                const res = dfs(child, i + 1);
-                if (res && !cur.isEnd && child.children.size === 0) {
-                    cur.children.delete(char);
-                    return true;
-                }
-                return false;
-            }
-            return false;
-        }
-
-        dfs(this.root, 0);
-        return isDeleted;
-    }
-
-    // --- start additional methods ---
-    /**
-     * The function checks if a given input string has an absolute prefix in a tree data structure.Only can present as a prefix, not a word
-     * @param {string} input - The input parameter is a string that represents the input value for the function.
-     * @returns a boolean value.
-     */
-    isAbsPrefix(input: string): boolean {
-        let cur = this._root;
-        for (const c of input) {
-            const nodeC = cur.children.get(c);
-            if (!nodeC) return false;
-            cur = nodeC;
-        }
-        return !cur.isEnd;
-    }
-
-    /**
-     * The function checks if a given input string is a prefix of any existing string in a tree structure.Can present as a abs prefix or word
-     * @param {string} input - The input parameter is a string that represents the prefix we want to check.
-     * @returns a boolean value.
-     */
-    isPrefix(input: string): boolean {
-        let cur = this._root;
-        for (const c of input) {
-            const nodeC = cur.children.get(c);
-            if (!nodeC) return false;
-            cur = nodeC;
-        }
-        return true;
-    }
-
-    /**
-     * The function checks if the input string is a common prefix in a Trie data structure.Check if the input string is the common prefix of all the words
-     * @param {string} input - The input parameter is a string that represents the common prefix that we want to check for
-     * in the Trie data structure.
-     * @returns a boolean value indicating whether the input string is a common prefix in the Trie data structure.
-     */
-    isCommonPrefix(input: string): boolean {
-        let commonPre = '';
-        const dfs = (cur: TrieNode) => {
-            commonPre += cur.val;
-            if (commonPre === input) return;
-            if (cur.isEnd) return;
-            if (cur && cur.children && cur.children.size === 1) dfs(Array.from(cur.children.values())[0]);
-            else return;
-        }
-        dfs(this._root);
-        return commonPre === input;
-    }
-
-    /**
-     * The function `getLongestCommonPrefix` returns the longest common prefix among all the words stored in a Trie data
-     * structure.
-     * @returns The function `getLongestCommonPrefix` returns a string, which is the longest common prefix found in the
-     * Trie.
-     */
-    getLongestCommonPrefix(): string {
-        let commonPre = '';
-        const dfs = (cur: TrieNode) => {
-            commonPre += cur.val;
-            if (cur.isEnd) return;
-            if (cur && cur.children && cur.children.size === 1) dfs(Array.from(cur.children.values())[0]);
-            else return;
-        }
-        dfs(this._root);
-        return commonPre;
-    }
-
-    /**
-     * The `getAll` function returns an array of all words in a Trie data structure that start with a given prefix.
-     * @param [prefix] - The `prefix` parameter is a string that represents the prefix that we want to search for in the
-     * trie. It is an optional parameter, so if no prefix is provided, it will default to an empty string.
-     * @returns an array of strings.
-     */
-    getAll(prefix = ''): string[] {
-        const words: string[] = [];
-
-        function dfs(node: TrieNode, word: string) {
-            for (const char of node.children.keys()) {
-                const charNode = node.children.get(char);
-                if (charNode !== undefined) {
-                    dfs(charNode, word.concat(char));
-                }
-            }
-            if (node.isEnd) {
-                words.push(word);
-            }
-        }
-
-        let startNode = this._root;
-
-        if (prefix) {
-            for (const c of prefix) {
-                const nodeC = startNode.children.get(c);
-                if (nodeC) startNode = nodeC;
-            }
-        }
-
-        dfs(startNode, prefix);
-        return words;
-    }
-
-    // --- end additional methods ---
-}

package/backup/recursive-type/src/data-structures/types/abstract-graph.ts

@@ -1,5 +0,0 @@
-export type VertexId = string | number;
-export type EdgeId = string;
-export type DijkstraResult<V> =
-    { distMap: Map<V, number>, preMap: Map<V, V | null>, seen: Set<V>, paths: V[][], minDist: number, minPath: V[] }
-    | null;

package/backup/recursive-type/src/data-structures/types/avl-tree.ts

@@ -1,8 +0,0 @@
-import {AVLTreeNode} from '../binary-tree';
-
-export type AVLTreeDeleted<N> = {
-    deleted: N | null;
-    needBalanced: N | null;
-}
-
-export type RecursiveAVLTreeNode<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>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>

package/backup/recursive-type/src/data-structures/types/binary-tree.ts

@@ -1,10 +0,0 @@
-import {BinaryTreeNode} from '../binary-tree';
-
-export type BinaryTreeNodePropertyName = 'id' | 'val' | 'count';
-export type NodeOrPropertyName = 'node' | BinaryTreeNodePropertyName;
-export type DFSOrderPattern = 'in' | 'pre' | 'post';
-export type BinaryTreeNodeId = number;
-export type BinaryTreeDeleted<N> = { deleted: N | null | undefined, needBalanced: N | null };
-export type ResultByProperty<N extends BinaryTreeNode<N['val'], N>> = N['val'] | N | number | BinaryTreeNodeId;
-export type ResultsByProperty<N extends BinaryTreeNode<N['val'], N>> = ResultByProperty<N>[];
-export type RecursiveBinaryTreeNode<T> = BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T,BinaryTreeNode<T,BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, any>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>

package/backup/recursive-type/src/data-structures/types/bst.ts

@@ -1,6 +0,0 @@
-import {BSTNode} from '../binary-tree';
-import type {BinaryTreeNodeId} from './binary-tree';
-
-export type BSTComparator = (a: BinaryTreeNodeId, b: BinaryTreeNodeId) => number;
-export type BSTDeletedResult<N extends BSTNode<N['val'], N>> = { deleted: N | null, needBalanced: N | null };
-export type RecursiveBSTNode<T> = BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T,BSTNode<T,BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, any>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>

package/backup/recursive-type/src/data-structures/types/directed-graph.ts

@@ -1,8 +0,0 @@
-// 0 means unknown, 1 means visiting, 2 means visited;
-export type TopologicalStatus = 0 | 1 | 2;
-
-export enum TopologicalProperty {
-    VAL = 'VAL',
-    NODE = 'NODE',
-    ID = 'ID',
-}

package/backup/recursive-type/src/data-structures/types/doubly-linked-list.ts

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

package/backup/recursive-type/src/data-structures/types/heap.ts

@@ -1,5 +0,0 @@
-export type HeapOptions<T> = {
-    priority?: (element: T) => number;
-    // TODO there is an idea that support chaining which is for conveniently using the data structure
-    // isChaining? : boolean
-}

package/backup/recursive-type/src/data-structures/types/index.ts

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

package/backup/recursive-type/src/data-structures/types/navigator.ts

@@ -1,13 +0,0 @@
-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/backup/recursive-type/src/data-structures/types/priority-queue.ts

@@ -1,9 +0,0 @@
-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/backup/recursive-type/src/data-structures/types/segment-tree.ts

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

package/backup/recursive-type/src/data-structures/types/singly-linked-list.ts

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

package/backup/recursive-type/src/data-structures/types/tree-multiset.ts

@@ -1 +0,0 @@
-export type TreeMultiSetDeletedResult<N> = { deleted: N | null, needBalanced: N | null };

package/backup/recursive-type/src/index.ts

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

package/backup/recursive-type/src/utils/index.ts

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

package/backup/recursive-type/src/utils/types/index.ts

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

package/backup/recursive-type/src/utils/types/utils.ts

@@ -1,6 +0,0 @@
-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/backup/recursive-type/src/utils/utils.ts

@@ -1,78 +0,0 @@
-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 <T>(array: T[], predicate: (item: T, index: number, array: T[]) => boolean): T[] {
-    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;
-};
-
-
-/**
- * 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 const THUNK_SYMBOL = Symbol('thunk')
-
-export const isThunk = (fnOrValue: any) => {
-    return typeof fnOrValue === 'function' && fnOrValue.__THUNK__ === THUNK_SYMBOL
-}
-
-export const toThunk = (fn: ToThunkFn): Thunk => {
-    const thunk = () => fn()
-    thunk.__THUNK__ = THUNK_SYMBOL
-    return thunk
-}
-
-export const trampoline = (fn: TrlFn) => {
-    const cont = (...args: [...Parameters<TrlFn>]) => toThunk(() => fn(...args))
-
-    return Object.assign(
-        (...args: [...Parameters<TrlFn>]) => {
-            let result = fn(...args)
-
-            while (isThunk(result) && typeof result === 'function') {
-                result = result()
-            }
-
-            return result
-        },
-        {cont}
-    )
-}
-
-export const trampolineAsync = (fn: TrlAsyncFn) => {
-    const cont = (...args: [...Parameters<TrlAsyncFn>]) => toThunk(() => fn(...args))
-
-    return Object.assign(
-        async (...args: [...Parameters<TrlAsyncFn>]) => {
-            let result = await fn(...args)
-
-            while (isThunk(result) && typeof result === 'function') {
-                result = await result()
-            }
-
-            return result
-        },
-        {cont}
-    )
-}

package/docs/.nojekyll

@@ -1 +0,0 @@
-TypeDoc added this file to prevent GitHub Pages from using Jekyll. You can turn off this behavior by setting the `githubPages` option to false.

package/docs/assets/highlight.css

@@ -1,92 +0,0 @@
-:root {
-    --light-hl-0: #795E26;
-    --dark-hl-0: #DCDCAA;
-    --light-hl-1: #000000;
-    --dark-hl-1: #D4D4D4;
-    --light-hl-2: #A31515;
-    --dark-hl-2: #CE9178;
-    --light-hl-3: #AF00DB;
-    --dark-hl-3: #C586C0;
-    --light-hl-4: #001080;
-    --dark-hl-4: #9CDCFE;
-    --light-hl-5: #0000FF;
-    --dark-hl-5: #569CD6;
-    --light-hl-6: #0070C1;
-    --dark-hl-6: #4FC1FF;
-    --light-hl-7: #098658;
-    --dark-hl-7: #B5CEA8;
-    --light-hl-8: #267F99;
-    --dark-hl-8: #4EC9B0;
-    --light-hl-9: #008000;
-    --dark-hl-9: #6A9955;
-    --light-code-background: #FFFFFF;
-    --dark-code-background: #1E1E1E;
-}
-
-@media (prefers-color-scheme: light) { :root {
-    --hl-0: var(--light-hl-0);
-    --hl-1: var(--light-hl-1);
-    --hl-2: var(--light-hl-2);
-    --hl-3: var(--light-hl-3);
-    --hl-4: var(--light-hl-4);
-    --hl-5: var(--light-hl-5);
-    --hl-6: var(--light-hl-6);
-    --hl-7: var(--light-hl-7);
-    --hl-8: var(--light-hl-8);
-    --hl-9: var(--light-hl-9);
-    --code-background: var(--light-code-background);
-} }
-
-@media (prefers-color-scheme: dark) { :root {
-    --hl-0: var(--dark-hl-0);
-    --hl-1: var(--dark-hl-1);
-    --hl-2: var(--dark-hl-2);
-    --hl-3: var(--dark-hl-3);
-    --hl-4: var(--dark-hl-4);
-    --hl-5: var(--dark-hl-5);
-    --hl-6: var(--dark-hl-6);
-    --hl-7: var(--dark-hl-7);
-    --hl-8: var(--dark-hl-8);
-    --hl-9: var(--dark-hl-9);
-    --code-background: var(--dark-code-background);
-} }
-
-:root[data-theme='light'] {
-    --hl-0: var(--light-hl-0);
-    --hl-1: var(--light-hl-1);
-    --hl-2: var(--light-hl-2);
-    --hl-3: var(--light-hl-3);
-    --hl-4: var(--light-hl-4);
-    --hl-5: var(--light-hl-5);
-    --hl-6: var(--light-hl-6);
-    --hl-7: var(--light-hl-7);
-    --hl-8: var(--light-hl-8);
-    --hl-9: var(--light-hl-9);
-    --code-background: var(--light-code-background);
-}
-
-:root[data-theme='dark'] {
-    --hl-0: var(--dark-hl-0);
-    --hl-1: var(--dark-hl-1);
-    --hl-2: var(--dark-hl-2);
-    --hl-3: var(--dark-hl-3);
-    --hl-4: var(--dark-hl-4);
-    --hl-5: var(--dark-hl-5);
-    --hl-6: var(--dark-hl-6);
-    --hl-7: var(--dark-hl-7);
-    --hl-8: var(--dark-hl-8);
-    --hl-9: var(--dark-hl-9);
-    --code-background: var(--dark-code-background);
-}
-
-.hl-0 { color: var(--hl-0); }
-.hl-1 { color: var(--hl-1); }
-.hl-2 { color: var(--hl-2); }
-.hl-3 { color: var(--hl-3); }
-.hl-4 { color: var(--hl-4); }
-.hl-5 { color: var(--hl-5); }
-.hl-6 { color: var(--hl-6); }
-.hl-7 { color: var(--hl-7); }
-.hl-8 { color: var(--hl-8); }
-.hl-9 { color: var(--hl-9); }
-pre, code { background: var(--code-background); }