Security News
tea.xyz Spam Plagues npm and RubyGems Package Registries
Tea.xyz, a crypto project aimed at rewarding open source contributions, is once again facing backlash due to an influx of spam packages flooding public package registries.
bintrees
Advanced tools
Readme
This package provides Binary and Red-Black Search Trees written in Javascript. It is released under the MIT License.
Binary Search Trees are a good way to store data in sorted order. A Red-Black tree is a variation of a Binary Tree that balances itself.
Algorithms were taken from Julienne Walker: http://eternallyconfuzzled.com/jsw_home.aspx
node.js:
npm install bintrees
var RBTree = require('bintrees').RBTree;
var tree = new RBTree(function(a, b) { return a - b; });
tree.insert(2);
tree.insert(-3);
see examples/node.js for more info
In the browser:
<script src="/path/to/rbtree.js"></script>
<script>
var tree = new RBTree(function(a, b) { return a - b; });
tree.insert(0);
tree.insert(1);
</script>
see examples/client.html for more info
Requires 1 argument: a comparator function f(a,b) which returns:
0 if a > b
Inserts the item into the tree. Returns true if inserted, false if duplicate.
Removes the item from the tree. Returns true if removed, false if not found.
Number of nodes in the tree.
Removes all nodes from the tree.
Returns node data if found, null otherwise.
Returns an iterator to the node if found, null otherwise.
Returns an iterator to the tree node at or immediately after the item. Returns null-iterator if tree is empty.
NOTE: Changed in version 1.0.0 to match C++ lower_bound
Returns an iterator to the tree node immediately after the item. Returns null-iterator if tree is empty.
NOTE: Changed in version 1.0.0 to match C++ upper_bound
Returns the min node data in the tree, or null if the tree is empty.
Returns the max node data in the tree, or null if the tree is empty.
Calls f on each node's data, in order.
Calls f on each node's data, in reverse order.
Returns a null-iterator. See Iterators section below.
tree.iterator() will return a null-iterator. On a null iterator,
Otherwise,
When iteration reaches the end, the iterator becomes a null-iterator again.
Forward iteration example:
var it=tree.iterator(), item;
while((item = it.next()) !== null) {
// do stuff with item
}
If you are iterating forward through the tree, you can always call prev() to go back, and vice versa.
NOTE: iterators become invalid when you add or remove elements from the tree.
FAQs
Binary Search Trees
The npm package bintrees receives a total of 1,701,426 weekly downloads. As such, bintrees popularity was classified as popular.
We found that bintrees demonstrated a not healthy version release cadence and project activity because the last version was released a year ago. It has 1 open source maintainer collaborating on the project.
Did you know?
Socket for GitHub automatically highlights issues in each pull request and monitors the health of all your open source dependencies. Discover the contents of your packages and block harmful activity before you install or update your dependencies.
Security News
Tea.xyz, a crypto project aimed at rewarding open source contributions, is once again facing backlash due to an influx of spam packages flooding public package registries.
Security News
As cyber threats become more autonomous, AI-powered defenses are crucial for businesses to stay ahead of attackers who can exploit software vulnerabilities at scale.
Security News
UnitedHealth Group disclosed that the ransomware attack on Change Healthcare compromised protected health information for millions in the U.S., with estimated costs to the company expected to reach $1 billion.