data-structure-typed 2.1.0 → 2.1.1

package/dist/esm/interfaces/graph.js

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=graph.js.map

package/dist/esm/interfaces/graph.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"graph.js","sourceRoot":"","sources":["../../../src/interfaces/graph.ts"],"names":[],"mappings":""}

package/dist/esm/interfaces/heap.d.ts

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

package/dist/esm/interfaces/heap.js

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=heap.js.map

package/dist/esm/interfaces/heap.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"heap.js","sourceRoot":"","sources":["../../../src/interfaces/heap.ts"],"names":[],"mappings":""}

package/dist/esm/interfaces/index.d.ts

@@ -1,8 +0,0 @@
-export * from './graph';
-export * from './binary-tree';
-export * from './doubly-linked-list';
-export * from './heap';
-export * from './navigator';
-export * from './priority-queue';
-export * from './segment-tree';
-export * from './singly-linked-list';

package/dist/esm/interfaces/index.js

@@ -1,9 +0,0 @@
-export * from './graph';
-export * from './binary-tree';
-export * from './doubly-linked-list';
-export * from './heap';
-export * from './navigator';
-export * from './priority-queue';
-export * from './segment-tree';
-export * from './singly-linked-list';
-//# sourceMappingURL=index.js.map

package/dist/esm/interfaces/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/interfaces/index.ts"],"names":[],"mappings":"AAAA,cAAc,SAAS,CAAC;AACxB,cAAc,eAAe,CAAC;AAC9B,cAAc,sBAAsB,CAAC;AACrC,cAAc,QAAQ,CAAC;AACvB,cAAc,aAAa,CAAC;AAC5B,cAAc,kBAAkB,CAAC;AACjC,cAAc,gBAAgB,CAAC;AAC/B,cAAc,sBAAsB,CAAC"}

package/dist/esm/interfaces/navigator.d.ts

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

package/dist/esm/interfaces/navigator.js

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=navigator.js.map

package/dist/esm/interfaces/navigator.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"navigator.js","sourceRoot":"","sources":["../../../src/interfaces/navigator.ts"],"names":[],"mappings":""}

package/dist/esm/interfaces/priority-queue.d.ts

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

package/dist/esm/interfaces/priority-queue.js

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=priority-queue.js.map

package/dist/esm/interfaces/priority-queue.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"priority-queue.js","sourceRoot":"","sources":["../../../src/interfaces/priority-queue.ts"],"names":[],"mappings":""}

package/dist/esm/interfaces/segment-tree.d.ts

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

package/dist/esm/interfaces/segment-tree.js

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=segment-tree.js.map

package/dist/esm/interfaces/segment-tree.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"segment-tree.js","sourceRoot":"","sources":["../../../src/interfaces/segment-tree.ts"],"names":[],"mappings":""}

package/dist/esm/interfaces/singly-linked-list.d.ts

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

package/dist/esm/interfaces/singly-linked-list.js

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=singly-linked-list.js.map

package/dist/esm/interfaces/singly-linked-list.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"singly-linked-list.js","sourceRoot":"","sources":["../../../src/interfaces/singly-linked-list.ts"],"names":[],"mappings":""}

package/dist/esm/types/common.d.ts

@@ -1,15 +0,0 @@
-export type CP = 1 | -1 | 0;
-export type IterationType = 'ITERATIVE' | 'RECURSIVE';
-export type FamilyPosition = 'ROOT' | 'LEFT' | 'RIGHT' | 'ROOT_LEFT' | 'ROOT_RIGHT' | 'ISOLATED' | 'MAL_NODE';
-export type Comparator<K> = (a: K, b: K) => number;
-export type DFSOrderPattern = 'PRE' | 'IN' | 'POST';
-export type NodeDisplayLayout = [string[], number, number, number];
-export interface IterableWithSize<T> extends Iterable<T> {
-    size: number | ((...args: any[]) => number);
-}
-export interface IterableWithLength<T> extends Iterable<T> {
-    length: number | ((...args: any[]) => number);
-}
-export type OptValue<V> = V | undefined;
-export type IterableWithSizeOrLength<T> = IterableWithSize<T> | IterableWithLength<T>;
-export type CRUD = 'CREATED' | 'READ' | 'UPDATED' | 'DELETED';

