The fastest javascript implementation of a double-ended queue. Used by the official Redis, MongoDB, MariaDB & MySQL libraries for Node.js and many other libraries. Maintains compatability with deque.
Extremely fast double-ended queue implementation
Converts an array of items with ids and parent ids to a nested tree in a performant O(n)
way. Runs in browsers and node.