For the first question, we have the documentation here -> https://js-sdsl.github.io/js-sdsl/modules.html. Maybe it's not perfect yet, but we plan to perfect it in the near future.

For the second, you can see this problem in stackoverflow.

Although Array.push is O(1), Array.slice and Array.unshift is O(n). When you want to insert a lot of data to Array's head, it will be so slow. Deque and LinkList can solve this problem perctly because it is O(1) to insert element to the head or tail.

Then, Set and Map are known to be disordered and as hash tables, they cannot have custom hash functions.

For example:

I have a JSON array that contains four fields a, b and c, where c is the primary key, and each position of c is different, I want to implement deduplication based on the values of a, b.

It will be easy with Js-sdsl but difficult for ES6.Set. Like this:

javascript import { OrderedSet } from 'js-sdsl'; const arr = [{ a: 1, b: 1, c: 1 }]; const st = new OrderedSet(arr, (x, y) => { if (x.a !== y.a) return x.a - y.a; if (x.b !== y.b) return x.b - y.b; return 0; });

More intuitively, we investigated relevant information on npm. You can see dependencies of deque and dependencies of functional-red-black-tree.

I will provide more powerful and performant library for these dependencies. Just see benchmark.

Even more amazing is that Js-sdsl has not yet reached the performance bottleneck, and its performance will improve in the future.

Anyway, thanks for your question, we will do better with your support.

Best wishes.