ronomon/queue

Stars
9
Rank 1,939,727 (Top 39 %)
Language
JavaScript
License
MIT License
Created over 7 years ago
Updated about 6 years ago

ronomon/queue

ronomon

There are no reviews yet. Be the first to send feedback to the community and the maintainers!

Process thousands of asynchronous or synchronous jobs, concurrently or sequentially, safely and efficiently, without creating thousands of closures.

hash-table

Fast, reliable cuckoo hash table for Node.js.

zip

Robust ZIP decoder with defenses against dangerous compression ratios, spec deviations, malicious archive signatures, mismatching local and central directory headers, ambiguous UTF-8 filenames, directory and symlink traversals, invalid MS-DOS dates, overlapping headers, overflow, underflow, sparseness, accidental buffer bleeds etc.

pure

A static analysis file format checker.

crypto-async

Fast, reliable cipher, hash and hmac methods executed in Node's threadpool for multi-core throughput.

reed-solomon

Fast, reliable Reed-Solomon erasure coding as a native addon for Node.js.

deduplication

Fast multi-threaded content-dependent chunking deduplication for Buffers in C++ with a reference implementation in Javascript. Ships with extensive tests, a fuzz test and a benchmark.

direct-io

Direct IO helpers for block devices and regular files on FreeBSD, Linux, macOS and Windows.

mime

Fast, robust, standards-compliant MIME decoder. Ships with extensive tests and fuzz tests.

utimes

Change the birth time (`btime`), modified time (`mtime`) and/or access time (`atime`) of a file on Windows, macOS and Linux.

base64

Fast, robust Base64 encoder/decoder for Buffers in C++. Ignores whitespace. Detects corruption and truncation. Ships with extensive tests, a fuzz test and a benchmark.

opened

Check if a file is open in another application on Windows, macOS and Linux.

quoted-printable

Fast, robust RFC 2045 (Quoted-Printable) and RFC 2047 (Q-Encoding) encoder/decoder for Buffers in pure Javascript with an optional C++ binding. Avoids intermediary string allocations and regular expressions. Reduces branching through the use of lookup tables.