{"library":"double-ended-queue","type":"library","category":null,"description":"Extremely fast double-ended queue (deque) implementation in JavaScript, version 2.1.0-0. Uses a circular buffer for O(1) operations on both ends, including random access via .get(). Outperforms native Array for shift/unshift even with V8's small array optimization. Suitable as stack, queue, or deque. No dependencies. Last release was a pre-release; library may be in maintenance mode.","language":"javascript","status":"maintenance","version":"2.1.0-0","tags":["javascript","data-structure","data-structures","queue","deque","double-ended-queue"],"last_verified":"Sun Jun 07","install":[{"cmd":"npm install double-ended-queue","imports":["import Deque from 'double-ended-queue'","const Deque = require('double-ended-queue')"]},{"cmd":"yarn add double-ended-queue","imports":[]},{"cmd":"pnpm add double-ended-queue","imports":[]}],"homepage":"https://github.com/petkaantonov/deque","github":"git://github.com/petkaantonov/deque","docs":null,"changelog":null,"pypi":null,"npm":"double-ended-queue","openapi_spec":null,"status_page":null,"smithery":null,"compatibility":null}