data-structure-typed 0.9.16 → 1.3.0

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

@@ -1,395 +0,0 @@
-import type {BinaryTreeNodeId, BinaryTreeNodePropertyName, BSTComparator, BSTDeletedResult} from '../types';
-import {BinaryTree, BinaryTreeNode, FamilyPosition, LoopType,} from './binary-tree';
-
-export enum CP {lt = -1, eq = 0, gt = 1}
-
-export class BSTNode<T> extends BinaryTreeNode<T> {
-    override clone(): BSTNode<T> {
-        return new BSTNode<T>(this.id, this.val, this.count);
-    }
-}
-
-export class BST<T> extends BinaryTree<T> {
-    constructor(options?: {
-        comparator?: BSTComparator,
-        loopType?: LoopType
-    }) {
-        super(options);
-        if (options !== undefined) {
-            const {comparator} = options;
-            if (comparator !== undefined) {
-                this._comparator = comparator;
-            }
-        }
-    }
-
-    override createNode(id: BinaryTreeNodeId, val: T | null, count?: number): BSTNode<T> | null {
-        return val !== null ? new BSTNode<T>(id, val, count) : null;
-    }
-
-    override put(id: BinaryTreeNodeId, val: T | null, count: number = 1): BSTNode<T> | null {
-        let inserted: BSTNode<T> | null = null;
-        const newNode = this.createNode(id, val, count);
-        if (this.root === null) {
-            this.root = newNode;
-            this.size++;
-            this.count += newNode?.count ?? 1;
-            inserted = (this.root);
-        } else {
-            let cur = this.root;
-            let traversing = true;
-            while (traversing) {
-                if (cur !== null && newNode !== null) {
-                    if (this._compare(cur.id, id) === CP.eq) {
-                        if (newNode) {
-                            cur.count += newNode.count;
-                            this.count += newNode.count;
-                            cur.val = newNode.val;
-                        }
-                        //Duplicates are not accepted.
-                        traversing = false;
-                        inserted = cur;
-                    } else if (this._compare(cur.id, id) === CP.gt) {
-                        // Traverse left of the node
-                        if (cur.left === undefined) {
-                            if (newNode) {
-                                newNode.parent = cur;
-                                newNode.familyPosition = FamilyPosition.left;
-                            }
-                            //Add to the left of the current node
-                            cur.left = newNode;
-                            this.size++;
-                            this.count += newNode.count;
-                            traversing = false;
-                            inserted = cur.left;
-                        } else {
-                            //Traverse the left of the current node
-                            if (cur.left) cur = cur.left;
-                        }
-                    } else if (this._compare(cur.id, id) === CP.lt) {
-                        // Traverse right of the node
-                        if (cur.right === undefined) {
-                            if (newNode) {
-                                newNode.parent = cur;
-                                newNode.familyPosition = FamilyPosition.right;
-                            }
-                            //Add to the right of the current node
-                            cur.right = newNode;
-                            this.size++;
-                            this.count += newNode.count;
-                            traversing = false;
-                            inserted = (cur.right);
-                        } else {
-                            //Traverse the left of the current node
-                            if (cur.right) cur = cur.right;
-                        }
-                    }
-                } else {
-                    traversing = false;
-                }
-            }
-        }
-        return inserted;
-    }
-
-    override get(nodeProperty: BinaryTreeNodeId | T, propertyName ?: BinaryTreeNodePropertyName): BSTNode<T> | null {
-        propertyName = propertyName ?? 'id';
-        return this.getNodes(nodeProperty, propertyName, true)[0] ?? null;
-    }
-
-    lastKey() {
-        if (this._compare(0, 1) === CP.lt) return this.getRightMost()?.id ?? 0;
-        else if (this._compare(0, 1) === CP.gt) return this.getLeftMost()?.id ?? 0;
-        else return this.getRightMost()?.id ?? 0;
-    }
-
-    override remove(id: BinaryTreeNodeId, ignoreCount?: boolean): BSTDeletedResult<T>[] {
-        const bstDeletedResult: BSTDeletedResult<T>[] = [];
-
-        if (!this.root) return bstDeletedResult;
-
-        const curr: BSTNode<T> | null = this.get(id);
-        if (!curr) return bstDeletedResult;
-
-        const parent: BSTNode<T> | null = curr?.parent ? curr.parent : null;
-        let needBalanced: BSTNode<T> | null = null, orgCurrent = curr;
-
-        if (curr.count > 1 && !ignoreCount) {
-            curr.count--;
-            this.count--;
-        } else {
-            if (!curr.left) {
-                if (!parent) {
-                    if (curr.right !== undefined) this.root = curr.right;
-                } else {
-                    switch (curr.familyPosition) {
-                        case FamilyPosition.left:
-                            parent.left = curr.right;
-                            break;
-                        case FamilyPosition.right:
-                            parent.right = curr.right;
-                            break;
-                    }
-                    needBalanced = parent;
-                }
-            } else {
-                const leftSubTreeMax = curr.left ? this.getRightMost(curr.left) : null;
-                if (leftSubTreeMax) {
-                    const parentOfLeftSubTreeMax = leftSubTreeMax.parent;
-                    orgCurrent = curr.swapLocation(leftSubTreeMax);
-                    if (parentOfLeftSubTreeMax) {
-                        if (parentOfLeftSubTreeMax.right === leftSubTreeMax) parentOfLeftSubTreeMax.right = leftSubTreeMax.left;
-                        else parentOfLeftSubTreeMax.left = leftSubTreeMax.left;
-                        needBalanced = parentOfLeftSubTreeMax;
-                    }
-                }
-            }
-            this.size--;
-            this.count -= curr.count;
-        }
-
-        bstDeletedResult.push({deleted: orgCurrent, needBalanced});
-        return bstDeletedResult;
-    }
-
-    override getNodes(nodeProperty: BinaryTreeNodeId | T, propertyName ?: BinaryTreeNodePropertyName, onlyOne ?: boolean): BSTNode<T>[] {
-        propertyName = propertyName ?? 'id';
-        if (!this.root) return [];
-        const result: BSTNode<T>[] = [];
-
-        if (this._loopType === LoopType.recursive) {
-            const _traverse = (cur: BSTNode<T>) => {
-                if (this._pushByPropertyNameStopOrNot(cur, result, nodeProperty, propertyName, onlyOne)) return;
-
-                if (!cur.left && !cur.right) return;
-                if (propertyName === 'id') {
-                    if (this._compare(cur.id, nodeProperty as number) === CP.gt) cur.left && _traverse(cur.left);
-                    if (this._compare(cur.id, nodeProperty as number) === CP.lt) cur.right && _traverse(cur.right);
-                } else {
-                    cur.left && _traverse(cur.left);
-                    cur.right && _traverse(cur.right);
-                }
-            }
-
-            _traverse(this.root);
-        } else {
-            const queue: BSTNode<T>[] = [this.root];
-            while (queue.length > 0) {
-                const cur = queue.shift();
-                if (cur) {
-                    if (this._pushByPropertyNameStopOrNot(cur, result, nodeProperty, propertyName, onlyOne)) return result;
-                    if (propertyName === 'id') {
-                        if (this._compare(cur.id, nodeProperty as number) === CP.gt) cur.left && queue.push(cur.left);
-                        if (this._compare(cur.id, nodeProperty as number) === CP.lt) cur.right && queue.push(cur.right);
-                    } else {
-                        cur.left && queue.push(cur.left);
-                        cur.right && queue.push(cur.right);
-                    }
-                }
-            }
-        }
-
-        return result;
-    }
-
-    // --- start additional functions
-    lesserSum(id: BinaryTreeNodeId, propertyName ?: BinaryTreeNodePropertyName): number {
-        propertyName = propertyName ?? 'id';
-        if (!this.root) return 0;
-
-        const getSumByPropertyName = (cur: BSTNode<T>) => {
-            let needSum: number;
-            switch (propertyName) {
-                case 'id':
-                    needSum = cur.id;
-                    break;
-                case 'count':
-                    needSum = cur.count;
-                    break;
-                default:
-                    needSum = cur.id;
-                    break;
-            }
-            return needSum;
-        }
-
-        let sum = 0;
-
-        if (this._loopType === LoopType.recursive) {
-            const _traverse = (cur: BSTNode<T>): void => {
-                const compared = this._compare(cur.id, id);
-                if (compared === CP.eq) {
-                    if (cur.right) sum += this.subTreeSum(cur.right, propertyName);
-                    return;
-                } else if (compared === CP.lt) {
-                    if (cur.left) sum += this.subTreeSum(cur.left, propertyName);
-                    sum += getSumByPropertyName(cur);
-                    if (cur.right) _traverse(cur.right);
-                    else return;
-                } else {
-                    if (cur.left) _traverse(cur.left);
-                    else return;
-                }
-            };
-
-            _traverse(this.root);
-        } else {
-            const queue: BSTNode<T>[] = [this.root];
-            while (queue.length > 0) {
-                const cur = queue.shift();
-                if (cur) {
-                    const compared = this._compare(cur.id, id);
-                    if (compared === CP.eq) {
-                        if (cur.right) sum += this.subTreeSum(cur.right, propertyName);
-                        return sum;
-                    } else if (compared === CP.lt) { // todo maybe a bug
-                        if (cur.left) sum += this.subTreeSum(cur.left, propertyName);
-                        sum += getSumByPropertyName(cur);
-                        if (cur.right) queue.push(cur.right);
-                        else return sum;
-                    } else {
-                        if (cur.left) queue.push(cur.left);
-                        else return sum;
-                    }
-                }
-            }
-        }
-
-        return sum;
-    }
-
-    allGreaterNodesAdd(node: BSTNode<T>, delta: number, propertyName ?: BinaryTreeNodePropertyName): boolean {
-        propertyName = propertyName ?? 'id';
-        if (!this.root) return false;
-
-        const _sumByPropertyName = (cur: BSTNode<T>) => {
-            switch (propertyName) {
-                case 'id':
-                    cur.id += delta;
-                    break;
-                case 'count':
-                    cur.count += delta;
-                    break;
-                default:
-                    cur.id += delta;
-                    break;
-            }
-        }
-
-        if (this._loopType === LoopType.recursive) {
-            const _traverse = (cur: BSTNode<T>) => {
-                const compared = this._compare(cur.id, node.id);
-                _sumByPropertyName(cur);
-
-                if (!cur.left && !cur.right) return;
-                if (cur.left && compared === CP.gt) _traverse(cur.left);
-                else if (cur.right && compared === CP.gt) _traverse(cur.right);
-            };
-
-            _traverse(this.root);
-            return true;
-        } else {
-            const queue: BSTNode<T>[] = [this.root];
-            while (queue.length > 0) {
-                const cur = queue.shift();
-                if (cur) {
-                    const compared = this._compare(cur.id, node.id);
-                    _sumByPropertyName(cur);
-
-                    if (cur.left && compared === CP.gt) queue.push(cur.left);
-                    else if (cur.right && compared === CP.gt) queue.push(cur.right);
-                }
-            }
-            return true;
-        }
-    }
-
-    balance(): boolean {
-        const sorted = this.DFS('in', 'node'), n = sorted.length;
-        this.clear();
-
-        if (sorted.length < 1) return false;
-        if (this._loopType === LoopType.recursive) {
-            const buildBalanceBST = (l: number, r: number) => {
-                if (l > r) return;
-                const m = l + Math.floor((r - l) / 2);
-                const midNode = sorted[m];
-                this.put(midNode.id, midNode.val, midNode.count);
-                buildBalanceBST(l, m - 1);
-                buildBalanceBST(m + 1, r);
-            };
-
-            buildBalanceBST(0, n - 1);
-            return true;
-        } else {
-            const stack: [[number, number]] = [[0, n - 1]];
-            while (stack.length > 0) {
-                const popped = stack.pop();
-                if (popped) {
-                    const [l, r] = popped;
-                    if (l <= r) {
-                        const m = l + Math.floor((r - l) / 2);
-                        const midNode = sorted[m];
-                        this.put(midNode.id, midNode.val, midNode.count);
-                        stack.push([m + 1, r]);
-                        stack.push([l, m - 1]);
-                    }
-                }
-            }
-            return true;
-        }
-    }
-
-    isAVLBalanced(): boolean {
-        if (!this.root) return true;
-
-        let balanced = true;
-
-        if (this._loopType === LoopType.recursive) {
-            const _height = (cur: BSTNode<T> | null | undefined): number => {
-                if (!cur) return 0;
-                const leftHeight = _height(cur.left), rightHeight = _height(cur.right);
-                if (Math.abs(leftHeight - rightHeight) > 1) balanced = false;
-                return Math.max(leftHeight, rightHeight) + 1;
-            };
-            _height(this.root);
-        } else {
-            const stack: BSTNode<T>[] = [];
-            let node: BSTNode<T> | null | undefined = this.root, last: BSTNode<T> | null = null;
-            const depths: Map<BSTNode<T>, number> = new Map();
-
-            while (stack.length > 0 || node) {
-                if (node) {
-                    stack.push(node);
-                    node = node.left;
-                } else {
-                    node = stack[stack.length - 1]
-                    if (!node.right || last === node.right) {
-                        node = stack.pop();
-                        if (node) {
-                            const left = node.left ? depths.get(node.left) ?? -1 : -1;
-                            const right = node.right ? depths.get(node.right) ?? -1 : -1;
-                            if (Math.abs(left - right) > 1) return false;
-                            depths.set(node, 1 + Math.max(left, right));
-                            last = node;
-                            node = null;
-                        }
-                    } else node = node.right
-                }
-            }
-        }
-
-        return balanced;
-    }
-
-    protected _comparator: BSTComparator = (a, b) => a - b;
-
-    protected _compare(a: BinaryTreeNodeId, b: BinaryTreeNodeId): CP {
-        const compared = this._comparator(a, b);
-        if (compared > 0) return CP.gt;
-        else if (compared < 0) return CP.lt;
-        else return CP.eq;
-    }
-
-    // --- end additional functions
-}

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

