data-structure-typed 1.43.3 → 1.44.1

package/dist/cjs/data-structures/trie/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../src/data-structures/trie/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;AAAA,yCAAuB"}

package/dist/cjs/data-structures/trie/trie.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"trie.js","sourceRoot":"","sources":["../../../../src/data-structures/trie/trie.ts"],"names":[],"mappings":";AAAA;;;;;;GAMG;;;AAEH;;;GAGG;AACH,MAAa,QAAQ;IAKnB,YAAY,GAAW;QACrB,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;QACf,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,QAAQ,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC9C,CAAC;CACF;AAVD,4BAUC;AAED;;GAEG;AACH,MAAa,IAAI;IACf,YAAY,KAAgB,EAAE,aAAa,GAAG,IAAI;QAChD,IAAI,CAAC,KAAK,GAAG,IAAI,QAAQ,CAAC,EAAE,CAAC,CAAC;QAC9B,IAAI,CAAC,cAAc,GAAG,aAAa,CAAC;QACpC,IAAI,KAAK,EAAE;YACT,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE;gBACrB,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;aACb;SACF;IACH,CAAC;IAID,IAAI,aAAa;QACf,OAAO,IAAI,CAAC,cAAc,CAAC;IAC7B,CAAC;IAID,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED;;;OAGG;IAEH;;;;;;;OAOG;IACH,GAAG,CAAC,IAAY;QACd,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;QAC/B,IAAI,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC;QACpB,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE;YACpB,IAAI,KAAK,GAAG,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAChC,IAAI,CAAC,KAAK,EAAE;gBACV,KAAK,GAAG,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC;gBACxB,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;aAC5B;YACD,GAAG,GAAG,KAAK,CAAC;SACb;QACD,GAAG,CAAC,KAAK,GAAG,IAAI,CAAC;QACjB,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;OAGG;IAEH;;;;;;;OAOG;IACH,GAAG,CAAC,IAAY;QACd,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;QAC/B,IAAI,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC;QACpB,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE;YACpB,MAAM,KAAK,GAAG,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAClC,IAAI,CAAC,KAAK;gBAAE,OAAO,KAAK,CAAC;YACzB,GAAG,GAAG,KAAK,CAAC;SACb;QACD,OAAO,GAAG,CAAC,KAAK,CAAC;IACnB,CAAC;IAED;;;OAGG;IAEH;;;;;;;OAOG;IACH,MAAM,CAAC,IAAY;QACjB,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;QAC/B,IAAI,SAAS,GAAG,KAAK,CAAC;QACtB,MAAM,GAAG,GAAG,CAAC,GAAa,EAAE,CAAS,EAAW,EAAE;YAChD,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YACrB,MAAM,KAAK,GAAG,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACrC,IAAI,KAAK,EAAE;gBACT,IAAI,CAAC,KAAK,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE;oBACzB,IAAI,KAAK,CAAC,KAAK,EAAE;wBACf,IAAI,KAAK,CAAC,QAAQ,CAAC,IAAI,GAAG,CAAC,EAAE;4BAC3B,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC;yBACrB;6BAAM;4BACL,GAAG,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;yBAC3B;wBACD,SAAS,GAAG,IAAI,CAAC;wBACjB,OAAO,IAAI,CAAC;qBACb;oBACD,OAAO,KAAK,CAAC;iBACd;gBACD,MAAM,GAAG,GAAG,GAAG,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC9B,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,IAAI,KAAK,CAAC,QAAQ,CAAC,IAAI,KAAK,CAAC,EAAE;oBAClD,GAAG,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;oBAC1B,OAAO,IAAI,CAAC;iBACb;gBACD,OAAO,KAAK,CAAC;aACd;YACD,OAAO,KAAK,CAAC;QACf,CAAC,CAAC;QAEF,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAClB,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;OAGG;IAEH;;;;OAIG;IACH,SAAS;QACP,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC;QAC5B,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,IAAI,SAAS,EAAE;YACb,MAAM,GAAG,GAAG,CAAC,IAAc,EAAE,KAAa,EAAE,EAAE;gBAC5C,IAAI,KAAK,GAAG,QAAQ,EAAE;oBACpB,QAAQ,GAAG,KAAK,CAAC;iBAClB;gBACD,MAAM,EAAC,QAAQ,EAAC,GAAG,IAAI,CAAC;gBACxB,IAAI,QAAQ,EAAE;oBACZ,KAAK,MAAM,KAAK,IAAI,QAAQ,CAAC,OAAO,EAAE,EAAE;wBACtC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;qBAC1B;iBACF;YACH,CAAC,CAAC;YACF,GAAG,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;SACnB;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;;OAGG;IAEH;;;;;;;OAOG;IACH,aAAa,CAAC,KAAa;QACzB,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QACjC,IAAI,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC;QACpB,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE;YACrB,MAAM,KAAK,GAAG,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAClC,IAAI,CAAC,KAAK;gBAAE,OAAO,KAAK,CAAC;YACzB,GAAG,GAAG,KAAK,CAAC;SACb;QACD,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC;IACpB,CAAC;IAED;;;OAGG;IAEH;;;;;;;OAOG;IACH,SAAS,CAAC,KAAa;QACrB,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QACjC,IAAI,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC;QACpB,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE;YACrB,MAAM,KAAK,GAAG,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAClC,IAAI,CAAC,KAAK;gBAAE,OAAO,KAAK,CAAC;YACzB,GAAG,GAAG,KAAK,CAAC;SACb;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;OAGG;IAEH;;;;;;;OAOG;IACH,eAAe,CAAC,KAAa;QAC3B,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QACjC,IAAI,SAAS,GAAG,EAAE,CAAC;QACnB,MAAM,GAAG,GAAG,CAAC,GAAa,EAAE,EAAE;YAC5B,SAAS,IAAI,GAAG,CAAC,GAAG,CAAC;YACrB,IAAI,SAAS,KAAK,KAAK;gBAAE,OAAO;YAChC,IAAI,GAAG,CAAC,KAAK;gBAAE,OAAO;YACtB,IAAI,GAAG,IAAI,GAAG,CAAC,QAAQ,IAAI,GAAG,CAAC,QAAQ,CAAC,IAAI,KAAK,CAAC;gBAAE,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;;gBACzF,OAAO;QACd,CAAC,CAAC;QACF,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACf,OAAO,SAAS,KAAK,KAAK,CAAC;IAC7B,CAAC;IAED;;;OAGG;IAEH;;;;;;OAMG;IACH,sBAAsB;QACpB,IAAI,SAAS,GAAG,EAAE,CAAC;QACnB,MAAM,GAAG,GAAG,CAAC,GAAa,EAAE,EAAE;YAC5B,SAAS,IAAI,GAAG,CAAC,GAAG,CAAC;YACrB,IAAI,GAAG,CAAC,KAAK;gBAAE,OAAO;YACtB,IAAI,GAAG,IAAI,GAAG,CAAC,QAAQ,IAAI,GAAG,CAAC,QAAQ,CAAC,IAAI,KAAK,CAAC;gBAAE,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;;gBACzF,OAAO;QACd,CAAC,CAAC;QACF,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACf,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;OAGG;IAEH;;;;;;;;;;OAUG;IACH,QAAQ,CAAC,MAAM,GAAG,EAAE,EAAE,GAAG,GAAG,MAAM,CAAC,gBAAgB,EAAE,oBAAoB,GAAG,KAAK;QAC/E,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;QACnC,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,IAAI,KAAK,GAAG,CAAC,CAAC;QAEd,SAAS,GAAG,CAAC,IAAc,EAAE,IAAY;YACvC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,EAAE;gBACvC,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBACzC,IAAI,QAAQ,KAAK,SAAS,EAAE;oBAC1B,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;iBAClC;aACF;YACD,IAAI,IAAI,CAAC,KAAK,EAAE;gBACd,IAAI,KAAK,GAAG,GAAG,GAAG,CAAC;oBAAE,OAAO;gBAC5B,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACjB,KAAK,EAAE,CAAC;aACT;QACH,CAAC;QAED,IAAI,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC;QAE1B,IAAI,MAAM,EAAE;YACV,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE;gBACtB,MAAM,KAAK,GAAG,SAAS,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACxC,IAAI,KAAK;oBAAE,SAAS,GAAG,KAAK,CAAC;aAC9B;SACF;QAED,IAAI,oBAAoB,IAAI,SAAS,KAAK,IAAI,CAAC,IAAI;YAAE,GAAG,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;QAE5E,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;OAGG;IAEH;;;;;;OAMG;IACO,YAAY,CAAC,GAAW;QAChC,IAAI,CAAC,IAAI,CAAC,cAAc,EAAE;YACxB,GAAG,GAAG,GAAG,CAAC,WAAW,EAAE,CAAC,CAAC,+CAA+C;SACzE;QACD,OAAO,GAAG,CAAC;IACb,CAAC;CACF;AA7TD,oBA6TC"}

