Huge News!Announcing our $40M Series B led by Abstract Ventures.Learn More
Socket
Sign inDemoInstall
Socket

heap-typed

Package Overview
Dependencies
Maintainers
1
Versions
160
Alerts
File Explorer

Advanced tools

Socket logo

Install Socket

Detect and block malicious and high-risk dependencies

Install

heap-typed - npm Package Compare versions

Comparing version 1.49.7 to 1.49.8

4

dist/data-structures/binary-tree/rb-tree.js

@@ -76,3 +76,3 @@ "use strict";

createTree(options) {
return new RedBlackTree([], Object.assign({ iterationType: this.iterationType, variant: this.variant }, options));
return new RedBlackTree([], Object.assign({ iterationType: this.iterationType }, options));
}

@@ -277,5 +277,5 @@ /**

this._size--;
ans.push({ deleted: z, needBalanced: undefined });
};
helper(this.root);
// TODO
return ans;

@@ -282,0 +282,0 @@ }

@@ -9,2 +9,2 @@ import { RedBlackTree, RedBlackTreeNode } from '../../../data-structures';

export type RedBlackTreeNested<K, V, N extends RedBlackTreeNode<K, V, N>> = RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, RedBlackTree<K, V, N, any>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>;
export type RBTreeOptions<K> = BSTOptions<K> & {};
export type RBTreeOptions<K> = Omit<BSTOptions<K>, 'variant'> & {};
{
"name": "heap-typed",
"version": "1.49.7",
"version": "1.49.8",
"description": "Heap. Javascript & Typescript Data Structure.",

@@ -134,4 +134,4 @@ "main": "dist/index.js",

"dependencies": {
"data-structure-typed": "^1.49.7"
"data-structure-typed": "^1.49.8"
}
}

@@ -109,3 +109,2 @@ /**

iterationType: this.iterationType,
variant: this.variant,
...options

@@ -320,5 +319,5 @@ }) as TREE;

this._size--;
ans.push({ deleted: z, needBalanced: undefined });
};
helper(this.root);
// TODO
return ans;

@@ -325,0 +324,0 @@ }

@@ -10,2 +10,2 @@ import { RedBlackTree, RedBlackTreeNode } from '../../../data-structures';

export type RBTreeOptions<K> = BSTOptions<K> & {};
export type RBTreeOptions<K> = Omit<BSTOptions<K>, 'variant'> & {};

Sorry, the diff of this file is too big to display

Sorry, the diff of this file is too big to display

SocketSocket SOC 2 Logo

Product

  • Package Alerts
  • Integrations
  • Docs
  • Pricing
  • FAQ
  • Roadmap
  • Changelog

Packages

npm

Stay in touch

Get open source security insights delivered straight into your inbox.


  • Terms
  • Privacy
  • Security

Made with ⚡️ by Socket Inc