{"library":"tiny-queue","type":"library","category":null,"description":"A lightweight FIFO queue implemented as a linked list, avoiding the O(n) cost of Array.shift(). Current version 0.2.1, stable but rarely updated. Differentiator: minimal overhead (~38 lines) for environments where array shift is a bottleneck, such as high-throughput message passing. Not suitable for priority queues or complex data structures.","language":"javascript","status":"maintenance","version":"0.2.1","tags":["javascript","queue","fifo"],"last_verified":"Sun Jun 07","install":[{"cmd":"npm install tiny-queue","imports":["const Queue = require('tiny-queue');","const Queue = require('tiny-queue');\nconst q = new Queue();","const Queue = require('tiny-queue').default || require('tiny-queue');"]},{"cmd":"yarn add tiny-queue","imports":[]},{"cmd":"pnpm add tiny-queue","imports":[]}],"homepage":"https://github.com/nolanlawson/tiny-queue","github":"https://github.com/nolanlawson/tiny-queue","docs":null,"changelog":null,"pypi":null,"npm":"tiny-queue","openapi_spec":null,"status_page":null,"smithery":null,"compatibility":null}