FIFO queue in Javascript
JavaScript
58
15
MIT License
This project is a JavaScript implementation of a FIFO (First-In-First-Out) queue using a double linked-list. It provides an efficient, O(1) way to manage a queue with methods for adding, removing, and iterating over elements. It's designed for developers who need a lightweight, performant queue data structure in their Node.js applications.
Total donated
Undistributed
Share with your subscribers:
Recipients
How the donated funds are distributed
Support the dependencies
Support the repos that depend on this repository
Top contributors
Recent events
Kivach works on the Obyte network, and therefore you can track all donations.
No events yet