package/dist/cjs/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;AAAA,oDAAkC;AAClC,0CAAwB;AACxB,+CAA6B;AAC7B,0CAAwB"}

package/dist/cjs/interfaces/binary-tree.js.map

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

package/dist/cjs/interfaces/doubly-linked-list.js.map

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

package/dist/cjs/{src/interfaces → interfaces}/graph.js.map

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

package/dist/cjs/{src/interfaces → interfaces}/heap.js.map

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/interfaces/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;AAAA,0CAAwB;AACxB,gDAA8B;AAC9B,uDAAqC;AACrC,yCAAuB;AACvB,8CAA4B;AAC5B,mDAAiC;AACjC,iDAA+B;AAC/B,uDAAqC"}

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

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

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

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

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

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

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

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

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

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

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

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"binary-tree.js","sourceRoot":"","sources":["../../../../../src/types/data-structures/binary-tree/binary-tree.ts"],"names":[],"mappings":";;;AAEA;;;;;GAKG;AAEH,IAAY,aAGX;AAHD,WAAY,aAAa;IACvB,wCAAuB,CAAA;IACvB,wCAAuB,CAAA;AACzB,CAAC,EAHW,aAAa,6BAAb,aAAa,QAGxB;AAED,IAAY,cAQX;AARD,WAAY,cAAc;IACxB,+BAAa,CAAA;IACb,+BAAa,CAAA;IACb,iCAAe,CAAA;IACf,yCAAuB,CAAA;IACvB,2CAAyB,CAAA;IACzB,uCAAqB,CAAA;IACrB,uCAAqB,CAAA;AACvB,CAAC,EARW,cAAc,8BAAd,cAAc,QAQzB;AASD,EAAE;AACF,oEAAoE;AACpE,EAAE;AACF,4DAA4D;AAC5D,EAAE;AACF,iDAAiD"}

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

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../../src/types/data-structures/binary-tree/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;AAAA,gDAA8B;AAC9B,wCAAsB;AACtB,6CAA2B;AAC3B,iDAA+B;AAC/B,kDAAgC;AAChC,4CAA0B"}

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