package/dist/esm/types/common.js

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=common.js.map

package/dist/esm/types/common.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"common.js","sourceRoot":"","sources":["../../../src/types/common.ts"],"names":[],"mappings":""}

package/dist/esm/types/data-structures/base/base.d.ts

@@ -1,13 +0,0 @@
-import { IterableElementBase, IterableEntryBase } from '../../../data-structures';
-import { LinearBase } from '../../../data-structures/base/linear-base';
-export type EntryCallback<K, V, R> = (key: K, value: V, index: number, original: IterableEntryBase<K, V>) => R;
-export type ElementCallback<E, R, RT> = (element: E, index: number, original: IterableElementBase<E, R>) => RT;
-export type ReduceEntryCallback<K, V, R> = (accumulator: R, value: V, key: K, index: number, original: IterableEntryBase<K, V>) => R;
-export type ReduceElementCallback<E, R, U = E> = (accumulator: U, value: E, index: number, self: IterableElementBase<E, R>) => U;
-export type ReduceLinearCallback<E, RT = E> = (accumulator: RT, element: E, index: number, original: LinearBase<E>) => RT;
-export type IterableElementBaseOptions<E, R> = {
-    toElementFn?: (rawElement: R) => E;
-};
-export type LinearBaseOptions<E, R> = IterableElementBaseOptions<E, R> & {
-    maxLen?: number;
-};

package/dist/esm/types/data-structures/base/base.js

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=base.js.map

package/dist/esm/types/data-structures/base/base.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"base.js","sourceRoot":"","sources":["../../../../../src/types/data-structures/base/base.ts"],"names":[],"mappings":""}

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

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

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

@@ -1,2 +0,0 @@
-export * from './base';
-//# sourceMappingURL=index.js.map

package/dist/esm/types/data-structures/base/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../../src/types/data-structures/base/index.ts"],"names":[],"mappings":"AAAA,cAAc,QAAQ,CAAC"}

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

@@ -1,2 +0,0 @@
-import { AVLTreeOptions } from './avl-tree';
-export type AVLTreeCounterOptions<K, V, R> = AVLTreeOptions<K, V, R> & {};

package/dist/esm/types/data-structures/binary-tree/avl-tree-counter.js

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=avl-tree-counter.js.map

package/dist/esm/types/data-structures/binary-tree/avl-tree-counter.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"avl-tree-counter.js","sourceRoot":"","sources":["../../../../../src/types/data-structures/binary-tree/avl-tree-counter.ts"],"names":[],"mappings":""}

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

@@ -1,2 +0,0 @@
-import type { AVLTreeOptions } from './avl-tree';
-export type AVLTreeMultiMapOptions<K, V, R> = AVLTreeOptions<K, V, R> & {};

package/dist/esm/types/data-structures/binary-tree/avl-tree-multi-map.js

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=avl-tree-multi-map.js.map

package/dist/esm/types/data-structures/binary-tree/avl-tree-multi-map.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"avl-tree-multi-map.js","sourceRoot":"","sources":["../../../../../src/types/data-structures/binary-tree/avl-tree-multi-map.ts"],"names":[],"mappings":""}

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

@@ -1,2 +0,0 @@
-import { BSTOptions } from './bst';
-export type AVLTreeOptions<K, V, R> = BSTOptions<K, V, R> & {};

package/dist/esm/types/data-structures/binary-tree/avl-tree.js

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=avl-tree.js.map

package/dist/esm/types/data-structures/binary-tree/avl-tree.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"avl-tree.js","sourceRoot":"","sources":["../../../../../src/types/data-structures/binary-tree/avl-tree.ts"],"names":[],"mappings":""}

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

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

package/dist/esm/types/data-structures/binary-tree/binary-indexed-tree.js

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=binary-indexed-tree.js.map

