Echo JS 0.11.0

<~>

kali 10 days ago. link 1 point
This doesn't seem to be O(1) on removing.

Removing sets #shouldArrange which then means a call to #arrange which is clearly not O(1).

The readme file in the repo itself says that it is O(n) in adding and removing and O(1) only in searching.

It also should be mentioned that it needs an additional O(n) space. I mean, if you need a certain structure for performance you most likely need to consider the cost, so I would think this should be mentioned in the readme.
Aro1914 10 days ago. link 1 point
AroTable is a data structure that sorts itself with every manipulation made to it. It runs on the very fast AroSort sorting algorithm, with a Big O Notation of O(n) in adding, but a Big O Notation of O(1) in removing and searching!

Compatible with both client-side and server-side environments.