Santi's Quick Queue

• 🚀 Lightweight and fast^
• 👴 ES3-compliant*
• 💻 Portable between the browser and Node.js
• 📘 Comes with built-in TypeScript definitions

What's this?

This is a simple TypeScript implementation of a queue data structure, where the first item put onto it (enqueued) is the first to be taken out (dequeued).

• Via NPM: npm install @santi100/queue-lib
• Via Yarn: yarn add @santi100/queue-lib
• Via PNPM: pnpm install @santi100/queue-lib

API

• class Queue<T = unknown>; Main class.

  Under construction

Usage

// Hold on, this will be filled someday.

Contribute

Wanna contribute? File an issue or pull request! Look at the contribution instructions and make sure you follow the contribution Code of Conduct.

Disclaimers

*Hasn't been tested in an actual ES3 environment. Feel free to open an issue or pull request if you find any non-ES3 thing. See "Contribute" for instructions on how to do so.

^The source code is just a few kilobytes in size.