package/dist/esm/types/data-structures/binary-tree/binary-indexed-tree.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"binary-indexed-tree.js","sourceRoot":"","sources":["../../../../../src/types/data-structures/binary-tree/binary-indexed-tree.ts"],"names":[],"mappings":""}

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

@@ -1,29 +0,0 @@
-import { IterationType, OptValue } from '../../common';
-import { DFSOperation } from '../../../common';
-export type ToEntryFn<K, V, R> = (rawElement: R) => BTNEntry<K, V>;
-export type BinaryTreeOptions<K, V, R> = {
-    iterationType?: IterationType;
-    toEntryFn?: ToEntryFn<K, V, R>;
-    isMapMode?: boolean;
-    isDuplicate?: boolean;
-};
-export type BinaryTreePrintOptions = {
-    isShowUndefined?: boolean;
-    isShowNull?: boolean;
-    isShowRedBlackNIL?: boolean;
-};
-export type OptNodeOrNull<NODE> = NODE | null | undefined;
-export type BTNOptKeyOrNull<K> = K | null | undefined;
-export type BTNEntry<K, V> = [BTNOptKeyOrNull<K>, OptValue<V>];
-export type BTNOptKeyNodeOrNull<K, NODE> = BTNOptKeyOrNull<K> | NODE;
-export type BTNRep<K, V, NODE> = BTNEntry<K, V> | BTNOptKeyNodeOrNull<K, NODE>;
-export type BinaryTreeDeleteResult<NODE> = {
-    deleted: OptNodeOrNull<NODE>;
-    needBalanced: OptNodeOrNull<NODE>;
-};
-export type NodeCallback<NODE, D = any> = (node: NODE) => D;
-export type NodePredicate<NODE> = (node: NODE) => boolean;
-export type DFSStackItem<NODE> = {
-    opt: DFSOperation;
-    node: OptNodeOrNull<NODE>;
-};

package/dist/esm/types/data-structures/binary-tree/binary-tree.js

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=binary-tree.js.map

package/dist/esm/types/data-structures/binary-tree/binary-tree.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"binary-tree.js","sourceRoot":"","sources":["../../../../../src/types/data-structures/binary-tree/binary-tree.ts"],"names":[],"mappings":""}

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

@@ -1,12 +0,0 @@
-import type { BinaryTreeOptions } from './binary-tree';
-import { Comparable } from '../../utils';
-import { OptValue } from '../../common';
-export type BSTOptions<K, V, R> = Omit<BinaryTreeOptions<K, V, R>, 'isDuplicate'> & {
-    specifyComparable?: (key: K) => Comparable;
-    isReverse?: boolean;
-};
-export type BSTNOptKey<K> = K | undefined;
-export type OptNode<NODE> = NODE | undefined;
-export type BSTNEntry<K, V> = [BSTNOptKey<K>, OptValue<V>];
-export type BSTNOptKeyOrNode<K, NODE> = BSTNOptKey<K> | NODE;
-export type BSTNRep<K, V, NODE> = BSTNEntry<K, V> | BSTNOptKeyOrNode<K, NODE>;

package/dist/esm/types/data-structures/binary-tree/bst.js

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=bst.js.map

package/dist/esm/types/data-structures/binary-tree/bst.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"bst.js","sourceRoot":"","sources":["../../../../../src/types/data-structures/binary-tree/bst.ts"],"names":[],"mappings":""}

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

@@ -1,9 +0,0 @@
-export * from './binary-tree';
-export * from './bst';
-export * from './avl-tree';
-export * from './segment-tree';
-export * from './avl-tree-multi-map';
-export * from './red-black-tree';
-export * from './tree-multi-map';
-export * from './tree-counter';
-export * from './avl-tree-counter';

package/dist/esm/types/data-structures/binary-tree/index.js

@@ -1,10 +0,0 @@
-export * from './binary-tree';
-export * from './bst';
-export * from './avl-tree';
-export * from './segment-tree';
-export * from './avl-tree-multi-map';
-export * from './red-black-tree';
-export * from './tree-multi-map';
-export * from './tree-counter';
-export * from './avl-tree-counter';
-//# sourceMappingURL=index.js.map

