data-structure-typed 1.18.6 → 1.18.8

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

@@ -1,34 +0,0 @@
-/**
- * data-structure-typed
- *
- * @author Tyler Zeng
- * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
- * @license MIT License
- */
-
-import {Heap, HeapItem} from './heap';
-import {PriorityQueue} from '../priority-queue';
-import type {HeapOptions} from '../types';
-
-/**
- * @class MinHeap
- * @extends Heap
- */
-export class MinHeap<T = number> extends Heap<T> {
-    protected _pq: PriorityQueue<HeapItem<T>>;
-
-    /**
-     * The constructor initializes a PriorityQueue with a comparator function that compares the priority of two HeapItem
-     * objects.
-     * @param [options] - The `options` parameter is an optional object that can be passed to the constructor. It is of
-     * type `HeapOptions<T>`, which is a generic type that represents the options for the heap.
-     */
-    constructor(options?: HeapOptions<T>) {
-        super(options);
-        this._pq = new PriorityQueue<HeapItem<T>>({
-            comparator: (a, b) => a.priority - b.priority
-        });
-    }
-}
-
-

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

@@ -1,15 +0,0 @@
-export * from './hash';
-export * from './linked-list';
-export * from './stack';
-export * from './queue';
-export * from './graph';
-export * from './binary-tree';
-export * from './tree';
-export * from './heap';
-export * from './priority-queue';
-export * from './matrix';
-export * from './trie';
-export * from './interfaces';
-export * from './types';
-
-

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

@@ -1,42 +0,0 @@
-import {VertexId} from '../types';
-
-export interface IGraph<V, E> {
-
-    hasVertex(vertexOrId: V | VertexId): boolean;
-
-    _getVertex(vertexOrId: VertexId | V): V | null;
-
-    _getVertexId(vertexOrId: V | VertexId): VertexId;
-
-    createAddVertex(id: VertexId, val?: V): boolean;
-
-    addVertex(newVertex: V): boolean;
-
-    removeVertex(vertexOrId: V | VertexId): boolean;
-
-    removeAllVertices(vertices: V[] | VertexId[]): boolean;
-
-    degreeOf(vertexOrId: V | VertexId): number;
-
-    edgesOf(vertexOrId: V | VertexId): E[];
-
-    hasEdge(src: V | VertexId, dest: V | VertexId): boolean;
-
-    getEdge(srcOrId: V | VertexId, destOrId: V | VertexId): E | null;
-
-    edgeSet(): E[];
-
-    createAddEdge(src: V | VertexId, dest: V | VertexId, weight: number, val: E): boolean;
-
-    addEdge(edge: E): boolean;
-
-    removeEdgeBetween(src: V | VertexId, dest: V | VertexId): E | null;
-
-    removeEdge(edge: E): E | null;
-
-    setEdgeWeight(srcOrId: V | VertexId, destOrId: V | VertexId, weight: number): boolean;
-
-    getMinPathBetween(v1: V | VertexId, v2: V | VertexId, isWeight?: boolean): V[] | null;
-
-    getNeighbors(vertexOrId: V | VertexId): V[];
-}

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

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

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

@@ -1,56 +0,0 @@
-import {BinaryTreeNodeId} from '../types';
-import {FamilyPosition} from '../binary-tree';
-
-export interface IBinaryTreeNode<T, FAMILY extends IBinaryTreeNode<T, FAMILY>> {
-    _createNode(id: BinaryTreeNodeId, val: T | null, count?: number): FAMILY | null;
-
-
-    get id(): BinaryTreeNodeId
-
-    set id(v: BinaryTreeNodeId)
-
-
-    get val(): T
-
-    set val(v: T)
-
-
-    get left(): FAMILY | null | undefined
-
-    set left(v: FAMILY | null | undefined)
-
-
-    get right(): FAMILY | null | undefined
-
-    set right(v: FAMILY | null | undefined)
-
-
-    get parent(): FAMILY | null | undefined
-
-    set parent(v: FAMILY | null | undefined)
-
-
-    get familyPosition(): FamilyPosition
-
-    set familyPosition(v: FamilyPosition)
-
-
-    get count(): number
-
-    set count(v: number)
-
-
-    get height(): number
-
-    set height(v: number)
-
-    _createNode(id: BinaryTreeNodeId, val: T | null, count?: number): FAMILY | null
-
-    swapLocation(swapNode: FAMILY): FAMILY
-
-    clone(): FAMILY | null;
-}
-
-export interface IBinaryTree<N extends IBinaryTreeNode<N['val'], N>> {
-    _createNode(id: BinaryTreeNodeId, val: N['val'] | null, count?: number): N | null
-}

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

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

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

@@ -1,15 +0,0 @@
-import {VertexId} from '../types';
-
-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;
-}

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

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

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

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

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

@@ -1,13 +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 './undirected-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/interfaces/navigator.ts

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

package/backup/recursive-type/src/data-structures/interfaces/priority-queue.ts

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

package/backup/recursive-type/src/data-structures/interfaces/segment-tree.ts

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

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

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

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

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

package/backup/recursive-type/src/data-structures/interfaces/undirected-graph.ts

@@ -1,3 +0,0 @@
-export interface IUNDirectedGraph<V, E> {
-
-}