
Security News
vlt Launches "reproduce": A New Tool Challenging the Limits of Package Provenance
vlt's new "reproduce" tool verifies npm packages against their source code, outperforming traditional provenance adoption in the JavaScript ecosystem.
container-avltreelist
Advanced tools
AvlTreeList implementation in Javascript
It's a tree and a list at the same time.
To manage a pool of sorted elements. Complexity in O(log2(n)) for addition and removal. Plus, complexity in O(1) in the best case for repositioning an element after updating its sorting property. This container is best used for managing a list of element sorted when the values of the ordering properties change slowly over time.
To instantiate a new tree:
// In this example, myTree will hold elements sorted by zIndex
function myComparisonFunction(a, b) {
return a.zIndex - b.zIndex;
}
var myTree = new AvlTree(myComparisonFunction);
To add an element:
var myObjectReference = myTree.add(myObject); // O(log2(n))
To remove an element:
myTree.removeByReference(myObjectReference); // O(log2(n))
To apply a treatment on all the elements in sorted ordered:
myTree.forEach(function (object) {
console.log(object);
});
To apply a treatment on all the elements in opposite sorted ordered:
myTree.forEachReverse(function (object) {
console.log(object);
});
To get the smallest element greater or equal to a given object:
var myObjectAbove = myTree.getSmallestAbove({ zIndex: 4 }); // O(log2(n))
To get the greatest element smaller or equal to a given object:
var myObjectBelow = myTree.getGreatestBelow({ zIndex: 4 }); // O(log2(n))
To convert into an array:
var myArray = myTree.toArray(); // O(n)
To get the number of elements in the tree:
var nbElements = myTree.length;
To reposition an element whose sorting property changed:
myObject.zIndex = 9;
myObject._avlTreeListReference = myTree.add(myObject);
myObject.zIndex = 10; // sorting property (here zIndex) of element changed
myTree.reposition(myObject); // repositioning object with respect to new sorting property value
Note 1: reposition
method is in O(1) in the best case, and O(n) in worst case, depending on how much the value of sorting property changed.
Note 2: It is important to attach the object reference on the _avlTreeListReference
property of the object.
FAQs
AvlTreeList implementation in JavaScript
The npm package container-avltreelist receives a total of 0 weekly downloads. As such, container-avltreelist popularity was classified as not popular.
We found that container-avltreelist 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
vlt's new "reproduce" tool verifies npm packages against their source code, outperforming traditional provenance adoption in the JavaScript ecosystem.
Research
Security News
Socket researchers uncovered a malicious PyPI package exploiting Deezer’s API to enable coordinated music piracy through API abuse and C2 server control.
Research
The Socket Research Team discovered a malicious npm package, '@ton-wallet/create', stealing cryptocurrency wallet keys from developers and users in the TON ecosystem.