package/dist/esm/types/data-structures/binary-tree/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../../src/types/data-structures/binary-tree/index.ts"],"names":[],"mappings":"AAAA,cAAc,eAAe,CAAC;AAC9B,cAAc,OAAO,CAAC;AACtB,cAAc,YAAY,CAAC;AAC3B,cAAc,gBAAgB,CAAC;AAC/B,cAAc,sBAAsB,CAAC;AACrC,cAAc,kBAAkB,CAAC;AACjC,cAAc,kBAAkB,CAAC;AACjC,cAAc,gBAAgB,CAAC;AAC/B,cAAc,oBAAoB,CAAC"}

package/dist/esm/types/data-structures/binary-tree/red-black-tree.d.ts

@@ -1,3 +0,0 @@
-import type { BSTOptions } from './bst';
-export type RBTNColor = 'RED' | 'BLACK';
-export type RedBlackTreeOptions<K, V, R> = BSTOptions<K, V, R> & {};

package/dist/esm/types/data-structures/binary-tree/red-black-tree.js

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=red-black-tree.js.map

package/dist/esm/types/data-structures/binary-tree/red-black-tree.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"red-black-tree.js","sourceRoot":"","sources":["../../../../../src/types/data-structures/binary-tree/red-black-tree.ts"],"names":[],"mappings":""}

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

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

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

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=segment-tree.js.map

package/dist/esm/types/data-structures/binary-tree/segment-tree.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"segment-tree.js","sourceRoot":"","sources":["../../../../../src/types/data-structures/binary-tree/segment-tree.ts"],"names":[],"mappings":""}

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

@@ -1,2 +0,0 @@
-import type { RedBlackTreeOptions } from './red-black-tree';
-export type TreeCounterOptions<K, V, R> = RedBlackTreeOptions<K, V, R> & {};

package/dist/esm/types/data-structures/binary-tree/tree-counter.js

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=tree-counter.js.map

package/dist/esm/types/data-structures/binary-tree/tree-counter.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"tree-counter.js","sourceRoot":"","sources":["../../../../../src/types/data-structures/binary-tree/tree-counter.ts"],"names":[],"mappings":""}

package/dist/esm/types/data-structures/binary-tree/tree-multi-map.d.ts

@@ -1,2 +0,0 @@
-import type { RedBlackTreeOptions } from './red-black-tree';
-export type TreeMultiMapOptions<K, V, R> = RedBlackTreeOptions<K, V, R> & {};

package/dist/esm/types/data-structures/binary-tree/tree-multi-map.js

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=tree-multi-map.js.map

package/dist/esm/types/data-structures/binary-tree/tree-multi-map.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"tree-multi-map.js","sourceRoot":"","sources":["../../../../../src/types/data-structures/binary-tree/tree-multi-map.ts"],"names":[],"mappings":""}

package/dist/esm/types/data-structures/graph/abstract-graph.d.ts

@@ -1,14 +0,0 @@
-export type VertexKey = string | number;
-export type DijkstraResult<V> = {
-    distMap: Map<V, number>;
-    distPaths?: Map<V, V[]>;
-    preMap: Map<V, V | undefined>;
-    seen: Set<V>;
-    paths: V[][];
-    minDist: number;
-    minPath: V[];
-} | undefined;
-export type GraphOptions<V = any> = {
-    vertexValueInitializer?: (key: VertexKey) => V;
-    defaultEdgeWeight?: number;
-};

package/dist/esm/types/data-structures/graph/abstract-graph.js

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=abstract-graph.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"abstract-graph.js","sourceRoot":"","sources":["../../../../../src/types/data-structures/graph/abstract-graph.ts"],"names":[],"mappings":""}

package/dist/esm/types/data-structures/graph/directed-graph.d.ts

@@ -1 +0,0 @@
-export type TopologicalStatus = 0 | 1 | 2;