@@ -0,0 +1 @@
+{"version":3,"file":"rb-tree.js","sourceRoot":"","sources":["../../../../../src/types/data-structures/binary-tree/rb-tree.ts"],"names":[],"mappings":";;;AAGA,IAAY,SAA+B;AAA3C,WAAY,SAAS;IAAG,uCAAO,CAAA;IAAE,2CAAS,CAAA;AAAA,CAAC,EAA/B,SAAS,yBAAT,SAAS,QAAsB"}

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

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

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

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

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

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

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

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

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

@@ -0,0 +1,3 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=directed-graph.js.map

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

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

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

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

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

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

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

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

package/dist/cjs/types/data-structures/hash/coordinate-map.js.map

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

package/dist/cjs/types/data-structures/hash/coordinate-set.js.map

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

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

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

package/dist/cjs/types/data-structures/hash/hash-table.js.map

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

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

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

package/dist/cjs/types/data-structures/hash/tree-map.js.map

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

package/dist/cjs/types/data-structures/hash/tree-set.js.map

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

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

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

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

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

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

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

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

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../src/types/data-structures/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;AAAA,gDAA8B;AAC9B,0CAAwB;AACxB,gDAA8B;AAC9B,yCAAuB;AACvB,2CAAyB;AACzB,yCAAuB;AACvB,mDAAiC;AACjC,0CAAwB;AACxB,0CAAwB;AACxB,yCAAuB;AACvB,yCAAuB"}

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

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

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

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

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

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

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

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

