npm package discovery and stats viewer.

Discover Tips

  • General search

    [free text search, go nuts!]

  • Package details

    pkg:[package-name]

  • User packages

    @[username]

Sponsor

Optimize Toolset

I’ve always been into building performant and accessible sites, but lately I’ve been taking it extremely seriously. So much so that I’ve been building a tool to help me optimize and monitor the sites that I build to make sure that I’m making an attempt to offer the best experience to those who visit them. If you’re into performant, accessible and SEO friendly sites, you might like it too! You can check it out at Optimize Toolset.

About

Hi, 👋, I’m Ryan Hefner  and I built this site for me, and you! The goal of this site was to provide an easy way for me to check the stats on my npm packages, both for prioritizing issues and updates, and to give me a little kick in the pants to keep up on stuff.

As I was building it, I realized that I was actually using the tool to build the tool, and figured I might as well put this out there and hopefully others will find it to be a fast and useful way to search and browse npm packages as I have.

If you’re interested in other things I’m working on, follow me on Twitter or check out the open source projects I’ve been publishing on GitHub.

I am also working on a Twitter bot for this site to tweet the most popular, newest, random packages from npm. Please follow that account now and it will start sending out packages soon–ish.

Open Software & Tools

This site wouldn’t be possible without the immense generosity and tireless efforts from the people who make contributions to the world and share their work via open source initiatives. Thank you 🙏

© 2024 – Pkg Stats / Ryan Hefner

big-shuffle

v1.0.0

Published

Linear-time shuffling of large data sets

Downloads

12

Readme

Big Shuffle

Linear-time shuffling of large datasets for Node.js

About

This package uses the Rao algorithm to shuffle data sets that are too large to fit in memory. The algorithm is described pretty well by Chris Hardin. The input stream is randomly scattered into "piles" which are stored on disk. Then each pile is shuffled in-memory with Fisher-Yates.

If your data set is extremely large, then even your piles may not fit in memory. In that case, the algorithm could recurse until the piles are small enough, but that feature is not yet implemented here.

Limitations / Future Work

Because the input elements are written to disk as part of the shuffle, big-shuffle can only take string data. If you need to shuffle other types of times, serialize them to string first.

Support for shuffling Buffer and Uint8Array objects may be added later if there is demand.

Getting Started

npm install big-shuffle

For TypeScript users:

import { shuffle } from 'big-shuffle';
import * as path from 'path';

const inArray = [];

function *asyncRange(max: number) {
  for (let i = 0; i < max; i++) {
    yield i.toString(10);
  }
}

const shuffled = shuffle(asyncRange(1000000));

for await (const i of shuffled) {
  console.log();
}

This will generate, shuffle, and print a million random numbers.

Should work the same for JavaScript users after a few changes.

API Reference

Async Iterators

function shuffle(
  inStream: AsyncIterable<string>,
  numPiles: number = 1000,  // More piles reduces memory usage but requires more open file descriptors
  pileDir: string = path.join(__dirname, 'shuffle_piles'),  // Filesystem path where the files are located
): Promise<AsyncIterable<string>>;

Note that the shuffled iterable will not yield any records until the input iterable is fully consumed.

Streams


class ShuffleTransform extends stream.Transform{
  constructor(
    numPiles: number = 1000,  // More piles reduces memory usage but requires more open file descriptors
    pileDir: string = path.join(__dirname, 'shuffle_piles'),  // Filesystem path where the files are located
  )
}