package/dist/esm/types/data-structures/graph/directed-graph.js

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=directed-graph.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"directed-graph.js","sourceRoot":"","sources":["../../../../../src/types/data-structures/graph/directed-graph.ts"],"names":[],"mappings":""}

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

@@ -1,3 +0,0 @@
-export * from './abstract-graph';
-export * from './map-graph';
-export * from './directed-graph';

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

@@ -1,4 +0,0 @@
-export * from './abstract-graph';
-export * from './map-graph';
-export * from './directed-graph';
-//# sourceMappingURL=index.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../../src/types/data-structures/graph/index.ts"],"names":[],"mappings":"AAAA,cAAc,kBAAkB,CAAC;AACjC,cAAc,aAAa,CAAC;AAC5B,cAAc,kBAAkB,CAAC"}

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

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

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

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=map-graph.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"map-graph.js","sourceRoot":"","sources":["../../../../../src/types/data-structures/graph/map-graph.ts"],"names":[],"mappings":""}

package/dist/esm/types/data-structures/graph/undirected-graph.d.ts

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

package/dist/esm/types/data-structures/graph/undirected-graph.js

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=undirected-graph.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"undirected-graph.js","sourceRoot":"","sources":["../../../../../src/types/data-structures/graph/undirected-graph.ts"],"names":[],"mappings":""}

package/dist/esm/types/data-structures/hash/hash-map.d.ts

@@ -1,19 +0,0 @@
-export type HashMapLinkedNode<K, V> = {
-    key: K;
-    value: V;
-    next: HashMapLinkedNode<K, V>;
-    prev: HashMapLinkedNode<K, V>;
-};
-export type LinkedHashMapOptions<K, V, R> = {
-    hashFn?: (key: K) => string;
-    objHashFn?: (key: K) => object;
-    toEntryFn?: (rawElement: R) => [K, V];
-};
-export type HashMapOptions<K, V, R> = {
-    hashFn?: (key: K) => string;
-    toEntryFn?: (rawElement: R) => [K, V];
-};
-export type HashMapStoreItem<K, V> = {
-    key: K;
-    value: V;
-};

package/dist/esm/types/data-structures/hash/hash-map.js

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=hash-map.js.map

package/dist/esm/types/data-structures/hash/hash-map.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"hash-map.js","sourceRoot":"","sources":["../../../../../src/types/data-structures/hash/hash-map.ts"],"names":[],"mappings":""}

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

@@ -1,2 +0,0 @@
-export * from './hash-map';
-export type HashFunction<K> = (key: K) => number;

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

@@ -1,2 +0,0 @@
-export * from './hash-map';
-//# sourceMappingURL=index.js.map

package/dist/esm/types/data-structures/hash/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../../src/types/data-structures/hash/index.ts"],"names":[],"mappings":"AAAA,cAAc,YAAY,CAAC"}

package/dist/esm/types/data-structures/heap/heap.d.ts

@@ -1,5 +0,0 @@
-import { Comparator } from '../../common';
-import { IterableElementBaseOptions } from '../base';
-export type HeapOptions<E, R> = IterableElementBaseOptions<E, R> & {
-    comparator?: Comparator<E>;
-};

package/dist/esm/types/data-structures/heap/heap.js

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=heap.js.map

package/dist/esm/types/data-structures/heap/heap.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"heap.js","sourceRoot":"","sources":["../../../../../src/types/data-structures/heap/heap.ts"],"names":[],"mappings":""}

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

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

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

@@ -1,2 +0,0 @@
-export * from './heap';
-//# sourceMappingURL=index.js.map

package/dist/esm/types/data-structures/heap/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../../src/types/data-structures/heap/index.ts"],"names":[],"mappings":"AAAA,cAAc,QAAQ,CAAC"}

package/dist/esm/types/data-structures/heap/max-heap.d.ts

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

package/dist/esm/types/data-structures/heap/max-heap.js

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=max-heap.js.map

package/dist/esm/types/data-structures/heap/max-heap.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"max-heap.js","sourceRoot":"","sources":["../../../../../src/types/data-structures/heap/max-heap.ts"],"names":[],"mappings":""}