package/dist/cjs/types/data-structures/matrix/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../../src/types/data-structures/matrix/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;AAAA,8CAA4B"}

package/dist/cjs/types/data-structures/matrix/matrix.js.map

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

package/dist/cjs/types/data-structures/matrix/matrix2d.js.map

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

package/dist/cjs/types/data-structures/matrix/navigator.js.map

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

package/dist/cjs/types/data-structures/matrix/vector2d.js.map

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

package/dist/cjs/types/data-structures/priority-queue/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../../src/types/data-structures/priority-queue/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;AAAA,mDAAiC;AACjC,uDAAqC;AACrC,uDAAqC"}

package/dist/cjs/types/data-structures/priority-queue/max-priority-queue.js.map

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

package/dist/cjs/types/data-structures/priority-queue/min-priority-queue.js.map

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

package/dist/cjs/types/data-structures/priority-queue/priority-queue.js.map

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

package/dist/cjs/types/data-structures/queue/deque.js.map

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

package/dist/cjs/types/data-structures/queue/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../../src/types/data-structures/queue/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;AAAA,0CAAwB;AACxB,0CAAwB"}

package/dist/cjs/types/data-structures/queue/queue.js.map

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

package/dist/cjs/types/data-structures/stack/index.js.map

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

package/dist/cjs/types/data-structures/stack/stack.js.map

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

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

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

package/dist/cjs/types/data-structures/tree/tree.js.map

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

package/dist/cjs/types/data-structures/trie/index.js.map

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

package/dist/cjs/types/data-structures/trie/trie.js.map

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

package/dist/cjs/types/helpers.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"helpers.js","sourceRoot":"","sources":["../../../src/types/helpers.ts"],"names":[],"mappings":";;;AAMA,IAAY,EAIX;AAJD,WAAY,EAAE;IACZ,eAAS,CAAA;IACT,eAAS,CAAA;IACT,eAAS,CAAA;AACX,CAAC,EAJW,EAAE,kBAAF,EAAE,QAIb"}

package/dist/cjs/types/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/types/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;AAAA,oDAAkC;AAClC,4CAA0B;AAC1B,0CAAwB"}

package/dist/cjs/types/utils/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../src/types/utils/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;AAAA,0CAAwB;AACxB,kDAAgC"}

package/dist/cjs/{src/types → types}/utils/utils.js.map

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

package/dist/cjs/types/utils/validate-type.js.map

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

package/dist/cjs/utils/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/utils/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;AAAA,0CAAwB"}

