npm - binary-tree-typed - Versions diffs - 2.5.3 → 2.6.0 - Mend

binary-tree-typed 2.5.3 → 2.6.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (61) hide show

package/dist/cjs/index.cjs +126 -0
package/dist/cjs/index.cjs.map +1 -1
package/dist/cjs-legacy/index.cjs +126 -0
package/dist/cjs-legacy/index.cjs.map +1 -1
package/dist/esm/index.mjs +126 -0
package/dist/esm/index.mjs.map +1 -1
package/dist/esm-legacy/index.mjs +126 -0
package/dist/esm-legacy/index.mjs.map +1 -1
package/dist/types/data-structures/base/iterable-element-base.d.ts +17 -0
package/dist/types/data-structures/base/linear-base.d.ts +6 -0
package/dist/types/data-structures/binary-tree/avl-tree.d.ts +36 -0
package/dist/types/data-structures/binary-tree/binary-indexed-tree.d.ts +42 -0
package/dist/types/data-structures/binary-tree/binary-tree.d.ts +75 -0
package/dist/types/data-structures/binary-tree/bst.d.ts +72 -0
package/dist/types/data-structures/binary-tree/red-black-tree.d.ts +57 -0
package/dist/types/data-structures/binary-tree/segment-tree.d.ts +18 -0
package/dist/types/data-structures/binary-tree/tree-map.d.ts +375 -0
package/dist/types/data-structures/binary-tree/tree-multi-map.d.ts +389 -0
package/dist/types/data-structures/binary-tree/tree-multi-set.d.ts +330 -0
package/dist/types/data-structures/binary-tree/tree-set.d.ts +438 -0
package/dist/types/data-structures/graph/directed-graph.d.ts +30 -0
package/dist/types/data-structures/graph/undirected-graph.d.ts +27 -0
package/dist/types/data-structures/hash/hash-map.d.ts +33 -0
package/dist/types/data-structures/heap/heap.d.ts +42 -0
package/dist/types/data-structures/linked-list/doubly-linked-list.d.ts +75 -2
package/dist/types/data-structures/linked-list/singly-linked-list.d.ts +45 -0
package/dist/types/data-structures/linked-list/skip-linked-list.d.ts +54 -0
package/dist/types/data-structures/matrix/matrix.d.ts +24 -0
package/dist/types/data-structures/queue/deque.d.ts +90 -1
package/dist/types/data-structures/queue/queue.d.ts +36 -0
package/dist/types/data-structures/stack/stack.d.ts +30 -0
package/dist/types/data-structures/trie/trie.d.ts +36 -0
package/dist/umd/binary-tree-typed.js +126 -0
package/dist/umd/binary-tree-typed.js.map +1 -1
package/dist/umd/binary-tree-typed.min.js +1 -1
package/dist/umd/binary-tree-typed.min.js.map +1 -1
package/package.json +2 -2
package/src/data-structures/base/iterable-element-base.ts +32 -0
package/src/data-structures/base/linear-base.ts +11 -0
package/src/data-structures/binary-tree/avl-tree.ts +36 -0
package/src/data-structures/binary-tree/binary-indexed-tree.ts +42 -0
package/src/data-structures/binary-tree/binary-tree.ts +75 -0
package/src/data-structures/binary-tree/bst.ts +72 -0
package/src/data-structures/binary-tree/red-black-tree.ts +57 -0
package/src/data-structures/binary-tree/segment-tree.ts +18 -0
package/src/data-structures/binary-tree/tree-map.ts +375 -0
package/src/data-structures/binary-tree/tree-multi-map.ts +392 -0
package/src/data-structures/binary-tree/tree-multi-set.ts +336 -0
package/src/data-structures/binary-tree/tree-set.ts +492 -0
package/src/data-structures/graph/directed-graph.ts +30 -0
package/src/data-structures/graph/undirected-graph.ts +27 -0
package/src/data-structures/hash/hash-map.ts +33 -0
package/src/data-structures/heap/heap.ts +42 -0
package/src/data-structures/linked-list/doubly-linked-list.ts +90 -2
package/src/data-structures/linked-list/singly-linked-list.ts +45 -0
package/src/data-structures/linked-list/skip-linked-list.ts +54 -0
package/src/data-structures/matrix/matrix.ts +24 -0
package/src/data-structures/queue/deque.ts +103 -1
package/src/data-structures/queue/queue.ts +36 -0
package/src/data-structures/stack/stack.ts +30 -0
package/src/data-structures/trie/trie.ts +36 -0

package/src/data-structures/binary-tree/segment-tree.ts CHANGED Viewed

@@ -113,6 +113,9 @@ export class SegmentTree<E = number> implements Iterable<E> {
@@ -192,6 +195,9 @@ export class SegmentTree<E = number> implements Iterable<E> {
@@ -266,6 +272,9 @@ export class SegmentTree<E = number> implements Iterable<E> {
@@ -347,6 +356,9 @@ export class SegmentTree<E = number> implements Iterable<E> {
@@ -404,6 +416,9 @@ export class SegmentTree<E = number> implements Iterable<E> {
@@ -500,6 +515,9 @@ export class SegmentTree<E = number> implements Iterable<E> {

package/src/data-structures/binary-tree/tree-map.ts CHANGED Viewed

@@ -299,6 +299,21 @@ export class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[K, V | u
@@ -497,6 +512,21 @@ export class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[K, V | u
@@ -552,6 +582,18 @@ export class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[K, V | u
@@ -752,6 +794,21 @@ export class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[K, V | u
@@ -961,6 +1018,21 @@ export class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[K, V | u
@@ -1170,6 +1242,21 @@ export class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[K, V | u
@@ -1386,6 +1473,21 @@ export class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[K, V | u
@@ -1576,6 +1678,21 @@ export class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[K, V | u
@@ -1773,6 +1890,21 @@ export class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[K, V | u
@@ -1964,6 +2096,21 @@ export class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[K, V | u
@@ -2159,6 +2306,21 @@ export class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[K, V | u
@@ -2353,6 +2515,21 @@ export class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[K, V | u
@@ -2556,6 +2733,21 @@ export class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[K, V | u
@@ -2755,6 +2947,21 @@ export class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[K, V | u
@@ -2946,6 +3153,21 @@ export class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[K, V | u
@@ -3141,6 +3363,21 @@ export class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[K, V | u
@@ -3337,6 +3574,21 @@ export class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[K, V | u
@@ -3534,6 +3786,21 @@ export class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[K, V | u
@@ -3724,6 +3991,21 @@ export class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[K, V | u
@@ -3790,6 +4072,9 @@ export class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[K, V | u
@@ -3863,6 +4148,9 @@ export class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[K, V | u
@@ -3920,6 +4208,9 @@ export class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[K, V | u
@@ -3981,6 +4272,9 @@ export class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[K, V | u
@@ -4144,6 +4438,18 @@ export class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[K, V | u
@@ -4334,6 +4640,18 @@ export class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[K, V | u
@@ -4508,6 +4826,18 @@ export class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[K, V | u
@@ -4682,6 +5012,18 @@ export class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[K, V | u
@@ -4857,6 +5199,18 @@ export class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[K, V | u
@@ -4975,6 +5329,12 @@ export class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[K, V | u
     * @example
  * // Pagination by position in tree order
  *  const tree = new TreeMap<number>(
@@ -5163,6 +5523,21 @@ export class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[K, V | u