package/dist/esm/types/data-structures/heap/min-heap.d.ts

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

package/dist/esm/types/data-structures/heap/min-heap.js

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=min-heap.js.map

package/dist/esm/types/data-structures/heap/min-heap.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"min-heap.js","sourceRoot":"","sources":["../../../../../src/types/data-structures/heap/min-heap.ts"],"names":[],"mappings":""}

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

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

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

@@ -1,13 +0,0 @@
-export * from './binary-tree';
-export * from './graph';
-export * from './linked-list';
-export * from './heap';
-export * from './matrix';
-export * from './hash';
-export * from './priority-queue';
-export * from './queue';
-export * from './stack';
-export * from './tree';
-export * from './trie';
-export * from './base';
-//# sourceMappingURL=index.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../src/types/data-structures/index.ts"],"names":[],"mappings":"AAAA,cAAc,eAAe,CAAC;AAC9B,cAAc,SAAS,CAAC;AACxB,cAAc,eAAe,CAAC;AAC9B,cAAc,QAAQ,CAAC;AACvB,cAAc,UAAU,CAAC;AACzB,cAAc,QAAQ,CAAC;AACvB,cAAc,kBAAkB,CAAC;AACjC,cAAc,SAAS,CAAC;AACxB,cAAc,SAAS,CAAC;AACxB,cAAc,QAAQ,CAAC;AACvB,cAAc,QAAQ,CAAC;AACvB,cAAc,QAAQ,CAAC"}

package/dist/esm/types/data-structures/linked-list/doubly-linked-list.d.ts

@@ -1,2 +0,0 @@
-import { LinearBaseOptions } from '../base';
-export type DoublyLinkedListOptions<E, R> = LinearBaseOptions<E, R> & {};

package/dist/esm/types/data-structures/linked-list/doubly-linked-list.js

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=doubly-linked-list.js.map

package/dist/esm/types/data-structures/linked-list/doubly-linked-list.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"doubly-linked-list.js","sourceRoot":"","sources":["../../../../../src/types/data-structures/linked-list/doubly-linked-list.ts"],"names":[],"mappings":""}

package/dist/esm/types/data-structures/linked-list/index.d.ts

@@ -1,3 +0,0 @@
-export * from './singly-linked-list';
-export * from './doubly-linked-list';
-export * from './skip-linked-list';

package/dist/esm/types/data-structures/linked-list/index.js

@@ -1,4 +0,0 @@
-export * from './singly-linked-list';
-export * from './doubly-linked-list';
-export * from './skip-linked-list';
-//# sourceMappingURL=index.js.map

package/dist/esm/types/data-structures/linked-list/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../../src/types/data-structures/linked-list/index.ts"],"names":[],"mappings":"AAAA,cAAc,sBAAsB,CAAC;AACrC,cAAc,sBAAsB,CAAC;AACrC,cAAc,oBAAoB,CAAC"}

package/dist/esm/types/data-structures/linked-list/singly-linked-list.d.ts

@@ -1,2 +0,0 @@
-import { LinearBaseOptions } from '../base';
-export type SinglyLinkedListOptions<E, R> = LinearBaseOptions<E, R> & {};

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

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=singly-linked-list.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"singly-linked-list.js","sourceRoot":"","sources":["../../../../../src/types/data-structures/linked-list/singly-linked-list.ts"],"names":[],"mappings":""}

package/dist/esm/types/data-structures/linked-list/skip-linked-list.d.ts

@@ -1,4 +0,0 @@
-export type SkipLinkedListOptions = {
-    maxLevel?: number;
-    probability?: number;
-};

package/dist/esm/types/data-structures/linked-list/skip-linked-list.js

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=skip-linked-list.js.map

package/dist/esm/types/data-structures/linked-list/skip-linked-list.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"skip-linked-list.js","sourceRoot":"","sources":["../../../../../src/types/data-structures/linked-list/skip-linked-list.ts"],"names":[],"mappings":""}

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

@@ -1,2 +0,0 @@
-export * from './navigator';
-export * from './matrix';