package/dist/cjs/utils/utils.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"utils.js","sourceRoot":"","sources":["../../../src/utils/utils.ts"],"names":[],"mappings":";;;;;;;;;;;;AASO,MAAM,MAAM,GAAG;IACpB,OAAO,sCAAsC,CAAC,OAAO,CAAC,MAAM,EAAE,UAAU,CAAC;QACvE,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,EAChC,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC;QACrC,OAAO,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;IACxB,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AANW,QAAA,MAAM,UAMjB;AAEK,MAAM,WAAW,GAAG,UAAa,KAAU,EAAE,SAA0D;IAC5G,IAAI,CAAC,GAAG,CAAC,CAAC,EACR,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IACjC,MAAM,MAAM,GAAG,EAAE,CAAC;IAElB,OAAO,EAAE,CAAC,GAAG,GAAG,EAAE;QAChB,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACvB,IAAI,SAAS,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,CAAC,EAAE;YAC9B,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACnB,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;YAC3C,GAAG,EAAE,CAAC;SACP;KACF;IAED,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC;AAfW,QAAA,WAAW,eAetB;AAEW,QAAA,YAAY,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC;AAErC,MAAM,OAAO,GAAG,CAAC,SAAc,EAAE,EAAE;IACxC,OAAO,OAAO,SAAS,KAAK,UAAU,IAAI,SAAS,CAAC,SAAS,KAAK,oBAAY,CAAC;AACjF,CAAC,CAAC;AAFW,QAAA,OAAO,WAElB;AAEK,MAAM,OAAO,GAAG,CAAC,EAAa,EAAS,EAAE;IAC9C,MAAM,KAAK,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;IACzB,KAAK,CAAC,SAAS,GAAG,oBAAY,CAAC;IAC/B,OAAO,KAAK,CAAC;AACf,CAAC,CAAC;AAJW,QAAA,OAAO,WAIlB;AAEK,MAAM,UAAU,GAAG,CAAC,EAAS,EAAE,EAAE;IACtC,MAAM,IAAI,GAAG,CAAC,GAAG,IAA4B,EAAE,EAAE,CAAC,IAAA,eAAO,EAAC,GAAG,EAAE,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;IAE7E,OAAO,MAAM,CAAC,MAAM,CAClB,CAAC,GAAG,IAA4B,EAAE,EAAE;QAClC,IAAI,MAAM,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC;QAEzB,OAAO,IAAA,eAAO,EAAC,MAAM,CAAC,IAAI,OAAO,MAAM,KAAK,UAAU,EAAE;YACtD,MAAM,GAAG,MAAM,EAAE,CAAC;SACnB;QAED,OAAO,MAAM,CAAC;IAChB,CAAC,EACD,EAAC,IAAI,EAAC,CACP,CAAC;AACJ,CAAC,CAAC;AAfW,QAAA,UAAU,cAerB;AAEK,MAAM,eAAe,GAAG,CAAC,EAAc,EAAE,EAAE;IAChD,MAAM,IAAI,GAAG,CAAC,GAAG,IAAiC,EAAE,EAAE,CAAC,IAAA,eAAO,EAAC,GAAG,EAAE,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;IAElF,OAAO,MAAM,CAAC,MAAM,CAClB,CAAO,GAAG,IAAiC,EAAE,EAAE;QAC7C,IAAI,MAAM,GAAG,MAAM,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC;QAE/B,OAAO,IAAA,eAAO,EAAC,MAAM,CAAC,IAAI,OAAO,MAAM,KAAK,UAAU,EAAE;YACtD,MAAM,GAAG,MAAM,MAAM,EAAE,CAAC;SACzB;QAED,OAAO,MAAM,CAAC;IAChB,CAAC,CAAA,EACD,EAAC,IAAI,EAAC,CACP,CAAC;AACJ,CAAC,CAAC;AAfW,QAAA,eAAe,mBAe1B;AAEK,MAAM,MAAM,GAAG,CAAC,KAAa,EAAU,EAAE;IAC9C,IAAI,KAAK,IAAI,CAAC,EAAE;QACd,OAAO,CAAC,CAAC;KACV;IACD,OAAO,CAAC,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;AACvC,CAAC,CAAC;AALW,QAAA,MAAM,UAKjB"}

package/dist/mjs/{src/data-structures → data-structures}/binary-tree/avl-tree.js