@@ -1,11 +0,0 @@
-export * from './binary-tree';
-export * from './bst';
-export * from './binary-indexed-tree';
-export * from './segment-tree';
-export * from './avl-tree';
-export * from './b-tree';
-export * from './rb-tree';
-export * from './splay-tree';
-export * from './aa-tree';
-export * from './tree-multiset';
-export * from './two-three-tree';

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

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

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

@@ -1,172 +0,0 @@
-import type {SegmentTreeNodeVal} from '../types';
-
-export class SegmentTreeNode {
-    constructor(start: number, end: number, sum: number, val?: SegmentTreeNodeVal | null) {
-        this._start = start;
-        this._end = end;
-        this._sum = sum;
-        this._val = val || null;
-    }
-
-    protected _start = 0;
-
-    get start(): number {
-        return this._start;
-    }
-
-    set start(v: number) {
-        this._start = v;
-    }
-
-    protected _end = 0;
-
-    get end(): number {
-        return this._end;
-    }
-
-    set end(v: number) {
-        this._end = v;
-    }
-
-    protected _val: SegmentTreeNodeVal | null = null;
-
-    get val(): SegmentTreeNodeVal | null {
-        return this._val;
-    }
-
-    set val(v: SegmentTreeNodeVal | null) {
-        this._val = v;
-    }
-
-    protected _sum = 0;
-
-    get sum(): number {
-        return this._sum;
-    }
-
-    set sum(v: number) {
-        this._sum = v;
-    }
-
-    protected _left: SegmentTreeNode | null = null;
-
-    get left(): SegmentTreeNode | null {
-        return this._left;
-    }
-
-    set left(v: SegmentTreeNode | null) {
-        this._left = v;
-    }
-
-    protected _right: SegmentTreeNode | null = null;
-
-    get right(): SegmentTreeNode | null {
-        return this._right;
-    }
-
-    set right(v: SegmentTreeNode | null) {
-        this._right = v;
-    }
-}
-
-export class SegmentTree {
-    protected _values: number[] = [];
-    protected _start = 0;
-    protected _end: number;
-
-    constructor(values: number[], start?: number, end?: number) {
-        start = start || 0;
-        end = end || values.length - 1;
-        this._values = values;
-        this._start = start;
-        this._end = end;
-        this._root = this.build(start, end);
-    }
-
-    protected _root: SegmentTreeNode | null;
-
-    get root(): SegmentTreeNode | null {
-        return this._root;
-    }
-
-    build(start: number, end: number): SegmentTreeNode {
-        if (start === end) {
-            return new SegmentTreeNode(start, end, this._values[start]);
-        }
-        const mid = start + Math.floor((end - start) / 2);
-        const left = this.build(start, mid);
-        const right = this.build(mid + 1, end);
-        const cur = new SegmentTreeNode(start, end, left.sum + right.sum);
-        cur.left = left;
-        cur.right = right;
-        return cur;
-    }
-
-    updateNode(index: number, sum: number, val?: SegmentTreeNodeVal) {
-        const root = this.root || null;
-        if (!root) {
-            return;
-        }
-        const dfs = (cur: SegmentTreeNode, index: number, sum: number, val?: SegmentTreeNodeVal) => {
-            if (cur.start === cur.end && cur.start === index) {
-                cur.sum = sum;
-                // cur.val = val;
-                return;
-            }
-            const mid = cur.start + Math.floor((cur.end - cur.start) / 2);
-            if (index <= mid) {
-                if (cur.left) {
-                    dfs(cur.left, index, sum, val);
-                }
-            } else {
-                if (cur.right) {
-                    dfs(cur.right, index, sum, val);
-                }
-            }
-            if (cur.left && cur.right) {
-                cur.sum = cur.left.sum + cur.right.sum;
-            }
-        };
-
-        dfs(root, index, sum);
-    }
-
-    querySumByRange(indexA: number, indexB: number): number {
-        const root = this.root || null;
-        if (!root) {
-            return 0;
-        }
-
-        const dfs = (cur: SegmentTreeNode, i: number, j: number): number => {
-            if (cur.start === i && cur.end === j) {
-                return cur.sum;
-            }
-            const mid = cur.start + Math.floor((cur.end - cur.start) / 2);
-            if (j <= mid) {
-                // TODO after no-non-null-assertion not ensure the logic
-                if (cur.left) {
-                    return dfs(cur.left, i, j);
-                } else {
-                    return NaN;
-                }
-            } else if (i > mid) {
-                // TODO after no-non-null-assertion not ensure the logic
-                if (cur.right) {
-                    // TODO after no-non-null-assertion not ensure the logic
-                    return dfs(cur.right, i, j);
-
-                } else {
-                    return NaN;
-                }
-            } else {
-                // TODO after no-non-null-assertion not ensure the logic
-                if (cur.left && cur.right) {
-                    return dfs(cur.left, i, mid) + dfs(cur.right, mid + 1, j);
-                } else {
-                    return NaN;
-                }
-            }
-        };
-        return dfs(root, indexA, indexB);
-    }
-}

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

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

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

