Package Exports

parrot-queue

This package does not declare an exports field, so the exports above have been automatically detected and optimized by JSPM instead. If any package subpath is missing, it is recommended to post an issue to the original package (parrot-queue) to support the "exports" field. If that is not possible, create a JSPM override to customize the exports field for this package.

Readme

parrot-queue

An efficient queue in JavaScript. Note that using native arrays as a queue leads to O(n) runtime complexity for dequeuing, because shift takes O(n) in the worst case.

Usage

const ParrotQueue = require("parrot-queue");

const cinemaQueue = ParrotQueue();
cinemaQueue.enqueue('Clara');
cinemaQueue.enqueue('Peter');
cinemaQueue.enqueue('Lisa');
cinemaQueue.enqueue('John');

console.log(cinemaQueue.size()) // "4"

console.log(cinemaQueue.peek()) // "Clara"
console.log(cinemaQueue.dequeue()) // "Clara"
console.log(cinemaQueue.dequeue()) // "Peter"
console.log(cinemaQueue.dequeue()) // "Lisa"
console.log(cinemaQueue.size()) // "1"

Methods

enqueue(object: any): void Adds an object to the queue
size(): number Returns the size of the queue
peek(): any Return most recently added element
dequeue(): any Return most recently added element and delete it from the queue

Runtime complexity

enqueue: O(1)
size: O(1)
dequeue: O(1)
peek: O(1)