Collection of elements where insert, delete happens only at the ends.
Tiny queue data structure
fast, tiny `queueMicrotask` shim for modern engines
fs-extra contains methods that aren't included in the vanilla Node.js fs package. Such as recursive mkdir, copy, and remove.
A shim for the setImmediate efficient script yielding API
Promise queue with concurrency control
A simple tool to keep requests to be executed in order.
The smallest and simplest JavaScript priority queue
queue-lit is a tiny queue data structure in case you `Array#push()` or `Array#shift()` on large arrays very often
Next tick shim that prefers process.nextTick over queueMicrotask for compat
Promise-based queue
Simple JS queue with auto run for node and browsers
LRU Queue
In memory queue system prioritizing tasks
TypeScript definitions for fs-extra
The fastest javascript implementation of a double-ended queue. Used by the official Redis, MongoDB, MariaDB & MySQL libraries for Node.js and many other libraries. Maintains compatability with deque.
Simple JS queue with auto run for node and browsers
Sequential asynchronous lock-based queue for promises
Fast, in memory work queue
asynchronous function queue with adjustable concurrency
Stealth mode: Applies various techniques to make detection of headless puppeteer harder.
A promise based, dynamic priority queue runner, with concurrency limiting.
Infer strong typings for commander options and action handlers
Extremely fast double-ended queue implementation
Useful extras for Queue Classic
Queue any method in any class or instance with no need for additional Worker class and no extra code
Queue any method in any class or instance with no need for additional Worker class and no extra code
Amazon SQS queue names need to be unique at the account level. This gem implements a simple naming convention of <environment>-<queue-name> to allow your app to have keep track of queues per environment. For the development environment, an extra prefix is added based on your machine's hostname so that multiple developers can work at the same time without stepping on each others' queues.
Proper related posts plugin for Jekyll - uses document correlation matrix on TF-IDF (optionally with Latent Semantic Indexing). Each document is tokenized and stemmed, every word found is treated as keyword for analysis (except for some stop words). TF-IDF matrix for the whole site is calculated (including extra provided weights), then if given accuraccy is lower than 1.0, LSI algorithm is used to compute new simplified vector space. Document correlation matrix is created using dot product of the matrix and its transpose. For each of the post' related documents are inserted into priority queue (sorted by score from document correlation matrix), assuming the score is greater than minimal required score. Selected few bests related posts are retrieven from the queue. Liquid template for each post is rendered and <related-posts /> is replaced with the outcomes of algorithm.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.