English | 简体中文
Here is the Js-sdsl benchmark, where we compare the performance of Js-sdsl and popular data structure libraries on npm.
We saved the test results to the README file of gh-pages, you can also visit here to view.
Fastest known implementation, faster than heap, head-js and other popular libraries.
Faster than yallist.
Three times the performance of denque and nearly equal to Array.push in the case of push elements.
Fastest known implementation.
Inserting, removing and binary search functions are faster than functional-red-black-tree and bintrees.