		{
		"name": "data-footstone",
		"version": "0.1.22",
		"version": "0.1.23-beta.1",
		"description": "data structure",
		@@ -9,3 +9,3 @@ "author": "feigebaobei <18515195415@163.com>",
		"type": "module",
		"types": "./tscDist/src/typings/index.d.ts",
		"types": "./tscDist/src/index.d.ts",
		"directories": {
		@@ -18,3 +18,3 @@ "lib": "lib",
		"import": "./tscDist/index.js",
		"types": "./tscDist/src/typings/index.d.ts"
		"types": "./tscDist/src/index.d.ts"
		}
		@@ -21,0 +21,0 @@ },

tscDist/src/chain.d.ts

		@@ -1,2 +0,2 @@
		import { BaseChainElement as BCE, BaseChain as BC, SingleChain as SC, SingleChainElementOrNull as SCEON, IDoublyChain as DC, DoublyChainElement as DCE, SingleCircleChain as SCC, SingleCircleChainElement as SCCE, DoublyCircleChain as DCC, N } from './typings';
		import { BaseChainElement as BCE, BaseChain as BC, SingleChain as SC, SingleChainElementOrNull as SCEON, IDoublyChain as DC, DoublyChainElement as DCE, SingleCircleChain as SCC, SingleCircleChainElement as SCCE, DoublyCircleChain as DCC, N } from '../typings';
		declare class BaseChain<T> implements BC<T> {
		@@ -3,0 +3,0 @@ head: BCE<T> \| SCEON<T>;

tscDist/src/graph.d.ts

		@@ -1,2 +0,2 @@
		import { Vertex as V, Edge as E, Graph as G, DirectionGraph as DG, UndirectionGraph as UG, F, S } from './typings';
		import { Vertex as V, Edge as E, Graph as G, DirectionGraph as DG, UndirectionGraph as UG, F, S } from '../typings';
		declare class Graph<T> implements G<T> {
		@@ -3,0 +3,0 @@ vertexMap: G<T>['vertexMap'];

tscDist/src/hashMap.d.ts

		@@ -1,2 +0,2 @@
		import { HashMap as HM, HashMapKind as HMK, HashMapHash as HMH, HashFn, N, A } from './typings';
		import { HashMap as HM, HashMapKind as HMK, HashMapHash as HMH, HashFn, N, A } from '../typings';
		declare let djb2HashFn: HashFn;
		@@ -3,0 +3,0 @@ declare let loseloseHashFn: HashFn;

tscDist/src/helper.d.ts

tscDist/src/pMap.d.ts

		@@ -1,2 +0,2 @@
		import { PMap as FM } from './typings';
		import { PMap as FM } from '../typings';
		declare class PMap<T, G> implements FM<T, G> {
		@@ -3,0 +3,0 @@ box: Map<T, G>;

tscDist/src/pSet.d.ts

		@@ -1,2 +0,2 @@
		import { PSet as PS } from './typings';
		import { PSet as PS } from '../typings';
		declare class PSet<T> implements PS<T> {
		@@ -3,0 +3,0 @@ box: Set<T>;

tscDist/src/queue.d.ts

		@@ -1,2 +0,2 @@
		import { BaseQueue as BQ, Queue as Q, PriorityQueue as PQ, PriorityQueueNode as PQE, A, N, B } from './typings';
		import { BaseQueue as BQ, Queue as Q, PriorityQueue as PQ, PriorityQueueNode as PQE, A, N, B } from '../typings';
		declare class BaseQueue implements BQ {
		@@ -3,0 +3,0 @@ items: A[];

tscDist/src/search.d.ts

		@@ -1,3 +0,3 @@
		import { A } from './typings';
		import { A } from '../typings';
		declare let binarySearch: (arr: A[], item: A) => number;
		export { binarySearch };

tscDist/src/sort.d.ts

		@@ -1,2 +0,2 @@
		import { S, A, OrderType } from './typings';
		import { S, A, OrderType } from '../typings';
		declare let bubbleSort: (arr: A[], order?: OrderType) => any[];
		@@ -3,0 +3,0 @@ declare let selectSort: (arr: A[], order?: OrderType) => any[];

tscDist/src/stack.d.ts

		@@ -1,2 +0,2 @@
		import { Stack as StackI, N } from './typings';
		import { Stack as StackI, N } from '../typings';
		declare class Stack<T> implements StackI<T> {
		@@ -3,0 +3,0 @@ items: T[];

tscDist/src/store.d.ts

		import { DoublyChain } from './chain';
		import { DoublyChainElement as DCE, N, FifoNode as FFN, Fifo as FF, SingleChain as SC, IDoublyChain as DC, LfuNode as LN, Lfu as L } from './typings';
		import { DoublyChainElement as DCE, N, FifoNode as FFN, Fifo as FF, SingleChain as SC, IDoublyChain as DC, LfuNode as LN, Lfu as L } from '../typings';
		declare class Fifo<K, V> implements FF<K, V> {
		@@ -4,0 +4,0 @@ capacity: N;

tscDist/index.js.map

Sorry, the diff of this file is not supported yet

data-footstone - npm Package Compare versions

Improved metrics