rootslab/dado

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..'

Thrank.

Geco, a (Constant Amortized Time) recursive generator* for k-combinations, chosen from a given set S of n elements, with and without replacement.

Auntie, my dear ultra-fast module for untying/splitting/counting a stream of data by a chosen sequence/separator.

Mazz, the fast way of the tonto, to simulate 16 indipendent hash functions, using a crypto digest.

Asino, a stubborn, simple and fast Bloom filter for the rest of us.

Hazz, a pseudo-random-data-filled-table to generate k indipendent and uniform, very fast (non-cryptographic) hash functions.

Nprime, a simple and fast naive module for testing/calculating primes on the fly.

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)..

Brando, is a module to handle pseudo-random sequences/permutations of integers using Buffers.

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.

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 also implies a gain greater than 200% in performances, for accessing values, when it was used with big integer ranges.

♠ Spade, a robust, full-featured, multi-module, Redis client, with offline queue for commands, automatic socket reconnection and command rollback mechanisms for subscriptions, moreover, it supports caching for LUA scripts.

Alice, a simple and performant data structure for bipartite graphs with integer values as vertices.

Mph.