@@ -1,18 +0,0 @@
-import {BST, BSTNode} from './bst';
-import type {BinaryTreeNodeId, TreeMultiSetDeletedResult} from '../types';
-
-export class TreeMultiSet<T> extends BST<T> {
-    override createNode(id: BinaryTreeNodeId, val: T, count?: number): BSTNode<T> {
-        return new BSTNode<T>(id, val, count);
-    }
-
-    override put(id: BinaryTreeNodeId, val: T | null, count?: number): BSTNode<T> | null {
-        return super.put(id, val, count);
-    }
-
-    override remove(id: BinaryTreeNodeId, isUpdateAllLeftSum?: boolean): TreeMultiSetDeletedResult<T>[] {
-        return super.remove(id, isUpdateAllLeftSum);
-    }
-}
-
-

package/src/data-structures/binary-tree/two-three-tree.ts

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

package/src/data-structures/diagrams/README.md

@@ -1,7 +0,0 @@
-// 操作      常见名称       Ada           Java        JavaScript     C++          Python      Perl       PHP             Ruby
-// 尾部插入   inject, snoc Append         offerLast   push          push_back    append      push        array_push      push
-// 头部插入   push, cons   Prepend        offerFirst  unshift       push_front   appendleft  unshift     array_unshift   unshift
-// 尾部删除   eject        Delete_Last    pollLast    pop           pop_back     pop         pop         array_pop       pop
-// 头部删除   pop          Delete_First   pollFirst   shift         pop_front    popleft     shift       array_shift     shift
-// 查看尾部                Last_Element   peekLast    [length - 1]  back         [-1]        $array[-1]  end             last
-// 查看头部                First_Element  peekFirst   [0]           front        [0]         $array[0]   reset           first