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

atlas-random

v1.1.0

Published

A set of math utilities for working with random numbers/arrays.

Downloads

4

Readme

atlas-random

A set of math utilities for working with random numbers/arrays.

Travis


install

npm install --save atlas-random

why

I need functions which reliably generate uniformly random samples and shuffles of an array.

examples

get a random int

const { int } = require("atlas-random");

// generates rand int in [0, 100)
const lessThan = 100;
const n = int(lessThan);
console.log(n)
// 38

insert element into random position in array

The element will be inserted, uniformly, into a random index in constant time. If you build up an array from scratch via sequential inserts, its elements will be uniformly distributed along the indices. This method does not necessarily preserve the existing order of other elements in the array.

const { insert } = require("atlas-random");

const arr = ["oh...", "i'm", "afraid", "the", "deflector", "shield", "will", "be"];
insert(arr, "quite")
console.log(arr);
// ["oh...", "i'm", "afraid", "the", "deflector", "quite", "will", "be", shield"]

get a random sample from an array

This is done quickly in linear time. You will not get duplicates, and the resulting elements in the set will be uniformly chosen at random. Elements will not be favored based on their position. If you pass in a size which is greater or equal to the size of the array, you will get back a new array of all of the elements in their original order. For every other case, the order of elements in the returned array is not necessarily uniform. Use the shuffle method if you want to randomly sort an array in-place.

const { sample } = require("atlas-random");

const arr = ["quite", "operational", "when", "your", "friends", "arrive..."];

// gives us a single element
const samp = sample(arr);
console.log(samp)
// "friends"

// gives us a subset with 3 elements
const samp = sample(arr, 3);
console.log(samp)
// ["quite", "your", "when"]

const samp = sample(arr, 66)
// ["quite", "operational", "when", "your", "friends", "arrive..."]

shuffling an array

A uniform shuffle is when you sort the elements randomly and uniformly. You can do this two ways with this library.

using the shuffle method (in-place)

The shuffle method uses the Fisher-Yates shuffle algorithm to shuffle your array in-place, meaning your array will be mutated without creating a new array. It is very fast. If you don't want to damage the original array, you could create a copy of your array (e.g. const copy = [...arr]), then use the shuffle method on the copy.

const { shuffle } = require("atlas-random");

const arr = ["help", "me", "obi-wan", "kenobi", "you’re", "my", "only", "hope"];
shuffle(arr);
console.log(arr);
// ['only', 'kenobi', 'my', 'you’re', 'hope', 'me', 'help', 'obi-wan']

using the insert method

Unlike shuffle, the insert method can uniformly shuffle an array by inserting all of its elements into a new array.

const { insert } = require("atlas-random");

const arr = ["help", "me", "obi-wan", "kenobi", "you’re", "my", "only", "hope"];
const shuffled = [];
for (let w of arr) insert(shuffled, w);
console.log(shuffled);
// [ 'you’re', 'only', 'hope', 'help', 'kenobi', 'my', 'me', 'obi-wan' ]