JSPM

fastqueue

0.1.0
    • ESM via JSPM
    • ES Module Entrypoint
    • Export Map
    • Keywords
    • License
    • Repository URL
    • TypeScript Types
    • README
    • Created
    • Published
    • Downloads 1986
    • Score
      100M100P100Q105060F

    A fast push/shift sync queue

    Package Exports

    • fastqueue

    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 (fastqueue) to support the "exports" field. If that is not possible, create a JSPM override to customize the exports field for this package.

    Readme

    Fast Queue

    While normal JavaScript arrays can be used as FIFO queues, the .shift() call is very slow if the queue gets large because it has to reindex all the remaining items on every shift.

    This library is a fast queue that only implements .push(item), .shift(), .unshift(item) and .length from the Array interface.

    Internally it uses two arrays and cycles them and uses counters so that the .shift() calls are still fast.

    Usage

    var Queue = require('fastqueue');
    
    var q = new Queue;
    q.push(1);
    q.push(2);
    q.push(3);
    var i = 4;
    while (q.length > 0) {
      console.log(q.length, q.shift());
      q.unshift(i++);
      console.log(q.length, q.shift());
      q.push(i++);
      console.log(q.length, q.shift());
    }