@@ -1,6 +1,3 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.AVLTree = exports.AVLTreeNode = void 0;
 /**
  * data-structure-typed
  *
@@ -8,16 +5,15 @@ exports.AVLTree = exports.AVLTreeNode = void 0;
  * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-const bst_1 = require("./bst");
-class AVLTreeNode extends bst_1.BSTNode {
+import { BST, BSTNode } from './bst';
+export class AVLTreeNode extends BSTNode {
     height;
     constructor(key, value) {
         super(key, value);
         this.height = 0;
     }
 }
-exports.AVLTreeNode = AVLTreeNode;
-class AVLTree extends bst_1.BST {
+export class AVLTree extends BST {
     /**
      * This is a constructor function for an AVL tree data structure in TypeScript.
      * @param {AVLTreeOptions} [options] - The `options` parameter is an optional object that can be passed to the
@@ -417,4 +413,3 @@ class AVLTree extends bst_1.BST {
         C && this._updateHeight(C);
     }
 }
-exports.AVLTree = AVLTree;

package/dist/mjs/{src/data-structures → data-structures}/binary-tree/binary-indexed-tree.js

@@ -1,6 +1,3 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.BinaryIndexedTree = void 0;
 /**
  * data-structure-typed
  *
@@ -8,8 +5,8 @@ exports.BinaryIndexedTree = void 0;
  * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-const utils_1 = require("../../utils");
-class BinaryIndexedTree {
+import { getMSB } from '../../utils';
+export class BinaryIndexedTree {
     _freq;
     _max;
     /**
@@ -22,7 +19,7 @@ class BinaryIndexedTree {
         this._freq = frequency;
         this._max = max;
         this._freqMap = { 0: 0 };
-        this._msb = (0, utils_1.getMSB)(max);
+        this._msb = getMSB(max);
         this._negativeCount = frequency < 0 ? max : 0;
     }
     _freqMap;
@@ -271,4 +268,3 @@ class BinaryIndexedTree {
         return left;
     }
 }
-exports.BinaryIndexedTree = BinaryIndexedTree;

package/dist/mjs/{src/data-structures → data-structures}/binary-tree/binary-tree.js

@@ -1,4 +1,3 @@
-"use strict";
 /**
  * data-structure-typed
  *
@@ -6,17 +5,15 @@
  * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.BinaryTree = exports.BinaryTreeNode = void 0;
-const types_1 = require("../../types");
-const utils_1 = require("../../utils");
-const queue_1 = require("../queue");
+import { FamilyPosition, IterationType } from '../../types';
+import { trampoline } from '../../utils';
+import { Queue } from '../queue';
 /**
  * Represents a node in a binary tree.
  * @template V - The type of data stored in the node.
  * @template N - The type of the family relationship in the binary tree.
  */
