A javascript standard data structure library which benchmark against C++ STL
English | 简体中文
## ✨ Included data structures - **Stack** - first in last out stack. - **Queue** - first in first out queue. - **PriorityQueue** - heap-implemented priority queue. - **Vector** - protected array, cannot to operate properties like `length` directly. - **LinkList** - linked list of non-contiguous memory addresses. - **Deque** - double-ended-queue, O(1) time complexity to `unshift` or getting elements by index. - **OrderedSet** - sorted set which implemented by red black tree. - **OrderedMap** - sorted map which implemented by red black tree. - **HashSet** - refer to the [polyfill of ES6 Set](https://github.com/rousan/collections-es6). - **HashMap** - refer to the [polyfill of ES6 Map](https://github.com/rousan/collections-es6). ## ⚔️ Benchmark We are benchmarking against other popular data structure libraries. In some ways we're better than the best library. See [benchmark](https://js-sdsl.org/#/test/benchmark-analyze). ## 🖥 Supported platforms
IE / Edge
|
Firefox
|
Chrome
|
Safari
|
Opera
|
NodeJs
|
Edge 12 | 31 | 49 | 10 | 36 | 10 |
Takatoshi Kondo 💻 ⚠️ |
noname 💻 |