abaco Abaco an ultra fast number parser for Buffers. It parses a Buffer or a portion of it to get the Number value stored as (ASCII) String.
alice Alice, a simple and performant data structure for bipartite graphs with integer values as vertices.
bice Bice, a tiny module that offers a fast way to swap arbitrary length sequences of bytes within a Buffer, using only the Buffer itself and the bitwise XOR operator.
bilanx β Bilanx, a fast and simplified command queue for Deuces, a minimal Redis client.
bolgia Bolgia an helper module for the config hell. It recursively clones mixes updates and improves configuration objects/hashes with nested properties. '..non ragioniam di lor ma guarda e passa..'
bop Bop, an ultra fast Boyer-Moore parser/matcher optimized for string and buffer patterns (<= 255 bytes), then it is ideal for parsing multipart/form-data streams, that have a pattern / boundary length < ~70 bytes.
brando Brando, is a module to handle pseudo-random sequences/permutations of integers using Buffers.
camphora Camphora a tiny module for NFU (Not Frequently Used) in-memory caching with linear Aging.
cocker Cocker, a socket module to handle reconnection retries.
cucu Cucu a tiny module to schedule repeated execution of (single process) methods/tasks.
piggy Piggy, a minimal wrapper for a single generic-pool of node-postgres clients
qap Qap, a quick parser/matcher optimized for string and buffer patterns (<= 255 bytes).
sermone Sermone a Redis protocol encoder for commands.
shashi Shashi, a simple module to generate, using pseudo-randomness, a universal family/set of hash functions, which produce integer values within the selected range (a prime number)..
spade ♠ Spade, a robust, full-featured, multi-modular Redis client, with offline queue for commands, automatic socket reconnection and command rollback mechanisms for subscriptions, moreover, it supports caching for LUA scripts.
syllabus Σ Syllabus, a collection of helpers mix-ins to encode Redis commands and to decode Redis replies, builded upon Sermone.
toni Toni, a simple and efficient bitmap implementation for positive integer sets (max 32 bits), with no element repetition, using bitwise operations and a Buffer. Modifying a single bit instead of an entire byte, obviously saves 87.5% of Buffer space, but it
train Train a fast (FIFO) queue with a rollback mechanism. Behind the scenes it uses 2 arrays to simulate and perform fast shifting and popping operations without using the Array#shift() method..
vapid Vapid, a vacuous Redis implementation for connection tests, with a fully functional PubSub system for multiple clients.