-class BinaryTreeNode {
+export class BinaryTreeNode {
     /**
      * The key associated with the node.
      */
@@ -79,31 +76,30 @@ class BinaryTreeNode {
     get familyPosition() {
         const that = this;
         if (!this.parent) {
-            return this.left || this.right ? types_1.FamilyPosition.ROOT : types_1.FamilyPosition.ISOLATED;
+            return this.left || this.right ? FamilyPosition.ROOT : FamilyPosition.ISOLATED;
         }
         if (this.parent.left === that) {
-            return this.left || this.right ? types_1.FamilyPosition.ROOT_LEFT : types_1.FamilyPosition.LEFT;
+            return this.left || this.right ? FamilyPosition.ROOT_LEFT : FamilyPosition.LEFT;
         }
         else if (this.parent.right === that) {
-            return this.left || this.right ? types_1.FamilyPosition.ROOT_RIGHT : types_1.FamilyPosition.RIGHT;
+            return this.left || this.right ? FamilyPosition.ROOT_RIGHT : FamilyPosition.RIGHT;
         }
-        return types_1.FamilyPosition.MAL_NODE;
+        return FamilyPosition.MAL_NODE;
     }
 }
-exports.BinaryTreeNode = BinaryTreeNode;
 /**
  * Represents a binary tree data structure.
  * @template N - The type of the binary tree's nodes.
  */
-class BinaryTree {
-    iterationType = types_1.IterationType.ITERATIVE;
+export class BinaryTree {
+    iterationType = IterationType.ITERATIVE;
     /**
      * Creates a new instance of BinaryTree.
      * @param {BinaryTreeOptions} [options] - The options for the binary tree.
      */
     constructor(options) {
         if (options) {
-            const { iterationType = types_1.IterationType.ITERATIVE } = options;
+            const { iterationType = IterationType.ITERATIVE } = options;
             this.iterationType = iterationType;
         }
         this._size = 0;
@@ -151,7 +147,7 @@ class BinaryTree {
      */
     add(keyOrNode, value) {
         const _bfs = (root, newNode) => {
-            const queue = new queue_1.Queue([root]);
+            const queue = new Queue([root]);
             while (queue.size > 0) {
                 const cur = queue.shift();
                 if (newNode && cur.key === newNode.key) {
@@ -284,10 +280,10 @@ class BinaryTree {
             }
             else {
                 const { familyPosition: fp } = curr;
-                if (fp === types_1.FamilyPosition.LEFT || fp === types_1.FamilyPosition.ROOT_LEFT) {
+                if (fp === FamilyPosition.LEFT || fp === FamilyPosition.ROOT_LEFT) {
                     parent.left = curr.right;
                 }
-                else if (fp === types_1.FamilyPosition.RIGHT || fp === types_1.FamilyPosition.ROOT_RIGHT) {
+                else if (fp === FamilyPosition.RIGHT || fp === FamilyPosition.ROOT_RIGHT) {
                     parent.right = curr.right;
                 }
                 needBalanced = parent;
@@ -366,7 +362,7 @@ class BinaryTree {
         beginRoot = this.ensureNotKey(beginRoot);
         if (!beginRoot)
             return -1;
-        if (iterationType === types_1.IterationType.RECURSIVE) {
+        if (iterationType === IterationType.RECURSIVE) {
             const _getMaxHeight = (cur) => {
                 if (!cur)
                     return -1;
@@ -412,7 +408,7 @@ class BinaryTree {
         beginRoot = this.ensureNotKey(beginRoot);
         if (!beginRoot)
             return -1;
-        if (iterationType === types_1.IterationType.RECURSIVE) {
+        if (iterationType === IterationType.RECURSIVE) {
             const _getMinHeight = (cur) => {
                 if (!cur)
                     return 0;
@@ -506,7 +502,7 @@ class BinaryTree {
         if (!beginRoot)
             return [];
         const ans = [];
-        if (iterationType === types_1.IterationType.RECURSIVE) {
+        if (iterationType === IterationType.RECURSIVE) {
             const _traverse = (cur) => {
                 if (callback(cur) === identifier) {
                     ans.push(cur);
@@ -521,7 +517,7 @@ class BinaryTree {
             _traverse(beginRoot);
         }
         else {
-            const queue = new queue_1.Queue([beginRoot]);
+            const queue = new Queue([beginRoot]);
             while (queue.size > 0) {
                 const cur = queue.shift();
                 if (cur) {
@@ -614,10 +610,10 @@ class BinaryTree {
      * @returns The function `getNodeByKey` returns a node (`N`) if a node with the specified key is
      * found in the binary tree. If no node is found, it returns `undefined`.
      */
-    getNodeByKey(key, iterationType = types_1.IterationType.ITERATIVE) {
+    getNodeByKey(key, iterationType = IterationType.ITERATIVE) {
         if (!this.root)
             return undefined;
-        if (iterationType === types_1.IterationType.RECURSIVE) {
+        if (iterationType === IterationType.RECURSIVE) {
             const _dfs = (cur) => {
                 if (cur.key === key)
                     return cur;
@@ -631,7 +627,7 @@ class BinaryTree {
             return _dfs(this.root);
         }
         else {
-            const queue = new queue_1.Queue([this.root]);
+            const queue = new Queue([this.root]);
             while (queue.size > 0) {
                 const cur = queue.shift();
                 if (cur) {
@@ -654,7 +650,7 @@ class BinaryTree {
      * @returns either the node corresponding to the given key if it is a valid node key, or the key
      * itself if it is not a valid node key.
      */
-    ensureNotKey(key, iterationType = types_1.IterationType.ITERATIVE) {
+    ensureNotKey(key, iterationType = IterationType.ITERATIVE) {
         return this.isNodeKey(key) ? this.getNodeByKey(key, iterationType) : key;
     }
     /**
@@ -757,7 +753,7 @@ class BinaryTree {
         beginRoot = this.ensureNotKey(beginRoot);
         if (!beginRoot)
             return beginRoot;
-        if (iterationType === types_1.IterationType.RECURSIVE) {
+        if (iterationType === IterationType.RECURSIVE) {
             const _traverse = (cur) => {
                 if (!this.isRealNode(cur.left))
                     return cur;
@@ -767,7 +763,7 @@ class BinaryTree {
         }
         else {
             // Indirect implementation of iteration using tail recursion optimization
-            const _traverse = (0, utils_1.trampoline)((cur) => {
+            const _traverse = trampoline((cur) => {
                 if (!this.isRealNode(cur.left))
                     return cur;
                 return _traverse.cont(cur.left);
@@ -799,7 +795,7 @@ class BinaryTree {
         beginRoot = this.ensureNotKey(beginRoot);
         if (!beginRoot)
             return beginRoot;
-        if (iterationType === types_1.IterationType.RECURSIVE) {
+        if (iterationType === IterationType.RECURSIVE) {
             const _traverse = (cur) => {
                 if (!this.isRealNode(cur.right))
                     return cur;
@@ -809,7 +805,7 @@ class BinaryTree {
         }
         else {
             // Indirect implementation of iteration using tail recursion optimization
-            const _traverse = (0, utils_1.trampoline)((cur) => {
+            const _traverse = trampoline((cur) => {
                 if (!this.isRealNode(cur.right))
                     return cur;
                 return _traverse.cont(cur.right);
@@ -838,7 +834,7 @@ class BinaryTree {
         beginRoot = this.ensureNotKey(beginRoot);
         if (!beginRoot)
             return true;
-        if (iterationType === types_1.IterationType.RECURSIVE) {
+        if (iterationType === IterationType.RECURSIVE) {
             const dfs = (cur, min, max) => {
                 if (!cur)
                     return true;
@@ -916,7 +912,7 @@ class BinaryTree {
         const ans = [];
         if (!beginRoot)
             return ans;
-        if (iterationType === types_1.IterationType.RECURSIVE) {
+        if (iterationType === IterationType.RECURSIVE) {
             const _traverse = (cur) => {
                 if (cur !== undefined) {
                     ans.push(callback(cur));
@@ -1012,12 +1008,12 @@ class BinaryTree {
      * `false`, null or undefined
      * @returns an array of values that are the return values of the callback function.
      */
-    dfs(callback = this._defaultOneParamCallback, pattern = 'in', beginRoot = this.root, iterationType = types_1.IterationType.ITERATIVE, includeNull = false) {
+    dfs(callback = this._defaultOneParamCallback, pattern = 'in', beginRoot = this.root, iterationType = IterationType.ITERATIVE, includeNull = false) {
         beginRoot = this.ensureNotKey(beginRoot);
         if (!beginRoot)
             return [];
         const ans = [];
-        if (iterationType === types_1.IterationType.RECURSIVE) {
+        if (iterationType === IterationType.RECURSIVE) {
             const _traverse = (node) => {
                 switch (pattern) {
                     case 'in':
@@ -1148,8 +1144,8 @@ class BinaryTree {
         if (!beginRoot)
             return [];
         const ans = [];
-        if (iterationType === types_1.IterationType.RECURSIVE) {
-            const queue = new queue_1.Queue([beginRoot]);
+        if (iterationType === IterationType.RECURSIVE) {
+            const queue = new Queue([beginRoot]);
             const traverse = (level) => {
                 if (queue.size === 0)
                     return;
@@ -1172,7 +1168,7 @@ class BinaryTree {
             traverse(0);
         }
         else {
-            const queue = new queue_1.Queue([beginRoot]);
+            const queue = new Queue([beginRoot]);
             while (queue.size > 0) {
                 const levelSize = queue.size;
                 for (let i = 0; i < levelSize; i++) {
@@ -1225,7 +1221,7 @@ class BinaryTree {
         const levelsNodes = [];
         if (!beginRoot)
             return levelsNodes;
-        if (iterationType === types_1.IterationType.RECURSIVE) {
+        if (iterationType === IterationType.RECURSIVE) {
             const _recursive = (node, level) => {
                 if (!levelsNodes[level])
                     levelsNodes[level] = [];
@@ -1432,7 +1428,7 @@ class BinaryTree {
         if (!node) {
             return;
         }
-        if (this.iterationType === types_1.IterationType.ITERATIVE) {
+        if (this.iterationType === IterationType.ITERATIVE) {
             const stack = [];
             let current = node;
             while (current || stack.length > 0) {
@@ -1594,4 +1590,3 @@ class BinaryTree {
         this._root = v;
     }
 }
-exports.BinaryTree = BinaryTree;