data-structure-typed 0.9.16 → 1.3.1

package/src/data-structures/types/directed-graph.ts

@@ -1,18 +0,0 @@
-import {VertexId} from './abstract-graph';
-
-export interface IDirectedGraph<V, E> {
-    incomingEdgesOf(vertex: V): E[];
-
-    outgoingEdgesOf(vertex: V): E[];
-
-    inDegreeOf(vertexOrId: V | VertexId): number;
-
-    outDegreeOf(vertexOrId: V | VertexId): number;
-
-    getEdgeSrc(e: E): V | null;
-
-    getEdgeDest(e: E): V | null;
-}
-
-// 0 means unknown, 1 means visiting, 2 means visited;
-export type TopologicalStatus = 0 | 1 | 2;

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

@@ -1 +0,0 @@
-export type DoublyLinkedListGetBy = 'node' | 'val';

package/src/data-structures/types/heap.ts

@@ -1,8 +0,0 @@
-export interface HeapOptions<T> {
-    priority?: (element: T) => number;
-}
-
-export interface HeapItem<T> {
-    priority: number;
-    element: T | null;
-}

package/src/data-structures/types/navigator.ts

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

package/src/data-structures/types/priority-queue.ts

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

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

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

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

@@ -1,15 +0,0 @@
-import { SinglyLinkedList } from "../linked-list";
-
-/** Type used for filter and find methods, returning a boolean */
-export type TTestFunction<NodeData> = (
-    data: NodeData,
-    index: number,
-    list: SinglyLinkedList<NodeData>,
-) => boolean;
-
-/** Type used for map and forEach methods, returning anything */
-export type TMapFunction<NodeData> = (
-    data: any,
-    index: number,
-    list: SinglyLinkedList<NodeData>,
-) => any;

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

@@ -1,3 +0,0 @@
-import { BSTNode } from "../binary-tree";
-
-export type TreeMultiSetDeletedResult<T> = { deleted: BSTNode<T> | null, needBalanced: BSTNode<T> | null };

package/src/data-structures/types/utils.ts

@@ -1,173 +0,0 @@
-export type AnyFunction<A extends any[] = any[], R = any> = (...args: A) => R;
-export type Primitive =
-    | number
-    | string
-    | boolean
-    | symbol
-    | undefined
-    | null
-    | void
-    | AnyFunction
-    | Date;
-
-export type Cast<T, TComplex> = { [M in keyof TComplex]: T };
-
-
-export type DeepLeavesWrap<T, TComplex> =
-    T extends string ? Cast<string, TComplex>
-        : T extends number ? Cast<number, TComplex>
-            : T extends boolean ? Cast<boolean, TComplex>
-                : T extends undefined ? Cast<undefined, TComplex>
-                    : T extends null ? Cast<null, TComplex>
-                        : T extends void ? Cast<void, TComplex>
-                            : T extends symbol ? Cast<symbol, TComplex>
-                                : T extends AnyFunction ? Cast<AnyFunction, TComplex>
-                                    : T extends Date ? Cast<Date, TComplex>
-                                        : {
-                                            [K in keyof T]:
-                                            T[K] extends (infer U)[] ? DeepLeavesWrap<U, TComplex>[]
-                                                : DeepLeavesWrap<T[K], TComplex>;
-                                        }
-
-
-type Json = null | string | number | boolean | Json [] | { [name: string]: Json }
-
-export type JSONSerializable = {
-    [key: string]: any
-}
-
-export type JSONValue = string | number | boolean | undefined | JSONObject;
-
-export interface JSONObject {
-    [key: string]: JSONValue;
-}
-
-export type TypeName<T> = T extends string
-    ? 'string'
-    : T extends number
-        ? 'number'
-        : T extends boolean
-            ? 'boolean'
-            : T extends undefined
-                ? 'undefined'
-                : T extends AnyFunction
-                    ? 'function'
-                    : 'object';
-
-export type JsonKeys<T> = keyof {
-    [P in keyof T]: number
-}
-
-const arr = ['1', 2, 4, 5, 6] as const;
-type Range = typeof arr[number];
-const a: Range = 2;
-
-
-/**
- * A function that emits a side effect and does not return anything.
- */
-export type Procedure = (...args: any[]) => void;
-
-export type DebounceOptions = {
-    isImmediate?: boolean;
-    maxWait?: number;
-};
-
-export interface DebouncedFunction<F extends Procedure> {
-    cancel: () => void;
-
-    (this: ThisParameterType<F>, ...args: [...Parameters<F>]): void;
-}
-
-export type MonthKey =
-    'January' |
-    'February' |
-    'March' |
-    'April' |
-    'May' |
-    'June' |
-    'July' |
-    'August' |
-    'September' |
-    'October' |
-    'November' |
-    'December';
-
-export type Month = { [key in MonthKey]: string }
-
-export type UnionToIntersection<U> = (U extends any ? (k: U) => void : never) extends ((k: infer I) => void) ? I : never;
-
-export class TreeNode<T> {
-    id: string;
-    name?: string | undefined;
-    value?: T | undefined;
-    children?: TreeNode<T>[] | undefined;
-
-    constructor(id: string, name?: string, value?: T, children?: TreeNode<T>[]) {
-        this.id = id;
-        this.name = name || '';
-        this.value = value || undefined;
-        this.children = children || [];
-    }
-
-    // TODO get set
-    // get name (): string | undefined {
-    //     return this.name;
-    // }
-    //
-    // set name (name: string | undefined) {
-    //     this.name = name;
-    // }
-
-    addChildren(children: TreeNode<T> | TreeNode<T> []) {
-        if (!this.children) {
-            this.children = [];
-        }
-        if (children instanceof TreeNode) {
-            this.children.push(children);
-        } else {
-            this.children = this.children.concat(children);
-        }
-    }
-
-    getHeight() {
-        // eslint-disable-next-line @typescript-eslint/no-this-alias
-        const beginRoot = this;
-        let maxDepth = 1;
-        if (beginRoot) {
-            const bfs = (node: TreeNode<T>, level: number) => {
-                if (level > maxDepth) {
-                    maxDepth = level;
-                }
-                const {children} = node;
-                if (children) {
-                    for (let i = 0, len = children.length; i < len; i++) {
-                        bfs(children[i], level + 1);
-                    }
-                }
-            };
-            bfs(beginRoot, 1);
-        }
-        return maxDepth;
-    }
-
-}
-
-export type OrderType = 'InOrder' | 'PreOrder' | 'PostOrder'
-
-export type DeepProxy<T> = T extends (...args: any[]) => infer R
-    ? (...args: [...Parameters<T>]) => DeepProxy<R>
-    : T extends object
-        ? { [K in keyof T]: DeepProxy<T[K]> }
-        : T;
-
-export type DeepProxyOnChange = (target: any, property: string | symbol, value: any, receiver: any, descriptor: any, result: any) => void;
-
-export type DeepProxyOnGet = (target: any, property: string | symbol, value: any, receiver: any, descriptor: any, result: any) => void;
-
-export type CurryFunc<T> = T extends (...args: infer Args) => infer R
-    ? Args extends [infer Arg, ...infer RestArgs]
-        ? (arg: Arg) => CurryFunc<(...args: RestArgs) => R>
-        : R
-    : T;
-

package/src/index.ts

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

package/src/utils/index.ts

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